Sequence Of Paths Research Articles

Rapid Restoration Sequence of Fiber Links and Communication Paths from Catastrophic Failures

Rapid Restoration Sequence of Fiber Links and Communication Paths from Catastrophic Failures

Theorem of Optimal Image Trajectories in the Restricted Problem of Three Bodies

The restricted three-body problem represents the dynamical framework employed for spacecraft mission analysis, in the presence of two attracting bodies, since the 1950s. In this context, orbital motion is often chaotic, although several special solutions (equilibrium points, periodic orbits, and quasiperiodic trajectories) exist, and can be--or have already been--profitably employed in space missions. The theorem of image trajectories, proven five decades ago by Miele, states that for a given path in the restricted problem of three bodies (with primaries in mutual circular orbits), there exists a mirror trajectory (in two dimensions) and three mirror paths (in three dimensions). This theorem regards feasible trajectories and proved extremely useful for investigating the natural dynamics in the restricted problem of three bodies, by identifying special solutions, such as symmetric periodic orbits and free return trajectories. This work extends the theorem of image trajectories to optimal paths, which minimize either the propellant consumption or the time of flight, by determining the relations between the optimal thrust sequence, magnitude, and direction of an outgoing path and a symmetrical returning trajectory. This means that while the theorem of image paths revealed extremely useful for investigating natural dynamics, the theorem of optimal image trajectories can be profitably employed for powered orbital motion, i.e., in the context of impulsive and finite-thrust orbit transfers and rendezvous, as well as for the purpose of analyzing artificial periodic orbits that use very low thrust propulsion.

Enumerating message paths for interaction testing of object-oriented systems

MM path is integration artifact of object-oriented systems and is characterized by interleaved sequence of messages and method execution paths. In the context of UML sequence diagrams, an MM path is usually found common in many message paths and concatenation of one MM path with different MM paths results in distinct message paths. Adequate testing of all message paths in UML sequence diagrams implies the coverage of all possible concatenation of constituent MM paths in different object-states, which may not be fully achieved in practical situations. With limited test effort, practitioners are compelled to consider a subset of all message paths in ad-hoc manner or priority basis. It can be possible that the selected paths may not include at least one instance of highly critical MM path, whereas less critical MM paths may have been included with multiple instances. It is, therefore, necessary that the selected message paths would contain one instance of all MM paths and their additional instances as per their priorities. To address this problem, we propose two coverage criteria: all MM paths and prioritized MM paths and an MM path-based coverage model. To obtain such coverage model, we build a graph model called as sequence integration graph from the sequence diagram and thereafter, synthesize MM paths to merge them into a set of connected trees. Further, we capture priority information of the MM paths by means of edge weights and order of concatenation among the MM paths by means of connector edges between the trees. These information captured in the MM coverage model helps to determine effective coverage of the MM paths. Our experimental results substantiate usefulness of our MM path-based coverage model for selecting message paths to satisfy all MM paths and prioritized MM paths coverage criteria in the context of integration testing of object-oriented systems with the limited testing effort.

Mining preferred navigation patterns by consolidating both selection and time preferences

Preferred navigation patterns (PNP) are those contiguous sequential patterns whose elements are preferred by users to be selected as the next steps between several different selections and are preferred by users to spend much time on. Such navigation path and time preferred patterns are more actionable than any other finds only considering either path or time in various web applications, such as web user navigation, targeted online advertising and recommendation. However, due to the conceptual confusion and limitation on navigation preference in the existing work, the corresponding algorithms cannot discover actionable preferred navigation patterns. In this paper, we study the problem of preferred navigation pattern mining by involving both navigation path and time length. Firstly, we carefully define the concepts of time preference and selection preference for time-related path sequences, which can well reflect user interests from the relative path selection and time consumption respectively. Secondly, we propose an efficient PNP-forest algorithm for identifying PNPs, by first introducing PNP-forest data structure, and then presenting PNP-forest growth and maintenance mechanism, associated with optimization strategies. Then we introduce a more efficient mining algorithm called PrefixSpan_Forest, which integrates the advantages of PrefixSpan and PNP-forest. The performance of these two algorithms are also evaluated and the results show that the algorithms can discover PNPs effectively.

An algorithm to find critical execution paths of software based on complex network

The critical execution paths play an important role in software system in terms of reducing the numbers of test date, detecting the vulnerabilities of software structure and analyzing software reliability. However, there are no efficient methods to discover them so far. Thus in this paper, a complex network-based software algorithm is put forward to find critical execution paths (FCEP) in software execution network. First, by analyzing the number of sources and sinks in FCEP, software execution network is divided into AOE subgraphs, and meanwhile, a Software Execution Network Serialization (SENS) approach is designed to generate execution path set in each AOE subgraph, which not only reduces ring structure's influence on path generation, but also guarantees the nodes' integrity in network. Second, according to a novel path similarity metric, similarity matrix is created to calculate the similarity among sets of path sequences. Third, an efficient method is taken to cluster paths through similarity matrices, and the maximum-length path in each cluster is extracted as the critical execution path. At last, a set of critical execution paths is derived. The experimental results show that the FCEP algorithm is efficient in mining critical execution path under software complex network.

