Search
displaying 1000 best results Help
Search results for: MINIMUM CYCLE MEAN
-
CELL CYCLE
Journals -
Water Cycle
Journals -
Revalorization of the Szewalski binary vapour cycle
PublicationThe aim of the paper is to revalorizate of the Szewalski binary vapour cycle by analysing thermodynamical and operational parameters of this cycle. This was carried by accessible numerical CFM (Computational Flow Mechanics) codes type, by step-by-step modeling of separates apparatus. The binary vapour cycle is providing steam as the working fluid in the high temperature part of the cycle, while another fluid - a low boiling point...
-
Life cycle theories of savings and consumption
PublicationLife cycle theories of savings and consumption are the economics theories explaining the changes in saving and consumption in the subsequent phases of the human life cycle. There are two main approaches: (1) indicating the dependence of the level of savings and consumption on the average level of income over a long period of human life (life cycle hypothesis; LCH) or (2) on psychological factors, in particular self-control and...
-
Elastic electron scattering by argon in the vicinity of the high-energy critical minimum.
PublicationZostały obliczone różniczkowe przekroje czynne na sprężyste rozpraszanie elektronów na argonie. Przedział energetyczny rozpraszanych elektronów został tak dobrany, aby zbadać położenie tzw. minimum krytycznego.
-
Exergy Losses in the Szewalski Binary Vapor Cycle
PublicationIn this publication, we present an energy and exergy analysis of the Szewalski binary vapor cycle based on a model of a supercritical steam power plant. We used energy analysis to conduct a preliminary optimization of the cycle. Exergy loss analysis was employed to perform a comparison of heat-transfer processes, which are essential for hierarchical cycles. The Szewalski binary vapor cycle consists of a steam cycle bottomed with...
-
Minimum drag shape bodies moving in inviscid fluid - revisited
PublicationThis paper presents the classic approach to minimum drag shape body problem, moving at hypersonic speeds, leading to famous power law shapes with value of the exponent of 3/4. Two- and three-dimensional cases are considered. Furthermore, an exact pseudo solution is given and its uselessness is discussed. Two new solutions are introduced, namely an approximate solution due to form of the functional and solution by means of optimisation...
-
Dedicated scheduling of tasks to minimize mean flow time
PublicationThis paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special cases.
-
No-Wait & No-Idle Open Shop Minimum Makespan Scheduling with Bioperational Jobs
PublicationIn the open shop scheduling with bioperational jobs each job consists of two unit operations with a delay between the end of the first operation and the beginning of the second one. No-wait requirement enforces that the delay between operations is equal to 0. No-idle means that there is no idle time on any machine. We model this problem by the interval incidentor (1, 1)-coloring (IIR(1, 1)-coloring) of a graph with the minimum...
-
Power enhancement of the Brayton cycle by steam utilization
PublicationThe paper presents thermodynamic analysis of the gas-steam unit of the 65 MWe combined heat and power station. Numerical analyses of the station was performed for the nominal operation conditions determining the Brayton and combined cycle. Furthermore, steam utilization for the gas turbine propulsion in the Cheng cycle was analysed. In the considered modernization, steam generated in the heat recovery steam generator unit is directed...
-
Life Cycle Assessment of Analytical Protocols
PublicationLife cycle assessment is a relatively new tool for environmental management, which is becoming more and more important owing to the globalization of the world economy, where there is a need to develop standards in protecting the environment
-
Objective selection of minimum acceptable mesh refinement for EMC simulations
PublicationOptimization of computational electromagnetics (CEM) simulation models can be costly in both time and computing resources. Mesh refinement is a key parameter in determining the number of unknowns to be processed. In turn, this controls the time and memory required for a simulation. Hence, it is important to use only a mesh that is good enough for the objectives of the simulation, whether for direct handling of high-fidelity EM...
-
Hat problem on the cycle C4
PublicationThe topic of our paper is the hat problem. In that problem, each of n people is randomly tted with a blue or red hat. Then everybody can try to guess simultanously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...
-
The complexity of minimum-length path decompositions
PublicationWe consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...
-
Analysis of cell cycle distribution
Open Research DataThe dataset comprehensively details the distribution of A549, H226, and H460 cell lines in various cell cycle phases following treatment with the IC90 concentration of selected anthraquinones. The analysis was performed using the Flowing Software 2.
-
Mean Crossover in evolutionary path planning method for maritime collision avoidance
PublicationAbstract: This paper presents the use of mean crossover genetic operator for path planning using evolutionary algorithm for collision avoidance on sea. Mean crossover ensures widening of the possible solutions' set that can be achieved in comparison to exchange crossover variant. The research shown, that the mean crossover allows to achieve results independent from the initial generation and quicker transition of thealgorithm from...
-
Chapter 7: Engineering Thermodynamics and the Carnot Cycle
PublicationThe chapter presents information about thermodynamics and thermodynamic cycles, especially the history and meaning of Carnot Cycle as well as P-v and T-s Diagrams
-
On the Usefulness of the Generalised Additive Model for Mean Path Loss Estimation in Body Area Networks
PublicationIn this article, the usefulness of the Generalised Additive Model for mean path loss estimation in Body Area Networks is investigated. The research concerns a narrow-band indoor off-body network operating at 2.45 GHz, being based on measurements performed with four different users. The mean path loss is modelled as a sum of four components that depend on path length, antenna orientation angle, absolute difference between transmitting...
-
MEAN SHIFT BASED SEGMENTATION FOR BLEEDING REGIONS IN ENDOSCOPIC VIDEOS
PublicationWith a set of 38 manually marked bleeding regions form endoscopic videos, the authors attempted to find an optimal image segmentation method for reproducing doctor’s markup. Mean shift segmentation combined with HSV histogram segmentation were used as a segmentation method, which was then optimized by tuning the parameters of the method using global optimization algorithm. A target function for measuring the quality of segmentation was...
-
On the Hat Problem on the Cycle C7
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. In this version every player can...