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 constrai...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%.展开更多
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 thic...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.展开更多
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 establis...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.展开更多
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 sched...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.展开更多
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 cooperativ...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.展开更多
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
The anti-aircraft system plays an irreplaceable role in modern combat. An anti-aircraft system consists of various types of functional entities interacting to destroy the hostile aircraft moving in high speed. The con...The anti-aircraft system plays an irreplaceable role in modern combat. An anti-aircraft system consists of various types of functional entities interacting to destroy the hostile aircraft moving in high speed. The connecting structure of combat entities in it is of great importance for supporting the normal process of the system. In this paper, we explore the optimizing strategy of the structure of the anti-aircraft network by establishing extra communication channels between the combat entities.Firstly, the thought of combat network model(CNM) is borrowed to model the anti-aircraft system as a heterogeneous network. Secondly, the optimization objectives are determined as the survivability and the accuracy of the system. To specify these objectives, the information chain and accuracy chain are constructed based on CNM. The causal strength(CAST) logic and influence network(IN) are introduced to illustrate the establishment of the accuracy chain. Thirdly, the optimization constraints are discussed and set in three aspects: time, connection feasibility and budget. The time constraint network(TCN) is introduced to construct the timing chain and help to detect the timing consistency. Then, the process of the multi-objective optimization of the structure of the anti-aircraft system is designed.Finally, a simulation is conducted to prove the effectiveness and feasibility of the proposed method. Non-dominated sorting based genetic algorithm-Ⅱ(NSGA2) is used to solve the multiobjective optimization problem and two other algorithms including non-dominated sorting based genetic algorithm-Ⅲ(NSGA3)and strength Pareto evolutionary algorithm-Ⅱ(SPEA2) are employed as comparisons. The deciders and system builders can make the anti-aircraft system improved in the survivability and accuracy in the combat reality.展开更多
A real-time dwell scheduling model, which takes the time and energy constraints into account is founded from the viewpoint of scheduling gain. Scheduling design is turned into a nonlinear programming procedure. The re...A real-time dwell scheduling model, which takes the time and energy constraints into account is founded from the viewpoint of scheduling gain. Scheduling design is turned into a nonlinear programming procedure. The real-time dwell scheduling algorithm based on the scheduling gain is presented with the help of two heuristic rules. The simulation results demonstrate that compared with the conventional adaptive scheduling method, the algorithm proposed not only increases the scheduling gain and the time utility but also decreases the task drop rate.展开更多
According to the signal processing characteristic of MIMO radars,an adaptive dwell scheduling algorithm is proposed.It is based on a novel pulse interleaving technique,which makes full use of transmitting,waiting and ...According to the signal processing characteristic of MIMO radars,an adaptive dwell scheduling algorithm is proposed.It is based on a novel pulse interleaving technique,which makes full use of transmitting,waiting and receiving durations of radar dwells.The utilization of transmitting duration is unique for MIMO radars and is realized through transmitting duration overlapping.Simulation results show that,compared with the conventional scheduling algorithm,the scheduling performance of MIMO radars can be improved effectively by the proposed algorithm,and the scheduling rule can be chosen arbitrarily when using the proposed algorithm.展开更多
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...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.展开更多
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. I...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.展开更多
Three-axis stabilized Fengyun-4 （FY-4） satellite scries is the new generation of geostationary meteorological satellite in China. The ob-servation flexibility brought by three-axis stabilization makes it possible to...Three-axis stabilized Fengyun-4 （FY-4） satellite scries is the new generation of geostationary meteorological satellite in China. The ob-servation flexibility brought by three-axis stabilization makes it possible to design different observation modes for different targets. Important observation modes of the Advanced Geosynchronous Radiation Imager （AGRI）, the core instrument onboard FY-4A, are presented, from the earth obser- vation, navigation and calibration perspective. As the time consumed in full disk and hemisphere observations exceed the time limitation, different region segmentation methods are proposed. Results show the methods are effective, and the full disk as well as hemisphere observations can both be accomplished in the given time. Finally the three-region segmentation method and two-region segmentation method are chosen for full disk and hemisphere observations, respectively, in view of the observation instructions＇ complexity as well as the time consuming. The research results paved the way for the core instrument＇s daily operation, and have been used in FY-4A in-orbit test.展开更多
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 re...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.展开更多
Requirements elicitation is a fundamental phase of software development in which an analyst discovers the needs of different stakeholders and transforms them into requirements.This phase is cost-and time-intensive,and...Requirements elicitation is a fundamental phase of software development in which an analyst discovers the needs of different stakeholders and transforms them into requirements.This phase is cost-and time-intensive,and a project may fail if there are excessive costs and schedule overruns.COVID-19 has affected the software industry by reducing interactions between developers and customers.Such a lack of interaction is a key reason for the failure of software projects.Projects can also fail when customers do not know precisely what they want.Furthermore,selecting the unsuitable elicitation technique can also cause project failure.The present study,therefore,aimed to identify which requirements elicitation technique is the most cost-effective for large-scale projects when time to market is a critical issue or when the customer is not available.To that end,we conducted a systematic literature review on requirements elicitation techniques.Most primary studies identified introspection as the best technique,followed by survey and brainstorming.This finding suggests that introspection should be the first choice of elicitation technique,especially when the customer is not available or the project has strict time and cost constraints.Moreover,introspection should also be used as the starting point in the elicitation process of a large-scale project,and all known requirements should be elicited using this technique.展开更多
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 for...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.展开更多
Quality of Service (QoS) in Wireless Sensor Networks (WSNs) is a challenging area of research because of the limited availability of resources in WSNs. The resources in WSNs are processing power, memory, bandwidth, en...Quality of Service (QoS) in Wireless Sensor Networks (WSNs) is a challenging area of research because of the limited availability of resources in WSNs. The resources in WSNs are processing power, memory, bandwidth, energy, communication capacity, etc. Delay is an important QoS parameter for delivery of delay sensitive data in a time constraint sensor network environment. In this paper, an extended version of a delay aware routing protocol for WSNs is presented along with its performance comparison with different deployment scenarios of sensor nodes, taking IEEE802.15.4 as the underlying MAC protocol. The performance evaluation of the protocol is done by simulation using ns-2 simulator.展开更多
In this paper, we study a class of Prigozhin equation for growing sandpile problem subject to local and a non-local boundary condition. The problem is a generalized model for a growing sandpile problem with Neumann bo...In this paper, we study a class of Prigozhin equation for growing sandpile problem subject to local and a non-local boundary condition. The problem is a generalized model for a growing sandpile problem with Neumann boundary condition (see <a href="#ref1">[1]</a>). By the semi-group theory, we prove the existence and uniqueness of the solution for the model and thanks to a duality method we do the numerical analysis of the problem. We finish our work by doing numerical simulations to validate our theoretical results.展开更多
Redundant via （RV） insertion is a useful mechanism to enhance via reliability. However, when extra vias are inserted into the design, the circuit timing might be changed. Therefore, how to insert RV under the timing...Redundant via （RV） insertion is a useful mechanism to enhance via reliability. However, when extra vias are inserted into the design, the circuit timing might be changed. Therefore, how to insert RV under the timing constraints is the main challenge. In this paper, we introduce a new model to compute the distance between a RV and the corresponding single via, put forward a new RV type, which is called the long length via （LLV）, and then present an improved RV insertion method considering the timing constraints. This computing model can certify that the timing, which is obtained aider inserting a RV, is not greater than the original timing. Meanwhile, the new RV type LLV can increase the possibility of RV insertion; this method provides a global perspective for the RV insertion. Considering the timing constraints, the total redundant via insertion rate is 85.38% in the MIS-based method, while our proposed method can obtain a high insertion rate 88.79% for the tested circuits.展开更多
Timing constraint Petri nets (TCPNs) can be used to model a real-time system specification and to verify the timing behavior of the system. This paper describes the limitations of the reachability analysis method in ...Timing constraint Petri nets (TCPNs) can be used to model a real-time system specification and to verify the timing behavior of the system. This paper describes the limitations of the reachability analysis method in analyzing complex systems for existing TCPNs. Based on further research on the schedulability analysis method with various topology structures, a more general state reachability analysis method is proposed. To meet various requirements of timely response for actual systems, this paper puts forward a heuristic method for selecting decision-spans of transitions and develops a heuristic algorithm for schedulability analysis of TCPNs. Examples are given showing the practicality of the method in the schedulability analysis for real-time systems with various structures.展开更多
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 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.展开更多
文摘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%.
基金Supported by the National Natural Science Foundation of China(42272110)CNPC-China University of Petroleum(Beijing)Strategic Cooperation Project(ZLZX2020-02).
文摘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.
基金supported by the National Natural Science Foundation of China(12002370).
文摘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.
基金Projects(7107111561273035)supported by the National Natural Science Foundation of China
文摘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.
基金supported by the National Natural Science Foundation of China（61472441）
文摘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.
文摘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
基金supported by the National Natural Science Foundation of China(72071206).
文摘The anti-aircraft system plays an irreplaceable role in modern combat. An anti-aircraft system consists of various types of functional entities interacting to destroy the hostile aircraft moving in high speed. The connecting structure of combat entities in it is of great importance for supporting the normal process of the system. In this paper, we explore the optimizing strategy of the structure of the anti-aircraft network by establishing extra communication channels between the combat entities.Firstly, the thought of combat network model(CNM) is borrowed to model the anti-aircraft system as a heterogeneous network. Secondly, the optimization objectives are determined as the survivability and the accuracy of the system. To specify these objectives, the information chain and accuracy chain are constructed based on CNM. The causal strength(CAST) logic and influence network(IN) are introduced to illustrate the establishment of the accuracy chain. Thirdly, the optimization constraints are discussed and set in three aspects: time, connection feasibility and budget. The time constraint network(TCN) is introduced to construct the timing chain and help to detect the timing consistency. Then, the process of the multi-objective optimization of the structure of the anti-aircraft system is designed.Finally, a simulation is conducted to prove the effectiveness and feasibility of the proposed method. Non-dominated sorting based genetic algorithm-Ⅱ(NSGA2) is used to solve the multiobjective optimization problem and two other algorithms including non-dominated sorting based genetic algorithm-Ⅲ(NSGA3)and strength Pareto evolutionary algorithm-Ⅱ(SPEA2) are employed as comparisons. The deciders and system builders can make the anti-aircraft system improved in the survivability and accuracy in the combat reality.
文摘A real-time dwell scheduling model, which takes the time and energy constraints into account is founded from the viewpoint of scheduling gain. Scheduling design is turned into a nonlinear programming procedure. The real-time dwell scheduling algorithm based on the scheduling gain is presented with the help of two heuristic rules. The simulation results demonstrate that compared with the conventional adaptive scheduling method, the algorithm proposed not only increases the scheduling gain and the time utility but also decreases the task drop rate.
基金supported by the National Natural Science Foundation of China(6110117161032010)
文摘According to the signal processing characteristic of MIMO radars,an adaptive dwell scheduling algorithm is proposed.It is based on a novel pulse interleaving technique,which makes full use of transmitting,waiting and receiving durations of radar dwells.The utilization of transmitting duration is unique for MIMO radars and is realized through transmitting duration overlapping.Simulation results show that,compared with the conventional scheduling algorithm,the scheduling performance of MIMO radars can be improved effectively by the proposed algorithm,and the scheduling rule can be chosen arbitrarily when using the proposed algorithm.
基金The Natural Science Foundation of Education Ministry of Shaanxi Province(No.15JK1672)the Industrial Research Project of Shaanxi Province(No.2017GY-092)Special Fund for Key Discipline Construction of General Institutions of Higher Education in Shaanxi Province
文摘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.
基金Supported by the National 863 Broad Band VPN Project (No.863-104-03-01)
文摘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.
基金Supported by Tsinghua University Horizontal Project(412412)National Natural Science Foundation of China(91338109,61172113)
文摘Three-axis stabilized Fengyun-4 （FY-4） satellite scries is the new generation of geostationary meteorological satellite in China. The ob-servation flexibility brought by three-axis stabilization makes it possible to design different observation modes for different targets. Important observation modes of the Advanced Geosynchronous Radiation Imager （AGRI）, the core instrument onboard FY-4A, are presented, from the earth obser- vation, navigation and calibration perspective. As the time consumed in full disk and hemisphere observations exceed the time limitation, different region segmentation methods are proposed. Results show the methods are effective, and the full disk as well as hemisphere observations can both be accomplished in the given time. Finally the three-region segmentation method and two-region segmentation method are chosen for full disk and hemisphere observations, respectively, in view of the observation instructions＇ complexity as well as the time consuming. The research results paved the way for the core instrument＇s daily operation, and have been used in FY-4A in-orbit test.
基金the National Natural Science Foundation of China(60073045)
文摘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.
基金funding this work through research group no.RG-1441-490.
文摘Requirements elicitation is a fundamental phase of software development in which an analyst discovers the needs of different stakeholders and transforms them into requirements.This phase is cost-and time-intensive,and a project may fail if there are excessive costs and schedule overruns.COVID-19 has affected the software industry by reducing interactions between developers and customers.Such a lack of interaction is a key reason for the failure of software projects.Projects can also fail when customers do not know precisely what they want.Furthermore,selecting the unsuitable elicitation technique can also cause project failure.The present study,therefore,aimed to identify which requirements elicitation technique is the most cost-effective for large-scale projects when time to market is a critical issue or when the customer is not available.To that end,we conducted a systematic literature review on requirements elicitation techniques.Most primary studies identified introspection as the best technique,followed by survey and brainstorming.This finding suggests that introspection should be the first choice of elicitation technique,especially when the customer is not available or the project has strict time and cost constraints.Moreover,introspection should also be used as the starting point in the elicitation process of a large-scale project,and all known requirements should be elicited using this technique.
基金supported by the National Natural Science Foundation of China(61202351)the China Postdoctoral Science Foundation(2011M500124)+1 种基金the Fundamental Research Funds for the Nanjing University of Aeronautics and Astronautics(NS2012133)the Funding of Jiangsu Innovation Program for Graduate Education and the Fundamental Research Funds for the Central Universities(CXLX12 0161)
文摘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.
文摘Quality of Service (QoS) in Wireless Sensor Networks (WSNs) is a challenging area of research because of the limited availability of resources in WSNs. The resources in WSNs are processing power, memory, bandwidth, energy, communication capacity, etc. Delay is an important QoS parameter for delivery of delay sensitive data in a time constraint sensor network environment. In this paper, an extended version of a delay aware routing protocol for WSNs is presented along with its performance comparison with different deployment scenarios of sensor nodes, taking IEEE802.15.4 as the underlying MAC protocol. The performance evaluation of the protocol is done by simulation using ns-2 simulator.
文摘In this paper, we study a class of Prigozhin equation for growing sandpile problem subject to local and a non-local boundary condition. The problem is a generalized model for a growing sandpile problem with Neumann boundary condition (see <a href="#ref1">[1]</a>). By the semi-group theory, we prove the existence and uniqueness of the solution for the model and thanks to a duality method we do the numerical analysis of the problem. We finish our work by doing numerical simulations to validate our theoretical results.
基金supported by the National Natural Science Foundation of China(No.61173088)the Programme of Introducing Talents of Discipline to Universities(No.B08038)
文摘Redundant via （RV） insertion is a useful mechanism to enhance via reliability. However, when extra vias are inserted into the design, the circuit timing might be changed. Therefore, how to insert RV under the timing constraints is the main challenge. In this paper, we introduce a new model to compute the distance between a RV and the corresponding single via, put forward a new RV type, which is called the long length via （LLV）, and then present an improved RV insertion method considering the timing constraints. This computing model can certify that the timing, which is obtained aider inserting a RV, is not greater than the original timing. Meanwhile, the new RV type LLV can increase the possibility of RV insertion; this method provides a global perspective for the RV insertion. Considering the timing constraints, the total redundant via insertion rate is 85.38% in the MIS-based method, while our proposed method can obtain a high insertion rate 88.79% for the tested circuits.
文摘Timing constraint Petri nets (TCPNs) can be used to model a real-time system specification and to verify the timing behavior of the system. This paper describes the limitations of the reachability analysis method in analyzing complex systems for existing TCPNs. Based on further research on the schedulability analysis method with various topology structures, a more general state reachability analysis method is proposed. To meet various requirements of timely response for actual systems, this paper puts forward a heuristic method for selecting decision-spans of transitions and develops a heuristic algorithm for schedulability analysis of TCPNs. Examples are given showing the practicality of the method in the schedulability analysis for real-time systems with various structures.
基金supported by the Heilongjiang Provincial Natural Science Foundation of China(LH2021F030)。
文摘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.
