The dynamic routing mechanism in evolvable networks enables adaptive reconfiguration of topol-ogical structures and transmission pathways based on real-time task requirements and data character-istics.However,the heig...The dynamic routing mechanism in evolvable networks enables adaptive reconfiguration of topol-ogical structures and transmission pathways based on real-time task requirements and data character-istics.However,the heightened architectural complexity and expanded parameter dimensionality in evolvable networks present significant implementation challenges when deployed in resource-con-strained environments.Due to the critical paths ignored,traditional pruning strategies cannot get a desired trade-off between accuracy and efficiency.For this reason,a critical path retention pruning(CPRP)method is proposed.By deeply traversing the computational graph,the dependency rela-tionship among nodes is derived.Then the nodes are grouped and sorted according to their contribu-tion value.The redundant operations are removed as much as possible while ensuring that the criti-cal path is not affected.As a result,computational efficiency is improved while a higher accuracy is maintained.On the CIFAR benchmark,the experimental results demonstrate that CPRP-induced pruning incurs accuracy degradation below 4.00%,while outperforming traditional feature-agnostic grouping methods by an average 8.98%accuracy improvement.Simultaneously,the pruned model attains a 2.41 times inference acceleration while achieving 48.92%parameter compression and 53.40%floating-point operations(FLOPs)reduction.展开更多
In the real world,one of the most common problems in project management is the unpredictability of resources and timelines.An efficient way to resolve uncertainty problems and overcome such obstacles is through an ext...In the real world,one of the most common problems in project management is the unpredictability of resources and timelines.An efficient way to resolve uncertainty problems and overcome such obstacles is through an extended fuzzy approach,often known as neutrosophic logic.Our rigorous proposed model has led to the creation of an advanced technique for computing the triangular single-valued neutrosophic number.This innovative approach evaluates the inherent uncertainty in project durations of the planning phase,which enhances the potential significance of the decision-making process in the project.Our proposed method,for the first time in the neutrosophic set literature,not only solves existing problems but also introduces a new set of problems not yet explored in previous research.A comparative study using Python programming was conducted to examine the effectiveness of responsive and adaptive planning,as well as their differences from other existing models such as the classical critical path problem and the fuzzy critical path problem.The study highlights the use of neutrosophic logic in handling complex projects by illustrating an innovative dynamic programming framework that is robust and flexible,according to the derived results,and sets the stage for future discussions on its scalability and application across different industries.展开更多
Since Prahalad and Hamel put forward the definition of core competence, there has been a heated discussion among entrepreneurs and scholars on how to form the core competence of the enterprises. This paper starts by i...Since Prahalad and Hamel put forward the definition of core competence, there has been a heated discussion among entrepreneurs and scholars on how to form the core competence of the enterprises. This paper starts by illustrating the model of knowledge ferment and then discusses the critical paths to building core competence in terms of organizational learning, formation of organizational competence, strategic alliance, expansion and application of competence.展开更多
We revisit the classical problem of granular hopping conduction＇s σ∝exp[-（To/T）1/2] temperature dependence, where a denotes conductivity, T is temperature, and To is a sample-dependent constant. By using the hopp...We revisit the classical problem of granular hopping conduction＇s σ∝exp[-（To/T）1/2] temperature dependence, where a denotes conductivity, T is temperature, and To is a sample-dependent constant. By using the hopping conduction formulation in conjunction with the incorporation of the random potential that has been shown to exist in insulator-conductor composites, it is demonstrated that the widely observed temperature dependence of granular hopping conduction emerges very naturally through the immediate-neighbor critical-path argument. Here, immediate-neighbor pairs are defined to be those where a line connecting two grains does not cross or by-pass other grains, and the critical-path argument denotes the derivation of sample conductance based on the geometric percolation condition that is marked by the critical conduction path in a random granular composite. Simulations based on the exact electrical network evaluation of finite-sample conductance show that the configuration- averaged results agree well with those obtained using the immediate-neighbor critical-path method. Furthermore, the results obtained using both these methods show good agreement with experimental data on hopping conduction in a sputtered metal-insulator composite Agx（SnO2）1-x, where x denotes the metal volume fraction. The present approach offers a relatively straightforward and simple expla- nation for the temperature behavior that has been widely observed over diverse material systems, but which has remained a puzzle in spite of the various efforts made to explain this phenomenon.展开更多
Critical path tracing,a fault simulation method for gate-level combinational circuits,is extended to theparallel critical path tracing for functional block-level combinational circuits.If the word length of the hostco...Critical path tracing,a fault simulation method for gate-level combinational circuits,is extended to theparallel critical path tracing for functional block-level combinational circuits.If the word length of the hostcomputer is m,then the parallel critical path tracing will be approximately m times faster than the originalone.展开更多
It is known that critical path test generation method is not a complete algorithm for combinational circuits with reconvergent-fanout.In order to make it a complete algorithm,we put forward a reconvergent-fanout- orie...It is known that critical path test generation method is not a complete algorithm for combinational circuits with reconvergent-fanout.In order to make it a complete algorithm,we put forward a reconvergent-fanout- oriented technique,the principal critical path algorithm,propagating the critical value back to primary inputs along a single path,the principal critical path,and allowing multiple path sensitization if needed.Relationship among test patterns is also discussed to accelerate test generation.展开更多
In this paper, a probabilistic network model for financial planning is proposed. The optimum value of the objective function of the model is evaluated by its expected value. However,calculating the expected argue of o...In this paper, a probabilistic network model for financial planning is proposed. The optimum value of the objective function of the model is evaluated by its expected value. However,calculating the expected argue of optimum argue is NP-hard. In the paper, the concept of critical path is given, and the method locating the expected solution to the unit cash now problem is provided.展开更多
Existing methods of local search mostly focus on how to reach optimal solution.However,in some emergency situations,search time is the hard constraint for job shop scheduling problem while optimal solution is not nece...Existing methods of local search mostly focus on how to reach optimal solution.However,in some emergency situations,search time is the hard constraint for job shop scheduling problem while optimal solution is not necessary.In this situation,the existing method of local search is not fast enough.This paper presents an emergency local search(ELS) approach which can reach feasible and nearly optimal solution in limited search time.The ELS approach is desirable for the aforementioned emergency situations where search time is limited and a nearly optimal solution is sufficient,which consists of three phases.Firstly,in order to reach a feasible and nearly optimal solution,infeasible solutions are repaired and a repair technique named group repair is proposed.Secondly,in order to save time,the amount of local search moves need to be reduced and this is achieved by a quickly search method named critical path search(CPS).Finally,CPS sometimes stops at a solution far from the optimal one.In order to jump out the search dilemma of CPS,a jump technique based on critical part is used to improve CPS.Furthermore,the schedule system based on ELS has been developed and experiments based on this system completed on the computer of Intel Pentium(R) 2.93 GHz.The experimental result shows that the optimal solutions of small scale instances are reached in 2 s,and the nearly optimal solutions of large scale instances are reached in 4 s.The proposed ELS approach can stably reach nearly optimal solutions with manageable search time,and can be applied on some emergency situations.展开更多
The avionics working environment is bad, easy to accelerate aging of circuits. Circuit aging is one of the important factors that influence the reliability of avionics, so circuit aging testing is of great significanc...The avionics working environment is bad, easy to accelerate aging of circuits. Circuit aging is one of the important factors that influence the reliability of avionics, so circuit aging testing is of great significance to improve the reliability of avionics. As continuing aging would degrade circuit performance, aging can be monitored through precise measurement of performance degradation. However, previous methods for predicting circuit performance have limited prediction accuracy. In this paper, we propose a novel Built-In Self-Test（BIST） scheme for circuit aging measurement, which constructs self-oscillation loops employing parts of critical paths and activates oscillations by specific test patterns. An aging signature counter is then used to capture the oscillation frequency and in turn measure the aging state of the circuit. We propose to implement this measurement process by BIST. Experimental results show that the proposed in-field aging measurement is robust with respect to process variations and can achieve a precision of about 90%. The application of this scheme has a certain value to improve the reliability of avionics systems.展开更多
According to the multi-project and program management theory, this paper analyzes the program generation principle and establishes a program based on progress goals. On the basis of the present situation of calculatio...According to the multi-project and program management theory, this paper analyzes the program generation principle and establishes a program based on progress goals. On the basis of the present situation of calculation of penalty for delay of the bidding section construction period with the critical path method, we studied the effects of contractor-induced delay of the bidding section construction period in detail, including the effects on the construction period of the bidding section itself, the earliest start times of the next bidding section and other subsequent bidding sections, and the construction period of the program, and then constructed a penalty model for delay of the bidding section construction period from the perspective of programs. Using the penalty model, we conducted a practical analysis of penalty for delay of the construction period of the Baoying station program in the South-to-North Water Diversion Project. The model can help determine the amount of penalty for delay of the construction period in bidding sections scientifically and reasonably,展开更多
This paper proposed an enhanced NEH with full insertion moves to solve the permutation flow shop problem.The characteristics of the original NEH are investigated and analyzed,and it is concluded that the given method ...This paper proposed an enhanced NEH with full insertion moves to solve the permutation flow shop problem.The characteristics of the original NEH are investigated and analyzed,and it is concluded that the given method would be promising to find better solutions,while the cost would be increased.Fast makespan calculating method and eliminating non-promising permutation policy are introduced to reduce the evaluation effort.The former decreases the time complexity from O(n4m) to O(n3m),which is an acceptable cost for medium and small size instances considering the obtained solution quality.The results from computational experience show that the latter also can eliminate a lot of non-promising solutions.展开更多
For its complexity, engineering construction schedule design is limited by various factors.Simulation-based engineering construction schedule takes critical path method (CPM) network as frame and calls complex cyclic ...For its complexity, engineering construction schedule design is limited by various factors.Simulation-based engineering construction schedule takes critical path method (CPM) network as frame and calls complex cyclic operation network (CYCLONE) simulation model enclosed in advance for its simulation nodes. CYCLONE simulation model takes charge of simulating stochastic duration of activity and efficiency of resources, while CPM model performs project scheduling. This combination avoids the shortcomings of both models. Furthermore, geographic information system (GIS) technique is utilized to visualize the construction processes which are otherwise difficult to be understood by static results described. Application in practical project verifies the feasibility and advantage of the technique.展开更多
SoftwareDefined Networks(SDN)introduced better network management by decoupling control and data plane.However,communication reliability is the desired property in computer networks.The frequency of communication link...SoftwareDefined Networks(SDN)introduced better network management by decoupling control and data plane.However,communication reliability is the desired property in computer networks.The frequency of communication link failure degrades network performance,and service disruptions are likely to occur.Emerging network applications,such as delaysensitive applications,suffer packet loss with higher Round Trip Time(RTT).Several failure recovery schemes have been proposed to address link failure recovery issues in SDN.However,these schemes have various weaknesses,which may not always guarantee service availability.Communication paths differ in their roles;some paths are critical because of the higher frequency usage.Other paths frequently share links between primary and backup.Rerouting the affected flows after failure occurrences without investigating the path roles can lead to post-recovery congestion with packet loss and system throughput.Therefore,there is a lack of studies to incorporate path criticality and residual path capacity to reroute the affected flows in case of link failure.This paper proposed Reliable Failure Restoration with Congestion Aware for SDN to select the reliable backup path that decreases packet loss and RTT,increasing network throughput while minimizing post-recovery congestion.The affected flows are redirected through a path with minimal risk of failure,while Bayesian probability is used to predict post-recovery congestion.Both the former and latter path with a minimal score is chosen.The simulation results improved throughput by(45%),reduced packet losses(87%),and lowered RTT(89%)compared to benchmarking works.展开更多
Static Random Access Memory(SRAM) based Field Programmable Gate Array(FPGA) is widely applied in the field of aerospace, whose anti-SEU(Single Event Upset) capability becomes more and more important. To improve anti-F...Static Random Access Memory(SRAM) based Field Programmable Gate Array(FPGA) is widely applied in the field of aerospace, whose anti-SEU(Single Event Upset) capability becomes more and more important. To improve anti-FPGA SEU capability, the registers of the circuit netlist are tripled and divided into three categories in this study. By the packing algorithm, the registers of triple modular redundancy are loaded into different configurable logic block. At the same time, the packing algorithm considers the effect of large fan-out nets. The experimental results show that the algorithm successfully realize the packing of the register of Triple Modular Redundancy(TMR). Comparing with Timing Versatile PACKing(TVPACK), the algorithm in this study is able to obtain a 11% reduction of the number of the nets in critical path, and a 12% reduction of the time delay in critical path on average when TMR is not considered. Especially, some critical path delay of circuit can be improved about 33%.展开更多
Today, most construction projects in urban environments are complex high-rise buildings that present unique challenges, including local building ordinances and restrictions, adjoining public and residential areas, nar...Today, most construction projects in urban environments are complex high-rise buildings that present unique challenges, including local building ordinances and restrictions, adjoining public and residential areas, narrow sidewalks and streets, and underground utilities, all of which require extensive planning and tight schedules. A major problem facing such projects is to formulate realistic schedules that will make it possible to meet contractual completion dates with limited resources and budgets. The scheduling software products currently used in construction projects, which include Primavera P6, Microsoft Project, etc., are not actually applied as a scheduling tool in practical construction projects, which instead generally depend on Microsoft Excel or a bar-chart. This is because the existing scheduling programs cannot provide more user-oriented schedule format such as representing two-way multiple overlapping relationships. To overcome this deficiency, the BDM （beeline diagramming method） is proposed as a new networking technique in 2010. But two-way multiple overlapping relationships generate the loop in a conventional schedule computation process. This paper addresses the loop phenomenon of two-way multiple overlapping relationships in a BDM network as well as proposes the solutions of them, and then presents a practical application of two-way multiple overlapping relationships at a real project.展开更多
This paper reviewed the concepts of Project Evaluation Review Technique and<span style="font-family:Verdana;"> Critical Path Method in project management with practical examples. The methods and succes...This paper reviewed the concepts of Project Evaluation Review Technique and<span style="font-family:Verdana;"> Critical Path Method in project management with practical examples. The methods and success of quantitative decision-making approaches in project management through t</span><span style="font-family:Verdana;">he use of project evaluation review technique and the critical path method as regards project duration and critical activities of a project, were discussed. The review found that while both methods are effective in achieving success in project management, the relationship and connectivity of activities involved in a project life cycle are key aspects. The paper concludes that the project evaluation review technique is more effective when the duration of the project is uncertain, while the critical path method is effective when the project’s end time is certain. The paper, therefore, recommends that to achieve maximum operative efficiency in utilizing resources in project management, p</span><span style="font-family:Verdana;">rior to commencing the execution of a project, all required resources to cover every activity must be assembled and prioritized to eliminate interruptions that could bring delay and unnecessary cost implications. Again, policies focused on improving project execution should be implemented in developing nations to minimize the many cases of failed and delayed projects. Subsequently, stakeholders in projects must be given the right, under the law, to prosecute the government, its agencies and/or the executors of projects for failure to execute a project on schedule.</span>展开更多
In order to cope with the most expensive stem fault simulation in fault simu-lation field, several accelerated techniques are presented in this paper. These techniques include static analysis on circuit structure in p...In order to cope with the most expensive stem fault simulation in fault simu-lation field, several accelerated techniques are presented in this paper. These techniques include static analysis on circuit structure in preprocessing stage and dynamic calculations in fault simulation stage. With these techniques,the area for stem fault simulation and number of the stems requiring explicit fault simulation are greatly reduced, so that the entire fault simulation time is substantially decreased. Experimental results given in this paper show that the fault simulation algorithm using these techniques is of very high efficiency for both small and large numbers of test patterns. Especially with the increase of circuit gates, its effectivenbss improves obyiously.展开更多
Getting the right people in the right place at the right time has always been a major organizational challenge. In ancient times this process seems to have been accomplished based on the scheme of arrangements being c...Getting the right people in the right place at the right time has always been a major organizational challenge. In ancient times this process seems to have been accomplished based on the scheme of arrangements being contained in the leader＇s mind and instructions communicated verbally. Modem approaches to solving the twin challenges of first thinking through the ＇plan＇ and then communicating the plan to the people who need to do ＇the right work, at the right time, in the right place＇ use sophisticated graphics, charts, diagrams, and computa- tions. This paper traces the development of the concepts most project managers take for granted including bar charts and critical path schedules from their origins （which are far earlier than most people think） through to the modem day. The first section of the paper looks at the development of concepts that allow the visualization of time and other data. The second looks at the shift from static representations to dynamic modeling through the emergence of computers, dynamic calculations and integrated data from the 1950s to the present time.展开更多
基金Supported by the National Key Research and Development Program of China(No.2022ZD0119003)and the National Natural Science Founda-tion of China(No.61834005).
文摘The dynamic routing mechanism in evolvable networks enables adaptive reconfiguration of topol-ogical structures and transmission pathways based on real-time task requirements and data character-istics.However,the heightened architectural complexity and expanded parameter dimensionality in evolvable networks present significant implementation challenges when deployed in resource-con-strained environments.Due to the critical paths ignored,traditional pruning strategies cannot get a desired trade-off between accuracy and efficiency.For this reason,a critical path retention pruning(CPRP)method is proposed.By deeply traversing the computational graph,the dependency rela-tionship among nodes is derived.Then the nodes are grouped and sorted according to their contribu-tion value.The redundant operations are removed as much as possible while ensuring that the criti-cal path is not affected.As a result,computational efficiency is improved while a higher accuracy is maintained.On the CIFAR benchmark,the experimental results demonstrate that CPRP-induced pruning incurs accuracy degradation below 4.00%,while outperforming traditional feature-agnostic grouping methods by an average 8.98%accuracy improvement.Simultaneously,the pruned model attains a 2.41 times inference acceleration while achieving 48.92%parameter compression and 53.40%floating-point operations(FLOPs)reduction.
文摘In the real world,one of the most common problems in project management is the unpredictability of resources and timelines.An efficient way to resolve uncertainty problems and overcome such obstacles is through an extended fuzzy approach,often known as neutrosophic logic.Our rigorous proposed model has led to the creation of an advanced technique for computing the triangular single-valued neutrosophic number.This innovative approach evaluates the inherent uncertainty in project durations of the planning phase,which enhances the potential significance of the decision-making process in the project.Our proposed method,for the first time in the neutrosophic set literature,not only solves existing problems but also introduces a new set of problems not yet explored in previous research.A comparative study using Python programming was conducted to examine the effectiveness of responsive and adaptive planning,as well as their differences from other existing models such as the classical critical path problem and the fuzzy critical path problem.The study highlights the use of neutrosophic logic in handling complex projects by illustrating an innovative dynamic programming framework that is robust and flexible,according to the derived results,and sets the stage for future discussions on its scalability and application across different industries.
文摘Since Prahalad and Hamel put forward the definition of core competence, there has been a heated discussion among entrepreneurs and scholars on how to form the core competence of the enterprises. This paper starts by illustrating the model of knowledge ferment and then discusses the critical paths to building core competence in terms of organizational learning, formation of organizational competence, strategic alliance, expansion and application of competence.
文摘We revisit the classical problem of granular hopping conduction＇s σ∝exp[-（To/T）1/2] temperature dependence, where a denotes conductivity, T is temperature, and To is a sample-dependent constant. By using the hopping conduction formulation in conjunction with the incorporation of the random potential that has been shown to exist in insulator-conductor composites, it is demonstrated that the widely observed temperature dependence of granular hopping conduction emerges very naturally through the immediate-neighbor critical-path argument. Here, immediate-neighbor pairs are defined to be those where a line connecting two grains does not cross or by-pass other grains, and the critical-path argument denotes the derivation of sample conductance based on the geometric percolation condition that is marked by the critical conduction path in a random granular composite. Simulations based on the exact electrical network evaluation of finite-sample conductance show that the configuration- averaged results agree well with those obtained using the immediate-neighbor critical-path method. Furthermore, the results obtained using both these methods show good agreement with experimental data on hopping conduction in a sputtered metal-insulator composite Agx（SnO2）1-x, where x denotes the metal volume fraction. The present approach offers a relatively straightforward and simple expla- nation for the temperature behavior that has been widely observed over diverse material systems, but which has remained a puzzle in spite of the various efforts made to explain this phenomenon.
基金The project is supported by the National Natural Science Foundation of China.
文摘Critical path tracing,a fault simulation method for gate-level combinational circuits,is extended to theparallel critical path tracing for functional block-level combinational circuits.If the word length of the hostcomputer is m,then the parallel critical path tracing will be approximately m times faster than the originalone.
文摘It is known that critical path test generation method is not a complete algorithm for combinational circuits with reconvergent-fanout.In order to make it a complete algorithm,we put forward a reconvergent-fanout- oriented technique,the principal critical path algorithm,propagating the critical value back to primary inputs along a single path,the principal critical path,and allowing multiple path sensitization if needed.Relationship among test patterns is also discussed to accelerate test generation.
文摘In this paper, a probabilistic network model for financial planning is proposed. The optimum value of the objective function of the model is evaluated by its expected value. However,calculating the expected argue of optimum argue is NP-hard. In the paper, the concept of critical path is given, and the method locating the expected solution to the unit cash now problem is provided.
基金supported by National Natural Science Foundation of China(Grant No.61004109)Fundamental Research Funds for the Central Universities of China(Grant No.FRF-TP-12-071A)
文摘Existing methods of local search mostly focus on how to reach optimal solution.However,in some emergency situations,search time is the hard constraint for job shop scheduling problem while optimal solution is not necessary.In this situation,the existing method of local search is not fast enough.This paper presents an emergency local search(ELS) approach which can reach feasible and nearly optimal solution in limited search time.The ELS approach is desirable for the aforementioned emergency situations where search time is limited and a nearly optimal solution is sufficient,which consists of three phases.Firstly,in order to reach a feasible and nearly optimal solution,infeasible solutions are repaired and a repair technique named group repair is proposed.Secondly,in order to save time,the amount of local search moves need to be reduced and this is achieved by a quickly search method named critical path search(CPS).Finally,CPS sometimes stops at a solution far from the optimal one.In order to jump out the search dilemma of CPS,a jump technique based on critical part is used to improve CPS.Furthermore,the schedule system based on ELS has been developed and experiments based on this system completed on the computer of Intel Pentium(R) 2.93 GHz.The experimental result shows that the optimal solutions of small scale instances are reached in 2 s,and the nearly optimal solutions of large scale instances are reached in 4 s.The proposed ELS approach can stably reach nearly optimal solutions with manageable search time,and can be applied on some emergency situations.
基金supported by the National Natural Science Foundation of China (Nos.61674048,61574052,61474036,61371025)Project Team of Anhui Institute of Economics and Management of China (No.YJKT1417T01)
文摘The avionics working environment is bad, easy to accelerate aging of circuits. Circuit aging is one of the important factors that influence the reliability of avionics, so circuit aging testing is of great significance to improve the reliability of avionics. As continuing aging would degrade circuit performance, aging can be monitored through precise measurement of performance degradation. However, previous methods for predicting circuit performance have limited prediction accuracy. In this paper, we propose a novel Built-In Self-Test（BIST） scheme for circuit aging measurement, which constructs self-oscillation loops employing parts of critical paths and activates oscillations by specific test patterns. An aging signature counter is then used to capture the oscillation frequency and in turn measure the aging state of the circuit. We propose to implement this measurement process by BIST. Experimental results show that the proposed in-field aging measurement is robust with respect to process variations and can achieve a precision of about 90%. The application of this scheme has a certain value to improve the reliability of avionics systems.
基金supported by the National Science and Technology Plan of China (Major Project of the Eleventh Five-Year Plan, Grant No. 2006BAB04A13)the Philosophy and Social Science Fund of Education Department of Jiangsu Province (Grant No. 07SJD630006)+1 种基金the Third Key Discipline (Techno-Economics and Management) of the Project 211the Key Disciplines of Jiangsu Province (Engineering and Project Management)
文摘According to the multi-project and program management theory, this paper analyzes the program generation principle and establishes a program based on progress goals. On the basis of the present situation of calculation of penalty for delay of the bidding section construction period with the critical path method, we studied the effects of contractor-induced delay of the bidding section construction period in detail, including the effects on the construction period of the bidding section itself, the earliest start times of the next bidding section and other subsequent bidding sections, and the construction period of the program, and then constructed a penalty model for delay of the bidding section construction period from the perspective of programs. Using the penalty model, we conducted a practical analysis of penalty for delay of the construction period of the Baoying station program in the South-to-North Water Diversion Project. The model can help determine the amount of penalty for delay of the construction period in bidding sections scientifically and reasonably,
基金New Century Excellent Talents in University (No.NCET04-0383)Science and Technology Phosphor Program of Shanghai (No.04QMH1405)
文摘This paper proposed an enhanced NEH with full insertion moves to solve the permutation flow shop problem.The characteristics of the original NEH are investigated and analyzed,and it is concluded that the given method would be promising to find better solutions,while the cost would be increased.Fast makespan calculating method and eliminating non-promising permutation policy are introduced to reduce the evaluation effort.The former decreases the time complexity from O(n4m) to O(n3m),which is an acceptable cost for medium and small size instances considering the obtained solution quality.The results from computational experience show that the latter also can eliminate a lot of non-promising solutions.
基金Supported by National Natural Science Foundation of China( No. 50179023).
文摘For its complexity, engineering construction schedule design is limited by various factors.Simulation-based engineering construction schedule takes critical path method (CPM) network as frame and calls complex cyclic operation network (CYCLONE) simulation model enclosed in advance for its simulation nodes. CYCLONE simulation model takes charge of simulating stochastic duration of activity and efficiency of resources, while CPM model performs project scheduling. This combination avoids the shortcomings of both models. Furthermore, geographic information system (GIS) technique is utilized to visualize the construction processes which are otherwise difficult to be understood by static results described. Application in practical project verifies the feasibility and advantage of the technique.
基金The authors thank the UTM and Deanship of Scientific Research at King Khalid University for funding this work through grant No R.J130000.7709.4J561Large Groups.(Project under grant number(RGP.2/111/43)).
文摘SoftwareDefined Networks(SDN)introduced better network management by decoupling control and data plane.However,communication reliability is the desired property in computer networks.The frequency of communication link failure degrades network performance,and service disruptions are likely to occur.Emerging network applications,such as delaysensitive applications,suffer packet loss with higher Round Trip Time(RTT).Several failure recovery schemes have been proposed to address link failure recovery issues in SDN.However,these schemes have various weaknesses,which may not always guarantee service availability.Communication paths differ in their roles;some paths are critical because of the higher frequency usage.Other paths frequently share links between primary and backup.Rerouting the affected flows after failure occurrences without investigating the path roles can lead to post-recovery congestion with packet loss and system throughput.Therefore,there is a lack of studies to incorporate path criticality and residual path capacity to reroute the affected flows in case of link failure.This paper proposed Reliable Failure Restoration with Congestion Aware for SDN to select the reliable backup path that decreases packet loss and RTT,increasing network throughput while minimizing post-recovery congestion.The affected flows are redirected through a path with minimal risk of failure,while Bayesian probability is used to predict post-recovery congestion.Both the former and latter path with a minimal score is chosen.The simulation results improved throughput by(45%),reduced packet losses(87%),and lowered RTT(89%)compared to benchmarking works.
基金Supported by the National Natural Science Foundation of China(No.61106033)
文摘Static Random Access Memory(SRAM) based Field Programmable Gate Array(FPGA) is widely applied in the field of aerospace, whose anti-SEU(Single Event Upset) capability becomes more and more important. To improve anti-FPGA SEU capability, the registers of the circuit netlist are tripled and divided into three categories in this study. By the packing algorithm, the registers of triple modular redundancy are loaded into different configurable logic block. At the same time, the packing algorithm considers the effect of large fan-out nets. The experimental results show that the algorithm successfully realize the packing of the register of Triple Modular Redundancy(TMR). Comparing with Timing Versatile PACKing(TVPACK), the algorithm in this study is able to obtain a 11% reduction of the number of the nets in critical path, and a 12% reduction of the time delay in critical path on average when TMR is not considered. Especially, some critical path delay of circuit can be improved about 33%.
文摘Today, most construction projects in urban environments are complex high-rise buildings that present unique challenges, including local building ordinances and restrictions, adjoining public and residential areas, narrow sidewalks and streets, and underground utilities, all of which require extensive planning and tight schedules. A major problem facing such projects is to formulate realistic schedules that will make it possible to meet contractual completion dates with limited resources and budgets. The scheduling software products currently used in construction projects, which include Primavera P6, Microsoft Project, etc., are not actually applied as a scheduling tool in practical construction projects, which instead generally depend on Microsoft Excel or a bar-chart. This is because the existing scheduling programs cannot provide more user-oriented schedule format such as representing two-way multiple overlapping relationships. To overcome this deficiency, the BDM （beeline diagramming method） is proposed as a new networking technique in 2010. But two-way multiple overlapping relationships generate the loop in a conventional schedule computation process. This paper addresses the loop phenomenon of two-way multiple overlapping relationships in a BDM network as well as proposes the solutions of them, and then presents a practical application of two-way multiple overlapping relationships at a real project.
文摘This paper reviewed the concepts of Project Evaluation Review Technique and<span style="font-family:Verdana;"> Critical Path Method in project management with practical examples. The methods and success of quantitative decision-making approaches in project management through t</span><span style="font-family:Verdana;">he use of project evaluation review technique and the critical path method as regards project duration and critical activities of a project, were discussed. The review found that while both methods are effective in achieving success in project management, the relationship and connectivity of activities involved in a project life cycle are key aspects. The paper concludes that the project evaluation review technique is more effective when the duration of the project is uncertain, while the critical path method is effective when the project’s end time is certain. The paper, therefore, recommends that to achieve maximum operative efficiency in utilizing resources in project management, p</span><span style="font-family:Verdana;">rior to commencing the execution of a project, all required resources to cover every activity must be assembled and prioritized to eliminate interruptions that could bring delay and unnecessary cost implications. Again, policies focused on improving project execution should be implemented in developing nations to minimize the many cases of failed and delayed projects. Subsequently, stakeholders in projects must be given the right, under the law, to prosecute the government, its agencies and/or the executors of projects for failure to execute a project on schedule.</span>
文摘In order to cope with the most expensive stem fault simulation in fault simu-lation field, several accelerated techniques are presented in this paper. These techniques include static analysis on circuit structure in preprocessing stage and dynamic calculations in fault simulation stage. With these techniques,the area for stem fault simulation and number of the stems requiring explicit fault simulation are greatly reduced, so that the entire fault simulation time is substantially decreased. Experimental results given in this paper show that the fault simulation algorithm using these techniques is of very high efficiency for both small and large numbers of test patterns. Especially with the increase of circuit gates, its effectivenbss improves obyiously.
文摘Getting the right people in the right place at the right time has always been a major organizational challenge. In ancient times this process seems to have been accomplished based on the scheme of arrangements being contained in the leader＇s mind and instructions communicated verbally. Modem approaches to solving the twin challenges of first thinking through the ＇plan＇ and then communicating the plan to the people who need to do ＇the right work, at the right time, in the right place＇ use sophisticated graphics, charts, diagrams, and computa- tions. This paper traces the development of the concepts most project managers take for granted including bar charts and critical path schedules from their origins （which are far earlier than most people think） through to the modem day. The first section of the paper looks at the development of concepts that allow the visualization of time and other data. The second looks at the shift from static representations to dynamic modeling through the emergence of computers, dynamic calculations and integrated data from the 1950s to the present time.
