Analytical and clinical performance of an automated immunoassay system (Immulite) for estradiol in serum

Mouse strains congenic for individual quantitative trait loci (QTLs) conferring hypnotic sensitivity to ethanol were constructed by backcrossing genotypically selected ILS x ISS N2 individuals to either inbred Long Sleep (ILS) or inbred Short Sleep (ISS) mice. We used a novel "speed congenic" approach in which N2 mice were genotyped for markers flanking each of the five originally identified QTLs. Genotypic selection for ISS regions at four of the five QTLs, and for ILS/ISS at the fifth QTL, allowed rapid fixation of the genetic background. We call this strategy "QTL-Marker-Assisted Counter Selection" or QMACS. By the N4 generation, phenotypic assessments showed that in some sublines the QTL had not been captured; these sublines were discarded and positive lines split to create new replicate sublines. One QTL, on Chromosome (Chr) 8, was not confirmed. At the N8, virtually all sublines on the remaining QTLs retained the phenotypic difference between heterozygotes and ISS homozygotes. Small numbers of interim congenics were produced at the N6 and later generations in which the ILS QTL was made homozygous on the ISS background; as expected, these congenic mice showed an increased sleep time. For later backcrosses (after the N4), the parents were selected on the basis of phenotype as well as genotype. The parent-offspring correlation over all QTLs was significant, supporting the use of phenotypic selection in congenic construction.     

Excess volumes and excess viscosities of binary mixtures of some cyclic ethers + bromocyclohexane at 298.15 and 313.15 K

Excess Volumes,V ^E, and excess viscosities, ^E, at 293.15 and 313.15 K are reported for binary mixtures of some cyclic ethers (tetrahydrofuran, tetrahydropyran, 2-methyltetrahydrofuran and 2,5-dimethyltetrahydrofuran) + bromocyclohexane. These properties were obtained from density and viscosity measurements. ^E and ^E show negatives values for all the mixtures.     

Some questions on the corrosion of steel in concrete—Part I: when,how and how much steel corrodes

It is widely accepted that concrete-embedded steel is in a passive state. However, there are some exceptional circumstances that induce corosion in an active state within concrete structures, thereby severely reducing their durability. This two-part paper analyses some major questions which, however elementary they may be, are still controversial in scientific, technical and economic terms. The first part provides answers to the following questions on the steel/concrete/environment system:

1. How does steel in concrete normally behave?
2. What are the initiating factors for depassivation?
3. What are the effects of corrosion?
4. What is the morphology of corrosion in the active state? and
5. What is the corrosion rate threshold above which the durability of reinforced concrete structures is impaired? The answers to these questions are provided in light of experimental results, most of which were obtained by the authors themselves.

     

On the Planar Piecewise Quadratic 1-Center Problem

In this paper we introduce a minimax model unifying several classes of single facility planar center location problems. We assume that the transportation costs of the demand points to the serving facility are convex functions {Q _i }, i=1,…,n, of the planar distance used. Moreover, these functions, when properly transformed, give rise to piecewise quadratic functions of the coordinates of the facility location. In the continuous case, using results on LP-type models by Clarkson (J. ACM 42:488–499, 1995), Matoušek et al. (Algorithmica 16:498–516, 1996), and the derandomization technique in Chazelle and Matoušek (J. Algorithms 21:579–597, 1996), we claim that the model is solvable deterministically in linear time. We also show that in the separable case, one can get a direct O(nlog n) deterministic algorithm, based on Dyer (Proceedings of the 8th ACM Symposium on Computational Geometry, 1992), to find an optimal solution. In the discrete case, where the location of the center (server) is restricted to some prespecified finite set, we introduce deterministic subquadratic algorithms based on the general parametric approach of Megiddo (J. ACM 30:852–865, 1983), and on properties of upper envelopes of collections of quadratic arcs. We apply our methods to solve and improve the complexity of a number of other location problems in the literature, and solve some new models in linear or subquadratic time complexity.     

An adaptive, real-time, traffic monitoring system

In this paper we describe a computer vision-based traffic monitoring system able to detect individual vehicles in real-time. Our fully integrated system first obtains the main traffic variables: counting, speed and category; and then computes a complete set of statistical variables. The objective is to investigate some of the difficulties impeding existing traffic systems to achieve balanced accuracy in every condition; i.e. day and night transitions, shadows, heavy vehicles, occlusions, slow traffic and congestions. The system we present is autonomous, works for long periods of time without human intervention and adapts automatically to the changing environmental conditions. Several innovations, designed to deal with the above circumstances, are proposed in the paper: an integrated calibration and image rectification step, differentiated methods for day and night, an adaptive segmentation algorithm, a multistage shadow detection method and special considerations for heavy vehicle identification and treatment of slow traffic. A specific methodology has been developed to benchmark the accuracy of the different methods proposed.     

Simultaneous learning of perception and action in mobile robots

One of the main problems of robots is the lack of adaptability and the need for adjustment every time the robot changes its working place. To solve this, we propose a learning approach for mobile robots using a reinforcement-based strategy and a dynamic sensor-state mapping. This strategy, practically parameterless, minimises the adjustments needed when the robot operates in a different environment or performs a different task.Our system will simultaneously learn the state space and the action to execute on each state. The learning algorithm will attempt to maximise the time before a robot failure in order to obtain a control policy suited to the desired behaviour, thus providing a more interpretable learning process. The state representation will be created dynamically, starting with an empty state space and adding new states as the robot finds new situations that has not seen before. A dynamic creation of the state representation will avoid the classic, error-prone and cyclic process of designing and testing an ad hoc representation. We performed an exhaustive study of our approach, comparing it with other classic strategies. Unexpectedly, learning both perception and action does not increase the learning time.     

Semi-formal transformation of secure business processes into analysis class and use case models: An MDA approach

ContextModel-Driven Development (MDD) is an alternative approach for information systems development. The basic underlying concept of this approach is the definition of abstract models that can be transformed to obtain models near implementation. One fairly widespread proposal in this sphere is that of Model Driven Architecture (MDA). Business process models are abstract models which additionally contain key information about the tasks that are being carried out to achieve the company’s goals, and two notations currently exist for modelling business processes: the Unified Modelling Language (UML), through activity diagrams, and the Business Process Modelling Notation (BPMN).ObjectiveOur research is particularly focused on security requirements, in such a way that security is modelled along with the other aspects that are included in a business process. To this end, in earlier works we have defined a metamodel called secure business process (SBP), which may assist in the process of developing software as a source of highly valuable requirements (including very abstract security requirements), which are transformed into models with a lower abstraction level, such as analysis class diagrams and use case diagrams through the approach presented in this paper.MethodWe have defined all the transformation rules necessary to obtain analysis class diagrams and use case diagrams from SBP, and refined them through the characteristic iterative process of the action-research method.ResultsWe have obtained a set of rules and a checklist that make it possible to automatically obtain a set of UML analysis classes and use cases, starting from SBP models. Our approach has additionally been applied in a real environment in the area of the payment of electrical energy consumption.ConclusionsThe application of our proposal shows that our semi-automatic process can be used to obtain a set of useful artifacts for software development processes.