Graph coloring applied to secure computation in non-Abelian groups

We study the natural problem of secure n-party computation (in the computationally unbounded attack model) of circuits over an arbitrary finite non-Abelian group (G,⋅), which we call G-circuits. Besides its intrinsic interest, this problem is also motivating by a completeness result of Barrington, stating that such protocols can be applied for general secure computation of arbitrary functions. For flexibility, we are interested in protocols which only require black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our investigations focus on the passive adversarial model, where up to t of the n participating parties are corrupted.

Decomposition construction for secret sharing schemes with graph access structures in polynomial time

The purpose of this paper is to describe a new decomposition construction for perfect secret sharing schemes with graph access structures. The previous decomposition construction proposed by Stinson is a recursive method that uses small secret sharing schemes as building blocks in the construction of larger schemes. When the Stinson method is applied to the graph access structures, the number of such “small” schemes is typically exponential in the number of the participants, resulting in an exponential algorithm. Our method has the same flavor as the Stinson decomposition construction; however, the linear programming problem involved in the construction is formulated in such a way that the number of “small” schemes is polynomial in the size of the participants, which in turn gives rise to a polynomial time construction. We also show that if we apply the Stinson construction to the “small” schemes arising from our new construction, both have the same information rate.

Flexible process graph : a prologue

Businesses document their operational processes as process models. The common practice is to represent process models as directed graphs. The nodes of a process graph represent activities and directed edges constitute activity ordering constraints. A flexible process graph modeling approach proposes to generalize process graph structure to a hypergraph. Obtained process structure aims at formalization of ad-hoc process control flow. In this paper we discuss aspects relevant to concurrent execution of process activities in a collaborative manner organized as a flexible process graph. We provide a real world flexible process scenario to illustrate the approach.

Graph theory based representation of building information models for access control applications

Building information models are increasingly being utilised for facility management of large facilities such as critical infrastructures. In such environments, it is valuable to utilise the vast amount of data contained within the building information models to improve access control administration. The use of building information models in access control scenarios can provide 3D visualisation of buildings as well as many other advantages such as automation of essential tasks including path finding, consistency detection, and accessibility verification. However, there is no mathematical model for building information models that can be used to describe and compute these functions. In this paper, we show how graph theory can be utilised as a representation language of building information models and the proposed security related functions. This graph-theoretic representation allows for mathematically representing building information models and performing computations using these functions.

A subexponential construction of graph coloring for multiparty computation

