Scheduling Model and Algorithm of Construction Equipment under Milestone Constraint

The scheduling of construction equipment is a means to realize network planning.With the large-scale and low-cost requirements of engineering construction,the cooperation among members of the engineering supply chain has become very important,and effective coordination of project plans at all levels to optimize the resource management and scheduling of a project is helpful to reduce project duration and cost.In this paper,under the milestone constraint conditions,the scheduling problems of multiple construction devices in the same sequence of operation were described and hypothesized mathematically,and the scheduling models of multiple equipment were established.The Palmer algorithm,CDS algorithm and Gupta algorithm were respectively used to solve the optimal scheduling of construction equipment to achieve the optimization of the construction period.The optimization scheduling of a single construction device and multiple construction devices was solved by using sequencing theory under milestone constraint,and these methods can obtain reasonable results,which has important guiding significance for the scheduling of construction equipment.

THE DESIGN AND ANALYSIS OF ALGORITHM OF MINIMUM COST SPANNING TREE

This paper provides a method of producing a minimum cost spanning tree (MCST) using set operations. It studies the data structure for implementation of set operations and the algorithm to be applied to this structure and proves the correctness and the complexity of the algorithm. This algorithm uses the FDG (formula to divide elements into groups) to sort (the FDG sorts a sequence of n elements in expected tir O(n)) and uses the method of path compression to find and to unite. Therefore. n produces an MCST of an undirected network having n vertices and e edges in expected time O(eG(n)).

Fast and scalable routing protocols for data center networks

Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.

Seismic response characteristics of nuclear island structure at generic soil and rock sites

The number of traditionally excellent coastal lithologic nuclear power plants is limited.It is a trend to develop nuclear power plants on soil sites in inland areas.Therefore,the seismic safety and adaptability of non-rock nuclear power plant(NPP)sites are the key concerns of nuclear safety researchers.Although the five site categories are clearly defined in the AP1000 design control documents,the effects of nuclear power five site conditions and soil nonlinearity on the seismic response characteristics of nuclear island buildings have not been systematically considered in previous related studies.In this study,targeting the AP1000 nuclear island structure as the research object,three-dimensional finite element models of a nuclear island structure at five types of sites(firm rock site(FR),soft rock site(SR),soft-to-medium soil site(SMS),upper bound soft-to-medium site(SMS-UB),and soft soil site(SS))are established.The partitioned analysis method of soil-structure interaction(PASSI)in the time-domain is used to investigate the effects of site hardness and nonlinearity on the acceleration,displacement,and acceleration response spectrum of the nuclear island structure under seismic excitation.The incremental equilibrium equation and explicit decoupling method are used to analyze the soil nonlinearity described by the Davidenkov model with simplified loading-reloading rules.The results show that,in the linear case,with the increase of site hardness,the peak ground acceleration(PGA)and the peak of acceleration response spectrum of the nuclear island structure increase except for the FR site,while the maximum displacement decreases.In nonlinear analysis,as the site hardness increases,the PGA,maximum displacement,and the peak of acceleration response spectrum of the nuclear island structure increase.The peak value of the acceleration response spectrum in the nonlinear case is greater than that in the linear case for FR,while smaller for SR and soil sites.The site nonlinearity reduces the peak values of the response spectrum for SR and soil sites much more as the site hardness decreases.The results of this study can provide a reference for design of nuclear island structures on soil and rock sites.

Algorithms for automatic measurement of SIS-type hysteretic underdamped Josephson junction’s parameters by current-voltage characteristics

