An improved genetic algorithm and graph theory based method for optimal sectionalizer switch placement in distribution networks with DG

In this paper a new graph-theory and improved genetic algorithm based practical method is employed to solve the optimal sectionalizer switch placement problem. The proposed method determines the best locations of sectionalizer switching devices in distribution networks considering the effects of presence of distributed generation (DG) in fitness functions and other optimization constraints, providing the maximum number of costumers to be supplied by distributed generation sources in islanded distribution systems after possible faults. The proposed method is simulated and tested on several distribution test systems in both cases of with DG and non DG situations. The results of the simulations validate the proposed method for switch placement of the distribution network in the presence of distributed generation.

Graph rigidity for near-coplanar structure from motion

Recent algorithms for monocular motion capture (MoCap) estimate weak-perspective camera matrices between images using a small subset of approximately-rigid points on the human body (i.e. the torso and hip). A problem with this approach, however, is that these points are often close to coplanar, causing canonical linear factorisation algorithms for rigid structure from motion (SFM) to become extremely sensitive to noise. In this paper, we propose an alternative solution to weak-perspective SFM based on a convex relaxation of graph rigidity. We demonstrate the success of our algorithm on both synthetic and real world data, allowing for much improved solutions to marker less MoCap problems on human bodies. Finally, we propose an approach to solve the two-fold ambiguity over bone direction using a k-nearest neighbour kernel density estimator.

Hydrogen-bonding in cyclic imides and amide carboxylic acid derivatives from the facile reaction of cis-cyclohexane-1,2-carboxylic anhydride with o- and p-anisidine and m- and p-aminobenzoic acids

