Fixed point theorems of upper semicontinuous multivalued mappings with applications in hyperconvex metric spaces

In the present paper, we establish two fixed point theorems for upper semicontinuous multivalued mappings in hyperconvex metric spaces and apply these to study coincidence point problems and minimax problems. (C) 2002 Elsevier Science (USA). All rights reserved.

A uniform white-noise model for fixed-point roundoff errors in digital systems

Fixed-point roundoff noise in digital implementation of linear systems arises due to overflow, quantization of coefficients and input signals, and arithmetical errors. In uniform white-noise models, the last two types of roundoff errors are regarded as uniformly distributed independent random vectors on cubes of suitable size. For input signal quantization errors, the heuristic model is justified by a quantization theorem, which cannot be directly applied to arithmetical errors due to the complicated input-dependence of errors. The complete uniform white-noise model is shown to be valid in the sense of weak convergence of probabilistic measures as the lattice step tends to zero if the matrices of realization of the system in the state space satisfy certain nonresonance conditions and the finite-dimensional distributions of the input signal are absolutely continuous.

Structure of the gut contents of Trichogramma australicum Girault (Hymenoptera : Trichogrammatidae) larvae fixed in situ in eggs of its host Helicoverpa armigera (Hubner) (Lepidoptera : Noctuidae)

Trichogramma australicum larvae develop most rapidly in younger eggs of its host, the pest lepidopteran Helicoverpa armigera . To establish how the developmental stage of the host affects the diet of T. australicum , larvae were fixed in situ in eggs of H. armigera of different ages and the structure of the egg contents and parasitoid gut contents examined histologically. Larvae feeding on newly laid host eggs contain primarily yolk particles in their gut, while larvae feeding on older hosts contain necrotic cells and yolk particles. The gut of T. australicum larvae does not contain organised tissue remnants, indicating that larvae feed primarily by sucking food into their pharynx and feed best on a mixture of particulate semisolids in a liquid matrix. Secretory structures of T. australicum larvae that could be involved in modifying the host environment were examined. The hindgut is modified to form an anal vesicle with a number of attributes suggesting that it may be a specialised secretory structure. The paired salivary glands open to the exterior via a common duct.

Dryout phenomena in a three-phase fixed-bed reactor

Understanding the mechanism of liquid-phase evaporation in a three-phase fixed-bed reactor is of practical importance, because the reaction heat is usually 7-10 times the vaporization heat of the liquid components. Evaporation, especially the liquid dryout, can largely influence the reactor performance and even safety. To predict the vanishing condition of the liquid phase, Raoult's law was applied as a preliminary approach, with the liquid vanishing temperature defined based on a liquid flow rate of zero. While providing correct trends, Raoult's law exhibits some limitation in explaining the temperature profile in the reactor. To comprehensively understand the whole process of liquid evaporation, a set of experiments on inlet temperature, catalyst activity, liquid flow rate, gas flow rate, and operation pressure were carried out. A liquid-region length-predicting equation is suggested based on these experiments and the principle of heat balance.

An efficient method for optimal location and sizing of fixed and switched shunt capacitors in large distribution systems

This paper proposes a computationally efficient methodology for the optimal location and sizing of static and switched shunt capacitors in large distribution systems. The problem is formulated as the maximization of the savings produced by the reduction in energy losses and the avoided costs due to investment deferral in the expansion of the network. The proposed method selects the nodes to be compensated, as well as the optimal capacitor ratings and their operational characteristics, i.e. fixed or switched. After an appropriate linearization, the optimization problem was formulated as a large-scale mixed-integer linear problem, suitable for being solved by means of a widespread commercial package. Results of the proposed optimizing method are compared with another recent methodology reported in the literature using two test cases: a 15-bus and a 33-bus distribution network. For the both cases tested, the proposed methodology delivers better solutions indicated by higher loss savings, which are achieved with lower amounts of capacitive compensation. The proposed method has also been applied for compensating to an actual large distribution network served by AES-Venezuela in the metropolitan area of Caracas. A convergence time of about 4 seconds after 22298 iterations demonstrates the ability of the proposed methodology for efficiently handling large-scale compensation problems.