Some electrical parameters of the SIS-type hysteretic underdamped Josephson junction(JJ)can be measured by its current-voltage characteristics(IVCs).Currents and voltages at JJ are commensurate with the intrinsic noise level of measuring instruments.This leads to the need for multiple measurements with subsequent statistical processing.In this paper,the digital algorithms are proposed for the automatic measurement of the JJ parameters by IVC.These algorithms make it possible to implement multiple measurements and check these JJ parameters in an automatic mode with the required accuracy.The complete sufficient statistics are used to minimize the root-mean-square error of parameter measurement.A sequence of current pulses with slow rising and falling edges is used to drive JJ,and synchronous current and voltage readings at JJ are used to realize measurement algorithms.The algorithm performance is estimated through computer simulations.The significant advantage of the proposed algorithms is the independence from current source noise and intrinsic noise of current and voltage meters,as well as the simple implementation in automatic digital measuring systems.The proposed algorithms can be used to control JJ parameters during mass production of superconducting integrated circuits,which will improve the production efficiency and product quality.

MultiDMet: Designing a Hybrid Multidimensional Metrics Framework to Predictive Modeling for Performance Evaluation and Feature Selection

In a competitive digital age where data volumes are increasing with time, the ability to extract meaningful knowledge from high-dimensional data using machine learning (ML) and data mining (DM) techniques and making decisions based on the extracted knowledge is becoming increasingly important in all business domains. Nevertheless, high-dimensional data remains a major challenge for classification algorithms due to its high computational cost and storage requirements. The 2016 Demographic and Health Survey of Ethiopia (EDHS 2016) used as the data source for this study which is publicly available contains several features that may not be relevant to the prediction task. In this paper, we developed a hybrid multidimensional metrics framework for predictive modeling for both model performance evaluation and feature selection to overcome the feature selection challenges and select the best model among the available models in DM and ML. The proposed hybrid metrics were used to measure the efficiency of the predictive models. Experimental results show that the decision tree algorithm is the most efficient model. The higher score of HMM (m, r) = 0.47 illustrates the overall significant model that encompasses almost all the user’s requirements, unlike the classical metrics that use a criterion to select the most appropriate model. On the other hand, the ANNs were found to be the most computationally intensive for our prediction task. Moreover, the type of data and the class size of the dataset (unbalanced data) have a significant impact on the efficiency of the model, especially on the computational cost, and the interpretability of the parameters of the model would be hampered. And the efficiency of the predictive model could be improved with other feature selection algorithms (especially hybrid metrics) considering the experts of the knowledge domain, as the understanding of the business domain has a significant impact.

Application Research of an Intelligent Detection Algorithm for Vehicle Trajectory Route Deviation

In the vehicle trajectory application system, it is often necessary to detect whether the vehicle deviates from the specified route. Trajectory planning in the traditional route deviation detection is defined by the driver through the mobile phone navigation software, which plays a more auxiliary driving role. This paper presents a method of vehicle trajectory deviation detection. Firstly, the manager customizes the trajectory planning and then uses big data technologies to match the deviation between the trajectory planning and the vehicle trajectory. Finally, it achieves the supervisory function of the manager on the vehicle track route in real-time. The results show that this method could detect the vehicle trajectory deviation quickly and accurately, and has practical application value.

Real-time Design Constraints in Implementing Active Vibration Control Algorithms

Although computer architectures incorporate fast processing hardware resources, high performance real-time implementation of a complex control algorithm requires an efficient design and software coding of the algorithm so as to exploit special features of the hardware and avoid associated architecture shortcomings. This paper presents an investigation into the analysis and design mechanisms that will lead to reduction in the execution time in implementing real-time control algorithms. The proposed mechanisms are exemplified by means of one algorithm, which demonstrates their applicability to real-time applications. An active vibration control （AVC） algorithm for a flexible beam system simulated using the finite difference （FD） method is considered to demonstrate the effectiveness of the proposed methods. A comparative performance evaluation of the proposed design mechanisms is presented and discussed through a set of experiments.

Repairable Configuration Optimization Model under Two-Echelon Inventory

Spares inventory configuration optimization is an effective way to improve readiness and reduce life cycle cost of equipment.Through analyzing two-echelon spares support system,the METRIC model basic theory was used.An inventory configuration optimization model of two-echelon spares support system was proposed which took the spares expected shortfall as the object and made the minimum repairable parts expected shortfall instead of the maximum spares supportability as the objective function.Marginal efficiency analysis algorithm was applied to optimizing the spares configuration and generating a rational spares inventory configuration.Finally,several examples are given to verify the model.