The Complete cd-Index of Boolean Lattices

Let $[u,v]$ be a Bruhat interval of a Coxeter group such that the Bruhat graph $BG(u,v)$ of $[u,v]$ is isomorphic to a Boolean lattice. In this paper, we provide a combinatorial explanation for the coefficients of the complete cd-index of $[u,v]$. Since in this case the complete cd-index and the cd-index of $[u,v]$ coincide, we also obtain a new combinatorial interpretation for the coefficients of the cd-index of Boolean lattices. To this end, we label an edge in $BG(u,v)$ by a pair of nonnegative integers and show that there is a one-to-one correspondence between such sequences of nonnegative integer pairs and Bruhat paths in $BG(u,v)$. Based on this labeling, we construct a flip $\mathcal{F}$ on the set of Bruhat paths in $BG(u,v)$, which is an involution that changes the ascent-descent sequence of a path. Then we show that the flip $\mathcal{F}$ is compatible with any given reflection order and also satisfies the flip condition for any cd-monomial $M$. Thus by results of Karu, the coefficient of $M$ enumerates certain Bruhat paths in $BG(u,v)$, and so can be interpreted as the number of certain sequences of nonnegative integer pairs. Moreover, we give two applications of the flip $\mathcal{F}$. We enumerate the number of cd-monomials in the complete cd-index of $[u,v]$ in terms of Entringer numbers, which are refined enumerations of Euler numbers. We also give a refined enumeration of the coefficient of d${}^n$ in terms of Poupard numbers, and so obtain new combinatorial interpretations for Poupard numbers and reduced tangent numbers.

Statistical approach for activity-based model calibration based on plate scanning and traffic counts data

Traditionally, activity-based models (ABM) are estimated from travel diary survey data. The estimated results can be biased due to low-sampling size and inaccurate travel diary data. For an accurate calibration of ABM parameters, a maximum-likelihood method that uses multiple sources of roadside observations (link counts and/or plate scanning data) is proposed. Plate scanning information (sensor path information) consists of sequences of times and partial paths that the scanned vehicles are observed over the preinstalled plate scanning locations. Statistical performances of the proposed method are evaluated on a test network using Monte Carlo technique for simulating the link flows and sensor path information. Multiday observations are simulated and derived from the true ABM parameters adopted in the choice models of activity pattern, time of the day, destination and mode. By assuming different number of plate scanning locations and identification rates, impacts of data quantity and data quality on ABM calibration are studied. The results illustrate the efficiency of the proposed model in using plate scanning information for ABM calibration and its potential for large and complex network applications.

On the Decomposition of the Hochschild Cohomology Group of a Monomial Algebra Satisfying a Separability Condition

In this paper, we consider the finite connected quiver Q having two subquivers Q (1) and Q (2) with . Suppose that Q (i) is not a subquiver of Q (j) where {i, j} = {1, 2}. For a monomial algebra Λ =kQ/I obtained by the quiver Q, when the associated sequence of paths given by Minsharp <(I) satisfies a certain separability condition, we propose the method so that we easily construct a minimal projective resolution of Λ as a right Λ e -module and calculate the Hochschild cohomology group of Λ.

Renewable energy sources for complete optimal power system black‐start restoration

Integration of renewable energy sources (RESs) may increase the risk of power system blackouts because of the uncertainty nature of their output power. In the meantime, RESs have relatively short starting time when compared with non-black start (BS) generating units. For this reason, RES needs to participate in power system restoration after blackouts. For a complete power system restoration, three stages must be completed. These stages are: generation restoration, transmission system restoration and load pick up. To achieve a faster restoration process, an optimal schedule for the BS units to crank the non-BS (NBS) units is required with optimal transmission path selection. In addition, to maintain the stability of the system and satisfy the system operational constraints, an optimal load pick-up sequence is required. In this study, the firefly algorithm (FA) is used to find the optimal final sequence of NBS units restoration, transmission paths and load pick-up sequence with and without the aid of RES in the system. The objective is to minimise the overall restoration time and the unserved load which maximise the energy capability and improve the sustainability of the system. The proposed algorithm is applied successfully to the IEEE 39-bus system.

A Framework for Mining Actionable Navigation Patterns from In-Store RFID Datasets via Indoor Mapping