Sraffa on Fixed Capital, Money and the Phases of Capitalism

Copyright © 2014 Taylor & Francis.

Immunohistochemistry in formalin-gel fixed tissues

There are several hazards in histopathology laboratories and its staff must ensure that their professional activity is set to the highest standards while complying with the best safety procedures. Formalin is one of the chemical hazards to which such professionals are routinely exposed. To decrease this contact, it is suggested that 10% neutral buffered liquid formalin (FL) is replaced by 10% formalin-gel (FG), given the later reduces the likelihood of spills and splashes, and decreased fume levels are released during its handling, proving itself less harmful. However, it is mandatory to assess the effectiveness of FG as a fixative and ensure that the subsequent complementary techniques, such as immunohistochemistry (IHC), are not compromised. Two groups of 30 samples from human placenta have been fixed with FG and FL fixatives during different periods of time (12, 24, and 48 hours) and, thereafter, processed, embedded, and sectioned. IHC for six different antibodies was performed and the results were scored (0–100) using an algorithm that took into account immunostaining intensity, percentage of staining structures, non-specific immunostaining, contrast, and morphological preservation. Parametric and non-parametric statistical tests were used (alpha = 0•05). All results were similar for both fixatives, with global score means of 95•36±6•65 for FL and 96•06±5•80 for FG, and without any statistical difference (P>0•05). The duration of the fixation had no statistical relevance also (P>0•05). So it is proved here FG could be an effective alternative to FL.

Evaluating P-NET message's response time with fixed priority queuing at application process level

P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit. In the worst-case, the communication response time can be derived considering that, in each token cycle, all stations use the token to transmit a message. In this paper, we define a more sophisticated P-NET model, which considers the actual token utilisation. We then analyse the possibility of implementing a local priority-based scheduling policy to improve the real-time behaviour of P-NET.

Adding local priority-based dispatching mechanisms to P-NET networks: a fixed priority approach

In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET’s medium access control (MAC) protocol is able to guarantee a bounded access time to message requests. We then propose a model for implementing fixed prioritybased dispatching mechanisms at each master’s application level. In this way, we diminish the impact of the first-come-first-served (FCFS) policy that P-NET uses at the data link layer. The proposed model rises several issues well known within the real-time systems community: message release jitter; pre-run-time schedulability analysis in non pre-emptive contexts; non-independence of tasks at the application level. We identify these issues in the proposed model and show how results available for priority-based task dispatching can be adapted to encompass priority-based message dispatching in P-NET networks.

Extending fixed task-priority schedulability by interference limitation

While the earliest deadline first algorithm is known to be optimal as a uniprocessor scheduling policy, the implementation comes at a cost in terms of complexity. Fixed taskpriority algorithms on the other hand have lower complexity but higher likelihood of task sets being declared unschedulable, when compared to earliest deadline first (EDF). Various attempts have been undertaken to increase the chances of proving a task set schedulable with similar low complexity. In some cases, this was achieved by modifying applications to limit preemptions, at the cost of flexibility. In this work, we explore several variants of a concept to limit interference by locking down the ready queue at certain instances. The aim is to increase the prospects of schedulability of a given task system, without compromising on complexity or flexibility, when compared to the regular fixed task-priority algorithm. As a final contribution, a new preemption threshold assignment algorithm is provided which is less complex and more straightforward than the previous method available in the literature.

Resource sharing in global fixed-priority preemptive multiprocessor scheduling

In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.

Conjecture about global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks: the utilization bound of SM-US(sqrt(2)-1) is sqrt(2)-1

Consider global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks. I conjecture that the utilization bound of SM-US(√2−1) is √2-1.