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

Network-based structure optimization method of the anti-aircraft system

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.

Economical Requirements Elicitation Techniques During COVID-19: A Systematic Literature Review

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.

Performance Comparison of a QoS Aware Routing Protocol for Wireless Sensor Networks

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.

Growing Sandpile Problem with Local and Non-Local Boundaries Conditions

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 [1]). 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.

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.

Vehicle flow formulation for two-echelon time-constrained vehicle routing problem

Two-echelon routing problems,including variants such as the two-echelon vehicle routing problem(2E-VRP)and the two-echelon location routing problem(2E-LRP),involve assignment and location decisions.However,the two-echelon time-constrained vehicle routing problem(2E-TVRP)that caters to from-linehaul-to-delivery practices does not involve assignment decisions.This routing problem variant for networks with two eche-lons has not yet attracted enough research interest.Localized or long-distance services suffer from the lack of the assignment decisions between satellites and customers.Therefore,the 2E-TVRP,rather than using assignment decisions,adopts time constraints to decide the routes on each of the two interacting echelons:large-capacity vehicles trans-port cargoes among satellites on the first echelon,and small-capacity vehicles deliver cargoes from satellites to customers on the second echelon.This study introduces a mixed integer linear programming model for the 2E-TVRP and proposes a heuristic algorithm that incorporates the savings algorithm followed by a variable neighborhood search phase.Illustrative examples are used to test the mathematical formulation and the heuristic and a case study is used to demonstrate that the heuristic can effectively solve realistic-size instances of the 2E-TVRP.

Cooperative guidance strategy for multiple hypersonic gliding vehicles system

Cooperative guidance strategy for multiple hypersonic gliding vehicles system with flight constraints and cooperative constraints is investigated.This paper mainly cares about the coordination of the entry glide flight phase and driving-down phase.Different from the existing results,both the attack time and the attack angle constraints are considered simultaneously.Firstly, for the entry glide flight phase, a two-stage method is proposed to achieve the rapid cooperative trajectories planning, where the control signal corridors are designed based on the quasi-equilibrium gliding conditions.In the first stage, the bank angle curve is optimized to achieve the attack angle coordination.In the second stage, the angle of attack curve is optimized to achieve the attack time coordination.The optimized parameters can be obtained by the secant method.Secondly, for the driving-down phase, the cooperative terminal guidance law is designed where the terminal attack time and attack angle are considered.The guidance law is then transformed into the bank angle and angle of attack commands.The cooperative guidance strategy is summarized as an algorithm.Finally, a numerical simulation example with three hypersonic gliding vehicles is provided for revealing the effectiveness of the acquired strategy and algorithm.