Interactions in the complement-mediated lysis of blood group AB erythrocytes sensitized simultaneously with anti-A and anti-B monoclonal antibodies

The lysis of group AB erythrocytes by human complement was studied by different anti-A and anti-B IgM monoclonal antibodies (mabs) in a 51Cr-release assay. The concentration of membrane-bound immunoglobulin was detected by ELISA, and the amount of C1q and C3 bound to sensitized red cells was measured by using purified, 125I-labelled molecules. We have demonstrated that there is an exponential relationship between the concentration of the sensitizing IgM mabs and C1q binding to the sensitized AB cell. The efficiency of binding was related to the number of antibodies bound; thus, anti-A sensitized cells bound 3-6 times more C1q than anti-B sensitized cells did. AB cells, on the other hand, bound similar amounts of C3 whether anti-A or anti-B was present. The lytic efficiencies of the various IgM mabs during short incubation times were different, suggesting that the complement activation rates vary widely with different antibodies on the AB cell membrane. The binding of C1q to an antibody-sensitized target activates a cascade, whose components may migrate away from the sensitizing antibody; interactions between the activation processes generated by the anti-A and anti-B antibodies may thus occur. Choosing appropriate pairs of anti-A and anti-B mabs for the simultaneous sensitization of AB cells has indeed resulted in stimulation in some and inhibition in other combinations of mabs. It is suggested that stimulation is observed when the activated intermediates are produced in excess, whereas inhibition occurs when a shortage of activated intermediates prevents mutual utilization.     

Application of condition-based HRA method for a manual actuation of the safety features in a nuclear power Plant

A practical approach to develop a more realistic fault-tree model with a consideration of various conditions endured by a human operator is proposed. In safety-critical systems, the generation failure of an actuation signal is caused by the concurrent failures of the automated systems and an operator action. These two sources of safety signals are complicatedly correlated. The failures of sensors or automated systems will cause a lack of necessary information for a human operator and result in error-forcing contexts such as the loss of corresponding alarms and indications. It is well known that the error-forcing contexts largely affect the operator's performance. An automated system which consists of multiple processing channels and complex components is also affected by the availability of the sensors. This paper proposes a condition-based human reliability assessment (CBHRA) method in order to address these complicated conditions in a practical way. We apply the CBHRA method to the manual actuation of the safety features such as a reactor trip and auxiliary feedwater actuation in Korean Standard Nuclear Power Plants. Even the human error probability of each given condition is simply assumed, the application results prove that the CBHRA effectively accommodates the complicated error-forcing contexts into the fault trees.     

A two-stage algorithm for identification of nonlinear dynamic systems

This paper investigates the two-stage stepwise identification for a class of nonlinear dynamic systems that can be described by linear-in-the-parameters models, and the model has to be built from a very large pool of basis functions or model terms. The main objective is to improve the compactness of the model that is obtained by the forward stepwise methods, while retaining the computational efficiency. The proposed algorithm first generates an initial model using a forward stepwise procedure. The significance of each selected term is then reviewed at the second stage and all insignificant ones are replaced, resulting in an optimised compact model with significantly improved performance. The main contribution of this paper is that these two stages are performed within a well-defined regression context, leading to significantly reduced computational complexity. The efficiency of the algorithm is confirmed by the computational complexity analysis, and its effectiveness is demonstrated by the simulation results.     

Directional features in online handwriting recognition

The selection of valuable features is crucial in pattern recognition. In this paper we deal with the issue that part of features originate from directional instead of common linear data. Both for directional and linear data a theory for a statistical modeling exists. However, none of these theories gives an integrated solution to problems, where linear and directional variables are to be combined in a single, multivariate probability density function. We describe a general approach for a unified statistical modeling, given the constraint that variances of the circular variables are small. The method is practically evaluated in the context of our online handwriting recognition system frog on hand and the so-called tangent slope angle feature. Recognition results are compared with two alternative modeling approaches. The proposed solution gives significant improvements in recognition accuracy, computational speed and memory requirements.     

Apollonius tenth problem via radius adjustment and Möbius transformations

The Apollonius Tenth Problem, as defined by Apollonius of Perga circa 200 B.C., has been useful for various applications in addition to its theoretical interest. Even though particular cases have been handled previously, a general framework for the problem has never been reported. Presented in this paper is a theory to handle the Apollonius Tenth Problem by characterizing the spatial relationship among given circles and the desired Apollonius circles. Hence, the given three circles in this paper do not make any assumption regarding on the sizes of circles and the intersection/inclusion relationship among them. The observations made provide an easy-to-code algorithm to compute any desired Apollonius circle which is computationally efficient and robust.     

Complete mobile email management

Years have lapsed since the inauguration of the first Wireless Application Protocol (WAP) application. One of the main reasons for the lukewarm response so far may be attributed to the lack of a “Killer” application. Many companies and developers have attempted to replicate email services (an Internet Killer appplication) within the WAP realm, but till now, no significant success has been reported. This paper will first discuss on the key functions which are lacking in the present WAP-email service, and which are arguably necessary if a much larger user base is to be attracted to these services. A new system will be proposed which can enable the user to send files residing in a remote personal computer (PC) as attachments to his emails using WAP-enabled mobile devices. The implementation of the system will be presented in details. Issue relating to the connection to various types of email servers and the security of the system will also be addressed in the paper.     

On the relationship between squared pairings and plain pairings

In this paper, we investigate the relationship between the squared Weil/Tate pairing and the plain Weil/Tate pairing. Along these lines, we first show that the squared pairing for an arbitrary chosen point can be transformed into the plain pairing for a trace zero point which has a special form to compute them more efficiently. Then the optimizations made for computing squared pairings are combined with the computation of pairings on these trace zero points, to achieve even better performance for the computation of the 4th powered Weil pairing.     

Adaptive boundary control for unstable parabolic PDEs—Part II: Estimation-based designs

The certainty equivalence approach to adaptive control is commonly used with two types of identifiers: passivity-based identifiers and swapping identifiers. The “passive” (also known as “observer-based”) approach is the prevalent identification technique in existing results on adaptive control for PDEs but has so far not been used in boundary control problems. The swapping approach, prevalent in finite-dimensional adaptive control is employed here for the first time in adaptive control of PDEs. For a class of unstable parabolic PDEs we prove a separation principle result for both the passive and swapping identifiers combined with the backstepping boundary controllers. The result is applicable in any dimension. For physical reasons we restrict our attention to dimensions no higher than three. The results of the paper are illustrated by simulations.