The structures of the open chain amide carboxylic acid rac-cis-[2-(2-methoxyphenyl)carbamoyl]cyclohexane-1-carboxylic acid, C15H19NO4, (I) and the cyclic imides rac-cis-2-(4-methoxyphenyl)-3a,4,5,6,7,7-hexahydroisoindole-1,3-dione,C15H17NO3, (II), chiral cis-2-(3-carboxyphenyl)-3a,4,5,6,7,7a-hexahydroisoindole-1,3-dione, C15H15NO4,(III) and rac-cis-2-(4-carboxyphenyl)- 3a,4,5,6,7,7a-hexahydroisoindole-1,3-dione monohydrate, C15H15NO4. H2O) (IV), are reported. In the amide acid (I), the phenylcarbamoyl group is essentially planar [maximum deviation from the least-squares plane = 0.060(1)Ang. for the amide O atom], the molecules form discrete centrosymmetric dimers through intermolecular cyclic carboxy-carboxy O-H...O hydrogen-bonding interactions [graph set notation R2/2(8)]. The cyclic imides (II)--(IV) are conformationally similar, with comparable phenyl ring rotations about the imide N-C(aromatic) bond [dihedral angles between the benzene and isoindole rings = 51.55(7)deg. in (II), 59.22(12)deg. in (III) and 51.99(14)deg. in (IV). Unlike (II) in which only weak intermolecular C-H...O(imide) hydrogen bonding is present, the crystal packing of imides (III) and (IV) shows strong intermolecular carboxylic acid O-H...O hydrogen-bonding associations. With (III), these involve imide O-atom acceptors, giving one-dimensional zigzag chains [graph set C(9)], while with the monohydrate (IV), the hydrogen bond involves the partially disordered water molecule which also bridges molecules through both imide and carboxyl O-atom acceptors in a cyclic R4/4(12) association, giving a two-dimensional sheet structure. The structures reported here expand the structural data base for compounds of this series formed from the facile reaction of cis-cyclohexane-1,2-dicarboxylic anhydride with substituted anilines, in which there is a much larger incidence of cyclic imides compared to amide carboxylic acids.

Large scale monocular vision-only mapping from a fixed-wing sUAS

This paper presents the application of a monocular visual SLAMon a fixed-wing small Unmanned Aerial System (sUAS) capable of simultaneous estimation of aircraft pose and scene structure. We demonstrate the robustness of unconstrained vision alone in producing reliable pose estimates of a sUAS, at altitude. It is ultimately capable of online state estimation feedback for aircraft control and next-best-view estimation for complete map coverage without the use of additional sensors.We explore some of the challenges of visual SLAM from a sUAS including dealing with planar structure, distant scenes and noisy observations. The developed techniques are applied on vision data gathered from a fast-moving fixed-wing radio control aircraft flown over a 1×1km rural area at an altitude of 20-100m.We present both raw Structure from Motion results and a SLAM solution that includes FAB-MAP based loop-closures and graph-optimised pose. Timing information is also presented to demonstrate near online capabilities. We compare the accuracy of the 6-DOF pose estimates to an off-the-shelfGPS aided INS over a 1.7kmtrajectory.We also present output 3D reconstructions of the observed scene structure and texture that demonstrates future applications in autonomous monitoring and surveying.

Planar radial spots in a three-component FitzHugh-Nagumo system

Localized planar patterns arise in many reaction-diffusion models. Most of the paradigm equations that have been studied so far are two-component models. While stationary localized structures are often found to be stable in such systems, travelling patterns either do not exist or are found to be unstable. In contrast, numerical simulations indicate that localized travelling structures can be stable in three-component systems. As a first step towards explaining this phenomenon, a planar singularly perturbed three-component reaction-diffusion system that arises in the context of gas-discharge systems is analysed in this paper. Using geometric singular perturbation theory, the existence and stability regions of radially symmetric stationary spot solutions are delineated and, in particular, stable spots are shown to exist in appropriate parameter regimes. This result opens up the possibility of identifying and analysing drift and Hopf bifurcations, and their criticality, from the stationary spots described here.

Graph-based concept weighting for medical information retrieval

This paper presents a graph-based method to weight medical concepts in documents for the purposes of information retrieval. Medical concepts are extracted from free-text documents using a state-of-the-art technique that maps n-grams to concepts from the SNOMED CT medical ontology. In our graph-based concept representation, concepts are vertices in a graph built from a document, edges represent associations between concepts. This representation naturally captures dependencies between concepts, an important requirement for interpreting medical text, and a feature lacking in bag-of-words representations. We apply existing graph-based term weighting methods to weight medical concepts. Using concepts rather than terms addresses vocabulary mismatch as well as encapsulates terms belonging to a single medical entity into a single concept. In addition, we further extend previous graph-based approaches by injecting domain knowledge that estimates the importance of a concept within the global medical domain. Retrieval experiments on the TREC Medical Records collection show our method outperforms both term and concept baselines. More generally, this work provides a means of integrating background knowledge contained in medical ontologies into data-driven information retrieval approaches.

Towards persistent indoor appearance-based localization, mapping and navigation using CAT-Graph

The challenge of persistent appearance-based navigation and mapping is to develop an autonomous robotic vision system that can simultaneously localize, map and navigate over the lifetime of the robot. However, the computation time and memory requirements of current appearance-based methods typically scale not only with the size of the environment but also with the operation time of the platform; also, repeated revisits to locations will develop multiple competing representations which reduce recall performance. In this paper we present a solution to the persistent localization, mapping and global path planning problem in the context of a delivery robot in an office environment over a one-week period. Using a graphical appearance-based SLAM algorithm, CAT-Graph, we demonstrate constant time and memory loop closure detection with minimal degradation during repeated revisits to locations, along with topological path planning that improves over time without using a global metric representation. We compare the localization performance of CAT-Graph to openFABMAP, an appearance-only SLAM algorithm, and the path planning performance to occupancy-grid based metric SLAM. We discuss the limitations of the algorithm with regard to environment change over time and illustrate how the topological graph representation can be coupled with local movement behaviors for persistent autonomous robot navigation.

Expander graph based key distribution mechanisms in wireless sensor networks

Secure communications between large number of sensor nodes that are randomly scattered over a hostile territory, necessitate efficient key distribution schemes. However, due to limited resources at sensor nodes such schemes cannot be based on post deployment computations. Instead, pairwise (symmetric) keys are required to be pre-distributed by assigning a list of keys, (a.k.a. key-chain), to each sensor node. If a pair of nodes does not have a common key after deployment then they must find a key-path with secured links. The objective is to minimize the keychain size while (i) maximizing pairwise key sharing probability and resilience, and (ii) minimizing average key-path length. This paper presents a deterministic key distribution scheme based on Expander Graphs. It shows how to map the parameters (e.g., degree, expansion, and diameter) of a Ramanujan Expander Graph to the desired properties of a key distribution scheme for a physical network topology.

CAT-GRAPH+ : towards odometry-driven place consolidation in changing environments

Changing environments present a number of challenges to mobile robots, one of the most significant being mapping and localisation. This problem is particularly significant in vision-based systems where illumination and weather changes can cause feature-based techniques to fail. In many applications only sections of an environment undergo extreme perceptual change. Some range-based sensor mapping approaches exploit this property by combining occasional place recognition with the assumption that odometry is accurate over short periods of time. In this paper, we develop this idea in the visual domain, by using occasional vision-driven loop closures to infer loop closures in nearby locations where visual recognition is difficult due to extreme change. We demonstrate successful map creation in an environment in which change is significant but constrained to one area, where both the vanilla CAT-Graph and a Sum of Absolute Differences matcher fails, use the described techniques to link dissimilar images from matching locations, and test the robustness of the system against false inferences.

A novel winding structure in planar inductors to decrease overall capacitive couplings

This paper analyses effects of winding structure on capacitive coupling reduction appearing in the planar magnetic elements at high frequencies. Capacitive coupling appears between the conductive layers of the planar transformers resulting in high current spikes and consequently high power dissipation. With finite element analysis, the equivalent capacitive coupling of magnetic elements is calculated for different structures of planar windings. Finally, a new winding structure with minimum capacitive coupling is introduced for the planar magnetic elements, which is verified by simulation and experiments.

Analyzing the effectiveness of graph metrics for anomaly detection in online social networks

Online social networks can be modelled as graphs; in this paper, we analyze the use of graph metrics for identifying users with anomalous relationships to other users. A framework is proposed for analyzing the effectiveness of various graph theoretic properties such as the number of neighbouring nodes and edges, betweenness centrality, and community cohesiveness in detecting anomalous users. Experimental results on real-world data collected from online social networks show that the majority of users typically have friends who are friends themselves, whereas anomalous users’ graphs typically do not follow this common rule. Empirical analysis also shows that the relationship between average betweenness centrality and edges identifies anomalies more accurately than other approaches.

Planar difference functions

In 1980 Alltop produced a family of cubic phase sequences that nearly meet the Welch bound for maximum non-peak correlation magnitude. This family of sequences were shown by Wooters and Fields to be useful for quantum state tomography. Alltop’s construction used a function that is not planar, but whose difference function is planar. In this paper we show that Alltop type functions cannot exist in fields of characteristic 3 and that for a known class of planar functions, x^3 is the only Alltop type function.

Data requirements and graph data structures for a multi-modal, multi-objective trip planner

Traffic congestion has a significant impact on the economy and environment. Encouraging the use of multimodal transport (public transport, bicycle, park’n’ride, etc.) has been identified by traffic operators as a good strategy to tackle congestion issues and its detrimental environmental impacts. A multi-modal and multi-objective trip planner provides users with various multi-modal options optimised on objectives that they prefer (cheapest, fastest, safest, etc) and has a potential to reduce congestion on both a temporal and spatial scale. The computation of multi-modal and multi-objective trips is a complicated mathematical problem, as it must integrate and utilize a diverse range of large data sets, including both road network information and public transport schedules, as well as optimising for a number of competing objectives, where fully optimising for one objective, such as travel time, can adversely affect other objectives, such as cost. The relationship between these objectives can also be quite subjective, as their priorities will vary from user to user. This paper will first outline the various data requirements and formats that are needed for the multi-modal multi-objective trip planner to operate, including static information about the physical infrastructure within Brisbane as well as real-time and historical data to predict traffic flow on the road network and the status of public transport. It will then present information on the graph data structures representing the road and public transport networks within Brisbane that are used in the trip planner to calculate optimal routes. This will allow for an investigation into the various shortest path algorithms that have been researched over the last few decades, and provide a foundation for the construction of the Multi-modal Multi-objective Trip Planner by the development of innovative new algorithms that can operate the large diverse data sets and competing objectives.

A semi-supervised graph-based algorithm for detecting outliers in online-social-networks

In this paper, we propose a semi-supervised approach of anomaly detection in Online Social Networks. The social network is modeled as a graph and its features are extracted to detect anomaly. A clustering algorithm is then used to group users based on these features and fuzzy logic is applied to assign degree of anomalous behavior to the users of these clusters. Empirical analysis shows effectiveness of this method.

Molecular cocrystals of 5-(4-bromophenyl)-1,3,4-thiadiazol-2-amine: hydrogen bonding in the structures of the 1:1 adduct with 2-(naphthalen-2-yloxy)acetic acid and the salt with 3,5-dinitrobenzoic acid

The structures of the anhydrous products from the interaction of 2-amino-5-(4-bromophenyl)-1,3,4-thiadiazole with (2-naphthoxy)acetic acid, the 1:1 adduct C8H6BrN3S . C12H10O3 (I) and 3,5-dinitrobenzoic acid, the salt C8H7BrN3S+ C7H3N2O6- (II) have been determined. In the adduct (I), a heterodimer is formed through a cyclic hydrogen-bonding motif [graph set R2/2(8)], involving carboxylic acid O-H...N(hetero)and amine N-H...O(carboxyl) interactions. The heterodimers are essentially planar with a thiadiazole to naphthyl ring dihedral angle of 15.9(2)deg. and the intramolecular thiadiazole to phenyl ring angle of 4.7(2)deg. An amine N-H...N(hetero) hydrogen bond between the heterodimers generates a one-dimensional chain structure extending down [001]. Also present are weak benzene-benzene and naphthalene-naphthalene pi-pi stacking interactions down the b axis [minimum ring centroid separation, 3.936(3) Ang.]. With the salt (II), the cation-anion association is also through a cyclic R2/2(8) motif but involving duplex N-H...O(carboxyl) hydrogen bonds, giving a heterodimer which is close to planar [dihedral angles between the thiadiazole ring and the two benzene rings, 5.00(16)deg. (intra) and 7.23(15)deg. (inter)]. A secondary centrosymmetric cyclic N-H...O(carboxyl) hydrogen-bonding association involving the second amino H-atom generates a heterotetramer. Also present in the crystal are weak pi-pi i-\p interactions between thiadiazolium rings [minimum ring centroid separation, 3.936(3)Ang.], as well as a short Br...O(nitro) interaction [3.314(4)Ang.]. The two structures reported here now provide a total of three crystallographically characterized examples of co-crystalline products from the interaction of 2-amino-5-(4-bromophenyl)-1,3,4-thiadiazole with carboxylic acids, of which only one involves proton-transfer.