A NEW ALGORITHM FOR ALL EFFICIENT SPANNING TREES

In Corley′s algorithm for all efficient spanning trees, final solutions include many spanning trees, which are not all efficient. In this paper, a new algorithm is presented, which corrects and modifies Corley′s algorithm. A necessary condition is developed for the subtree of an efficient spanning tree. According to the condition the new algorithm is established and its efficiency is proved.

An efficient algorithm to compute transient pressure responses of slanted wells with arbitrary inclination in reservoirs

Compared with vertical and horizontal wells, the solution and computation of transient pressure responses of slanted wells are more complex. Vertical and horizontal wells are both simplified cases of slanted wells at particular inclination, so the model for slanted wells is more general and more complex than other models for vertical and horizontal wells. Many authors have studied unsteady-state flow of fluids in slanted wells and various solutions have been proposed. However, until now, few of the published results pertain to the computational efficiency. Whether in the time domain or in the Laplace domain, the computation of integration of complex functions is necessary in obtaining pressure responses of slanted wells, while the computation of the integration is complex and time-consuming. To obtain a perfect type curve the computation time is unacceptable even with an aid of high-speed computers. The purpose of this paper is to present an efficient algorithm to compute transient pressure distributions caused by slanted wells in reservoirs. Based on rigorous derivation, the transient pressure solution for slanted wells of any inclination angle is presented. Assuming an infinite-conductivity wellbore, the location of the equivalent-pressure point is determined. More importantly, according to the characteristics of the integrand in a transient pressure solution for slanted wells, the whole integral interval is partitioned into several small integral intervals, and then the method of variable substitution and the variable step-size piecewise numerical integration are employed. The amount of computation is significantly reduced and the computational efficiency is greatly improved. The algorithm proposed in this paper thoroughly solved the difficulty in the efficient and high-speed computation of transient pressure distribution of slanted wells with any inclination angle.

Energy-Efficient Low-Complexity Algorithm in 5G Massive MIMO Systems

Energy efficiency(EE)is a critical design when taking into account circuit power consumption(CPC)in fifth-generation cellular networks.These problems arise because of the increasing number of antennas in massive multiple-input multiple-output(MIMO)systems,attributable to inter-cell interference for channel state information.Apart from that,a higher number of radio frequency(RF)chains at the base station and active users consume more power due to the processing activities in digital-to-analogue converters and power amplifiers.Therefore,antenna selection,user selection,optimal transmission power,and pilot reuse power are important aspects in improving energy efficiency in massive MIMO systems.This work aims to investigate joint antenna selection,optimal transmit power and joint user selection based on deriving the closed-form of the maximal EE,with complete knowledge of large-scale fading with maximum ratio transmission.It also accounts for channel estimation and eliminating pilot contamination as antennas M→∞.This formulates the optimization problem of joint optimal antenna selection,transmits power allocation and joint user selection to mitigate inter-cellinterference in downlink multi-cell massive MIMO systems under minimized reuse of pilot sequences based on a novel iterative low-complexity algorithm(LCA)for Newton’s methods and Lagrange multipliers.To analyze the precise power consumption,a novel power consumption scheme is proposed for each individual antenna,based on the transmit power amplifier and CPC.Simulation results demonstrate that the maximal EE was achieved using the iterative LCA based on reasonable maximum transmit power,in the case the noise power is less than the received power pilot.The maximum EE was achieved with the desired maximum transmit power threshold by minimizing pilot reuse,in the case the transmit power allocationρd=40 dBm,and the optimal EE=71.232 Mb/j.

Improving path planning efficiency for underwater gravity-aided navigation based on a new depth sorting fast search algorithm

This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapidly-exploring Random Trees*(Q-RRT*)algorithm.A cost inequality relationship between an ancestor and its descendants was derived,and the ancestors were filtered accordingly.Secondly,the underwater gravity-aided navigation path planning system was designed based on the DSFS algorithm,taking into account the fitness,safety,and asymptotic optimality of the routes,according to the gravity suitability distribution of the navigation space.Finally,experimental comparisons of the computing performance of the ChooseParent procedure,the Rewire procedure,and the combination of the two procedures for Q-RRT*and DSFS were conducted under the same planning environment and parameter conditions,respectively.The results showed that the computational efficiency of the DSFS algorithm was improved by about 1.2 times compared with the Q-RRT*algorithm while ensuring correct computational results.

