Composite Graph Research Articles

Computing Dynamic Slices of Feature-Oriented Programs with Aspect-Oriented Extensions

This paper proposes a technique to compute dynamic slices of feature-oriented programs with aspect-oriented extensions. The technique uses a dependence based intermediate program representation called composite feature-aspect dependence graph (CFADG) to represent feature-oriented software that contain aspects. The CFADG of a feature-oriented program is based on the selected features that are composed to form a software product and the selected aspects to be weaved. The proposed dynamic slicing technique has been named feature-aspect node marking dynamic slicing (FANMDS) algorithm. The proposed feature-aspect node marking dynamic slicing algorithm is based on marking and unmarking the executed nodes in the CFADG suitably during run-time. The advantage of the proposed approach is that no trace le is used to store the execution history. Also, the approach does not create any additional nodes during run-time.

QoS Constrained Large Scale Web Service Composition Using Abstraction Refinement

Efficient service composition in real time while providing necessary Quality of Service (QoS) guarantees has been a challenging research problem with ever growing complexity. Several heuristic based approaches with diverse proposals for taming the scale and complexity of web service composition, have been proposed in literature. In this paper, we present a new approach for efficient service composition based on abstraction refinement. Instead of considering individual services during composition, we propose several abstractions to form service groups and the composition is done on these abstract services. Abstraction reduces the search space significantly and thereby can be done reasonably fast. While this can expedite solution construction to a great extent, this also entails a possibility that it may fail to generate any solution satisfying the QoS constraints, though the individual services construct a valid solution. Hence, we propose to refine an abstraction to generate the composite solution with desired QoS values. A QoS satisfying solution, if one exists, can be constructed with multiple iterations of abstraction refinement. While in the worst case, this approach may end up exploring the complete composition graph constructed on individual services, on an average, the solution can be achieved on the abstract graph. The abstraction refinement techniques give a significant speed-up compared to the traditional composition techniques. Experimental results on real benchmarks show the efficiency of our proposed mechanism in terms of time and the number of services considered for composition.

Self-Replicability of Composite Graph Reproduction System

Self-Replicability of Composite Graph Reproduction System

Laplacian Controllability of Interconnected Graphs

We consider the controllability of a graph constructed by interconnecting a finite number of single-input Laplacian controllable (SILC) graphs. We first study the interconnection realized by the composite graph of two SILC graphs, called the structure graph and the cell graph, respectively. Suppose the cell graph is Laplacian controllable by an input connected to some special vertex called the composite vertex. The composite graph is constructed by interconnecting several identical cell graphs through the composite vertices such that connecting these composite vertices alone forms the structure graph. We prove that the structure graph is SILC by an input connected to some vertex of the graph if and only if the composite graph is SILC by the same input connected to the same vertex. The second part of this article generalizes the path structure by viewing it as a serial interconnection of two-vertex antiregular graphs, with or without appending a terminal one-vertex path. We show that its SILC property is preserved if we increase the number of vertices of the antiregular graphs and/or that of the terminal path. Examples are provided to illustrate the novel class of SILC graphs we propose.

Fuse-Fuse Protection Scheme ETAP Model for IEEE 13 Node Radial Test Distribution Feeder

According to NEC 240.101 regulations each and every component of a power system distribution network has to have an over-current protective device (OCPD) for its protection. The OCPDs must coordinate with other devices both upstream and downstream for a reliable operation and protection of the power systems distribution network. There are four equipment/components for the IEEE 13 node radial test feeder each modelled in this paper to be protected by fuses. These components are namely the nodes, the underground cables, the overhead distribution lines and the transformers. Equipment protection is an important and necessary exercise of performing power systems protection coordination processes. The equipment and their over-current protective device’s time-current characteristic (TCC) curves are important tools used to show and to indicate the protection requirements, landmark points and damage curves for all power systems equipment. Individual equipment protection requirements and limitations are described and identified by use of their various landmarks and damage curves. These damage curves and the landmark points are all superimposed with the Time-Current Characteristic curves of the Over-Current Protective Devices used in protecting the equipment on one composite TCC graph. Equipment damage curves which fall to the right and above the Over-Current Protective Device’s TCC curves with sufficient margins are considered to be protected by the OCPDs. Equipment damage curves which fall to the left and below the OCPD’s TCC curves are considered not to be protected by the OCPDs. IEEE Standard 241 states that on all power systems, the OCPDs should be selected and set to open before the Ampacity mark, the short circuit damage curves, and both the thermal and the mechanical damage curves limits of the protected components are exceeded. This paper presents a detailed Fuse-Fuse protection scheme for the IEEE 13 node radial test feeder as modeled on the Electrical Transients Analysis Program (ETAP).