Posterior probability calculation procedure for recognition rate comparison

This paper focuses on the recognition rate comparison for competing recognition algorithms, which is a common problem of many pattern recognition research areas. The paper firstly reviews some traditional recognition rate comparison procedures and discusses their limitations. A new method, the posterior probability calculation（PPC） procedure is then proposed based on Bayesian technique. The paper analyzes the basic principle, process steps and computational complexity of the PPC procedure. In the Bayesian view, the posterior probability represents the credible degree（equal to confidence level） of the comparison results. The posterior probability of correctly selecting or sorting the competing recognition algorithms is derived, and the minimum sample size requirement is also pre-estimated and given out by the form of tables. To further illustrate how to use our method, the PPC procedure is used to prove the rationality of the experiential choice in one application and then to calculate the confidence level with the fixed-size datasets in another application. These applications reveal the superiority of the PPC procedure, and the discussions about the stopping rule further explain the underlying statistical causes. Finally we conclude that the PPC procedure achieves all the expected functions and be superior to the traditional methods.

Seasonal and inter-annual variations of Arctic cyclones and their linkage with Arctic sea ice and atmospheric teleconnections

The seasonal and inter-annual variations of Arctic cyclone are investigated. An automatic cyclone tracking algorithm developed by University of Reading was applied on the basis of European Center for Medium-range Weather Forecasts（ECMWF） ERA-interim mean sea level pressure field with 6 h interval for 34 a period. The maximum number of the Arctic cyclones is counted in winter, and the minimum is in spring not in summer.About 50% of Arctic cyclones in summer generated from south of 70°N, moving into the Arctic. The number of Arctic cyclones has large inter-annual and seasonal variabilities, but no significant linear trend is detected for the period 1979–2012. The spatial distribution and linear trends of the Arctic cyclones track density show that the cyclone activity extent is the widest in summer with significant increasing trend in CRU（central Russia）subregion, and the largest track density is in winter with decreasing trend in the same subregion. The linear regressions between the cyclone track density and large-scale indices for the same period and pre-period sea ice area indices show that Arctic cyclone activities are closely linked to large-scale atmospheric circulations, such as Arctic Oscillation（AO）, North Atlantic Oscillation（NAO） and Pacific-North American Pattern（PNA）. Moreover,the pre-period sea ice area is significantly associated with the cyclone activities in some regions.

A routing algorithm for FPGAs with time-multiplexed interconnects

Previous studies show that interconnects occupy a large portion of the timing budget and area in FPGAs.In this work,we propose a time-multiplexing technique on FPGA interconnects.In order to fully exploit this interconnect architecture,we propose a time-multiplexed routing algorithm that can actively identify qualified nets and schedule them to multiplexable wires.We validate the algorithm by using the router to implement 20 benchmark circuits to time-multiplexed FPGAs.We achieve a 38%smaller minimum channel width and 3.8%smaller circuit critical path delay compared with the state-of-the-art architecture router when a wire can be time-multiplexed six times in a cycle.

Resource Load Prediction of Internet of Vehicles Mobile Cloud Computing

Load-time series data in mobile cloud computing of Internet of Vehicles(IoV)usually have linear and nonlinear composite characteristics.In order to accurately describe the dynamic change trend of such loads,this study designs a load prediction method by using the resource scheduling model for mobile cloud computing of IoV.Firstly,a chaotic analysis algorithm is implemented to process the load-time series,while some learning samples of load prediction are constructed.Secondly,a support vector machine(SVM)is used to establish a load prediction model,and an improved artificial bee colony(IABC)function is designed to enhance the learning ability of the SVM.Finally,a CloudSim simulation platform is created to select the perminute CPU load history data in the mobile cloud computing system,which is composed of 50 vehicles as the data set;and a comparison experiment is conducted by using a grey model,a back propagation neural network,a radial basis function(RBF)neural network and a RBF kernel function of SVM.As shown in the experimental results,the prediction accuracy of the method proposed in this study is significantly higher than other models,with a significantly reduced real-time prediction error for resource loading in mobile cloud environments.Compared with single-prediction models,the prediction method proposed can build up multidimensional time series in capturing complex load time series,fit and describe the load change trends,approximate the load time variability more precisely,and deliver strong generalization ability to load prediction models for mobile cloud computing resources.