On the Design and Optimization of a Clean and Efficient Combustion Mode for Internal Combustion Engines through a Computer NSGA-Ⅱ Algorithm

In order to address typical problems due to the huge demand of oil for consumption in traditional internal combustion engines,a new more efficient combustion mode is proposed and studied in the framework of Computational Fluid Dynamics(CFD).Moreover,a Non-dominated Sorting Genetic Algorithm(NSGA-Ⅱ)is applied to optimize the related parameters,namely,the engine methanol ratio,the fuel injection time,the initial temperature,the Exhaust Gas Re-Circulation(EGR)rate,and the initial pressure.The so-called Conventional Diesel Combustion(CDC),Homogeneous Charge Compression Ignition(HCCI)and the Reactivity Controlled Compression Ignition(RCCI)combustion modes are compared.The results show that RCCI has a higher methanol ratio and an earlier injection timing with moderate EGR rate and higher initial pressure.The initial temperature increases as the methanol ratio increases.In comparison,CDC has the lowest hydrocarbon and CO emissions and the highest combustion efficiency.At different crankshaft rotation angles corresponding to 50%of the combustion amount(CA50),the combustion temperature and boundary layer temperature of HCCI change significantly,while those of RCCI undergo limited variations.At the same CA50,the exergy losses of HCCI and RCCI are lower than that of the CDC.On the basis of these findings,it can be concluded that the methanol/diesel RCCI engine can be used to obtain a clean and efficient combustion process,which should be regarded as a promising combustion mode.

Energy-Efficient Process Planning Using Improved Genetic Algorithm

Nowadays,energy consumption which closely contacts with environmental impacts of manufacturing processes has been highly commented as a new productivity criterion.However,little attention has paid to the development of process planning methods that take energy consumption into account.An energy-efficient process planning model that incorporates manufacturing time and energy consumption is proposed.For solving the problem,an improved genetic algorithm method is employed to explore the optimal solution.Finally,a case study for process planning is given.The experimental result generates interesting effort,and therefore allows improving the energy efficiency of manufacturing processes in process planning.

Echo Location Based Bat Algorithm for Energy Efficient WSN Routing

Due to the wide range of applications,Wireless Sensor Networks(WSN)are increased in day to day life and becomes popular.WSN has marked its importance in both practical and research domains.Energy is the most significant resource,the important challenge in WSN is to extend its lifetime.The energy reduction is a key to extend the network’s lifetime.Clustering of sensor nodes is one of the well-known and proved methods for achieving scalable and energy conserving WSN.In this paper,an energy efficient protocol is proposed using metaheuristic Echo location-based BAT algorithm(ECHO-BAT).ECHO-BAT works in two stages.First Stage clusters the sensor nodes and identifies tentativeCluster Head(CH)along with the entropy value using BAT algorithm.The second stage aims to find the nodes if any,with high residual energy within each cluster.CHs will be replaced by the member node with high residual energy with an objective to choose the CH with high energy to prolong the network’s lifetime.The performance of the proposed work is compared with Low-Energy Adaptive Clustering Hierarchy(LEACH),Power-Efficient Zoning Clustering Algorithm(PEZCA)and Chaotic Firefly Algorithm CH(CFACH)in terms of lifetime of network,death of first nodes,death of 125th node,death of the last node,network throughput and execution time.Simulation results show that ECHO-BAT outperforms the other methods in all the considered measures.The overall delivery ratio has also significantly optimized and improved by approximately 8%,proving the proposed approach to be an energy efficient WSN.

Enhanced Reliability in Network Function Virtualization by Hybrid Hexagon-Cost Efficient Algorithm

In this,communication world, the Network Function Virtualization concept is utilized for many businesses, small services to virtualize the network nodefunction and to build a block that may connect the chain, communication services.Mainly, Virtualized Network Function Forwarding Graph (VNF-FG) has beenused to define the connection between the VNF and to give the best end-to-endservices. In the existing method, VNF mapping and backup VNF were proposedbut there was no profit and reliability improvement of the backup and mapping ofthe primary VNF. As a consequence, this paper offers a Hybrid Hexagon-CostEfficient algorithm for determining the best VNF among multiple VNF and backing up the best VNF, lowering backup costs while increasing dependability. TheVNF is chosen based on the highest cost-aware important measure (CIM) rate,which is used to assess the relevance of the VNF forwarding graph.To achieveoptimal cost-efficiency, VNF with the maximum CIM is selected. After the selection process, updating is processed by three steps which include one backup VNFfrom one SFC, two backup VNF from one Service Function Chain (SFC),and twobackup VNF from different SFC. Finally, this proposed method is compared withCERA, MinCost, MaxRbyInr based on backup cost, number of used PN nodes,SFC request utility, and latency. The simulation result shows that the proposedmethod cuts down the backup cost and computation time by 57% and 45% compared with the CER scheme and improves the cost-efficiency. As a result, this proposed system achieves less backup cost, high reliability, and low timeconsumption which can improve the Virtualized Network Function operation.