Fuse-Fuse Protection Scheme ETAP Model for IEEE 13 Node Radial Test Distribution Feeder

According to NEC 240.101 regulations each and every component of a power system distribution network has to have an over-current protective device (OCPD) for its protection. The OCPDs must coordinate with other devices both upstream and downstream for a reliable operation and protection of the power systems distribution network. There are four equipment/components for the IEEE 13 node radial test feeder each modelled in this paper to be protected by fuses. These components are namely the nodes, the underground cables, the overhead distribution lines and the transformers. Equipment protection is an important and necessary exercise of performing power systems protection coordination processes. The equipment and their over-current protective device’s time-current characteristic (TCC) curves are important tools used to show and to indicate the protection requirements, landmark points and damage curves for all power systems equipment. Individual equipment protection requirements and limitations are described and identified by use of their various landmarks and damage curves. These damage curves and the landmark points are all superimposed with the Time-Current Characteristic curves of the Over-Current Protective Devices used in protecting the equipment on one composite TCC graph. Equipment damage curves which fall to the right and above the Over-Current Protective Device’s TCC curves with sufficient margins are considered to be protected by the OCPDs. Equipment damage curves which fall to the left and below the OCPD’s TCC curves are considered not to be protected by the OCPDs. IEEE Standard 241 states that on all power systems, the OCPDs should be selected and set to open before the Ampacity mark, the short circuit damage curves, and both the thermal and the mechanical damage curves limits of the protected components are exceeded. This paper presents a detailed Fuse-Fuse protection scheme for the IEEE 13 node radial test feeder as modeled on the Electrical Transients Analysis Program (ETAP).

Computing Dynamic Slices of Concurrent Feature-Oriented Programs

This paper proposes a dynamic slicing algorithm for concurrent feature-oriented programs. The algorithm is named concurrent feature-oriented node-marking dynamic slicing (CFNMDS) algorithm. The proposed dynamic slicing technique uses a dependence based intermediate representation named concurrent composite feature dependence graph (CCFDG). It is based on marking and unmarking of the executed nodes in CCFDG appropriately during runtime. Ten standard open source product lines have been taken to experiment the proposed CFNMDS algorithm. Jak codes and feature-oriented models have been developed for these product lines. The advantage of the proposed approach is that no trace file is used to store execution history of the program. Also, no extra nodes are created during runtime in the proposed approach. Creation of extra nodes leads to take more time for marking and unmarking process. Use of any extra file also leads to higher runtime overhead for input/output operations. This results in taking more time to compute the slices. So, it is necessary to compute dynamic slices in less time without using any trace file and extra nodes. Using the proposed approach, slices can be extracted in O(1) i.e., in constant time. The slice computation time for various combinations of features for each product line has also been measured.

The M-polynomial of line graph of subdivision graphs

Three composite graphs Ladder graph (L_{n}), Tadpole graph (T_{n,k}) and Wheel graph (W_{n}) are graceful graphs, which have different applications in electrical, electronics, wireless communication etc. In this report, we first determine M-polynomial of the Line graph of those three graphs using subdivision idea and then compute some degree based indices of the same.

OPTIMIZATIONAL TRACTION TASKS ON THE RAILWAY NETWORK

Purpose. The paper involves the development of information and algorithmic support for conducting the optimization traction and energy calculations on the railway network for their further use in decision-making systems – systems for efficient management of the transport process. Methodology. The system is based on the graph-analytic system, the model of the train with different types of traction, the methods of optimal control of the train and the fundamental algorithms on the weighted graphs with possible parallel ribs (arcs). In the complex, these components of the system provide finding the tracks on the chart-diagram according to the given criteria, conducting the optimization traction-energy calculations according to different criteria, as well as conducting a comparative analysis of the obtained results. The reliability of the results has been repeatedly checked by available methods for varying complexity of race according to the plan and profile of the course. For this purpose, data obtained as a result of control visits using dynamometric cars were used. Also a comparative analysis of the modes in operation of trains, calculated and received by qualified drivers on different races was conducted. Findings. The problem of efficient operation of various types and modifications of locomotives, involved in the implementation of trains schedules for different purposes and loads is considered. Presentations of direct and inverse optimization, according to various criteria, of the regime tasks on the railway network and variants of their effective solution are given. The analysis of the results of the developed mathematical support and the ideas of implemented algorithms is given. Originality. The paper proposes the establishment of the network optimization problems that arise at the stages of the developing the plan for the formation, construction of traffic schedules, transmission capacity assessment and the calculation of optimal parameters for the composite graphs of motion, etc. The system approach is important to ensure the combination of the developed network structure in the universal terms of the graph theory with the system of actualization of their parameters. Pull and energy efficiency calculations are carried out by combinatorial optimization methods, which ensured the maximum level of automation of the process in solving a large set of direct and inverse regime problems with different optimality criteria. Practical value. The information and algorithmic support for the automation of the process in solving the direct and reverse regime traction-energy problems on the railway network was developed. It was tested in the process of calculating the main components for the formation of traffic schedules, analysis of train driving modes, assessment in choosing the optimal parameters of the track reconstruction for high-speed and new types of trains (locomotives).

