Mathematical and experimental method to obtain the inverse modeling of nonsinusoidal and saturated synchronous reluctance motors

This paper presents new inverse modeling for synchronous reluctance motor (SyRM). This modeling is valid when the inductances are sinusoidal or nonsinusoidal and even when the machine is saturated. This technique involves the generation of constant torque curves as a function of two-phase currents in the Concordia's reference frame when the rotor angle is fixed. We also introduce an experimental method to obtain directly the inverse modeling. This practical method takes into account the saturation of the motor. This technique allows the reduction of the low torque ripple in the case of nonsinusoidal inductances.     

Prebiotic synthesis of sequential peptides on the Hadean beach by a molecular engine working with nitrogen oxides as energy sources

Addressing the still open question of the prebiotic origin of sequential macromolecules (peptides, nucleic acids) on the primitive Earth, we describe a molecular engine (the primary pump), which works at ambient temperature and continuously generates, elongates and complexifies sequential peptides. This new scenario is based on a cyclic reaction sequence, whose keystep is the activation of amino acids into their N‐carboxyanhydrides (NCA) through nitrosation by NOx. This process could have taken place on tidal beaches; it requires a buffered ocean, emerged land and a nitrosating atmosphere. With the help of geochemical studies and computer simulations of atmosphere photochemistry, we show that the primitive Earth during the Hadean may have satisfied all these requirements. © 2001 Society of Chemical Industry.     

Oil yield and compressibility modeling during microscale expression: Criteria for linseed breeding

Seven linseed varieties were harvested at seven times before complete maturity. Microscale oilseed expressions were subsequently carried out on it. A pressure of 10 MPa was applied for 1 h under uniaxial stress. The results were characterized in terms of oil, water and mucilage content, harvest date and oil yield. The piston displacement versus time (creep curves) was described by a four‐Kelvin‐Voigt elements viscoelastic model. Parameters were derived from the model, such as the mechanical properties of seeds (compressibility moduli), showing that the viscoelastic model fits well the experimental data (R² ≈ 0.999). The modeling parameters were combined with some biochemical data in order to predict the kinetics of oil extraction.     

Closed form solution for the sensor registration problem using only position information

Sensors, mounted on the dexterous end of a robot, can be used for feedback control or calibration. When you mount a sensor on a robot it becomes necessary to find the pose (orientation and position) of the sensor relative to the robot. This is the sensor registration problem. Many researchers have provided closed-form solutions to the sensor registration problem; however, the published solutions apply only to sensors that can measure a complete pose (three positions and three orientations). Many sensors, however, can provide only position information; they cannot measure the orientation of an object. This article provides a closed-form solution to the sensor registration problem applicable when: (1) the sensor can provide only position information and (2) the robot can move along and rotate about straight lines. © 1994 John Wiley & Sons, Inc.     

Genetic basis of neurological tumours

Neurological tumours are common neoplasms of both adults and children. Recent studies have begun to delineate the genetic abnormalities that underlie such tumours, and have implicated two classes of genes, oncogenes and tumour suppressor genes. Most investigations have focused on those astrocytomas that affect the cerebral hemispheres of adults, since these are the most common and malignant brain tumours. The high-grade astrocytomas that affect adults, such as glioblastoma multiforme, often have amplification of the epidermal growth factor receptor (EGFR) oncogene and loss of a variety of chromosomal loci that probably harbour tumour suppressor genes. Of the various tumour suppressor gene loci, the p53 gene on chromosome 17p has been studied most closely and has been shown to be mutated in both low- and high-grade astrocytomas. These genetic alterations may provide a means for subdividing astrocytomas into diagnostic categories. For instance, p53 gene mutations occur more commonly in glioblastomas from young adults and women, while EGFR gene amplification is more common in glioblastomas from older adults and men. For the other primary CNS tumours, genetic studies remain in their infancy. The neurocutaneous syndromes, such as neurofibromatosis types 1 and 2, have provided unique insights into neurological oncogenesis. The NF1 gene on chromosomes 17q and its product, neurofibromin, may be important in the formation of neurofibrosarcomas, while the NF2 gene on chromosome 22q and its product, merlin, are probably involved in the formation of schwannomas and other nervous system tumours. The further characterization of these and other neurological tumour genes will undoubtedly illuminate many other areas in neurooncology.     

Incorporating statistical information into expert classification systems to reduce classification costs

Interactive expert systems seek relevant information from a user in order to answer a query or to solve a problem that the user has posed. A fundamental design issue for such a system is therefore itsinformation-seeking strategy, which determines the order in which it asks questions or performs experiments to gain the information that it needs to respond to the user. This paper examines the problem of optimal knowledge acquisition through questioning in contexts where it is expensive or time-consuming to obtain the answers to questions. An abstract model of an expert classification system — considered as a set of logical classification rules supplemented by some statistical knowledge about attribute frequencies — is developed and applied to analyze the complexity and to present constructive algorithms for doing probabilistic question-based classification. New heuristics are presented that generalize previous results for optimal identification keys and questionnaires. For an important class of discrete discriminant analysis problems, these heuristics find optimal or near-optimal questioning strategies in a small fraction of the time required by an exact solution algorithm.     

Algorithms and complexity concerning the preemptive scheduling of periodic,real-time tasks on one processor

We investigate the preemptive scheduling of periodic, real-time task systems on one processor. First, we show that when all parameters to the system are integers, we may assume without loss of generality that all preemptions occur at integer time values. We then assume, for the remainder of the paper, that all parameters are indeed integers. We then give, as our main lemma, both necessary and sufficient conditions for a task system to be feasible on one processor. Although these conditions cannot, in general, be tested efficiently (unless P=NP), they do allow us to give efficient algorithms for deciding feasibility on one processor for certain types of periodic task systems. For example, we give a pseudo-polynomial-time algorithm for synchronous systems whose densities are bounded by a fixed constant less than 1. This algorithm represents an exponential improvement over the previous best algorithm. We also give a polynomial-time algorithm for systems having a fixed number of distinct types of tasks. Furthermore, we are able to use our main lemma to show that the feasibility problem for task systems on one processor is co-NP-complete in the strong sence. In order to show this last result, we first show the Simultaneous Congruences Problem to be NP-complete in the strong sense. Both of these last two results answer questions that have been open for ten years. We conclude by showing that for incomplete task systems, that is, task systems in which the start times are not specified, the feasibility problem is ₂ ^p -complete.This work was supported in part by National Science Foundation Grant No. CCR-8711579. Some of these results were presented at the 15th Symposium on Mathematical Foundations of Computer Science, 1990.