A kind of rolling horizon procedures for single-machine sch.duling problem is presented to deal with the incomplete global information at decision time. At each decision time the known information should be sufficient...
详细信息
A kind of rolling horizon procedures for single-machine sch.duling problem is presented to deal with the incomplete global information at decision time. At each decision time the known information should be sufficiently considered while the size of the rolling window on that the sub-problem is based should be limited in order to limit computational cost. The two-level rolling horizon sch.duling strategy is presented to deal with the conflict. The first-level is preliminary sch.duling based on the predictive windows and the second-level is locally sch.duling with terminal penalty based on the rolling windows. The estimated global performance is getting close to the ultimately realized actual cost and getting better and better while the new information is obtained and the decision time is being put forward.
The problem of output feedback robust H∞ control is considered for a family of nonlinear systems with dynamic uncertainties at the input of the plant. By introducing a high-gain observer with tow design parameters, a...
详细信息
The problem of output feedback robust H∞ control is considered for a family of nonlinear systems with dynamic uncertainties at the input of the plant. By introducing a high-gain observer with tow design parameters, a robust output feedback controller is explicitly constructed. The proposed controllers attenuate the disturbance's effect on the output of the closed-loop system to an arbitrary degree of accuracy in the L2-gain sense, and achieve global asymptotic stability in the absence of disturbance.
Hume is a novel domain-specific programming language targeting resource-bounded computations, such as real-time embedded systems or mobile code. It is based on generalised concurrent automata, controlled by transition...
详细信息
Hume is a novel domain-specific programming language targeting resource-bounded computations, such as real-time embedded systems or mobile code. It is based on generalised concurrent automata, controlled by transitions characterised by pattern matching on inputs and (recursive) function generation on outputs. This paper discusses trade-offs between expressibility and decidability in the design of FSM-Hume, a subset of Hume (or Hume layer) based on generalised linear bounded automata with statically determinable time and space use. We illustrate our approach with reference to space costing of a simple real-time simulation of a line-following autonomous vehicle.
In the area of information retrieval, the dimension of document vectors plays an important role. Firstly, with higher index dimensions the indexing structures suffer from the "curse of dimensionality" and th...
详细信息
ISBN:
(纸本)193241536X
In the area of information retrieval, the dimension of document vectors plays an important role. Firstly, with higher index dimensions the indexing structures suffer from the "curse of dimensionality" and their efficiency rapidly decreases. Secondly, we may not use exact words when looking for a document, thus we miss some relevant documents. LSI (Latent Semantic Indexing) is a numerical method, which discovers latent semantic in documents by creating concepts from existing terms. In this article we present a basic method of mapping LSI concepts on given ontology (WordNet), used both for retrieval recall improvement and dimension reduction. We offer experimental results for this method on a subset of TREC collection, consisting of Los Angeles Times articles.
This paper proposes a new switching control method - saturated function series approach - for generating multi-scroll chaotic attractors. The systematic methodology developed here can create multi-scroll chaotic attra...
详细信息
ISBN:
(纸本)0780388739
This paper proposes a new switching control method - saturated function series approach - for generating multi-scroll chaotic attractors. The systematic methodology developed here can create multi-scroll chaotic attractors from a given 3-D linear autonomous system with a saturated function series controller. It includes 1-D n-scroll, 2-D n × m-grid scroll, and 3-D n × m × l-grid scroll chaotic attractors. The chaos generation mechanism in multi-scroll systems is briefly discussed by analyzing the system equilibria.
This paper presents one direction S-rough decision and its decision model and characteristics. One direction S-rough decision is the combination of S-rough decision on (R,F)/sub /spl deg//(X/spl deg/) and S-rough deci...
详细信息
ISBN:
(纸本)0780384032
This paper presents one direction S-rough decision and its decision model and characteristics. One direction S-rough decision is the combination of S-rough decision on (R,F)/sub /spl deg//(X/spl deg/) and S-rough decision on (R,F)/spl deg/(X/spl deg/) ; (R,F)/sub /spl deg//(X/spl deg/), (R,F)/spl deg/(X/spl deg/) are common sets with dynamic characteristics; (R,F)/sub /spl deg//(X/spl deg/), (R,F)/spl deg/(X/spl deg/) are the lower approximation and upper approximation of S-sets (singular sets) X/spl deg//spl sub/U respectively.
We present a description of a system for dynamic alignment of a novel Fourier transform Michelson interferometer which is operating in the near infrared (NIR) band. The technique relies on detection of the phase diffe...
详细信息
ISBN:
(纸本)0780383397
We present a description of a system for dynamic alignment of a novel Fourier transform Michelson interferometer which is operating in the near infrared (NIR) band. The technique relies on detection of the phase difference between four photodetectors mounted around the main detector. The system is controlled by a computer in real time. It uses a position observer to record the mirror position and with a feedback loop corrects the tilt of the moving mirror in the interferometer. This relatively simple system is very effective and can be applied to other scanning optical interferometers.
The purpose of this study was to identify hand factors that change over a five-year period that may be risk factors for the development of functional disability in persons with systemic sclerosis (scleroderma). Sixty ...
The purpose of this study was to identify hand factors that change over a five-year period that may be risk factors for the development of functional disability in persons with systemic sclerosis (scleroderma). Sixty individuals with scleroderma were administered assessments of grip and pinch strength, joint range of motion, and pain, and were observed for the presence of digital ulcers, digital scars, calcium deposits, puffy fingers, and tendon friction rubs. Matched-pairs chi square analyses and Fisher's exact tests were performed to compare variables at year 1 and five years later. Grip and pinch strength increased as did joint motion except for the wrist and thumb carpometacarpal joint. There were also significant increases in the presence of scars, friction rubs, calcium deposits, and puffy fingers. Regression analysis was done to determine which variables predicted functional ability. Only puffy fingers predicted functional disability. In conclusion, hand impairment persisted over time while functional ability decreased.
In this paper we report on the results of a sophisticated and substantial use of PVS to establish a recent result in operational semantics. The result we establish is a context lemma for operational equivalence for ve...
详细信息
In this paper we report on the results of a sophisticated and substantial use of PVS to establish a recent result in operational semantics. The result we establish is a context lemma for operational equivalence for very wide class of programming languages, known as the CIU theorem. The proof uses the annotated holes technique to represent contexts and compute with them. Thus this paper demonstrates that that it is possible to use PVS as a tool in the development of modern operational techniques, and a productive tool at that. The process of formalizing the CIU theorem revealed several gaps in published proof. The proof of the CIU theorem in PVS took approximately six months to develop. The actual machine checked proof involves the proving of around one thousand facts, and takes PVS slightly less than three hours of CPU time running on a Linux machine configured with 2 GBytes of main memory and four 550 MHz Xeon PIII processors.
暂无评论