AN EFFICIENT FINITE-DIFFERENCE ALGORITHM FOR COMPUTING AXISYMMETRIC TRANSONIC NACELLE FLOW FIELDS

A finite difference method for computing the axisymmetric, transonic flows over a nacelle is presented in this paper. By use of the conservative full-potential equation, body-fitted grid, and the exact boundary conditions, a new AF scheme is constructed according to the criterion of optimum convergence. The proposed scheme has been applied to transonic nacelle flow problems. Computation for several nacelles shows the rapid convergence of this scheme and excellent agreement with the experimental results.

A Novel Low-Complexity Low-Latency Power Efficient Collision Detection Algorithm for Wireless Sensor Networks

Collision detection mechanisms in Wireless Sensor Networks (WSNs) have largely been revolving around direct demodulation and decoding of received packets and deciding on a collision based on some form of a frame error detection mechanism, such as a CRC check. The obvious drawback of full detection of a received packet is the need to expend a significant amount of energy and processing complexity in order to fully decode a packet, only to discover the packet is illegible due to a collision. In this paper, we propose a suite of novel, yet simple and power-efficient algorithms to detect a collision without the need for full-decoding of the received packet. Our novel algorithms aim at detecting collision through fast examination of the signal statistics of a short snippet of the received packet via a relatively small number of computations over a small number of received IQ samples. Hence, the proposed algorithms operate directly at the output of the receiver's analog-to-digital converter and eliminate the need to pass the signal through the entire. In addition, we present a complexity and power-saving comparison between our novel algorithms and conventional full-decoding (for select coding schemes) to demonstrate the significant power and complexity saving advantage of our algorithms.

A novel adaptive mutative scale optimization algorithm based on chaos genetic method and its optimization efficiency evaluation

By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite collapses within the finite region of [-1,1].Some measures in the optimization algorithm,such as adjusting the searching space of optimized variables continuously by using adaptive mutative scale method and making the most circle time as its control guideline,were taken to ensure its speediness and veracity in seeking the optimization process.The calculation examples about three testing functions reveal that AMSCGA has both high searching speed and high precision.Furthermore,the average truncated generations,the distribution entropy of truncated generations and the ratio of average inertia generations were used to evaluate the optimization efficiency of AMSCGA quantificationally.It is shown that the optimization efficiency of AMSCGA is higher than that of genetic algorithm.

Employing Computational Intelligence to Generate More Intelligent and Energy Efficient Living Spaces

Our living environments are being gradually occupied with an abundant number of digital objects that have networking and computing capabilities. After these devices are plugged into a network, they initially advertise their presence and capabilities in the form of services so that they can be discovered and, if desired, exploited by the user or other networked devices. With the increasing number of these devices attached to the network, the complexity to configure and control them increases, which may lead to major processing and communication overhead. Hence, the devices are no longer expected to just act as primitive stand-alone appliances that only provide the facilities and services to the user they are designed for, but also offer complex services that emerge from unique combinations of devices. This creates the necessity for these devices to be equipped with some sort of intelligence and self-awareness to enable them to be self-configuring and self-programming. However, with this ＂smart evolution＂, the cognitive load to configure and control such spaces becomes immense. One way to relieve this load is by employing artificial intelligence （AI） techniques to create an intelligent ＂presence＂ where the system will be able to recognize the users and autonomously program the environment to be energy efficient and responsive to the user＇s needs and behaviours. These AI mechanisms should be embedded in the user＇s environments and should operate in a non-intrusive manner. This paper will show how computational intelligence （CI）, which is an emerging domain of AI, could be employed and embedded in our living spaces to help such environments to be more energy efficient, intelligent, adaptive and convenient to the users.

