Modelling co-operation in the design of knowledge production systems: The Made In'Coop method

This paper presents the latest developments of the MadeIn 'Coop method for modelling the human-machine and human-human co-operation process, and an application of this method for the design of a more co-operative version of the C³I System CHEOPS. We first consider that the design of software systems for organizations is tied more and more to the perspective of compound Knowledge Production Systems that link humans and machines engaged in a co-operative problem solving process. After exposing the four principles upon which MadeIn 'Coop rests for modelling co-operation, we present an artificial problem solving dialogue between CHEOPS and its users. Consistent with the Group Cognitive Processes Theory framework, we propose a dialogue analysis according to two complimentary points of view: the Collective Problem Solving model, and the Coordination model. This analysis should help system designers to identify new system functionalities to assist problem solving.(C³I) Command Control Communication Intelligence Systems     

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R ₁×R ₂×???×R _k where R _i (for 1≤i≤k) is a closed interval of the form [a _i ,b _i ] on the real line. For a graph G, its boxicity box?(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a $\lfloor 1+\frac{1}{c}\log n\rfloor^{d-1}An axis-parallel k-dimensional box is a Cartesian product R ₁×R ₂×⋅⋅⋅×R _k where R _i (for 1≤i≤k) is a closed interval of the form [a _i ,b _i ] on the real line. For a graph G, its boxicity box (G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a ?1+\frac1clogn?^d-1\lfloor 1+\frac{1}{c}\log n\rfloor^{d-1} approximation ratio for any constant c≥1 when d≥2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard.     

A 1-Local Asymptotic 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs

In the frequency allocation problem, we are given a mobile telephone network, whose geographical coverage area is divided into cells, wherein phone calls are serviced by assigning frequencies to them so that no two calls emanating from the same or neighboring cells are assigned the same frequency. The problem is to use the frequencies efficiently, i.e., minimize the span of frequencies used. The frequency allocation problem can be regarded as a multicoloring problem on a weighted hexagonal graph. In this paper, we give a 1-local asymptotic 4/3-competitive distributed algorithm for multicoloring a triangle-free hexagonal graph, which is a special case of hexagonal graph. Based on this result, we then propose a 1-local asymptotic13/9-competitive algorithm for multicoloring the (general-case) hexagonal graph, thereby improving the previous 1-local 3/2-competitive algorithm. A preliminary version of this paper appeared in the Proceedings of the 13th Annual International Computing and Combinatorics Conference (COCOON 2007), LNCS 4598, pp. 526–536. Y. Zhang research was supported by European Regional Development Fund (ERDF). F.Y.L. Chin research was supported by Hong Kong RGC Grant HKU-7113/07E. H. Zhu research was supported by National Natural Science Fund (grant #60496321).     

A Visualization Based Approach for Digital Signature Authentication

We propose a visualization based approach for digital signature authentication. Using our method, the speed and pressure aspects of a digital signature process can be clearly and intuitively conveyed to the user for digital signature authentication. Our design takes into account both the expressiveness and aesthetics of the derived visual patterns. With the visual aid provided by our method, digital signatures can be authenticated with better accuracy than using existing methods—even novices can examine the authenticity of a digital signature in most situations using our method. To validate the effectiveness of our method, we conducted a comprehensive user study which confirms positively the advantages of our approach. Our method can be employed as a new security enhancement measure for a range of business and legal applications in reality which involve digital signature authorization and authentication.     

Improved Interface Conditions for 2<Emphasis Type="Italic">D</Emphasis> Domain Decomposition with Corners: Numerical Applications

This article deals with a local improvement of domain decomposition methods for 2-dimensional elliptic problems for which either the geometry or the domain decomposition presents conical singularities. After explaining the main results of the theoretical analysis carried out in Chniti et al. (Calcolo 45, 2008), the numerical experiments presented in this article confirm the optimality properties of the new interface conditions.     

Control of an industrial copper solvent extraction process

A two level control strategy that stabilizes and optimizes the production of an industrial copper solvent extraction process is presented. The stabilizing layer consists of a multi-input–multi-output controller or two single-input–single-output controllers with additional four feedforward compensators that regulate the flow rates in the copper solvent extraction process. The optimization layer consists of an optimizer that maximizes the production of the copper solvent extraction process and gives setpoints to the controllers at the stabilizing level. The mechanistic plant models, verified with industrial data, are linearized by identifying first and higher order transfer function models from simulated PRBS data. On the basis of the linear models, the interactions of the controlled variables, and the pairing of the controlled and manipulated variables are studied and the optimizer and the controllers designed. The control strategy employing two PI-control loops or a model predictive controller and additionally four feedforward control loops is successfully tested against simulated disturbances and setpoint changes. The control strategy is also compared to the data collected from the industrial plant under manual control. With this two level control strategy the production of the copper solvent extraction process is increased by 3–5% and the process variation is decreased by 70–90% compared to the manual operation of the case industrial plant. The results gained in simulation environment are successful and encouraging for further testing in an industrial plant.     

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

This paper addresses the one-machine scheduling problem with earliness-tardiness penalties. We propose a new branch-and-bound algorithm that can solve instances with up to 50 jobs and that can solve problems with even more general non-convex cost functions. The algorithm is based on the combination of a Lagrangean relaxation of resource constraints and new dominance rules.     

Olfactory Responses to Aphid and Host Plant Volatile Releases: (E)-β-Farnesene an Effective Kairomone for the Predator Adalia bipunctata

The volatiles released from several aphid and host plant species, alone or associated, were studied for their infochemical role in prey location. Using a four-arm olfactometer, the attraction of several combinations of three aphid (Myzus persicae, Acyrthosiphon pisum, and Brevicoryne brassicae) and three plant (Vicia faba, Brassica napus, and Sinapis alba) species toward Adalia bipunctata larvae and adults was observed. Both predatory larvae and adults were attracted only by A. pisum and M. persicae when they were crushed, whatever the host plant. (E)-beta-farnesene, the aphid alarm pheromone, was the effective kairomone for the ladybird. Plant leaves alone (V. faba, B. napus, and S. alba) or in association with nonstressed whole aphids (the three species) did not have any attraction for the predator. The B. brassicae specialist aphid is the only prey that was not attracted to A. bipunctata larvae and adults, even if they were crushed. Release of B. brassicae molecules similar to the host plant allelochemicals was demonstrated by GC-MS analysis. The lack of behavioral response of the ladybird at short distance toward the cruciferous specialist aphid was related only to the absence of (E)-beta-farnesene in the aphid prey volatile pattern.     

The prevalence of hepatitis B surface antigen in commercially prepared plasma products

Commercially available lots of plasma derivatives prepared between 1957 and 1975 were tested for hepatitis B surface antigen (HBsAg) by radioimmunoassay. In all, 69 per cent of lots of plasma protein fraction, 40 per cent of factor IX concentrate, 20 per cent of normal serum albumin, 13 per cent of antihemophilic factor, 3 per cent of fibrinogen, and 0.7 per cent of immune serum globulin lots tested were HBsAg-positive. There was great variation in the prevalence of HBsAg-positive lots of each product among the different manufacturers, reflecting not only differences in methods of processing plasma, but also differences in donor populations. Those manufacturers relying upon volunteer donor plasma or placental source material demonstrated lower rates of HBsAg-positive lots of final products than those relying upon commercial donor plasma. There was a marked decrease in the prevalence of positive lots during the period 1971 to 1973, coincident with the onset of routine plasma donor screening for HBsAg. However, current requirements for plasma screening have not resulted in totally HBsAg-free plasma products. Use of more sensitive and more reliable tests for HBsAg will probably reduce contamination of plasma pools with HBsAg to undetectable levels. Despite HBsAg-status, however, the "high-risk" plasma products (fibrinogen, antihemophilic factor, factor IX concentrate) must still be considered capable of transmitting hepatitis and used only with the strictest indications.