Scheduling algorithm of dual-armed cluster tools with residency time and reentrant constraints

To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating scheduling problems domain of dual-armed cluster tools,a non-integer programming model was set up with a minimizing objective function of the makespan.Combining characteristics of residency time and reentrant constraints,a scheduling algorithm of searching the optimal operation path of dual-armed transport module was presented under many kinds of robotic scheduling paths for dual-armed cluster tools.Finally,the experiments were designed to evaluate the proposed algorithm.The results show that the proposed algorithm is feasible and efficient for obtaining an optimal scheduling solution of dual-armed cluster tools with residency time and reentrant constraints.

Accuracy optimization of virtual iterative reduction algorithm under time constraint

The factors like production accuracy and completion time are the determinants of the optimal scheduling of the complex products work-flow,so the main research direction of modern work-flow technology is how to assure the dynamic balance between the factors.Based on the work-flow technology,restraining the completion time,and analyzing the deficiency of traditional minimum critical path algorithm,a virtual iterative reduction algorithm(VIRA)was proposed,which can improve production accuracy effectively with time constrain.The VIRA with simplification as the core abstracts a virtual task that can predigest the process by combining the complex structures which are cyclic or parallel,finally,by using the virtual task and the other task in the process which is the iterative reduction strategy,determines a path which can make the production accuracy and completion time more balanced than the minimum critical path algorithm.The deadline,the number of tasks,and the number of cyclic structures were used as the factors affecting the performance of the algorithm,changing the influence factors can improve the performance of the algorithm effectively through the analysis of detailed data.Consequently,comparison experiments proved the feasibility of the VIRA.

Missile guidance law design based on free-time convergent error dynamics

To solve the finite-time error-tracking problem in mis-sile guidance,this paper presents a unified design approach through error dynamics and free-time convergence theory.The proposed approach is initiated by establishing a desired model for free-time convergent error dynamics,characterized by its independence from initial conditions and guidance parameters,and adjustable convergence time.This foundation facilitates the derivation of specific guidance laws that integrate constraints such as leading angle,impact angle,and impact time.The theoretical framework of this study elucidates the nuances and synergies between the proposed guidance laws and existing methodologies.Empirical evaluations through simulation comparisons underscore the enhanced accuracy and adaptability of the proposed laws.

A geometric framework for time-dependent mechanical systems with unilateral constraints

The description of modern differential geometry for time-dependent Chetaev nonholonomic mechanical systems with unilateral constraints is studied. By using the structure of exact contact manifold, the geometric framework of time- dependent nonholonomic mechanical systems subject to unilateral nonholonomic constraints and unilateral holonomic constraints respectively is presented.

Stabilization of linear time-varying systems with state and input constraints using convex optimization

The stabilization problem of linear time-varying systems with both state and input constraints is considered. Sufficient conditions for the existence of the solution to this problem are derived and a gain-switched（gain-scheduled） state feedback control scheme is built to stabilize the constrained timevarying system. The design problem is transformed to a series of convex feasibility problems which can be solved efficiently. A design example is given to illustrate the effect of the proposed algorithm.

An intelligent automatic correlation method of oilbearing strata based on pattern constraints:An example of accretionary stratigraphy of Shishen 100 block in Shinan Oilfield of Bohai Bay Basin,East China

Aiming at the problem that the data-driven automatic correlation methods which are difficult to adapt to the automatic correlation of oil-bearing strata with large changes in lateral sedimentary facies and strata thickness,an intelligent automatic correlation method of oil-bearing strata based on pattern constraints is formed.We propose to introduce knowledge-driven in automatic correlation of oil-bearing strata,constraining the correlation process by stratigraphic sedimentary patterns and improving the similarity measuring machine and conditional constraint dynamic time warping algorithm to automate the correlation of marker layers and the interfaces of each stratum.The application in Shishen 100 block in the Shinan Oilfield of the Bohai Bay Basin shows that the coincidence rate of the marker layers identified by this method is over 95.00%,and the average coincidence rate of identified oil-bearing strata reaches 90.02% compared to artificial correlation results,which is about 17 percentage points higher than that of the existing automatic correlation methods.The accuracy of the automatic correlation of oil-bearing strata has been effectively improved.

Zircon and Apatite U-Pb Geochronology and Geochemistry of the Mafic Dykes in the Shuangxiwu Area, Northwestern Zhejiang Province: Constraints on the Initial Time of Neoproterozoic Rifting in South China

