Directory of Open Access Journals (Sweden)
Lubna Moin
2009-04-01
Full Text Available This research paper basically explores and compares the different modeling and analysis techniques and than it also explores the model order reduction approach and significance. The traditional modeling and simulation techniques for dynamic systems are generally adequate for single-domain systems only, but the Bond Graph technique provides new strategies for reliable solutions of multi-domain system. They are also used for analyzing linear and non linear dynamic production system, artificial intelligence, image processing, robotics and industrial automation. This paper describes a unique technique of generating the Genetic design from the tree structured transfer function obtained from Bond Graph. This research work combines bond graphs for model representation with Genetic programming for exploring different ideas on design space tree structured transfer function result from replacing typical bond graph element with their impedance equivalent specifying impedance lows for Bond Graph multiport. This tree structured form thus obtained from Bond Graph is applied for generating the Genetic Tree. Application studies will identify key issues and importance for advancing this approach towards becoming on effective and efficient design tool for synthesizing design for Electrical system. In the first phase, the system is modeled using Bond Graph technique. Its system response and transfer function with conventional and Bond Graph method is analyzed and then a approach towards model order reduction is observed. The suggested algorithm and other known modern model order reduction techniques are applied to a 11th order high pass filter [1], with different approach. The model order reduction technique developed in this paper has least reduction errors and secondly the final model retains structural information. The system response and the stability analysis of the system transfer function taken by conventional and by Bond Graph method is compared and
Automated Modeling and Simulation Using the Bond Graph Method for the Aerospace Industry
Granda, Jose J.; Montgomery, Raymond C.
2003-01-01
Bond graph modeling was originally developed in the late 1950s by the late Prof. Henry M. Paynter of M.I.T. Prof. Paynter acted well before his time as the main advantage of his creation, other than the modeling insight that it provides and the ability of effectively dealing with Mechatronics, came into fruition only with the recent advent of modern computer technology and the tools derived as a result of it, including symbolic manipulation, MATLAB, and SIMULINK and the Computer Aided Modeling Program (CAMPG). Thus, only recently have these tools been available allowing one to fully utilize the advantages that the bond graph method has to offer. The purpose of this paper is to help fill the knowledge void concerning its use of bond graphs in the aerospace industry. The paper first presents simple examples to serve as a tutorial on bond graphs for those not familiar with the technique. The reader is given the basic understanding needed to appreciate the applications that follow. After that, several aerospace applications are developed such as modeling of an arresting system for aircraft carrier landings, suspension models used for landing gears and multibody dynamics. The paper presents also an update on NASA's progress in modeling the International Space Station (ISS) using bond graph techniques, and an advanced actuation system utilizing shape memory alloys. The later covers the Mechatronics advantages of the bond graph method, applications that simultaneously involves mechanical, hydraulic, thermal, and electrical subsystem modeling.
Bond graph modeling of centrifugal compression systems
Uddin, Nur; Gravdahl, Jan Tommy
2015-01-01
A novel approach to model unsteady fluid dynamics in a compressor network by using a bond graph is presented. The model is intended in particular for compressor control system development. First, we develop a bond graph model of a single compression system. Bond graph modeling offers a different perspective to previous work by modeling the compression system based on energy flow instead of fluid dynamics. Analyzing the bond graph model explains the energy flow during compressor surge. Two pri...
International Nuclear Information System (INIS)
Lucas, B.
1994-05-01
After having recalled the usual diagnosis techniques (failure index, decision tree) and those based on an artificial intelligence approach, the author reports a research aimed at exploring the knowledge and model generation technique. He focuses on the design of an aid to model generation tool and aid-to-diagnosis tool. The bond graph technique is shown to be adapted to the aid to model generation, and is then adapted to the aid to diagnosis. The developed tool is applied to three projects: DIADEME (a diagnosis system based on physical model), the improvement of the SEXTANT diagnosis system (an expert system for transient analysis), and the investigation on an Ariane 5 launcher component. Notably, the author uses the Reiter and Greiner algorithm
Mechatronic modeling and simulation using bond graphs
Das, Shuvra
2009-01-01
Introduction to Mechatronics and System ModelingWhat Is Mechatronics?What Is a System and Why Model Systems?Mathematical Modeling Techniques Used in PracticeSoftwareBond Graphs: What Are They?Engineering SystemsPortsGeneralized VariablesBond GraphsBasic Components in SystemsA Brief Note about Bond Graph Power DirectionsSummary of Bond Direction RulesDrawing Bond Graphs for Simple Systems: Electrical and MechanicalSimplification Rules for Junction StructureDrawing Bond Graphs for Electrical SystemsDrawing Bond Graphs for Mechanical SystemsCausalityDrawing Bond Graphs for Hydraulic and Electronic Components and SystemsSome Basic Properties and Concepts for FluidsBond Graph Model of Hydraulic SystemsElectronic SystemsDeriving System Equations from Bond GraphsSystem VariablesDeriving System EquationsTackling Differential CausalityAlgebraic LoopsSolution of Model Equations and Their InterpretationZeroth Order SystemsFirst Order SystemsSecond Order SystemTransfer Functions and Frequency ResponsesNumerical Solution ...
Bond Graph Modeling and Simulation of Mechatronic Systems
DEFF Research Database (Denmark)
Habib, Tufail; Nielsen, Kjeld; Jørgensen, Kaj Asbjørn
2012-01-01
One of the demanding steps in the design and development of Mechatronic systems is to develop the initial model to visualize the response of a system. The Bond Graph (BG) method is a graphical approach for the design of multidomain systems. That is ideal for visualizing the essential characterist......One of the demanding steps in the design and development of Mechatronic systems is to develop the initial model to visualize the response of a system. The Bond Graph (BG) method is a graphical approach for the design of multidomain systems. That is ideal for visualizing the essential...
Bond graph modeling of nuclear reactor dynamics
International Nuclear Information System (INIS)
Tylee, J.L.
1981-01-01
A tenth-order linear model of a pressurized water reactor (PWR) is developed using bond graph techniques. The model describes the nuclear heat generation process and the transfer of this heat to the reactor coolant. Comparisons between the calculated model response and test data from a small-scale PWR show the model to be an adequate representation of the actual plant dynamics. Possible application of the model in an advanced plant diagnostic system is discussed
ARTICLE Robust Diagnosis of Mechatronics System by Bond Graph Approach
Directory of Open Access Journals (Sweden)
Abderrahmene Sellami
2018-03-01
Full Text Available This article presents design of a robust diagnostic system based on bond graph model for a mechatronic system. Mechatronics is the synergistic and systemic combination of mechanics, electronics and computer science. The design of a mechatronic system modeled by the bond graph model becomes easier and more generous. The bond graph tool is a unified graphical language for all areas of engineering sciences and confirmed as a structured approach to modeling and simulation of multidisciplinary systems.
The Atom-Bond Connectivity Index of Catacondensed Polyomino Graphs
Chen, Jinsong; Liu, Jianping; Li, Qiaoliang
2013-01-01
Let G=(V,E) be a graph. The atom-bond connectivity (ABC) index is defined as the sum of weights ((du+dv−2)/dudv)1/2 over all edges uv of G, where du denotes the degree of a vertex u of G. In this paper, we give the atom-bond connectivity index of the zigzag chain polyomino graphs. Meanwhile, we obtain the sharp upper bound on the atom-bond connectivity index of catacondensed polyomino graphs with h squares and determine the corresponding extremal graphs.
Circuit and bond polytopes on series–parallel graphs
Borne , Sylvie; Fouilhoux , Pierre; Grappe , Roland; Lacroix , Mathieu; Pesneau , Pierre
2015-01-01
International audience; In this paper, we describe the circuit polytope on series–parallel graphs. We first show the existence of a compact extended formulation. Though not being explicit, its construction process helps us to inductively provide the description in the original space. As a consequence, using the link between bonds and circuits in planar graphs, we also describe the bond polytope on series–parallel graphs.
Application of Bond Graph Modeling for Photovoltaic Module Simulation
Directory of Open Access Journals (Sweden)
Madi S.
2016-01-01
Full Text Available In this paper, photovoltaic generator is represented using the bond-graph methodology. Starting from the equivalent circuit the bond graph and the block diagram of the photovoltaic generator have been derived. Upon applying bond graph elements and rules a mathematical model of the photovoltaic generator is obtained. Simulation results of this obtained model using real recorded data (irradiation and temperature at the Renewable Energies Development Centre in Bouzaréah – Algeria are obtained using MATLAB/SMULINK software. The results have compared with datasheet of the photovoltaic generator for validation purposes.
Bond graph model-based fault diagnosis of hybrid systems
Borutzky, Wolfgang
2015-01-01
This book presents a bond graph model-based approach to fault diagnosis in mechatronic systems appropriately represented by a hybrid model. The book begins by giving a survey of the fundamentals of fault diagnosis and failure prognosis, then recalls state-of-art developments referring to latest publications, and goes on to discuss various bond graph representations of hybrid system models, equations formulation for switched systems, and simulation of their dynamic behavior. The structured text: • focuses on bond graph model-based fault detection and isolation in hybrid systems; • addresses isolation of multiple parametric faults in hybrid systems; • considers system mode identification; • provides a number of elaborated case studies that consider fault scenarios for switched power electronic systems commonly used in a variety of applications; and • indicates that bond graph modelling can also be used for failure prognosis. In order to facilitate the understanding of fault diagnosis and the presented...
System dynamics and control with bond graph modeling
Kypuros, Javier
2013-01-01
Part I Dynamic System ModelingIntroduction to System DynamicsIntroductionSystem Decomposition and Model ComplexityMathematical Modeling of Dynamic SystemsAnalysis and Design of Dynamic SystemsControl of Dynamic SystemsDiagrams of Dynamic SystemsA Graph-Centered Approach to ModelingSummaryPracticeExercisesBasic Bond Graph ElementsIntroductionPower and Energy VariablesBasic 1-Port ElementsBasic 2-Ports ElementsJunction ElementsSimple Bond Graph ExamplesSummaryPracticeExercisesBond Graph Synthesis and Equation DerivationIntroductionGeneral GuidelinesMechanical TranslationMechanical RotationElectrical CircuitsHydraulic CircuitsMixed SystemsState Equation DerivationState-Space RepresentationsAlgebraic Loops and Derivative CausalitySummaryPracticeExercisesImpedance Bond GraphsIntroductionLaplace Transform of the State-Space EquationBasic 1-Port ImpedancesImpedance Bond Graph SynthesisJunctions, Transformers, and GyratorsEffort and Flow DividersSign ChangesTransfer Function DerivationAlternative Derivation of Transf...
Energy Technology Data Exchange (ETDEWEB)
Lucas, B.
1994-05-15
After having recalled the usual diagnosis techniques (failure index, decision tree) and those based on an artificial intelligence approach, the author reports a research aimed at exploring the knowledge and model generation technique. He focuses on the design of an aid to model generation tool and aid-to-diagnosis tool. The bond graph technique is shown to be adapted to the aid to model generation, and is then adapted to the aid to diagnosis. The developed tool is applied to three projects: DIADEME (a diagnosis system based on physical model), the improvement of the SEXTANT diagnosis system (an expert system for transient analysis), and the investigation on an Ariane 5 launcher component. Notably, the author uses the Reiter and Greiner algorithm
Bond graph modeling and LQG/LTR controller design of magnetically levitation systems
Energy Technology Data Exchange (ETDEWEB)
Kim, Jong Shik; Park, Jeon Soo [Busan National Univ. (Korea, Republic of)
1991-09-01
A logical and systematic procedure to derive a mathematical model for magnetically levitation (MAGLEV) systems with a combined lift and guidance is developed by using bond graph modeling techniques. First, bond graph is contructed for the 1{sup st}-dimensional MAGLEV system in which three subsystems (energy feeding, track and vehicle) are considered. And, the 2{sup nd}-dimensional MAGLEV system in which lift and guidance dynamics are coupled is modeled by using the concept of multi-port field in bond graph languages. Finally, the LQG/LTR control system is designed for a multivariable MAGLEV system with stagger configuration type. In this paper, it has been shown that the bond graph is an excellent effective method for modeling multi-energy domain systems such as MAGLEV systems with uncertainties such as mass variations, track irregularities and wind gusts. (Author).
Bond graph modeling and LQG/LTR controller design of magnetically levitation systems
International Nuclear Information System (INIS)
Kim, Jong Shik; Park, Jeon Soo
1991-01-01
A logical and systematic procedure to derive a mathematical model for magnetically levitation (MAGLEV) systems with a combined lift and guidance is developed by using bond graph modeling techniques. First, bond graph is contructed for the 1 st -dimensional MAGLEV system in which three subsystems (energy feeding, track and vehicle) are considered. And, the 2 nd -dimensional MAGLEV system in which lift and guidance dynamics are coupled is modeled by using the concept of multi-port field in bond graph languages. Finally, the LQG/LTR control system is designed for a multivariable MAGLEV system with stagger configuration type. In this paper, it has been shown that the bond graph is an excellent effective method for modeling multi-energy domain systems such as MAGLEV systems with uncertainties such as mass variations, track irregularities and wind gusts. (Author)
Graph modeling systems and methods
Neergaard, Mike
2015-10-13
An apparatus and a method for vulnerability and reliability modeling are provided. The method generally includes constructing a graph model of a physical network using a computer, the graph model including a plurality of terminating vertices to represent nodes in the physical network, a plurality of edges to represent transmission paths in the physical network, and a non-terminating vertex to represent a non-nodal vulnerability along a transmission path in the physical network. The method additionally includes evaluating the vulnerability and reliability of the physical network using the constructed graph model, wherein the vulnerability and reliability evaluation includes a determination of whether each terminating and non-terminating vertex represents a critical point of failure. The method can be utilized to evaluate wide variety of networks, including power grid infrastructures, communication network topologies, and fluid distribution systems.
A Bond Graph Approach for the Modeling and Simulation of a Buck Converter
Directory of Open Access Journals (Sweden)
Rached Zrafi
2018-01-01
Full Text Available This paper deals with the modeling of bond graph buck converter systems. The bond graph formalism, which represents a heterogeneous formalism for physical modeling, is used to design a sub-model of a power MOSFET and PiN diode switchers. These bond graph models are based on the device’s electrical elements. The application of these models to a bond graph buck converter permit us to obtain an invariant causal structure when the switch devices change state. This paper shows the usefulness of the bond graph device’s modeling to simulate an implicit bond graph buck converter.
Bond graphs : an integrating tool for design of mechatronic systems
International Nuclear Information System (INIS)
Ould Bouamama, B.
2011-01-01
Bond graph is a powerful tool well known for dynamic modelling of multi physical systems: This is the only modelling technique to generate automatically state space or non-linear models using dedicated software tools (CAMP-G, 20-Sim, Symbols, Dymola...). Recently several fundamental theories have been developed for using a bond graph model not only for modeling but also as a real integrated tool from conceptual ideas to optimal practical realization of mechatronic system. This keynote presents a synthesis of those new theories which exploit some particular properties (such as causal, structural and behavioral) of this graphical methodology. Based on a pedagogical example, it will be shown how from a physical system (not a transfer function or state equation) and using only one representation (Bond graph), the following results can be performed: modeling (formal state equations generation), Control analysis (observability, controllability, Structural I/O decouplability, dynamic decoupling,...) diagnosis analysis (automatic generation of robust fault indicators, sensor placement, structural diagnosability) and finally sizing of actuators. The presentation will be illustrated by real industrial applications. Limits and perspectives of bond graph theory conclude the keynote.
Bond graph to digraph conversion: A sensor placement optimization ...
Indian Academy of Sciences (India)
In this paper, we consider the optimal sensors placement problem for ... is due to the fact that the construction is generally done from the state equations, ... The Bond Graph (BG) tool defined in Paynter (1961) formal- ... Sensor placement and structural problem formulation .... Thus the obtained four matrices are as follows:.
Modal Analysis of In-Wheel Motor-Driven Electric Vehicle Based on Bond Graph Theory
Directory of Open Access Journals (Sweden)
Di Tan
2017-01-01
Full Text Available A half-car vibration model of an electric vehicle driven by rear in-wheel motors was developed using bond graph theory and the modular modeling method. Based on the bond graph model, modal analysis was carried out to study the vibration characteristics of the electric vehicle. To verify the effectiveness of the established model, the results were compared to ones computed on the ground of modal analysis and Newton equations. The comparison shows that the vibration model of the electric vehicle based on bond graph theory not only is able to better compute the natural frequency but also can easily determine the deformation mode, momentum mode, and other isomorphism modes and describe the dynamic characteristics of an electric vehicle driven by in-wheel motors more comprehensively than other modal analysis methods.
Fault diagnosis of air conditioning systems based on qualitative bond graph
International Nuclear Information System (INIS)
Ghiaus, C.
1999-01-01
The bond graph method represents a unified approach for modeling engineering systems. The main idea is that power transfer bonds the components of a system. The bond graph model is the same for both quantitative representation, in which parameters have numerical values, and qualitative approach, in which they are classified qualitatively. To infer the cause of faults using a qualitative method, a system of qualitative equations must be solved. However, the characteristics of qualitative operators require specific methods for solving systems of equations having qualitative variables. This paper proposes both a method for recursively solving the qualitative system of equations derived from bond graph, and a bond graph model of a direct-expansion, mechanical vapor-compression air conditioning system. Results from diagnosing two faults in a real air conditioning system are presented and discussed. Occasionally, more than one fault candidate is inferred for the same set of qualitative values derived from measurements. In these cases, additional information is required to localize the fault. Fault diagnosis is initiated by a fault detection mechanism which also classifies the quantitative measurements into qualitative values; the fault detection is not presented here. (author)
Modeling, Control and Analyze of Multi-Machine Drive Systems using Bond Graph Technique
Directory of Open Access Journals (Sweden)
J. Belhadj
2006-03-01
Full Text Available In this paper, a system viewpoint method has been investigated to study and analyze complex systems using Bond Graph technique. These systems are multimachine multi-inverter based on Induction Machine (IM, well used in industries like rolling mills, textile, and railway traction. These systems are multi-domains, multi-scales time and present very strong internal and external couplings, with non-linearity characterized by a high model order. The classical study with analytic model is difficult to manipulate and it is limited to some performances. In this study, a “systemic approach” is presented to design these kinds of systems, using an energetic representation based on Bond Graph formalism. Three types of multimachine are studied with their control strategies. The modeling is carried out by Bond Graph and results are discussed to show the performances of this methodology
A comparative study of applying Mason’s Rule in the case of flow-graphs and bond-graphs
Directory of Open Access Journals (Sweden)
Adriana Grava
2009-05-01
Full Text Available The paper presents two methods to analyzethe electric circuits using the flow-graphs and thebond-graphs studying the differences between thesemethods.As it can be noticed, the two methods are totallydifferent; their common point being Mason’s rule thatis applied in both cases but it is applied differently foreach type of graphs.
Bond graph modelling of engineering systems: theory, applications and software support
National Research Council Canada - National Science Library
Borutzky, Wolfgang; Margolis, Donald L
2011-01-01
... way such that analytical or computer response predictions can be straightforwardly carried out. Bond graphs are a concise pictorial representation of all types of interacting energetic systems. In my experience working with engineers on the development of complex systems it is obvious that these systems suffer from thermal problems, structural problems, vibration and noise problems, and control and stability issues that do not fit into a single discipline. Bond graphs provide the link by which all these different ...
Bond graph modeling and simulation of impact dynamics of an automotive crash
International Nuclear Information System (INIS)
Khurshid, A.; Malik, M.A.
2007-01-01
With increase in the speeds of automotives, safety has become more and more important aspect of designers to care for. Thus, it is necessary to design the automobile body structure keeping in view all the safety requirements. As a result of the above-mentioned facts, in the recent years, the designers in making automotives more safe, more collision resistant and crash worthy have focused increased attention on designing automotives, which provides greater protection for the drivers and the passengers in case of an accident. Before a new model is launched into the market, a complete collision analysis is carried out to check the damage reduction capabilities and impact protection of automotives in case of an accident. Research in the field of automotive collision and impact analysis is a continuing activity and dedicated groups of engineers are devoting their full time and efforts for this. In this research work, the main attention is focused to provide a detailed knowledge about automotive collision analysis. The objective of this research paper is to develop an understanding of the automotive collision response. For this, we have done a simulation experiment in which, on a railroad, a train car is separated from a train and is moving towards two stationary train cars. By using a bond graph model of the system its state-space equations are found. Then by using software, the simulation is carried out. The bond graph method is a graphical presentation of the power flow using bonds. (author)
Bond graphs for modelling, control and fault diagnosis of engineering systems
2017-01-01
This book presents theory and latest application work in Bond Graph methodology with a focus on: • Hybrid dynamical system models, • Model-based fault diagnosis, model-based fault tolerant control, fault prognosis • and also addresses • Open thermodynamic systems with compressible fluid flow, • Distributed parameter models of mechanical subsystems. In addition, the book covers various applications of current interest ranging from motorised wheelchairs, in-vivo surgery robots, walking machines to wind-turbines.The up-to-date presentation has been made possible by experts who are active members of the worldwide bond graph modelling community. This book is the completely revised 2nd edition of the 2011 Springer compilation text titled Bond Graph Modelling of Engineering Systems – Theory, Applications and Software Support. It extends the presentation of theory and applications of graph methodology by new developments and latest research results. Like the first edition, this book addresses readers in a...
Bond Graph Modelling for Fault Detection and Isolation of an Ultrasonic Linear Motor
Directory of Open Access Journals (Sweden)
Mabrouk KHEMLICHE
2010-12-01
Full Text Available In this paper Bond Graph modeling, simulation and monitoring of ultrasonic linear motors are presented. Only the vibration of piezoelectric ceramics and stator will be taken into account. Contact problems between stator and rotor are not treated here. So, standing and travelling waves will be briefly presented since the majority of the motors use another wave type to generate the stator vibration and thus obtain the elliptic trajectory of the points on the surface of the stator in the first time. Then, electric equivalent circuit will be presented with the aim for giving a general idea of another way of graphical modelling of the vibrator introduced and developed. The simulations of an ultrasonic linear motor are then performed and experimental results on a prototype built at the laboratory are presented. Finally, validation of the Bond Graph method for modelling is carried out, comparing both simulation and experiment results. This paper describes the application of the FDI approach to an electrical system. We demonstrate the FDI effectiveness with real data collected from our automotive test. We introduce the analysis of the problem involved in the faults localization in this process. We propose a method of fault detection applied to the diagnosis and to determine the gravity of a detected fault. We show the possibilities of application of the new approaches to the complex system control.
The hamiltonian index of a graph and its branch-bonds
Xiong, Liming; Broersma, Haitze J.; Li, Xueliang; Li, Xueliang; Li, MingChu
2004-01-01
Let G be an undirected and loopless finite graph that is not a path. The smallest integer m such that the iterated line graph Lm(G) is hamiltonian is called the hamiltonian index of G, denoted by h(G). A reduction method to determine the hamiltonian index of a graph G with h(G) ≤ 2 is given here. We
Bond Graph Model of Cerebral Circulation: Toward Clinically Feasible Systemic Blood Flow Simulations
Safaei, Soroush; Blanco, Pablo J.; Müller, Lucas O.; Hellevik, Leif R.; Hunter, Peter J.
2018-01-01
We propose a detailed CellML model of the human cerebral circulation that runs faster than real time on a desktop computer and is designed for use in clinical settings when the speed of response is important. A lumped parameter mathematical model, which is based on a one-dimensional formulation of the flow of an incompressible fluid in distensible vessels, is constructed using a bond graph formulation to ensure mass conservation and energy conservation. The model includes arterial vessels with geometric and anatomical data based on the ADAN circulation model. The peripheral beds are represented by lumped parameter compartments. We compare the hemodynamics predicted by the bond graph formulation of the cerebral circulation with that given by a classical one-dimensional Navier-Stokes model working on top of the whole-body ADAN model. Outputs from the bond graph model, including the pressure and flow signatures and blood volumes, are compared with physiological data. PMID:29551979
Modeling and Simulation of a Wind Turbine Driven Induction Generator Using Bond Graph
Directory of Open Access Journals (Sweden)
Lachouri Abderrazak
2015-12-01
Full Text Available The objective of this paper is to investigate the modelling and simulation of wind turbine applied on induction generator with bond graph methodology as a graphical and multi domain approach. They provide a precise and unambiguous modelling tool, which allows for the specification of hierarchical physical structures. The paper begins with an introduction to the bond graphs technique, followed by an implementation of the wind turbine model. Simulation results illustrate the simplified system response obtained using the 20-sim software.
Simulation of mixed bond graphs and block diagrams on personal computers using TUTSIM
Beukeboom, J.J.A.J.; van Dixhoorn, J.J.; Meerman, J.W.
1985-01-01
The TUTSIM simulation program for continuous dynamic systems accepts (nonlinear) block diagrams, bond graphs or a free mix of both. The simulation is “hands on” interactive, providing a direct contact with the model. The implementation of the program on existing personal computers (Apple II, IBM PC)
Constitutive hybrid processes: A process-algebraic semantics for hybrid bond graphs
Cuijpers, P.J.L.; Broenink, J.F.; Mosterman, P.J.
2008-01-01
Models of physical systems have to be based on physical principles such as conservation of energy and continuity of power. These principles are inherently enforced by the bond graph modeling formalism. Often, however, physical components may be best modeled as piecewise continuous with discrete mode
Constitutive Hybrid Processes: a Process-Algebraic Semantics for Hybrid Bond Graphs
Cuijpers, P.J.L.; Broenink, Johannes F.; Mosterman, P.J.
Models of physical systems have to be based on physical principles such as conservation of energy and continuity of power. These principles are inherently enforced by the bond graph modeling formalism. Often, however, physical components may be best modeled as piecewise continuous with discrete mode
Constitutive Hybrid Processes: a Process-Algebraic Semantics for Hybrid Bond Graphs
Cuijpers, Pieter J.L.; Broenink, Johannes F.; Mosterman, Pieter J.
2008-01-01
Models of physical systems have to be based on physical principles such as conservation of energy and continuity of power. These principles are inherently enforced by the bond graph modeling formalism. Often, however, physical components may be best modeled as piecewise continuous with discrete mode
An Interactive Teaching System for Bond Graph Modeling and Simulation in Bioengineering
Roman, Monica; Popescu, Dorin; Selisteanu, Dan
2013-01-01
The objective of the present work was to implement a teaching system useful in modeling and simulation of biotechnological processes. The interactive system is based on applications developed using 20-sim modeling and simulation software environment. A procedure for the simulation of bioprocesses modeled by bond graphs is proposed and simulators…
Pseudo-Bond Graph model for the analysis of the thermal behavior of buildings
Directory of Open Access Journals (Sweden)
Merabtine Abdelatif
2013-01-01
Full Text Available In this work, a simplified graphical modeling tool, which in some extent can be considered in halfway between detailed physical and Data driven dynamic models, has been developed. This model is based on Bond Graphs approach. This approach has the potential to display explicitly the nature of power in a building system, such as a phenomenon of storage, processing and dissipating energy such as Heating, Ventilation and Air-Conditioning (HVAC systems. This paper represents the developed models of the two transient heat conduction problems corresponding to the most practical cases in building envelope, such as the heat transfer through vertical walls, roofs and slabs. The validation procedure consists of comparing the results obtained with this model with analytical solution. It has shown very good agreement between measured data and Bond Graphs model simulation. The Bond Graphs technique is then used to model the building dynamic thermal behavior over a single zone building structure and compared with a set of experimental data. An evaluation of indoor temperature was carried out in order to check our Bond Graphs model.
Replica methods for loopy sparse random graphs
International Nuclear Information System (INIS)
Coolen, ACC
2016-01-01
I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees (via hard constraints) and the adjacency matrix spectrum (via a soft constraint) are prescribed. The sum over graphs can be done analytically, using a replica formalism with complex replica dimensions. All known results for tree-like graphs are recovered in a suitable limit. For loopy graphs, the emerging theory has an appealing and intuitive structure, suggests how message passing algorithms should be adapted, and what is the structure of theories describing spin systems on loopy architectures. However, the formalism is still largely untested, and may require further adjustment and refinement. (paper)
Central limit theorems for large graphs: Method of quantum decomposition
International Nuclear Information System (INIS)
Hashimoto, Yukihiro; Hora, Akihito; Obata, Nobuaki
2003-01-01
A new method is proposed for investigating spectral distribution of the combinatorial Laplacian (adjacency matrix) of a large regular graph on the basis of quantum decomposition and quantum central limit theorem. General results are proved for Cayley graphs of discrete groups and for distance-regular graphs. The Coxeter groups and the Johnson graphs are discussed in detail by way of illustration. In particular, the limit distributions obtained from the Johnson graphs are characterized by the Meixner polynomials which form a one-parameter deformation of the Laguerre polynomials
Screw-vector bond graphs for kinetic-static modelling and analysis of mechanisms
International Nuclear Information System (INIS)
Bidard, Catherine
1994-01-01
This dissertation deals with the kinetic-static modelling and analysis of spatial mechanisms used in robotics systems. A framework is proposed, which embodies a geometrical and a network approach for kinetic-static modelling. For this purpose we use screw theory and bond graphs. A new form of bond graphs is introduced: the screw-vector bond graph, whose power variables are defined to be wrenches and twists expressed as intrinsic screw-vectors. The mechanism is then identified as a network, whose components are kinematic pairs and whose topology is described by a directed graph. A screw-vector Simple Junction Structure represents the topological constraints. Kinematic pairs are represented by one-port elements, defined by two reciprocal screw-vector spaces. Using dual bases of screw-vectors, a generic decomposition of kinematic pair elements is given. The reduction of kinetic-static models of series and parallel kinematic chains is used in order to derive kinetic-static functional models in geometric form. Thereupon, the computational causality assignment is adapted for the graphical analysis of the mobility and the functioning of spatial mechanisms, based on completely or incompletely specified models. (author) [fr
Bond percolation on a class of correlated and clustered random graphs
International Nuclear Information System (INIS)
Allard, A; Hébert-Dufresne, L; Noël, P-A; Marceau, V; Dubé, L J
2012-01-01
We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the configuration model where nodes of different types are connected via different types of hyperedges, edges that can link more than two nodes. We argue that the multitype approach coupled with the use of clustered hyperedges can reproduce a wide spectrum of complex patterns, and thus enhances our capability to model real complex networks. As an illustration of this claim, we use our formalism to highlight unusual behaviours of the size and composition of the components (small and giant) in a synthetic, albeit realistic, social network. (paper)
Entanglement of the valence-bond-solid state on an arbitrary graph
International Nuclear Information System (INIS)
Xu Ying; Korepin, Vladimir E
2008-01-01
The Affleck-Kennedy-Lieb-Tasaki (AKLT) spin interacting model can be defined on an arbitrary graph. We explain the construction of the AKLT Hamiltonian. Given certain conditions, the ground state is unique and known as the valence-bond-solid (VBS) state. It can be used in measurement-based quantum computation as a resource state instead of the cluster state. We study the VBS ground state on an arbitrary connected graph. The graph is cut into two disconnected parts: the block and the environment. We study the entanglement between these two parts and prove that many eigenvalues of the density matrix of the block are zero. We describe a subspace of eigenvectors of the density matrix corresponding to non-zero eigenvalues. The subspace is the degenerate ground states of some Hamiltonian which we call the block Hamiltonian
A conjugate gradient method for the spectral partitioning of graphs
Kruyt, Nicolaas P.
1997-01-01
The partitioning of graphs is a frequently occurring problem in science and engineering. The spectral graph partitioning method is a promising heuristic method for this class of problems. Its main disadvantage is the large computing time required to solve a special eigenproblem. Here a simple and
International Nuclear Information System (INIS)
Saller, H.A.; Hodge, E.S.; Paprocki, S.J.; Dayton, R.W.
1987-01-01
A method of making a fuel-containing structure for nuclear reactors is described comprising providing an assembly comprising fuel units consisting of a core plate containing thermal-neutron-fissionable material, sheets of cladding metal on its bottom and top surfaces, the cladding sheets being of greater width and length than the core plates whereby recesses are formed at the ends and sides of the core plate, and end pieces and first side pieces of cladding metal of the same thickness as the core plate positioned in the recesses. The assembly further comprises second side pieces of cladding metal engaging the cladding sheets so as to space the fuel units from one another, and filler plates of an acid-dissolvable nonresilient material whose melting point is above 2000 0 F, arranged between a pair of the second side pieces and the cladding plates of two adjacent fuel units. The filler plates have the same thickness as the second side pieces. The method further comprises enclosing the entire assembly in an envelope; evacuating the interior of the entire assembly through the envelope; applying inert gas under a pressure of about 10,000 psi to the outside of the envelope while at the same time heating the assembly to a temperature above the flow point of the cladding metal but below the melting point of any material of the assembly, slowly cooling the assembly to room temperature; removing the envelope; and dissolving the filler plates without attacking the cladding metal
Scalable force directed graph layout algorithms using fast multipole methods
Yunis, Enas Abdulrahman; Yokota, Rio; Ahmadia, Aron
2012-01-01
We present an extension to ExaFMM, a Fast Multipole Method library, as a generalized approach for fast and scalable execution of the Force-Directed Graph Layout algorithm. The Force-Directed Graph Layout algorithm is a physics-based approach
Directory of Open Access Journals (Sweden)
Ming Yu
2015-12-01
Full Text Available This article proposes a sequential fault diagnosis method to handle asynchronous distinct faults using diagnostic hybrid bond graph and composite harmony search. The faults under consideration include fault mode, abrupt fault, and intermittent fault. The faults can occur in different time instances, which add to the difficulty of decision making for fault diagnosis. This is because the earlier occurred fault can exhibit fault symptom which masks the fault symptom of latter occurred fault. In order to solve this problem, a sequential identification algorithm is developed in which the identification task is reactivated based on two conditions. The first condition is that the latter occurred fault has at least one inconsistent coherence vector element which is consistent in coherence vector of the earlier occurred fault, and the second condition is that the existing fault coherence vector has the ability to hide other faults and the second-level residual exceeds the threshold. A new composite harmony search which is capable of handling continuous variables and binary variables simultaneously is proposed for identification purpose. Experiments on a mobile robot system are conducted to assess the proposed sequential fault diagnosis algorithm.
Jha, Mayank Shekhar; Chatti, Nizar; Declerck, Philippe
2017-09-01
This paper addresses the fault diagnosis problem of uncertain systems in the context of Bond Graph modelling technique. The main objective is to enhance the fault detection step based on Interval valued Analytical Redundancy Relations (named I-ARR) in order to overcome the problems related to false alarms, missed alarms and robustness issues. These I-ARRs are a set of fault indicators that generate the interval bounds called thresholds. A fault is detected once the nominal residuals (point valued part of I-ARRs) exceed the thresholds. However, the existing fault detection method is limited to parametric faults and it presents various limitations with regards to estimation of measurement signal derivatives, to which I-ARRs are sensitive. The novelties and scientific interest of the proposed methodology are: (1) to improve the accuracy of the measurements derivatives estimation by using a dedicated sliding mode differentiator proposed in this work, (2) to suitably integrate the Fourier-Motzkin Elimination (FME) technique within the I-ARRs based diagnosis so that measurements faults can be detected successfully. The latter provides interval bounds over the derivatives which are included in the thresholds. The proposed methodology is studied under various scenarios (parametric and measurement faults) via simulations over a mechatronic torsion bar system.
Dynamic airspace configuration method based on a weighted graph model
Directory of Open Access Journals (Sweden)
Chen Yangzhou
2014-08-01
Full Text Available This paper proposes a new method for dynamic airspace configuration based on a weighted graph model. The method begins with the construction of an undirected graph for the given airspace, where the vertices represent those key points such as airports, waypoints, and the edges represent those air routes. Those vertices are used as the sites of Voronoi diagram, which divides the airspace into units called as cells. Then, aircraft counts of both each cell and of each air-route are computed. Thus, by assigning both the vertices and the edges with those aircraft counts, a weighted graph model comes into being. Accordingly the airspace configuration problem is described as a weighted graph partitioning problem. Then, the problem is solved by a graph partitioning algorithm, which is a mixture of general weighted graph cuts algorithm, an optimal dynamic load balancing algorithm and a heuristic algorithm. After the cuts algorithm partitions the model into sub-graphs, the load balancing algorithm together with the heuristic algorithm transfers aircraft counts to balance workload among sub-graphs. Lastly, airspace configuration is completed by determining the sector boundaries. The simulation result shows that the designed sectors satisfy not only workload balancing condition, but also the constraints such as convexity, connectivity, as well as minimum distance constraint.
Energy Technology Data Exchange (ETDEWEB)
Andoulsi, R.
2001-12-01
We present in this thesis a study of a class of photovoltaic system by a bond graph approach. This study concerns the modelling, the analysis and the control of some configurations including PV generator, DC/DC converters and DC motor-pumps. The modelling of the different elements of a photovoltaic system is an indispensable stage that must precede all application of sizing, identification or simulation. However, theses PV systems are of hybrid type and their modelling is complex. It is why we use a unified modelling approach based on the bond graph technique. This methodology is completely systematic and has a sufficient flexibility for allowing the introduction of different components in the system. In the first chapter, we recall the principle of functioning of a photovoltaic generator and we treat mainly the MPPT (Maximum Power Point Tracking) working. In the second chapter, we elaborate bond graph models of various photovoltaic system configurations. For the PV source, we elaborate, in a first stage, a complete model taking into account the various physical phenomena influencing the quality of the PV source. In a second stage, we deduce a reduced bond graph model more easy to use for analysis and control purposes. For the DC/DC converters, we recall the bond graph modelling of switching elements and the average bond graph of the DC/DC converters developed in the literature. Thus, we deduce the bond graphs models of the various DC/DC converters to be used. The third chapter presents a dynamic study of some configurations stability in linear procedure. In the fourth chapter, we study the feasibility of non linear controllers by input/output linearization for some configurations of PV systems. In this study, we use the concept of inverse bond graph to determine, by a bond graph approach, the expression of the control input and the nature of the stability of the internal dynamics (dynamics of zeros). The fifth chapter is dedicated for the presentation of some
Method to improve commercial bonded SOI material
Maris, Humphrey John; Sadana, Devendra Kumar
2000-07-11
A method of improving the bonding characteristics of a previously bonded silicon on insulator (SOI) structure is provided. The improvement in the bonding characteristics is achieved in the present invention by, optionally, forming an oxide cap layer on the silicon surface of the bonded SOI structure and then annealing either the uncapped or oxide capped structure in a slightly oxidizing ambient at temperatures greater than 1200.degree. C. Also provided herein is a method for detecting the bonding characteristics of previously bonded SOI structures. According to this aspect of the present invention, a pico-second laser pulse technique is employed to determine the bonding imperfections of previously bonded SOI structures.
Dim target detection method based on salient graph fusion
Hu, Ruo-lan; Shen, Yi-yan; Jiang, Jun
2018-02-01
Dim target detection is one key problem in digital image processing field. With development of multi-spectrum imaging sensor, it becomes a trend to improve the performance of dim target detection by fusing the information from different spectral images. In this paper, one dim target detection method based on salient graph fusion was proposed. In the method, Gabor filter with multi-direction and contrast filter with multi-scale were combined to construct salient graph from digital image. And then, the maximum salience fusion strategy was designed to fuse the salient graph from different spectral images. Top-hat filter was used to detect dim target from the fusion salient graph. Experimental results show that proposal method improved the probability of target detection and reduced the probability of false alarm on clutter background images.
Modelo de dinámica lateral de vehículo mediante bond graph
Directory of Open Access Journals (Sweden)
Juan Carlos Parra Márquez
2008-07-01
Full Text Available Este trabajo presenta los resultados de la investigación, cuyo objetivo es obtener un modelo matemático que permita determinar la dinámica lateral de un vehículo mediante el uso de Bond Graph. Este modelo es válido para robótica móvil. Los análisis de comportamiento del modelo han sido probados con simulaciones típicas del movimiento lateral de un vehículo. Finalmente, este modelo ha sido obtenido e implementado mediante el software 20-Sim. This paper presents the results of a research whose objective was to find a mathematical model in order to determine the lateral dynamic of Vehicle by means of the use of Bond Graph. This model is valid also for mobile robotics. The analyses of behavior of the model were realized across typical simulations of a vehicle in lateral movement. Finally, this mathematical model was obtained and implemented across the software 20-Sim.
Three methods to measure RH bond energies
International Nuclear Information System (INIS)
Berkowitz, J.; Ellison, G.B.; Gutman, D.
1993-01-01
In this paper the authors compare and contrast three powerful methods for experimentally measuring bond energies in polyatomic molecules. The methods are: radical kinetics; gas phase acidity cycles; and photoionization mass spectroscopy. The knowledge of the values of bond energies are a basic piece of information to a chemist. Chemical reactions involve the making and breaking of chemical bonds. It has been shown that comparable bonds in polyatomic molecules, compared to the same bonds in radicals, can be significantly different. These bond energies can be measured in terms of bond dissociation energies
Scalable force directed graph layout algorithms using fast multipole methods
Yunis, Enas Abdulrahman
2012-06-01
We present an extension to ExaFMM, a Fast Multipole Method library, as a generalized approach for fast and scalable execution of the Force-Directed Graph Layout algorithm. The Force-Directed Graph Layout algorithm is a physics-based approach to graph layout that treats the vertices V as repelling charged particles with the edges E connecting them acting as springs. Traditionally, the amount of work required in applying the Force-Directed Graph Layout algorithm is O(|V|2 + |E|) using direct calculations and O(|V| log |V| + |E|) using truncation, filtering, and/or multi-level techniques. Correct application of the Fast Multipole Method allows us to maintain a lower complexity of O(|V| + |E|) while regaining most of the precision lost in other techniques. Solving layout problems for truly large graphs with millions of vertices still requires a scalable algorithm and implementation. We have been able to leverage the scalability and architectural adaptability of the ExaFMM library to create a Force-Directed Graph Layout implementation that runs efficiently on distributed multicore and multi-GPU architectures. © 2012 IEEE.
Methods of filtering the graph images of the functions
Directory of Open Access Journals (Sweden)
Олександр Григорович Бурса
2017-06-01
Full Text Available The theoretical aspects of cleaning raster images of scanned graphs of functions from digital, chromatic and luminance distortions by using computer graphics techniques have been considered. The basic types of distortions characteristic of graph images of functions have been stated. To suppress the distortion several methods, providing for high-quality of the resulting images and saving their topological features, were suggested. The paper describes the techniques developed and improved by the authors: the method of cleaning the image of distortions by means of iterative contrasting, based on the step-by-step increase in image contrast in the graph by 1%; the method of small entities distortion restoring, based on the thinning of the known matrix of contrast increase filter (the allowable dimensions of the nucleus dilution radius convolution matrix, which provide for the retention of the graph lines have been established; integration technique of the noise reduction method by means of contrasting and distortion restoring method of small entities with known σ-filter. Each method in the complex has been theoretically substantiated. The developed methods involve treatment of graph images as the entire image (global processing and its fragments (local processing. The metrics assessing the quality of the resulting image with the global and local processing have been chosen, the substantiation of the choice as well as the formulas have been given. The proposed complex methods of cleaning the graphs images of functions from grayscale image distortions is adaptive to the form of an image carrier, the distortion level in the image and its distribution. The presented results of testing the developed complex of methods for a representative sample of images confirm its effectiveness
A sediment graph model based on SCS-CN method
Singh, P. K.; Bhunya, P. K.; Mishra, S. K.; Chaube, U. C.
2008-01-01
SummaryThis paper proposes new conceptual sediment graph models based on coupling of popular and extensively used methods, viz., Nash model based instantaneous unit sediment graph (IUSG), soil conservation service curve number (SCS-CN) method, and Power law. These models vary in their complexity and this paper tests their performance using data of the Nagwan watershed (area = 92.46 km 2) (India). The sensitivity of total sediment yield and peak sediment flow rate computations to model parameterisation is analysed. The exponent of the Power law, β, is more sensitive than other model parameters. The models are found to have substantial potential for computing sediment graphs (temporal sediment flow rate distribution) as well as total sediment yield.
[A retrieval method of drug molecules based on graph collapsing].
Qu, J W; Lv, X Q; Liu, Z M; Liao, Y; Sun, P H; Wang, B; Tang, Z
2018-04-18
To establish a compact and efficient hypergraph representation and a graph-similarity-based retrieval method of molecules to achieve effective and efficient medicine information retrieval. Chemical structural formula (CSF) was a primary search target as a unique and precise identifier for each compound at the molecular level in the research field of medicine information retrieval. To retrieve medicine information effectively and efficiently, a complete workflow of the graph-based CSF retrieval system was introduced. This system accepted the photos taken from smartphones and the sketches drawn on tablet personal computers as CSF inputs, and formalized the CSFs with the corresponding graphs. Then this paper proposed a compact and efficient hypergraph representation for molecules on the basis of analyzing factors that directly affected the efficiency of graph matching. According to the characteristics of CSFs, a hierarchical collapsing method combining graph isomorphism and frequent subgraph mining was adopted. There was yet a fundamental challenge, subgraph overlapping during the collapsing procedure, which hindered the method from establishing the correct compact hypergraph of an original CSF graph. Therefore, a graph-isomorphism-based algorithm was proposed to select dominant acyclic subgraphs on the basis of overlapping analysis. Finally, the spatial similarity among graphical CSFs was evaluated by multi-dimensional measures of similarity. To evaluate the performance of the proposed method, the proposed system was firstly compared with Wikipedia Chemical Structure Explorer (WCSE), the state-of-the-art system that allowed CSF similarity searching within Wikipedia molecules dataset, on retrieval accuracy. The system achieved higher values on mean average precision, discounted cumulative gain, rank-biased precision, and expected reciprocal rank than WCSE from the top-2 to the top-10 retrieved results. Specifically, the system achieved 10%, 1.41, 6.42%, and 1
Nguyen, Louis H.; Ramakrishnan, Jayant; Granda, Jose J.
2006-01-01
The assembly and operation of the International Space Station (ISS) require extensive testing and engineering analysis to verify that the Space Station system of systems would work together without any adverse interactions. Since the dynamic behavior of an entire Space Station cannot be tested on earth, math models of the Space Station structures and mechanical systems have to be built and integrated in computer simulations and analysis tools to analyze and predict what will happen in space. The ISS Centrifuge Rotor (CR) is one of many mechanical systems that need to be modeled and analyzed to verify the ISS integrated system performance on-orbit. This study investigates using Bond Graph modeling techniques as quick and simplified ways to generate models of the ISS Centrifuge Rotor. This paper outlines the steps used to generate simple and more complex models of the CR using Bond Graph Computer Aided Modeling Program with Graphical Input (CAMP-G). Comparisons of the Bond Graph CR models with those derived from Euler-Lagrange equations in MATLAB and those developed using multibody dynamic simulation at the National Aeronautics and Space Administration (NASA) Johnson Space Center (JSC) are presented to demonstrate the usefulness of the Bond Graph modeling approach for aeronautics and space applications.
Evolutionary dynamics on graphs: Efficient method for weak selection
Fu, Feng; Wang, Long; Nowak, Martin A.; Hauert, Christoph
2009-04-01
Investigating the evolutionary dynamics of game theoretical interactions in populations where individuals are arranged on a graph can be challenging in terms of computation time. Here, we propose an efficient method to study any type of game on arbitrary graph structures for weak selection. In this limit, evolutionary game dynamics represents a first-order correction to neutral evolution. Spatial correlations can be empirically determined under neutral evolution and provide the basis for formulating the game dynamics as a discrete Markov process by incorporating a detailed description of the microscopic dynamics based on the neutral correlations. This framework is then applied to one of the most intriguing questions in evolutionary biology: the evolution of cooperation. We demonstrate that the degree heterogeneity of a graph impedes cooperation and that the success of tit for tat depends not only on the number of rounds but also on the degree of the graph. Moreover, considering the mutation-selection equilibrium shows that the symmetry of the stationary distribution of states under weak selection is skewed in favor of defectors for larger selection strengths. In particular, degree heterogeneity—a prominent feature of scale-free networks—generally results in a more pronounced increase in the critical benefit-to-cost ratio required for evolution to favor cooperation as compared to regular graphs. This conclusion is corroborated by an analysis of the effects of population structures on the fixation probabilities of strategies in general 2×2 games for different types of graphs. Computer simulations confirm the predictive power of our method and illustrate the improved accuracy as compared to previous studies.
Valuing Convertible Bonds Based on LSRQM Method
Directory of Open Access Journals (Sweden)
Jian Liu
2014-01-01
Full Text Available Convertible bonds are one of the essential financial products for corporate finance, while the pricing theory is the key problem to the theoretical research of convertible bonds. This paper demonstrates how to price convertible bonds with call and put provisions using Least-Squares Randomized Quasi-Monte Carlo (LSRQM method. We consider the financial market with stochastic interest rates and credit risk and present a detailed description on calculating steps of convertible bonds value. The empirical results show that the model fits well the market prices of convertible bonds in China’s market and the LSRQM method is effective.
Muhammad, Akram; Musavarah, Sarwar
2016-01-01
In this research study, we introduce the concept of bipolar neutrosophic graphs. We present the dominating and independent sets of bipolar neutrosophic graphs. We describe novel multiple criteria decision making methods based on bipolar neutrosophic sets and bipolar neutrosophic graphs. We also develop an algorithm for computing domination in bipolar neutrosophic graphs.
Energy Technology Data Exchange (ETDEWEB)
Gandanegara, G.
2003-11-15
In Electrical Engineering, the global analysis of systems is difficult because of their heterogeneity and their multi-domain nature. Nevertheless, this system approach is essential because it underlines couplings between elements of different physical fields. To facilitate this analysis, the unified formalism Bond Graph is used. This modeling method illustrates the energetic transfers in the system. Moreover, this methodology offers interesting solutions in terms of system analysis. Two simplification methods have been investigated and compared, i.e. the Singular Perturbations Method (SPM), based on the dynamic analysis of elements, and the Model Order Reduction Algorithm (MORA), based on the energetic activity. By these methods, a simplified bond graph model can be obtained for a given frequency range. The stability analysis by the root locus method and the Lyapunov's second method have been examined and applied with the Bond Graph formalism support. An industrial railway traction system is considered as the case study in the application of these different analysis techniques. (author)
Representation Methods in AI. Searching by Graphs
Directory of Open Access Journals (Sweden)
Angel GARRIDO
2012-12-01
Full Text Available The historical origin of the Artificial Intelligence (A I is usually established in the Darmouth Conference, of 1956. But we can find many more arcane origins [1]. Also, we can consider, in more recent times, very great thinkers, as Janos Neumann (then, John von Neumann, arrived in USA, Norbert Wiener, Alan Mathison Turing, or Lofti Zadehfor instance [6, 7]. Frequently A I requires Logic. But its classical version shows too many insufficiencies. So, it was necessary to introduce more sophisticated tools, as fuzzy logic, modal logic, non-monotonic logic and so on [2]. Among the things that A I needs to represent are: categories, objects, properties, relations between objects, situations, states, time, events, causes and effects, knowledge about knowledge, and so on. The problems in A I can be classified in two general types [3, 4]: search problems and representation problems. In this last “mountain”, there exist different ways to reach their summit. So, we have [3]: logics, rules, frames, associative nets, scripts and so on, many times connectedamong them. We attempt, in this paper, a panoramic vision of the scope of application of such Representation Methods in A I. The two more disputable questions of both modern philosophy of mind and A I will be Turing Test and The Chinese Room Argument. To elucidate these very difficult questions, see both final Appendices.
Modelling of Non-Linear Pilot Disinfection Water System: A Bond Graph Approach
Directory of Open Access Journals (Sweden)
Naoufel ZITOUNI
2012-08-01
Full Text Available The ultraviolet (UV irradiations are used to solve the bacteriological problem of the drinking water quality. A discharge-gas lamp is used to produce this type of irradiation. The UV lamp is fed by photovoltaic (PV energy via electronic ballast composed by an inverter, a transformer and resonant circuit (RLC. The aim of this work is to give a useful global model of the system. In particular, we introduce the complicated UV lamp model and the water disinfection kinetics, where the radiant energy flux emitted by the discharge-gas lamp and the arc voltage are a complex functions of the current and time. This system is intended to be mainly used in rural zones, the photovoltaic modules as source of energy is an adequate solution. To optimise the power transfer from the PV array to ballast and UV lamp, a Maximum Power Point Tracking (MPPT device may be located between PV array and the loads. In this paper, we developed a bond-graph model which gives the water quality from UV flow, gas type, pressure, lamp current and geometrical characteristic. Finally reliable simulations are established and compared with experimental tests.
Simulation of an Asynchronous Machine by using a Pseudo Bond Graph
Romero, Gregorio; Felez, Jesus; Maroto, Joaquin; Martinez, M. Luisa
2008-11-01
For engineers, computer simulation, is a basic tool since it enables them to understand how systems work without actually needing to see them. They can learn how they work in different circumstances and optimize their design with considerably less cost in terms of time and money than if they had to carry out tests on a physical system. However, if computer simulation is to be reliable it is essential for the simulation model to be validated. There is a wide range of commercial brands on the market offering products for electrical domain simulation (SPICE, LabVIEW PSCAD,Dymola, Simulink, Simplorer,...). These are powerful tools, but require the engineer to have a perfect knowledge of the electrical field. This paper shows an alternative methodology to can simulate an asynchronous machine using the multidomain Bond Graph technique and apply it in any program that permit the simulation of models based in this technique; no extraordinary knowledge of this technique and electric field are required to understand the process .
The Stability Analysis Method of the Cohesive Granular Slope on the Basis of Graph Theory.
Guan, Yanpeng; Liu, Xiaoli; Wang, Enzhi; Wang, Sijing
2017-02-27
This paper attempted to provide a method to calculate progressive failure of the cohesivefrictional granular geomaterial and the spatial distribution of the stability of the cohesive granular slope. The methodology can be divided into two parts: the characterization method of macro-contact and the analysis of the slope stability. Based on the graph theory, the vertexes, the edges and the edge sequences are abstracted out to characterize the voids, the particle contact and the macro-contact, respectively, bridging the gap between the mesoscopic and macro scales of granular materials. This paper adopts this characterization method to extract a graph from a granular slope and characterize the macro sliding surface, then the weighted graph is analyzed to calculate the slope safety factor. Each edge has three weights representing the sliding moment, the anti-sliding moment and the braking index of contact-bond, respectively, . The safety factor of the slope is calculated by presupposing a certain number of sliding routes and reducing Weight repeatedly and counting the mesoscopic failure of the edge. It is a kind of slope analysis method from mesoscopic perspective so it can present more detail of the mesoscopic property of the granular slope. In the respect of macro scale, the spatial distribution of the stability of the granular slope is in agreement with the theoretical solution.
Enhancements to Graph based methods for Multi Document Summarization
Directory of Open Access Journals (Sweden)
Rengaramanujam Srinivasan
2009-01-01
Full Text Available This paper focuses its attention on extractivesummarization using popular graph based approaches. Graphbased methods can be broadly classified into two categories:non- PageRank type and PageRank type methods. Of themethods already proposed - the Centrality Degree methodbelongs to the former category while LexRank and ContinuousLexRank methods belong to later category. The paper goes on tosuggest two enhancements to both PageRank type and non-PageRank type methods. The first modification is that ofrecursively discounting the selected sentences, i.e. if a sentence isselected it is removed from further consideration and the nextsentence is selected based upon the contributions of theremaining sentences only. Next the paper suggests a method ofincorporating position weight to these schemes. In all 14methods –six of non- PageRank type and eight of PageRanktype have been investigated. To clearly distinguish betweenvarious schemes, we call the methods of incorporatingdiscounting and position weight enhancements over LexicalRank schemes as Sentence Rank (SR methods. Intrinsicevaluation of all the 14 graph based methods were done usingconventional Precision metric and metrics earlier proposed byus - Effectiveness1 (E1 and Effectiveness2 (E2. Experimentalstudy brings out that the proposed SR methods are superior toall the other methods.
From modular invariants to graphs: the modular splitting method
International Nuclear Information System (INIS)
Isasi, E; Schieber, G
2007-01-01
We start with a given modular invariant M of a two-dimensional su-hat(n) k conformal field theory (CFT) and present a general method for solving the Ocneanu modular splitting equation and then determine, in a step-by-step explicit construction (1) the generalized partition functions corresponding to the introduction of boundary conditions and defect lines; (2) the quantum symmetries of the higher ADE graph G associated with the initial modular invariant M. Note that one does not suppose here that the graph G is already known, since it appears as a by-product of the calculations. We analyse several su-hat(3) k exceptional cases at levels 5 and 9
The role of the autonomic nervous system in hypertension: a bond graph model study
International Nuclear Information System (INIS)
Chen, Shuzhen; Gong, Yuexian; Dai, Kaiyong; Sui, Meirong; Yu, Yi; Ning, Gangmin; Zhang, Shaowen
2008-01-01
A bond graph model of the cardiovascular system with embedded autonomic nervous regulation was developed for a better understanding of the role of the autonomic nervous system (ANS) in hypertension. The model is described by a pump model of the heart and a detailed representation of the head and neck, pulmonary, coronary, abdomen and extremity circulation. It responds to sympathetic and parasympathetic activities by modifying systemic peripheral vascular resistance, heart rate, ventricular end-systolic elastance and venous unstressed volumes. The impairment of ANS is represented by an elevation of the baroreflex set point. The simulation results show that, compared with normotensive, in hypertension the systolic and diastolic blood pressure (SBP/DBP) rose from 112/77 mmHg to 144/94 mmHg and the left ventricular wall thickness (LVWT) increased from 10 mm to 12.74 mm. In the case that ANS regulation was absent, both the SBP and DBP further increased by 8 mmHg and the LVWT increased to 13.22 mm. The results also demonstrate that when ANS regulation is not severely damaged, e.g. the baroreflex set point is 97 mmHg, it still has an effect in preventing the rapid rise of blood pressure in hypertension; however, with the worsening of ANS regulation, its protective role weakens. The results agree with human physiological and pathological features in hemodynamic parameters and carotid baroreflex function curves, and indicate the role of ANS in blood pressure regulation and heart protection. In conclusion, the present model may provide a valid approach to study the pathophysiological conditions of the cardiovascular system and the mechanism of ANS regulation
Niu, Gang; Zhao, Yajun; Defoort, Michael; Pecht, Michael
2015-01-01
To improve reliability, safety and efficiency, advanced methods of fault detection and diagnosis become increasingly important for many technical fields, especially for safety related complex systems like aircraft, trains, automobiles, power plants and chemical plants. This paper presents a robust fault detection and diagnostic scheme for a multi-energy domain system that integrates a model-based strategy for system fault modeling and a data-driven approach for online anomaly monitoring. The developed scheme uses LFT (linear fractional transformations)-based bond graph for physical parameter uncertainty modeling and fault simulation, and employs AAKR (auto-associative kernel regression)-based empirical estimation followed by SPRT (sequential probability ratio test)-based threshold monitoring to improve the accuracy of fault detection. Moreover, pre- and post-denoising processes are applied to eliminate the cumulative influence of parameter uncertainty and measurement uncertainty. The scheme is demonstrated on the main unit of a locomotive electro-pneumatic brake in a simulated experiment. The results show robust fault detection and diagnostic performance.
Network Forensics Method Based on Evidence Graph and Vulnerability Reasoning
Directory of Open Access Journals (Sweden)
Jingsha He
2016-11-01
Full Text Available As the Internet becomes larger in scale, more complex in structure and more diversified in traffic, the number of crimes that utilize computer technologies is also increasing at a phenomenal rate. To react to the increasing number of computer crimes, the field of computer and network forensics has emerged. The general purpose of network forensics is to find malicious users or activities by gathering and dissecting firm evidences about computer crimes, e.g., hacking. However, due to the large volume of Internet traffic, not all the traffic captured and analyzed is valuable for investigation or confirmation. After analyzing some existing network forensics methods to identify common shortcomings, we propose in this paper a new network forensics method that uses a combination of network vulnerability and network evidence graph. In our proposed method, we use vulnerability evidence and reasoning algorithm to reconstruct attack scenarios and then backtrack the network packets to find the original evidences. Our proposed method can reconstruct attack scenarios effectively and then identify multi-staged attacks through evidential reasoning. Results of experiments show that the evidence graph constructed using our method is more complete and credible while possessing the reasoning capability.
Zhang, L.-C.; Patone, M.
2017-01-01
We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.
Data graphing methods, articles of manufacture, and computing devices
Energy Technology Data Exchange (ETDEWEB)
Wong, Pak Chung; Mackey, Patrick S.; Cook, Kristin A.; Foote, Harlan P.; Whiting, Mark A.
2016-12-13
Data graphing methods, articles of manufacture, and computing devices are described. In one aspect, a method includes accessing a data set, displaying a graphical representation including data of the data set which is arranged according to a first of different hierarchical levels, wherein the first hierarchical level represents the data at a first of a plurality of different resolutions which respectively correspond to respective ones of the hierarchical levels, selecting a portion of the graphical representation wherein the data of the portion is arranged according to the first hierarchical level at the first resolution, modifying the graphical representation by arranging the data of the portion according to a second of the hierarchal levels at a second of the resolutions, and after the modifying, displaying the graphical representation wherein the data of the portion is arranged according to the second hierarchal level at the second resolution.
A contribution to queens graphs: A substitution method
DEFF Research Database (Denmark)
Ambrus, G.; Barat, Janos
2006-01-01
A graph G is a queens graph if the vertices of G can be mapped to queens on the chessboard such that two vertices are adjacent if and only if the corresponding queens attack each other, i.e. they are in horizontal, vertical or diagonal position. We prove a conjecture of Beineke, Broere and Hennin...
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
I.Z. Emiris; E.P. Tsigaridas; A. Varvitsiotis (Antonios); E.R. Gasner
2009-01-01
textabstract The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture embeddability by polynomial systems
International Nuclear Information System (INIS)
Creyx, M.; Delacourt, E.; Morin, C.; Desmet, B.
2016-01-01
A dynamic model using the bond graph formalism of the expansion cylinder of an open Joule cycle Ericsson engine intended for a biomass-fuelled micro-CHP system is presented. Dynamic phenomena, such as the thermodynamic evolution of air, the instantaneous air mass flow rates linked to pressure drops crossing the valves, the heat transferred through the expansion cylinder wall and the mechanical friction losses, are included in the model. The influence on the Ericsson engine performances of the main operating conditions (intake air pressure and temperature, timing of intake and exhaust valve closing, rotational speed, mechanical friction losses and heat transfer at expansion cylinder wall) is studied. The operating conditions maximizing the performances of the Ericsson engine used in the a biomass-fuelled micro-CHP unit are an intake air pressure between 6 and 8 bar, a maximized intake air temperature, an adjustment of the intake and exhaust valve closing corresponding to an expansion cycle close to the theoretical Joule cycle, a rotational speed close to 800 rpm. The heat transfer at the expansion cylinder wall reduces the engine performances. - Highlights: • A bond graph dynamic model of the Ericsson engine expansion cylinder is presented. • Dynamic aspects are modelled: pressure drops, friction losses, wall heat transfer. • Influent factors and phenomena on the engine performances are investigated. • Expansion cycles close to the theoretical Joule cycle maximize the performances. • The heat transfer at the expansion chamber wall reduces the performances.
Xu, Zhiqiang
2017-02-16
Attributed graph clustering, also known as community detection on attributed graphs, attracts much interests recently due to the ubiquity of attributed graphs in real life. Many existing algorithms have been proposed for this problem, which are either distance based or model based. However, model selection in attributed graph clustering has not been well addressed, that is, most existing algorithms assume the cluster number to be known a priori. In this paper, we propose two efficient approaches for attributed graph clustering with automatic model selection. The first approach is a popular Bayesian nonparametric method, while the second approach is an asymptotic method based on a recently proposed model selection criterion, factorized information criterion. Experimental results on both synthetic and real datasets demonstrate that our approaches for attributed graph clustering with automatic model selection significantly outperform the state-of-the-art algorithm.
Xu, Zhiqiang; Cheng, James; Xiao, Xiaokui; Fujimaki, Ryohei; Muraoka, Yusuke
2017-01-01
Attributed graph clustering, also known as community detection on attributed graphs, attracts much interests recently due to the ubiquity of attributed graphs in real life. Many existing algorithms have been proposed for this problem, which are either distance based or model based. However, model selection in attributed graph clustering has not been well addressed, that is, most existing algorithms assume the cluster number to be known a priori. In this paper, we propose two efficient approaches for attributed graph clustering with automatic model selection. The first approach is a popular Bayesian nonparametric method, while the second approach is an asymptotic method based on a recently proposed model selection criterion, factorized information criterion. Experimental results on both synthetic and real datasets demonstrate that our approaches for attributed graph clustering with automatic model selection significantly outperform the state-of-the-art algorithm.
Hao, Ruizhe; Huang, Jian
2017-08-01
Knowledge graph construction in military intelligence domain is sprouting but technically immature. This paper presents a method to construct the heterogeneous knowledge graph in the field of shipborne and airborne radar and equipment. Based on the expert knowledge and the up-to-date Internet open source information, we construct the knowledge graph of radar characteristic information and the equipment respectively, and establish relationships between two graphs, providing the pipeline and method for the intelligence organization and management in the context of the crowding battlefields big data.
Fast crawling methods of exploring content distributed over large graphs
Wang, Pinghui; Zhao, Junzhou; Lui, John C. S.; Towsley, Don; Guan, Xiaohong
2018-01-01
Despite recent effort to estimate topology characteristics of large graphs (e.g., online social networks and peer-to-peer networks), little attention has been given to develop a formal crawling methodology to characterize the vast amount of content
Character expansion methods for matrix models of dually weighted graphs
International Nuclear Information System (INIS)
Kazakov, V.A.; Staudacher, M.; Wynter, T.
1996-01-01
We consider generalized one-matrix models in which external fields allow control over the coordination numbers on both the original and dual lattices. We rederive in a simple fashion a character expansion formula for these models originally due to Itzykson and Di Francesco, and then demonstrate how to take the large N limit of this expansion. The relationship to the usual matrix model resolvent is elucidated. Our methods give as a by-product an extremely simple derivation of the Migdal integral equation describing the large N limit of the Itzykson-Zuber formula. We illustrate and check our methods by analysing a number of models solvable by traditional means. We then proceed to solve a new model: a sum over planar graphs possessing even coordination numbers on both the original and the dual lattice. We conclude by formulating equations for the case of arbitrary sets of even, self-dual coupling constants. This opens the way for studying the deep problem of phase transitions from random to flat lattices. (orig.). With 4 figs
Khaouch, Zakaria; Zekraoui, Mustapha; Bengourram, Jamaa; Kouider, Nourreeddine; Mabrouki, Mustapha
2016-11-01
In this paper, we would like to focus on modeling main parts of the wind turbines (blades, gearbox, tower, generator and pitching system) from a mechatronics viewpoint using the Bond-Graph Approach (BGA). Then, these parts are combined together in order to simulate the complete system. Moreover, the real dynamic behavior of the wind turbine is taken into account and with the new model; final load simulation is more realistic offering benefits and reliable system performance. This model can be used to develop control algorithms to reduce fatigue loads and enhance power production. Different simulations are carried-out in order to validate the proposed wind turbine model, using real data provided in the open literature (blade profile and gearbox parameters for a 750 kW wind turbine). Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.
Graph-Based Methods for Discovery Browsing with Semantic Predications
DEFF Research Database (Denmark)
Wilkowski, Bartlomiej; Fiszman, Marcelo; Miller, Christopher M
2011-01-01
. Poorly understood relationships may be explored through novel points of view, and potentially interesting relationships need not be known ahead of time. In a process of "cooperative reciprocity" the user iteratively focuses system output, thus controlling the large number of relationships often generated...... in literature-based discovery systems. The underlying technology exploits SemRep semantic predications represented as a graph of interconnected nodes (predication arguments) and edges (predicates). The system suggests paths in this graph, which represent chains of relationships. The methodology is illustrated...
Novel Methods for Drug-Target Interaction Prediction using Graph Mining
Ba Alawi, Wail
2016-01-01
-target interactions (DTIs) before any experiments are done. However, many of these approaches suffer from unacceptable levels of false positives. We developed two novel methods based on graph mining networks of drugs and targets. The first method (DASPfind) finds all
Fast crawling methods of exploring content distributed over large graphs
Wang, Pinghui
2018-03-15
Despite recent effort to estimate topology characteristics of large graphs (e.g., online social networks and peer-to-peer networks), little attention has been given to develop a formal crawling methodology to characterize the vast amount of content distributed over these networks. Due to the large-scale nature of these networks and a limited query rate imposed by network service providers, exhaustively crawling and enumerating content maintained by each vertex is computationally prohibitive. In this paper, we show how one can obtain content properties by crawling only a small fraction of vertices and collecting their content. We first show that when sampling is naively applied, this can produce a huge bias in content statistics (i.e., average number of content replicas). To remove this bias, one may use maximum likelihood estimation to estimate content characteristics. However, our experimental results show that this straightforward method requires to sample most vertices to obtain accurate estimates. To address this challenge, we propose two efficient estimators: special copy estimator (SCE) and weighted copy estimator (WCE) to estimate content characteristics using available information in sampled content. SCE uses the special content copy indicator to compute the estimate, while WCE derives the estimate based on meta-information in sampled vertices. We conduct experiments on a variety of real-word and synthetic datasets, and the results show that WCE and SCE are cost effective and also “asymptotically unbiased”. Our methodology provides a new tool for researchers to efficiently query content distributed in large-scale networks.
Weighted graph based ordering techniques for preconditioned conjugate gradient methods
Clift, Simon S.; Tang, Wei-Pai
1994-01-01
We describe the basis of a matrix ordering heuristic for improving the incomplete factorization used in preconditioned conjugate gradient techniques applied to anisotropic PDE's. Several new matrix ordering techniques, derived from well-known algorithms in combinatorial graph theory, which attempt to implement this heuristic, are described. These ordering techniques are tested against a number of matrices arising from linear anisotropic PDE's, and compared with other matrix ordering techniques. A variation of RCM is shown to generally improve the quality of incomplete factorization preconditioners.
Directory of Open Access Journals (Sweden)
Michel Feidt
2012-03-01
Full Text Available In recent decades, the approach known as Finite-Time Thermodynamics has provided a fruitful theoretical framework for the optimization of heat engines operating between a heat source (at temperature and a heat sink (at temperature . The aim of this paper is to propose a more complete approach based on the association of Finite-Time Thermodynamics and the Bond-Graph approach for modeling endoreversible heat engines. This approach makes it possible for example to find in a simple way the characteristics of the optimal operating point at which the maximum mechanical power of the endoreversible heat engine is obtained with entropy flow rate as control variable. Furthermore it provides the analytical expressions of the optimal operating point of an irreversible heat engine where the energy conversion is accompanied by irreversibilities related to internal heat transfer and heat dissipation phenomena. This original approach, applied to an analysis of the performance of a thermoelectric generator, will be the object of a future publication.
MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs
Wang, Pinghui
2017-09-26
Counting 3-, 4-, and 5-node graphlets in graphs is important for graph mining applications such as discovering abnormal/evolution patterns in social and biology networks. In addition, it is recently widely used for computing similarities between graphs and graph classification applications such as protein function prediction and malware detection. However, it is challenging to compute these metrics for a large graph or a large set of graphs due to the combinatorial nature of the problem. Despite recent efforts in counting triangles (a 3-node graphlet) and 4-node graphlets, little attention has been paid to characterizing 5-node graphlets. In this paper, we develop a computationally efficient sampling method to estimate 5-node graphlet counts. We not only provide fast sampling methods and unbiased estimators of graphlet counts, but also derive simple yet exact formulas for the variances of the estimators which is of great value in practice-the variances can be used to bound the estimates\\' errors and determine the smallest necessary sampling budget for a desired accuracy. We conduct experiments on a variety of real-world datasets, and the results show that our method is several orders of magnitude faster than the state-of-the-art methods with the same accuracy.
2015-01-01
Assistant for Calculus (winter 2011) xii CHAPTER 1 Introduction We present several methods, outlined in Chapters 3-5, for image processing and data...local calculus formulation [103] to generalize the continuous formulation to a (non-local) discrete setting, while other non-local versions for...graph-based model based on the Ginzburg-Landau functional in their work [9]. To define the functional on a graph, the spatial gradient is replaced by a
Evaluation of Callable Bonds: Finite Difference Methods, Stability and Accuracy.
Buttler, Hans-Jurg
1995-01-01
The purpose of this paper is to evaluate numerically the semi-American callable bond by means of finite difference methods. This study implies three results. First, the numerical error is greater for the callable bond price than for the straight bond price, and too large for real applications Secondly, the numerical accuracy of the callable bond price computed for the relevant range of interest rates depends entirely on the finite difference scheme which is chosen for the boundary points. Thi...
Detecting Network Vulnerabilities Through Graph TheoreticalMethods
Energy Technology Data Exchange (ETDEWEB)
Cesarz, Patrick; Pomann, Gina-Maria; Torre, Luis de la; Villarosa, Greta; Flournoy, Tamara; Pinar, Ali; Meza Juan
2007-09-30
Identifying vulnerabilities in power networks is an important problem, as even a small number of vulnerable connections can cause billions of dollars in damage to a network. In this paper, we investigate a graph theoretical formulation for identifying vulnerabilities of a network. We first try to find the most critical components in a network by finding an optimal solution for each possible cutsize constraint for the relaxed version of the inhibiting bisection problem, which aims to find loosely coupled subgraphs with significant demand/supply mismatch. Then we investigate finding critical components by finding a flow assignment that minimizes the maximum among flow assignments on all edges. We also report experiments on IEEE 30, IEEE 118, and WSCC 179 benchmark power networks.
Mechatronics by bond graphs an object-oriented approach to modelling and simulation
Damić, Vjekoslav
2015-01-01
This book presents a computer-aided approach to the design of mechatronic systems. Its subject is an integrated modeling and simulation in a visual computer environment. Since the first edition, the simulation software changed enormously, became more user-friendly and easier to use. Therefore, a second edition became necessary taking these improvements into account. The modeling is based on system top-down and bottom-up approach. The mathematical models are generated in a form of differential-algebraic equations and solved using numerical and symbolic algebra methods. The integrated approach developed is applied to mechanical, electrical and control systems, multibody dynamics, and continuous systems. .
Room temperature Cu-Cu direct bonding using surface activated bonding method
International Nuclear Information System (INIS)
Kim, T.H.; Howlader, M.M.R.; Itoh, T.; Suga, T.
2003-01-01
Thin copper (Cu) films of 80 nm thickness deposited on a diffusion barrier layered 8 in. silicon wafers were directly bonded at room temperature using the surface activated bonding method. A low energy Ar ion beam of 40-100 eV was used to activate the Cu surface prior to bonding. Contacting two surface-activated wafers enables successful Cu-Cu direct bonding. The bonding process was carried out under an ultrahigh vacuum condition. No thermal annealing was required to increase the bonding strength since the bonded interface was strong enough at room temperature. The chemical constitution of the Cu surface was examined by Auger electron spectroscope. It was observed that carbon-based contaminations and native oxides on copper surface were effectively removed by Ar ion beam irradiation for 60 s without any wet cleaning processes. An atomic force microscope study shows that the Ar ion beam process causes no surface roughness degradation. Tensile test results show that high bonding strength equivalent to bulk material is achieved at room temperature. The cross-sectional transmission electron microscope observations reveal the presence of void-free bonding interface without intermediate layer at the bonded Cu surfaces
Сlassification of methods of production of computer forensic by usage approach of graph theory
Directory of Open Access Journals (Sweden)
Anna Ravilyevna Smolina
2016-06-01
Full Text Available Сlassification of methods of production of computer forensic by usage approach of graph theory is proposed. If use this classification, it is possible to accelerate and simplify the search of methods of production of computer forensic and this process to automatize.
Сlassification of methods of production of computer forensic by usage approach of graph theory
Anna Ravilyevna Smolina; Alexander Alexandrovich Shelupanov
2016-01-01
Сlassification of methods of production of computer forensic by usage approach of graph theory is proposed. If use this classification, it is possible to accelerate and simplify the search of methods of production of computer forensic and this process to automatize.
METHOD AND ALLOY FOR BONDING TO ZIRCONIUM
McCuaig, F.D.; Misch, R.D.
1960-04-19
A brazing alloy can be used for bonding zirconium and its alloys to other metals, ceramics, and cermets, and consists of 6 to 9 wt.% Ni, 6 to 9 wn~.% Cr, Mo, or W, 0 to 7.5 wt.% Fe, and the balance Zr.
Mechanism of bonding and debonding using surface activated bonding method with Si intermediate layer
Takeuchi, Kai; Fujino, Masahisa; Matsumoto, Yoshiie; Suga, Tadatomo
2018-04-01
Techniques of handling thin and fragile substrates in a high-temperature process are highly required for the fabrication of semiconductor devices including thin film transistors (TFTs). In our previous study, we proposed applying the surface activated bonding (SAB) method using Si intermediate layers to the bonding and debonding of glass substrates. The SAB method has successfully bonded glass substrates at room temperature, and the substrates have been debonded after heating at 450 °C, in which TFTs are fabricated on thin glass substrates for LC display devices. In this study, we conducted the bonding and debonding of Si and glass in order to understand the mechanism in the proposed process. Si substrates are also successfully bonded to glass substrates at room temperature and debonded after heating at 450 °C using the proposed bonding process. By the composition analysis of bonding interfaces, it is clarified that the absorbed water on the glass forms interfacial voids and cause the decrease in bond strength.
SemaTyP: a knowledge graph based literature mining method for drug discovery.
Sang, Shengtian; Yang, Zhihao; Wang, Lei; Liu, Xiaoxia; Lin, Hongfei; Wang, Jian
2018-05-30
Drug discovery is the process through which potential new medicines are identified. High-throughput screening and computer-aided drug discovery/design are the two main drug discovery methods for now, which have successfully discovered a series of drugs. However, development of new drugs is still an extremely time-consuming and expensive process. Biomedical literature contains important clues for the identification of potential treatments. It could support experts in biomedicine on their way towards new discoveries. Here, we propose a biomedical knowledge graph-based drug discovery method called SemaTyP, which discovers candidate drugs for diseases by mining published biomedical literature. We first construct a biomedical knowledge graph with the relations extracted from biomedical abstracts, then a logistic regression model is trained by learning the semantic types of paths of known drug therapies' existing in the biomedical knowledge graph, finally the learned model is used to discover drug therapies for new diseases. The experimental results show that our method could not only effectively discover new drug therapies for new diseases, but also could provide the potential mechanism of action of the candidate drugs. In this paper we propose a novel knowledge graph based literature mining method for drug discovery. It could be a supplementary method for current drug discovery methods.
An effective trust-based recommendation method using a novel graph clustering algorithm
Moradi, Parham; Ahmadian, Sajad; Akhlaghian, Fardin
2015-10-01
Recommender systems are programs that aim to provide personalized recommendations to users for specific items (e.g. music, books) in online sharing communities or on e-commerce sites. Collaborative filtering methods are important and widely accepted types of recommender systems that generate recommendations based on the ratings of like-minded users. On the other hand, these systems confront several inherent issues such as data sparsity and cold start problems, caused by fewer ratings against the unknowns that need to be predicted. Incorporating trust information into the collaborative filtering systems is an attractive approach to resolve these problems. In this paper, we present a model-based collaborative filtering method by applying a novel graph clustering algorithm and also considering trust statements. In the proposed method first of all, the problem space is represented as a graph and then a sparsest subgraph finding algorithm is applied on the graph to find the initial cluster centers. Then, the proposed graph clustering algorithm is performed to obtain the appropriate users/items clusters. Finally, the identified clusters are used as a set of neighbors to recommend unseen items to the current active user. Experimental results based on three real-world datasets demonstrate that the proposed method outperforms several state-of-the-art recommender system methods.
Analysis of the 2005-2016 Earthquake Sequence in Northern Iran Using the Visibility Graph Method
Khoshnevis, Naeem; Taborda, Ricardo; Azizzadeh-Roodpish, Shima; Telesca, Luciano
2017-11-01
We present an analysis of the seismicity of northern Iran in the period between 2005 and 2016 using a recently introduced method based on concepts of graph theory. The method relies on the inter-event visibility defined in terms of a connectivity degree parameter, k, which is correlated with the earthquake magnitude, M. Previous studies show that the slope m of the line fitting the k- M plot by the least squares method also observes a relationship with the b value from the Gutenberg-Richter law, thus rendering the graph analysis useful to examine the seismicity of a region. These correlations seem to hold for the analysis of relatively small sequences of earthquakes, offering the possibility of studying seismicity parameters in time. We apply this approach to the case of the seismicity of northern Iran, using an earthquake catalog for the tectonic seismic regions of Azerbaijan, Alborz, and Kopeh Dagh. We use results drawn for this region with the visibility graph approach in combination with results from other similar studies to further improve the universal relationship between m and b, and show that the visibility graph approach can be considered as a valid alternative for analyzing regional seismicity properties and earthquake sequences.
Face Recognition by Bunch Graph Method Using a Group Based Adaptive Tolerant Neural Network
Aradhana D.; Girish H.; Karibasappa K.; Reddy A. Chennakeshava
2011-01-01
This paper presents a new method for feature extraction from the facial image by using bunch graph method. These extracted geometric features of the face are used subsequently for face recognition by utilizing the group based adaptive neural network. This method is suitable, when the facial images are rotation and translation invariant. Further the technique also free from size invariance of facial image and is capable of identifying the facial images correctly when corrupted w...
Volkov, Sergey
2017-11-01
This paper presents a new method of numerical computation of the mass-independent QED contributions to the electron anomalous magnetic moment which arise from Feynman graphs without closed electron loops. The method is based on a forestlike subtraction formula that removes all ultraviolet and infrared divergences in each Feynman graph before integration in Feynman-parametric space. The integration is performed by an importance sampling Monte-Carlo algorithm with the probability density function that is constructed for each Feynman graph individually. The method is fully automated at any order of the perturbation series. The results of applying the method to 2-loop, 3-loop, 4-loop Feynman graphs, and to some individual 5-loop graphs are presented, as well as the comparison of this method with other ones with respect to Monte Carlo convergence speed.
Graph visualization (Invited talk)
Wijk, van J.J.; Kreveld, van M.J.; Speckmann, B.
2012-01-01
Black and white node link diagrams are the classic method to depict graphs, but these often fall short to give insight in large graphs or when attributes of nodes and edges play an important role. Graph visualization aims obtaining insight in such graphs using interactive graphical representations.
International Nuclear Information System (INIS)
Yin, Zhifu; Zou, Helin; Sun, Lei; Xu, Shenbo; Qi, Liping
2015-01-01
Plastic planar nanofluidic chips are becoming increasingly important for biological and chemical applications. However, the majority of the present bonding methods for planar nanofluidic chips suffer from high dimension loss and low bonding strength. In this work, a novel thermal bonding technique based on O 2 plasma and ethanol treatment was proposed. With the assistance of O 2 plasma and ethanol, the PET (polyethylene terephthalate) planar nanofluidic chip can be bonded at a low bonding temperature of 50 °C. To increase the bonding rate and bonding strength, the O 2 plasma parameters and thermal bonding parameters were optimized during the bonding process. The tensile test indicates that the bonding strength of the PET planar nanofluidic chip can reach 0.954 MPa, while the auto-fluorescence test demonstrates that there is no leakage or blockage in any of the bonded micro- or nanochannels. (paper)
Cement bond evaluation method in horizontal wells using segmented bond tool
Song, Ruolong; He, Li
2018-06-01
Most of the existing cement evaluation technologies suffer from tool eccentralization due to gravity in highly deviated wells and horizontal wells. This paper proposes a correction method to lessen the effects of tool eccentralization on evaluation results of cement bond using segmented bond tool, which has an omnidirectional sonic transmitter and eight segmented receivers evenly arranged around the tool 2 ft from the transmitter. Using 3-D finite difference parallel numerical simulation method, we investigate the logging responses of centred and eccentred segmented bond tool in a variety of bond conditions. From the numerical results, we find that the tool eccentricity and channel azimuth can be estimated from measured sector amplitude. The average of the sector amplitude when the tool is eccentred can be corrected to the one when the tool is centred. Then the corrected amplitude will be used to calculate the channel size. The proposed method is applied to both synthetic and field data. For synthetic data, it turns out that this method can estimate the tool eccentricity with small error and the bond map is improved after correction. For field data, the tool eccentricity has a good agreement with the measured well deviation angle. Though this method still suffers from the low accuracy of calculating channel azimuth, the credibility of corrected bond map is improved especially in horizontal wells. It gives us a choice to evaluate the bond condition for horizontal wells using existing logging tool. The numerical results in this paper can provide aids for understanding measurements of segmented tool in both vertical and horizontal wells.
A method for independent component graph analysis of resting-state fMRI
DEFF Research Database (Denmark)
de Paula, Demetrius Ribeiro; Ziegler, Erik; Abeyasinghe, Pubuditha M.
2017-01-01
Introduction Independent component analysis (ICA) has been extensively used for reducing task-free BOLD fMRI recordings into spatial maps and their associated time-courses. The spatially identified independent components can be considered as intrinsic connectivity networks (ICNs) of non-contiguou......Introduction Independent component analysis (ICA) has been extensively used for reducing task-free BOLD fMRI recordings into spatial maps and their associated time-courses. The spatially identified independent components can be considered as intrinsic connectivity networks (ICNs) of non......-contiguous regions. To date, the spatial patterns of the networks have been analyzed with techniques developed for volumetric data. Objective Here, we detail a graph building technique that allows these ICNs to be analyzed with graph theory. Methods First, ICA was performed at the single-subject level in 15 healthy...... parcellated regions. Third, between-node functional connectivity was established by building edge weights for each networks. Group-level graph analysis was finally performed for each network and compared to the classical network. Results Network graph comparison between the classically constructed network...
GRAPH-BASED POST INCIDENT INTERNAL AUDIT METHOD OF COMPUTER EQUIPMENT
Directory of Open Access Journals (Sweden)
I. S. Pantiukhin
2016-05-01
Full Text Available Graph-based post incident internal audit method of computer equipment is proposed. The essence of the proposed solution consists in the establishing of relationships among hard disk damps (image, RAM and network. This method is intended for description of information security incident properties during the internal post incident audit of computer equipment. Hard disk damps receiving and formation process takes place at the first step. It is followed by separation of these damps into the set of components. The set of components includes a large set of attributes that forms the basis for the formation of the graph. Separated data is recorded into the non-relational database management system (NoSQL that is adapted for graph storage, fast access and processing. Damps linking application method is applied at the final step. The presented method gives the possibility to human expert in information security or computer forensics for more precise, informative internal audit of computer equipment. The proposed method allows reducing the time spent on internal audit of computer equipment, increasing accuracy and informativeness of such audit. The method has a development potential and can be applied along with the other components in the tasks of users’ identification and computer forensics.
Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms
International Nuclear Information System (INIS)
Ablinger, Jakob; Schneider, Carsten; Bluemlein, Johannes; Raab, Clemens; Wissbrock, Fabian
2014-02-01
We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version to the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∝30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N element of C. Integrals with a power-like divergence in N-space∝a N , a element of R, a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.
Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms
Energy Technology Data Exchange (ETDEWEB)
Ablinger, Jakob; Schneider, Carsten [Johannes Kepler Univ., Linz (Austria). Reserach Inst. for Symbolic Computation (RISC); Bluemlein, Johannes; Raab, Clemens [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Wissbrock, Fabian [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Johannes Kepler Univ., Linz (Austria). Reserach Inst. for Symbolic Computation (RISC)
2014-02-15
We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version to the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∝30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N element of C. Integrals with a power-like divergence in N-space∝a{sup N}, a element of R, a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.
Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms
Energy Technology Data Exchange (ETDEWEB)
Ablinger, Jakob [Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenbergerstraße 69, A-4040 Linz (Austria); Blümlein, Johannes; Raab, Clemens [Deutsches Elektronen-Synchrotron, DESY, Platanenallee 6, D-15738 Zeuthen (Germany); Schneider, Carsten [Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenbergerstraße 69, A-4040 Linz (Austria); Wißbrock, Fabian [Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenbergerstraße 69, A-4040 Linz (Austria); Deutsches Elektronen-Synchrotron, DESY, Platanenallee 6, D-15738 Zeuthen (Germany)
2014-08-15
We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version of the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators, new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∼30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N∈C. Integrals with a power-like divergence in N-space ∝a{sup N},a∈R,a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.
Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms
International Nuclear Information System (INIS)
Ablinger, Jakob; Blümlein, Johannes; Raab, Clemens; Schneider, Carsten; Wißbrock, Fabian
2014-01-01
We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version of the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators, new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∼30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N∈C. Integrals with a power-like divergence in N-space ∝a N ,a∈R,a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions
Quantitative graph theory mathematical foundations and applications
Dehmer, Matthias
2014-01-01
The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as:Comparative approaches (graph similarity or distance)Graph measures to characterize graphs quantitat
Zagouras, Athanassios; Argiriou, Athanassios A.; Flocas, Helena A.; Economou, George; Fotopoulos, Spiros
2012-11-01
Classification of weather maps at various isobaric levels as a methodological tool is used in several problems related to meteorology, climatology, atmospheric pollution and to other fields for many years. Initially the classification was performed manually. The criteria used by the person performing the classification are features of isobars or isopleths of geopotential height, depending on the type of maps to be classified. Although manual classifications integrate the perceptual experience and other unquantifiable qualities of the meteorology specialists involved, these are typically subjective and time consuming. Furthermore, during the last years different approaches of automated methods for atmospheric circulation classification have been proposed, which present automated and so-called objective classifications. In this paper a new method of atmospheric circulation classification of isobaric maps is presented. The method is based on graph theory. It starts with an intelligent prototype selection using an over-partitioning mode of fuzzy c-means (FCM) algorithm, proceeds to a graph formulation for the entire dataset and produces the clusters based on the contemporary dominant sets clustering method. Graph theory is a novel mathematical approach, allowing a more efficient representation of spatially correlated data, compared to the classical Euclidian space representation approaches, used in conventional classification methods. The method has been applied to the classification of 850 hPa atmospheric circulation over the Eastern Mediterranean. The evaluation of the automated methods is performed by statistical indexes; results indicate that the classification is adequately comparable with other state-of-the-art automated map classification methods, for a variable number of clusters.
A Study of Layout, Rendering, and Interaction Methods for Immersive Graph Visualization.
Kwon, Oh-Hyun; Muelder, Chris; Lee, Kyungwon; Ma, Kwan-Liu
2016-07-01
Information visualization has traditionally limited itself to 2D representations, primarily due to the prevalence of 2D displays and report formats. However, there has been a recent surge in popularity of consumer grade 3D displays and immersive head-mounted displays (HMDs). The ubiquity of such displays enables the possibility of immersive, stereoscopic visualization environments. While techniques that utilize such immersive environments have been explored extensively for spatial and scientific visualizations, contrastingly very little has been explored for information visualization. In this paper, we present our considerations of layout, rendering, and interaction methods for visualizing graphs in an immersive environment. We conducted a user study to evaluate our techniques compared to traditional 2D graph visualization. The results show that participants answered significantly faster with a fewer number of interactions using our techniques, especially for more difficult tasks. While the overall correctness rates are not significantly different, we found that participants gave significantly more correct answers using our techniques for larger graphs.
Graph cut-based method for segmenting the left ventricle from MRI or echocardiographic images.
Bernier, Michael; Jodoin, Pierre-Marc; Humbert, Olivier; Lalande, Alain
2017-06-01
In this paper, we present a fast and interactive graph cut method for 3D segmentation of the endocardial wall of the left ventricle (LV) adapted to work on two of the most widely used modalities: magnetic resonance imaging (MRI) and echocardiography. Our method accounts for the fundamentally different nature of both modalities: 3D echocardiographic images have a low contrast, a poor signal-to-noise ratio and frequent signal drop, while MR images are more detailed but also cluttered and contain highly anisotropic voxels. The main characteristic of our method is to work in a 3D Bezier coordinate system instead of the original Euclidean space. This comes with several advantages, including an implicit shape prior and a result guarantied not to have any holes in it. The proposed method is made of 4 steps. First, a 3D sampling of the LV cavity is made based on a Bezier coordinate system. This allows to warp the input 3D image to a Bezier space in which a plane corresponds to an anatomically plausible 3D Euclidean bullet shape. Second, a 3D graph is built and an energy term (which is based on the image gradient and a 3D probability map) is assigned to each edge of the graph, some of which being given an infinite energy to ensure the resulting 3D structure passes through key anatomical points. Third, a max-flow min-cut procedure is executed on the energy graph to delineate the endocardial surface. And fourth, the resulting surface is projected back to the Euclidean space where a post-processing convex hull algorithm is applied on every short axis slice to remove local concavities. Results obtained on two datasets reveal that our method takes between 2 and 5s to segment a 3D volume, it has better results overall than most state-of-the-art methods on the CETUS echocardiographic dataset and is statistically as good as a human operator on MR images. Copyright © 2017 Elsevier Ltd. All rights reserved.
Du, Lei; Huang, Heng; Yan, Jingwen; Kim, Sungeun; Risacher, Shannon L; Inlow, Mark; Moore, Jason H; Saykin, Andrew J; Shen, Li
2016-05-15
Structured sparse canonical correlation analysis (SCCA) models have been used to identify imaging genetic associations. These models either use group lasso or graph-guided fused lasso to conduct feature selection and feature grouping simultaneously. The group lasso based methods require prior knowledge to define the groups, which limits the capability when prior knowledge is incomplete or unavailable. The graph-guided methods overcome this drawback by using the sample correlation to define the constraint. However, they are sensitive to the sign of the sample correlation, which could introduce undesirable bias if the sign is wrongly estimated. We introduce a novel SCCA model with a new penalty, and develop an efficient optimization algorithm. Our method has a strong upper bound for the grouping effect for both positively and negatively correlated features. We show that our method performs better than or equally to three competing SCCA models on both synthetic and real data. In particular, our method identifies stronger canonical correlations and better canonical loading patterns, showing its promise for revealing interesting imaging genetic associations. The Matlab code and sample data are freely available at http://www.iu.edu/∼shenlab/tools/angscca/ shenli@iu.edu Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.
Method for producing bonded nonwoven fabrics using ionizing radiation
International Nuclear Information System (INIS)
Drelich, A.H.; Oney, D.G.
1979-01-01
A method is described for producing a resin-bonded nonwoven fabric. The preparation involves forming a fibrous web annealing it and compressing it to provide fiber to fiber contact. A polymerizable binder is applied to the fibrous web which is then treated by ionizing radiation to produce the material. 9 figures, 3 drawing
MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs
Wang, Pinghui; Zhao, Junzhou; Zhang, Xiangliang; Li, Zhenguo; Cheng, Jiefeng; Lui, John C.S.; Towsley, Don; Tao, Jing; Guan, Xiaohong
2017-01-01
Counting 3-, 4-, and 5-node graphlets in graphs is important for graph mining applications such as discovering abnormal/evolution patterns in social and biology networks. In addition, it is recently widely used for computing similarities between
International Nuclear Information System (INIS)
Golovanov, M.N.; Zyuzin, N.N.; Levin, G.L.; Chesnokov, A.N.
1987-01-01
An approach for estimation of reliability factors of complex reserved systems at early stages of development using the method of imitating simulation is considered. Different types of models, their merits and lacks are given. Features of in-core monitoring systems and advosability of graph model and graph theory element application for estimating reliability of such systems are shown. The results of investigation of the reliability factors of the reactor monitoring, control and core local protection subsystem are shown
Development of a new loss allocation method for a hybrid electricity market using graph theory
International Nuclear Information System (INIS)
Lim, Valerie S.C.; McDonald, John D.F.; Saha, Tapan K.
2009-01-01
This paper introduces a new method for allocating losses in a power system using a loop-based representation of system behaviour. Using the new method, network behaviour is formulated as a series of presumed power transfers directly between market participants. In contrast to many existing loss allocation methods, this makes it easier to justify the resulting loss distribution. In addition to circumventing the problems of non-unique loss allocations, a formalised process of loop identification, using graph theory concepts, is introduced. The proposed method is applied to both the IEEE 14-bus system and a modified CIGRE Nordic 32-bus system. The results provide a demonstration of the capability of the proposed method to allocate losses in the hybrid market, and demonstrate the approach's capacity to link the technical performance of the network to market instruments. (author)
Energy Technology Data Exchange (ETDEWEB)
Saisset, R.
2004-04-01
This thesis is a contribution to the study of electric power conversion systems including electrochemical devices. A systemic approach draws advantage of the unified Bond Graph formalism in order to model every component as well as the whole system. A state of the art of electrochemical devices for decentralized electric energy generation and storage put emphasis on common phenomena with the aim of developing 'system oriented' generic models. Solid Oxide and Proton Exchange Fuel Cells (SOFC, PEMFC), as well as Lithium Ion batteries, have been modelled through an efficient work with electrochemistry specialists. These models involve an explicit representation, at a macroscopic level, of conversion and irreversible phenomena linked to the chemical reaction and coupled together both in the hydraulic, chemical, thermodynamic, electric and thermal fields. These models are used to study the modularity of the components, particularly the electric and thermal imbalances in the series and parallel fuel cells associations. The systemic approach is also applied to the study of architectures and energy management of electric power generating units involving PEMFC and battery or super-capacitors storage. Different working conditions for the fuel cells are defined and studied, consisting in either voltage or current or power imposed by means of the storage and static converters environment. Identification of parameters and working tests are performed on specially developed test benches so as to validate theoretical results. At last, the method is applied to study a 'sun-racer', an original complex system with embedded photovoltaic generator, electrochemical storage and brush-less wheel motor, wholly modelled in order to compare various energy management onboard the solar vehicle 'Solelhada'. (author)
An Efficient Graph-based Method for Long-term Land-use Change Statistics
Directory of Open Access Journals (Sweden)
Yipeng Zhang
2015-12-01
Full Text Available Statistical analysis of land-use change plays an important role in sustainable land management and has received increasing attention from scholars and administrative departments. However, the statistical process involving spatial overlay analysis remains difficult and needs improvement to deal with mass land-use data. In this paper, we introduce a spatio-temporal flow network model to reveal the hidden relational information among spatio-temporal entities. Based on graph theory, the constant condition of saturated multi-commodity flow is derived. A new method based on a network partition technique of spatio-temporal flow network are proposed to optimize the transition statistical process. The effectiveness and efficiency of the proposed method is verified through experiments using land-use data in Hunan from 2009 to 2014. In the comparison among three different land-use change statistical methods, the proposed method exhibits remarkable superiority in efficiency.
Endriss, U.; Grandi, U.
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference
Diestel, Reinhard
2017-01-01
This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: “This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory.”Acta Scientiarum Mathematiciarum “Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity. ”Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theo...
Directory of Open Access Journals (Sweden)
Sarunya Kanjanawattana
2017-07-01
Full Text Available Image classification plays a vital role in many areas of study, such as data mining and image processing; however, serious problems collectively referred to as the course of dimensionality have been encountered in previous studies as factors that reduce system performance. Furthermore, we also confront the problem of different graph characteristics even if graphs belong to same types. In this study, we propose a novel method of graph-type classification. Using our approach, we open up a new solution of high-dimensional images and address problems of different characteristics by converting graph images to one dimension with a discrete Fourier transformation and creating numeric datasets using wavelet and Hough transformations. Moreover, we introduce a new classifier, which is a combination between artificial neuron networks (ANNs and support vector machines (SVMs, which we call ANNSVM, to enhance accuracy. The objectives of our study are to propose an effective graph-type classification method that includes finding a new data representative used for classification instead of two-dimensional images and to investigate what features make our data separable. To evaluate the method of our study, we conducted five experiments with different methods and datasets. The input dataset we focused on was a numeric dataset containing wavelet coefficients and outputs of a Hough transformation. From our experimental results, we observed that the highest accuracy was provided using our method with Coiflet 1, which achieved a 0.91 accuracy.
Directory of Open Access Journals (Sweden)
P. B. Lanjewar
2016-06-01
Full Text Available The evaluation and selection of energy technologies involve a large number of attributes whose selection and weighting is decided in accordance with the social, environmental, technical and economic framework. In the present work an integrated multiple attribute decision making methodology is developed by combining graph theory and analytic hierarchy process methods to deal with the evaluation and selection of energy technologies. The energy technology selection attributes digraph enables a quick visual appraisal of the energy technology selection attributes and their interrelationships. The preference index provides a total objective score for comparison of energy technologies alternatives. Application of matrix permanent offers a better appreciation of the considered attributes and helps to analyze the different alternatives from combinatorial viewpoint. The AHP is used to assign relative weights to the attributes. Four examples of evaluation and selection of energy technologies are considered in order to demonstrate and validate the proposed method.
International Nuclear Information System (INIS)
Jian-Jun, Chen; De, Zhang; Yi-Wei, Mao; Jian-Chun, Cheng
2009-01-01
We present a unique method to describe the bonding strength at a bonded solid–solid interface in a multilayered composite material by contact acoustic nonlinearity (CAN) parameter. A CAN model on the bonded solid–solid interface is depicted. It can be seen from the model that CAN parameter is very sensitive to the bonding strength at the interface. When an incident focusing acoustic longitudinal wave scans the interface in two dimensions, the transmitted wave can be used to extract CAN parameter. The contour of the bonding strength for a sample is obtained by CAN parameter. The results show that the region with weak bonding strength can be easily distinguished from the contour
evelopment of a boiling water reactor fault diagnostic system with a signed directed graph method
International Nuclear Information System (INIS)
Chen, M.; Yu, C.C.; Liou, C.T.; Liao, L.Y.
1990-01-01
The fault diagnostic system for a nuclear power reactor is expected to be a useful decision support system for the operators during transients and accident conditions. A considerable research effort has been devoted to the development of automated fault diagnostic systems. One major approach, which has been widely used in chemical engineering, is to identify the possible causes of process disturbance using a logic-oriented method called signed directed graph (SDG). A knowledge based system was developed with the rules derived from the SDG representation. The SDG for the Chinshan nuclear power plant, which is a typical boiling water reactor, is established. The personal consultant system is used as the expert system development tool in this paper
Directory of Open Access Journals (Sweden)
Divi Galih Prasetyo Putri
2014-03-01
Full Text Available Proses evolusi dan perawatan dari sebuah sistem merupakan proses yang sangat penting dalam rekayasa perangkat lunak tidak terkecuali pada aplikasi web. Pada proses ini kebanyakan pengembang tidak lagi berpatokan pada rancangan sistem. Hal ini menyebabkan munculnya unused method. Bagian-bagian program ini tidak lagi terpakai namun masih berada dalam sistem. Keadaan ini meningkatkan kompleksitas dan mengurangi tingkat understandability sistem. Guna mendeteksi adanya unused method pada progam diperlukan teknik untuk melakukan code analysis. Teknik static analysis yang digunakan memanfaatkan call graph yang dibangun dari kode program untuk mengetahui adanya unused method. Call graph dibangun berdasarkan pemanggilan antar method. Aplikasi ini mendeteksi unused method pada kode program PHP yang dibangun menggunakan framework CodeIgniter. Kode program sebagai inputan diurai kedalam bentuk Abstract Syntax Tree (AST yang kemudian dimanfaatkan untuk melakukan analisis terhadap kode program. Proses analisis tersebut kemudian menghasilkan sebuah call graph. Dari call graph yang dihasilkan dapat dideteksi method-method mana saja yang tidak berhasil ditelusuri dan tergolong kedalam unused method. Kakas telah diuji coba pada 5 aplikasi PHP dengan hasil rata-rata nilai presisi sistem sebesar 0.749 dan recall sebesar 1.
Spectral fluctuations of quantum graphs
International Nuclear Information System (INIS)
Pluhař, Z.; Weidenmüller, H. A.
2014-01-01
We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry
Novel Method of Aluminum to Copper Bonding by Cold Spray
Fu, Si-Lin; Li, Cheng-Xin; Wei, Ying-Kang; Luo, Xiao-Tao; Yang, Guan-Jun; Li, Chang-Jiu; Li, Jing-Long
2018-04-01
Cold spray bonding (CSB) has been proposed as a new method for joining aluminum and copper. At high speeds, solid Al particles impacted the groove between the two substrates to form a bond between Al and Cu. Compared to traditional welding technologies, CSB does not form distinct intermetallic compounds. Large stainless steel particles were introduced into the spray powders as in situ shot peen particles to create a dense Al deposit and to improve the bond strength of joints. It was discovered that introducing shot peen particles significantly improved the flattening ratio of the deposited Al particles. Increasing the proportion of shot peen particles from 0 to 70 vol.% decreased the porosity of the deposits from 12.4 to 0.2%, while the shear strength of joints significantly increased. The tensile test results of the Al-Cu joints demonstrated that cracks were initiated at the interface between the Al and the deposit. The average tensile strength was 71.4 MPa and could reach 81% of the tensile strength of pure Al.
A systematic composite service design modeling method using graph-based theory.
Elhag, Arafat Abdulgader Mohammed; Mohamad, Radziah; Aziz, Muhammad Waqar; Zeshan, Furkh
2015-01-01
The composite service design modeling is an essential process of the service-oriented software development life cycle, where the candidate services, composite services, operations and their dependencies are required to be identified and specified before their design. However, a systematic service-oriented design modeling method for composite services is still in its infancy as most of the existing approaches provide the modeling of atomic services only. For these reasons, a new method (ComSDM) is proposed in this work for modeling the concept of service-oriented design to increase the reusability and decrease the complexity of system while keeping the service composition considerations in mind. Furthermore, the ComSDM method provides the mathematical representation of the components of service-oriented design using the graph-based theoryto facilitate the design quality measurement. To demonstrate that the ComSDM method is also suitable for composite service design modeling of distributed embedded real-time systems along with enterprise software development, it is implemented in the case study of a smart home. The results of the case study not only check the applicability of ComSDM, but can also be used to validate the complexity and reusability of ComSDM. This also guides the future research towards the design quality measurement such as using the ComSDM method to measure the quality of composite service design in service-oriented software system.
Superiority Of Graph-Based Visual Saliency GVS Over Other Image Segmentation Methods
Directory of Open Access Journals (Sweden)
Umu Lamboi
2017-02-01
Full Text Available Although inherently tedious the segmentation of images and the evaluation of segmented images are critical in computer vision processes. One of the main challenges in image segmentation evaluation arises from the basic conflict between generality and objectivity. For general segmentation purposes the lack of well-defined ground-truth and segmentation accuracy limits the evaluation of specific applications. Subjectivity is the most common method of evaluation of segmentation quality where segmented images are visually compared. This is daunting task however limits the scope of segmentation evaluation to a few predetermined sets of images. As an alternative supervised evaluation compares segmented images against manually-segmented or pre-processed benchmark images. Not only good evaluation methods allow for different comparisons but also for integration with target recognition systems for adaptive selection of appropriate segmentation granularity with improved recognition accuracy. Most of the current segmentation methods still lack satisfactory measures of effectiveness. Thus this study proposed a supervised framework which uses visual saliency detection to quantitatively evaluate image segmentation quality. The new benchmark evaluator uses Graph-based Visual Saliency GVS to compare boundary outputs for manually segmented images. Using the Berkeley Segmentation Database the proposed algorithm was tested against 4 other quantitative evaluation methods Probabilistic Rand Index PRI Variation of Information VOI Global Consistency Error GSE and Boundary Detection Error BDE. Based on the results the GVS approach outperformed any of the other 4 independent standard methods in terms of visual saliency detection of images.
A graph-based method for fitting planar B-spline curves with intersections
Directory of Open Access Journals (Sweden)
Pengbo Bo
2016-01-01
Full Text Available The problem of fitting B-spline curves to planar point clouds is studied in this paper. A novel method is proposed to deal with the most challenging case where multiple intersecting curves or curves with self-intersection are necessary for shape representation. A method based on Delauney Triangulation of data points is developed to identify connected components which is also capable of removing outliers. A skeleton representation is utilized to represent the topological structure which is further used to create a weighted graph for deciding the merging of curve segments. Different to existing approaches which utilize local shape information near intersections, our method considers shape characteristics of curve segments in a larger scope and is thus capable of giving more satisfactory results. By fitting each group of data points with a B-spline curve, we solve the problems of curve structure reconstruction from point clouds, as well as the vectorization of simple line drawing images by drawing lines reconstruction.
Directory of Open Access Journals (Sweden)
Guimarães Katia S
2006-04-01
Full Text Available Abstract Background Most cellular processes are carried out by multi-protein complexes, groups of proteins that bind together to perform a specific task. Some proteins form stable complexes, while other proteins form transient associations and are part of several complexes at different stages of a cellular process. A better understanding of this higher-order organization of proteins into overlapping complexes is an important step towards unveiling functional and evolutionary mechanisms behind biological networks. Results We propose a new method for identifying and representing overlapping protein complexes (or larger units called functional groups within a protein interaction network. We develop a graph-theoretical framework that enables automatic construction of such representation. We illustrate the effectiveness of our method by applying it to TNFα/NF-κB and pheromone signaling pathways. Conclusion The proposed representation helps in understanding the transitions between functional groups and allows for tracking a protein's path through a cascade of functional groups. Therefore, depending on the nature of the network, our representation is capable of elucidating temporal relations between functional groups. Our results show that the proposed method opens a new avenue for the analysis of protein interaction networks.
Graphing trillions of triangles.
Burkhardt, Paul
2017-07-01
The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.
International Nuclear Information System (INIS)
Shinohara, Yuki; Kamitani, Hideki; Ishibashi, Minako; Ito, Satoru; Ogawa, Toshihide
2011-01-01
The purpose of this study was to evaluate quantification of cerebral blood flow (CBF) values using 123 I-iodoamphetamine (IMP) graph plot (GP) method with single photon emission computed tomography (SPECT), compared with autoradiography (ARG) method. IMP-SPECT by GP combined with ARG method at rest was performed in 40 patients to determine the equation of linear regression for GP method in our institution. In addition, we compared regional CBF (rCBF) values at rest between GP and ARG methods in 10 other patients. Among all 50 patients, acetazolamide (ACZ)-challenged SPECT by GP combined with ARG method using 2-day protocol was performed in 10 patients. We also compared the rCBF values after ACZ challenge between GP and ARG methods in these 10 patients. The equation of linear regression for GP method in our institution was y=1.945x+20.36 (R 2 =0.586, P 2 =0.624, P 2 =0.150, P<0.001). IMP-SPECT by GP method at rest is useful to measure reliable rCBF values without arterial blood sampling, although we need pay attention to interpret the result of 2-day protocol ACZ-challenged SPECT by GP method. (author)
Directory of Open Access Journals (Sweden)
Alberto Apostolico
2009-08-01
Full Text Available The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.
A simple method for finding the scattering coefficients of quantum graphs
International Nuclear Information System (INIS)
Cottrell, Seth S.
2015-01-01
Quantum walks are roughly analogous to classical random walks, and similar to classical walks they have been used to find new (quantum) algorithms. When studying the behavior of large graphs or combinations of graphs, it is useful to find the response of a subgraph to signals of different frequencies. In doing so, we can replace an entire subgraph with a single vertex with variable scattering coefficients. In this paper, a simple technique for quickly finding the scattering coefficients of any discrete-time quantum graph will be presented. These scattering coefficients can be expressed entirely in terms of the characteristic polynomial of the graph’s time step operator. This is a marked improvement over previous techniques which have traditionally required finding eigenstates for a given eigenvalue, which is far more computationally costly. With the scattering coefficients we can easily derive the “impulse response” which is the key to predicting the response of a graph to any signal. This gives us a powerful set of tools for rapidly understanding the behavior of graphs or for reducing a large graph into its constituent subgraphs regardless of how they are connected
Developments of a bonding technique for optical materials by a surface activation method
International Nuclear Information System (INIS)
Sugiyama, Akira; Oda, Tomohiro; Abe, Tomoyuki; Kusunoki, Isao
2005-01-01
We started developing the laser crystal bounding by the surface activation method which can splice crystals together without using hydrogen bonding. For the surface activation, neutral argon beams were used for irradiation of specimens. In the bonding trials with sapphire crystals, we recognized possibility of the bonding method for optical elements. (author)
Brouwer, A.E.; Haemers, W.H.; Brouwer, A.E.; Haemers, W.H.
2012-01-01
This chapter presents some simple results on graph spectra.We assume the reader is familiar with elementary linear algebra and graph theory. Throughout, J will denote the all-1 matrix, and 1 is the all-1 vector.
Hierarchical graphs for rule-based modeling of biochemical systems
Directory of Open Access Journals (Sweden)
Hu Bin
2011-02-01
Full Text Available Abstract Background In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state of a component, and an edge represents a bond between components. Components of a molecule share the same color. Furthermore, graph-rewriting rules are used to represent molecular interactions. A rule that specifies addition (removal of an edge represents a class of association (dissociation reactions, and a rule that specifies a change of a vertex attribute represents a class of reactions that affect the internal state of a molecular component. A set of rules comprises an executable model that can be used to determine, through various means, the system-level dynamics of molecular interactions in a biochemical system. Results For purposes of model annotation, we propose the use of hierarchical graphs to represent structural relationships among components and subcomponents of molecules. We illustrate how hierarchical graphs can be used to naturally document the structural organization of the functional components and subcomponents of two proteins: the protein tyrosine kinase Lck and the T cell receptor (TCR complex. We also show that computational methods developed for regular graphs can be applied to hierarchical graphs. In particular, we describe a generalization of Nauty, a graph isomorphism and canonical labeling algorithm. The generalized version of the Nauty procedure, which we call HNauty, can be used to assign canonical labels to hierarchical graphs or more generally to graphs with multiple edge types. The difference between the Nauty and HNauty procedures is minor, but for completeness, we provide an explanation of the entire HNauty algorithm. Conclusions Hierarchical graphs provide more intuitive formal representations of proteins and other structured molecules with multiple functional components than do the regular graphs of current languages for
Method of waste stabilization with dewatered chemically bonded phosphate ceramics
Wagh, Arun; Maloney, Martin D.
2010-06-29
A method of stabilizing a waste in a chemically bonded phosphate ceramic (CBPC). The method consists of preparing a slurry including the waste, water, an oxide binder, and a phosphate binder. The slurry is then allowed to cure to a solid, hydrated CBPC matrix. Next, bound water within the solid, hydrated CBPC matrix is removed. Typically, the bound water is removed by applying heat to the cured CBPC matrix. Preferably, the quantity of heat applied to the cured CBPC matrix is sufficient to drive off water bound within the hydrated CBPC matrix, but not to volatalize other non-water components of the matrix, such as metals and radioactive components. Typically, a temperature range of between 100.degree. C.-200.degree. C. will be sufficient. In another embodiment of the invention wherein the waste and water have been mixed prior to the preparation of the slurry, a select amount of water may be evaporated from the waste and water mixture prior to preparation of the slurry. Another aspect of the invention is a direct anyhydrous CBPC fabrication method wherein water is removed from the slurry by heating and mixing the slurry while allowing the slurry to cure. Additional aspects of the invention are ceramic matrix waste forms prepared by the methods disclosed above.
Olayan, Rawan S.
2017-11-23
Motivation Finding computationally drug-target interactions (DTIs) is a convenient strategy to identify new DTIs at low cost with reasonable accuracy. However, the current DTI prediction methods suffer the high false positive prediction rate. Results We developed DDR, a novel method that improves the DTI prediction accuracy. DDR is based on the use of a heterogeneous graph that contains known DTIs with multiple similarities between drugs and multiple similarities between target proteins. DDR applies non-linear similarity fusion method to combine different similarities. Before fusion, DDR performs a pre-processing step where a subset of similarities is selected in a heuristic process to obtain an optimized combination of similarities. Then, DDR applies a random forest model using different graph-based features extracted from the DTI heterogeneous graph. Using five repeats of 10-fold cross-validation, three testing setups, and the weighted average of area under the precision-recall curve (AUPR) scores, we show that DDR significantly reduces the AUPR score error relative to the next best start-of-the-art method for predicting DTIs by 34% when the drugs are new, by 23% when targets are new, and by 34% when the drugs and the targets are known but not all DTIs between them are not known. Using independent sources of evidence, we verify as correct 22 out of the top 25 DDR novel predictions. This suggests that DDR can be used as an efficient method to identify correct DTIs.
Application of the Covalent Bond Classification Method for the Teaching of Inorganic Chemistry
Green, Malcolm L. H.; Parkin, Gerard
2014-01-01
The Covalent Bond Classification (CBC) method provides a means to classify covalent molecules according to the number and types of bonds that surround an atom of interest. This approach is based on an elementary molecular orbital analysis of the bonding involving the central atom (M), with the various interactions being classified according to the…
Test method to assess interface adhesion in composite bonding
Teixeira de Freitas, S.; Sinke, J.
2015-01-01
This paper introduces a new type of peel tests dedicated to composite bonding: Composite Peel Tests. This test is inspired on the standard floating roller peel test widely used for metal bonding. The aim of this study is to investigate the potential of the Composite Peel Test to assess interface
de Mol, M.J.; Rensink, Arend; Hunt, James J.
This paper introduces an approach for adding graph transformation-based functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user’s own JAVA class
Novel Methods for Drug-Target Interaction Prediction using Graph Mining
Ba Alawi, Wail
2016-08-31
The problem of developing drugs that can be used to cure diseases is important and requires a careful approach. Since pursuing the wrong candidate drug for a particular disease could be very costly in terms of time and money, there is a strong interest in minimizing such risks. Drug repositioning has become a hot topic of research, as it helps reduce these risks significantly at the early stages of drug development by reusing an approved drug for the treatment of a different disease. Still, finding new usage for a drug is non-trivial, as it is necessary to find out strong supporting evidence that the proposed new uses of drugs are plausible. Many computational approaches were developed to narrow the list of possible candidate drug-target interactions (DTIs) before any experiments are done. However, many of these approaches suffer from unacceptable levels of false positives. We developed two novel methods based on graph mining networks of drugs and targets. The first method (DASPfind) finds all non-cyclic paths that connect a drug and a target, and using a function that we define, calculates a score from all the paths. This score describes our confidence that DTI is correct. We show that DASPfind significantly outperforms other state-of-the-art methods in predicting the top ranked target for each drug. We demonstrate the utility of DASPfind by predicting 15 novel DTIs over a set of ion channel proteins, and confirming 12 out of these 15 DTIs through experimental evidence reported in literature and online drug databases. The second method (DASPfind+) modifies DASPfind in order to increase the confidence and reliability of the resultant predictions. Based on the structure of the drug-target interaction (DTI) networks, we introduced an optimization scheme that incrementally alters the network structure locally for each drug to achieve more robust top 1 ranked predictions. Moreover, we explored effects of several similarity measures between the targets on the prediction
Hadyan, Fadhlil; Shaufiah; Arif Bijaksana, Moch.
2017-01-01
Automatic summarization is a system that can help someone to take the core information of a long text instantly. The system can help by summarizing text automatically. there’s Already many summarization systems that have been developed at this time but there are still many problems in those system. In this final task proposed summarization method using document index graph. This method utilizes the PageRank and HITS formula used to assess the web page, adapted to make an assessment of words in the sentences in a text document. The expected outcome of this final task is a system that can do summarization of a single document, by utilizing document index graph with TextRank and HITS to improve the quality of the summary results automatically.
Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models
Directory of Open Access Journals (Sweden)
Tomasz Kajdanowicz
2016-09-01
Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.
Graph-based modelling in engineering
Rysiński, Jacek
2017-01-01
This book presents versatile, modern and creative applications of graph theory in mechanical engineering, robotics and computer networks. Topics related to mechanical engineering include e.g. machine and mechanism science, mechatronics, robotics, gearing and transmissions, design theory and production processes. The graphs treated are simple graphs, weighted and mixed graphs, bond graphs, Petri nets, logical trees etc. The authors represent several countries in Europe and America, and their contributions show how different, elegant, useful and fruitful the utilization of graphs in modelling of engineering systems can be. .
First-principle study on bonding mechanism of ZnO by LDA+U method
International Nuclear Information System (INIS)
Zhou, G.C.; Sun, L.Z.; Zhong, X.L.; Chen Xiaoshuang; Wei Lu; Wang, J.B.
2007-01-01
The electronic structure and the bonding mechanism of ZnO have been studied by using the Full-Potential Linear Augmented Plane Wave (FP-LAPW) method within the density-functional theory (DFT) based on LDA+U exchange correlation potential. The valence and the bonding charge density are calculated and compared with those derived from LDA and GGA to describe the bonding mechanism. The charge transfer along with the bonding process is analyzed by using the theory of Atoms in Molecules (AIM). The bonding, the topological characteristics and the p-d coupling effects on the bonding mechanism of ZnO are shown quantitatively with the critical points (CPs) along the bonding trajectory and the charge in the atomic basins. Meanwhile, the bonding characteristics for wurtzite, zinc blende and rocksalt phase of ZnO are discussed systematically in the present paper
International Nuclear Information System (INIS)
Campolongo, Francesca; Braddock, Roger
1999-01-01
Sensitivity analysis screening methods aim to isolate the most important factors in experiments involving a large number of significant factors and interactions. This paper extends the one-factor-at-a-time screening method proposed by Morris. The new method, in addition to the 'overall' sensitivity measures already provided by the traditional Morris method, offers estimates of the two-factor interaction effects. The number of model evaluations required is O(k 2 ), where k is the number of model input factors. The efficient sampling strategy in the parameter space is based on concepts of graph theory and on the solution of the 'handcuffed prisoner problem'
Heavens, Kristen R; Charkoudian, Nisha; O'Brien, Catherine; Kenefick, Robert W; Cheuvront, Samuel N
2016-03-01
Few dehydration assessment measures provide accurate information; most are based on reference change values and very few are diagnostically accurate from a single observation or measure. Bioelectrical impedance may lack the precision to detect common forms of dehydration in healthy individuals. Limitations in bioimpedance may be addressed by a unique resistance-reactance (RXc)-score graph method, which transforms vector components into z scores for use with any impedance analyzer in any population. We tested whether the RXc-score graph method provides accurate single or serial assessments of dehydration when compared with gold-standard measures of total body water by using stable isotope dilution (deuterium oxide) combined with body-weight changes. We retrospectively analyzed data from a previous study in which 9 healthy young men participated in 3 trials: euhydration (EUH), extracellular dehydration (ED; via a diuretic), and intracellular dehydration (ID; via exercise in the heat). Participants lost 4-5% of their body weight during the dehydration trials; volume loss was similar between trials (ID compared with ED group: 3.5 ± 0.8 compared with 3.0 ± 0.6 L; P > 0.05). Despite significant losses of body water, most RXc vector scores for ED and ID groups were classified as "normal" (within the 75% population tolerance ellipse). However, directional displacement of vectors was consistent with loss of volume in both ED and ID conditions compared with the EUH condition and tended to be longer in ED than in ID conditions (P = 0.054). We conclude that, whereas individual RXc-score graph values do not provide accurate detection of dehydration from single measurements, directional changes in vector values from serial measurements are consistent with fluid loss for both ED and ID conditions. The RXc-score graph method may therefore alert clinicians to changes in hydration state, which may bolster the interpretation of other recognized change measures of hydration. © 2016
Biazzo, Indaco; Braunstein, Alfredo; Zecchina, Riccardo
2012-08-01
We study the behavior of an algorithm derived from the cavity method for the prize-collecting steiner tree (PCST) problem on graphs. The algorithm is based on the zero temperature limit of the cavity equations and as such is formally simple (a fixed point equation resolved by iteration) and distributed (parallelizable). We provide a detailed comparison with state-of-the-art algorithms on a wide range of existing benchmarks, networks, and random graphs. Specifically, we consider an enhanced derivative of the Goemans-Williamson heuristics and the dhea solver, a branch and cut integer linear programming based approach. The comparison shows that the cavity algorithm outperforms the two algorithms in most large instances both in running time and quality of the solution. Finally we prove a few optimality properties of the solutions provided by our algorithm, including optimality under the two postprocessing procedures defined in the Goemans-Williamson derivative and global optimality in some limit cases.
CORECLUSTER: A Degeneracy Based Graph Clustering Framework
Giatsidis , Christos; Malliaros , Fragkiskos; Thilikos , Dimitrios M. ,; Vazirgiannis , Michalis
2014-01-01
International audience; Graph clustering or community detection constitutes an important task forinvestigating the internal structure of graphs, with a plethora of applications in several domains. Traditional tools for graph clustering, such asspectral methods, typically suffer from high time and space complexity. In thisarticle, we present \\textsc{CoreCluster}, an efficient graph clusteringframework based on the concept of graph degeneracy, that can be used along withany known graph clusteri...
Institute of Scientific and Technical Information of China (English)
莫建文; 王朝选; 首照宇; 张彤; 陈利霞
2013-01-01
针对Graph-Based方法容易出现欠合并现象的不足,结合L*a*b*颜色空间,提出一种改进的Graph-Based图像分割方法.该方法首先将图像由RGB空间转换到L*a*b*颜色空间,接着将每个像素作为节点构造带权无向图,相邻节点之间的欧氏距离作为图的权值,表征相邻像素间的颜色差异；同时,引入一个常数s用于控制颜色差异程度.实验证明,该方法效率高,分割效果良好.%In view of the deficiency of Graph-Based method that it is easy to appear the less merging, in combination with L * a * b * colour space, we propose an improved Graph-Based image segmentation algorithm. First, the method converts the image from RGB colour space to L * a * b * colour space. Then, it takes every pixel as the node to construct the weighted undirected graph, to be the weight of the graph, the Euclidean distance between adjacent nodes is used to represent the colour difference between adjacent pixels; At the same time, a constant S is introduced for the control of the colour difference degree. Experiments show that the method has high efficiency and very good segmentation results.
Roy, Priyanka; Gholami, Peyman; Kuppuswamy Parthasarathy, Mohana; Zelek, John; Lakshminarayanan, Vasudevan
2018-02-01
Segmentation of spectral-domain Optical Coherence Tomography (SD-OCT) images facilitates visualization and quantification of sub-retinal layers for diagnosis of retinal pathologies. However, manual segmentation is subjective, expertise dependent, and time-consuming, which limits applicability of SD-OCT. Efforts are therefore being made to implement active-contours, artificial intelligence, and graph-search to automatically segment retinal layers with accuracy comparable to that of manual segmentation, to ease clinical decision-making. Although, low optical contrast, heavy speckle noise, and pathologies pose challenges to automated segmentation. Graph-based image segmentation approach stands out from the rest because of its ability to minimize the cost function while maximising the flow. This study has developed and implemented a shortest-path based graph-search algorithm for automated intraretinal layer segmentation of SD-OCT images. The algorithm estimates the minimal-weight path between two graph-nodes based on their gradients. Boundary position indices (BPI) are computed from the transition between pixel intensities. The mean difference between BPIs of two consecutive layers quantify individual layer thicknesses, which shows statistically insignificant differences when compared to a previous study [for overall retina: p = 0.17, for individual layers: p > 0.05 (except one layer: p = 0.04)]. These results substantiate the accurate delineation of seven intraretinal boundaries in SD-OCT images by this algorithm, with a mean computation time of 0.93 seconds (64-bit Windows10, core i5, 8GB RAM). Besides being self-reliant for denoising, the algorithm is further computationally optimized to restrict segmentation within the user defined region-of-interest. The efficiency and reliability of this algorithm, even in noisy image conditions, makes it clinically applicable.
Garciá-Arteaga, Juan D.; Corredor, Germán.; Wang, Xiangxue; Velcheti, Vamsidhar; Madabhushi, Anant; Romero, Eduardo
2017-11-01
Tumor-infiltrating lymphocytes occurs when various classes of white blood cells migrate from the blood stream towards the tumor, infiltrating it. The presence of TIL is predictive of the response of the patient to therapy. In this paper, we show how the automatic detection of lymphocytes in digital H and E histopathological images and the quantitative evaluation of the global lymphocyte configuration, evaluated through global features extracted from non-parametric graphs, constructed from the lymphocytes' detected positions, can be correlated to the patient's outcome in early-stage non-small cell lung cancer (NSCLC). The method was assessed on a tissue microarray cohort composed of 63 NSCLC cases. From the evaluated graphs, minimum spanning trees and K-nn showed the highest predictive ability, yielding F1 Scores of 0.75 and 0.72 and accuracies of 0.67 and 0.69, respectively. The predictive power of the proposed methodology indicates that graphs may be used to develop objective measures of the infiltration grade of tumors, which can, in turn, be used by pathologists to improve the decision making and treatment planning processes.
Influence of application methods of one-step self-etching adhesives on microtensile bond strength
Directory of Open Access Journals (Sweden)
Chul-Kyu Choi,
2011-05-01
Full Text Available Objectives The purpose of this study was to evaluate the effect of various application methods of one-step self-etch adhesives to microtensile resin-dentin bond strength. Materials and Methods Thirty-six extracted human molars were used. The teeth were assigned randomly to twelve groups (n = 15, according to the three different adhesive systems (Clearfil Tri-S Bond, Adper Prompt L-Pop, G-Bond and application methods. The adhesive systems were applied on the dentin as follows: 1 The single coating, 2 The double coating, 3 Manual agitation, 4 Ultrasonic agitation. Following the adhesive application, light-cure composite resin was constructed. The restored teeth were stored in distilled water at room temperature for 24 hours, and prepared 15 specimens per groups. Then microtensile bond strength was measured and the failure mode was examined. Results Manual agitation and ultrasonic agitation of adhesive significantly increased the microtensile bond strength than single coating and double coating did. Double coating of adhesive significantly increased the microtensile bond strength than single coating did and there was no significant difference between the manual agitation and ultrasonic agitation group. There was significant difference in microtensile bonding strength among all adhesives and Clearfil Tri-S Bond showed the highest bond strength. Conclusions In one-step self-etching adhesives, there was significant difference according to application methods and type of adhesives. No matter of the material, the manual or ultrasonic agitation of the adhesive showed significantly higher microtensile bond strength.
International Nuclear Information System (INIS)
Duatti, A.; Marchi, A.; Pasqualini, R.
1990-01-01
A new method for the preparation of technetium 99 radiopharmaceuticals containing the technetium-nitrogen triple bond has been developed. The method involves the reaction of pertechnetate anion with the S-methyl ester of dithiocarbazic acid in the presence of HCl and triphenylphosphine. The technetium-nitrido intermediate thus produced is then combined with the ligand in the same reaction solution to produce the final technetium 99-labelled radiopharmaceutical
DEFF Research Database (Denmark)
Vestergaard, Preben Dahl; Hartnell, Bert L.
2006-01-01
There are many results dealing with the problem of decomposing a fixed graph into isomorphic subgraphs. There has also been work on characterizing graphs with the property that one can delete the edges of a number of edge disjoint copies of the subgraph and, regardless of how that is done, the gr...
Methods and system for controlled laser-driven explosive bonding
Rubenchik, Alexander M.; Farmer, Joseph C.; Hackel, Lloyd; Rankin, Jon
2015-11-19
A technique for bonding two dissimilar materials includes positioning a second material over a first material at an oblique angle and applying a tamping layer over the second martial. A laser beam is directed at the second material that generates a plasma at the location of impact on the second material. The plasma generates pressure that accelerates a portion of the second material to a very high velocity and towards the first material. The second material impacts the first material causing bonding of the two materials.
Rao, R Venkata
2013-01-01
Decision Making in Manufacturing Environment Using Graph Theory and Fuzzy Multiple Attribute Decision Making Methods presents the concepts and details of applications of MADM methods. A range of methods are covered including Analytic Hierarchy Process (AHP), Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), VIšekriterijumsko KOmpromisno Rangiranje (VIKOR), Data Envelopment Analysis (DEA), Preference Ranking METHod for Enrichment Evaluations (PROMETHEE), ELimination Et Choix Traduisant la Realité (ELECTRE), COmplex PRoportional ASsessment (COPRAS), Grey Relational Analysis (GRA), UTility Additive (UTA), and Ordered Weighted Averaging (OWA). The existing MADM methods are improved upon and three novel multiple attribute decision making methods for solving the decision making problems of the manufacturing environment are proposed. The concept of integrated weights is introduced in the proposed subjective and objective integrated weights (SOIW) method and the weighted Euclidean distance ba...
Organometallic Methods for Forming and Cleaving Carbon-Carbon Bonds
DEFF Research Database (Denmark)
Christensen, Stig Holden
with concomitant C-C bond formation was studied with a number of Grignard reagents. The transformation was performed in a sealed vial by heating to about 160 °C in an aluminum block or at 180 °C in a microwave oven. Good yields of the product alcohols were obtained with allyl- and benzylmagnesium halides when...
Directory of Open Access Journals (Sweden)
Vatutin Eduard
2017-12-01
Full Text Available The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.
Vatutin, Eduard
2017-12-01
The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.
Methods for characterization of wafer-level encapsulation applied on silicon to LTCC anodic bonding
International Nuclear Information System (INIS)
Khan, M F; Ghavanini, F A; Enoksson, P; Haasl, S; Löfgren, L; Persson, K; Rusu, C; Schjølberg-Henriksen, K
2010-01-01
This paper presents initial results on generic characterization methods for wafer-level encapsulation. The methods, developed specifically to evaluate anodic bonding of low-temperature cofired ceramics (LTCC) to Si, are generally applicable to wafer-level encapsulation. Different microelectromechanical system (MEMS) structures positioned over the whole wafer provide local information about the bond quality. The structures include (i) resonating cantilevers as pressure sensors for bond hermeticity, (ii) resonating bridges as stress sensors for measuring the stress induced by the bonding and (iii) frames/mesas for pull tests. These MEMS structures have been designed, fabricated and characterized indicating that local information can easily be obtained. Buried electrodes to enable localized bonding have been implemented and their effectiveness is indicated from first results of the novel Si to LTCC anodic bonding.
Directory of Open Access Journals (Sweden)
Qu Li
2014-01-01
Full Text Available Online friend recommendation is a fast developing topic in web mining. In this paper, we used SVD matrix factorization to model user and item feature vector and used stochastic gradient descent to amend parameter and improve accuracy. To tackle cold start problem and data sparsity, we used KNN model to influence user feature vector. At the same time, we used graph theory to partition communities with fairly low time and space complexity. What is more, matrix factorization can combine online and offline recommendation. Experiments showed that the hybrid recommendation algorithm is able to recommend online friends with good accuracy.
Brémaud, Pierre
2017-01-01
The emphasis in this book is placed on general models (Markov chains, random fields, random graphs), universal methods (the probabilistic method, the coupling method, the Stein-Chen method, martingale methods, the method of types) and versatile tools (Chernoff's bound, Hoeffding's inequality, Holley's inequality) whose domain of application extends far beyond the present text. Although the examples treated in the book relate to the possible applications, in the communication and computing sciences, in operations research and in physics, this book is in the first instance concerned with theory. The level of the book is that of a beginning graduate course. It is self-contained, the prerequisites consisting merely of basic calculus (series) and basic linear algebra (matrices). The reader is not assumed to be trained in probability since the first chapters give in considerable detail the background necessary to understand the rest of the book. .
Effect of a New Salivary Contaminant Removal Method on Bond Strength
2014-08-31
was to evaluate the effect of various salivary- contaminant removal methods on the shear bond strength of resin cement to hydrofluoric-acid (HF) etched...mold (Ultradent) to a height of 3mm and light cured . Specimens were stored for 24 hours in 37°C distilled water and then tested in shear in a... contamination which may compromise the bond strength of the resin cement to the ceramic (Aboush, 1998; van Schalkwyk et al., 2003). Saliva affects bond
International Nuclear Information System (INIS)
Yi, Won; Yu, Yeong Chul; Jeong, Eui Seob; Lee, Chang Ho
1995-01-01
It is very important to evaluate the bonding residual thermal stress in dissimilar materials such as LSI package. In this study, the bonding residual thermal stress was calculated using the boundary element method, varing with the sub-element, geometry of specimen and adhesive thickness. The present results reveal a stress singularity at the edge of the interface, therefore the bonding strength of metal/resin interface can be estimated by taking into account it.
Bollobas, Bela
2004-01-01
The ever-expanding field of extremal graph theory encompasses a diverse array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume, based on a series of lectures delivered to graduate students at the University of Cambridge, presents a concise yet comprehensive treatment of extremal graph theory.Unlike most graph theory treatises, this text features complete proofs for almost all of its results. Further insights into theory are provided by the numerous exercises of varying degrees of difficulty that accompany each chapter. A
A Comparison of Local Search Methods for the Multicriteria Police Districting Problem on Graph
Directory of Open Access Journals (Sweden)
F. Liberatore
2016-01-01
Full Text Available In the current economic climate, law enforcement agencies are facing resource shortages. The effective and efficient use of scarce resources is therefore of the utmost importance to provide a high standard public safety service. Optimization models specifically tailored to the necessity of police agencies can help to ameliorate their use. The Multicriteria Police Districting Problem (MC-PDP on a graph concerns the definition of sound patrolling sectors in a police district. The objective of this problem is to partition a graph into convex and continuous subsets, while ensuring efficiency and workload balance among the subsets. The model was originally formulated in collaboration with the Spanish National Police Corps. We propose for its solution three local search algorithms: a Simple Hill Climbing, a Steepest Descent Hill Climbing, and a Tabu Search. To improve their diversification capabilities, all the algorithms implement a multistart procedure, initialized by randomized greedy solutions. The algorithms are empirically tested on a case study on the Central District of Madrid. Our experiments show that the solutions identified by the novel Tabu Search outperform the other algorithms. Finally, research guidelines for future developments on the MC-PDP are given.
Almasi, Sepideh; Xu, Xiaoyin; Ben-Zvi, Ayal; Lacoste, Baptiste; Gu, Chenghua; Miller, Eric L
2015-02-01
A novel approach to determine the global topological structure of a microvasculature network from noisy and low-resolution fluorescence microscopy data that does not require the detailed segmentation of the vessel structure is proposed here. The method is most appropriate for problems where the tortuosity of the network is relatively low and proceeds by directly computing a piecewise linear approximation to the vasculature skeleton through the construction of a graph in three dimensions whose edges represent the skeletal approximation and vertices are located at Critical Points (CPs) on the microvasculature. The CPs are defined as vessel junctions or locations of relatively large curvature along the centerline of a vessel. Our method consists of two phases. First, we provide a CP detection technique that, for junctions in particular, does not require any a priori geometric information such as direction or degree. Second, connectivity between detected nodes is determined via the solution of a Binary Integer Program (BIP) whose variables determine whether a potential edge between nodes is or is not included in the final graph. The utility function in this problem reflects both intensity-based and structural information along the path connecting the two nodes. Qualitative and quantitative results confirm the usefulness and accuracy of this method. This approach provides a mean of correctly capturing the connectivity patterns in vessels that are missed by more traditional segmentation and binarization schemes because of imperfections in the images which manifest as dim or broken vessels. Copyright © 2014 Elsevier B.V. All rights reserved.
Method and device for secure, high-density tritium bonded with carbon
Wertsching, Alan Kevin; Trantor, Troy Joseph; Ebner, Matthias Anthony; Norby, Brad Curtis
2016-04-05
A method and device for producing secure, high-density tritium bonded with carbon. A substrate comprising carbon is provided. A precursor is intercalated between carbon in the substrate. The precursor intercalated in the substrate is irradiated until at least a portion of the precursor, preferably a majority of the precursor, is transmutated into tritium and bonds with carbon of the substrate forming bonded tritium. The resulting bonded tritium, tritium bonded with carbon, produces electrons via beta decay. The substrate is preferably a substrate from the list of substrates consisting of highly-ordered pyrolytic graphite, carbon fibers, carbon nanotunes, buckministerfullerenes, and combinations thereof. The precursor is preferably boron-10, more preferably lithium-6. Preferably, thermal neutrons are used to irradiate the precursor. The resulting bonded tritium is preferably used to generate electricity either directly or indirectly.
Graph Theory. 1. Fragmentation of Structural Graphs
Directory of Open Access Journals (Sweden)
Lorentz JÄNTSCHI
2002-12-01
Full Text Available The investigation of structural graphs has many fields of applications in engineering, especially in applied sciences like as applied chemistry and physics, computer sciences and automation, electronics and telecommunication. The main subject of the paper is to express fragmentation criteria in graph using a new method of investigation: terminal paths. Using terminal paths are defined most of the fragmentation criteria that are in use in molecular topology, but the fields of applications are more generally than that, as I mentioned before. Graphical examples of fragmentation are given for every fragmentation criteria. Note that all fragmentation is made with a computer program that implements a routine for every criterion.[1] A web routine for tracing all terminal paths in graph can be found at the address: http://vl.academicdirect.ro/molecular_topology/tpaths/ [1] M. V. Diudea, I. Gutman, L. Jäntschi, Molecular Topology, Nova Science, Commack, New York, 2001, 2002.
GraphTeams: a method for discovering spatial gene clusters in Hi-C sequencing data.
Schulz, Tizian; Stoye, Jens; Doerr, Daniel
2018-05-08
Hi-C sequencing offers novel, cost-effective means to study the spatial conformation of chromosomes. We use data obtained from Hi-C experiments to provide new evidence for the existence of spatial gene clusters. These are sets of genes with associated functionality that exhibit close proximity to each other in the spatial conformation of chromosomes across several related species. We present the first gene cluster model capable of handling spatial data. Our model generalizes a popular computational model for gene cluster prediction, called δ-teams, from sequences to graphs. Following previous lines of research, we subsequently extend our model to allow for several vertices being associated with the same label. The model, called δ-teams with families, is particular suitable for our application as it enables handling of gene duplicates. We develop algorithmic solutions for both models. We implemented the algorithm for discovering δ-teams with families and integrated it into a fully automated workflow for discovering gene clusters in Hi-C data, called GraphTeams. We applied it to human and mouse data to find intra- and interchromosomal gene cluster candidates. The results include intrachromosomal clusters that seem to exhibit a closer proximity in space than on their chromosomal DNA sequence. We further discovered interchromosomal gene clusters that contain genes from different chromosomes within the human genome, but are located on a single chromosome in mouse. By identifying δ-teams with families, we provide a flexible model to discover gene cluster candidates in Hi-C data. Our analysis of Hi-C data from human and mouse reveals several known gene clusters (thus validating our approach), but also few sparsely studied or possibly unknown gene cluster candidates that could be the source of further experimental investigations.
Influence of application methods of one-step self-etching adhesives on microtensile bond strength
Chul-Kyu Choi,; Sung-Ae Son; Jin-Hee Ha; Bock Hur; Hyeon-Cheol Kim; Yong-Hun Kwon; Jeong-Kil Park
2011-01-01
Objectives The purpose of this study was to evaluate the effect of various application methods of one-step self-etch adhesives to microtensile resin-dentin bond strength. Materials and Methods Thirty-six extracted human molars were used. The teeth were assigned randomly to twelve groups (n = 15), according to the three different adhesive systems (Clearfil Tri-S Bond, Adper Prompt L-Pop, G-Bond) and application methods. The adhesive systems were applied on the dentin as follows: 1) T...
Graph Theory and Ion and Molecular Aggregation in Aqueous Solutions
Choi, Jun-Ho; Lee, Hochan; Choi, Hyung Ran; Cho, Minhaeng
2018-04-01
In molecular and cellular biology, dissolved ions and molecules have decisive effects on chemical and biological reactions, conformational stabilities, and functions of small to large biomolecules. Despite major efforts, the current state of understanding of the effects of specific ions, osmolytes, and bioprotecting sugars on the structure and dynamics of water H-bonding networks and proteins is not yet satisfactory. Recently, to gain deeper insight into this subject, we studied various aggregation processes of ions and molecules in high-concentration salt, osmolyte, and sugar solutions with time-resolved vibrational spectroscopy and molecular dynamics simulation methods. It turns out that ions (or solute molecules) have a strong propensity to self-assemble into large and polydisperse aggregates that affect both local and long-range water H-bonding structures. In particular, we have shown that graph-theoretical approaches can be used to elucidate morphological characteristics of large aggregates in various aqueous salt, osmolyte, and sugar solutions. When ion and molecular aggregates in such aqueous solutions are treated as graphs, a variety of graph-theoretical properties, such as graph spectrum, degree distribution, clustering coefficient, minimum path length, and graph entropy, can be directly calculated by considering an ensemble of configurations taken from molecular dynamics trajectories. Here we show percolating behavior exhibited by ion and molecular aggregates upon increase in solute concentration in high solute concentrations and discuss compelling evidence of the isomorphic relation between percolation transitions of ion and molecular aggregates and water H-bonding networks. We anticipate that the combination of graph theory and molecular dynamics simulation methods will be of exceptional use in achieving a deeper understanding of the fundamental physical chemistry of dissolution and in describing the interplay between the self-aggregation of solute
Graph Theory and Ion and Molecular Aggregation in Aqueous Solutions.
Choi, Jun-Ho; Lee, Hochan; Choi, Hyung Ran; Cho, Minhaeng
2018-04-20
In molecular and cellular biology, dissolved ions and molecules have decisive effects on chemical and biological reactions, conformational stabilities, and functions of small to large biomolecules. Despite major efforts, the current state of understanding of the effects of specific ions, osmolytes, and bioprotecting sugars on the structure and dynamics of water H-bonding networks and proteins is not yet satisfactory. Recently, to gain deeper insight into this subject, we studied various aggregation processes of ions and molecules in high-concentration salt, osmolyte, and sugar solutions with time-resolved vibrational spectroscopy and molecular dynamics simulation methods. It turns out that ions (or solute molecules) have a strong propensity to self-assemble into large and polydisperse aggregates that affect both local and long-range water H-bonding structures. In particular, we have shown that graph-theoretical approaches can be used to elucidate morphological characteristics of large aggregates in various aqueous salt, osmolyte, and sugar solutions. When ion and molecular aggregates in such aqueous solutions are treated as graphs, a variety of graph-theoretical properties, such as graph spectrum, degree distribution, clustering coefficient, minimum path length, and graph entropy, can be directly calculated by considering an ensemble of configurations taken from molecular dynamics trajectories. Here we show percolating behavior exhibited by ion and molecular aggregates upon increase in solute concentration in high solute concentrations and discuss compelling evidence of the isomorphic relation between percolation transitions of ion and molecular aggregates and water H-bonding networks. We anticipate that the combination of graph theory and molecular dynamics simulation methods will be of exceptional use in achieving a deeper understanding of the fundamental physical chemistry of dissolution and in describing the interplay between the self-aggregation of solute
A method for UV-bonding in the fabrication of glass electrophoretic microchips.
Huang, Z; Sanders, J C; Dunsmor, C; Ahmadzadeh, H; Landers, J P
2001-10-01
This paper presents an approach for the development of methodologies amenable to simple and inexpensive microchip fabrication, potentially applicable to dissimilar materials bonding and chip integration. The method involves a UV-curable glue that can be used for glass microchip fabrication bonding at room temperature. This involves nothing more than fabrication of glue "guide channels" into the microchip architecture that upon exposure to the appropriate UV light source, bonds the etched plate and cover plate together. The microchip performance was verified by capillary zone electrophoresis (CZE) of small fluorescent molecules with no microchannel surface modification carried out, as well as with a DNA fragment separation following surface modification. The performance of these UV-bonded electrophoretic microchips indicates that this method may provide an alternative to high temperature bonding.
Developments of integrated laser crystals by a direct bonding method
International Nuclear Information System (INIS)
Sugiyama, Akira; Fukuyama, Hiroyasu; Katsumata, Masaki; Tanaka, Mitsuhiro; Okada, Yukikatu
2003-01-01
Laser crystal integration using a neodymium-doped yttrium vanadate (or orthovanadate) laser crystal, and non-doped yttrium vanadate crystals that function as cold fingers has been demonstrated. A newly developed dry etching process was adopted in the preparation for contact of mechanically polished surfaces. In the heat treatment process, temperature optimization was essential to get rid of precipitation of vanadic acid caused by the thermo-chemical reaction in a vacuum furnace. The bonded crystal was studied via optical characteristics, magnified inspections, laser output performances pumped by a CW laser diode. From these experiments, it was clear that the integrated Nd:YVO 4 laser crystal, securing the well-improved thermal conductivity, can increase laser output power nearly twice that of the conventional single crystal which was cracked in high power laser pumping of 10 W due to its intrinsic poor thermal conductivity. (author)
Dexter, Alex; Race, Alan M; Steven, Rory T; Barnes, Jennifer R; Hulme, Heather; Goodwin, Richard J A; Styles, Iain B; Bunch, Josephine
2017-11-07
Clustering is widely used in MSI to segment anatomical features and differentiate tissue types, but existing approaches are both CPU and memory-intensive, limiting their application to small, single data sets. We propose a new approach that uses a graph-based algorithm with a two-phase sampling method that overcomes this limitation. We demonstrate the algorithm on a range of sample types and show that it can segment anatomical features that are not identified using commonly employed algorithms in MSI, and we validate our results on synthetic MSI data. We show that the algorithm is robust to fluctuations in data quality by successfully clustering data with a designed-in variance using data acquired with varying laser fluence. Finally, we show that this method is capable of generating accurate segmentations of large MSI data sets acquired on the newest generation of MSI instruments and evaluate these results by comparison with histopathology.
Effect Of Storage And Disinfection Methods Of Extracted Bovine Teeth On Bond Strength To Dentin
Humel M.M.C.; Oliveira M.T.; Cavalli V.; Giannini M.
2007-01-01
The aim of this study was to evaluate the effect of storage and disinfection methods (SDM) on bond strength (BS) to bovine dentin, using two adhesive systems. Adper Single Bond and Clearfil Protect Bond. Method: Extracted bovine teeth were assigned to the following SDM: 100% Humidity (HU); Gamma Radiation (GR); Autoclave (AU): 0.10g/mL Thymol (TH); 10% Formatin (FO); Frozen (FR); 0.2% Sodium Azide (SA) and 0.5% Chloramine T (CT) (n=10). The GR and AU groups were submitted to sterilization met...
DEFF Research Database (Denmark)
Seiller, Thomas
2016-01-01
Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should...... be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define...... "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite...
Trudeau, Richard J
1994-01-01
Preface1. Pure Mathematics Introduction; Euclidean Geometry as Pure Mathematics; Games; Why Study Pure Mathematics?; What's Coming; Suggested Reading2. Graphs Introduction; Sets; Paradox; Graphs; Graph diagrams; Cautions; Common Graphs; Discovery; Complements and Subgraphs; Isomorphism; Recognizing Isomorphic Graphs; Semantics The Number of Graphs Having a Given nu; Exercises; Suggested Reading3. Planar Graphs Introduction; UG, K subscript 5, and the Jordan Curve Theorem; Are there More Nonplanar Graphs?; Expansions; Kuratowski's Theorem; Determining Whether a Graph is Planar or
A Metal Bump Bonding Method Using Ag Nanoparticles as Intermediate Layer
Fu, Weixin; Nimura, Masatsugu; Kasahara, Takashi; Mimatsu, Hayata; Okada, Akiko; Shoji, Shuichi; Ishizuka, Shugo; Mizuno, Jun
2015-11-01
The future development of low-temperature and low-pressure bonding technology is necessary for fine-pitch bump application. We propose a bump structure using Ag nanoparticles as an intermediate layer coated on a fine-pitch Cu pillar bump. The intermediate layer is prepared using an efficient and cost-saving squeegee-coating method followed by a 100°C baking process. This bump structure can be easily flattened before the bonding process, and the low-temperature sinterability of the nanoparticles is retained. The bonding experiment was successfully performed at 250°C and 39.8 MPa and the bonding strength was comparable to that achieved via other bonding technology utilizing metal particles or porous material as bump materials.
Sequential plasma activation methods for hydrophilic direct bonding at sub-200 °C
He, Ran; Yamauchi, Akira; Suga, Tadatomo
2018-02-01
We present our newly developed sequential plasma activation methods for hydrophilic direct bonding of silica glasses and thermally grown SiO2 films. N2 plasma was employed to introduce a metastable oxynitride layer on wafer surfaces for the improvement of bond energy. By using either O2-plasma/N2-plasma/N-radical or N2-plasma/N-radical sequential activation, the quartz-quartz bond energy was increased from 2.7 J/m2 to close to the quartz bulk fracture energy that was estimated to be around 9.0 J/m2 after post-bonding annealing at 200 °C. The silicon bulklike bond energy between thermal SiO2 films was also obtained. We suggest that the improvement is attributable to surface modification such as N-related defect formation and asperity softening by the N2 plasma surface treatment.
In vitro evaluation of an alternative method to bond molar tubes
Directory of Open Access Journals (Sweden)
Célia Regina Maio Pinzan-Vercelino
2011-02-01
Full Text Available Despite the advances in bonding materials, many clinicians today still prefer to place bands on molar teeth. Molar bonding procedures need improvement to be widely accepted clinically. OBJECTIVE: The purpose of this study was to evaluate the shear bond strength when an additional adhesive layer was applied on the occlusal tooth/tube interface to provide reinforcement to molar tubes. MATERIAL AND METHODS: Sixty third molars were selected and allocated to the 3 groups: group 1 received a conventional direct bond followed by the application of an additional layer of adhesive on the occlusal tooth/tube interface, group 2 received a conventional direct bond, and group 3 received a conventional direct bond and an additional cure time of 10 s. The specimens were debonded in a universal testing machine. The results were analyzed statistically by ANOVA and Tukey's test (α=0.05. RESULTS: Group 1 had a significantly higher (p0.05. CONCLUSIONS: The present in vitro findings indicate that the application of an additional layer of adhesive on the tooth/tube interface increased the shear bond strength of the bonded molar tubes.
International Nuclear Information System (INIS)
Saito, Shigeru; Fukaya, Kiyoshi; Ishiyama, Shintaro; Eto, Motokuni; Akiba, Masato
1999-08-01
In recent years, it has been considered that W (tungsten) is one of candidate materials for armor tiles of plasma facing components, like first wall or divertor, of fusion reactor. On the other hand, oxygen free high thermal conductivity (OFHC)-copper is proposed as heat sink materials behind the plasma facing materials because of its high thermal conductivity. However, plasma facing components are exposed to cyclic high heat load and heavily irradiated by 14 MeV neutron. Under these conditions, many unfavorable effects, for instance, thermal stresses of bonding interface, irradiation damage and He atom production by nuclear transmutation, will be decreased bonding strength between W and Cu alloys. Therefore, it is necessary to develop a reliable bonding techniques in order to make plasma facing components which can resist them. Then, we started the bonding technology development by hot isostatic press (HIP) method to bond W with Cu alloys. In this experiments, to optimize HIP bonding conditions, four point bending were performed for each bonded conditions at temperature from R.T. to 873 K and we could get the best HIP bonding conditions for W and OFHC-Cu as 1273 K x 2 hours x 147 MPa. To evaluate bonding strength of the specimen bonded at these conditions, tensile tests were also performed at same temperature range. The tensile strength was similar with OFHC-Cu which were treated at same conditions. (author)
Feitosa, V P; Gotti, V B; Grohmann, C V; Abuná, G; Correr-Sobrinho, L; Sinhoreti, M A C; Correr, A B
2014-09-01
To evaluate the effects of two methods to simulate physiological pulpal pressure on the dentine bonding performance of two all-in-one adhesives and a two-step self-etch silorane-based adhesive by means of microtensile bond strength (μTBS) and nanoleakage surveys. The self-etch adhesives [G-Bond Plus (GB), Adper Easy Bond (EB) and silorane adhesive (SIL)] were applied to flat deep dentine surfaces from extracted human molars. The restorations were constructed using resin composites Filtek Silorane or Filtek Z350 (3M ESPE). After 24 h using the two methods of simulated pulpal pressure or no pulpal pressure (control groups), the bonded teeth were cut into specimens and submitted to μTBS and silver uptake examination. Results were analysed with two-way anova and Tukey's test (P adhesives. No difference between control and pulpal pressure groups was found for SIL and GB. EB led significant drop (P = 0.002) in bond strength under pulpal pressure. Silver impregnation was increased after both methods of simulated pulpal pressure for all adhesives, and it was similar between the simulated pulpal pressure methods. The innovative method to simulate pulpal pressure behaved similarly to the classic one and could be used as an alternative. The HEMA-free one-step and the two-step self-etch adhesives had acceptable resistance against pulpal pressure, unlike the HEMA-rich adhesive. © 2013 International Endodontic Journal. Published by John Wiley & Sons Ltd.
Wu, Xin-Ping; Gagliardi, Laura; Truhlar, Donald G
2018-05-30
Combined quantum mechanical and molecular mechanical (QM/MM) methods are the most powerful available methods for high-level treatments of subsystems of very large systems. The treatment of the QM-MM boundary strongly affects the accuracy of QM/MM calculations. For QM/MM calculations having covalent bonds cut by the QM-MM boundary, it has been proposed previously to use a scheme with system-specific tuned fluorine link atoms. Here, we propose a broadly parametrized scheme where the parameters of the tuned F link atoms depend only on the type of bond being cut. In the proposed new scheme, the F link atom is tuned for systems with a certain type of cut bond at the QM-MM boundary instead of for a specific target system, and the resulting link atoms are call bond-tuned link atoms. In principle, the bond-tuned link atoms can be as convenient as the popular H link atoms, and they are especially well adapted for high-throughput and accurate QM/MM calculations. Here, we present the parameters for several kinds of cut bonds along with a set of validation calculations that confirm that the proposed bond-tuned link-atom scheme can be as accurate as the system-specific tuned F link-atom scheme.
Directory of Open Access Journals (Sweden)
Xin-Ping Wu
2018-05-01
Full Text Available Combined quantum mechanical and molecular mechanical (QM/MM methods are the most powerful available methods for high-level treatments of subsystems of very large systems. The treatment of the QM−MM boundary strongly affects the accuracy of QM/MM calculations. For QM/MM calculations having covalent bonds cut by the QM−MM boundary, it has been proposed previously to use a scheme with system-specific tuned fluorine link atoms. Here, we propose a broadly parametrized scheme where the parameters of the tuned F link atoms depend only on the type of bond being cut. In the proposed new scheme, the F link atom is tuned for systems with a certain type of cut bond at the QM−MM boundary instead of for a specific target system, and the resulting link atoms are call bond-tuned link atoms. In principle, the bond-tuned link atoms can be as convenient as the popular H link atoms, and they are especially well adapted for high-throughput and accurate QM/MM calculations. Here, we present the parameters for several kinds of cut bonds along with a set of validation calculations that confirm that the proposed bond-tuned link-atom scheme can be as accurate as the system-specific tuned F link-atom scheme.
Qu, Xingtian; Li, Jinlai; Yin, Zhifu
2018-04-01
Micro- and nanofluidic chips are becoming increasing significance for biological and medical applications. Future advances in micro- and nanofluidics and its utilization in commercial applications depend on the development and fabrication of low cost and high fidelity large scale plastic micro- and nanofluidic chips. However, the majority of the present fabrication methods suffer from a low bonding rate of the chip during thermal bonding process due to air trapping between the substrate and the cover plate. In the present work, a novel bonding technique based on Ar plasma and water treatment was proposed to fully bond the large scale micro- and nanofluidic chips. The influence of Ar plasma parameters on the water contact angle and the effect of bonding conditions on the bonding rate and the bonding strength of the chip were studied. The fluorescence tests demonstrate that the 5 × 5 cm2 poly(methyl methacrylate) chip with 180 nm wide and 180 nm deep nanochannels can be fabricated without any block and leakage by our newly developed method.
International Nuclear Information System (INIS)
Lu Hongyou; Zhao Zhiyong; Sun Quinren
1987-01-01
A brief introduction of the Signal Flow Graph (SFG) method is given. The application of it to charged-particle optics (CPO) is described. The method has the advantages of simplicity, visualisation and computerisation. An example of the application of SFG is given for the design of a three-sector electromagnetic isotope separator. (orig.)
A quality quantitative method of silicon direct bonding based on wavelet image analysis
Tan, Xiao; Tao, Zhi; Li, Haiwang; Xu, Tiantong; Yu, Mingxing
2018-04-01
The rapid development of MEMS (micro-electro-mechanical systems) has received significant attention from researchers in various fields and subjects. In particular, the MEMS fabrication process is elaborate and, as such, has been the focus of extensive research inquiries. However, in MEMS fabrication, component bonding is difficult to achieve and requires a complex approach. Thus, improvements in bonding quality are relatively important objectives. A higher quality bond can only be achieved with improved measurement and testing capabilities. In particular, the traditional testing methods mainly include infrared testing, tensile testing, and strength testing, despite the fact that using these methods to measure bond quality often results in low efficiency or destructive analysis. Therefore, this paper focuses on the development of a precise, nondestructive visual testing method based on wavelet image analysis that is shown to be highly effective in practice. The process of wavelet image analysis includes wavelet image denoising, wavelet image enhancement, and contrast enhancement, and as an end result, can display an image with low background noise. In addition, because the wavelet analysis software was developed with MATLAB, it can reveal the bonding boundaries and bonding rates to precisely indicate the bond quality at all locations on the wafer. This work also presents a set of orthogonal experiments that consist of three prebonding factors, the prebonding temperature, the positive pressure value and the prebonding time, which are used to analyze the prebonding quality. This method was used to quantify the quality of silicon-to-silicon wafer bonding, yielding standard treatment quantities that could be practical for large-scale use.
Ribes, Luis
2017-01-01
This book offers a detailed introduction to graph theoretic methods in profinite groups and applications to abstract groups. It is the first to provide a comprehensive treatment of the subject. The author begins by carefully developing relevant notions in topology, profinite groups and homology, including free products of profinite groups, cohomological methods in profinite groups, and fixed points of automorphisms of free pro-p groups. The final part of the book is dedicated to applications of the profinite theory to abstract groups, with sections on finitely generated subgroups of free groups, separability conditions in free and amalgamated products, and algorithms in free groups and finite monoids. Profinite Graphs and Groups will appeal to students and researchers interested in profinite groups, geometric group theory, graphs and connections with the theory of formal languages. A complete reference on the subject, the book includes historical and bibliographical notes as well as a discussion of open quest...
Multiple graph regularized protein domain ranking
Wang, Jim Jing-Yan
2012-11-19
Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.
Multiple graph regularized protein domain ranking
Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin
2012-01-01
Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.
Multiple graph regularized protein domain ranking.
Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin
2012-11-19
Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.
Multiple graph regularized protein domain ranking
Directory of Open Access Journals (Sweden)
Wang Jim
2012-11-01
Full Text Available Abstract Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.
Graph-based Operational Semantics of a Lazy Functional Languages
DEFF Research Database (Denmark)
Rose, Kristoffer Høgsbro
1992-01-01
Presents Graph Operational Semantics (GOS): a semantic specification formalism based on structural operational semantics and term graph rewriting. Demonstrates the method by specifying the dynamic ...
Gould, Ronald
2012-01-01
This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory. Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. S
Kumar, M. R.; Ghosh, A.; Karuppannan, D.
2018-05-01
The construction of aircraft using advanced composites have become very popular during the past two decades, in which many innovative manufacturing processes, such as cocuring, cobonding, and secondary bonding processes, have been adopted. The secondary bonding process has become less popular than the other two ones because of nonavailability of process database and certification issues. In this article, an attempt is made to classify the quality of bonding using nondestructive ultrasonic inspection methods. Specimens were prepared and tested using the nondestructive ultrasonic Through Transmission (TT), Pulse Echo (PE), and air coupled guided wave techniques. It is concluded that the ultrasonic pulse echo technique is the best one for inspecting composite secondary bonded adhesive joints.
Chartrand, Gary; Zhang, Ping
2010-01-01
Gary Chartrand has influenced the world of Graph Theory for almost half a century. He has supervised more than a score of Ph.D. dissertations and written several books on the subject. The most widely known of these texts, Graphs and Digraphs, … has much to recommend it, with clear exposition, and numerous challenging examples [that] make it an ideal textbook for the advanced undergraduate or beginning graduate course. The authors have updated their notation to reflect the current practice in this still-growing area of study. By the authors' estimation, the 5th edition is approximately 50% longer than the 4th edition. … the legendary Frank Harary, author of the second graph theory text ever produced, is one of the figures profiled. His book was the standard in the discipline for several decades. Chartrand, Lesniak and Zhang have produced a worthy successor.-John T. Saccoman, MAA Reviews, June 2012 (This book is in the MAA's basic library list.)As with the earlier editions, the current text emphasizes clear...
Method of bonding metals to ceramics and other materials
Gruen, D.M.; Krauss, A.R.; DeWald, A.P.; Chienping Ju; Rigsbee, J.M.
1993-01-05
A composite and method of forming same wherein the composite has a non-metallic portion and an alloy portion wherein the alloy comprises an alkali metal and a metal which is an electrical conductor such as Cu, Ag, Al, Sn or Au and forms an alloy with the alkali metal. A cable of superconductors and composite is also disclosed.
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
Directory of Open Access Journals (Sweden)
Katona Gyula Y.
2014-11-01
Full Text Available The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.
Yin, Zhifu; Sun, Lei; Zou, Helin; Cheng, E.
2015-05-01
A method for obtaining a low-cost and high-replication precision two-dimensional (2D) nanofluidic device with a polymethyl methacrylate (PMMA) sheet is proposed. To improve the replication precision of the 2D PMMA nanochannels during the hot embossing process, the deformation of the PMMA sheet was analyzed by a numerical simulation method. The constants of the generalized Maxwell model used in the numerical simulation were calculated by experimental compressive creep curves based on previously established fitting formula. With optimized process parameters, 176 nm-wide and 180 nm-deep nanochannels were successfully replicated into the PMMA sheet with a replication precision of 98.2%. To thermal bond the 2D PMMA nanochannels with high bonding strength and low dimensional loss, the parameters of the oxygen plasma treatment and thermal bonding process were optimized. In order to measure the dimensional loss of 2D nanochannels after thermal bonding, a dimension loss evaluating method based on the nanoindentation experiments was proposed. According to the dimension loss evaluating method, the total dimensional loss of 2D nanochannels was 6 nm and 21 nm in width and depth, respectively. The tensile bonding strength of the 2D PMMA nanofluidic device was 0.57 MPa. The fluorescence images demonstrate that there was no blocking or leakage over the entire microchannels and nanochannels.
Directory of Open Access Journals (Sweden)
Dániel Bánky
Full Text Available Biological network data, such as metabolic-, signaling- or physical interaction graphs of proteins are increasingly available in public repositories for important species. Tools for the quantitative analysis of these networks are being developed today. Protein network-based drug target identification methods usually return protein hubs with large degrees in the networks as potentially important targets. Some known, important protein targets, however, are not hubs at all, and perturbing protein hubs in these networks may have several unwanted physiological effects, due to their interaction with numerous partners. Here, we show a novel method applicable in networks with directed edges (such as metabolic networks that compensates for the low degree (non-hub vertices in the network, and identifies important nodes, regardless of their hub properties. Our method computes the PageRank for the nodes of the network, and divides the PageRank by the in-degree (i.e., the number of incoming edges of the node. This quotient is the same in all nodes in an undirected graph (even for large- and low-degree nodes, that is, for hubs and non-hubs as well, but may differ significantly from node to node in directed graphs. We suggest to assign importance to non-hub nodes with large PageRank/in-degree quotient. Consequently, our method gives high scores to nodes with large PageRank, relative to their degrees: therefore non-hub important nodes can easily be identified in large networks. We demonstrate that these relatively high PageRank scores have biological relevance: the method correctly finds numerous already validated drug targets in distinct organisms (Mycobacterium tuberculosis, Plasmodium falciparum and MRSA Staphylococcus aureus, and consequently, it may suggest new possible protein targets as well. Additionally, our scoring method was not chosen arbitrarily: its value for all nodes of all undirected graphs is constant; therefore its high value captures
Bánky, Dániel; Iván, Gábor; Grolmusz, Vince
2013-01-01
Biological network data, such as metabolic-, signaling- or physical interaction graphs of proteins are increasingly available in public repositories for important species. Tools for the quantitative analysis of these networks are being developed today. Protein network-based drug target identification methods usually return protein hubs with large degrees in the networks as potentially important targets. Some known, important protein targets, however, are not hubs at all, and perturbing protein hubs in these networks may have several unwanted physiological effects, due to their interaction with numerous partners. Here, we show a novel method applicable in networks with directed edges (such as metabolic networks) that compensates for the low degree (non-hub) vertices in the network, and identifies important nodes, regardless of their hub properties. Our method computes the PageRank for the nodes of the network, and divides the PageRank by the in-degree (i.e., the number of incoming edges) of the node. This quotient is the same in all nodes in an undirected graph (even for large- and low-degree nodes, that is, for hubs and non-hubs as well), but may differ significantly from node to node in directed graphs. We suggest to assign importance to non-hub nodes with large PageRank/in-degree quotient. Consequently, our method gives high scores to nodes with large PageRank, relative to their degrees: therefore non-hub important nodes can easily be identified in large networks. We demonstrate that these relatively high PageRank scores have biological relevance: the method correctly finds numerous already validated drug targets in distinct organisms (Mycobacterium tuberculosis, Plasmodium falciparum and MRSA Staphylococcus aureus), and consequently, it may suggest new possible protein targets as well. Additionally, our scoring method was not chosen arbitrarily: its value for all nodes of all undirected graphs is constant; therefore its high value captures importance in the
Method for bonding a thermoplastic polymer to a thermosetting polymer component
Van Tooren, M.J.L.
2012-01-01
The invention relates to a method for bonding a thermoplastic polymer to a thermosetting polymer component, the thermoplastic polymer having a melting temperature that exceeds the curing temperature of the thermosetting polymer. The method comprises the steps of providing a cured thermosetting
Laser materials development by means of a solid-state bonding method
International Nuclear Information System (INIS)
Sugiyama, Akira
2011-01-01
This paper reviews laser materials development via a bonding method without adhesives. Instead of conventional chemical etching, a dry etching technique using an argon beam has been newly developed for the bonding method. This method meets the requirement for the use of optical materials. We succeeded in the fabrication of a composite laser crystal with good heat conductivity by bonding two kinds of crystals; one is neodymium-doped YVO 4 crystal (Nd:YVO 4 ) and the other is its host crystal YVO 4 . In the comparison of the laser performance between the normal and composite crystal, the composite one shows the good lasing capability of increasing laser output without fracture of the crystal due to thermal stress which appeared in the normal one. (author)
Olayan, Rawan S.
2017-12-01
Computational drug repurposing aims at finding new medical uses for existing drugs. The identification of novel drug-target interactions (DTIs) can be a useful part of such a task. Computational determination of DTIs is a convenient strategy for systematic screening of a large number of drugs in the attempt to identify new DTIs at low cost and with reasonable accuracy. This necessitates development of accurate computational methods that can help focus on the follow-up experimental validation on a smaller number of highly likely targets for a drug. Although many methods have been proposed for computational DTI prediction, they suffer the high false positive prediction rate or they do not predict the effect that drugs exert on targets in DTIs. In this report, first, we present a comprehensive review of the recent progress in the field of DTI prediction from data-centric and algorithm-centric perspectives. The aim is to provide a comprehensive review of computational methods for identifying DTIs, which could help in constructing more reliable methods. Then, we present DDR, an efficient method to predict the existence of DTIs. DDR achieves significantly more accurate results compared to the other state-of-theart methods. As supported by independent evidences, we verified as correct 22 out of the top 25 DDR DTIs predictions. This validation proves the practical utility of DDR, suggesting that DDR can be used as an efficient method to identify 5 correct DTIs. Finally, we present DDR-FE method that predicts the effect types of a drug on its target. On different representative datasets, under various test setups, and using different performance measures, we show that DDR-FE achieves extremely good performance. Using blind test data, we verified as correct 2,300 out of 3,076 DTIs effects predicted by DDR-FE. This suggests that DDR-FE can be used as an efficient method to identify correct effects of a drug on its target.
Network reconstruction via graph blending
Estrada, Rolando
2016-05-01
Graphs estimated from empirical data are often noisy and incomplete due to the difficulty of faithfully observing all the components (nodes and edges) of the true graph. This problem is particularly acute for large networks where the number of components may far exceed available surveillance capabilities. Errors in the observed graph can render subsequent analyses invalid, so it is vital to develop robust methods that can minimize these observational errors. Errors in the observed graph may include missing and spurious components, as well fused (multiple nodes are merged into one) and split (a single node is misinterpreted as many) nodes. Traditional graph reconstruction methods are only able to identify missing or spurious components (primarily edges, and to a lesser degree nodes), so we developed a novel graph blending framework that allows us to cast the full estimation problem as a simple edge addition/deletion problem. Armed with this framework, we systematically investigate the viability of various topological graph features, such as the degree distribution or the clustering coefficients, and existing graph reconstruction methods for tackling the full estimation problem. Our experimental results suggest that incorporating any topological feature as a source of information actually hinders reconstruction accuracy. We provide a theoretical analysis of this phenomenon and suggest several avenues for improving this estimation problem.
Kim, Jae-Hoon; Chae, Soyeon; Lee, Yunhee; Han, Geum-Jun; Cho, Byeong-Hoon
2014-11-01
This study compared the sensitivity of three shear test methods for measuring the shear bond strength (SBS) of resin cement to zirconia ceramic and evaluated the effects of surface treatment methods on the bonding. Polished zirconia ceramic (Cercon base, DeguDent) discs were randomly divided into four surface treatment groups: no treatment (C), airborne-particle abrasion (A), conditioning with Alloy primer (Kuraray Medical Co.) (P) and conditioning with Alloy primer after airborne-particle abrasion (AP). The bond strengths of the resin cement (Multilink N, Ivoclar Vivadent) to the zirconia specimens of each surface treatment group were determined by three SBS test methods: the conventional SBS test with direct filling of the mold (Ø 4 mm × 3 mm) with resin cement (Method 1), the conventional SBS test with cementation of composite cylinders (Ø 4 mm × 3 mm) using resin cement (Method 2) and the microshear bond strength (μSBS) test with cementation of composite cylinders (Ø 0.8 mm × 1 mm) using resin cement (Method 3). Both the test method and the surface treatment significantly influenced the SBS values. In Method 3, as the SBS values increased, the coefficients of variation decreased and the Weibull parameters increased. The AP groups showed the highest SBS in all of the test methods. Only in Method 3 did the P group show a higher SBS than the A group. The μSBS test was more sensitive to differentiating the effects of surface treatment methods than the conventional SBS tests. Primer conditioning was a stronger contributing factor for the resin bond to zirconia ceramic than was airborne-particle abrasion.
Olsen, M E; Bishara, S E; Damon, P; Jakobsen, J R
1997-05-01
Damage to the enamel surface during bonding and debonding of orthodontic brackets is a clinical concern. Alternative bonding methods that minimize enamel surface damage while maintaining a clinically useful bond strength is an aim of current research. The purpose of this study was to compare the effects on bond strength and bracket failure location of two adhesives (System 1+ and Scotchbond Multipurpose, 3M Dental Products Division) and two enamel conditioners (37% phosphoric acid and 10% maleic acid). Forty-eight freshly extracted human premolars were pumiced and divided into four groups of 12 teeth, and metal orthodontic brackets were attached to the enamel surface by one of four protocols: (1) System 1+ and phosphoric acid, (2) Scotchbond and phosphoric acid, (3) System 1+ and maleic acid, and (4) Scotchbond and maleic acid. After bracket attachment, the teeth were mounted in phenolic rings and stored in deionized water at 37 degrees C for 72 hours. A Zwick universal testing machine (Zwick GmbH & Co.) was used to determine shear bond strengths. The residual adhesive on the enamel surface was evaluated with the Adhesive Remnant Index. The analysis of variance was used to compare the four groups. Significance was predetermined at p adhesives on the enamel surfaces, revealed significant differences among the four groups (mean 2 = 0.005). A Duncan multiple range test revealed the difference occurred between the phosphoric acid and maleic acid groups, with maleic acid having bond failures at the enamel-adhesive interface. In conclusion, the use of Scotchbond Multipurpose and/or maleic acid does not significantly effect bond strength, however, the use of maleic acid resulted in an unfavorable bond failure location.
Directory of Open Access Journals (Sweden)
Franziska Kuhlmann
Full Text Available Studying plant-aphid interactions is challenging as aphid feeding is a complex process hidden in the plant tissue. Here we propose a combination of two well established methods to study nutrient acquisition by aphids focusing on the uptake of isotopically labelled nitrogen ((15N. We combined the Electrical Penetration Graph (EPG technique that allows detailed recording of aphid feeding behaviour and stable isotope ratio mass spectrometry (IRMS to precisely measure the uptake of nitrogen. Bird cherry-oat aphids Rhopalosiphum padi L. (Hemiptera, Aphididae fed for 24 h on barley plants (Hordeum vulgare L., cultivar Lina, Poaceae that were cultivated with a (15N enriched nutrient solution. The time aphids fed in the phloem was strongly positive correlated with their (15N uptake. All other single behavioural phases were not correlated with (15N enrichment in the aphids, which corroborates their classification as non-feeding EPG phases. In addition, phloem-feeding and (15N enrichment of aphids was divided into two groups. One group spent only short time in the phloem phase and was unsuccessful in nitrogen acquisition, while the other group displayed longer phloem-feeding phases and was successful in nitrogen acquisition. This suggests that several factors such as the right feeding site, time span of feeding and individual conditions play a role for the aphids to acquire nutrients successfully. The power of this combination of methods for studying plant-aphid interactions is discussed.
RJSplot: Interactive Graphs with R.
Barrios, David; Prieto, Carlos
2018-03-01
Data visualization techniques provide new methods for the generation of interactive graphs. These graphs allow a better exploration and interpretation of data but their creation requires advanced knowledge of graphical libraries. Recent packages have enabled the integration of interactive graphs in R. However, R provides limited graphical packages that allow the generation of interactive graphs for computational biology applications. The present project has joined the analytical power of R with the interactive graphical features of JavaScript in a new R package (RJSplot). It enables the easy generation of interactive graphs in R, provides new visualization capabilities, and contributes to the advance of computational biology analytical methods. At present, 16 interactive graphics are available in RJSplot, such as the genome viewer, Manhattan plots, 3D plots, heatmaps, dendrograms, networks, and so on. The RJSplot package is freely available online at http://rjsplot.net. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.
Data-Based Decision-Making: Developing a Method for Capturing Teachers' Understanding of CBM Graphs
Espin, Christine A.; Wayman, Miya Miura; Deno, Stanley L.; McMaster, Kristen L.; de Rooij, Mark
2017-01-01
In this special issue, we explore the decision-making aspect of "data-based decision-making". The articles in the issue address a wide range of research questions, designs, methods, and analyses, but all focus on data-based decision-making for students with learning difficulties. In this first article, we introduce the topic of…
A fault diagnosis method based on signed directed graph and matrix for nuclear power plants
International Nuclear Information System (INIS)
Liu, Yong-Kuo; Wu, Guo-Hua; Xie, Chun-Li; Duan, Zhi-Yong; Peng, Min-Jun; Li, Meng-Kun
2016-01-01
Highlights: • “Rules matrix” is proposed for FDD. • “State matrix” is proposed to solve SDG online inference. • SDG inference and search method are combined for FDD. - Abstract: In order to solve SDG online fault diagnosis and inference, matrix diagnosis and inference methods are proposed for fault detection and diagnosis (FDD). Firstly, “rules matrix” based on SDG model is used for FDD. Secondly, “status matrix” is proposed to achieve SDG online inference. According to different diagnosis results, “status matrix” is applied for the depth-first search and the breadth-first search respectively to find the propagation paths of each fault. Finally, the SDG model of the secondary-loop system in pressurized water reactor (PWR) is built to verify the effectiveness of the proposed method. The simulation experiment results indicate that the “status matrix” used for online inference can be used to find the fault propagation paths and to explain the causes for fault. Therefore, it can be concluded that the proposed method is one of the fault diagnosis for nuclear power plants (NPPs), which can be used to facilitate the development of fault diagnostic system.
A fault diagnosis method based on signed directed graph and matrix for nuclear power plants
Energy Technology Data Exchange (ETDEWEB)
Liu, Yong-Kuo, E-mail: LYK08@126.com [Fundamental Science on Nuclear Safety and Simulation Technology Laboratory, Harbin Engineering University, Harbin 150001 (China); Wu, Guo-Hua [Fundamental Science on Nuclear Safety and Simulation Technology Laboratory, Harbin Engineering University, Harbin 150001 (China); Institute of Nuclear Energy Technology, Tsinghua University, Beijing 100084 (China); Xie, Chun-Li [Traffic College, Northeast Forestry University, Harbin, 150040 (China); Duan, Zhi-Yong; Peng, Min-Jun; Li, Meng-Kun [Fundamental Science on Nuclear Safety and Simulation Technology Laboratory, Harbin Engineering University, Harbin 150001 (China)
2016-02-15
Highlights: • “Rules matrix” is proposed for FDD. • “State matrix” is proposed to solve SDG online inference. • SDG inference and search method are combined for FDD. - Abstract: In order to solve SDG online fault diagnosis and inference, matrix diagnosis and inference methods are proposed for fault detection and diagnosis (FDD). Firstly, “rules matrix” based on SDG model is used for FDD. Secondly, “status matrix” is proposed to achieve SDG online inference. According to different diagnosis results, “status matrix” is applied for the depth-first search and the breadth-first search respectively to find the propagation paths of each fault. Finally, the SDG model of the secondary-loop system in pressurized water reactor (PWR) is built to verify the effectiveness of the proposed method. The simulation experiment results indicate that the “status matrix” used for online inference can be used to find the fault propagation paths and to explain the causes for fault. Therefore, it can be concluded that the proposed method is one of the fault diagnosis for nuclear power plants (NPPs), which can be used to facilitate the development of fault diagnostic system.
Effect of hardening methods of moulding sands with water glass on structure of bonding bridges
Directory of Open Access Journals (Sweden)
M. Stachowicz
2010-07-01
Full Text Available Research on influence of hardening methods on structure of bonding bridges in moulding sands with sodium water glass is presented.Moulding sands with addition of 2.5 % of binder with molar module 2.0 were hardened with CO2 and dried in traditional way or hardenedwith microwaves. It was proved that the hardening method affects structure of bonding bridges, correlating with properties of the hardened moulding sands. It was found that strength of the moulding sands hardened with microwaves for 4 min is very close to that measured after traditional drying at 110 °C for 120 min. So, application of microwave hardening ensures significant shortening of the process time to the value comparable with CO2 hardening but guaranteeing over 10-fold increase of mechanical properties. Analysis of SEM images of hardened moulding sands permitted explaining differences in quality parameters of moulding sands by connecting them with structure of the created bonding bridges.
Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?
Directory of Open Access Journals (Sweden)
Mehmet Fatih Öçal
2017-01-01
Full Text Available Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students’ learning during graphing functions. However, the display of graphs of functions that students sketched by hand may be relatively different when compared to the correct forms sketched using graphing software. The possible misleading effects of this situation brought a discussion of a misconception (asymptote misconception on graphing functions. The purpose of this study is two- fold. First of all, this study investigated whether using graphing software (GeoGebra in this case helps students to determine and resolve this misconception in calculus classrooms. Second, the reasons for this misconception are sought. The multiple case study was utilized in this study. University students in two calculus classrooms who received instructions with (35 students or without GeoGebra assisted instructions (32 students were compared according to whether they fell into this misconception on graphing basic functions (1/x, lnx, ex. In addition, students were interviewed to reveal the reasons behind this misconception. Data were analyzed by means of descriptive and content analysis methods. The findings indicated that those who received GeoGebra assisted instruction were better in resolving it. In addition, the reasons behind this misconception were found to be teacher-based, exam-based and some other factors.
Stella, João Paulo Fragomeni; Oliveira, Andrea Becker; Nojima, Lincoln Issamu; Marquezan, Mariana
2015-01-01
OBJECTIVE: To assess four different chemical surface conditioning methods for ceramic material before bracket bonding, and their impact on shear bond strength and surface integrity at debonding. METHODS: Four experimental groups (n = 13) were set up according to the ceramic conditioning method: G1 = 37% phosphoric acid etching followed by silane application; G2 = 37% liquid phosphoric acid etching, no rinsing, followed by silane application; G3 = 10% hydrofluoric acid etching alone; and G4 = 10% hydrofluoric acid etching followed by silane application. After surface conditioning, metal brackets were bonded to porcelain by means of the Transbond XP system (3M Unitek). Samples were submitted to shear bond strength tests in a universal testing machine and the surfaces were later assessed with a microscope under 8 X magnification. ANOVA/Tukey tests were performed to establish the difference between groups (α= 5%). RESULTS: The highest shear bond strength values were found in groups G3 and G4 (22.01 ± 2.15 MPa and 22.83 ± 3.32 Mpa, respectively), followed by G1 (16.42 ± 3.61 MPa) and G2 (9.29 ± 1.95 MPa). As regards surface evaluation after bracket debonding, the use of liquid phosphoric acid followed by silane application (G2) produced the least damage to porcelain. When hydrofluoric acid and silane were applied, the risk of ceramic fracture increased. CONCLUSIONS: Acceptable levels of bond strength for clinical use were reached by all methods tested; however, liquid phosphoric acid etching followed by silane application (G2) resulted in the least damage to the ceramic surface. PMID:26352845
Energy Technology Data Exchange (ETDEWEB)
Mel' nichuk, A.Yu.; Bondarenko, A.K.; Fialkov, B.S.; Khegay, L.U.; Khvan, L.A.; Muzyzhuk, V.D.; Zakharov, A.G.; Zelenskiy, V.P.
1985-01-01
The coking temperature of coke should be determined from the magnitude of the ionization current of the medium during heating (3/sup 0//min) of a coke sample (2 g, fraction < 0.2 mm) in an oxidation medium with air supply (1 1/min). The coking temperature is determined from the maximum magnitude of current using a graduated graph constructed during analysis of coke samples obtained with different final coking temperatures. The discrepancy between the established coking temperature and that defined from the proposed method is 8-19/sup 0/, and that defined from electrical resistance of coke is 26-43/sup 0/. In addition to high accuracy, this method reduces the time outlays for making the analysis.
Ramírez-Rojas, Alejandro; Telesca, Luciano; Lovallo, Michele; Flores, Leticia
2015-04-01
By using the method of the visibility graph (VG), five magnitude time series extracted from the seismic catalog of the Mexican subduction zone were investigated. The five seismic sequences represent the seismicity which occurred between 2005 and 2012 in five seismic areas: Guerrero, Chiapas, Oaxaca, Jalisco and Michoacan. Among the five seismic sequences, the Jalisco sequence shows VG properties significantly different from those shown by the other four. Such a difference could be inherent in the different tectonic settings of Jalisco with respect to those characterizing the other four areas. The VG properties of the seismic sequences have been put in relationship with the more typical seismological characteristics (b-value and a-value of the Gutenberg-Richter law). The present study was supported by the Bilateral Project Italy-Mexico "Experimental Stick-slip models of tectonic faults: innovative statistical approaches applied to synthetic seismic sequences", jointly funded by MAECI (Italy) and AMEXCID (Mexico) in the framework of the Bilateral Agreement for Scientific and Technological Cooperation PE 2014-2016
Modeling Software Evolution using Algebraic Graph Rewriting
Ciraci, Selim; van den Broek, Pim
We show how evolution requests can be formalized using algebraic graph rewriting. In particular, we present a way to convert the UML class diagrams to colored graphs. Since changes in software may effect the relation between the methods of classes, our colored graph representation also employs the
Constructs for Programming with Graph Rewrites
Rodgers, Peter
2000-01-01
Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The constructs we present are once only nodes, attractor nodes and single match rewrites. We illustrate the operation of the constructs by example. The advantages of adding these new rewrite modifiers is to reduce t...
Quantum chaos on discrete graphs
International Nuclear Information System (INIS)
Smilansky, Uzy
2007-01-01
Adapting a method developed for the study of quantum chaos on quantum (metric) graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76), spectral ζ functions and trace formulae for discrete Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph and obtaining functions which belong to the class of ζ functions proposed originally by Ihara (1966 J. Mat. Soc. Japan 18 219) and expanded by subsequent authors (Stark and Terras 1996 Adv. Math. 121 124, Kotani and Sunada 2000 J. Math. Sci. Univ. Tokyo 7 7). Finally, a model of 'classical dynamics' on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76). (fast track communication)
Effect of different methods of enamel conditioning on bond strength of orthodontic brackets
Directory of Open Access Journals (Sweden)
Davari AR
2007-01-01
Full Text Available Background and Aim: With the introduction of different bondable restorative materials in dentistry, various methods have been suggested to enhance the polymerization and shear bond strength of these materials. The aim of this study was to determine the effects of different methods of enamel conditioning on bond strength of orthodontic brackets and on the bracket/ adhesive failure mode. Materials and Methods: In this experimental in vitro study, brackets were bonded to thirty-six bovine incisor teeth with different protocols according to the manufacturer's instructions as follows: Group 1: conventional multistep adhesive (n=12; Group 2: self-etching primer system (n=12; Group 3: acid+self-etching primer system (n=12. Specimens were loaded in a universal testing machine (Instron, Canton and Mass and the mode of failure was recorded. Data were analyzed by ANOVA and Kruskall-Wallis tests with p<0.05 as the limit of significance. Results: The mean shear bond strength was 11.7 ± 4.2, 10.5 ± 4.4, and 10.9 ± 4.8 MPa for group 1, 2, and 3 respectively. There was no significant difference in bond strength among the three groups (P=0.800. No significant difference was observed among the three groups with respect to residual adhesive on the enamel surfaces (P=0.554. Conclusion: Based on the results of the present study, the use of self-etching primers may be an alternative to conventional phosphoric acid pre-treatment in orthodontic bonding.
Directory of Open Access Journals (Sweden)
J. Dolezalova
2016-06-01
Full Text Available The paper is dealing with scanpath comparison of eye-tracking data recorded during case study focused on the evaluation of 2D and 3D city maps. The experiment contained screenshots from three map portals. Two types of maps were used - standard map and 3D visualization. Respondents’ task was to find particular point symbol on the map as fast as possible. Scanpath comparison is one group of the eye-tracking data analyses methods used for revealing the strategy of the respondents. In cartographic studies, the most commonly used application for scanpath comparison is eyePatterns that output is hierarchical clustering and a tree graph representing the relationships between analysed sequences. During an analysis of the algorithm generating a tree graph, it was found that the outputs do not correspond to the reality. We proceeded to the creation of a new tool called ScanGraph. This tool uses visualization of cliques in simple graphs and is freely available at www.eyetracking.upol.cz/scangraph. Results of the study proved the functionality of the tool and its suitability for analyses of different strategies of map readers. Based on the results of the tool, similar scanpaths were selected, and groups of respondents with similar strategies were identified. With this knowledge, it is possible to analyse the relationship between belonging to the group with similar strategy and data gathered from the questionnaire (age, sex, cartographic knowledge, etc. or type of stimuli (2D, 3D map.
Dolezalova, J.; Popelka, S.
2016-06-01
The paper is dealing with scanpath comparison of eye-tracking data recorded during case study focused on the evaluation of 2D and 3D city maps. The experiment contained screenshots from three map portals. Two types of maps were used - standard map and 3D visualization. Respondents' task was to find particular point symbol on the map as fast as possible. Scanpath comparison is one group of the eye-tracking data analyses methods used for revealing the strategy of the respondents. In cartographic studies, the most commonly used application for scanpath comparison is eyePatterns that output is hierarchical clustering and a tree graph representing the relationships between analysed sequences. During an analysis of the algorithm generating a tree graph, it was found that the outputs do not correspond to the reality. We proceeded to the creation of a new tool called ScanGraph. This tool uses visualization of cliques in simple graphs and is freely available at www.eyetracking.upol.cz/scangraph. Results of the study proved the functionality of the tool and its suitability for analyses of different strategies of map readers. Based on the results of the tool, similar scanpaths were selected, and groups of respondents with similar strategies were identified. With this knowledge, it is possible to analyse the relationship between belonging to the group with similar strategy and data gathered from the questionnaire (age, sex, cartographic knowledge, etc.) or type of stimuli (2D, 3D map).
Bonding brackets on white spot lesions pretreated by means of two methods
Directory of Open Access Journals (Sweden)
Julia Sotero Vianna
2016-04-01
Full Text Available Abstract Objective: The aim of this study was to evaluate the shear bond strength (SBS of brackets bonded to demineralized enamel pretreated with low viscosity Icon Infiltrant resin (DMG and glass ionomer cement (Clinpro XT Varnish, 3M Unitek with and without aging. Methods: A total of 75 bovine enamel specimens were allocated into five groups (n = 15. Group 1 was the control group in which the enamel surface was not demineralized. In the other four groups, the surfaces were submitted to cariogenic challenge and white spot lesions were treated. Groups 2 and 3 were treated with Icon Infiltrant resin; Groups 4 and 5, with Clinpro XT Varnish. After treatment, Groups 3 and 5 were artificially aged. Brackets were bonded with Transbond XT adhesive system and SBS was evaluated by means of a universal testing machine. Statistical analysis was performed by one-way analysis of variance followed by Tukey post-hoc test. Results: All groups tested presented shear bond strengths similar to or higher than the control group. Specimens of Group 4 had significantly higher shear bond strength values (p < 0.05 than the others. Conclusion: Pretreatment of white spot lesions, with or without aging, did not decrease the SBS of brackets.
Summary: beyond fault trees to fault graphs
International Nuclear Information System (INIS)
Alesso, H.P.; Prassinos, P.; Smith, C.F.
1984-09-01
Fault Graphs are the natural evolutionary step over a traditional fault-tree model. A Fault Graph is a failure-oriented directed graph with logic connectives that allows cycles. We intentionally construct the Fault Graph to trace the piping and instrumentation drawing (P and ID) of the system, but with logical AND and OR conditions added. Then we evaluate the Fault Graph with computer codes based on graph-theoretic methods. Fault Graph computer codes are based on graph concepts, such as path set (a set of nodes traveled on a path from one node to another) and reachability (the complete set of all possible paths between any two nodes). These codes are used to find the cut-sets (any minimal set of component failures that will fail the system) and to evaluate the system reliability
International Nuclear Information System (INIS)
Saito, Shigeru; Fukaya, Kiyoshi; Eto, Motokuni; Ishiyama, Shintaro; Akiba, Masato
2000-02-01
Recently, W (tungsten)-alloys are considered as plasma facing material (PFM) for ITER because of these many favorable properties such as high melting point (3655 K), relatively high thermal conductivity and higher resistivity for plasma sputtering. On the other hand, Cu-alloys, especially DS (dispersion strengthened)-Cu, are proposed as heat sink materials because of its high thermal conductivity and good mechanical properties at high temperature. Plasma facing components (PFC) are designed as the duplex structure where W armor tiles are bonded with Cu-alloy heat sink. Then, we started the bonding technology development by hot isostatic press (HIP) method to bond W with Cu-alloys because of its many advantages. Until now, it was reported that we could get the best HIP bonding conditions for W and OFHC-Cu and the tensile strength was similar with HIP treated OFHC-Cu. In this experiments, bonding tests of W and DS-Cu with insert material were performed. As insert material, OFHC-Cu was used with different thickness. Bonding conditions were selected as 1273 K x 2 hours x 147 MPa. Bonding tests with 0.3 to 1.8 mm thickness OFHC-Cu were successfully bonded but with 0.1 mm thickness was not bonded. From the results of tensile tests, the tensile strength of the specimens with 0.3 and 0.5 mm thickness were decreased at elevated temperature. It was shown that over 1.0 mm thickness OFHC-Cu insert may be needed and the tensile strength were a little higher than that of HIP treated OFHC-Cu. (author)
International Nuclear Information System (INIS)
Kanno, Ikuo; Yamashita, Makoto; Onabe, Hideaki
2006-01-01
Si wafers with two different resistivities ranging over two orders of magnitude were bonded by the surface activation method. The resistivities of bonded Si wafers were measured as a function of annealing temperature. Using calculations based on a model, the interface resistivities of bonded Si wafers were estimated as a function of the measured resistivities of bonded Si wafers. With thermal treatment from 500degC to 900degC, all interfaces showed high resistivity, with behavior that was close to that of an insulator. Annealing at 1000degC decreased the interface resistivity and showed close to ideal bonding after thermal treatment at 1100degC. (author)
Chartrand, Gary; Rosen, Kenneth H
2008-01-01
Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...
International Nuclear Information System (INIS)
Beichel, Reinhard; Bornik, Alexander; Bauer, Christian; Sorantin, Erich
2012-01-01
Purpose: Liver segmentation is an important prerequisite for the assessment of liver cancer treatment options like tumor resection, image-guided radiation therapy (IGRT), radiofrequency ablation, etc. The purpose of this work was to evaluate a new approach for liver segmentation. Methods: A graph cuts segmentation method was combined with a three-dimensional virtual reality based segmentation refinement approach. The developed interactive segmentation system allowed the user to manipulate volume chunks and/or surfaces instead of 2D contours in cross-sectional images (i.e, slice-by-slice). The method was evaluated on twenty routinely acquired portal-phase contrast enhanced multislice computed tomography (CT) data sets. An independent reference was generated by utilizing a currently clinically utilized slice-by-slice segmentation method. After 1 h of introduction to the developed segmentation system, three experts were asked to segment all twenty data sets with the proposed method. Results: Compared to the independent standard, the relative volumetric segmentation overlap error averaged over all three experts and all twenty data sets was 3.74%. Liver segmentation required on average 16 min of user interaction per case. The calculated relative volumetric overlap errors were not found to be significantly different [analysis of variance (ANOVA) test, p = 0.82] between experts who utilized the proposed 3D system. In contrast, the time required by each expert for segmentation was found to be significantly different (ANOVA test, p = 0.0009). Major differences between generated segmentations and independent references were observed in areas were vessels enter or leave the liver and no accepted criteria for defining liver boundaries exist. In comparison, slice-by-slice based generation of the independent standard utilizing a live wire tool took 70.1 min on average. A standard 2D segmentation refinement approach applied to all twenty data sets required on average 38.2 min of
Energy Technology Data Exchange (ETDEWEB)
Beichel, Reinhard; Bornik, Alexander; Bauer, Christian; Sorantin, Erich [Departments of Electrical and Computer Engineering and Internal Medicine, Iowa Institute for Biomedical Imaging, University of Iowa, Iowa City, Iowa 52242 (United States); Institute for Computer Graphics and Vision, Graz University of Technology, Inffeldgasse 16, A-8010 Graz (Austria); Department of Electrical and Computer Engineering, Iowa Institute for Biomedical Imaging, University of Iowa, Iowa City, Iowa 52242 (United States); Department of Radiology, Medical University Graz, Auenbruggerplatz 34, A-8010 Graz (Austria)
2012-03-15
Purpose: Liver segmentation is an important prerequisite for the assessment of liver cancer treatment options like tumor resection, image-guided radiation therapy (IGRT), radiofrequency ablation, etc. The purpose of this work was to evaluate a new approach for liver segmentation. Methods: A graph cuts segmentation method was combined with a three-dimensional virtual reality based segmentation refinement approach. The developed interactive segmentation system allowed the user to manipulate volume chunks and/or surfaces instead of 2D contours in cross-sectional images (i.e, slice-by-slice). The method was evaluated on twenty routinely acquired portal-phase contrast enhanced multislice computed tomography (CT) data sets. An independent reference was generated by utilizing a currently clinically utilized slice-by-slice segmentation method. After 1 h of introduction to the developed segmentation system, three experts were asked to segment all twenty data sets with the proposed method. Results: Compared to the independent standard, the relative volumetric segmentation overlap error averaged over all three experts and all twenty data sets was 3.74%. Liver segmentation required on average 16 min of user interaction per case. The calculated relative volumetric overlap errors were not found to be significantly different [analysis of variance (ANOVA) test, p = 0.82] between experts who utilized the proposed 3D system. In contrast, the time required by each expert for segmentation was found to be significantly different (ANOVA test, p = 0.0009). Major differences between generated segmentations and independent references were observed in areas were vessels enter or leave the liver and no accepted criteria for defining liver boundaries exist. In comparison, slice-by-slice based generation of the independent standard utilizing a live wire tool took 70.1 min on average. A standard 2D segmentation refinement approach applied to all twenty data sets required on average 38.2 min of
Dipnall, J F; Pasco, J A; Berk, M; Williams, L J; Dodd, S; Jacka, F N; Meyer, D
2017-01-01
Key lifestyle-environ risk factors are operative for depression, but it is unclear how risk factors cluster. Machine-learning (ML) algorithms exist that learn, extract, identify and map underlying patterns to identify groupings of depressed individuals without constraints. The aim of this research was to use a large epidemiological study to identify and characterise depression clusters through "Graphing lifestyle-environs using machine-learning methods" (GLUMM). Two ML algorithms were implemented: unsupervised Self-organised mapping (SOM) to create GLUMM clusters and a supervised boosted regression algorithm to describe clusters. Ninety-six "lifestyle-environ" variables were used from the National health and nutrition examination study (2009-2010). Multivariate logistic regression validated clusters and controlled for possible sociodemographic confounders. The SOM identified two GLUMM cluster solutions. These solutions contained one dominant depressed cluster (GLUMM5-1, GLUMM7-1). Equal proportions of members in each cluster rated as highly depressed (17%). Alcohol consumption and demographics validated clusters. Boosted regression identified GLUMM5-1 as more informative than GLUMM7-1. Members were more likely to: have problems sleeping; unhealthy eating; ≤2 years in their home; an old home; perceive themselves underweight; exposed to work fumes; experienced sex at ≤14 years; not perform moderate recreational activities. A positive relationship between GLUMM5-1 (OR: 7.50, Pdepression was found, with significant interactions with those married/living with partner (P=0.001). Using ML based GLUMM to form ordered depressive clusters from multitudinous lifestyle-environ variables enabled a deeper exploration of the heterogeneous data to uncover better understandings into relationships between the complex mental health factors. Copyright © 2016 Elsevier Masson SAS. All rights reserved.
Graph embedding with rich information through heterogeneous graph
Sun, Guolei
2017-11-12
Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most existing algorithms for graph embedding only rely on the topology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this thesis, we proposed a novel and general framework for graph embedding with rich text information (GERI) through constructing a heterogeneous network, in which we integrate node and edge content information with graph topology. Specially, we designed a novel biased random walk to explore the constructed heterogeneous network with the notion of flexible neighborhood. Our sampling strategy can compromise between BFS and DFS local search on heterogeneous graph. To further improve our algorithm, we proposed semi-supervised GERI (SGERI), which learns graph embedding in an discriminative manner through heterogeneous network with label information. The efficacy of our method is demonstrated by extensive comparison experiments with 9 baselines over multi-label and multi-class classification on various datasets including Citeseer, Cora, DBLP and Wiki. It shows that GERI improves the Micro-F1 and Macro-F1 of node classification up to 10%, and SGERI improves GERI by 5% in Wiki.
Beichel, Reinhard; Bornik, Alexander; Bauer, Christian; Sorantin, Erich
2012-03-01
Liver segmentation is an important prerequisite for the assessment of liver cancer treatment options like tumor resection, image-guided radiation therapy (IGRT), radiofrequency ablation, etc. The purpose of this work was to evaluate a new approach for liver segmentation. A graph cuts segmentation method was combined with a three-dimensional virtual reality based segmentation refinement approach. The developed interactive segmentation system allowed the user to manipulate volume chunks and∕or surfaces instead of 2D contours in cross-sectional images (i.e, slice-by-slice). The method was evaluated on twenty routinely acquired portal-phase contrast enhanced multislice computed tomography (CT) data sets. An independent reference was generated by utilizing a currently clinically utilized slice-by-slice segmentation method. After 1 h of introduction to the developed segmentation system, three experts were asked to segment all twenty data sets with the proposed method. Compared to the independent standard, the relative volumetric segmentation overlap error averaged over all three experts and all twenty data sets was 3.74%. Liver segmentation required on average 16 min of user interaction per case. The calculated relative volumetric overlap errors were not found to be significantly different [analysis of variance (ANOVA) test, p = 0.82] between experts who utilized the proposed 3D system. In contrast, the time required by each expert for segmentation was found to be significantly different (ANOVA test, p = 0.0009). Major differences between generated segmentations and independent references were observed in areas were vessels enter or leave the liver and no accepted criteria for defining liver boundaries exist. In comparison, slice-by-slice based generation of the independent standard utilizing a live wire tool took 70.1 min on average. A standard 2D segmentation refinement approach applied to all twenty data sets required on average 38.2 min of user interaction
A third-generation dispersion and third-generation hydrogen bonding corrected PM6 method
DEFF Research Database (Denmark)
Kromann, Jimmy Charnley; Christensen, Anders Steen; Svendsen, Casper Steinmann
2014-01-01
We present new dispersion and hydrogen bond corrections to the PM6 method, PM6-D3H+, and its implementation in the GAMESS program. The method combines the DFT-D3 dispersion correction by Grimme et al. with a modified version of the H+ hydrogen bond correction by Korth. Overall, the interaction...... in GAMESS, while the corresponding numbers for PM6-DH+ implemented in MOPAC are 54, 17, 15, and 2. The PM6-D3H+ method as implemented in GAMESS offers an attractive alternative to PM6-DH+ in MOPAC in cases where the LBFGS optimizer must be used and a vibrational analysis is needed, e.g., when computing...... vibrational free energies. While the GAMESS implementation is up to 10 times slower for geometry optimizations of proteins in bulk solvent, compared to MOPAC, it is sufficiently fast to make geometry optimizations of small proteins practically feasible....
Dangi, Shusil; Linte, Cristian A.
2017-03-01
Segmentation of right ventricle from cardiac MRI images can be used to build pre-operative anatomical heart models to precisely identify regions of interest during minimally invasive therapy. Furthermore, many functional parameters of right heart such as right ventricular volume, ejection fraction, myocardial mass and thickness can also be assessed from the segmented images. To obtain an accurate and computationally efficient segmentation of right ventricle from cardiac cine MRI, we propose a segmentation algorithm formulated as an energy minimization problem in a graph. Shape prior obtained by propagating label from an average atlas using affine registration is incorporated into the graph framework to overcome problems in ill-defined image regions. The optimal segmentation corresponding to the labeling with minimum energy configuration of the graph is obtained via graph-cuts and is iteratively refined to produce the final right ventricle blood pool segmentation. We quantitatively compare the segmentation results obtained from our algorithm to the provided gold-standard expert manual segmentation for 16 cine-MRI datasets available through the MICCAI 2012 Cardiac MR Right Ventricle Segmentation Challenge according to several similarity metrics, including Dice coefficient, Jaccard coefficient, Hausdorff distance, and Mean absolute distance error.
Porcelain surface alterations and refinishing after use of two orthodontic bonding methods.
Herion, Drew T; Ferracane, Jack L; Covell, David A
2010-01-01
To compare porcelain surfaces at debonding after use of two surface preparation methods and to evaluate a method for restoring the surface. Lava Ceram feldspathic porcelain discs (n = 40) underwent one of two surface treatments prior to bonding orthodontic brackets. Half the discs had sandblasting, hydrofluoric acid, and silane (SB + HF + S), and the other half, phosphoric acid and silane (PA + S). Brackets were debonded using bracket removing pliers, and resin was removed with a 12-fluted carbide bur. The surface was refinished using a porcelain polishing kit, followed by diamond polishing paste. Measurements for surface roughness (Ra), gloss, and color were made before bonding (baseline), after debonding, and after each step of refinishing. Surfaces were also examined by scanning electron microscopy (SEM). Data was analyzed with 2-way ANOVA followed by Tukey HSD tests (alpha = 0.05). The SB + HF + S bonding method increased Ra (0.160 to 1.121 microm), decreased gloss (41.3 to 3.7) and altered color (DeltaE = 4.37; P gloss (41.7 to 38.0) and color (DeltaE = 0.50). The measurements and SEM observations showed that changes were fully restored to baseline with refinishing. The PA + S method caused significantly less damage to porcelain than the SB + HF + S method. The refinishing protocol fully restored the porcelain surfaces.
Schoppen, Hendrik Sietze
2017-01-01
The Impact of Brands on People, Markets and Society Build Bridge Bond Method for Sustainable Brand Leadership Authorized translation of the chapter ‘Impact of brands on people, markets and society’ (prepublication Build Bridge Bond, method for sustainable leadership and building future-proof trust)
Directory of Open Access Journals (Sweden)
Soghra Yassaei
2015-10-01
Full Text Available Objectives: Providing reliable attachment between bracket base and zirconia surface is a prerequisite for exertion of orthodontic force. The purpose of the present study was to eval- uate the effect of four zirconium surface treatment methods on shear bond strength (SBS of orthodontic brackets.Materials and Methods: One block of zirconium was trimmed into four zirconium sur- faces, which served as our four study groups and each had 18 metal brackets bonded to them. Once the glazed layer was removed, the first group was etched with 9.6% hydrofluoric acid (HF, and the other three groups were prepared by means of sandblasting and 1 W, and 2 W Er: YAG laser, respectively. After application of silane, central incisor brackets were bonded to the zirconium surfaces. The SBS values were measured by a Dartec testing ma- chine with a crosshead speed of 1 mm/min.Results: The highest SBS was achieved in the sandblasted group (7.81±1.02 MPa followed in a descending order by 2 W laser group (6.95±0.87 MPa, 1 W laser group (6.87±0.92MPa and HF acid etched group (5.84±0.78 MPa. The differences between the study groups, were statistically significant except between the laser groups (P < 0.05. Conclusion: In terms of higher bond strength and safety, sandblasting and Er: YAG laser irradiation with power output of 1 W and 2 W can be considered more appropriate alterna- tives to HF acid etching for zirconium surface treatment prior to bracket bonding.
On a conjecture concerning helly circle graphs
Directory of Open Access Journals (Sweden)
Durán Guillermo
2003-01-01
Full Text Available We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and inequations which represents the structure of G, in such a way that G is an e-circle graph if and only if S has a solution. In fact, e-circle graphs are exactly the circle graphs (intersection graphs of chords in a circle, and thus this method provides an analytic way for recognizing circle graphs. A graph G is a Helly circle graph if G is a circle graph and there exists a model of G by chords such that every three pairwise intersecting chords intersect at the same point. A conjecture by Durán (2000 states that G is a Helly circle graph if and only if G is a circle graph and contains no induced diamonds (a diamond is a graph formed by four vertices and five edges. Many unsuccessful efforts - mainly based on combinatorial and geometrical approaches - have been done in order to validate this conjecture. In this work, we utilize the ideas behind the definition of e-circle graphs and restate this conjecture in terms of an equivalence between two systems of equations and inequations, providing a new, analytic tool to deal with it.
Semantic graphs and associative memories
Pomi, Andrés; Mizraji, Eduardo
2004-12-01
Graphs have been increasingly utilized in the characterization of complex networks from diverse origins, including different kinds of semantic networks. Human memories are associative and are known to support complex semantic nets; these nets are represented by graphs. However, it is not known how the brain can sustain these semantic graphs. The vision of cognitive brain activities, shown by modern functional imaging techniques, assigns renewed value to classical distributed associative memory models. Here we show that these neural network models, also known as correlation matrix memories, naturally support a graph representation of the stored semantic structure. We demonstrate that the adjacency matrix of this graph of associations is just the memory coded with the standard basis of the concept vector space, and that the spectrum of the graph is a code invariant of the memory. As long as the assumptions of the model remain valid this result provides a practical method to predict and modify the evolution of the cognitive dynamics. Also, it could provide us with a way to comprehend how individual brains that map the external reality, almost surely with different particular vector representations, are nevertheless able to communicate and share a common knowledge of the world. We finish presenting adaptive association graphs, an extension of the model that makes use of the tensor product, which provides a solution to the known problem of branching in semantic nets.
Graph anomalies in cyber communications
Energy Technology Data Exchange (ETDEWEB)
Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory
2011-01-11
Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.
Wu, Hai-miao; Zhao, Bin-jiao; Chen, Dong
2015-06-01
To compare the shear bond strength (SBS) of rebonded orthodontic metal brackets with different resin removal methods. Forty extracted premolars were chosen as samples and divided into 4 experimental groups. The teeth were bonded with brackets. The brackets from 3 groups were debonded while adhesive remnants were removed from bracket bases by methods of grinding, sandblasting, and direct flaming, respectively and then rebonded. The SBS values of all rebonded brackets were determined after pH cycling experiment for 30 days. Some rebonded bracket bases were selected and observed under scanning electron microscope (SEM). The data was analyzed by one-way ANOVA test using SPSS 13.0 software package. Statistical analysis revealed a significant difference of SBS values among the 4 experimental groups (Pbrackets after resin removal by grinding and sandblasting have a similar SBS compared to the initial brackets adhesive.
Engineering system dynamics a unified graph-centered approach
Brown, Forbes T
2006-01-01
For today's students, learning to model the dynamics of complex systems is increasingly important across nearly all engineering disciplines. First published in 2001, Forbes T. Brown's Engineering System Dynamics: A Unified Graph-Centered Approach introduced students to a unique and highly successful approach to modeling system dynamics using bond graphs. Updated with nearly one-third new material, this second edition expands this approach to an even broader range of topics. What's New in the Second Edition? In addition to new material, this edition was restructured to build students' competence in traditional linear mathematical methods before they have gone too far into the modeling that still plays a pivotal role. New topics include magnetic circuits and motors including simulation with magnetic hysteresis; extensive new material on the modeling, analysis, and simulation of distributed-parameter systems; kinetic energy in thermodynamic systems; and Lagrangian and Hamiltonian methods. MATLAB(R) figures promi...
Graph theory and its applications
Gross, Jonathan L
2006-01-01
Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.
Ogliari, Fabrício Aulo; da Silva, Eduardo de Oliveira; Lima, Giana da Silveira; Madruga, Francine Cardozo; Henn, Sandrina; Bueno, Márcia; Ceschi, Marco Antônio; Petzhold, Cesar Liberato; Piva, Evandro
2008-03-01
The aim of this study was to synthesize an acidic monomer using an alternative synthetic pathway and to evaluate the influence of the acidic monomer concentration on the microtensile bond strength to dentin. The intermediary 5-hydroxypentyl methacrylate (HPMA) was synthesized through methacrylic acid esterification with 1,5-pentanediol, catalyzed by p-toluenesulfonic acid. To displace the reaction balance, the water generated by esterification was removed by three different methods: anhydrous sodium sulfate; molecular sieves or azeotropic distillation. In the next step, a phosphorus pentoxide (4.82 mmol) slurry was formed in cold acetone and 29 mmol of HPMA was slowly added by funnel addition. After the reaction ended, solvent was evaporated and the product was characterized by 1HNMR and FTIR. The phosphate monomer was introduced in a self-etch primer at concentrations of 0, 15, 30, 50, 70 and 100 wt%. Clearfil SE Bond was used as commercial reference. Microtensile bond strength to dentin was evaluated 24h after the bonding procedures, followed by fracture analysis (n=20). Data was submitted to ANOVA and Tukey's post hoc test. The highest yield was obtained (62%) when azeotropic distillation was used, while the reaction with molecular sieves was not feasible. The phosphoric moiety attachment to the monomer was successfully performed with a quantitative yield that reached around 100%. The acidic monomer concentration significantly affected the bond strength and the highest mean (55.1+/-12.8 MPa) was obtained when 50% of acidic monomer was used. The synthesis pathways described in the present study appear to be a viable alternative for developing phosphate monomers.
International Nuclear Information System (INIS)
Du, Xia; Zhao, Dong-Xia; Yang, Zhong-Zhi
2013-01-01
Highlights: ► A method from new respect to characterize and measure the bond strength is proposed. ► We calculate the D pb of a series of various bonds to justify our approach. ► A quite good linear relationship of the D pb with the bond lengths for series of various bonds is shown. ► Take the prediction of strengths of C–H and N–H bonds for base pairs in DNA as a practical application of our method. - Abstract: A new approach to characterize and measure bond strength has been developed. First, we propose a method to accurately calculate the potential acting on an electron in a molecule (PAEM) at the saddle point along a chemical bond in situ, denoted by D pb . Then, a direct method to quickly evaluate bond strength is established. We choose some familiar molecules as models for benchmarking this method. As a practical application, the D pb of base pairs in DNA along C–H and N–H bonds are obtained for the first time. All results show that C 7 –H of A–T and C 8 –H of G–C are the relatively weak bonds that are the injured positions in DNA damage. The significance of this work is twofold: (i) A method is developed to calculate D pb of various sizable molecules in situ quickly and accurately; (ii) This work demonstrates the feasibility to quickly predict the bond strength in macromolecules
Fibonacci number of the tadpole graph
Directory of Open Access Journals (Sweden)
Joe DeMaio
2014-10-01
Full Text Available In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2 and the Fibonacci number of the cycle graph Cn is the Lucas number Ln. The tadpole graph Tn,k is the graph created by concatenating Cn and Pk with an edge from any vertex of Cn to a pendant of Pk for integers n=3 and k=0. This paper establishes formulae and identities for the Fibonacci number of the tadpole graph via algebraic and combinatorial methods.
Buck-Boost DC-DC Converter Control by Using the Extracted Model from Signal Flow Graph Method
Mohammadian, Leila; Babaei, Ebrahim; Bannae Sharifian, Mohammad Bagher
2015-01-01
In this paper, the signal flow graph technique and Mason gain formula are applied for extracting the model and transfer functions from control to output and from input to output of a buck-boost converter. In order to investigate a controller necessity for the converter of assumed parameters, the frequency and time domain analysis are done and the open loop system characteristics are verified and the needed closed loop controlled system specifications are determined. Finally designing a contro...
Pragmatic Graph Rewriting Modifications
Rodgers, Peter; Vidal, Natalia
1999-01-01
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified a...
Schmage, P; Nergiz, [No Value; Herrmann, W; Ozcan, M; Nergiz, Ibrahim; ï¿½zcan, Mutlu
With the increase in adult orthodontic treatment comes the need to find a reliable method for bonding orthodontic brackets onto metal or ceramic crowns and fixed partial dentures. In this study, shear bond strength and surface roughness tests were used to examine the effect of 4 different surface
An adhesive bonding method with microfabricating micro pillars to prevent clogging in a microchannel
International Nuclear Information System (INIS)
Chen, Pin-Chuan; Liu, Yu-Min; Chou, Huang-Chieh
2016-01-01
Thermoplastics are widely used in the fabrication of microfluidic chips, due to their low cost, flexibility in manufacturing, and applicability in large-scale production. This paper presents a novel bonding method for the assembly of thermoplastic microfluidic chips, with the aim of preventing the flow of UV adhesive into microchannels during the bonding process. The proposed bonding methodology depends primarily on controlling the thickness of the UV adhesive, which is achieved by using spin-coating for the uniform UV adhesive in conjunction with the microfabrication of short pillars for keeping a uniform gap between the two bonded surfaces. In this study, two devices with serpentine microchannels (cross-sectional area of 500 μm × 500 μm and 200 μm × 200 μm) were fabricated on PMMA substrates using a micromilling machine, whereupon a hydrophobic coating was applied to the walls of 200 μm × 200 μm microchannels in order to prevent clogging, which might otherwise be caused by the seepage of UV adhesive into the channels. A variety of experiments were used to characterize the quality of bonding, the results of which reveal the following: (1) no leakage was observed in either of the microfluidic chips; (2) the hydrophobic coating proved highly effective in preventing the flow of UV adhesive into the smaller microchannels; (3) the average amount of clogging inside 500 μm × 500 μm microchannels was 1.13% with standard deviation of 0.55%, while the average amount of clogging inside 200 μm × 200 μm microchannels was 1.65% with standard deviation of 0.92%; (4) the average thickness of the UV adhesive in a 500 μm × 500 μm microfluidic chip was 32 μm with standard deviation of 2 μm, whereas the average thickness of the UV adhesive in a 200 μm × 200 μm microfluidic chip was 31 μm with standard deviation of 1.2 μm; (5) the two chips possess sufficient bonding strength to withstand
Particle transport in breathing quantum graph
International Nuclear Information System (INIS)
Matrasulov, D.U.; Yusupov, J.R.; Sabirov, K.K.; Sobirov, Z.A.
2012-01-01
Full text: Particle transport in nanoscale networks and discrete structures is of fundamental and practical importance. Usually such systems are modeled by so-called quantum graphs, the systems attracting much attention in physics and mathematics during past two decades [1-5]. During last two decades quantum graphs found numerous applications in modeling different discrete structures and networks in nanoscale and mesoscopic physics (e.g., see reviews [1-3]). Despite considerable progress made in the study of particle dynamics most of the problems deal with unperturbed case and the case of time-dependent perturbation has not yet be explored. In this work we treat particle dynamics for quantum star graph with time-dependent bonds. In particular, we consider harmonically breathing quantum star graphs, the cases of monotonically contracting and expanding graphs. The latter can be solved exactly analytically. Edge boundaries are considered to be time-dependent, while branching point is assumed to be fixed. Quantum dynamics of a particle in such graphs is studied by solving Schrodinger equation with time-dependent boundary conditions given on a star graph. Time-dependence of the average kinetic energy is analyzed. Space-time evolution of the Gaussian wave packet is treated for harmonically breathing star graph. It is found that for certain frequencies energy is a periodic function of time, while for others it can be non-monotonically growing function of time. Such a feature can be caused by possible synchronization of the particles motion and the motions of the moving edges of graph bonds. (authors) References: [1] Tsampikos Kottos and Uzy Smilansky, Ann. Phys., 76, 274 (1999). [2] Sven Gnutzmann and Uzy Smilansky, Adv. Phys. 55, 527 (2006). [3] S. GnutzmannJ.P. Keating, F. Piotet, Ann. Phys., 325, 2595 (2010). [4] P.Exner, P.Seba, P.Stovicek, J. Phys. A: Math. Gen. 21, 4009 (1988). [5] J. Boman, P. Kurasov, Adv. Appl. Math., 35, 58 (2005)
Bapat, Ravindra B
2014-01-01
This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...
Towards Rational Design Method for Strengthening of Concrete Structures by External Bonding
Directory of Open Access Journals (Sweden)
Furuuchi H.
2012-01-01
Full Text Available Many infrastructures need to be repaired or strengthened due to various reasons, such as unexpected deterioration and changes in performance requirement. This paper presents the following recent achievements by the authors’ group on design method for flexural strengthening of concrete structures by external bonding; (i fracture characteristics of interface between substrate concrete and cementitious overlay, (ii crack spacing of flexural strengthened beams, which affects debonding strength, (iii strengths of intermediate crack (IC debonding and end peeling, (iv strength of concrete cover separation, and (v effectiveness of strengthening by external bonding. A unified approach for flexural strengthening by steel plate, fiber reinforced polymer lami¬nate and cementitious overlay, for both intermediate crack (IC debonding, including end peeling, and concrete cover separation is pre¬sented with consideration of crack spacing in the streng¬thened members. Appropriate interfacial rough¬¬¬ness to achieve efficient interface bond property is clari¬fied and the concept of effectiveness of strengthen¬ing is proposed for better strengthening design.
Jurišić, Sanja; Jurišić, Gordan; Jurić, Hrvoje
2015-12-01
The objective of present study was to examine influence of adhesives and methods of enamel pretreatment on the shear bond strength (SBS) of orthodontic brackets. The adhesives used were resin-reinforced glass ionomer cements-GIC (Fuji Ortho LC) and composite resin (Transbond XT). The experimental sample consisted of 80 extracted human first premolars. The sample was divided into four equal groups, and the metal brackets were bonded with different enamel pretreatments by using two adhesives: group A-10% polyacrylic acid; Fuji Ortho LC, group B-37% phosphoric acid; Fuji Ortho LC, group C-self etching primer; Transbond XT, group D-37% phosphoric acid, primer; Transbond XT. SBS of brackets was measured. After debonding of brackets, the adhesive remnant index (ARI) was evaluated. After the statistical analysis of the collected data was performed (ANOVA; Sheffe post-hoc test), the results showed that significantly lower SBS of the group B was found in relation to the groups C (p=0.031) and D (p=0.026). The results of ARI were similar in all testing groups and it was not possible to determine any statistically significant difference of the ARI (Chi- square test) between all four experimental groups. The conclusion is that the use of composite resins material with appropriate enamel pretreatment according to manufacturer's recommendation is the "gold standard" for brackets bonding for fixed orthodontic appliances.
International Nuclear Information System (INIS)
Saito, S.; Fukaya, K.; Ishiyama, S.; Eto, M.; Sato, K.; Akiba, M.
1998-01-01
W (tungsten) and Cu (copper)-alloys, like oxygen free high thermal conductivity (OFHC)-copper or dispersion strengthened (DS)-copper, are candidate materials for plasma facing components(PFC) of TOKAMAK type fusion reactor as armor tile and heat sink, respectively. However, PFC are exposed to cyclic high heat load and heavy irradiation by 14 MeV neutrons. Under these conditions, thermal stresses at bonding interface and irradiation damage will decrease the bonding strength between W and Cu alloys. Therefore, it is necessary to develop a reliable bonding techniques in order to make PFC with enough integrity. We have applied the hot isostatic press (HIP) method to bond W with Cu-alloys. In this experiments, to optimize HIP bonding conditions, four point bending tests were performed for different bonding conditions at temperatures from R.T. to 873 K and we obtained an optimum HIP bonding condition for W and OFHC-Cu as 1273 SK x 2 hours x 98 ∼ 147 MPa. Tensile tests were also performed at the same temperature range. The tensile strength of the bonded W / Cu was almost equal to that of OFHC Cu which was HIPed at the same conditions. Tensile specimens were broken at the bonding interface or OFHC-Cu side. Bonding tests of W and DS-Cu showed that HIP was not successful because tungsten oxide was produced at the bonding interface and residual stresses were not relaxed. Therefore, it was concluded that some insert materials will be needed to bond W and DS-Cu. (author)
Adaptive Graph Convolutional Neural Networks
Li, Ruoyu; Wang, Sheng; Zhu, Feiyun; Huang, Junzhou
2018-01-01
Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for eac...
Directory of Open Access Journals (Sweden)
Taekjun Oh
2015-07-01
Full Text Available Localization is an essential issue for robot navigation, allowing the robot to perform tasks autonomously. However, in environments with laser scan ambiguity, such as long corridors, the conventional SLAM (simultaneous localization and mapping algorithms exploiting a laser scanner may not estimate the robot pose robustly. To resolve this problem, we propose a novel localization approach based on a hybrid method incorporating a 2D laser scanner and a monocular camera in the framework of a graph structure-based SLAM. 3D coordinates of image feature points are acquired through the hybrid method, with the assumption that the wall is normal to the ground and vertically flat. However, this assumption can be relieved, because the subsequent feature matching process rejects the outliers on an inclined or non-flat wall. Through graph optimization with constraints generated by the hybrid method, the final robot pose is estimated. To verify the effectiveness of the proposed method, real experiments were conducted in an indoor environment with a long corridor. The experimental results were compared with those of the conventional GMappingapproach. The results demonstrate that it is possible to localize the robot in environments with laser scan ambiguity in real time, and the performance of the proposed method is superior to that of the conventional approach.
An Association-Oriented Partitioning Approach for Streaming Graph Query
Directory of Open Access Journals (Sweden)
Yun Hao
2017-01-01
Full Text Available The volumes of real-world graphs like knowledge graph are increasing rapidly, which makes streaming graph processing a hot research area. Processing graphs in streaming setting poses significant challenges from different perspectives, among which graph partitioning method plays a key role. Regarding graph query, a well-designed partitioning method is essential for achieving better performance. Existing offline graph partitioning methods often require full knowledge of the graph, which is not possible during streaming graph processing. In order to handle this problem, we propose an association-oriented streaming graph partitioning method named Assc. This approach first computes the rank values of vertices with a hybrid approximate PageRank algorithm. After splitting these vertices with an adapted variant affinity propagation algorithm, the process order on vertices in the sliding window can be determined. Finally, according to the level of these vertices and their association, the partition where the vertices should be distributed is decided. We compare its performance with a set of streaming graph partition methods and METIS, a widely adopted offline approach. The results show that our solution can partition graphs with hundreds of millions of vertices in streaming setting on a large collection of graph datasets and our approach outperforms other graph partitioning methods.
Directory of Open Access Journals (Sweden)
C. Dalfo
2015-10-01
Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.
Guan, Yanpeng; Wang, Enzhi; Liu, Xiaoli; Wang, Sijing; Luan, Hebing
2017-08-03
We have attempted a multiscale and quantified characterization method of the contact in three-dimensional granular material made of spherical particles, particularly in cemented granular material. Particle contact is defined as a type of surface contact with voids in its surroundings, rather than a point contact. Macro contact is a particle contact set satisfying the restrictive condition of a two-dimensional manifold with a boundary. On the basis of graph theory, two dual geometrical systems are abstracted from the granular pack. The face and the face set, which satisfies the two-dimensional manifold with a boundary in the solid cell system, are extracted to characterize the particle contact and the macro contact, respectively. This characterization method is utilized to improve the post-processing in DEM (Discrete Element Method) from a micro perspective to describe the macro effect of the cemented granular material made of spherical particles. Since the crack has the same shape as its corresponding contact, this method is adopted to characterize the crack and realize its visualization. The integral failure route of the sample can be determined by a graph theory algorithm. The contact force is assigned to the weight value of the face characterizing the particle contact. Since the force vectors can be added, the macro contact force can be solved by adding the weight of its corresponding faces.
Alman, David E [Corvallis, OR; Wilson, Rick D [Corvallis, OR; Davis, Daniel L [Albany, OR
2011-03-08
This invention relates to a method for producing components with internal architectures, and more particularly, this invention relates to a method for producing structures with microchannels via the use of diffusion bonding of stacked laminates. Specifically, the method involves weakly bonding a stack of laminates forming internal voids and channels with a first generally low uniaxial pressure and first temperature such that bonding at least between the asperites of opposing laminates occurs and pores are isolated in interfacial contact areas, followed by a second generally higher isostatic pressure and second temperature for final bonding. The method thereby allows fabrication of micro-channel devices such as heat exchangers, recuperators, heat-pumps, chemical separators, chemical reactors, fuel processing units, and combustors without limitation on the fin aspect ratio.
Directory of Open Access Journals (Sweden)
Akkuş Emek
2015-07-01
Full Text Available Objectives: To compare the effects of airborne-particle abrasion (APA and tribochemical silica coating (TSC surface treatment methods on the shear bond strength of zirconia ceramics systems, resin cements and tooth surface
Soetevent, A.R.
2010-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial
Graphing Inequalities, Connecting Meaning
Switzer, J. Matt
2014-01-01
Students often have difficulty with graphing inequalities (see Filloy, Rojano, and Rubio 2002; Drijvers 2002), and J. Matt Switzer's students were no exception. Although students can produce graphs for simple inequalities, they often struggle when the format of the inequality is unfamiliar. Even when producing a correct graph of an…
Directory of Open Access Journals (Sweden)
Amine Labriji
2017-07-01
Full Text Available The topic of identifying the similarity of graphs was considered as highly recommended research field in the Web semantic, artificial intelligence, the shape recognition and information research. One of the fundamental problems of graph databases is finding similar graphs to a graph query. Existing approaches dealing with this problem are usually based on the nodes and arcs of the two graphs, regardless of parental semantic links. For instance, a common connection is not identified as being part of the similarity of two graphs in cases like two graphs without common concepts, the measure of similarity based on the union of two graphs, or the one based on the notion of maximum common sub-graph (SCM, or the distance of edition of graphs. This leads to an inadequate situation in the context of information research. To overcome this problem, we suggest a new measure of similarity between graphs, based on the similarity measure of Wu and Palmer. We have shown that this new measure satisfies the properties of a measure of similarities and we applied this new measure on examples. The results show that our measure provides a run time with a gain of time compared to existing approaches. In addition, we compared the relevance of the similarity values obtained, it appears that this new graphs measure is advantageous and offers a contribution to solving the problem mentioned above.
van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime
2016-01-01
This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,
Fuzzy Graph Language Recognizability
Kalampakas , Antonios; Spartalis , Stefanos; Iliadis , Lazaros
2012-01-01
Part 5: Fuzzy Logic; International audience; Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.
Brouwer, A.E.; Haemers, W.H.
2012-01-01
This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association
Yoo, Illhoi; Hu, Xiaohua; Song, Il-Yeol
2007-11-27
A huge amount of biomedical textual information has been produced and collected in MEDLINE for decades. In order to easily utilize biomedical information in the free text, document clustering and text summarization together are used as a solution for text information overload problem. In this paper, we introduce a coherent graph-based semantic clustering and summarization approach for biomedical literature. Our extensive experimental results show the approach shows 45% cluster quality improvement and 72% clustering reliability improvement, in terms of misclassification index, over Bisecting K-means as a leading document clustering approach. In addition, our approach provides concise but rich text summary in key concepts and sentences. Our coherent biomedical literature clustering and summarization approach that takes advantage of ontology-enriched graphical representations significantly improves the quality of document clusters and understandability of documents through summaries.
Directory of Open Access Journals (Sweden)
I. Harririan
2010-06-01
Full Text Available Objective: The aim of this study was to evaluate the bond strength between metal brackets and non-glazed ceramic with three different surface treatment methods.Materials and Methods: Forty-two non-glazed ceramic disks were assigned into three groups. Group I and II specimens were etched with 9.5% hydrofluoric acid. Subsequently in group I, silane and adhesive were applied and in group II, bonding agent was used only.In group III, specimens were treated with 35% phosphoric acid and then silane and adhesive were applied. Brackets were bonded with light-cured composites. The specimens were stored in water in room temperature for 24 hours and then thermocycled 500 times between 5°C and 55°C.Results: The difference of tensile bond strength between groups I and III was not significant(P=0.999. However, the tensile bond strength of group II was significantly lower than groups I, and III (P<0.001. The adhesive remnant index scores between the threegroups had statistically significant differences (P<0.001.Conclusion: With the application of scotch bond multi-purpose plus adhesive, we can use phosphoric acid instead of hydrofluoric acid for bonding brackets to non-glazed ceramic restorations.
The effective fragment molecular orbital method for fragments connected by covalent bonds.
Directory of Open Access Journals (Sweden)
Casper Steinmann
Full Text Available We extend the effective fragment molecular orbital method (EFMO into treating fragments connected by covalent bonds. The accuracy of EFMO is compared to FMO and conventional ab initio electronic structure methods for polypeptides including proteins. Errors in energy for RHF and MP2 are within 2 kcal/mol for neutral polypeptides and 6 kcal/mol for charged polypeptides similar to FMO but obtained two to five times faster. For proteins, the errors are also within a few kcal/mol of the FMO results. We developed both the RHF and MP2 gradient for EFMO. Compared to ab initio, the EFMO optimized structures had an RMSD of 0.40 and 0.44 Å for RHF and MP2, respectively.
Standard Test Method for Bond Strength of Ceramic Tile to Portland Cement Paste
American Society for Testing and Materials. Philadelphia
2002-01-01
1.1 This test method covers the determination of the ability of glazed ceramic wall tile, ceramic mosaic tile, quarry tile, and pavers to be bonded to portland cement paste. This test method includes both face-mounted and back-mounted tile. 1.2 The values stated in inch-pound units are to be regarded as standard. The values given in parentheses are mathematical conversions to SI units that are provided for information only and are not considered standard. 1.3 This standard does not purport to address all of the safety concerns, if any, associated with its use. It is the responsibility of the user of this standard to establish appropriate safety and health practices and determine the applicability of regulatory limitations prior to use.
Hell, Pavol
2004-01-01
This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colourings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics.Based on the authors' lecture notes for graduate courses, this book can be used as a textbook for a second course in graph theory at 4th year or master's level an
Directory of Open Access Journals (Sweden)
Spyridon Liakas
2017-08-01
Full Text Available The particulate discrete element method (DEM can be employed to capture the response of rock, provided that appropriate bonding models are used to cement the particles to each other. Simulations of laboratory tests are important to establish the extent to which those models can capture realistic rock behaviors. Hitherto the focus in such comparison studies has either been on homogeneous specimens or use of two-dimensional (2D models. In situ rock formations are often heterogeneous, thus exploring the ability of this type of models to capture heterogeneous material behavior is important to facilitate their use in design analysis. In situ stress states are basically three-dimensional (3D, and therefore it is important to develop 3D models for this purpose. This paper revisits an earlier experimental study on heterogeneous specimens, of which the relative proportions of weaker material (siltstone and stronger, harder material (sandstone were varied in a controlled manner. Using a 3D DEM model with the parallel bond model, virtual heterogeneous specimens were created. The overall responses in terms of variations in strength and stiffness with different percentages of weaker material (siltstone were shown to agree with the experimental observations. There was also a good qualitative agreement in the failure patterns observed in the experiments and the simulations, suggesting that the DEM data enabled analysis of the initiation of localizations and micro fractures in the specimens.
Simplicial complexes of graphs
Jonsson, Jakob
2008-01-01
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.
Introduction to quantum graphs
Berkolaiko, Gregory
2012-01-01
A "quantum graph" is a graph considered as a one-dimensional complex and equipped with a differential operator ("Hamiltonian"). Quantum graphs arise naturally as simplified models in mathematics, physics, chemistry, and engineering when one considers propagation of waves of various nature through a quasi-one-dimensional (e.g., "meso-" or "nano-scale") system that looks like a thin neighborhood of a graph. Works that currently would be classified as discussing quantum graphs have been appearing since at least the 1930s, and since then, quantum graphs techniques have been applied successfully in various areas of mathematical physics, mathematics in general and its applications. One can mention, for instance, dynamical systems theory, control theory, quantum chaos, Anderson localization, microelectronics, photonic crystals, physical chemistry, nano-sciences, superconductivity theory, etc. Quantum graphs present many non-trivial mathematical challenges, which makes them dear to a mathematician's heart. Work on qu...
Neuro-symbolic representation learning on biological knowledge graphs
AlShahrani, Mona; Khan, Mohammed Asif; Maddouri, Omar; Kinjo, Akira R; Queralt-Rosinach, Nú ria; Hoehndorf, Robert
2017-01-01
Biological data and knowledge bases increasingly rely on Semantic Web technologies and the use of knowledge graphs for data integration, retrieval and federated queries. In the past years, feature learning methods that are applicable to graph
Evaluating interaction energies of weakly bonded systems using the Buckingham-Hirshfeld method
Krishtal, A.; Van Alsenoy, C.; Geerlings, P.
2014-05-01
We present the finalized Buckingham-Hirshfeld method (BHD-DFT) for the evaluation of interaction energies of non-bonded dimers with Density Functional Theory (DFT). In the method, dispersion energies are evaluated from static multipole polarizabilities, obtained on-the-fly from Coupled Perturbed Kohn-Sham calculations and partitioned into diatomic contributions using the iterative Hirshfeld partitioning method. The dispersion energy expression is distributed over four atoms and has therefore a higher delocalized character compared to the standard pairwise expressions. Additionally, full multipolar polarizability tensors are used as opposed to effective polarizabilities, allowing to retain the anisotropic character at no additional computational cost. A density dependent damping function for the BLYP, PBE, BP86, B3LYP, and PBE0 functionals has been implemented, containing two global parameters which were fitted to interaction energies and geometries of a selected number of dimers using a bi-variate RMS fit. The method is benchmarked against the S22 and S66 data sets for equilibrium geometries and the S22x5 and S66x8 data sets for interaction energies around the equilibrium geometry. Best results are achieved using the B3LYP functional with mean average deviation values of 0.30 and 0.24 kcal/mol for the S22 and S66 data sets, respectively. This situates the BHD-DFT method among the best performing dispersion inclusive DFT methods. Effect of counterpoise correction on DFT energies is discussed.
Degree-based graph construction
International Nuclear Information System (INIS)
Kim, Hyunju; Toroczkai, Zoltan; Erdos, Peter L; Miklos, Istvan; Szekely, Laszlo A
2009-01-01
Degree-based graph construction is a ubiquitous problem in network modelling (Newman et al 2006 The Structure and Dynamics of Networks (Princeton Studies in Complexity) (Princeton, NJ: Princeton University Press), Boccaletti et al 2006 Phys. Rep. 424 175), ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects that are still open today. Here we give necessary and sufficient conditions for a sequence of nonnegative integers to be realized as a simple graph's degree sequence, such that a given (but otherwise arbitrary) set of connections from an arbitrarily given node is avoided. We then use this result to present a swap-free algorithm that builds all simple graphs realizing a given degree sequence. In a wider context, we show that our result provides a greedy construction method to build all the f-factor subgraphs (Tutte 1952 Can. J. Math. 4 314) embedded within K n setmn S k , where K n is the complete graph and S k is a star graph centred on one of the nodes. (fast track communication)
Directory of Open Access Journals (Sweden)
G. O. Magomedov
2017-01-01
Full Text Available Marshmallow is a sugar confectionary product with increased sugar content and energy value because of the significant content of carbohydrates, in particular sugar-sand. The main drawback of marshmallow is the rapid process of its drying during storage due to the crystallization of sucrose and the gradual removal of moisture from the product. A method for obtaining marshmallow without sugar on the basis of high-conversion glucose syrup. In the work, experimental studies were carried out to determine the content and ratio of free and bound forms of moisture in marshmallow on the basis of sugars and on the basis of high-conversion glucose syrup by Differential Scanning Calorimetry (DSC and Thermogravimetry (TG. To study the patterns of thermal effects on the properties of marshmallow samples, the non-isothermal analysis method and the synchronous thermal analysis instrument (TG-DTA / DSC of the STA 449 F3 Jupiter were used. In the process of thermal exposure, the samples decompose sugars and other organic compounds, as a result of which the sample weight decreases due to evaporation of moisture. The process of dehydration in a control sample of marshmallow using sugar occurs in a less wide temperature range than in a sample of marshmallow on the basis of high-conversion glucose syrup, which indicates a greater degree of moisture bonding in the developed sample. A quantitative evaluation of the forms of moisture bonding in the samples was carried out using the experimental curves obtained by the TG method. From the temperature curves, the endothermic effects were determined, which correspond to the release of moisture with different forms and energies. Substitution of sugar for treacle in the formula of marshmallow reduces the share of free moisture and increases the safety of the product without signs of staling.
Imai, Arisa; Takamizawa, Toshiki; Sai, Keiichi; Tsujimoto, Akimasa; Nojiri, Kie; Endo, Hajime; Barkmeier, Wayne W; Latta, Mark A; Miyazaki, Masashi
2017-10-01
The aim of the present study was to determine the influence of different adhesive application methods and etching modes on enamel bond effectiveness of universal adhesives using shear bond strength (SBS) testing and surface free-energy (SFE) measurements. The adhesives Scotchbond Universal, All-Bond Universal, Adhese Universal, and G-Premio Bond were used. Prepared bovine enamel specimens were divided into four groups, based on type of adhesive, and subjected to the following surface treatments: (i) total-etch mode with active application; (ii) total-etch mode with inactive application; (iii) self-etch mode with active application; and (iv) self-etch mode with inactive application. Bonded specimens were subjected to SBS testing. The SFE of the enamel surfaces with adhesive was measured after rinsing with acetone and water. The SBS values in total-etch mode were significantly higher than those in self-etch mode. In total-etch mode, significantly lower SBS values were observed with active application compared with inactive application; in contrast, in self-etch mode there were no significant differences in SBS between active and inactive applications. A reduction in total SFE was observed for active application compared with inactive application. The interaction between etching mode and application method was statistically significant, and the application method significantly affected enamel bond strength in total-etch mode. © 2017 Eur J Oral Sci.
Investigation of Surface Pre-Treatment Methods for Wafer-Level Cu-Cu Thermo-Compression Bonding
Directory of Open Access Journals (Sweden)
Koki Tanaka
2016-12-01
Full Text Available To increase the yield of the wafer-level Cu-Cu thermo-compression bonding method, certain surface pre-treatment methods for Cu are studied which can be exposed to the atmosphere before bonding. To inhibit re-oxidation under atmospheric conditions, the reduced pure Cu surface is treated by H2/Ar plasma, NH3 plasma and thiol solution, respectively, and is covered by Cu hydride, Cu nitride and a self-assembled monolayer (SAM accordingly. A pair of the treated wafers is then bonded by the thermo-compression bonding method, and evaluated by the tensile test. Results show that the bond strengths of the wafers treated by NH3 plasma and SAM are not sufficient due to the remaining surface protection layers such as Cu nitride and SAMs resulting from the pre-treatment. In contrast, the H2/Ar plasma–treated wafer showed the same strength as the one with formic acid vapor treatment, even when exposed to the atmosphere for 30 min. In the thermal desorption spectroscopy (TDS measurement of the H2/Ar plasma–treated Cu sample, the total number of the detected H2 was 3.1 times more than the citric acid–treated one. Results of the TDS measurement indicate that the modified Cu surface is terminated by chemisorbed hydrogen atoms, which leads to high bonding strength.
Efficient dynamic graph construction for inductive semi-supervised learning.
Dornaika, F; Dahbi, R; Bosaghzadeh, A; Ruichek, Y
2017-10-01
Most of graph construction techniques assume a transductive setting in which the whole data collection is available at construction time. Addressing graph construction for inductive setting, in which data are coming sequentially, has received much less attention. For inductive settings, constructing the graph from scratch can be very time consuming. This paper introduces a generic framework that is able to make any graph construction method incremental. This framework yields an efficient and dynamic graph construction method that adds new samples (labeled or unlabeled) to a previously constructed graph. As a case study, we use the recently proposed Two Phase Weighted Regularized Least Square (TPWRLS) graph construction method. The paper has two main contributions. First, we use the TPWRLS coding scheme to represent new sample(s) with respect to an existing database. The representative coefficients are then used to update the graph affinity matrix. The proposed method not only appends the new samples to the graph but also updates the whole graph structure by discovering which nodes are affected by the introduction of new samples and by updating their edge weights. The second contribution of the article is the application of the proposed framework to the problem of graph-based label propagation using multiple observations for vision-based recognition tasks. Experiments on several image databases show that, without any significant loss in the accuracy of the final classification, the proposed dynamic graph construction is more efficient than the batch graph construction. Copyright © 2017 Elsevier Ltd. All rights reserved.
Khoroushi, Maryam; Sheikhi, Mohammadreza; Khalilian-Gourtani, Amirhossein; Soleimani, Bahram
2016-07-01
Different studies have used different tests to evaluate bond strength of resin cements to root dentin. In this in vitrostudy, three different tests were used to evaluate the bond strength of two resin cements to root dentin using two root dentin irrigation protocols. Ninety-six intact single-rooted teeth were selected for this study. Forty-eight teeth, with a root length of 15mm, were randomly divided into two groups and irrigated with normal saline or 2.5% sodium hypochlorite solutions during root canal preparation, respectively. For each 12 specimens from each group, fiber post #1 was bonded using an etch-and-rinse (Duo-Link) and a self-adhesive (BisCem) resin cement, respectively. After incubation, two specimens were prepared for the push-out test from the middle thirds of the roots. In another 24 teeth, after two 1.5-mm sections were prepared from the middle thirds of the prepared roots, sections of the post were bonded in two subgroups with each of the cements mentioned above and the samples were prepared for the pull-out test. For shear test, the crowns of 48 teeth were cut away, the dentin surfaces were prepared, the two irrigation solutions were used, and the resin cements were bonded. Data collected from the three tests were evaluated by ANOVA, post-hoc Tukey and Weibull tests (α=0.05). There were significant differences in the mean bond strength values between the three bond strength tests (Pstrength in all tests (P>0.05). Under the limitations of the present study, the method of the test used had an effect on the recorded bond strength between the resin cement and root dentin. Cement type and irrigation protocol resulted in similar variations with all the tests. Push-out and shear tests exhibited more coherent results. Bond strength, endodontically treated tooth, fiber post, resin cement, sodium hypochlorite.
Young, Jerry Wayne
The purpose of this study was to determine the effects of four instructional methods (direct instruction, computer-aided instruction, video observation, and microcomputer-based lab activities), gender, and time of testing (pretest, immediate posttest for determining the immediate effect of instruction, and a delayed posttest two weeks later to determine the retained effect of the instruction) on the achievement of sixth graders who were learning to interpret graphs of displacement and velocity. The dependent variable of achievement was reflected in the scores earned by students on a testing instrument of established validity and reliability. The 107 students participating in the study were divided by gender and were then randomly assigned to the four treatment groups, each taught by a different teacher. Each group had approximately equal numbers of males and females. The students were pretested and then involved in two class periods of the instructional method which was unique to their group. Immediately following treatment they were posttested and two weeks later they were posttested again. The data in the form of test scores were analyzed with a two-way split-plot analysis of variance to determine if there was significant interaction among technique, gender, and time of testing. When significant interaction was indicated, the Tukey HSD test was used to determine specific mean differences. The results of the analysis indicated no gender effect. Only students in the direct instruction group and the microcomputer-based laboratory group had significantly higher posttest-1 scores than pretest scores. They also had significantly higher posttest-2 scores than pretest scores. This suggests that the learning was retained. The other groups experienced no significant differences among pretest, posttest-1, and posttest-2 scores. Recommendations are that direct instruction and microcomputer-based laboratory activities should be considered as effective stand-alone methods for
Inferring ontology graph structures using OWL reasoning
Rodriguez-Garcia, Miguel Angel
2018-01-05
Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies\\' semantic content remains a challenge.We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies\\' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph .Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.
Inferring ontology graph structures using OWL reasoning.
Rodríguez-García, Miguel Ángel; Hoehndorf, Robert
2018-01-05
Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies' semantic content remains a challenge. We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph . Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.
Valandro, Luiz F.; Ozcan, Mutlu; Amaral, Regina; Vanderlei, Aleska; Bottino, Marco A.
2008-01-01
This study tested the bond strength of a resin cement to a glass-infiltrated zirconia-alumina ceramic after three conditioning methods and using two test methods (shear-SBS versus microtensile-MTBS). Ceramic blocks for MTBS and ceramic disks for SBS were fabricated. Three surface conditioning (SC)
International Nuclear Information System (INIS)
Saitoh, Y.; Takeuchi, H.; Mandai, M.; Kanazawa, H.; Yamanaka, J.; Miyahara, S.; Kamiya, M.; Fujita, Y.; Higashi, Y.; Ikeda, H.; Ikeda, M.; Koike, S.; Matsuda, T.; Ozaki, H.; Tanaka, M.; Tsuboyama, T.; Avrillon, S.; Okuno, S.; Haba, J.; Hanai, H.; Mori, S.; Yusa, K.; Fukunaga, C.
1994-01-01
Full-size models of a detector unit for a silicon micro-vertex detector were built for the KEK B factory. The Flip-Chip Bonding (FCB) method using a new type anisotropic conductive film was examined. The structure using the FCB method successfully provides a new architecture for the silicon micro-vertex detector unit. (orig.)
Chartrand, Gary
1984-01-01
Graph theory is used today in the physical sciences, social sciences, computer science, and other areas. Introductory Graph Theory presents a nontechnical introduction to this exciting field in a clear, lively, and informative style. Author Gary Chartrand covers the important elementary topics of graph theory and its applications. In addition, he presents a large variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics. Ten major topics - profusely illustrated - include: Mathematical Models, Elementary Concepts of Grap
Gao, Jian; Chu, Geng; He, Meng; Zhang, Shu; Xiao, RuiJuan; Li, Hong; Chen, LiQuan
2014-08-01
Inorganic solid electrolytes have distinguished advantages in terms of safety and stability, and are promising to substitute for conventional organic liquid electrolytes. However, low ionic conductivity of typical candidates is the key problem. As connective diffusion path is the prerequisite for high performance, we screen for possible solid electrolytes from the 2004 International Centre for Diffraction Data (ICDD) database by calculating conduction pathways using Bond Valence (BV) method. There are 109846 inorganic crystals in the 2004 ICDD database, and 5295 of them contain lithium. Except for those with toxic, radioactive, rare, or variable valence elements, 1380 materials are candidates for solid electrolytes. The rationality of the BV method is approved by comparing the existing solid electrolytes' conduction pathways we had calculated with those from experiments or first principle calculations. The implication for doping and substitution, two important ways to improve the conductivity, is also discussed. Among them Li2CO3 is selected for a detailed comparison, and the pathway is reproduced well with that based on the density functional studies. To reveal the correlation between connectivity of pathways and conductivity, α/ γ-LiAlO2 and Li2CO3 are investigated by the impedance spectrum as an example, and many experimental and theoretical studies are in process to indicate the relationship between property and structure. The BV method can calculate one material within a few minutes, providing an efficient way to lock onto targets from abundant data, and to investigate the structure-property relationship systematically.
Adriaan R. Soetevent
2010-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial discontinuities in firm-level demand may occur. I show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs. I conjecture that this non-existence result holds...
Pim Heijnen; Adriaan Soetevent
2014-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. We derive an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. These graph models of price competition may lead to spatial discontinuities in firm-level demand. We show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs and conjecture that this non-existence result holds more general...
Directory of Open Access Journals (Sweden)
Aleks Kissinger
2014-03-01
Full Text Available String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes ("bang boxes", on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.
Gelfand, I M; Shnol, E E
1969-01-01
The second in a series of systematic studies by a celebrated mathematician I. M. Gelfand and colleagues, this volume presents students with a well-illustrated sequence of problems and exercises designed to illuminate the properties of functions and graphs. Since readers do not have the benefit of a blackboard on which a teacher constructs a graph, the authors abandoned the customary use of diagrams in which only the final form of the graph appears; instead, the book's margins feature step-by-step diagrams for the complete construction of each graph. The first part of the book employs simple fu
Creating more effective graphs
Robbins, Naomi B
2012-01-01
A succinct and highly readable guide to creating effective graphs The right graph can be a powerful tool for communicating information, improving a presentation, or conveying your point in print. If your professional endeavors call for you to present data graphically, here's a book that can help you do it more effectively. Creating More Effective Graphs gives you the basic knowledge and techniques required to choose and create appropriate graphs for a broad range of applications. Using real-world examples everyone can relate to, the author draws on her years of experience in gr
Energy Technology Data Exchange (ETDEWEB)
Lothian, Joshua [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sullivan, Blair D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baker, Matthew B. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Schrock, Jonathan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Poole, Stephen W. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2013-10-01
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of different application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.
DEFF Research Database (Denmark)
Mansutti, Alessio; Miculan, Marino; Peressotti, Marco
2017-01-01
We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly...... also problems which are “mixed” instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide formal translation of SGI, RLPM, and GS into LGSs, and we give...
Czech Academy of Sciences Publication Activity Database
Kříž, Jaroslav; Dybal, Jiří
2008-01-01
Roč. 265, č. 1 (2008), s. 225-232 ISSN 1022-1360. [European Symposium on Polymer Spectroscopy /17./. Seggauberg Leibnitz, 09.9.2007-12.09.2007] R&D Projects: GA AV ČR IAA400500604 Institutional research plan: CEZ:AV0Z40500505 Keywords : cooperative bonding * hydrogen bond * NMR * poly(4-vinylphenol) Subject RIV: CD - Macromolecular Chemistry
Application of graph theory to the morphological analysis of settlements
Szmytkie Robert
2017-01-01
In the following paper, the analyses of morphology of settlements were conducted using graph methods. The intention of the author was to create a quantifiable and simple measure, which, in a quantitative way, would express the degree of development of a graph (the spatial pattern of settlement). When analysing examples of graphs assigned to a set of small towns and large villages, it was noticed that the graph development index should depend on: a relative number of edges in relation to the n...
Pixels to Graphs by Associative Embedding
Newell, Alejandro
2017-06-22
Graphs are a useful abstraction of image content. Not only can graphs represent details about individual objects in a scene but they can capture the interactions between pairs of objects. We present a method for training a convolutional neural network such that it takes in an input image and produces a full graph. This is done end-to-end in a single stage with the use of associative embeddings. The network learns to simultaneously identify all of the elements that make up a graph and piece them together. We benchmark on the Visual Genome dataset, and report a Recall@50 of 9.7% compared to the prior state-of-the-art at 3.4%, a nearly threefold improvement on the challenging task of scene graph generation.
Effective Fragment Potential Method for H-Bonding: How To Obtain Parameters for Nonrigid Fragments.
Dubinets, Nikita; Slipchenko, Lyudmila V
2017-07-20
Accuracy of the effective fragment potential (EFP) method was explored for describing intermolecular interaction energies in three dimers with strong H-bonded interactions, formic acid, formamide, and formamidine dimers, which are a part of HBC6 database of noncovalent interactions. Monomer geometries in these dimers change significantly as a function of intermonomer separation. Several EFP schemes were considered, in which fragment parameters were prepared for a fragment in its gas-phase geometry or recomputed for each unique fragment geometry. Additionally, a scheme in which gas-phase fragment parameters are shifted according to relaxed fragment geometries is introduced and tested. EFP data are compared against the coupled cluster with single, double, and perturbative triple excitations (CCSD(T)) method in a complete basis set (CBS) and the symmetry adapted perturbation theory (SAPT). All considered EFP schemes provide a good agreement with CCSD(T)/CBS for binding energies at equilibrium separations, with discrepancies not exceeding 2 kcal/mol. However, only the schemes that utilize relaxed fragment geometries remain qualitatively correct at shorter than equilibrium intermolecular distances. The EFP scheme with shifted parameters behaves quantitatively similar to the scheme in which parameters are recomputed for each monomer geometry and thus is recommended as a computationally efficient approach for large-scale EFP simulations of flexible systems.
Energy Technology Data Exchange (ETDEWEB)
Pérez, Germán, E-mail: german.perez.pichel@gmail.com; Mitteau, Raphaël; Eaton, Russell; Raffray, René
2015-12-15
Highlights: • Bonding defects at the ITER first wall beryllium armour are studied. • Experimental and analytical methods are combined. • Models supporting test results interpretation are proposed. • Guidelines for new experimental protocols are suggested. • Contribution to the definition of defects acceptance criteria. - Abstract: The reliability of the plasma facing components (PFCs) is essential for the efficient plasma operation in a fusion machine. This concerns especially the bond between the armour tiles facing the plasma and the heat sink material (copper alloy). The different thermal expansions of the bonded materials cause a stress distribution in the bond, which peaks at the bond edge. Under cyclic heat flux and accounting for the possible presence of bonding defects, this stress could reach a level where the component might be jeopardised. Because of the complexity of describing realistically by analyses and models the stress evolution in the bond, “design by experiments” is the main procedure for defining and qualifying the armour joint. Most of the existing plasma operation know-how on actively cooled PFCs has been obtained with carbon composite armour tiles. In ITER, the tiles of the first wall are made out of beryllium, which means that the know-how is progressively adapted to this specific bimetallic pair. Nonetheless, analyses are still performed for supporting the R&D experimental programme. This paper: explores methods for combining experimental results with finite element and statistical analyses; benchmarks test results; proposes hypothesis and rationales consistent with test results interpretations; suggests guidelines for defining possible further experimental protocols; and contributes to the definition of defects acceptance criteria.
International Nuclear Information System (INIS)
Pérez, Germán; Mitteau, Raphaël; Eaton, Russell; Raffray, René
2015-01-01
Highlights: • Bonding defects at the ITER first wall beryllium armour are studied. • Experimental and analytical methods are combined. • Models supporting test results interpretation are proposed. • Guidelines for new experimental protocols are suggested. • Contribution to the definition of defects acceptance criteria. - Abstract: The reliability of the plasma facing components (PFCs) is essential for the efficient plasma operation in a fusion machine. This concerns especially the bond between the armour tiles facing the plasma and the heat sink material (copper alloy). The different thermal expansions of the bonded materials cause a stress distribution in the bond, which peaks at the bond edge. Under cyclic heat flux and accounting for the possible presence of bonding defects, this stress could reach a level where the component might be jeopardised. Because of the complexity of describing realistically by analyses and models the stress evolution in the bond, “design by experiments” is the main procedure for defining and qualifying the armour joint. Most of the existing plasma operation know-how on actively cooled PFCs has been obtained with carbon composite armour tiles. In ITER, the tiles of the first wall are made out of beryllium, which means that the know-how is progressively adapted to this specific bimetallic pair. Nonetheless, analyses are still performed for supporting the R&D experimental programme. This paper: explores methods for combining experimental results with finite element and statistical analyses; benchmarks test results; proposes hypothesis and rationales consistent with test results interpretations; suggests guidelines for defining possible further experimental protocols; and contributes to the definition of defects acceptance criteria.
Vahid Dastjerdi, Elahe; Khaloo, Negar; Mojahedi, Seyed Masoud; Azarsina, Mohadese
2015-11-01
Bleaching treatments decrease shear bond strength between orthodontic brackets and teeth; although definite results have not been reported in this regard. This study determined the effects of different bleaching protocols on the shear bond strength of orthodontic brackets to teeth. This experimental study was performed in Iran. Forty-eight extracted human premolars were randomly assigned into four groups. In the control group, no bleaching treatment was performed. In groups 2 - 4, the bleaching procedures were performed using carbamide peroxide 45%, carbamide peroxide 20% and diode laser, respectively. Two weeks later, brackets were bonded to teeth and thermocycled. The shear bond strengths of the brackets to the teeth were measured. Data was analyzed by one-way ANOVA and Dunnett post-hoc test. Shear bond strength of the brackets to the teeth were 10.54 ± 1.51, 6.37 ± 0.92, 7.67 ± 1.01 and 7.49 ± 1.19 MPa, in groups 1 - 4, respectively. Significant differences were found between control group and all other groups (P brackets to the teeth. 45% carbamide peroxide had a more significant effect on bond strength compared to 20% carbamide peroxide. The difference in bond strength was not significant between laser group and either carbamide peroxide groups.
A graph rewriting programming language for graph drawing
Rodgers, Peter
1998-01-01
This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computationally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools are all text based. Recent developments in graph rewriting systems have produced computationally com...
Significance evaluation in factor graphs
DEFF Research Database (Denmark)
Madsen, Tobias; Hobolth, Asger; Jensen, Jens Ledet
2017-01-01
in genomics and the multiple-testing issues accompanying them, accurate significance evaluation is of great importance. We here address the problem of evaluating statistical significance of observations from factor graph models. Results Two novel numerical approximations for evaluation of statistical...... significance are presented. First a method using importance sampling. Second a saddlepoint approximation based method. We develop algorithms to efficiently compute the approximations and compare them to naive sampling and the normal approximation. The individual merits of the methods are analysed both from....... Conclusions The applicability of saddlepoint approximation and importance sampling is demonstrated on known models in the factor graph framework. Using the two methods we can substantially improve computational cost without compromising accuracy. This contribution allows analyses of large datasets...
Cohen, A.M.; Beineke, L.W.; Wilson, R.J.; Cameron, P.J.
2004-01-01
In this chapter we investigate the classification of distance-transitive graphs: these are graphs whose automorphism groups are transitive on each of the sets of pairs of vertices at distance i, for i = 0, 1,.... We provide an introduction into the field. By use of the classification of finite
Joyner, W David
2017-01-01
This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader’s interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book’s source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards ad...
Perepelitsa, VA; Sergienko, [No Value; Kochkarov, AM
1999-01-01
Definitions of prefractal and fractal graphs are introduced, and they are used to formulate mathematical models in different fields of knowledge. The topicality of fractal-graph recognition from the point of view, of fundamental improvement in the efficiency of the solution of algorithmic problems
DEFF Research Database (Denmark)
Husfeldt, Thore
2015-01-01
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...
Packing Degenerate Graphs Greedily
Czech Academy of Sciences Publication Activity Database
Allen, P.; Böttcher, J.; Hladký, J.; Piguet, Diana
2017-01-01
Roč. 61, August (2017), s. 45-51 ISSN 1571-0653 R&D Projects: GA ČR GJ16-07822Y Institutional support: RVO:67985807 Keywords : tree packing conjecture * graph packing * graph processes Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics
Generalized connectivity of graphs
Li, Xueliang
2016-01-01
Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.
Low-Rank Matrix Factorization With Adaptive Graph Regularizer.
Lu, Gui-Fu; Wang, Yong; Zou, Jian
2016-05-01
In this paper, we present a novel low-rank matrix factorization algorithm with adaptive graph regularizer (LMFAGR). We extend the recently proposed low-rank matrix with manifold regularization (MMF) method with an adaptive regularizer. Different from MMF, which constructs an affinity graph in advance, LMFAGR can simultaneously seek graph weight matrix and low-dimensional representations of data. That is, graph construction and low-rank matrix factorization are incorporated into a unified framework, which results in an automatically updated graph rather than a predefined one. The experimental results on some data sets demonstrate that the proposed algorithm outperforms the state-of-the-art low-rank matrix factorization methods.
The accuracy of molecular bond lengths computed by multireference electronic structure methods
International Nuclear Information System (INIS)
Shepard, Ron; Kedziora, Gary S.; Lischka, Hans; Shavitt, Isaiah; Mueller, Thomas; Szalay, Peter G.; Kallay, Mihaly; Seth, Michael
2008-01-01
We compare experimental R e values with computed R e values for 20 molecules using three multireference electronic structure methods, MCSCF, MR-SDCI, and MR-AQCC. Three correlation-consistent orbital basis sets are used, along with complete basis set extrapolations, for all of the molecules. These data complement those computed previously with single-reference methods. Several trends are observed. The SCF R e values tend to be shorter than the experimental values, and the MCSCF values tend to be longer than the experimental values. We attribute these trends to the ionic contamination of the SCF wave function and to the corresponding systematic distortion of the potential energy curve. For the individual bonds, the MR-SDCI R e values tend to be shorter than the MR-AQCC values, which in turn tend to be shorter than the MCSCF values. Compared to the previous single-reference results, the MCSCF values are roughly comparable to the MP4 and CCSD methods, which are more accurate than might be expected due to the fact that these MCSCF wave functions include no extra-valence electron correlation effects. This suggests that static valence correlation effects, such as near-degeneracies and the ability to dissociate correctly to neutral fragments, play an important role in determining the shape of the potential energy surface, even near equilibrium structures. The MR-SDCI and MR-AQCC methods predict R e values with an accuracy comparable to, or better than, the best single-reference methods (MP4, CCSD, and CCSD(T)), despite the fact that triple and higher excitations into the extra-valence orbital space are included in the single-reference methods but are absent in the multireference wave functions. The computed R e values using the multireference methods tend to be smooth and monotonic with basis set improvement. The molecular structures are optimized using analytic energy gradients, and the timings for these calculations show the practical advantage of using variational wave
The accuracy of molecular bond lengths computed by multireference electronic structure methods
Energy Technology Data Exchange (ETDEWEB)
Shepard, Ron [Chemical Sciences and Engineering Division, Argonne National Laboratory, Argonne, IL 60439 (United States)], E-mail: shepard@tcg.anl.gov; Kedziora, Gary S. [High Performance Technologies Inc., 2435 5th Street, WPAFB, OH 45433 (United States); Lischka, Hans [Institute for Theoretical Chemistry, University of Vienna, Waehringerstrasse 17, A-1090 Vienna (Austria); Shavitt, Isaiah [Department of Chemistry, University of Illinois, 600 S. Mathews Avenue, Urbana, IL 61801 (United States); Mueller, Thomas [Juelich Supercomputer Centre, Research Centre Juelich, D-52425 Juelich (Germany); Szalay, Peter G. [Laboratory for Theoretical Chemistry, Institute of Chemistry, Eoetvoes Lorand University, P.O. Box 32, H-1518 Budapest (Hungary); Kallay, Mihaly [Department of Physical Chemistry and Materials Science, Budapest University of Technology and Economics, P.O. Box 91, H-1521 Budapest (Hungary); Seth, Michael [Department of Chemistry, University of Calgary, 2500 University Drive, N.W., Calgary, Alberta, T2N 1N4 (Canada)
2008-06-16
We compare experimental R{sub e} values with computed R{sub e} values for 20 molecules using three multireference electronic structure methods, MCSCF, MR-SDCI, and MR-AQCC. Three correlation-consistent orbital basis sets are used, along with complete basis set extrapolations, for all of the molecules. These data complement those computed previously with single-reference methods. Several trends are observed. The SCF R{sub e} values tend to be shorter than the experimental values, and the MCSCF values tend to be longer than the experimental values. We attribute these trends to the ionic contamination of the SCF wave function and to the corresponding systematic distortion of the potential energy curve. For the individual bonds, the MR-SDCI R{sub e} values tend to be shorter than the MR-AQCC values, which in turn tend to be shorter than the MCSCF values. Compared to the previous single-reference results, the MCSCF values are roughly comparable to the MP4 and CCSD methods, which are more accurate than might be expected due to the fact that these MCSCF wave functions include no extra-valence electron correlation effects. This suggests that static valence correlation effects, such as near-degeneracies and the ability to dissociate correctly to neutral fragments, play an important role in determining the shape of the potential energy surface, even near equilibrium structures. The MR-SDCI and MR-AQCC methods predict R{sub e} values with an accuracy comparable to, or better than, the best single-reference methods (MP4, CCSD, and CCSD(T)), despite the fact that triple and higher excitations into the extra-valence orbital space are included in the single-reference methods but are absent in the multireference wave functions. The computed R{sub e} values using the multireference methods tend to be smooth and monotonic with basis set improvement. The molecular structures are optimized using analytic energy gradients, and the timings for these calculations show the practical
Directory of Open Access Journals (Sweden)
Abdul Rahim Mustaqqim
2017-01-01
Full Text Available Structural Bonding Method (SBM is one type of Lightning Protection System (LPS, design to protect human, structures, contents inside structures, electrical equipment, transmission lines and other from the lightning flash. Besides, SBM is a standard LPS that comply with technical standards or codes of practice or called as conventional Lightning Protection System. In order to know the level of the Awareness of the Installation LPS by using SBM in the building among Civil Engineering Consultants, conducting survey need to be done. This paper presents the Research Design and Research Strategy in conducting the survey. It is explaining about the way before conducting the survey which are determine the population of sample (Consultant Company at Northern Region Area, samples of respondents (Civil Engineer at Consultant Office with the number of sample is 40, data collecting process, structure of the questionnaire form and the way in analysis the data. After the analysis the data, the result of the level of awareness in the Installation of LPS by using SBM are consider as moderate level.
Inferring ontology graph structures using OWL reasoning
Rodriguez-Garcia, Miguel Angel; Hoehndorf, Robert
2018-01-01
' semantic content remains a challenge.We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies
Wire bonding in microelectronics
Harman, George G
2010-01-01
Wire Bonding in Microelectronics, Third Edition, has been thoroughly revised to help you meet the challenges of today's small-scale and fine-pitch microelectronics. This authoritative guide covers every aspect of designing, manufacturing, and evaluating wire bonds engineered with cutting-edge techniques. In addition to gaining a full grasp of bonding technology, you'll learn how to create reliable bonds at exceedingly high yields, test wire bonds, solve common bonding problems, implement molecular cleaning methods, and much more. Coverage includes: Ultrasonic bonding systems and technologies, including high-frequency systems Bonding wire metallurgy and characteristics, including copper wire Wire bond testing Gold-aluminum intermetallic compounds and other interface reactions Gold and nickel-based bond pad plating materials and problems Cleaning to improve bondability and reliability Mechanical problems in wire bonding High-yield, fine-pitch, specialized-looping, soft-substrate, and extreme-temperature wire bo...
Steel bonded dense silicon nitride compositions and method for their fabrication
Landingham, Richard L.; Shell, Thomas E.
1987-01-01
A two-stage bonding technique for bonding high density silicon nitride and other ceramic materials to stainless steel and other hard metals, and multilayered ceramic-metal composites prepared by the technique are disclosed. The technique involves initially slurry coating a surface of the ceramic material at about 1500.degree. C. in a vacuum with a refractory material and the stainless steel is then pressure bonded to the metallic coated surface by brazing it with nickel-copper-silver or nickel-copper-manganese alloys at a temperature in the range of about 850.degree. to 950.degree. C. in a vacuum. The two-stage bonding technique minimizes the temperature-expansion mismatch between the dissimilar materials.
I-line stepper based overlay evaluation method for wafer bonding applications
Kulse, P.; Sasai, K.; Schulz, K.; Wietstruck, M.
2018-03-01
offsets between all different FIA's into account, after correcting the wafer rotation induced FIA position errors, hence an overlay for the stacked wafers can be determined. The developed approach has been validated by a standard front side resist in resist experiment. After the successful validation of the developed technique, special wafer stacks with FIA alignment marks in the bonding interface are fabricated and exposed. Following overlay calculation shows an overlay of less than 200 nm, which enables very accurate process condition for highly scaled TSV integration and advanced substrate integration into IHP's 0.25/0.13 µm SiGe:C BiCMOS technology. The developed technique also allows using significantly smaller alignment marks (i.e. standard FIA alignment marks). Furthermore, the presented method is used, in case of wafer bow related overlay tool problems, for the overlay evaluation of the last two metal layers from production wafers prepared in IHP's standard 0.25/0.13 µm SiGe:C BiCMOS technology. In conclusion, the exposure and measurement job can be done with the same tool, minimizing the back to front side/interface top layer misalignment which leads to a significant device performance improvement of backside/TSV integrated components and technologies.
International Nuclear Information System (INIS)
Haranczyk, H.; Weglarz, W.
1994-01-01
The bonded in the chestnut-tree (Aesculus hippocastanum L.) bark water freezing process was studied by means NMR method. The measured relaxation time (as a function of temperature) shows two compounds. First from solid state water (T 2 * 20 μs) and the second one from liquid water (T 2 * = 1 ms). This results are presented and discussed
International Nuclear Information System (INIS)
Haranczyk, H.; Jasinski, G.; Strzalka, K.
1994-01-01
Some biological aspects of water freezing in the wheat grain have been studied using NMR methods. Measuring of the relaxation times for freezing and liquid water shown absence of T 2 ∼100 μs and T 2 ∼1 ms separated components what pointed for some different way of water bonding
Autoregressive Moving Average Graph Filtering
Isufi, Elvin; Loukas, Andreas; Simonetto, Andrea; Leus, Geert
2016-01-01
One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design phi...
Subgraph detection using graph signals
Chepuri, Sundeep Prabhakar
2017-03-06
In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.
Subgraph detection using graph signals
Chepuri, Sundeep Prabhakar; Leus, Geert
2017-01-01
In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.
Directory of Open Access Journals (Sweden)
Andrew J Reagan
2017-10-01
Full Text Available Abstract The emergence and global adoption of social media has rendered possible the real-time estimation of population-scale sentiment, an extraordinary capacity which has profound implications for our understanding of human behavior. Given the growing assortment of sentiment-measuring instruments, it is imperative to understand which aspects of sentiment dictionaries contribute to both their classification accuracy and their ability to provide richer understanding of texts. Here, we perform detailed, quantitative tests and qualitative assessments of 6 dictionary-based methods applied to 4 different corpora, and briefly examine a further 20 methods. We show that while inappropriate for sentences, dictionary-based methods are generally robust in their classification accuracy for longer texts. Most importantly they can aid understanding of texts with reliable and meaningful word shift graphs if (1 the dictionary covers a sufficiently large portion of a given text’s lexicon when weighted by word usage frequency; and (2 words are scored on a continuous scale.
A heterogeneous graph-based recommendation simulator
Energy Technology Data Exchange (ETDEWEB)
Yeonchan, Ahn [Seoul National University; Sungchan, Park [Seoul National University; Lee, Matt Sangkeun [ORNL; Sang-goo, Lee [Seoul National University
2013-01-01
Heterogeneous graph-based recommendation frameworks have flexibility in that they can incorporate various recommendation algorithms and various kinds of information to produce better results. In this demonstration, we present a heterogeneous graph-based recommendation simulator which enables participants to experience the flexibility of a heterogeneous graph-based recommendation method. With our system, participants can simulate various recommendation semantics by expressing the semantics via meaningful paths like User Movie User Movie. The simulator then returns the recommendation results on the fly based on the user-customized semantics using a fast Monte Carlo algorithm.
Combining biophysical methods to analyze the disulfide bond in SH2 domain of C-terminal Src kinase.
Liu, Dongsheng; Cowburn, David
2016-01-01
The Src Homology 2 (SH2) domain is a structurally conserved protein domain that typically binds to a phosphorylated tyrosine in a peptide motif from the target protein. The SH2 domain of C-terminal Src kinase (Csk) contains a single disulfide bond, which is unusual for most SH2 domains. Although the global motion of SH2 domain regulates Csk function, little is known about the relationship between the disulfide bond and binding of the ligand. In this study, we combined X-ray crystallography, solution NMR, and other biophysical methods to reveal the interaction network in Csk. Denaturation studies have shown that disulfide bond contributes significantly to the stability of SH2 domain, and crystal structures of the oxidized and C122S mutant showed minor conformational changes. We further investigated the binding of SH2 domain to a phosphorylated peptide from Csk-binding protein upon reduction and oxidation using both NMR and fluorescence approaches. This work employed NMR, X-ray cryptography, and other biophysical methods to study a disulfide bond in Csk SH2 domain. In addition, this work provides in-depth understanding of the structural dynamics of Csk SH2 domain.
DEFF Research Database (Denmark)
Ayres, Phil; Vestartas, Petras; Ramsgaard Thomsen, Mette
2017-01-01
Cutting patterns for architectural membranes are generally characterised by rational approaches to surface discretisation and minimisation of geometric deviation between discrete elements that comprise the membrane. In this paper, we present an alternative approach for cutting pattern generation...... to the cutting pattern generation method and the net topology generation method used to produce a constraint net for a given membrane. We test our computational design approach through an iterative cycle of digital and physical prototyping before realising an air-inflated cable restrained pneumatic structural...
Olayan, Rawan S.; Ashoor, Haitham; Bajic, Vladimir B.
2017-01-01
but not all DTIs between them are not known. Using independent sources of evidence, we verify as correct 22 out of the top 25 DDR novel predictions. This suggests that DDR can be used as an efficient method to identify correct DTIs.
Systems and methods for using a boehmite bond-coat with polyimide membranes for gas separation
Polishchuk, Kimberly Ann
2013-03-05
The subject matter disclosed herein relates to gas separation membranes and, more specifically, to polyimide gas separation membranes. In an embodiment, a gas separation membrane includes a porous substrate, a substantially continuous polyimide membrane layer, and one or more layers of boehmite nanoparticles disposed between the porous substrate and the polyimide membrane layer to form a bond-coat layer. The bond-coat layer is configured to improve the adhesion of the polyimide membrane layer to the porous substrate, and the polyimide membrane layer has a thickness approximately 100 nm or less.
A Novel Method to Quantify Soil Aggregate Stability by Measuring Aggregate Bond Energies
Efrat, Rachel; Rawlins, Barry G.; Quinton, John N.; Watts, Chris W.; Whitmore, Andy P.
2016-04-01
Soil aggregate stability is a key indicator of soil quality because it controls physical, biological and chemical functions important in cultivated soils. Micro-aggregates are responsible for the long term sequestration of carbon in soil, therefore determine soils role in the carbon cycle. It is thus vital that techniques to measure aggregate stability are accurate, consistent and reliable, in order to appropriately manage and monitor soil quality, and to develop our understanding and estimates of soil as a carbon store to appropriately incorporate in carbon cycle models. Practices used to assess the stability of aggregates vary in sample preparation, operational technique and unit of results. They use proxies and lack quantification. Conflicting results are therefore drawn between projects that do not provide methodological or resultant comparability. Typical modern stability tests suspend aggregates in water and monitor fragmentation upon exposure to an un-quantified amount of ultrasonic energy, utilising a laser granulometer to measure the change in mean weight diameter. In this project a novel approach has been developed based on that of Zhu et al., (2009), to accurately quantify the stability of aggregates by specifically measuring their bond energies. The bond energies are measured operating a combination of calorimetry and a high powered ultrasonic probe, with computable output function. Temperature change during sonication is monitored by an array of probes which enables calculation of the energy spent heating the system (Ph). Our novel technique suspends aggregates in heavy liquid lithium heteropolytungstate, as opposed to water, to avoid exposing aggregates to an immeasurable disruptive energy source, due to cavitation, collisions and clay swelling. Mean weight diameter is measured by a laser granulometer to monitor aggregate breakdown after successive periods of calculated ultrasonic energy input (Pi), until complete dispersion is achieved and bond
Directory of Open Access Journals (Sweden)
Haynes Teresa W.
2014-08-01
Full Text Available A path π = (v1, v2, . . . , vk+1 in a graph G = (V,E is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi ≥ deg(vi+1, where deg(vi denotes the degree of vertex vi ∈ V. The downhill domination number equals the minimum cardinality of a set S ⊆ V having the property that every vertex v ∈ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number of a graph is at most half its order, and that the downhill domination number of a tree is at most one third its order. We characterize the graphs obtaining each of these bounds
Tailored Random Graph Ensembles
International Nuclear Information System (INIS)
Roberts, E S; Annibale, A; Coolen, A C C
2013-01-01
Tailored graph ensembles are a developing bridge between biological networks and statistical mechanics. The aim is to use this concept to generate a suite of rigorous tools that can be used to quantify and compare the topology of cellular signalling networks, such as protein-protein interaction networks and gene regulation networks. We calculate exact and explicit formulae for the leading orders in the system size of the Shannon entropies of random graph ensembles constrained with degree distribution and degree-degree correlation. We also construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities which converges to a strictly uniform measure and is based on edge swaps that conserve all degrees. The acceptance probabilities can be generalized to define Markov chains that target any alternative desired measure on the space of directed or undirected graphs, in order to generate graphs with more sophisticated topological features.
Alspach, BR
1985-01-01
This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems.
Wilson, Robin J
1985-01-01
Graph Theory has recently emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. This book provides a comprehensive introduction to the subject.
Hyperbolicity in median graphs
Indian Academy of Sciences (India)
mic problems in hyperbolic spaces and hyperbolic graphs have been .... that in general the main obstacle is that we do not know the location of ...... [25] Jonckheere E and Lohsoonthorn P, A hyperbolic geometry approach to multipath routing,.
Directory of Open Access Journals (Sweden)
Peixin Zhao
2014-01-01
Full Text Available This paper suggests a novel clustering method for analyzing the National Incident-Based Reporting System (NIBRS data, which include the determination of correlation of different crime types, the development of a likelihood index for crimes to occur in a jurisdiction, and the clustering of jurisdictions based on crime type. The method was tested by using the 2005 assault data from 121 jurisdictions in Virginia as a test case. The analyses of these data show that some different crime types are correlated and some different crime parameters are correlated with different crime types. The analyses also show that certain jurisdictions within Virginia share certain crime patterns. This information assists with constructing a pattern for a specific crime type and can be used to determine whether a jurisdiction may be more likely to see this type of crime occur in their area.
Data transfer using complete bipartite graph
Chandrasekaran, V. M.; Praba, B.; Manimaran, A.; Kailash, G.
2017-11-01
Information exchange extent is an estimation of the amount of information sent between two focuses on a framework in a given time period. It is an extremely significant perception in present world. There are many ways of message passing in the present situations. Some of them are through encryption, decryption, by using complete bipartite graph. In this paper, we recommend a method for communication using messages through encryption of a complete bipartite graph.
Uniform Single Valued Neutrosophic Graphs
Directory of Open Access Journals (Sweden)
S. Broumi
2017-09-01
Full Text Available In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.
Collective Rationality in Graph Aggregation
Endriss, U.; Grandi, U.; Schaub, T.; Friedrich, G.; O'Sullivan, B.
2014-01-01
Suppose a number of agents each provide us with a directed graph over a common set of vertices. Graph aggregation is the problem of computing a single “collective” graph that best represents the information inherent in this profile of individual graphs. We consider this aggregation problem from the
International Nuclear Information System (INIS)
Barra, F.; Gaspard, P.
2001-01-01
We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator that generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined for the time-continuous classical dynamics on graphs. These properties are given as the zeros of some periodic-orbit zeta functions. We consider in detail the case of infinite periodic graphs where the particle undergoes a diffusion process. The infinite spatial extension is taken into account by Fourier transforms that decompose the observables and probability densities into sectors corresponding to different values of the wave number. The hydrodynamic modes of diffusion are studied by an eigenvalue problem of a Frobenius-Perron operator corresponding to a given sector. The diffusion coefficient is obtained from the hydrodynamic modes of diffusion and has the Green-Kubo form. Moreover, we study finite but large open graphs that converge to the infinite periodic graph when their size goes to infinity. The lifetime of the particle on the open graph is shown to correspond to the lifetime of a system that undergoes a diffusion process before it escapes
Bollobás, Béla
1998-01-01
The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed ...
Kaleli, Necati; Saraç, Duygu
2017-07-01
Most studies evaluating dental laser sintering systems have focused on the marginal accuracy of the restorations. However, the bond strength at the metal-ceramic interface is another important factor that affects the survival of restorations, and currently, few studies focus on this aspect. The purpose of this in vitro study was to compare the porcelain bond strength of cobalt-chromium (Co-Cr) metal frameworks prepared by using the conventional lost-wax technique, milling, direct metal laser sintering (DMLS), and laser cusing, a direct process powder-bed system. A total of 96 metal frameworks (n=24 in each group) were prepared by using conventional lost-wax (group C), milling (group M), DMLS (group LS), and direct process powder-bed (group LC) methods according to International Organization for Standardization standard ISO 9693-1. After porcelain application, a 3-point bend test was applied to each specimen by using a universal testing machine. Data were statistically analyzed using 1-way ANOVA and Tukey honest significant difference tests (α=.05). Failure types at the metal-ceramic interfaces were examined using stereomicroscopy. Additionally, 1 specimen from each group was prepared for scanning electron microscopy analysis to evaluate the surface topography of metal frameworks. The mean bond strength was 38.08 ±3.82 MPa for group C, 39.29 ±3.51 MPa for group M, 40.73 ±3.58 MPa for group LS, and 41.24 ±3.75 MPa for group LC. Statistically significant differences were observed among the 4 groups (P=.016). All groups, except for LS, exhibited adhesive and mixed type bond failure. Both of the laser sintering methods were found to be successful in terms of metal-ceramic bond strength. Copyright © 2016 Editorial Council for the Journal of Prosthetic Dentistry. Published by Elsevier Inc. All rights reserved.
Performance of Several Density Functional Theory Methods on Describing Hydrogen-Bond Interactions.
Rao, Li; Ke, Hongwei; Fu, Gang; Xu, Xin; Yan, Yijing
2009-01-13
We have investigated eleven density functionals, including LDA, PBE, mPWPW91, TPSS, B3LYP, X3LYP, PBE0, O3LYP, B97-1, MPW1K, and TPSSh, for their performances on describing hydrogen bond (HB) interactions. The emphasis has been laid not only on their abilities to calculate the intermolecular hydrogen bonding energies but also on their performances in predicting the relative energies of intermolecular H-bonded complexes and the conformer stabilities due to intramolecular hydrogen bondings. As compared to the best theoretical values, we found that although PBE and PBE0 gave the best estimation of HB strengths, they might fail to predict the correct order of relative HB energies, which might lead to a wrong prediction of the global minimum for different conformers. TPSS and TPSSh did not always improve over PBE and PBE0. B3LYP was found to underestimate the intermolecular HB strengths but was among the best performers in calculating the relative HB energies. We showed here that X3LYP and B97-1 were able to give good values for both absolute HB strengths and relative HB energies, making these functionals good candidates for HB description.
Bond efficacy of recycled orthodontic brackets: A comparative in vitro evaluation of two methods.
Shetty, Vikram; Shekatkar, Yash; Kumbhat, Neesu; Gautam, G; Karbelkar, Shalan; Vandekar, Meghna
2015-01-01
Recycling of orthodontic brackets in developing orthodontic economies is an extremely common procedure. Bonding protocols and reliability of these brackets is, however, questionable, and still the subject of research. The aim was to evaluate and compare the shear bond strength of brackets recycled with sandblasting and silicoating. Ninety extracted human premolars were bonded with 0.022" SS brackets (American Orthodontics, Sheboygan USA) and then debonded. The debonded brackets were divided into three groups of 30 each. Group I: Sandblasting with 50-μm aluminum oxide (control group) Group II: Sandblasting with 50-μm aluminum oxide followed by metal primer application Group III: Silicoating with 30-μm Cojet sand followed by silane application and rebonded with Transbond XT. The sandblasted brackets and silicoated brackets were viewed under the scanning electron microscope, immediately after surface conditioning before rebonding. The shear bond strength with each group was tested. One-way analysis of variance, post-hoc Scheffe multiple comparison tests. The results showed that sandblasting created more irregularities and deeper erosions while silica coating created superficial irregularities and shallow erosions.
Flux networks in metabolic graphs
International Nuclear Information System (INIS)
Warren, P B; Queiros, S M Duarte; Jones, J L
2009-01-01
A metabolic model can be represented as a bipartite graph comprising linked reaction and metabolite nodes. Here it is shown how a network of conserved fluxes can be assigned to the edges of such a graph by combining the reaction fluxes with a conserved metabolite property such as molecular weight. A similar flux network can be constructed by combining the primal and dual solutions to the linear programming problem that typically arises in constraint-based modelling. Such constructions may help with the visualization of flux distributions in complex metabolic networks. The analysis also explains the strong correlation observed between metabolite shadow prices (the dual linear programming variables) and conserved metabolite properties. The methods were applied to recent metabolic models for Escherichia coli, Saccharomyces cerevisiae and Methanosarcina barkeri. Detailed results are reported for E. coli; similar results were found for other organisms
Topological properties of the limited penetrable horizontal visibility graph family
Wang, Minggang; Vilela, André L. M.; Du, Ruijin; Zhao, Longfeng; Dong, Gaogao; Tian, Lixin; Stanley, H. Eugene
2018-05-01
The limited penetrable horizontal visibility graph algorithm was recently introduced to map time series in complex networks. In this work, we extend this algorithm to create a directed-limited penetrable horizontal visibility graph and an image-limited penetrable horizontal visibility graph. We define two algorithms and provide theoretical results on the topological properties of these graphs associated with different types of real-value series. We perform several numerical simulations to check the accuracy of our theoretical results. Finally, we present an application of the directed-limited penetrable horizontal visibility graph to measure real-value time series irreversibility and an application of the image-limited penetrable horizontal visibility graph that discriminates noise from chaos. We also propose a method to measure the systematic risk using the image-limited penetrable horizontal visibility graph, and the empirical results show the effectiveness of our proposed algorithms.
Quantum complexity of graph and algebraic problems
International Nuclear Information System (INIS)
Doern, Sebastian
2008-01-01
This thesis is organized as follows: In Chapter 2 we give some basic notations, definitions and facts from linear algebra, graph theory, group theory and quantum computation. In Chapter 3 we describe three important methods for the construction of quantum algorithms. We present the quantum search algorithm by Grover, the quantum amplitude amplification and the quantum walk search technique by Magniez et al. These three tools are the basis for the development of our new quantum algorithms for graph and algebra problems. In Chapter 4 we present two tools for proving quantum query lower bounds. We present the quantum adversary method by Ambainis and the polynomial method introduced by Beals et al. The quantum adversary tool is very useful to prove good lower bounds for many graph and algebra problems. The part of the thesis containing the original results is organized in two parts. In the first part we consider the graph problems. In Chapter 5 we give a short summary of known quantum graph algorithms. In Chapter 6 to 8 we study the complexity of our new algorithms for matching problems, graph traversal and independent set problems on quantum computers. In the second part of our thesis we present new quantum algorithms for algebraic problems. In Chapter 9 to 10 we consider group testing problems and prove quantum complexity bounds for important problems from linear algebra. (orig.)
Quantum complexity of graph and algebraic problems
Energy Technology Data Exchange (ETDEWEB)
Doern, Sebastian
2008-02-04
This thesis is organized as follows: In Chapter 2 we give some basic notations, definitions and facts from linear algebra, graph theory, group theory and quantum computation. In Chapter 3 we describe three important methods for the construction of quantum algorithms. We present the quantum search algorithm by Grover, the quantum amplitude amplification and the quantum walk search technique by Magniez et al. These three tools are the basis for the development of our new quantum algorithms for graph and algebra problems. In Chapter 4 we present two tools for proving quantum query lower bounds. We present the quantum adversary method by Ambainis and the polynomial method introduced by Beals et al. The quantum adversary tool is very useful to prove good lower bounds for many graph and algebra problems. The part of the thesis containing the original results is organized in two parts. In the first part we consider the graph problems. In Chapter 5 we give a short summary of known quantum graph algorithms. In Chapter 6 to 8 we study the complexity of our new algorithms for matching problems, graph traversal and independent set problems on quantum computers. In the second part of our thesis we present new quantum algorithms for algebraic problems. In Chapter 9 to 10 we consider group testing problems and prove quantum complexity bounds for important problems from linear algebra. (orig.)
Mistry, Divya; Wise, Roger P; Dickerson, Julie A
2017-01-01
Identification of central genes and proteins in biomolecular networks provides credible candidates for pathway analysis, functional analysis, and essentiality prediction. The DiffSLC centrality measure predicts central and essential genes and proteins using a protein-protein interaction network. Network centrality measures prioritize nodes and edges based on their importance to the network topology. These measures helped identify critical genes and proteins in biomolecular networks. The proposed centrality measure, DiffSLC, combines the number of interactions of a protein and the gene coexpression values of genes from which those proteins were translated, as a weighting factor to bias the identification of essential proteins in a protein interaction network. Potentially essential proteins with low node degree are promoted through eigenvector centrality. Thus, the gene coexpression values are used in conjunction with the eigenvector of the network's adjacency matrix and edge clustering coefficient to improve essentiality prediction. The outcome of this prediction is shown using three variations: (1) inclusion or exclusion of gene co-expression data, (2) impact of different coexpression measures, and (3) impact of different gene expression data sets. For a total of seven networks, DiffSLC is compared to other centrality measures using Saccharomyces cerevisiae protein interaction networks and gene expression data. Comparisons are also performed for the top ranked proteins against the known essential genes from the Saccharomyces Gene Deletion Project, which show that DiffSLC detects more essential proteins and has a higher area under the ROC curve than other compared methods. This makes DiffSLC a stronger alternative to other centrality methods for detecting essential genes using a protein-protein interaction network that obeys centrality-lethality principle. DiffSLC is implemented using the igraph package in R, and networkx package in Python. The python package can be
Directory of Open Access Journals (Sweden)
Timotius Yonathan Sunarsa
2017-12-01
Full Text Available Adhesive bonded structures have been widely used in aerospace, automobile, and marine industries. Due to the complex nature of the failure mechanisms of bonded structures, cost-effective and reliable damage detection is crucial for these industries. Most of the common damage detection methods are not adequately sensitive to the presence of weakened bonding. This paper presents an experimental and analytical method for the in-situ detection of damage in adhesive-bonded structures. The method is fully non-contact, using air-coupled ultrasonic transducers (ACT for ultrasonic wave generation and sensing. The uniqueness of the proposed method relies on accurate detection and localization of weakened bonding in complex adhesive bonded structures. The specimens tested in this study are parts of real-world structures with critical and complex damage types, provided by Hyundai Heavy Industries® and IKTS Fraunhofer®. Various transmitter and receiver configurations, including through transmission, pitch-catch scanning, and probe holder angles, were attempted, and the obtained results were analyzed. The method examines the time-of-flight of the ultrasonic waves over a target inspection area, and the spatial variation of the time-of-flight information was examined to visualize and locate damage. The proposed method works without relying on reference data obtained from the pristine condition of the target specimen. Aluminum bonded plates and triplex adhesive layers with debonding and weakened bonding were used to examine the effectiveness of the method.
PERANCANGAN SISTEM PENJADWALAN PEMBELAJARAN MENGGUNAKAN GRAPH COLORING
Directory of Open Access Journals (Sweden)
Taufik Hidayatulloh
2016-03-01
Full Text Available Abstract - In learning scheduling problem often faced by schools in the new academic year. Sometimes collisions on the schedule was not found when the learning process has begun, so it is necessary to re-schedule on the schedule. And this resulted in the teaching and learning first weeks less to run well. Researchers previously have used various methods to solve the scheduling as Tabu search, Simulated Annealing, Network Flow, Graph Coloring. Graph Coloring (coloring of a graph is the simplest method and the experimental results indicate that the development of methods of scheduling Graph Coloring deliver results that meet an average of 93% across the specified constraints. At the time of split schedules that require extra energy at the start of learning did not experience a collision. With this system is expected to facilitate the allocation of space, teachers, lessons to avoid a collision. Keywords: Information Systems, Scheduling, graph coloring Abstraksi - Dalam masalah penjadwalan pembelajaran sering dihadapi sekolah pada tahun ajaran baru. Terkadang tabrakan pada jadwal itu baru ditemukan ketika proses belajar mengajar telah dimulai, sehingga perlu dilakukan penjadwalan ulang pada jadwal tersebut. Dan hal ini mengakibatkan kegiatan belajar mengajar pada minggu-minggu pertama kurang dapat berjalan dengan baik. Para peneliti sebelumnya telah menggunakan berbagai metode untuk memecahkan penjadwalan seperti Tabu search, Simulated Annealing, Network Flow, Graph Coloring. Graph Coloring (pewarnaan graf merupakan metode yang paling sederhana dan hasil percobaan menunjukkan bahwa pengembangan metode Graph Coloring memberikan hasil penjadwalan yang memenuhi rata-rata 93% seluruh constraints yang ditentukan. Pada saat membagi jadwal memerlukan energi ekstra agar pada saat di mulai pembelajaran tidak mengalami tabrakan. Dengan sistem ini diharapkan dapat mempermudah dalam mengalokasikan ruangan, guru, pelajaran agar tidak mengalami tabrakan. Kata
Buyuk, S Kutalmış; Kucukekenci, Ahmet Serkan
2018-03-01
To investigate the shear bond strength (SBS) of orthodontic metal brackets applied to different types of ceramic surfaces treated with different etching procedures and bonding agents. Monolithic CAD/CAM ceramic specimens (N = 120; n = 40 each group) of feldspathic ceramic Vita Mark II, resin nanoceramic Lava Ultimate, and hybrid ceramic Vita Enamic were fabricated (14 × 12 × 3 mm). Ceramic specimens were separated into four subgroups (n = 10) according to type of surface treatment and bonding onto the ceramic surface. Within each group, four subgroups were prepared by phosphoric acid, hydrofluoric acid, Transbond XT primer, and Clearfill Ceramic primer. Mandibular central incisor metal brackets were bonded with light-cure composite. The SBS data were analyzed using three-way analysis of variance (ANOVA) and Tukey HSD tests. The highest SBS was found in the Vita Enamic group, which is a hybrid ceramic, etched with hydrofluoric acid and applied Transbond XT Adhesive primer (7.28 ± 2.49 MPa). The lowest SBS was found in the Lava Ultimate group, which is a resin nano-ceramic etched with hydrofluoric acid and applied Clearfill ceramic primer (2.20 ± 1.21 MPa). CAD/CAM material types and bonding procedures affected bond strength ( P .05). The use of Transbond XT as a primer bonding agent resulted in higher SBS.
Szabó, György; Fáth, Gábor
2007-07-01
Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first four sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fifth section surveys the topological complications implied by non-mean-field-type social network structures in general. The next three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.
Quantum Graphs And Their Resonance Properties
International Nuclear Information System (INIS)
Lipovsky, J.
2016-01-01
In the current review, we study the model of quantum graphs. We focus mainly on the resonance properties of quantum graphs. We define resolvent and scattering resonances and show their equivalence. We present various results on the asymptotics of the number of resolvent resonances in both non-magnetic and magnetic quantum graphs and find bounds on the coefficient by the leading term of the asymptotics. We explain methods how to find the spectral and resonance condition. Most of the notions and theorems are illustrated in examples. We show how to find resonances numerically and, in a simple example, we find trajectories of resonances in the complex plane. We discuss Fermi’s golden rule for quantum graphs and distribution of the mean intensity for the topological resonances. (author)
Fixation probability on clique-based graphs
Choi, Jeong-Ok; Yu, Unjong
2018-02-01
The fixation probability of a mutant in the evolutionary dynamics of Moran process is calculated by the Monte-Carlo method on a few families of clique-based graphs. It is shown that the complete suppression of fixation can be realized with the generalized clique-wheel graph in the limit of small wheel-clique ratio and infinite size. The family of clique-star is an amplifier, and clique-arms graph changes from amplifier to suppressor as the fitness of the mutant increases. We demonstrate that the overall structure of a graph can be more important to determine the fixation probability than the degree or the heat heterogeneity. The dependence of the fixation probability on the position of the first mutant is discussed.
Proxy Graph: Visual Quality Metrics of Big Graph Sampling.
Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra
2017-06-01
Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.
Directory of Open Access Journals (Sweden)
Fernanda Ribeiro Santana
2008-12-01
Full Text Available This study evaluated the influence of the method and period of storage on the adhesive bond strength of indirect composite resin to bovine dentin. Ninety bovine incisors were stored in three different solutions: 0.2% thymol, 10% formalin, and 0.2% sodium azide, during 3 periods of storage: 7 days, 30 days and 6 months, resulting in 9 groups (n = 10. The roots were cut off and the buccal surface was ground with #600-grit silicon carbide paper. The surface was conditioned with 37% phosphoric acid for 15 s and a composite resin restoration (TPH Spectrum was fixed using a one-bottle adhesive system (Adper Single Bond and a dual-cured resinous cement (Rely X ARC under a load of 500 g for 5 minutes. The samples were serially cut perpendicular to the bonded interface to obtain slices of 1.2 mm in thickness. Each slab was trimmed with a cylindrical diamond bur resulting in an hourglass shape with a cross-sectional area of approximately 1 mm². The microtensile bond strength (μTBS testing was performed in a testing machine (EMIC 2000 DL at a 0.5 mm/minute crosshead-speed until failure. After fracture, the specimens were examined under SEM to analyze the mode of fracture. μTBS Means were expressed in MPa and the data were analyzed by two-way ANOVA (3X3 and the Tukey test (α = 0.05. The storage times of 7 and 30 days produced no significant difference irrespective of the solution type. The formalin and thymol solutions, however, did have a negative influence on bond strength when the teeth were stored for 6 months.
Energy Technology Data Exchange (ETDEWEB)
Li, D.T.; Li, W.; Sun, Q.L.; Li, B.Q. [Chinese Academy of Science, Taiyuan (China). Inst. for Coal Chemistry
2003-04-01
A new method using the small porcelain as the reactor combined with increasing the flow rate of carrier gas was proposed, which has the advantage of excluding the condensation of volatile produced by heated solid samples on the windows during in situ diffuse reflectance FTIR experiment. Moreover, the feasibility of this method was also discussed. Using this method, the distribution and thermal stability of hydrogen bonds in coal macerals obtained from two coals were studied. The results show that the differences between the distribution of hydrogen bonds formed by hydroxyl group in the macerals of two coals were very similar. For the vitrinites the thermal stability of SH-N, carboxylic acid dimmers and self-associated OH is higher than those in inertinites but for OH-N and hydroxyl tetramers and OH-OR{sub 2} there are no obvious laws. For OH-{pi}, its content increased with increasing temperature to 350-380{sup o}C, and then decreased with further heating. The variation of hydrogen bonds in macerals reflects the difference in their structure.
Spectral clustering and biclustering learning large graphs and contingency tables
Bolla, Marianna
2013-01-01
Explores regular structures in graphs and contingency tables by spectral theory and statistical methods This book bridges the gap between graph theory and statistics by giving answers to the demanding questions which arise when statisticians are confronted with large weighted graphs or rectangular arrays. Classical and modern statistical methods applicable to biological, social, communication networks, or microarrays are presented together with the theoretical background and proofs. This book is suitable for a one-semester course for graduate students in data mining, mult
Learning a Nonnegative Sparse Graph for Linear Regression.
Fang, Xiaozhao; Xu, Yong; Li, Xuelong; Lai, Zhihui; Wong, Wai Keung
2015-09-01
Previous graph-based semisupervised learning (G-SSL) methods have the following drawbacks: 1) they usually predefine the graph structure and then use it to perform label prediction, which cannot guarantee an overall optimum and 2) they only focus on the label prediction or the graph structure construction but are not competent in handling new samples. To this end, a novel nonnegative sparse graph (NNSG) learning method was first proposed. Then, both the label prediction and projection learning were integrated into linear regression. Finally, the linear regression and graph structure learning were unified within the same framework to overcome these two drawbacks. Therefore, a novel method, named learning a NNSG for linear regression was presented, in which the linear regression and graph learning were simultaneously performed to guarantee an overall optimum. In the learning process, the label information can be accurately propagated via the graph structure so that the linear regression can learn a discriminative projection to better fit sample labels and accurately classify new samples. An effective algorithm was designed to solve the corresponding optimization problem with fast convergence. Furthermore, NNSG provides a unified perceptiveness for a number of graph-based learning methods and linear regression methods. The experimental results showed that NNSG can obtain very high classification accuracy and greatly outperforms conventional G-SSL methods, especially some conventional graph construction methods.
Developments of a bonding technique for optical materials by a surface activation method
International Nuclear Information System (INIS)
Sugiyama, Akira; Oda, Tomohiro; Abe, Tomoyuki; Kusunoki, Isao
2007-01-01
We have been developing a pair of sample holder used for optics in the surface activation bonding equipment. The holder can adjust the relative position of samples in the order of sub mm. To study the degree of dislocation appearing crystal surface activated by a fast atomic beam, irradiated sapphire crystals were examined by RBS, XPS, and AFM analysis. The heat treatment recovered the surface roughness of irradiated sapphire when the heating temperature reached at 1573 K. (author)
On some covering graphs of a graph
Directory of Open Access Journals (Sweden)
Shariefuddin Pirzada
2016-10-01
Full Text Available For a graph $G$ with vertex set $V(G=\\{v_1, v_2, \\dots, v_n\\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\\{u\\in S : uv \\in E(G \\}\\cup \\{v\\}$ be the closed neighbourhood of the vertex $v$ with respect to $S.$ We define a square matrix $A_S(G= (a_{ij},$ by $a_{ij}=1,$ if $\\left |N_S[v_i]\\cap N_S[v_j] \\right| \\geq 1, i\
Huang, Xiaoke; Zhao, Ye; Yang, Jing; Zhang, Chong; Ma, Chao; Ye, Xinyue
2016-01-01
We propose TrajGraph, a new visual analytics method, for studying urban mobility patterns by integrating graph modeling and visual analysis with taxi trajectory data. A special graph is created to store and manifest real traffic information recorded by taxi trajectories over city streets. It conveys urban transportation dynamics which can be discovered by applying graph analysis algorithms. To support interactive, multiscale visual analytics, a graph partitioning algorithm is applied to create region-level graphs which have smaller size than the original street-level graph. Graph centralities, including Pagerank and betweenness, are computed to characterize the time-varying importance of different urban regions. The centralities are visualized by three coordinated views including a node-link graph view, a map view and a temporal information view. Users can interactively examine the importance of streets to discover and assess city traffic patterns. We have implemented a fully working prototype of this approach and evaluated it using massive taxi trajectories of Shenzhen, China. TrajGraph's capability in revealing the importance of city streets was evaluated by comparing the calculated centralities with the subjective evaluations from a group of drivers in Shenzhen. Feedback from a domain expert was collected. The effectiveness of the visual interface was evaluated through a formal user study. We also present several examples and a case study to demonstrate the usefulness of TrajGraph in urban transportation analysis.
Fundamentals of algebraic graph transformation
Ehrig, Hartmut; Prange, Ulrike; Taentzer, Gabriele
2006-01-01
Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool envir...
The STAPL Parallel Graph Library
Harshvardhan,
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable distributed graph container and a collection of commonly used parallel graph algorithms. The library introduces pGraph pViews that separate algorithm design from the container implementation. It supports three graph processing algorithmic paradigms, level-synchronous, asynchronous and coarse-grained, and provides common graph algorithms based on them. Experimental results demonstrate improved scalability in performance and data size over existing graph libraries on more than 16,000 cores and on internet-scale graphs containing over 16 billion vertices and 250 billion edges. © Springer-Verlag Berlin Heidelberg 2013.
Energy Technology Data Exchange (ETDEWEB)
Zhan Yingqing; Zhao Rui; Meng Fanbing; Lei Yajie; Zhong Jiachun; Yang Xulin [Research Branch of Functional Materials, Institute of Microelectronic and Solid State Electronic, University of Electronic Science and Technology of China, Chengdu 610054 (China); Liu Xiaobo, E-mail: liuxb@uestc.edu.cn [Research Branch of Functional Materials, Institute of Microelectronic and Solid State Electronic, University of Electronic Science and Technology of China, Chengdu 610054 (China)
2011-06-15
Highlights: > Novel CNTs/magnetite hybrid materials were prepared via covalently bonded method. > Stable interaction between nitriles and iron ion promoted the oriented growth of magnetite. > The hybrid material exhibited higher magnetism and electromagnetic properties - Abstract: A new type of CNTs/magnetite hybrid material was prepared via covalently bonded method in a simple solvothermal system using FeCl{sub 3} as iron source, ethylene glycol as the reducing agent, and 4-aminophenoxyphthalonitrile-grafted CNTs as templates. The magnetite nanoparticles, with the diameters of 70-80 nm, were self-assembled along the CNTs. The FTIR, UV-vis and DSC revealed that a stable covalent bond between nitriles group and iron ion promoted the oriented growth of magnetite nanoparticles along the CNTs, resulting in good dispersibility and solution storage stability. The magnetic properties measurements indicated that a higher saturated magnetization (70.7 emu g{sup -1}) existed in the CNTs/magnetite hybrid material, which further enhanced the electromagnetic properties. The magnetic loss was caused mainly by natural resonance, which is in good agreement with the Kittel equation results. The novel electromagnetic hybrid material is believed to have potential applications in the microwave absorbing performances.
International Nuclear Information System (INIS)
Zhan Yingqing; Zhao Rui; Meng Fanbing; Lei Yajie; Zhong Jiachun; Yang Xulin; Liu Xiaobo
2011-01-01
Highlights: → Novel CNTs/magnetite hybrid materials were prepared via covalently bonded method. → Stable interaction between nitriles and iron ion promoted the oriented growth of magnetite. → The hybrid material exhibited higher magnetism and electromagnetic properties - Abstract: A new type of CNTs/magnetite hybrid material was prepared via covalently bonded method in a simple solvothermal system using FeCl 3 as iron source, ethylene glycol as the reducing agent, and 4-aminophenoxyphthalonitrile-grafted CNTs as templates. The magnetite nanoparticles, with the diameters of 70-80 nm, were self-assembled along the CNTs. The FTIR, UV-vis and DSC revealed that a stable covalent bond between nitriles group and iron ion promoted the oriented growth of magnetite nanoparticles along the CNTs, resulting in good dispersibility and solution storage stability. The magnetic properties measurements indicated that a higher saturated magnetization (70.7 emu g -1 ) existed in the CNTs/magnetite hybrid material, which further enhanced the electromagnetic properties. The magnetic loss was caused mainly by natural resonance, which is in good agreement with the Kittel equation results. The novel electromagnetic hybrid material is believed to have potential applications in the microwave absorbing performances.
Li, Ling; Tirado, Angelica; Conner, B. S.; Chi, Miaofang; Elliott, Amy M.; Rios, Orlando; Zhou, Haidong; Paranthaman, M. Parans
2017-09-01
In this paper, binder jetting additive manufacturing technique is employed to fabricate NdFeB isotropic bonded magnets, followed by an infiltration process with low-melting point eutectic alloys [i.e., Nd3Cu0.25Co0.75 (NdCuCo) and Pr3Cu0.25Co0.75 (PrCuCo)]. Densification and mechanical strength improvement are achieved for the as-printed porous part. Meanwhile, the intrinsic coercivity Hci is enhanced from 732 to 1345 kA/m and 1233 kA/m after diffusion of NdCuCo and PrCuCo, respectively. This study presents a novel method for fabricating complex-shaped bonded magnets with promising mechanical and magnetic properties.
Layered Graph Drawing for Visualizing Evaluation Structures.
Onoue, Yosuke; Kukimoto, Nobuyuki; Sakamoto, Naohisa; Misue, Kazuo; Koyamada, Koji
2017-01-01
An evaluation structure is a hierarchical structure of human cognition extracted from interviews based on the evaluation grid method. An evaluation structure can be defined as a directed acyclic graph (DAG). The authors propose a layer-assignment method that is part of the Sugiyama framework, a popular method for drawing DAGs, to satisfy the requirements for drawing evaluation structures. Their evaluations demonstrate that the layered graph drawing produced by the proposed layer-assignment method is preferred by users and aids in the understanding of evaluation structures.
White, AT
1985-01-01
The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing.Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'''' and 9 as ``unsolved''''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''''.
Subdominant pseudoultrametric on graphs
Energy Technology Data Exchange (ETDEWEB)
Dovgoshei, A A; Petrov, E A [Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk (Ukraine)
2013-08-31
Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)→R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k≥2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.
Multiple graph regularized nonnegative matrix factorization
Wang, Jim Jing-Yan
2013-10-01
Non-negative matrix factorization (NMF) has been widely used as a data representation method based on components. To overcome the disadvantage of NMF in failing to consider the manifold structure of a data set, graph regularized NMF (GrNMF) has been proposed by Cai et al. by constructing an affinity graph and searching for a matrix factorization that respects graph structure. Selecting a graph model and its corresponding parameters is critical for this strategy. This process is usually carried out by cross-validation or discrete grid search, which are time consuming and prone to overfitting. In this paper, we propose a GrNMF, called MultiGrNMF, in which the intrinsic manifold is approximated by a linear combination of several graphs with different models and parameters inspired by ensemble manifold regularization. Factorization metrics and linear combination coefficients of graphs are determined simultaneously within a unified object function. They are alternately optimized in an iterative algorithm, thus resulting in a novel data representation algorithm. Extensive experiments on a protein subcellular localization task and an Alzheimer\\'s disease diagnosis task demonstrate the effectiveness of the proposed algorithm. © 2013 Elsevier Ltd. All rights reserved.
Cheung, King Sing
2014-01-01
Petri nets are a formal and theoretically rich model for the modelling and analysis of systems. A subclass of Petri nets, augmented marked graphs possess a structure that is especially desirable for the modelling and analysis of systems with concurrent processes and shared resources.This monograph consists of three parts: Part I provides the conceptual background for readers who have no prior knowledge on Petri nets; Part II elaborates the theory of augmented marked graphs; finally, Part III discusses the application to system integration. The book is suitable as a first self-contained volume
Dayal, Amit; Brock, David
2018-01-01
Prashant Chandrasekar, a lead developer for the Social Interactome project, has tasked the team with creating a graph representation of the data collected from the social networks involved in that project. The data is currently stored in a MySQL database. The client requested that the graph database be Cayley, but after a literature review, Neo4j was chosen. The reasons for this shift will be explained in the design section. Secondarily, the team was tasked with coming up with three scena...
Stevanovic, Dragan
2015-01-01
Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a brief classical review, in order to provide the reader with a foundation for the subsequent chapters. Topics covered include spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem. From this introduction, the
D'Addio, Suzanne M; Kafka, Concepcion; Akbulut, Mustafa; Beattie, Patrick; Saad, Walid; Herrera, Margarita; Kennedy, Michael T; Prud'homme, Robert K
2010-04-05
Nanoparticles have significant potential in therapeutic applications to improve the bioavailability and efficacy of active drug compounds. However, the retention of nanometer sizes during concentrating or drying steps presents a significant problem. We report on a new concentrating and drying process for poly(ethylene glycol) (PEG) stabilized nanoparticles, which relies upon the unique pH sensitive hydrogen bonding interaction between PEG and polyacid species. In the hydrogen bonding coacervate precipitation (HBCP) process, PEG protected nanoparticles rapidly aggregate into an easily filterable precipitate upon the addition various polyacids. When the resulting solid is neutralized, the ionization of the acid groups eliminates the hydrogen bonded structure and the approximately 100 nm particles redisperse back to within 10% of their original size when poly(acrylic acid) and citric acid are used and 45% when poly(aspartic acid) is used. While polyacid concentrations of 1-5 wt % were used to form the precipitates, the incorporation of the acid into the PEG layer is approximately 1:1 (acid residue):(ethylene oxide unit) in the final dried precipitate. The redispersion of dried beta-carotene nanoparticles protected with PEG-b-poly(lactide-co-glycolide) polymers dried by HBCP was compared with the redispersion of particles dried by freeze-drying with sucrose as a cryprotectant, spray freeze-drying, and normal drying. Freeze-drying with 0, 2, and 12 wt % sucrose solutions resulted in size increases of 350%, 50%, and 6%, respectively. Spray freeze-drying resulted in particles with increased sizes of 50%, but no cryoprotectant and only moderate redispersion energy was required. Conventional drying resulted in solids that could not be redispersed back to nanometer size. The new HBCP process offers a promising and efficient way to concentrate or convert nanoparticle dispersions into a stable dry powder form.
Graph embedding with rich information through heterogeneous graph
Sun, Guolei
2017-01-01
Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most
International Nuclear Information System (INIS)
Bayati, Mohsen; Borgs, Christian; Chayes, Jennifer; Zecchina, Riccardo
2008-01-01
We consider the general problem of finding the minimum weight b-matching on arbitrary graphs. We prove that, whenever the linear programing relaxation of the problem has no fractional solutions, then the cavity or belief propagation equations converge to the correct solution both for synchronous and asynchronous updating. (letter)
Kwon, Oh-Hyun; Crnovrsanin, Tarik; Ma, Kwan-Liu
2018-01-01
Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.
Graph-based clustering and data visualization algorithms
Vathy-Fogarassy, Ágnes
2013-01-01
This work presents a data visualization technique that combines graph-based topology representation and dimensionality reduction methods to visualize the intrinsic data structure in a low-dimensional vector space. The application of graphs in clustering and visualization has several advantages. A graph of important edges (where edges characterize relations and weights represent similarities or distances) provides a compact representation of the entire complex data set. This text describes clustering and visualization methods that are able to utilize information hidden in these graphs, based on
International Nuclear Information System (INIS)
Saito, Shigeru
2002-07-01
In recent years, it has been considered that W (tungsten) is one of candidate materials for armor tiles of plasma a facing components (PFC), like first wall or divertor, of fusion reactor. On the other hand, Cu-alloys, like OFHC-Cu or DS-Cu, are proposed as heat sink materials behind the plasma facing materials because of its high thermal conductivity. It is necessary to develop a reliable bonding techniques in order to fabricate PFC. JAERI has developed the hot isostatic press (HIP) bonding process to bond W with Cu-alloys. In this experiments, bonding tests with Au-foil insert were performed. We could get the best HIP bonding conditions for W and Cu-alloys with Au-foil as 1123K x 2hours x 147MPa. It was shown that the HIP temperature was 150K lower than that of without Au-foil. Furthermore, the tensile strength was similar to that of with without Au-foil. (author)
Handbook of graph grammars and computing by graph transformation
Engels, G; Kreowski, H J; Rozenberg, G
1999-01-01
Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph tran
Topics in graph theory graphs and their Cartesian product
Imrich, Wilfried; Rall, Douglas F
2008-01-01
From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.
Eliasson, Sigfus Thor; Dahl, Jon E
2017-01-01
Objectives: To evaluate the micro-tensile repair bond strength between aged and new composite, using silane and adhesives that were cured or left uncured when new composite was placed. Methods: Eighty Filtek Supreme XLT composite blocks and four control blocks were stored in water for two weeks and thermo-cycled. Sandpaper ground, etched and rinsed specimens were divided into two experimental groups: A, no further treatment and B, the surface was coated with bis-silane. Each group was divided into subgroups: (1) Adper Scotchbond Multi-Purpose, (2) Adper Scotchbond Multi-Purpose adhesive, (3) Adper Scotchbond Universal, (4) Clearfil SE Bond and (5) One Step Plus. For each adhesive group, the adhesive was (a) cured according to manufacturer's instructions or (b) not cured before repair. The substrate blocks were repaired with Filtek Supreme XLT. After aging, they were serially sectioned, producing 1.1 × 1.1 mm square test rods. The rods were prepared for tensile testing and tensile strength calculated at fracture. Type of fracture was examined under microscope. Results: Leaving the adhesive uncured prior to composite repair placement increased the mean tensile values statistically significant for all adhesives tested, with or without silane pretreatment. Silane surface treatment improved significantly ( p strength values for all adhesives, both for the cured and uncured groups. The mean strength of the control composite was higher than the strongest repair strength ( p strength. Not curing the adhesive before composite placement increased the tensile bond strength.
Method of bonding a conductive layer on an electrode of an electrochemical cell
Bowker, Jeffrey C.; Singh, Prabhakar
1989-01-01
A dense, electronically conductive interconnection layer 26 is bonded onto a porous, tubular, electronically conductive air electrode structure 16, optionally supported by a ceramic support 22, by (A) providing an air electrode surface, (B) forming on a selected portion of the electrode surface 24, without the use of pressure, particles of LaCrO.sub.3 doped with an element selected from the group consisting of Sr, Mg, Ca, Ba, Co, and mixtures thereof, where the particles have a deposit on their surface comprising calcium oxide and chromium oxide; (C) heating the particles with the oxide surface deposit in an oxidizing atmosphere at from 1,300.degree. C. to 1,550.degree. C., without the application of pressure, to provide a dense, sintered, interconnection material 26 bonded to the air electrode 16, where calcium and chromium from the surface deposit are incorporated into the structure of the LaCrO.sub.3. A solid electrolyte layer 18 can be applied to the uncovered portion of the air electrode, and a fuel electrode 20 can be applied to the solid electrolyte, to provide an electrochemical cell 10.
Carbon-tuned bonding method significantly enhanced the hydrogen storage of BN-Li complexes.
Deng, Qing-ming; Zhao, Lina; Luo, You-hua; Zhang, Meng; Zhao, Li-xia; Zhao, Yuliang
2011-11-01
Through first-principles calculations, we found doping carbon atoms onto BN monolayers (BNC) could significantly strengthen the Li bond on this material. Unlike the weak bond strength between Li atoms and the pristine BN layer, it is observed that Li atoms are strongly hybridized and donate their electrons to the doped substrate, which is responsible for the enhanced binding energy. Li adsorbed on the BNC layer can serve as a high-capacity hydrogen storage medium, without forming clusters, which can be recycled at room temperature. Eight polarized H(2) molecules are attached to two Li atoms with an optimal binding energy of 0.16-0.28 eV/H(2), which results from the electrostatic interaction of the polarized charge of hydrogen molecules with the electric field induced by positive Li atoms. This practical carbon-tuned BN-Li complex can work as a very high-capacity hydrogen storage medium with a gravimetric density of hydrogen of 12.2 wt%, which is much higher than the gravimetric goal of 5.5 wt % hydrogen set by the U.S. Department of Energy for 2015.
Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs
Jamour, Fuad Tarek
2017-10-17
Betweenness centrality quantifies the importance of nodes in a graph in many applications, including network analysis, community detection and identification of influential users. Typically, graphs in such applications evolve over time. Thus, the computation of betweenness centrality should be performed incrementally. This is challenging because updating even a single edge may trigger the computation of all-pairs shortest paths in the entire graph. Existing approaches cannot scale to large graphs: they either require excessive memory (i.e., quadratic to the size of the input graph) or perform unnecessary computations rendering them prohibitively slow. We propose iCentral; a novel incremental algorithm for computing betweenness centrality in evolving graphs. We decompose the graph into biconnected components and prove that processing can be localized within the affected components. iCentral is the first algorithm to support incremental betweeness centrality computation within a graph component. This is done efficiently, in linear space; consequently, iCentral scales to large graphs. We demonstrate with real datasets that the serial implementation of iCentral is up to 3.7 times faster than existing serial methods. Our parallel implementation that scales to large graphs, is an order of magnitude faster than the state-of-the-art parallel algorithm, while using an order of magnitude less computational resources.
Large-scale Graph Computation on Just a PC
2014-05-01
edges for several vertices simultaneously). We compared the performance of GraphChi-DB to Neo4j using their Java API (we discuss MySQL comparison in the...75 4.7.6 Comparison to RDBMS ( MySQL ) . . . . . . . . . . . . . . . . . . . . . 75 4.7.7 Summary of the...Windows method, GraphChi. The C++ implementation has circa 8,000 lines of code. We have also de- veloped a Java -version of GraphChi, but it does not
Whole Genome Phylogenetic Tree Reconstruction using Colored de Bruijn Graphs
Lyman, Cole
2017-01-01
We present kleuren, a novel assembly-free method to reconstruct phylogenetic trees using the Colored de Bruijn Graph. kleuren works by constructing the Colored de Bruijn Graph and then traversing it, finding bubble structures in the graph that provide phylogenetic signal. The bubbles are then aligned and concatenated to form a supermatrix, from which a phylogenetic tree is inferred. We introduce the algorithm that kleuren uses to accomplish this task, and show its performance on reconstructin...
Transduction on Directed Graphs via Absorbing Random Walks.
De, Jaydeep; Zhang, Xiaowei; Lin, Feng; Cheng, Li
2017-08-11
In this paper we consider the problem of graph-based transductive classification, and we are particularly interested in the directed graph scenario which is a natural form for many real world applications.Different from existing research efforts that either only deal with undirected graphs or circumvent directionality by means of symmetrization, we propose a novel random walk approach on directed graphs using absorbing Markov chains, which can be regarded as maximizing the accumulated expected number of visits from the unlabeled transient states. Our algorithm is simple, easy to implement, and works with large-scale graphs on binary, multiclass, and multi-label prediction problems. Moreover, it is capable of preserving the graph structure even when the input graph is sparse and changes over time, as well as retaining weak signals presented in the directed edges. We present its intimate connections to a number of existing methods, including graph kernels, graph Laplacian based methods, and interestingly, spanning forest of graphs. Its computational complexity and the generalization error are also studied. Empirically our algorithm is systematically evaluated on a wide range of applications, where it has shown to perform competitively comparing to a suite of state-of-the-art methods. In particular, our algorithm is shown to work exceptionally well with large sparse directed graphs with e.g. millions of nodes and tens of millions of edges, where it significantly outperforms other state-of-the-art methods. In the dynamic graph setting involving insertion or deletion of nodes and edge-weight changes over time, it also allows efficient online updates that produce the same results as of the batch update counterparts.
Bisseling, R.H.; Byrka, J.; Cerav-Erbas, S.; Gvozdenovic, N.; Lorenz, M.; Pendavingh, R.A.; Reeves, C.; Röger, M.; Verhoeven, A.; Berg, van den J.B.; Bhulai, S.; Hulshof, J.; Koole, G.; Quant, C.; Williams, J.F.
2006-01-01
Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph with vertices representing the programs of the system and arcs representing calls from one program to
Coloring geographical threshold graphs
Energy Technology Data Exchange (ETDEWEB)
Bradonjic, Milan [Los Alamos National Laboratory; Percus, Allon [Los Alamos National Laboratory; Muller, Tobias [EINDHOVEN UNIV. OF TECH
2008-01-01
We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.
Budhiraja, A.S.; Mukherjee, D.; Wu, R.
2017-01-01
We consider a variation of the supermarket model in which the servers can communicate with their neighbors and where the neighborhood relationships are described in terms of a suitable graph. Tasks with unit-exponential service time distributions arrive at each vertex as independent Poisson
DEFF Research Database (Denmark)
Kucharik, Marcel; Hofacker, Ivo; Stadler, Peter
2014-01-01
of the folding free energy landscape, however, can provide the relevant information. Results We introduce the basin hopping graph (BHG) as a novel coarse-grained model of folding landscapes. Each vertex of the BHG is a local minimum, which represents the corresponding basin in the landscape. Its edges connect...
Occupation times distribution for Brownian motion on graphs
Desbois, J
2002-01-01
Considering a Brownian motion on a general graph, we study the joint law for the occupation times on all the bonds. In particular, we show that the Laplace transform of this distribution can be expressed as the ratio of two determinants. We give two formulations, with arc or vertex matrices, for this result and discuss a simple example. (letter to the editor)
Directory of Open Access Journals (Sweden)
Jing Zhou
2014-01-01
Full Text Available According to the characteristics of emergency repair in overhead transmission line accidents, a complexity quantification method for emergency repair scheme is proposed based on the entropy method in software engineering, which is improved by using group AHP (analytical hierarchical process method and Petri net. Firstly, information structure chart model and process control flowchart model could be built by Petri net. Then impact factors on complexity of emergency repair scheme could be quantified into corresponding entropy values, respectively. Finally, by using group AHP method, weight coefficient of each entropy value would be given before calculating the overall entropy value for the whole emergency repair scheme. By comparing group AHP weighting method with average weighting method, experiment results for the former showed a stronger correlation between quantified entropy values of complexity and the actual consumed time in repair, which indicates that this new method is more valid.
The STAPL Parallel Graph Library
Harshvardhan,; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable
A Qualitative Approach to Sketch the Graph of a Function.
Alson, Pedro
1992-01-01
Presents a qualitative and global method of graphing functions that involves transformations of the graph of a known function in the cartesian coordinate system referred to as graphic operators. Explains how the method has been taught to students and some comments about the results obtained. (MDH)
García de la Vega, J M; Omar, S; San Fabián, J
2017-04-01
Spin-spin coupling constants in water monomer and dimer have been calculated using several wave function and density functional-based methods. CCSD, MCSCF, and SOPPA wave functions methods yield similar results, specially when an additive approach is used with the MCSCF. Several functionals have been used to analyze their performance with the Jacob's ladder and a set of functionals with different HF exchange were tested. Functionals with large HF exchange appropriately predict 1 J O H , 2 J H H and 2h J O O couplings, while 1h J O H is better calculated with functionals that include a reduced fraction of HF exchange. Accurate functionals for 1 J O H and 2 J H H have been tested in a tetramer water model. The hydrogen bond effects on these intramolecular couplings are additive when they are calculated by SOPPA(CCSD) wave function and DFT methods. Graphical Abstract Evaluation of the additive effect of the hydrogen bond on spin-spin coupling constants of water using WF and DFT methods.
Energy Technology Data Exchange (ETDEWEB)
Winlaw, Manda [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); De Sterck, Hans [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Sanders, Geoffrey [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2015-10-26
In very simple terms a network can be de ned as a collection of points joined together by lines. Thus, networks can be used to represent connections between entities in a wide variety of elds including engi- neering, science, medicine, and sociology. Many large real-world networks share a surprising number of properties, leading to a strong interest in model development research and techniques for building synthetic networks have been developed, that capture these similarities and replicate real-world graphs. Modeling these real-world networks serves two purposes. First, building models that mimic the patterns and prop- erties of real networks helps to understand the implications of these patterns and helps determine which patterns are important. If we develop a generative process to synthesize real networks we can also examine which growth processes are plausible and which are not. Secondly, high-quality, large-scale network data is often not available, because of economic, legal, technological, or other obstacles [7]. Thus, there are many instances where the systems of interest cannot be represented by a single exemplar network. As one example, consider the eld of cybersecurity, where systems require testing across diverse threat scenarios and validation across diverse network structures. In these cases, where there is no single exemplar network, the systems must instead be modeled as a collection of networks in which the variation among them may be just as important as their common features. By developing processes to build synthetic models, so-called graph generators, we can build synthetic networks that capture both the essential features of a system and realistic variability. Then we can use such synthetic graphs to perform tasks such as simulations, analysis, and decision making. We can also use synthetic graphs to performance test graph analysis algorithms, including clustering algorithms and anomaly detection algorithms.
Groupies in multitype random graphs
Shang, Yilun
2016-01-01
A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erd?s-R?nyi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.
Groupies in multitype random graphs.
Shang, Yilun
2016-01-01
A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.
Temporal Representation in Semantic Graphs
Energy Technology Data Exchange (ETDEWEB)
Levandoski, J J; Abdulla, G M
2007-08-07
A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.
Quantum walks on quotient graphs
International Nuclear Information System (INIS)
Krovi, Hari; Brun, Todd A.
2007-01-01
A discrete-time quantum walk on a graph Γ is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states the walk will be confined to a subspace of the original Hilbert space. Symmetries of the original graph, given by its automorphism group, can be inherited by the evolution operator. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup H of the automorphism group and illustrate it with examples. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup H used to construct it. The quotient graph is constructed by removing the symmetries of the subgroup H from the original graph. We then analyze the behavior of hitting times on quotient graphs. Hitting time is the average time it takes a walk to reach a given final vertex from a given initial vertex. It has been shown in earlier work [Phys. Rev. A 74, 042334 (2006)] that the hitting time for certain initial states of a quantum walks can be infinite, in contrast to classical random walks. We give a condition which determines whether the quotient graph has infinite hitting times given that they exist in the original graph. We apply this condition for the examples discussed and determine which quotient graphs have infinite hitting times. All known examples of quantum walks with hitting times which are short compared to classical random walks correspond to systems with quotient graphs much smaller than the original graph; we conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speedup
Tredwin, Christopher J; Georgiou, George; Kim, Hae-Won; Knowles, Jonathan C
2013-05-01
Hydroxyapatite (HA), fluor-hydroxyapatite (FHA) with varying levels of fluoride ion substitution and fluorapatite (FA) production has been characterised and optimised by the sol-gel method and the dissolution and biological properties of these materials were investigated. It was the objective of this study to investigate the potential bond strength and interaction of these materials with titanium. HA, FHA and FA were synthesised by a sol-gel method. Calcium nitrate and triethyl phosphite were used as precursors under an ethanol-water based solution. Different amounts of ammonium fluoride (NH4F) were incorporated for the preparation of the FHA and FA sol-gels. Using a spin coating technique the sol-gels were coated onto commercially pure titanium disks and crystallised at various temperatures. Using scanning electron microscopy (SEM) and elemental analysis, the surface characteristics, coating thickness and interaction of the Ti substrate and coating were investigated. The bond strengths of the coating to the Ti were investigated using an Instron Universal Load Testing Machine. Statistical analysis was performed with a two-way analysis of variance and post hoc testing with a Bonferroni correction. (1) Coating speed inversely influenced the coating thickness. (2) Increasing fluoride ion substitution and heating temperature significantly increased bond strength and (3) increasing fluoride ion substitution increased the coating thickness. FHA and FA synthesised using the sol-gel technique may offer a superior alternative to coating titanium implants with HA and plasma spraying. HA, FHA and FA materials synthesised by the sol-gel method may also have a use as bone grafting materials. Copyright © 2013 Academy of Dental Materials. Published by Elsevier Ltd. All rights reserved.
International Nuclear Information System (INIS)
Anderson, R.C.
1976-01-01
A method is described for joining beryllium to beryllium by diffusion bonding. At least one surface portion of at least two beryllium pieces is coated with nickel. A coated surface portion is positioned in a contiguous relationship with another surface portion and subjected to an environment having an atmosphere at a pressure lower than ambient pressure. A force is applied on the beryllium pieces for causing the contiguous surface portions to abut against each other. The contiguous surface portions are heated to a maximum temperature less than the melting temperature of the beryllium, and the applied force is decreased while increasing the temperature after attaining a temperature substantially above room temperature. A portion of the applied force is maintained at a temperature corresponding to about maximum temperature for a duration sufficient to effect the diffusion bond between the contiguous surface portions
Directory of Open Access Journals (Sweden)
Amal S Nair
2012-01-01
Conclusion: Surface conditioning with Co-Jet sand which produced silicatization resulted in a favorable bond strength in both feldspathic and IPS-Empress-2 ceramic surfaces. It was shown that it produced the least surface roughness among all the other surface conditioning groups.
A generalization of total graphs
Indian Academy of Sciences (India)
M Afkhami
2018-04-12
Apr 12, 2018 ... product of any lower triangular matrix with the transpose of any element of U belongs to U. The ... total graph of R, which is denoted by T( (R)), is a simple graph with all elements of R as vertices, and ...... [9] Badawi A, On dot-product graph of a commutative ring, Communications in Algebra 43 (2015). 43–50.
Graph transformation tool contest 2008
Rensink, Arend; van Gorp, Pieter
This special section is the outcome of the graph transformation tool contest organised during the Graph-Based Tools (GraBaTs) 2008 workshop, which took place as a satellite event of the International Conference on Graph Transformation (ICGT) 2008. The contest involved two parts: three “off-line case
On dominator colorings in graphs
Indian Academy of Sciences (India)
colors required for a dominator coloring of G is called the dominator .... Theorem 1.3 shows that the complete graph Kn is the only connected graph of order n ... Conversely, if a graph G satisfies condition (i) or (ii), it is easy to see that χd(G) =.
Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng
2015-12-01
Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.
AN EFFECTIVE RECOMMENDATIONS BY DIFFUSION ALGORITHM FOR WEB GRAPH MINING
Directory of Open Access Journals (Sweden)
S. Vasukipriya
2013-04-01
Full Text Available The information on the World Wide Web grows in an explosive rate. Societies are relying more on the Web for their miscellaneous needs of information. Recommendation systems are active information filtering systems that attempt to present the information items like movies, music, images, books recommendations, tags recommendations, query suggestions, etc., to the users. Various kinds of data bases are used for the recommendations; fundamentally these data bases can be molded in the form of many types of graphs. Aiming at provided that a general framework on effective DR (Recommendations by Diffusion algorithm for web graphs mining. First introduce a novel graph diffusion model based on heat diffusion. This method can be applied to both undirected graphs and directed graphs. Then it shows how to convert different Web data sources into correct graphs in our models.
Statistical mechanics of high-density bond percolation
Timonin, P. N.
2018-05-01
High-density (HD) percolation describes the percolation of specific κ -clusters, which are the compact sets of sites each connected to κ nearest filled sites at least. It takes place in the classical patterns of independently distributed sites or bonds in which the ordinary percolation transition also exists. Hence, the study of series of κ -type HD percolations amounts to the description of classical clusters' structure for which κ -clusters constitute κ -cores nested one into another. Such data are needed for description of a number of physical, biological, and information properties of complex systems on random lattices, graphs, and networks. They range from magnetic properties of semiconductor alloys to anomalies in supercooled water and clustering in biological and social networks. Here we present the statistical mechanics approach to study HD bond percolation on an arbitrary graph. It is shown that the generating function for κ -clusters' size distribution can be obtained from the partition function of the specific q -state Potts-Ising model in the q →1 limit. Using this approach we find exact κ -clusters' size distributions for the Bethe lattice and Erdos-Renyi graph. The application of the method to Euclidean lattices is also discussed.
Yamada, Takayuki; Takahashi, Mutsuya; Ozawa, Takashi; Tawara, Satoshi; Goto, Takayuki
2002-11-01
The purpose of this work is to demonstrate that a novel fabrication method for 3-D microstructures (FORMULA) is applicable to fabrication of micro mechanical parts with a large flexibility. This method is a kind of layer manufacturing method of thin films for metallic or dielectric microstructures using surface-activated bonding (SAB). The bonding interfaces of thin films are investigated by transmission electron microscope (TEM). Voids were observed at the interfaces of both pure aluminum films and Al-Cu alloy films. The ratio of void on the Al-Cu/Al-Cu interface is much larger than that of Al/Al interface, although the films have the same surface roughness of 3nm in Ra (average roughness). And approximately 10nm-thick amorphous intermediate layers were found at the interfaces. Furthermore, we have fabricated a micro gear of 900μm in diameter and 200μm in height, which is about ten times as large as our previous test pieces. Overhung structures such as a bridge structure and a cantilever were also fabricated without supporting layers beneath them.
A third-generation dispersion and third-generation hydrogen bonding corrected PM6 method: PM6-D3H+
Directory of Open Access Journals (Sweden)
Jimmy C. Kromann
2014-06-01
Full Text Available We present new dispersion and hydrogen bond corrections to the PM6 method, PM6-D3H+, and its implementation in the GAMESS program. The method combines the DFT-D3 dispersion correction by Grimme et al. with a modified version of the H+ hydrogen bond correction by Korth. Overall, the interaction energy of PM6-D3H+ is very similar to PM6-DH2 and PM6-DH+, with RMSD and MAD values within 0.02 kcal/mol of one another. The main difference is that the geometry optimizations of 88 complexes result in 82, 6, 0, and 0 geometries with 0, 1, 2, and 3 or more imaginary frequencies using PM6-D3H+ implemented in GAMESS, while the corresponding numbers for PM6-DH+ implemented in MOPAC are 54, 17, 15, and 2. The PM6-D3H+ method as implemented in GAMESS offers an attractive alternative to PM6-DH+ in MOPAC in cases where the LBFGS optimizer must be used and a vibrational analysis is needed, e.g., when computing vibrational free energies. While the GAMESS implementation is up to 10 times slower for geometry optimizations of proteins in bulk solvent, compared to MOPAC, it is sufficiently fast to make geometry optimizations of small proteins practically feasible.
Algorithms for Planar Graphs and Graphs in Metric Spaces
DEFF Research Database (Denmark)
Wulff-Nilsen, Christian
structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...
Community detection by graph Voronoi diagrams
Deritei, Dávid; Lázár, Zsolt I.; Papp, István; Járai-Szabó, Ferenc; Sumi, Róbert; Varga, Levente; Ravasz Regan, Erzsébet; Ercsey-Ravasz, Mária
2014-06-01
Accurate and efficient community detection in networks is a key challenge for complex network theory and its applications. The problem is analogous to cluster analysis in data mining, a field rich in metric space-based methods. Common to these methods is a geometric, distance-based definition of clusters or communities. Here we propose a new geometric approach to graph community detection based on graph Voronoi diagrams. Our method serves as proof of principle that the definition of appropriate distance metrics on graphs can bring a rich set of metric space-based clustering methods to network science. We employ a simple edge metric that reflects the intra- or inter-community character of edges, and a graph density-based rule to identify seed nodes of Voronoi cells. Our algorithm outperforms most network community detection methods applicable to large networks on benchmark as well as real-world networks. In addition to offering a computationally efficient alternative for community detection, our method opens new avenues for adapting a wide range of data mining algorithms to complex networks from the class of centroid- and density-based clustering methods.
Harary, Frank
2015-01-01
Presented in 1962-63 by experts at University College, London, these lectures offer a variety of perspectives on graph theory. Although the opening chapters form a coherent body of graph theoretic concepts, this volume is not a text on the subject but rather an introduction to the extensive literature of graph theory. The seminar's topics are geared toward advanced undergraduate students of mathematics.Lectures by this volume's editor, Frank Harary, include ""Some Theorems and Concepts of Graph Theory,"" ""Topological Concepts in Graph Theory,"" ""Graphical Reconstruction,"" and other introduc
Dynamic Representations of Sparse Graphs
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Fagerberg, Rolf
1999-01-01
We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....
Domination criticality in product graphs
Directory of Open Access Journals (Sweden)
M.R. Chithra
2015-07-01
Full Text Available A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G with connected domination number, γc(G=2,3 and characterize such graphs. Also, we characterize the k−γ-vertex (edge critical graphs and k−γc-vertex (edge critical graphs for k=2,3 where γ denotes the domination number of G. We also discuss the vertex criticality in grids.
Graph Creation, Visualisation and Transformation
Directory of Open Access Journals (Sweden)
Maribel Fernández
2010-03-01
Full Text Available We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive user interface. The editor uses the functionalities of the TULIP system, which gives us access to a wealth of visualisation algorithms. Interaction nets are not only a formalism for the specification of graphs, but also a rewrite-based computation model. We discuss graph rewriting strategies and a language to express them in order to perform strategic interaction net rewriting.
Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph
Nagarathinam, R.; Parvathi, N.
2018-04-01
Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat
Graph Sampling for Covariance Estimation
Chepuri, Sundeep Prabhakar
2017-04-25
In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean white noise and they admit a well-defined power spectrum whose shape is determined by the frequency response of the graph filter. Estimating the graph power spectrum forms an important component of stationary graph signal processing and related inference tasks such as Wiener prediction or inpainting on graphs. The central result of this paper is that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the second-order statistics of the graph signal from the subsampled observations, and more importantly, without any spectral priors. To this end, both a nonparametric approach as well as parametric approaches including moving average and autoregressive models for the graph power spectrum are considered. The results specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non-parametric and the moving average models, whereas a particular subsampling scheme that allows linear estimation for the autoregressive model is proposed. Numerical experiments on synthetic as well as real datasets related to climatology and processing handwritten digits are provided to demonstrate the developed theory.
Hendrix, William; Jenkins, John; Padmanabhan, Kanchana; Chakraborty, Arpan
2014-01-01
Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting patterns from graph data. It covers many basic and advanced techniques for the identification of anomalous or frequently recurring patterns in a graph, the discovery of groups or clusters of nodes that share common patterns of attributes and relationships, the extraction of patterns that distinguish one category of graphs from another, and the use of those patterns to predict the category of new graphs. Hands-On Application of Graph Data Mining Each chapter in the book focuses on a graph mining task, such as link analysis, cluster analysis, and classification. Through applications using real data sets, the book demonstrates how computational techniques can help solve real-world problems. The applications covered include network intrusion detection, tumor cell diagnostics, face recognition, predictive toxicology, mining metabolic and protein-protein interaction networks, and community detection in social networks. De...
Canonical Labelling of Site Graphs
Directory of Open Access Journals (Sweden)
Nicolas Oury
2013-06-01
Full Text Available We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with "many" automorphisms, and the partition refinement algorithm runs in sub-quadratic time for graphs with "few" bisimulation equivalences. This suite of algorithms was chosen based on the expectation that graphs fall in one of those two categories. If that is the case, a combined algorithm runs in sub-quadratic worst case time. Whether this expectation is reasonable remains an interesting open problem.
Learning heat diffusion graphs
Thanou, Dorina; Dong, Xiaowen; Kressner, Daniel; Frossard, Pascal
2016-01-01
Effective information analysis generally boils down to properly identifying the structure or geometry of the data, which is often represented by a graph. In some applications, this structure may be partly determined by design constraints or pre-determined sensing arrangements, like in road transportation networks for example. In general though, the data structure is not readily available and becomes pretty difficult to define. In particular, the global smoothness assumptions, that most of the...
Syed, M. Qasim; Lovatt, Ian
2014-01-01
This paper is an addition to the series of papers on the exponential function begun by Albert Bartlett. In particular, we ask how the graph of the exponential function y = e[superscript -t/t] would appear if y were plotted versus ln t rather than the normal practice of plotting ln y versus t. In answering this question, we find a new way to…
Understanding Charts and Graphs.
1987-07-28
Farenheit degrees, which have no Onaturalo zero ); finally, ratio scales have numbers that are ordered so that the magnitudes of differences are important and...system. They have to do with the very nature of how marks serve as meaningful symbols. In the ideal case, a chart or graph will be absolutely unambiguous...and these laws comprise this principle (see Stevens, 1974). Absolute discriminability: A minimal magnitude of a mark is necessary for it to be detected
Incremental Frequent Subgraph Mining on Large Evolving Graphs
Abdelhamid, Ehab
2017-08-22
Frequent subgraph mining is a core graph operation used in many domains, such as graph data management and knowledge exploration, bioinformatics and security. Most existing techniques target static graphs. However, modern applications, such as social networks, utilize large evolving graphs. Mining these graphs using existing techniques is infeasible, due to the high computational cost. In this paper, we propose IncGM+, a fast incremental approach for continuous frequent subgraph mining problem on a single large evolving graph. We adapt the notion of “fringe” to the graph context, that is the set of subgraphs on the border between frequent and infrequent subgraphs. IncGM+ maintains fringe subgraphs and exploits them to prune the search space. To boost the efficiency, we propose an efficient index structure to maintain selected embeddings with minimal memory overhead. These embeddings are utilized to avoid redundant expensive subgraph isomorphism operations. Moreover, the proposed system supports batch updates. Using large real-world graphs, we experimentally verify that IncGM+ outperforms existing methods by up to three orders of magnitude, scales to much larger graphs and consumes less memory.
GRAMI: Generalized Frequent Subgraph Mining in Large Graphs
El Saeedy, Mohammed El Sayed
2011-07-24
Mining frequent subgraphs is an important operation on graphs. Most existing work assumes a database of many small graphs, but modern applications, such as social networks, citation graphs or protein-protein interaction in bioinformatics, are modeled as a single large graph. Interesting interactions in such applications may be transitive (e.g., friend of a friend). Existing methods, however, search for frequent isomorphic (i.e., exact match) subgraphs and cannot discover many useful patterns. In this paper we propose GRAMI, a framework that generalizes frequent subgraph mining in a large single graph. GRAMI discovers frequent patterns. A pattern is a graph where edges are generalized to distance-constrained paths. Depending on the definition of the distance function, many instantiations of the framework are possible. Both directed and undirected graphs, as well as multiple labels per vertex, are supported. We developed an efficient implementation of the framework that models the frequency resolution phase as a constraint satisfaction problem, in order to avoid the costly enumeration of all instances of each pattern in the graph. We also implemented CGRAMI, a version that supports structural and semantic constraints; and AGRAMI, an approximate version that supports very large graphs. Our experiments on real data demonstrate that our framework is up to 3 orders of magnitude faster and discovers more interesting patterns than existing approaches.
International Nuclear Information System (INIS)
Pasqualini, R.; Comazzi, V.; Bellande, E.; Duatti, A.; Marchi, A.
1992-01-01
An improved method for the preparation of 99m Tc-radiopharmaceuticals containing the Tc≡N multiple bond, in sterile and apyrogen conditions, is described. This method is based on the reaction of [ 99m Tc] pertechnetate with ligands derived from S-methyl dithiocarbazate [H 2 N-N(R)-C(=S)SCH 3 (R = H, CH 3 )] in the presence of HC1 and tertiary phosphines. It was found that these derivatives can behave both as sources of nitride nitrogen ions (N 3- ) and as coordinating ligands. The reaction leads to the formation of intermediate technetium-nitrido complexes in high yield. These intermediate species can be used as suitable prereduced substrates for the preparation of technetium-nitrido radiopharmaceuticals through simple substitution reactions with appropriate exchanging ligands. (Author)
A graph algebra for scalable visual analytics.
Shaverdian, Anna A; Zhou, Hao; Michailidis, George; Jagadish, Hosagrahar V
2012-01-01
Visual analytics (VA), which combines analytical techniques with advanced visualization features, is fast becoming a standard tool for extracting information from graph data. Researchers have developed many tools for this purpose, suggesting a need for formal methods to guide these tools' creation. Increased data demands on computing requires redesigning VA tools to consider performance and reliability in the context of analysis of exascale datasets. Furthermore, visual analysts need a way to document their analyses for reuse and results justification. A VA graph framework encapsulated in a graph algebra helps address these needs. Its atomic operators include selection and aggregation. The framework employs a visual operator and supports dynamic attributes of data to enable scalable visual exploration of data.
Learning molecular energies using localized graph kernels
Ferré, Grégoire; Haut, Terry; Barros, Kipton
2017-03-01
Recent machine learning methods make it possible to model potential energy of atomic configurations with chemical-level accuracy (as calculated from ab initio calculations) and at speeds suitable for molecular dynamics simulation. Best performance is achieved when the known physical constraints are encoded in the machine learning models. For example, the atomic energy is invariant under global translations and rotations; it is also invariant to permutations of same-species atoms. Although simple to state, these symmetries are complicated to encode into machine learning algorithms. In this paper, we present a machine learning approach based on graph theory that naturally incorporates translation, rotation, and permutation symmetries. Specifically, we use a random walk graph kernel to measure the similarity of two adjacency matrices, each of which represents a local atomic environment. This Graph Approximated Energy (GRAPE) approach is flexible and admits many possible extensions. We benchmark a simple version of GRAPE by predicting atomization energies on a standard dataset of organic molecules.
Dynamic graph system for a semantic database
Mizell, David
2015-01-27
A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.
Kuramoto model for infinite graphs with kernels
Canale, Eduardo
2015-01-07
In this paper we study the Kuramoto model of weakly coupled oscillators for the case of non trivial network with large number of nodes. We approximate of such configurations by a McKean-Vlasov stochastic differential equation based on infinite graph. We focus on circulant graphs which have enough symmetries to make the computations easier. We then focus on the asymptotic regime where an integro-partial differential equation is derived. Numerical analysis and convergence proofs of the Fokker-Planck-Kolmogorov equation are conducted. Finally, we provide numerical examples that illustrate the convergence of our method.
A Similarity Search Using Molecular Topological Graphs
Directory of Open Access Journals (Sweden)
Yoshifumi Fukunishi
2009-01-01
Full Text Available A molecular similarity measure has been developed using molecular topological graphs and atomic partial charges. Two kinds of topological graphs were used. One is the ordinary adjacency matrix and the other is a matrix which represents the minimum path length between two atoms of the molecule. The ordinary adjacency matrix is suitable to compare the local structures of molecules such as functional groups, and the other matrix is suitable to compare the global structures of molecules. The combination of these two matrices gave a similarity measure. This method was applied to in silico drug screening, and the results showed that it was effective as a similarity measure.
Efficient Graph Computation for Node2Vec
Zhou, Dongyan; Niu, Songjie; Chen, Shimin
2018-01-01
Node2Vec is a state-of-the-art general-purpose feature learning method for network analysis. However, current solutions cannot run Node2Vec on large-scale graphs with billions of vertices and edges, which are common in real-world applications. The existing distributed Node2Vec on Spark incurs significant space and time overhead. It runs out of memory even for mid-sized graphs with millions of vertices. Moreover, it considers at most 30 edges for every vertex in generating random walks, causin...
Dullah, Hayana; Abidin Akasah, Zainal; Zaini Nik Soh, Nik Mohd; Mangi, Sajjad Ali
2017-11-01
The utilization of oil palm empty fruit bunch (OPEFB) fibre on bio-composite product has been introduced to replace current material mainly wood fibre. OPEFB is widely available as palm oil is one of the major agricultural crops in Malaysia. EFB fibre are lignocellulosic materials that could replace other natural fibre product especially cement bonded board. However, the contains of residual oil and sugar in EFB fibre has been detected to be the reason for incompatibility issue between EFB fibre and cement mixtures. Regarding on the issue, a study has been conducted widely on finding the suitable pre-treatment method for EFB fibre to remove carbohydrate contained in the said fibre that are known to inhibit cement hydration. Aside from that, cement accelerator was introduced to enhance the hydration of cement when it was mixed with natural fibre. Hence, this paper will summaries the previous findings and in-depth study on the use of EFB fibre as a replacement material in cement bonded fibre boards.
Graphs cospectral with a friendship graph or its complement
Directory of Open Access Journals (Sweden)
Alireza Abdollahi
2013-12-01
Full Text Available Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length $4$ or $5$, then $Gcong F_n$. Moreover if $G$ is connected and planar then $Gcong F_n$.All but one of connected components of $G$ are isomorphic to $K_2$.The complement $overline{F_n}$ of the friendship graph is determined by its adjacency eigenvalues, that is, if $overline{F_n}$ is cospectral with a graph $H$, then $Hcong overline{F_n}$.
Directory of Open Access Journals (Sweden)
Unil Yun
2016-05-01
Full Text Available Frequent graph mining has been proposed to find interesting patterns (i.e., frequent sub-graphs from databases composed of graph transaction data, which can effectively express complex and large data in the real world. In addition, various applications for graph mining have been suggested. Traditional graph pattern mining methods use a single minimum support threshold factor in order to check whether or not mined patterns are interesting. However, it is not a sufficient factor that can consider valuable characteristics of graphs such as graph sizes and features of graph elements. That is, previous methods cannot consider such important characteristics in their mining operations since they only use a fixed minimum support threshold in the mining process. For this reason, in this paper, we propose a novel graph mining algorithm that can consider various multiple, minimum support constraints according to the types of graph elements and changeable minimum support conditions, depending on lengths of graph patterns. In addition, the proposed algorithm performs in mining operations more efficiently because it can minimize duplicated operations and computational overheads by considering symmetry features of graphs. Experimental results provided in this paper demonstrate that the proposed algorithm outperforms previous mining approaches in terms of pattern generation, runtime and memory usage.
Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs
DEFF Research Database (Denmark)
Bensmail, Julien; Renault, Gabriel
2016-01-01
An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪⋯∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently co...
X-Graphs: Language and Algorithms for Heterogeneous Graph Streams
2017-09-01
are widely used by academia and industry. 15. SUBJECT TERMS Data Analytics, Graph Analytics, High-Performance Computing 16. SECURITY CLASSIFICATION...form the core of the DeepDive Knowledge Construction System. 2 INTRODUCTION The goal of the X-Graphs project was to develop computational techniques...memory multicore machine. Ringo is based on Snap.py and SNAP, and uses Python . Ringo now allows the integration of Delite DSL Framework Graph
Proving correctness of compilers using structured graphs
DEFF Research Database (Denmark)
Bahr, Patrick
2014-01-01
it into a compiler implementation using a graph type along with a correctness proof. The implementation and correctness proof of a compiler using a tree type without explicit jumps is simple, but yields code duplication. Our method provides a convenient way of improving such a compiler without giving up the benefits...
Label Information Guided Graph Construction for Semi-Supervised Learning.
Zhuang, Liansheng; Zhou, Zihan; Gao, Shenghua; Yin, Jingwen; Lin, Zhouchen; Ma, Yi
2017-09-01
In the literature, most existing graph-based semi-supervised learning methods only use the label information of observed samples in the label propagation stage, while ignoring such valuable information when learning the graph. In this paper, we argue that it is beneficial to consider the label information in the graph learning stage. Specifically, by enforcing the weight of edges between labeled samples of different classes to be zero, we explicitly incorporate the label information into the state-of-the-art graph learning methods, such as the low-rank representation (LRR), and propose a novel semi-supervised graph learning method called semi-supervised low-rank representation. This results in a convex optimization problem with linear constraints, which can be solved by the linearized alternating direction method. Though we take LRR as an example, our proposed method is in fact very general and can be applied to any self-representation graph learning methods. Experiment results on both synthetic and real data sets demonstrate that the proposed graph learning method can better capture the global geometric structure of the data, and therefore is more effective for semi-supervised learning tasks.
BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.
Vorburger, Robert S; Reischauer, Carolin; Boesiger, Peter
2013-02-01
Bootstrap methods have recently been introduced to diffusion-weighted magnetic resonance imaging to estimate the measurement uncertainty of ensuing diffusion parameters directly from the acquired data without the necessity to assume a noise model. These methods have been previously combined with deterministic streamline tractography algorithms to allow for the assessment of connection probabilities in the human brain. Thereby, the local noise induced disturbance in the diffusion data is accumulated additively due to the incremental progression of streamline tractography algorithms. Graph based approaches have been proposed to overcome this drawback of streamline techniques. For this reason, the bootstrap method is in the present work incorporated into a graph setup to derive a new probabilistic fiber tractography method, called BootGraph. The acquired data set is thereby converted into a weighted, undirected graph by defining a vertex in each voxel and edges between adjacent vertices. By means of the cone of uncertainty, which is derived using the wild bootstrap, a weight is thereafter assigned to each edge. Two path finding algorithms are subsequently applied to derive connection probabilities. While the first algorithm is based on the shortest path approach, the second algorithm takes all existing paths between two vertices into consideration. Tracking results are compared to an established algorithm based on the bootstrap method in combination with streamline fiber tractography and to another graph based algorithm. The BootGraph shows a very good performance in crossing situations with respect to false negatives and permits incorporating additional constraints, such as a curvature threshold. By inheriting the advantages of the bootstrap method and graph theory, the BootGraph method provides a computationally efficient and flexible probabilistic tractography setup to compute connection probability maps and virtual fiber pathways without the drawbacks of
Gupta, Neeraj; Kumar, Dilip; Palla, Aparna
2017-04-01
Orthodontists are commonly faced with the decision of what to do with debonded or inaccurately positioned brackets. An economical option to this dilemma is to recycle the brackets. Many recycling methods have been proposed, but the optimal bond strength of these recycled brackets needs further evaluation. Objectives: To evaluate and compare the effect of three recycling methods: (i) Sandblasting (ii) Sandblasting / direct flaming (iii) Sandblasting /direct flaming /acid bath solution on shear bond strength (SBS) of stainless steel brackets. Eighty human premolars were bonded with premolar stainless steel brackets as per manufacturer's instructions. The teeth were divided into 4 groups (n=20): Recycling and initial debonding was not done in Control group (Group I). After initial bonding, the brackets in the rest of the three experimental groups were debonded and recycled by following methods: (i) Sandblasting (Group II) (ii) Sandblasting /direct flaming (Group III) (iii) Sandblasting /direct flaming /acid bath solution (Group IV). Further the recycled brackets were bonded. The specimens were then subjected to testing in a Universal machine. The evaluation of the variation of the shear bond strength (SBS) among test groups was done using one-way ANOVA test and inter-experimental group comparison was done by Newman-Keuls multiple post hoc procedure. Group I (8.6510±1.3943MPa) showed the highest bond strength followed by Group II (5.0185±0.9758MPa), Group IV (2.30±0.65MPa) and Group III (2.0455± 0.6196MPa). Statistically significant variations existed in the shear bond strength (SBS) in all groups analyzed except between Group III and Group IV. The following conclusions were drawn from the study: 1. Shear bond strength of new brackets is significantly higher than the recycled brackets. 2. Brackets sandblasted with 90µm aluminium oxide particle air-abrasion showed significantly higher shear bond strength compared to direct flaming/sandblasting and direct flaming
Endomorphisms of graph algebras
DEFF Research Database (Denmark)
Conti, Roberto; Hong, Jeong Hee; Szymanski, Wojciech
2012-01-01
We initiate a systematic investigation of endomorphisms of graph C*-algebras C*(E), extending several known results on endomorphisms of the Cuntz algebras O_n. Most but not all of this study is focused on endomorphisms which permute the vertex projections and globally preserve the diagonal MASA D...... that the restriction to the diagonal MASA of an automorphism which globally preserves both D_E and the core AF-subalgebra eventually commutes with the corresponding one-sided shift. Secondly, we exhibit several properties of proper endomorphisms, investigate invertibility of localized endomorphisms both on C...
Yap, Hian-Poh
1996-01-01
This book provides an up-to-date and rapid introduction to an important and currently active topic in graph theory. The author leads the reader to the forefront of research in this area. Complete and easily readable proofs of all the main theorems, together with numerous examples, exercises and open problems are given. The book is suitable for use as a textbook or as seminar material for advanced undergraduate and graduate students. The references are comprehensive and so it will also be useful for researchers as a handbook.
Mining chemical reactions using neighborhood behavior and condensed graphs of reactions approaches.
de Luca, Aurélie; Horvath, Dragos; Marcou, Gilles; Solov'ev, Vitaly; Varnek, Alexandre
2012-09-24
This work addresses the problem of similarity search and classification of chemical reactions using Neighborhood Behavior (NB) and Condensed Graphs of Reaction (CGR) approaches. The CGR formalism represents chemical reactions as a classical molecular graph with dynamic bonds, enabling descriptor calculations on this graph. Different types of the ISIDA fragment descriptors generated for CGRs in combination with two metrics--Tanimoto and Euclidean--were considered as chemical spaces, to serve for reaction dissimilarity scoring. The NB method has been used to select an optimal combination of descriptors which distinguish different types of chemical reactions in a database containing 8544 reactions of 9 classes. Relevance of NB analysis has been validated in generic (multiclass) similarity search and in clustering with Self-Organizing Maps (SOM). NB-compliant sets of descriptors were shown to display enhanced mapping propensities, allowing the construction of better Self-Organizing Maps and similarity searches (NB and classical similarity search criteria--AUC ROC--correlate at a level of 0.7). The analysis of the SOM clusters proved chemically meaningful CGR substructures representing specific reaction signatures.
Analyzing locomotion synthesis with feature-based motion graphs.
Mahmudi, Mentar; Kallmann, Marcelo
2013-05-01
We propose feature-based motion graphs for realistic locomotion synthesis among obstacles. Among several advantages, feature-based motion graphs achieve improved results in search queries, eliminate the need of postprocessing for foot skating removal, and reduce the computational requirements in comparison to traditional motion graphs. Our contributions are threefold. First, we show that choosing transitions based on relevant features significantly reduces graph construction time and leads to improved search performances. Second, we employ a fast channel search method that confines the motion graph search to a free channel with guaranteed clearance among obstacles, achieving faster and improved results that avoid expensive collision checking. Lastly, we present a motion deformation model based on Inverse Kinematics applied over the transitions of a solution branch. Each transition is assigned a continuous deformation range that does not exceed the original transition cost threshold specified by the user for the graph construction. The obtained deformation improves the reachability of the feature-based motion graph and in turn also reduces the time spent during search. The results obtained by the proposed methods are evaluated and quantified, and they demonstrate significant improvements in comparison to traditional motion graph techniques.
Graph Algorithm Animation with Grrr
Rodgers, Peter; Vidal, Natalia
2000-01-01
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and profiling of Grrr code, but recently it has been extended for the purpose of teaching algorithms to undergraduate students. The animation is restricted to graph based algorithms such as graph drawing, list manipulation or more traditional gra...
Optimization Problems on Threshold Graphs
Directory of Open Access Journals (Sweden)
Elena Nechita
2010-06-01
Full Text Available During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset of the partition must have predeterminate properties, as well as combinations of such decompositions. In this paper we characterize threshold graphs using the weakly decomposition, determine: density and stability number, Wiener index and Wiener polynomial for threshold graphs.
Eulerian Graphs and Related Topics
Fleischner, Herbert
1990-01-01
The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering walks. They should appeal both to researchers and students, as they contain enough material for an undergraduate or graduate graph theory course which emphasizes Eulerian graphs, and thus can be read by any mathematician not yet familiar with graph theory. But they are also of interest to researchers in graph theory because they contain many recent results, some of which are only partial solutions to more general problems. A number of conjectures have been included as well. Various problems (such a
Cruzeiro, Vinícius Wilian D.; Roitberg, Adrian; Polfer, Nicolas C.
2016-01-01
In this work we are going to present how an interactive platform can be used as a powerful tool to allow students to better explore a foundational problem in quantum chemistry: the application of the variational method to the dihydrogen molecule using simple Gaussian trial functions. The theoretical approach for the hydrogen atom is quite…
Methods for surface treating metals, ceramics, and plastics before adhesive bonding
International Nuclear Information System (INIS)
Althouse, L.P.
1976-01-01
Methods for pretreating the surfaces of metals, ceramics, and plastics before they are coated with adhesive and used in assembly are described. The treatments recommended have been used successfully in the laboratory at LLL. Many are used in the assembly of nuclear devices. However, an unusual alloy or complex configuration may require trials before a specific surface treatment is chosen
Standard test methods for performance characteristics of metallic bonded resistance strain gages
American Society for Testing and Materials. Philadelphia
1992-01-01
1.1 The purpose of this standard is to provide uniform test methods for the determination of strain gauge performance characteristics. Suggested testing equipment designs are included. 1.2 Test Methods E 251 describes methods and procedures for determining five strain gauge parameters: Section Part I—General Requirements 7 Part II—Resistance at a Reference Temperature 8 Part III—Gauge Factor at a Reference Temperature 9 Part IV—Temperature Coefficient of Gauge Factor\t10 Part V—Transverse Sensitivity\t11 Part VI—Thermal Output\t12 1.3 Strain gauges are very sensitive devices with essentially infinite resolution. Their response to strain, however, is low and great care must be exercised in their use. The performance characteristics identified by these test methods must be known to an acceptable accuracy to obtain meaningful results in field applications. 1.3.1 Strain gauge resistance is used to balance instrumentation circuits and to provide a reference value for measurements since all data are...
Pollack, Rachel H.
2000-01-01
Notes trends toward increased borrowing by colleges and universities and offers guidelines for institutions that are considering issuing bonds to raise money for capital projects. Discussion covers advantages of using bond financing, how use of bonds impacts on traditional fund raising, other cautions and concerns, and some troubling aspects of…
Convertible bond valuation focusing on Chinese convertible bond market
Yang, Ke
2010-01-01
This paper mainly discusses the methods of valuation of convertible bonds in Chinese market. Different from common convertible bonds in European market, considering the complicate features of Chinese convertible bond, this paper represents specific pricing approaches for pricing convertible bonds with different provisions along with the increment of complexity of these provisions. More specifically, this paper represents the decomposing method and binomial tree method for pricing both of Non-...
Counting the number of Feynman graphs in QCD
Kaneko, T.
2018-05-01
Information about the number of Feynman graphs for a given physical process in a given field theory is especially useful for confirming the result of a Feynman graph generator used in an automatic system of perturbative calculations. A method of counting the number of Feynman graphs with weight of symmetry factor was established based on zero-dimensional field theory, and was used in scalar theories and QED. In this article this method is generalized to more complicated models by direct calculation of generating functions on a computer algebra system. This method is applied to QCD with and without counter terms, where many higher order are being calculated automatically.
Automatic Generation of Supervisory Control System Software Using Graph Composition
Nakata, Hideo; Sano, Tatsuro; Kojima, Taizo; Seo, Kazuo; Uchida, Tomoyuki; Nakamura, Yasuaki
This paper describes the automatic generation of system descriptions for SCADA (Supervisory Control And Data Acquisition) systems. The proposed method produces various types of data and programs for SCADA systems from equipment definitions using conversion rules. At first, this method makes directed graphs, which represent connections between the equipment, from equipment definitions. System descriptions are generated using the conversion rules, by analyzing these directed graphs, and finding the groups of equipment that involve similar operations. This method can make the conversion rules multi levels by using the composition of graphs, and can reduce the number of rules. The developer can define and manage these rules efficiently.
Directory of Open Access Journals (Sweden)
Yosveni Escalona Escalona
2013-06-01
Full Text Available Resumen El presente artículo propone una herramienta de resolución de problemas de cómputo basado en el Método de los Grafos Dicromáticos. Además, se describe la arquitectura diseñada, así como las herramientas y tecnologías empleadas para la implementación de la solución. La propuesta constituye un aporte al valor práctico del Método de los Grafos Dicromáticos tomando en cuenta la integración con otras herramientas existentes para la aplicación del dicho métodos en problemas ingenieriles. Abstract This paper proposes a tool for troubleshooting calculations based on the Dichromatic Graphs Method. It also describes the designed architecture as well as the tools and technologies used to implement solutions. The proposal is a contribution to the practical value of the Dichromatic Graphs Method, taking into account integration with other existing tools for the implementation of these methods in complex engineering problems
Yang, Xiao; Li, Huijian; Hu, Minzheng; Liu, Zeliang; Wärnå, John; Cao, Yuying; Ahuja, Rajeev; Luo, Wei
2018-04-01
A method to obtain the equivalent Poisson's ratio in chemical bonds as classical beams with finite element method was proposed from experimental data. The UFF (Universal Force Field) method was employed to calculate the elastic force constants of Zrsbnd O bonds. By applying the equivalent Poisson's ratio, the mechanical properties of single-wall ZrNTs (ZrO2 nanotubes) were investigated by finite element analysis. The nanotubes' Young's modulus (Y), Poisson's ratio (ν) of ZrNTs as function of diameters, length and chirality have been discussed, respectively. We found that the Young's modulus of single-wall ZrNTs is calculated to be between 350 and 420 GPa.
On the classification of plane graphs representing structurally stable rational Newton flows
Jongen, H.Th.; Jonker, P.; Twilt, F.
1991-01-01
We study certain plane graphs, called Newton graphs, representing a special class of dynamical systems which are closely related to Newton's iteration method for finding zeros of (rational) functions defined on the complex plane. These Newton graphs are defined in terms of nonvanishing angles
Energy Technology Data Exchange (ETDEWEB)
Maunz, Peter Lukas Wilhelm [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sterk, Jonathan David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lobser, Daniel [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Parekh, Ojas D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Ryan-Anderson, Ciaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2016-01-01
In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.
Advanced Corrections of Hydrogen Bonding and Dispersion for Semiempirical Quantum Mechanical Methods
Czech Academy of Sciences Publication Activity Database
Řezáč, Jan; Hobza, Pavel
2012-01-01
Roč. 8, č. 1 (2012), s. 141-151 ISSN 1549-9618 Grant - others:European Social Fund(XE) CZ.1.05/2.1.00/03.0058 Institutional research plan: CEZ:AV0Z40550506 Keywords : tight-binding method * noncovalent complexes * base -pairs * interaction energies Subject RIV: CF - Physical ; Theoretical Chemistry Impact factor: 5.389, year: 2012
G. O. Magomedov; I. V. Plotnikova; I. V. Kuznetsova; I. S. Naumchenko; I. A. Saranov
2017-01-01
Marshmallow is a sugar confectionary product with increased sugar content and energy value because of the significant content of carbohydrates, in particular sugar-sand. The main drawback of marshmallow is the rapid process of its drying during storage due to the crystallization of sucrose and the gradual removal of moisture from the product. A method for obtaining marshmallow without sugar on the basis of high-conversion glucose syrup. In the work, experimental studies were carried out to de...
Method and equipment to extract dissolved, suspended or chemically bonded substances from a liquid
International Nuclear Information System (INIS)
Bals, H.G.
1977-01-01
The method invented is especially for the recovery of uranium or other heavy metals too from seawater. The slight concentration of uranium in seawater sofar has not been worthwhile for a large technical recovery, especially as the hitherto known or proposed methods are mostly of an adsorption nature and the necessary equipment due to considerable disadvantages (such as e.g. too high a flow resistance with solid adsorber beds; too great an abrasion due to uncontrolled whirling motion of the adsorber particles; only discontinuous operation possible etc.) cannont be economically justified. In the method described here, a vertical upward flow through the adsorber bed is stabilized and made uniform before entering the bed by a special device (grid, sieve or holed plate) with about half the flow resistance compared to the adsorber bed, and is then slowed down uniformly by the enlarged cross-section like a diffusor. The adsorber particles are distributed uniformly over the flow cross-section kept in suspension for as long as the essential influencing parameters (weight, particle shape, flow rate etc.) experience no change. The gradual charging of the adsorber particles with heavy metal taken up from the solution and the thus involved gain in weight and the simultaneously increasing relative sinking rate cause a slow passage of the particles from the inlet to the outlet. Entrance and removal may go on continuously. (RB) [de
ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS
Said Broumi; Mohamed Talea; Assia Bakali; Florentin Smarandache
2016-01-01
In this article, we combine the concept of bipolar neutrosophic set and graph theory. We introduce the notions of bipolar single valued neutrosophic graphs, strong bipolar single valued neutrosophic graphs, complete bipolar single valued neutrosophic graphs, regular bipolar single valued neutrosophic graphs and investigate some of their related properties.
Application of graph theory to the morphological analysis of settlements
Directory of Open Access Journals (Sweden)
Szmytkie Robert
2017-12-01
Full Text Available In the following paper, the analyses of morphology of settlements were conducted using graph methods. The intention of the author was to create a quantifiable and simple measure, which, in a quantitative way, would express the degree of development of a graph (the spatial pattern of settlement. When analysing examples of graphs assigned to a set of small towns and large villages, it was noticed that the graph development index should depend on: a relative number of edges in relation to the number of nodes (β index, the number of cycles (urban blocks, which evidences the complexity of the spatial pattern of settlement, and the average rank of nodes of a graph, which expresses the degree of complexity of a street network.
A Graph Summarization Algorithm Based on RFID Logistics
Sun, Yan; Hu, Kongfa; Lu, Zhipeng; Zhao, Li; Chen, Ling
Radio Frequency Identification (RFID) applications are set to play an essential role in object tracking and supply chain management systems. The volume of data generated by a typical RFID application will be enormous as each item will generate a complete history of all the individual locations that it occupied at every point in time. The movement trails of such RFID data form gigantic commodity flowgraph representing the locations and durations of the path stages traversed by each item. In this paper, we use graph to construct a warehouse of RFID commodity flows, and introduce a database-style operation to summarize graphs, which produces a summary graph by grouping nodes based on user-selected node attributes, further allows users to control the hierarchy of summaries. It can cut down the size of graphs, and provide convenience for users to study just on the shrunk graph which they interested. Through extensive experiments, we demonstrate the effectiveness and efficiency of the proposed method.
A New Graph Drawing Scheme for Social Network
Directory of Open Access Journals (Sweden)
Eric Ke Wang
2014-01-01
visualization is employed to extract the potential information from the large scale of social network data and present the information briefly as visualized graphs. In the process of information visualization, graph drawing is a crucial part. In this paper, we study the graph layout algorithms and propose a new graph drawing scheme combining multilevel and single-level drawing approaches, including the graph division method based on communities and refining approach based on partitioning strategy. Besides, we compare the effectiveness of our scheme and FM3 in experiments. The experiment results show that our scheme can achieve a clearer diagram and effectively extract the community structure of the social network to be applied to drawing schemes.
Chemical bond fundamental aspects of chemical bonding
Frenking, Gernot
2014-01-01
This is the perfect complement to ""Chemical Bonding - Across the Periodic Table"" by the same editors, who are two of the top scientists working on this topic, each with extensive experience and important connections within the community. The resulting book is a unique overview of the different approaches used for describing a chemical bond, including molecular-orbital based, valence-bond based, ELF, AIM and density-functional based methods. It takes into account the many developments that have taken place in the field over the past few decades due to the rapid advances in quantum chemica
Graph Theory. 2. Vertex Descriptors and Graph Coloring
Directory of Open Access Journals (Sweden)
Lorentz JÄNTSCHI
2002-12-01
Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.
Efficient Extraction of High Centrality Vertices in Distributed Graphs
Energy Technology Data Exchange (ETDEWEB)
Kumbhare, Alok [Univ. of Southern California, Los Angeles, CA (United States); Frincu, Marc [Univ. of Southern California, Los Angeles, CA (United States); Raghavendra, Cauligi S. [Univ. of Southern California, Los Angeles, CA (United States); Prasanna, Viktor K. [Univ. of Southern California, Los Angeles, CA (United States)
2014-09-09
Betweenness centrality (BC) is an important measure for identifying high value or critical vertices in graphs, in variety of domains such as communication networks, road networks, and social graphs. However, calculating betweenness values is prohibitively expensive and, more often, domain experts are interested only in the vertices with the highest centrality values. In this paper, we first propose a partition-centric algorithm (MS-BC) to calculate BC for a large distributed graph that optimizes resource utilization and improves overall performance. Further, we extend the notion of approximate BC by pruning the graph and removing a subset of edges and vertices that contribute the least to the betweenness values of other vertices (MSL-BC), which further improves the runtime performance. We evaluate the proposed algorithms using a mix of real-world and synthetic graphs on an HPC cluster and analyze its strengths and weaknesses. The experimental results show an improvement in performance of upto 12x for large sparse graphs as compared to the state-of-the-art, and at the same time highlights the need for better partitioning methods to enable a balanced workload across partitions for unbalanced graphs such as small-world or power-law graphs.
On an edge partition and root graphs of some classes of line graphs
Directory of Open Access Journals (Sweden)
K Pravas
2017-04-01
Full Text Available The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.
Hackbusch, Sven
This dissertation encompasses work related to synthetic methods for the formation of ester linkages in organic compounds, as well as the investigation of the conformational influence of the ester functional group on the flexibility of inter-saccharide linkages, specifically, and the solution phase structure of ester-containing carbohydrate derivatives, in general. Stereoselective reactions are an important part of the field of asymmetric synthesis and an understanding of their underlying mechanistic principles is essential for rational method development. Here, the exploration of a diastereoselective O-acylation reaction on a trans-2-substituted cyclohexanol scaffold is presented, along with possible reasons for the observed reversal of stereoselectivity dependent on the presence or absence of an achiral amine catalyst. In particular, this work establishes a structure-activity relationship with regard to the trans-2-substituent and its role as a chiral auxiliary in the reversal of diastereoselectivity. In the second part, the synthesis of various ester-linked carbohydrate derivatives, and their conformational analysis is presented. Using multidimensional NMR experiments and computational methods, the compounds' solution-phase structures were established and the effect of the ester functional group on the molecules' flexibility and three-dimensional (3D) structure was investigated and compared to ether or glycosidic linkages. To aid in this, a novel Karplus equation for the C(sp2)OCH angle in ester-linked carbohydrates was developed on the basis of a model ester-linked carbohydrate. This equation describes the sinusoidal relationship between the C(sp2)OCH dihedral angle and the corresponding 3JCH coupling constant that can be determined from a J-HMBC NMR experiment. The insights from this research will be useful in describing the 3D structure of naturally occurring and lab-made ester-linked derivatives of carbohydrates, as well as guiding the de novo-design of
Stinson, Craig A; Xia, Yu
2016-06-21
Tandem mass spectrometry (MS/MS) coupled with soft ionization is established as an essential platform for lipid analysis; however, determining high order structural information, such as the carbon-carbon double bond (C[double bond, length as m-dash]C) location, remains challenging. Recently, our group demonstrated a method for sensitive and confident lipid C[double bond, length as m-dash]C location determination by coupling online the Paternò-Büchi (PB) reaction with nanoelectrospray ionization (nanoESI) and MS/MS. Herein, we aimed to expand the scope of the PB reaction for lipid analysis by enabling the reaction with infusion ESI-MS/MS at much higher flow rates than demonstrated in the nanoESI setup (∼20 nL min(-1)). In the new design, the PB reaction was effected in a fused silica capillary solution transfer line, which also served as a microflow UV reactor, prior to ESI. This setup allowed PB reaction optimization and kinetics studies. Under optimized conditions, a maximum of 50% PB reaction yield could be achieved for a standard glycerophosphocholine (PC) within 6 s of UV exposure over a wide flow rate range (0.1-10 μL min(-1)). A solvent composition of 7 : 3 acetone : H2O (with 1% acid or base modifier) allowed the highest PB yields and good lipid ionization, while lower yields were obtained with an addition of a variety of organic solvents. Radical induced lipid peroxidation was identified to induce undesirable side reactions, which could be effectively suppressed by eliminating trace oxygen in the solution via N2 purge. Finally, the utility of coupling the PB reaction with infusion ESI-MS/MS was demonstrated by analyzing a yeast polar lipid extract where C[double bond, length as m-dash]C bond locations were revealed for 35 glycerophospholipids (GPs).
Mapping ice-bonded permafrost with electrical methods in Sisimiut, West Greenland
DEFF Research Database (Denmark)
Ingeman-Nielsen, Thomas
2006-01-01
Permafrost delineation and thickness determination is of great importance in engineering related projects in arctic areas. In this paper, 2D geoelectrical measurements are applied and evaluated for permafrost mapping in an area in West Greenland. Multi-electrode resistivity profiles (MEP) have been...... collected and are compared with borehole information. It is shown that the permafrost thickness in this case is grossly overestimated by a factor of two to three. The difference between the inverted 2D resistivity sections and the borehole information is explained by macro-anisotropy due to the presence...... of horizontal ice-lenses in the frozen clay deposits. It is concluded that where the resistivity method perform well for lateral permafrost mapping, great care should be taken in evaluating permafrost thickness based on 2D resistivity profiles alone. Additional information from boreholes or other geophysical...
Creep analysis of adhesively bonded single lap joint using finite element method
International Nuclear Information System (INIS)
Zehsaz, Mohammad; Vakilitahami, Tahami Farid; Saeimisadigh, Mohammad Ali
2014-01-01
Adhesive joints are being used widely in engineering industries due to the increasing demand for designing lightweight structures. Because of the physical properties of the most adhesives, they creep even at room temperature. Therefore, the creep behavior of a single lap adhesive joint is studied in this paper. For this purpose, using the experimental data, creep constitutive equations for the adhesive has been obtained. Then, these equations have been employed to investigate the creep behavior of the joint. The results show that due to the creep straining, the stresses in the joint corners, decrease. However, creep strain accumulates in these areas which this in turn may lead to separation of adhesive from adherent. In order to eliminate the effect of strain accumulation, two modifying methods have been proposed in this paper: increasing the layer thickness and using filleted joints.
Surface morphology and molecular bonding of CaCO3 nanocrystallites by gas diffusion method
Sulimai, N. H.; Rani, Rozina Abdul; Khusaimi, Z.; Abdullah, S.; Salifairus, M. J.; Alrokayan, Salman; Khan, Haseeb; Rusop, M.
2018-05-01
Calcium carbonate with the chemical formula of (CaCO3) is the most abundant element in the world. Its usage on certain applications is largely affected by its properties. The best means to control its properties is through controlled preparation of CaCO3. This study uses diffusion method between the precursors Calcium Chloride and Ammonium Carbonate. Instead of using water, ethanol was used to prepare the salt. Reaction was done in room temperature (RT) for 6h-24h. Smallest average crystallite size measured by FESEM micrograph is 500nm produced by synthesis of CaCO3 reacted for 168 hours. From energy-dispersive X-ray spectrum also indicated the smallest particle size is by CaCO3 reacted for 168 hours. Changes was seen for element Ca at 3.7keV.
Dynamic graphs, community detection, and Riemannian geometry
Energy Technology Data Exchange (ETDEWEB)
Bakker, Craig; Halappanavar, Mahantesh; Visweswara Sathanur, Arun
2018-03-29
A community is a subset of a wider network where the members of that subset are more strongly connected to each other than they are to the rest of the network. In this paper, we consider the problem of identifying and tracking communities in graphs that change over time {dynamic community detection} and present a framework based on Riemannian geometry to aid in this task. Our framework currently supports several important operations such as interpolating between and averaging over graph snapshots. We compare these Riemannian methods with entry-wise linear interpolation and that the Riemannian methods are generally better suited to dynamic community detection. Next steps with the Riemannian framework include developing higher-order interpolation methods (e.g. the analogues of polynomial and spline interpolation) and a Riemannian least-squares regression method for working with noisy data.
The planar cubic Cayley graphs
Georgakopoulos, Agelos
2018-01-01
The author obtains a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. He obtains counterexamples to conjectures of Mohar, Bonnington and Watkins. The author's analysis makes the involved graphs accessible to computation, corroborating a conjecture of Droms.
Groupies in random bipartite graphs
Yilun Shang
2010-01-01
A vertex $v$ of a graph $G$ is called a groupie if its degree is notless than the average of the degrees of its neighbors. In thispaper we study the influence of bipartition $(B_1,B_2)$ on groupiesin random bipartite graphs $G(B_1,B_2,p)$ with both fixed $p$ and$p$ tending to zero.
Nested Dynamic Condition Response Graphs
DEFF Research Database (Denmark)
Hildebrandt, Thomas; Mukkamala, Raghava Rao; Slaats, Tijs
2012-01-01
We present an extension of the recently introduced declarative process model Dynamic Condition Response Graphs ( DCR Graphs) to allow nested subgraphs and a new milestone relation between events. The extension was developed during a case study carried out jointly with our industrial partner...
Bell inequalities for graph states
International Nuclear Information System (INIS)
Toth, G.; Hyllus, P.; Briegel, H.J.; Guehne, O.
2005-01-01
Full text: In the last years graph states have attracted an increasing interest in the field of quantum information theory. Graph states form a family of multi-qubit states which comprises many popular states such as the GHZ states and the cluster states. They also play an important role in applications. For instance, measurement based quantum computation uses graph states as resources. From a theoretical point of view, it is remarkable that graph states allow for a simple description in terms of stabilizing operators. In this contribution, we investigate the non-local properties of graph states. We derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, any graph state violates at least one of the inequalities. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positively of the partial transpose or the geometric measure of entanglement. (author)
Graph Sampling for Covariance Estimation
Chepuri, Sundeep Prabhakar; Leus, Geert
2017-01-01
specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non