We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal (secure against an adversary who possesses any tgraphs. More specifically, following the result of Desmedt et al. (2012) that the problem of MPC over non-Abelian groups can be reduced to finding a t-reliable n-coloring of planar graphs, we show the construction of such a graph which allows a path from the input nodes to the output nodes when any t-party subset is in the possession of the adversary. Unlike the deterministic constructions from Desmedt et al. (2012) our construction has subexponential complexity and is optimal at the same time, i.e., it is secure for any t

Test-retest reliability of graph theory measures of structural brain connectivity

The human connectome has recently become a popular research topic in neuroscience, and many new algorithms have been applied to analyze brain networks. In particular, network topology measures from graph theory have been adapted to analyze network efficiency and 'small-world' properties. While there has been a surge in the number of papers examining connectivity through graph theory, questions remain about its test-retest reliability (TRT). In particular, the reproducibility of structural connectivity measures has not been assessed. We examined the TRT of global connectivity measures generated from graph theory analyses of 17 young adults who underwent two high-angular resolution diffusion (HARDI) scans approximately 3 months apart. Of the measures assessed, modularity had the highest TRT, and it was stable across a range of sparsities (a thresholding parameter used to define which network edges are retained). These reliability measures underline the need to develop network descriptors that are robust to acquisition parameters.

New graph-based algorithms to efficiently solve large scale open pit mining optimisation problems

In the mining optimisation literature, most researchers focused on two strategic-level and tactical-level open-pit mine optimisation problems, which are respectively termed ultimate pit limit (UPIT) or constrained pit limit (CPIT). However, many researchers indicate that the substantial numbers of variables and constraints in real-world instances (e.g., with 50-1000 thousand blocks) make the CPIT’s mixed integer programming (MIP) model intractable for use. Thus, it becomes a considerable challenge to solve the large scale CPIT instances without relying on exact MIP optimiser as well as the complicated MIP relaxation/decomposition methods. To take this challenge, two new graph-based algorithms based on network flow graph and conjunctive graph theory are developed by taking advantage of problem properties. The performance of our proposed algorithms is validated by testing recent large scale benchmark UPIT and CPIT instances’ datasets of MineLib in 2013. In comparison to best known results from MineLib, it is shown that the proposed algorithms outperform other CPIT solution approaches existing in the literature. The proposed graph-based algorithms leads to a more competent mine scheduling optimisation expert system because the third-party MIP optimiser is no longer indispensable and random neighbourhood search is not necessary.

Automated topometric graph generation from floor plan analysis

The world is rich with information such as signage and maps to assist humans to navigate. We present a method to extract topological spatial information from a generic bitmap floor plan and build a topometric graph that can be used by a mobile robot for tasks such as path planning and guided exploration. The algorithm first detects and extracts text in an image of the floor plan. Using the locations of the extracted text, flood fill is used to find the rooms and hallways. Doors are found by matching SURF features and these form the connections between rooms, which are the edges of the topological graph. Our system is able to automatically detect doors and differentiate between hallways and rooms, which is important for effective navigation. We show that our method can extract a topometric graph from a floor plan and is robust against ambiguous cases most commonly seen in floor plans including elevators and stairwells.

Modeling of a pressure modulated desalination system using bond graph methodology

A desalination system is a complex multi energy domain system comprising power/energy flow across several domains such as electrical, thermal, and hydraulic. The dynamic modeling of a desalination system that comprehensively addresses all these multi energy domains is not adequately addressed in the literature. This paper proposes to address the issue of modeling the various energy domains for the case of a single stage flash evaporation desalination system. This paper presents a detailed bond graph modeling of a desalination unit with seamless integration of the power flow across electrical, thermal, and hydraulic domains. The paper further proposes a performance index function that leads to the tracking of the optimal chamber pressure giving the optimal flow rate for a given unit of energy expended. The model has been validated in steady state conditions by simulation and experimentation.

Bond graph toolbox for handling complex variable

Bond graph is an apt modelling tool for any system working across multiple energy domains. Power electronics system modelling is usually the study of the interplay of energy in the domains of electrical, mechanical, magnetic and thermal. The usefulness of bond graph modelling in power electronic field has been realised by researchers. Consequently in the last couple of decades, there has been a steadily increasing effort in developing simulation tools for bond graph modelling that are specially suited for power electronic study. For modelling rotating magnetic fields in electromagnetic machine models, a support for vector variables is essential. Unfortunately, all bond graph simulation tools presently provide support only for scalar variables. We propose an approach to provide complex variable and vector support to bond graph such that it will enable modelling of polyphase electromagnetic and spatial vector systems. We also introduced a rotary gyrator element and use it along with the switched junction for developing the complex/vector variable's toolbox. This approach is implemented by developing a complex S-function tool box in Simulink inside a MATLAB environment This choice has been made so as to synthesise the speed of S-function, the user friendliness of Simulink and the popularity of MATLAB.

Improving decisions for invasive species management: Reformulation and extensions of the Panetta-Lawes eradication graph

Aim: Effective decisions for managing invasive species depend on feedback about the progress of eradication efforts. Panetta & Lawes. developed the eradograph, an intuitive graphical tool that summarizes the temporal trajectories of delimitation and extirpation to support decision-making. We correct and extend the tool, which was affected by incompatibilities in the units used to measure these features that made the axes impossible to interpret biologically. Location: Victoria, New South Wales and Queensland, Australia. Methods: Panetta and Lawes' approach represented delimitation with estimates of the changes in the area known to be infested and extirpation with changes in the mean time since the last detection. We retain the original structure but propose different metrics that improve biological interpretability. We illustrate the methods with a hypothetical example and real examples of invasion and treatment of branched broomrape (Orobanche ramosa L.) and the guava rust complex (Puccinia psidii (Winter 1884)) in Australia. Results: These examples illustrate the potential of the tool to guide decisions about the effectiveness of search and control activities. Main conclusions: The eradograph is a graphical data summary tool that provides insight into the progress of eradication. Our correction and extension of the tool make it easier to interpret and provide managers with better decision support. © 2013 John Wiley & Sons Ltd.

Median muotoilema : Muotoilun mediajulkisuus suomalaisessa talouslehdistössä

Designed by the Media The Media publicity of Design in the Finnish Economic Press The meaning of design has increased in consumer societies. Design is the subject of debate and the number of media discussions has also increased steadily. Especially the role of industrial design has been emphasised. In this study I examine the media publicity of design in the Finnish economic press from the late 1980s to the beginning of the 2000s. The research question is connected to media representations: How is design represented in the Finnish economic press? In other words, what are the central topics of design in the economic press, and to what issues are the media debates connected? The usually repeated phrase that design discussions take place only on the cultural pages of the daily press or in cultural contexts is being changed. Design is also linked to the consumer culture and consumers everyday practices. The research material has been collected from the Finnish economic press. The qualitative sample consists of articles from Kauppalehti, Taloussanomat and from several economic papers published by the Talentum Corporation. The approach of the research is explorative, descriptive and hermeneutic. This means that the economic press articles are used to explore how design is represented in the media. In addition, the characteristics of design represented in the media are described in detail. The research is based on the interpretive tradition of studying textual materials. Background assumptions are thus grounded in hermeneutics. Erving Goffman s frame analysis is applied in analysing the economic press materials. The frames interpreted from the articles depict the media publicity of design in the Finnish economic press. The research opens up a multidimensional picture of design in the economic press. The analysis resulted in five frames that describe design from various points of view. In the personal frame designers are described in private settings and through their personal experiences. The second frame relates to design work. In the frame of mastery of the profession, the designers work is interpreted widely. Design is considered from the aspects of controlling personal know-how, co-operation and the overall process of design. The third frame is connected to the actual substance of the economic press. In the frame of economy and market, design is linked to international competitiveness, companies competitive advantage and benefit creation for the consumers. The fourth frame is connected to the actors promoting design on a societal level. In the communal frame, the economic press describes design policy, design research and education and other actors that actively develop design in the societal networks. The last frame is linked to the traditions of design and above all to the examination of the cultural transition. In the frame of culture the traditions of design are emphasised. Design is also connected to the industrial culture and furthermore to the themes of the consumer culture. It can be argued that the frames construct media publicity of design from various points of view. The frames describe situations, action and the actors of design. The interpreted media frames make it possible to understand the relation of interpreted design actions and the culture. Thus, media has a crucial role in representing and recreating meanings related to design. The publicity of design is characterised by the five focal themes: personification, professionalisation, commercialisation, communalisation and transition of cultural focus from the traditions of design to the industrial culture and the consumer culture. Based on my interpretation these themes are guided by the mediatisation of design. The design phenomenon is defined more often on the basis of the media representations in the public discourses. The design culture outlined in this research connects socially constructed and structurally organised action. Socially constructed action in design is connected to the experiences, social recreation and collective development of design. Structurally, design is described as professional know-how, as a process and as an economic profit generating action in the society. The events described by the media affect the way in which people experience the world, the meanings they connect to the events around themselves and their life in the world. By affecting experiences, the media indirectly affects human actions. People have become habituated to read media representations on a daily basis, but they are not used to reading and interpreting the various meanings that are incorporated in the media texts.

Flow-graph techniques for epicyclic gear train analysis

Flow-graph techniques are applied in this article for the analysis of an epicyclic gear train. A gear system based on this is designed and constructed for use in Numerical Control Systems.

The politics of foreign aid: A median voter perspective

The paper presents a model where the median voter in the donor country determines the support of foreign aid. It is first established that an individual in the donor country is affected by the direct benefits (due to altruism) and costs (due to taxes) of giving aid, and by the indirect benefits or costs of a change in the terms of trade. Then it is shown that the latter effect works through changing both the donor country's average income and its distribution of income. Given the stylized facts of a capital-abundant donor country and relatively capital-poor median voter, it is shown how redistribution-of-income effects soften the impact of terms-of-trade changes on the political support for foreign aid.

Acoustic emission source location and damage detection in a metallic structure using a graph-theory-based geodesic pproach

A geodesic-based approach using Lamb waves is proposed to locate the acoustic emission (AE) source and damage in an isotropic metallic structure. In the case of the AE (passive) technique, the elastic waves take the shortest path from the source to the sensor array distributed in the structure. The geodesics are computed on the meshed surface of the structure using graph theory based on Dijkstra's algorithm. By propagating the waves in reverse virtually from these sensors along the geodesic path and by locating the first intersection point of these waves, one can get the AE source location. The same approach is extended for detection of damage in a structure. The wave response matrix of the given sensor configuration for the healthy and the damaged structure is obtained experimentally. The healthy and damage response matrix is compared and their difference gives the information about the reflection of waves from the damage. These waves are backpropagated from the sensors and the above method is used to locate the damage by finding the point where intersection of geodesics occurs. In this work, the geodesic approach is shown to be suitable to obtain a practicable source location solution in a more general set-up on any arbitrary surface containing finite discontinuities. Experiments were conducted on aluminum specimens of simple and complex geometry to validate this new method.