A new energy efficient management approach for wireless sensor networks in target tracking

This paper mainly studied the problem of energy conserving in wireless sensor networks for target tracking in defensing combats. Firstly, the structures of wireless sensor nodes and networks were illustrated;Secondly, the analysis of existing energy consuming in the sensing layer and its calculation method were provided to build the energy conserving objective function;What’s more, the other two indicators in target tracking, including target detection probability and tracking accuracy, were combined to be regarded as the constraints of the energy conserving objective function. Fourthly, the three energy conserving approaches, containing optimizing the management scheme, prolonging the time interval between two adjacent observations, and transmitting the observations selectively, were introduced;In addition, the improved lion algorithm combined with the Logistic chaos sequence was proposed to obtain sensor management schemes. Finally, simulations had been made to prove the effectiveness of the proposed methods and algorithm.

ANCAEE: A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks

One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques that have been using to minimize sensor nodes’ energy consumption during operation. In this paper, A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (ANCAEE) has been proposed. The algorithm achieves good performance in terms of minimizing energy consumption during data transmission and energy consumptions are distributed uniformly among all nodes. ANCAEE uses a new method of clusters formation and election of cluster heads. The algorithm ensures that a node transmits its data to the cluster head with a single hop transmission and cluster heads forward their data to the base station with multi-hop transmissions. Simulation results show that our approach consumes less energy and effectively extends network utilization.

Efficient computation for dynamic responses of systems with time-varying characteristics

Based on Neumman series and epsilon-algorithm, an efficient computation for dynamic responses of systems with arbitrary time-varying characteristics is investigated. Avoiding the calculation for the inverses of the equivalent stiffness matrices in each time step, the computation effort of the proposed method is reduced compared with the full analysis of Newmark method. The validity and applications of the proposed method are illustrated by a 4-DOF spring-mass system with periodical time-varying stiffness properties and a truss structure with arbitrary time-varying lumped mass. It shows that good approximate results can be obtained by the proposed method compared with the responses obtained by the full analysis of Newmark method.

Application of k-person and k-task maximal efficiency assignment algorithm to water piping repair

Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.

Application of stochastic method to optimum design of energy-efficient induction motors with a target of LCC

For an energy-efficient induction machine, the life-cycle cost (LCC) usually is the most important index to the consumer. With this target, the optimization design of a motor is a complex nonlinear problem with constraints. To solve the problem, the authors introduce a united random algorithm. At first, the problem is divided into two parts, the optimal rotor slots and the optimization of other dimensions. Before optimizing the rotor slots with genetic algorithm ( GA), the second part is solved with TABU algorithm to simplify the problem. The numerical results showed that this method is better than the method using a traditional algorithm.

Efficient Cloud Resource Scheduling with an Optimized Throttled Load Balancing Approach

Cloud Technology is a new platform that offers on-demand computing Peripheral such as storage,processing power,and other computer system resources.It is also referred to as a system that will let the consumers utilize computational resources like databases,servers,storage,and intelligence over the Internet.In a cloud network,load balancing is the process of dividing network traffic among a cluster of available servers to increase efficiency.It is also known as a server pool or server farm.When a single node is overwhelmed,balancing the workload is needed to manage unpredictable workflows.The load balancer sends the load to another free node in this case.We focus on the Balancing of workflows with the proposed approach,and we present a novel method to balance the load that manages the dynamic scheduling process.One of the preexisting load balancing techniques is considered,however it is somewhat modified to fit the scenario at hand.Depending on the experimentation’s findings,it is concluded that this suggested approach improves load balancing consistency,response time,and throughput by 6%.

Efficient model building in active appearance model for rotated face

This paper proposes the efficient model building in active appearance model(AAM) for the rotated face.Finding an exact region of the face is generally difficult due to different shapes and viewpoints.Unlike many papers about the fitting method of AAM,this paper treats how images are chosen for fitting of the rotated face in modelling process.To solve this problem,databases of facial rotation and expression are selected and models are built using Procrustes method and principal component analysis(PCA).These models are applied in fitting methods like basic AAM fitting,inverse compositional alignment(ICA),project-out ICA,normalization ICA,robust normalization inverse compositional algorithm(RNIC)and efficient robust normalization algorithm(ERN).RNIC and ERN can fit the rotated face in images efficiently.The efficiency of model building is checked using sequence images made by ourselves.