Betweenness centrality in convex amalgamation of graphs

Betweenness centrality measures the potential or power of a node to control the communication over the network under the assumption that information flows primarily over the shortest paths between pair of nodes. The removal of a node with highest betweenness from the network will most disrupt communications between other nodes because it lies on the largest number of paths. A large network can be thought of as inter-connection between smaller networks by means of different graph operations. Thus the structure of a composite graph can be studied by analysing its component graphs. In this paper we present the betweenness centrality of some classes of composite graphs constructed by the graph operation called amalgamation or merging.

Architectural Composition: A Systematic Method to Define a List of Visual Attributes

Architects are now capable to construct diverse architectural compositions with various formal attributes. Although theorists have defined diverse sets of composition attributes, no former list covers the features of our newly built buildings. This study, for the first time, introduces a systematic method to define all the visual attributes in the composition of a building. Arising from the definition of composition, the proposed method, after defining the composition layers and families, prepares a composition graph; then, by introducing three roots of the attributes, it creates a list of the visual attributes. To give a better insight, the method applied to four buildings and their visual attributes are extracted accordingly. The employment of the procedure on a set of building images sharing a criterion can reflect the most in-common formal attributes among them. Therefore, a list of building attributes are also prepared by applying the method on 200 randomly selected building images. The proposed method is adjustable to our needs and also applicable to various art forms which the term composition covers. Consequently, the introduced method has the potential to be an assistive tool in many formal explorations studies.

Transitional Behavior of $q$-Composite Random Key Graphs With Applications to Networked Control

Random key graphs have received considerable attention and been used in various applications including secure sensor networks, social networks, the study of epidemics, cryptanalysis, and recommender systems. In this paper, we investigate a $q$-composite random key graph, whose construction on $n$ nodes is as follows: each node independently selects a set of $K_n$ different keys uniformly at random from the same pool of $P_n$ distinct keys, and two nodes establish an undirected edge in between if and only if they share at least $q$ key(s). Such graph denoted by $G_q(n,K_n,P_n)$ models a secure sensor network employing the well-known $q$-composite key predistribution. For $G_q(n,K_n,P_n)$, we analyze the probabilities of $G_q(n,K_n,P_n)$ having $k$-connectivity, $k$-robustness, a Hamilton cycle and a perfect matching, respectively. Our studies of these four properties are motivated by a detailed discussion of their applications to networked control. Our results reveal that $G_q(n,K_n,P_n)$ exhibits a sharp transition for each property: as $K_n$ increases, the probability that $G_q(n,K_n,P_n)$ has the property sharply increases from $0$ to $1$. These results provide fundamental guidelines to design secure sensor networks for different control-related applications: distributed in-network parameter estimation, fault-tolerant consensus, and resilient data backup.

New formulae for the bipartite vertex frustration and decycling number of graphs

Let ∇2(G), φ(G) and ∇(G) denote the bipartite vertex frustration, bipartite edge frustration and decycling number of a graph G, respectively. In this paper, we show that ∇2(G)=|V(G)|−max{α(G−E(B)):B is a spanning bipartite subgraph of G}, which provides a new method to estimate the bipartite vertex frustration in terms of bipartite edge frustration for graphs. Using the formula above and some known results on the bipartite edge frustration, we derive several new results on the bipartite vertex frustration, including some that are equalities. Further, we study the bipartite vertex frustration of five classes of composite graphs. Finally, we present a formula for the decycling number: ∇(G)=|V(G)|−max{α(G−E(F)):FisaspanningforstofG}. Based on this result, we determine the decycling numbers of many certain graphs. In addition, this formula gives a new way for dealing with the decycling number problem of dense graphs.

Vertex Hyper-Zagreb Index of Graphs

In this paper, we obtain the vertex hyper-Zagreb index for some composite graphs. Using the results obtained here, the vertex hyper-Zagreb index for some important classes of graphs are obtained.