With the quick development of RFID technology and the decreasing prices of RFID devices, RFID is becoming widely used in various intelligent services. Especially in the retail application domain, RFID is increasingly adopted to capture the shopping tracks and behavior of in-store customers. To further enhance the potential of this promising application, in this paper, we propose a unified framework for RFID-based path analytics, which uses both in-store shopping paths and RFID-based purchasing data to mine actionable navigation patterns. Four modules of this framework are discussed, which are: (1) mapping from the physical space to the cyber space, (2) data preprocessing, (3) pattern mining and (4) knowledge understanding and utilization. In the data preprocessing module, the critical problem of how to capture the mainstream shopping path sequences while wiping out unnecessary redundant and repeated details is addressed in detail. To solve this problem, two types of redundant patterns, i.e., loop repeat pattern and palindrome-contained pattern are recognized and the corresponding processing algorithms are proposed. The experimental results show that the redundant pattern filtering functions are effective and scalable. Overall, this work builds a bridge between indoor positioning and advanced data mining technologies, and provides a feasible way to study customers’ shopping behaviors via multi-source RFID data.

A model of vesicle tubulation and pearling induced by adsorbing particles.

We study the basic theoretical model of a deformable vesicle immersed in a solution of particles that can adsorb onto one of the two surfaces of a membrane. The model consists of an adsorption energy gain for the adsorbing particles and the Canham-Helfrich membrane bending energy, in which the spontaneous curvature is coupled with the adsorption area. We demonstrate that bud, pearling, and tube conformations can be stabilized after minimizing the free energy and that the pearling-tubulation transition has the characteristics of an abrupt structural transition.

COOBBO: A Novel Opposition-Based Soft Computing Algorithm for TSP Problems

In this paper, we propose a novel definition of opposite path. Its core feature is that the sequence of candidate paths and the distances between adjacent nodes in the tour are considered simultaneously. In a sense, the candidate path and its corresponding opposite path have the same (or similar at least) distance to the optimal path in the current population. Based on an accepted framework for employing opposition-based learning, Oppositional Biogeography-Based Optimization using the Current Optimum, called COOBBO algorithm, is introduced to solve traveling salesman problems. We demonstrate its performance on eight benchmark problems and compare it with other optimization algorithms. Simulation results illustrate that the excellent performance of our proposed algorithm is attributed to the distinct definition of opposite path. In addition, its great strength lies in exploitation for enhancing the solution accuracy, not exploration for improving the population diversity. Finally, by comparing different version of COOBBO, another conclusion is that each successful opposition-based soft computing algorithm needs to adjust and remain a good balance between backward adjacent node and forward adjacent node.

A Dilution-matching-encoding compaction of trajectories over road networks

Many devices nowadays record traveled routes as sequences of GPS locations. With the growing popularity of smartphones, millions of such routes are generated each day, and many routes have to be stored locally on the device or transmitted to a remote database. It is, thus, essential to encode the sequences, in order to decrease the volume of the stored or transmitted data. In this paper we study the problem of encoding routes over a vectorial road network (map), where GPS locations can be associated with vertices or with road segments. We consider a three-step process of dilution, map-matching and coding, which helps reducing the amount of transmitted data between the cellular device and remote servers. We present two methods to code routes. The first method represents the given route as a sequence of greedy paths. We provide two algorithms to generate a greedy-path code for a sequence of n vertices on the map. The first algorithm has O(n) time complexity, and the second one has O(n 2) time complexity, but it is optimal, meaning that it generates the shortest possible greedy-path code. Decoding a greedy-path code can be done in O(n) time. The second method encodes a route as a sequence of shortest paths. We provide algorithms to generate unidirectional and bidirectional optimal shortest-path codes. Encoding and decoding a shortest-path code can be done in O(k n 2 logn) time, where k is the length of the produced code, assuming the graph valency is bounded. Our experimental evaluation shows that shortest-path codes are more compact than greedy-path codes, justifying the larger time complexity.

Weighted time-based global hierarchical path planning in dynamic environment

A weighted time-based global hierarchical path planning method is proposed to obtain the global optimal path from the starting point to the destination with time optimal control. First, the grid- or graph-based modeling is performed and the environment is divided into a set of grids or nodes. Then two time-based features of time interval and time cost are presented. The time intervals for each grid are built, during each interval the condition of the grid remains stable, and a time cost of passing through the grid is defined and assigned to each interval. Furthermore, the weight is introduced for taking both time and distance into consideration, and thus a sequence of multiscale paths with total time cost can be achieved. Experimental results show that the proposed method can handle the complex dynamic environment, obtain the global time optimal path and has the potential to be applied to the autonomous robot navigation and traffic environment.

Tool path generation framework for accurate manufacture of complex 3D sheet metal parts using single point incremental forming