Previous studies have shown that there are some ca.770–750 Ma mafic dykes at the western segment of the Neoproterozoic Jiangnan orogen(JO),and they represent post-orogenic magmatism due to orogenic collapse(Wang

Synthesis Scheme for Low Power Designs Under Timing Constraints

To minimize the power consumption with resources operating at multiple voltages a time-constrained algorithm is presented.The input to the scheme is an unscheduled data flow graph (DFG),and timing or resource constraints.Partitioning is considered with scheduling in the proposed algorithm as multiple voltage design can lead to an increase in interconnection complexity at layout level.That is,in the proposed algorithm power consumption is first reduced by the scheduling step,and then the partitioning step takes over to decrease the interconnection complexity.The time-constrained algorithm has time complexity of O(n 2),where n is the number of nodes in the DFG.Experiments with a number of DSP benchmarks show that the proposed algorithm achieves the power reduction under timing constraints by an average of 46 5%.

基于Time Petri Net的实时系统冲撞检测与消解

time Petri net(TPN)在实时控制系统的建模中得到广泛应用,而冲撞是Petri网及其扩展模型的重要行为,解决冲撞是正确分析模型动态行为的关键.由于引入时间约束,使得TPN模型的使能和触发语义比Petri网模型的语义复杂,冲撞的检测及消解变得更加困难.首先根据时间约束,给出了变迁持续使能时延迟区间的计算方法,并证明了该方法的正确性;然后在此基础上定义并证明了TPN模型中冲撞的检测方法;给出了冲撞时间区间及修改时间约束的冲撞消解方法;最后通过实例验证说明了该方法的有效性和正确性.

A hybrid algorithm based on ILP and genetic algorithm for time-aware test case prioritization

To solve the problem of time-awarc test case prioritization,a hybrid algorithm composed of integer linear programming and the genetic algorithm(ILP-GA)is proposed.First,the test case suite which cm maximize the number of covered program entities a d satisfy time constraints is selected by integer linea progamming.Secondly,the individual is encoded according to the cover matrices of entities,and the coverage rate of program entities is used as the fitness function and the genetic algorithm is used to prioritize the selected test cases.Five typical open source projects are selected as benchmark programs.Branch and method are selected as program entities,and time constraint percentages a e 25%and 75%.The experimental results show that the ILP-GA convergence has faster speed and better stability than ILP-additional and IP-total in most cases,which contributes to the detection of software defects as early as possible and reduces the software testing costs.

Implementing Discretionary Access Control with Time Character in Linux and Performance Analysis

DAC （Discretionary Access Control Policy） is access control based on ownership relations between subject and object, the subject can discretionarily decide on that who, by what methods, can access his owns object. In this paper, the system time is looked as a basic secure element. The DAC_T （Discretionary Access Control Policy with Time Character） is presented and formalized. The DAC_T resolves that the subject can discretionarily decide that who, on when, can access his owns objects. And then the DAC_T is implemented on Linux based on GFAC （General Framework for Access Control）, and the algorithm is put forward. Finally, the performance analysis for the DAC T Linux is carried out. It is proved that the DAC T Linux not only can realize time constraints between subject and object but also can still be accepted by us though its performance have been decreased.

控制方向未知的受限多智能体系统的预设时间模糊控制

综合考虑受控制方向未知、输入受限和状态时延影响的有领导者多智能体系统的编队控制问题,设计基于模糊逻辑系统的预设时间一致性控制策略.为了保证编队输出误差在预设时间内满足预定的约束范围要求,引入预设时间性能函数,构造Lyapunov-Krasovskii(L-K)泛函解决状态时延问题,将外界干扰和L-K泛函的导数中的部分项定义为未知非线性函数,并利用模糊逻辑系统对其进行估计,利用Nussbaum函数和均值定理分别处理控制方向未知和输入受限问题,基于以上设计,提出预设时间模糊控制策略,并通过Lyapunov稳定性理论,分析闭环系统的有界稳定性,数值对比仿真和两级化学反应器应用仿真说明控制方法的有效性.

Real Time Study and Related Variables

This paper first, illustrates the advantages of applying real time study to linguistic researches. Second, this paper also compares linguistic variables with linguistic variant; nasality, stronger constraint and weaker constraint have been clearly defined as well.

概念转喻视角下的TIME-away构式研究

一般认为,TIME-away构式是动结构式下的一个子范畴,与动结构式有相似的特征。但实际上该构式和动结构式存在本质上的差异性。文章从句法和语义的角度探讨了TIME-away构式中论元限制条件,进一步得出了构式在转喻识解下的语义值以及准入构式的动词的转喻模式。

Task assignment under constraint of timing sequential for cooperative air combat

According to the previous achievement, the task assignment under the constraint of timing continuity for a cooperative air combat is studied. An extensive task assignment scenario with the background of the cooperative air combat is proposed. The utility and time of executing a task as well as the continuous combat ability are defined. The concept of the matching method of weapon and target is modified based on the analysis of the air combat scenario. The constraint framework is also redefined according to a new objective function. The constraints of timing and continuity are formulated with a new method, at the same time, the task assignment and integer programming models of the cooperative combat are established. Finally, the assignment problem is solved using the integrated linear programming software and the simulation shows that it is feasible to apply this modified model in the cooperative air combat for tasks cooperation and it is also efficient to optimize the resource assignment.

Time-varying Sliding Mode Controls in Rigid Spacecraft Attitude Tracking

To solve the problem of attitude tracking of a rigid spacecraft with an either known or measurable desired attitude trajectory, three types of time-varying sliding mode controls are introduced under consideration of control input constraints. The sliding surfaces of the three types initially pass arbitrary initial values of the system, and then shift or rotate to reach predetermined ones. This way, the system trajectories are always on the sliding surfaces, and the system work is guaranteed to have robustness against parameter uncertainty and external disturbances all the time. The controller parameters are optimized by means of genetic algorithm to minimize the index consisting of the weighted index of squared error （ISE） of the system and the weighted penalty term of violation of control input constraint. The stability is verified with Lyapunov method. Compared with the conventional sliding mode control, simulation results show the proposed algorithm having better robustness against inertia matrix uncertainty and external disturbance torques.

Stability analysis of particle swarm optimization without Lipschitz constraint

There are some adjustable parameters which directly influence the performance and stability of Particle Swarm Optimization algorithm. In this paper, stabilities of PSO with constant parameters and time-varying parameters are analyzed without Lipschitz constraint. Necessary and sufficient stability conditions for acceleration factor P and inertia weight w are presented. Experiments on benchmark functions show the good performance of PSO satisfying the stability condition, even without Lipschitz constraint. And the inertia weight ω value is enhanced to (-1,1). Keywords Lipschitz constraint - Time-varying discrete system - Adaptive acceleration factor - Stability

Broadcast Scheduling Strategy Based on the Priority of Real-Time Data in a Mobile Environment

Data broadcast is an important data dissemination approach in mobile environment. On broadcast channel, scalability and efficiency of data transmission are satisfied. In a mobile environment, there exists a kind of real-time database application in which both the transactions and data can have their timing constraints and priorities of different levels. In order to meet the requirement of real-time data disseminating and retrieving, a broadcast scheduling strategy HPF-ED F (Highest Priority First with Earlier Deadline and Frequency) is proposed under the BoD (Broadcast on Demand) model. Using the strategy, data items are scheduled according to their priority the transaction imposed on them or system set for them. The strategy also considers other characteristics of data items such as deadline and popularity of data. The extensive simulation experiments have been conducted to evaluate the performance of the proposed algorithm. Results show that it can achieve excellent performance compared with existing strategies.

Monitoring time property in time-sensitive LSC

In order to accurately describe the software require- ments and automatically extract property formulas, the time prop- erty of the live sequence chart （LSC） is focused. For the time- sensitive LSC （TLSC）, the formal syntax and semantic are defined by introducing the formal definitions of clock and timing constraints. The main function of the TLSC is to extract the temporal logic formula, so basic rules and combination rules are proposed to translate the TLSC into the universal fragment of computation tree logic （CTL） formula. To improve the efficiency of model check, transitivity is also used to optimize the formula. The optimization method could reduce the size of the formula under the condition of equivalence. Finally, a case study is introduced to illustrate how to establish the TLSC of requirements. In terms of the proposed transformation rules, the time property formula is extracted from the TLSC, and the design model is assured which is consistent with the property formula. The results show that the method with respect to the automatic extraction of the logic formula from the TLSC can efficiently monitor the time property of software systems.

An Evolutionary Real-Time 3D Route Planner for Aircraft

A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time, with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.