Bisimulation reduction of big graphs on MapReduce

NARCIS (Netherlands)

Luo, Y.; Lange, de Y.; Fletcher, G.H.L.; De Bra, P.M.E.; Hidders, A.J.H.; Gottlob, G.; Grasso, G.; Olteanu, D.; Schallhart, C.

2013-01-01

Computing the bisimulation partition of a graph is a fundamental problem which plays a key role in a wide range of basic applications. Intuitively, two nodes in a graph are bisimilar if they share basic structural properties such as labeling and neighborhood topology. In data management, reducing a

Analytic degree distributions of horizontal visibility graphs mapped from unrelated random series and multifractal binomial measures

Science.gov (United States)

Xie, Wen-Jie; Han, Rui-Qi; Jiang, Zhi-Qiang; Wei, Lijian; Zhou, Wei-Xing

2017-08-01

Complex network is not only a powerful tool for the analysis of complex system, but also a promising way to analyze time series. The algorithm of horizontal visibility graph (HVG) maps time series into graphs, whose degree distributions are numerically and analytically investigated for certain time series. We derive the degree distributions of HVGs through an iterative construction process of HVGs. The degree distributions of the HVG and the directed HVG for random series are derived to be exponential, which confirms the analytical results from other methods. We also obtained the analytical expressions of degree distributions of HVGs and in-degree and out-degree distributions of directed HVGs transformed from multifractal binomial measures, which agree excellently with numerical simulations.

Multigraph: Interactive Data Graphs on the Web

Science.gov (United States)

Phillips, M. B.

2010-12-01

Many aspects of geophysical science involve time dependent data that is often presented in the form of a graph. Considering that the web has become a primary means of communication, there are surprisingly few good tools and techniques available for presenting time-series data on the web. The most common solution is to use a desktop tool such as Excel or Matlab to create a graph which is saved as an image and then included in a web page like any other image. This technique is straightforward, but it limits the user to one particular view of the data, and disconnects the graph from the data in a way that makes updating a graph with new data an often cumbersome manual process. This situation is somewhat analogous to the state of mapping before the advent of GIS. Maps existed only in printed form, and creating a map was a laborious process. In the last several years, however, the world of mapping has experienced a revolution in the form of web-based and other interactive computer technologies, so that it is now commonplace for anyone to easily browse through gigabytes of geographic data. Multigraph seeks to bring a similar ease of access to time series data. Multigraph is a program for displaying interactive time-series data graphs in web pages that includes a simple way of configuring the appearance of the graph and the data to be included. It allows multiple data sources to be combined into a single graph, and allows the user to explore the data interactively. Multigraph lets users explore and visualize "data space" in the same way that interactive mapping applications such as Google Maps facilitate exploring and visualizing geography. Viewing a Multigraph graph is extremely simple and intuitive, and requires no instructions. Creating a new graph for inclusion in a web page involves writing a simple XML configuration file and requires no programming. Multigraph can read data in a variety of formats, and can display data from a web service, allowing users to "surf

Digital Line Graphs (DLG) 24K

Data.gov (United States)

Kansas Data Access and Support Center — Digital line graph (DLG) data are digital representations of cartographic information. DLG's of map features are converted to digital form from maps and related...

Digital Line Graphs (DLG) 100K

Data.gov (United States)

Kansas Data Access and Support Center — Digital line graph (DLG) data are digital representations of cartographic information. DLG's of map features are converted to digital form from maps and related...

Graphs, groups and surfaces

