Abstract: This paper investigates a possible practical solution for reasonable oxygen supply during the pluripotent stem cells expansion processes, where the stem cells propagate as aggregates in stirred-suspension bioreactors. Low glucose and low oxygen concentrations are preferred for efficient proliferation of pluripotent stem cells. However, strong oxygen limitation, especially inside of cell aggregates, can lead to cell starvation and death. In this research, the oxygen concentration profile inside of stem cell aggregates in a stem cell expansion process was predicted using a modified oxygen diffusion model. This profile can be realized during the stem cells cultivation process by manipulating the oxygen concentration in inlet gas or inlet gas flow. The proposed approach is relatively simple and may be attractive for installation in a real pluripotent stem cell expansion processes.
Abstract: The objective of this theoretical study is to develop simple design formulas for the prediction of minimum film thickness and maximum mean film temperature rise in lightly loaded high-speed rolling/sliding lubricated elliptical contacts incorporating starvation effect. Herein, the reported numerical analysis focuses on thermoelastohydrodynamically lubricated rolling/sliding elliptical contacts, considering the Newtonian rheology of lubricant for wide range of operating parameters, namely load characterized by Hertzian pressure (PH = 0.01 GPa to 0.10 GPa), rolling speed (>10 m/s), slip parameter (S varies up to 1.0), and ellipticity ratio (k = 1 to 5). Starvation is simulated by systematically reducing the inlet supply. This analysis reveals that influences of load, rolling speed, and level of starvation are significant on the minimum film thickness. However, the maximum mean film temperature rise is strongly influenced by slip in addition to load, rolling speed, and level of starvation. In the presence of starvation, reduction in minimum film thickness and increase in maximum mean film temperature are observed. Based on the results of this study, empirical relations are developed for the prediction of dimensionless minimum film thickness and dimensionless maximum mean film temperature rise at the contacts in terms of various operating parameters.
Abstract: Assembly line balancing problem is aimed to divide
the tasks among the stations in assembly lines and optimize some
objectives. In assembly lines the workload on stations is different
from each other due to different tasks times and the difference in
workloads between stations can cause blockage or starvation in some
stations in assembly lines. Buffers are used to store the semi-finished
parts between the stations and can help to smooth the assembly
production. The assembly line balancing and buffer sizing problem
can affect the throughput of the assembly lines. Assembly line
balancing and buffer sizing problems have been studied separately in
literature and due to their collective contribution in throughput rate of
assembly lines, balancing and buffer sizing problem are desired to
study simultaneously and therefore they are considered concurrently
in current research. Current research is aimed to maximize
throughput, minimize total size of buffers in assembly line and
minimize workload variations in assembly line simultaneously. A
multi objective optimization objective is designed which can give
better Pareto solutions from the Pareto front and a simple example
problem is solved for assembly line balancing and buffer sizing
simultaneously. Current research is significant for assembly line
balancing research and it can be significant to introduce optimization
approaches which can optimize current multi objective problem in
future.
Abstract: Taro Scarab beetles (Papuana uninodis, Coleoptera:
Scarabaeidae) inflict severe damage on important root crops and
plants such as Taro or Cocoyam, yam, sweet potatoes, oil palm and
coffee tea plants across Africa and Asia resulting in economic
hardship and starvation in some nations. Scoliid wasps and
Metarhizium anisopliae fungus - bio-control agents; are shown to be
able to control the population of Scarab beetle adults and larvae using
a newly created simulation model based on non-linear ordinary
differential equations that track the populations of the beetle life
cycle stages: egg, larva, pupa, adult and the population of the scoliid
parasitoid wasps, which attack beetle larvae. In spite of the challenge
driven by the longevity of the scarab beetles, the combined effect of
the larval wasps and the fungal bio-control agent is able to control
and drive down the population of both the adult and the beetle eggs
below the environmental carrying capacity within an interval of 120
days, offering the long term prospect of a stable and eco-friendly
environment; where the population of scarab beetles is: regulated by
parasitoid wasps and beneficial soil saprophytes.
Abstract: This paper provides a flexible way of controlling
Variable-Bit-Rate (VBR) of compressed digital video, applicable to
the new H264 video compression standard. The entire video
sequence is assessed in advance and the quantisation level is then set
such that bit rate (and thus the frame rate) remains within
predetermined limits compatible with the bandwidth of the
transmission system and the capabilities of the remote end, while at
the same time providing constant quality similar to VBR encoding.
A process for avoiding buffer starvation by selectively eliminating
frames from the encoded output at times when the frame rate is slow
(large number of bits per frame) will be also described. Finally, the
problem of buffer overflow will be solved by selectively eliminating
frames from the received input to the decoder. The decoder detects
the omission of the frames and resynchronizes the transmission by
monitoring time stamps and repeating frames if necessary.
Abstract: In an open real-time system environment, the coexistence of different kinds of real-time and non real-time applications makes the system scheduling mechanism face new requirements and challenges. One two-level scheduling scheme of the open real-time systems is introduced, and points out that hard and soft real-time applications are scheduled non-distinctively as the same type real-time applications, the Quality of Service (QoS) cannot be guaranteed. It has two flaws: The first, it can not differentiate scheduling priorities of hard and soft real-time applications, that is to say, it neglects characteristic differences between hard real-time applications and soft ones, so it does not suit a more complex real-time environment. The second, the worst case execution time of soft real-time applications cannot be predicted exactly, so it is not worth while to cost much spending in order to assure all soft real-time applications not to miss their deadlines, and doing that may cause resource wasting. In order to solve this problem, a novel two-level real-time scheduling mechanism (including scheduling profile and scheduling algorithm) which adds the process of dealing with soft real-time applications is proposed. Finally, we verify real-time scheduling mechanism from two aspects of theory and experiment. The results indicate that our scheduling mechanism can achieve the following objectives. (1) It can reflect the difference of priority when scheduling hard and soft real-time applications. (2) It can ensure schedulability of hard real-time applications, that is, their rate of missing deadline is 0. (3) The overall rate of missing deadline of soft real-time applications can be less than 1. (4) The deadline of a non-real-time application is not set, whereas the scheduling algorithm that server 0 S uses can avoid the “starvation" of jobs and increase QOS. By doing that, our scheduling mechanism is more compatible with different types of applications and it will be applied more widely.
Abstract: Due to important issues, such as deadlock, starvation,
communication, non-deterministic behavior and synchronization,
concurrent systems are very complex, sensitive, and error-prone.
Thus ensuring reliability and accuracy of these systems is very
essential. Therefore, there has been a big interest in the formal
specification of concurrent programs in recent years. Nevertheless,
some features of concurrent systems, such as dynamic process
creation, scheduling and starvation have not been specified formally
yet. Also, some other features have been specified partially and/or
have been described using a combination of several different
formalisms and methods whose integration needs too much effort. In
other words, a comprehensive and integrated specification that could
cover all aspects of concurrent systems has not been provided yet.
Thus, this paper makes two major contributions: firstly, it provides a
comprehensive formal framework to specify all well-known features
of concurrent systems. Secondly, it provides an integrated
specification of these features by using just a single formal notation,
i.e., the Z language.
Abstract: All practical real-time scheduling algorithms in multiprocessor systems present a trade-off between their computational complexity and performance. In real-time systems, tasks have to be performed correctly and timely. Finding minimal schedule in multiprocessor systems with real-time constraints is shown to be NP-hard. Although some optimal algorithms have been employed in uni-processor systems, they fail when they are applied in multiprocessor systems. The practical scheduling algorithms in real-time systems have not deterministic response time. Deterministic timing behavior is an important parameter for system robustness analysis. The intrinsic uncertainty in dynamic real-time systems increases the difficulties of scheduling problem. To alleviate these difficulties, we have proposed a fuzzy scheduling approach to arrange real-time periodic and non-periodic tasks in multiprocessor systems. Static and dynamic optimal scheduling algorithms fail with non-critical overload. In contrast, our approach balances task loads of the processors successfully while consider starvation prevention and fairness which cause higher priority tasks have higher running probability. A simulation is conducted to evaluate the performance of the proposed approach. Experimental results have shown that the proposed fuzzy scheduler creates feasible schedules for homogeneous and heterogeneous tasks. It also and considers tasks priorities which cause higher system utilization and lowers deadline miss time. According to the results, it performs very close to optimal schedule of uni-processor systems.