Application of Modified SPECAN Algorithm in Parasitical BiSAR

Global navigation satellite system（GNSS） can be employed as a transmitter to composite bistatic synthetic aperture radar（BiSAR）.As GNSS signal is quite different from the traditional radar signal,modified spectral analysis（SPECAN） algorithm is proposed and applied in the BiSAR system.The modifications include Doppler centroid compensation,range curve correction and azimuth processing method.The modified SPECAN algorithm solves the imaging problem under the condition of huge range migration,long synthetic aperture time and phase-coded signal.The proposed algorithm is verified by experiment results.

Solving the Maximum Matching Problem on Bipartite Star123-Free Graphs in Linear Time

The bipartite Star123-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star123-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star123, P7-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conjecture.

An Algorithm for the Feedback Vertex Set Problem on a Normal Helly Circular-Arc Graph

The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomi-al-time algorithms have been found for special classes of graphs. The intersection graph of a collection of arcs on a circle is called a circular-arc graph. A normal Helly circular-arc graph is a proper subclass of the set of circular-arc graphs. In this paper, we present an algorithm that takes time to solve the FVS problem in a normal Helly circular-arc graph with n vertices and m edges.

The Distribution Search:An O(n) Expected Time Search

Provided an algorithm for the distribution search and proves the time complexity of the algorithm. This algorithm uses a mathematical formula to search n elements in the sequence of n elements in O(n)expected time,and experimental reesult proves that distribution search is superior to binary search.

Aerodynamic multi-objective integrated optimization based on principal component analysis

Based on improved multi-objective particle swarm optimization（MOPSO） algorithm with principal component analysis（PCA） methodology, an efficient high-dimension multiobjective optimization method is proposed, which, as the purpose of this paper, aims to improve the convergence of Pareto front in multi-objective optimization design. The mathematical efficiency,the physical reasonableness and the reliability in dealing with redundant objectives of PCA are verified by typical DTLZ5 test function and multi-objective correlation analysis of supercritical airfoil,and the proposed method is integrated into aircraft multi-disciplinary design（AMDEsign） platform, which contains aerodynamics, stealth and structure weight analysis and optimization module.Then the proposed method is used for the multi-point integrated aerodynamic optimization of a wide-body passenger aircraft, in which the redundant objectives identified by PCA are transformed to optimization constraints, and several design methods are compared. The design results illustrate that the strategy used in this paper is sufficient and multi-point design requirements of the passenger aircraft are reached. The visualization level of non-dominant Pareto set is improved by effectively reducing the dimension without losing the primary feature of the problem.

Optimizing Connections:Applied Shortest Path Algorithms for MANETs

This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.

Convergence analysis of filtered-X LMS algorithm with secondary path modeling error

A more relaxed sufficient condition for the convergence of filtered-X LMS (FXLMS) algorithm is presented. It is pointed out that if some positive real condition for secondary path transfer function and its estimates is satisfied within all the frequency bands, FXLMS algorithm converges whatever the reference signal is like. But if the above positive real condition is satisfied only within some frequency bands, the convergence of FXLMS algorithm is dependent on the distribution of power spectral density of the reference signal, and the convergence step size is determined by the distribution of some specific correlation matrix eigenvalues.Applying the conclusion above to the Delayed LMS (DLMS) algorithm, it is shown that DLMS algorithm with some error of time delay estimation converges in certain discrete frequency bands, and the width of which are determined only by the 'time-delay estimation error frequency' which is equal to one fourth of the inverse of estimated error of the time delay.