CERN Document Server

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''''.

Individual Travel Behavior Modeling of Public Transport Passenger Based on Graph Construction

Directory of Open Access Journals (Sweden)

Quan Liang

2018-01-01

Full Text Available This paper presents a novel method for mining the individual travel behavior regularity of different public transport passengers through constructing travel behavior graph based model. The individual travel behavior graph is developed to represent spatial positions, time distributions, and travel routes and further forecasts the public transport passenger’s behavior choice. The proposed travel behavior graph is composed of macronodes, arcs, and transfer probability. Each macronode corresponds to a travel association map and represents a travel behavior. A travel association map also contains its own nodes. The nodes of a travel association map are created when the processed travel chain data shows significant change. Thus, each node of three layers represents a significant change of spatial travel positions, travel time, and routes, respectively. Since a travel association map represents a travel behavior, the graph can be considered a sequence of travel behaviors. Through integrating travel association map and calculating the probabilities of the arcs, it is possible to construct a unique travel behavior graph for each passenger. The data used in this study are multimode data matched by certain rules based on the data of public transport smart card transactions and network features. The case study results show that graph based method to model the individual travel behavior of public transport passengers is effective and feasible. Travel behavior graphs support customized public transport travel characteristics analysis and demand prediction.

MARKOV GRAPHS OF ONE–DIMENSIONAL DYNAMICAL SYSTEMS AND THEIR DISCRETE ANALOGUES AND THEIR DISCRETE ANALOGUES

Directory of Open Access Journals (Sweden)

SERGIY KOZERENKO

2016-04-01

Full Text Available One feature of the famous Sharkovsky’s theorem is that it can be proved using digraphs of a special type (the so–called Markov graphs. The most general definition assigns a Markov graph to every continuous map from the topological graph to itself. We show that this definition is too broad, i.e. every finite digraph can be viewed as a Markov graph of some one–dimensional dynamical system on a tree. We therefore consider discrete analogues of Markov graphs for vertex maps on combinatorial trees and characterize all maps on trees whose discrete Markov graphs are of the following types: complete, complete bipartite, the disjoint union of cycles, with every arc being a loop.

Mizan: Optimizing Graph Mining in Large Parallel Systems

KAUST Repository

Kalnis, Panos

2012-03-01

Extracting information from graphs, from nding shortest paths to complex graph mining, is essential for many ap- plications. Due to the shear size of modern graphs (e.g., social networks), processing must be done on large paral- lel computing infrastructures (e.g., the cloud). Earlier ap- proaches relied on the MapReduce framework, which was proved inadequate for graph algorithms. More recently, the message passing model (e.g., Pregel) has emerged. Although the Pregel model has many advantages, it is agnostic to the graph properties and the architecture of the underlying com- puting infrastructure, leading to suboptimal performance. In this paper, we propose Mizan, a layer between the users\\' code and the computing infrastructure. Mizan considers the structure of the input graph and the architecture of the in- frastructure in order to: (i) decide whether it is bene cial to generate a near-optimal partitioning of the graph in a pre- processing step, and (ii) choose between typical point-to- point message passing and a novel approach that puts com- puting nodes in a virtual overlay ring. We deployed Mizan on a small local Linux cluster, on the cloud (256 virtual machines in Amazon EC2), and on an IBM Blue Gene/P supercomputer (1024 CPUs). We show that Mizan executes common algorithms on very large graphs 1-2 orders of mag- nitude faster than MapReduce-based implementations and up to one order of magnitude faster than implementations relying on Pregel-like hash-based graph partitioning.

Declarative Event-Based Workflow as Distributed Dynamic Condition Response Graphs

DEFF Research Database (Denmark)

Hildebrandt, Thomas; Mukkamala, Raghava Rao

2010-01-01

We present Dynamic Condition Response Graphs (DCR Graphs) as a declarative, event-based process model inspired by the workflow language employed by our industrial partner and conservatively generalizing prime event structures. A dynamic condition response graph is a directed graph with nodes repr...... exemplify the use of distributed DCR Graphs on a simple workflow taken from a field study at a Danish hospital, pointing out their flexibility compared to imperative workflow models. Finally we provide a mapping from DCR Graphs to Buchi-automata....

Graph Processing on GPUs: A Survey

DEFF Research Database (Denmark)

Shi, Xuanhua; Zheng, Zhigao; Zhou, Yongluan

2018-01-01

hundreds of billions, has attracted much attention in both industry and academia. It still remains a great challenge to process such large-scale graphs. Researchers have been seeking for new possible solutions. Because of the massive degree of parallelism and the high memory access bandwidth in GPU......, utilizing GPU to accelerate graph processing proves to be a promising solution. This article surveys the key issues of graph processing on GPUs, including data layout, memory access pattern, workload mapping, and specific GPU programming. In this article, we summarize the state-of-the-art research on GPU...

Some remarks on definability of process graphs

NARCIS (Netherlands)

Grabmayer, C.A.; Klop, J.W.; Luttik, B.; Baier, C.; Hermanns, H.

2006-01-01

We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and BPP. For a process graph G, the density function in a state s maps a natural number n to the number of states of G with distance less or

TrajGraph: A Graph-Based Visual Analytics Approach to Studying Urban Network Centralities Using Taxi Trajectory Data.

Science.gov (United States)

Huang, Xiaoke; Zhao, Ye; Yang, Jing; Zhang, Chong; Ma, Chao; Ye, Xinyue

2016-01-01

We propose TrajGraph, a new visual analytics method, for studying urban mobility patterns by integrating graph modeling and visual analysis with taxi trajectory data. A special graph is created to store and manifest real traffic information recorded by taxi trajectories over city streets. It conveys urban transportation dynamics which can be discovered by applying graph analysis algorithms. To support interactive, multiscale visual analytics, a graph partitioning algorithm is applied to create region-level graphs which have smaller size than the original street-level graph. Graph centralities, including Pagerank and betweenness, are computed to characterize the time-varying importance of different urban regions. The centralities are visualized by three coordinated views including a node-link graph view, a map view and a temporal information view. Users can interactively examine the importance of streets to discover and assess city traffic patterns. We have implemented a fully working prototype of this approach and evaluated it using massive taxi trajectories of Shenzhen, China. TrajGraph's capability in revealing the importance of city streets was evaluated by comparing the calculated centralities with the subjective evaluations from a group of drivers in Shenzhen. Feedback from a domain expert was collected. The effectiveness of the visual interface was evaluated through a formal user study. We also present several examples and a case study to demonstrate the usefulness of TrajGraph in urban transportation analysis.

BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.

Science.gov (United States)

Vorburger, Robert S; Reischauer, Carolin; Boesiger, Peter

2013-02-01

Bootstrap methods have recently been introduced to diffusion-weighted magnetic resonance imaging to estimate the measurement uncertainty of ensuing diffusion parameters directly from the acquired data without the necessity to assume a noise model. These methods have been previously combined with deterministic streamline tractography algorithms to allow for the assessment of connection probabilities in the human brain. Thereby, the local noise induced disturbance in the diffusion data is accumulated additively due to the incremental progression of streamline tractography algorithms. Graph based approaches have been proposed to overcome this drawback of streamline techniques. For this reason, the bootstrap method is in the present work incorporated into a graph setup to derive a new probabilistic fiber tractography method, called BootGraph. The acquired data set is thereby converted into a weighted, undirected graph by defining a vertex in each voxel and edges between adjacent vertices. By means of the cone of uncertainty, which is derived using the wild bootstrap, a weight is thereafter assigned to each edge. Two path finding algorithms are subsequently applied to derive connection probabilities. While the first algorithm is based on the shortest path approach, the second algorithm takes all existing paths between two vertices into consideration. Tracking results are compared to an established algorithm based on the bootstrap method in combination with streamline fiber tractography and to another graph based algorithm. The BootGraph shows a very good performance in crossing situations with respect to false negatives and permits incorporating additional constraints, such as a curvature threshold. By inheriting the advantages of the bootstrap method and graph theory, the BootGraph method provides a computationally efficient and flexible probabilistic tractography setup to compute connection probability maps and virtual fiber pathways without the drawbacks of

A contribution to queens graphs: A substitution method

DEFF Research Database (Denmark)

Ambrus, G.; Barat, Janos

2006-01-01

A graph G is a queens graph if the vertices of G can be mapped to queens on the chessboard such that two vertices are adjacent if and only if the corresponding queens attack each other, i.e. they are in horizontal, vertical or diagonal position. We prove a conjecture of Beineke, Broere and Hennin...

Semantic graphs and associative memories

Science.gov (United States)

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.

Probabilistic Graph Layout for Uncertain Network Visualization.

Science.gov (United States)

Schulz, Christoph; Nocaj, Arlind; Goertler, Jochen; Deussen, Oliver; Brandes, Ulrik; Weiskopf, Daniel

2017-01-01

We present a novel uncertain network visualization technique based on node-link diagrams. Nodes expand spatially in our probabilistic graph layout, depending on the underlying probability distributions of edges. The visualization is created by computing a two-dimensional graph embedding that combines samples from the probabilistic graph. A Monte Carlo process is used to decompose a probabilistic graph into its possible instances and to continue with our graph layout technique. Splatting and edge bundling are used to visualize point clouds and network topology. The results provide insights into probability distributions for the entire network-not only for individual nodes and edges. We validate our approach using three data sets that represent a wide range of network types: synthetic data, protein-protein interactions from the STRING database, and travel times extracted from Google Maps. Our approach reveals general limitations of the force-directed layout and allows the user to recognize that some nodes of the graph are at a specific position just by chance.

Row—column visibility graph approach to two-dimensional landscapes

International Nuclear Information System (INIS)

Xiao Qin; Pan Xue; Li Xin-Li; Stephen Mutua; Yang Hui-Jie; Jiang Yan; Wang Jian-Yong; Zhang Qing-Jun

2014-01-01

A new concept, called the row—column visibility graph, is proposed to map two-dimensional landscapes to complex networks. A cluster coverage is introduced to describe the extensive property of node clusters on a Euclidean lattice. Graphs mapped from fractals generated with the probability redistribution model behave scale-free. They have pattern-induced hierarchical organizations and comparatively much more extensive structures. The scale-free exponent has a negative correlation with the Hurst exponent, however, there is no deterministic relation between them. Graphs for fractals generated with the midpoint displacement model are exponential networks. When the Hurst exponent is large enough (e.g., H > 0.5), the degree distribution decays much more slowly, the average coverage becomes significant large, and the initially hierarchical structure at H < 0.5 is destroyed completely. Hence, the row—column visibility graph can be used to detect the pattern-related new characteristics of two-dimensional landscapes. (interdisciplinary physics and related areas of science and technology)

A STUDY ON ETHICAL ISSUES IN ADVERTISING AND ANALYZING DIFFERENT UNETHICAL ADVERTISEMENTS WITH RESULTS OF ASCI DECISIONS: AN INDIAN PERSPECTIVE

Directory of Open Access Journals (Sweden)

Neha MUNJAL

2016-08-01

Full Text Available The focus of this paper is to study the ethical issues that arise in print and television advertising and also analyzing the various types of unethical advertisement in India with reference to ASCI principles. Today the India’s advertising industry is expanding its business at a rapid rate. India’s advertising industry in very little time has carved a niche for itself and placed itself on a global map. But over the years advertising and marketing communication messages have created debatable ethical issues like surrogate advertising, puffery, unverified claims, women stereotype, comparative advertising, use of children in advertising etc. In today’s competitive market, advertisers are sometimes following the unethical practices to fight the competition. We have analyzed with the help of examples the different unethical practices used by advertisers in advertisements in India and also discussed some real life cases solved by CCC (Consumer complaint council following the necessary ASCI Codes for it.  

Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics

Science.gov (United States)

Changaival, Boonyarit; Rosalie, Martin; Danoy, Grégoire; Lavangnananda, Kittichai; Bouvry, Pascal

2017-12-01

Graph Traversal algorithms can find their applications in various fields such as routing problems, natural language processing or even database querying. The exploration can be considered as a first stepping stone into knowledge extraction from the graph which is now a popular topic. Classical solutions such as Breadth First Search (BFS) and Depth First Search (DFS) require huge amounts of memory for exploring very large graphs. In this research, we present a novel memoryless graph traversal algorithm, Chaotic Traversal (CHAT) which integrates chaotic dynamics to traverse large unknown graphs via the Lozi map and the Rössler system. To compare various dynamics effects on our algorithm, we present an original way to perform the exploration of a parameter space using a bifurcation diagram with respect to the topological structure of attractors. The resulting algorithm is an efficient and nonresource demanding algorithm, and is therefore very suitable for partial traversal of very large and/or unknown environment graphs. CHAT performance using Lozi map is proven superior than the, commonly known, Random Walk, in terms of number of nodes visited (coverage percentage) and computation time where the environment is unknown and memory usage is restricted.

Ancestral Genres of Mathematical Graphs

Science.gov (United States)

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…

A componential model of human interaction with graphs: 1. Linear regression modeling

Science.gov (United States)

Gillan, Douglas J.; Lewis, Robert

1994-01-01

Task analyses served as the basis for developing the Mixed Arithmetic-Perceptual (MA-P) model, which proposes (1) that people interacting with common graphs to answer common questions apply a set of component processes-searching for indicators, encoding the value of indicators, performing arithmetic operations on the values, making spatial comparisons among indicators, and repsonding; and (2) that the type of graph and user's task determine the combination and order of the components applied (i.e., the processing steps). Two experiments investigated the prediction that response time will be linearly related to the number of processing steps according to the MA-P model. Subjects used line graphs, scatter plots, and stacked bar graphs to answer comparison questions and questions requiring arithmetic calculations. A one-parameter version of the model (with equal weights for all components) and a two-parameter version (with different weights for arithmetic and nonarithmetic processes) accounted for 76%-85% of individual subjects' variance in response time and 61%-68% of the variance taken across all subjects. The discussion addresses possible modifications in the MA-P model, alternative models, and design implications from the MA-P model.

Quick Mining of Isomorphic Exact Large Patterns from Large Graphs

KAUST Repository

Almasri, Islam

2014-12-01

The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.

Quick Mining of Isomorphic Exact Large Patterns from Large Graphs

KAUST Repository

Almasri, Islam; Gao, Xin; Fedoroff, Nina V.

2014-01-01

The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.

A cut locus for finite graphs and the farthest point mapping

DEFF Research Database (Denmark)

Maddaloni, Alessandro; Zamfirescu, Carol T.

2016-01-01

We reflect upon an analogue of the cut locus, a notion classically studied in Differential Geometry, for finite graphs. The cut locus C(x) of a vertex x shall be the graph induced by the set of all vertices y with the property that no shortest path between x and z, z≠y, contains y. The cut locus ...

Applicability of the Directed Graph Methodology

Energy Technology Data Exchange (ETDEWEB)

Huszti, Jozsef [Institute of Isotope of the Hungarian Academy of Sciences, Budapest (Hungary); Nemeth, Andras [ESRI Hungary, Budapest (Hungary); Vincze, Arpad [Hungarian Atomic Energy Authority, Budapest (Hungary)

2012-06-15

Possible methods to construct, visualize and analyse the 'map' of the State's nuclear infrastructure based on different directed graph approaches are proposed. The transportation and the flow network models are described in detail. The use of the possible evaluation methodologies and the use of available software tools to construct and maintain the nuclear 'map' using pre-defined standard building blocks (nuclear facilities) are introduced and discussed.

Recognition of building group patterns in topographic maps based on graph partitioning and random forest

Science.gov (United States)

He, Xianjin; Zhang, Xinchang; Xin, Qinchuan

2018-02-01

Recognition of building group patterns (i.e., the arrangement and form exhibited by a collection of buildings at a given mapping scale) is important to the understanding and modeling of geographic space and is hence essential to a wide range of downstream applications such as map generalization. Most of the existing methods develop rigid rules based on the topographic relationships between building pairs to identify building group patterns and thus their applications are often limited. This study proposes a method to identify a variety of building group patterns that allow for map generalization. The method first identifies building group patterns from potential building clusters based on a machine-learning algorithm and further partitions the building clusters with no recognized patterns based on the graph partitioning method. The proposed method is applied to the datasets of three cities that are representative of the complex urban environment in Southern China. Assessment of the results based on the reference data suggests that the proposed method is able to recognize both regular (e.g., the collinear, curvilinear, and rectangular patterns) and irregular (e.g., the L-shaped, H-shaped, and high-density patterns) building group patterns well, given that the correctness values are consistently nearly 90% and the completeness values are all above 91% for three study areas. The proposed method shows promises in automated recognition of building group patterns that allows for map generalization.

Frog: Asynchronous Graph Processing on GPU with Hybrid Coloring Model

Energy Technology Data Exchange (ETDEWEB)

Shi, Xuanhua; Luo, Xuan; Liang, Junling; Zhao, Peng; Di, Sheng; He, Bingsheng; Jin, Hai

2018-01-01

GPUs have been increasingly used to accelerate graph processing for complicated computational problems regarding graph theory. Many parallel graph algorithms adopt the asynchronous computing model to accelerate the iterative convergence. Unfortunately, the consistent asynchronous computing requires locking or atomic operations, leading to significant penalties/overheads when implemented on GPUs. As such, coloring algorithm is adopted to separate the vertices with potential updating conflicts, guaranteeing the consistency/correctness of the parallel processing. Common coloring algorithms, however, may suffer from low parallelism because of a large number of colors generally required for processing a large-scale graph with billions of vertices. We propose a light-weight asynchronous processing framework called Frog with a preprocessing/hybrid coloring model. The fundamental idea is based on Pareto principle (or 80-20 rule) about coloring algorithms as we observed through masses of realworld graph coloring cases. We find that a majority of vertices (about 80%) are colored with only a few colors, such that they can be read and updated in a very high degree of parallelism without violating the sequential consistency. Accordingly, our solution separates the processing of the vertices based on the distribution of colors. In this work, we mainly answer three questions: (1) how to partition the vertices in a sparse graph with maximized parallelism, (2) how to process large-scale graphs that cannot fit into GPU memory, and (3) how to reduce the overhead of data transfers on PCIe while processing each partition. We conduct experiments on real-world data (Amazon, DBLP, YouTube, RoadNet-CA, WikiTalk and Twitter) to evaluate our approach and make comparisons with well-known non-preprocessed (such as Totem, Medusa, MapGraph and Gunrock) and preprocessed (Cusha) approaches, by testing four classical algorithms (BFS, PageRank, SSSP and CC). On all the tested applications and

Topological properties of the limited penetrable horizontal visibility graph family

Science.gov (United States)

Wang, Minggang; Vilela, André L. M.; Du, Ruijin; Zhao, Longfeng; Dong, Gaogao; Tian, Lixin; Stanley, H. Eugene

2018-05-01

The limited penetrable horizontal visibility graph algorithm was recently introduced to map time series in complex networks. In this work, we extend this algorithm to create a directed-limited penetrable horizontal visibility graph and an image-limited penetrable horizontal visibility graph. We define two algorithms and provide theoretical results on the topological properties of these graphs associated with different types of real-value series. We perform several numerical simulations to check the accuracy of our theoretical results. Finally, we present an application of the directed-limited penetrable horizontal visibility graph to measure real-value time series irreversibility and an application of the image-limited penetrable horizontal visibility graph that discriminates noise from chaos. We also propose a method to measure the systematic risk using the image-limited penetrable horizontal visibility graph, and the empirical results show the effectiveness of our proposed algorithms.

Graph averaging as a means to compare multichannel EEG coherence networks and its application to the study of mental fatigue and neurodegenerative disease

NARCIS (Netherlands)

Crippa, Alessandro; Maurits, Natasha M.; Lorist, Monicque M.; Roerdink, Jos B.T.M.

A method is proposed for quantifying differences between multichannel EEG coherence networks represented by functional unit (FU) maps. The approach is based on inexact graph matching for attributed relational graphs and graph averaging, adapted to FU-maps. The mean of a set of input FU-maps is

a Laser-Slam Algorithm for Indoor Mobile Mapping

Science.gov (United States)

Zhang, Wenjun; Zhang, Qiao; Sun, Kai; Guo, Sheng

2016-06-01

A novel Laser-SLAM algorithm is presented for real indoor environment mobile mapping. SLAM algorithm can be divided into two classes, Bayes filter-based and graph optimization-based. The former is often difficult to guarantee consistency and accuracy in largescale environment mapping because of the accumulative error during incremental mapping. Graph optimization-based SLAM method often assume predetermined landmarks, which is difficult to be got in unknown environment mapping. And there most likely has large difference between the optimize result and the real data, because the constraints are too few. This paper designed a kind of sub-map method, which could map more accurately without predetermined landmarks and avoid the already-drawn map impact on agent's location. The tree structure of sub-map can be indexed quickly and reduce the amount of memory consuming when mapping. The algorithm combined Bayes-based and graph optimization-based SLAM algorithm. It created virtual landmarks automatically by associating data of sub-maps for graph optimization. Then graph optimization guaranteed consistency and accuracy in large-scale environment mapping and improved the reasonability and reliability of the optimize results. Experimental results are presented with a laser sensor (UTM 30LX) in official buildings and shopping centres, which prove that the proposed algorithm can obtain 2D maps within 10cm precision in indoor environment range from several hundreds to 12000 square meter.

Contracts for Cross-organizational Workflows as Timed Dynamic Condition Response Graphs

DEFF Research Database (Denmark)

Hildebrandt, Thomas; Mukkamala, Raghava Rao; Slaats, Tijs

2013-01-01

We conservatively extend the declarative Dynamic Condition Response (DCR) Graph process model, introduced in the PhD thesis of the second author, to allow for discrete time deadlines. We prove that safety and liveness properties can be verified by mapping finite timed DCR Graphs to finite state...

Modelling and analysis of distributed simulation protocols with distributed graph transformation

OpenAIRE

Lara, Juan de; Taentzer, Gabriele

2005-01-01

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. J. de Lara, and G. Taentzer, "Modelling and analysis of distributed simulation protocols with distributed graph transformation...

Advertising Systems in Japan Marketing Behavior, Advertising Industry, Advertising Literacy

OpenAIRE

KISHIYA, Kazuhiro

2005-01-01

This paper clarifies advertising systems unique to Japan. As typical of Japanese advertising systems, advertising expression tend to adopt soft sell and transformational type. The advertising expression is explained not only by the cultural value but also marketing behavior of advertisers and the characteristics of Advertising transactions. As to marketing behavior channel-oriented marketing behavior has an impact on advertising expressions. As to characteristics of Advertising transactions, ...

Topological visual mapping in robotics.

Science.gov (United States)

Romero, Anna; Cazorla, Miguel

2012-08-01

A key problem in robotics is the construction of a map from its environment. This map could be used in different tasks, like localization, recognition, obstacle avoidance, etc. Besides, the simultaneous location and mapping (SLAM) problem has had a lot of interest in the robotics community. This paper presents a new method for visual mapping, using topological instead of metric information. For that purpose, we propose prior image segmentation into regions in order to group the extracted invariant features in a graph so that each graph defines a single region of the image. Although others methods have been proposed for visual SLAM, our method is complete, in the sense that it makes all the process: it presents a new method for image matching; it defines a way to build the topological map; and it also defines a matching criterion for loop-closing. The matching process will take into account visual features and their structure using the graph transformation matching (GTM) algorithm, which allows us to process the matching and to remove out the outliers. Then, using this image comparison method, we propose an algorithm for constructing topological maps. During the experimentation phase, we will test the robustness of the method and its ability constructing topological maps. We have also introduced new hysteresis behavior in order to solve some problems found building the graph.

75 FR 60352 - Notice of Proposed Rulemaking: Mortgage Acts and Practices - Advertising Rule

Science.gov (United States)

2010-09-30

... Acts and Practices - Advertising Rule AGENCY: Federal Trade Commission (FTC or Commission). ACTION...) relating to unfair or deceptive acts and practices that may occur with regard to mortgage advertising, the Mortgage Acts and Practices (MAP) - Advertising Rule (proposed rule). The proposed rule published for...

Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models

Directory of Open Access Journals (Sweden)

Tomasz Kajdanowicz

2016-09-01

Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.

Visibility Graph Based Time Series Analysis.

Science.gov (United States)

Stephen, Mutua; Gu, Changgui; Yang, Huijie

2015-01-01

Network based time series analysis has made considerable achievements in the recent years. By mapping mono/multivariate time series into networks, one can investigate both it's microscopic and macroscopic behaviors. However, most proposed approaches lead to the construction of static networks consequently providing limited information on evolutionary behaviors. In the present paper we propose a method called visibility graph based time series analysis, in which series segments are mapped to visibility graphs as being descriptions of the corresponding states and the successively occurring states are linked. This procedure converts a time series to a temporal network and at the same time a network of networks. Findings from empirical records for stock markets in USA (S&P500 and Nasdaq) and artificial series generated by means of fractional Gaussian motions show that the method can provide us rich information benefiting short-term and long-term predictions. Theoretically, we propose a method to investigate time series from the viewpoint of network of networks.

Visibility Graph Based Time Series Analysis.

Directory of Open Access Journals (Sweden)

Mutua Stephen

Full Text Available Network based time series analysis has made considerable achievements in the recent years. By mapping mono/multivariate time series into networks, one can investigate both it's microscopic and macroscopic behaviors. However, most proposed approaches lead to the construction of static networks consequently providing limited information on evolutionary behaviors. In the present paper we propose a method called visibility graph based time series analysis, in which series segments are mapped to visibility graphs as being descriptions of the corresponding states and the successively occurring states are linked. This procedure converts a time series to a temporal network and at the same time a network of networks. Findings from empirical records for stock markets in USA (S&P500 and Nasdaq and artificial series generated by means of fractional Gaussian motions show that the method can provide us rich information benefiting short-term and long-term predictions. Theoretically, we propose a method to investigate time series from the viewpoint of network of networks.

MSGD: Scalable back-end for indoor magnetic field-based GraphSLAM

OpenAIRE

Gao, C; Harle, Robert Keith

2017-01-01

Simultaneous Localisation and Mapping (SLAM) systems that recover the trajectory of a robot or mobile device are characterised by a front-end and back-end. The front-end uses sensor observations to identify loop closures; the back-end optimises the estimated trajectory to be consistent with these closures. The GraphSLAM framework formulates the back-end problem as a graph-based optimisation on a pose graph. This paper describes a back-end system optimised for very dense sequence-based lo...

Food advertising towards children and Young People in Norway

OpenAIRE

Bugge, Annechen Bahr

2016-01-01

Despite the fact that no studies have been carried out to map the amount of unhealthy food advertising aimed at Norwegian children and adolescents, it is still widely held belief that this type of advertising is disproportionately common. As a consequence, one of the issues high on the agenda in Norway in the 2000s was the possibility of imposing restrictions on advertising for unhealthy foods to children. The purpose of this study is to contribute with a research-based foundation for impleme...

Towards Scalable Graph Computation on Mobile Devices.

Science.gov (United States)

Chen, Yiqi; Lin, Zhiyuan; Pienta, Robert; Kahng, Minsuk; Chau, Duen Horng

2014-10-01

Mobile devices have become increasingly central to our everyday activities, due to their portability, multi-touch capabilities, and ever-improving computational power. Such attractive features have spurred research interest in leveraging mobile devices for computation. We explore a novel approach that aims to use a single mobile device to perform scalable graph computation on large graphs that do not fit in the device's limited main memory, opening up the possibility of performing on-device analysis of large datasets, without relying on the cloud. Based on the familiar memory mapping capability provided by today's mobile operating systems, our approach to scale up computation is powerful and intentionally kept simple to maximize its applicability across the iOS and Android platforms. Our experiments demonstrate that an iPad mini can perform fast computation on large real graphs with as many as 272 million edges (Google+ social graph), at a speed that is only a few times slower than a 13″ Macbook Pro. Through creating a real world iOS app with this technique, we demonstrate the strong potential application for scalable graph computation on a single mobile device using our approach.

Towards Scalable Graph Computation on Mobile Devices

Science.gov (United States)

Chen, Yiqi; Lin, Zhiyuan; Pienta, Robert; Kahng, Minsuk; Chau, Duen Horng

2015-01-01

Mobile devices have become increasingly central to our everyday activities, due to their portability, multi-touch capabilities, and ever-improving computational power. Such attractive features have spurred research interest in leveraging mobile devices for computation. We explore a novel approach that aims to use a single mobile device to perform scalable graph computation on large graphs that do not fit in the device's limited main memory, opening up the possibility of performing on-device analysis of large datasets, without relying on the cloud. Based on the familiar memory mapping capability provided by today's mobile operating systems, our approach to scale up computation is powerful and intentionally kept simple to maximize its applicability across the iOS and Android platforms. Our experiments demonstrate that an iPad mini can perform fast computation on large real graphs with as many as 272 million edges (Google+ social graph), at a speed that is only a few times slower than a 13″ Macbook Pro. Through creating a real world iOS app with this technique, we demonstrate the strong potential application for scalable graph computation on a single mobile device using our approach. PMID:25859564

Storefront cigarette advertising differs by community demographic profile.

Science.gov (United States)

Seidenberg, Andrew B; Caughey, Robert W; Rees, Vaughan W; Connolly, Gregory N

2010-01-01

Tobacco manufacturers have targeted youth and ethnic/racial minorities with tailored advertising. Less is known about how characteristics of storefront tobacco advertisements, such as location, position, size, and content, are used to appeal to demographic subgroups. The occurrence and characteristics of storefront cigarette advertising were observed for all licensed tobacco retailers in two defined communities. Measures were taken in two Boston, Massachusetts, area urban communities: a low-income, minority community and a high-income, nonminority community. No human subjects were involved in this study. Advertisement position (attached or separated from storefront), size (small, medium, or large), mentholation, and price were recorded. Geographic coordinates of tobacco retailers and schools were mapped using ArcGIS 9.2. Differences between the communities in advertisement number and characteristics were assessed using bivariate analyses. Logistic regression was used to ascertain the odds of specific advertising features occurring in the low-income/minority community. The low-income/minority community had more tobacco retailers, and advertisements were more likely to be larger, promote menthol products, have a lower mean advertised price, and occur within 1000 feet of a school. Storefront cigarette advertising characteristics that increase exposure and promote youth initiation were more prominent in a low-income/minority community. The findings emphasize the need for more effective regulation of storefront tobacco advertising.

Exclusivity structures and graph representatives of local complementation orbits

Science.gov (United States)

Cabello, Adán; Parker, Matthew G.; Scarpa, Giannicola; Severini, Simone

2013-07-01

We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lovász number which is equal to its fractional packing number. The vertices of H(G) represent all possible events consistent with the stabilizer group of the graph state associated with G, and exclusive events are adjacent. Mathematically, the graph H(G) corresponds to the orbit of G under local complementation. Physically, the construction translates into graph-theoretic terms the connection between a graph state and a Bell inequality maximally violated by quantum mechanics. In the context of zero-error information theory, the construction suggests a protocol achieving the maximum rate of entanglement-assisted capacity, a quantum mechanical analogue of the Shannon capacity, for each H(G). The violation of the Bell inequality is expressed by the one-shot version of this capacity being strictly larger than the independence number. Finally, given the correspondence between graphs and exclusivity structures, we are able to compute the independence number for certain infinite families of graphs with the use of quantum non-locality, therefore highlighting an application of quantum theory in the proof of a purely combinatorial statement.

PLOT3D (version-5): a computer code for drawing three dimensional graphs, maps and histograms, in single or multiple colours, for mono or stereoscopic viewing

International Nuclear Information System (INIS)

Jayaswal, Balhans

1987-01-01

PLOT3D series of graphic codes (version 1 to 5) have been developed for drawing three dimensional graphs, maps, histograms and simple layout diagrams on monochrome or colour raster graphic terminal and plotter. Of these, PLOT3D Version-5 is an advanced code, equipped with several features that make it specially suitable for drawing 3D maps, multicolour 3D and contour graphs, and 3D layout diagrams, in axonometric or perspective projection. Prior to drawing, graphic parameters that define orientation, magnification, smoothening, shading, colour-map, etc. of the figure can be selected interactively by means of simple commands on the user terminal, or by reading those commands from an input data file. This code requires linking with any one of three supporting libraries: PLOT 10 TCS, PLOT 10 IGL, and CALCOMP, and the figure can be plotted in single colour, or displayed in single or multiple colours depending upon the type of library support and output device. Furthermore, this code can also be used to plot left and right eye view projections of 3D figure for composing a stereoscopic image from them with the aid of a viewer. 14 figures. (author)

3-biplacement of bipartite graphs

Directory of Open Access Journals (Sweden)

Lech Adamus

2008-01-01

Full Text Available Let \\(G=(L,R;E\\ be a bipartite graph with color classes \\(L\\ and \\(R\\ and edge set \\(E\\. A set of two bijections \\(\\{\\varphi_1 , \\varphi_2\\}\\, \\(\\varphi_1 , \\varphi_2 :L \\cup R \\to L \\cup R\\, is said to be a \\(3\\-biplacement of \\(G\\ if \\(\\varphi_1(L= \\varphi_2(L = L\\ and \\(E \\cap \\varphi_1^*(E=\\emptyset\\, \\(E \\cap \\varphi_2^*(E=\\emptyset\\, \\(\\varphi_1^*(E \\cap \\varphi_2^*(E=\\emptyset\\, where \\(\\varphi_1^*\\, \\(\\varphi_2^*\\ are the maps defined on \\(E\\, induced by \\(\\varphi_1\\, \\(\\varphi_2\\, respectively. We prove that if \\(|L| = p\\, \\(|R| = q\\, \\(3 \\leq p \\leq q\\, then every graph \\(G=(L,R;E\\ of size at most \\(p\\ has a \\(3\\-biplacement.

A graph rewriting programming language for graph drawing

OpenAIRE

Rodgers, Peter

1998-01-01

This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computationally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools are all text based. Recent developments in graph rewriting systems have produced computationally com...

Mining chemical reactions using neighborhood behavior and condensed graphs of reactions approaches.

Science.gov (United States)

de Luca, Aurélie; Horvath, Dragos; Marcou, Gilles; Solov'ev, Vitaly; Varnek, Alexandre

2012-09-24

This work addresses the problem of similarity search and classification of chemical reactions using Neighborhood Behavior (NB) and Condensed Graphs of Reaction (CGR) approaches. The CGR formalism represents chemical reactions as a classical molecular graph with dynamic bonds, enabling descriptor calculations on this graph. Different types of the ISIDA fragment descriptors generated for CGRs in combination with two metrics--Tanimoto and Euclidean--were considered as chemical spaces, to serve for reaction dissimilarity scoring. The NB method has been used to select an optimal combination of descriptors which distinguish different types of chemical reactions in a database containing 8544 reactions of 9 classes. Relevance of NB analysis has been validated in generic (multiclass) similarity search and in clustering with Self-Organizing Maps (SOM). NB-compliant sets of descriptors were shown to display enhanced mapping propensities, allowing the construction of better Self-Organizing Maps and similarity searches (NB and classical similarity search criteria--AUC ROC--correlate at a level of 0.7). The analysis of the SOM clusters proved chemically meaningful CGR substructures representing specific reaction signatures.

Storefront Cigarette Advertising Differs by Community Demographic Profile

Science.gov (United States)

Seidenberg, Andrew B.; Caughey, Robert W.; Rees, Vaughan W.; Connolly, Gregory N.

2011-01-01

Purpose Tobacco manufacturers have targeted youth and ethnic/racial minorities with tailored advertising. Less is known about how characteristics of storefront tobacco advertisements, such as location, position, size, and content, are used to appeal to demographic subgroups. Design The occurrence and characteristics of storefront cigarette advertising were observed for all licensed tobacco retailers in two defined communities. Setting Measures were taken in two Boston, Massachusetts, area urban communities: a low-income, minority community and a high-income, nonminority community. Subjects No human subjects were involved in this study. Measures Advertisement position (attached or separated from storefront), size (small, medium, or large), mentholation, and price were recorded. Geographic coordinates of tobacco retailers and schools were mapped using ArcGIS 9.2. Analysis Differences between the communities in advertisement number and characteristics were assessed using bivariate analyses. Logistic regression was used to ascertain the odds of specific advertising features occurring in the low-income/minority community. Results The low-income/minority community had more tobacco retailers, and advertisements were more likely to be larger, promote menthol products, have a lower mean advertised price, and occur within 1000 feet of a school. Conclusion Storefront cigarette advertising characteristics that increase exposure and promote youth initiation were more prominent in a low-income/minority community. The findings emphasize the need for more effective regulation of storefront tobacco advertising. PMID:20594091

A method for independent component graph analysis of resting-state fMRI

DEFF Research Database (Denmark)

de Paula, Demetrius Ribeiro; Ziegler, Erik; Abeyasinghe, Pubuditha M.

2017-01-01

Introduction Independent component analysis (ICA) has been extensively used for reducing task-free BOLD fMRI recordings into spatial maps and their associated time-courses. The spatially identified independent components can be considered as intrinsic connectivity networks (ICNs) of non-contiguou......Introduction Independent component analysis (ICA) has been extensively used for reducing task-free BOLD fMRI recordings into spatial maps and their associated time-courses. The spatially identified independent components can be considered as intrinsic connectivity networks (ICNs) of non......-contiguous regions. To date, the spatial patterns of the networks have been analyzed with techniques developed for volumetric data. Objective Here, we detail a graph building technique that allows these ICNs to be analyzed with graph theory. Methods First, ICA was performed at the single-subject level in 15 healthy...... parcellated regions. Third, between-node functional connectivity was established by building edge weights for each networks. Group-level graph analysis was finally performed for each network and compared to the classical network. Results Network graph comparison between the classically constructed network...

Graph based communication analysis for hardware/software codesign

DEFF Research Database (Denmark)

Knudsen, Peter Voigt; Madsen, Jan

1999-01-01

In this paper we present a coarse grain CDFG (Control/Data Flow Graph) model suitable for hardware/software partitioning of single processes and demonstrate how it is necessary to perform various transformations on the graph structure before partitioning in order to achieve a structure that allows...... for accurate estimation of communication overhead between nodes mapped to different processors. In particular, we demonstrate how various transformations of control structures can lead to a more accurate communication analysis and more efficient implementations. The purpose of the transformations is to obtain...

Graph Aggregation

NARCIS (Netherlands)

Endriss, U.; Grandi, U.

Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference

Reproducibility of graph metrics in fMRI networks

Directory of Open Access Journals (Sweden)

Qawi K Telesford

2010-12-01

Full Text Available The reliability of graph metrics calculated in network analysis is essential to the interpretation of complex network organization. These graph metrics are used to deduce the small-world properties in networks. In this study, we investigated the test-retest reliability of graph metrics from functional magnetic resonance imaging (fMRI data collected for two runs in 45 healthy older adults. Graph metrics were calculated on data for both runs and compared using intraclass correlation coefficient (ICC statistics and Bland-Altman (BA plots. ICC scores describe the level of absolute agreement between two measurements and provide a measure of reproducibility. For mean graph metrics, ICC scores were high for clustering coefficient (ICC=0.86, global efficiency (ICC=0.83, path length (ICC=0.79, and local efficiency (ICC=0.75; the ICC score for degree was found to be low (ICC=0.29. ICC scores were also used to generate reproducibility maps in brain space to test voxel-wise reproducibility for unsmoothed and smoothed data. Reproducibility was uniform across the brain for global efficiency and path length, but was only high in network hubs for clustering coefficient, local efficiency and degree. BA plots were used to test the measurement repeatability of all graph metrics. All graph metrics fell within the limits for repeatability. Together, these results suggest that with exception of degree, mean graph metrics are reproducible and suitable for clinical studies. Further exploration is warranted to better understand reproducibility across the brain on a voxel-wise basis.

Degree distributions of the visibility graphs mapped from fractional Brownian motions and multifractal random walks

International Nuclear Information System (INIS)

Ni Xiaohui; Jiang Zhiqiang; Zhou Weixing

2009-01-01

The dynamics of a complex system is usually recorded in the form of time series, which can be studied through its visibility graph from a complex network perspective. We investigate the visibility graphs extracted from fractional Brownian motions and multifractal random walks, and find that the degree distributions exhibit power-law behaviors, in which the power-law exponent α is a linear function of the Hurst index H of the time series. We also find that the degree distribution of the visibility graph is mainly determined by the temporal correlation of the original time series with minor influence from the possible multifractal nature. As an example, we study the visibility graphs constructed from three Chinese stock market indexes and unveil that the degree distributions have power-law tails, where the tail exponents of the visibility graphs and the Hurst indexes of the indexes are close to the α∼H linear relationship.

Invariant graphs of a family of non-uniformly expanding skew products over Markov maps

Science.gov (United States)

Walkden, C. P.; Withers, T.

2018-06-01

We consider a family of skew-products of the form where T is a continuous, expanding, locally eventually onto Markov map and is a family of homeomorphisms of . A function is said to be an invariant graph if is an invariant set for the skew-product; equivalently, u(T(x))  =  g x (u(x)). A well-studied problem is to consider the existence, regularity and dimension-theoretic properties of such functions, usually under strong contraction or expansion conditions (in terms of Lyapunov exponents or partial hyperbolicity) in the fibre direction. Here we consider such problems in a setting where the Lyapunov exponent in the fibre direction is zero on a set of periodic orbits but expands except on a neighbourhood of these periodic orbits. We prove that u either has the structure of a ‘quasi-graph’ (or ‘bony graph’) or is as smooth as the dynamics, and we give a criteria for this to happen.

Food advertising towards children and young people in Norway.

Science.gov (United States)

Bugge, Annechen Bahr

2016-03-01

Despite the fact that no studies have been carried out to map the amount of unhealthy food advertising aimed at Norwegian children and adolescents, it is still widely held belief that this type of advertising is disproportionately common. As a consequence, one of the issues high on the agenda in Norway in the 2000s was the possibility of imposing restrictions on advertising for unhealthy foods to children. The purpose of this study is to contribute with a research-based foundation for implementing this health initiative by mapping food marketing in media channels widely used by children and adolescents. In sum, the study shows that the food industry spends a lot of resources to influence young consumers' eating and drinking habits. Compared with studies from USA, UK and Australia, however, there are, strong indications that there is significantly less unhealthy food advertising in Scandinavian countries. Similar to a previous Swedish study, this study shows that Norwegian children and young people were exposed to little advertising for unhealthy food products through media channels such as TV, the Internet, magazines, comics and cinemas. The study also supports critical remarks from some researchers that the extensive use of the international discourse as a political argument and recommendation for Norwegian conditions is not accurate. For the future it may be beneficial to look more closely at the relationship between advertising and health policy, and how this relationship can be further developed to improve children and young people's diet. Copyright © 2015 Elsevier Ltd. All rights reserved.

Proxy Graph: Visual Quality Metrics of Big Graph Sampling.

Science.gov (United States)

Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra

2017-06-01

Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.

Quantum centrality testing on directed graphs via P T -symmetric quantum walks

Science.gov (United States)

Izaac, J. A.; Wang, J. B.; Abbott, P. C.; Ma, X. S.

2017-09-01

Various quantum-walk-based algorithms have been proposed to analyze and rank the centrality of graph vertices. However, issues arise when working with directed graphs: the resulting non-Hermitian Hamiltonian leads to nonunitary dynamics, and the total probability of the quantum walker is no longer conserved. In this paper, we discuss a method for simulating directed graphs using P T -symmetric quantum walks, allowing probability-conserving nonunitary evolution. This method is equivalent to mapping the directed graph to an undirected, yet weighted, complete graph over the same vertex set, and can be extended to cover interdependent networks of directed graphs. Previous work has shown centrality measures based on the continuous-time quantum walk provide an eigenvectorlike quantum centrality; using the P T -symmetric framework, we extend these centrality algorithms to directed graphs with a significantly reduced Hilbert space compared to previous proposals. In certain cases, this centrality measure provides an advantage over classical algorithms used in network analysis, for example, by breaking vertex rank degeneracy. Finally, we perform a statistical analysis over ensembles of random graphs, and show strong agreement with the classical PageRank measure on directed acyclic graphs.

Total edge irregularity strength of (n,t)-kite graph

Science.gov (United States)

Winarsih, Tri; Indriati, Diari

2018-04-01

Let G(V, E) be a simple, connected, and undirected graph with vertex set V and edge set E. A total k-labeling is a map that carries vertices and edges of a graph G into a set of positive integer labels {1, 2, …, k}. An edge irregular total k-labeling λ :V(G)\\cup E(G)\\to \\{1,2,\\ldots,k\\} of a graph G is a labeling of vertices and edges of G in such a way that for any different edges e and f, weights wt(e) and wt(f) are distinct. The weight wt(e) of an edge e = xy is the sum of the labels of vertices x and y and the label of the edge e. The total edge irregularity strength of G, tes(G), is defined as the minimum k for which a graph G has an edge irregular total k-labeling. An (n, t)-kite graph consist of a cycle of length n with a t-edge path (the tail) attached to one vertex of a cycle. In this paper, we investigate the total edge irregularity strength of the (n, t)-kite graph, with n > 3 and t > 1. We obtain the total edge irregularity strength of the (n, t)-kite graph is tes((n, t)-kite) = \\lceil \\frac{n+t+2}{3}\\rceil .

New algorithm improves fine structure of the barley consensus SNP map

Directory of Open Access Journals (Sweden)

Endelman Jeffrey B

2011-08-01

Full Text Available Abstract Background The need to integrate information from multiple linkage maps is a long-standing problem in genetics. One way to visualize the complex ordinal relationships is with a directed graph, where each vertex in the graph is a bin of markers. When there are no ordering conflicts between the linkage maps, the result is a directed acyclic graph, or DAG, which can then be linearized to produce a consensus map. Results New algorithms for the simplification and linearization of consensus graphs have been implemented as a package for the R computing environment called DAGGER. The simplified consensus graphs produced by DAGGER exactly capture the ordinal relationships present in a series of linkage maps. Using either linear or quadratic programming, DAGGER generates a consensus map with minimum error relative to the linkage maps while remaining ordinally consistent with them. Both linearization methods produce consensus maps that are compressed relative to the mean of the linkage maps. After rescaling, however, the consensus maps had higher accuracy (and higher marker density than the individual linkage maps in genetic simulations. When applied to four barley linkage maps genotyped at nearly 3000 SNP markers, DAGGER produced a consensus map with improved fine structure compared to the existing barley consensus SNP map. The root-mean-squared error between the linkage maps and the DAGGER map was 0.82 cM per marker interval compared to 2.28 cM for the existing consensus map. Examination of the barley hardness locus at the 5HS telomere, for which there is a physical map, confirmed that the DAGGER output was more accurate for fine structure analysis. Conclusions The R package DAGGER is an effective, freely available resource for integrating the information from a set of consistent linkage maps.

BETWEEN ADVERTISING PRACTITIONERS AND ACADEMICS IN ...

African Journals Online (AJOL)

USER

would complements the existing literature; and it maps out directions for future empirical investigations. Not without inherent limitations, the research reviewed literature ... long decades of research, advertising is perceived to be the least accountable function in ..... The Future of Consumer Decision Making in the Age of New.

Chromatic graph theory

CERN Document Server

Chartrand, Gary; Rosen, Kenneth H

2008-01-01

Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...

Several classes of graphs and their r-dynamic chromatic numbers

Science.gov (United States)

Dafik; Meganingtyas, D. E. W.; Dwidja Purnomo, K.; Dicky Tarmidzi, M.; Hesti Agustin, Ika

2017-06-01

Let G be a simple, connected and undirected graph. Let r, k be natural numbers. By a proper k-coloring of a graph G, we mean a map c : V (G) → S, where |S| = k, such that any two adjacent vertices receive different colors. An r-dynamic k-coloring is a proper k-coloring c of G such that |c(N(v))| ≥ min{r, d(v)} for each vertex v in V (G), where N(v) is the neighborhood of v and c(S) = {c(v) : v ∈ S} for a vertex subset S. The r-dynamic chromatic number, written as χ r (G), is the minimum k such that G has an r-dynamic k-coloring. By simple observation it is easy to see that χ r (G) ≤ χ r+1(G), however χ r+1(G) - χ r (G) does not always show a small difference for any r. Thus, finding an exact value of χ r (G) is significantly useful. In this paper, we will study some of them especially when G are prism graph, three-cyclical ladder graph, joint graph and circulant graph.

A Structural-Lexical Measure of Semantic Similarity for Geo-Knowledge Graphs

Directory of Open Access Journals (Sweden)

Andrea Ballatore

2015-04-01

Full Text Available Graphs have become ubiquitous structures to encode geographic knowledge online. The Semantic Web’s linked open data, folksonomies, wiki websites and open gazetteers can be seen as geo-knowledge graphs, that is labeled graphs whose vertices represent geographic concepts and whose edges encode the relations between concepts. To compute the semantic similarity of concepts in such structures, this article defines the network-lexical similarity measure (NLS. This measure estimates similarity by combining two complementary sources of information: the network similarity of vertices and the semantic similarity of the lexical definitions. NLS is evaluated on the OpenStreetMap Semantic Network, a crowdsourced geo-knowledge graph that describes geographic concepts. The hybrid approach outperforms both network and lexical measures, obtaining very strong correlation with the similarity judgments of human subjects.

Effectiveness of humor advertising on advertising success

OpenAIRE

S, venkatesh; N, senthilkumar

2015-01-01

In global advertising ‘humor’ is the most effective emotion used in advertising compared to other emotional appeals. Advertisers and researchers more interested in Humor in advertising for more than 100 years. But there is no review paper for Impact of humor in advertising till twenty two years of time, in between period there was lot of research outcomes published about humor in advertising. The purpose of this paper to get detailed review about Impact of humor in advertising for 40 years an...

Advertising representation, treatment menu and economic circulation of substance misuse treatment centers in Iran: a rapid survey based on newspaper advertisements.

Science.gov (United States)

Rezaee, Sobhan; Ekhtiari, Hamed

2014-05-01

Daily newspapers are the main platform by which substance misuse treatment (SMT) centers in Iran advertise their services. However, these advertisements provide little information on treatment options or costs. The current research aimed to use advertisements to compile a schema of treatment services and to map the extent and nature of drug treatments offered. During a four-week period (April to May) in 2009, the four most popular Persian newspapers printed in Tehran were reviewed. Across these publications 1704 advertisements were posted by 66 SMT centers. Each center was then contacted by telephone to complete a structured interview about services offered and related costs. The advertisements were also decoded through a quantitative contextual analysis method. On average, each SMT center published 26 advertisements during the review period, costing 421 US$. In addition, advertisements included word signifiers in six main categories including centers' introduction (100%), treatment types (91%), treatment duration (68%), medicines (70%), treatment features (60%) and psychological facilities (52%). The three detoxification programs advertised were the rapid method (57% of clinics, 443.23 US$), buprenorphine (68%, 265 US$) and methadone (71%, 137 US$). More than 90% of the centers in Tehran were offering methadone maintenance (99 US$, per month). SMT services in the Iranian market ranged from abstinence to maintenance programs, with opiates as the main focus. This review of centers' advertisements provides an indirect but rapidly obtained picture of the drug misuse treatment network. Copyright © 2014 Elsevier B.V. All rights reserved.

Factors influencing advertising effectiveness and purchase intention on Instagram

OpenAIRE

Mathisen, Alexander; Stangeby, Mats Fredrick

2017-01-01

Instagram has emerged as an important social media and advertising platform, but little or no research has been done to investigate how the users perceive various Instagram advertisement. The current research relies on two studies to determine which attributes in an ad users notice and favour. The first study is an exploratory study utilising qualitative cognitive mapping to address the key attributes for ad evaluation. The second study tests overall ad evaluation using conjoin...

GRAPES: a software for parallel searching on biological graphs targeting multi-core architectures.

Directory of Open Access Journals (Sweden)

Rosalba Giugno

Full Text Available Biological applications, from genomics to ecology, deal with graphs that represents the structure of interactions. Analyzing such data requires searching for subgraphs in collections of graphs. This task is computationally expensive. Even though multicore architectures, from commodity computers to more advanced symmetric multiprocessing (SMP, offer scalable computing power, currently published software implementations for indexing and graph matching are fundamentally sequential. As a consequence, such software implementations (i do not fully exploit available parallel computing power and (ii they do not scale with respect to the size of graphs in the database. We present GRAPES, software for parallel searching on databases of large biological graphs. GRAPES implements a parallel version of well-established graph searching algorithms, and introduces new strategies which naturally lead to a faster parallel searching system especially for large graphs. GRAPES decomposes graphs into subcomponents that can be efficiently searched in parallel. We show the performance of GRAPES on representative biological datasets containing antiviral chemical compounds, DNA, RNA, proteins, protein contact maps and protein interactions networks.

Construction and application research of knowledge graph in aviation risk field

Directory of Open Access Journals (Sweden)

Zhao Qian

2018-01-01

Full Text Available Since the causes of aviation accidents and risks are complicated, concealed, unpredictable and difficult to be investigated, in order to achieve the efficient organization and knowledge sharing of the historical cases of aviation risk events, this paper put forward the method of constructing vertical knowledge graph for aviation risk field. Firstly, the data-driven incremental construction technology is used to build aviation risk event ontology model. Secondly, the pattern-based knowledge mapping mechanism, which transform structured data into RDF (Resource Description Framework data for storage, is proposed. And then the application, update and maintenance of the knowledge graph are described. Finally, knowledge graph construction system in aviation risk field is developed; and the data from American Aviation Safety Reporting System (ASRS is used as an example to verify the rationality and validity of the knowledge graph construction method. Practice has proved that the construction of knowledge graph has a guiding significance for the case information organization and sharing on the field of aviation risk.

Graph Regularized Auto-Encoders for Image Representation.

Science.gov (United States)

Yiyi Liao; Yue Wang; Yong Liu

2017-06-01

Image representation has been intensively explored in the domain of computer vision for its significant influence on the relative tasks such as image clustering and classification. It is valuable to learn a low-dimensional representation of an image which preserves its inherent information from the original image space. At the perspective of manifold learning, this is implemented with the local invariant idea to capture the intrinsic low-dimensional manifold embedded in the high-dimensional input space. Inspired by the recent successes of deep architectures, we propose a local invariant deep nonlinear mapping algorithm, called graph regularized auto-encoder (GAE). With the graph regularization, the proposed method preserves the local connectivity from the original image space to the representation space, while the stacked auto-encoders provide explicit encoding model for fast inference and powerful expressive capacity for complex modeling. Theoretical analysis shows that the graph regularizer penalizes the weighted Frobenius norm of the Jacobian matrix of the encoder mapping, where the weight matrix captures the local property in the input space. Furthermore, the underlying effects on the hidden representation space are revealed, providing insightful explanation to the advantage of the proposed method. Finally, the experimental results on both clustering and classification tasks demonstrate the effectiveness of our GAE as well as the correctness of the proposed theoretical analysis, and it also suggests that GAE is a superior solution to the current deep representation learning techniques comparing with variant auto-encoders and existing local invariant methods.

Graph theoretical model of a sensorimotor connectome in zebrafish.

Science.gov (United States)

Stobb, Michael; Peterson, Joshua M; Mazzag, Borbala; Gahtan, Ethan

2012-01-01

Mapping the detailed connectivity patterns (connectomes) of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron) varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.

MadEvent: automatic event generation with MadGraph

International Nuclear Information System (INIS)

Maltoni, Fabio; Stelzer, Tim

2003-01-01

We present a new multi-channel integration method and its implementation in the multi-purpose event generator MadEvent, which is based on MadGraph. Given a process, MadGraph automatically identifies all the relevant subprocesses, generates both the amplitudes and the mappings needed for an efficient integration over the phase space, and passes them to MadEvent. As a result, a process-specific, stand-alone code is produced that allows the user to calculate cross sections and produce unweighted events in a standard output format. Several examples are given for processes that are relevant for physics studies at present and forthcoming colliders. (author)

A Research Graph dataset for connecting research data repositories using RD-Switchboard.

Science.gov (United States)

Aryani, Amir; Poblet, Marta; Unsworth, Kathryn; Wang, Jingbo; Evans, Ben; Devaraju, Anusuriya; Hausstein, Brigitte; Klas, Claus-Peter; Zapilko, Benjamin; Kaplun, Samuele

2018-05-29

This paper describes the open access graph dataset that shows the connections between Dryad, CERN, ANDS and other international data repositories to publications and grants across multiple research data infrastructures. The graph dataset was created using the Research Graph data model and the Research Data Switchboard (RD-Switchboard), a collaborative project by the Research Data Alliance DDRI Working Group (DDRI WG) with the aim to discover and connect the related research datasets based on publication co-authorship or jointly funded grants. The graph dataset allows researchers to trace and follow the paths to understanding a body of work. By mapping the links between research datasets and related resources, the graph dataset improves both their discovery and visibility, while avoiding duplicate efforts in data creation. Ultimately, the linked datasets may spur novel ideas, facilitate reproducibility and re-use in new applications, stimulate combinatorial creativity, and foster collaborations across institutions.

Content-based image retrieval using a signature graph and a self-organizing map

Directory of Open Access Journals (Sweden)

Van Thanh The

2016-06-01

Full Text Available In order to effectively retrieve a large database of images, a method of creating an image retrieval system CBIR (contentbased image retrieval is applied based on a binary index which aims to describe features of an image object of interest. This index is called the binary signature and builds input data for the problem of matching similar images. To extract the object of interest, we propose an image segmentation method on the basis of low-level visual features including the color and texture of the image. These features are extracted at each block of the image by the discrete wavelet frame transform and the appropriate color space. On the basis of a segmented image, we create a binary signature to describe the location, color and shape of the objects of interest. In order to match similar images, we provide a similarity measure between the images based on binary signatures. Then, we present a CBIR model which combines a signature graph and a self-organizing map to cluster and store similar images. To illustrate the proposed method, experiments on image databases are reported, including COREL,Wang and MSRDI.

Graph sampling

OpenAIRE

Zhang, L.-C.; Patone, M.

2017-01-01

We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.

Linguistically-Relevant Diachronic Study of Cultural Values in Early British Advertising Discourse

Science.gov (United States)

Kochetova, Larisa A.

2016-01-01

Drawing on linguistic data retrieved from early advertisements published in British newspapers between 1788 and 1900, the study seeks to map out a set of values and account for linguistic means used to codify them in the diachronic perspective. For the purposes of the study, the corpus of advertisements from random issues of British newspapers…

Algorithms for Planar Graphs and Graphs in Metric Spaces

DEFF Research Database (Denmark)

Wulff-Nilsen, Christian

structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...

Multiple Illuminant Colour Estimation via Statistical Inference on Factor Graphs.

Science.gov (United States)

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.

Interaction between advertising agency and advertiser in creative advertising startegy preparation in Lithuania market

OpenAIRE

Vasiliauskaitė, Kristina

2007-01-01

On the grounds of theoretical and empirical studies, the article analyses some interaction between the advertisement agencies and advertisement provider during the development of creative advertisement strategy. The following assumptions justifying the importance of interaction have been developed: namely, the need to integrate the knowledge and competence of advertisement agencies and advertisement provider, creativity of advertisement agencies and possible objective approach to the business...

Graph 500 on OpenSHMEM: Using a Practical Survey of Past Work to Motivate Novel Algorithmic Developments

Energy Technology Data Exchange (ETDEWEB)

Grossman, Max [Rice Univ., Houston, TX (United States); Pritchard Jr., Howard Porter [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Budimlic, Zoran [Rice Univ., Houston, TX (United States); Sarkar, Vivek [Rice Univ., Houston, TX (United States)

2016-12-22

Graph500 [14] is an effort to offer a standardized benchmark across large-scale distributed platforms which captures the behavior of common communicationbound graph algorithms. Graph500 differs from other large-scale benchmarking efforts (such as HPL [6] or HPGMG [7]) primarily in the irregularity of its computation and data access patterns. The core computational kernel of Graph500 is a breadth-first search (BFS) implemented on an undirected graph. The output of Graph500 is a spanning tree of the input graph, usually represented by a predecessor mapping for every node in the graph. The Graph500 benchmark defines several pre-defined input sizes for implementers to test against. This report summarizes investigation into implementing the Graph500 benchmark on OpenSHMEM, and focuses on first building a strong and practical understanding of the strengths and limitations of past work before proposing and developing novel extensions.

Belief propagation and loop series on planar graphs

International Nuclear Information System (INIS)

Chertkov, Michael; Teodorescu, Razvan; Chernyak, Vladimir Y

2008-01-01

We discuss a generic model of Bayesian inference with binary variables defined on edges of a planar graph. The Loop Calculus approach of Chertkov and Chernyak (2006 Phys. Rev. E 73 065102(R) [cond-mat/0601487]; 2006 J. Stat. Mech. P06009 [cond-mat/0603189]) is used to evaluate the resulting series expansion for the partition function. We show that, for planar graphs, truncating the series at single-connected loops reduces, via a map reminiscent of the Fisher transformation (Fisher 1961 Phys. Rev. 124 1664), to evaluating the partition function of the dimer-matching model on an auxiliary planar graph. Thus, the truncated series can be easily re-summed, using the Pfaffian formula of Kasteleyn (1961 Physics 27 1209). This allows us to identify a big class of computationally tractable planar models reducible to a dimer model via the Belief Propagation (gauge) transformation. The Pfaffian representation can also be extended to the full Loop Series, in which case the expansion becomes a sum of Pfaffian contributions, each associated with dimer matchings on an extension to a subgraph of the original graph. Algorithmic consequences of the Pfaffian representation, as well as relations to quantum and non-planar models, are discussed

Graph theoretical model of a sensorimotor connectome in zebrafish.

Directory of Open Access Journals (Sweden)

Michael Stobb

Full Text Available Mapping the detailed connectivity patterns (connectomes of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.

Advertising

OpenAIRE

Crawford, Robert

2008-01-01

Sydney is Australia’s advertising capital and the relationship between the city and the advertising industry stretches back to the earliest years of European settlement. Advertising helped propel commercial activity in Sydney and the advertising industry has been no less active in shaping Sydney, illuminating the city’s skyline and streetscape, and influencing the lives of all Sydneysiders – from suburban consumers to esteemed artists. Moreover, advertising has promoted the city itself as a ...

Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph

Directory of Open Access Journals (Sweden)

P. Anusha Devi

2015-10-01

Full Text Available An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G,$ is the minimum number of da-ecards that uniquely determines $G.$  The adversary degree associated edge reconstruction number of a graph $G, adern(G,$ is the minimum number $k$ such that every collection of $k$ da-ecards of $G$ uniquely determines $G.$ The maximal subgraph without end vertices of a graph $G$ which is not a tree is the pruned graph of $G.$ It is shown that $dern$ of complete multipartite graphs and some connected graphs with regular pruned graph is $1$ or $2.$ We also determine $dern$ and $adern$ of corona product of standard graphs.

Labeling RDF Graphs for Linear Time and Space Querying

Science.gov (United States)

Furche, Tim; Weinzierl, Antonius; Bry, François

Indices and data structures for web querying have mostly considered tree shaped data, reflecting the view of XML documents as tree-shaped. However, for RDF (and when querying ID/IDREF constraints in XML) data is indisputably graph-shaped. In this chapter, we first study existing indexing and labeling schemes for RDF and other graph datawith focus on support for efficient adjacency and reachability queries. For XML, labeling schemes are an important part of the widespread adoption of XML, in particular for mapping XML to existing (relational) database technology. However, the existing indexing and labeling schemes for RDF (and graph data in general) sacrifice one of the most attractive properties of XML labeling schemes, the constant time (and per-node space) test for adjacency (child) and reachability (descendant). In the second part, we introduce the first labeling scheme for RDF data that retains this property and thus achieves linear time and space processing of acyclic RDF queries on a significantly larger class of graphs than previous approaches (which are mostly limited to tree-shaped data). Finally, we show how this labeling scheme can be applied to (acyclic) SPARQL queries to obtain an evaluation algorithm with time and space complexity linear in the number of resources in the queried RDF graph.

Introduction to graph theory

CERN Document Server

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

Graph Theory. 2. Vertex Descriptors and Graph Coloring

Directory of Open Access Journals (Sweden)

Lorentz JÄNTSCHI

2002-12-01

Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.

Advertising Agencies

DEFF Research Database (Denmark)

Moeran, Brian

2015-01-01

Advertising agencies are the most significant organizations in the development of advertising and marketing worldwide. An advertising agency is an independent service company, composed of business, marketing and creative people, who develop, prepare, and place advertising in advertising media...... for their clients, the advertisers, who are in search of customers for their goods and services. Agencies thus mediate between three different but interlocking social groups: industry, media, and consumers. The history of advertising is largely the history of the advertising agencies that have served the needs....... This article is concerned with the origins, early developments, organization, compensation arrangements, and accounts of contemporary full-service advertising agencies....

On an edge partition and root graphs of some classes of line graphs

Directory of Open Access Journals (Sweden)

K Pravas

2017-04-01

Full Text Available The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.

Graphs and matrices

CERN Document Server

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...

Advertising literacy and children’s susceptibility to advertising

OpenAIRE

Rozendaal, E.

2011-01-01

This dissertation covers two areas of research that expand our knowledge on children’s advertising literacy (i.e., advertising-related knowledge). The first part addresses the development of children’s advertising literacy into adult-like levels. The second part focuses on the role of advertising literacy in reducing children’s susceptibility to advertising effects. In doing so, this dissertation not only deepens the existing theoretical and empirical insights on children’s advertising litera...

Graphs cospectral with a friendship graph or its complement

Directory of Open Access Journals (Sweden)

Alireza Abdollahi

2013-12-01

Full Text Available Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length $4$ or $5$, then $Gcong F_n$. Moreover if $G$ is connected and planar then $Gcong F_n$.All but one of connected components of $G$ are isomorphic to $K_2$.The complement $overline{F_n}$ of the friendship graph is determined by its adjacency eigenvalues, that is, if $overline{F_n}$ is cospectral with a graph $H$, then $Hcong overline{F_n}$.

Graph embedding with rich information through heterogeneous graph

KAUST Repository

Sun, Guolei

2017-11-12

Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most existing algorithms for graph embedding only rely on the topology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this thesis, we proposed a novel and general framework for graph embedding with rich text information (GERI) through constructing a heterogeneous network, in which we integrate node and edge content information with graph topology. Specially, we designed a novel biased random walk to explore the constructed heterogeneous network with the notion of flexible neighborhood. Our sampling strategy can compromise between BFS and DFS local search on heterogeneous graph. To further improve our algorithm, we proposed semi-supervised GERI (SGERI), which learns graph embedding in an discriminative manner through heterogeneous network with label information. The efficacy of our method is demonstrated by extensive comparison experiments with 9 baselines over multi-label and multi-class classification on various datasets including Citeseer, Cora, DBLP and Wiki. It shows that GERI improves the Micro-F1 and Macro-F1 of node classification up to 10%, and SGERI improves GERI by 5% in Wiki.

Topics in graph theory graphs and their Cartesian product

CERN Document Server

Imrich, Wilfried; Rall, Douglas F

2008-01-01

From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.

Key provisions humanities research advertising and advertising exposure

OpenAIRE

A. A. Sogorin

2015-01-01

The basic directions of advertising studying as part of the research subject of separate social and humanitarian sciences. The definition of advertising is given. It’s considered as a holistic socio­economic phenomenon, which consists of three basic components: advertising as a product, the final incarnation in the material and ideal forms of the customer’s ideas; advertising as an activity that is advertising as a profession; advertising as an integral part of the social space of the individ...

Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

Science.gov (United States)

Nagarathinam, R.; Parvathi, N.

2018-04-01

Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat

Graph-cut based discrete-valued image reconstruction.

Science.gov (United States)

Tuysuzoglu, Ahmet; Karl, W Clem; Stojanovic, Ivana; Castañòn, David; Ünlü, M Selim

2015-05-01

Efficient graph-cut methods have been used with great success for labeling and denoising problems occurring in computer vision. Unfortunately, the presence of linear image mappings has prevented the use of these techniques in most discrete-amplitude image reconstruction problems. In this paper, we develop a graph-cut based framework for the direct solution of discrete amplitude linear image reconstruction problems cast as regularized energy function minimizations. We first analyze the structure of discrete linear inverse problem cost functions to show that the obstacle to the application of graph-cut methods to their solution is the variable mixing caused by the presence of the linear sensing operator. We then propose to use a surrogate energy functional that overcomes the challenges imposed by the sensing operator yet can be utilized efficiently in existing graph-cut frameworks. We use this surrogate energy functional to devise a monotonic iterative algorithm for the solution of discrete valued inverse problems. We first provide experiments using local convolutional operators and show the robustness of the proposed technique to noise and stability to changes in regularization parameter. Then we focus on nonlocal, tomographic examples where we consider limited-angle data problems. We compare our technique with state-of-the-art discrete and continuous image reconstruction techniques. Experiments show that the proposed method outperforms state-of-the-art techniques in challenging scenarios involving discrete valued unknowns.

Lung vessel segmentation in CT images using graph-cuts

Science.gov (United States)

Zhai, Zhiwei; Staring, Marius; Stoel, Berend C.

2016-03-01

Accurate lung vessel segmentation is an important operation for lung CT analysis. Filters that are based on analyzing the eigenvalues of the Hessian matrix are popular for pulmonary vessel enhancement. However, due to their low response at vessel bifurcations and vessel boundaries, extracting lung vessels by thresholding the vesselness is not sufficiently accurate. Some methods turn to graph-cuts for more accurate segmentation, as it incorporates neighbourhood information. In this work, we propose a new graph-cuts cost function combining appearance and shape, where CT intensity represents appearance and vesselness from a Hessian-based filter represents shape. Due to the amount of voxels in high resolution CT scans, the memory requirement and time consumption for building a graph structure is very high. In order to make the graph representation computationally tractable, those voxels that are considered clearly background are removed from the graph nodes, using a threshold on the vesselness map. The graph structure is then established based on the remaining voxel nodes, source/sink nodes and the neighbourhood relationship of the remaining voxels. Vessels are segmented by minimizing the energy cost function with the graph-cuts optimization framework. We optimized the parameters used in the graph-cuts cost function and evaluated the proposed method with two manually labeled sub-volumes. For independent evaluation, we used 20 CT scans of the VESSEL12 challenge. The evaluation results of the sub-volume data show that the proposed method produced a more accurate vessel segmentation compared to the previous methods, with F1 score 0.76 and 0.69. In the VESSEL12 data-set, our method obtained a competitive performance with an area under the ROC curve of 0.975, especially among the binary submissions.

Handbook of graph grammars and computing by graph transformation

CERN Document Server

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

A note on intrinsic conditional autoregressive models for disconnected graphs

KAUST Repository

Freni-Sterrantino, Anna

2018-05-23

In this note we discuss (Gaussian) intrinsic conditional autoregressive (CAR) models for disconnected graphs, with the aim of providing practical guidelines for how these models should be defined, scaled and implemented. We show how these suggestions can be implemented in two examples, on disease mapping.

A note on intrinsic conditional autoregressive models for disconnected graphs

KAUST Repository

Freni-Sterrantino, Anna; Ventrucci, Massimo; Rue, Haavard

2018-01-01

In this note we discuss (Gaussian) intrinsic conditional autoregressive (CAR) models for disconnected graphs, with the aim of providing practical guidelines for how these models should be defined, scaled and implemented. We show how these suggestions can be implemented in two examples, on disease mapping.

Key provisions humanities research advertising and advertising exposure

Directory of Open Access Journals (Sweden)

A. A. Sogorin

2015-05-01

Full Text Available The basic directions of advertising studying as part of the research subject of separate social and humanitarian sciences. The definition of advertising is given. It’s considered as a holistic socio­economic phenomenon, which consists of three basic components: advertising as a product, the final incarnation in the material and ideal forms of the customer’s ideas; advertising as an activity that is advertising as a profession; advertising as an integral part of the social space of the individual. The boundaries of the social and humanitarian scientific field are defined. Accordingly, the study presents the main aspects of advertising in terms of art learning, sociology, cultural studies, history, psychology, political science, philosophy and linguistics. It is proved that the study of socio­humanitarian field is characterized with a permanent disciplinary interaction in the case study of advertising (the pairing of linguistics and psychology, political science and psychology, sociology and psychology. The chief strategies of advertising research within social and humanitarian fields include: a single basic approach strategy: the recognition of advertising as a two­way communication process; communication strategy: the rejection of research within the subject of a separate discipline, active interaction with the related sciences on the subject of the study; application of the principle of mutual academic enrichment; future strategy: focus on new technologies, methods, implementation of schemes of advertising in the social space, the attempts of futurological analysis. The article demonstrates the importance of interdisciplinary scientific cooperation in the study of advertising as a social phenomenon.

Advertising literacy and children’s susceptibility to advertising

NARCIS (Netherlands)

Rozendaal, E.

2011-01-01

This dissertation covers two areas of research that expand our knowledge on children’s advertising literacy (i.e., advertising-related knowledge). The first part addresses the development of children’s advertising literacy into adult-like levels. The second part focuses on the role of advertising

Culture, Product Advertising, and Advertising Agency Operations ...

African Journals Online (AJOL)

Culture, Product Advertising, and Advertising Agency Operations. ... As a means of telling the market about a new product, advertising persuades and reminds the audience of their continuous support of the ... AJOL African Journals Online.

Man-Made Object Extraction from Remote Sensing Imagery by Graph-Based Manifold Ranking

Science.gov (United States)

He, Y.; Wang, X.; Hu, X. Y.; Liu, S. H.

2018-04-01

The automatic extraction of man-made objects from remote sensing imagery is useful in many applications. This paper proposes an algorithm for extracting man-made objects automatically by integrating a graph model with the manifold ranking algorithm. Initially, we estimate a priori value of the man-made objects with the use of symmetric and contrast features. The graph model is established to represent the spatial relationships among pre-segmented superpixels, which are used as the graph nodes. Multiple characteristics, namely colour, texture and main direction, are used to compute the weights of the adjacent nodes. Manifold ranking effectively explores the relationships among all the nodes in the feature space as well as initial query assignment; thus, it is applied to generate a ranking map, which indicates the scores of the man-made objects. The man-made objects are then segmented on the basis of the ranking map. Two typical segmentation algorithms are compared with the proposed algorithm. Experimental results show that the proposed algorithm can extract man-made objects with high recognition rate and low omission rate.

Maximization of regional probabilities using Optimal Surface Graphs

DEFF Research Database (Denmark)

Arias Lorza, Andres M.; Van Engelen, Arna; Petersen, Jens

2018-01-01

Purpose: We present a segmentation method that maximizes regional probabilities enclosed by coupled surfaces using an Optimal Surface Graph (OSG) cut approach. This OSG cut determines the globally optimal solution given a graph constructed around an initial surface. While most methods for vessel...... wall segmentation only use edge information, we show that maximizing regional probabilities using an OSG improves the segmentation results. We applied this to automatically segment the vessel wall of the carotid artery in magnetic resonance images. Methods: First, voxel-wise regional probability maps...... were obtained using a Support Vector Machine classifier trained on local image features. Then, the OSG segments the regions which maximizes the regional probabilities considering smoothness and topological constraints. Results: The method was evaluated on 49 carotid arteries from 30 subjects...

On the Total Edge Irregularity Strength of Generalized Butterfly Graph

Science.gov (United States)

Dwi Wahyuna, Hafidhyah; Indriati, Diari

2018-04-01

Let G(V, E) be a connected, simple, and undirected graph with vertex set V and edge set E. A total k-labeling is a map that carries vertices and edges of a graph G into a set of positive integer labels {1, 2, …, k}. An edge irregular total k-labeling λ: V(G) ∪ E(G) → {1, 2, …, k} of a graph G is a total k-labeling such that the weights calculated for all edges are distinct. The weight of an edge uv in G, denoted by wt(uv), is defined as the sum of the label of u, the label of v, and the label of uv. The total edge irregularity strength of G, denoted by tes(G), is the minimum value of the largest label k over all such edge irregular total k-labelings. A generalized butterfly graph, BFn , obtained by inserting vertices to every wing with assumption that sum of inserting vertices to every wing are same then it has 2n + 1 vertices and 4n ‑ 2 edges. In this paper, we investigate the total edge irregularity strength of generalized butterfly graph, BFn , for n > 2. The result is tes(B{F}n)=\\lceil \\frac{4n}{3}\\rceil .

A combinatorial framework for map labeling

NARCIS (Netherlands)

Wagner, F.; Wolff, A.; Whitesides, S.

1998-01-01

The general map labeling problem consists in labeling a set of sites (points, lines, regions) given a set of candidates (rectangles, circles, ellipses, irregularly shaped labels) for each site. A map can be a classical cartographical map, a diagram, a graph or any other figure that needs to be

DEDB: a database of Drosophila melanogaster exons in splicing graph form

Directory of Open Access Journals (Sweden)

Tan Tin

2004-12-01

Full Text Available Abstract Background A wealth of quality genomic and mRNA/EST sequences in recent years has provided the data required for large-scale genome-wide analysis of alternative splicing. We have capitalized on this by constructing a database that contains alternative splicing information organized as splicing graphs, where all transcripts arising from a single gene are collected, organized and classified. The splicing graph then serves as the basis for the classification of the various types of alternative splicing events. Description DEDB http://proline.bic.nus.edu.sg/dedb/index.html is a database of Drosophila melanogaster exons obtained from FlyBase arranged in a splicing graph form that permits the creation of simple rules allowing for the classification of alternative splicing events. Pfam domains were also mapped onto the protein sequences allowing users to access the impact of alternative splicing events on domain organization. Conclusions DEDB's catalogue of splicing graphs facilitates genome-wide classification of alternative splicing events for genome analysis. The splicing graph viewer brings together genome, transcript, protein and domain information to facilitate biologists in understanding the implications of alternative splicing.

Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes

Directory of Open Access Journals (Sweden)

Katona Gyula Y.

2014-11-01

Full Text Available The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.

Graphs and Homomorphisms

CERN Document Server

Hell, Pavol

2004-01-01

This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colourings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics.Based on the authors' lecture notes for graduate courses, this book can be used as a textbook for a second course in graph theory at 4th year or master's level an

Strategic informative advertising in a tv-advertising duopoly

OpenAIRE

Nilssen, Tore; Sørgard, Lars

2000-01-01

We consider a model of strategic informative advertising where the advertising is done on TV and where the TV channels' advertising prices are endogenously determined. We discuss how these prices, and the advertising firms' advertising efforts, vary with the two key parameters of the model: the degree of product differentiation in the product market and a measure of the relative sizes of the TV channels' viewer bases. We find, in particular, that the larger the size difference among the TV ch...

Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs

DEFF Research Database (Denmark)

Bensmail, Julien; Renault, Gabriel

2016-01-01

An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪⋯∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently co...

An advanced method for classifying atmospheric circulation types based on prototypes connectivity graph

Science.gov (United States)

Zagouras, Athanassios; Argiriou, Athanassios A.; Flocas, Helena A.; Economou, George; Fotopoulos, Spiros

2012-11-01

Classification of weather maps at various isobaric levels as a methodological tool is used in several problems related to meteorology, climatology, atmospheric pollution and to other fields for many years. Initially the classification was performed manually. The criteria used by the person performing the classification are features of isobars or isopleths of geopotential height, depending on the type of maps to be classified. Although manual classifications integrate the perceptual experience and other unquantifiable qualities of the meteorology specialists involved, these are typically subjective and time consuming. Furthermore, during the last years different approaches of automated methods for atmospheric circulation classification have been proposed, which present automated and so-called objective classifications. In this paper a new method of atmospheric circulation classification of isobaric maps is presented. The method is based on graph theory. It starts with an intelligent prototype selection using an over-partitioning mode of fuzzy c-means (FCM) algorithm, proceeds to a graph formulation for the entire dataset and produces the clusters based on the contemporary dominant sets clustering method. Graph theory is a novel mathematical approach, allowing a more efficient representation of spatially correlated data, compared to the classical Euclidian space representation approaches, used in conventional classification methods. The method has been applied to the classification of 850 hPa atmospheric circulation over the Eastern Mediterranean. The evaluation of the automated methods is performed by statistical indexes; results indicate that the classification is adequately comparable with other state-of-the-art automated map classification methods, for a variable number of clusters.

Non-heuristic reduction of the graph in graph-cut optimization

International Nuclear Information System (INIS)

Malgouyres, François; Lermé, Nicolas

2012-01-01

During the last ten years, graph cuts had a growing impact in shape optimization. In particular, they are commonly used in applications of shape optimization such as image processing, computer vision and computer graphics. Their success is due to their ability to efficiently solve (apparently) difficult shape optimization problems which typically involve the perimeter of the shape. Nevertheless, solving problems with a large number of variables remains computationally expensive and requires a high memory usage since underlying graphs sometimes involve billion of nodes and even more edges. Several strategies have been proposed in the literature to improve graph-cuts in this regards. In this paper, we give a formal statement which expresses that a simple and local test performed on every node before its construction permits to avoid the construction of useless nodes for the graphs typically encountered in image processing and vision. A useless node is such that the value of the maximum flow in the graph does not change when removing the node from the graph. Such a test therefore permits to limit the construction of the graph to a band of useful nodes surrounding the final cut.

Graph embedding with rich information through heterogeneous graph

KAUST Repository

Sun, Guolei

2017-01-01

Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most

Visibility graphs for fMRI data: Multiplex temporal graphs and their modulations across resting-state networks

Directory of Open Access Journals (Sweden)

Speranza Sannino

2017-10-01

Full Text Available Visibility algorithms are a family of methods that map time series into graphs, such that the tools of graph theory and network science can be used for the characterization of time series. This approach has proved a convenient tool, and visibility graphs have found applications across several disciplines. Recently, an approach has been proposed to extend this framework to multivariate time series, allowing a novel way to describe collective dynamics. Here we test their application to fMRI time series, following two main motivations, namely that (a this approach allows vs to simultaneously capture and process relevant aspects of both local and global dynamics in an easy and intuitive way, and (b this provides a suggestive bridge between time series and network theory that nicely fits the consolidating field of network neuroscience. Our application to a large open dataset reveals differences in the similarities of temporal networks (and thus in correlated dynamics across resting-state networks, and gives indications that some differences in brain activity connected to psychiatric disorders could be picked up by this approach. Here we present the first application of multivariate visibility graphs to fMRI data. Visibility graphs are a way to represent a time series as a temporal network, evidencing specific aspects of its dynamics, such as extreme events. Multivariate time series, as those encountered in neuroscience, and in fMRI in particular, can be seen as a multiplex network, in which each layer represents a time series (a region of interest in the brain in our case. Here we report the method, we describe some relevant aspects of its application to BOLD time series, and we discuss the analogies and differences with existing methods. Finally, we present an application to a high-quality, publicly available dataset, containing healthy subjects and psychotic patients, and we discuss our findings. All the code to reproduce the analyses and the

Online Advertising

OpenAIRE

Goldfarb, Avi; Tucker, Catherine Elizabeth

2011-01-01

This chapter explores what makes online advertising different from traditional advertising channels. We argue that online advertising differs from traditional advertising channels in two important ways: measurability and targetability. Measurability is higher because the digital nature of online advertising means that responses to ads can be tracked relatively easily. Targetability is higher because data can be automatically tracked at an individual level, and it is relatively easy to show di...

Adaptive Graph Convolutional Neural Networks

OpenAIRE

Li, Ruoyu; Wang, Sheng; Zhu, Feiyun; Huang, Junzhou

2018-01-01

Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for eac...

Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?

Directory of Open Access Journals (Sweden)

Mehmet Fatih Öçal

2017-01-01

Full Text Available Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students’ learning during graphing functions. However, the display of graphs of functions that students sketched by hand may be relatively different when compared to the correct forms sketched using graphing software. The possible misleading effects of this situation brought a discussion of a misconception (asymptote misconception on graphing functions. The purpose of this study is two- fold. First of all, this study investigated whether using graphing software (GeoGebra in this case helps students to determine and resolve this misconception in calculus classrooms. Second, the reasons for this misconception are sought. The multiple case study was utilized in this study. University students in two calculus classrooms who received instructions with (35 students or without GeoGebra assisted instructions (32 students were compared according to whether they fell into this misconception on graphing basic functions (1/x, lnx, ex. In addition, students were interviewed to reveal the reasons behind this misconception. Data were analyzed by means of descriptive and content analysis methods. The findings indicated that those who received GeoGebra assisted instruction were better in resolving it. In addition, the reasons behind this misconception were found to be teacher-based, exam-based and some other factors.

High Dimensional Spectral Graph Theory and Non-backtracking Random Walks on Graphs

Science.gov (United States)

Kempton, Mark

This thesis has two primary areas of focus. First we study connection graphs, which are weighted graphs in which each edge is associated with a d-dimensional rotation matrix for some fixed dimension d, in addition to a scalar weight. Second, we study non-backtracking random walks on graphs, which are random walks with the additional constraint that they cannot return to the immediately previous state at any given step. Our work in connection graphs is centered on the notion of consistency, that is, the product of rotations moving from one vertex to another is independent of the path taken, and a generalization called epsilon-consistency. We present higher dimensional versions of the combinatorial Laplacian matrix and normalized Laplacian matrix from spectral graph theory, and give results characterizing the consistency of a connection graph in terms of the spectra of these matrices. We generalize several tools from classical spectral graph theory, such as PageRank and effective resistance, to apply to connection graphs. We use these tools to give algorithms for sparsification, clustering, and noise reduction on connection graphs. In non-backtracking random walks, we address the question raised by Alon et. al. concerning how the mixing rate of a non-backtracking random walk to its stationary distribution compares to the mixing rate for an ordinary random walk. Alon et. al. address this question for regular graphs. We take a different approach, and use a generalization of Ihara's Theorem to give a new proof of Alon's result for regular graphs, and to extend the result to biregular graphs. Finally, we give a non-backtracking version of Polya's Random Walk Theorem for 2-dimensional grids.

Misleading advertising

OpenAIRE

Bláhová, Vladimíra

2006-01-01

Misleading advertising The topic of this rigorous thesis is "Misleading advertising". The theme of the thesis is current and attractive, because everybody comes across the advertising all the time and thus the advertisement influents each of our lives. One of the motives for writing this rigorous thesis was to mediate understanding of problems concerning with the misleading advertising and the unfair competition. The rigorous thesis is divided into six chapters. The first chapter deals with t...

PathSys: integrating molecular interaction graphs for systems biology

Directory of Open Access Journals (Sweden)

Raval Alpan

2006-02-01

Full Text Available Abstract Background The goal of information integration in systems biology is to combine information from a number of databases and data sets, which are obtained from both high and low throughput experiments, under one data management scheme such that the cumulative information provides greater biological insight than is possible with individual information sources considered separately. Results Here we present PathSys, a graph-based system for creating a combined database of networks of interaction for generating integrated view of biological mechanisms. We used PathSys to integrate over 14 curated and publicly contributed data sources for the budding yeast (S. cerevisiae and Gene Ontology. A number of exploratory questions were formulated as a combination of relational and graph-based queries to the integrated database. Thus, PathSys is a general-purpose, scalable, graph-data warehouse of biological information, complete with a graph manipulation and a query language, a storage mechanism and a generic data-importing mechanism through schema-mapping. Conclusion Results from several test studies demonstrate the effectiveness of the approach in retrieving biologically interesting relations between genes and proteins, the networks connecting them, and of the utility of PathSys as a scalable graph-based warehouse for interaction-network integration and a hypothesis generator system. The PathSys's client software, named BiologicalNetworks, developed for navigation and analyses of molecular networks, is available as a Java Web Start application at http://brak.sdsc.edu/pub/BiologicalNetworks.

Reading Social wMaps.w

Science.gov (United States)

Clements, Millard

1982-01-01

What should social studies teachers be trying to teach students how to do? Every culture provides its members with social "maps" that explain how things are--e.g., school materials, advertisements. Teaching students how to read these social "maps" should be the central task for social studies education. (RM)

X-Graphs: Language and Algorithms for Heterogeneous Graph Streams

Science.gov (United States)

2017-09-01

are widely used by academia and industry. 15. SUBJECT TERMS Data Analytics, Graph Analytics, High-Performance Computing 16. SECURITY CLASSIFICATION...form the core of the DeepDive Knowledge Construction System. 2 INTRODUCTION The goal of the X-Graphs project was to develop computational techniques...memory multicore machine. Ringo is based on Snap.py and SNAP, and uses Python . Ringo now allows the integration of Delite DSL Framework Graph

On the sizes of expander graphs and minimum distances of graph codes

DEFF Research Database (Denmark)

Høholdt, Tom; Justesen, Jørn

2014-01-01

We give lower bounds for the minimum distances of graph codes based on expander graphs. The bounds depend only on the second eigenvalue of the graph and the parameters of the component codes. We also give an upper bound on the size of a degree regular graph with given second eigenvalue....

Similarity Measure of Graphs

Directory of Open Access Journals (Sweden)

Amine Labriji

2017-07-01

Full Text Available The topic of identifying the similarity of graphs was considered as highly recommended research field in the Web semantic, artificial intelligence, the shape recognition and information research. One of the fundamental problems of graph databases is finding similar graphs to a graph query. Existing approaches dealing with this problem are usually based on the nodes and arcs of the two graphs, regardless of parental semantic links. For instance, a common connection is not identified as being part of the similarity of two graphs in cases like two graphs without common concepts, the measure of similarity based on the union of two graphs, or the one based on the notion of maximum common sub-graph (SCM, or the distance of edition of graphs. This leads to an inadequate situation in the context of information research. To overcome this problem, we suggest a new measure of similarity between graphs, based on the similarity measure of Wu and Palmer. We have shown that this new measure satisfies the properties of a measure of similarities and we applied this new measure on examples. The results show that our measure provides a run time with a gain of time compared to existing approaches. In addition, we compared the relevance of the similarity values obtained, it appears that this new graphs measure is advantageous and  offers a contribution to solving the problem mentioned above.

Semantic Advertising

OpenAIRE

Zamanzadeh, Ben; Ashish, Naveen; Ramakrishnan, Cartic; Zimmerman, John

2013-01-01

We present the concept of Semantic Advertising which we see as the future of online advertising. Semantic Advertising is online advertising powered by semantic technology which essentially enables us to represent and reason with concepts and the meaning of things. This paper aims to 1) Define semantic advertising, 2) Place it in the context of broader and more widely used concepts such as the Semantic Web and Semantic Search, 3) Provide a survey of work in related areas such as context matchi...

Spectra of Graphs

NARCIS (Netherlands)

Brouwer, A.E.; Haemers, W.H.

2012-01-01

This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association

Strong oriented chromatic number of planar graphs without short cycles

Directory of Open Access Journals (Sweden)

Mickaël Montassier

2008-01-01

Full Text Available Let M be an additive abelian group. A strong oriented coloringof an oriented graph G is a mapping φ from V(G to M such that (1 φ(u ≠ φ(v whenever uv is an arc in G and (2 φ(v - φ(u ≠ -(φ(t - φ(z whenever uv and zt are two arcs in G. We say that G has a M-strong-oriented coloring. The strong oriented chromatic number of an oriented graph, denoted by χ s (G, is the minimal order of a group M, such that G has M-strong-oriented coloring. This notion was introduced by Nešetřil and Raspaud. In this paper, we pose the following problem: Let i ≥ 4 be an integer. Let G be an oriented planar graph without cycles of lengths 4 to i. Which is the strong oriented chromatic number of G ? Our aim is to determine the impact of triangles on the strong oriented coloring. We give some hints of answers to this problem by proving that: (1 the strong oriented chromatic number of any oriented planar graph without cycles of lengths 4 to 12 is at most 7, and (2 the strong oriented chromatic number of any oriented planar graph without cycles of length 4 or 6 is at most 19.

Growing hierarchical probabilistic self-organizing graphs.

Science.gov (United States)

López-Rubio, Ezequiel; Palomo, Esteban José

2011-07-01

Since the introduction of the growing hierarchical self-organizing map, much work has been done on self-organizing neural models with a dynamic structure. These models allow adjusting the layers of the model to the features of the input dataset. Here we propose a new self-organizing model which is based on a probabilistic mixture of multivariate Gaussian components. The learning rule is derived from the stochastic approximation framework, and a probabilistic criterion is used to control the growth of the model. Moreover, the model is able to adapt to the topology of each layer, so that a hierarchy of dynamic graphs is built. This overcomes the limitations of the self-organizing maps with a fixed topology, and gives rise to a faithful visualization method for high-dimensional data.

Mizan: A system for dynamic load balancing in large-scale graph processing

KAUST Repository

Khayyat, Zuhair

2013-01-01

Pregel [23] was recently introduced as a scalable graph mining system that can provide significant performance improvements over traditional MapReduce implementations. Existing implementations focus primarily on graph partitioning as a preprocessing step to balance computation across compute nodes. In this paper, we examine the runtime characteristics of a Pregel system. We show that graph partitioning alone is insufficient for minimizing end-to-end computation. Especially where data is very large or the runtime behavior of the algorithm is unknown, an adaptive approach is needed. To this end, we introduce Mizan, a Pregel system that achieves efficient load balancing to better adapt to changes in computing needs. Unlike known implementations of Pregel, Mizan does not assume any a priori knowledge of the structure of the graph or behavior of the algorithm. Instead, it monitors the runtime characteristics of the system. Mizan then performs efficient fine-grained vertex migration to balance computation and communication. We have fully implemented Mizan; using extensive evaluation we show that - especially for highly-dynamic workloads - Mizan provides up to 84% improvement over techniques leveraging static graph pre-partitioning. © 2013 ACM.

Geographical information systems as a tool for monitoring tobacco industry advertising.

Science.gov (United States)

Vardavas, C I; Connolly, G N; Kafatos, A G

2009-06-01

Although the use of a geographical information systems (GIS) approach is usually applied to epidemiological disease outbreaks and environmental exposure mapping, it has significant potential as a tobacco control research tool in monitoring point-of-purchase (POP) tobacco advertising. An ecological study design approach was applied so as to primarily evaluate and interpret the spatial density and intensity of POP and tobacco industry advertisements within advertisements per POP (range 0-25) were noted, and 80% of them were below child height. The GIS protocol identified that kiosks, that were excepted from the Greek ban on tobacco advertising, in comparison to other POP, were found not only to be closer and visible from the school gates (44.1% vs 10.8%, padvertisements (8 (5) vs 5 (3), padvertising on a large population-based scale and implies its use as a standardised method for monitoring tobacco industry strategies and tobacco control efforts.

Pattern graph rewrite systems

Directory of Open Access Journals (Sweden)

Aleks Kissinger

2014-03-01

Full Text Available String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes ("bang boxes", on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.

Banner Advertising

OpenAIRE

Majoroš, Miroslav

2008-01-01

History of internet advertising, types of internet advertising. Banner advertising, methods of payment for banner advertising, formats and technologies. Internet media market in Czech Republic, portals, servers, media agents, media agencies, SPIR association. Banner campaign, its planning, execution and evaluation. Videobanner campaign Nivea For Men, searching for the most effective format for videoadvertising on the internet.

On middle cube graphs

Directory of Open Access Journals (Sweden)

C. Dalfo

2015-10-01

Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.

Fast and Lean Immutable Multi-Maps on the JVM based on Heterogeneous Hash-Array Mapped Tries

NARCIS (Netherlands)

M.J. Steindorfer (Michael); J.J. Vinju (Jurgen)

2016-01-01

textabstractAn immutable multi-map is a many-to-many thread-friendly map data structure with expected fast insert and lookup operations. This data structure is used for applications processing graphs or many-to-many relations as applied in static analysis of object-oriented systems. When

Graph visualization (Invited talk)

NARCIS (Netherlands)

Wijk, van J.J.; Kreveld, van M.J.; Speckmann, B.

2012-01-01

Black and white node link diagrams are the classic method to depict graphs, but these often fall short to give insight in large graphs or when attributes of nodes and edges play an important role. Graph visualization aims obtaining insight in such graphs using interactive graphical representations.

Adventures in graph theory

CERN Document Server

Joyner, W David

2017-01-01

This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader’s interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book’s source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards ad...

Humour in advertisement

OpenAIRE

Melounová, Lenka

2016-01-01

The Bachelor Thesis Humour in advertisement is focused on creating humorous advertisements. The Thesis is divided into theoretical and practical part. The theoretical part is about advertisement, psychology of advertisement, emotions and emotional appeals that are used in advertising, primarily appeal humour. The practical part includes analysis of the survey focused on the effectiveness of humour in advertisements, analysis of selected campaign and the results of own survey.

Distance-regular graphs

NARCIS (Netherlands)

van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime

2016-01-01

This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,

On the strong metric dimension of generalized butterfly graph, starbarbell graph, and {C}_{m}\\odot {P}_{n} graph

Science.gov (United States)

Yunia Mayasari, Ratih; Atmojo Kusmayadi, Tri

2018-04-01

Let G be a connected graph with vertex set V(G) and edge set E(G). For every pair of vertices u,v\\in V(G), the interval I[u, v] between u and v to be the collection of all vertices that belong to some shortest u ‑ v path. A vertex s\\in V(G) strongly resolves two vertices u and v if u belongs to a shortest v ‑ s path or v belongs to a shortest u ‑ s path. A vertex set S of G is a strong resolving set of G if every two distinct vertices of G are strongly resolved by some vertex of S. The strong metric basis of G is a strong resolving set with minimal cardinality. The strong metric dimension sdim(G) of a graph G is defined as the cardinality of strong metric basis. In this paper we determine the strong metric dimension of a generalized butterfly graph, starbarbell graph, and {C}mȯ {P}n graph. We obtain the strong metric dimension of generalized butterfly graph is sdim(BFn ) = 2n ‑ 2. The strong metric dimension of starbarbell graph is sdim(S{B}{m1,{m}2,\\ldots,{m}n})={\\sum }i=1n({m}i-1)-1. The strong metric dimension of {C}mȯ {P}n graph are sdim({C}mȯ {P}n)=2m-1 for m > 3 and n = 2, and sdim({C}mȯ {P}n)=2m-2 for m > 3 and n > 2.

Subgraph detection using graph signals

KAUST Repository

Chepuri, Sundeep Prabhakar

2017-03-06

In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

Subgraph detection using graph signals

KAUST Repository

Chepuri, Sundeep Prabhakar; Leus, Geert

2017-01-01

In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

Youth perceptions of alcohol advertising: are current advertising regulations working?

Science.gov (United States)

Aiken, Alexandra; Lam, Tina; Gilmore, William; Burns, Lucy; Chikritzhs, Tanya; Lenton, Simon; Lloyd, Belinda; Lubman, Dan; Ogeil, Rowan; Allsop, Steve

2018-06-01

We investigated young people's exposure to alcohol advertising, their intentions to consume and purchase alcohol products following the viewing of advertisements, and whether they perceived the actors in the advertisements as being under the age of 25 years. Face-to-face interviews were completed with 351 risky drinking 16-19-year-old Australians, with a sub-sample (n=68) responding to a range of alcohol advertisements in an in-depth interview. Participants were exposed to alcohol advertisements from an average of seven specific contexts in the past 12 months, with younger adolescents more likely to recall TV and outdoor billboards (n=351). Positive perception of advertisements was associated with increased intention to use and to purchase advertised products (n=68). A liqueur advertisement actor was perceived by 94% as being under 25 years-old, and almost 30% thought the advertisement was marketed at people younger than 18 years of age. Young people's perceptions of alcohol advertising are not necessarily in line with expert/industry assessment; products are sometimes marketed in a way that is highly appealing to young people. Greater appeal was associated with increased intention to consume and to purchase products. Implications for public health: These results indicate deficiencies in the effectiveness of current advertising codes in regard to protecting the health and wellbeing of adolescents. © 2018 The Authors.

Graph spectrum

NARCIS (Netherlands)

Brouwer, A.E.; Haemers, W.H.; Brouwer, A.E.; Haemers, W.H.

2012-01-01

This chapter presents some simple results on graph spectra.We assume the reader is familiar with elementary linear algebra and graph theory. Throughout, J will denote the all-1 matrix, and 1 is the all-1 vector.

Pragmatic Graph Rewriting Modifications

OpenAIRE

Rodgers, Peter; Vidal, Natalia

1999-01-01

We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified a...

Simplicial complexes of graphs

CERN Document Server

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.

How Does Advertising Affect Market Performance? The Case of Generic Advertising

OpenAIRE

Hamilton, Stephen F.; Richards, Timothy J.; Stiegert, Kyle W.

2009-01-01

The effect of advertising on market performance has been a long-standing debate. Advertising that increases the dispersion of consumers’ valuations for advertised goods raises the market power of firms, while advertising that decreases the dispersion of consumers’ valuations leads to narrower price-cost margins and superior performance in markets for advertised goods. Numerous challenges confound the empirical identification of advertising effects on market performance. This paper proposes a ...

Visual Reasoning in Computational Environment: A Case of Graph Sketching

Science.gov (United States)

Leung, Allen; Chan, King Wah

2004-01-01

This paper reports the case of a form six (grade 12) Hong Kong student's exploration of graph sketching in a computational environment. In particular, the student summarized his discovery in the form of two empirical laws. The student was interviewed and the interviewed data were used to map out a possible path of his visual reasoning. Critical…

The STAPL Parallel Graph Library

KAUST Repository

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.

Topic Model for Graph Mining.

Science.gov (United States)

Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng

2015-12-01

Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.

Modern graph theory

CERN Document Server

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 ...

A graph edit dictionary for correcting errors in roof topology graphs reconstructed from point clouds

Science.gov (United States)

Xiong, B.; Oude Elberink, S.; Vosselman, G.

2014-07-01

In the task of 3D building model reconstruction from point clouds we face the problem of recovering a roof topology graph in the presence of noise, small roof faces and low point densities. Errors in roof topology graphs will seriously affect the final modelling results. The aim of this research is to automatically correct these errors. We define the graph correction as a graph-to-graph problem, similar to the spelling correction problem (also called the string-to-string problem). The graph correction is more complex than string correction, as the graphs are 2D while strings are only 1D. We design a strategy based on a dictionary of graph edit operations to automatically identify and correct the errors in the input graph. For each type of error the graph edit dictionary stores a representative erroneous subgraph as well as the corrected version. As an erroneous roof topology graph may contain several errors, a heuristic search is applied to find the optimum sequence of graph edits to correct the errors one by one. The graph edit dictionary can be expanded to include entries needed to cope with errors that were previously not encountered. Experiments show that the dictionary with only fifteen entries already properly corrects one quarter of erroneous graphs in about 4500 buildings, and even half of the erroneous graphs in one test area, achieving as high as a 95% acceptance rate of the reconstructed models.

Mapping the backbone of science.

Energy Technology Data Exchange (ETDEWEB)

Klavans, Richard (Indiana University, Bloomington, IN); BÞorner, Katy (Strategies for Science & Technology, Incorporation, Berwyn, PA); Boyack, Kevin W.

2004-11-01

This paper presents a new map representing the structure of all of science, based on journal articles, including both the natural and social sciences. Similar to cartographic maps of our world, the map of science provides a bird's eye view of today's scientific landscape. It can be used to visually identify major areas of science, their size, similarity, and interconnectedness. In order to be useful, the map needs to be accurate on a local and on a global scale. While our recent work has focused on the former aspect, this paper summarizes results on how to achieve structural accuracy. Eight alternative measures of journal similarity were applied to a data set of 7,121 journals covering over 1 million documents in the combined Science Citation and Social Science Citation Indexes. For each journal similarity measure we generated two-dimensional spatial layouts using the force-directed graph layout tool, VxOrd. Next, mutual information values were calculated for each graph at different clustering levels to give a measure of structural accuracy for each map. The best co-citation and inter-citation maps according to local and structural accuracy were selected and are presented and characterized. These two maps are compared to establish robustness. The inter-citation map is then used to examine linkages between disciplines. Biochemistry appears as the most interdisciplinary discipline in science.

Advertising Bans and the Substitutability of Online and Offline Advertising

OpenAIRE

Goldfarb, Avi; Tucker, Catherine Elizabeth

2010-01-01

The authors examine whether the growth of the Internet has reduced the effectiveness of government regulation of advertising. They combine nonexperimental variation in local regulation of offline alcohol advertising with data from field tests that randomized exposure to online advertising for 275 different online advertising campaigns to 61,580 people. The results show that people are 8% less likely to say that they will purchase an alcoholic beverage in states that have alcohol advertising b...

PRIMAL: Page Rank-Based Indoor Mapping and Localization Using Gene-Sequenced Unlabeled WLAN Received Signal Strength

Directory of Open Access Journals (Sweden)

Mu Zhou

2015-09-01

Full Text Available Due to the wide deployment of wireless local area networks (WLAN, received signal strength (RSS-based indoor WLAN localization has attracted considerable attention in both academia and industry. In this paper, we propose a novel page rank-based indoor mapping and localization (PRIMAL by using the gene-sequenced unlabeled WLAN RSS for simultaneous localization and mapping (SLAM. Specifically, first of all, based on the observation of the motion patterns of the people in the target environment, we use the Allen logic to construct the mobility graph to characterize the connectivity among different areas of interest. Second, the concept of gene sequencing is utilized to assemble the sporadically-collected RSS sequences into a signal graph based on the transition relations among different RSS sequences. Third, we apply the graph drawing approach to exhibit both the mobility graph and signal graph in a more readable manner. Finally, the page rank (PR algorithm is proposed to construct the mapping from the signal graph into the mobility graph. The experimental results show that the proposed approach achieves satisfactory localization accuracy and meanwhile avoids the intensive time and labor cost involved in the conventional location fingerprinting-based indoor WLAN localization.

PRIMAL: Page Rank-Based Indoor Mapping and Localization Using Gene-Sequenced Unlabeled WLAN Received Signal Strength.

Science.gov (United States)

Zhou, Mu; Zhang, Qiao; Xu, Kunjie; Tian, Zengshan; Wang, Yanmeng; He, Wei

2015-09-25

Due to the wide deployment of wireless local area networks (WLAN), received signal strength (RSS)-based indoor WLAN localization has attracted considerable attention in both academia and industry. In this paper, we propose a novel page rank-based indoor mapping and localization (PRIMAL) by using the gene-sequenced unlabeled WLAN RSS for simultaneous localization and mapping (SLAM). Specifically, first of all, based on the observation of the motion patterns of the people in the target environment, we use the Allen logic to construct the mobility graph to characterize the connectivity among different areas of interest. Second, the concept of gene sequencing is utilized to assemble the sporadically-collected RSS sequences into a signal graph based on the transition relations among different RSS sequences. Third, we apply the graph drawing approach to exhibit both the mobility graph and signal graph in a more readable manner. Finally, the page rank (PR) algorithm is proposed to construct the mapping from the signal graph into the mobility graph. The experimental results show that the proposed approach achieves satisfactory localization accuracy and meanwhile avoids the intensive time and labor cost involved in the conventional location fingerprinting-based indoor WLAN localization.

Introduction to quantum graphs

CERN Document Server

Berkolaiko, Gregory

2012-01-01

A "quantum graph" is a graph considered as a one-dimensional complex and equipped with a differential operator ("Hamiltonian"). Quantum graphs arise naturally as simplified models in mathematics, physics, chemistry, and engineering when one considers propagation of waves of various nature through a quasi-one-dimensional (e.g., "meso-" or "nano-scale") system that looks like a thin neighborhood of a graph. Works that currently would be classified as discussing quantum graphs have been appearing since at least the 1930s, and since then, quantum graphs techniques have been applied successfully in various areas of mathematical physics, mathematics in general and its applications. One can mention, for instance, dynamical systems theory, control theory, quantum chaos, Anderson localization, microelectronics, photonic crystals, physical chemistry, nano-sciences, superconductivity theory, etc. Quantum graphs present many non-trivial mathematical challenges, which makes them dear to a mathematician's heart. Work on qu...

Graph Generator Survey

Energy Technology Data Exchange (ETDEWEB)

Lothian, Joshua [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sullivan, Blair D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baker, Matthew B. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Schrock, Jonathan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Poole, Stephen W. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

2013-10-01

The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of different application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.

Functions and graphs

CERN Document Server

Gelfand, I M; Shnol, E E

1969-01-01

The second in a series of systematic studies by a celebrated mathematician I. M. Gelfand and colleagues, this volume presents students with a well-illustrated sequence of problems and exercises designed to illuminate the properties of functions and graphs. Since readers do not have the benefit of a blackboard on which a teacher constructs a graph, the authors abandoned the customary use of diagrams in which only the final form of the graph appears; instead, the book's margins feature step-by-step diagrams for the complete construction of each graph. The first part of the book employs simple fu

Loose Graph Simulations

DEFF Research Database (Denmark)

Mansutti, Alessio; Miculan, Marino; Peressotti, Marco

2017-01-01

We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly...... also problems which are “mixed” instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide formal translation of SGI, RLPM, and GS into LGSs, and we give...

Graph-Based Semi-Supervised Hyperspectral Image Classification Using Spatial Information

Science.gov (United States)

Jamshidpour, N.; Homayouni, S.; Safari, A.

2017-09-01

Hyperspectral image classification has been one of the most popular research areas in the remote sensing community in the past decades. However, there are still some problems that need specific attentions. For example, the lack of enough labeled samples and the high dimensionality problem are two most important issues which degrade the performance of supervised classification dramatically. The main idea of semi-supervised learning is to overcome these issues by the contribution of unlabeled samples, which are available in an enormous amount. In this paper, we propose a graph-based semi-supervised classification method, which uses both spectral and spatial information for hyperspectral image classification. More specifically, two graphs were designed and constructed in order to exploit the relationship among pixels in spectral and spatial spaces respectively. Then, the Laplacians of both graphs were merged to form a weighted joint graph. The experiments were carried out on two different benchmark hyperspectral data sets. The proposed method performed significantly better than the well-known supervised classification methods, such as SVM. The assessments consisted of both accuracy and homogeneity analyses of the produced classification maps. The proposed spectral-spatial SSL method considerably increased the classification accuracy when the labeled training data set is too scarce.When there were only five labeled samples for each class, the performance improved 5.92% and 10.76% compared to spatial graph-based SSL, for AVIRIS Indian Pine and Pavia University data sets respectively.

GRAPH-BASED SEMI-SUPERVISED HYPERSPECTRAL IMAGE CLASSIFICATION USING SPATIAL INFORMATION

Directory of Open Access Journals (Sweden)

N. Jamshidpour

2017-09-01

Full Text Available Hyperspectral image classification has been one of the most popular research areas in the remote sensing community in the past decades. However, there are still some problems that need specific attentions. For example, the lack of enough labeled samples and the high dimensionality problem are two most important issues which degrade the performance of supervised classification dramatically. The main idea of semi-supervised learning is to overcome these issues by the contribution of unlabeled samples, which are available in an enormous amount. In this paper, we propose a graph-based semi-supervised classification method, which uses both spectral and spatial information for hyperspectral image classification. More specifically, two graphs were designed and constructed in order to exploit the relationship among pixels in spectral and spatial spaces respectively. Then, the Laplacians of both graphs were merged to form a weighted joint graph. The experiments were carried out on two different benchmark hyperspectral data sets. The proposed method performed significantly better than the well-known supervised classification methods, such as SVM. The assessments consisted of both accuracy and homogeneity analyses of the produced classification maps. The proposed spectral-spatial SSL method considerably increased the classification accuracy when the labeled training data set is too scarce.When there were only five labeled samples for each class, the performance improved 5.92% and 10.76% compared to spatial graph-based SSL, for AVIRIS Indian Pine and Pavia University data sets respectively.

Comparing MapReduce and Pipeline Implementations for Counting Triangles

Directory of Open Access Journals (Sweden)

Edelmira Pasarella

2017-01-01

Full Text Available A common method to define a parallel solution for a computational problem consists in finding a way to use the Divide and Conquer paradigm in order to have processors acting on its own data and scheduled in a parallel fashion. MapReduce is a programming model that follows this paradigm, and allows for the definition of efficient solutions by both decomposing a problem into steps on subsets of the input data and combining the results of each step to produce final results. Albeit used for the implementation of a wide variety of computational problems, MapReduce performance can be negatively affected whenever the replication factor grows or the size of the input is larger than the resources available at each processor. In this paper we show an alternative approach to implement the Divide and Conquer paradigm, named dynamic pipeline. The main features of dynamic pipelines are illustrated on a parallel implementation of the well-known problem of counting triangles in a graph. This problem is especially interesting either when the input graph does not fit in memory or is dynamically generated. To evaluate the properties of pipeline, a dynamic pipeline of processes and an ad-hoc version of MapReduce are implemented in the language Go, exploiting its ability to deal with channels and spawned processes. An empirical evaluation is conducted on graphs of different topologies, sizes, and densities. Observed results suggest that dynamic pipelines allows for an efficient implementation of the problem of counting triangles in a graph, particularly, in dense and large graphs, drastically reducing the execution time with respect to the MapReduce implementation.

Experimental quantum annealing: case study involving the graph isomorphism problem.

Science.gov (United States)

Zick, Kenneth M; Shehab, Omar; French, Matthew

2015-06-08

Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical pre- and post-processing; at this early stage, little is known about how to partition and optimize the processing. This article presents an experimental case study of quantum annealing and some of the factors involved in real-world solvers, using a 504-qubit D-Wave Two machine and the graph isomorphism problem. To illustrate the role of classical pre-processing, a compact Hamiltonian is presented that enables a reduced Ising model for each problem instance. On random N-vertex graphs, the median number of variables is reduced from N(2) to fewer than N log2 N and solvable graph sizes increase from N = 5 to N = 13. Additionally, error correction via classical post-processing majority voting is evaluated. While the solution times are not competitive with classical approaches to graph isomorphism, the enhanced solver ultimately classified correctly every problem that was mapped to the processor and demonstrated clear advantages over the baseline approach. The results shed some light on the nature of real-world quantum annealing and the associated hybrid classical-quantum solvers.

Impact of Humor Advertising in Radio and Print Advertising - A Review

OpenAIRE

S, venkatesh; N, senthilkumar

2015-01-01

The use of humour in advertising is the effective way of communication in any emotion to sell the products. Humor increase attention and attract more consumers so it became an effective advertising in any medium of advertising. Researchers and Advertisers more interested towards humor advertising more than century, but no review paper regarding impact of humor in radio and print advertising are published. Aim of this paper to get detailed review on impact of humor in radio and print advertisi...

Scalable Parallel Distributed Coprocessor System for Graph Searching Problems with Massive Data

Directory of Open Access Journals (Sweden)

Wanrong Huang

2017-01-01

Full Text Available The Internet applications, such as network searching, electronic commerce, and modern medical applications, produce and process massive data. Considerable data parallelism exists in computation processes of data-intensive applications. A traversal algorithm, breadth-first search (BFS, is fundamental in many graph processing applications and metrics when a graph grows in scale. A variety of scientific programming methods have been proposed for accelerating and parallelizing BFS because of the poor temporal and spatial locality caused by inherent irregular memory access patterns. However, new parallel hardware could provide better improvement for scientific methods. To address small-world graph problems, we propose a scalable and novel field-programmable gate array-based heterogeneous multicore system for scientific programming. The core is multithread for streaming processing. And the communication network InfiniBand is adopted for scalability. We design a binary search algorithm to address mapping to unify all processor addresses. Within the limits permitted by the Graph500 test bench after 1D parallel hybrid BFS algorithm testing, our 8-core and 8-thread-per-core system achieved superior performance and efficiency compared with the prior work under the same degree of parallelism. Our system is efficient not as a special acceleration unit but as a processor platform that deals with graph searching applications.

Advertising Arbitrage

OpenAIRE

Sergei Kovbasyuk; Marco Pagano

2014-01-01

Speculators often advertise arbitrage opportunities in order to persuade other investors and thus accelerate the correction of mispricing. We show that in order to minimize the risk and the cost of arbitrage an investor who identifies several mispriced assets optimally advertises only one of them, and overweights it in his portfolio; a risk-neutral arbitrageur invests only in this asset. The choice of the asset to be advertised depends not only on mispricing but also on its "advertisability" ...

Mobile Advertising

OpenAIRE

Alamuri, Lavanya

2009-01-01

The aim of this project was to get an understanding of how companies adopt mobile as an advertising medium. The literature review aided in framing a draft of the factors that affect mobile advertising adoption and possible forms of mobile advertising. Considering the scope of the thesis work, branding strategy, service costs, personalization and privacy and platform were considered to be the factors that could affect the mobile advertising adoption. A few possible forms on mobile device we...

From Advertising to Hyper-advertising: Semiotics, Narrative and Discourse

Directory of Open Access Journals (Sweden)

Eduardo Yalán-Dongo

2016-07-01

Full Text Available Advertising design is a discursive planning that does not only build an identity as brand value or graphic development, but also as Semiotics suggests, it produces a narrative level outlining the advertising story. The use of media, construction of characters, storytelling, organization of advertisement, are all expressions of this narrative level which in turn depends on a “context” or expression process from which they are built. This article aims to identify the different forms of narrative production in relation to three types of advertising discourse (Discourse Phase 1, Phase 2 and hyperadvertising as well as evaluate its contrasts and expressions within the advertising communication and consumer society.

Mobile Advertising : A Case study of Mobile advertising Solutions

OpenAIRE

Salim, Ali; Alikhani, Nima

2009-01-01

This report has been produced as a result of a Thesis assignment conducted at Ericsson. Itspurpose is to give an overview of the Mobile Advertising industry. In this report an overviewof mobile advertising is presented and thru which channels advertising could be used. Thenthree mobile advertising campaigns are shown and described with background, strategy andresults. The different global markets, the different actors in the value chain and how the onlinebehavior has changed are analyzed. The...

Autoregressive Moving Average Graph Filtering

OpenAIRE

Isufi, Elvin; Loukas, Andreas; Simonetto, Andrea; Leus, Geert

2016-01-01

One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design phi...

On cyclic orthogonal double covers of circulant graphs by special infinite graphs

Directory of Open Access Journals (Sweden)

R. El-Shanawany

2017-12-01

Full Text Available In this article, a technique to construct cyclic orthogonal double covers (CODCs of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and K1,2n−10 is introduced.

Quantum walks on quotient graphs

International Nuclear Information System (INIS)

Krovi, Hari; Brun, Todd A.

2007-01-01

A discrete-time quantum walk on a graph Γ is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states the walk will be confined to a subspace of the original Hilbert space. Symmetries of the original graph, given by its automorphism group, can be inherited by the evolution operator. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup H of the automorphism group and illustrate it with examples. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup H used to construct it. The quotient graph is constructed by removing the symmetries of the subgroup H from the original graph. We then analyze the behavior of hitting times on quotient graphs. Hitting time is the average time it takes a walk to reach a given final vertex from a given initial vertex. It has been shown in earlier work [Phys. Rev. A 74, 042334 (2006)] that the hitting time for certain initial states of a quantum walks can be infinite, in contrast to classical random walks. We give a condition which determines whether the quotient graph has infinite hitting times given that they exist in the original graph. We apply this condition for the examples discussed and determine which quotient graphs have infinite hitting times. All known examples of quantum walks with hitting times which are short compared to classical random walks correspond to systems with quotient graphs much smaller than the original graph; we conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speedup

Reconsidering advertising literacy as a defense against advertising effects

NARCIS (Netherlands)

Rozendaal, E.; Lapierre, M.A.; van Reijmersdal, E.A.; Buijzen, M.

2011-01-01

It is widely assumed that advertising literacy makes children less susceptible to advertising effects. However, empirical research does not provide convincing evidence for this view. In this article, we explain why advertising literacy as it is currently defined (i.e., conceptual knowledge of

The advertising strategies

Institute of Scientific and Technical Information of China (English)

YAKOUBI Mohamed Lamine

2013-01-01

We will try to demonstrate, through the display of the various advertising creation strategies and their evolution, how the advertising communication passed from of a vision or a strategy focused on the product, to a vision focused on the brand. The first advertising strategy that was applied by advertising agencies is the＂Unique Selling Proposition＂;it focused only on the product advantages and its philosophy dominated the advertising world, throughout its various evolutions, till the nineties but this is without counting the introduction of the new advertising strategies that brought a more brand oriented philosophy to the ground.

Fundamentals of algebraic graph transformation

CERN Document Server

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...

Advertisement without Ethical Principles?

Directory of Open Access Journals (Sweden)

Wojciech Słomski

2007-10-01

Full Text Available The article replies to the question, whether the advertisement can exist without ethical principles or ethics should be the basis of the advertisement. One can say that the ethical opinion of the advertisement does not depend on content and the form of advertising content exclusively, but also on recipients consciousness. The advertisement appeals to the emotions more than to the intellect, thus restricting the area of conscious and based on rational premises choice, so it is morally bad. It is not that the moral evil immanently underlines the advertisement, but it concerns the mechanisms which cause that the advertisement turns out to be effective. The only admissible form of the advertisement would be the reliable full information about the advantages and flaws of the concrete advertised product. The only admissible form of the advertisement would be the reliable full information about the advantages and defects of the concrete advertised product. The most serious difficulty connected with the ethical opinion of the advertisement is the fact that the advertisement is the indispensable link of the present economy, and everyone who accepts the free market and perceives the positives of the economic growth, should also accept the advertisement. The advertisement constitutes the element of the economic activity, so in consequence the responsibility first of all lies with enterprises for its far-reaching results.

Graph-based modelling in engineering

CERN Document Server

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. .

Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions

KAUST Repository

Mahayni, Malek A.

2011-07-01

Finding optimal paths in directed graphs is a wide area of research that has received much of attention in theoretical computer science due to its importance in many applications (e.g., computer networks and road maps). Many algorithms have been developed to solve the optimal paths problem with different kinds of graphs. An algorithm that solves the problem of paths’ optimization in directed graphs relative to different cost functions is described in [1]. It follows an approach extended from the dynamic programming approach as it solves the problem sequentially and works on directed graphs with positive weights and no loop edges. The aim of this thesis is to implement and evaluate that algorithm to find the optimal paths in directed graphs relative to two different cost functions ( , ). A possible interpretation of a directed graph is a network of roads so the weights for the function represent the length of roads, whereas the weights for the function represent a constraint of the width or weight of a vehicle. The optimization aim for those two functions is to minimize the cost relative to the function and maximize the constraint value associated with the function. This thesis also includes finding and proving the relation between the two different cost functions ( , ). When given a value of one function, we can find the best possible value for the other function. This relation is proven theoretically and also implemented and experimented using Matlab®[2].

Path covering number and L(2,1)-labeling number of graphs

OpenAIRE

Lu, Changhong; Zhou, Qing

2012-01-01

A {\\it path covering} of a graph $G$ is a set of vertex disjoint paths of $G$ containing all the vertices of $G$. The {\\it path covering number} of $G$, denoted by $P(G)$, is the minimum number of paths in a path covering of $G$. An {\\sl $k$-L(2,1)-labeling} of a graph $G$ is a mapping $f$ from $V(G)$ to the set ${0,1,...,k}$ such that $|f(u)-f(v)|\\ge 2$ if $d_G(u,v)=1$ and $|f(u)-f(v)|\\ge 1$ if $d_G(u,v)=2$. The {\\sl L(2,1)-labeling number $\\lambda (G)$} of $G$ is the smallest number $k$ suc...

North America pipeline map

International Nuclear Information System (INIS)

Anon.

2005-01-01

This map presents details of pipelines currently in place throughout North America. Fifty-nine natural gas pipelines are presented, as well as 16 oil pipelines. The map also identifies six proposed natural gas pipelines. Major cities, roads and highways are included as well as state and provincial boundaries. The National Petroleum Reserve is identified, as well as the Arctic National Wildlife Refuge. The following companies placed advertisements on the map with details of the services they provide relating to pipeline management and construction: Ferus Gas Industries Trust; Proline; SulfaTreat Direct Oxidation; and TransGas. 1 map

The Association of Point-of-Sale E-cigarette Advertising with Socio-Demographic Characteristics of Neighborhoods.

Science.gov (United States)

Wan, Neng; Siahpush, Mohammad; Shaikh, Raees A; McCarthy, Molly; Ramos, Athena; Correa, Antonia

2018-06-01

Electronic cigarettes (e-cigarettes) marketing expenditure is skyrocketing in the United States. However, little is understood about the geographic and socio-demographic patterns of e-cigarette advertising. We examined the associations between point-of-sale (POS) e-cigarette advertising and neighborhood socio-demographic characteristics in the Omaha Metropolitan Area of Nebraska. In 2014, fieldworkers collected comprehensive POS e-cigarette advertising data from all stores that sell tobacco (n = 463) in the Omaha Metropolitan Area. We used Geographic Information Systems to map POS e-cigarette advertisement density for the entire study area. Linear regression was used to examine the association between socio-demographic factors and POS e-cigarette advertising density. E-cigarette advertising density exhibited an obviously uneven geographic pattern in Omaha. Higher level of POS e-cigarette advertising was significantly related to lower median household income, higher percentage of Hispanics, and higher percentage of young adults. However, after adjusting for covariates, only median household income remained significantly associated with POS e-cigarette advertising. We found geographic, socioeconomic, and racial and ethnic disparities in exposure to POS e-cigarette advertising in Omaha, Nebraska. Future studies are needed to understand how these disparities influence e-cigarette adoption by different social groups and how to use such information to inform e-cigarette prevention strategies.

Examining traditional display advertisement and advertorial according to advertisement and advertised product perception based on factor analysis

OpenAIRE

Okumuş, Abdullah; Çetintürk, Naim; Çetin, Eyüp

2012-01-01

Firms are trying to reach consumers with different advertisement applications for purpose of to give information, remind and convince customers. Traditional advertisement and advertorial which aim to increase reliability and convince of people found themselves with different publishing channels. This research examines the dimensions of two different types of advertisement and the differences between them. Both for exploring active elements and essentials of marketing and an advertising; impor...

Climate Prediction Center - Forecasts & Outlook Maps, Graphs and Tables

Science.gov (United States)

Weather Service NWS logo - Click to go to the NWS home page Climate Prediction Center Home Site Map News list below The Climate Prediction Center (CPC) is responsible for issuing seasonal climate outlook maps , and National Centers for Environmental Prediction). These weather and climate products comprise the

The Effect of Sexual Appeal Advertising to Advertising Effectiveness in Manado

OpenAIRE

Muslim, Abdul Wahid

2014-01-01

Advertising is very crucial in marketing. They are literally everywhere in the newspapers, magazines, on TV, on billboards, in the cinema or while surfing the Internet. In marketing campaigns, many techniques and approaches to attract customers. One of those approaches is sexual appeal. Sexy advertising can attract attention, increase retention and improve advertising consumer attitudes toward advertising. Sexual appeals in the media as an advertising strategy to inform a product with the int...

EFFECTIVENESS OF ONLINE ADVERTISING

OpenAIRE

G. Anusha

2017-01-01

Advertising has come a long way today. More and more new medium is being explored each day to make a successful advertising campaign. Internet that has in recent times picked up as advertising medium has become the favorite of the advertiser in no time. Online advertisement, also called internet advertising uses the internet to deliver promotional marketing messages to consumers. It includes email marketing, search engine marketing, social media marketing, many types of display advertising (i...

Equipackable graphs

DEFF Research Database (Denmark)

Vestergaard, Preben Dahl; Hartnell, Bert L.

2006-01-01

There are many results dealing with the problem of decomposing a fixed graph into isomorphic subgraphs. There has also been work on characterizing graphs with the property that one can delete the edges of a number of edge disjoint copies of the subgraph and, regardless of how that is done, the gr...

Advertising and Innovation: A New Course and Direction for Advertising Education.

Science.gov (United States)

Sweeney, John M.

At a time when few copywriting jobs are available for new graduates, enrollments in advertising are exploding. An advertising educator set out to change students' perceptions that in advertising only copywriting requires imagination by developing a course called "Advertising and Innovation" which was designed to force students to use…

Khovanov homology of graph-links

Energy Technology Data Exchange (ETDEWEB)

Nikonov, Igor M [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)

2012-08-31

Graph-links arise as the intersection graphs of turning chord diagrams of links. Speaking informally, graph-links provide a combinatorial description of links up to mutations. Many link invariants can be reformulated in the language of graph-links. Khovanov homology, a well-known and useful knot invariant, is defined for graph-links in this paper (in the case of the ground field of characteristic two). Bibliography: 14 titles.

Alcohol advertising and youth.

Science.gov (United States)

Saffer, Henry

2002-03-01

The question addressed in this review is whether aggregate alcohol advertising increases alcohol consumption among college students. Both the level of alcohol-related problems on college campuses and the level of alcohol advertising are high. Some researchers have concluded that the cultural myths and symbols used in alcohol advertisements have powerful meanings for college students and affect intentions to drink. There is, however, very little empirical evidence that alcohol advertising has any effect on actual alcohol consumption. The methods used in this review include a theoretical framework for evaluating the effects of advertising. This theory suggests that the marginal effect of advertising diminishes at high levels of advertising. Many prior empirical studies measured the effect of advertising at high levels of advertising and found no effect. Those studies that measure advertising at lower, more disaggregated levels have found an effect on consumption. The results of this review suggest that advertising does increase consumption. However, advertising cannot be reduced with limited bans, which are likely to result in substitution to other available media. Comprehensive bans on all forms of advertising and promotion can eliminate options for substitution and be potentially more effective in reducing consumption. In addition, there is an increasing body of literature that suggests that alcohol counteradvertising is effective in reducing the alcohol consumption of teenagers and young adults. These findings indicate that increased counteradvertising, rather than new advertising bans, appears to be the better choice for public policy. It is doubtful that the comprehensive advertising bans required to reduce advertising would ever receive much public support. New limited bans on alcohol advertising might also result in less alcohol counteradvertising. An important topic for future research is to identify the counteradvertising themes that are most effective with

Generalized connectivity of graphs

CERN Document Server

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.

A paradigm shift in advertising and its meaning for advertising-supported media

OpenAIRE

Pérez-Latre, F.J. (Francisco Javier)

2007-01-01

The changing role of advertising is altering the behavior of advertisers with significant implications for advertising-supported media. Advertisers are struggling to understand changes in audience media usage and to changes in attention paid to commercial messages. In order to maintain relevance, media firms need to lead the way in helping advertising understand and adjust to the changes.

On two energy-like invariants of line graphs and related graph operations

Directory of Open Access Journals (Sweden)

Xiaodan Chen

2016-02-01

Full Text Available Abstract For a simple graph G of order n, let μ 1 ≥ μ 2 ≥ ⋯ ≥ μ n = 0 $\\mu_{1}\\geq\\mu_{2}\\geq\\cdots\\geq\\mu_{n}=0$ be its Laplacian eigenvalues, and let q 1 ≥ q 2 ≥ ⋯ ≥ q n ≥ 0 $q_{1}\\geq q_{2}\\geq\\cdots\\geq q_{n}\\geq0$ be its signless Laplacian eigenvalues. The Laplacian-energy-like invariant and incidence energy of G are defined as, respectively, LEL ( G = ∑ i = 1 n − 1 μ i and IE ( G = ∑ i = 1 n q i . $$\\mathit{LEL}(G=\\sum_{i=1}^{n-1}\\sqrt{ \\mu_{i}} \\quad\\mbox{and}\\quad \\mathit {IE}(G=\\sum_{i=1}^{n} \\sqrt{q_{i}}. $$ In this paper, we present some new upper and lower bounds on LEL and IE of line graph, subdivision graph, para-line graph and total graph of a regular graph, some of which improve previously known results. The main tools we use here are the Cauchy-Schwarz inequality and the Ozeki inequality.

Semi-Supervised Tensor-Based Graph Embedding Learning and Its Application to Visual Discriminant Tracking.

Science.gov (United States)

Hu, Weiming; Gao, Jin; Xing, Junliang; Zhang, Chao; Maybank, Stephen

2017-01-01

An appearance model adaptable to changes in object appearance is critical in visual object tracking. In this paper, we treat an image patch as a two-order tensor which preserves the original image structure. We design two graphs for characterizing the intrinsic local geometrical structure of the tensor samples of the object and the background. Graph embedding is used to reduce the dimensions of the tensors while preserving the structure of the graphs. Then, a discriminant embedding space is constructed. We prove two propositions for finding the transformation matrices which are used to map the original tensor samples to the tensor-based graph embedding space. In order to encode more discriminant information in the embedding space, we propose a transfer-learning- based semi-supervised strategy to iteratively adjust the embedding space into which discriminative information obtained from earlier times is transferred. We apply the proposed semi-supervised tensor-based graph embedding learning algorithm to visual tracking. The new tracking algorithm captures an object's appearance characteristics during tracking and uses a particle filter to estimate the optimal object state. Experimental results on the CVPR 2013 benchmark dataset demonstrate the effectiveness of the proposed tracking algorithm.

ETHICS AND ADVERTISING

Directory of Open Access Journals (Sweden)

Constantin SASU

2015-04-01

Full Text Available Advertising is often critiqued for not respecting rules of ethics both in the process of advertisement design and in the way it influences society. The main concern of advertisers as representatives of companies that seek profit making is to increase sales, win new clients, increase the demand for the product they want to be presented in as nice and colorful advertisement as possible. They pretend that their product is the best, has unique qualities, better than their competitor´s, it has a better cost and brings much more benefits. That is the reason why the great challenge in advertising is to create sales efficient and at the same time moral and true advertising messages.

Price Competition on Graphs

OpenAIRE

Adriaan R. Soetevent

2010-01-01

This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial discontinuities in firm-level demand may occur. I show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs. I conjecture that this non-existence result holds...

Price Competition on Graphs

OpenAIRE

Pim Heijnen; Adriaan Soetevent

2014-01-01

This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. We derive an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. These graph models of price competition may lead to spatial discontinuities in firm-level demand. We show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs and conjecture that this non-existence result holds more general...

Skew-adjacency matrices of graphs

NARCIS (Netherlands)

Cavers, M.; Cioaba, S.M.; Fallat, S.; Gregory, D.A.; Haemers, W.H.; Kirkland, S.J.; McDonald, J.J.; Tsatsomeros, M.

2012-01-01

The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs. This leads to the following topics: graphs whose skew-adjacency matrices are all cospectral; relations between the matchings polynomial of a graph and the characteristic

Graph theory

CERN Document Server

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...

Acyclicity in edge-colored graphs

DEFF Research Database (Denmark)

Gutin, Gregory; Jones, Mark; Sheng, Bin

2017-01-01

A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type i......+1, i=1,2,3,4. The first three types are equivalent to the absence of PC cycles, PC closed trails, and PC closed walks, respectively. While graphs of types 1, 2 and 3 can be recognized in polynomial time, the problem of recognizing graphs of type 4 is, somewhat surprisingly, NP-hard even for 2-edge-colored...... graphs (i.e., when only two colors are used). The same problem with respect to type 5 is polynomial-time solvable for all edge-colored graphs. Using the five types, we investigate the border between intractability and tractability for the problems of finding the maximum number of internally vertex...

When advertising turns "cheeky"!

Science.gov (United States)

Burkitt, Jennifer A; Saucier, Deborah M; Thomas, Nicole A; Ehresman, Crystal

2006-05-01

Portraits typically exhibit leftward posing biases, with people showing more of their left cheek than their right. The current study investigated posing biases in print advertising to determine whether the product advertised affects the posing bias. As the posing bias may be decreasing over time, we also investigated changes in posing biases over a span of more than 100 years. The current investigation coded 2664 advertisements from two time periods; advertisements were coded for target group of advertisement (men, women, both) and posing bias (rightward, leftward, or central). Unlike other studies that typically observe a leftward posing bias, print advertisements exhibit a rightward posing bias, regardless of time-frame. Thus, print advertisements differ greatly from portraits, which may relate to the purpose of advertisements and the role of attractiveness in advertising.

Graph Sampling for Covariance Estimation

KAUST Repository

Chepuri, Sundeep Prabhakar

2017-04-25

In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean white noise and they admit a well-defined power spectrum whose shape is determined by the frequency response of the graph filter. Estimating the graph power spectrum forms an important component of stationary graph signal processing and related inference tasks such as Wiener prediction or inpainting on graphs. The central result of this paper is that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the second-order statistics of the graph signal from the subsampled observations, and more importantly, without any spectral priors. To this end, both a nonparametric approach as well as parametric approaches including moving average and autoregressive models for the graph power spectrum are considered. The results specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non-parametric and the moving average models, whereas a particular subsampling scheme that allows linear estimation for the autoregressive model is proposed. Numerical experiments on synthetic as well as real datasets related to climatology and processing handwritten digits are provided to demonstrate the developed theory.

Hospital Advertising, Competition, and HCAHPS: Does It Pay to Advertise?

Science.gov (United States)

Huppertz, John W; Bowman, R Alan; Bizer, George Y; Sidhu, Mandeep S; McVeigh, Colleen

2017-08-01

To test whether hospital advertising expenditures predict HCAHPS global ratings. We examined media advertising expenditures by 2,142 acute care hospitals in 209 markets in the United States. Data on hospital characteristics, location, and revenue came from CMS reports; system ownership was obtained from the American Hospital Association. Advertising data came from Kantar Media. HCAHPS data were obtained from HospitalCompare. Regression models examined whether hospitals' advertising spending predicts HCAHPS global measures and whether market concentration moderated this association. Hospital advertising spending was calculated by adding each individual hospital's expenditures to the amount spent by its parent health system, proportionally allocated by hospital revenue. Health system market share was used to estimate market concentration. These data were compared to hospitals' HCAHPS measures. In competitive markets (HHI below 1,000), hospital advertising predicted HCAHPS global measures. A 1-percent increase in advertising was associated with a 1.173-percent increase in patients rating the hospital a "9" or "10" on the HCAHPS survey and a 1.540-percent increase in patients who "definitely" would recommend the hospital. In concentrated markets, this association was not significant. In competitive markets, hospitals that spend more on advertising earn higher HCAHPS ratings on global measures. © Health Research and Educational Trust.

Price competition on graphs

NARCIS (Netherlands)

Soetevent, A.R.

2010-01-01

This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial

Graphing the order of the sexes: constructing, recalling, interpreting, and putting the self in gender difference graphs.

Science.gov (United States)

Hegarty, Peter; Lemieux, Anthony F; McQueen, Grant

2010-03-01

Graphs seem to connote facts more than words or tables do. Consequently, they seem unlikely places to spot implicit sexism at work. Yet, in 6 studies (N = 741), women and men constructed (Study 1) and recalled (Study 2) gender difference graphs with men's data first, and graphed powerful groups (Study 3) and individuals (Study 4) ahead of weaker ones. Participants who interpreted graph order as evidence of author "bias" inferred that the author graphed his or her own gender group first (Study 5). Women's, but not men's, preferences to graph men first were mitigated when participants graphed a difference between themselves and an opposite-sex friend prior to graphing gender differences (Study 6). Graph production and comprehension are affected by beliefs and suppositions about the groups represented in graphs to a greater degree than cognitive models of graph comprehension or realist models of scientific thinking have yet acknowledged.

Collective Rationality in Graph Aggregation

NARCIS (Netherlands)

Endriss, U.; Grandi, U.; Schaub, T.; Friedrich, G.; O'Sullivan, B.

2014-01-01

Suppose a number of agents each provide us with a directed graph over a common set of vertices. Graph aggregation is the problem of computing a single “collective” graph that best represents the information inherent in this profile of individual graphs. We consider this aggregation problem from the

Advertising Theory and Practice.

Science.gov (United States)

Sandage, C. H.; Fryburger, Vernon

The social and economic functions of advertising, its role in business, how it works, and how it is planned and created are the subject of this textbook. Sections include basic values and functions, background for planning advertising strategy, the advertising message, advertising media, testing advertising effectiveness, and the advertising…

Graph Theory. 1. Fragmentation of Structural Graphs

Directory of Open Access Journals (Sweden)

Lorentz JÄNTSCHI

2002-12-01

Full Text Available The investigation of structural graphs has many fields of applications in engineering, especially in applied sciences like as applied chemistry and physics, computer sciences and automation, electronics and telecommunication. The main subject of the paper is to express fragmentation criteria in graph using a new method of investigation: terminal paths. Using terminal paths are defined most of the fragmentation criteria that are in use in molecular topology, but the fields of applications are more generally than that, as I mentioned before. Graphical examples of fragmentation are given for every fragmentation criteria. Note that all fragmentation is made with a computer program that implements a routine for every criterion.[1] A web routine for tracing all terminal paths in graph can be found at the address: http://vl.academicdirect.ro/molecular_topology/tpaths/ [1] M. V. Diudea, I. Gutman, L. Jäntschi, Molecular Topology, Nova Science, Commack, New York, 2001, 2002.

Sonification of reference markers for auditory graphs: effects on non-visual point estimation tasks

Directory of Open Access Journals (Sweden)

Oussama Metatla

2016-04-01

Full Text Available Research has suggested that adding contextual information such as reference markers to data sonification can improve interaction with auditory graphs. This paper presents results of an experiment that contributes to quantifying and analysing the extent of such benefits for an integral part of interacting with graphed data: point estimation tasks. We examine three pitch-based sonification mappings; pitch-only, one-reference, and multiple-references that we designed to provide information about distance from an origin. We assess the effects of these sonifications on users’ performances when completing point estimation tasks in a between-subject experimental design against visual and speech control conditions. Results showed that the addition of reference tones increases users accuracy with a trade-off for task completion times, and that the multiple-references mapping is particularly effective when dealing with points that are positioned at the midrange of a given axis.

Tracking Research Data Footprints via Integration with Research Graph

Science.gov (United States)

Evans, B. J. K.; Wang, J.; Aryani, A.; Conlon, M.; Wyborn, L. A.; Choudhury, S. A.

2017-12-01

The researcher of today is likely to be part of a team that will use subsets of data from at least one, if not more external repositories, and that same data could be used by multiple researchers for many different purposes. At best, the repositories that host this data will know who is accessing their data, but rarely what they are using it for, resulting in funders of data collecting programs and data repositories that store the data unlikely to know: 1) which research funding contributed to the collection and preservation of a dataset, and 2) which data contributed to high impact research and publications. In days of funding shortages there is a growing need to be able to trace the footprint a data set from the originator that collected the data to the repository that stores the data and ultimately to any derived publications. The Research Data Alliance's Data Description Registry Interoperability Working Group (DDRIWG) has addressed this problem through the development of a distributed graph, called Research Graph that can map each piece of the research interaction puzzle by building aggregated graphs. It can connect datasets on the basis of co-authorship or other collaboration models such as joint funding and grants and can connect research datasets, publications, grants and researcher profiles across research repositories and infrastructures such as DataCite and ORCID. National Computational Infrastructure (NCI) in Australia is one of the early adopters of Research Graph. The graphic view and quantitative analysis helps NCI track the usage of their National reference data collections thus quantifying the role that these NCI-hosted data assets play within the funding-researcher-data-publication-cycle. The graph can unlock the complex interactions of the research projects by tracking the contribution of datasets, the various funding bodies and the downstream data users. RMap Project is a similar initiative which aims to solve complex relationships among

Modeling Newspaper Advertising

Science.gov (United States)

Harper, Joseph; And Others

1978-01-01

Presents a mathematical model for simulating a newspaper financial system. Includes the effects of advertising and circulation for predicting advertising linage as a function of population, income, and advertising rate. (RL)

Introductory graph theory

CERN Document Server

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

Leftward lighting in advertisements increases advertisement ratings and purchase intention.

Science.gov (United States)

Hutchison, Jennifer; Thomas, Nicole A; Elias, Lorin

2011-07-01

It has been reliably shown that light is assumed to come from above. There is also some suggestion that light from the left might be preferred. Leftward lighting biases have been observed across various mediums such as paintings, portraits, photographs, and advertisements. As advertisements are used to persuade the public to purchase products, it was of interest to better understand whether leftward lighting would influence future intention to purchase. Participants gave preference ratings for pairs of advertisements with opposing lighting directions. Attitude towards the advertisement and the brand as well as future purchase intention was then rated. Overall, participants indicated that they preferred advertisements with leftward lighting and were more likely to purchase these products in the future than when the same products were lit from the right. Findings are consistent with previously observed leftward lighting biases and suggest that advertisements with a leftward lighting bias might be more effective.

Redefining "child-directed advertising" to reduce unhealthy television food advertising.

Science.gov (United States)

Harris, Jennifer L; Sarda, Vishnudas; Schwartz, Marlene B; Brownell, Kelly D

2013-04-01

Food and beverage companies have pledged to reduce unhealthy marketing to children through the Children's Food and Beverage Advertising Initiative (CFBAI). However, public health experts question the initiative's effectiveness because pledges apply to only some types of marketing. For instance, the CFBAI covers only TV advertising that is "child-directed," defined as advertising during programs for which children make up 35% or more of the viewing audience. To quantify the proportion of food and beverage TV advertisements (ads) viewed by children that is covered by current CFBAI pledges and examine the potential impact of broader definitions of child-directed advertising. Nielsen data were used to quantify percentages of children (aged 2-11 years) in the audience (i.e., child-audience share), as well as absolute numbers of child viewers, for all national TV programs in 2009. Nielsen advertising data provided the number of food and beverage ads viewed by preschoolers (aged 2-5 years); older children (aged 6-11 years); and adults (aged 18-49 years) during programs with various child-audience compositions. Data were collected in 2010 and analyzed in 2011. Just 45%-48% of food ads viewed by children met current CFBAI definitions of child-directed advertising. Expanding this definition to include advertising during programs with a child-audience share of 20% or higher and/or 100,000 or more child viewers would cover 70%-71% of food advertising seen by children but just one third of ads seen by adults. Children viewed an estimated 35% fewer food ads during TV programs with a high child-audience share (≥50%) in 2009 compared with 2004. However, ensuring that nutrition standards apply to the majority of food ads viewed by children requires broader definitions of child-directed advertising. Copyright © 2013 American Journal of Preventive Medicine. Published by Elsevier Inc. All rights reserved.

Creating more effective graphs

CERN Document Server

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

Graph Compression by BFS

Directory of Open Access Journals (Sweden)

Alberto Apostolico

2009-08-01

Full Text Available The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.

Generalized N-coupled maps with invariant measure in Bose ...

Indian Academy of Sciences (India)

chronization problem of an array of the linearly coupled map lattices of ... groups and graphs and also in the design of experiments, coding theory, partition ... coupled map lattice which covers internal and external couplings in a form of asso-.

Graphing Inequalities, Connecting Meaning

Science.gov (United States)

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…

Fuzzy Graph Language Recognizability

OpenAIRE

Kalampakas , Antonios; Spartalis , Stefanos; Iliadis , Lazaros

2012-01-01

Part 5: Fuzzy Logic; International audience; Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.

Bell inequalities for graph states

International Nuclear Information System (INIS)

Toth, G.; Hyllus, P.; Briegel, H.J.; Guehne, O.

2005-01-01

Full text: In the last years graph states have attracted an increasing interest in the field of quantum information theory. Graph states form a family of multi-qubit states which comprises many popular states such as the GHZ states and the cluster states. They also play an important role in applications. For instance, measurement based quantum computation uses graph states as resources. From a theoretical point of view, it is remarkable that graph states allow for a simple description in terms of stabilizing operators. In this contribution, we investigate the non-local properties of graph states. We derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, any graph state violates at least one of the inequalities. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positively of the partial transpose or the geometric measure of entanglement. (author)

Point-of-sale tobacco advertising in Beirut, Lebanon following a national advertising ban.

Science.gov (United States)

Salloum, Ramzi G; Nakkash, Rima T; Myers, Allison E; Wood, Kathryn A; Ribisl, Kurt M

2013-06-03

The objective of this study was to conduct an audit of point-of-sale (POS) tobacco advertising and assess compliance with an advertising ban in a large district of Beirut, Lebanon. The audit was conducted 3 months following the ban on tobacco advertising. Trained students observed all tobacco retail outlets (n = 100) and entered data into a web-based form using iPad(®) technology. Presence of tobacco advertisements was assessed to determine compliance with the national advertising ban. Among the 100 tobacco retail outlets, 62% had tobacco advertisements, including 7% with a tobacco brand logo as part of the main exterior store sign. POS tobacco advertising is widespread in Beirut despite the national advertising ban. These findings point to an urgent need for the enforcement of the advertisement ban with tobacco retail outlets in Lebanon.

AN ADVERTISING OLIGOPOLY

Directory of Open Access Journals (Sweden)

Alina Irina GHIRVU

2013-12-01

Full Text Available This paper proposes a model of advertising competition based on the Cournot oligopoly model using a dynamic system, the equilibrium points of which can be determined analytically. We consider several cases for explaining the way in which firms will adapt their own advertising volume, depending on the number and the advertising volume of their competitors, in the context of an online video game used for advertising purposes. The dynamic setup is given by online Internet connection that allows interaction and communication and the high level of technology that permits nowadays real-time advertising insertions.

Newspaper vs. online advertising: Is there a niche for newspapers in modern advertising markets?

OpenAIRE

Lindstädt, Nadine; Budzinski, Oliver

2011-01-01

Newspapers have experienced declining circulation figures and declining advertising revenues for several years. In particular, declining advertising figures put a threat on newspapers – this is especially severe in the US where 73% of their revenues are generated through advertising. On the advertising side many companies have expanded their advertising expenditure towards online. Consequently, there are concerns about online advertising substituting newspaper advertising – in the same way as...

Quantitative graph theory mathematical foundations and applications

CERN Document Server

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

Dynamic Representations of Sparse Graphs

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf

1999-01-01

We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....

Spectral fluctuations of quantum graphs

International Nuclear Information System (INIS)

Pluhař, Z.; Weidenmüller, H. A.

2014-01-01

We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry

Multiple graph regularized protein domain ranking.

Science.gov (United States)

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-11-19

Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Advertising Through Social Media : Advertising plan for a hotel

OpenAIRE

Verbrugghe, Yann

2013-01-01

This thesis was written in order to develop advertising for the manor hotel Karolineburg, located in Kajaani, Finland, by using a social network as advertising media. This work also had for goal to show the possibility of social advertising and the benefits it can bring along. According to the situation of the company, findings and results revealed positive aspects of the work done.

The effect of search condition and advertising type on visual attention to Internet advertising.

Science.gov (United States)

Kim, Gho; Lee, Jang-Han

2011-05-01

This research was conducted to examine the level of consumers' visual attention to Internet advertising. It was predicted that consumers' search type would influence visual attention to advertising. Specifically, it was predicted that more attention to advertising would be attracted in the exploratory search condition than in the goal-directed search condition. It was also predicted that there would be a difference in visual attention depending on the advertisement type (advertising type: text vs. pictorial advertising). An eye tracker was used for measurement. Results revealed that search condition and advertising type influenced advertising effectiveness.

Acyclicity in edge-colored graphs

DEFF Research Database (Denmark)

Gutin, Gregory; Jones, Mark; Sheng, Bin

2017-01-01

A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type...

ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS

OpenAIRE

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.

Practical graph mining with R

CERN Document Server

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...

Dynamics of an advertising competition model with sales promotion

Science.gov (United States)

Jiang, Hui; Feng, Zhaosheng; Jiang, Guirong

2017-01-01

In this paper, an advertising competition model with sales promotion is constructed and investigated. Conditions of the existence and stability of period-T solutions are obtained by means of the discrete map. Flip bifurcation is analyzed by using the center manifold theory and three sales promotion strategies are discussed. Example and numerical simulations are illustrated which agree well with our theoretical analysis.

THE LANGUAGE OF ADVERTISING

Directory of Open Access Journals (Sweden)

Anamarija Gjuran-Coha

2009-01-01

Full Text Available Advertising has reached new dimensions in incorporating and exploiting patterns of message transmission on certain products and services offered to the market. Therefore, advertising has become the subject of an important multidisciplinary approach, scientific analysis and research. Multiplying the cognition from different domains of human activity along with technical and scientific innovations, the advertisment has become one of the most intense communication codes which are realized in a constant interaction between an individual and the world. In order to be present in consumer's consciousness and subconsciousness, advertising simoulaneously uses our ethical, moral, mental, social communication and other cognition. The word and the language, as important media used in advertising, play an important role. The aim of this study is to analyze the linguistic code of an advertisment and language strategies of advertisers. The objective of linguistic analysis of advertisments is to confirm that the advertisment is a part of multimedial discourse which is not realized its linguistic code, but all other paralinguistic elements are present. The analysis will be carried out on a corpus consisting of advertisments published in daily newspapers from 2000-2002. The linguistic features will be analyzed as well as the relation of linguistic code with other paralinguistic codes used in advertising.

A seminar on graph theory

CERN Document Server

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

Uniform Single Valued Neutrosophic Graphs

Directory of Open Access Journals (Sweden)

S. Broumi

2017-09-01

Full Text Available In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.

Extremal graph theory

CERN Document Server

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

Advertising Content

OpenAIRE

Simon P. Anderson; Régis Renault

2002-01-01

Empirical evidence suggests that most advertisements contain little direct informa- tion. Many do not mention prices. We analyze a firm'ss choice of advertising content and the information disclosed to consumers. A firm advertises only product informa- tion, price information, or both; and prefers to convey only limited product information if possible. Extending the "persuasion" game, we show that quality information takes precedence over price information and horizontal product information.T...

Multiple graph regularized protein domain ranking

KAUST Repository

Wang, Jim Jing-Yan

2012-11-19

Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

Multiple graph regularized protein domain ranking

KAUST Repository

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-01-01

Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

Multiple graph regularized protein domain ranking

Directory of Open Access Journals (Sweden)

Wang Jim

2012-11-01

Full Text Available Abstract Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Canonical Labelling of Site Graphs

Directory of Open Access Journals (Sweden)

Nicolas Oury

2013-06-01

Full Text Available We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with "many" automorphisms, and the partition refinement algorithm runs in sub-quadratic time for graphs with "few" bisimulation equivalences. This suite of algorithms was chosen based on the expectation that graphs fall in one of those two categories. If that is the case, a combined algorithm runs in sub-quadratic worst case time. Whether this expectation is reasonable remains an interesting open problem.

Optimal Attorney Advertising

OpenAIRE

Michael P. Stone

2010-01-01

Attorney advertising routinely targets tort victims. In this paper, a theoretical model is developed which incorporates advertising intensity, litigation costs, and an endogenous number of lawsuits. Since advertising induces victims to bring suit, it increases the level of injurer care. However, litigation costs are also incurred. At the optimum, the marginal benefit of deterrence equals the sum of the marginal costs of litigation and advertising. It is shown that even though blanket prohibit...

Cross-cultural advertising

OpenAIRE

Пурчельянова, Н. Ю.

2011-01-01

The essence of successful advertising is to convince people that a product is meant for them. By purchasing it, they will receive some benefit (lifestyle, status, convenience, etc.). However, when an advertising campaign is taken abroad different values as to what enhances status or gives convenience exist. These differences make the original advertising campaign defunct. It is therefore critical to any cross cultural advertising campaign that an understanding of a particular culture is acqui...

用户对移动广告的态度模型及实证研究%Empirical Study on Consumer Attitudes towards Mobile Advertising

Institute of Scientific and Technical Information of China (English)

肖爽

2014-01-01

A conceptual model of consumer attitudes to mobile advertising was developed .And corresponding suggestions were proposed.The collected data through SPSS 13.0 were analyzed.The conceptual model was validated by PLS -Graph3.0. The results indicate that the entertainment , information and interaction about mobile advertising have important effects on consum -er attitudes.Moreover, interactivity is the most important factor .The personalization also positively affects consumer attitudes to-wards mobile advertising .%以手机用户为研究对象，构建了用户移动广告态度模型，提出了影响用户移动广告态度的相关假设。通过对收集的数据利用SPSS软件进行了信度与效度分析，并用PLS-Graph3．0检验了假设，研究结果表明，移动广告的娱乐性、信息性和交互性对用户的移动广告态度有显著影响，其中交互性是影响用户对移动广告态度的最重要因素，同时个性化也正向影响了移动广告态度。

Misleading Advertising in Duopoly

OpenAIRE

Keisuke Hattori; Keisaku Higashida

2011-01-01

This paper builds a model of strategic misleading advertising in duopolistic markets with horizontal product differentiation and advertising externality between firms. We investigate the effects of regulating misinformation on market competition, behaviour of firms, and social welfare. We show that the degree of advertising externality and the magnitude of advertising costs are crucial for determining the welfare effects of several regulations, including prohibiting misleading advertising, ed...

Canonical, stable, general mapping using context schemes.

Science.gov (United States)

Novak, Adam M; Rosen, Yohei; Haussler, David; Paten, Benedict

2015-11-15

Sequence mapping is the cornerstone of modern genomics. However, most existing sequence mapping algorithms are insufficiently general. We introduce context schemes: a method that allows the unambiguous recognition of a reference base in a query sequence by testing the query for substrings from an algorithmically defined set. Context schemes only map when there is a unique best mapping, and define this criterion uniformly for all reference bases. Mappings under context schemes can also be made stable, so that extension of the query string (e.g. by increasing read length) will not alter the mapping of previously mapped positions. Context schemes are general in several senses. They natively support the detection of arbitrary complex, novel rearrangements relative to the reference. They can scale over orders of magnitude in query sequence length. Finally, they are trivially extensible to more complex reference structures, such as graphs, that incorporate additional variation. We demonstrate empirically the existence of high-performance context schemes, and present efficient context scheme mapping algorithms. The software test framework created for this study is available from https://registry.hub.docker.com/u/adamnovak/sequence-graphs/. anovak@soe.ucsc.edu Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Domination criticality in product graphs

Directory of Open Access Journals (Sweden)

M.R. Chithra

2015-07-01

Full Text Available A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G with connected domination number, γc(G=2,3 and characterize such graphs. Also, we characterize the k−γ-vertex (edge critical graphs and k−γc-vertex (edge critical graphs for k=2,3 where γ denotes the domination number of G. We also discuss the vertex criticality in grids.

Graph Creation, Visualisation and Transformation

Directory of Open Access Journals (Sweden)

Maribel Fernández

2010-03-01

Full Text Available We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive user interface. The editor uses the functionalities of the TULIP system, which gives us access to a wealth of visualisation algorithms. Interaction nets are not only a formalism for the specification of graphs, but also a rewrite-based computation model. We discuss graph rewriting strategies and a language to express them in order to perform strategic interaction net rewriting.

Consumers’ Attitude Towards Advertising Audit As Marketing Communication Tool: Advertising Ethics

Directory of Open Access Journals (Sweden)

Selma KARABAŞ

2013-06-01

Full Text Available One of the methods used by companies, which want to forest all the arrivals, is use effective advertisements aiming to bring out the properties of the product. Advertisement on consumers’ behaviors is one of the effective methods in creating demand for the product. It is a tool used in order to be distinguished in all respects of competition becoming widespread day by day. This study discusses advertisement ethics especially the ads on TV. Advertisement, by its nature, may have a have a misleading hidden character and cause unfair competition. The approach developed by consumers against such kinds of advertisements has been studied via data obtained by survey method. Consumers’ opinions on advertisement ethics were taken via Likert scale. The methods used for evaluating these surveys are Kolmogorov Smirnov test and One-Sample t-test.

False Advertising

OpenAIRE

Rhodes, Andrew; Wilson, Chris M

2016-01-01

There is widespread evidence that some firms use false advertising to overstate the value of their products. We consider a model in which a policymaker is able to punish such false claims. We characterize an equilibrium where false advertising actively influences rational buyers, and analyze the effects of policy under different welfare objectives. We establish precise conditions where policy optimally permits a positive level of false advertising, and show how these conditions vary intuitive...

AN ADVERTISING OLIGOPOLY

OpenAIRE

Alina Irina GHIRVU

2013-01-01

This paper proposes a model of advertising competition based on the Cournot oligopoly model using a dynamic system, the equilibrium points of which can be determined analytically. We consider several cases for explaining the way in which firms will adapt their own advertising volume, depending on the number and the advertising volume of their competitors, in the context of an online video game used for advertising purposes. The dynamic setup is given by online Internet connection ...

Graph Colouring Algorithms

DEFF Research Database (Denmark)

Husfeldt, Thore

2015-01-01

This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...

Research advertising exposure in colleges

OpenAIRE

Išoraitė, Margarita

2013-01-01

This article analyses the concept of advertising and the theoretical aspect of advertising strategy. Advertising can be defined as various means of dissemination of information on goods and services, promoting their use to potential users impersonally. Advertising strategies for selecting the location of a typical advertising plan diagram can be defined as decisions related to the target audience coverage, creative advertising message strategy selection and dissemination of the advertising st...

The fascinating world of graph theory

CERN Document Server

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

Classical dynamics on graphs

International Nuclear Information System (INIS)

Barra, F.; Gaspard, P.

2001-01-01

We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator that generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined for the time-continuous classical dynamics on graphs. These properties are given as the zeros of some periodic-orbit zeta functions. We consider in detail the case of infinite periodic graphs where the particle undergoes a diffusion process. The infinite spatial extension is taken into account by Fourier transforms that decompose the observables and probability densities into sectors corresponding to different values of the wave number. The hydrodynamic modes of diffusion are studied by an eigenvalue problem of a Frobenius-Perron operator corresponding to a given sector. The diffusion coefficient is obtained from the hydrodynamic modes of diffusion and has the Green-Kubo form. Moreover, we study finite but large open graphs that converge to the infinite periodic graph when their size goes to infinity. The lifetime of the particle on the open graph is shown to correspond to the lifetime of a system that undergoes a diffusion process before it escapes

Do television food advertisements portray advertised foods in a 'healthy' food context?

Science.gov (United States)

Adams, Jean; Tyrrell, Rachel; White, Martin

2011-03-01

Exposure to food promotion influences food preferences and diet. As food advertisements tend to promote 'less healthy' products, food advertising probably plays some role in the 'obesity epidemic'. Amid calls for increased regulation, food manufacturers are beginning to engage in a variety of health-promoting marketing initiatives. Positioning products in the context of a 'healthy', balanced diet in television advertisements is one such initiative. We explored whether the wider food context in which foods are advertised on television are 'healthier' than the advertised foods themselves. All foods shown in food advertisements broadcast during 1 week on one commercial UK channel were identified and classified as 'primary' (i.e. the focus of advertisements) or 'incidental'. The nutritional content of all foods was determined and that of primary and incidental foods were compared. Almost two-thirds of food advertisements did not include any incidental foods. When a wider food context was present, this tended to be 'healthier' than the primary foods that were the focus of food advertisements - particularly in terms of the food groups represented. It is not yet clear what effect this may have on consumers' perceptions and behaviour, and whether or not this practice should be encouraged or discouraged from a public health perspective.

Groupies in multitype random graphs

OpenAIRE

Shang, Yilun

2016-01-01

A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erd?s-R?nyi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.

Quantum information processing with graph states

International Nuclear Information System (INIS)

Schlingemann, Dirk-Michael

2005-04-01

Graph states are multiparticle states which are associated with graphs. Each vertex of the graph corresponds to a single system or particle. The links describe quantum correlations (entanglement) between pairs of connected particles. Graph states were initiated independently by two research groups: On the one hand, graph states were introduced by Briegel and Raussendorf as a resource for a new model of one-way quantum computing, where algorithms are implemented by a sequence of measurements at single particles. On the other hand, graph states were developed by the author of this thesis and ReinhardWerner in Braunschweig, as a tool to build quantum error correcting codes, called graph codes. The connection between the two approaches was fully realized in close cooperation of both research groups. This habilitation thesis provides a survey of the theory of graph codes, focussing mainly, but not exclusively on the author's own research work. We present the theoretical and mathematical background for the analysis of graph codes. The concept of one-way quantum computing for general graph states is discussed. We explicitly show how to realize the encoding and decoding device of a graph code on a one-way quantum computer. This kind of implementation is to be seen as a mathematical description of a quantum memory device. In addition to that, we investigate interaction processes, which enable the creation of graph states on very large systems. Particular graph states can be created, for instance, by an Ising type interaction between next neighbor particles which sits at the points of an infinitely extended cubic lattice. Based on the theory of quantum cellular automata, we give a constructive characterization of general interactions which create a translationally invariant graph state. (orig.)

Fibonacci number of the tadpole graph

Directory of Open Access Journals (Sweden)

Joe DeMaio

2014-10-01

Full Text Available In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2 and the Fibonacci number of the cycle graph Cn is the Lucas number Ln. The tadpole graph Tn,k is the graph created by concatenating Cn and Pk with an edge from any vertex of Cn to a pendant of Pk for integers n=3 and k=0. This paper establishes formulae and identities for the Fibonacci number of the tadpole graph via algebraic and combinatorial methods.

Advertising on the Internet.

Science.gov (United States)

Jugenheimer, Donald W.

1996-01-01

States that although many advertisers have intentions of utilizing the Internet for advertising, which can provide specific audience targeting and buyer/seller interactivity, few have been successful. Explains advantages and disadvantages of using the Internet for advertising purposes. Cites special problems with Internet advertising and successes…

On characterizing terrain visibility graphs

Directory of Open Access Journals (Sweden)

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.

Network reconstruction via graph blending

Science.gov (United States)

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.

Interaction graphs

DEFF Research Database (Denmark)

Seiller, Thomas

2016-01-01

Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should...... be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define...... "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite...

Choropleth map legend design for visualizing community health disparities

Directory of Open Access Journals (Sweden)

Cromley Ellen K

2009-09-01

Full Text Available Abstract Background Disparities in health outcomes across communities are a central concern in public health and epidemiology. Health disparities research often links differences in health outcomes to other social factors like income. Choropleth maps of health outcome rates show the geographical distribution of health outcomes. This paper illustrates the use of cumulative frequency map legends for visualizing how the health events are distributed in relation to social characteristics of community populations. The approach uses two graphs in the cumulative frequency legend to highlight the difference between the raw count of the health events and the raw count of the social characteristic like low income in the geographical areas of the map. The approach is applied to mapping publicly available data on low birth weight by town in Connecticut and Lyme disease incidence by town in Connecticut in relation to income. The steps involved in creating these legends are described in detail so that health analysts can adopt this approach. Results The different health problems, low birth weight and Lyme disease, have different cumulative frequency signatures. Graphing poverty population on the cumulative frequency legends revealed that the poverty population is distributed differently with respect to the two different health problems mapped here. Conclusion Cumulative frequency legends can be useful supplements for choropleth maps. These legends can be constructed using readily available software. They contain all of the information found in standard choropleth map legends, and they can be used with any choropleth map classification scheme. Cumulative frequency legends effectively communicate the proportion of areas, the proportion of health events, and/or the proportion of the denominator population in which the health events occurred that falls within each class interval. They illuminate the context of disease through graphing associations with other

Groupies in multitype random graphs.

Science.gov (United States)

Shang, Yilun

2016-01-01

A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.

INTERNET ADVERTISING: A PRIMER

OpenAIRE

Matthew N. O. Sadiku*, Shumon Alam, Sarhan M. Musa

2017-01-01

Internet advertising (IA) is using the Internet to market products and services to a large audience. In the current era of Internet commerce, companies have chosen to use Internet advertising and the trend is irreversible. The goal of Internet advertising is to drive customers to your website. Understanding some key concepts of Internet advertising is crucial to creating a strategy that will suit one’s business. This paper provides a brief introduction to Internet or online advertising.

Wearout Effects of Different Advertising Themes: A Dynamic Bayesian Model of the Advertising-Sales Relationship

OpenAIRE

Frank M. Bass; Norris Bruce; Sumit Majumdar; B. P. S. Murthi

2007-01-01

Models of advertising response implicitly assume that the entire advertising budget is spent on disseminating one message. In practice, managers use different themes of advertising (for example, price advertisements versus product advertisements) and within each theme they employ different versions of an advertisement. In this study, we evaluate the dynamic effects of different themes of advertising that have been employed in a campaign. We develop a model that jointly considers the effects o...

The Harary index of a graph

CERN Document Server

Xu, Kexiang; Trinajstić, Nenad

2015-01-01

This is the first book to focus on the topological index, the Harary index, of a graph, including its mathematical properties, chemical applications and some related and attractive open problems. This book is dedicated to Professor Frank Harary (1921—2005), the grandmaster of graph theory and its applications. It has be written by experts in the field of graph theory and its applications. For a connected graph G, as an important distance-based topological index, the Harary index H(G) is defined as the sum of the reciprocals of the distance between any two unordered vertices of the graph G. In this book, the authors report on the newest results on the Harary index of a graph. These results mainly concern external graphs with respect to the Harary index; the relations to other topological indices; its properties and applications to pure graph theory and chemical graph theory; and two significant variants, i.e., additively and multiplicatively weighted Harary indices. In the last chapter, we present a number o...

A Modal-Logic Based Graph Abstraction

NARCIS (Netherlands)

Bauer, J.; Boneva, I.B.; Kurban, M.E.; Rensink, Arend; 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

Pun in Beverage Advertisements

Institute of Scientific and Technical Information of China (English)

Meng; Yan

2015-01-01

Accompanied with the widespread commerce,the advertisement translation unavoidably will be a hot spot again.This paper will discuss usage and translation of pun in the advertisement translation.It will explain the definition of advertisement as well as pun and then give examples about the usage of pun in advertisement.

Pun in Beverage Advertisements

Institute of Scientific and Technical Information of China (English)

Technology Sichuan

2015-01-01

Accompanied with the widespread commerce,the advertisement translation unavoidably will be a hot spot again. This paper will discuss usage and translation of pun in the advertisement translation.It will explain the definition of advertisement as well as pun and then give examples about the usage of pun in advertisement.

Graph mining for next generation sequencing: leveraging the assembly graph for biological insights.

Science.gov (United States)

Warnke-Sommer, Julia; Ali, Hesham

2016-05-06

The assembly of Next Generation Sequencing (NGS) reads remains a challenging task. This is especially true for the assembly of metagenomics data that originate from environmental samples potentially containing hundreds to thousands of unique species. The principle objective of current assembly tools is to assemble NGS reads into contiguous stretches of sequence called contigs while maximizing for both accuracy and contig length. The end goal of this process is to produce longer contigs with the major focus being on assembly only. Sequence read assembly is an aggregative process, during which read overlap relationship information is lost as reads are merged into longer sequences or contigs. The assembly graph is information rich and capable of capturing the genomic architecture of an input read data set. We have developed a novel hybrid graph in which nodes represent sequence regions at different levels of granularity. This model, utilized in the assembly and analysis pipeline Focus, presents a concise yet feature rich view of a given input data set, allowing for the extraction of biologically relevant graph structures for graph mining purposes. Focus was used to create hybrid graphs to model metagenomics data sets obtained from the gut microbiomes of five individuals with Crohn's disease and eight healthy individuals. Repetitive and mobile genetic elements are found to be associated with hybrid graph structure. Using graph mining techniques, a comparative study of the Crohn's disease and healthy data sets was conducted with focus on antibiotics resistance genes associated with transposase genes. Results demonstrated significant differences in the phylogenetic distribution of categories of antibiotics resistance genes in the healthy and diseased patients. Focus was also evaluated as a pure assembly tool and produced excellent results when compared against the Meta-velvet, Omega, and UD-IDBA assemblers. Mining the hybrid graph can reveal biological phenomena captured

Advertising to children initiatives have not reduced unhealthy food advertising on Australian television.

Science.gov (United States)

Watson, Wendy L; Lau, Vivien; Wellard, Lyndal; Hughes, Clare; Chapman, Kathryn

2017-12-01

In response to rising childhood obesity rates, the Australian food industry implemented two initiatives in 2009 to reduce the marketing of unhealthy food to children. This study evaluated the efficacy of these initiatives on the rate of unhealthy food advertising to children on Australian television. The rates of food advertisements on three free-to-air commercial television channels and a youth-oriented digital channel in Sydney, Australia were analysed over 2 weekdays (16 h) and two weekend days (22 h). Advertisements were categorized according to the healthiness of foods advertised (non-core, core, miscellaneous) and signatory status to the food industry advertising initiatives. Total food advertising rates for the three channels increased from 5.5/h in 2011 to 7.3/h in 2015, due to an increase of 0.8/h for both core and miscellaneous foods. The rate of non-core food advertisements in 2015 (3.1/h) was similar to 2011 (3.0/h). The youth-oriented channel had fewer total food advertisements (3.7/h versus 7.3/h) but similar fast-food advertisement rates (1.3/h versus 1.3/h). There was no change in the rate of unhealthy food advertising since 2011, suggesting minimal impact of the current food industry initiatives on reducing children's exposure to unhealthy food advertising. © The Author 2017. Published by Oxford University Press on behalf of Faculty of Public Health. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com

From Advertising to Hyper-advertising: Semiotics, Narrative and Discourse

OpenAIRE

Eduardo Yalán-Dongo

2016-01-01

Advertising design is a discursive planning that does not only build an identity as brand value or graphic development, but also as Semiotics suggests, it produces a narrative level outlining the advertising story. The use of media, construction of characters, storytelling, organization of advertisement, are all expressions of this narrative level which in turn depends on a “context” or expression process from which they are built. This article aims to identify the different forms of narrativ...

Key Features of Political Advertising as an Independent Type of Advertising Communication

Directory of Open Access Journals (Sweden)

Svetlana Anatolyevna Chubay

2015-09-01

Full Text Available To obtain the most complete understanding of the features of political advertising, the author characterizes its specific features allocated by modern researchers. The problem of defining the notion of political advertising is studied in detail. The analysis of definitions available in professional literature has allowed the author to identify a number of key features that characterize political advertising as an independent type of promotional activity. These features include belonging to the forms of mass communication, implemented through different communication channels; the presence of characteristics typical of any advertising as a form of mass communication (strategies and concepts promoting the program, ideas; an integrated approach to the selection of communication channels, means and the methods of informing the addressers that focus on the audience; the formation of psychological attitude to voting; the image nature; the manipulative potential. It is shown that the influence is the primary function of political advertising – it determines the key characteristics common to this type of advertising. Political advertising, reflecting the essence of the political platform of certain political forces, setting up voters for their support, forming and introducing into the mass consciousness a definite idea of the character of these political forces, creates the desired psychological attitude to the voting. The analysis of definitions available in professional literature has allowed the author to formulate an operational definition of political advertising, which allowed to include the features that distinguish political advertising from other forms of political communication such as political PR which is traditionally mixed with political advertising.

Distance-transitive graphs

NARCIS (Netherlands)

Cohen, A.M.; Beineke, L.W.; Wilson, R.J.; Cameron, P.J.

2004-01-01

In this chapter we investigate the classification of distance-transitive graphs: these are graphs whose automorphism groups are transitive on each of the sets of pairs of vertices at distance i, for i = 0, 1,.... We provide an introduction into the field. By use of the classification of finite

Temporal Representation in Semantic Graphs

Energy Technology Data Exchange (ETDEWEB)

Levandoski, J J; Abdulla, G M

2007-08-07

A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.

The complexity of the matching-cut problem for planar graphs and other graph classes

NARCIS (Netherlands)

Bonsma, P.S.

2009-01-01

The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be -complete when restricted to graphs with maximum degree four. In this paper it

27 CFR 6.84 - Point of sale advertising materials and consumer advertising specialties.

Science.gov (United States)

2010-04-01

... 27 Alcohol, Tobacco Products and Firearms 1 2010-04-01 2010-04-01 false Point of sale advertising materials and consumer advertising specialties. 6.84 Section 6.84 Alcohol, Tobacco Products and Firearms....84 Point of sale advertising materials and consumer advertising specialties. (a) General. The act by...

Advertisement without Ethical Principles?

OpenAIRE

Wojciech Słomski

2007-01-01

The article replies to the question, whether the advertisement can exist without ethical principles or ethics should be the basis of the advertisement. One can say that the ethical opinion of the advertisement does not depend on content and the form of advertising content exclusively, but also on recipientís consciousness. The advertisement appeals to the emotions more than to the intellect, thus restricting the area of conscious and based on rational premises choice, so it is morally bad. It...

PRIVATE GRAPHS – ACCESS RIGHTS ON GRAPHS FOR SEAMLESS NAVIGATION

Directory of Open Access Journals (Sweden)

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.

Integer Flows and Circuit Covers of Graphs and Signed Graphs

Science.gov (United States)

Cheng, Jian

The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it

Graph Theory Approach for Studying Food Webs

Science.gov (United States)

Longjas, A.; Tejedor, A.; Foufoula-Georgiou, E.

2017-12-01

Food webs are complex networks of feeding interactions among species in ecological communities. Metrics describing food web structure have been proposed to compare and classify food webs ranging from food chain length, connectance, degree distribution, centrality measures, to the presence of motifs (distinct compartments), among others. However, formal methodologies for studying both food web topology and the dynamic processes operating on them are still lacking. Here, we utilize a quantitative framework using graph theory within which a food web is represented by a directed graph, i.e., a collection of vertices (species or trophic species defined as sets of species sharing the same predators and prey) and directed edges (predation links). This framework allows us to identify apex (environmental "source" node) to outlet (top predators) subnetworks and compute the steady-state flux (e.g., carbon, nutrients, energy etc.) in the food web. We use this framework to (1) construct vulnerability maps that quantify the relative change of flux delivery to the top predators in response to perturbations in prey species (2) identify keystone species, whose loss would precipitate further species extinction, and (3) introduce a suite of graph-theoretic metrics to quantify the topologic (imposed by food web connectivity) and dynamic (dictated by the flux partitioning and distribution) components of a food web's complexity. By projecting food webs into a 2D Topodynamic Complexity Space whose coordinates are given by Number of alternative paths (topologic) and Leakage Index (dynamic), we show that this space provides a basis for food web comparison and provide physical insights into their dynamic behavior.

THE EVOLUTION OF ADVERTISING MARKET WHERE IS ADVERTISING NOW, AND WHERE IS IT GOING?

OpenAIRE

Sorin Terchila

2010-01-01

Advertising is more complicated than it used to be. In the innocent days of the 70’s and 80’s you could easily reach large audiences, both locally and nationally, through traditional advertising. Those days are long gone and an examination of the advertising playing field looks like a big pile of incomprehensible choice. In Romania, advertising has mushroomed over the past 10 years. With the emergence of large international companies and the budgets allocated to them in advertising, advertise...

Port-Hamiltonian Systems on Open Graphs

NARCIS (Netherlands)

Schaft, A.J. van der; Maschke, B.M.

2010-01-01

In this talk we discuss how to define in an intrinsic manner port-Hamiltonian dynamics on open graphs. Open graphs are graphs where some of the vertices are boundary vertices (terminals), which allow interconnection with other systems. We show that a directed graph carries two natural Dirac

Towards a theory of geometric graphs

CERN Document Server

Pach, Janos

2004-01-01

The early development of graph theory was heavily motivated and influenced by topological and geometric themes, such as the Konigsberg Bridge Problem, Euler's Polyhedral Formula, or Kuratowski's characterization of planar graphs. In 1936, when Denes Konig published his classical Theory of Finite and Infinite Graphs, the first book ever written on the subject, he stressed this connection by adding the subtitle Combinatorial Topology of Systems of Segments. He wanted to emphasize that the subject of his investigations was very concrete: planar figures consisting of points connected by straight-line segments. However, in the second half of the twentieth century, graph theoretical research took an interesting turn. In the most popular and most rapidly growing areas (the theory of random graphs, Ramsey theory, extremal graph theory, algebraic graph theory, etc.), graphs were considered as abstract binary relations rather than geometric objects. Many of the powerful techniques developed in these fields have been su...

Phase transition in the parametric natural visibility graph.

Science.gov (United States)

Snarskii, A A; Bezsudnov, I V

2016-10-01

We investigate time series by mapping them to the complex networks using a parametric natural visibility graph (PNVG) algorithm that generates graphs depending on arbitrary continuous parameter-the angle of view. We study the behavior of the relative number of clusters in PNVG near the critical value of the angle of view. Artificial and experimental time series of different nature are used for numerical PNVG investigations to find critical exponents above and below the critical point as well as the exponent in the finite size scaling regime. Altogether, they allow us to find the critical exponent of the correlation length for PNVG. The set of calculated critical exponents satisfies the basic Widom relation. The PNVG is found to demonstrate scaling behavior. Our results reveal the similarity between the behavior of the relative number of clusters in PNVG and the order parameter in the second-order phase transitions theory. We show that the PNVG is another example of a system (in addition to magnetic, percolation, superconductivity, etc.) with observed second-order phase transition.

Quantum walk on a chimera graph

Science.gov (United States)

Xu, Shu; Sun, Xiangxiang; Wu, Jizhou; Zhang, Wei-Wei; Arshed, Nigum; Sanders, Barry C.

2018-05-01

We analyse a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum walk features such as localization that starkly distinguishes classical from quantum behaviour. Motivated by technological thrusts, we study continuous-time quantum walk on enhanced variants of the chimera graph and on diminished chimera graph with a random removal of vertices. We explain the quantum walk by constructing a generating set for a suitable subgroup of graph isomorphisms and corresponding symmetry operators that commute with the quantum walk Hamiltonian; the Hamiltonian and these symmetry operators provide a complete set of labels for the spectrum and the stationary states. Our quantum walk characterization of the chimera graph and its variants yields valuable insights into graphs used for designing quantum-annealers.

Software for Graph Analysis and Visualization

Directory of Open Access Journals (Sweden)

M. I. Kolomeychenko

2014-01-01

Full Text Available This paper describes the software for graph storage, analysis and visualization. The article presents a comparative analysis of existing software for analysis and visualization of graphs, describes the overall architecture of application and basic principles of construction and operation of the main modules. Furthermore, a description of the developed graph storage oriented to storage and processing of large-scale graphs is presented. The developed algorithm for finding communities and implemented algorithms of autolayouts of graphs are the main functionality of the product. The main advantage of the developed software is high speed processing of large size networks (up to millions of nodes and links. Moreover, the proposed graph storage architecture is unique and has no analogues. The developed approaches and algorithms are optimized for operating with big graphs and have high productivity.

What Would a Graph Look Like in this Layout? A Machine Learning Approach to Large Graph Visualization.

Science.gov (United States)

Kwon, Oh-Hyun; Crnovrsanin, Tarik; Ma, Kwan-Liu

2018-01-01

Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.

Text-Filled Stacked Area Graphs

DEFF Research Database (Denmark)

Kraus, Martin

2011-01-01

-filled stacked area graphs; i.e., graphs that feature stacked areas that are filled with small-typed text. Since these graphs allow for computing the text layout automatically, it is possible to include large amounts of textual detail with very little effort. We discuss the most important challenges and some...... solutions for the design of text-filled stacked area graphs with the help of an exemplary visualization of the genres, publication years, and titles of a database of several thousand PC games....

Value of Sharing: Viral Advertisement

OpenAIRE

Duygu Aydın; Aşina Gülerarslan; Süleyman Karaçor; Tarık Doğan

2013-01-01

Sharing motivations of viral advertisements by consumers and the impacts of these advertisements on the perceptions for brand will be questioned in this study. Three fundamental questions are answered in the study. These are advertisement watching and sharing motivations of individuals, criteria of liking viral advertisement and the impact of individual attitudes for viral advertisement on brand perception respectively. This study will be carried out via a viral advertise...

12 CFR 230.8 - Advertising.

Science.gov (United States)

2010-01-01

... 12 Banks and Banking 3 2010-01-01 2010-01-01 false Advertising. 230.8 Section 230.8 Banks and... SAVINGS (REGULATION DD) § 230.8 Advertising. (a) Misleading or inaccurate advertisements. An advertisement... obtain the advertised annual percentage yield. For tiered-rate accounts, the minimum balance required for...

12 CFR 707.8 - Advertising.

Science.gov (United States)

2010-01-01

... 12 Banks and Banking 6 2010-01-01 2010-01-01 false Advertising. 707.8 Section 707.8 Banks and... Advertising. (a) Misleading or inaccurate advertisements. An advertisement must not: (1) Be misleading or... balance required to earn the advertised annual percentage yield. For tiered-rate accounts, the minimum...

On Graph Rewriting, Reduction and Evaluation

DEFF Research Database (Denmark)

Zerny, Ian

2010-01-01

We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter-derive a t......We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter...

Relative expressive power of navigational querying on graphs using transitive closure

OpenAIRE

Surinx, Dimitri; Fletcher, George H. L.; Gyssens, Marc; Leinders, Dirk; Van den Bussche, Jan; Van Gucht, Dirk; Vansummeren, Stijn; Wu, Yuqing

2015-01-01

Motivated by both established and new applications, we study navigational query languages for graphs (binary relations). The simplest language has only the two operators union and composition, together with the identity relation. We make more powerful languages by adding any of the following operators: intersection; set difference; projection; coprojection; converse; transitive closure; and the diversity relation. All these operators map binary relations to binary relations. We compare the ex...

Restriction of television food advertising in South Korea: impact on advertising of food companies.

Science.gov (United States)

Kim, Soyoung; Lee, Youngmi; Yoon, Jihyun; Chung, Sang-Jin; Lee, Soo-Kyung; Kim, Hyogyoo

2013-03-01

The association between exposure to television (TV) food advertising and children's dietary habits has been well established in previous studies. However, the efficacy of restrictions on TV food advertising in the prevention of childhood obesity remains controversial. The South Korean government has recently enforced a regulation, termed the Special Act on Safety Management of Children's Dietary Life, which restricts TV advertising of energy-dense and nutrient-poor (EDNP) foods targeting children. This study aimed to determine the impact of this regulation by examining changes in the TV advertising practices of South Korean food companies since the scheduled enforcement date of January 2010. The total advertising budget, number of advertisement placements and gross rating points (GRPs) for advertisements on EDNP foods aired on the five representative TV channels in South Korea were compared and analyzed for the year before and after January 2010. After January 2010, the total adverting budget, number of advertisement placements and GRPs decreased during regulated hours. Even during non-regulated hours, a significant decline was noticed in the number of advertisement placements and GRPs. The total advertising budget for non-EDNP foods increased, whereas that for EDNP foods decreased at a higher rate in addition to a drop in its percentage share. These results suggest positive changes in TV advertising practices of food companies because of the regulation, thereby lowering children's exposure to TV advertising of EDNP foods and promoting a safer environment that may facilitate child health improvement in South Korea.

Advertising Dynamics and Competitive Advantage

OpenAIRE

Ulrich Doraszelski; Sarit Markovich

2004-01-01

Can advertising lead to a sustainable competitive advantage? To answer this question, we propose a dynamic model of advertising competition where firms repeatedly advertise, compete in the product market, and make entry as well as exit decisions. Within this dynamic framework, we study two different models of advertising: In the first model, advertising influences the goodwill consumers extend towards a firm ("goodwill advertising"), whereas in the second model it influences the share of cons...

Informative Advertising: Competition or Cooperation?

OpenAIRE

Witness Simbanegavi

2005-01-01

I compare the outcome when firms semicollude on advertising to the outcome in the Grossman and Shapiro (1984) model of informative advertising. I show that advertising is lower but prices and profits are higher under semicollusion on advertising. I also show that semicollusion on advertising is detrimental to welfare. Although firms earn higher profits when colluding on advertising, fewer consumers are informed, and as a result, welfare is lower. Compared to semicollusion on price, semicollus...

Advertising is magic

International Nuclear Information System (INIS)

Haskins, Louise

1999-01-01

Full text: Now in its fourth year, BNFL's advertising strategy continues to evolve and build upon the communication achievements of previous years. The case study this year will reflect upon progress so far and will concentrate specifically on the 1998 campaign development. It will begin by briefly reiterating the role we believe advertising plays in the communications mix and by recapping on the theoretical framework upon which the strategy continues to be based. Last year, I presented a case study on the development of BNFL's second television advertisement and supporting media. This year, I will present opinion research data which indicates that BNFL has, indeed, begun to detach itself from the contentious debate which surrounds the nuclear industry in general. Verbatim comments from respondents demonstrate that BNFL is now being perceived more widely within the UK as a successful corporate entity. The presentation will concentrate on the decision-making and research process which led us to select the content of our third advertising campaign. One key consideration being the impact of BNR:s merger with Magnox Electric plc and how their activity was incorporated into the overall advertising strategy. Having established key image characteristics through describing BNFL's scientific achievements and, more recently, BNFL's fuel recycling capabilities, the presentation will outline why this time we have opted for a total capability' advertisement whilst endeavouring to retain the five key image criteria which are at the heart of the strategy. Specific areas covered will include our clearance of the advertisement through the UK's advertising regulatory bodies (the Broadcast Advertising Clearance Centre (BACC) and the Independent Television Commission (ITQ). This in itself will demonstrate the importance of gaining detailed substantiation and legal clearance of the advertising claims made. Finally, we will share our experiences of each production phase, not least, the

Graph transformation tool contest 2008

NARCIS (Netherlands)

Rensink, Arend; van Gorp, Pieter

This special section is the outcome of the graph transformation tool contest organised during the Graph-Based Tools (GraBaTs) 2008 workshop, which took place as a satellite event of the International Conference on Graph Transformation (ICGT) 2008. The contest involved two parts: three “off-line case

On dominator colorings in graphs

Indian Academy of Sciences (India)

colors required for a dominator coloring of G is called the dominator .... Theorem 1.3 shows that the complete graph Kn is the only connected graph of order n ... Conversely, if a graph G satisfies condition (i) or (ii), it is easy to see that χd(G) =.

Graphs with branchwidth at most three

NARCIS (Netherlands)

Bodlaender, H.L.; Thilikos, D.M.

1997-01-01

In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph

Planar graphs theory and algorithms

CERN Document Server

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.

INTEGRATED ADVERTISING CAMPAIGN

Directory of Open Access Journals (Sweden)

Adina Claudia NEAMŢU

2010-06-01

Full Text Available Campaign and especially advertising campaign represents one of the variables of the marketing mix, an important one, being difficult to separate its contribution from the one of the other elements. Irrespective of the specific object that is behind an advertising company, the investment will be retrieved only if the right information is transmitted to the right persons in the right way. This is difficult to accomplish if the advertising responsible in that firm do not understand appropriately: the market nature; the product nature; the distribution channels nature; the communication channels nature – available advertising supports and their features

CORECLUSTER: A Degeneracy Based Graph Clustering Framework

OpenAIRE

Giatsidis , Christos; Malliaros , Fragkiskos; Thilikos , Dimitrios M. ,; Vazirgiannis , Michalis

2014-01-01

International audience; Graph clustering or community detection constitutes an important task forinvestigating the internal structure of graphs, with a plethora of applications in several domains. Traditional tools for graph clustering, such asspectral methods, typically suffer from high time and space complexity. In thisarticle, we present \\textsc{CoreCluster}, an efficient graph clusteringframework based on the concept of graph degeneracy, that can be used along withany known graph clusteri...

Digital Social Network Mining for Topic Discovery

Science.gov (United States)

Moradianzadeh, Pooya; Mohi, Maryam; Sadighi Moshkenani, Mohsen

Networked computers are expanding more and more around the world, and digital social networks becoming of great importance for many people's work and leisure. This paper mainly focused on discovering the topic of exchanging information in digital social network. In brief, our method is to use a hierarchical dictionary of related topics and words that mapped to a graph. Then, with comparing the extracted keywords from the context of social network with graph nodes, probability of relation between context and desired topics will be computed. This model can be used in many applications such as advertising, viral marketing and high-risk group detection.

Advertising Expenditure and Consumer Prices

OpenAIRE

Ferdinand Rauch

2011-01-01

This paper studies the effect of a change in the marginal costs of advertising on advertising expenditures of firms and consumer prices across industries. It makes use of a unique policy change that caused a decrease of the taxation on advertising expenditures in parts of Austria and a simultaneous increase in other parts. Advertising expenditures move immediately in the opposite direction to the marginal costs of advertising. Simultaneously the price reaction to advertising is negative in so...

Coloring sums of extensions of certain graphs

Directory of Open Access Journals (Sweden)

Johan Kok

2017-12-01

Full Text Available We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted $\\chi(G$. Motivated by the introduction of the concept of the $b$-chromatic sum of a graph the concept of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum are introduced in this paper. The extended graph $G^x$ of a graph $G$ was recently introduced for certain regular graphs. This paper furthers the concepts of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum to extended paths and cycles. Bipartite graphs also receive some attention. The paper concludes with patterned structured graphs. These last said graphs are typically found in chemical and biological structures.

Bifurcation and Fractal of the Coupled Logistic Map

Science.gov (United States)

Wang, Xingyuan; Luo, Chao

The nature of the fixed points of the coupled Logistic map is researched, and the boundary equation of the first bifurcation of the coupled Logistic map in the parameter space is given out. Using the quantitative criterion and rule of system chaos, i.e., phase graph, bifurcation graph, power spectra, the computation of the fractal dimension, and the Lyapunov exponent, the paper reveals the general characteristics of the coupled Logistic map transforming from regularity to chaos, the following conclusions are shown: (1) chaotic patterns of the coupled Logistic map may emerge out of double-periodic bifurcation and Hopf bifurcation, respectively; (2) during the process of double-period bifurcation, the system exhibits self-similarity and scale transform invariability in both the parameter space and the phase space. From the research of the attraction basin and Mandelbrot-Julia set of the coupled Logistic map, the following conclusions are indicated: (1) the boundary between periodic and quasiperiodic regions is fractal, and that indicates the impossibility to predict the moving result of the points in the phase plane; (2) the structures of the Mandelbrot-Julia sets are determined by the control parameters, and their boundaries have the fractal characteristic.

Emotional or Rational? The Determination of the Influence of Advertising Appeal on Advertising Effectiveness

Directory of Open Access Journals (Sweden)

Grigaliunaite Viktorija

2016-11-01

Full Text Available In prevailing competition-based market economy, organizations have to search factors influencing advertising effectiveness. This research aims at developing the model of the influence of advertising appeal on advertising effectiveness. While achieving the aim of the article, the analysis and synthesis of scientific literature is provided. Furthermore, traditional marketing research methods as well as neuromarketing research methods are applied in order to determine the influences of different advertising appeals on advertising effectiveness. As a research result, the model of the influence of advertising appeal on advertising effectiveness is elaborated. Accordingly, this research fills the gap in scientific literature by determining the influences of emotional and rational appeals on print / outdoor advertising effectiveness in the context of convenience product category. Moreover, by answering the research question, the contribution to the field emerges in integrating both marketing theory and neuroscience in order to analyze and evaluate consumer behavior.

CHALLENGES IN CROSS CULTURAL ADVERTISING

Directory of Open Access Journals (Sweden)

Yuni Retnowati

2016-04-01

Full Text Available At first, marketing practitioners and academics consider standardized approaches to marketing and advertising strategies in globalization, and then some studies proved that the standardization of advertising across culture is not valid. Therefore, cross cultural advertising takes local culture into account when conveying messages in advertisements. Cross cultural understanding is very important in order to produce successful localized advertising that would reflect the cultural values and norms of intended audience. Challenge in cross cultural advertising is the problem of communicating to people of diverse cultural background. Cross cultural solutions are applied in areas such as language, communication style, images and cultural values. Cross cultural advertising is simply about using common sense and analyzing how the different elements of an advertising campaign are impacted by culture and modifying them to best speak to the target audience. Other challenges are determining between standardization and adaptation of cultural values content of advertising when facing different people from diverse cultures. In academic side, the challenge is preparing students to design advertisements that communicate effectively to diverse cultures.

On a conjecture concerning helly circle graphs

Directory of Open Access Journals (Sweden)

Durán Guillermo

2003-01-01

Full Text Available We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and inequations which represents the structure of G, in such a way that G is an e-circle graph if and only if S has a solution. In fact, e-circle graphs are exactly the circle graphs (intersection graphs of chords in a circle, and thus this method provides an analytic way for recognizing circle graphs. A graph G is a Helly circle graph if G is a circle graph and there exists a model of G by chords such that every three pairwise intersecting chords intersect at the same point. A conjecture by Durán (2000 states that G is a Helly circle graph if and only if G is a circle graph and contains no induced diamonds (a diamond is a graph formed by four vertices and five edges. Many unsuccessful efforts - mainly based on combinatorial and geometrical approaches - have been done in order to validate this conjecture. In this work, we utilize the ideas behind the definition of e-circle graphs and restate this conjecture in terms of an equivalence between two systems of equations and inequations, providing a new, analytic tool to deal with it.

Improved visibility graph fractality with application for the diagnosis of Autism Spectrum Disorder

Science.gov (United States)

Ahmadlou, Mehran; Adeli, Hojjat; Adeli, Amir

2012-10-01

Recently, the visibility graph (VG) algorithm was proposed for mapping a time series to a graph to study complexity and fractality of the time series through investigation of the complexity of its graph. The visibility graph algorithm converts a fractal time series to a scale-free graph. VG has been used for the investigation of fractality in the dynamic behavior of both artificial and natural complex systems. However, robustness and performance of the power of scale-freeness of VG (PSVG) as an effective method for measuring fractality has not been investigated. Since noise is unavoidable in real life time series, the robustness of a fractality measure is of paramount importance. To improve the accuracy and robustness of PSVG to noise for measurement of fractality of time series in biological time-series, an improved PSVG is presented in this paper. The proposed method is evaluated using two examples: a synthetic benchmark time series and a complicated real life Electroencephalograms (EEG)-based diagnostic problem, that is distinguishing autistic children from non-autistic children. It is shown that the proposed improved PSVG is less sensitive to noise and therefore more robust compared with PSVG. Further, it is shown that using improved PSVG in the wavelet-chaos neural network model of Adeli and c-workers in place of the Katz fractality dimension results in a more accurate diagnosis of autism, a complicated neurological and psychiatric disorder.

Optimization Problems on Threshold Graphs

Directory of Open Access Journals (Sweden)

Elena Nechita

2010-06-01

Full Text Available During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset of the partition must have predeterminate properties, as well as combinations of such decompositions. In this paper we characterize threshold graphs using the weakly decomposition, determine: density and stability number, Wiener index and Wiener polynomial for threshold graphs.

An atlas of the smaller maps in orientable and nonorientable surfaces

CERN Document Server

Jackson, David

2000-01-01

Maps are beguilingly simple structures with deep and ubiquitous properties. They arise in an essential way in many areas of mathematics and mathematical physics, but require considerable time and computational effort to generate. Few collected drawings are available for reference, and little has been written, in book form, about their enumerative aspects. An Atlas of the Smaller Maps in Orientable and Nonorientable Surfaces is the first book to provide complete collections of maps along with their vertex and face partitions, number of rootings, and an index number for cross referencing. It provides an explanation of axiomatization and encoding, and serves as an introduction to maps as a combinatorial structure. The Atlas lists the maps first by genus and number of edges, and gives the embeddings of all graphs with at most five edges in orientable surfaces, thus presenting the genus distribution for each graph. Exemplifying the use of the Atlas, the authors explore two substantial conjectures with origins in ...

Targeting and Persuasive Advertising

OpenAIRE

Egli, Alain (Autor/in)

2015-01-01

Firms face a prisoner's dilemma when advertising in a competitive environment. In a Hotelling framework with persuasive advertisingfirms counteract this prisoner's dilemma with targeting. The firms even solve the prisoner's problem if targeted advertising is effective enough. Advertising turns from wasteful competition into profits. This is in contrast to wasteful competition as argument for regulations. A further result is maximum advertising differentiation: thefirms target their advertisin...

Hierarchy of modular graph identities

Energy Technology Data Exchange (ETDEWEB)

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.

Hierarchy of modular graph identities

International Nuclear Information System (INIS)

D’Hoker, Eric; Kaidi, Justin

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 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.

Well-covered graphs and factors

DEFF Research Database (Denmark)

Randerath, Bert; Vestergaard, Preben D.

2006-01-01

A maximum independent set of vertices in a graph is a set of pairwise nonadjacent vertices of largest cardinality α. Plummer defined a graph to be well-covered, if every independent set is contained in a maximum independent set of G. Every well-covered graph G without isolated vertices has a perf...

On the centrality of some graphs

Directory of Open Access Journals (Sweden)

Vecdi Aytac

2017-10-01

Full Text Available A central issue in the analysis of complex networks is the assessment of their stability and vulnerability. A variety of measures have been proposed in the literature to quantify the stability of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. Different measures for graph vulnerability have been introduced so far to study different aspects of the graph behavior after removal of vertices or links such as connectivity, toughness, scattering number, binding number, residual closeness and integrity. In this paper, we consider betweenness centrality of a graph. Betweenness centrality of a vertex of a graph is portion of the shortest paths all pairs of vertices passing through a given vertex. In this paper, we obtain exact values for betweenness centrality for some wheel related graphs namely gear, helm, sunflower and friendship graphs.

On the degree distribution of horizontal visibility graphs associated with Markov processes and dynamical systems: diagrammatic and variational approaches

International Nuclear Information System (INIS)

Lacasa, Lucas

2014-01-01

Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical time series analysis and signal processing and (ii) characterizing classes of dynamical systems and stochastic processes using the tools of graph theory. Recent works show that the degree distribution of these graphs encapsulates much information on the signals' variability, and therefore constitutes a fundamental feature for statistical learning purposes. However, exact solutions for the degree distributions are only known in a few cases, such as for uncorrelated random processes. Here we analytically explore these distributions in a list of situations. We present a diagrammatic formalism which computes for all degrees their corresponding probability as a series expansion in a coupling constant which is the number of hidden variables. We offer a constructive solution for general Markovian stochastic processes and deterministic maps. As case tests we focus on Ornstein–Uhlenbeck processes, fully chaotic and quasiperiodic maps. Whereas only for certain degree probabilities can all diagrams be summed exactly, in the general case we show that the perturbation theory converges. In a second part, we make use of a variational technique to predict the complete degree distribution for special classes of Markovian dynamics with fast-decaying correlations. In every case we compare the theory with numerical experiments. (paper)

Advertising in virtual space. An increasing threat for traditional advertising.

Directory of Open Access Journals (Sweden)

Razvan DINA

Full Text Available Traditional advertising media used as a main TV, radio and print media. When the Internet has become one of the most important channels of communication between people, advertising has proposed to use this new medium to promote products and services on the market. Currently, more than 50% of the western countries population and share increasingly larger of population from other countries have Internet access, which creates a huge potential for online advertising.

Humor in advertising: a review on use of television radio and print advertising media

OpenAIRE

S, venkatesh; N, senthilkumar

2015-01-01

Television advertising is a most common commercial activity used in advertising medium. Humor in advertising contains an important aspect on changing attitude of the consumer, improves buying behavior and creates new patterns for buying any goods and services. Humor in television advertising is the effective and convenient way to attract the any consumers because they are emotional based content and makes the consumer to special for satisfaction. Compared to all emotions humor advertising is ...

Enabling Graph Appliance for Genome Assembly

Energy Technology Data Exchange (ETDEWEB)

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.

On 4-critical t-perfect graphs

OpenAIRE

Benchetrit, Yohann

2016-01-01

It is an open question whether the chromatic number of $t$-perfect graphs is bounded by a constant. The largest known value for this parameter is 4, and the only example of a 4-critical $t$-perfect graph, due to Laurent and Seymour, is the complement of the line graph of the prism $\\Pi$ (a graph is 4-critical if it has chromatic number 4 and all its proper induced subgraphs are 3-colorable). In this paper, we show a new example of a 4-critical $t$-perfect graph: the complement of the line gra...

Local adjacency metric dimension of sun graph and stacked book graph

Science.gov (United States)

Yulisda Badri, Alifiah; Darmaji

2018-03-01

A graph is a mathematical system consisting of a non-empty set of nodes and a set of empty sides. One of the topics to be studied in graph theory is the metric dimension. Application in the metric dimension is the navigation robot system on a path. Robot moves from one vertex to another vertex in the field by minimizing the errors that occur in translating the instructions (code) obtained from the vertices of that location. To move the robot must give different instructions (code). In order for the robot to move efficiently, the robot must be fast to translate the code of the nodes of the location it passes. so that the location vertex has a minimum distance. However, if the robot must move with the vertex location on a very large field, so the robot can not detect because the distance is too far.[6] In this case, the robot can determine its position by utilizing location vertices based on adjacency. The problem is to find the minimum cardinality of the required location vertex, and where to put, so that the robot can determine its location. The solution to this problem is the dimension of adjacency metric and adjacency metric bases. Rodrguez-Velzquez and Fernau combine the adjacency metric dimensions with local metric dimensions, thus becoming the local adjacency metric dimension. In the local adjacency metric dimension each vertex in the graph may have the same adjacency representation as the terms of the vertices. To obtain the local metric dimension of values in the graph of the Sun and the stacked book graph is used the construction method by considering the representation of each adjacent vertex of the graph.

Gender bias in cardiovascular advertisements.

Science.gov (United States)

Ahmed, Sofia B; Grace, Sherry L; Stelfox, Henry Thomas; Tomlinson, George; Cheung, Angela M

2004-11-01

Women with cardiovascular disease are treated less aggressively than men. The reasons for this disparity are unclear. Pharmaceutical advertisements may influence physician practices and patient care. To determine if female and male patients are equally likely to be featured in cardiovascular advertisements. We examined all cardiovascular advertisements from US editions of general medical and cardiovascular journals published between 1 January 1996 and 30 June 1998. For each unique advertisement, we recorded the total number of journal appearances and the number of appearances in journals' premium positions. We noted the gender, age, race and role of both the primary figure and the majority of people featured in the advertisement. Nine hundred and nineteen unique cardiovascular advertisements were identified of which 254 depicted a patient as the primary figure. A total of 20%[95% confidence interval (CI) 15.3-25.5%] of these advertisements portrayed a female patient, while 80% (95% CI 74.5-84.7%) depicted a male patient, P advertisements appeared 249 times (13.3%; 95% CI 8.6-18.9%) while male patient advertisements appeared 1618 times (86.7%; 95% CI 81.1-91.4%), P advertisements also had significantly fewer mean appearances than male patient advertisements in journals' premium positions (0.82 vs. 1.99, P=0.02). Similar results were seen when the advertisements were analysed according to predominant gender. Despite increasing emphasis on cardiovascular disease in women, significant under-representation of female patients exists in cardiovascular advertisements. Physicians should be cognizant of this gender bias.

Mechatronic modeling and simulation using bond graphs

CERN Document Server

Das, Shuvra

2009-01-01

Introduction to Mechatronics and System ModelingWhat Is Mechatronics?What Is a System and Why Model Systems?Mathematical Modeling Techniques Used in PracticeSoftwareBond Graphs: What Are They?Engineering SystemsPortsGeneralized VariablesBond GraphsBasic Components in SystemsA Brief Note about Bond Graph Power DirectionsSummary of Bond Direction RulesDrawing Bond Graphs for Simple Systems: Electrical and MechanicalSimplification Rules for Junction StructureDrawing Bond Graphs for Electrical SystemsDrawing Bond Graphs for Mechanical SystemsCausalityDrawing Bond Graphs for Hydraulic and Electronic Components and SystemsSome Basic Properties and Concepts for FluidsBond Graph Model of Hydraulic SystemsElectronic SystemsDeriving System Equations from Bond GraphsSystem VariablesDeriving System EquationsTackling Differential CausalityAlgebraic LoopsSolution of Model Equations and Their InterpretationZeroth Order SystemsFirst Order SystemsSecond Order SystemTransfer Functions and Frequency ResponsesNumerical Solution ...

Generalized Smooth Transition Map Between Tent and Logistic Maps

Science.gov (United States)

Sayed, Wafaa S.; Fahmy, Hossam A. H.; Rezk, Ahmed A.; Radwan, Ahmed G.

There is a continuous demand on novel chaotic generators to be employed in various modeling and pseudo-random number generation applications. This paper proposes a new chaotic map which is a general form for one-dimensional discrete-time maps employing the power function with the tent and logistic maps as special cases. The proposed map uses extra parameters to provide responses that fit multiple applications for which conventional maps were not enough. The proposed generalization covers also maps whose iterative relations are not based on polynomials, i.e. with fractional powers. We introduce a framework for analyzing the proposed map mathematically and predicting its behavior for various combinations of its parameters. In addition, we present and explain the transition map which results in intermediate responses as the parameters vary from their values corresponding to tent map to those corresponding to logistic map case. We study the properties of the proposed map including graph of the map equation, general bifurcation diagram and its key-points, output sequences, and maximum Lyapunov exponent. We present further explorations such as effects of scaling, system response with respect to the new parameters, and operating ranges other than transition region. Finally, a stream cipher system based on the generalized transition map validates its utility for image encryption applications. The system allows the construction of more efficient encryption keys which enhances its sensitivity and other cryptographic properties.

The shortest path algorithm performance comparison in graph and relational database on a transportation network

Directory of Open Access Journals (Sweden)

Mario Miler

2014-02-01

Full Text Available In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems. Many applications dealing with transportation network require calculation of the shortest path. The objective of this research is to compare the performance of Dijkstra shortest path calculation in PostgreSQL (with pgRouting and Neo4j graph database for the purpose of determining if there is any difference regarding the speed of the calculation. Benchmarking was done on commodity hardware using OpenStreetMap road network. The first assumption is that Neo4j graph database would be well suited for the shortest path calculation on transportation networks but this does not come without some cost. Memory proved to be an issue in Neo4j setup when dealing with larger transportation networks.

Expert interpretation of bar and line graphs: The role of graphicacy in reducing the effect of graph format.

Directory of Open Access Journals (Sweden)

David ePeebles

2015-10-01

Full Text Available The distinction between informational and computational equivalence of representations, first articulated by Larkin and Simon (1987 has been a fundamental principle in the analysis of diagrammatic reasoning which has been supported empirically on numerous occasions. We present an experiment that investigates this principle in relation to the performance of expert graph users of 2 x 2 'interaction' bar and line graphs. The study sought to determine whether expert interpretation is affected by graph format in the same way that novice interpretations are. The findings revealed that, unlike novices - and contrary to the assumptions of several graph comprehension models - experts' performance was the same for both graph formats, with their interpretation of bar graphs being no worse than that for line graphs. We discuss the implications of the study for guidelines for presenting such data and for models of expert graph comprehension.

Advertising Guidelines

Science.gov (United States)

Riso, Ovid

1977-01-01

Advertising should be viewed as a sales-building investment and not simply an element of business outlay that actually is a completely controllable expense. Suggestions deal with the sales budget, profiling the store and its customers, advertising media, promotional ideas, and consumer protection. (LBH)

Proving termination of graph transformation systems using weighted type graphs over semirings

NARCIS (Netherlands)

Bruggink, H.J.S.; König, B.; Nolte, D.; Zantema, H.; Parisi-Presicce, F.; Westfechtel, B.

2015-01-01

We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a

Advertising. Advanced placement of objects

Directory of Open Access Journals (Sweden)

Hassan Ali Al-Ababneh

2016-06-01

Full Text Available The article is devoted to the study of one of the most important concepts and marketing events which is advertising. The author studies the history of the formation of modern advertising and covers the main interpretations of the concept of advertising. The article presents the data on the chronology of the formation of the key objectives of the advertising process and the basic classification of types of advertising, its purpose and place in the marketing mix. It sets out the classification and content of the basic concepts of marketing. The article considers the potential effectiveness of the basic types of advertising communications, and especially the impact of these promotional activities on the perception of the end user. Particular attention is paid to the study of certain promising areas of advertising, namely, advertising at airports and in airplanes, it is a special case of transit advertising. The author describes the identified advantages and disadvantages of this direction of marketing communications as well as the analysis of statistical data on the effectiveness of advertising at airports and in airplanes. It is suggested to consider this type of advertising as promising and effective in the conditions of modern times because there is the tendency to increase the dynamic potential users of the specified mode of transport and, as a consequence, it is possible with certainty to predict the transformation of potential passengers into real consumers of the studied type of advertising

Advertising media and cigarette demand.

Science.gov (United States)

Goel, Rajeev K

2011-01-01

Using state-level panel data for the USA spanning three decades, this research estimates the demand for cigarettes. The main contribution lies in studying the effects of cigarette advertising disaggregated across five qualitatively different groups. Results show cigarette demand to be near unit elastic, the income effects to be generally insignificant and border price effects and habit effects to be significant. Regarding advertising effects, aggregate cigarette advertising has a negative effect on smoking. Important differences across advertising media emerge when cigarette advertising is disaggregated. The effects of public entertainment and Internet cigarette advertising are stronger than those of other media. Anti-smoking messages accompanying print cigarette advertising seem relatively more effective. Implications for smoking control policy are discussed.

A totally magic cordial labeling of one-point union of n copies of a graph

Directory of Open Access Journals (Sweden)

P. Jeyanthi

2014-01-01

Full Text Available A graph \\(G\\ is said to have a totally magic cordial (TMC labeling with constant \\(C\\ if there exists a mapping \\(f: V(G\\cup E(G\\rightarrow \\left\\{0,1\\right\\}\\ such that \\(f(a + f(b + f(ab \\equiv C(\\mbox{mod 2}\\ for all \\(ab\\in E(G\\ and \\(\\left|n_f(0-n_f(1\\right|\\leq1\\, where \\(n_f(i\\ \\((i = 0, 1\\ is the sum of the number of vertices and edges with label \\(i\\. In this paper, we establish the totally magic cordial labeling of one-point union of \\(n\\-copies of cycles, complete graphs and wheels.

DIMENSI METRIK GRAPH LOBSTER Ln (q;r

Directory of Open Access Journals (Sweden)

PANDE GDE DONY GUMILAR

2013-05-01

Full Text Available The metric dimension of connected graph G is the cardinality of minimum resolving set in graph G. In this research, we study how to find the metric dimension of lobster graph Ln (q;r. Lobster graph Ln (q;r is a regular lobster graph with vertices backbone on the main path, every backbone vertex is connected to q hand vertices and every hand vertex is connected to r finger vertices, with n, q, r element of N. We obtain the metric dimension of lobster graph L2 (1;1 is 1, the metric dimension of lobster graph L2 (1;1 for n > 2 is 2.

Proposal and realization advertising campaign

OpenAIRE

RYCHLÁ, Marie

2008-01-01

The Bachelor Paper contains proposal and realization advertising campaign, including make charge for cost amount. The advertising campaign is made for chosen product of firm. Advertising campaign is planning by the medium of broadsheet and advertising on the Internet.

Summary: beyond fault trees to fault graphs

International Nuclear Information System (INIS)

Alesso, H.P.; Prassinos, P.; Smith, C.F.

1984-09-01

Fault Graphs are the natural evolutionary step over a traditional fault-tree model. A Fault Graph is a failure-oriented directed graph with logic connectives that allows cycles. We intentionally construct the Fault Graph to trace the piping and instrumentation drawing (P and ID) of the system, but with logical AND and OR conditions added. Then we evaluate the Fault Graph with computer codes based on graph-theoretic methods. Fault Graph computer codes are based on graph concepts, such as path set (a set of nodes traveled on a path from one node to another) and reachability (the complete set of all possible paths between any two nodes). These codes are used to find the cut-sets (any minimal set of component failures that will fail the system) and to evaluate the system reliability

CHALLENGES IN CROSS CULTURAL ADVERTISING

OpenAIRE

Yuni Retnowati

2016-01-01

At first, marketing practitioners and academics consider standardized approaches to marketing and advertising strategies in globalization, and then some studies proved that the standardization of advertising across culture is not valid. Therefore, cross cultural advertising takes local culture into account when conveying messages in advertisements. Cross cultural understanding is very important in order to produce successful localized advertising that would reflect the cultural values and nor...

Design of an audio advertisement dataset

Science.gov (United States)

Fu, Yutao; Liu, Jihong; Zhang, Qi; Geng, Yuting

2015-12-01

Since more and more advertisements swarm into radios, it is necessary to establish an audio advertising dataset which could be used to analyze and classify the advertisement. A method of how to establish a complete audio advertising dataset is presented in this paper. The dataset is divided into four different kinds of advertisements. Each advertisement's sample is given in *.wav file format, and annotated with a txt file which contains its file name, sampling frequency, channel number, broadcasting time and its class. The classifying rationality of the advertisements in this dataset is proved by clustering the different advertisements based on Principal Component Analysis (PCA). The experimental results show that this audio advertisement dataset offers a reliable set of samples for correlative audio advertisement experimental studies.

Interactive Graph Layout of a Million Nodes

Directory of Open Access Journals (Sweden)

Peng Mi

2016-12-01

Full Text Available Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph topology. This algorithm can interactively layout graphs with millions of nodes, and support real-time interaction to explore alternative graph layouts. Users can directly manipulate the layout of vertices in a force-directed fashion. The complexity of traditional repulsive force computation is reduced by approximating calculations based on the hierarchical structure of multi-level clustered graphs. We evaluate the algorithm performance, and demonstrate human-in-the-loop layout in two sensemaking case studies. Moreover, we summarize lessons learned for designing interactive large graph layout algorithms on the GPU.

Eulerian Graphs and Related Topics

CERN Document Server

Fleischner, Herbert

1990-01-01

The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering walks. They should appeal both to researchers and students, as they contain enough material for an undergraduate or graduate graph theory course which emphasizes Eulerian graphs, and thus can be read by any mathematician not yet familiar with graph theory. But they are also of interest to researchers in graph theory because they contain many recent results, some of which are only partial solutions to more general problems. A number of conjectures have been included as well. Various problems (such a

Assessing advertising content in a hospital advertising campaign: An application of Puto and Wells (1984) measure of informational and transformational advertising content.

Science.gov (United States)

Menon, Mohan K; Goodnight, Janelle M; Wayne, Robin J

2006-01-01

The following is a report of a study designed to measure advertising content based on the cognitive and affective elements of informational (i.e., information processing) and transformational (i.e., experiential) content using the measure of advertising informational and transformational content developed by Puto and Wells (1984). A university hospital advertising campaign designed to be high in transformational content did not appear to affect perceived quality of local university hospitals relative to private hospitals or increase the likelihood of choosing a university hospital in the future. Further, experiences with university hospitals that seemed to be in direct contrast to the content of the advertisements based on subject perceptions affected how university hospital advertisements were perceived in terms of content. Conclusions and implications for hospital advertising campaigns are discussed.

Ethical advertising in dentistry.

Science.gov (United States)

Graskemper, Joseph P

2009-01-01

Advertising in dentistry has steadily increased since the 1970s to become a leading choice of many dentists to promote their practices. The manner in which advertising progresses within the profession affects all dentists and how patients perceive dentistry as a profession. This paper presents ethical concepts that should be followed when dentists are pursuing practice promotion through advertising. It also raises questions that, hopefully, will increase attention and discussion on dental advertising. The paper concludes that ethical advertising is easily achieved by promoting patient education while not placing the dentist's self-interests ahead of the patient's. With this approach, dentistry may continue to be one of the most trusted professions.

The One Universal Graph — a free and open graph database

Science.gov (United States)

Ng, Liang S.; Champion, Corbin

2016-02-01

Recent developments in graph database mostly are huge projects involving big organizations, big operations and big capital, as the name Big Data attests. We proposed the concept of One Universal Graph (OUG) which states that all observable and known objects and concepts (physical, conceptual or digitally represented) can be connected with only one single graph; furthermore the OUG can be implemented with a very simple text file format with free software, capable of being executed on Android or smaller devices. As such the One Universal Graph Data Exchange (GOUDEX) modules can potentially be installed on hundreds of millions of Android devices and Intel compatible computers shipped annually. Coupled with its open nature and ability to connect to existing leading search engines and databases currently in operation, GOUDEX has the potential to become the largest and a better interface for users and programmers to interact with the data on the Internet. With a Web User Interface for users to use and program in native Linux environment, Free Crowdware implemented in GOUDEX can help inexperienced users learn programming with better organized documentation for free software, and is able to manage programmer's contribution down to a single line of code or a single variable in software projects. It can become the first practically realizable “Internet brain” on which a global artificial intelligence system can be implemented. Being practically free and open, One Universal Graph can have significant applications in robotics, artificial intelligence as well as social networks.

Advertising Appeal.

Science.gov (United States)

Miller, Sandra K.

The individualized learning package for secondary consumer education deals with consumer buying as influenced by advertising. The teacher's section of the package contains a statement of purpose and instructional objectives. Equipment and materials (specific textbooks, audiovisual aids, and sources for sample post-test advertisements) needed for…

Degree-based graph construction

International Nuclear Information System (INIS)

Kim, Hyunju; Toroczkai, Zoltan; Erdos, Peter L; Miklos, Istvan; Szekely, Laszlo A

2009-01-01

Degree-based graph construction is a ubiquitous problem in network modelling (Newman et al 2006 The Structure and Dynamics of Networks (Princeton Studies in Complexity) (Princeton, NJ: Princeton University Press), Boccaletti et al 2006 Phys. Rep. 424 175), ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects that are still open today. Here we give necessary and sufficient conditions for a sequence of nonnegative integers to be realized as a simple graph's degree sequence, such that a given (but otherwise arbitrary) set of connections from an arbitrarily given node is avoided. We then use this result to present a swap-free algorithm that builds all simple graphs realizing a given degree sequence. In a wider context, we show that our result provides a greedy construction method to build all the f-factor subgraphs (Tutte 1952 Can. J. Math. 4 314) embedded within K n setmn S k , where K n is the complete graph and S k is a star graph centred on one of the nodes. (fast track communication)

Downhill Domination in Graphs

Directory of Open Access Journals (Sweden)

Haynes Teresa W.

2014-08-01

Full Text Available A path π = (v1, v2, . . . , vk+1 in a graph G = (V,E is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi ≥ deg(vi+1, where deg(vi denotes the degree of vertex vi ∈ V. The downhill domination number equals the minimum cardinality of a set S ⊆ V having the property that every vertex v ∈ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number of a graph is at most half its order, and that the downhill domination number of a tree is at most one third its order. We characterize the graphs obtaining each of these bounds

Subsampling for graph power spectrum estimation

KAUST Repository

Chepuri, Sundeep Prabhakar; Leus, Geert

2016-01-01

In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.

Proving relations between modular graph functions

International Nuclear Information System (INIS)

Basu, Anirban

2016-01-01

We consider modular graph functions that arise in the low energy expansion of the four graviton amplitude in type II string theory. The vertices of these graphs are the positions of insertions of vertex operators on the toroidal worldsheet, while the links are the scalar Green functions connecting the vertices. Graphs with four and five links satisfy several non-trivial relations, which have been proved recently. We prove these relations by using elementary properties of Green functions and the details of the graphs. We also prove a relation between modular graph functions with six links. (paper)

Subsampling for graph power spectrum estimation

KAUST Repository

Chepuri, Sundeep Prabhakar

2016-10-06

In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.

Women in advertising production. Study of the Galician advertising sector from a gender perspective

Directory of Open Access Journals (Sweden)

Aurora García-González

2011-01-01

Full Text Available In recent years, the advertising sector has been strongly criticised due to its sexist representation of gender. The messages in advertisements are the result of a careful manufacturing process, which reflects the values and attitudes of the professionals involved in their creation. The main research hypothesis of this article is that the persistence of sexist stereotypes in advertising is related to the absence of women in the creative departments of advertising agencies. In this sense, the objective of this work is to examine the situation of women within the Galician advertising sector, and particularly women’s participation in ads production. This study, which has been carried out from the production perspective, also compares the situation of women in the Galician advertising agencies with the general situation of women in the national advertising sector.

Solar industry advertising guidelines. Task III

Energy Technology Data Exchange (ETDEWEB)

Hostetler, J.S.

1981-09-01

The purpose of these guidelines is to acquaint SEIA members with basic principles of Federal Trade Commission (FTC) law related to advertising and sales representations in order to assist SEIA members in insuring that their advertising is fair and accurate when assessed against FTC standards, thereby avoiding potentially costly FTC action. The following are discussed: the nature of advertising, when is an advertisement deceptive, advertising of product certification and testing results, substantiation for advertising claims, advertising of tax credits, warranty advertising, potential liabilities under the FTC Act, and recommendations for avoiding FTC action. (MHR)

RNA graph partitioning for the discovery of RNA modularity: a novel application of graph partition algorithm to biology.

Directory of Open Access Journals (Sweden)

Namhee Kim

Full Text Available Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG framework, we represent RNA structures as tree graphs by translating unpaired regions into vertices and helices into edges. Here we explore the modularity of RNA structures by applying graph partitioning known in graph theory to divide an RNA graph into subgraphs. To our knowledge, this is the first application of graph partitioning to biology, and the results suggest a systematic approach for modular design in general. The graph partitioning algorithms utilize mathematical properties of the Laplacian eigenvector (µ2 corresponding to the second eigenvalues (λ2 associated with the topology matrix defining the graph: λ2 describes the overall topology, and the sum of µ2's components is zero. The three types of algorithms, termed median, sign, and gap cuts, divide a graph by determining nodes of cut by median, zero, and largest gap of µ2's components, respectively. We apply these algorithms to 45 graphs corresponding to all solved RNA structures up through 11 vertices (∼ 220 nucleotides. While we observe that the median cut divides a graph into two similar-sized subgraphs, the sign and gap cuts partition a graph into two topologically-distinct subgraphs. We find that the gap cut produces the best biologically-relevant partitioning for RNA because it divides RNAs at less stable connections while maintaining junctions intact. The iterative gap cuts suggest basic modules and assembly protocols to design large RNA structures. Our graph substructuring thus suggests a systematic approach to explore the modularity of biological networks. In our applications to RNA structures, subgraphs

GraphCrunch 2: Software tool for network modeling, alignment and clustering.

Science.gov (United States)

Kuchaiev, Oleksii; Stevanović, Aleksandar; Hayes, Wayne; Pržulj, Nataša

2011-01-19

Recent advancements in experimental biotechnology have produced large amounts of protein-protein interaction (PPI) data. The topology of PPI networks is believed to have a strong link to their function. Hence, the abundance of PPI data for many organisms stimulates the development of computational techniques for the modeling, comparison, alignment, and clustering of networks. In addition, finding representative models for PPI networks will improve our understanding of the cell just as a model of gravity has helped us understand planetary motion. To decide if a model is representative, we need quantitative comparisons of model networks to real ones. However, exact network comparison is computationally intractable and therefore several heuristics have been used instead. Some of these heuristics are easily computable "network properties," such as the degree distribution, or the clustering coefficient. An important special case of network comparison is the network alignment problem. Analogous to sequence alignment, this problem asks to find the "best" mapping between regions in two networks. It is expected that network alignment might have as strong an impact on our understanding of biology as sequence alignment has had. Topology-based clustering of nodes in PPI networks is another example of an important network analysis problem that can uncover relationships between interaction patterns and phenotype. We introduce the GraphCrunch 2 software tool, which addresses these problems. It is a significant extension of GraphCrunch which implements the most popular random network models and compares them with the data networks with respect to many network properties. Also, GraphCrunch 2 implements the GRAph ALigner algorithm ("GRAAL") for purely topological network alignment. GRAAL can align any pair of networks and exposes large, dense, contiguous regions of topological and functional similarities far larger than any other existing tool. Finally, GraphCruch 2 implements an

GraphCrunch 2: Software tool for network modeling, alignment and clustering

Directory of Open Access Journals (Sweden)

Hayes Wayne

2011-01-01

Full Text Available Abstract Background Recent advancements in experimental biotechnology have produced large amounts of protein-protein interaction (PPI data. The topology of PPI networks is believed to have a strong link to their function. Hence, the abundance of PPI data for many organisms stimulates the development of computational techniques for the modeling, comparison, alignment, and clustering of networks. In addition, finding representative models for PPI networks will improve our understanding of the cell just as a model of gravity has helped us understand planetary motion. To decide if a model is representative, we need quantitative comparisons of model networks to real ones. However, exact network comparison is computationally intractable and therefore several heuristics have been used instead. Some of these heuristics are easily computable "network properties," such as the degree distribution, or the clustering coefficient. An important special case of network comparison is the network alignment problem. Analogous to sequence alignment, this problem asks to find the "best" mapping between regions in two networks. It is expected that network alignment might have as strong an impact on our understanding of biology as sequence alignment has had. Topology-based clustering of nodes in PPI networks is another example of an important network analysis problem that can uncover relationships between interaction patterns and phenotype. Results We introduce the GraphCrunch 2 software tool, which addresses these problems. It is a significant extension of GraphCrunch which implements the most popular random network models and compares them with the data networks with respect to many network properties. Also, GraphCrunch 2 implements the GRAph ALigner algorithm ("GRAAL" for purely topological network alignment. GRAAL can align any pair of networks and exposes large, dense, contiguous regions of topological and functional similarities far larger than any other

Quality uncertainty and informative advertising

NARCIS (Netherlands)

Moraga-González, José Luis

We present a price signalling model with informative advertising. A costly advertisement informs of the good's quality directly and therefore the seller determines the fraction of informed buyers endogenously. We show that informative advertising only occurs in pooling equilibria. For an advertising

Advertising and Business Cycle Fluctuations

OpenAIRE

Benedetto Molinari; Francesco Turino

2009-01-01

This paper provides new empirical evidence of quarterly U.S. aggregate advertising expenditures, showing that advertising has a well defined pattern over the Business Cycle. To understand this pattern we develop a general equilibrium model where targeted advertising increases the marginal utility of the advertised good. Advertising intensity is endogenously determined by profit maximizing firms. We embed this assumption into an otherwise standard model of business cycle with monopolistic comp...

Strategic Targeted Advertising

OpenAIRE

Andrea Galeotti; Jose Luis Moraga

2003-01-01

textabstractWe present a strategic game of pricing and targeted-advertising. Firms can simultaneously target price advertisements to different groups of customers, or to the entire market. Pure strategy equilibria do not exist and thus market segmentation cannot occur surely. Equilibria exhibit random advertising --to induce an unequal distribution of information in the market-- and random pricing --to obtain profits from badly informed buyers--. We characterize a positive profits equilibrium...

Semiotic Analysis Of Mcdonald's Printed Advertisement

OpenAIRE

URAIDA, SITI

2014-01-01

Keywords: Semiotic, printed advertisement, sign, icon, symbol, index, connotation, myth Printed advertisement has a promotional function as medium to advertise aproduct. It implicitly persuades people to create demand of product which is being advertised. In this study, the writer uses printed advertisement of McDonald's fast food company as the object. The printed advertisement was analyzed by usingSemiotics study. There are seven printed advertisements that were analyzes in this study. All ...

The advertised diet: an examination of the extent and nature of food advertising on Australian television.

Science.gov (United States)

Roberts, Michele; Pettigrew, Simone; Chapman, Kathy; Quester, Pascale; Miller, Caroline

2013-08-01

The aim of the present study was to describe food advertising and expenditure on Australian television, and to conduct an audit to assess what proportion of food and beverage television advertisements was consistent with dietary recommendations. Data were acquired from a national media monitoring company for advertisements broadcast in five major Australian cities from 1 September 2010 to 31 October 2010. Content analysis was undertaken on these advertisements and the advertised foods were assessed against the Australian Guide to Healthy Eating. The data also included advertising expenditures. Most advertised foods were non-core foods (63%), with few advertisements for fruits and vegetables (6%). Advertisements for non-core foods were significantly more frequent during prime time viewing periods (71% vs 60%; Padvertising for fast food (28%) and non-core beverages (24%) were recorded. The present study found that the foods advertised during the data-collection period were inconsistent with the recommended diet. There are clear areas for policy concern given that the majority of recorded advertisements were for foods classified as 'occasional foods', there were low levels of advertising for fruit and vegetables, and there were no social marketing messages to support healthy eating. SO WHAT? The findings of the study suggest that there is an urgent need for more comprehensive regulation of food advertising in Australia.

A generalization of total graphs

Indian Academy of Sciences (India)

M Afkhami

2018-04-12

Apr 12, 2018 ... product of any lower triangular matrix with the transpose of any element of U belongs to U. The ... total graph of R, which is denoted by T( (R)), is a simple graph with all elements of R as vertices, and ...... [9] Badawi A, On dot-product graph of a commutative ring, Communications in Algebra 43 (2015). 43–50.

Graph Structure-Based Simultaneous Localization and Mapping Using a Hybrid Method of 2D Laser Scan and Monocular Camera Image in Environments with Laser Scan Ambiguity

Directory of Open Access Journals (Sweden)

Taekjun Oh

2015-07-01

Full Text Available Localization is an essential issue for robot navigation, allowing the robot to perform tasks autonomously. However, in environments with laser scan ambiguity, such as long corridors, the conventional SLAM (simultaneous localization and mapping algorithms exploiting a laser scanner may not estimate the robot pose robustly. To resolve this problem, we propose a novel localization approach based on a hybrid method incorporating a 2D laser scanner and a monocular camera in the framework of a graph structure-based SLAM. 3D coordinates of image feature points are acquired through the hybrid method, with the assumption that the wall is normal to the ground and vertically flat. However, this assumption can be relieved, because the subsequent feature matching process rejects the outliers on an inclined or non-flat wall. Through graph optimization with constraints generated by the hybrid method, the final robot pose is estimated. To verify the effectiveness of the proposed method, real experiments were conducted in an indoor environment with a long corridor. The experimental results were compared with those of the conventional GMappingapproach. The results demonstrate that it is possible to localize the robot in environments with laser scan ambiguity in real time, and the performance of the proposed method is superior to that of the conventional approach.

Retorical figures in advertising language

Directory of Open Access Journals (Sweden)

Radenković-Šošić Bojana

2012-01-01

Full Text Available Promotional activities are very often based on advertising and diverse types of public relations. In order to attract consumers' attention and achieve communication goals set by the corporate strategy, advertisers frequently use rhetorical elements in advertising discourse. The advertisers try to convey a desired message and to communicate with the recipient of the message by using various rhetorical figures. It is argued that understanding the structure and function of rhetorical figures in advertising requires a "text- and reader-aware approach". The use of rhetorical figures in advertising has been overlooked in consumer research. This paper shows that the use of rhetorical elements in the advertising discourse is very frequent, but at the same time it is questioned if the function of the rhetorical figures is just a communication with the target market (which is a base of communication models and if the consequences of linguistic influences are much more serious. The complex nature of advertising language with various rhetorical figures (thropes and schemes do not just stimulate recipients to demonstrate a desirable behavior, but indirectly it constructs a concept of desirable lifestyle and it induces them to identify themselves with the explained model. Moreover, the analyzed corpus included advertising slogans of social responsible companies as well as advertising campaigns with elements of diverse ideologies. In the time of digitization and a rapid information flow, consumer's attention is less dedicated to the advertising messages. Therefore, it should be expected that in the future advertisers will have to adjust linguistic, audio and visual techniques to the unfocused message recipients.

Magazine alcohol advertising compliance with the Australian Alcoholic Beverages Advertising Code.

Science.gov (United States)

Donovan, Kati; Donovan, Rob; Howat, Peter; Weller, Narelle

2007-01-01

The purpose of this study was to assess the frequency and content of alcoholic beverage advertisements and sales promotions in magazines popular with adolescents and young people in Australia, and assess the extent to which the ads complied with Australia's self-regulatory Alcoholic Beverages Advertising Code (ABAC). Alcohol advertisements and promotions were identified in a sample of 93 magazines popular with young people. The identified items were coded against 28 measures constructed to assess the content of the items against the five sections of the ABAC. Two thirds of the magazines contained at least one alcohol advertisement or promotion with a total of 142 unique items identified: 80 were brand advertisements and 62 were other types of promotional items (i.e. sales promotions, event sponsorships, cross promotions with other marketers and advertorials). It was found that 52% of items appeared to contravene at least one section of the ABAC. The two major apparent breaches related to section B--the items having a strong appeal to adolescents (34%) and to section C--promoting positive social, sexual and psychological expectancies of consumption (28%). It was also found that promotional items appeared to breach the ABAC as often as did advertisements. It is concluded that the self-regulating system appears not to be working for the alcoholic beverages industry in Australia and that increased government surveillance and regulation should be considered, giving particular emphasis to the inclusion of promotional items other than brand advertising.

Decomposing a planar graph into an independent set and a 3-degenerate graph

DEFF Research Database (Denmark)

Thomassen, Carsten

2001-01-01

We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar graph can be decomposed into an independent set and a set inducing a 3-degenerate graph. (C) 2001 Academic Press....

Food advertising in children's magasines

OpenAIRE

Šorli, Ema

2014-01-01

Children are particularly interesting to the media and advertising, since they are more receptive to advertisement than adults during adolescence. The problem of advertising is mainly unhealthy food, but for child’s healthy growth and development a balanced diet and physical activity are most needed. The objectives of the thesis were to explore children's magazines and to determine the frequency of food advertising, and to present the phenomenon of food advertisements through different period...

Commuting graphs of matrix algebras

International Nuclear Information System (INIS)

Akbari, S.; Bidkhori, H.; Mohammadian, A.

2006-08-01

The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all non- central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. The commuting graph of a group G, denoted by Γ(G), is similarly defined. In this paper we investigate some graph theoretic properties of Γ(M n (F)), where F is a field and n ≥ 2. Also we study the commuting graphs of some classical groups such as GL n (F) and SL n (F). We show that Γ(M n (F)) is a connected graph if and only if every field extension of F of degree n contains a proper intermediate field. We prove that apart from finitely many fields, a similar result is true for Γ(GL n (F)) and Γ(SL n (F)). Also we show that for two fields E and F and integers m, n ≥> 2, if Γ(M m (E)) ≅ Γ(M n (F)), then m = n and vertical bar E vertical bar = vertical bar F vertical bar. (author)

Graph-theoretical concepts and physicochemical data

Directory of Open Access Journals (Sweden)

Lionello Pogliani

2003-02-01

Full Text Available Graph theoretical concepts have been used to model the molecular polarizabilities of fifty-four organic derivatives, and the induced dipole moment of a set of fifty-seven organic compounds divided into three subsets. The starting point of these modeling strategies is the hydrogen-suppressed chemical graph and pseudograph of a molecule, which works very well for second row atoms. From these types of graphs a set of graph-theoretical basis indices, the molecular connectivity indices, can be derived and used to model properties and activities of molecules. With the aid of the molecular connectivity basis indices it is then possible to build higher-order descriptors. The problem of 'graph' encoding the contribution of the inner-core electrons of heteroatoms can here be solved with the aid of odd complete graphs, Kp-(p-odd. The use of these graph tools allow to draw an optimal modeling of the molecular polarizabilities and a satisfactory modeling of the induced dipole moment of a wide set of organic derivatives.

Analyzing Political Television Advertisements.

Science.gov (United States)

Burson, George

1992-01-01

Presents a lesson plan to help students understand that political advertisements often mislead, lie, or appeal to emotion. Suggests that the lesson will enable students to examine political advertisements analytically. Includes a worksheet to be used by students to analyze individual political advertisements. (DK)

Graphs whose complement and square are isomorphic

DEFF Research Database (Denmark)

Pedersen, Anders Sune

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-compl...

Graphs & digraphs

CERN Document Server

Chartrand, Gary; Zhang, Ping

2010-01-01

Gary Chartrand has influenced the world of Graph Theory for almost half a century. He has supervised more than a score of Ph.D. dissertations and written several books on the subject. The most widely known of these texts, Graphs and Digraphs, … has much to recommend it, with clear exposition, and numerous challenging examples [that] make it an ideal textbook for the advanced undergraduate or beginning graduate course. The authors have updated their notation to reflect the current practice in this still-growing area of study. By the authors' estimation, the 5th edition is approximately 50% longer than the 4th edition. … the legendary Frank Harary, author of the second graph theory text ever produced, is one of the figures profiled. His book was the standard in the discipline for several decades. Chartrand, Lesniak and Zhang have produced a worthy successor.-John T. Saccoman, MAA Reviews, June 2012 (This book is in the MAA's basic library list.)As with the earlier editions, the current text emphasizes clear...

Packing Degenerate Graphs Greedily

Czech Academy of Sciences Publication Activity Database

Allen, P.; Böttcher, J.; Hladký, J.; Piguet, Diana

2017-01-01

Roč. 61, August (2017), s. 45-51 ISSN 1571-0653 R&D Projects: GA ČR GJ16-07822Y Institutional support: RVO:67985807 Keywords : tree packing conjecture * graph packing * graph processes Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics

Continuous-time quantum walks on star graphs

International Nuclear Information System (INIS)

Salimi, S.

2009-01-01

In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N-fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K 2 graphs (complete graph with two vertices) and the probability of observing walk tends to the uniform distribution.

Tailored Random Graph Ensembles

International Nuclear Information System (INIS)

Roberts, E S; Annibale, A; Coolen, A C C

2013-01-01

Tailored graph ensembles are a developing bridge between biological networks and statistical mechanics. The aim is to use this concept to generate a suite of rigorous tools that can be used to quantify and compare the topology of cellular signalling networks, such as protein-protein interaction networks and gene regulation networks. We calculate exact and explicit formulae for the leading orders in the system size of the Shannon entropies of random graph ensembles constrained with degree distribution and degree-degree correlation. We also construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities which converges to a strictly uniform measure and is based on edge swaps that conserve all degrees. The acceptance probabilities can be generalized to define Markov chains that target any alternative desired measure on the space of directed or undirected graphs, in order to generate graphs with more sophisticated topological features.

Privacy issues in mobile advertising

DEFF Research Database (Denmark)

Cleff, Evelyne Beatrix

The emergence of the wired Internet and mobile telecommunication networks is creating new opportunities for advertisers to generate new revenue streams through mobile users. As consumer adoption of mobile technology continues to increase, it is only a question of time when mobile advertising...... becomes an important part of marketing strategies. The development of mobile advertising, however, will be dependent on acceptance and usability issues in order to ensure permission-based advertising. Growing concerns about the protection of the users' privacy have been raised since mobile advertising may...... become extremely intrusive practices in an intimate personal space. This article focuses on the evaluation of legal problems raised by this novel form of advertising. It is assumed that a technological design, which is in line with the legal framework, will ensure that the benefits of mobile advertising...

Fast and Lean Immutable Multi-Maps on the JVM based on Heterogeneous Hash-Array Mapped Tries

OpenAIRE

Steindorfer, Michael J.; Vinju, Jurgen J.

2016-01-01

textabstractAn immutable multi-map is a many-to-many thread-friendly map data structure with expected fast insert and lookup operations. This data structure is used for applications processing graphs or many-to-many relations as applied in static analysis of object-oriented systems. When processing such big data sets the memory overhead of the data structure encoding itself is a memory usage bottleneck. Motivated by reuse and type-safety, libraries for Java, Scala and Clojure typically implem...

The Smallest Valid Extension-Based Efficient, Rare Graph Pattern Mining, Considering Length-Decreasing Support Constraints and Symmetry Characteristics of Graphs

Directory of Open Access Journals (Sweden)

Unil Yun

2016-05-01

Full Text Available Frequent graph mining has been proposed to find interesting patterns (i.e., frequent sub-graphs from databases composed of graph transaction data, which can effectively express complex and large data in the real world. In addition, various applications for graph mining have been suggested. Traditional graph pattern mining methods use a single minimum support threshold factor in order to check whether or not mined patterns are interesting. However, it is not a sufficient factor that can consider valuable characteristics of graphs such as graph sizes and features of graph elements. That is, previous methods cannot consider such important characteristics in their mining operations since they only use a fixed minimum support threshold in the mining process. For this reason, in this paper, we propose a novel graph mining algorithm that can consider various multiple, minimum support constraints according to the types of graph elements and changeable minimum support conditions, depending on lengths of graph patterns. In addition, the proposed algorithm performs in mining operations more efficiently because it can minimize duplicated operations and computational overheads by considering symmetry features of graphs. Experimental results provided in this paper demonstrate that the proposed algorithm outperforms previous mining approaches in terms of pattern generation, runtime and memory usage.

Relating zeta functions of discrete and quantum graphs

Science.gov (United States)

Harrison, Jonathan; Weyand, Tracy

2018-02-01

We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation between the spectrum of the Laplacian on a discrete graph and that of the Laplacian on an equilateral metric graph. As a by-product, we determine how the multiplicity of eigenvalues of the quantum graph, that are also in the spectrum of the graph with Dirichlet conditions at the vertices, depends on the graph geometry. Finally we apply the result to calculate the vacuum energy and spectral determinant of a complete bipartite graph and compare our results with those for a star graph, a graph in which all vertices are connected to a central vertex by a single edge.

Hamiltonian cycles in polyhedral maps

Indian Academy of Sciences (India)

We present a necessary and sufficient condition for existence of a contractible, non-separating and non-contractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces.We also present algorithms to construct such cycles whenever it exists where one of them is linear time and another is ...

The One Universal Graph — a free and open graph database

International Nuclear Information System (INIS)

Ng, Liang S.; Champion, Corbin

2016-01-01

Recent developments in graph database mostly are huge projects involving big organizations, big operations and big capital, as the name Big Data attests. We proposed the concept of One Universal Graph (OUG) which states that all observable and known objects and concepts (physical, conceptual or digitally represented) can be connected with only one single graph; furthermore the OUG can be implemented with a very simple text file format with free software, capable of being executed on Android or smaller devices. As such the One Universal Graph Data Exchange (GOUDEX) modules can potentially be installed on hundreds of millions of Android devices and Intel compatible computers shipped annually. Coupled with its open nature and ability to connect to existing leading search engines and databases currently in operation, GOUDEX has the potential to become the largest and a better interface for users and programmers to interact with the data on the Internet. With a Web User Interface for users to use and program in native Linux environment, Free Crowdware implemented in GOUDEX can help inexperienced users learn programming with better organized documentation for free software, and is able to manage programmer's contribution down to a single line of code or a single variable in software projects. It can become the first practically realizable “Internet brain” on which a global artificial intelligence system can be implemented. Being practically free and open, One Universal Graph can have significant applications in robotics, artificial intelligence as well as social networks. (paper)

Gender Advertisements.

Science.gov (United States)

Goffman, Erving

A heavily illustrated discussion of the ways in which men and women are portrayed in advertisements is presented. The three essays which precede the 56 pages of illustrations discuss gender expressions, characteristics of public and private pictures, and gender commercials. The author notes that advertisements do not depict how men and women…

[Governance of drug advertising control: assessment of misleading advertising penalties].

Science.gov (United States)

Chakroun, R

2013-04-01

Loyal promotion of the pharmaceutical industry has been challenged by stakeholders. Drug advertising is the easiest point to assess. Based on the agency theory, our objective was to describe the governance of advertising control when it was misleading and the terms of penalties within the framework of the contradictory process between the industry and the regulatory authorities. We conducted a thorough analysis of the contents of the minutes of the Board of Control of advertising from April 2007 to May 2010. The amounts of penalties were analyzed according to three criteria: the timing of the examination procedure (first session versus second session), the nature of the penalty (ban versus notice of change) and the company's defense strategy (written response versus presence of company representatives). Thirty-nine reports involving 62 projects to ban advertisements were analyzed. The first two causes of penalties were off label promotion and non-objective use of study results to support claims. The Committee issued 47 advertising bans (76%) and 15 formal notices of change (24%). When the defense strategy of the company involved the presence of representatives, there was a significant reduction of votes in favor of a ban (68% versus 81%, Pstrategy did not influence the nature of the penalty (Chi(2)=2.05; P=n.s). These results should be put into perspective considering the fact that the qualitative composition of the commission was not free of potential conflicts of interest and that, moreover, only 10% of the penalty projects were reviewed. In addition, advertising control does not address the issue of the loyalty of the sales forces. Finally, our results open perspectives for research and managerial applications for the governance of advertising controls. Copyright © 2013. Published by Elsevier Masson SAS.

Relationship between Spokesperson’s Gender and Advertising Color Temperature in a Framework of Advertising Effectiveness

Directory of Open Access Journals (Sweden)

Pilelienė Lina

2017-12-01

Full Text Available Advertising spokesperson is one of the undeniably important factors affecting advertising effectiveness. However, advertising spokesperson has to have some particular features to be effective. Various previous researches resulted in determination of different features of advertising spokesperson and their effectiveness; i.e. type of a spokesperson (celebrity vs. a regular person; gender and race of a spokesperson; etc. were found to have an impact on the spokesperson’s effectiveness. However, the research on the impact of shooting color temperature on its effectiveness is still scarce. Moreover, an assumption can be made that color temperature might cause a different effect depending on advertising spokesperson’s gender. The aim of this paper is to fill this gap by analyzing the relationship between spokesperson’s gender and advertising color temperature in a framework of advertising effectiveness. Neuromarketing research methods were applied to meet the aim and to determine the guidelines for its usage in advertising.

Recognition of fractal graphs

NARCIS (Netherlands)

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

Interactive Graph Layout of a Million Nodes

OpenAIRE

Peng Mi; Maoyuan Sun; Moeti Masiane; Yong Cao; Chris North

2016-01-01

Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph to...

Survey on Ontology Mapping

Science.gov (United States)

Zhu, Junwu

To create a sharable semantic space in which the terms from different domain ontology or knowledge system, Ontology mapping become a hot research point in Semantic Web Community. In this paper, motivated factors of ontology mapping research are given firstly, and then 5 dominating theories and methods, such as information accessing technology, machine learning, linguistics, structure graph and similarity, are illustrated according their technology class. Before we analyses the new requirements and takes a long view, the contributions of these theories and methods are summarized in details. At last, this paper suggest to design a group of semantic connector with the ability of migration learning for OWL-2 extended with constrains and the ontology mapping theory of axiom, so as to provide a new methodology for ontology mapping.

Aesthetic Study on English Advertising Language

Institute of Scientific and Technical Information of China (English)

孙重阳

2017-01-01

With the rapid development of economy as well as science and technology, advertisements have become a part of people's life, which can be seen at nearly every corner around the world, TV, bus, cinema, shop, or even the clothes we wear, from which we can see a variety of advertisements. Advertisements are adopted to attract customers' attention to a certain product, aiming to convince consumers and persuade them to spend their money on the goods. Advertisers are trying to gain more profits from customers, so they create some forms of advertising, like sound, video, and even in the movie or inviting some celebrity to do advertising through his or her influence on the public. Thus, there is no doubt that advertising is an essential factor for sales promotion in the modern society. So far, there have been a number of studies on advertising, such as, the cooperative principle in advertising, the perspective of semiotics in advertising, etc. However, this thesis focuses on the study of aesthetics on English advertising language.

CRISM Multispectral and Hyperspectral Mapping Data - A Global Data Set for Hydrated Mineral Mapping

Science.gov (United States)

Seelos, F. P.; Hash, C. D.; Murchie, S. L.; Lim, H.

2017-12-01

The Compact Reconnaissance Imaging Spectrometer for Mars (CRISM) is a visible through short-wave infrared hyperspectral imaging spectrometer (VNIR S-detector: 364-1055 nm; IR L-detector: 1001-3936 nm; 6.55 nm sampling) that has been in operation on the Mars Reconnaissance Orbiter (MRO) since 2006. Over the course of the MRO mission, CRISM has acquired 290,000 individual mapping observation segments (mapping strips) with a variety of observing modes and data characteristics (VNIR/IR; 100/200 m/pxl; multi-/hyper-spectral band selection) over a wide range of observing conditions (atmospheric state, observation geometry, instrument state). CRISM mapping data coverage density varies primarily with latitude and secondarily due to seasonal and operational considerations. The aggregate global IR mapping data coverage currently stands at 85% ( 80% at the equator with 40% repeat sampling), which is sufficient spatial sampling density to support the assembly of empirically optimized radiometrically consistent mapping mosaic products. The CRISM project has defined a number of mapping mosaic data products (e.g. Multispectral Reduced Data Record (MRDR) map tiles) with varying degrees of observation-specific processing and correction applied prior to mosaic assembly. A commonality among the mosaic products is the presence of inter-observation radiometric discrepancies which are traceable to variable observation circumstances or associated atmospheric/photometric correction residuals. The empirical approach to radiometric reconciliation leverages inter-observation spatial overlaps and proximal relationships to construct a graph that encodes the mosaic structure and radiometric discrepancies. The graph theory abstraction allows the underling structure of the msaic to be evaluated and the corresponding optimization problem configured so it is well-posed. Linear and non-linear least squares optimization is then employed to derive a set of observation- and wavelength- specific model

RATGRAPH: Computer Graphing of Rational Functions.

Science.gov (United States)

Minch, Bradley A.

1987-01-01

Presents an easy-to-use Applesoft BASIC program that graphs rational functions and any asymptotes that the functions might have. Discusses the nature of rational functions, graphing them manually, employing a computer to graph rational functions, and describes how the program works. (TW)

Persuasive Digital Advertising in Online Advertisement : Case Company: MarkPrint Oy

OpenAIRE

Do, Quang Huy

2015-01-01

The past decades have seen an unpreceded growth in digital advertising over its budget, efficiency and effectiveness. Since 2003, marketers’ spending on online advertisement worldwide has increased by roughly $1 billion over its previous business quarter. Return-on-Investment for digital advertisement triples traditional ones in numerous areas while the cost of operating online is among the most economical means to reach audiences. Thus, the aim of this thesis is to provide a theoretical foun...

Graph algorithms in the titan toolkit.

Energy Technology Data Exchange (ETDEWEB)

McLendon, William Clarence, III; Wylie, Brian Neil

2009-10-01

Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.

A Graph Calculus for Predicate Logic

Directory of Open Access Journals (Sweden)

Paulo A. S. Veloso

2013-03-01

Full Text Available We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents bottom. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we can recognize conflicting situations (equivalent to a formula and its negation.

Deep Learning with Dynamic Computation Graphs

OpenAIRE

Looks, Moshe; Herreshoff, Marcello; Hutchins, DeLesley; Norvig, Peter

2017-01-01

Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched training or inference. They are also difficult to implement in popular deep learning libraries, which are based on static data-flow graphs. We introduce a technique called dynami...

Constructs for Programming with Graph Rewrites

OpenAIRE

Rodgers, Peter

2000-01-01

Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The constructs we present are once only nodes, attractor nodes and single match rewrites. We illustrate the operation of the constructs by example. The advantages of adding these new rewrite modifiers is to reduce t...

Language of advertising

OpenAIRE

Krchňáková, Leontina

2015-01-01

This work is devoted to the Russian language advertising, which examines in an independent system. It aims are analyzing the text of Russian advertising in terms of its information and formal structure. It focuses on a specific aesthetic qualities of language, which the text uses. Work is further focused on the categorization of neologisms and neologisation of the Russian advertising. Next focus is on loanwords from the English language. Used research methods are descriptive and comparative. ...

Quantum chaos on discrete graphs

International Nuclear Information System (INIS)

Smilansky, Uzy

2007-01-01

Adapting a method developed for the study of quantum chaos on quantum (metric) graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76), spectral ζ functions and trace formulae for discrete Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph and obtaining functions which belong to the class of ζ functions proposed originally by Ihara (1966 J. Mat. Soc. Japan 18 219) and expanded by subsequent authors (Stark and Terras 1996 Adv. Math. 121 124, Kotani and Sunada 2000 J. Math. Sci. Univ. Tokyo 7 7). Finally, a model of 'classical dynamics' on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76). (fast track communication)

RJSplot: Interactive Graphs with R.

Science.gov (United States)

Barrios, David; Prieto, Carlos

2018-03-01

Data visualization techniques provide new methods for the generation of interactive graphs. These graphs allow a better exploration and interpretation of data but their creation requires advanced knowledge of graphical libraries. Recent packages have enabled the integration of interactive graphs in R. However, R provides limited graphical packages that allow the generation of interactive graphs for computational biology applications. The present project has joined the analytical power of R with the interactive graphical features of JavaScript in a new R package (RJSplot). It enables the easy generation of interactive graphs in R, provides new visualization capabilities, and contributes to the advance of computational biology analytical methods. At present, 16 interactive graphics are available in RJSplot, such as the genome viewer, Manhattan plots, 3D plots, heatmaps, dendrograms, networks, and so on. The RJSplot package is freely available online at http://rjsplot.net. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Internet Advertising: Ethics and Etiquette.

Science.gov (United States)

Machovec, George S.

1994-01-01

Discusses the growth of the Internet and the attitudes of users toward advertising, provides examples of kinds of advertising used on electronic networks, and lists several companies that help advertisers use the Internet. Fifteen guidelines are suggested to help advertisers use the Internet in a reasonable and appropriate way. (Contains 11…

Advertising. Advanced placement of objects

OpenAIRE

Hassan Ali Al-Ababneh

2016-01-01

The article is devoted to the study of one of the most important concepts and marketing events which is advertising. The author studies the history of the formation of modern advertising and covers the main interpretations of the concept of advertising. The article presents the data on the chronology of the formation of the key objectives of the advertising process and the basic classification of types of advertising, its purpose and place in the marketing mix. It sets out the ...

A Theory of Combative Advertising

OpenAIRE

Yuxin Chen; Yogesh V. Joshi; Jagmohan S. Raju; Z. John Zhang

2009-01-01

In mature markets with competing firms, a common role for advertising is to shift consumer preferences towards the advertiser in a tug-of-war, with no effect on category demand. In this paper, we analyze the effect of such “combative” advertising on market power. We show that, depending on the nature of consumer response, combative advertising can reduce price competition to benefit competing firms. However, it can also lead to a procompetitive outcome where individual firms advertise to incr...

Bipartite separability and nonlocal quantum operations on graphs

Science.gov (United States)

Dutta, Supriyo; Adhikari, Bibhas; Banerjee, Subhashish; Srikanth, R.

2016-07-01

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m ×n arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

27 CFR 5.66 - Comparative advertising.

Science.gov (United States)

2010-04-01

... 27 Alcohol, Tobacco Products and Firearms 1 2010-04-01 2010-04-01 false Comparative advertising. 5..., DEPARTMENT OF THE TREASURY LIQUORS LABELING AND ADVERTISING OF DISTILLED SPIRITS Advertising of Distilled Spirits § 5.66 Comparative advertising. (a) General. Comparative advertising shall not be disparaging of a...

27 CFR 7.55 - Comparative advertising.

Science.gov (United States)

2010-04-01

... 27 Alcohol, Tobacco Products and Firearms 1 2010-04-01 2010-04-01 false Comparative advertising. 7..., DEPARTMENT OF THE TREASURY LIQUORS LABELING AND ADVERTISING OF MALT BEVERAGES Advertising of Malt Beverages § 7.55 Comparative advertising. (a) General. Comparative advertising shall not be disparaging of a...

Advertising and news management in media organisations aspect of advertisers' influence on news content

OpenAIRE

Jastramskis, Deimantas

2008-01-01

The aim of the article is to analyze display of financial and organizational aspects of advertisers’ influence on news’ content. Main points of analysis are: advertising influence on concentration of media organizations, convergence of advertising and journalism in the strategies of media marketing, relation between advertising and news content in Lithuanian media system, problems of links between political advertising and presentation of politicians in the news .

Taking Advertising Literacy to a Higher Level: An Exploratory Multilevel Analysis of Children's Advertising Literacy

OpenAIRE

De Pauw, Pieter; Cauberghe, Veroline; Hudders, Liselot

2017-01-01

As few studies focus on how children’s coping with advertising is affected by their environment, the present study uses multilevel analysis to explore the role of both primary (i.e. parents) and secondary socializing agents (i.e. classmates, teachers) in children’s advertising literacy. The results show that children’s cognitive advertising literacy and attitudes toward advertising are to a large extent determined by class-level processes. Their moral advertising literacy is a more individual...

Estimation of Initial Position Using Line Segment Matching in Maps

Directory of Open Access Journals (Sweden)

Chongyang Wei

2016-06-01

Full Text Available While navigating in a typical traffic scene, with a drastic drift or sudden jump in its Global Positioning System (GPS position, the localization based on such an initial position is unable to extract precise overlapping data from the prior map in order to match the current data, thus rendering the localization as unfeasible. In this paper, we first propose a new method to estimate an initial position by matching the infrared reflectivity maps. The maps consist of a highly precise prior map, built with the offline simultaneous localization and mapping (SLAM technique, and a smooth current map, built with the integral over velocities. Considering the attributes of the maps, we first propose to exploit the stable, rich line segments to match the lidar maps. To evaluate the consistency of the candidate line pairs in both maps, we propose to adopt the local appearance, pairwise geometric attribute and structural likelihood to construct an affinity graph, as well as employ a spectral algorithm to solve the graph efficiently. The initial position is obtained according to the relationship between the vehicle's current position and matched lines. Experiments on the campus with a GPS error of dozens of metres show that our algorithm can provide an accurate initial value with average longitudinal and lateral errors being 1.68m and 1.04m, respectively.

Intellectual Property on Advertising Works (1)

OpenAIRE

梁瀬, 和男; Kazuo, YANASE

1999-01-01

In the deep depression of Japanese Economy, "advertising directly effective for selling" is now desired eagerly in many companies. Moreover, the drastic retrenchment in advertising budget strictly asks its efficiency and effective advertisng. As a result, the efficient accomplishment of advertising purpose may force intellectual property which comes into advertising works belong to advertisers. It is ideal for advertisers, ad agencies and prouction companies to make an agreement in document w...

Algorithms and Data Structures for Graphs

DEFF Research Database (Denmark)

Rotenberg, Eva

are planar graphs, which are those that can be drawn on a piece of paper without any pair of edges crossing. For planar graphs where each edge can only be traversed in one direction, a fundamental question is whether there is a route from vertex A to vertex B in the graph. We show how such a graph can...... of the form: "Is there an edge such that all paths between A and B go via that edge?" and which can quickly be updated when edges are inserted or deleted. We further show how to represent a planar graph such that we can quickly update our representation when an edge is deleted, and such that questions...