The prototyping of complex sheet metal parts using single point incremental forming (SPIF) requires the generation of optimal tool paths and/or tool path sequences that ensure that the formed part is within geometric design specifications. The presence of a multitude of features on complex parts leads to multiple inaccuracy inducing phenomena occurring simultaneously due to interactions between the features. This paper proposes a network analysis methodology using topological conceptual graphs to capture the effects of different phenomena on the final accuracy of a sheet metal part manufactured by SPIF. Using this framework optimized tool paths can be generated that compensate for the inaccuracy inducing behavior. Tool path generation algorithms to create partial tool paths that account for the accuracy of specific features in the part based on the proposed framework are also presented. Finally, the creation of integrated tool paths maintaining complementarity between tool paths and desired continuity behavior using non-uniform cubic B-splines is illustrated. A number of case studies demonstrating the applicability of the integrated framework are discussed, where the maximum deviations in the part are significantly reduced and the average absolute deviations for the complete part are brought down to less than 0.5mm.

Processing Uncertain RFID Data in Traceability Supply Chains

Radio Frequency Identification (RFID) is widely used to track and trace objects in traceability supply chains. However, massive uncertain data produced by RFID readers are not effective and efficient to be used in RFID application systems. Following the analysis of key features of RFID objects, this paper proposes a new framework for effectively and efficiently processing uncertain RFID data, and supporting a variety of queries for tracking and tracing RFID objects. We adjust different smoothing windows according to different rates of uncertain data, employ different strategies to process uncertain readings, and distinguish ghost, missing, and incomplete data according to their apparent positions. We propose a comprehensive data model which is suitable for different application scenarios. In addition, a path coding scheme is proposed to significantly compress massive data by aggregating the path sequence, the position, and the time intervals. The scheme is suitable for cyclic or long paths. Moreover, we further propose a processing algorithm for group and independent objects. Experimental evaluations show that our approach is effective and efficient in terms of the compression and traceability queries.

Prediction of moving object trajectory based on probabilistic suffix tree

In the prediction of moving object trajectory, concerning the low accuracy rate of low order Markov model and the expansion of state space in high order model, a dynamic adaptive Probabilistic Suffix Tree( PST) prediction method based on variable length Markov model was proposed. Firstly, moving object's trajectory path was serialized according to the time;then the probability characteristic of sequence context was trained and calculated from the historical trajectory data of moving objects, the probabilistic suffix tree model based path sequence was constructed, combined with the actual trajectory data,thus the future trajectory information could be predicted dynamically and adaptively. The experimental results show that the highest prediction accuracy was obtained in second order model, with the order of the model increasing, the prediction accuracy was maintained at about 82% and better prediction results were achieved. In the meantime, space complexity was decreased exponentially and storage space was reduced greatly. The proposed method made full use of historical data and current trajectory information to predict the future trajectory, and provided a more flexible and efficient location-based services.

Impact of Baseline Terms on the Course of Critical Paths and Time Buffers in the Modified Goldratt’s Method

Abstract The introduction of a baseline term to the dependency network most often results in a change, break and/or generation of a new sequence of critical path, depending on the type of such a baseline term and the exact date selected. Each of those situations has an impact on the location or need to include new time buffers in the modified Goldratt’s method. The purpose of this article was to identify possible effects brought by declaration of each type of baseline term and to point out actions to be taken in each case. It must be noted that guidelines provided should in each individual case be adapted to the specific character of schedule changes caused by implementation of the relevant baseline term. The example presented herein exemplifies one of such solutions to be implemented as a result of break of the critical path and need to introduce new time buffers.

The Research on Modified Park-Ang Damage Model Based on Effective Energy Dissipation

Collapse of buildings in earthquakes causes casualties and economic losses, the reinforced concrete columns damage models is a basis for the research of integer collapse. The major advantage of Park and Ang's method is the consideration of first exceedance failure and cumulative damage failure in terms of defining the structural damage under earthquake, however, it isn't consider the differences of structural failures by different displacement amplitudes and load sequence. By multiplying the effective energy dissipation factor and the load sequence factor, the modified Park-Ang seismic damage model is obtained. The comparison between the two models indicates that the modified Park-Ang model have mean value closer to 1 and smaller scatter, besides the effects of load path and load sequence on damage can be taken into account in the modified model.

The Shortest Path Algorithm Dynamic Visualization Realization

By using object oriented method design graph vertices into class, and in this foundation to increase visual member, realize from the source point to the other vertex of the shortest path algorithm of dynamic visualization. Around the two sync window animation, the left window with thick lines drawn through the vertices and edges, " revealed the source point to the other vertex of the shortest path " list box display shortest path sequence and path length, the right window demonstration algorithm dynamic implementation process, and in the " S " text box to display the current most find shortest path vertices. The system has friendly interface, visual image.