EasyQC: Tool with Interactive User Interface for Efficient Next-Generation Sequencing Data Quality Control.

The advent of next-generation sequencing (NGS) technologies has revolutionized the world of genomic research. Millions of sequences are generated in a short period of time and they provide intriguing insights to the researcher. Many NGS platforms have evolved over a period of time and their efficiency has been ever increasing. Still, primarily because of the chemistry, glitch in the sequencing machine and human handling errors, some artifacts tend to exist in the final sequence data set. These sequence errors have a profound impact on the downstream analyses and may provide misleading information. Hence, filtering of these erroneous reads has become inevitable and myriad of tools are available for this purpose. However, many of them are accessible as a command line interface that requires the user to enter each command manually. Here, we report EasyQC, a tool for NGS data quality control (QC) with a graphical user interface providing options to carry out trimming of NGS reads based on quality, length, homopolymer, and ambiguous bases. EasyQC also possesses features such as format converter, paired end merger, adapter trimmer, and a graph generator that generates quality distribution, length distribution, GC content, and base composition graphs. Comparison of raw and processed sequence data sets using EasyQC suggested significant increase in overall quality of the sequences. Testing of EasyQC using NGS data sets on a standalone desktop proved to be relatively faster. EasyQC is developed using PERL modules and can be executed in Windows and Linux platforms. With the various QC features, easy interface for end users, and cross-platform compatibility, EasyQC would be a valuable addition to the already existing tools facilitating better downstream analyses.

Increasing the Efficiency and Accuracy of Labile Cu Measurement in Wine with Screen-Printed Electrodes

Development of oxidative and reductive flavors in wine can be influenced by the concentration and form of Cu within the wine. Electrochemical techniques have been devised to quantitate electrochemically active Cu (labile) in wine, as opposed to inactive Cu (non-labile). However, the electrochemical methods to measure labile Cu may be biased by the wine matrix, require lengthy calibration processes and/or unduly perturb the wine matrix during measurement. In this study, medium exchange stripping potentiometry was utilized with a thin mercury film on a screen-printed carbon electrode to provide a quantitation method that could largely overcome these limitations. The best average recoveries for 0.040 mg/L of labile Cu of 101 ± 15% (n = 12) were observed using composite calibration graphs prepared in oxidized wines and on multiple electrodes and using Pb as an internal standard. Composite calibration curves performed on different electrodes to the sample analysis were as effective in quantifying labile Cu as calibration curves performed on the same electrode as the sample. The results allow selection of a quantitation procedure that will suit the required speed and accuracy of labile Cu determination.

Identification and Quantification of CO2 Solidification in Cryogenic CO2 Capture from Natural Gas

The composition of natural gas strongly depends on the geological conditions and depth of the gas well. Presently, CO2 content in the discovered natural gas reservoirs is up to 90%. Prior to customer use, the amount of CO2 needs to be reduced. Cryogenic CO2 capture is one of the emerging technology for CO2 capture from natural gas. Comprehensive knowledge of vapor-liquid, vapor-solid, and solid-liquid equilibria for the gaseous mixture is required for designing cryogenic separation processes for CO2 capture from its gaseous mixtures. No thermodynamic phase data is available for the highest CO2 content N.G mixture. The present work is an effort to generate the thermodynamic data for CO2 capture at low temperatures. CO2 solid phase identification and quantification need to be studied for the CO2-CH4 binary mixture. In this work, four samples of natural gas having CO2 content 40%, 60%, 75% and 90% were selected for simulation through Aspen HYSYS. Pressure-temperature data and temperature-composition data for the binary mixtures were predicted using PR EoS for CO2 phase identification and quantification respectively. Simulation for temperature- composition phase envelope was carried out at different pressures i.e. 10, 20, 30, and 40 bar. The operating region selected from the P-T phase envelop was from 1 to 40 bars. From the temperature composition graphs, it was concluded that temperature for the maximum CO2 capture in S-V region at 10, 20, 30, and 40 bar is -95, -90, -75, and -70 °C respectively.

Entropies of Composite Graphs

For measuring the complexity of a graph, an information-theoretic quantity, that is, entropy function is used. In this paper, we investigate and present explicit formulae for the complexity of classes of composite graphs based on R-graphs by evaluating the generalized graph entropies. In addition, a polynomial time algorithm is designed for computing the generalized entropy of graphs.

An efficient heuristic approach for learning a set of composite graph classification rules

An efficient heuristic approach for learning a set of composite graph classification rules

On common neighborhood graphs II

Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.