Automated deadlock detection in synchronized reentrant multithreaded call-graphs
I. Grabe (Immo); F.S. de Boer (Frank); J. van Leeuwen (Jan); A. Muscholl; D. Peleg; J. Pokorny; B. Rumpe
2010-01-01
textabstractIn this paper we investigate the synchronization of multithreaded call graphs with reentrance similar to call graphs in Java programs. We model the individual threads as Visibly Pushdown Automata (VPA) and analyse the reachability of a state in the product automaton by means of a Context
On support relations and semantic scene graphs
Yang, Michael Ying; Liao, Wentong; Ackermann, Hanno; Rosenhahn, Bodo
2017-09-01
Scene understanding is one of the essential and challenging topics in computer vision and photogrammetry. Scene graph provides valuable information for such scene understanding. This paper proposes a novel framework for automatic generation of semantic scene graphs which interpret indoor environments. First, a Convolutional Neural Network is used to detect objects of interest in the given image. Then, the precise support relations between objects are inferred by taking two important auxiliary information in the indoor environments: the physical stability and the prior support knowledge between object categories. Finally, a semantic scene graph describing the contextual relations within a cluttered indoor scene is constructed. In contrast to the previous methods for extracting support relations, our approach provides more accurate results. Furthermore, we do not use pixel-wise segmentation to obtain objects, which is computation costly. We also propose different methods to evaluate the generated scene graphs, which lacks in this community. Our experiments are carried out on the NYUv2 dataset. The experimental results demonstrated that our approach outperforms the state-of-the-art methods in inferring support relations. The estimated scene graphs are accurately compared with ground truth.
Wang, Rui
2012-01-01
This is a cookbook full of recipes with practical examples enriched with code and the required screenshots for easy and quick comprehension. You should be familiar with the basic concepts of the OpenSceneGraph API and should be able to write simple programs. Some OpenGL and math knowledge will help a lot, too.
High-extensible scene graph framework based on component techniques
LI Qi-cheng; WANG Guo-ping; ZHOU Feng
2006-01-01
In this paper, a novel component-based scene graph is proposed, in which all objects in the scene are classified to different entities, and a scene can be represented as a hierarchical graph composed of the instances of entities. Each entity contains basic data and its operations which are encapsulated into the entity component. The entity possesses certain behaviours which are responses to rules and interaction defined by the high-level application. Such behaviours can be described by script or behaviours model. The component-based scene graph in the paper is more abstractive and high-level than traditional scene graphs. The contents of a scene could be extended flexibly by adding new entities and new entity components, and behaviour modification can be obtained by modifying the model components or behaviour scripts. Its robustness and efficiency are verified by many examples implemented in the Virtual Scenario developed by Peking University.
Algorithms for Graph Rigidity and Scene Analysis
Berg, Alex Rune; Jordán, Tibor
2003-01-01
We investigate algorithmic questions and structural problems concerning graph families defined by `edge-counts'. Motivated by recent developments in the unique realization problem of graphs, we give an efficient algorithm to compute the rigid, redundantly rigid, M-connected, and globally rigid...... by showing that 2d-connected bipartite graphs are d-tight. We give a new algorithm for finding a maximal d-sharp subgraph. We also answer a question of Imai and show that finding a maximum size d-sharp subgraph is NP-hard....
Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory
Pearce, Roger
2010-11-01
Processing large graphs is becoming increasingly important for many domains such as social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do not scale with increasing graph sizes. As a result, researchers have attempted to meet the growing data demands using parallel and external memory techniques. We present a novel asynchronous approach to compute Breadth-First-Search (BFS), Single-Source-Shortest-Paths, and Connected Components for large graphs in shared memory. Our highly parallel asynchronous approach hides data latency due to both poor locality and delays in the underlying graph data storage. We present an experimental study applying our technique to both In-Memory and Semi-External Memory graphs utilizing multi-core processors and solid-state memory devices. Our experiments using synthetic and real-world datasets show that our asynchronous approach is able to overcome data latencies and provide significant speedup over alternative approaches. For example, on billion vertex graphs our asynchronous BFS scales up to 14x on 16-cores. © 2010 IEEE.
A speedup technique for dynamic graphs using partitioning strategy and multithreaded approach
R. Kalpana
2014-01-01
Full Text Available There are many pre-processing-based speedup techniques for shortest path problems that are available in the literature. These techniques have an increased demand because of large datasets in such applications such as roadmaps, web search engines and mobile data sets. Pre-processing for the Time-Dependent Shortest Path Problem is still a demanding process that involves graph or network partitioning strategy. Efficient pre-processing of graphs or networks reduces the shortest path computation time while parallelizing the pre-processing phase improves the speedup of the system. In this paper, a speedup technique called Recursive Spectral Bisection (RSB combined with the Elliptic Convolution of the shortest path method is proposed for dynamic Time-Dependent networks. The same method has been parallelized, and the results are tested on three types of graphs. It is observed that the Time-Dependent RSB combined with the Elliptic Convolution of the shortest path method has no update time, and the Query Performance Loss (QPL is reduced in planar and road networks compared to random networks. In road networks, the proposed method achieves an average speedup in a QPL of 140. The use of the Parallel speedup technique results in an average speedup in a QPL of more than 1 in the planar and road networks.
Nemirovsky, Mario
2013-01-01
Multithreaded architectures now appear across the entire range of computing devices, from the highest-performing general purpose devices to low-end embedded processors. Multithreading enables a processor core to more effectively utilize its computational resources, as a stall in one thread need not cause execution resources to be idle. This enables the computer architect to maximize performance within area constraints, power constraints, or energy constraints. However, the architectural options for the processor designer or architect looking to implement multithreading are quite extensive and
Using Both a Probabilistic Evolutionary Graph and the Evidence Theory for Color Scene Analysis
Nassim Ammour
2008-01-01
Full Text Available In this research, we introduce a new color images segmentation algorithm. The color scene analytic method is based on the progress of a probabilistic evolutionary graph. The strategy consists in making grow an evolutionary graph, which presents the scene elements in an unsupervised segmented image. The graph evolution development is based on the computation of the belonging probabilities to the existing classes of the last built region. The space composition matrix of the areas in each class is then given. A space delimitation map of the regions is established by a new method of contour localization and refinement. At last, the final segmented image is established by classification of the pixels in the conflict region using the Dempster-Shafer evidence theory. The effectiveness of the method is demonstrated on real images.
- and Graph-Based Point Cloud Segmentation of 3d Scenes Using Perceptual Grouping Laws
Xu, Y.; Hoegner, L.; Tuttas, S.; Stilla, U.
2017-05-01
Segmentation is the fundamental step for recognizing and extracting objects from point clouds of 3D scene. In this paper, we present a strategy for point cloud segmentation using voxel structure and graph-based clustering with perceptual grouping laws, which allows a learning-free and completely automatic but parametric solution for segmenting 3D point cloud. To speak precisely, two segmentation methods utilizing voxel and supervoxel structures are reported and tested. The voxel-based data structure can increase efficiency and robustness of the segmentation process, suppressing the negative effect of noise, outliers, and uneven points densities. The clustering of voxels and supervoxel is carried out using graph theory on the basis of the local contextual information, which commonly conducted utilizing merely pairwise information in conventional clustering algorithms. By the use of perceptual laws, our method conducts the segmentation in a pure geometric way avoiding the use of RGB color and intensity information, so that it can be applied to more general applications. Experiments using different datasets have demonstrated that our proposed methods can achieve good results, especially for complex scenes and nonplanar surfaces of objects. Quantitative comparisons between our methods and other representative segmentation methods also confirms the effectiveness and efficiency of our proposals.
Chip Multithreaded Consistency Model
Zu-Song Li; Dan-Dan Huan; Wei-Wu Hu; Zhi-Min Tang
2008-01-01
Multithreaded technique is the developing trend of high performance processor. Memory consistency model is essential to the correctness, performance and complexity of multithreaded processor. The chip multithreaded consistency model adapting to multithreaded processor is proposed in this paper. The restriction imposed on memory event ordering by chip multithreaded consistency is presented and formalized. With the idea of critical cycle built by Wei-Wu Hu, we prove that the proposed chip multithreaded consistency model satisfies the criterion of correct execution of sequential consistency model. Chip multithreaded consistency model provides a way of achieving high performance compared with sequential consistency model and ensures the compatibility of software that the execution result in multithreaded processor is the same as the execution result in uniprocessor. The implementation strategy of chip multithreaded consistency model in Godson-2 SMT processor is also proposed. Godson-2 SMT processor supports chip multithreaded consistency model correctly by exception scheme based on the sequential memory access queue of each thread.
Ljumovic, Milos
2014-01-01
The book is an easy-to-follow guide for creating multi-threaded applications using C++. Each topic is thoroughly explained with multiple illustrations. Many algorithms, such as Dinning Philosophers Problem give you thorough explanations that will help you to understand and solve concurrent tasks. The book is intended for enterprise developers and programmers who wish to make use of C++ capabilities to learn the multithreaded approach. Knowledge of multithreading along with experience in C++ is an added advantage. However it is not a prerequisite.
A Novel Multithreaded Algorithm For Extracting Maximal Chordal Subgraphs
Halappanavar, Mahantesh; Feo, John T.; Dempsey, Kathryn; Ali, Hesham; Bhowmick, Sanjukta
2012-10-25
Chordal graphs are triangulated graphs where any cycle larger than three is bisected by a chord. Many combinatorial optimization problems such as computing the minimum fill-in, the size of the maximum clique and the chromatic number are NP-hard on general graphs but have polynomial time solutions on chordal graphs. In this paper, we present a novel multithreaded algorithm to extract a maximal chordal subgraph from a general graph. Our algorithm is based on an iterative approach where each thread can asynchronously update a subset of edges that are dynamically assigned to it. We implement our algorithm on two different multithreaded architectures – Cray XMT, a massively multithreaded platform, and AMD Magny-Cours, a shared memory multicore platform. In addition to the proof of correctness, we present the performance of our algorithm using a testset of carefully generated synthetical graphs with up to half-a-billion edges and real world networks from gene correlation studies. We demonstrate that our algorithm achieves high scalability for all inputs on both types of architectures.
Multithreading in C# 5.0 cookbook
Agafonov, Eugene
2013-01-01
Cookbook.Multithreading in C# 5.0 Cookbook is written for existing C# developers who want a complete, professional, and authoritative guide to multithreading. You don't need any experience with multithreaded programming to use this book.
Software Activation Using Multithreading
Jianrui Zhang
2012-11-01
Full Text Available Software activation is an anti-piracy technology designed to verify that software products have been legitimately licensed. Activation should be quick and simple while simultaneously being secure and protecting customer privacy. The most common form of software activation is for the user to enter a legitimate product serial number. However, software activation based on serial numbers appears to be weak, since cracks for many programs are readily available on the Internet. Users can employ such cracks to bypass software activation.Serial number verification logic usually executes sequentially in a single thread. Such an approach is relatively easy to break since attackers can trace the code to understand how the logic works. In this paper, we develop a practical multi-threaded verification design. Our results show that by proper use of multi-threading, the amount of traceable code in a debugger can be reduced to a low percentage of the total and the traceable code in each run can differ as well. This makes it significantly more difficult for an attacker to reverse engineer the code as a means of bypassing a security check. Finally, we attempt to quantify the increased effort needed to break our verification logic.
马小龙; 李成名; 赵占杰
2014-01-01
针对三维道路场景中多条道路交叉时出现的单纯重叠问题，基于开源三维图形渲染引擎 OSG (OpenSceneGraph)，提出一种三维道路交叉口的自动检测与建模方法，该方法通过分析道路矢量数据的存储特点及道路交叉口的设计规范，快速获取交叉口区域并识别其所属类型，结合计算机图形学和OSG场景渲染技术实现道路交叉口的自动建模。试验表明，该方法可有效解决三叉型、四叉型、环岛型和分离式立体交叉口的一键式生产，无须人工干预，为大数据三维道路场景的快速构建提供了有效方法。%Targeting the simple overlap arising when multiple roads intersect in a threeGdimensional road scene,an automatic detection and modeling method is provided for 3D road intersections on the basis of openGsource 3D rendering engine OSG (OpenSceneGraph).In this method,by analyzing road vectorGdata storage characteristics and intersection design specifications,an intersection area can be quickly captured or formed,with its type being identified simultaneously,so as to achieve its automatic modeling by means of computer graphics and OSG scene rendering technique.The experiment proves that this method has effectually solved oneGbutton generation of threeGway,fourGway,roundabout,and separate 3D intersecG tions,without the need of manual intervention,serving as a foundation for the quick construction of future bigGdata 3DGroad scenes.
Evaluating the multi-threading countermeasure
Frieslaar, Ibraheem
2016-12-01
Full Text Available This research investigates the resistance of the multi-threaded countermeasure to side channel analysis (SCA) attacks. The multi-threaded countermeasure is attacked using the Correlation Power Analysis (CPA) and template attacks. Additionally...
Multi-threaded Object Streaming
Pfeiffer, Andreas; Govi, Giacomo; Ojeda, Miguel; Sipos, Roland
2015-01-01
The CMS experiment at CERNs Large Hadron Collider in Geneva redesigned the code handling the conditions data during the last years, aiming to increase performance and enhance maintainability. The new design includes a move to serialise all payloads before storing them into the database, allowing the handling of the payloads in external tools independent of a given software release. In this talk we present the results of performance studies done using the serialisation package from the Boost suite as well as serialisation done with the ROOT (v5) tools. Furthermore, as the Boost tools allow parallel (de-)serialisation, we show the performance gains achieved with parallel threads when de-serialising a realistic set of conditions in CMS. Without specific optimisations an overall speed up of a factor of 3-4 was achieved using multi-threaded loading and de-serialisation of our conditions.
Verifying speculative multithreading in an application
Felton, Mitchell D
2014-11-18
Verifying speculative multithreading in an application executing in a computing system, including: executing one or more test instructions serially thereby producing a serial result, including insuring that all data dependencies among the test instructions are satisfied; executing the test instructions speculatively in a plurality of threads thereby producing a speculative result; and determining whether a speculative multithreading error exists including: comparing the serial result to the speculative result and, if the serial result does not match the speculative result, determining that a speculative multithreading error exists.
Semantic Reasoning for Scene Interpretation
Jensen, Lars Baunegaard With; Baseski, Emre; Pugeault, Nicolas
2008-01-01
In this paper, we propose a hierarchical architecture for representing scenes, covering 2D and 3D aspects of visual scenes as well as the semantic relations between the different aspects. We argue that labeled graphs are a suitable representational framework for this representation and demonstrat...
Multithreading for Embedded Reconfigurable Multicore Systems
Zaykov, P.G.
2014-01-01
In this dissertation, we address the problem of performance efficient multithreading execution on heterogeneous multicore embedded systems. By heterogeneous multicore embedded systems we refer to those, which have real-time requirements and consist of processor tiles with General Purpose Processor
A 3D Scene Graph Cut-Based Dense Reconstruction Algorithm%一种基于图割的稠密三维场景重建算法
徐刚; 刘彬; 李海滨
2011-01-01
Stereo vision plays a very important role in environment perception of the autonomous exploration robot, by which the dense reconstruction result of the 3D scene can be derived. In this paper, the candidate matching algorithm combined with graph cut theory is proposed to solve the stereo correspondence problem. First, the mesh grid representing depth is constructed in the world coordinate system. Second, most of the candidates can be pruned according to an area matching algorithm, and the remaining nodes are used to form a graph. Finally, the global energy minimization could be achieved by finding minimum cut in the graph, and the 3D scene reconstruction would be fulfilled. The experimental result shows that a tradeoff between performance and efficiency could be achieved when threshold y was set to 0.6. The problem of matching ambiguity is solved by using the graph cut algorithm, and a better performance can be achieved in coarse texture region.%立体视觉技术是自主探测机器人在未知环境中获取信息的重要手段,通过对可视场景的稠密三维重建实现导航、定位及路径规划等一系列工作.本文在候选点匹配的基础上结合图割理论,首先在世界坐标系建立代表深度信息的网格节点,接着依据区域匹配算法对候选点进行初步筛选,去除大部分相关值较低的节点,建立简化的网格图,最后通过寻找图中最小割来实现能量函数的全局最小,完成稠密的三维场景重建.实验证明,相关阈值γ设为0.6时,简化网格图的重建精度和计算效率达到相对平衡.图割算法解决了候选点测量时潜在的匹配歧义问题,且对低纹理区域有较好的匹配效果.
Accelerating semantic graph databases on commodity clusters
Morari, Alessandro; Castellana, Vito G.; Haglin, David J.; Feo, John T.; Weaver, Jesse R.; Tumeo, Antonino; Villa, Oreste
2013-10-06
We are developing a full software system for accelerating semantic graph databases on commodity cluster that scales to hundreds of nodes while maintaining constant query throughput. Our framework comprises a SPARQL to C++ compiler, a library of parallel graph methods and a custom multithreaded runtime layer, which provides a Partitioned Global Address Space (PGAS) programming model with fork/join parallelism and automatic load balancing over a commodity clusters. We present preliminary results for the compiler and for the runtime.
A Multithreaded Missions And Means Framework (MMF) Concept Report
2012-03-01
A Multithreaded Missions and Means Framework ( MMF ) Concept Report by Peter J. Grazaitis and Brian G. Ruth ARL-TR-5948 March 2012...A Multithreaded Missions and Means Framework ( MMF ) Concept Report Peter J. Grazaitis Human Research and Engineering Directorate, ARL Brian G...TYPE Final 3. DATES COVERED (From - To) 1 October 2010–20 September 2011 4. TITLE AND SUBTITLE A Multithreaded Missions and Means Framework ( MMF
LDRD final report : massive multithreading applied to national infrastructure and informatics.
Henderson, Bruce A.; Murphy, Richard C.; Wheeler, Kyle; Mackey, Gregory; Berry, Jonathan W.; LaViolette, Randall A.; Mancke, Brad; Barrett, Brian W.; Phillips, Cynthia Ann; Pinar, Ali; Leung, Vitus Joseph
2009-09-01
Large relational datasets such as national-scale social networks and power grids present different computational challenges than do physical simulations. Sandia's distributed-memory supercomputers are well suited for solving problems concerning the latter, but not the former. The reason is that problems such as pattern recognition and knowledge discovery on large networks are dominated by memory latency and not by computation. Furthermore, most memory requests in these applications are very small, and when the datasets are large, most requests miss the cache. The result is extremely low utilization. We are unlikely to be able to grow out of this problem with conventional architectures. As the power density of microprocessors has approached that of a nuclear reactor in the past two years, we have seen a leveling of Moores Law. Building larger and larger microprocessor-based supercomputers is not a solution for informatics and network infrastructure problems since the additional processors are utilized to only a tiny fraction of their capacity. An alternative solution is to use the paradigm of massive multithreading with a large shared memory. There is only one instance of this paradigm today: the Cray MTA-2. The proposal team has unique experience with and access to this machine. The XMT, which is now being delivered, is a Red Storm machine with up to 8192 multithreaded 'Threadstorm' processors and 128 TB of shared memory. For many years, the XMT will be the only way to address very large graph problems efficiently, and future generations of supercomputers will include multithreaded processors. Roughly 10 MTA processor can process a simple short paths problem in the time taken by the Gordon Bell Prize-nominated distributed memory code on 32,000 processors of Blue Gene/Light. We have developed algorithms and open-source software for the XMT, and have modified that software to run some of these algorithms on other multithreaded platforms such as the Sun
A New Multithreaded Architecture Supporting Direct Execution of Esterel
Yuan Simon
2009-01-01
Full Text Available Abstract We propose a fully pipelined, multithreaded, reactive processor called STARPro for direct execution of Esterel. STARPro provides native support for Esterel threads and their scheduling. In addition, it also natively supports Esterel's preemption constructs, instructions for signal manipulation, and a notion of logical ticks for synchronous execution. In addition to the reactive processors, we propose a new intermediate format called unrolled concurrent control-flow graph with surface and depth ( that closely resembles the Esterel source. A compiler, based on , has been developed for code generation. We have synthesized STARPro and have carried out a range of benchmarking experiments. Experimental results reveal substantial improvement in performance and code size compared to software compilers. We also excel in comparison to recent reactive architectures, by achieving an average speed-up of 37% in worst-case reaction times and a speed-up of 38% in average-case reaction times. This has been achieved by utilizing fewer hardware resources, while incurring an average code size increase of 40%.
Mutual Exclusion Principle for Multithreaded Web Crawlers
Kartik Kumar Perisetla
2012-09-01
Full Text Available This paper describes mutual exclusion principle for multithreaded web crawlers. The existing web crawlers use data structures to hold frontier set in local address space. This space could be used to run more crawler threads for faster operation. All crawler threads fetch the URL to crawl from the centralized frontier. The mutual exclusion principle is used to provide access to frontier for each crawler thread in synchronized manner to avoid deadlock. The approach to utilize the waiting time on mutual exclusion lock in efficient manner has been discussed in detail.
Confidentiality for Probabilistic Multi-Threaded Programs and Its Verification
Ngo, Minh Tri; Stoelinga, Mariëlle Ida Antoinette; Huisman, Marieke
2012-01-01
Confidentiality is an important concern in today's information society: electronic payment and personal data should be protected appropriately. This holds in particular for multi-threaded applications, which are generally seen the future of high-performance computing. Multi-threading poses new
The Tera Multithreaded Architecture and Unstructured Meshes
Bokhari, Shahid H.; Mavriplis, Dimitri J.
1998-01-01
The Tera Multithreaded Architecture (MTA) is a new parallel supercomputer currently being installed at San Diego Supercomputing Center (SDSC). This machine has an architecture quite different from contemporary parallel machines. The computational processor is a custom design and the machine uses hardware to support very fine grained multithreading. The main memory is shared, hardware randomized and flat. These features make the machine highly suited to the execution of unstructured mesh problems, which are difficult to parallelize on other architectures. We report the results of a study carried out during July-August 1998 to evaluate the execution of EUL3D, a code that solves the Euler equations on an unstructured mesh, on the 2 processor Tera MTA at SDSC. Our investigation shows that parallelization of an unstructured code is extremely easy on the Tera. We were able to get an existing parallel code (designed for a shared memory machine), running on the Tera by changing only the compiler directives. Furthermore, a serial version of this code was compiled to run in parallel on the Tera by judicious use of directives to invoke the "full/empty" tag bits of the machine to obtain synchronization. This version achieves 212 and 406 Mflop/s on one and two processors respectively, and requires no attention to partitioning or placement of data issues that would be of paramount importance in other parallel architectures.
Multithreaded Implementation of Hybrid String Matching Algorithm
Akhtar Rasool
2012-03-01
Full Text Available Reading and taking reference from many books and articles, and then analyzing the Navies algorithm, Boyer Moore algorithm and Knuth Morris Pratt (KMP algorithm and a variety of improved algorithms, summarizes various advantages and disadvantages of the pattern matching algorithms. And on this basis, a new algorithm – Multithreaded Hybrid algorithm is introduced. The algorithm refers to Boyer Moore algorithm, KMP algorithm and the thinking of improved algorithms. Utilize the last character of the string, the next character and the method to compare from side to side, and then advance a new hybrid pattern matching algorithm. And it adjusted the comparison direction and the order of the comparison to make the maximum moving distance of each time to reduce the pattern matching time. The algorithm reduces the comparison number and greatlyreduces the moving number of the pattern and improves the matching efficiency. Multithreaded implementation of hybrid, pattern matching algorithm performs the parallel string searching on different text data by executing a number of threads simultaneously. This approach is advantageous from all other string-pattern matching algorithm in terms of time complexity. This again improves the overall string matching efficiency.
Enabling Graph Appliance for Genome Assembly
Singh, Rina [ORNL; Graves, Jeffrey A [ORNL; Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Shankar, Mallikarjun [ORNL
2015-01-01
In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.
A multi-threading approach to secure VERIFYPIN
Frieslaar, Ibraheem
2016-10-01
Full Text Available This research investigates the use of a multi-threaded framework as a software countermeasure mechanism to prevent attacks on the verifypin process in a pin-acceptance program. The implementation comprises of using various mathematical operations...
Complexity Information Flow in a Multi-threaded Imperative Language
Marion, Jean-Yves
2012-01-01
We propose a type system to analyze the time consumed by multi-threaded imperative programs with a shared global memory, which delineates a class of safe multi-threaded programs. We demonstrate that a safe multi-threaded program runs in polynomial time if (i) it is strongly terminating wrt a non-deterministic scheduling policy or (ii) it terminates wrt a deterministic and quiet scheduling policy. As a consequence, we also characterize the set of polynomial time functions. The type system presented is based on the fundamental notion of data tiering, which is central in implicit computational complexity. It regulates the information flow in a computation. This aspect is interesting in that the type system bears a resemblance to typed based information flow analysis and notions of non-interference. As far as we know, this is the first characterization by a type system of polynomial time multi-threaded programs.
Permission-Based Separation Logic for Multithreaded Java Programs
Haack, Christian; Huisman, Marieke; Hurlin, C.
2011-01-01
This paper motivates and presents a program logic for reasoning about multithreaded Java-like programs with concurrency primitives such as dynamic thread creation, thread joining and reentrant object monitors. The logic is based on concurrent separation logic. It is the first detailed adaptation of concurrent separation logic to a multithreaded Java-like language. The program logic associates a unique static access permission with each heap location, ensuring exclusive write accesses and ruli...
Permission-Based Separation Logic for Multithreaded Java Programs.
Amighi, Afshin; Haack, Christian; Huisman, Marieke; Hurlin, Clément
2011-01-01
This paper presents a program logic for reasoning about multithreaded Java-like programs with dynamic thread creation, thread joining and reentrant object monitors. The logic is based on concurrent separation logic. It is the first detailed adaptation of concurrent separation logic to a multithreaded Java-like language. The program logic associates a unique static access permission with each heap location, ensuring exclusive write accesses and ruling out data races. Concurrent reads are suppo...
Madduri, Kamesh; Ediger, David; Jiang, Karl; Bader, David A.; Chavarria-Miranda, Daniel
2009-02-15
We present a new lock-free parallel algorithm for computing betweenness centralityof massive small-world networks. With minor changes to the data structures, ouralgorithm also achieves better spatial cache locality compared to previous approaches. Betweenness centrality is a key algorithm kernel in HPCS SSCA#2, a benchmark extensively used to evaluate the performance of emerging high-performance computing architectures for graph-theoretic computations. We design optimized implementations of betweenness centrality and the SSCA#2 benchmark for two hardware multithreaded systems: a Cray XMT system with the Threadstorm processor, and a single-socket Sun multicore server with the UltraSPARC T2 processor. For a small-world network of 134 million vertices and 1.073 billion edges, the 16-processor XMT system and the 8-core Sun Fire T5120 server achieve TEPS scores (an algorithmic performance count for the SSCA#2 benchmark) of 160 million and 90 million respectively, which corresponds to more than a 2X performance improvement over the previous parallel implementations. To better characterize the performance of these multithreaded systems, we correlate the SSCA#2 performance results with data from the memory-intensive STREAM and RandomAccess benchmarks. Finally, we demonstrate the applicability of our implementation to analyze massive real-world datasets by computing approximate betweenness centrality for a large-scale IMDb movie-actor network.
Carver, Richard H
2005-01-01
Master the essentials of concurrent programming,including testing and debuggingThis textbook examines languages and libraries for multithreaded programming. Readers learn how to create threads in Java and C++, and develop essential concurrent programming and problem-solving skills. Moreover, the textbook sets itself apart from other comparable works by helping readers to become proficient in key testing and debugging techniques. Among the topics covered, readers are introduced to the relevant aspects of Java, the POSIX Pthreads library, and the Windows Win32 Applications Programming Interface.
A Multi-Threaded Semantic Focused Crawler
Punam Bedi; Anjali Thukral; Hema Banati; Abhishek Behl; Varun Mendiratta
2012-01-01
The Web comprises of voluminous rich learning content.The volume of ever growing learning resources however leads to the problem of information overload.A large number of irrelevant search results generated from search engines based on keyword matching techniques further augment the problem.A learner in such a scenario needs semantically matched learning resources as the search results.Keeping in view the volume of content and significance of semantic knowledge,our paper proposes a multi-threaded semantic focused crawler (SFC) specially designed and implemented to crawl on the WWW for educational learning content.The proposed SFC utilizes domain ontology to expand a topic term and a set of seed URLs to initiate the crawl.The results obtained by multiple iterations of the crawl on various topics are shown and compared with the results obtained by executing an open source crawler on the similar dataset.The results are evaluated using Semantic Similarity,a vector space model based metric,and the harvest ratio.
Issue Mechanism for Embedded Simultaneous Multithreading Processor
Zang, Chengjie; Imai, Shigeki; Frank, Steven; Kimura, Shinji
Simultaneous Multithreading (SMT) technology enhances instruction throughput by issuing multiple instructions from multiple threads within one clock cycle. For in-order pipeline to each thread, SMT processors can provide large number of issued instructions close to or surpass than using out-of-order pipeline. In this work, we show an efficient issue logic for predicated instruction sequence with the parallel flag in each instruction, where the predicate register based issue control is adopted and the continuous instructions with the parallel flag of ‘0’ are executed in parallel. The flag is pre-defined by a compiler. Instructions from different threads are issued based on the round-robin order. We also introduce an Instruction Queue skip mechanism for thread if the queue is empty. Using this kind of issue logic, we designed a 6 threads, 7-stage, in-order pipeline processor. Based on this processor, we compare round-robin issue policy (RR(T1-Tn)) with other policies: thread one always has the highest priority (PR(T1)) and thread one or thread n has the highest priority in turn (PR(T1-Tn)). The results show that RR(T1-Tn) policy outperforms others and PR(T1-Tn) is almost the same to RR(T1-Tn) from the point of view of the issued instructions per cycle.
Multithread Hydrodynamic Modeling of a Solar Flare
Warren, Harry P.
2006-01-01
Past hydrodynamic simulations have been able to reproduce the high temperatures and densities characteristic of solar flares. These simulations, however, have not been able to account for the slow decay of the observed flare emission or the absence of blueshifts in high spectral resolution line profiles. Recent work has suggested that modeling a flare as a sequence of independently heated threads instead of as a single loop may resolve the discrepancies between the simulations and observations. In this paper, we present a method for computing multithread, time-dependent hydrodynamic simulations of solar flares and apply it to observations of the Masuda flare of 1992 January 13. We show that it is possible to reproduce the temporal evolution of high temperature thermal flare plasma observed with the instruments on the GOES and Yohkoh satellites. The results from these simulations suggest that the heating timescale for a individual thread is on the order of 200 s. Significantly shorter heating timescales (20 s) lead to very high temperatures and are inconsistent with the emission observed by Yohkoh.
Simultaneous multithreaded processor enhanced for multimedia applications
Mombers, Friederich; Thomas, Michel
1999-12-01
The paper proposes a new media processor architecture specifically designed to handle state-of-the-art multimedia encoding and decoding tasks. To achieve this, the architecture efficiently exploit Data-, Instruction- and Thread-Level parallelisms while continuously adapting its computational resources to reach the most appropriate parallelism level among all the concurrent encoding/decoding processes. Looking at the implementation constraints, several critical choices were adopted that solve the interconnection delay problem, lower the cache misses and pipeline stalls effects and reduce register files and memory size by adopting a clustered Simultaneous Multithreaded Architecture. We enhanced the classic model to exploit both Instruction and Data Level Parallelism through vector instructions. The vector extension is well justified for multimedia workload and improves code density, crossbars complexity, register file ports and decoding logic area while it still provides an efficient way to fully exploit a large set of functional units. An MPEG-2 encoding algorithms based on Hybrid Genetic search has been implemented that show the efficiency of the architecture to adapt its resources allocation to better fulfill the application requirements.
A Framework of Concurrent Mechanism Based on Java Multithread
Wuxue Jiang
2013-09-01
Full Text Available The continuously increased demand for paralleling multitask in domains such as grid computing and cloud computing has significantly promoted research on concurrent mechanism and concurrent programming. The Java programming language supports multithread mechanism for developing paralleling programs, however, it is difficult to apply Java concurrent primitives to specific problems. Thus, for the development of high reliable and qualitative Java concurrent programs, this paper analyses Java multithread mechanism and it’s realization, studies the concurrent mechanism based on Java synchronization and interactive communication mechanism , compares the concurrent structure based on operating system and based on Java multithread, sums up some concurrent programming rules and strategies to prevent deadlock. A frame instance based on entire synchronization is presented, which can help to develop concurrent programs quickly.
傅育熙
1998-01-01
The paper proposes reaction graphs as graphical representations of computational objects.A reaction graph is a directed graph with all its arrows and some of its nodes labeled.Computations are modled by graph rewriting of a simple nature.The basic rewriting rules embody the essence of both the communications among processes and cut-eliminations in proofs.Calculi of graphs are ideentified to give a formal and algebraic account of reaction graphs in the spirit of process algebra.With the help of the calculi,it is demonstrated that reaction graphs capture many interesting aspects of computations.
Elementary affine {\\lambda}-calculus with multithreading and side effects
Madet, Antoine
2011-01-01
Linear logic provides a framework to control the complexity of higher-order functional programs. We present an extension of this framework to programs with multithreading and side effects focusing on the case of elementary time. Our main contributions are as follows. First, we provide a new combinatorial proof of termination in elementary time for the functional case. Second, we develop an extension of the approach to a call-by-value \\lambda-calculus with multithreading and side effects. Third, we introduce an elementary affine type system that guarantees the standard subject reduction and progress properties. Finally, we illustrate the programming of iterative functions with side effects in the presented formalism.
Hardwired Logic and Multithread Design in Network Processors
李旭东; 徐扬; 刘斌; 王小军
2004-01-01
High-performance network processors are expected to play an important role in future high-speed routers. This paper focuses on two representative techniques needed for high-performance network processors: hardwired logic design and multithread design. Using hardwired logic, this paper compares a single-thread design with a multithread design, and proposes general models and principles to analyze the clock frequency and the resource cost for these environments. Then, two IP header processing schemes, one in single-thread mode and the other in double-thread mode, are developed using these principles and the implementation results verified the theoretical calculation.
A Fault Detection Mechanism in a Data-flow Scheduled Multithreaded Processor
Fu, J.; Yang, Q.; Poss, R.; Jesshope, C.R.; Zhang, C.
2014-01-01
This paper designs and implements the Redundant Multi-Threading (RMT) in a Data-flow scheduled MultiThreaded (DMT) multicore processor, called Data-flow scheduled Redundant Multi-Threading (DRMT). Meanwhile, It presents Asynchronous Output Comparison (AOC) for RMT techniques to avoid fault detection
Permission-Based Separation Logic for Multithreaded Java Programs
Haack, Christian; Huisman, Marieke; Hurlin, C.
2011-01-01
This paper motivates and presents a program logic for reasoning about multithreaded Java-like programs with concurrency primitives such as dynamic thread creation, thread joining and reentrant object monitors. The logic is based on concurrent separation logic. It is the first detailed adaptation of
Effective verification of confidentiality for multi-threaded programs
Ngo, Minh Tri; Stoelinga, Mariëlle; Huisman, Marieke
2014-01-01
This paper studies how confidentiality properties of multi-threaded programs can be verified efficiently by a combination of newly developed and existing model checking algorithms. In particular, we study the verification of scheduler-specific observational determinism (SSOD), a property that charac
High level methods for scene exploration
Dimitri Plemenos
2006-10-01
Full Text Available Virtual worlds exploration techniques are used in a wide variety of domains — from graph drawing to robot motion. This paper is dedicated to virtual world exploration techniques which have to help a human being to understand a 3D scene. An improved method of viewpoint quality estimation is presented in the paper, together with a new off-line method for automatic 3D scene exploration, based on a virtual camera. The automatic exploration method is working in two steps. In the first step, a set of “good” viewpoints is computed. The second step uses this set of points of view to compute a camera path around the scene. Finally, we define a notion of semantic distance between objects of the scene to improve the approach.
Complexity and information flow analysis for multi-threaded programs
Ngo, Tri Minh; Huisman, Marieke
2017-01-01
This paper studies the security of multi-threaded programs. We combine two methods, i.e., qualitative and quantitative security analysis, to check whether a multi-threaded program is secure or not. In this paper, besides reviewing classical analysis models, we present a novel model of quantitative analysis where the attacker is able to select the scheduling policy. This model does not follow the traditional information-theoretic channel setting. Our analysis first studies what extra information an attacker can get if he knows the scheduler's choices, and then integrates this information into the transition system modeling the program execution. Via a case study, we compare this approach with the traditional information-theoretic models, and show that this approach gives more intuitive-matching results.
Complexity and information flow analysis for multi-threaded programs
Ngo, Tri Minh; Huisman, Marieke
2017-07-01
This paper studies the security of multi-threaded programs. We combine two methods, i.e., qualitative and quantitative security analysis, to check whether a multi-threaded program is secure or not. In this paper, besides reviewing classical analysis models, we present a novel model of quantitative analysis where the attacker is able to select the scheduling policy. This model does not follow the traditional information-theoretic channel setting. Our analysis first studies what extra information an attacker can get if he knows the scheduler's choices, and then integrates this information into the transition system modeling the program execution. Via a case study, we compare this approach with the traditional information-theoretic models, and show that this approach gives more intuitive-matching results.
Data-Parallel Programming in a Multithreaded Environment
Matthew Haines
1997-01-01
Full Text Available Research on programming distributed memory multiprocessors has resulted in a well-understood programming model, namely data-parallel programming. However, data-parallel programming in a multithreaded environment is far less understood. For example, if multiple threads within the same process belong to different data-parallel computations, then the architecture, compiler, or run-time system must ensure that relative indexing and collective operations are handled properly and efficiently. We introduce a run-time-based solution for data-parallel programming in a distributed memory environment that handles the problems of relative indexing and collective communications among thread groups. As a result, the data-parallel programming model can now be executed in a multithreaded environment, such as a system using threads to support both task and data parallelism.
Multi-thread Parallel Speech Recognition for Mobile Applications
LOJKA Martin
2014-05-01
Full Text Available In this paper, the server based solution of the multi-thread large vocabulary automatic speech recognition engine is described along with the Android OS and HTML5 practical application examples. The basic idea was to bring speech recognition available for full variety of applications for computers and especially for mobile devices. The speech recognition engine should be independent of commercial products and services (where the dictionary could not be modified. Using of third-party services could be also a security and privacy problem in specific applications, when the unsecured audio data could not be sent to uncontrolled environments (voice data transferred to servers around the globe. Using our experience with speech recognition applications, we have been able to construct a multi-thread speech recognition serverbased solution designed for simple applications interface (API to speech recognition engine modified to specific needs of particular application.
Model Checking with Multi-Threaded IC3 Portfolios
2015-01-15
Model Checking with Multi-Threaded IC3 Portfolios Sagar Chaki and Derrick Karimi Software Engineering Institute, Carnegie Mellon University {chaki...different runs varies randomly depending on the thread interleaving. The use of a portfolio of solvers to maximize the likelihood of a quick solution is...investigated. Using the Extreme Value theorem, the runtime of each variant, as well as their portfolios is analysed statistically. A formula for the
A PREDICTABLE MULTI-THREADED MAIN-MEMORY STORAGE MANAGER
无
2001-01-01
This paper introduces the design and implementation of a predictable multi-threaded main-memo- ry storage manager (CS20), and emphasizes the database service mediator(DSM), an operation prediction model using exponential averaging. The memory manager, indexing, as well as lock manager in CS20 are also presented briefly. CS20 has been embedded in a mobile telecommunication service system. Practice showed, DSM effectively controls system load and hence improves the real-time characteristics of data accessing.
Sahasranand, K R
2010-01-01
Almost all known secret sharing schemes work on numbers. Such methods will have difficulty in sharing graphs since the number of graphs increases exponentially with the number of nodes. We propose a secret sharing scheme for graphs where we use graph intersection for reconstructing the secret which is hidden as a sub graph in the shares. Our method does not rely on heavy computational operations such as modular arithmetic or polynomial interpolation but makes use of very basic operations like assignment and checking for equality, and graph intersection can also be performed visually. In certain cases, the secret could be reconstructed using just pencil and paper by authorised parties but cannot be broken by an adversary even with unbounded computational power. The method achieves perfect secrecy for (2, n) scheme and requires far fewer operations compared to Shamir's algorithm. The proposed method could be used to share objects such as matrices, sets, plain text and even a heterogeneous collection of these. S...
Li, Xueliang; Gutman, Ivan
2012-01-01
This book is about graph energy. The authors have included many of the important results on graph energy, such as the complete solution to the conjecture on maximal energy of unicyclic graphs, the Wagner-Heuberger's result on the energy of trees, the energy of random graphs or the approach to energy using singular values. It contains an extensive coverage of recent results and a gradual development of topics and the inclusion of complete proofs from most of the important recent results in the area. The latter fact makes it a valuable reference for researchers looking to get into the field of g
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...
MT-ADRES: Multithreading on Coarse-Grained Reconfigurable Architecture
Wu, Kehuai; Kanstein, Andreas; Madsen, Jan;
2007-01-01
-ILP architectures achieve only low parallelism when executing partially sequential code segments, which is also known as Amdahl’s law, this paper proposes to extend ADRES to MT-ADRES (Multi-Threaded ADRES) to also exploit thread-level parallelism. On MT-ADRES architectures, the array can be partitioned in multiple...... smaller arrays that can execute threads in parallel. Because the partition can be changed dynamically, this extension provides more flexibility than a multi-core approach. This article presents details of the enhanced architecture and results obtained from an MPEG-2 decoder implementation that exploits...... a mix of thread-level parallelism and instruction-level parallelism....
Design of Multithreaded Software The Entity-Life Modeling Approach
Sandén, Bo I
2011-01-01
This book assumes familiarity with threads (in a language such as Ada, C#, or Java) and introduces the entity-life modeling (ELM) design approach for certain kinds of multithreaded software. ELM focuses on "reactive systems," which continuously interact with the problem environment. These "reactive systems" include embedded systems, as well as such interactive systems as cruise controllers and automated teller machines.Part I covers two fundamentals: program-language thread support and state diagramming. These are necessary for understanding ELM and are provided primarily for reference. P
Multi-threaded software framework development for the ATLAS experiment
Stewart, G. A.; Baines, J.; Bold, T.; Calafiura, P.; Dotti, A.; Farrell, S. A.; Leggett, C.; Malon, D.; Ritsch, E.; Snyder, S.; Tsulaia, V.; Van Gemmeren, P.; Wynne, B. M.; ATLAS Experiment,the
2016-10-01
ATLAS's current software framework, Gaudi/Athena, has been very successful for the experiment in LHC Runs 1 and 2. However, its single-threaded design has been recognised for some time to be increasingly problematic as CPUs have increased core counts and decreased available memory per core. Even the multi-process version of Athena, AthenaMP, will not scale to the range of architectures we expect to use beyond Run2. ATLAS examined the requirements on an updated multi-threaded framework and laid out plans for a new framework, including better support for High Level Trigger use cases, in 2014. In this paper we report on our progress in developing the new multi-threaded task parallel extension of Athena, AthenaMT. Implementing AthenaMT has required many significant code changes. Progress has been made in updating key concepts of the framework, allowing different levels of thread safety in algorithmic code. Substantial advances have also been made in implementing a data flow centric design, as well as on the development of the new ‘event views’ infrastructure. These event views support partial event processing and are an essential component to support the High Level Trigger's processing of certain regions of interest. A major effort has also been invested to have an early version of AthenaMT that can run simulation on many core architectures, which has augmented the understanding gained from work on earlier ATLAS demonstrators.
Multi-threaded ATLAS Simulation on Intel Knights Landing Processors
Farrell, Steven; The ATLAS collaboration; Calafiura, Paolo; Leggett, Charles
2016-01-01
The Knights Landing (KNL) release of the Intel Many Integrated Core (MIC) Xeon Phi line of processors is a potential game changer for HEP computing. With 72 cores and deep vector registers, the KNL cards promise significant performance benefits for highly-parallel, compute-heavy applications. Cori, the newest supercomputer at the National Energy Research Scientific Computing Center (NERSC), will be delivered to its users in two phases with the first phase online now and the second phase expected in mid-2016. Cori Phase 2 will be based on the KNL architecture and will contain over 9000 compute nodes with 96GB DDR4 memory. ATLAS simulation with the multithreaded Athena Framework (AthenaMT) is a great use-case for the KNL architecture and supercomputers like Cori. Simulation jobs have a high ratio of CPU computation to disk I/O and have been shown to scale well in multi-threading and across many nodes. In this presentation we will give an overview of the ATLAS simulation application with details on its multi-thr...
Multi-threaded ATLAS Simulation on Intel Knights Landing Processors
Farrell, Steven; The ATLAS collaboration
2017-01-01
The Knights Landing (KNL) release of the Intel Many Integrated Core (MIC) Xeon Phi line of processors is a potential game changer for HEP computing. With 72 cores and deep vector registers, the KNL cards promise significant performance benefits for highly-parallel, compute-heavy applications. Cori, the newest supercomputer at the National Energy Research Scientific Computing Center (NERSC), was delivered to its users in two phases with the first phase online at the end of 2015 and the second phase now online at the end of 2016. Cori Phase 2 is based on the KNL architecture and contains over 9000 compute nodes with 96GB DDR4 memory. ATLAS simulation with the multithreaded Athena Framework (AthenaMT) is a good potential use-case for the KNL architecture and supercomputers like Cori. ATLAS simulation jobs have a high ratio of CPU computation to disk I/O and have been shown to scale well in multi-threading and across many nodes. In this paper we will give an overview of the ATLAS simulation application with detai...
Multi-threaded Software Framework Development for the ATLAS Experiment
Stewart, Graeme; The ATLAS collaboration; Baines, John; Calafiura, Paolo; Dotti, Andrea; Farrell, Steven; Leggett, Charles; Malon, David; Ritsch, Elmar; Snyder, Scott; Tsulaia, Vakhtang; van Gemmeren, Peter; Wynne, Benjamin
2016-01-01
ATLAS's current software framework, Gaudi/Athena, has been very successful for the experiment in LHC Runs 1 and 2. However, its single threaded design has been recognised for some time to be increasingly problematic as CPUs have increased core counts and decreased available memory per core. Even the multi-process version of Athena, AthenaMP, will not scale to the range of architectures we expect to use beyond Run2. ATLAS examined the requirements on an updated multi-threaded framework and layed out plans for a new framework, including better support for high level trigger (HLT) use cases, in 2014. In this paper we report on our progress in developing the new multi-threaded task parallel extension of Athena, AthenaMT. Implementing AthenaMT has required many significant code changes. Progress has been made in updating key concepts of the framework, to allow the incorporation of different levels of thread safety in algorithmic code (from un-migrated thread-unsafe code, to thread safe copyable code to reentrant c...
Multi-threaded software framework development for the ATLAS experiment
AUTHOR|(INSPIRE)INSPIRE-00226135; Baines, John; Bold, Tomasz; Calafiura, Paolo; Dotti, Andrea; Farrell, Steven; Leggett, Charles; Malon, David; Ritsch, Elmar; Snyder, Scott; Tsulaia, Vakhtang; van Gemmeren, Peter; Wynne, Benjamin
2016-01-01
ATLAS's current software framework, Gaudi/Athena, has been very successful for the experiment in LHC Runs 1 and 2. However, its single threaded design has been recognised for some time to be increasingly problematic as CPUs have increased core counts and decreased available memory per core. Even the multi-process version of Athena, AthenaMP, will not scale to the range of architectures we expect to use beyond Run2. ATLAS examined the requirements on an updated multi-threaded framework and laid out plans for a new framework, including better support for high level trigger (HLT) use cases, in 2014. In this paper we report on our progress in developing the new multi-threaded task parallel extension of Athena, AthenaMT. Implementing AthenaMT has required many significant code changes. Progress has been made in updating key concepts of the framework, to allow the incorporation of different levels of thread safety in algorithmic code (from un-migrated thread-unsafe code, to thread safe copyable code to reentrant co...
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
Infant death scene investigation.
Tabor, Pamela D; Ragan, Krista
2015-01-01
The sudden unexpected death of an infant is a tragedy to the family, a concern to the community, and an indicator of national health. To accurately determine the cause and manner of the infant's death, a thorough and accurate death scene investigation by properly trained personnel is key. Funding and resources are directed based on autopsy reports, which are only as accurate as the scene investigation. The investigation should include a standardized format, body diagrams, and a photographed or videotaped scene recreation utilizing doll reenactment. Forensic nurses, with their basic nursing knowledge and additional forensic skills and abilities, are optimally suited to conduct infant death scene investigations as well as train others to properly conduct death scene investigations. Currently, 49 states have child death review teams, which is an idea avenue for a forensic nurse to become involved in death scene investigations.
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...
Diestel, Reinhard
2000-01-01
This book is a concise, yet carefully written, introduction to modern graph theory, covering all its major recent developments. It can be used both as a reliable textbook for an introductory course and as a graduate text: on each topic it covers all the basic material in full detail, and adds one or two deeper results (again with detailed proofs) to illustrate the more advanced methods of that field. This second edition extends the first in two ways. It offers a thoroughly revised and updated chapter on graph minors, which now includes full new proofs of two of the central Robertson-Seymour theorems (as well as a detailed sketch of the entire proof of their celebrated Graph Minor Theorem). Second, there is now a section of hints for all the exercises, to enhance their value for both individual study and classroom use.
Beeken, Paul
2014-11-01
Graphing is an essential skill that forms the foundation of any physical science.1 Understanding the relationships between measurements ultimately determines which modeling equations are successful in predicting observations.2 Over the years, science and math teachers have approached teaching this skill with a variety of techniques. For secondary school instruction, the job of graphing skills falls heavily on physics teachers. By virtue of the nature of the topics we cover, it is our mission to develop this skill to the fine art that it is.
Multithreading Image Processing in Single-core and Multi-core CPU using Java
Alda Kika
2013-10-01
Full Text Available Multithreading has been shown to be a powerful approach for boosting a system performance. One of the good examples of applications that benefits from multithreading is image processing. Image processing requires many resources and processing run time because the calculations are often done on a matrix of pixels. The programming language Java supports the multithreading programming as part of the language itself instead of treating threads through the operating system. In this paper we explore the performance of Java image processing applications designed with multithreading approach. In order to test how the multithreading influences on the performance of the program, we tested several image processing algorithms implemented with Java language using the sequential one thread and multithreading approach on single and multi-core CPU. The experiments were based not only on different platforms and algorithms that differ from each other from the level of complexity, but also on changing the sizes of the images and the number of threads when multithreading approach is applied. Performance is increased on single core and multiple core CPU in different ways in relation with image size, complexity of the algorithm and the platform.
Parallel Patient Karyotype Information System using Multi-threads
Chantana CHANTRAPORNCHAI
2015-09-01
Full Text Available Human cytogenetic data are the typical laboratory results from hospitals. Karyogram is used to show the chromosome characteristics. The characteristics are written as karyotype strings. For a particular patient, there may be many records of karyotype strings due to several visits. These data for many patients are increasingly large and must be stored properly for further investigation and analysis. This research introduces the information system for the hospital for keeping the karyotypes of patients and applies the parallel method for searching required karyotypes, extracting related patient information. Particularly, we exploit the technology of Node.js with multithreads while splitting queries to search in parallel. The search method is integrated to the cytogenetic information system which is aimed to use for studying karyotypes of leukemia patients.
The DPGA for Conbining the Superscalar and Multithreaded Processors Principal
无
2001-01-01
The performance of scalable shared-memory multiprocessors suffers from three types of latency; memory latency, the latency caused by inter-process synchroni z ation ,and the latency caused by instructions that take multiple cycles to produ ce results. To tolerate these three types of latencies, The followin g techniques was proposed to couple: coarse-grained multithreading, the supersc alar processor and a rec onfigurable device, namely the overlapping long latency operations of one thread of computation with the execution of other threads. The superscalar processor p rinciple is used to tolerate instruction latency by issuing several instructions simultaneously. The DPGA is coupled with this processor in order to improve th e context-switching overhead.
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...
NavP: Structured and Multithreaded Distributed Parallel Programming
Pan, Lei
2007-01-01
We present Navigational Programming (NavP) -- a distributed parallel programming methodology based on the principles of migrating computations and multithreading. The four major steps of NavP are: (1) Distribute the data using the data communication pattern in a given algorithm; (2) Insert navigational commands for the computation to migrate and follow large-sized distributed data; (3) Cut the sequential migrating thread and construct a mobile pipeline; and (4) Loop back for refinement. NavP is significantly different from the current prevailing Message Passing (MP) approach. The advantages of NavP include: (1) NavP is structured distributed programming and it does not change the code structure of an original algorithm. This is in sharp contrast to MP as MP implementations in general do not resemble the original sequential code; (2) NavP implementations are always competitive with the best MPI implementations in terms of performance. Approaches such as DSM or HPF have failed to deliver satisfying performance as of today in contrast, even if they are relatively easy to use compared to MP; (3) NavP provides incremental parallelization, which is beyond the reach of MP; and (4) NavP is a unifying approach that allows us to exploit both fine- (multithreading on shared memory) and coarse- (pipelined tasks on distributed memory) grained parallelism. This is in contrast to the currently popular hybrid use of MP+OpenMP, which is known to be complex to use. We present experimental results that demonstrate the effectiveness of NavP.
Graphs in Practical Situations
刘晓玫; 任心玥
2008-01-01
<正>Linear graphs are often used to depict conversion graphs and travel graphs. Example: The following graph shows the conversion between the Singapore dollar (S $) and the Malay- sian ringgit (RM) in 2000.
2016-06-01
GraphBench is a benchmark suite for graph pattern mining and graph analysis systems. The benchmark suite is a significant addition to conducting apples-apples comparison of graph analysis software (databases, in-memory tools, triple stores, etc.)
Kim, Nanyoung
2009-01-01
In this article, the author describes an underwater scene composition for elementary-education majors. This project deals with watercolor with crayon or oil-pastel resist (medium); the beauty of nature represented by fish in the underwater scene (theme); texture and pattern (design elements); drawing simple forms (drawing skill); and composition…
Reddy, A Satyanarayana
2011-01-01
A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the graphs which are polynomials in the pattern polynomial graph have been studied. We also identify known graph classes which are pattern polynomial graphs.
Warchalowski, Wiktor; Krawczyk, Malgorzata J.
2017-03-01
We found the Lindenmayer systems for line graphs built on selected fractals. We show that the fractal dimension of such obtained graphs in all analysed cases is the same as for their original graphs. Both for the original graphs and for their line graphs we identified classes of nodes which reflect symmetry of the graph.
Betweenness Centrality in Graphs
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 ...
Cormac Duffy
2008-03-01
Full Text Available The capabilities of a sensor network are strongly influenced by the operating system used on the sensor nodes. In general, two different sensor network operating system types are currently considered: event driven and multi-threaded. It is commonly assumed that event driven operating systems are more suited to sensor networks as they use less memory and processing resources. However, if factors other than resource usage are considered important, a multi-threaded system might be preferred. This paper compares the resource needs of multi-threaded and event driven sensor network operating systems. The resources considered are memory usage and power consumption. Additionally, the event handling capabilities of event driven and multi-threaded operating systems are analyzed and compared. The results presented in this paper show that for a number of application areas a thread-based sensor network operating system is feasible and preferable.
Performance improvement of developed program by using multi-thread technique
Surasak Jabal
2015-03-01
Full Text Available This research presented how to use a multi-thread programming technique to improve the performance of a program written by Windows Presentation Foundation (WPF. The Computer Assisted Instruction (CAI software, named GAME24, was selected to use as a case study. This study composed of two main parts. The first part was about design and modification of the program structure upon the Object Oriented Programing (OOP approach. The second part was about coding the program using the multi-thread technique which the number of threads were based on the calculated Catalan number. The result showed that the multi-thread programming technique increased the performance of the program 44%-88% compared to the single-thread technique. In addition, it has been found that the number of cores in the CPU also increase the performance of multithreaded program proportionally.
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
Weinzierl, Stefan
2013-01-01
In these lectures I discuss Feynman graphs and the associated Feynman integrals. Of particular interest are the classes functions, which appear in the evaluation of Feynman integrals. The most prominent class of functions is given by multiple polylogarithms. The algebraic properties of multiple polylogarithms are reviewed in the second part of these lectures. The final part of these lectures is devoted to Feynman integrals, which cannot be expressed in terms of multiple polylogarithms. Methods from algebraic geometry provide tools to tackle these integrals.
A Highly Parallel Implementation of K-Means for Multithreaded Architecture
Mackey, Patrick S.; Feo, John T.; Wong, Pak C.; Chen, Yousu
2011-04-06
We present a parallel implementation of the popular k-means clustering algorithm for massively multithreaded computer systems, as well as a parallelized version of the KKZ seed selection algorithm. We demonstrate that as system size increases, sequential seed selection can become a bottleneck. We also present an early attempt at parallelizing k-means that highlights critical performance issues when programming massively multithreaded systems. For our case studies, we used data collected from electric power simulations and run on the Cray XMT.
Diestel, Reinhard
2012-01-01
HauptbeschreibungThis standard textbook of modern graph theory, now in its fourth edition, combinesthe authority of a classic with the engaging freshness of style that is the hallmarkof active mathematics. It covers the core material of the subject with concise yetreliably complete proofs, while offering glimpses of more advanced methodsin 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 graduatetext, and for self-study. Rezension"Deep, clear, wonderful. This is a serious book about the
Merris, Russell
2001-01-01
A lively invitation to the flavor, elegance, and power of graph theoryThis mathematically rigorous introduction is tempered and enlivened by numerous illustrations, revealing examples, seductive applications, and historical references. An award-winning teacher, Russ Merris has crafted a book designed to attract and engage through its spirited exposition, a rich assortment of well-chosen exercises, and a selection of topics that emphasizes the kinds of things that can be manipulated, counted, and pictured. Intended neither to be a comprehensive overview nor an encyclopedic reference, th
AN MHD AVALANCHE IN A MULTI-THREADED CORONAL LOOP
Hood, A. W.; Cargill, P. J.; Tam, K. V. [School of Mathematics and Statistics, University of St Andrews, St Andrews, Fife, KY16 9SS (United Kingdom); Browning, P. K., E-mail: awh@st-andrews.ac.uk [School of Physics and Astronomy, University of Manchester, Oxford Road, Manchester, M13 9PL (United Kingdom)
2016-01-20
For the first time, we demonstrate how an MHD avalanche might occur in a multithreaded coronal loop. Considering 23 non-potential magnetic threads within a loop, we use 3D MHD simulations to show that only one thread needs to be unstable in order to start an avalanche even when the others are below marginal stability. This has significant implications for coronal heating in that it provides for energy dissipation with a trigger mechanism. The instability of the unstable thread follows the evolution determined in many earlier investigations. However, once one stable thread is disrupted, it coalesces with a neighboring thread and this process disrupts other nearby threads. Coalescence with these disrupted threads then occurs leading to the disruption of yet more threads as the avalanche develops. Magnetic energy is released in discrete bursts as the surrounding stable threads are disrupted. The volume integrated heating, as a function of time, shows short spikes suggesting that the temporal form of the heating is more like that of nanoflares than of constant heating.
On the multi-threaded nature of solar spicules
Skogsrud, H; De Pontieu, B
2014-01-01
A dominant constituent in the dynamic chromosphere are spicules. Spicules at the limb appear as relatively small and dynamic jets that are observed to everywhere stick out. Many papers emphasize the important role spicules might play in the energy and mass balance of the chromosphere and corona. However, many aspects of spicules remain a mystery. In this Letter we shed more light on the multi-threaded nature of spicules and their torsional component. We use high spatial, spectral and temporal resolution observations from the Swedish 1-m Solar Telescope in the H{\\alpha} spectral line. The data targets the limb and we extract spectra from spicules far out from the limb to reduce the line-of-sight superposition effect. We discover that many spicules display very asymmetric spectra with some even showing multiple peaks. To quantify this asymmetry we use a double Gaussian fitting procedure and find an average velocity difference between the single Gaussian components to be between 20-30 km s$^{-1}$ for a sample of...
Multi-Thread Hydrodynamic Modeling of a Solar Flare
Warren, H P
2006-01-01
Past hydrodynamic simulations have been able to reproduce the high temperatures and densities characteristic of solar flares. These simulations, however, have not been able to account for the slow decay of the observed flare emission or the absence of blueshifts in high spectral resolution line profiles. Recent work has suggested that modeling a flare as an sequence of independently heated threads instead of as a single loop may resolve the discrepancies between the simulations and observations. In this paper we present a method for computing multi-thread, time-dependent hydrodynamic simulations of solar flares and apply it to observations of the Masuda flare of 1992 January 13. We show that it is possible to reproduce the temporal evolution of high temperature thermal flare plasma observed with the instruments on the \\textit{GOES} and \\textit{Yohkoh} satellites. The results from these simulations suggest that the heating time-scale for a individual thread is on the order of 200 s. Significantly shorter heati...
Understanding Graphs & Charts.
Cleary, John J.; Gravely, Mary Liles
Developed by educators from the Emily Griffith Opportunity School, this teacher's guide was developed for a 4-hour workshop to teach employees how to read the charts and graphs they need in the workplace. The unit covers four types of graphs: pictographs, bar graphs, line graphs, and circle graphs. The guide is divided into four sections: reading…
High Performance Descriptive Semantic Analysis of Semantic Graph Databases
Joslyn, Cliff A.; Adolf, Robert D.; al-Saffar, Sinan; Feo, John T.; Haglin, David J.; Mackey, Greg E.; Mizell, David W.
2011-06-02
As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to understand their inherent semantic structure, whether codified in explicit ontologies or not. Our group is researching novel methods for what we call descriptive semantic analysis of RDF triplestores, to serve purposes of analysis, interpretation, visualization, and optimization. But data size and computational complexity makes it increasingly necessary to bring high performance computational resources to bear on this task. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multi-threaded architecture of the Cray XMT platform, conventional servers, and large data stores. In this paper we describe that architecture and our methods, and present the results of our analyses of basic properties, connected components, namespace interaction, and typed paths such for the Billion Triple Challenge 2010 dataset.
Tan, Yong
2013-01-01
In this paper, author uses set theory to construct a logic model of abstract figure from binary relation. Based on the uniform quantified structure, author gives two logic system for graph traversal and graph coloring respectively, moreover shows a new method of cutting graph. Around this model, there are six algorithms in this paper including exact graph traversal, Algebra calculation of natural number, graph partition and graph coloring.
An Eﬃcient and Flexible Deterministic Framework for Multithreaded Programs
卢凯; 周旭; 王小平; 陈沉
2015-01-01
Determinism is very useful to multithreaded programs in debugging, testing, etc. Many deterministic ap-proaches have been proposed, such as deterministic multithreading (DMT) and deterministic replay. However, these sys-tems either are ineﬃcient or target a single purpose, which is not flexible. In this paper, we propose an eﬃcient and flexible deterministic framework for multithreaded programs. Our framework implements determinism in two steps: relaxed determinism and strong determinism. Relaxed determinism solves data races eﬃciently by using a proper weak memory consistency model. After that, we implement strong determinism by solving lock contentions deterministically. Since we can apply different approaches for these two steps independently, our framework provides a spectrum of deterministic choices, including nondeterministic system (fast), weak deterministic system (fast and conditionally deterministic), DMT system, and deterministic replay system. Our evaluation shows that the DMT configuration of this framework could even outperform a state-of-the-art DMT system.
UTLEON3 Exploring Fine-Grain Multi-Threading in FPGAs
Daněk, Martin; Kohout, Lukáš; Sýkora, Jaroslav; Bartosinski, Roman
2013-01-01
This book describes a specification, microarchitecture, VHDL implementation and evaluation of a SPARC v8 CPU with fine-grain multi-threading, called micro-threading. The CPU, named UTLEON3, is an alternative platform for exploring CPU multi-threading that is compatible with the industry-standard GRLIB package. The processor microarchitecture was designed to map in an efficient way the data-flow scheme on a classical von Neumann pipelined processing used in common processors, while retaining full binary compatibility with existing legacy programs. Describes and documents a working SPARC v8, with fine-grain multithreading and fast context switch; Provides VHDL sources for the described processor; Describes a latency-tolerant framework for coupling hardware accelerators to microthreaded processor pipelines; Includes programming by example in the micro-threaded assembly language.
Automated Synthetic Scene Generation
2014-07-01
Föerstner, 1999), environmental modeling (Brenner, 1999), navigation (Auer, et al., 2010; Brenner, 2005), games and entertainment (Hearn and Baker, 1997...city planning, games and entertainment, and military planning, scenes have the additional requirement to be accurately attributed with visible color...Observation Platform (AOP) Pathfinder 2010 data release, National Ecological Observatory Network, URL: http://neoninc.org/pds/files/NEON.AOP.015068
1970-01-01
analyzer tha t we construct will very likely combine some of the ideas reported here with the approach described by our co-workers Brice and Fennema ...188-205 (1968). Brice , C. R., and C. L. Fennema , " Scene Analysis of Pictures Using Regions " Technical Note No. 17 , Artificial Intelligence Group
A Multi-thread Data Flow Solution Applying to Java Extension
Chen, Li
The multi-core processors environment is increasingly popular, the parallel studies of application program for this architecture has become the focus. In object-oriented program design language, often use the thread to implement an application program parallelism, however, synchronization and communication between threads are often very complicated to implement and can not take full advantage of multi-core advantage. Proposed a multi-thread basing on data flow and Java extensions to achieve solutions, presents a new multi-thread programming method. The results show that this method is not only easy to implement and can better take advantage of multi-core advantage.
Lawes, Jonathan F.
2013-01-01
Graphing polar curves typically involves a combination of three traditional techniques, all of which can be time-consuming and tedious. However, an alternative method--graphing the polar function on a rectangular plane--simplifies graphing, increases student understanding of the polar coordinate system, and reinforces graphing techniques learned…
2014-01-01
© 2015 Elsevier B.V. Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of a similar type, called linearized Wenger graphs. The spectrum, diameter and girth of these linearized Wenger graphs are determined.
Mesfin Dema
2014-05-01
Full Text Available We introduce a novel Maximum Entropy (MaxEnt framework that can generate 3D scenes by incorporating objects’ relevancy, hierarchical and contextual constraints in a unified model. This model is formulated by a Gibbs distribution, under the MaxEnt framework, that can be sampled to generate plausible scenes. Unlike existing approaches, which represent a given scene by a single And-Or graph, the relevancy constraint (defined as the frequency with which a given object exists in the training data require our approach to sample from multiple And-Or graphs, allowing variability in terms of objects’ existence across synthesized scenes. Once an And-Or graph is sampled from the ensemble, the hierarchical constraints are employed to sample the Or-nodes (style variations and the contextual constraints are subsequently used to enforce the corresponding relations that must be satisfied by the And-nodes. To illustrate the proposed methodology, we use desk scenes that are composed of objects whose existence, styles and arrangements (position and orientation can vary from one scene to the next. The relevancy, hierarchical and contextual constraints are extracted from a set of training scenes and utilized to generate plausible synthetic scenes that in turn satisfy these constraints. After applying the proposed framework, scenes that are plausible representations of the training examples are automatically generated.
Permission-based separation logic for multi-threaded Java programs
Amighi, A.; Haack, Christian; Huisman, Marieke; Hurlin, C.
2015-01-01
This paper presents a program logic for reasoning about multithreaded Java-like programs with concurrency primitives such as dynamic thread creation, thread joining and reentrant object monitors. The logic is based on concurrent separation logic. It is the first detailed adaptation of concurrent sep
An Assertional Proof System for Multithreaded Java - Theory and Tool Support
Abraham, E.
2005-01-01
Besides the features of a class-based object-oriented language, Java integrates concurrency via its thread classes, allowing for a multithreaded flow of control. The concurrency model includes shared-variable concurrency via instance variables, coordination via reentrant synchronization monitors, s
FODEM: A Multi-Threaded Research and Development Method for Educational Technology
Suhonen, Jarkko; de Villiers, M. Ruth; Sutinen, Erkki
2012-01-01
Formative development method (FODEM) is a multithreaded design approach that was originated to support the design and development of various types of educational technology innovations, such as learning tools, and online study programmes. The threaded and agile structure of the approach provides flexibility to the design process. Intensive…
Run-time assertion checking of JML annotations in multithreaded applications with e-OpenJML
Kandziora, Jorne; Huisman, Marieke; Bockisch, Christoph; Zaharieva-Stojanovski, Marina; Monahan, R.
2015-01-01
Run-time assertion checking of multithreaded programs is challenging, as assertion evaluation should not interfere with the execution of other threads. This paper describes the prototype implementation of a run-time assertion checker that achieves this by evaluating assertions over snapshots of the
An Assertional Proof System for Multithreaded Java - Theory and Tool Support
Abraham, E.
2005-01-01
Besides the features of a class-based object-oriented language, Java integrates concurrency via its thread classes, allowing for a multithreaded flow of control. The concurrency model includes shared-variable concurrency via instance variables, coordination via reentrant synchronization monitors,
Permission-based separation logic for multi-threaded Java programs
Amighi, A.; Haack, Christian; Huisman, Marieke; Hurlin, C.
This paper presents a program logic for reasoning about multithreaded Java-like programs with concurrency primitives such as dynamic thread creation, thread joining and reentrant object monitors. The logic is based on concurrent separation logic. It is the first detailed adaptation of concurrent
Run-time Assertion Checking of JML Annotations in Multithreaded Applications with e-OpenJML
Kandziora, Jorne; Huisman, Marieke; Bockisch, Christoph; Zaharieva, M.; Monahan, R.
Run-time assertion checking of multithreaded programs is challenging, as assertion evaluation should not interfere with the execution of other threads. This paper describes the prototype implementation of a run-time assertion checker that achieves this by evaluating assertions over snapshots of the
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...
多线程计算模型、体系结构与编译技术%Multithreaded Computing Model,Architecture and Compiling Technique
林海波; 汤志忠
2003-01-01
Multithreading has been proposed as an efficient computing model for improving parallelism. It combinesadvantages of both dataflow architecture and von Neumann architecture,leading to high performance and efficiency.The-state-of-the-art multithreaded computing model includes Blocking thread and Non-blocking thread, the corre-sponded multithreaded architecting can be classified as Multiple Context Processor and Hybrid Architecture. Threadpartitioning is one of the most important compiling issues in multithreaded computing. The idea of multithreading willbe developed further on the move of architecture,compiling technique,and operating system.
Exploring 3D GPU-accelerated graph visualization with time-traveling virtual camera
Peter Kapec
2013-04-01
Full Text Available Graph visualization is an ongoing research area with many open problems. Graphs are often visualized in 2D space and recently also 3D visualizations emerge. However, the added third dimension adds additional problems that make the graph comprehension more difficult. In this paper we focus on navigating and exploring 3D graph visualizations. We present our approach for the automation of virtual camera movement for better graph exploration. This camera movement is enhanced with experimental exploration recording and play-back that allows to fork exploration paths at any time and to switch between them. We also present how graph layout can be accelerated with GPU in combination with scene graph structures. These features were added into our graph visualization system that we use for software visualization. We present several visualizations of the structure and the evolution of software systems.
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.
Spectral recognition of graphs
Cvetković Dragoš
2012-01-01
Full Text Available At some time, in the childhood of spectral graph theory, it was conjectured that non-isomorphic graphs have different spectra, i.e. that graphs are characterized by their spectra. Very quickly this conjecture was refuted and numerous examples and families of non-isomorphic graphs with the same spectrum (cospectral graphs were found. Still some graphs are characterized by their spectra and several mathematical papers are devoted to this topic. In applications to computer sciences, spectral graph theory is considered as very strong. The benefit of using graph spectra in treating graphs is that eigenvalues and eigenvectors of several graph matrices can be quickly computed. Spectral graph parameters contain a lot of information on the graph structure (both global and local including some information on graph parameters that, in general, are computed by exponential algorithms. Moreover, in some applications in data mining, graph spectra are used to encode graphs themselves. The Euclidean distance between the eigenvalue sequences of two graphs on the same number of vertices is called the spectral distance of graphs. Some other spectral distances (also based on various graph matrices have been considered as well. Two graphs are considered as similar if their spectral distance is small. If two graphs are at zero distance, they are cospectral. In this sense, cospectral graphs are similar. Other spectrally based measures of similarity between networks (not necessarily having the same number of vertices have been used in Internet topology analysis, and in other areas. The notion of spectral distance enables the design of various meta-heuristic (e.g., tabu search, variable neighbourhood search algorithms for constructing graphs with a given spectrum (spectral graph reconstruction. Several spectrally based pattern recognition problems appear in many areas (e.g., image segmentation in computer vision, alignment of protein-protein interaction networks in bio
iHarmonizer: improving the disk efficiency of I/O-intensive multithreaded codes
Davis, Marion Kei [Los Alamos National Laboratory; Wang, Yizhe [WAYNE STATE UNIV.; Jiang, Song [WAYNE STATE UNIV.
2010-01-01
Challenged by serious power and thermal constraints, and limited by available instruction-level parallelism, processor designs have evolved to multi-core architectures. These architectures, many augmented with native simultaneous multithreading, are driving software developers to use multithreaded programs to exploit thread-level parallelism. While multithreading is well-known to introduce concerns of data dependency and CPU load balance, less known is that the uncertainty of relative progress of thread execution can cause patterns of I/O requests, issued by different threads, to be effectively random and so significantly degrade hard-disk efficiency. This effect can severely offset the performance gains from parallel execution, especially for I/O-intensive programs. Retaining the benefits of multithreading while not reducing I/O efficiency is an urgent and challenging problem. We propose a user-level scheme, iHarmonizer, to streamline the servicing of I/O requests from multiple threads in OpenMP programs. Specifically, we use the compiler to insert code into OpenMP programs so that data usage can be transmitted at run time to a supporting run-time library; this library in turn prefetches data in a disk-friendly way and coordinates threads execution according to the availability of their requested data. Transparently to the programmer, iHarmonizer makes a multithreaded program I/O efficient while maintaining the benefits of parallelism. Our experiments show that iHarmonizer can significantly speed up the execution of a representative set of I/O-intensive scientific benchmarks.
Pancyclic and bipancyclic graphs
George, John C; Wallis, W D
2016-01-01
This book is focused on pancyclic and bipancyclic graphs and is geared toward researchers and graduate students in graph theory. Readers should be familiar with the basic concepts of graph theory, the definitions of a graph and of a cycle. Pancyclic graphs contain cycles of all possible lengths from three up to the number of vertices in the graph. Bipartite graphs contain only cycles of even lengths, a bipancyclic graph is defined to be a bipartite graph with cycles of every even size from 4 vertices up to the number of vertices in the graph. Cutting edge research and fundamental results on pancyclic and bipartite graphs from a wide range of journal articles and conference proceedings are composed in this book to create a standalone presentation. The following questions are highlighted through the book: - What is the smallest possible number of edges in a pancyclic graph with v vertices? - When do pancyclic graphs exist with exactly one cycle of every possible length? - What is the smallest possible number of...
Compeau, Phillip E.C
2011-01-01
We consider four families of pancake graphs, which are Cayley graphs, whose vertex sets are either the symmetric group on n objects or the hyperoctahedral group on n objects and whose generating sets...
2013-01-01
on Facebook , one would like to detect tightly connected communities, which is useful for subsequent tasks like customized recommendation and... advertisement . Graphs in modern applications have several characteristics that complicate graph clustering: • Small density gap: the edge density across
Shuai, Hong-Han; Yu, Philip S; Shen, Chih-Ya; Chen, Ming-Syan
2013-01-01
The importance of graph mining has been widely recognized thanks to a large variety of applications in many areas, while real datasets always play important roles to examine the solution quality and efficiency of a graph mining algorithm. Nevertheless, the size of a real dataset is usually fixed and constrained according to the available resources, such as the efforts to crawl an on-line social network. In this case, employing a synthetic graph generator is a possible way to generate a massive graph (e.g., billions nodes) for evaluating the scalability of an algorithm, and current popular statistical graph generators are properly designed to maintain statistical metrics such as total node degree, degree distribution, diameter, and clustering coefficient of the original social graphs. Nevertheless, in addition to the above metrics, recent studies on graph mining point out that graph frequent patterns are also important to provide useful implications for the corresponding social networking applications, but thi...
Evolutionary Graph Drawing Algorithms
Huang Jing-wei; Wei Wen-fang
2003-01-01
In this paper, graph drawing algorithms based on genetic algorithms are designed for general undirected graphs and directed graphs. As being shown, graph drawing algorithms designed by genetic algorithms have the following advantages: the frames of the algorithms are unified, the method is simple, different algorithms may be attained by designing different objective functions, therefore enhance the reuse of the algorithms. Also, aesthetics or constrains may be added to satisfy different requirements.
On molecular graph comparison.
Melo, Jenny A; Daza, Edgar
2011-06-01
Since the last half of the nineteenth century, molecular graphs have been present in several branches of chemistry. When used for molecular structure representation, they have been compared after mapping the corresponding graphs into mathematical objects. However, direct molecular comparison of molecular graphs is a research field less explored. The goal of this mini-review is to show some distance and similarity coefficients which were proposed to directly compare molecular graphs or which could be useful to do so.
Integral trees and integral graphs
Wang, Ligong
2005-01-01
This monograph deals with integral graphs, Laplacian integral regular graphs, cospectral graphs and cospectral integral graphs. The organization of this work, which consists of eight chapters, is as follows.
Ellens, W.; Spieksma, F.M.; Mieghem, P. van; Jamakovic, A.; Kooij, R.E.
2011-01-01
This paper studies an interesting graph measure that we call the effective graph resistance. The notion of effective graph resistance is derived from the field of electric circuit analysis where it is defined as the accumulated effective resistance between all pairs of vertices. The objective of the
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…
Charles Suffel
1982-01-01
Full Text Available A graph is subeulerian if it is spanned by an eulerian supergraph. Boesch, Suffel and Tindell have characterized the class of subeulerian graphs and determined the minimum number of additional lines required to make a subeulerian graph eulerian.
Loukas, A.
2015-01-01
We have recently seen a surge of research focusing on the processing of graph data. The emerging field of signal processing on graphs focuses on the extension of classical discrete signal processing techniques to the graph setting. Arguably, the greatest breakthrough of the field has been the extens
Yoder, Sharon K.
This book discusses four kinds of graphs that are taught in mathematics at the middle school level: pictographs, bar graphs, line graphs, and circle graphs. The chapters on each of these types of graphs contain information such as starting, scaling, drawing, labeling, and finishing the graphs using "LogoWriter." The final chapter of the book…
Gross, Jonathan L
2003-01-01
The Handbook of Graph Theory is the most comprehensive single-source guide to graph theory ever published. Best-selling authors Jonathan Gross and Jay Yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theory-including those related to algorithmic and optimization approaches as well as ""pure"" graph theory. They then carefully edited the compilation to produce a unified, authoritative work ideal for ready reference.Designed and edited with non-experts in mind, the Handbook of Graph Theory makes information easy to fi
Wong, Pak C.; Mackey, Patrick S.; Perrine, Kenneth A.; Foote, Harlan P.; Thomas, James J.
2008-12-23
Methods for visualizing a graph by automatically drawing elements of the graph as labels are disclosed. In one embodiment, the method comprises receiving node information and edge information from an input device and/or communication interface, constructing a graph layout based at least in part on that information, wherein the edges are automatically drawn as labels, and displaying the graph on a display device according to the graph layout. In some embodiments, the nodes are automatically drawn as labels instead of, or in addition to, the label-edges.
Cudennec, Christophe
2016-04-01
The Anthropocene concept encapsulates the planetary-scale changes resulting from accelerating socio-ecological transformations, beyond the stratigraphic definition actually in debate. The emergence of multi-scale and proteiform complexity requires inter-discipline and system approaches. Yet, to reduce the cognitive challenge of tackling this complexity, the global Anthropocene syndrome must now be studied from various topical points of view, and grounded at regional and local levels. A system approach should allow to identify AnthropoScenes, i.e. settings where a socio-ecological transformation subsystem is clearly coherent within boundaries and displays explicit relationships with neighbouring/remote scenes and within a nesting architecture. Hydrology is a key topical point of view to be explored, as it is important in many aspects of the Anthropocene, either with water itself being a resource, hazard or transport force; or through the network, connectivity, interface, teleconnection, emergence and scaling issues it determines. We will schematically exemplify these aspects with three contrasted hydrological AnthropoScenes in Tunisia, France and Iceland; and reframe therein concepts of the hydrological change debate. Bai X., van der Leeuw S., O'Brien K., Berkhout F., Biermann F., Brondizio E., Cudennec C., Dearing J., Duraiappah A., Glaser M., Revkin A., Steffen W., Syvitski J., 2016. Plausible and desirable futures in the Anthropocene: A new research agenda. Global Environmental Change, in press, http://dx.doi.org/10.1016/j.gloenvcha.2015.09.017 Brondizio E., O'Brien K., Bai X., Biermann F., Steffen W., Berkhout F., Cudennec C., Lemos M.C., Wolfe A., Palma-Oliveira J., Chen A. C-T. Re-conceptualizing the Anthropocene: A call for collaboration. Global Environmental Change, in review. Montanari A., Young G., Savenije H., Hughes D., Wagener T., Ren L., Koutsoyiannis D., Cudennec C., Grimaldi S., Blöschl G., Sivapalan M., Beven K., Gupta H., Arheimer B., Huang Y
Caetano, Tiberio S; Cheng, Li; Le, Quoc V; Smola, Alex J
2008-01-01
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the `labels' are ma...
Harrison, JM; Robbins, JM; 10.1098/rspa.2010.0254
2011-01-01
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph, concentrating on the simplest case of abelian statistics for two particles. In spite of the fact that graphs are locally one-dimensional, anyon statistics emerge in a generalized form. A given graph may support a family of independent anyon phases associated with topologically inequivalent exchange processes. In addition, for sufficiently complex graphs, there appear new discrete-valued phases. Our analysis is simplified by considering combinatorial rather than metric graphs -- equivalently, a many-particle tight-binding model. The results demonstrate that graphs provide an arena in which to study new manifestations of quantum statistics. Possible applications include topological quantum computing, topological insulators, the fractional quantum Hall effect, superconductivity and molec...
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.
Dynamically Translating Binary Code for Multi-Threaded Programs Using Shared Code Cache
Chia-Lun Liu; Jiunn-Yeu Chen; Wuu Yang; Wei-Chung Hsu
2014-01-01
mc2llvm is a process-level ARM-to-x86 binary translator developed in our lab in the past several years. Currently, it is able to emulate single-threaded programs. We extend mc2llvm to emulate multi-threaded programs. Our main task is to reconstruct its architecture for multi-threaded programs. Register mapping, code cache management, and address mapping in mc2llvm have all been modified. In addition, to further speed up the emulation, we collect hot paths, aggressively optimize and generate code for them at run time. Additional threads are used to alleviate the overhead. Thus, when the same hot path is walked through again, the corresponding optimized native code will be executed instead. In our experiments, our system is 8.8X faster than QEMU (quick emulator) on average when emulating the specified benchmarks with 8 guest threads.
Performance Evaluation of Multithreaded Geant4 Simulations Using an Intel Xeon Phi Cluster
2015-01-01
International audience; The objective of this study is to evaluate the performances of Intel Xeon Phi hardware accelerators for Geant4 simulations, especially for multithreaded applications. We present the complete methodology to guide users for the compilation of their Geant4 applications on Phi processors. Then, we propose series of benchmarks to compare the performance of Xeon CPUs and Phi processors for a Geant4 example dedicated to the simulation of electron dose point kernels, the TestE...
A multithreaded scheduling model for solving the Tower of Hanoi game in a multicore environment
Alaa M. Al-Obaidi
2012-08-01
Full Text Available Modern computer systems greatly depend on multithreaded scheduling tobalance the workload among their working units. One of the multithreaded scheduling techniques, the work-stealing technique has proven effective in balancing the distribution of threads by stealing threads from the working cores and reallocating them to the nonworking cores. In this study, we propose a new strategy that extends the work-stealing technique by enabling it to select the richest core prior to any redistribution process. Inorder to obtain practical results, we applied this new strategy of balancing threads to one of the divide-and-conquer problems, the Tower of Hanoi game. A multithreaded scheduling model which is a hierarchical model was designed to work under the control of this new strategy. A modelling tool was used to simulate and verify the designed model. The proposed model was shown by the simulation process to exhibit consistency and stabilityin reaching the desired result. Scalability, concurrency, simplicity and fair load distribution among the modelled cores are the main beneficial characteristics of this model.
Multi-threaded acceleration of ORBIT code on CPU and GPU with minimal modifications
Qu, Ante; Ethier, Stephane; Feibush, Eliot; White, Roscoe
2013-10-01
The guiding center code ORBIT was originally developed 30 years ago to study the drift orbit effects of charged particles in the strong equilibrium magnetic fields of tokamaks. Today, ORBIT remains a very active tool in magnetic confinement fusion research and continues to adapt to the latest toroidal devices, such as the NSTX-Upgrade, for which it plays a very important role in the study of energetic particle effects. Although the capabilities of ORBIT have improved throughout the years, the code still remains a serial application, which has now become an impediment to the lengthy simulations required for the NSTX-U project. In this work, multi-threaded parallelism is introduced in the core of the code with the goal of achieving the largest performance improvement while minimizing changes made to the source code. To that end, we introduce preprocessor directives in the most compute-intensive parts of the code, which constitute the stable core that seldom changes. Standard OpenMP directives are used for shared-memory CPU multi-threading while newly developed OpenACC (www.openacc.org) directives are used for GPU (Graphical Processing Unit) multi-threading. Implementation details and performance results are presented.
Radiative transfer in cylindrical threads with incident radiation VII. Multi-thread models
Labrosse, N
2016-01-01
We solved the radiative transfer and statistical equilibrium equations in a two-dimensional cross-section of a cylindrical structure oriented horizontally and lying above the solar surface. The cylinder is filled with a mixture of hydrogen and helium and is illuminated at a given altitude from the solar disc. We constructed simple models made from a single thread or from an ensemble of several threads along the line of sight. This first use of two-dimensional, multi-thread fine structure modelling combining hydrogen and helium radiative transfer allowed us to compute synthetic emergent spectra from cylindrical structures and to study the effect of line-of-sight integration of an ensemble of threads under a range of physical conditions. We analysed the effects of variations in temperature distribution and in gas pressure. We considered the effect of multi-thread structures within a given field of view and the effect of peculiar velocities between the structures in a multi-thread model. We compared these new mo...
Improving Scalability of Java Archive Search Engine through Recursion Conversion And Multithreading
Oscar Karnalim
2016-05-01
Full Text Available Based on the fact that bytecode always exists on Java archive, a bytecode based Java archive search engine had been developed [1, 2]. Although this system is quite effective, it still lack of scalability since many modules apply recursive calls and this system only utilizes one core (single thread. In this research, Java archive search engine architecture is redesigned in order to improve its scalability. All recursion are converted to iterative forms although most of these modules are logically recursive and quite difficult to convert (e.g. Tarjan’s strongly connected component algorithm. Recursion conversion can be conducted by following its respective recursive pattern. Each recursion is broke down to four parts (before and after actions of current and its children and converted to iteration with the help of caller reference. This conversion mechanism improves scalability by avoiding stack overflow error caused by method calls. System scalability is also improved by applying multithreading mechanism which successfully cut off its processing time. Shorter processing time may enable system to handle larger data. Multithreading is applied on major parts which are indexer, vector space model (VSM retriever, low-rank vector space model (LRVSM retriever, and semantic relatedness calculator (semantic relatedness calculator also involves multiprocess. The correctness of both recursion conversion and multithread design are proved by the fact that all implementation yield similar result.
A Light-Weight Approach for Verifying Multi-Threaded Programs with CPAchecker
Dirk Beyer
2016-12-01
Full Text Available Verifying multi-threaded programs is becoming more and more important, because of the strong trend to increase the number of processing units per CPU socket. We introduce a new configurable program analysis for verifying multi-threaded programs with a bounded number of threads. We present a simple and yet efficient implementation as component of the existing program-verification framework CPAchecker. While CPAchecker is already competitive on a large benchmark set of sequential verification tasks, our extension enhances the overall applicability of the framework. Our implementation of handling multiple threads is orthogonal to the abstract domain of the data-flow analysis, and thus, can be combined with several existing analyses in CPAchecker, like value analysis, interval analysis, and BDD analysis. The new analysis is modular and can be used, for example, to verify reachability properties as well as to detect deadlocks in the program. This paper includes an evaluation of the benefit of some optimization steps (e.g., changing the iteration order of the reachability algorithm or applying partial-order reduction as well as the comparison with other state-of-the-art tools for verifying multi-threaded programs.
Jampani, Krishnam Raju
2010-01-01
In a recent paper, we introduced the simultaneous representation problem (defined for any graph class C) and studied the problem for chordal, comparability and permutation graphs. For interval graphs, the problem is defined as follows. Two interval graphs G_1 and G_2, sharing some vertices I (and the corresponding induced edges), are said to be `simultaneous interval graphs' if there exist interval representations R_1 and R_2 of G_1 and G_2, such that any vertex of I is mapped to the same interval in both R_1 and R_2. Equivalently, G_1 and G_2 are simultaneous interval graphs if there exist edges E' between G_1-I and G_2-I such that G_1 \\cup G_2 \\cup E' is an interval graph. Simultaneous representation problems are related to simultaneous planar embeddings, and have applications in any situation where it is desirable to consistently represent two related graphs, for example: interval graphs capturing overlaps of DNA fragments of two similar organisms; or graphs connected in time, where one is an updated versi...
Graph Grammar-Based Multi-Frontal Parallel Direct Solver for Two-Dimensional Isogeometric Analysis
Kuźnik, Krzysztof
2012-06-02
This paper introduces the graph grammar based model for developing multi-thread multi-frontal parallel direct solver for two dimensional isogeometric finite element method. Execution of the solver algorithm has been expressed as the sequence of graph grammar productions. At the beginning productions construct the elimination tree with leaves corresponding to finite elements. Following sequence of graph grammar productions generates element frontal matri-ces at leaf nodes, merges matrices at parent nodes and eliminates rows corresponding to fully assembled degrees of freedom. Finally, there are graph grammar productions responsible for root problem solution and recursive backward substitutions. Expressing the solver algorithm by graph grammar productions allows us to explore the concurrency of the algorithm. The graph grammar productions are grouped into sets of independent tasks that can be executed concurrently. The resulting concurrent multi-frontal solver algorithm is implemented and tested on NVIDIA GPU, providing O(NlogN) execution time complexity where N is the number of degrees of freedom. We have confirmed this complexity by solving up to 1 million of degrees of freedom with 448 cores GPU.
Multiple Illuminant Colour Estimation via Statistical Inference on Factor Graphs.
Mutimbu, Lawrence; Robles-Kelly, Antonio
2016-08-31
This paper presents a method to recover a spatially varying illuminant colour estimate from scenes lit by multiple light sources. Starting with the image formation process, we formulate the illuminant recovery problem in a statistically datadriven setting. To do this, we use a factor graph defined across the scale space of the input image. In the graph, we utilise a set of illuminant prototypes computed using a data driven approach. As a result, our method delivers a pixelwise illuminant colour estimate being devoid of libraries or user input. The use of a factor graph also allows for the illuminant estimates to be recovered making use of a maximum a posteriori (MAP) inference process. Moreover, we compute the probability marginals by performing a Delaunay triangulation on our factor graph. We illustrate the utility of our method for pixelwise illuminant colour recovery on widely available datasets and compare against a number of alternatives. We also show sample colour correction results on real-world images.
Figure-Ground Segmentation Using Factor Graphs.
Shen, Huiying; Coughlan, James; Ivanchenko, Volodymyr
2009-06-04
Foreground-background segmentation has recently been applied [26,12] to the detection and segmentation of specific objects or structures of interest from the background as an efficient alternative to techniques such as deformable templates [27]. We introduce a graphical model (i.e. Markov random field)-based formulation of structure-specific figure-ground segmentation based on simple geometric features extracted from an image, such as local configurations of linear features, that are characteristic of the desired figure structure. Our formulation is novel in that it is based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables. The ability of factor graphs to express interactions higher than pairwise order (the highest order encountered in most graphical models used in computer vision) is useful for modeling a variety of pattern recognition problems. In particular, we show how this property makes factor graphs a natural framework for performing grouping and segmentation, and demonstrate that the factor graph framework emerges naturally from a simple maximum entropy model of figure-ground segmentation.We cast our approach in a learning framework, in which the contributions of multiple grouping cues are learned from training data, and apply our framework to the problem of finding printed text in natural scenes. Experimental results are described, including a performance analysis that demonstrates the feasibility of the approach.
Fujie, Futaba
2014-01-01
Covering Walks in Graphs is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity and traversability in graphs. This text looks into the famous Kӧnigsberg Bridge Problem, the Chinese Postman Problem, the Icosian Game and the Traveling Salesman Problem as well as well-known mathematicians who were involved in these problems. The concepts of different spanning walks with examples and present classical results on Hamiltonian numbers and upper Hamiltonian numbers of graphs are described; in some cases, the authors provide proofs of these results to illustrate the beauty and complexity of this area of research. Two new concepts of traceable numbers of graphs and traceable numbers of vertices of a graph which were inspired by and closely related to Hamiltonian numbers are introduced. Results are illustrated on these two concepts and the relationship between traceable concepts and...
Dosen, K
2011-01-01
Plural (or multiple-conclusion) cuts are inferences made by applying a structural rule introduced by Gentzen for his sequent formulation of classical logic. As singular (single-conclusion) cuts yield trees, which underlie ordinary natural deduction derivations, so plural cuts yield graphs of a more complicated kind, related to trees, which this paper defines. Besides the inductive definition of these oriented graphs, which is based on sequent systems, a non-inductive, graph-theoretical, combinatorial, definition is given, and to reach that other definition is the main goal of the paper. As trees underlie multicategories, so the graphs of plural cuts underlie polycategories. The graphs of plural cuts are interesting in particular when the plural cuts are appropriate for sequent systems without the structural rule of permutation, and the main body of the paper deals with that matter. It gives a combinatorial characterization of the planarity of the graphs involved.
Velasco, Pedro Pablo Perez
2008-01-01
This book objective is to develop an algebraization of graph grammars. Equivalently, we study graph dynamics. From the point of view of a computer scientist, graph grammars are a natural generalization of Chomsky grammars for which a purely algebraic approach does not exist up to now. A Chomsky (or string) grammar is, roughly speaking, a precise description of a formal language (which in essence is a set of strings). On a more discrete mathematical style, it can be said that graph grammars -- Matrix Graph Grammars in particular -- study dynamics of graphs. Ideally, this algebraization would enforce our understanding of grammars in general, providing new analysis techniques and generalizations of concepts, problems and results known so far.
Arrighi, Pablo
2012-01-01
We generalize the theory of Cellular Automata to arbitrary, time-varying graphs. In other words we formalize, and prove theorems about, the intuitive idea of a labelled graph which evolves in time - but under the natural constraint that information can only ever be transmitted at a bounded speed, with respect to the distance given by the graph. The notion of translation-invariance is also generalized. The definition we provide for these `causal graph dynamics' is simple and axiomatic. The theorems we provide also show that it is robust. For instance, causal graph dynamics are stable under composition and under restriction to radius one. In the finite case some fundamental facts of Cellular Automata theory carry through: causal graph dynamics admit a characterization as continuous functions and they are stable under inversion. The provided examples suggest a wide range of applications of this mathematical object, from complex systems science to theoretical physics. Keywords: Dynamical networks, Boolean network...
Buczyńska, Weronika
2010-01-01
We define toric projective model of a trivalent graph as a generalization of a binary symmetric model of a trivalent phylogenetic tree. Generators of the projective coordinate ring of the models of graphs with one cycle are explicitly described. The models of graphs with the same topological invariants are deformation equivalent and share the same Hilbert function. We also provide an algorithm to compute the Hilbert function.
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
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
Lothian, Josh [ORNL; Powers, Sarah S [ORNL; Sullivan, Blair D [ORNL; Baker, Matthew B [ORNL; Schrock, Jonathan [ORNL; Poole, Stephen W [ORNL
2013-12-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 dierent 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.
Thomassen, Carsten
2014-01-01
We prove a general result on graph factors modulo k . A special case says that, for each natural number k , every (12k−7)-edge-connected graph with an even number of vertices contains a spanning subgraph in which each vertex has degree congruent to k modulo 2k.......We prove a general result on graph factors modulo k . A special case says that, for each natural number k , every (12k−7)-edge-connected graph with an even number of vertices contains a spanning subgraph in which each vertex has degree congruent to k modulo 2k....
Gelfand, I M; Shnol, E E
2002-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
Bradford, Robert; Chmutov, Sergei
2011-01-01
We introduce an additional structure on ribbon graphs, arrow structure. We extend the Bollob\\'as-Riordan polynomial to ribbon graph with this structure. The extended polynomial satisfies the contraction-deletion relations and naturally behaves with respect to the partial duality of ribbon graphs. We construct an arrow ribbon graph from a virtual link whose extended Bollob\\'as-Riordan polynomial specializes to the arrow polynomial of the virtual link recently introduced by H.Dye and L.Kauffman. This result generalizes the classical Thistlethwaite theorem to the arrow polynomial of virtual links.
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.
Ping WANG; Jiong Sheng LI
2005-01-01
Let G be a finite simple graph with adjacency matrix A, and let P(A) be the convex closure of the set of all permutation matrices commuting with A. G is said to be compact if every doubly stochastic matrix which commutes with A is in P(A). In this paper, we characterize 3-regular compact graphs and prove that if G is a connected regular compact graph, G - v is also compact, and give a family of almost regular compact connected graphs.
Framings for graph hypersurfaces
Brown, Francis
2013-01-01
We present a method for computing the framing on the cohomology of graph hypersurfaces defined by the Feynman differential form. This answers a question of Bloch, Esnault and Kreimer in the affirmative for an infinite class of graphs for which the framings are Tate motives. Applying this method to the modular graphs of Brown and Schnetz, we find that the Feynman differential form is not of Tate type in general. This finally disproves a folklore conjecture stating that the periods of Feynman integrals of primitive graphs in phi^4 theory factorise through a category of mixed Tate motives.
Dynamic scene stitching driven by visual cognition model.
Zou, Li-hui; Zhang, Dezheng; Wulamu, Aziguli
2014-01-01
Dynamic scene stitching still has a great challenge in maintaining the global key information without missing or deforming if multiple motion interferences exist in the image acquisition system. Object clips, motion blurs, or other synthetic defects easily occur in the final stitching image. In our research work, we proceed from human visual cognitive mechanism and construct a hybrid-saliency-based cognitive model to automatically guide the video volume stitching. The model consists of three elements of different visual stimuli, that is, intensity, edge contour, and scene depth saliencies. Combined with the manifold-based mosaicing framework, dynamic scene stitching is formulated as a cut path optimization problem in a constructed space-time graph. The cutting energy function for column width selections is defined according to the proposed visual cognition model. The optimum cut path can minimize the cognitive saliency difference throughout the whole video volume. The experimental results show that it can effectively avoid synthetic defects caused by different motion interferences and summarize the key contents of the scene without loss. The proposed method gives full play to the role of human visual cognitive mechanism for the stitching. It is of high practical value to environmental surveillance and other applications.
Dynamic Scene Stitching Driven by Visual Cognition Model
Li-hui Zou
2014-01-01
Full Text Available Dynamic scene stitching still has a great challenge in maintaining the global key information without missing or deforming if multiple motion interferences exist in the image acquisition system. Object clips, motion blurs, or other synthetic defects easily occur in the final stitching image. In our research work, we proceed from human visual cognitive mechanism and construct a hybrid-saliency-based cognitive model to automatically guide the video volume stitching. The model consists of three elements of different visual stimuli, that is, intensity, edge contour, and scene depth saliencies. Combined with the manifold-based mosaicing framework, dynamic scene stitching is formulated as a cut path optimization problem in a constructed space-time graph. The cutting energy function for column width selections is defined according to the proposed visual cognition model. The optimum cut path can minimize the cognitive saliency difference throughout the whole video volume. The experimental results show that it can effectively avoid synthetic defects caused by different motion interferences and summarize the key contents of the scene without loss. The proposed method gives full play to the role of human visual cognitive mechanism for the stitching. It is of high practical value to environmental surveillance and other applications.
Forensic 3D Scene Reconstruction
LITTLE,CHARLES Q.; PETERS,RALPH R.; RIGDON,J. BRIAN; SMALL,DANIEL E.
1999-10-12
Traditionally law enforcement agencies have relied on basic measurement and imaging tools, such as tape measures and cameras, in recording a crime scene. A disadvantage of these methods is that they are slow and cumbersome. The development of a portable system that can rapidly record a crime scene with current camera imaging, 3D geometric surface maps, and contribute quantitative measurements such as accurate relative positioning of crime scene objects, would be an asset to law enforcement agents in collecting and recording significant forensic data. The purpose of this project is to develop a feasible prototype of a fast, accurate, 3D measurement and imaging system that would support law enforcement agents to quickly document and accurately record a crime scene.
High Performance Semantic Factoring of Giga-Scale Semantic Graph Databases
Joslyn, Cliff A.; Adolf, Robert D.; Al-Saffar, Sinan; Feo, John T.; Goodman, Eric L.; Haglin, David J.; Mackey, Greg E.; Mizell, David W.
2010-10-04
As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to bring high performance computational resources to bear on their analysis, interpretation, and visualization, especially with respect to their innate semantic structure. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multithreaded architecture of the Cray XMT platform, conventional clusters, and large data stores. In this paper we describe that architecture, and present the results of our deploying that for the analysis of the Billion Triple dataset with respect to its semantic factors.
High performance semantic factoring of giga-scale semantic graph databases.
al-Saffar, Sinan (Pacific Northwest National Laboratory); Adolf, Bob (Pacific Northwest National Laboratory); Haglin, David (Pacific Northwest National Laboratory); Mackey, Greg Edward; Goodman, Eric L.; Joslyn, Cliff A. (Pacific Northwest National Laboratory); Feo, John (Pacific Northwest National Laboratory); Mizell, David (Cray, Inc.)
2010-10-01
As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to bring high performance computational resources to bear on their analysis, interpretation, and visualization, especially with respect to their innate semantic structure. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multithreaded architecture of the Cray XMT platform, conventional clusters, and large data stores. In this paper we describe that architecture, and present the results of our deploying that for the analysis of the Billion Triple dataset with respect to its semantic factors, including basic properties, connected components, namespace interaction, and typed paths.
Caetano, Tibério S; McAuley, Julian J; Cheng, Li; Le, Quoc V; Smola, Alex J
2009-06-01
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.
Rensink, Arend; Distefano, Dino
2005-01-01
Graphs may be used as representations of system states in operational semantics and model checking; in the latter context, they are being investigated as an alternative to bit vectors. The corresponding transitions are obtained as derivations from graph production rules. In this paper we propose an
Rensink, Arend; Distefano, Dino; Mukhopadhyay, S.; Roychoudhury, A.; Yang, Z.
2006-01-01
Graphs may be used as representations of system states in operational semantics and model checking; in the latter context, they are being investigated as an alternative to bit vectors. The corresponding transitions are obtained as derivations from graph production rules. In this paper we propose an
Moment graphs and representations
Jantzen, Jens Carsten
2012-01-01
Moment graphs and sheaves on moment graphs are basically combinatorial objects that have be used to describe equivariant intersectiion cohomology. In these lectures we are going to show that they can be used to provide a direct link from this cohomology to the representation theory of simple Lie...
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...
Behnaz Tolue
2018-07-01
Full Text Available In this paper we introduce stable subgroup graph associated to the group $G$. It is a graph with vertex set all subgroups of $G$ and two distinct subgroups $H_1$ and $H_2$ are adjacent if $St_{G}(H_1\\cap H_2\
Mol, de Maarten; Rensink, Arend; Hunt, James J.
2012-01-01
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 declaration
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 techniques and is organized by algorithmic paradigm.
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 i
Belkhechine, Houmem; Elayech, Mohamed Baka
2010-01-01
Given a (directed) graph G=(V,A), a subset X of V is an interval of G provided that for any a, b\\in X and x\\in V-X, (a,x)\\in A if and only if (b,x)\\in A and (x,a)\\in A if and only if (x,b)\\in A. For example, \\emptyset, \\{x\\} (x \\in V) and V are intervals of G, called trivial intervals. A graph, all the intervals of which are trivial, is indecomposable; otherwise, it is decomposable. A vertex x of an indecomposable graph is critical if G-x is decomposable. In 1993, J.H. Schmerl and W.T. Trotter characterized the indecomposable graphs, all the vertices of which are critical, called critical graphs. In this article, we characterize the indecomposable graphs which admit a single non critical vertex, that we call (-1)-critical graphs.} This gives an answer to a question asked by Y. Boudabbous and P. Ille in a recent article studying the critical vertices in an indecomposable graph.
A. Assari
2016-01-01
Full Text Available In this paper, a graph is assigned to any probability measure on the σ-algebra of Borel sets of a topological space. Using this construction, it is proved that given any number n (finite or infinite there exists a nonregular graph such that its clique, chromatic, and dominating number equals n.
Moment graphs and representations
Jantzen, Jens Carsten
2012-01-01
Moment graphs and sheaves on moment graphs are basically combinatorial objects that have be used to describe equivariant intersectiion cohomology. In these lectures we are going to show that they can be used to provide a direct link from this cohomology to the representation theory of simple Lie...... algebras and of simple algebraic groups. The first section contains some background on equivariant cohomology....
Graphs: Associated Markov Chains
2012-01-01
In this research paper, weighted / unweighted, directed / undirected graphs are associated with interesting Discrete Time Markov Chains (DTMCs) as well as Continuous Time Markov Chains (CTMCs). The equilibrium / transient behaviour of such Markov chains is studied. Also entropy dynamics (Shannon entropy) of certain structured Markov chains is investigated. Finally certain structured graphs and the associated Markov chains are studied.
Kim, Suh-Ryung; Park, Boram; Sano, Yoshio
2011-01-01
The competition graph of a digraph $D$ is a (simple undirected) graph which has the same vertex set as $D$ and has an edge between $x$ and $y$ if and only if there exists a vertex $v$ in $D$ such that $(x,v)$ and $(y,v)$ are arcs of $D$. For any graph $G$, $G$ together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number $k(G)$ of $G$ is the smallest number of such isolated vertices. In general, it is hard to compute the competition number $k(G)$ for a graph $G$ and it has been one of the important research problems in the study of competition graphs. Opsut~[1982] suggested that the edge clique cover number $\\theta_E(G)$ should be closely related to $k(G)$ by showing $\\theta_E(G)-|V(G)|+2 \\leq k(G) \\leq \\theta_E(G)$. In this note, we study on these inequalities. We first show that for any positive integer $m$ satisfying $2 \\leq m \\leq |V(G)|$, there is a graph $G$ satisfying $k(G)=\\theta_E(G)-|V(G)|+m$ and characterize a graph $G$ satisfying $k(G)=\\...
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.
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.
Optimising GPR modelling: A practical, multi-threaded approach to 3D FDTD numerical modelling
Millington, T. M.; Cassidy, N. J.
2010-09-01
The demand for advanced interpretational tools has lead to the development of highly sophisticated, computationally demanding, 3D GPR processing and modelling techniques. Many of these methods solve very large problems with stepwise methods that utilise numerically similar functions within iterative computational loops. Problems of this nature are readily parallelised by splitting the computational domain into smaller, independent chunks for direct use on cluster-style, multi-processor supercomputers. Unfortunately, the implications of running such facilities, as well as time investment needed to develop the parallel codes, means that for most researchers, the use of these advanced methods is too impractical. In this paper, we propose an alternative method of parallelisation which exploits the capabilities of the modern multi-core processors (upon which today's desktop PCs are built) by multi-threading the calculation of a problem's individual sub-solutions. To illustrate the approach, we have applied it to an advanced, 3D, finite-difference time-domain (FDTD) GPR modelling tool in which the calculation of the individual vector field components is multi-threaded. To be of practical use, the FDTD scheme must be able to deliver accurate results with short execution times and we, therefore, show that the performance benefits of our approach can deliver runtimes less than half those of the more conventional, serial programming techniques. We evaluate implementations of the technique using different programming languages (e.g., Matlab, Java, C++), which will facilitate the construction of a flexible modelling tool for use in future GPR research. The implementations are compared on a variety of typical hardware platforms, having between one and eight processing cores available, and also a modern Graphical Processing Unit (GPU)-based computer. Our results show that a multi-threaded xyz modelling approach is easy to implement and delivers excellent results when implemented
Monocular visual scene understanding: understanding multi-object traffic scenes.
Wojek, Christian; Walk, Stefan; Roth, Stefan; Schindler, Konrad; Schiele, Bernt
2013-04-01
Following recent advances in detection, context modeling, and tracking, scene understanding has been the focus of renewed interest in computer vision research. This paper presents a novel probabilistic 3D scene model that integrates state-of-the-art multiclass object detection, object tracking and scene labeling together with geometric 3D reasoning. Our model is able to represent complex object interactions such as inter-object occlusion, physical exclusion between objects, and geometric context. Inference in this model allows us to jointly recover the 3D scene context and perform 3D multi-object tracking from a mobile observer, for objects of multiple categories, using only monocular video as input. Contrary to many other approaches, our system performs explicit occlusion reasoning and is therefore capable of tracking objects that are partially occluded for extended periods of time, or objects that have never been observed to their full extent. In addition, we show that a joint scene tracklet model for the evidence collected over multiple frames substantially improves performance. The approach is evaluated for different types of challenging onboard sequences. We first show a substantial improvement to the state of the art in 3D multipeople tracking. Moreover, a similar performance gain is achieved for multiclass 3D tracking of cars and trucks on a challenging dataset.
MT-ADRES: multi-threading on coarse-grained reconfigurable architecture
Wu, Kehuai; Kanstein, Andreas; Madsen, Jan;
2008-01-01
-ILP architectures achieve only low parallelism when executing partially sequential code segments, which is also known as Amdahl's law, this article proposes to extend ADRES to MT-ADRES (multi-threaded ADRES) to also exploit thread-level parallelism. On MT-ADRES architectures, the array can be partitioned...... in multiple smaller arrays that can execute threads in parallel. Because the partition can be changed dynamically, this extension provides more flexibility than a multi-core approach. This article presents details of the enhanced architecture and results obtained from an MPEG-2 decoder implementation...... that exploits a mix of thread-level parallelism and instruction-level parallelism....
Villa, Oreste; Chavarría-Miranda, Daniel; Gurumoorthi, Vidhya; Marquez, Andres; Krishnamoorthy, Sriram
2009-05-03
Floating-point addition and multiplication are not necessarily associative. When performing those operations over large numbers of operands with different magnitudes, the order in which individual operations are performed can affect the final result. On massively multithreaded systems, when performing parallel reductions, the non-deterministic nature of numerical operation interleaving can lead to non-deterministic numerical results. We have investigated the effect of this problem on the convergence of a conjugate gradient calculation used as part of a power grid analysis application.
Raied Salman
2015-11-01
Full Text Available In many business organizations, database applications are designed and implemented using various DBMS and Programming Languages. These applications are used to maintain databases for the organizations. The organization departments can be located at different locations and can be connected by intranet environment. In such environment maintenance of database records become an assignment of complexity which needs to be resolved. In this paper an intranet application is designed and implemented using Object-Oriented Programming Language Java and Object-Relational Database Management System Oracle in multithreaded Operating System environment.
New Multithreaded Hybrid CPU/GPU Approach to Hartree-Fock.
Asadchev, Andrey; Gordon, Mark S
2012-11-13
In this article, a new multithreaded Hartree-Fock CPU/GPU method is presented which utilizes automatically generated code and modern C++ techniques to achieve a significant improvement in memory usage and computer time. In particular, the newly implemented Rys Quadrature and Fock Matrix algorithms, implemented as a stand-alone C++ library, with C and Fortran bindings, provides up to 40% improvement over the traditional Fortran Rys Quadrature. The C++ GPU HF code provides approximately a factor of 17.5 improvement over the corresponding C++ CPU code.
Multi-threaded Query Agent and Engine for a Very Large Astronomical Database
Thakkar, A. R.; Kunszt, P. Z.; Szalay, A. S.; Szokoly, G. P.
We describe the Query Agent and Query Engine for the Science Archive of the Sloan Digital Sky Survey. In our client-server model, a GUI client communicates with a Query Agent that retrieves the requested data from the repository (a commercial ODBMS). The multi-threaded Agent is able to maintain multiple concurrent user sessions as well as multiple concurrent queries within each session. We describe the parallel, distributed design of the Query Agent and present the results of performance benchmarks that we have run using typical queries on our test data. We also report on our experiences with loading large amounts of data into Objectivity.
Verificación modular de atomicidad en bytecode Java Multi-Thread
Bavera, Francisco
2007-01-01
En este trabajo se presenta una técnica para verificar modularmente atomicidad de programas bytecode Java multi-thread. Los programas deben contar con una especificación referente a los bloqueos y al acceso a los recursos compartidos para realizar la verificación modular. Se presenta la compilación propuesta de programas fuente Java con la especificación de atomicidad a bytecode Java, con dichas especificaciones incluidas el código compilado. Garantizar atomicidad en programas mult-thread per...
Una versión paralela del NSGA II utilizando multi-threads
2004-01-01
El trabajo presenta una versión paralela mediante estrategias de multi-threads, del algoritmo evolutivo para optimización multiobjetivo NSGA-II. Se muestran los detalles de diseño e implementación de la versión paralela, en la que se define una estructura de vecindad la cual estipula la interacción entre las distintas sub-poblaciones. Se analiza la calidad de resultados y la eficiencia computacional, comparando con los resultados y tiempos de ejecución de la versión secuencial del algoritmo N...
Niedzialomski Amanda
2016-11-01
Full Text Available For k ∈ ℤ+ and G a simple, connected graph, a k-radio labeling f : V (G → ℤ+ of G requires all pairs of distinct vertices u and v to satisfy |f(u − f(v| ≥ k + 1 − d(u, v. We consider k-radio labelings of G when k = diam(G. In this setting, f is injective; if f is also surjective onto {1, 2, . . . , |V (G|}, then f is a consecutive radio labeling. Graphs that can be labeled with such a labeling are called radio graceful. In this paper, we give two results on the existence of radio graceful Hamming graphs. The main result shows that the Cartesian product of t copies of a complete graph is radio graceful for certain t. Graphs of this form provide infinitely many examples of radio graceful graphs of arbitrary diameter. We also show that these graphs are not radio graceful for large t.
Bidimensionality and Geometric Graphs
Fomin, Fedor V; Saurabh, Saket
2011-01-01
In this paper we use several of the key ideas from Bidimensionality to give a new generic approach to design EPTASs and subexponential time parameterized algorithms for problems on classes of graphs which are not minor closed, but instead exhibit a geometric structure. In particular we present EPTASs and subexponential time parameterized algorithms for Feedback Vertex Set, Vertex Cover, Connected Vertex Cover, Diamond Hitting Set, on map graphs and unit disk graphs, and for Cycle Packing and Minimum-Vertex Feedback Edge Set on unit disk graphs. Our results are based on the recent decomposition theorems proved by Fomin et al [SODA 2011], and our algorithms work directly on the input graph. Thus it is not necessary to compute the geometric representations of the input graph. To the best of our knowledge, these results are previously unknown, with the exception of the EPTAS and a subexponential time parameterized algorithm on unit disk graphs for Vertex Cover, which were obtained by Marx [ESA 2005] and Alber and...
Ziemann, Amanda K.; Messinger, David W.; Albano, James A.; Basener, William F.
2012-06-01
Anomaly detection algorithms have historically been applied to hyperspectral imagery in order to identify pixels whose material content is incongruous with the background material in the scene. Typically, the application involves extracting man-made objects from natural and agricultural surroundings. A large challenge in designing these algorithms is determining which pixels initially constitute the background material within an image. The topological anomaly detection (TAD) algorithm constructs a graph theory-based, fully non-parametric topological model of the background in the image scene, and uses codensity to measure deviation from this background. In TAD, the initial graph theory structure of the image data is created by connecting an edge between any two pixel vertices x and y if the Euclidean distance between them is less than some resolution r. While this type of proximity graph is among the most well-known approaches to building a geometric graph based on a given set of data, there is a wide variety of dierent geometrically-based techniques. In this paper, we present a comparative test of the performance of TAD across four dierent constructs of the initial graph: mutual k-nearest neighbor graph, sigma-local graph for two different values of σ > 1, and the proximity graph originally implemented in TAD.
Yoshinaga, Masahiko
2015-01-01
Finite graphs that have a common chromatic polynomial have the same number of regular $n$-colorings. A natural question is whether there exists a natural bijection between regular $n$-colorings. We address this question using a functorial formulation. Let $G$ be a simple graph. Then for each set $X$ we can associate a set of $X$-colorings. This defines a functor, "chromatic functor" from the category of sets with injections to itself. The first main result verifies that two finite graphs dete...
Gross, Jonathan L; Zhang, Ping
2013-01-01
In the ten years since the publication of the best-selling first edition, more than 1,000 graph theory papers have been published each year. Reflecting these advances, Handbook of Graph Theory, Second Edition provides comprehensive coverage of the main topics in pure and applied graph theory. This second edition-over 400 pages longer than its predecessor-incorporates 14 new sections. Each chapter includes lists of essential definitions and facts, accompanied by examples, tables, remarks, and, in some cases, conjectures and open problems. A bibliography at the end of each chapter provides an ex
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
Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?
Öçal, Mehmet Fatih
2017-01-01
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…
The Interval Graph Completion Problem on Split Graphs
ZHANG Zhen-kun; YU Min
2015-01-01
The interval graph completion problem on a graph G is to find an added edge set F such that G+F is an interval supergraph with the smallest possible number of edges. The problem has important applications to numerical algebra, V LSI-layout and algorithm graph theory etc; And it has been known to be N P-complete on general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the interval graph completion problem on split graphs is investigated.
Graph Operations on Clique-Width Bounded Graphs
Gurski, Frank
2007-01-01
Clique-width is a well-known graph parameter. Many NP-hard graph problems admit polynomial-time solutions when restricted to graphs of bounded clique-width. The same holds for NLC-width. In this paper we study the behavior of clique-width and NLC-width under various graph operations and graph transformations. We give upper and lower bounds for the clique-width and NLC-width of the modified graphs in terms of the clique-width and NLC-width of the involved graphs.
GraphState - a tool for graph identification and labelling
Batkovich, D; Kompaniets, M; Novikov, S
2014-01-01
We present python libraries for Feynman graphs manipulation. The key feature of these libraries is usage of generalization of graph representation offered by B. G. Nickel et al. In this approach graph is represented in some unique 'canonical' form that depends only on its combinatorial type. The uniqueness of graph representation gives an efficient way for isomorphism finding, searching for subgraphs and other graph manipulation tasks. Though offered libraries were originally designed for Feynman graphs, they might be useful for more general graph problems.
GEANT4-MT : bringing multi-threading into GEANT4 production
Ahn, Sunil; Apostolakis, John; Asai, Makoto; Brandt, Daniel; Cooperman, Gene; Cosmo, Gabriele; Dotti, Andrea; Dong, Xin; Jun, Soon Yung; Nowak, Andrzej
2014-06-01
GEANT4-MT is the multi-threaded version of the GEANT4 particle transport code.(1, 2) The key goals for the design of GEANT4-MT have been a) the need to reduce the memory footprint of the multi-threaded application compared to the use of separate jobs and processes; b) to create an easy migration of the existing applications; and c) to use efficiently many threads or cores, by scaling up to tens and potentially hundreds of workers. The first public release of a GEANT4-MT prototype was made in 2011. We report on the revision of GEANT4-MT for inclusion in the production-level release scheduled for end of 2013. This has involved significant re-engineering of the prototype in order to incorporate it into the main GEANT4 development line, and the porting of GEANT4-MT threading code to additional platforms. In order to make the porting of applications as simple as possible, refinements addressed the needs of standalone applications. Further adaptations were created to improve the fit with the frameworks of High Energy Physics (HEP) experiments. We report on performances measurements on Intel Xeon™, AMD Opteron™ the first trials of GEANT4-MT on the Intel Many Integrated Cores (MIC) architecture, in the form of the Xeon Phi™ co-processor.(3) These indicate near-linear scaling through about 200 threads on 60 cores, when holding fixed the number of events per thread.
Multi- and hyperspectral scene modeling
Borel, Christoph C.; Tuttle, Ronald F.
2011-06-01
This paper shows how to use a public domain raytracer POV-Ray (Persistence Of Vision Raytracer) to render multiand hyper-spectral scenes. The scripting environment allows automatic changing of the reflectance and transmittance parameters. The radiosity rendering mode allows accurate simulation of multiple-reflections between surfaces and also allows semi-transparent surfaces such as plant leaves. We show that POV-Ray computes occlusion accurately using a test scene with two blocks under a uniform sky. A complex scene representing a plant canopy is generated using a few lines of script. With appropriate rendering settings, shadows cast by leaves are rendered in many bands. Comparing single and multiple reflection renderings, the effect of multiple reflections is clearly visible and accounts for 25% of the overall apparent canopy reflectance in the near infrared.
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.
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.
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
Categorical constructions in graph theory
Richard T. Bumby
1986-01-01
Full Text Available This paper presents some graph-theoretic questions from the viewpoint of the portion of category theory which has become common knowledge. In particular, the reader is encouraged to consider whether there is only one natural category of graphs and how theories of directed graphs and undirected graphs are related.
A Semantic Graph Query Language
Kaplan, I L
2006-10-16
Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.
Local Interaction on Random Graphs
Hans Haller
2010-08-01
Full Text Available We analyze dynamic local interaction in population games where the local interaction structure (modeled as a graph can change over time: A stochastic process generates a random sequence of graphs. This contrasts with models where the initial interaction structure (represented by a deterministic graph or the realization of a random graph cannot change over time.
The Least Eigenvalue of Graphs
Guidong YU; Yizheng FAN; Yi WANG
2012-01-01
In this paper we investigate the least eigenvalue of a graph whose complement is connected,and present a lower bound for the least eigenvalue of such graph.We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.
Solsolitons associated with graphs
Lafuente, Ramiro A
2010-01-01
We show how to associate with each graph with a certain property (positivity) a family of simply connected solvable Lie groups endowed with left-invariant Riemannian metrics that are Ricci solitons (called solsolitons). We classify them up to isometry, obtaining families depending on many parameters of explicit examples of Ricci solitons. A classification of graphs with up to 3 coherent components according to positivity is also given.
Graph Embedding for Pattern Analysis
Ma, Yunqian
2013-01-01
Graph Embedding for Pattern Analysis covers theory methods, computation, and applications widely used in statistics, machine learning, image processing, and computer vision. This book presents the latest advances in graph embedding theories, such as nonlinear manifold graph, linearization method, graph based subspace analysis, L1 graph, hypergraph, undirected graph, and graph in vector spaces. Real-world applications of these theories are spanned broadly in dimensionality reduction, subspace learning, manifold learning, clustering, classification, and feature selection. A selective group of experts contribute to different chapters of this book which provides a comprehensive perspective of this field.
Crime Scenes as Augmented Reality
Sandvik, Kjetil
2010-01-01
Using the concept of augmented reality, this article will investigate how places in various ways have become augmented by means of different mediatization strategies. Augmentation of reality implies an enhancement of the places' emotional character: a certain mood, atmosphere or narrative surplus......, physical damage: they are all readable and interpretable signs. As augmented reality the crime scene carries a narrative which at first is hidden and must be revealed. Due to the process of investigation and the detective's ability to reason and deduce, the crime scene as place is reconstructed as virtual...
Crime Scenes as Augmented Reality
Sandvik, Kjetil
2010-01-01
Using the concept of augmented reality, this article will investigate how places in various ways have become augmented by means of different mediatization strategies. Augmentation of reality implies an enhancement of the places' emotional character: a certain mood, atmosphere or narrative surplus......, physical damage: they are all readable and interpretable signs. As augmented reality the crime scene carries a narrative which at first is hidden and must be revealed. Due to the process of investigation and the detective's ability to reason and deduce, the crime scene as place is reconstructed as virtual...
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 ...
Arrighi, Pablo
2016-01-01
Consider a graph having quantum systems lying at each node. Suppose that the whole thing evolves in discrete time steps, according to a global, unitary causal operator. By causal we mean that information can only propagate at a bounded speed, with respect to the distance given by the graph. Suppose, moreover, that the graph itself is subject to the evolution, and may be driven to be in a quantum superposition of graphs---in accordance to the superposition principle. We show that these unitary causal operators must decompose as a finite-depth circuit of local unitary gates. This unifies a result on Quantum Cellular Automata with another on Reversible Causal Graph Dynamics. Along the way we formalize a notion of causality which is valid in the context of quantum superpositions of time-varying graphs, and has a number of good properties. Keywords: Quantum Lattice Gas Automata, Block-representation, Curtis-Hedlund-Lyndon, No-signalling, Localizability, Quantum Gravity, Quantum Graphity, Causal Dynamical Triangula...
Commuting projections on graphs
Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). Center for Applied Scientific Computing; Zikatanov, Ludmil T. [Pennsylvania State Univ., University Park, PA (United States). Dept. of Mathematics
2013-02-19
For a given (connected) graph, we consider vector spaces of (discrete) functions defined on its vertices and its edges. These two spaces are related by a discrete gradient operator, Grad and its adjoint, ₋Div, referred to as (negative) discrete divergence. We also consider a coarse graph obtained by aggregation of vertices of the original one. Then a coarse vertex space is identified with the subspace of piecewise constant functions over the aggregates. We consider the ℓ_{2}-projection Q_{H} onto the space of these piecewise constants. In the present paper, our main result is the construction of a projection π _{H} from the original edge-space onto a properly constructed coarse edge-space associated with the edges of the coarse graph. The projections π _{H} and Q_{H} commute with the discrete divergence operator, i.e., we have div π _{H} = Q_{H} div. The respective pair of coarse edge-space and coarse vertexspace offer the potential to construct two-level, and by recursion, multilevel methods for the mixed formulation of the graph Laplacian which utilizes the discrete divergence operator. The performance of one two-level method with overlapping Schwarz smoothing and correction based on the constructed coarse spaces for solving such mixed graph Laplacian systems is illustrated on a number of graph examples.
Categorization of natural dynamic audiovisual scenes.
Olli Rummukainen
Full Text Available This work analyzed the perceptual attributes of natural dynamic audiovisual scenes. We presented thirty participants with 19 natural scenes in a similarity categorization task, followed by a semi-structured interview. The scenes were reproduced with an immersive audiovisual display. Natural scene perception has been studied mainly with unimodal settings, which have identified motion as one of the most salient attributes related to visual scenes, and sound intensity along with pitch trajectories related to auditory scenes. However, controlled laboratory experiments with natural multimodal stimuli are still scarce. Our results show that humans pay attention to similar perceptual attributes in natural scenes, and a two-dimensional perceptual map of the stimulus scenes and perceptual attributes was obtained in this work. The exploratory results show the amount of movement, perceived noisiness, and eventfulness of the scene to be the most important perceptual attributes in naturalistically reproduced real-world urban environments. We found the scene gist properties openness and expansion to remain as important factors in scenes with no salient auditory or visual events. We propose that the study of scene perception should move forward to understand better the processes behind multimodal scene processing in real-world environments. We publish our stimulus scenes as spherical video recordings and sound field recordings in a publicly available database.
Clique graphs and overlapping communities
Evans, T. S.
2010-12-01
It is shown how to construct a clique graph in which properties of cliques of a fixed order in a given graph are represented by vertices in a weighted graph. Various definitions and motivations for these weights are given. The detection of communities or clusters is used to illustrate how a clique graph may be exploited. In particular a benchmark network is shown where clique graphs find the overlapping communities accurately while vertex partition methods fail.
Higher-order graph wavelets and sparsity on circulant graphs
Kotzagiannidis, Madeleine S.; Dragotti, Pier Luigi
2015-08-01
The notion of a graph wavelet gives rise to more advanced processing of data on graphs due to its ability to operate in a localized manner, across newly arising data-dependency structures, with respect to the graph signal and underlying graph structure, thereby taking into consideration the inherent geometry of the data. In this work, we tackle the problem of creating graph wavelet filterbanks on circulant graphs for a sparse representation of certain classes of graph signals. The underlying graph can hereby be data-driven as well as fixed, for applications including image processing and social network theory, whereby clusters can be modelled as circulant graphs, respectively. We present a set of novel graph wavelet filter-bank constructions, which annihilate higher-order polynomial graph signals (up to a border effect) defined on the vertices of undirected, circulant graphs, and are localised in the vertex domain. We give preliminary results on their performance for non-linear graph signal approximation and denoising. Furthermore, we provide extensions to our previously developed segmentation-inspired graph wavelet framework for non-linear image approximation, by incorporating notions of smoothness and vanishing moments, which further improve performance compared to traditional methods.
Creating Three-Dimensional Scenes
Krumpe, Norm
2005-01-01
Persistence of Vision Raytracer (POV-Ray), a free computer program for creating photo-realistic, three-dimensional scenes and a link for Mathematica users interested in generating POV-Ray files from within Mathematica, is discussed. POV-Ray has great potential in secondary mathematics classrooms and helps in strengthening students' visualization…
Regularity in Vague Intersection Graphs and Vague Line Graphs
Muhammad Akram
2014-01-01
Full Text Available Fuzzy graph theory is commonly used in computer science applications, particularly in database theory, data mining, neural networks, expert systems, cluster analysis, control theory, and image capturing. A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility, and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, we introduce the notion of vague line graphs, and certain types of vague line graphs and present some of their properties. We also discuss an example application of vague digraphs.
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.
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...
Vassilis Giakoumakis
1997-12-01
Full Text Available We study the P 4-tidy graphs, a new class defined by Rusu [30] in order to illustrate the notion of P 4-domination in perfect graphs. This class strictly contains the P 4-extendible graphs and the P 4-lite graphs defined by Jamison & Olariu in [19] and [23] and we show that the P 4-tidy graphs and P 4-lite graphs are closely related. Note that the class of P 4-lite graphs is a class of brittle graphs strictly containing the P 4-sparse graphs defined by Hoang in [14]. McConnel & Spinrad [2] and independently Cournier & Habib [5] have shown that the modular decomposition tree of any graph is computable in linear time. For recognizing in linear time P 4-tidy graphs, we apply a method introduced by Giakoumakis in [9] and Giakoumakis & Fouquet in [6] using modular decomposition of graphs and we propose linear algorithms for optimization problems on such graphs, as clique number, stability number, chromatic number and scattering number. We show that the Hamiltonian Path Problem is linear for this class of graphs. Our study unifies and generalizes previous results of Jamison & Olariu ([18], [21], [22], Hochstattler & Schindler[16], Jung [25] and Hochstattler & Tinhofer [15].
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
Optimized Graph Search Using Multi-Level Graph Clustering
Kala, Rahul; Shukla, Anupam; Tiwari, Ritu
Graphs find a variety of use in numerous domains especially because of their capability to model common problems. The social networking graphs that are used for social networking analysis, a feature given by various social networking sites are an example of this. Graphs can also be visualized in the search engines to carry search operations and provide results. Various searching algorithms have been developed for searching in graphs. In this paper we propose that the entire network graph be clustered. The larger graphs are clustered to make smaller graphs. These smaller graphs can again be clustered to further reduce the size of graph. The search is performed on the smallest graph to identify the general path, which may be further build up to actual nodes by working on the individual clusters involved. Since many searches are carried out on the same graph, clustering may be done once and the data may be used for multiple searches over the time. If the graph changes considerably, only then we may re-cluster the graph.
Subdominant pseudoultrametric on graphs
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.
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''''.
Bordenave, Charles; Salez, Justin
2011-01-01
We prove that the local weak convergence of a sequence of graphs is enough to guarantee the convergence of their normalized matching numbers. The limiting quantity is described by a local recursion defined on the weak limit of the graph sequence. However, this recursion may admit several solutions, implying non-trivial long-range dependencies between the edges of a largest matching. We overcome this lack of correlation decay by introducing a perturbative parameter called the temperature, which we let progressively go to zero. When the local weak limit is a unimodular Galton-Watson tree, the recursion simplifies into a distributional equation, resulting into an explicit formula that considerably extends the well-known one by Karp and Sipser for Erd\\"os-R\\'enyi random graphs.
Iacovacci, Jacopo
2015-01-01
Visibility algorithms transform time series into graphs and encode dynamical information in their topology, paving the way for graph-theoretical time series analysis as well as building a bridge between nonlinear dynamics and network science. In this work we introduce and study the concept of visibility graph motifs, smaller substructures that appear with characteristic frequencies. We develop a theory to compute in an exact way the motif profiles associated to general classes of deterministic and stochastic dynamics. We find that this simple property is indeed a highly informative and computationally efficient feature capable to distinguish among different dynamics and robust against noise contamination. We finally confirm that it can be used in practice to perform unsupervised learning, by extracting motif profiles from experimental heart-rate series and being able, accordingly, to disentangle meditative from other relaxation states. Applications of this general theory include the automatic classification a...
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...
Hyperbolicity in Median Graphs
José M Sigarreta
2013-11-01
If is a geodesic metric space and $x_1,x_2,x_3\\in X$, a geodesic triangle $T=\\{x_1,x_2,x_3\\}$ is the union of the three geodesics $[x_1 x_2],[x_2 x_3]$ and $[x_3 x_1]$ in . The space is -hyperbolic (in the Gromov sense) if any side of is contained in a -neighborhood of the union of the two other sides, for every geodesic triangle in . If is hyperbolic, we denote by () the sharp hyperbolicity constant of , i.e.,$(X)=\\inf\\{≥ 0: X \\quad\\text{is}\\quad -\\text{hyperbolic}\\}$. In this paper we study the hyperbolicity of median graphs and we also obtain some results about general hyperbolic graphs. In particular, we prove that a median graph is hyperbolic if and only if its bigons are thin.
Erickson, Lindsay
2010-01-01
The game of Nim as played on graphs was introduced in Nim on Graphs I and extended in Nim on Graphs II by Masahiko Fukuyama. His papers detail the calculation of Grundy numbers for graphs under specific circumstances. We extend these results and introduce the strategy for even cycles. This paper examines a more general class of graphs by restricting the edge weight to one. We provide structural conditions for which there exist a winning strategy. This yields the solution for the complete graph.
Graph theory and interconnection networks
Hsu, Lih-Hsing
2008-01-01
The advancement of large scale integrated circuit technology has enabled the construction of complex interconnection networks. Graph theory provides a fundamental tool for designing and analyzing such networks. Graph Theory and Interconnection Networks provides a thorough understanding of these interrelated topics. After a brief introduction to graph terminology, the book presents well-known interconnection networks as examples of graphs, followed by in-depth coverage of Hamiltonian graphs. Different types of problems illustrate the wide range of available methods for solving such problems. The text also explores recent progress on the diagnosability of graphs under various models.
Randerath, Bert; Vestergaard, Preben D.
2010-01-01
A graph G is P3-equipackable if any sequence of successive removals of edge-disjoint copies of P3 from G always terminates with a graph having at most one edge. All P3-equipackable graphs are characterised. They belong to a small number of families listed here.......A graph G is P3-equipackable if any sequence of successive removals of edge-disjoint copies of P3 from G always terminates with a graph having at most one edge. All P3-equipackable graphs are characterised. They belong to a small number of families listed here....
Feynman motives of banana graphs
Aluffi, Paolo
2008-01-01
We consider the infinite family of Feynman graphs known as the ``banana graphs'' and compute explicitly the classes of the corresponding graph hypersurfaces in the Grothendieck ring of varieties as well as their Chern--Schwartz--MacPherson classes, using the classical Cremona transformation and the dual graph, and a blowup formula for characteristic classes. We outline the interesting similarities between these operations and we give formulae for cones obtained by simple operations on graphs. We formulate a positivity conjecture for characteristic classes of graph hypersurfaces and discuss briefly the effect of passing to noncommutative spacetime.
Locally identifying coloring of graphs
Esperet, Louis; Montassier, Mickael; Ochem, Pascal; Parreau, Aline
2010-01-01
A vertex-coloring of a graph G is said to be locally identifying if for any pair (u,v) of adjacent vertices of G, with distinct closed neighborhood, the set of colors that appears in the closed neighborhoods of u and v are distinct. In this paper, we give several bounds on the minimum number of colors needed in such a coloring for different families of graphs (planar graphs, some subclasses of perfect graphs, graphs with bounded maximum degree) and prove that deciding whether a subcubic bipartite graph with large girth has a locally identifying coloring with 3 colors is an NP-complete problem.
Jagged Tiling for Intra-tile Parallelism and Fine-Grain Multithreading
Shrestha, Sunil; Manzano Franco, Joseph B.; Marquez, Andres; Feo, John T.; Gao, Guang R.
2015-05-01
In this paper, we have developed a novel methodology that takes into consideration multithreaded many-core designs to better utilize memory/processing resources and improve memory residence on tileable applications. It takes advantage of polyhedral analysis and transformation in the form of PLUTO, combined with a highly optimized finegrain tile runtime to exploit parallelism at all levels. The main contributions of this paper include the introduction of multi-hierarchical tiling techniques that increases intra tile parallelism; and a data-flow inspired runtime library that allows the expression of parallel tiles with an efficient synchronization registry. Our current implementation shows performance improvements on an Intel Xeon Phi board up to 32.25% against instances produced by state-of-the-art compiler frameworks for selected stencil applications.
Low-latency multi-threaded processing of neuronal signals for brain-computer interfaces
Jörg eFischer
2014-01-01
Full Text Available Brain-computer interfaces (BCIs require demanding numerical computations to transfer brain signals into control signals driving an external actuator. Increasing the computational performance of the BCI algorithms carrying out these calculations enables faster reaction to user inputs and allows using more demanding decoding algorithms. Here we introduce a modular and extensible software architecture with a multi-threaded signal processing pipeline suitable for BCI applications. The computational load and latency (the time that the system needs to react to user input are measured for different pipeline implementations in typical BCI applications with realistic parameter settings. We show that BCIs can benefit substantially from the proposed parallelization: firstly, by reducing the latency and secondly, by increasing the amount of recording channels and signal features that can be used for decoding beyond the amount which can be handled by a single thread. The proposed software architecture provides a simple, yet flexible solution for BCI applications.
An HLA/RTI Architecture Based on Multi-thread Processing
GUAN Li; ZOU Ru-ping; ZHU Bin; HAO Chong-yang
2010-01-01
In order to improve the real-time performance of the real-time HLA (high level architecture) in the application of massive data communication volume, multi-thread processing was adopted, thread pool structure was introduced into the system, different threads to handle corresponding message queues was utilized to respond different message requests. Fur-thermore, an allocation strategy of semi-complete deprivation of priority was adopted, which reduces thread switching cost and processing burden in the system, provided that the message requests with high priority can be responded in time, thus improves the system's overall performance. The design and experiment results indicate that the method proposed in this pa-per can improve the real-time performance of HLA in distributed system applications greatly.
Servicing a globally broadcast interrupt signal in a multi-threaded computer
Attinella, John E.; Davis, Kristan D.; Musselman, Roy G.; Satterfield, David L.
2015-12-29
Methods, apparatuses, and computer program products for servicing a globally broadcast interrupt signal in a multi-threaded computer comprising a plurality of processor threads. Embodiments include an interrupt controller indicating in a plurality of local interrupt status locations that a globally broadcast interrupt signal has been received by the interrupt controller. Embodiments also include a thread determining that a local interrupt status location corresponding to the thread indicates that the globally broadcast interrupt signal has been received by the interrupt controller. Embodiments also include the thread processing one or more entries in a global interrupt status bit queue based on whether global interrupt status bits associated with the globally broadcast interrupt signal are locked. Each entry in the global interrupt status bit queue corresponds to a queued global interrupt.
Graph-based knowledge representation computational foundations of conceptual graphs
Chein, Michel; Chein, Michel
2008-01-01
In addressing the question of how far it is possible to go in knowledge representation and reasoning through graphs, the authors cover basic conceptual graphs, computational aspects, and kernel extensions. The basic mathematical notions are summarized.
Algorithms for Planar Graphs and Graphs in Metric Spaces
Wulff-Nilsen, Christian
Algorithms for network problems play an increasingly important role in modern society. The graph structure of a network is an abstract and very useful representation that allows classical graph algorithms, such as Dijkstra and Bellman-Ford, to be applied. Real-life networks often have additional...... preprocessing time, an O(n log n) time algorithm for the replacement paths problem, and a min st-cut oracle with nearlinear preprocessing time. We also give improved time bounds for computing various graph invariants such as diameter and girth. In the second part, we consider stretch factor problems...... 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...
SOME RESULTS ON CIRCULAR PERFECT GRAPHS AND PERFECT GRAPHS
XU Baogang
2005-01-01
An r-circular coloring of a graph G is a map f from V(G) to the set of open unit intervals of an Euclidean circle of length r,such that f(u) ∩ f(v) = φ whenever uv ∈ E(G).Circular perfect graphs are defined analogously to perfect graphs by means of two parameters,the circular chromatic number and the circular clique number.In this paper,we study the properties of circular perfect graphs.We give (1) a necessary condition for a graph to be circular perfect,(2) some circular critical imperfect graphs,and (3) a characterization of graphs with the property that each of their induced subgraphs has circular clique number the same as its clique number,and then the two conjectures that are equivalent to the perfect graph conjecture.
Contention Modeling for Multithreaded Distributed Shared Memory Machines: The Cray XMT
Secchi, Simone; Tumeo, Antonino; Villa, Oreste
2011-07-27
Distributed Shared Memory (DSM) machines are a wide class of multi-processor computing systems where a large virtually-shared address space is mapped on a network of physically distributed memories. High memory latency and network contention are two of the main factors that limit performance scaling of such architectures. Modern high-performance computing DSM systems have evolved toward exploitation of massive hardware multi-threading and fine-grained memory hashing to tolerate irregular latencies, avoid network hot-spots and enable high scaling. In order to model the performance of such large-scale machines, parallel simulation has been proved to be a promising approach to achieve good accuracy in reasonable times. One of the most critical factors in solving the simulation speed-accuracy trade-off is network modeling. The Cray XMT is a massively multi-threaded supercomputing architecture that belongs to the DSM class, since it implements a globally-shared address space abstraction on top of a physically distributed memory substrate. In this paper, we discuss the development of a contention-aware network model intended to be integrated in a full-system XMT simulator. We start by measuring the effects of network contention in a 128-processor XMT machine and then investigate the trade-off that exists between simulation accuracy and speed, by comparing three network models which operate at different levels of accuracy. The comparison and model validation is performed by executing a string-matching algorithm on the full-system simulator and on the XMT, using three datasets that generate noticeably different contention patterns.
Yu-xiang LI; Yin-liang ZHAO‡; Bin LIU; Shuo JI
2015-01-01
Thread partition plays an important role in speculative multithreading (SpMT) for automatic parallelization of ir-regular programs. Using unified values of partition parameters to partition different applications leads to the fact that every ap-plication cannot own its optimal partition scheme. In this paper, five parameters affecting thread partition are extracted from heuristic rules. They are the dependence threshold (DT), lower limit of thread size (TSL), upper limit of thread size (TSU), lower limit of spawning distance (SDL), and upper limit of spawning distance (SDU). Their ranges are determined in accordance with heuristic rules, and their step-sizes are set empirically. Under the condition of setting speedup as an objective function, all com-binations of five threshold values form the solution space, and our aim is to search for the best combination to obtain the best thread granularity, thread dependence, and spawning distance, so that every application has its best partition scheme. The issue can be attributed to a single objective optimization problem. We use the artificial immune algorithm (AIA) to search for the optimal solution. On Prophet, which is a generic SpMT processor to evaluate the performance of multithreaded programs, Olden bench-marks are used to implement the process. Experiments show that we can obtain the optimal parameter values for every benchmark, and Olden benchmarks partitioned with the optimized parameter values deliver a performance improvement of 3.00%on a 4-core platform compared with a machine learning based approach, and 8.92%compared with a heuristics-based approach.
Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models
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.
ZHANG Guoqiang; CHEN Yixiang
2001-01-01
This paper provides a concrete and simple introduction to two pillars of domain theory: (1) solving recursive domain equations, and (2) universal and saturated domains. Our exposition combines Larsen and Winskel's idea on solving domain equations using information systems with Girard's idea of stable domain theory in the form of coherence spaces, or graphs.Detailed constructions are given for universal and even homogeneous objects in two categories of graphs: one representing binary complete, prime algebraic domains with complete primes covering the bottom; the other representing ω-algebraic, prime algebraic lattices. The backand-forth argument in model theory helps to enlighten the constructions.
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
Haynes Teresa W.; Hedetniemi Stephen T.; Jamieson Jessie D.; Jamieson William B.
2014-01-01
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 grap...
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
Distributed Evolutionary Graph Partitioning
Sanders, Peter
2011-01-01
We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use of our multilevel graph partitioner KaFFPa provides new effective crossover and mutation operators. By combining these with a scalable communication protocol we obtain a system that is able to improve the best known partitioning results for many inputs in a very short amount of time. For example, in Walshaw's well known benchmark tables we are able to improve or recompute 76% of entries for the tables with 1%, 3% and 5% imbalance.
Stages As Models of Scene Geometry
Nedović, V.; Smeulders, A.W.M.; Redert, A.; Geusebroek, J.M.
2010-01-01
Reconstruction of 3D scene geometry is an important element for scene understanding, autonomous vehicle and robot navigation, image retrieval, and 3D television. We propose accounting for the inherent structure of the visual world when trying to solve the scene reconstruction problem. Consequently,
The anatomy of the crime scene
Sandvik, Kjetil
2010-01-01
Crime scenes are constituted by a combination of a plot and a place. The crime scene is a place which has been in a certain state of transformation at a certain moment in time, the moment at which the place constituted the scene for some kind of criminal activity. As such the place has been encod...
Stages As Models of Scene Geometry
Nedović, V.; Smeulders, A.W.M.; Redert, A.; Geusebroek, J.M.
2010-01-01
Reconstruction of 3D scene geometry is an important element for scene understanding, autonomous vehicle and robot navigation, image retrieval, and 3D television. We propose accounting for the inherent structure of the visual world when trying to solve the scene reconstruction problem. Consequently,
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
Compressive Acquisition of Dynamic Scenes
Sankaranarayanan, Aswin C; Chellappa, Rama; Baraniuk, Richard G
2012-01-01
Compressive sensing (CS) is a new approach for the acquisition and recovery of sparse signals and images that enables sampling rates significantly below the classical Nyquist rate. Despite significant progress in the theory and methods of CS, little headway has been made in compressive video acquisition and recovery. Video CS is complicated by the ephemeral nature of dynamic events, which makes direct extensions of standard CS imaging architectures and signal models difficult. In this paper, we develop a new framework for video CS for dynamic textured scenes that models the evolution of the scene as a linear dynamical system (LDS). This reduces the video recovery problem to first estimating the model parameters of the LDS from compressive measurements, and then reconstructing the image frames. We exploit the low-dimensional dynamic parameters (the state sequence) and high-dimensional static parameters (the observation matrix) of the LDS to devise a novel compressive measurement strategy that measures only the...
GraphXML: an XML based graph interchange format
I. Herman (Ivan); M.S. Marshall (Scott)
2000-01-01
textabstractGraphXML is a graph description language in XML that can be used as an interchange format for graph drawing and visualization packages. The generality and rich features of XML make it possible to define an interchange format that not only supports the pure, mathematical description of a
Facilitatory priming of scene layout depends on experience with the scene.
Sanocki, Thomas
2013-04-01
Facilitatory scene priming is the positive effect of a scene prime on the immediately subsequent spatial processing of a related target, relative to control primes. In the present experiments, a large set of scenes were presented, each several times. The accuracy of a relational spatial-layout judgment was the main measure (which of two probes in a scene was closer?). The effect of scene primes on sensitivity was near zero for the first presentation of a scene; advantages for scene primes occurred only after two or three presentations. In addition, a bias effect emerged in reaction times for novel scenes. These results imply that facilitatory scene priming requires learning and is top-down in nature. Scene priming may require the consolidation of interscene relations in a memory representation.
Wenjun Xiao
2002-01-01
Wu, Lakshmivarahan and Dhall[5] recently described a deterministic, distributed routing scheme for some special classes of metacyclic graphs. However they have no proof of correctness that the scheme is a shortest path routing algorithm. In the note we give a suboptimal, deterministic routing algorithm.
Nemirovsky, Ricardo; Tierney, Cornelia; Wright, Tracy
1998-01-01
Analyzed two children's use of a computer-based motion detector to make sense of symbolic expressions (Cartesian graphs). Found three themes: (1) tool perspectives, efforts to understand graphical responses to body motion; (2) fusion, emergent ways of talking and behaving that merge symbols and referents; and (3) graphical spaces, when changing…
Pitts Bannister, Vanessa R.; Jamar, Idorenyin; Mutegi, Jomo W.
2007-01-01
In this article, the learning progress of one fifth-grade student is examined with regard to the development of her graph interpretation skills as she participated in the Junior Science Institute (JSI), a two-week, science intensive summer camp in which participants engaged in microbiology research and application. By showcasing the student's…
S.M. Heditniemi (Sandra); R.C. Laskar (R.C.); H.M. Mulder (Martyn)
2012-01-01
textabstractLet $G = (V,E)$ be a graph. A partition $\\pi = \\{V_1, V_2, \\ldots, V_k \\}$ of the vertices $V$ of $G$ into $k$ {\\it color classes} $V_i$, with $1 \\leq i \\leq k$, is called a {\\it quorum coloring} if for every vertex $v \\in V$, at least half of the vertices in the closed neighborhood
Coloring geographical threshold graphs
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.
2015-01-01
Scene classification is a fundamental perception task for environmental understanding in today's robotics. In this paper, we have attempted to exploit the use of popular machine learning technique of deep learning to enhance scene understanding, particularly in robotics applications. As scene images have larger diversity than the iconic object images, it is more challenging for deep learning methods to automatically learn features from scene images with less samples. Inspired by human scene u...
Neural networks and graph theory
许进; 保铮
2002-01-01
The relationships between artificial neural networks and graph theory are considered in detail. The applications of artificial neural networks to many difficult problems of graph theory, especially NP-complete problems, and the applications of graph theory to artificial neural networks are discussed. For example graph theory is used to study the pattern classification problem on the discrete type feedforward neural networks, and the stability analysis of feedback artificial neural networks etc.
Temporal Representation in Semantic Graphs
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.
李浩; 刘群
1989-01-01
Because of the widespread applications of tree and treee graph in computer science,we are interested in studying the reee graph.M.Farber,B.Richter and H.Shang in [1] showed that the graph τ2(G)is 2-edge-connected as |V(G)）≥3，at the same time,we will show the best lower bounds about vertex number and minimum degree of graph τ2(G）.
Crime scene investigation, reporting, and reconstuction (CSIRR)
Booth, John F.; Young, Jeffrey M.; Corrigan, Paul
1997-02-01
Graphic Data Systems Corporation (GDS Corp.) and Intellignet Graphics Solutions, Inc. (IGS) combined talents in 1995 to design and develop a MicroGDSTM application to support field investiations of crime scenes, such as homoicides, bombings, and arsons. IGS and GDS Corp. prepared design documents under the guidance of federal, state, and local crime scene reconstruction experts and with information from the FBI's evidence response team field book. The application was then developed to encompass the key components of crime scene investigaton: staff assigned to the incident, tasks occuring at the scene, visits to the scene location, photogrpahs taken of the crime scene, related documents, involved persons, catalogued evidence, and two- or three- dimensional crime scene reconstruction. Crime scene investigation, reporting, and reconstruction (CSIRR$CPY) provides investigators with a single applicaiton for both capturing all tabular data about the crime scene and quickly renderng a sketch of the scene. Tabular data is captured through ituitive database forms, while MicroGDSTM has been modified to readily allow non-CAD users to sketch the scene.
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.
Asteroidal Quadruples in non Rooted Path Graphs
Gutierrez Marisa
2015-11-01
Full Text Available A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to find such characterizations for rooted path graphs. For this purpose, we are studying in this paper directed path graphs that are non rooted path graphs. We prove that such graphs always contain an asteroidal quadruple.
Skurnick, Ronald; Davi, Charles; Skurnick, Mia
2005-01-01
Since 1952, several well-known graph theorists have proven numerous results regarding Hamiltonian graphs. In fact, many elementary graph theory textbooks contain the theorems of Ore, Bondy and Chvatal, Chvatal and Erdos, Posa, and Dirac, to name a few. In this note, the authors state and prove some propositions of their own concerning Hamiltonian…
Mining and Indexing Graph Databases
Yuan, Dayu
2013-01-01
Graphs are widely used to model structures and relationships of objects in various scientific and commercial fields. Chemical molecules, proteins, malware system-call dependencies and three-dimensional mechanical parts are all modeled as graphs. In this dissertation, we propose to mine and index those graph data to enable fast and scalable search.…
Text analysis for knowledge graphs
Popping, Roel
2007-01-01
The concept of knowledge graphs is introduced as a method to represent the state of the art in a specific scientific discipline. Next the text analysis part in the construction of such graphs is considered. Here the 'translation' from text to graph takes place. The method that is used here is compar
Hopkins, Brian
2004-01-01
The interconnected world of actors and movies is a familiar, rich example for graph theory. This paper gives the history of the "Kevin Bacon Game" and makes extensive use of a Web site to analyze the underlying graph. The main content is the classroom development of the weighted average to determine the best choice of "center" for the graph. The…
Mining and Indexing Graph Databases
Yuan, Dayu
2013-01-01
Graphs are widely used to model structures and relationships of objects in various scientific and commercial fields. Chemical molecules, proteins, malware system-call dependencies and three-dimensional mechanical parts are all modeled as graphs. In this dissertation, we propose to mine and index those graph data to enable fast and scalable search.…
Submanifolds Weakly Associated with Graphs
A Carriazo; L M Fernández; A Rodríguez-Hidalgo
2009-06-01
We establish an interesting link between differential geometry and graph theory by defining submanifolds weakly associated with graphs. We prove that, in a local sense, every submanifold satisfies such an association, and other general results. Finally, we study submanifolds associated with graphs either in low dimensions or belonging to some special families.
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
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....
Managing and Mining Graph Data
Aggarwal, Charu C
2010-01-01
Managing and Mining Graph Data is a comprehensive survey book in graph management and mining. It contains extensive surveys on a variety of important graph topics such as graph languages, indexing, clustering, data generation, pattern mining, classification, keyword search, pattern matching, and privacy. It also studies a number of domain-specific scenarios such as stream mining, web graphs, social networks, chemical and biological data. The chapters are written by well known researchers in the field, and provide a broad perspective of the area. This is the first comprehensive survey book in t
Spectral fluctuations of quantum graphs
Pluhař, Z. [Faculty of Mathematics and Physics, Charles University, 180 00 Praha 8 (Czech Republic); Weidenmüller, H. A. [Max-Planck-Institut für Kernphysik, 69029 Heidelberg (Germany)
2014-10-15
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.
Boxicity of Circular Arc Graphs
Bhowmick, Diptendu; Chandran, L. Sunil
2008-01-01
A $k$-dimensional box is the cartesian product $R_1 \\times R_2 \\times ... \\times R_k$ where each $R_i$ is a closed interval on the real line. The {\\it boxicity} of a graph $G$, denoted as $box(G)$, is the minimum integer $k$ such that $G$ can be represented as the intersection graph of a collection of $k$-dimensional boxes: that is two vertices are adjacent if and only if their corresponding boxes intersect. A circular arc graph is a graph that can be represented as the intersection graph of ...
Resolvability in Circulant Graphs
Muhammad SALMAN; Imran JAVAID; Muhammad Anwar CHAUDHRY
2012-01-01
A set W of the vertices of a connected graph G is called a resolving set for G if for every two distinct vertices u,v ∈ V(G) there is a vertex w ∈ W such that d(u,w) ≠ d(v,w).A resolving set of minimum cardinality is called a metric basis for G and the number of vertices in a metric basis is called the metric dimension of G,denoted by dim(G).For a vertex u of G and a subset S of V(G),the distance between u and S is the number mins∈s d(u,s).A k-partition H ={S1,S2,...,Sk} of V(G) is called a resolving partition if for every two distinct vertices u,v ∈ V(G) there is a set Si in Π such that d(u,Si) ≠ d(v,Si).The minimum k for which there is a resolving k-partition of V(G) is called the partition dimension of G,denoted by pd(G).The circulant graph is a graph with vertex set Zn,an additive group ofintegers modulo n,and two vertices labeled i and j adjacent if and only if i - j (mod n) ∈ C,where C C Zn has the property that C =-C and 0(∈) C.The circulant graph is denoted by Xn,△ where A =|C|.In this paper,we study the metric dimension of a family of circulant graphs Xn,3 with connection set C ={1,-n/2,n - 1} and prove that dim(Xn,3) is independent of choice of n by showing that 3 for all n =0 (mod 4),dim(X,n,3) ={ 4 for all n =2 (mod 4).We also study the partition dimension of a family of circulant graphs Xn,4 with connection set C ={±1,±2} and prove that pd(Xn,4) is independent of choice of n and show that pd(X5,4) =5 and 3 forall odd n≥9,pd(Xn,4) ={ 4 for all even n ≥ 6 and n =7.
Conditional coloring of some parameterized graphs
Reddy, P Venkata Subba
2010-01-01
For integers k>0 and r>0, a conditional (k,r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex v of degree d(v) in G is adjacent to vertices with at least min{r,d(v)} different colors. The smallest integer k for which a graph G has a conditional (k,r)-coloring is called the rth order conditional chromatic number, denoted by $\\chi_r(G)$. For different values of r we obtain $\\chi_r(G)$ of certain parameterized graphs viz., Windmill graph, line graph of Windmill graph, middle graph of Friendship graph, middle graph of a cycle, line graph of Friendship graph, middle graph of complete k-partite graph and middle graph of a bipartite graph.
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...
Hierarchy of Modular Graph Identities
D'Hoker, Eric
2016-01-01
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analy...
Valiant Transform of Forney Graphs
Al-Bashabsheh, Ali
2010-01-01
The introduction of Forney graphs, or normal graphs, and the duality result therein [1] is a landmark in the theory of codes on graphs and in graph-based iterative decoding. A generic modeling framework for codes and systems, Forney graphs have since found various applications. It is unfortunate however that the development of the theory and application of Forney graphs to date has been restricted to the context of linear (and group) codes and systems, and the primary tool of Forney graphs is the duality result introduced in [1]. In a rather distant area of computer science, Valiant has recently presented a powerful family of new algorithms, which he calls holographic algorithms [2]. Using holographic algorithms, Valiant provides polynomial-time solutions to families of problems previously unknown to be tractable. At the heart of Valiant's holographic algorithms is the notion of "holographic reduction", which is the engine used in holographic algorithms to reduce from one problem to another. Recognizing the c...
Bond percolation on isoradial graphs
Grimmett, Geoffrey
2012-01-01
In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square, triangular, and other lattices. This is achieved via the star-triangle transformation, by transporting the box-crossing property across the family of isoradial graphs. As a consequence, we obtain the universality of these models at the critical point, in the sense that the one-arm and 2j-alternating-arm critical exponents (and therefore also the connectivity and volume exponents) are constant across the family of such percolation processes. The isoradial graphs in question are those that satisfy certain weak conditions on their embedding and on their track system. This class of graphs includes, for example, isoradial embeddings of periodic graphs, and graphs derived from rhombic Penrose tilings.
Imaging spectroscopy for scene analysis
Robles-Kelly, Antonio
2012-01-01
This book presents a detailed analysis of spectral imaging, describing how it can be used for the purposes of material identification, object recognition and scene understanding. The opportunities and challenges of combining spatial and spectral information are explored in depth, as are a wide range of applications. Features: discusses spectral image acquisition by hyperspectral cameras, and the process of spectral image formation; examines models of surface reflectance, the recovery of photometric invariants, and the estimation of the illuminant power spectrum from spectral imagery; describes
Liu, Xing; Hou, Kun Mean; de Vaulx, Christophe; Xu, Jun; Yang, Jianfeng; Zhou, Haiying; Shi, Hongling; Zhou, Peng
2015-01-01
Memory and energy optimization strategies are essential for the resource-constrained wireless sensor network (WSN) nodes. In this article, a new memory-optimized and energy-optimized multithreaded WSN operating system (OS) LiveOS is designed and implemented. Memory cost of LiveOS is optimized by using the stack-shifting hybrid scheduling approach. Different from the traditional multithreaded OS in which thread stacks are allocated statically by the pre-reservation, thread stacks in LiveOS are allocated dynamically by using the stack-shifting technique. As a result, memory waste problems caused by the static pre-reservation can be avoided. In addition to the stack-shifting dynamic allocation approach, the hybrid scheduling mechanism which can decrease both the thread scheduling overhead and the thread stack number is also implemented in LiveOS. With these mechanisms, the stack memory cost of LiveOS can be reduced more than 50% if compared to that of a traditional multithreaded OS. Not is memory cost optimized, but also the energy cost is optimized in LiveOS, and this is achieved by using the multi-core “context aware” and multi-core “power-off/wakeup” energy conservation approaches. By using these approaches, energy cost of LiveOS can be reduced more than 30% when compared to the single-core WSN system. Memory and energy optimization strategies in LiveOS not only prolong the lifetime of WSN nodes, but also make the multithreaded OS feasible to run on the memory-constrained WSN nodes. PMID:25545264
Xing Liu
2014-12-01
Full Text Available Memory and energy optimization strategies are essential for the resource-constrained wireless sensor network (WSN nodes. In this article, a new memory-optimized and energy-optimized multithreaded WSN operating system (OS LiveOS is designed and implemented. Memory cost of LiveOS is optimized by using the stack-shifting hybrid scheduling approach. Different from the traditional multithreaded OS in which thread stacks are allocated statically by the pre-reservation, thread stacks in LiveOS are allocated dynamically by using the stack-shifting technique. As a result, memory waste problems caused by the static pre-reservation can be avoided. In addition to the stack-shifting dynamic allocation approach, the hybrid scheduling mechanism which can decrease both the thread scheduling overhead and the thread stack number is also implemented in LiveOS. With these mechanisms, the stack memory cost of LiveOS can be reduced more than 50% if compared to that of a traditional multithreaded OS. Not is memory cost optimized, but also the energy cost is optimized in LiveOS, and this is achieved by using the multi-core “context aware” and multi-core “power-off/wakeup” energy conservation approaches. By using these approaches, energy cost of LiveOS can be reduced more than 30% when compared to the single-core WSN system. Memory and energy optimization strategies in LiveOS not only prolong the lifetime of WSN nodes, but also make the multithreaded OS feasible to run on the memory-constrained WSN nodes.
Liu, Xing; Hou, Kun Mean; de Vaulx, Christophe; Xu, Jun; Yang, Jianfeng; Zhou, Haiying; Shi, Hongling; Zhou, Peng
2014-12-23
Memory and energy optimization strategies are essential for the resource-constrained wireless sensor network (WSN) nodes. In this article, a new memory-optimized and energy-optimized multithreaded WSN operating system (OS) LiveOS is designed and implemented. Memory cost of LiveOS is optimized by using the stack-shifting hybrid scheduling approach. Different from the traditional multithreaded OS in which thread stacks are allocated statically by the pre-reservation, thread stacks in LiveOS are allocated dynamically by using the stack-shifting technique. As a result, memory waste problems caused by the static pre-reservation can be avoided. In addition to the stack-shifting dynamic allocation approach, the hybrid scheduling mechanism which can decrease both the thread scheduling overhead and the thread stack number is also implemented in LiveOS. With these mechanisms, the stack memory cost of LiveOS can be reduced more than 50% if compared to that of a traditional multithreaded OS. Not is memory cost optimized, but also the energy cost is optimized in LiveOS, and this is achieved by using the multi-core "context aware" and multi-core "power-off/wakeup" energy conservation approaches. By using these approaches, energy cost of LiveOS can be reduced more than 30% when compared to the single-core WSN system. Memory and energy optimization strategies in LiveOS not only prolong the lifetime of WSN nodes, but also make the multithreaded OS feasible to run on the memory-constrained WSN nodes.
Jordan, Jonathan
2011-01-01
We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random element, and there are three parameters, $\\alpha$, $\\beta$ and $\\gamma$, which are the probabilities of edges appearing between different types of vertices. We show that as the probabilities associated with the model vary there are a number of phase transitions, in particular concerning the degree sequence. If $(1+\\alpha)(1+\\gamma)1$ then the degree of a typical vertex grows to infinity, and the proportion of vertices having any fixed degree $d$ tends to zero. We also give some results on the number of edges and on the spectral gap.
Normal Order: Combinatorial Graphs
Solomon, A I; Blasiak, P; Horzela, A; Penson, K A; Solomon, Allan I.; Duchamp, Gerard; Blasiak, Pawel; Horzela, Andrzej; Penson, Karol A.
2004-01-01
A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string of such operators. In the general case, upon which we touch briefly, this problem leads to combinatorial numbers, the so-called Rook numbers. Since we assume that the two species, bosons and fermions, commute, we subsequently restrict ourselves to consideration of a single species, single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, specifically Bell and Stirling numbers. We explicitly give the generating functions for some classes of these numbers. In this note we concentrate on the combinatorial graph approach, showing how some important classical results of graph theory lead to transparent representations of the combinatorial numbers associated with the boson normal ordering problem.
Exponential random graph models
Fronczak, Agata
2012-01-01
Nowadays, exponential random graphs (ERGs) are among the most widely-studied network models. Different analytical and numerical techniques for ERG have been developed that resulted in the well-established theory with true predictive power. An excellent basic discussion of exponential random graphs addressed to social science students and researchers is given in [Anderson et al., 1999][Robins et al., 2007]. This essay is intentionally designed to be more theoretical in comparison with the well-known primers just mentioned. Given the interdisciplinary character of the new emerging science of complex networks, the essay aims to give a contribution upon which network scientists and practitioners, who represent different research areas, could build a common area of understanding.
2010-12-02
evaluating the function ΘP (A) for any fixed A,P is equivalent to solving the so-called Quadratic Assignment Problem ( QAP ), and thus we can employ various...tractable linear programming, spectral, and SDP relaxations of QAP [40, 11, 33]. In particular we discuss recent work [14] on exploiting group...symmetry in SDP relaxations of QAP , which is useful for approximately computing elementary convex graph invariants in many interesting cases. Finally in
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…
Zhou, Feng; de la Torre, Fernando
2015-11-19
Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the use of a path-following optimization algorithm, that leads to improved optimization strategies and matching performance; (3) Given the factorization, it becomes straight-forward to incorporate geometric transformations (rigid and non-rigid) to the GM problem. (4) Using a matrix formulation for the GM problem and the factorization, it is easy to reveal commonalities and differences between different GM methods. The factorization also provides a clean connection with other matching algorithms such as iterative closest point; Experimental results on synthetic and real databases illustrate how FGM outperforms state-of-the-art algorithms for GM. The code is available at http://humansensing.cs.cmu.edu/fgm.
Lorscheid, Oliver
2010-01-01
Let $X$ be a curve over $\\F_q$ with function field $F$. In this paper, we define a graph for each Hecke operator with fixed ramification. A priori, these graphs can be seen as a convenient language to organize formulas for the action of Hecke operators on automorphic forms. However, they will prove to be a powerful tool for explicit calculations and proofs of finite dimensionality results. We develop a structure theory for certain graphs $G_x$ of unramified Hecke operators, which is of a similar vein to Serre's theory of quotients of Bruhat Tits trees. To be precise, $G_x$ is locally a quotient of a Bruhat Tits tree and has finitely many components. An interpretation of $G_x$ in terms of rank 2 bundles on $X$ and methods from reduction theory show that $G_x$ is the union of finitely many cusps, which are infinite subgraphs of a simple nature, and a nucleus, which is a finite subgraph that depends heavily on the arithmetics of $F$. We describe how one recovers unramified automorphic forms as functions on the g...
Kinetic Stable Delaunay Graphs
Agarwal, Pankaj K; Guibas, Leonidas J; Kaplan, Haim; Koltun, Vladlen; Rubin, Natan; Sharir, Micha
2011-01-01
We consider the problem of maintaining the Euclidean Delaunay triangulation $\\DT$ of a set $P$ of $n$ moving points in the plane, along algebraic trajectories of constant description complexity. Since the best known upper bound on the number of topological changes in the full $\\DT$ is nearly cubic, we seek to maintain a suitable portion of it that is less volatile yet retains many useful properties. We introduce the notion of a stable Delaunay graph, which is a dynamic subgraph of the Delaunay triangulation. The stable Delaunay graph (a) is easy to define, (b) experiences only a nearly quadratic number of discrete changes, (c) is robust under small changes of the norm, and (d) possesses certain useful properties. The stable Delaunay graph ($\\SDG$ in short) is defined in terms of a parameter $\\alpha>0$, and consists of Delaunay edges $pq$ for which the angles at which $p$ and $q$ see their Voronoi edge $e_{pq}$ are at least $\\alpha$. We show that (i) $\\SDG$ always contains at least roughly one third of the Del...
The phylogeny graphs of doubly partial orders
Park, Boram
2011-01-01
The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an induced subgraph, respectively. Phylogeny graphs are variant of competition graphs. The phylogeny graph $P(D)$ of a digraph $D$ is the (simple undirected) graph defined by $V(P(D)):=V(D)$ and $E(P(D)):=\\{xy \\mid N^+_D(x) \\cap N^+_D(y) \
Duality in Geometric Graphs: Vector Graphs, Kirchhoff Graphs and Maxwell Reciprocal Figures
Tyler Reese
2016-02-01
Full Text Available We compare two mathematical theories that address duality between cycles and vertex-cuts of graphs in geometric settings. First, we propose a rigorous definition of a new type of graph, vector graphs. The special case of R2-vector graphs matches the intuitive notion of drawing graphs with edges taken as vectors. This leads to a discussion of Kirchhoff graphs, as originally presented by Fehribach, which can be defined independent of any matrix relations. In particular, we present simple cases in which vector graphs are guaranteed to be Kirchhoff or non-Kirchhoff. Next, we review Maxwell’s method of drawing reciprocal figures as he presented in 1864, using modern mathematical language. We then demonstrate cases in which R2-vector graphs defined from Maxwell reciprocals are “dual” Kirchhoff graphs. Given an example in which Maxwell’s theories are not sufficient to define vector graphs, we begin to explore other methods of developing dual Kirchhoff graphs.
Graphs cospectral with a friendship graph or its complement
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}$.
The Lecture Video Scene Extracting System
石黒, 信啓; 白井,治彦; 黒岩,丈介; 小高, 知宏; 小倉, 久和; ISHIGURO, Nobuhiko; SHIRAI, Haruhiko; KUROIWA, Josuke; ODAKA, Tomohiko; OGURA, Hisakazu
2011-01-01
In this paper, we propose the system of extracting feature of scenes in a lecture video. To avoid a hand work on a lecture video, we propose a new method automate the judgment of importance of a scene. This system uses the TF-IDF method that is the technique of the natural language processing. Our system has four functions to watch a lecture video efficiently. They are the function of extracting feature of scenes, character string choice, keyword search and important scene choice.These functi...
A system of infrared scene simulation
Hu, Haihe; Li, Yujian; Huo, Yi; Kuang, Wenqing; Zhang, Ting
2016-10-01
We propose an integral infrared scene simulation system. The proposed system, which is based on the parameters of the thermal physical property and optical property, computes the radiation distribution of the scenery on the focus plane of the camera according to the scene of the geometrical parameter, the position and intensity of the light source, the location and direction of the camera and so on. Then the radiation distribution is mapped to the space of gray, and we finally obtain the virtual image of the scene. The proposed system includes eight modules namely basic data maintaining, model importing, scene saving, geometry parameters setting and infrared property parameters of the scene, data pre-processing, infrared scene simulation, and scene loading. The proposed system organizes all the data by the mode of database lookup table that stores all relative parameters and computation results of different states to avoid repetitive computation. Experimental results show that the proposed system produces three dimension infrared images in real time to some extent, and can reach 60 frames/second in simple scene drawing and 20 frames/second in complex scene drawing. Experimental results also show that the simulated images can represent infrared features of the scenery to a certain degree.
Audiovisual integration facilitates unconscious visual scene processing.
Tan, Jye-Sheng; Yeh, Su-Ling
2015-10-01
Meanings of masked complex scenes can be extracted without awareness; however, it remains unknown whether audiovisual integration occurs with an invisible complex visual scene. The authors examine whether a scenery soundtrack can facilitate unconscious processing of a subliminal visual scene. The continuous flash suppression paradigm was used to render a complex scene picture invisible, and the picture was paired with a semantically congruent or incongruent scenery soundtrack. Participants were asked to respond as quickly as possible if they detected any part of the scene. Release-from-suppression time was used as an index of unconscious processing of the complex scene, which was shorter in the audiovisual congruent condition than in the incongruent condition (Experiment 1). The possibility that participants adopted different detection criteria for the 2 conditions was excluded (Experiment 2). The audiovisual congruency effect did not occur for objects-only (Experiment 3) and background-only (Experiment 4) pictures, and it did not result from consciously mediated conceptual priming (Experiment 5). The congruency effect was replicated when catch trials without scene pictures were added to exclude participants with high false-alarm rates (Experiment 6). This is the first study demonstrating unconscious audiovisual integration with subliminal scene pictures, and it suggests expansions of scene-perception theories to include unconscious audiovisual integration.
Evaluation of Graph Pattern Matching Workloads in Graph Analysis Systems
Hong, Seokyong [North Carolina State University (NCSU), Raleigh; Lee, Sangkeun (Matt) [ORNL; Lim, Seung-Hwan [ORNL; Sukumar, Sreenivas Rangan [ORNL; Vatsavai, Raju [North Carolina State University (NCSU), Raleigh
2016-01-01
Graph analysis has emerged as a powerful method for data scientists to represent, integrate, query, and explore heterogeneous data sources. As a result, graph data management and mining became a popular area of research, and led to the development of plethora of systems in recent years. Unfortunately, the number of emerging graph analysis systems and the wide range of applications, coupled with a lack of apples-to-apples comparisons, make it difficult to understand the trade-offs between different systems and the graph operations for which they are designed. A fair comparison of these systems is a challenging task for the following reasons: multiple data models, non-standardized serialization formats, various query interfaces to users, and diverse environments they operate in. To address these key challenges, in this paper we present a new benchmark suite by extending the Lehigh University Benchmark (LUBM) to cover the most common capabilities of various graph analysis systems. We provide the design process of the benchmark, which generalizes the workflow for data scientists to conduct the desired graph analysis on different graph analysis systems. Equipped with this extended benchmark suite, we present performance comparison for nine subgraph pattern retrieval operations over six graph analysis systems, namely NetworkX, Neo4j, Jena, Titan, GraphX, and uRiKA. Through the proposed benchmark suite, this study reveals both quantitative and qualitative findings in (1) implications in loading data into each system; (2) challenges in describing graph patterns for each query interface; and (3) different sensitivity of each system to query selectivity. We envision that this study will pave the road for: (i) data scientists to select the suitable graph analysis systems, and (ii) data management system designers to advance graph analysis systems.
An Algebraic Representation of Graphs and Applications to Graph Enumeration
Ângela Mestre
2013-01-01
Full Text Available We give a recursion formula to generate all the equivalence classes of connected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We use an algebraic graph representation to apply the result to the enumeration of connected graphs, all of whose biconnected components have the same number of vertices and edges. The proof uses Abel’s binomial theorem and generalizes Dziobek’s induction proof of Cayley’s formula.
Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs
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...
Spectral Radius of Hamiltonian Planar Graphs and Outerplanar Graphs
周建; 林翠琴; 胡冠章
2001-01-01
The spectral radius is an important parameter of a graph related to networks. A method forestimating the spectral radius of each spanning subgraph is used to prove that the spectral radius of aHamiltonian planar graph of order n ≥ 4 is less than or equal toand the spectral radius of theouterplanar graph of order n ≥ 6 is less than or equal to, which are improvements overprevious results. A direction for further study is then suggested.``
selscan: an efficient multithreaded program to perform EHH-based scans for positive selection.
Szpiech, Zachary A; Hernandez, Ryan D
2014-10-01
Haplotype-based scans to detect natural selection are useful to identify recent or ongoing positive selection in genomes. As both real and simulated genomic data sets grow larger, spanning thousands of samples and millions of markers, there is a need for a fast and efficient implementation of these scans for general use. Here, we present selscan, an efficient multithreaded application that implements Extended Haplotype Homozygosity (EHH), Integrated Haplotype Score (iHS), and Cross-population EHH (XPEHH). selscan accepts phased genotypes in multiple formats, including TPED, and performs extremely well on both simulated and real data and over an order of magnitude faster than existing available implementations. It calculates iHS on chromosome 22 (22,147 loci) across 204 CEU haplotypes in 353 s on one thread (33 s on 16 threads) and calculates XPEHH for the same data relative to 210 YRI haplotypes in 578 s on one thread (52 s on 16 threads). Source code and binaries (Windows, OSX, and Linux) are available at https://github.com/szpiech/selscan.
A Multi-Threaded Fast Convolver for Dynamically Parallel Image Filtering
Kepner, J V
2001-01-01
2D convolution is a staple of digital image processing. The advent of large format imagers makes it possible to literally ``pave'' with silicon the focal plane of an optical sensor, which results in very large images that can require a significant amount computation to process. Filtering of large images via 2D convolutions is often complicated by a variety of effects (e.g., non-uniformities found in wide field of view instruments). This paper describes a fast (FFT based) method for convolving images, which is also well suited to very large images. A parallel version of the method is implemented using a multi-threaded approach, which allows more efficient load balancing and a simpler software architecture. The method has been implemented within in a high level interpreted language (IDL), while also exploiting open standards vector libraries (VSIPL) and open standards parallel directives (OpenMP). The parallel approach and software architecture are generally applicable to a variety of algorithms and has the adv...
Chaichoompu, Kridsadakorn; Kittitornkun, Surin; Tongsima, Sissades
2007-12-30
Many computational intensive bioinformatics software, such as multiple sequence alignment, population structure analysis, etc., written in C/C++ are not multicore-aware. A multicore processor is an emerging CPU technology that combines two or more independent processors into a single package. The Single Instruction Multiple Data-stream (SIMD) paradigm is heavily utilized in this class of processors. Nevertheless, most popular compilers including Microsoft Visual C/C++ 6.0, x86 gnu C-compiler gcc do not automatically create SIMD code which can fully utilize the advancement of these processors. To harness the power of the new multicore architecture certain compiler techniques must be considered. This paper presents a generic compiling strategy to assist the compiler in improving the performance of bioinformatics applications written in C/C++. The proposed framework contains 2 main steps: multithreading and vectorizing strategies. After following the strategies, the application can achieve higher speedup by taking the advantage of multicore architecture technology. Due to the extremely fast interconnection networking among multiple cores, it is suggested that the proposed optimization could be more appropriate than making use of parallelization on a small cluster computer which has larger network latency and lower bandwidth.
Towards Fast Reverse Time Migration Kernels using Multi-threaded Wavefront Diamond Tiling
Malas, T.
2015-09-13
Today’s high-end multicore systems are characterized by a deep memory hierarchy, i.e., several levels of local and shared caches, with limited size and bandwidth per core. The ever-increasing gap between the processor and memory speed will further exacerbate the problem and has lead the scientific community to revisit numerical software implementations to better suit the underlying memory subsystem for performance (data reuse) as well as energy efficiency (data locality). The authors propose a novel multi-threaded wavefront diamond blocking (MWD) implementation in the context of stencil computations, which represents the core operation for seismic imaging in oil industry. The stencil diamond formulation introduces temporal blocking for high data reuse in the upper cache levels. The wavefront optimization technique ensures data locality by allowing multiple threads to share common adjacent point stencil. Therefore, MWD is able to take up the aforementioned challenges by alleviating the cache size limitation and releasing pressure from the memory bandwidth. Performance comparisons are shown against the optimized 25-point stencil standard seismic imaging scheme using spatial and temporal blocking and demonstrate the effectiveness of MWD.
Studying the corona product of graphs under some graph invariants
M. Tavakoli
2014-09-01
Full Text Available The corona product $Gcirc H$ of two graphs $G$ and $H$ is obtained by taking one copy of $G$ and $|V(G|$ copies of $H$; and by joining each vertex of the $i$-th copy of $H$ to the $i$-th vertex of $G$, where $1 leq i leq |V(G|$. In this paper, exact formulas for the eccentric distance sum and the edge revised Szeged indices of the corona product of graphs are presented. We also study the conditions under which the corona product of graphs produces a median graph.
Graph Coarsening for Path Finding in Cybersecurity Graphs
Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh
2013-01-01
n the pass-the-hash attack, hackers repeatedly steal password hashes and move through a computer network with the goal of reaching a computer with high level administrative privileges. In this paper we apply graph coarsening in network graphs for the purpose of detecting hackers using this attack or assessing the risk level of the network's current state. We repeatedly take graph minors, which preserve the existence of paths in the graph, and take powers of the adjacency matrix to count the paths. This allows us to detect the existence of paths as well as find paths that have high risk of being used by adversaries.
Statistical mechanics on isoradial graphs
Boutillier, Cédric
2010-01-01
Isoradial graphs are a natural generalization of regular graphs which give, for many models of statistical mechanics, the right framework for studying models at criticality. In this survey paper, we first explain how isoradial graphs naturally arise in two approaches used by physicists: transfer matrices and conformal field theory. This leads us to the fact that isoradial graphs provide a natural setting for discrete complex analysis, to which we dedicate one section. Then, we give an overview of explicit results obtained for different models of statistical mechanics defined on such graphs: the critical dimer model when the underlying graph is bipartite, the 2-dimensional critical Ising model, random walk and spanning trees and the q-state Potts model.
Eilers, Søren; Sørensen, Adam P W
2011-01-01
We provide a complete invariant for graph C*-algebras which are amplified in the sense that whenever there is an edge between two vertices, there are infinitely many. The invariant used is the standard primitive ideal space adorned with a map into {-1,0,1,2,...}, and we prove that the classification result is strong in the sense that isomorphisms at the level of the invariant always lift. We extend the classification result to cover more graphs, and give a range result for the invariant (in the vein of Effros-Handelman-Shen) which is further used to prove that extensions of graph C*-algebras associated to amplified graphs are again graph C*-algebras of amplified graphs.
Dettlaff, Magda; Yero, Ismael G
2012-01-01
The bondage number $b(G)$ of a nonempty graph $G$ is the cardinality of a smallest set of edges whose removal from $G$ results in a graph with domination number greater than the domination number of $G$. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some Cartesian product, strong product or direct product of two paths.
Dettlaff, Magda; Lemanska, Magdalena; Yero, Ismael G.
2012-01-01
The bondage number $b(G)$ of a nonempty graph $G$ is the cardinality of a smallest set of edges whose removal from $G$ results in a graph with domination number greater than the domination number of $G$. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
Graphs Theory and Applications
Fournier, Jean-Claude
2008-01-01
This book provides a pedagogical and comprehensive introduction to graph theory and its applications. It contains all the standard basic material and develops significant topics and applications, such as: colorings and the timetabling problem, matchings and the optimal assignment problem, and Hamiltonian cycles and the traveling salesman problem, to name but a few. Exercises at various levels are given at the end of each chapter, and a final chapter presents a few general problems with hints for solutions, thus providing the reader with the opportunity to test and refine their knowledge on the
Burleigh, Scott C.
2011-01-01
Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic
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.
Kucharik, Marcel; Hofacker, Ivo; Stadler, Peter
2014-01-01
Motivation RNA folding is a complicated kinetic process. The minimum free energy structure provides only a static view of the most stable conformational state of the system. It is insufficient to give detailed insights into the dynamic behavior of RNAs. A sufficiently sophisticated analysis...... 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...
Zeps, Dainis
2009-01-01
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces. Further, we define multiplication of these objects, that coincides with the multiplication of permutations. We consider closed under multiplication classes of combinatorial maps that consist of closed classes of combinatorial maps with fixed edges where each such class is defined by a knot. One class among them is special, containing selfconjugate maps.
Learning Probabilistic Decision Graphs
Jaeger, Manfred; Dalgaard, Jens; Silander, Tomi
2004-01-01
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence relations that cannot be captured in a Bayesian network structure, and can sometimes provide computationally more...... efficient representations than Bayesian networks. In this paper we present an algorithm for learning PDGs from data. First experiments show that the algorithm is capable of learning optimal PDG representations in some cases, and that the computational efficiency of PDG models learned from real-life data...
Endomorphisms of graph algebras
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...
Partitions of generalized split graphs
Shklarsky, Oren
2012-01-01
We discuss matrix partition problems for graphs that admit a partition into k independent sets and ` cliques. We show that when k + ` 6 2, any matrix M has finitely many (k; `) minimal obstructions and hence all of these problems are polynomial time solvable. We provide upper bounds for the size of any (k; `) minimal obstruction when k = ` = 1 (split graphs), when k = 2; ` = 0 (bipartite graphs), and when k = 0; ` = 2 (co-bipartite graphs). When k = ` = 1, we construct an exponential size spl...
Nested Dynamic Condition Response Graphs
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...... Exformatics, a danish provider of case and workflow management systems. We formalize the semantics by giving first a map from Nested to (flat) DCR Graphs with milestones, and then extending the previously given mapping from DCR Graphs to Buchi-automata to include the milestone relation....
Edge Ideals of Weighted Graphs
Paulsen, Chelsey
2012-01-01
We study weighted graphs and their "edge ideals" which are ideals in polynomial rings that are defined in terms of the graphs. We provide combinatorial descriptions of m-irreducible decompositions for the edge ideal of a weighted graph in terms of the combinatorics of "weighted vertex covers". We use these, for instance, to say when these ideals are m-unmixed. We explicitly describe which weighted cycles and trees are unmixed and which ones are Cohen-Macaulay, and we prove that all weighted complete graphs are Cohen-Macaulay.
Intuitionistic Fuzzy Graphs with Categorical Properties
Hossein Rashmanlou
2015-09-01
Full Text Available The main purpose of this paper is to show the rationality of some operations, defined or to be defined, on intuitionistic fuzzy graphs. Firstly, three kinds of new product operations (called direct product, lexicographic product, and strong product are defined in intuitionistic fuzzy graphs, and some important notions on intuitionistic fuzzy graphs are demonstrated by characterizing these notions and their level counterparts graphs such as intuitionistic fuzzy complete graph, cartesian product of intuitionistic fuzzy graphs, composition of intuitionistic fuzzy graphs, union of intuitionistic fuzzy graphs, and join of intuitionistic fuzzy graphs. As a result, a kind of representations of intuitionistic fuzzy graphs and intuitionistic fuzzy complete graphs are given. Next, categorical goodness of intuitionistic fuzzy graphs is illustrated by proving that the category of intuitionistic fuzzy graphs and homomorphisms between them is isomorphic-closed, complete, and co-complete.
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.
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.
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.
Double-Critical Graphs and Complete Minors
Kawarabayashi, Ken-ichi; Pedersen, Anders Sune; Toft, Bjarne
2010-01-01
A connected $k$-chromatic graph $G$ is double-critical if for all edges $uv$ of $G$ the graph $G - u - v$ is $(k-2)$-colourable. The only known double-critical $k$-chromatic graph is the complete $k$-graph $K_k$. The conjecture that there are no other double-critical graphs is a special case...
Tutte Polynomial of Multi-Bridge Graphs
Julian A. Allagan
2013-10-01
Full Text Available In this paper, using a well-known recursion for computing the Tutte polynomial of any graph, we found explicit formulae for the Tutte polynomials of any multi-bridge graph and some $2-$tree graphs. Further, several recursive formulae for other graphs such as the fan and the wheel graphs are also discussed.
A Modal-Logic Based Graph Abstraction
Bauer, J.; Boneva, I.B.; Kurban, M.E.; Rensink, A.; Ehrig, H.; Heckel, R.; Rozenberg, G.; Taentzer, G.
2008-01-01
Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract graphs
Road Scene Segmentation from a Single Image
J.M. Alvarez; T. Gevers; Y. LeCun; A.M. Lopez
2012-01-01
Road scene segmentation is important in computer vision for different applications such as autonomous driving and pedestrian detection. Recovering the 3D structure of road scenes provides relevant contextual information to improve their understanding. In this paper, we use a convolutional neural net
History Scene Investigations: From Clues to Conclusions
McIntyre, Beverly
2011-01-01
In this article, the author introduces a social studies lesson that allows students to learn history and practice reading skills, critical thinking, and writing. The activity is called History Scene Investigation or HSI, which derives its name from the popular television series based on crime scene investigations (CSI). HSI uses discovery learning…
Illumination discrimination in real and simulated scenes
Radonjić, Ana; Pearce, Bradley; Aston, Stacey; Krieger, Avery; Dubin, Hilary; Cottaris, Nicolas P.; Brainard, David H.; Hurlbert, Anya C.
2016-01-01
Characterizing humans' ability to discriminate changes in illumination provides information about the visual system's representation of the distal stimulus. We have previously shown that humans are able to discriminate illumination changes and that sensitivity to such changes depends on their chromatic direction. Probing illumination discrimination further would be facilitated by the use of computer-graphics simulations, which would, in practice, enable a wider range of stimulus manipulations. There is no a priori guarantee, however, that results obtained with simulated scenes generalize to real illuminated scenes. To investigate this question, we measured illumination discrimination in real and simulated scenes that were well-matched in mean chromaticity and scene geometry. Illumination discrimination thresholds were essentially identical for the two stimulus types. As in our previous work, these thresholds varied with illumination change direction. We exploited the flexibility offered by the use of graphics simulations to investigate whether the differences across direction are preserved when the surfaces in the scene are varied. We show that varying the scene's surface ensemble in a manner that also changes mean scene chromaticity modulates the relative sensitivity to illumination changes along different chromatic directions. Thus, any characterization of sensitivity to changes in illumination must be defined relative to the set of surfaces in the scene.
History Scene Investigations: From Clues to Conclusions
McIntyre, Beverly
2011-01-01
In this article, the author introduces a social studies lesson that allows students to learn history and practice reading skills, critical thinking, and writing. The activity is called History Scene Investigation or HSI, which derives its name from the popular television series based on crime scene investigations (CSI). HSI uses discovery learning…
Auditory and visual scene analysis: an overview
2017-01-01
We perceive the world as stable and composed of discrete objects even though auditory and visual inputs are often ambiguous owing to spatial and temporal occluders and changes in the conditions of observation. This raises important questions regarding where and how ‘scene analysis’ is performed in the brain. Recent advances from both auditory and visual research suggest that the brain does not simply process the incoming scene properties. Rather, top-down processes such as attention, expectations and prior knowledge facilitate scene perception. Thus, scene analysis is linked not only with the extraction of stimulus features and formation and selection of perceptual objects, but also with selective attention, perceptual binding and awareness. This special issue covers novel advances in scene-analysis research obtained using a combination of psychophysics, computational modelling, neuroimaging and neurophysiology, and presents new empirical and theoretical approaches. For integrative understanding of scene analysis beyond and across sensory modalities, we provide a collection of 15 articles that enable comparison and integration of recent findings in auditory and visual scene analysis. This article is part of the themed issue ‘Auditory and visual scene analysis’. PMID:28044011
Road Scene Segmentation from a Single Image
Alvarez, J.M.; Gevers, T.; LeCun, Y.; Lopez, A.M.
2012-01-01
Road scene segmentation is important in computer vision for different applications such as autonomous driving and pedestrian detection. Recovering the 3D structure of road scenes provides relevant contextual information to improve their understanding. In this paper, we use a convolutional neural
Wang, Suijie
2010-01-01
In this paper, we give a Laplacian characterization of the product of the complete graphs $K_m$ with trees, unicyclic graphs, and bicyclic graphs. More precisely, let $G$ be a connected graph with at most two independent cycles. If $G$ is neither $C_{6}$ nor $\\Theta_{3,2,5}$ and determined by its Laplacain spectrum, then the product $G\\times K_{m}$ is also a graph determined by its Laplacian spectrum. In addition, we find the cosepctral graphs of $C_{6}\\times K_{m}$ and $\\Theta_{3,2,5}\\times K_{m}$, where the case $m=1$ is shown in Figure \\ref{F1} and \\ref{F2}.
Look Closely: The Finer Points of Scene Analysis.
Miller, Bruce
1998-01-01
Continues a discussion of script analysis for actors. Focuses on specific scenes and how an eventual scene-by-scene analysis will help students determine a "throughline" of a play's action. Uses a scene from "Romeo and Juliet" to illustrate scene analysis. Gives 13 script questions for students to answer. Presents six tips for scoring the action.…
Detecting alternative graph clusterings.
Mandala, Supreet; Kumara, Soundar; Yao, Tao
2012-07-01
The problem of graph clustering or community detection has enjoyed a lot of attention in complex networks literature. A quality function, modularity, quantifies the strength of clustering and on maximization yields sensible partitions. However, in most real world networks, there are an exponentially large number of near-optimal partitions with some being very different from each other. Therefore, picking an optimal clustering among the alternatives does not provide complete information about network topology. To tackle this problem, we propose a graph perturbation scheme which can be used to identify an ensemble of near-optimal and diverse clusterings. We establish analytical properties of modularity function under the perturbation which ensures diversity. Our approach is algorithm independent and therefore can leverage any of the existing modularity maximizing algorithms. We numerically show that our methodology can systematically identify very different partitions on several existing data sets. The knowledge of diverse partitions sheds more light into the topological organization and helps gain a more complete understanding of the underlying complex network.
Estrada, Ernesto
2015-01-01
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square \\left[0,1\\right]^{2}. The topological properties, such as connectivity, average degree, average path length and clustering, of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides lengths a and b=1/a, and the radius r used to connect the nodes. When a=1 we recover the RGG, and when a\\rightarrow\\infty the very elongated rectangle generated resembles a one-dimensional RGG. We provided computational and analytical evidence that the topological properties of the RRG differ significantly from those of the RGG. The connectivity of the RRG depends not only on the number of nodes as in the case of the RGG, but also on the side length of the rectangle. As the rectangle is more elongated the critical radius for connectivity increases following first a power-law an...
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%.
Kirkpatrick, Bonnie; Reshef, Yakir; Finucane, Hilary; Jiang, Haitao; Zhu, Binhai; Karp, Richard M
2012-09-01
Pedigree graphs, or family trees, are typically constructed by an expensive process of examining genealogical records to determine which pairs of individuals are parent and child. New methods to automate this process take as input genetic data from a set of extant individuals and reconstruct ancestral individuals. There is a great need to evaluate the quality of these methods by comparing the estimated pedigree to the true pedigree. In this article, we consider two main pedigree comparison problems. The first is the pedigree isomorphism problem, for which we present a linear-time algorithm for leaf-labeled pedigrees. The second is the pedigree edit distance problem, for which we present (1) several algorithms that are fast and exact in various special cases, and (2) a general, randomized heuristic algorithm. In the negative direction, we first prove that the pedigree isomorphism problem is as hard as the general graph isomorphism problem, and that the sub-pedigree isomorphism problem is NP-hard. We then show that the pedigree edit distance problem is APX-hard in general and NP-hard on leaf-labeled pedigrees. We use simulated pedigrees to compare our edit-distance algorithms to each other as well as to a branch-and-bound algorithm that always finds an optimal solution.
Understanding natural scenes: Contributions of image statistics.
De Cesarei, Andrea; Loftus, Geoffrey R; Mastria, Serena; Codispoti, Maurizio
2017-03-01
Visual processing of natural scenes is carried out in a hierarchical sequence of stages that involve the analysis of progressively more complex features of the visual input. Recent studies have suggested that the semantic content of natural stimuli (e.g., real world photos) can be categorized based on statistical regularities in their appearance, which can be detected early in the visual processing stream. Here we review the studies which have investigated the role of scene statistics in the perception of natural scenes, focusing on both basic visual processing and specific tasks (visual search, expert categorization, emotional picture viewing). Visual processing seems to be adapted to visual regularities in the visual input, such as the amplitude-frequency relationship. Moreover, scene statistics can aid performance in specific tasks such as distinguishing animals from artifactual scenes, possibly by modulating early visual processing stages.
Quantization of gauge fields, graph polynomials and graph homology
Kreimer, Dirk, E-mail: kreimer@physik.hu-berlin.de [Humboldt University, 10099 Berlin (Germany); Sars, Matthias [Humboldt University, 10099 Berlin (Germany); Suijlekom, Walter D. van [Radboud University Nijmegen, 6525 AJ Nijmegen (Netherlands)
2013-09-15
We review quantization of gauge fields using algebraic properties of 3-regular graphs. We derive the Feynman integrand at n loops for a non-abelian gauge theory quantized in a covariant gauge from scalar integrands for connected 3-regular graphs, obtained from the two Symanzik polynomials. The transition to the full gauge theory amplitude is obtained by the use of a third, new, graph polynomial, the corolla polynomial. This implies effectively a covariant quantization without ghosts, where all the relevant signs of the ghost sector are incorporated in a double complex furnished by the corolla polynomial–we call it cycle homology–and by graph homology. -- Highlights: •We derive gauge theory Feynman from scalar field theory with 3-valent vertices. •We clarify the role of graph homology and cycle homology. •We use parametric renormalization and the new corolla polynomial.
Multithreaded comparative RNA secondary structure prediction using stochastic context-free grammars
Værum Morten
2011-04-01
Full Text Available Abstract Background The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state-of-the-art algorithms. The pfold model couples a stochastic context-free grammar to phylogenetic analysis for a high accuracy in predictions, but the time complexity of the algorithm and underflow errors have prevented its use for long alignments. Here we present PPfold, a multithreaded version of pfold, which is capable of predicting the structure of large RNA alignments accurately on practical timescales. Results We have distributed both the phylogenetic calculations and the inside-outside algorithm in PPfold, resulting in a significant reduction of runtime on multicore machines. We have addressed the floating-point underflow problems of pfold by implementing an extended-exponent datatype, enabling PPfold to be used for large-scale RNA structure predictions. We have also improved the user interface and portability: alongside standalone executable and Java source code of the program, PPfold is also available as a free plugin to the CLC Workbenches. We have evaluated the accuracy of PPfold using BRaliBase I tests, and demonstrated its practical use by predicting the secondary structure of an alignment of 24 complete HIV-1 genomes in 65 minutes on an 8-core machine and identifying several known structural elements in the prediction. Conclusions PPfold is the first parallelized comparative RNA structure prediction algorithm to date. Based on the pfold model, PPfold is capable of fast, high-quality predictions of large RNA secondary structures, such as the genomes of RNA viruses or long genomic transcripts. The techniques used in the parallelization of this algorithm may be of general applicability to other bioinformatics algorithms.
2005-06-01
intuitive results on a variety of synthetic and real-world datasets. Here, we will verify their scalability. Figure 5.9 shows results on a “ caveman ...show timing results on a “ caveman ” graph with 3 caves. The plot shows wall-clock time vs. the number of edges E in the graph, for both SPLIT (dashed
Subgraph Enumeration in Massive Graphs
Silvestri, Francesco
bound also applies with high probability. Our algorithm is I/O optimal, in the worst-case, when the sample graph belongs to the Alon class, which includes cliques, cycles and every graph with a perfect matching: indeed, we show that any algorithm enumerating $T$ instances must always use $\\BOM...
Open Graphs and Monoidal Theories
Dixon, Lucas
2010-01-01
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of these diagrams is that edges need not be connected to vertices at both ends, and these unconnected ends can be interpreted as the inputs and outputs of a diagram. In this paper, we give a concrete construction for string diagrams using a special kind of typed graph called an open-graph. While the category of open-graphs is not itself adhesive, we introduce the notion of a selective adhesive functor, and show that such a functor embeds the category of open-graphs into the ambient adhesive category of typed graphs. Using this functor, the category of open-graphs inherits "enough adhesivity" from the category of typed graphs to perform double-pushout (DPO) graph rewriting. A salient feature of our theory is that it ensures rewrite systems are "type-safe" in the sense that rewriting respects the inputs and outputs. This formalism lets u...
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.
Graph Transformation and AI Planning
Edelkamp, S.; Rensink, Arend; Edelkamp, S.; Frank, J.
This document provides insight to the similarities and differences of Graph Transformation and AI Planning, two rising research fields with different publication organs and tools. While graph transformation systems can be used as a graphical knowledge engineering front-end for designing planning
Graph Transformation and AI Planning
Edelkamp, S.; Rensink, A.; Edelkamp, S.; Frank, J.
2007-01-01
This document provides insight to the similarities and differences of Graph Transformation and AI Planning, two rising research fields with different publication organs and tools. While graph transformation systems can be used as a graphical knowledge engineering front-end for designing planning pr
Quantum Markov fields on graphs
2009-01-01
We introduce generalized quantum Markov states and generalized d-Markov chains which extend the notion quantum Markov chains on spin systems to that on $C^*$-algebras defined by general graphs. As examples of generalized d-Markov chains, we construct the entangled Markov fields on tree graphs. The concrete examples of generalized d-Markov chains on Cayley trees are also investigated.
Paley Graphs and Their Generalizations
Elsawy, Ahmed Noubi
2012-01-01
To construct a Paley graph, we fix a finite field and consider its elements as vertices of the Paley graph. Two vertices are connected by an edge if their difference is a square in the field. We will study some important properties of the Paley graphs. In particular, we will show that the Paley graphs are connected, symmetric, and self-complementary. Also we will show that the Paley graph of order q is (q-1)/2 -regular, and every two adjacent vertices have (q-5)/4 common neighbors, and every two non-adjacent vertices have q-1/4 common neighbors, which means that the Paley graphs are strongly regular with parameters(q,q-1/2,q-5/4, q-1/4). Paley graphs are generalized by many mathematicians. In the first section of Chapter 3 we will see three examples of these generalizations and some of their basic properties. In the second section of Chapter 3 we will define a new generalization of the Paley graphs, in which pairs of elements of a finite field are connected by an edge if and only if there difference belongs t...
Graph Representation of Projective Resolutions
Hong Bo SHI
2011-01-01
We generalize the concept - dimension tree and the related results for monomial algebras to a more general case - relations algebras Λ by bringing Gr(o)bner basis into play. More precisely,graph to be called the minimal resolution graph for M. Algorithms for computing such diagraphs and applications as well will be presented.
A Collection of Features for Semantic Graphs
Eliassi-Rad, T; Fodor, I K; Gallagher, B
2007-05-02
Semantic graphs are commonly used to represent data from one or more data sources. Such graphs extend traditional graphs by imposing types on both nodes and links. This type information defines permissible links among specified nodes and can be represented as a graph commonly referred to as an ontology or schema graph. Figure 1 depicts an ontology graph for data from National Association of Securities Dealers. Each node type and link type may also have a list of attributes. To capture the increased complexity of semantic graphs, concepts derived for standard graphs have to be extended. This document explains briefly features commonly used to characterize graphs, and their extensions to semantic graphs. This document is divided into two sections. Section 2 contains the feature descriptions for static graphs. Section 3 extends the features for semantic graphs that vary over time.
Asymptotic aspects of Cayley graphs
Dejter, Italo J
2011-01-01
Arising from complete Cayley graphs $\\Gamma_n$ of odd cyclic groups $\\Z_n$, an asymptotic approach is presented on connected labeled graphs whose vertices are labeled via equally-multicolored copies of $K_4$ in $\\Gamma_n$ with adjacency of any two such vertices whenever they are represented by copies of $K_4$ in $\\Gamma_n$ sharing two equally-multicolored triangles. In fact, these connected labeled graphs are shown to form a family of graphs of largest degree 6 and diameter asymptotically of order $|V|^{1/3}$, properties shared by the initial member of a collection of families of Cayley graphs of degree $2m\\geq 6$ with diameter asymptotically of order $|V|^{1/m}$, where $3\\leq m\\in\\Z$.
Renormalization algorithm with graph enhancement
Hübener, R; Hartmann, L; Dür, W; Plenio, M B; Eisert, J
2011-01-01
We present applications of the renormalization algorithm with graph enhancement (RAGE). This analysis extends the algorithms and applications given for approaches based on matrix product states introduced in [Phys. Rev. A 79, 022317 (2009)] to other tensor-network states such as the tensor tree states (TTS) and projected entangled pair states (PEPS). We investigate the suitability of the bare TTS to describe ground states, showing that the description of certain graph states and condensed matter models improves. We investigate graph-enhanced tensor-network states, demonstrating that in some cases (disturbed graph states and for certain quantum circuits) the combination of weighted graph states with tensor tree states can greatly improve the accuracy of the description of ground states and time evolved states. We comment on delineating the boundary of the classically efficiently simulatable states of quantum many-body systems.
Planar graphs theory and algorithms
Nishizeki, T
1988-01-01
Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.
Quantum walks on general graphs
Kendon, V
2003-01-01
A scheme for a discrete time quantum walk on a general graph of N vertices with undirected edges is given, and compared with the continuous time quantum walk on a general graph introduced by Farhi and Gutmann [PRA 58 915 (1998)]. Both walks are contrasted with the examples of quantum walks in the literature treating graphs of fixed, small (< log N) degree. This illustrates the way in which extra information about the graph allows more efficient algorithms to be designed. To obtain a quantum speed up over classical for comparable resources it is necessary to code the position space of the quantum walk into a qubit register (or equivalent). The role of the oracle is also discussed and an efficient gate sequence is presented for implementing a discrete quantum walk given one copy of a quantum state encoding the adjacency matrix of the graph.
Girth 5 graphs from relative difference sets
Jørgensen, Leif Kjær
2005-01-01
We consider the problem of construction of graphs with given degree $k$ and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed ...... by Royle, four of the known cages including the Hoffman-Singleton graph, some graphs constructed by Exoo and some new smallest known graphs....
Girth 5 graphs from relative difference sets
Jørgensen, Leif Kjær
We consider the problem of construction of graphs with given degree and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed by G....... Royle, four of the known cages including the Hoffman-Singleton graph, some graphs constructed by G. Exoo and some new smallest known graphs. k...
Parallel Graph Transformation based on Merged Approach
Asmaa Aouat
2013-01-01
Full Text Available Graph transformation is one of the key concepts in graph grammar. In order to accelerate the graph transformation, the concept of parallel graph transformation has been proposed by different tools such as AGG tool. The theory of parallel graph transformation used by AGG just allows clarifying the concepts of conflict and dependency between the transformation rules. This work proposes an approach of parallel graph transformations which enables dependent transformation rules to be executed in parallel.
On characterizing terrain visibility graphs
William Evans
2015-06-01
Full Text Available A terrain is an $x$-monotone polygonal line in the $xy$-plane. Two vertices of a terrain are mutually visible if and only if there is no terrain vertex on or above the open line segment connecting them. A graph whose vertices represent terrain vertices and whose edges represent mutually visible pairs of terrain vertices is called a terrain visibility graph. We would like to find properties that are both necessary and sufficient for a graph to be a terrain visibility graph; that is, we would like to characterize terrain visibility graphs.Abello et al. [Discrete and Computational Geometry, 14(3:331--358, 1995] showed that all terrain visibility graphs are “persistent”. They showed that the visibility information of a terrain point set implies some ordering requirements on the slopes of the lines connecting pairs of points in any realization, and as a step towards showing sufficiency, they proved that for any persistent graph $M$ there is a total order on the slopes of the (pseudo lines in a generalized configuration of points whose visibility graph is $M$.We give a much simpler proof of this result by establishing an orientation to every triple of vertices, reflecting some slope ordering requirements that are consistent with $M$ being the visibility graph, and prove that these requirements form a partial order. We give a faster algorithm to construct a total order on the slopes. Our approach attempts to clarify the implications of the graph theoretic properties on the ordering of the slopes, and may be interpreted as defining properties on an underlying oriented matroid that we show is a restricted type of $3$-signotope.
Classification of Scenes into Indoor/Outdoor
R. Raja
2014-12-01
Full Text Available Effective model for scene classification is essential, to access the desired images from large scale databases. This study presents an efficient scene classification approach by integrating low level features, to reduce the semantic gap between the visual features and richness of human perception. The objective of the study is to categorize an image into indoor or outdoor scene using relevant low level features such as color and texture. The color feature from HSV color model, texture feature through GLCM and entropy computed from UV color space forms the feature vector. To support automatic scene classification, Support Vector Machine (SVM is implemented on low level features for categorizing a scene into indoor/outdoor. Since the combination of these image features exhibit a distinctive disparity between images containing indoor or outdoor scenes, the proposed method achieves better performance in terms of classification accuracy of about 92.44%. The proposed method has been evaluated on IITM- SCID2 (Scene Classification Image Database and dataset of 3442 images collected from the web.
Trott, Oleg; Olson, Arthur J
2010-01-30
AutoDock Vina, a new program for molecular docking and virtual screening, is presented. AutoDock Vina achieves an approximately two orders of magnitude speed-up compared with the molecular docking software previously developed in our lab (AutoDock 4), while also significantly improving the accuracy of the binding mode predictions, judging by our tests on the training set used in AutoDock 4 development. Further speed-up is achieved from parallelism, by using multithreading on multicore machines. AutoDock Vina automatically calculates the grid maps and clusters the results in a way transparent to the user. Copyright 2009 Wiley Periodicals, Inc.
Scenes of the self, and trance
Jan M. Broekman
2014-02-01
Full Text Available Trance shows the Self as a process involved in all sorts and forms of life. A Western perspective on a self and its reifying tendencies is only one (or one series of those variations. The process character of the self does not allow any coherent theory but shows, in particular when confronted with trance, its variability in all regards. What is more: the Self is always first on the scene of itself―a situation in which it becomes a sign for itself. That particular semiotic feature is again not a unified one but leads, as the Self in view of itself does, to series of scenes with changing colors, circumstances and environments. Our first scene “Beyond Monotheism” shows semiotic importance in that a self as determining component of a trance-phenomenon must abolish its own referent and seems not able to answer the question, what makes trance a trance. The Pizzica is an example here. Other social features of trance appear in the second scene, US post traumatic psychological treatments included. Our third scene underlines structures of an unfolding self: beginning with ‘split-ego’ conclusions, a self’s engenderment appears dependent on linguistic events and on spoken words in the first place. A fourth scene explores that theme and explains modern forms of an ego ―in particular those inherent to ‘citizenship’ or a ‘corporation’. The legal consequences are concentrated in the fifth scene, which considers a legal subject by revealing its ‘standing’. Our sixth and final scene pertains to the relation between trance and commerce. All scenes tie together and show parallels between Pizzica, rights-based behavior, RAVE music versus disco, commerce and trance; they demonstrate the meaning of trance as a multifaceted social phenomenon.
Periodic 2-graphs arising from subshifts
Pask, David; Weaver, Natasha
2009-01-01
Higher-rank graphs were introduced by Kumjian and Pask to provide models for higher-rank Cuntz-Krieger algebras. In a previous paper, we constructed 2-graphs whose path spaces are rank-two subshifts of finite type, and showed that this construction yields aperiodic 2-graphs whose $C^*$-algebras are simple and are not ordinary graph algebras. Here we show that the construction also gives a family of periodic 2-graphs which we call \\emph{domino graphs}. We investigate the combinatorial structure of domino graphs, finding interesting points of contact with the existing combinatorial literature, and prove a structure theorem for the $C^*$-algebras of domino graphs.
Jin, Shuangshuang; Chassin, David P.
2014-01-06
GridLAB-DTM is an open source next generation agent-based smart-grid simulator that provides unprecedented capability to model the performance of smart grid technologies. Over the past few years, GridLAB-D has been used to conduct important analyses of smart grid concepts, but it is still quite limited by its computational performance. In order to break through the performance bottleneck to meet the need for large scale power grid simulations, we develop a thread group mechanism to implement highly granular multithreaded computation in GridLAB-D. We achieve close to linear speedups on multithreading version compared against the single-thread version of the same code running on general purpose multi-core commodity for a benchmark simple house model. The performance of the multithreading code shows favorable scalability properties and resource utilization, and much shorter execution time for large-scale power grid simulations.
Scene analysis in the natural environment
Lewicki, Michael S; Olshausen, Bruno A; Surlykke, Annemarie
2014-01-01
The problem of scene analysis has been studied in a number of different fields over the past decades. These studies have led to important insights into problems of scene analysis, but not all of these insights are widely appreciated, and there remain critical shortcomings in current approaches th...... ill-posed problems, (2) the ability to integrate and store information across time and modality, (3) efficient recovery and representation of 3D scene structure, and (4) the use of optimal motor actions for acquiring information to progress toward behavioral goals....
Diverse Scene Stitching from a Large-Scale Aerial Video Dataset
Tao Yang
2015-05-01
Full Text Available Diverse scene stitching is a challenging task in aerial video surveillance. This paper presents a hybrid stitching method based on the observation that aerial videos captured in real surveillance settings are neither totally ordered nor completely unordered. Often, human operators apply continuous monitoring of the drone to revisit the same area of interest. This monitoring mechanism yields to multiple short, successive video clips that overlap in either time or space. We exploit this property and treat the aerial image stitching problem as temporal sequential grouping and spatial cross-group retrieval. We develop an effective graph-based framework that can robustly conduct the grouping, retrieval and stitching tasks. To evaluate the proposed approach, we experiment on the large-scale VIRATaerial surveillance dataset, which is challenging for its heterogeneity in image quality and diversity of the scene. Quantitative and qualitative comparisons with state-of-the-art algorithms show the efficiency and robustness of our technique.
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.
Hierarchy of modular graph identities
D’Hoker, Eric; Kaidi, Justin [Mani L. Bhaumik Institute for Theoretical Physics, Department of Physics and Astronomy,University of California,Los Angeles, CA 90095 (United States)
2016-11-09
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.
Design Pattern Mining Using Graph Matching
LI Qing-hua; ZHANG Zhi-xiang; BEN Ke-rong
2004-01-01
The identification of design pattern instances is important for program understanding and software maintenance. Aiming at the mining of design patterns in existing systems, this paper proposes a sub-graph isomorphism approach to discover several design patterns in a legacy system at a time. The attributed relational graph is used to describe design patterns and legacy systems. The sub-graph isomorphism approach consists of decomposition and composition process. During the decomposition process, graphs corresponding to the design patterns are decomposed into sub-graphs, some of which are graphs corresponding to the elemental design patterns. The composition process tries to get sub-graph isomorphism of the matched graph if sub-graph isomorphism of each sub-graph is obtained. Due to the common structures between design patterns, the proposed approach can reduce the matching times of entities and relations. Compared with the existing methods, the proposed algorithm is not linearly dependent on the number of design pattern graphs.
Cognition inspired framework for indoor scene annotation
Ye, Zhipeng; Liu, Peng; Zhao, Wei; Tang, Xianglong
2015-09-01
We present a simple yet effective scene annotation framework based on a combination of bag-of-visual words (BoVW), three-dimensional scene structure estimation, scene context, and cognitive theory. From a macroperspective, the proposed cognition-based hybrid motivation framework divides the annotation problem into empirical inference and real-time classification. Inspired by the inference ability of human beings, common objects of indoor scenes are defined for experience-based inference, while in the real-time classification stage, an improved BoVW-based multilayer abstract semantics labeling method is proposed by introducing abstract semantic hierarchies to narrow the semantic gap and improve the performance of object categorization. The proposed framework was evaluated on a variety of common data sets and experimental results proved its effectiveness.
Extrapolating spatial layout in scene representations.
Castelhano, Monica S; Pollatsek, Alexander
2010-12-01
Can the visual system extrapolate spatial layout of a scene to new viewpoints after a single view? In the present study, we examined this question by investigating the priming of spatial layout across depth rotations of the same scene (Sanocki & Epstein, 1997). Participants had to indicate which of two dots superimposed on objects in the target scene appeared closer to them in space. There was as much priming from a prime with a viewpoint that was 10° different from the test image as from a prime that was identical to the target; however, there was no reliable priming from larger differences in viewpoint. These results suggest that a scene's spatial layout can be extrapolated, but only to a limited extent.
Acyclic edge colorings of planar graphs and series parallel graphs
HOU JianFeng; WU JianLiang; LIU GuiZhen; LIU Bin
2009-01-01
A proper edge coloring of a graph G is called acyclic if there is no 2-colored cycle in G.The acyclic edge chromatic number of G,denoted by a'(G),is the least number of colors in an acyclic edge coloring of G.Alon et al.conjectured that a'(G) ≤△(G) +2 for any graphs.For planar graphs G with girth g(G),we prove that a'(G) ≤ max{2△(G)-2,△(G) +22} if g(G) ≥3,a'(G)≤△(G)+2if g(G) ≥ 5,a'(G) ≤△(G)+1 if g(G) ≥ 7,and a'(G)=△(G) if g(G) ≥ 16 and △(G) ≥ 3.For series-parallel graphs G,we have a'(G) ≤ △(G) +1.
XML Graphs in Program Analysis
Møller, Anders; Schwartzbach, Michael I.
2011-01-01
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...... of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey the use of XML graphs for program analysis with four very different languages: XACT (XML in Java), Java Servlets (Web application programming), XSugar...
Graph Model Based Indoor Tracking
Jensen, Christian Søndergaard; Lu, Hua; Yang, Bin
2009-01-01
infrastructure for different symbolic positioning technologies, e.g., Bluetooth and RFID. More specifically, the paper proposes a model of indoor space that comprises a base graph and mappings that represent the topology of indoor space at different levels. The resulting model can be used for one or several...... indoor positioning technologies. Focusing on RFID-based positioning, an RFID specific reader deployment graph model is built from the base graph model. This model is then used in several algorithms for constructing and refining trajectories from raw RFID readings. Empirical studies with implementations...
Chordal Graphs are Fully Orientable
Lai, Hsin-Hao
2012-01-01
Suppose that D is an acyclic orientation of a graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let m and M denote the minimum and the maximum of the number of dependent arcs over all acyclic orientations of G. We call G fully orientable if G has an acyclic orientation with exactly d dependent arcs for every d satisfying m <= d <= M. A graph G is called chordal if every cycle in G of length at least four has a chord. We show that all chordal graphs are fully orientable.
Symmetry properties of subdivision graphs
Daneshkhah, Ashraf; Devillers, Alice; Praeger, Cheryl E.
2010-01-01
The subdivision graph $S(\\Sigma)$ of a graph $\\Sigma$ is obtained from $\\Sigma$ by `adding a vertex' in the middle of every edge of $\\Si$. Various symmetry properties of $\\S(\\Sigma)$ are studied. We prove that, for a connected graph $\\Sigma$, $S(\\Sigma)$ is locally $s$-arc transitive if and only if $\\Sigma$ is $\\lceil\\frac{s+1}{2}\\rceil$-arc transitive. The diameter of $S(\\Sigma)$ is $2d+\\delta$, where $\\Sigma$ has diameter $d$ and $0\\leqslant \\delta\\leqslant 2$, and local $s$-distance transi...
Recursive processing of cyclic graphs.
Bianchini, Monica; Gori, Marco; Sarti, Lorenzo; Scarselli, Franco
2006-01-01
Recursive neural networks are a powerful tool for processing structured data. According to the recursive learning paradigm, the input information consists of directed positional acyclic graphs (DPAGs). In fact, recursive networks are fed following the partial order defined by the links of the graph. Unfortunately, the hypothesis of processing DPAGs is sometimes too restrictive, being the nature of some real-world problems intrinsically cyclic. In this paper, a methodology is proposed, which allows us to process any cyclic directed graph. Therefore, the computational power of recursive networks is definitely established, also clarifying the underlying limitations of the model.
Cubature formulas on combinatorial graphs
Pesenson, Isaac Z
2011-01-01
Many contemporary applications, for example, cataloging of galaxies, document analysis, face recognition, learning theory, image processing, operate with a large amount of data which is often represented as a graph embedded into a high dimensional Euclidean space. The variety of problems arising in contemporary data processing requires development on graphs such topics of the classical harmonic analysis as Shannon sampling, splines, wavelets, cubature formulas. The goal of the paper is to establish cubature formulas on finite combinatorial graphs. The results have direct applications to problems that arise in connection with data filtering, data denoising and data dimension reduction.
On Dominator Colorings in Graphs
S Arumugam; Jay Bagga; K Raja Chandrasekar
2012-11-01
A dominator coloring of a graph is a proper coloring of in which every vertex dominates every vertex of at least one color class. The minimum number of colors required for a dominator coloring of is called the dominator chromatic number of and is denoted by $ d(G)$. In this paper we present several results on graphs with $ d(G)=(G)$ and $ d(G)=(G)$ where $(G)$ and $(G)$ denote respectively the chromatic number and the domination number of a graph . We also prove that if $(G)$ is the Mycielskian of , then $ d(G)+1≤ d((G))≤ d(G)+2$.
Multigraph: Reusable Interactive Data Graphs
Phillips, M. B.
2010-12-01
There are surprisingly few good software tools available for presenting time series data on the internet. The most common practice is to use a desktop program such as Excel or Matlab to save a graph as an image which can be included in a web page like any other image. This disconnects the graph from the data in a way that makes updating a graph with new data a cumbersome manual process, and it limits the user to one particular view of the data. The Multigraph project defines an XML format for describing interactive data graphs, and software tools for creating and rendering those graphs in web pages and other internet connected applications. Viewing a Multigraph graph is extremely simple and intuitive, and requires no instructions; the user can pan and zoom by clicking and dragging, in a familiar "Google Maps" kind of way. Creating a new graph for inclusion in a web page involves writing a simple XML configuration file. Multigraph can read data in a variety of formats, and can display data from a web service, allowing users to "surf" through large data sets, downloading only those the parts of the data that are needed for display. The Multigraph XML format, or "MUGL" for short, provides a concise description of the visual properties of a graph, such as axes, plot styles, data sources, labels, etc, as well as interactivity properties such as how and whether the user can pan or zoom along each axis. Multigraph reads a file in this format, draws the described graph, and allows the user to interact with it. Multigraph software currently includes a Flash application for embedding graphs in web pages, a Flex component for embedding graphs in larger Flex/Flash applications, and a plugin for creating graphs in the WordPress content management system. Plans for the future include a Java version for desktop viewing and editing, a command line version for batch and server side rendering, and possibly Android and iPhone versions. Multigraph is currently in use on several web
Three interactive scenes of The Crystal Cabinet
Unander-Scharin, Åsa
2010-01-01
The interactive scenes of The Crystal Cabinet (2008) constitute the first part in my choreographic research project exploring volatile bodies and multistable corporealities. This performance took the form of a dream play opera in twelve scenes including texts and images from William Blake’s (1757-1827) illuminated books. To create his books Blake invented a printing-machine with which he could print his handwritten poems and images. We transformed this idea into an interactive stage area wher...
Statistics of high-level scene context.
Greene, Michelle R
2013-01-01
CONTEXT IS CRITICAL FOR RECOGNIZING ENVIRONMENTS AND FOR SEARCHING FOR OBJECTS WITHIN THEM: contextual associations have been shown to modulate reaction time and object recognition accuracy, as well as influence the distribution of eye movements and patterns of brain activations. However, we have not yet systematically quantified the relationships between objects and their scene environments. Here I seek to fill this gap by providing descriptive statistics of object-scene relationships. A total of 48, 167 objects were hand-labeled in 3499 scenes using the LabelMe tool (Russell et al., 2008). From these data, I computed a variety of descriptive statistics at three different levels of analysis: the ensemble statistics that describe the density and spatial distribution of unnamed "things" in the scene; the bag of words level where scenes are described by the list of objects contained within them; and the structural level where the spatial distribution and relationships between the objects are measured. The utility of each level of description for scene categorization was assessed through the use of linear classifiers, and the plausibility of each level for modeling human scene categorization is discussed. Of the three levels, ensemble statistics were found to be the most informative (per feature), and also best explained human patterns of categorization errors. Although a bag of words classifier had similar performance to human observers, it had a markedly different pattern of errors. However, certain objects are more useful than others, and ceiling classification performance could be achieved using only the 64 most informative objects. As object location tends not to vary as a function of category, structural information provided little additional information. Additionally, these data provide valuable information on natural scene redundancy that can be exploited for machine vision, and can help the visual cognition community to design experiments guided by statistics
Gay and Lesbian Scene in Metelkova
Nataša Velikonja
2013-01-01
The article deals with the development of the gay and lesbian scene in ACC Metelkova, while specifying the preliminary aspects of establishing and building gay and lesbian activism associated with spatial issues. The struggle for space or occupying public space is vital for the gay and lesbian scene, as it provides not only the necessary socializing opportunities for gays and lesbians, but also does away with the historical hiding of homosexuality in the closet, in seclusion and silence. Beca...
Connection between Interception and Political Scene
2011-01-01
<正>Interception can shake Murdoch’s the News Corporation;can also make the president of a country quit the political scene;even can trigger a coup.There’s no exaggeration. Only knowing yourself as well as the enemy,then you can fight a hundred battles with no danger of defeat. But how can one know the enemy? Interception is the most powerful tool. It is doomed to have connection with political scene ever since its birth.
Statistics of High-level Scene Context
Michelle R. Greene
2013-10-01
Full Text Available Context is critical to our ability to recognize environments and to search for objects within them: contextual associations have been shown to modulate reaction time and object recognition accuracy, as well as influence the distribution of eye movements and patterns of brain activations. However, we have not yet systematically quantified the relationships between objects and their scene environments. Here I seek to fill this gap by providing descriptive statistics of object-scene relationships. A total of 48,167 objects were hand-labeled in 3499 scenes using the LabelMe tool (Russell, Torralba, Muphy & Freeman, 2008. From these data, I computed a variety of descriptive statistics at three different levels of analysis: the ensemble statistics that describe the density and spatial distribution of unnamed things in the scene; the bag of words level where scenes are described by the list of objects contained within them; and the structural level where the spatial distribution and relationships between the objects are measured. The utility of each level of description for scene categorization was assessed through the use of linear classifiers, and the plausibility of each level for modeling human rapid scene categorization is discussed. Ensemble statistics were found to be the most informative (per feature, and also best explained human patterns of categorization errors. Although a bag of words classifier had similar performance to human observers, it had a markedly different pattern of errors. Some objects are more useful than others, and ceiling classification performance could be achieved using only the 64 most informative objects. As object location tends not to vary as a function of category, structural information provided little additional information. Additionally, these data provide valuable information on natural scene redundancy that can be exploited for machine vision, and can help researchers in visual cognition design new data
Multi-Sensor Scene Synthesis and Analysis
1981-09-01
vol. 8, pp. 313-333, 1978. 34. C. R. Brice and C. L. Fennema , "Scene Analysis Using Regions," Artificial Intelligence, vol. 1, pp. 205-226, 1970. 35. D...Cliffs, NJ, 1972. 85. C. R. Brice and C. L. Fennema , "Scene Analysis Using Regions," Art. Intell., vol. 1, pp. 205-226, 1970. 86. S. K. Chang, N. Donato, J
Graph-based representation for multiview image geometry.
Maugey, Thomas; Ortega, Antonio; Frossard, Pascal
2015-05-01
In this paper, we propose a new geometry representation method for multiview image sets. Our approach relies on graphs to describe the multiview geometry information in a compact and controllable way. The links of the graph connect pixels in different images and describe the proximity between pixels in 3D space. These connections are dependent on the geometry of the scene and provide the right amount of information that is necessary for coding and reconstructing multiple views. Our multiview image representation is very compact and adapts the transmitted geometry information as a function of the complexity of the prediction performed at the decoder side. To achieve this, our graph-based representation (GBR) carefully selects the amount of geometry information needed before coding. This is in contrast with depth coding, which directly compresses with losses the original geometry signal, thus making it difficult to quantify the impact of coding errors on geometry-based interpolation. We present the principles of this GBR and we build an efficient coding algorithm to represent it. We compare our GBR approach to classical depth compression methods and compare their respective view synthesis qualities as a function of the compactness of the geometry description. We show that GBR can achieve significant gains in geometry coding rate over depth-based schemes operating at similar quality. Experimental results demonstrate the potential of this new representation.
Scene analysis in the natural environment.
Lewicki, Michael S; Olshausen, Bruno A; Surlykke, Annemarie; Moss, Cynthia F
2014-01-01
The problem of scene analysis has been studied in a number of different fields over the past decades. These studies have led to important insights into problems of scene analysis, but not all of these insights are widely appreciated, and there remain critical shortcomings in current approaches that hinder further progress. Here we take the view that scene analysis is a universal problem solved by all animals, and that we can gain new insight by studying the problems that animals face in complex natural environments. In particular, the jumping spider, songbird, echolocating bat, and electric fish, all exhibit behaviors that require robust solutions to scene analysis problems encountered in the natural environment. By examining the behaviors of these seemingly disparate animals, we emerge with a framework for studying scene analysis comprising four essential properties: (1) the ability to solve ill-posed problems, (2) the ability to integrate and store information across time and modality, (3) efficient recovery and representation of 3D scene structure, and (4) the use of optimal motor actions for acquiring information to progress toward behavioral goals.
The roles of scene priming and location priming in object-scene consistency effects.
Heise, Nils; Ansorge, Ulrich
2014-01-01
Presenting consistent objects in scenes facilitates object recognition as compared to inconsistent objects. Yet the mechanisms by which scenes influence object recognition are still not understood. According to one theory, consistent scenes facilitate visual search for objects at expected places. Here, we investigated two predictions following from this theory: If visual search is responsible for consistency effects, consistency effects could be weaker (1) with better-primed than less-primed object locations, and (2) with less-primed than better-primed scenes. In Experiments 1 and 2, locations of objects were varied within a scene to a different degree (one, two, or four possible locations). In addition, object-scene consistency was studied as a function of progressive numbers of repetitions of the backgrounds. Because repeating locations and backgrounds could facilitate visual search for objects, these repetitions might alter the object-scene consistency effect by lowering of location uncertainty. Although we find evidence for a significant consistency effect, we find no clear support for impacts of scene priming or location priming on the size of the consistency effect. Additionally, we find evidence that the consistency effect is dependent on the eccentricity of the target objects. These results point to only small influences of priming to object-scene consistency effects but all-in-all the findings can be reconciled with a visual-search explanation of the consistency effect.
Total Restrained Bondage in Graphs
Nader JAFARI RAD; Roslan HASNI; Joanna RACZEK; Lutz VOLKMANN
2013-01-01
A subset S of vertices of a graph G with no isolated vertex is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex in V(G)-S is also adjacent to a vertex in V(G)-S.The total restrained domination number of G is the minimum cardinality of a total restrained dominating set of G.In this paper we initiate the study of total restrained bondage in graphs.The total restrained bondage number in a graph G with no isolated vertex,is the minimum cardinality of a subset of edges E such that G-E has no isolated vertex and the total restrained domination number of G-E is greater than the total restrained domination number of G.We obtain several properties,exact values and bounds for the total restrained bondage number of a graph.
Digital Line Graph - Large Scale
U.S. Geological Survey, Department of the Interior — Digital line graph (DLG) data are digital representations of cartographic information. DLGs of map features are converted to digital form from maps and related...
Digital Line Graph - Large Scale
U.S. Geological Survey, Department of the Interior — Digital line graph (DLG) data are digital representations of cartographic information. DLGs of map features are converted to digital form from maps and related...
Hierarchical clustering for graph visualization
Clémençon, Stéphan; Rossi, Fabrice; Tran, Viet Chi
2012-01-01
This paper describes a graph visualization methodology based on hierarchical maximal modularity clustering, with interactive and significant coarsening and refining possibilities. An application of this method to HIV epidemic analysis in Cuba is outlined.
Chordal Graphs and Semidefinite Optimization
Vandenberghe, Lieven; Andersen, Martin Skovgaard
2015-01-01
in combinatorial optimization, linear algebra, statistics, signal processing, machine learning, and nonlinear optimization. This survey covers the theory and applications of chordal graphs, with an emphasis on algorithms developed in the literature on sparse Cholesky factorization. These algorithms are formulated......Chordal graphs play a central role in techniques for exploiting sparsity in large semidefinite optimization problems and in related con-vex optimization problems involving sparse positive semidefinite matrices. Chordal graph properties are also fundamental to several classical results...... as recursions on elimination trees, supernodal elimination trees, or clique trees associated with the graph. The best known example is the multifrontal Cholesky factorization algorithm, but similar algorithms can be formulated for a variety of related problems, including the computation of the partial inverse...
Baillie, C F; Kownacki, J P
1994-01-01
The Ising model on ``thin'' graphs (standard Feynman diagrams) displays several interesting properties. For ferromagnetic couplings there is a mean field phase transition at the corresponding Bethe lattice transition point. For antiferromagnetic couplings the replica trick gives some evidence for a spin glass phase. In this paper we investigate both the ferromagnetic and antiferromagnetic models with the aid of simulations. We confirm the Bethe lattice values of the critical points for the ferromagnetic model on \\phi^3 and \\phi^4 graphs and examine the putative spin glass phase in the antiferromagnetic model by looking at the overlap between replicas in a quenched ensemble of graphs. We also compare the Ising results with those for higher state Potts models and Ising models on ``fat'' graphs, such as those used in 2D gravity simulations.
Open Graphs and Computational Reasoning
Lucas Dixon
2010-06-01
Full Text Available We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end and enjoy rich compositional principles by connecting graphs along these half-edges. In particular, this allows equations and rewrite rules to be specified between graphs. Particular computational models can then be encoded as an axiomatic set of such rules. Further rules can be derived graphically and rewriting can be used to simulate the dynamics of a computational system, e.g. evaluating a program on an input. Examples of models which can be formalised in this way include traditional electronic circuits as well as recent categorical accounts of quantum information.
Tree decompositions and social graphs
Adcock, Aaron B; Mahoney, Michael W
2014-01-01
Recent work has established that large informatics graphs such as social and information networks have non-trivial tree-like structure when viewed at moderate size scales. Here, we present results from the first detailed empirical evaluation of the use of tree decomposition (TD) heuristics for structure identification and extraction in social graphs. Although TDs have historically been used in structural graph theory and scientific computing, we show that---even with existing TD heuristics developed for those very different areas---TD methods can identify interesting structure in a wide range of realistic informatics graphs. Among other things, we show that TD methods can identify structures that correlate strongly with the core-periphery structure of realistic networks, even when using simple greedy heuristics; we show that the peripheral bags of these TDs correlate well with low-conductance communities (when they exist) found using local spectral computations; and we show that several types of large-scale "...
Generating random networks and graphs
Coolen, Ton; Roberts, Ekaterina
2017-01-01
This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...
Exploration of Periodically Varying Graphs
Flocchini, Paola; Santoro, Nicola
2009-01-01
We study the computability and complexity of the exploration problem in a class of highly dynamic graphs: periodically varying (PV) graphs, where the edges exist only at some (unknown) times defined by the periodic movements of carriers. These graphs naturally model highly dynamic infrastructure-less networks such as public transports with fixed timetables, low earth orbiting (LEO) satellite systems, security guards' tours, etc. We establish necessary conditions for the problem to be solved. We also derive lower bounds on the amount of time required in general, as well as for the PV graphs defined by restricted classes of carriers movements: simple routes, and circular routes. We then prove that the limitations on computability and complexity we have established are indeed tight. In fact we prove that all necessary conditions are also sufficient and all lower bounds on costs are tight. We do so constructively presenting two worst case optimal solution algorithms, one for anonymous systems, and one for those w...
Connectivity threshold for Bluetooth graphs
Broutin, Nicolas; Fraiman, Nicolas; Lugosi, Gábor
2011-01-01
We study the connectivity properties of random Bluetooth graphs that model certain "ad hoc" wireless networks. The graphs are obtained as "irrigation subgraphs" of the well-known random geometric graph model. There are two parameters that control the model: the radius $r$ that determines the "visible neighbors" of each node and the number of edges $c$ that each node is allowed to send to these. The randomness comes from the underlying distribution of data points in space and from the choices of each vertex. We prove that no connectivity can take place with high probability for a range of parameters $r, c$ and completely characterize the connectivity threshold (in $c$) for values of $r$ close the critical value for connectivity in the underlying random geometric graph.
Rank of Stably Dissipative Graphs
Duarte, Pedro
2011-01-01
For the class of stably dissipative Lotka-Volterra systems we prove that the rank of its defining matrix, which is the dimension of the associated invariant foliation, is completely determined by the system's graph.
Special Issue on Graph Algorithms
2013-01-01
This special issue of Algorithms is devoted to the design and analysis of algorithms for solving combinatorial problems of a theoretical or practical nature involving graphs, with a focus on computational complexity.
Graph Model Based Indoor Tracking
Jensen, Christian Søndergaard; Lu, Hua; Yang, Bin
2009-01-01
The tracking of the locations of moving objects in large indoor spaces is important, as it enables a range of applications related to, e.g., security and indoor navigation and guidance. This paper presents a graph model based approach to indoor tracking that offers a uniform data management...... infrastructure for different symbolic positioning technologies, e.g., Bluetooth and RFID. More specifically, the paper proposes a model of indoor space that comprises a base graph and mappings that represent the topology of indoor space at different levels. The resulting model can be used for one or several...... indoor positioning technologies. Focusing on RFID-based positioning, an RFID specific reader deployment graph model is built from the base graph model. This model is then used in several algorithms for constructing and refining trajectories from raw RFID readings. Empirical studies with implementations...
Algorithms for Comparing Pedigree Graphs
Kirkpatrick, Bonnie; Finucane, Hilary; Jiang, Haitao; Zhu, Binhai; Karp, Richard M
2010-01-01
Pedigree graphs, which represent family relationships, are often constructed by collecting data from genealogical records to determine which pairs of people are parent and child. This process is expensive, and small mistakes in data collection--for example, one missing parent-child relationship--can cause large differences in the pedigree graphs created. In this paper, we introduce a simple pedigree definition based on a different type of data which is potentially easier to collect. This alternative characterization of a pedigree that describes a pedigree as a list of the descendants of each individual, rather than a list of parent-child relationships. We then introduce an algorithm that generates the pedigree graph from this list of descendants. We also consider the problem of comparing two pedigree graphs, which could be useful to evaluate the differences between pedigrees constructed via different methods. Specifically, this could be useful to evaluate pedigree reconstruction methods. We define the edit di...
Some Graphs Containing Unique Hamiltonian Cycles
Lynch, Mark A. M.
2002-01-01
In this paper, two classes of graphs of arbitrary order are described which contain unique Hamiltonian cycles. All the graphs have mean vertex degree greater than one quarter the order of the graph. The Hamiltonian cycles are detailed, their uniqueness proved and simple rules for the construction of the adjacency matrix of the graphs are given.…
Constructing Dense Graphs with Unique Hamiltonian Cycles
Lynch, Mark A. M.
2012-01-01
It is not difficult to construct dense graphs containing Hamiltonian cycles, but it is difficult to generate dense graphs that are guaranteed to contain a unique Hamiltonian cycle. This article presents an algorithm for generating arbitrarily large simple graphs containing "unique" Hamiltonian cycles. These graphs can be turned into dense graphs…
Hard graphs for the maximum clique problem
Hoede, Cornelis
1988-01-01
The maximum clique problem is one of the NP-complete problems. There are graphs for which a reduction technique exists that transforms the problem for these graphs into one for graphs with specific properties in polynomial time. The resulting graphs do not grow exponentially in order and number. Gra
Generalized wreath products of graphs and groups
Donno, Alfredo
2013-01-01
Inspired by the definition of generalized wreath product of permutation groups, we define the generalized wreath product of graphs, containing the classical Cartesian and wreath product of graphs as particular cases. We prove that the generalized wreath product of Cayley graphs of finite groups is the Cayley graph of the generalized wreath product of the corresponding groups.
Graphs whose complement and square are isomorphic
Milanic, M.; Pedersen, Anders Sune; Pellicer, D.;
2014-01-01
We study square-complementary graphs, that is, graphs whose complement and square are isomorphic. We prove several necessary conditions for a graph to be square-complementary, describe ways of building new square-complementary graphs from existing ones, construct infinite families of square...
Subgraph conditions for Hamiltonian properties of graphs
Li, Binlong; Li, Binlong
2012-01-01
The research that forms the basis of this thesis addresses the following general structural questions in graph theory: which fixed graph of pair of graphs do we have to forbid as an induced subgraph of an arbitrary graph G to guarantee that G has a nice structure? In this thesis the nice structural
Chain graph models and their causal interpretations
Lauritzen, Steffen Lilholt; Richardson, Thomas S.
2002-01-01
Chain graphs are a natural generalization of directed acyclic graphs and undirected graphs. However, the apparent simplicity of chain graphs belies the subtlety of the conditional independence hypotheses that they represent. There are many simple and apparently plausible, but ultimately fallaciou...
Saund, Eric
2013-10-01
Effective object and scene classification and indexing depend on extraction of informative image features. This paper shows how large families of complex image features in the form of subgraphs can be built out of simpler ones through construction of a graph lattice—a hierarchy of related subgraphs linked in a lattice. Robustness is achieved by matching many overlapping and redundant subgraphs, which allows the use of inexpensive exact graph matching, instead of relying on expensive error-tolerant graph matching to a minimal set of ideal model graphs. Efficiency in exact matching is gained by exploitation of the graph lattice data structure. Additionally, the graph lattice enables methods for adaptively growing a feature space of subgraphs tailored to observed data. We develop the approach in the domain of rectilinear line art, specifically for the practical problem of document forms recognition. We are especially interested in methods that require only one or very few labeled training examples per category. We demonstrate two approaches to using the subgraph features for this purpose. Using a bag-of-words feature vector we achieve essentially single-instance learning on a benchmark forms database, following an unsupervised clustering stage. Further performance gains are achieved on a more difficult dataset using a feature voting method and feature selection procedure.
CUDA Enabled Graph Subset Examiner
2016-12-22
Finding Godsil-McKay switching sets in graphs is one way to demonstrate that a specific graph is not determined by its spectrum--the eigenvalues of its adjacency matrix. An important area of active research in pure mathematics is determining which graphs are determined by their spectra, i.e. when the spectrum of the adjacency matrix uniquely determines the underlying graph. We are interested in exploring the spectra of graphs in the Johnson scheme and specifically seek to determine which of these graphs are determined by their spectra. Given a graph G, a Godsil-McKay switching set is an induced subgraph H on 2k vertices with the following properties: I) H is regular, ii) every vertex in G/H is adjacent to either 0, k, or 2k vertices of H, and iii) at least one vertex in G/H is adjacent to k vertices in H. The software package examines each subset of a user specified size to determine whether or not it satisfies those 3 conditions. The software makes use of the massive parallel processing power of CUDA enabled GPUs. It also exploits the vertex transitivity of graphs in the Johnson scheme by reasoning that if G has a Godsil-McKay switching set, then it has a switching set which includes vertex 1. While the code (in its current state) is tuned to this specific problem, the method of examining each induced subgraph of G can be easily re-written to check for any user specified conditions on the subgraphs and can therefore be used much more broadly.
Localized endomorphisms of graph algebras
Conti, Roberto; Szymanski, Wojciech
2011-01-01
Endomorphisms of graph C*-algebras are investigated. A combinatorial approach to analysis of permutative endomorphisms is developed. Then invertibility criteria for localized endomorphisms are given. Furthermore, proper endomorphisms which restrict to automorphisms of the canonical diagonal MASA are analyzed. The Weyl group and the restricted Weyl group of a graph C*-algebra are introduced and investigated. Criteria of outerness for automorphisms in the restricted Weyl group are found.
Fundamental cycles and graph embeddings
2009-01-01
In this paper, we investigate fundamental cycles in a graph G and their relations with graph embeddings. We show that a graph G may be embedded in an orientable surface with genus at least g if and only if for any spanning tree T , there exists a sequence of fundamental cycles C1, C2, . . . , C2g with C2i-1 ∩ C2i≠ф for 1≤ i ≤g. In particular, among β(G) fundamental cycles of any spanning tree T of a graph G, there are exactly 2γM (G) cycles C1, C2, . . . , C2γM (G) such that C2i-1 ∩ C2i≠ф for 1 ≤i≤γM (G), where β(G) and γM (G) are the Betti number and the maximum genus of G, respectively. This implies that it is possible to construct an orientable embedding with large genus of a graph G from an arbitrary spanning tree T (which may have very large number of odd components in G\\E(T )). This is different from the earlier work of Xuong and Liu, where spanning trees with small odd components are needed. In fact, this makes a common generalization of Xuong, Liu and Fu et al. Furthermore, we show that (1) this result is useful for locating the maximum genus of a graph having a specific edge-cut. Some known results for embedded graphs are also concluded; (2) the maximum genus problem may be reduced to the maximum matching problem. Based on this result and the algorithm of Micali-Vazirani, we present a new efficient algorithm to determine the maximum genus of a graph in O((β(G)) 25 ) steps. Our method is straight and quite different from the algorithm of Furst, Gross and McGeoch which depends on a result of Giles where matroid parity method is needed.
Cycle-maximal triangle-free graphs
Durocher, Stephane; Gunderson, David S.; Li, Pak Ching
2015-01-01
Abstract We conjecture that the balanced complete bipartite graph K ⌊ n / 2 ⌋ , ⌈ n / 2 ⌉ contains more cycles than any other n -vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds...... on the numbers of cycles in graphs depending on numbers of vertices and edges, girth, and homomorphisms to small fixed graphs; and use the bounds to show that among regular graphs, the conjecture holds. We also consider graphs that are close to being regular, with the minimum and maximum degrees differing...
The Rank of Integral Circulant Graphs
ZHOU Hou-qing
2014-01-01
A graph is called an integral graph if it has an integral spectrum i.e., all eigen-values are integers. A graph is called circulant graph if it is Cayley graph on the circulant group, i.e., its adjacency matrix is circulant. The rank of a graph is defined to be the rank of its adjacency matrix. This importance of the rank, due to applications in physics, chemistry and combinatorics. In this paper, using Ramanujan sums, we study the rank of integral circulant graphs and gave some simple computational formulas for the rank and provide an example which shows the formula is sharp.
Color Energy Of A Unitary Cayley Graph
Adiga Chandrashekar
2014-11-01
Full Text Available Let G be a vertex colored graph. The minimum number χ(G of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al. [1] have introduced the concept of color energy of a graph Ec(G and computed the color energy of few families of graphs with χ(G colors. In this paper we derive explicit formulas for the color energies of the unitary Cayley graph Xn, the complement of the colored unitary Cayley graph (Xnc and some gcd-graphs.
Weak Total Resolvability In Graphs
Casel Katrin
2016-02-01
Full Text Available A vertex v ∈ V (G is said to distinguish two vertices x, y ∈ V (G of a graph G if the distance from v to x is di erent from the distance from v to y. A set W ⊆ V (G is a total resolving set for a graph G if for every pair of vertices x, y ∈ V (G, there exists some vertex w ∈ W − {x, y} which distinguishes x and y, while W is a weak total resolving set if for every x ∈ V (G−W and y ∈ W, there exists some w ∈ W −{y} which distinguishes x and y. A weak total resolving set of minimum cardinality is called a weak total metric basis of G and its cardinality the weak total metric dimension of G. Our main contributions are the following ones: (a Graphs with small and large weak total metric bases are characterised. (b We explore the (tight relation to independent 2-domination. (c We introduce a new graph parameter, called weak total adjacency dimension and present results that are analogous to those presented for weak total dimension. (d For trees, we derive a characterisation of the weak total (adjacency metric dimension. Also, exact figures for our parameters are presented for (generalised fans and wheels. (e We show that for Cartesian product graphs, the weak total (adjacency metric dimension is usually pretty small. (f The weak total (adjacency dimension is studied for lexicographic products of graphs.
Graph Signatures for Visual Analytics
Wong, Pak C.; Foote, Harlan P.; Chin, George; Mackey, Patrick S.; Perrine, Kenneth A.
2006-11-17
We present a visual analytics technique to explore graphs using the concept of a data signature. A data signature, in our context, is a multidimensional vector that captures the local topology information surrounding each graph node. Signature vectors extracted from a graph are projected onto a low-dimensional scatterplot through the use of scaling. The resultant scatterplot, which reflects the similarities of the vectors, allows analysts to examine the graph structures and their corresponding real-life interpretations through repeated use of brushing and linking between the two visualizations. The interpretation of the graph structures is based on the outcomes of multiple participatory analysis sessions with intelligence analysts conducted by the authors at the Pacific Northwest National Laboratory. The paper first uses three public domain datasets with either well-known or obvious features to explain the rationale of our design and illustrate its results. More advanced examples are then used in a customized usability study to evaluate the effectiveness and efficiency of our approach. The study results reveal not only the limitations and weaknesses of the traditional approach based solely on graph visualization but also the advantages and strengths of our signature-guided approach presented in the paper.
Information Spreading in Dynamic Graphs
Clementi, Andrea; Trevisan, Luca
2011-01-01
We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary converging Markovian dynamic graph process, that is, processes in which the topology of the graph at time $t$ depends only on its topology at time $t-1$ and which have a unique stationary distribution. The most well studied models of dynamic graphs are all Markovian and converging. Under general conditions, we bound the flooding time in terms of the mixing time of the dynamic graph process. We recover, as special cases of our result, bounds on the flooding time for the \\emph{random trip} model and the \\emph{random path} models; previous analysis techniques provided bounds only in restricted settings for such models. Our result also provides the first bound for the \\emph{random waypoint} model (which is tight for certain ranges of parameters) whose analysis had been an important open question.
Chromatic polynomials of random graphs
Van Bussel, Frank; Ehrlich, Christoph; Fliegner, Denny; Stolzenberg, Sebastian; Timme, Marc
2010-04-01
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.
Nilanjan De
2014-01-01
Full Text Available The connective eccentric index of a graph is a topological index involving degrees and eccentricities of vertices of the graph. In this paper, we have studied the connective eccentric index for double graph and double cover. Also we give the connective eccentric index for some graph operations such as joins, symmetric difference, disjunction, and splice of graphs.
On P-transitive graphs and applications
Giacomo Lenzi
2011-06-01
Full Text Available We introduce a new class of graphs which we call P-transitive graphs, lying between transitive and 3-transitive graphs. First we show that the analogue of de Jongh-Sambin Theorem is false for wellfounded P-transitive graphs; then we show that the mu-calculus fixpoint hierarchy is infinite for P-transitive graphs. Both results contrast with the case of transitive graphs. We give also an undecidability result for an enriched mu-calculus on P-transitive graphs. Finally, we consider a polynomial time reduction from the model checking problem on arbitrary graphs to the model checking problem on P-transitive graphs. All these results carry over to 3-transitive graphs.
Ullas Thomas
2015-07-01
Full Text Available This paper contains certain properties of set-magic graphs and obtained the set-magic number of certain classes of graphs. All spanning super graphs of a set-magic graph always set-magic and all cycles and Hamiltonian graphs are set-magic. Also set-magic number of any cycle of size 2n is always greater than n.
The Clique Problem in Ray Intersection Graphs
Cabello, Sergio; Langerman, Stefan
2011-01-01
Ray intersection graphs are intersection graphs of rays, or halflines, in the plane. We show that any planar graph has an even subdivision whose complement is a ray intersection graph. The construction can be done in polynomial time and implies that finding a maximum clique in a segment intersection graph is NP-hard. This solves a 21-year old open problem posed by Kratochv\\'il and Ne\\v{s}et\\v{r}il.
PRIVATE GRAPHS – ACCESS RIGHTS ON GRAPHS FOR SEAMLESS NAVIGATION
W. Dorner
2016-06-01
Full Text Available After the success of GNSS (Global Navigational Satellite Systems and navigation services for public streets, indoor seems to be the next big development in navigational services, relying on RTLS – Real Time Locating Services (e.g. WIFI and allowing seamless navigation. In contrast to navigation and routing services on public streets, seamless navigation will cause an additional challenge: how to make routing data accessible to defined users or restrict access rights for defined areas or only to parts of the graph to a defined user group? The paper will present case studies and data from literature, where seamless and especially indoor navigation solutions are presented (hospitals, industrial complexes, building sites, but the problem of restricted access rights was only touched from a real world, but not a technical perspective. The analysis of case studies will show, that the objective of navigation and the different target groups for navigation solutions will demand well defined access rights and require solutions, how to make only parts of a graph to a user or application available to solve a navigational task. The paper will therefore introduce the concept of private graphs, which is defined as a graph for navigational purposes covering the street, road or floor network of an area behind a public street and suggest different approaches how to make graph data for navigational purposes available considering access rights and data protection, privacy and security issues as well.
Private Graphs - Access Rights on Graphs for Seamless Navigation
Dorner, W.; Hau, F.; Pagany, R.
2016-06-01
After the success of GNSS (Global Navigational Satellite Systems) and navigation services for public streets, indoor seems to be the next big development in navigational services, relying on RTLS - Real Time Locating Services (e.g. WIFI) and allowing seamless navigation. In contrast to navigation and routing services on public streets, seamless navigation will cause an additional challenge: how to make routing data accessible to defined users or restrict access rights for defined areas or only to parts of the graph to a defined user group? The paper will present case studies and data from literature, where seamless and especially indoor navigation solutions are presented (hospitals, industrial complexes, building sites), but the problem of restricted access rights was only touched from a real world, but not a technical perspective. The analysis of case studies will show, that the objective of navigation and the different target groups for navigation solutions will demand well defined access rights and require solutions, how to make only parts of a graph to a user or application available to solve a navigational task. The paper will therefore introduce the concept of private graphs, which is defined as a graph for navigational purposes covering the street, road or floor network of an area behind a public street and suggest different approaches how to make graph data for navigational purposes available considering access rights and data protection, privacy and security issues as well.
Complexity of Cocktail Party Graph and Crown Graph
S. N. Daoud
2012-01-01
Full Text Available Problem statement: The number of spanning trees τ(G in graphs (networks was an important invariant. Approach: Using the properties of the Chebyshev polynomials of the second kind and the linear algebra techniques to evaluate the associated determinants. Results: The complexity, number of spanning trees, of the cocktail party graph on 2n vertices, given in detail in the text was proved. Also the complexity of the crown graph on 2n vertices was shown to had the value nn-2 (n-1 (n-2n-1. Conclusion: The number of spanning trees τ(G in graphs (networks is an important invariant. The evaluation of this number and analyzing its behavior is not only interesting from a mathematical (computational perspective, but also, it is an important measure of reliability of a network and designing electrical circuits. Some computationally hard problems such as the travelling salesman problem can be solved approximately by using spanning trees. Due to the high dependence of the network design and reliability on the graph theory we introduced the above important theorems and lemmas and their proofs.
From the Coxeter graph to the Klein graph
Dejter, Italo J
2010-01-01
We show that the 56-vertex Klein cubic graph $\\G'=F_{056}B$ (so denoted in the Foster census) can be obtained from the 28-vertex Coxeter graph $\\G=F_{028}A$ by 'zipping' adequately the squares of the 24 7-cycles of $\\G$ endowed with an orientation obtained by considering $\\G$ as a $\\mathcal C$-ultrahomogeneous digraph, where $\\mathcal C$ is the set of oriented 7-cycles $\\vec{C}_7$ and $2$-paths $\\vec{P}_3$, that tightly fasten those $\\vec{C}_7$ in $\\G$. In the process, it is seen that $\\G'$ is a ${\\mathcal C}'$-ultrahomogeneous graph, where ${\\mathcal C}'$ is the set of 7-cycles $C_7$ and $1$-paths $P_2$, that tightly fasten those $C_7$ in $\\G'$; this yields an embedding of $\\G'$ into a 3-torus $T_3$, which forms the Klein map of Coxeter notation $(7,3)_8$. The dual graph of $\\G'$ in $T_3$ is the distance regular Klein quartic graph, with corresponding dual map of Coxeter notation $(3,7)_8$.
GraphMeta: Managing HPC Rich Metadata in Graphs
Dai, Dong; Chen, Yong; Carns, Philip; Jenkins, John; Zhang, Wei; Ross, Robert
2016-01-01
High-performance computing (HPC) systems face increasingly critical metadata management challenges, especially in the approaching exascale era. These challenges arise not only from exploding metadata volumes, but also from increasingly diverse metadata, which contains data provenance and arbitrary user-defined attributes in addition to traditional POSIX metadata. This ‘rich’ metadata is becoming critical to supporting advanced data management functionality such as data auditing and validation. In our prior work, we identified a graph-based model as a promising solution to uniformly manage HPC rich metadata due to its flexibility and generality. However, at the same time, graph-based HPC rich metadata anagement also introduces significant challenges to the underlying infrastructure. In this study, we first identify the challenges on the underlying infrastructure to support scalable, high-performance rich metadata management. Based on that, we introduce GraphMeta, a graphbased engine designed for this use case. It achieves performance scalability by introducing a new graph partitioning algorithm and a write-optimal storage engine. We evaluate GraphMeta under both synthetic and real HPC metadata workloads, compare it with other approaches, and demonstrate its advantages in terms of efficiency and usability for rich metadata management in HPC systems.
Subvoxel accurate graph search using non-Euclidean graph space.
Michael D Abràmoff
Full Text Available Graph search is attractive for the quantitative analysis of volumetric medical images, and especially for layered tissues, because it allows globally optimal solutions in low-order polynomial time. However, because nodes of graphs typically encode evenly distributed voxels of the volume with arcs connecting orthogonally sampled voxels in Euclidean space, segmentation cannot achieve greater precision than a single unit, i.e. the distance between two adjoining nodes, and partial volume effects are ignored. We generalize the graph to non-Euclidean space by allowing non-equidistant spacing between nodes, so that subvoxel accurate segmentation is achievable. Because the number of nodes and edges in the graph remains the same, running time and memory use are similar, while all the advantages of graph search, including global optimality and computational efficiency, are retained. A deformation field calculated from the volume data adaptively changes regional node density so that node density varies with the inverse of the expected cost. We validated our approach using optical coherence tomography (OCT images of the retina and 3-D MR of the arterial wall, and achieved statistically significant increased accuracy. Our approach allows improved accuracy in volume data acquired with the same hardware, and also, preserved accuracy with lower resolution, more cost-effective, image acquisition equipment. The method is not limited to any specific imaging modality and readily extensible to higher dimensions.
Roman domination in Cartesian product graphs and strong product graphs
Yero, Ismael G
2011-01-01
A set $S$ of vertices of a graph $G$ is a dominating set for $G$ if every vertex outside of $S$ is adjacent to at least one vertex belonging to $S$. The minimum cardinality of a dominating set for $G$ is called the domination number of $G$. A map $f : V \\rightarrow \\{0, 1, 2\\}$ is a Roman dominating function on a graph $G$ if for every vertex $v$ with $f(v) = 0$, there exists a vertex $u$, adjacent to $v$, such that $f(u) = 2$. The weight of a Roman dominating function is given by $f(V) =\\sum_{u\\in V}f(u)$. The minimum weight of a Roman dominating function on $G$ is called the Roman domination number of $G$. In this article we study the Roman domination number of Cartesian product graphs and strong product graphs. More precisely, we study the relationships between the Roman domination number of product graphs and the (Roman) domination number of the factors.
Deterministic Multithreaded Scheduling Based on Long Parallel Distance Priority%基于长并行距离优先的确定性多线程调度
马超; 尹杰; 江凌波; 甄凯
2012-01-01
随着多核技术的不断发展,多线程技术更加广泛地应用于计算机软件中.但由于执行的不确定性,多线程程序的排错和调试存在着很大的困难.确定性多线程系统可以使多线程程序以确定的方式执行,即多次执行同一个多线程程序的顺序和结果是相同的,这可以大大简化多线程程序的排错和调试.但是,确定性多线程系统会导致多线程程序性能的下降.本文提出一种基于长并行距离优先的确定性多线程调度算法,优先执行并行距离长的线程,减少线程总体等待时间,从而提高多线程程序的效率.实验结果表明,本文方法可以使多线程程序的性能提升10％,并且具有很好的可扩展性.%With the development of the multi-core technique, multithread programming is widely used in the computer software. Because of non-determinism, it is difficult to debug and test multithreaded programs. Deterministic multithreaded systems make a multithreaded program executed in determinate order and hence present the same result at all time, which is of great benefit to debug and test multithreaded programs. However, deterministic multithreaded systems cause performance decrease severely. This paper presents a novel scheduling method for deterministic multithreaded systems based on long parallel distance priority. This approach always chooses the thread that need to execute the longest parallel codes to be scheduled, and thus the total waiting time of all the threads is reduced. Evaluation shows that the performance is improved by 10% and our approach has high scalability.
Wyżga, Bartłomiej; Mikuś, Paweł; Zawiejska, Joanna; Ruiz-Villanueva, Virginia; Kaczka, Ryszard J.; Czech, Wiktoria
2017-02-01
Distance of large wood transport during floods and conditions for wood deposition in wide mountain rivers are still insufficiently understood. Tracking of logs tagged with radio transmitters was used to investigate differences in depositional conditions and the length of log displacement during a 20-year flood between channel reaches of different morphology in the Czarny Dunajec River, Polish Carpathians. During the rising limb of the flood, logs were placed into the river at three locations: at the beginning of an incised reach, close to the beginning of a channelized reach, and 1 km upstream from the beginning of a wide, multithread reach. The incised, channelized, and multithread reaches retained 12.5%, 33%, and 94% of tagged logs introduced to these reaches, respectively, and of the logs retained in the multithread reach, all were deposited in its upstream half. Significant differences in the length of displacement existed between the logs delivered to the river at the three locations, with logs placed into the river at the beginning of the incised reach moving the longest distance, and those delivered just upstream from the multithread reach moving the shortest distance before deposition. One-fourth of the logs were deposited in a low-flow channel or on a channel margin, one-fifth on the floodplain, and more than half on gravel bars. After the flood, river cross sections with deposited logs and a set of cross sections without any wood deposits were surveyed to collect data for one-dimensional modelling of hydraulic conditions at the flood peak. The cross sections with deposited logs were typified by significantly greater flow width and flow area and by significantly smaller mean flow depth, mean velocity, Froude number, mean bed shear stress, and unit stream power. Principal component analysis of the hydraulic parameters in the analysed cross sections grouped the two types of cross sections in distinct clusters, indicating that multithread cross sections
Exploiting spatial descriptions in visual scene analysis.
Ziegler, Leon; Johannsen, Katrin; Swadzba, Agnes; De Ruiter, Jan P; Wachsmuth, Sven
2012-08-01
The reliable automatic visual recognition of indoor scenes with complex object constellations using only sensor data is a nontrivial problem. In order to improve the construction of an accurate semantic 3D model of an indoor scene, we exploit human-produced verbal descriptions of the relative location of pairs of objects. This requires the ability to deal with different spatial reference frames (RF) that humans use interchangeably. In German, both the intrinsic and relative RF are used frequently, which often leads to ambiguities in referential communication. We assume that there are certain regularities that help in specific contexts. In a first experiment, we investigated how speakers of German describe spatial relationships between different pieces of furniture. This gave us important information about the distribution of the RFs used for furniture-predicate combinations, and by implication also about the preferred spatial predicate. The results of this experiment are compiled into a computational model that extracts partial orderings of spatial arrangements between furniture items from verbal descriptions. In the implemented system, the visual scene is initially scanned by a 3D camera system. From the 3D point cloud, we extract point clusters that suggest the presence of certain furniture objects. We then integrate the partial orderings extracted from the verbal utterances incrementally and cumulatively with the estimated probabilities about the identity and location of objects in the scene, and also estimate the probable orientation of the objects. This allows the system to significantly improve both the accuracy and richness of its visual scene representation.
Maxwellian Eye Fixation during Natural Scene Perception
Jean Duchesne
2012-01-01
Full Text Available When we explore a visual scene, our eyes make saccades to jump rapidly from one area to another and fixate regions of interest to extract useful information. While the role of fixation eye movements in vision has been widely studied, their random nature has been a hitherto neglected issue. Here we conducted two experiments to examine the Maxwellian nature of eye movements during fixation. In Experiment 1, eight participants were asked to perform free viewing of natural scenes displayed on a computer screen while their eye movements were recorded. For each participant, the probability density function (PDF of eye movement amplitude during fixation obeyed the law established by Maxwell for describing molecule velocity in gas. Only the mean amplitude of eye movements varied with expertise, which was lower in experts than novice participants. In Experiment 2, two participants underwent fixed time, free viewing of natural scenes and of their scrambled version while their eye movements were recorded. Again, the PDF of eye movement amplitude during fixation obeyed Maxwell’s law for each participant and for each scene condition (normal or scrambled. The results suggest that eye fixation during natural scene perception describes a random motion regardless of top-down or of bottom-up processes.
Scene analysis in the natural environment
Michael S Lewicki
2014-04-01
Full Text Available The problem of scene analysis has been studied in a number of different fields over the past decades. These studies have led to a number of important insights into problems of scene analysis, but not all of these insights are widely appreciated. Despite this progress, there are also critical shortcomings in current approaches that hinder further progress. Here we take the view that scene analysis is a universal problem solved by all animals, and that we can gain new insight by studying the problems that animals face in complex natural environments. In particular, the jumping spider, songbird, echolocating bat, and electric fish, all exhibit behaviors that require robust solutions to scene analysis problems encountered in the natural environment. By examining the behaviors of these seemingly disparate animals, we emerge with a framework for studying analysis comprising four essential properties: 1 the ability to solve ill-posed problems, 2 the ability to integrate and store information across time and modality, 3 efficient recovery and representation of 3D scene structure, and 4 the use of optimal motor actions for acquiring information to progress towards behavioral goals.
Visual scene perception in navigating wood ants.
Lent, David D; Graham, Paul; Collett, Thomas S
2013-04-22
Ants, like honeybees, can set their travel direction along foraging routes using just the surrounding visual panorama. This ability gives us a way to explore how visual scenes are perceived. By training wood ants to follow a path in an artificial scene and then examining their path within transformed scenes, we identify several perceptual operations that contribute to the ants' choice of direction. The first is a novel extension to the known ability of insects to compute the "center of mass" of large shapes: ants learn a desired heading toward a point on a distant shape as the proportion of the shape that lies to the left and right of the aiming point--the 'fractional position of mass' (FPM). The second operation, the extraction of local visual features like oriented edges, is familiar from studies of shape perception. Ants may use such features for guidance by keeping them in desired retinal locations. Third, ants exhibit segmentation. They compute the learned FPM over the whole of a simple scene, but over a segmented region of a complex scene. We suggest how the three operations may combine to provide efficient directional guidance. Copyright © 2013 Elsevier Ltd. All rights reserved.
The anatomy of the crime scene
Sandvik, Kjetil
2010-01-01
Crime scenes are constituted by a combination of a plot and a place. The crime scene is a place which has been in a certain state of transformation at a certain moment in time, the moment at which the place constituted the scene for some kind of criminal activity. As such the place has been encod...... scene is conducted by investigators (crime scene coordinators) who's task it is to decide how the investigation should be carried out and which is best described as a narrative practice; a systematic - and expertise based - work of imagination...... are signs to be read and interpreted. Thus the place carries a plot (a narrative) which at first is hidden and scattered and has to be revealed and pieced together through a process of investigation and exploration with the aid of different forensic methods, eyewitnesses and so on; - through reading...... this reconstructed place the story itself is also reconstructed: the crime is being solved, the murderer revealed. An important element in this narrative and performative practise is the use of simulation as a storytelling device. Simulation is a well-known method in investigation of crime...
Moving through a multiplex holographic scene
Mrongovius, Martina
2013-02-01
This paper explores how movement can be used as a compositional element in installations of multiplex holograms. My holographic images are created from montages of hand-held video and photo-sequences. These spatially dynamic compositions are visually complex but anchored to landmarks and hints of the capturing process - such as the appearance of the photographer's shadow - to establish a sense of connection to the holographic scene. Moving around in front of the hologram, the viewer animates the holographic scene. A perception of motion then results from the viewer's bodily awareness of physical motion and the visual reading of dynamics within the scene or movement of perspective through a virtual suggestion of space. By linking and transforming the physical motion of the viewer with the visual animation, the viewer's bodily awareness - including proprioception, balance and orientation - play into the holographic composition. How multiplex holography can be a tool for exploring coupled, cross-referenced and transformed perceptions of movement is demonstrated with a number of holographic image installations. Through this process I expanded my creative composition practice to consider how dynamic and spatial scenes can be conveyed through the fragmented view of a multiplex hologram. This body of work was developed through an installation art practice and was the basis of my recently completed doctoral thesis: 'The Emergent Holographic Scene — compositions of movement and affect using multiplex holographic images'.
Kirchoff Index of Graphs and some Graph Operations
A Nikseresht; Z Sepasdar; M H Shirdareh-Haghighi
2014-08-01
Let be a rooted tree, a connected graph, $x,y\\in V(G)$ be fixed and $G_i$’s be $|V(T)|$ disjoint copies of with $x_i$ and $y_i$ denoting the corresponding copies of and in $G_i$, respectively. We define the -repetition of to be the graph obtained by joining $y_i$ to $x_j$ for each $i\\in V(T)$ and each child of . In this paper, we compute the Kirchhoff index of the -repetition of in terms of parameters of and . Also we study how $Kf(G)$ behaves under some graph operations such as joining vertices or subdividing edges.
The monadic second-order logic of graphs XVI : Canonical graph
decompositions
Courcelle, Bruno
2005-01-01
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more general result covering canonical graph decompositions like the modular decomposition and the Tutte decomposition of 2-connected graphs into 3-connected components. As an application, we prove that the set of graphs having the same cycle matroid as a given 2-connected graph can be defined from this graph by Monadic Se...
Improving semantic scene understanding using prior information
Laddha, Ankit; Hebert, Martial
2016-05-01
Perception for ground robot mobility requires automatic generation of descriptions of the robot's surroundings from sensor input (cameras, LADARs, etc.). Effective techniques for scene understanding have been developed, but they are generally purely bottom-up in that they rely entirely on classifying features from the input data based on learned models. In fact, perception systems for ground robots have a lot of information at their disposal from knowledge about the domain and the task. For example, a robot in urban environments might have access to approximate maps that can guide the scene interpretation process. In this paper, we explore practical ways to combine such prior information with state of the art scene understanding approaches.
The competition numbers of ternary Hamming graphs
Park, Boram
2010-01-01
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x,v) and (y,v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number k(G) of a graph G is defined to be the smallest number of such isolated vertices. In general, it is hard to compute the competition number k(G) for a graph G and it has been one of important research problems in the study of competition graphs to characterize a graph by its competition number. In this paper, we give the exact values of the competition numbers of ternary Hamming graphs.
Andreas P. Braun
2016-04-01
Full Text Available Box graphs succinctly and comprehensively characterize singular fibers of elliptic fibrations in codimension two and three, as well as flop transitions connecting these, in terms of representation theoretic data. We develop a framework that provides a systematic map between a box graph and a crepant algebraic resolution of the singular elliptic fibration, thus allowing an explicit construction of the fibers from a singular Weierstrass or Tate model. The key tool is what we call a fiber face diagram, which shows the relevant information of a (partial toric triangulation and allows the inclusion of more general algebraic blowups. We shown that each such diagram defines a sequence of weighted algebraic blowups, thus providing a realization of the fiber defined by the box graph in terms of an explicit resolution. We show this correspondence explicitly for the case of SU(5 by providing a map between box graphs and fiber faces, and thereby a sequence of algebraic resolutions of the Tate model, which realizes each of the box graphs.
Braun, Andreas P.; Schäfer-Nameki, Sakura
2016-04-01
Box graphs succinctly and comprehensively characterize singular fibers of elliptic fibrations in codimension two and three, as well as flop transitions connecting these, in terms of representation theoretic data. We develop a framework that provides a systematic map between a box graph and a crepant algebraic resolution of the singular elliptic fibration, thus allowing an explicit construction of the fibers from a singular Weierstrass or Tate model. The key tool is what we call a fiber face diagram, which shows the relevant information of a (partial) toric triangulation and allows the inclusion of more general algebraic blowups. We shown that each such diagram defines a sequence of weighted algebraic blowups, thus providing a realization of the fiber defined by the box graph in terms of an explicit resolution. We show this correspondence explicitly for the case of SU (5) by providing a map between box graphs and fiber faces, and thereby a sequence of algebraic resolutions of the Tate model, which realizes each of the box graphs.
刘九七
2001-01-01
论述了WindowsNT环境下多线程的应用，介绍了Delphi中多线程的编程方法，举出了应用多线程技术编写测控软件的实例。%he application of multi-thread technique in Windows NT isresearched, the method of developing multi-thread program in Delphi is introduced,and the example of multi-thread programming in measurement and control software is presented.
Zhang, Xiaohua; Wong, Sergio E; Lightstone, Felice C
2013-04-30
A mixed parallel scheme that combines message passing interface (MPI) and multithreading was implemented in the AutoDock Vina molecular docking program. The resulting program, named VinaLC, was tested on the petascale high performance computing (HPC) machines at Lawrence Livermore National Laboratory. To exploit the typical cluster-type supercomputers, thousands of docking calculations were dispatched by the master process to run simultaneously on thousands of slave processes, where each docking calculation takes one slave process on one node, and within the node each docking calculation runs via multithreading on multiple CPU cores and shared memory. Input and output of the program and the data handling within the program were carefully designed to deal with large databases and ultimately achieve HPC on a large number of CPU cores. Parallel performance analysis of the VinaLC program shows that the code scales up to more than 15K CPUs with a very low overhead cost of 3.94%. One million flexible compound docking calculations took only 1.4 h to finish on about 15K CPUs. The docking accuracy of VinaLC has been validated against the DUD data set by the re-docking of X-ray ligands and an enrichment study, 64.4% of the top scoring poses have RMSD values under 2.0 Å. The program has been demonstrated to have good enrichment performance on 70% of the targets in the DUD data set. An analysis of the enrichment factors calculated at various percentages of the screening database indicates VinaLC has very good early recovery of actives.
The Temporal Dynamics of Scene Processing: A Multifaceted EEG Investigation
Kravitz, Dwight J.
2016-01-01
Abstract Our remarkable ability to process complex visual scenes is supported by a network of scene-selective cortical regions. Despite growing knowledge about the scene representation in these regions, much less is known about the temporal dynamics with which these representations emerge. We conducted two experiments aimed at identifying and characterizing the earliest markers of scene-specific processing. In the first experiment, human participants viewed images of scenes, faces, and everyday objects while event-related potentials (ERPs) were recorded. We found that the first ERP component to evince a significantly stronger response to scenes than the other categories was the P2, peaking ∼220 ms after stimulus onset. To establish that the P2 component reflects scene-specific processing, in the second experiment, we recorded ERPs while the participants viewed diverse real-world scenes spanning the following three global scene properties: spatial expanse (open/closed), relative distance (near/far), and naturalness (man-made/natural). We found that P2 amplitude was sensitive to these scene properties at both the categorical level, distinguishing between open and closed natural scenes, as well as at the single-image level, reflecting both computationally derived scene statistics and behavioral ratings of naturalness and spatial expanse. Together, these results establish the P2 as an ERP marker for scene processing, and demonstrate that scene-specific global information is available in the neural response as early as 220 ms. PMID:27699208
Algebraic connectivity and graph robustness.
Feddema, John Todd; Byrne, Raymond Harry; Abdallah, Chaouki T. (University of New Mexico)
2009-07-01
Recent papers have used Fiedler's definition of algebraic connectivity to show that network robustness, as measured by node-connectivity and edge-connectivity, can be increased by increasing the algebraic connectivity of the network. By the definition of algebraic connectivity, the second smallest eigenvalue of the graph Laplacian is a lower bound on the node-connectivity. In this paper we show that for circular random lattice graphs and mesh graphs algebraic connectivity is a conservative lower bound, and that increases in algebraic connectivity actually correspond to a decrease in node-connectivity. This means that the networks are actually less robust with respect to node-connectivity as the algebraic connectivity increases. However, an increase in algebraic connectivity seems to correlate well with a decrease in the characteristic path length of these networks - which would result in quicker communication through the network. Applications of these results are then discussed for perimeter security.
Negation switching invariant signed graphs
Deepa Sinha
2014-04-01
Full Text Available A signed graph (or, $sigraph$ in short is a graph G in which each edge x carries a value $\\sigma(x \\in \\{-, +\\}$ called its sign. Given a sigraph S, the negation $\\eta(S$ of the sigraph S is a sigraph obtained from S by reversing the sign of every edge of S. Two sigraphs $S_{1}$ and $S_{2}$ on the same underlying graph are switching equivalent if it is possible to assign signs `+' (`plus' or `-' (`minus' to vertices of $S_{1}$ such that by reversing the sign of each of its edges that has received opposite signs at its ends, one obtains $S_{2}$. In this paper, we characterize sigraphs which are negation switching invariant and also see for what sigraphs, S and $\\eta (S$ are signed isomorphic.
Feder, Tomás
2009-06-01
Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.
Rosmanis, Ansis
2010-01-01
I introduce a new type of continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First I analyze the quantum snake walk on the line, and I show that, even though most states stay localized throughout the evolution, there are specific states which most likely move on the line as wave packets with momentum inversely proportional to the length of the snake. Next I discuss how an algorithm based on the quantum snake walk might be able to solve an extended version of the glued trees problem which asks to find a path connecting both roots of the glued trees graph. No efficient quantum algorithm solving this problem is known yet.
Optimal preparation of graph states
Cabello, Adan; Lopez-Tarrida, Antonio J; Portillo, Jose R
2010-01-01
We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the fact that any graph state belongs to an equivalence class under local Clifford operations. We extend up to 12 qubits the classification of graph states according to their entanglement properties, and identify each class using only a reduced set of invariants. For any state, we provide a circuit with both properties (a) and (b), if it does exist, or, if it does not, one circuit with property (a) and one with property (b), including the explicit one-qubit gates needed.
Significance evaluation in factor graphs
Madsen, Tobias; Hobolth, Asger; Jensen, Jens Ledet
2017-01-01
Background Factor graphs provide a flexible and general framework for specifying probability distributions. They can capture a range of popular and recent models for analysis of both genomics data as well as data from other scientific fields. Owing to the ever larger data sets encountered...... 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....... 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...
Graph measures and network robustness
Ellens, W
2013-01-01
Network robustness research aims at finding a measure to quantify network robustness. Once such a measure has been established, we will be able to compare networks, to improve existing networks and to design new networks that are able to continue to perform well when it is subject to failures or attacks. In this paper we survey a large amount of robustness measures on simple, undirected and unweighted graphs, in order to offer a tool for network administrators to evaluate and improve the robustness of their network. The measures discussed in this paper are based on the concepts of connectivity (including reliability polynomials), distance, betweenness and clustering. Some other measures are notions from spectral graph theory, more precisely, they are functions of the Laplacian eigenvalues. In addition to surveying these graph measures, the paper also contains a discussion of their functionality as a measure for topological network robustness.
The fascinating world of graph theory
Benjamin, Arthur; Zhang, Ping
2015-01-01
Graph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics-and some of its most famous problems. The Fascinating World of Graph Theory explores the questions and puzzles that have been studied, and often solved, through graph theory. This book looks at graph theory's development and the vibrant individuals responsible for the field's growth. Introducin
Recognition of Unipolar and Generalised Split Graphs
Colin McDiarmid
2015-02-01
Full Text Available A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar partition of a graph can be used to find efficiently the clique number, the stability number, the chromatic number, and to solve other problems that are hard for general graphs. We present an O(n2-time algorithm for recognition of n-vertex generalised split graphs, improving on previous O(n3-time algorithms.
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. .
Kolmogorov and Zabih’s Graph Cuts Stereo Matching Algorithm
Vladimir Kolmogorov
2014-10-01
Full Text Available Binocular stereovision estimates the three-dimensional shape of a scene from two photographs taken from different points of view. In rectified epipolar geometry, this is equivalent to a matching problem. This article describes a method proposed by Kolmogorov and Zabih in 2001, which puts forward an energy-based formulation. The aim is to minimize a four-term-energy. This energy is not convex and cannot be minimized except among a class of perturbations called expansion moves, in which case an exact minimization can be done with graph cuts techniques. One noteworthy feature of this method is that it handles occlusion: The algorithm detects points that cannot be matched with any point in the other image. In this method displacements are pixel accurate (no subpixel refinement.
Some Invariants of Jahangir Graphs
Mobeen Munir
2017-01-01
Full Text Available In this report, we compute closed forms of M-polynomial, first and second Zagreb polynomials and forgotten polynomial for Jahangir graphs Jn,m for all values of m and n. From the M-polynomial, we recover many degree-based topological indices such as first and second Zagreb indices, modified Zagreb index, Symmetric division index, etc. We also compute harmonic index, first and second multiple Zagreb indices and forgotten index of Jahangir graphs. Our results are extensions of many existing results.
Completely Described Undirected Graph Structure
G. S. Ivanova
2016-01-01
Full Text Available The objects of research are undirected graphs. The paper considers a problem of their isomorphism. A literature analysis of its solution, has shown that there is no way to define a complete graph invariant in the form of unique structural characteristics of each its vertex, which has a computational complexity of definition better than О (n 4 .The work objective is to provide the characteristics of the graph structure, which could be used to solve the problem of their isomorphism for a time better than О (n 4 . As such characteristics, the paper proposes to use the set of codes of tree roots of all the shortest - in terms of the number of edges - paths from each vertex to the others, uniquely defining the structure of each tree. It proves the theorem that it is possible to reduce the problem of isomorphism of the undirected graphs to the isomorphism problem of their splitting into the trees of all the shortest - in terms of the number of edges - paths of each vertex to the others. An algorithm to construct the shortest paths from each vertex to all others and to compute codes of their vertices has been developed. As the latter, are used Aho-codes, which find application in recognising the isomorphism of trees. The computational complexity to obtain structural characteristics of vertices has been estimated to be about О (n 3 .The pilot studies involved the full-scale experiment using the developed complex programmes to generate raw data, i.e. analytic representation of the graph with the number of vertices equal to 1200, and a programme to provide codes of the tree roots. To have an estimate of - "the worst" in terms of time - complexity of expansion algorithm of graphs into trees of the shortest paths and define the codes of their roots has been an experimentally studied how the number of tree vertices depends on the graph density. For the worst case was obtained a dependence of the number of tree vertices on the number of graph vertices
Scattering from isospectral quantum graphs
Band, R; Sawicki, A; Smilansky, U, E-mail: rami.band@weizmann.ac.i, E-mail: assawi@cft.edu.p, E-mail: uzy.smilansky@weizmann.ac.i [Department of Physics of Complex Systems, Weizmann Institute of Science, Rehovot 76100 (Israel)
2010-10-15
Quantum graphs can be extended to scattering systems when they are connected by leads to infinity. It is shown that for certain extensions, the scattering matrices of isospectral graphs are conjugate to each other and their poles distributions are therefore identical. The scattering matrices are studied using a recently developed isospectral theory (Band et al 2009 J. Phys. A: Math. Theor. 42 175202 and Parzanchevski and Band 2010 J. Geom. Anal. 20 439-71). At the same time, the scattering approach offers a new insight on the mentioned isospectral construction.
Turing Automata and Graph Machines
Miklós Bartha
2010-06-01
Full Text Available Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by generalizing the classical Turing machine concept, so that the collection of such machines becomes an indexed monoidal algebra. On the analogy of the von Neumann data-flow computer architecture, Turing graph machines are proposed as potentially reversible low-level universal computational devices, and a truly reversible molecular size hardware model is presented as an example.
Topological Minors in Bipartite Graphs
Camino BALBUENA; Martín CER.A; Pedro GARC(I)A-V(A)ZQUEZ; Juan Carlos VALENZUELA
2011-01-01
For a bipartite graph G on m and n vertices,respectively,in its vertices classes,and for integers s and t such that 2 ≤ s ≤ t,0≤ m-s≤ n-t,andm,+n≤ 2s+t-1,we prove that if G has at least mn- (2(m - s) + n - t) edges then it contains a subdivision of the complete bipartite K(s,t) with s vertices in the m-class and t vertices in the n-class.Furthermore,we characterize the corresponding extremal bipartite graphs with mn- (2(m - s) + n - t + 1) edges for this topological Turan type problem.
Quantum walks on Cayley graphs
Lopez Acevedo, O [Laboratoire de Physique Theorique et Modelisation, Universite de Cergy-Pontoise, 2 Avenue Adolphe Chauvin 95302 Cergy Pontoise Cedex (France); Institut fuer Mathematik und Informatik, Ernst-Moritz-Arndt-Universitaet, Friedrich-Ludwig-Jahn Str.15a, 17487 Greifswald (Germany); Gobron, T [Laboratoire de Physique Theorique et Modelisation, Universite de Cergy-Pontoise, 2 Avenue Adolphe Chauvin 95302 Cergy Pontoise Cedex (France)
2006-01-20
We address the problem of the construction of quantum walks on Cayley graphs. Our main motivation is the relationship between quantum algorithms and quantum walks. In particular, we discuss the choice of the dimension of the local Hilbert space and consider various classes of graphs on which the structure of quantum walks may differ. We completely characterize quantum walks on free groups and present partial results on more general cases. Some examples are given including a family of quantum walks on the hypercube involving a Clifford algebra.
Skeletal camera network embedded structure-from-motion for 3D scene reconstruction from UAV images
Xu, Zhihua; Wu, Lixin; Gerke, Markus; Wang, Ran; Yang, Huachao
2016-11-01
Structure-from-Motion (SfM) techniques have been widely used for 3D scene reconstruction from multi-view images. However, due to the large computational costs of SfM methods there is a major challenge in processing highly overlapping images, e.g. images from unmanned aerial vehicles (UAV). This paper embeds a novel skeletal camera network (SCN) into SfM to enable efficient 3D scene reconstruction from a large set of UAV images. First, the flight control data are used within a weighted graph to construct a topologically connected camera network (TCN) to determine the spatial connections between UAV images. Second, the TCN is refined using a novel hierarchical degree bounded maximum spanning tree to generate a SCN, which contains a subset of edges from the TCN and ensures that each image is involved in at least a 3-view configuration. Third, the SCN is embedded into the SfM to produce a novel SCN-SfM method, which allows performing tie-point matching only for the actually connected image pairs. The proposed method was applied in three experiments with images from two fixed-wing UAVs and an octocopter UAV, respectively. In addition, the SCN-SfM method was compared to three other methods for image connectivity determination. The comparison shows a significant reduction in the number of matched images if our method is used, which leads to less computational costs. At the same time the achieved scene completeness and geometric accuracy are comparable.
Edmund eRolls
2014-08-01
Full Text Available Searching for and recognising objects in complex natural scenes is implemented by multiple saccades until the eyes reach within the reduced receptive field sizes of inferior temporal cortex (IT neurons. We analyse and model how the dorsal and ventral visual streams both contribute to this. Saliency detection in the dorsal visual system including area LIP is modelled by graph-based visual saliency, and allows the eyes to fixate potential objects within several degrees. Visual information at the fixated location subtending approximately 9 degrees corresponding to the receptive fields of IT neurons is then passed through a four layer hierarchical model of the ventral cortical visual system, VisNet. We show that VisNet can be trained using a synaptic modification rule with a short-term memory trace of recent neuronal activity to capture both the required view and translation invariances to allow in the model approximately 90% correct object recognition for 4 objects shown in any view across a range of 135 degrees anywhere in a scene.The model was able to generalize correctly within the four trained views and the 25 trained translations.This approach analyses the principles by which complementary computations in the dorsal and ventral visual cortical streams enable objects to be located and recognised in complex natural scenes.
Computing Graph Roots Without Short Cycles
Farzad, Babak; Le, Van Bang; Tuy, Nguyen Ngoc
2009-01-01
Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H2, however Motwani and Sudan proved that it is NP-complete to determine if a given graph G is the square of some graph H (of girth 3). In this paper we consider the characterization and recognition problems of graphs that are squares of graphs of small girth, i.e. to determine if G = H2 for some graph H of small girth. The main results are the following. - There is a graph theoretical characterization for graphs that are squares of some graph of girth at least 7. A corollary is that if a graph G has a square root H of girth at least 7 then H is unique up to isomorphism. - There is a polynomial time algorithm to recognize if G = H2 for some graph H of girth at least 6. - It is NP-complete to recognize if G = H2 for some graph H of girth 4. These results almost provide a dichotomy theorem for the complexity of the recognition problem in terms of ...
Approximate Graph Edit Distance in Quadratic Time.
Riesen, Kaspar; Ferrer, Miquel; Bunke, Horst
2015-09-14
Graph edit distance is one of the most flexible and general graph matching models available. The major drawback of graph edit distance, however, is its computational complexity that restricts its applicability to graphs of rather small size. Recently the authors of the present paper introduced a general approximation framework for the graph edit distance problem. The basic idea of this specific algorithm is to first compute an optimal assignment of independent local graph structures (including substitutions, deletions, and insertions of nodes and edges). This optimal assignment is complete and consistent with respect to the involved nodes of both graphs and can thus be used to instantly derive an admissible (yet suboptimal) solution for the original graph edit distance problem in O(n3) time. For large scale graphs or graph sets, however, the cubic time complexity may still be too high. Therefore, we propose to use suboptimal algorithms with quadratic rather than cubic time for solving the basic assignment problem. In particular, the present paper introduces five different greedy assignment algorithms in the context of graph edit distance approximation. In an experimental evaluation we show that these methods have great potential for further speeding up the computation of graph edit distance while the approximated distances remain sufficiently accurate for graph based pattern classification.
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.
Recovering Intrinsic Scene Characteristics from Images
1982-12-17
IPstitute of Technology At Memo 518 (1979). [8] S. R. Cajal , "Histologie du systeme nerveux de l’homme et des vertebrates," 2, Paris, Maloine (1911). [9...tops and poor identification of bodies of water. 11 *u III CURRENT SYSTEM I- thtis, regions in the scene that can be confidently identified. The sky seed
Augustus De Morgan behind the Scenes
Simmons, Charlotte
2011-01-01
Augustus De Morgan's support was crucial to the achievements of the four mathematicians whose work is considered greater than his own. This article explores the contributions he made to mathematics from behind the scenes by supporting the work of Hamilton, Boole, Gompertz, and Ramchundra.
The light field in natural scenes
Muryy, A.A.
2009-01-01
This thesis focuses on the properties of light fields with respect to object appearance. More specifically, our interest was mainly directed to the structure and spatial variation of light fields in natural scenes. We approached the structure of light fields by means of spherical harmonics which
Behind the scenes at the LHC inauguration
2008-01-01
On 21 October the LHC inauguration ceremony will take place and people from all over CERN have been busy preparing. With delegations from 38 countries attending, including ministers and heads of state, the Bulletin has gone behind the scenes to see what it takes to put together an event of this scale.
Processing of Unattended Emotional Visual Scenes
Calvo, Manuel G.; Nummenmaa, Lauri
2007-01-01
Prime pictures of emotional scenes appeared in parafoveal vision, followed by probe pictures either congruent or incongruent in affective valence. Participants responded whether the probe was pleasant or unpleasant (or whether it portrayed people or animals). Shorter latencies for congruent than for incongruent prime-probe pairs revealed affective…
Chain graph models and their causal interpretations
Lauritzen, Steffen Lilholt; Richardson, Thomas S.
2002-01-01
the equilibrium distributions of dynamic models with feed-back. These dynamic interpretations lead to a simple theory of intervention, extending the theory developed for directed acyclic graphs. Finally, we contrast chain graph models under this interpretation with simultaneous equation models which have......Chain graphs are a natural generalization of directed acyclic graphs and undirected graphs. However, the apparent simplicity of chain graphs belies the subtlety of the conditional independence hypotheses that they represent. There are many simple and apparently plausible, but ultimately fallacious......, interpretations of chain graphs that are often invoked, implicitly or explicitly. These interpretations also lead to flawed methods for applying background knowledge to model selection. We present a valid interpretation by showing how the distribution corresponding to a chain graph may be generated from...
Mathematical Minute: Rotating a Function Graph
Bravo, Daniel; Fera, Joseph
2013-01-01
Using calculus only, we find the angles you can rotate the graph of a differentiable function about the origin and still obtain a function graph. We then apply the solution to odd and even degree polynomials.
The thickness of amalgamations of graphs
Yang, Yan
2012-01-01
The thickness $\\theta(G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. As a topological invariant of a graph, it is a measurement of the closeness to planarity of a graph, and it also has important applications to VLSI design. In this paper, the thickness of graphs that are obtained by vertex-amalgamation and bar-amalgamation of any two graphs whose thicknesses are known are obtained, respectively. And the lower and upper bounds for the thickness of graphs that are obtained by edge-amalgamation and 2-vertex-amalgamation of any two graphs whose thicknesses are known are also derived, respectively.
The Laplacian eigenvalues of graphs: a survey
Zhang, Xiao-Dong
2011-01-01
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. This paper is primarily a survey of various aspects of the eigenvalues of the Laplacian matrix of a graph for the past teens. In addition, some new unpublished results and questions are concluded. Emphasis is given on classifications of the upper and lower bounds for the Laplacian eigenvalues of graphs (including some special graphs, such as trees, bipartite graphs, triangular-free graphs, cubic graphs, etc.) as a function of other graph invariants, such as degree sequence, the average 2-degree, diameter, the maximal independence number, the maximal matching number, vertex connectivity, the domination number, the number of the spanning trees, etc.
Measuring extremal dependencies in web graphs
Volkovich, Y.; Litvak, Nelli; Zwart, B.
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. The well developed theory of regular variation is widely applied in extreme value theory, telecommunications and
G-Bean: an ontology-graph based web tool for biomedical literature retrieval.
Wang, James Z; Zhang, Yuanyuan; Dong, Liang; Li, Lin; Srimani, Pradip K; Yu, Philip S
2014-01-01
Currently, most people use NCBI's PubMed to search the MEDLINE database, an important bibliographical information source for life science and biomedical information. However, PubMed has some drawbacks that make it difficult to find relevant publications pertaining to users' individual intentions, especially for non-expert users. To ameliorate the disadvantages of PubMed, we developed G-Bean, a graph based biomedical search engine, to search biomedical articles in MEDLINE database more efficiently. G-Bean addresses PubMed's limitations with three innovations: (1) Parallel document index creation: a multithreaded index creation strategy is employed to generate the document index for G-Bean in parallel; (2) Ontology-graph based query expansion: an ontology graph is constructed by merging four major UMLS (Version 2013AA) vocabularies, MeSH, SNOMEDCT, CSP and AOD, to cover all concepts in National Library of Medicine (NLM) database; a Personalized PageRank algorithm is used to compute concept relevance in this ontology graph and the Term Frequency - Inverse Document Frequency (TF-IDF) weighting scheme is used to re-rank the concepts. The top 500 ranked concepts are selected for expanding the initial query to retrieve more accurate and relevant information; (3) Retrieval and re-ranking of documents based on user's search intention: after the user selects any article from the existing search results, G-Bean analyzes user's selections to determine his/her true search intention and then uses more relevant and more specific terms to retrieve additional related articles. The new articles are presented to the user in the order of their relevance to the already selected articles. Performance evaluation with 106 OHSUMED benchmark queries shows that G-Bean returns more relevant results than PubMed does when using these queries to search the MEDLINE database. PubMed could not even return any search result for some OHSUMED queries because it failed to form the appropriate Boolean
Prudente, Matthew James
Given a graph G with pebbles on the vertices, we define a pebbling move as removing two pebbles from a vertex u, placing one pebble on a neighbor v, and discarding the other pebble, like a toll. The pebbling number pi( G) is the least number of pebbles needed so that every arrangement of pi(G) pebbles can place a pebble on any vertex through a sequence of pebbling moves. We introduce a new variation on graph pebbling called two-player pebbling. In this, players called the mover and the defender alternate moves, with the stipulation that the defender cannot reverse the previous move. The mover wins only if they can place a pebble on a specified vertex and the defender wins if the mover cannot. We define η(G), analogously, as the minimum number of pebbles such that given every configuration of the η( G) pebbles and every specified vertex r, the mover has a winning strategy. First, we will investigate upper bounds for η( G) on various classes of graphs and find a certain structure for which the defender has a winning strategy, no matter how many pebbles are in a configuration. Then, we characterize winning configurations for both players on a special class of diameter 2 graphs. Finally, we show winning configurations for the mover on paths using a recursive argument.
XML Graphs in Program Analysis
Møller, Anders; Schwartzbach, Michael Ignatieff
2007-01-01
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...
Ancestral Genres of Mathematical Graphs
Gerofsky, Susan
2011-01-01
Drawing from sources in gesture studies, cognitive science, the anthropology of religion and art/architecture history, this article explores cultural, bodily and cosmological resonances carried (unintentionally) by mathematical graphs on Cartesian coordinates. Concepts of asymmetric bodily spaces, grids, orthogonality, mapping and sacred spaces…
Standards for Graph Algorithm Primitives
Mattson, Tim; Bader, David; Berry, Jon; Buluc, Aydin; Dongarra, Jack; Faloutsos, Christos; Feo, John; Gilbert, John; Gonzalez, Joseph; Hendrickson, Bruce; Kepner, Jeremy; Leiserson, Charles; Lumsdaine, Andrew; Padua, David; Poole, Stephen
2014-01-01
It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building blocks. This paper is a position paper defining the problem and announcing our intention to launch an open effort to define this standard.
Memory Hierarchy Sensitive Graph Layout
Roy, Amitabha
2012-01-01
Mining large graphs for information is becoming an increasingly important workload due to the plethora of graph structured data becoming available. An aspect of graph algorithms that has hitherto not received much interest is the effect of memory hierarchy on accesses. A typical system today has multiple levels in the memory hierarchy with differing units of locality; ranging across cache lines, TLB entries and DRAM pages. We postulate that it is possible to allocate graph structured data in main memory in a way as to improve the spatial locality of the data. Previous approaches to improving cache locality have focused only on a single unit of locality, either the cache line or virtual memory page. On the other hand cache oblivious algorithms can optimise layout for all levels of the memory hierarchy but unfortunately need to be specially designed for individual data structures. In this paper we explore hierarchical blocking as a technique for closing this gap. We require as input a specification of the units...
Seidel Switching and Graph Energy
Haemers, W.H.
2012-01-01
Abstract: The energy of a graph Γ is the sum of the absolute values of the eigenvalues of the adjacency matrix of Γ. Seidel switching is an operation on the edge set of Γ. In some special cases Seidel switching does not change the spectrum, and therefore the energy. Here we investigate when Seidel s
Index theorems for quantum graphs
Fulling, S A; Wilson, J H
2007-01-01
In geometric analysis, an index theorem relates the difference of the numbers of solutions of two differential equations to the topological structure of the manifold or bundle concerned, sometimes using the heat kernels of two higher-order differential operators as an intermediary. In this paper, the case of quantum graphs is addressed. A quantum graph is a graph considered as a (singular) one-dimensional variety and equipped with a second-order differential Hamiltonian H (a "Laplacian") with suitable conditions at vertices. For the case of scale-invariant vertex conditions (i.e., conditions that do not mix the values of functions and of their derivatives), the constant term of the heat-kernel expansion is shown to be proportional to the trace of the internal scattering matrix of the graph. This observation is placed into the index-theory context by factoring the Laplacian into two first-order operators, H =A*A, and relating the constant term to the index of A. An independent consideration provides an index f...
Fibonacci Identities, Matrices, and Graphs
Huang, Danrun
2005-01-01
General strategies used to help discover, prove, and generalize identities for Fibonacci numbers are described along with some properties about the determinants of square matrices. A matrix proof for identity (2) that has received immense attention from many branches of mathematics, like linear algebra, dynamical systems, graph theory and others…