Research Article Special Issue

African Journals Online (AJOL)

2017-02-15

Feb 15, 2017 ... Research Article. Special Issue ... In myriad studies implemented, the quality of life has been defined in different ways among which the .... service and trading users in living area. ... market, bakery, barber shop, restaurant, etc.

Graph Sampling for Covariance Estimation

KAUST Repository

Chepuri, Sundeep Prabhakar; Leus, Geert

2017-01-01

specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non

Special issue on asteroids - Introduction

Science.gov (United States)

Novaković, Bojan; Hsieh, Henry H.; Gronchi, Giovanni F.

2018-04-01

The articles in this special issue are devoted to asteroids, small solar system bodies that primarily populate a region between the orbits of Mars and Jupiter, known as the asteroid belt, but can also be found throughout the Solar System. Asteroids are considered to be a key to understanding the formation and evolution of our planetary system. Their properties allow us to test current theoretical models and develop new theoretical concepts pertaining to evolutionary processes in the Solar System. There have been major advances in asteroid science in the last decade, and that trend continues. Eighteen papers accepted for this special issue cover a wide range of asteroid-related subjects, pushing the boundaries of our understanding of these intriguing objects even further. Here we provide the reader with a brief overview of these thrilling papers, with an invitation for interested scientists to read each work in detail for a better understanding of these recent cutting edge results. As many topics in asteroid science remain open challenges, we hope that this special issue will be an important reference point for future research on this compelling topic.

Special issue: Plasma Conversion

NARCIS (Netherlands)

Nozaki, T.; Bogaerts, A.; Tu, X.; van de Sanden, M. C. M.

2017-01-01

With growing concern of energy and environmental issues, the combination of plasma and heterogeneous catalysts receives special attention in greenhouse gas conversion, nitrogen fixation and hydrocarbon chemistry. Plasma gas conversion driven by renewable electricity is particularly important for the

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.

Special issue on quantum physics with non-Hermitian operators Special issue on quantum physics with non-Hermitian operators

Science.gov (United States)

Bender, Carl M.; Fring, Andreas; Guenther, Uwe; Jones, Hugh F.

2012-01-01

This is a call for contributions to a special issue of Journal of Physics A: Mathematical and Theoretical dedicated to quantum physics with non-Hermitian operators. The main motivation behind this special issue is to gather together recent results, developments and open problems in this rapidly evolving field of research in a single comprehensive volume. We expect that such a special issue will become a valuable reference for the broad scientific community working in mathematical and theoretical physics. The issue will be open to all contributions containing new results on non-Hermitian theories which are explicitly PT-symmetric and/or pseudo-Hermitian or quasi-Hermitian. The main novelties in the past years in this area have been many experimental observations, realizations, and applications of PT symmetric Hamiltonians in optics and microwave cavities. We especially invite contributions on the theoretical interpretations of these recent PT-symmetric experiments and on theoretical proposals for new experiments. Editorial policy The Guest Editors for this issue are Carl Bender, Andreas Fring, Uwe Guenther and Hugh Jones. The areas and topics for this issue include, but are not limited to: spectral problems novel properties of complex optical potentials PT-symmetry related threshold lasers and spectral singularities construction of metric operators scattering theory supersymmetric theories Lie algebraic and Krein-space methods random matrix models classical and semi-classical models exceptional points in model systems operator theoretic approaches microwave cavities aspects of integrability and exact solvability field theories with indefinite metric All contributions will be refereed and processed according to the usual procedure of the journal. Papers should report original and significant research that has not already been published. Guidelines for preparation of contributions The deadline for contributed papers will be 31 March 2012. This deadline will allow the

Special Issue: War, violence and masculinities

DEFF Research Database (Denmark)

2015-01-01

This special double issue of NORMA explore the mutual influences between violence, war and masculinities, the forms these have taken in different social and cultural contexts and the implications for masculinity research. The issues cover a range of historical and current topics, cases and analyt......This special double issue of NORMA explore the mutual influences between violence, war and masculinities, the forms these have taken in different social and cultural contexts and the implications for masculinity research. The issues cover a range of historical and current topics, cases...... and analytical approaches. The contributions fall into the following four themes: violent masculine rituals and how contemporary societies cope with extreme violence against women; popular written and visual fiction about war and masculine rationalities; gender relations in social movements of rebellions...

Special Issue: “Molecules against Alzheimer”

Directory of Open Access Journals (Sweden)

Michael Decker

2016-12-01

Full Text Available This Special Issue, entitled “Molecules against Alzheimer”, gathers a number of original articles, short communications, and review articles on recent research efforts toward the development of novel drug candidates, diagnostic agents and therapeutic approaches for Alzheimer’s disease (AD, the most prevalent neurodegenerative disorder and a leading cause of death worldwide. This Special Issue contains many interesting examples describing the design, synthesis, and pharmacological profiling of novel compounds that hit one or several key biological targets, such as cholinesterases, β-amyloid formation or aggregation, monoamine oxidase B, oxidative stress, biometal dyshomeostasis, mitochondrial dysfunction, serotonin and/or melatonin systems, the Wnt/β-catenin pathway, sigma receptors, nicotinamide phosphoribosyltransferase, or nuclear erythroid 2-related factor. The development of novel AD diagnostic agents based on tau protein imaging and the use of lithium or intranasal insulin for the prevention or the symptomatic treatment of AD is also covered in some articles of the Special Issue.

Special issue on coherent states: mathematical and physical aspects Special issue on coherent states: mathematical and physical aspects

Science.gov (United States)

Twareque Ali, Syed; Antoine, Jean-Pierre; Bagarello, Fabio; Gazeau, Jean-Pierre

2011-07-01

This is a call for contributions to a special issue of Journal of Physics A: Mathematical and Theoretical dedicated to coherent states. The motivation behind this special issue is to gather in a single comprehensive volume the main aspects (past and present), latest developments, different viewpoints and directions being followed in this multidisciplinary field. Given the impressive development of the field in the past two decades, the topicality of such a volume can hardly be overemphasized. We strongly believe that such a special issue could become a particularly valuable reference for the broad scientific community working in mathematical and theoretical physics, as well as in signal processing and mathematics. Editorial policy The Guest Editors for this issue will be Syed Twareque Ali, Jean-Pierre Antoine, Fabio Bagarello and Jean-Pierre Gazeau. Potential topics include, but are not limited to, developments in the theory and applications of coherent states in: quantum optics, optomechanics, Bose-Einstein condensates quantum information, quantum measurement signal processing quantum gravity pseudo-Hermitian quantum mechanics supersymmetric quantum mechanics non-commutative quantum mechanics quantization theory harmonic and functional analysis operator theory Berezin-Toeplitz operators, PT-symmetric operators holomorphic representation theory, reproducing kernel spaces generalization of coherent states All contributions will be refereed and processed according to the usual procedure of the journal. Papers should report original and significant research that has not already been published. Guidelines for preparation of contributions The deadline for contributed papers will be 31 October 2011. This deadline will allow the special issue to appear before the end of May 2012 There is a nominal page limit of 15 printed pages per contribution (invited review papers can be longer). For papers exceeding this limit, the Guest Editors reserve the right to request a

Research Article Special Issue

African Journals Online (AJOL)

pc

2018-02-01

Feb 1, 2018 ... the Russian philosophical and sociological thought. The thoughts of the Russian scientist ... Research Article. Special Issue. Journal of Fundamental and Applied Sciences is licensed under a Creative Commons Attribution-NonCommercial 4.0. International License. Libraries Resource Directory. We are ...

Research Article Special Issue

African Journals Online (AJOL)

pc

2017-10-05

Oct 5, 2017 ... Journal of Fundamental and Applied Sciences. ISSN 1112-9867. Available online at http://www.jfas.info. Research Article. Special Issue .... of use. Three critical success factors of e-learning (instructor characteristics, student characteristics .... Total of 95 questionnaires were used for further data analysis.

Summary of the Special Issue “Neutrosophic Information Theory and Applications” at “Information” Journal

Directory of Open Access Journals (Sweden)

Florentin Smarandache

2018-02-01

Full Text Available Over a period of seven months (August 2017–February 2018, the Special Issue dedicated to “Neutrosophic Information Theory and Applications” by the “Information” journal (ISSN 2078-2489, located in Basel, Switzerland, was a success. The Guest Editors, Prof. Dr. Florentin Smarandache from the University of New Mexico (USA and Prof. Dr. Jun Ye from the Shaoxing University (China, were happy to select—helped by a team of neutrosophic reviewers from around the world, and by the “Information” journal editors themselves—and publish twelve important neutrosophic papers, authored by 27 authors and coauthors. There were a variety of neutrosophic topics studied and used by the authors and coauthors in Multi-Criteria (or Multi-Attribute and/or Group Decision-Making, including Cross Entropy-Based MAGDM, Neutrosophic Hesitant Fuzzy Prioritized Aggregation Operators, Biparametric Distance Measures, Pattern Recognition and Medical Diagnosis, Intuitionistic Neutrosophic Graph, NC-TODIM-Based MAGDM, Neutrosophic Cubic Set, VIKOR Method, Neutrosophic Multiple Attribute Group Decision-Making, Competition Graphs, Intuitionistic Neutrosophic Environment, Neutrosophic Commutative N-Ideals, Neutrosophic N-Structures Applied to BCK/BCI-Algebras, Neutrosophic Similarity Score, Weighted Histogram, Robust Mean-Shift Tracking, and Linguistic Neutrosophic Cubic Numbers.

Special Issue on Entropy-Based Applied Cryptography and Enhanced Security for Ubiquitous Computing

Directory of Open Access Journals (Sweden)

James (Jong Hyuk Park

2016-09-01

Full Text Available Entropy is a basic and important concept in information theory. It is also often used as a measure of the unpredictability of a cryptographic key in cryptography research areas. Ubiquitous computing (Ubi-comp has emerged rapidly as an exciting new paradigm. In this special issue, we mainly selected and discussed papers related with ore theories based on the graph theory to solve computational problems on cryptography and security, practical technologies; applications and services for Ubi-comp including secure encryption techniques, identity and authentication; credential cloning attacks and countermeasures; switching generator with resistance against the algebraic and side channel attacks; entropy-based network anomaly detection; applied cryptography using chaos function, information hiding and watermark, secret sharing, message authentication, detection and modeling of cyber attacks with Petri Nets, and quantum flows for secret key distribution, etc.

Special Issue: Candida and Candidiasis

Directory of Open Access Journals (Sweden)

Jeniel E. Nett

2018-06-01

Full Text Available This special issue highlights emerging topics related to Candida, the most prevalent fungal pathogen in the hospital setting. The advantages and limitations of new, non-culture based diagnostic techniques are discussed. The issue reviews mammalian and non-mammalian infection models. The manuscripts present updates on several molecular mechanisms of pathogenicity, including filamentation, biofilm formation, and phospholipid production.

Research Article Special Issue

African Journals Online (AJOL)

2016-05-15

May 15, 2016 ... Research Article. Special Issue. Journal of Fundamental and Applied Sciences is licensed under a Creative Commons Attribution-NonCommercial 4.0. International License. ... innovation is defined as: accepting ideas or behaviors in the organization that are novel and unfamiliar. Innovation can be in form ...

Research Article Special Issue

African Journals Online (AJOL)

2017-10-05

Oct 5, 2017 ... We are listed under Research Associations. D THAT USES A ... Clinical Engineering, Toin University of Yokohama, Yokohama, Aoba ... Special Issue ..... advisable to run the prognosis results at least one hundred times with the Euclidean and ... They are some of the topics left for future research. 5.

Research Article Special Issue

African Journals Online (AJOL)

2018-01-15

Jan 15, 2018 ... Journal of Fundamental and Applied Scienc. ISSN 1112-9867 ... (0.9623, 0.3857) and (0.9975, ity, temperature, CO, UVB and. 10 concentration. In by using ANN or Fit model. Research Article. Special Issue .... The EM algorithm is a simple computational implementation to find the posterior mode. Fig.

Overview of Special Issue

NARCIS (Netherlands)

Hiemstra, Djoerd; Harman, Donna; Allan, James; Kelly, Diane; Belkin, Nicholas J.; Bennet, Paul; Callan, Jamie; Clarke, Charles; Diaz, Fernando; Dumais, Susan; Ferro, Nicola; Harman, Donna; Ruthven, Ian; Sakai, Tetsuya; Smucker, Mark D.; Zobel, Justin

2017-01-01

This special issue of SIGIR Forum marks the 40th anniversary of the ACM SIGIR Conference by showcasing papers selected for the ACM SIGIR Test of Time Award from the years 1978-2001. These papers document the history and evolution of IR research and practice, and illustrate the intellectual impact

Research Article Special Issue

African Journals Online (AJOL)

2016-06-05

Jun 5, 2016 ... because Amir al- Mu'minin's(peace be upon him) name is related to human perfection and. Journal of Fundamental and Applied Sciences. ISSN 1112-9867. Available online at http://www.jfas.info. Research Article. Special Issue. Journal of Fundamental and Applied Sciences is licensed under a Creative ...

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.

Call for another special issue / book

Science.gov (United States)

Bostenaru Dan, M.

2009-04-01

We would like to continue the series of special issue or maybe edit a book on this topic. To complete the formerly edited special issues we would like to link natural hazards research to cultural heritage research. We see a way of doing this connected to "integrated conservation", which sees the involvment of urban planning in conservation, as well as the (urban) sociology, the integration of the user, the participatism. We further call for investigation of GIS applications for the investigation of natural hazards' impact in this field. We are open for further ideas and wait for you at the Splinter meeting.

Special Issue: Selected papers from ECS'97

DEFF Research Database (Denmark)

1999-01-01

This Special Issue of Analog Integrated Circuits and Signal Processing presents extended versions of selected papers from the First Electronic Circuits and Systems Conference (ECS'97) which was held on September 4-5, 1997, in Bratislava, Slovakia.......This Special Issue of Analog Integrated Circuits and Signal Processing presents extended versions of selected papers from the First Electronic Circuits and Systems Conference (ECS'97) which was held on September 4-5, 1997, in Bratislava, Slovakia....

Research Article Special Issue

African Journals Online (AJOL)

pc

2017-10-17

Oct 17, 2017 ... Perak, Malaysia was observed under ral waste in powder and xtract generated optimum produce highest length of fectively improved shoot ed faster effect on C. ed positive result for the shed light on how the Z. C. nutans. This study ld application. pagation; Zea mays stem. Research Article. Special Issue ...

Guest Editorial Special Issue on Human Computing

NARCIS (Netherlands)

Pantic, Maja; Santos, E.; Pentland, A.; Nijholt, Antinus

2009-01-01

The seven articles in this special issue focus on human computing. Most focus on two challenging issues in human computing, namely, machine analysis of human behavior in group interactions and context-sensitive modeling.

Cybernetics and Education (Special Issue)

Science.gov (United States)

Kopstein, Felix F., Ed.

1977-01-01

This is a special issue examining the potential of cybernetics in educational technology. Articles discuss: cybernetic methods, algorithms, feedback learning theory, a structural approach to behavioral objectives and criterion-referenced testing, task specifications and diagnosis, teacher-child interaction, educational development, teaching…

Special Issue: Engineering Digital Transformation

Directory of Open Access Journals (Sweden)

Julio J. Garcia-Sabater

2018-04-01

We gratefully acknowledge the authors and particularly the reviewers, whose valuable comments have improved the quality of the selected papers, which were extended (and again reviewed by pairs after the conference in order to be published in this Special Issue.

Virtual Special Issue on Migration

NARCIS (Netherlands)

Jordan, Declan; Elhorst, Paul

2016-01-01

This editorial introduces a virtual special issue of Spatial Economic Analysis compiled to mark the keynote lecture at the 46th Annual Conference of the Regional Science Association InternationalBritish and Irish Section in Cornwall by Professor Jacques Poot of the National Institute of Demographic

Special issue of photosynthetic research

NARCIS (Netherlands)

Okamura, M.; Wraight, C.A.; van Grondelle, R.

2014-01-01

This Special Issue of Photosynthesis Research honors Louis M. N. Duysens, Roderick K. Clayton, and George Feher, three pioneering researchers whose work on bacterial photosynthesis laid much of the groundwork for our understanding of the role of the reaction center in photosynthetic light energy

Editorial: Special Issue on Financial Planning

Directory of Open Access Journals (Sweden)

Mark Brimble

2012-11-01

Full Text Available AbstractThe special edition presents current research in the area of financial planning. With the continual upheaval inglobal financial markets (including Australia, the general trend towards self-funded retirement and lessreliance on the state, financial crises and the continual regulatory changes in the financial markets, this issue istimely and topical. This is the third special edition on financial planning, providing an excellent outlet forquality research in financial planning.

Regional and Special Issues in Social Policy & Administration

DEFF Research Database (Denmark)

Finer, Catherine Jones; Greve, Bent

2016-01-01

This article explores the emergence and elaboration of regional and special issues of Social Policy & Administration (SP&A) from the contrasting perspectives of the two editors principally involved in their production as a distinctive feature of the journal. Catherine Jones Finer, who retired from......-to-date range of documents to trace trends and developments over time, not merely in the content of the regional and special issues themselves, but in the increasingly international and supra-national social policy environment to which they relate....... editorial involvement in2007, writes from memory of her own experience (which featured the introduction of regional then special issues as an ongoing series) drawing on the run of printed copies of SP&A still in her possession. Bent Greve then draws on his own access to a much wider and more up...

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.

Who, How, and Where: Special Education's Issues in Perpetuity.

Science.gov (United States)

Bateman, Barbara D.

1994-01-01

Issues that are central to special education and appear destined to remain so are discussed, including professional divisions among special educators and between special and regular educators, the population to be served, individualization, and placement. (JDD)

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.

Introduction: Special issue on Global Lesbian Cinema.

Science.gov (United States)

Farr, Daniel

2012-01-01

This article offers a brief introduction to this special issue on Global Lesbian Cinema. This issue particularly highlights the importance of recognizing lesbian discourse as a separate, related piece of the discourse of queer transnational and global cinema. Subsequently, brief summaries of the eight articles of this collection are provided.

First-passage percolation on the random graph

NARCIS (Netherlands)

Hofstad, van der R.W.; Hooghiemstra, G.; Van Mieghem, P.

2001-01-01

We study first-passage percolation on the random graph Gp(N) with exponentially distributed weights on the links. For the special case of the complete graph, this problem can be described in terms of a continuous-time Markov chain and recursive trees. The Markov chain X(t) describes the number of

Special issue on the spectroscopy of transient plasmas

Science.gov (United States)

Bailey, James; Hoarty, David; Mancini, Roberto; Yoneda, Hitoki

2015-01-01

Experimental and theoretical papers are invited for a special issue of Journal of Physics B: Atomic, Molecular and Optical Physics on Spectroscopy of Transient Plasmas, covering plasma conditions produced by pulsed laboratory sources including for example, short and long pulse lasers; pulsed power devices; FELs; XFELs and ion beams. The full range of plasma spectroscopy from the optical range up to high energy bremsstrahlung radiation will be covered. The deadline for submitting to this special issue is 1 March 2015. (Expected web publication: autumn 2015). Late submissions will be considered for the journal, but may not be included in the special issue. All submitted articles will be fully refereed to the journal's usual high standards. Upon publication, the issue will be widely promoted to the atomic, molecular and optical physics community, ensuring that your work receives maximum visibility. Articles should be submitted at http://mc04.manuscriptcentral.com/jphysb-iop. Should you have any questions regarding the preparation of manuscripts or the suitability of your work for this Issue, please do not hesitate to contact the J. Phys. B: At. Mol. Opt. Editorial team (jphysb@iop.org). We look forward to hearing from you and hope that we can welcome you as a contributing author.

CALL FOR PAPERS: Special issue on Current Trends in Integrability and Nonlinear Phenomena Special issue on Current Trends in Integrability and Nonlinear Phenomena

Science.gov (United States)

Gómez-Ullate, D.; Lombardo, S.; Mañas, M.; Mazzocco, M.; Nijhoff, F.; Sommacal, M.

2009-12-01

This is a call for contributions to a special issue of Journal of Physics A: Mathematical and Theoretical dedicated to integrability and nonlinear phenomena. The motivation behind this special issue is to summarize in a single comprehensive publication, the main aspects (past and present), latest developments, different viewpoints and the directions being followed in this multidisciplinary field. We hope that such a special issue could become a particularly valuable reference for the broad scientific community working in integrability and nonlinear phenomena. Editorial policy The Editorial Board has invited D Gómez-Ullate, S Lombardo, M Mañas, M Mazzocco, F Nijhoff and M Sommacal to serve as Guest Editors for the special issue. Their criteria for the acceptance of contributions are as follows. The subject of the paper should relate to the following list of subjects: Integrable systems (including quantum and discrete) and applications Dynamical systems: Hamiltonian systems and dynamics in the complex domain Nonlinear waves, soliton equations and applications Nonlinear ODEs including Painlevé equations and isomonodromic deformations Symmetries and perturbative methods in the classification of integrable PDEs Infinite dimensional Lie algebras and integrable systems Orthogonal polynomials, random matrix theory All contributions will be refereed and processed according to the usual procedure of the journal. Papers should report original and significant research that has not already been published. Guidelines for preparation of contributions The DEADLINE for contributed papers will be 28 February 2010. This deadline will allow the special issue to appear in October 2010. There is a nominal page limit of 15 printed pages per contribution (invited review papers can be longer). For papers exceeding this limit, the Guest Editors reserve the right to request a reduction in length. Further advice on publishing your work in Journal of Physics A: Mathematical and Theoretical

Introduction to special issue: moving forward in pediatric neuropsychology.

Science.gov (United States)

Daly, Brian P; Giovannetti, Tania; Zabel, T Andrew; Chute, Douglas L

2011-08-01

This special issue of The Clinical Neuropsychologist focuses on advances in the emerging subspecialty of pediatric neuropsychology. The national and international contributions in this issue cover a range of key clinical, research, training, and professional issues specific to pediatric neuropsychology. The genesis for this project developed out of a series of talks at the Philadelphia Pediatric Neuropsychology Symposium in 2010, hosted by the Stein Family Fellow, the Department of Psychology of the College of Arts and Sciences at Drexel University, and the Philadelphia Neuropsychology Society. Articles that explore clinical practice issue focus on the assessment of special medical populations with congenital and/or acquired central nervous system insults. Research articles investigate the core features of developmental conditions, the use of technology in neuropsychological research studies, and large sample size genomic, neuropsychological, and imaging studies of under-represented populations. The final series of articles examine new considerations in training, advocacy, and subspecialty board certification that have emerged in pediatric neuropsychology. This introductory article provides an overview of the articles in this special issue and concluding thoughts about the future of pediatric neuropsychology.

A Note on the PageRank of Undirected Graphs

OpenAIRE

Grolmusz, Vince

2012-01-01

The PageRank is a widely used scoring function of networks in general and of the World Wide Web graph in particular. The PageRank is defined for directed graphs, but in some special cases applications for undirected graphs occur. In the literature it is widely noted that the PageRank for undirected graphs are proportional to the degrees of the vertices of the graph. We prove that statement for a particular personalization vector in the definition of the PageRank, and we also show that in gene...

Special Issue on Creativity at Work.

Science.gov (United States)

Donnelly, Brian; And Others

1994-01-01

Special issue includes "Creativity at the Workplace" (Donnelly); "Creativity Revisited" (Iandoli); interviews with 16 people who work in or teach industrial engineering, software, and graphic design; "On Creativity and Schooling" (Coppola, Iandoli); and "End Notes: What I Learned" (Iandoli). (SK)

Placing the special trains issue in perspective

International Nuclear Information System (INIS)

Rhoads, R.E.; DeSteese, J.G.; Loscutoff, W.V.; Chais, M.

1978-01-01

The Association of American Railroads has proposed changes in the way railroads handle shipments of radioactive materials. These changes are embodied in a set of recommended operating practices that would require shipments of spent fuel and radioactive waste to be moved only in special train service. The proposed operating practices include a 35 mph maximum speed restriction, a passing restriction and a no-other freight restriction. Shippers of radioactive materials oppose the imposition of these operating practices. The special train issue is currently being argued in hearings before the Interstate Commerce Commission. The history and current status of these hearings are reviewed. Pacific Northwest Laboratories has undertaken a study to provide perspective on the safety and economic factors related to the use of special trains for shipping spent fuel. The results of this study for the amount of spent fuel anticipated to be shipped in 1986 are reviewed. The safety analysis determines the frequencies and severities of accidents for conventional freight trains and compares these to extrapolated frequencies and severities of accidents for conventional freight trains subject to the special train operating restrictions. Results of the study show that the adoption of special trains and attendant operating restrictions has limited potential for improving safety during shipment. The economic analysis compares the cost of spent fuel shipments made by special train and by conventional freight train service.Results of the economics phase of the study show that the use of special trains will most likely increase the cost of shipments by about 50%, although under certain circumstances shipping costs for spent fuel by special trains may be up to 20% lower than by conventional train service. Possible methods to resolve the special train issue are explored

Theoretical issues in quantum computing: Graph isomorphism, PageRank, and Hamiltonian determination

Science.gov (United States)

Rudinger, Kenneth Michael

This thesis explores several theoretical questions pertaining to quantum computing. First we examine several questions regarding multi-particle quantum random walk-based algorithms for the graph isomorphism problem. We find that there exists a non-trivial difference between continuous-time walks of one and two non-interacting particles as compared to non-interacting walks of three or more particles, in that the latter are able to distinguish many strongly regular graphs (SRGs), a class of graphs with many graph pairs that are difficult to distinguish. We demonstrate analytically where this distinguishing power comes from, and we show numerically that three-particle and four-particle non-interacting continuous-time walks can distinguish many pairs of strongly regular graphs. We additionally show that this distinguishing power, while it grows with particle number, is bounded, so that no continuous-time non-interacting walk of fixed particle number can distinguish all strongly regular graphs. We then investigate the relationship between continuous-time and discrete-time walks, in the context of the graph isomorphism problem. While it has been previously demonstrated numerically that discrete-time walks of non-interacting particles can distinguish some SRGs, we demonstrate where this distinguishing power comes from. We also show that while no continuous-time non-interacting walk of fixed particle number can distinguish SRGs, it remains a possibility that such a discrete-time walk could, leaving open the possibility of a non-trivial difference between discrete-time and continuous-time walks. The last piece of our work on graph isomorphism examines limitations on certain kinds of continuous-time walk-based algorithms for distinguishing graphs. We show that a very general class of continuous-time walk algorithms, with a broad class of allowable interactions, cannot distinguish all graphs. We next consider a previously-proposed quantum adiabatic algorithm for computing the

Special Issue on Using Econometrics for Assessing Economic Models

DEFF Research Database (Denmark)

Juselius, Katarina

2009-01-01

Two methodological approaches to empirical economics which are labelled ‘theory first' versus ‘reality first' are introduced building the background for the discussion of the individual contributions to this special issue.......Two methodological approaches to empirical economics which are labelled ‘theory first' versus ‘reality first' are introduced building the background for the discussion of the individual contributions to this special issue....

Editorial of the Special Issue Antimicrobial Polymers

Directory of Open Access Journals (Sweden)

Iolanda Francolini

2013-09-01

Full Text Available The special issue “Antimicrobial Polymers” includes research and review papers concerning the recent advances on preparation of antimicrobial polymers and their relevance to industrial settings and biomedical field. Antimicrobial polymers have recently emerged as promising candidates to fight microbial contamination onto surfaces thanks to their interesting properties. In this special issue, the main strategies pursued for developing antimicrobial polymers, including polymer impregnation with antimicrobial agents or synthesis of polymers bearing antimicrobial moieties, were discussed. The future application of these polymers either in industrial or healthcare settings could result in an extremely positive impact not only at the economic level but also for the improvement of quality of life.

Special issue on Computational Neuroscience - PREFACE

DEFF Research Database (Denmark)

Ditlevsen, Susanne; Lansky, Petr

2014-01-01

This Special Issue of Mathematical Biosciences and Engineering contains ten selected papers presented at the Neural Coding 2012 workshop. Neuroscience is traditionally very close to mathematics which stems from the famous theoretical work of McCulloch--Pitts and Hodgkin--Huxley in the middle...

A special issue on solar cells

Institute of Scientific and Technical Information of China (English)

Yi-Bing CHENG

2011-01-01

@@ The increasing demand for renewable energy has made the solar cell technology as one of the most significantresearch and development areas of today.Silicon based solar cells are the dominant photovoltaic products at the present time, but the relatively high costs are barriers for their broad applications.Research has been active worldwide in developing other photovoltaic technologies that use cheap materials and can be easily manufactured.Organic solar cells have attracted a lot of interests recently due to their potential to be low cost photovoltaic technologies.This special issue of the Frontiers of Optoelectronics in China has collected research articles by a number of Chinese and international experts.It is aimed to broaden the readers' view about some of the recent developments and challenges in this important R&D field.Thirteen excellent papers are in this special issue including 4 review articles and 9 research articles.

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.

Introduction to the special issue

Directory of Open Access Journals (Sweden)

Gisela Boehm

2008-01-01

Full Text Available (from the introduction Intuition and affect have been neglected topics in the literature on human judgment and decision making for a long time. Judgmental processes involved in risk perception and decision making have traditionally been conceptualized as cognitive in nature, being based upon a rational and deliberate evaluation of the alternatives at hand. This picture started to change in the early 1980s when decision researchers looked beyond rational, deliberate, and cognitive processes and began to investigate intuitive --- as opposed to deliberate --- and emotional --- as opposed to cognitive --- aspects of decision making. In sum, decision research has seen a proliferation of approaches that look beyond rational, deliberate, and purely cognitive processes in decision making and investigate intuitive and emotional judgments in this area. This seemed like a good point in time to reflect the state of this emerging field in a special issue that addresses the question of how intuition and affect are related to each other and how they shape risk perception and decision making. This special issue is the result of a workshop that was held at the University of Bergen in November, 2006.

On revealing graph cycles via boundary measurements

International Nuclear Information System (INIS)

Belishev, M I; Wada, N

2009-01-01

This paper deals with boundary value inverse problems on a metric graph, the structure of the graph being assumed unknown. The question under consideration is how to detect from the dynamical and/or spectral inverse data whether the graph contains cycles (is not a tree). For any graph Ω, the dynamical as well as spectral boundary inverse data determine the so-called wave diameter d w : H -1 (Ω) → R defined on functionals supported in the graph. The known fact is that if Ω is a tree then d w ≥ 0 holds and, in this case, the inverse data determine Ω up to isometry. A graph Ω is said to be coordinate if the functions {dist Ω (., γ)} γin∂Ω constitute a coordinate system on Ω. For such graphs, we propose a procedure, which reveals the presence/absence of cycles. The hypothesis is that Ω contains cycles if and only if d w takes negative values. We do not justify this hypothesis in the general case but reduce it to a certain special class of graphs (suns)

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.

Solved and unsolved problems of chemical graph theory

International Nuclear Information System (INIS)

Trinajstic, N.; Klein, D.J.; Randic, M.

1986-01-01

The development of several novel graph theoretical concepts and their applications in different branches of chemistry are reviewed. After a few introductory remarks they follow with an outline of selected important graph theoretical invariants, introducing some new results and indicating some open problems. They continue with discussing the problem of graph characterization and construction of graphs of chemical interest, with a particular emphasis on large systems. Finally they consider various problems and difficulties associated with special subgraphs, including subgraphs representing Kekule valence structures. The paper ends with a brief review of structure-property and structure-activity correlations, the topic which is one of prime motivations for application of graph theory to chemistry

Generating random networks and graphs

CERN Document Server

Coolen, Ton; Roberts, Ekaterina

2017-01-01

This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...

Research Article Special Issue

African Journals Online (AJOL)

2016-05-15

May 15, 2016 ... reachable graph under an initial marking can be gotten. .... Following this component relation priority rules, one could get the way to calculate ... on innovative computing information and control(ICICIC'08)978-7695-3161-8/08.

Foreword: Biomonitoring Equivalents special issue.

Science.gov (United States)

Meek, M E; Sonawane, B; Becker, R A

2008-08-01

The challenge of interpreting results of biomonitoring for environmental chemicals in humans is highlighted in this Foreword to the Biomonitoring Equivalents (BEs) special issue of Regulatory Toxicology and Pharmacology. There is a pressing need to develop risk-based tools in order to empower scientists and health professionals to interpret and communicate the significance of human biomonitoring data. The BE approach, which integrates dosimetry and risk assessment methods, represents an important advancement on the path toward achieving this objective. The articles in this issue, developed as a result of an expert panel meeting, present guidelines for derivation of BEs, guidelines for communication using BEs and several case studies illustrating application of the BE approach for specific substances.

Special Issues for People with Aplastic Anemia

Science.gov (United States)

... Menu Donate Special Issues for People with Aplastic Anemia Because you have aplastic anemia , everyday events can ... bleeding, such as contact sports. Pregnancy and Aplastic Anemia Pregnancy is possible for women who have been ...

Understanding Game-Based Learning Cultures: Introduction to Special Issue

Science.gov (United States)

Engerman, Jason A.; Carr-Chellman, Alison

2017-01-01

This special issue expands our understanding of teaching and learning through video game play, with specific attention to culture. The issue gives insight into the ways educators, researchers, and developers should be discussing and designing for impactful learner-centered game-based learning experiences. The issue features forward-thinking…

On the classification of plane graphs representing structurally stable rational Newton flows

NARCIS (Netherlands)

Jongen, H.Th.; Jonker, P.; Twilt, F.

1991-01-01

We study certain plane graphs, called Newton graphs, representing a special class of dynamical systems which are closely related to Newton's iteration method for finding zeros of (rational) functions defined on the complex plane. These Newton graphs are defined in terms of nonvanishing angles

Crustal permeability: Introduction to the special issue

Science.gov (United States)

Ingebritsen, Steven E.; Gleeson, Tom

2015-01-01

The topic of crustal permeability is of broad interest in light of the controlling effect of permeability on diverse geologic processes and also timely in light of the practical challenges associated with emerging technologies such as hydraulic fracturing for oil and gas production (‘fracking’), enhanced geothermal systems, and geologic carbon sequestration. This special issue of Geofluids is also motivated by the historical dichotomy between the hydrogeologic concept of permeability as a static material property that exerts control on fluid flow and the perspective of economic geologists, geophysicists, and crustal petrologists who have long recognized permeability as a dynamic parameter that changes in response to tectonism, fluid production, and geochemical reactions. Issues associated with fracking, enhanced geothermal systems, and geologic carbon sequestration have already begun to promote a constructive dialog between the static and dynamic views of permeability, and here we have made a conscious effort to include both viewpoints. This special issue also focuses on the quantification of permeability, encompassing both direct measurement of permeability in the uppermost crust and inferential permeability estimates, mainly for the deeper crust.

Greenberger-Horne-Zeilinger paradoxes from qudit graph states.

Science.gov (United States)

Tang, Weidong; Yu, Sixia; Oh, C H

2013-03-08

One fascinating way of revealing quantum nonlocality is the all-versus-nothing test due to Greenberger, Horne, and Zeilinger (GHZ) known as the GHZ paradox. So far genuine multipartite and multilevel GHZ paradoxes are known to exist only in systems containing an odd number of particles. Here we shall construct GHZ paradoxes for an arbitrary number (greater than 3) of particles with the help of qudit graph states on a special kind of graphs, called GHZ graphs. Furthermore, based on the GHZ paradox arising from a GHZ graph, we derive a Bell inequality with two d-outcome observables for each observer, whose maximal violation attained by the corresponding graph state, and a Kochen-Specker inequality testing the quantum contextuality in a state-independent fashion.

Special Issue ;Sediment cascades in cold climate geosystems;

Science.gov (United States)

Morche, David; Krautblatter, Michael; Beylich, Achim A.

2017-06-01

This Editorial introduces the Special Issue on sediment cascades in cold climate geosystems that evolved from the eighth I.A.G./A.I.G. SEDIBUD (Sediment Budgets in Cold Environments; http://www.geomorph.org/sedibud-working-group/) workshop. The workshop was held from 1st to 4th September 2014 at the Environmental Research Station ;Schneefernerhaus; (http://www.schneefernerhaus.de/en/home.html) located at Mt. Zugspitze, the highest peak of Germany, (2962 m asl). Paper and poster presentations focused on observations, measurements and modeling of geomorphological processes in sediment cascades in cold climate geosystems. This resulting Special Issue brings together ten selected contributions from arctic and alpine environments.

Modular Environment for Graph Research and Analysis with a Persistent

Energy Technology Data Exchange (ETDEWEB)

2009-11-18

The MEGRAPHS software package provides a front-end to graphs and vectors residing on special-purpose computing resources. It allows these data objects to be instantiated, destroyed, and manipulated. A variety of primitives needed for typical graph analyses are provided. An example program illustrating how MEGRAPHS can be used to implement a PageRank computation is included in the distribution.The MEGRAPHS software package is targeted towards developers of graph algorithms. Programmers using MEGRAPHS would write graph analysis programs in terms of high-level graph and vector operations. These computations are transparently executed on the Cray XMT compute nodes.

Special issue dedicated to Professor Johann M. Schepers

Directory of Open Access Journals (Sweden)

Gideon P De Bruin

2006-10-01

Full Text Available It is a great pleasure for me to have been associated with this special issue of the SA Journal of Industrial Psychology dedicated to Professor Johann M. Schepers. The purpose of the special issue is to honour Professor Schepers for his contributions to the development of Psychology and Industrial Psychology as empirical fields of study in South Africa. The contributors have worked with Professor Schepers as students or colleagues and share his academic interests. The articles reflect his areas of interest and employ analytic techniques taught and championed by him. We are grateful to Professor Schepers for his cooperation throughout this project. Thanks are due to all the contributors and referees.

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

Special Issue: Competencies from the Individual's Viewpoint.

Science.gov (United States)

Career Planning and Adult Development Journal, 2003

2003-01-01

Ten articles in this special issue deal with competencies and how their use is revolutionizing human resource management and the work of career practitioners. Topics include competency technology, models, and mapping; behavioral interviewing; talent management; emotional intelligence; succession planning; and lifelong learning. (JOW)

Special Issue: Productive Employment for the Poor.

Science.gov (United States)

Gaude, Jacques, Ed.; Miller, Steven, Ed.

1992-01-01

This special issue contains nine articles on labor-intensive public works, social investment funds, rural infrastructure projects, grassroots socioeconomic rights, remuneration systems for self-help projects, road construction and rural transport, employment and environmental rehabilitation, and water as a source of employment. (SK)

Introduction to 'The Unacceptable' Special Issue

Directory of Open Access Journals (Sweden)

John Scannell

2015-02-01

Full Text Available This special issue of Portal contends with the 'unacceptable' as the intervention upon bodies, images or practices deemed excessive to the limits of functional community. Under the rubric of propriety, discussion of the 'unacceptable' can all too easily become marginalised through silence, erasure and/or condemnation. Yet challenging the boundaries of the 'unacceptable' is vital to the continuity of a civil society, and the articles contained in this issue attempt to probe the limits of acceptability, as they seek to comprehend, and perhaps, intervene upon some divisive contemporary issues. Torture, disability, sexuality, e-waste, bureaucracy, comedy, and the constitution of the strange are among the broad range of topics in which the definition, regulation and assessment of unacceptability are pursued. Through documentation of such suitably 'unacceptable' issues, the articles contained in this volume not only compel the reader to question convention, but furthermore, interrogate the point where social intervention upon desire might be necessary too. John Scannell, guest editor.

Research Article Special Issue

African Journals Online (AJOL)

pc

2017-11-24

Nov 24, 2017 ... The effect of TOPBr clay on water contet, porosity, pure water permeation and ... Pure water flux is important for the determination of membrane stability and hydraulic .... The slopes of the graphs indicating the permeability coefficient of ... polymer in solution will lead to the decrease of membrane's pore size ...

Research Article Special Issue

African Journals Online (AJOL)

pc

2017-10-17

Oct 17, 2017 ... InfoVishas also become a major tool for gaining insight [1-2]. InfoVisenlarges ... Section four is focusing on the methodology and the details of the InfoVis, ... connections between digital representations like a graph or numerical dataset, or into scientific .... a learning process and the process is growing.

Special issue on activity-travel decision processes

NARCIS (Netherlands)

Doherty, S.; Ettema, D.F.

2006-01-01

Before you lies the 2006 TRB (Transportation Research Board) Special Issue of Transportation comprising selected papers presented at the 2006 Annual Meeting of the TRB in sessions sponsored by the Travel Behavior and Values committee on activity-travel decision processes. We are pleased to serve

A conjugate gradient method for the spectral partitioning of graphs

NARCIS (Netherlands)

Kruyt, Nicolaas P.

1997-01-01

The partitioning of graphs is a frequently occurring problem in science and engineering. The spectral graph partitioning method is a promising heuristic method for this class of problems. Its main disadvantage is the large computing time required to solve a special eigenproblem. Here a simple and

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.

Introduction to the special issue on college student mental health.

Science.gov (United States)

Castillo, Linda G; Schwartz, Seth J

2013-04-01

This article provides an introduction to the special issue on college student mental health. It gives an overview of the establishment of the Multi-Site University Study of Identity and Culture (MUSIC) collaborative by a group of national experts on culture and identity. Information about the procedures used to collect a nationally represented sample of college students are provided. Data were collected from 30 university sites across the United States. The sample comprised 10,573 undergraduate college students, of which 73% were women, 63% White, 9% African American/Black, 14% Latino/Hispanic, 13% Asian American, and 1% Other. The special issue comprises a compilation of 8 studies that used the dataset specifically created to examine the issues of emerging adults, culture, and identity. Student mental health problems are a growing concern on college campuses. Studies covered in this special issue have implications for policy development regarding college alcohol use and traumatic victimization, include attention to underrepresented minority and immigrant groups on college campuses, and focus on positive as well as pathological aspects of the college experience. © 2013 Wiley Periodicals, Inc.

"Special Issue": Regional Dimensions of the Triple Helix Model

Science.gov (United States)

Todeva, Emanuela; Danson, Mike

2016-01-01

This paper introduces the rationale for the special issue and its contributions, which bridge the literature on regional development and the Triple Helix model. The concept of the Triple Helix at the sub-national, and specifically regional, level is established and examined, with special regard to regional economic development founded on…

On the graph turnpike problem

KAUST Repository

Feder, Tomá s; Motwani, Rajeev

2009-01-01

Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.

On the graph turnpike problem

KAUST Repository

Feder, Tomás

2009-06-01

Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.

EDITORIAL: Special issue on Graphene Special issue on Graphene

Science.gov (United States)

Morpurgo, Alberto F.; Trauzettel, Björn

2010-03-01

Since the revolutionary experimental discovery of graphene in the year 2004, research on this new two-dimensional carbon allotrope has progressed at a spectacular pace. The impact of graphene on different areas of research— including physics, chemistry, and applied sciences— is only now starting to be fully appreciated. There are different factors that make graphene a truly impressive system. Regarding nano-electronics and related fields, for instance, it is the exceptional electronic and mechanical properties that yield very high room-temperature mobility values, due to the particular band structure, the material `cleanliness' (very low-concentration of impurities), as well as its stiffness. Also interesting is the possibility to have a high electrical conductivity and optical transparency, a combination which cannot be easily found in other material systems. For other fields, other properties could be mentioned, many of which are currently being explored. In the first years following this discovery, research on graphene has mainly focused on the fundamental physics aspects, triggered by the fact that electrons in graphene behave as Dirac fermions due to their interaction with the ions of the honeycomb lattice. This direction has led to the discovery of new phenomena such as Klein tunneling in a solid state system and the so-called half-integer quantum Hall effect due to a special type of Berry phase that appears in graphene. It has also led to the appreciation of thicker layers of graphene, which also have outstanding new properties of great interest in their own right (e.g., bilayer graphene, which supports chiral quasiparticles that, contrary to Dirac electrons, are not massless). Now the time is coming to deepen our knowledge and improve our control of the material properties, which is a key aspect to take one step further towards applications. The articles in the Semiconductor Science and Technology Graphene special issue deal with a diversity of topics

Introduction - AABFJ Financial Planning Special Issue 2009

Directory of Open Access Journals (Sweden)

Ciorstan J. Smark

2009-03-01

Full Text Available This special issue draws on recent work of financial planning specialists, finance specialists and economists todocument some of the trends, perception and challenges of financial planning in 2009. This diversity ofcontributors reflects the diversity and the multiplicity of influences that impact on financial planning.

Finally Making Good on the Promise of Qualitative Research in Special Education? A Response to the Special Issue

Science.gov (United States)

Pugach, Marleen C.; Mukhopadhyay, Ananya; Gomez-Najarro, Joyce

2014-01-01

In this response to the special issue, we would like to offer two additional considerations to the discourse on qualitative research and special education this issue is meant to catalyze. First, we would like to further problematize the question of why qualitative research continues to be so sparsely represented in most prominent publications of…

Scientific uncertainty in media content: Introduction to this special issue.

Science.gov (United States)

Peters, Hans Peter; Dunwoody, Sharon

2016-11-01

This introduction sets the stage for the special issue on the public communication of scientific uncertainty that follows by sketching the wider landscape of issues related to the communication of uncertainty and showing how the individual contributions fit into that landscape. The first part of the introduction discusses the creation of media content as a process involving journalists, scientific sources, stakeholders, and the responsive audience. The second part then provides an overview of the perception of scientific uncertainty presented by the media and the consequences for the recipients' own assessments of uncertainty. Finally, we briefly describe the six research articles included in this special issue. © The Author(s) 2016.

Two-Beam Linear Colliders - Special Issues

CERN Document Server

Corsini, Roberto

2010-01-01

The path towards a multi-TeV e+e- linear collider proposed by the CLIC study is based on the Two-Beam Acceleration (TBA) scheme. Such a scheme is promising in term of efficiency, reliability and cost. The rationale behind the two-beam scheme is discussed in the paper, together with the special issues related to this technology and the R&D needed to demonstrate its feasibility.

FOREWORD: Special issue on density

Science.gov (United States)

Fujii, Kenichi

2004-04-01

This special issue on density was undertaken to provide readers with an overview of the present state of the density standards for solids, liquids and gases, as well as the technologies developed for measuring density. This issue also includes topics on the refractive index of gases and on techniques used for calibrating hydrometers so that almost all areas concerned with density standards are covered in four review articles and seven original articles, most of which describe current research being conducted at national metrology institutes (NMIs). A review article was invited from the Ruhr-Universität Bochum to highlight research on the magnetic suspension densimeters. In metrology, the determinations of the volume of a weight and the density of air are of primary importance in establishing a mass standard because the effect of the buoyancy force of air acting on the weight must be known accurately to determine the mass of the weight. A density standard has therefore been developed at many NMIs with a close relation to the mass standard. Hydrostatic weighing is widely used to measure the volume of a solid. The most conventional hydrostatic weighing method uses water as a primary density standard for measuring the volume of a solid. A brief history of the determination of the density of water is therefore given in a review article, as well as a recommended value for the density of water with a specified isotopic abundance. The most modern technique for hydrostatic weighing uses a solid density standard instead of water. For this purpose, optical interferometers for measuring the diameters of silicon spheres have been developed to convert the length standard into the volume standard with a small uncertainty. A review article is therefore dedicated to describing the state-of-the-art optical interferometers developed for silicon spheres. Relative combined standard uncertainties of several parts in 108 have been achieved today for measuring the volume and density of

Special journal issue highlights IDRC-supported findings on ...

International Development Research Centre (IDRC) Digital Library (Canada)

2018-03-08

Mar 8, 2018 ... Special journal issue highlights IDRC-supported findings on women's paid work ... An important aspect of women's economic empowerment is their participation in the labour ... Maternal health research concerns men too.

Energy, a crucial environmental subject. Special issue

International Nuclear Information System (INIS)

2001-01-01

In this issue of the magazine ArenA special attention is paid the use of energy in the Netherlands, the related problems and solutions, and the agenda for the Section Energy of the Dutch Association of Environmental Professionals (VVM) resulting from the technological, administrative and economical problems and solutions

From the Editors of the Special Issue

NARCIS (Netherlands)

Ruttkay, Z.M.; Kipp, Michael; Kipp, M.; Nijholt, Antinus; Vilhjálmsson, H.H.; Vilhjalmsson, Högni

2010-01-01

Welcome to the special issue on Intelligent Virtual Agents. Intelligent Virtual Agents (IVAs) are interactive characters that – in spite of being merely 2D or 3D computer graphics models – exhibit humanlike qualities and communicate with humans or with each other using natural human modalities such

General Vertex-Distinguishing Total Coloring of Graphs

Directory of Open Access Journals (Sweden)

Chanjuan Liu

2014-01-01

Full Text Available The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for which the vertices and edges of G are colored using k colors such that any two vertices have distinct sets of colors of them and their incident edges. In this paper, we figure out the exact value of this chromatic number of some special graphs and propose a conjecture on the upper bound of this chromatic number.

JGR special issue on Deep Earthquakes

Science.gov (United States)

The editor and associate editors of the Journal of Geophysical Research—Solid Earth and Planets invite the submission of manuscripts for a special issue on the topic “Deep- and Intermediate-Focus Earthquakes, Phase Transitions, and the Mechanics of Deep Subduction.”Manuscripts should be submitted to JGR Editor Gerald Schubert (Department of Earth and Space Sciences, University of California, Los Angeles, Los Angeles, CA 90024) before July 1, 1986, in accordance with the usual rules for manuscript submission. Submitted papers will undergo the normal JGR review procedure. For more information, contact either Schubert or the special guest associate editor, Cliff Frohlich (Institute for Geophysics, University of Texas at Austin, 4920 North IH-35, Austin, TX 78751; telephone: 512-451-6223).

Neural coding in graphs of bidirectional associative memories.

Science.gov (United States)

Bouchain, A David; Palm, Günther

2012-01-24

In the last years we have developed large neural network models for the realization of complex cognitive tasks in a neural network architecture that resembles the network of the cerebral cortex. We have used networks of several cortical modules that contain two populations of neurons (one excitatory, one inhibitory). The excitatory populations in these so-called "cortical networks" are organized as a graph of Bidirectional Associative Memories (BAMs), where edges of the graph correspond to BAMs connecting two neural modules and nodes of the graph correspond to excitatory populations with associative feedback connections (and inhibitory interneurons). The neural code in each of these modules consists essentially of the firing pattern of the excitatory population, where mainly it is the subset of active neurons that codes the contents to be represented. The overall activity can be used to distinguish different properties of the patterns that are represented which we need to distinguish and control when performing complex tasks like language understanding with these cortical networks. The most important pattern properties or situations are: exactly fitting or matching input, incomplete information or partially matching pattern, superposition of several patterns, conflicting information, and new information that is to be learned. We show simple simulations of these situations in one area or module and discuss how to distinguish these situations based on the overall internal activation of the module. This article is part of a Special Issue entitled "Neural Coding". Copyright © 2011 Elsevier B.V. All rights reserved.

Resonance Special Issue - World Year of Physics -RE ...

Indian Academy of Sciences (India)

Resonance Special Issue - World Year of Physics. Vol 10, No 12, ... Origin (?) of the Universe - The Expanding Universe. Jayant V Narlikar. 12 ... Einstein's Last Dream: The Space - Time Unification of Fundamental Forces. Abdus Salam.

Potential-controlled filtering in quantum star graphs

International Nuclear Information System (INIS)

Turek, Ondřej; Cheon, Taksu

2013-01-01

We study the scattering in a quantum star graph with a Fülöp–Tsutsui coupling in its vertex and with external potentials on the lines. We find certain special couplings for which the probability of the transmission between two given lines of the graph is strongly influenced by the potential applied on another line. On the basis of this phenomenon we design a tunable quantum band-pass spectral filter. The transmission from the input to the output line is governed by a potential added on the controlling line. The strength of the potential directly determines the passband position, which allows to control the filter in a macroscopic manner. Generalization of this concept to quantum devices with multiple controlling lines proves possible. It enables the construction of spectral filters with more controllable parameters or with more operation modes. In particular, we design a band-pass filter with independently adjustable multiple passbands. We also address the problem of the physical realization of Fülöp–Tsutsui couplings and demonstrate that the couplings needed for the construction of the proposed quantum devices can be approximated by simple graphs carrying only δ potentials. - Highlights: ► Spectral filtering devices based on quantum graphs are designed theoretically. ► The passband is controlled by the application of macroscopic potentials on lines. ► The filters are built upon special Fulop–Tsutsui type couplings at graph vertices. ► A method of construction of Fulop–Tsutsui vertices from delta potentials is devised.

Special issue introduction: Ecological modernization

DEFF Research Database (Denmark)

Massa, Ilmo; Andersen, Mikael Skou

2000-01-01

The contributions to this special issue of the Journal of Environmental Policy and Planning stem from an international conference on ecological modernization that took place at the Department of Social Policy of the University of Helsinki, Finland, in late 1998. They have been selected, among other...... reasons, for their possible contribution to conceptual understanding and clarification. While recent publications have explored the implications of ecological modernization in different settings (Mol & Sonnenfeld, 2000), here we try to put the concept under the microscope again, in the hope of clarifying...

Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations

OpenAIRE

Delzanno, Giorgio; Stückrath, Jan

2014-01-01

We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be transformed by the rule as well. For the new class for graph rewrite rules, we provide a symbolic procedure working on minimal representations of upward closed sets of configurations. We prove correctness and effectiveness of the procedure by a categorical presenta...

Attachment-related mental representations: introduction to the special issue.

Science.gov (United States)

Thompson, Ross A

2008-12-01

Bowlby's concept of mental working models of self, attachment figures, and the social world has been theoretically generative as a bridge between early relational experience and the beliefs and expectations that color later relationships. Contemporary attachment researchers, following his example, are applying new knowledge of children's conceptual development to their study of attachment-related mental representations in children and adults. The contributors to this special issue highlight recent advances in how the mental representations arising from attachment security should be conceptualized and studied, and identify a number of important directions for future work. This paper introduces the special issue by summarizing the major ideas of Bowlby and his followers concerning the nature and development of mental working models, points of theoretical clarity and uncertainty, and challenges in assessing these representations, as well as profiling each of the contributions to this issue.

Isotropic covariance functions on graphs and their edges

DEFF Research Database (Denmark)

Anderes, E.; Møller, Jesper; Rasmussen, Jakob Gulddahl

We develop parametric classes of covariance functions on linear networks and their extension to graphs with Euclidean edges, i.e., graphs with edges viewed as line segments or more general sets with a coordinate system allowing us to consider points on the graph which are vertices or points...... on an edge. Our covariance functions are defined on the vertices and edge points of these graphs and are isotropic in the sense that they depend only on the geodesic distance or on a new metric called the resistance metric (which extends the classical resistance metric developed in electrical network theory...... functions in the spatial statistics literature (the power exponential, Matérn, generalized Cauchy, and Dagum classes) are shown to be valid with respect to the resistance metric for any graph with Euclidean edges, whilst they are only valid with respect to the geodesic metric in more special cases....

Special issue: Logistics systems design in Latin America

Directory of Open Access Journals (Sweden)

Miguel Gaston Cedillo Campos

2017-10-01

Under this context, this Special Issue of the Journal of Industrial Engineering and Management (JIEM gathers nine significant contributions, which from a Latin American approach, enhance the logistics systems body of knowledge focused on emerging markets.

Special issue on network coding

Science.gov (United States)

Monteiro, Francisco A.; Burr, Alister; Chatzigeorgiou, Ioannis; Hollanti, Camilla; Krikidis, Ioannis; Seferoglu, Hulya; Skachek, Vitaly

2017-12-01

Future networks are expected to depart from traditional routing schemes in order to embrace network coding (NC)-based schemes. These have created a lot of interest both in academia and industry in recent years. Under the NC paradigm, symbols are transported through the network by combining several information streams originating from the same or different sources. This special issue contains thirteen papers, some dealing with design aspects of NC and related concepts (e.g., fountain codes) and some showcasing the application of NC to new services and technologies, such as data multi-view streaming of video or underwater sensor networks. One can find papers that show how NC turns data transmission more robust to packet losses, faster to decode, and more resilient to network changes, such as dynamic topologies and different user options, and how NC can improve the overall throughput. This issue also includes papers showing that NC principles can be used at different layers of the networks (including the physical layer) and how the same fundamental principles can lead to new distributed storage systems. Some of the papers in this issue have a theoretical nature, including code design, while others describe hardware testbeds and prototypes.

Introduction to the special issue: permafrost and periglacial research from coasts to mountains

Science.gov (United States)

Schrott, Lothar; Humlum, Ole

2017-09-01

This special issue of Geomorphology includes eleven papers dealing with permafrost and periglacial research from coasts to mountains. The compilation represents a selection from 47 presentations (oral and posters) given at the 4th European Conference on Permafrost - IPA Regional Conference (EUCOP4, June 2014) in the session ;Periglacial Geomorphology;. Geomorphology as a leading journal for our discipline is particularly suitable to publish advances in permafrost and periglacial research with a focus on geomorphic processes. Since 1989 Geomorphology has published 121 special issues and two special issues are explicitly dedicated to permafrost and periglacial research, however, only with a focus on research in Antarctica. In this special issue we present papers from the Canadian Beaufort Sea, Alaska, Spitzbergen, central western Poland, the European Alps, the eastern Sudetes, the southern Carpathians, Nepal, and Antarctica.

A Helicopter View of the Special Issue on Wave Energy Converters

Directory of Open Access Journals (Sweden)

Diego Vicinanza

2017-02-01

Full Text Available This paper intends to provide the reader with an overview of the Special Issue on Wave Energy Converters. Through 16 contributions from authors of 10 different countries, a number of key topics have been tackled, including resource assessment, engineering design, and financial analysis. As a whole, the Special Issue forms an interesting and helpful compendium on the state of the art of wave energy extraction and exploitation.

Editorial to the Special issue of the journal

Directory of Open Access Journals (Sweden)

Nikša Alfirević

2016-01-01

Full Text Available This is the editorial to the Special issue of the Management journal, dedicated to the 11th International Conference on "Challenges of Europe", organized by the Faculty of Economics in Split, Croatia, in May 2015.

Special issue “International Geomagnetic Reference Field—the twelfth generation”

DEFF Research Database (Denmark)

Thébault, E.; Finlay, C. C.; Toh, H.

2015-01-01

This special issue of Earth, Planets and Space, synthesizes the efforts made during the construction of the twelfth generation of the International Geomagnetic Reference Field (IGRF-12) that was released online in December 2014 (http://www.ngdc.noaa.gov/IAGA/vmod/ igrf.html). The IGRF-12 is a ser......This special issue of Earth, Planets and Space, synthesizes the efforts made during the construction of the twelfth generation of the International Geomagnetic Reference Field (IGRF-12) that was released online in December 2014 (http://www.ngdc.noaa.gov/IAGA/vmod/ igrf.html). The IGRF-12...

Special Issue on Time Scale Algorithms

Science.gov (United States)

2008-01-01

unclassified Standard Form 298 (Rev. 8-98) Prescribed by ANSI Std Z39-18 IOP PUBLISHING METROLOGIA Metrologia 45 (2008) doi:10.1088/0026-1394/45/6/E01...special issue of Metrologia presents selected papers from the Fifth International Time Scale Algorithm Symposium (VITSAS), including some of the...scientists, and hosted by the Real Instituto y Observatorio de la Armada (ROA) in San Fernando, Spain, whose staff further enhanced their nation’s high

Special Issue “Biomaterials and Bioprinting”

Directory of Open Access Journals (Sweden)

Chee Kai Chua

2016-09-01

Full Text Available The emergence of bioprinting in recent years represents a marvellous advancement in 3D printing technology. It expands the range of 3D printable materials from the world of non-living materials into the world of living materials. Biomaterials play an important role in this paradigm shift. This Special Issue focuses on biomaterials and bioprinting and contains eight articles covering a number of recent topics in this emerging area.

Special issue: the nuclear industry in Europe

International Nuclear Information System (INIS)

Anon.

1982-01-01

This special issue contains papers on the following topics: French nuclear policy; nuclear energy development in Europe; nuclear diversification; Alsthom-Atlantique in the nuclear field; 1981 nuclear electricity generation; EDF siting policy; the N4 model of the 1300 MW series; Creys-Malville; the nuclear industry in Europe; pumps in the nuclear industry [fr

Special issue: Supply chain and logistics decisions under environmental aspect

Directory of Open Access Journals (Sweden)

Neslihan Demirel

2017-05-01

Full Text Available This editor’s note has a twofold objective: (1 to present a brief summary about the environmental issues in supply chain and logistics decisions (2 to present general information about the papers published in the special issue.

Special issue : transport in a post-carbon society

Science.gov (United States)

2009-04-01

This special issue of World Transport Policy & Practice is an outcome of the conference Planning for the Carbon Neutral World: Challenges for Cities and Regions, held 15-18 May 2008 in Salzburg, Austria. The conference, organised by SCUPAD Salzbu...

Innovations in Play Therapy: Issues, Process, and Special Populations.

Science.gov (United States)

Landreth, Garry L., Ed.

This book is a compilation of discussions on current issues in play therapy. It is designed to help therapists fill in the gaps about working with special populations, which is often not directly addressed in other play therapy resources. The object of the book is to bring together information related to issues and dynamics of the process of this…

Special Issue on Intelligent Robots

Directory of Open Access Journals (Sweden)

Genci Capi

2013-08-01

Full Text Available The research on intelligent robots will produce robots that are able to operate in everyday life environments, to adapt their program according to environment changes, and to cooperate with other team members and humans. Operating in human environments, robots need to process, in real time, a large amount of sensory data—such as vision, laser, microphone—in order to determine the best action. Intelligent algorithms have been successfully applied to link complex sensory data to robot action. This editorial briefly summarizes recent findings in the field of intelligent robots as described in the articles published in this special issue.

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.

Introduction to the Special Issue: Coastal GIS

Directory of Open Access Journals (Sweden)

Timothy Nyerges

2014-09-01

Full Text Available This special issue of the ISPRS International Journal of Geographic Information about “Coastal GIS” is motivated by many circumstances. More than one-half of the world’s human population lives in coastal areas (within 200 kilometers of coast as of 2000 [1]. The trend toward coastal habitation is expected to continue in the US with the total being 75 percent by 2025, meaning that coastal human–environment interactions will likely increase and intensify [2]. Geographic information systems (GIS are being developed and used by technical specialists, stakeholder publics, and executive/policy decision makers for improving our understanding and management of coastal areas, separately and together as more organizations focus on improving the sustainability and resilience of coastal systems. Coastal systems—defined as the area of land closely connected to the sea, including barrier islands, wetlands, mudflats, beaches, estuaries, cities, towns, recreational areas, and maritime facilities, the continental seas and shelves, and the overlying atmosphere—are subject to complex and dynamic interactions among natural and human-driven processes. Coastal systems are crucial to regional and national economies, hosting valued human-built infrastructure and providing ecosystem services that sustain human well-being. This special issue of IJGI about coastal GIS presents a collection of nine papers that address many of the issues mentioned above. [...

Special Issue: Design and Engineering of Microreactor and Smart-Scaled Flow Processes

Directory of Open Access Journals (Sweden)

Volker Hessel

2014-12-01

Full Text Available Reaction-oriented research in flow chemistry and microreactor has been extensively focused upon in special journal issues and books. On a process level, this resembled the “drop-in” (retrofit concept with the microreactor replacing a conventional (batch reactor. Meanwhile, with the introduction of the mobile, compact, modular container technology, the focus is more on the process side, including also providing an end-to-end vision of intensified process design. Exactly this is the focus of the current special issue “Design and Engineering of Microreactor and Smart-Scaled Flow Processes” of the journal “Processes”. This special issue comprises three review papers, five research articles and two communications. [...

Special Issue of Selected Papers from Visualization and Data Analysis 2011

Science.gov (United States)

Kao, David L.; Wong, Pak Chung

2012-01-01

This special issue features the best papers that were selected from the 18th SPIE Conference on Visualization and Data Analysis (VDA 2011). This annual conference is a major international forum for researchers and practitioners interested in data visualization and analytics research, development, and applications. VDA 2011 received 42 high-quality submissions from around the world. Twenty-four papers were selected for full conference papers. The top five papers have been expanded and reviewed for this special issue.

Special issue: diagnostics of atmospheric pressure microplasmas

Science.gov (United States)

Bruggeman, Peter; Czarnetzki, Uwe; Tachibana, Kunihide

2013-11-01

In recent decades, a strong revival of non-equilibrium atmospheric pressure plasma studies has developed in the form of microplasmas. Microplasmas have typical scales of 1 mm or less and offer a very exciting research direction in the field of plasma science and technology as the discharge physics can be considerably different due to high collisionality and the importance of plasma-surface interaction. These high-pressure small-scale plasmas have a diverse range of physical and chemical properties. This diversity coincides with various applications including light/UV sources [1], material processing [2], chemical analysis [3], material synthesis [4], electromagnetics [5], combustion [6] and even medicine [7]. At atmospheric pressure, large scale plasmas have the tendency to become unstable due to the high collision rates leading to enhanced heating and ionization compared to their low-pressure counterparts. As low-pressure plasmas typically operate in reactors with sizes of tens of centimetres, scaling up the pressure to atmospheric pressure the size of the plasma reduces to typical sizes below 1 mm. A natural approach of stabilizing atmospheric pressure plasmas is thus the use of microelectrode geometries. Traditionally microplasmas have been produced in confined geometries which allow one to stabilize dc excited discharges. This stabilization is intrinsically connected to the large surface-to-volume ratio which enhances heat transfer and losses of charged and excited species to the walls. Currently challenging boundaries are pushed by producing microcavity geometries with dimensions of the order of 1 µm [8]. The subject of this special issue, diagnostics of microplasmas, is motivated by the many challenges in microplasma diagnostics in view of the complex chemistry and strong spatial (and even temporal) gradients of species densities and plasma properties. Atmospheric pressure plasmas have a very long history dating back more than 100 years, with early work of

Special Issue: Selected Articles from the 1996 NORCHIP Seminar

DEFF Research Database (Denmark)

1998-01-01

This Special Issue of Analog Integrated Circuits and Signal Processing presents extended versions of selected papers from the 14th NORCHIP Conference which was held November 4-5, in Helsinki, Finland...

Lidar Remote Sensing for Characterizing Forest Vegetation - Special Issue. Foreword

Science.gov (United States)

Popescu, Sorin C.; Nelson, Ross F.

2011-01-01

The Silvilaser 2009 conference held in College Station, Texas, USA, was the ninth conference in the Silvilaser series, which started in 2002 with the international workshop on using lidar (Light Detection and Ranging) for analyzing forest structure, held in Victoria, British Columbia, Canada. Following the Canadian workshop, subsequent forestry-lidar conferences took place in Australia, Sweden, Germany, USA, Japan, Finland, and the United Kingdom (UK). By the time this Silvilaser 2009 special issue of PE&RS is published, the 10th international conference will have been held in Freiburg, Germany, and planning will be ongoing for the 11th meeting to take place in Tasmania, Australia, in October 2011. Papers presented at the 2005 conference held in Blacksburg, Virginia, USA, were assembled in a special issue of PE&RS published in December 2006. Other special issues resulting from previous conferences were published in journals such as the Canadian Journal of Remote Sensing (2003), the Scandinavian Journal of Forest Research (2004), and Japan s Journal of Forest Planning (2008). Given the conference history and the much longer record of publications on lidar applications for estimating forest biophysical parameters, which dates back to the early 1980s, we may consider lidar an established remote sensing technology for characterizing forest canopy structure and estimating forest biophysical parameters. Randy Wynne, a professor at Virginia Tech and the final keynote speaker at Silvilaser 2009, made the case that it was time to push 30 years of research into operations, along the lines of what has already been done to good effect in the Scandinavian countries. In Randy s words, it s time to "Just do it!" This special issue includes a selection of papers presented during the 2009 Silvilaser conference, which consisted of eight sections as follows: (1) biomass and carbon stock estimates, (2) tree species and forest type classification, (3) data fusion and integration, (4, 5

DSH: Special Issue 'Digital Humanities 2014'

OpenAIRE

Terras Melissa; Clivaz Claire; Verhoeven Deb; Kaplan Frédéric

2015-01-01

The special issue presents selected proceedings from Digital Humanities 2014. Digital Humanities is the annual conference organized and sponsored by the Alliance of Digital Humanities Organizations (ADHO) and between 7th and 12th July 2014 over 700 attendees gathered for DH2014 at the University of Lausanne and the École polytechnique fédérale de Lausanne Switzerland (http://dh2014.org/): to date this remains the largest ever meeting of Digital Humanities scholars worldwide. Traditionally the...

[Preface for genome editing special issue].

Science.gov (United States)

Gu, Feng; Gao, Caixia

2017-10-25

Genome editing technology, as an innovative biotechnology, has been widely used for editing the genome from model organisms, animals, plants and microbes. CRISPR/Cas9-based genome editing technology shows its great value and potential in the dissection of functional genomics, improved breeding and genetic disease treatment. In the present special issue, the principle and application of genome editing techniques has been summarized. The advantages and disadvantages of the current genome editing technology and future prospects would also be highlighted.

Special Issue: Selected Articles from the 1994 NORCHIP Seminar

DEFF Research Database (Denmark)

1996-01-01

This Special Issue of Analog Integrated Circuits and Signal Processing presents extended versions of selected papers from the 12th NORCHIP Seminar which was held November 8-9, 1994, in Gothenburg, Sweden....

Editorial safety science special issue road safety management.

NARCIS (Netherlands)

Wegman, F.C.M. & Hagezieker, M.P.

2014-01-01

The articles presented in this Special Issue on Road Safety Management represent an illustration of the growing interest in policy-related research in the area of road safety. The complex nature of this type of research combined with the observation that scientific journals pay limited attention to

Editorial : Special Issue on Advances in Computer Entertainment

NARCIS (Netherlands)

Romão, Teresa; Nijholt, Anton; Cheok, Adrian David

2015-01-01

This special issue of the International Journal of Arts and Technology comprises a selection of papers from ACE 2012, the 9th International Conference on Advances in Computer Entertainment (Nijholt et al., 2012). ACE is the leading scientific forum for the dissemination of cutting-edge research

Upper bound for the span of pencil graph

Science.gov (United States)

Parvathi, N.; Vimala Rani, A.

2018-04-01

An L(2,1)-Coloring or Radio Coloring or λ coloring of a graph is a function f from the vertex set V(G) to the set of all nonnegative integers such that |f(x) ‑ f(y)| ≥ 2 if d(x,y) = 1 and |f(x) ‑ f(y)| ≥ 1 if d(x,y)=2, where d(x,y) denotes the distance between x and y in G. The L(2,1)-coloring number or span number λ(G) of G is the smallest number k such that G has an L(2,1)-coloring with max{f(v) : v ∈ V(G)} = k. [2]The minimum number of colors used in L(2,1)-coloring is called the radio number rn(G) of G (Positive integer). Griggs and yeh conjectured that λ(G) ≤ Δ2 for any simple graph with maximum degree Δ>2. In this article, we consider some special graphs like, n-sunlet graph, pencil graph families and derive its upper bound of (G) and rn(G).

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

Power and environmental assessment: Introduction to the special issue

International Nuclear Information System (INIS)

Cashmore, Matthew; Richardson, Tim

2013-01-01

The significance of politics and power dynamics has long been recognised in environmental assessment (EA) research, but there has not been sustained attention to power, either theoretically or empirically. The aim of this special issue is to encourage the EA community to engage more consistently with the issue of power. The introduction represents a ground-clearing exercise intended to clarify the terms of the debate about power in the EA field, and to contribute to the development of a research agenda. Research trends in the field are outlined, and potential analytic and normative lines of inquiry are identified. The contributions to this special issue represent contrasting conceptual and methodological approaches that navigate the analytical and normative terrain of power dynamics in EA. Together, they demonstrate that power cannot be removed from EA policy or practices, and is a necessary research focus for the development of the field. - Highlights: ► Introduces the themed section on power ► Provides an overview of the papers in the themed section ► Identifies research trends and directions for future research

Special issue - Applying the accelerator

International Nuclear Information System (INIS)

Anon.

1995-01-01

T'he CERN Courier is the international journal of high energy physics, covering current developments in and around this branch of basic science. A recurrent theme is applying the technology developed for particle accelerators, the machines which produce beams of high energy particles for physics experiments. Twentieth-century science is full of similar examples of applications derived from pure research. This special issue of the CERN Courier is given over to one theme - the applications of accelerators. Accelerator systems and facilities are normally associated with highenergy particle physics research, the search for fundamental particles and the quest to understand the physics of the Big Bang. To the layman, accelerator technology has become synonymous with large and expensive machines, exploiting the most modern technology for basic research. In reality, the range of accelerators and their applications is much broader. A vast number of accelerators, usually much smaller and operating for specific applications, create wealth and directly benefit the population, particularly in the important areas of healthcare, energy and the environment. There are well established applications in diagnostic and therapeutic medicine for research and routine clinical treatments. Accelerators and associated technologies are widely employed by industry for manufacturing and process control. In fundamental and applied research, accelerator systems are frequently used as tools. The biennial conference on the Applications of Accelerators in Industry and Research at Denton, Texas, attracts a thousand participants. This special issue of the CERN Courier includes articles on major applications, reflecting the diversity and value of accelerator technology. Under Guest Editor Dewi Lewis of Amersham International, contributions from leading international specialists with experience of the application end of the accelerator chain describe their fields of direct interest. The

Special issue - Applying the accelerator

Energy Technology Data Exchange (ETDEWEB)

Anon.

1995-07-15

T'he CERN Courier is the international journal of high energy physics, covering current developments in and around this branch of basic science. A recurrent theme is applying the technology developed for particle accelerators, the machines which produce beams of high energy particles for physics experiments. Twentieth-century science is full of similar examples of applications derived from pure research. This special issue of the CERN Courier is given over to one theme - the applications of accelerators. Accelerator systems and facilities are normally associated with highenergy particle physics research, the search for fundamental particles and the quest to understand the physics of the Big Bang. To the layman, accelerator technology has become synonymous with large and expensive machines, exploiting the most modern technology for basic research. In reality, the range of accelerators and their applications is much broader. A vast number of accelerators, usually much smaller and operating for specific applications, create wealth and directly benefit the population, particularly in the important areas of healthcare, energy and the environment. There are well established applications in diagnostic and therapeutic medicine for research and routine clinical treatments. Accelerators and associated technologies are widely employed by industry for manufacturing and process control. In fundamental and applied research, accelerator systems are frequently used as tools. The biennial conference on the Applications of Accelerators in Industry and Research at Denton, Texas, attracts a thousand participants. This special issue of the CERN Courier includes articles on major applications, reflecting the diversity and value of accelerator technology. Under Guest Editor Dewi Lewis of Amersham International, contributions from leading international specialists with experience of the application end of the accelerator chain describe their fields of direct interest. The contributions

Preface JFDE Special Issue Glass

Directory of Open Access Journals (Sweden)

Ulrich Knaack

2015-05-01

Full Text Available Facade Design and Engineering is a multidisciplinary field that touches many other scientific disciplines. Glass is one of the key materials for building envelopes, and a strong scientific community has developed over the last decade. Designers love glass for its transparency. It is strong but brittle and very demanding in terms of engineering. We continuously see new innovative developments in terms of its climatic performance, structural possibilities, construction design and new applications. Reason enough to dedicate this special issue to the topic. The issue would not have been possible without the contribution of our special editors Jan Belis and Christian Louter, who contributed through their outstanding editorial work and network. Most of the papers in this issue were carefully selected from of a number of invited submissions and conference papers of the COST Action TU0905 Mid-Term Conference, April 17+18 2013, Porec, (CRC Press/Balkema, Leiden and subsequently subjected to the regular blind review process of the journal. Glass as a building material demonstrates the nature of the architectural discipline, where science and building practice are closely linked. Buildings are the live testing bed for scientific research and, at the same time, building practice formulates new research questions. We found that many articles sent to us deal with this relation. Therefore we decided to introduce the new category ’Applied Practice’ for certain journal paper contributions, which from now on can be found at the end of each issue. Although they do not need to be purely scientific, ’Applied Practice’ papers will always discuss new developments, will have a clear structure and are subjected to the strict JFDE review process. Façade Design and Engineering is a peer reviewed, open access journal, funded by The Netherlands Organisation for Scientific Research NWO (www.nwo.nl. We see ’open access’ as the future publishing model. But it

Multipodal Structure and Phase Transitions in Large Constrained Graphs

Science.gov (United States)

Kenyon, Richard; Radin, Charles; Ren, Kui; Sadun, Lorenzo

2017-07-01

We study the asymptotics of large, simple, labeled graphs constrained by the densities of two subgraphs. It was recently conjectured that for all feasible values of the densities most such graphs have a simple structure. Here we prove this in the special case where the densities are those of edges and of k-star subgraphs, k≥2 fixed. We prove that under such constraints graphs are "multipodal": asymptotically in the number of vertices there is a partition of the vertices into M < ∞ subsets V_1, V_2, \\ldots , V_M, and a set of well-defined probabilities g_{ij} of an edge between any v_i \\in V_i and v_j \\in V_j. For 2≤ k≤ 30 we determine the phase space: the combinations of edge and k-star densities achievable asymptotically. For these models there are special points on the boundary of the phase space with nonunique asymptotic (graphon) structure; for the 2-star model we prove that the nonuniqueness extends to entropy maximizers in the interior of the phase space.

Special Issue on advanced and emerging light sources

NARCIS (Netherlands)

Haverlag, M.; Kroesen, G.M.W.; Ferguson, I.

2011-01-01

EDITORIAL The papers in this special issue of Journal of Physics D: Applied Physics (JPhysD) originate from the 12th International Symposium on the Science and Technology of Light Sources and the 3rd International Conference on White LEDs and Solid State Lighting, held 11–16 July 2010 at Eindhoven

Special journal issue focuses on urban violence, poverty, and ...

International Development Research Centre (IDRC) Digital Library (Canada)

2015-10-02

Oct 2, 2015 ... In a special issue of the journal, Mouvements et enjeux sociaux [Social ... what works and what doesn't — to reduce violence in urban centres. ... to prevent crime, including mental health support, building community trust.

An Introduction to the Special Issue. Politics of Precarity

DEFF Research Database (Denmark)

Schierup, Carl-Ulrik; Bak Jørgensen, Martin

2016-01-01

The current special issue examines the range and strength of analysing contemporary transformations and struggles through the lens of ‘precarity’. Rather than defining a single precariat, the interest is in exploring ‘varieties of precarity’. These take different forms in different parts of the w......The current special issue examines the range and strength of analysing contemporary transformations and struggles through the lens of ‘precarity’. Rather than defining a single precariat, the interest is in exploring ‘varieties of precarity’. These take different forms in different parts...... of the world, on different scales and in different socio-economic contexts, and yet they share certain characteristics in terms of conditions and capacity for agency. Contributions to this volume testify that precarity may be a political proposition as much as a sociological category that offers an analytical...

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

Special issue of Higher-Order and Symbolic Computation

DEFF Research Database (Denmark)

Danvy, Olivier; Sabry, Amr

This issue of HOSC is dedicated to the general topic of continuations. It grew out of the third ACM SIGPLAN Workshop on Continuations (CW'01), which took place in London, UK on January 16, 2001 [3]. The notion of continuation is ubiquitous in many different areas of computer science, including...... and streamline Filinski's earlier work in the previous special issue of HOSC (then LISP and Symbolic Computation) that grew out of the first ACM SIGPLAN Workshop on Continuations [1, 2]. Hasegawa and Kakutani's article is the journal version of an article presented at FOSSACS 2001 and that received the EATCS...

Introduction to the Special Issue on Climate Ethics: Uncertainty, Values and Policy.

Science.gov (United States)

Roeser, Sabine

2017-10-01

Climate change is a pressing phenomenon with huge potential ethical, legal and social policy implications. Climate change gives rise to intricate moral and policy issues as it involves contested science, uncertainty and risk. In order to come to scientifically and morally justified, as well as feasible, policies, targeting climate change requires an interdisciplinary approach. This special issue will identify the main challenges that climate change poses from social, economic, methodological and ethical perspectives by focusing on the complex interrelations between uncertainty, values and policy in this context. This special issue brings together scholars from economics, social sciences and philosophy in order to address these challenges.

CALL FOR PAPERS: Special issue on Symmetries and Integrability of Difference Equations

Science.gov (United States)

Doliwa, Adam; Korhonen, Risto; Lafortune, Stephane

2006-10-01

This is a call for contributions to a special issue of Journal of Physics A: Mathematical and General entitled `Special issue on Symmetries and Integrability of Difference Equations' as featured at the SIDE VII meeting held during July 2006 in Melbourne (http://web.maths.unsw.edu.au/%7Eschief/side/side.html). Participants at that meeting, as well as other researchers working in the field of difference equations and discrete systems, are invited to submit a research paper to this issue. This meeting was the seventh of a series of biennial meetings devoted to the study of integrable difference equations and related topics. The notion of integrability was first introduced in the 19th century in the context of classical mechanics with the definition of Liouville integrability for Hamiltonian flows. Since then, several notions of integrability have been introduced for partial and ordinary differential equations. Closely related to integrability theory is the symmetry analysis of nonlinear evolution equations. Symmetry analysis takes advantage of the Lie group structure of a given equation to study its properties. Together, integrability theory and symmetry analysis provide the main method by which nonlinear evolution equations can be solved explicitly. Difference equations, just as differential equations, are important in numerous fields of science and have a wide variety of applications in such areas as: mathematical physics, computer visualization, numerical analysis, mathematical biology, economics, combinatorics, quantum field theory, etc. It is thus crucial to develop tools to study and solve difference equations. While the theory of symmetry and integrability for differential equations is now well-established, this is not yet the case for discrete equations. The situation has undergone impressive development in recent years and has affected a broad range of fields, including the theory of special functions, quantum integrable systems, numerical analysis, cellular

Special nuclear materials cutoff exercise: Issues and lessons learned. Volume 3

Energy Technology Data Exchange (ETDEWEB)

Libby, R.A.; Segal, J.E.; Stanbro, W.D.; Davis, C.

1995-08-01

This document is appendices D-J for the Special Nuclear Materials Cutoff Exercise: Issues and Lessons Learned. Included are discussions of the US IAEA Treaty, safeguard regulations for nuclear materials, issue sheets for the PUREX process, and the LANL follow up activity for reprocessing nuclear materials.

Special nuclear materials cutoff exercise: Issues and lessons learned. Volume 3

International Nuclear Information System (INIS)

Libby, R.A.; Segal, J.E.; Stanbro, W.D.; Davis, C.

1995-08-01

This document is appendices D-J for the Special Nuclear Materials Cutoff Exercise: Issues and Lessons Learned. Included are discussions of the US IAEA Treaty, safeguard regulations for nuclear materials, issue sheets for the PUREX process, and the LANL follow up activity for reprocessing nuclear materials

Preface (of the second special issue

Directory of Open Access Journals (Sweden)

Barna Iantovics

2011-01-01

Full Text Available

The primary aim of this special issue entitled Advances in Applied Sciences was to make some preparative steps by collecting state of the art research papers necessary in the beginning of the project entitled “Electronic Health Records for the Next Generation Medical Decision Support in Romanian and Bulgarian National Healthcare Systems” abbreviated as NextGenElectroMedSupport, a Bilateral Cooperation Research Project between Romania and Bulgaria having as directors from Bulgaria Prof. dr. Roumen Kountchev, Technical University of Sofia and from Romania Senior Lecturer dr. Barna Iantovics from Petru Maior University of Targu Mures. [...]

Introduction to Special Issue on Transience

DEFF Research Database (Denmark)

Lønsmann, Dorte; Haberland, Hartmut; Hazel, Spencer

2017-01-01

In this introduction to the special issue, the concept of transience is introduced as a theoretical perspective and as an object of research. The perspective of transience foregrounds the temporality of norm formation, located within the practices of people on the move. The introduction suggests......, as it is in the process of communities coming into being that norms emerge. Transience, in spite of being ubiquitous, is not always salient for members or analysts, but to identify, fixate and theorize it as an object of study in linguistic anthropology invites new ways of conceptualizing the interdependence of language...

Editorial: Special Issue on Algorithms for Sequence Analysis and Storage

Directory of Open Access Journals (Sweden)

Veli Mäkinen

2014-03-01

Full Text Available This special issue of Algorithms is dedicated to approaches to biological sequence analysis that have algorithmic novelty and potential for fundamental impact in methods used for genome research.

Technical Scientific Attaches and domotics. A special issue; Technisch Wetenschappelijk Attaches en domotica. Special

Energy Technology Data Exchange (ETDEWEB)

Kleinenberg, R.A. [Ministerie van Economische Zaken, The Hague (Netherlands); Uythof, B.H. [Invenit, Domotica Platform Nederland, Amsterdam (Netherlands); Benedetti, D [Ufficio Tecnico-Scientifico, Ambasciata del Regno dei Paesi Bassi, Rome (Italy); Van Wijngaarden, W.L. [Buero fuer Wissenschaft und Technologie, Kgl. Niederlaendische Botschaft, Bonn (Germany); Leniger, H.D.F. [Bureau du Conseiller Scientifique et Technique, Ambassade des Pays-Bas, Paris (France); Kieboom, J.P. [Office for Science and Technology, Royal Netherlands Embassy, Singapore (Singapore); Van Kooij, E.H. [Netherlands Office for Science and Technology, Royal Netherlands Embassy, Tokyo (Japan); Schuurmans, H.J.A. [Netherlands Office for Science and Technology, San Mateo, CA (United States)

2000-04-01

In this Dutch magazine Dutch businesses and institutes are informed about technological developments in industrialized countries (USA, Canada, Japan, South Korea, Taiwan, Singapore, Germany, France and Italy). In this special issue attaches in the different countries present information on developments and trends with respect to domotics, building automation, home networks, etc.

Special Issue: Book Reviews. Resources for Career Management, Counseling, Training and Development.

Science.gov (United States)

Horvath, Clara, Ed.; And Others

1995-01-01

This special issue includes reviews of 32 books on the following topics: management, human resources, and organizational development; career counseling, guidance, and assessment; job search; resumes; careers in specific fields; careers for special populations; career transitions; and finding balance. (SK)

Guest Editorial: Special issue: Selected papers from NorCAS 2016, the 2nd Nordic

DEFF Research Database (Denmark)

2017-01-01

complex digital systems to advanced analog and mixed-mode circuits. For this Special Issue, the papers are selected among those dealing with analog and mixed-mode circuits and systems. More than 25 papers were presented in this field, and from these, 8 papers have been selected for the Special Issue...

A librarian's guide to graphs, data and the semantic web

CERN Document Server

Powell, James

2015-01-01

Graphs are about connections, and are an important part of our connected and data-driven world. A Librarian's Guide to Graphs, Data and the Semantic Web is geared toward library and information science professionals, including librarians, software developers and information systems architects who want to understand the fundamentals of graph theory, how it is used to represent and explore data, and how it relates to the semantic web. This title provides a firm grounding in the field at a level suitable for a broad audience, with an emphasis on open source solutions and what problems these tools solve at a conceptual level, with minimal emphasis on algorithms or mathematics. The text will also be of special interest to data science librarians and data professionals, since it introduces many graph theory concepts by exploring data-driven networks from various scientific disciplines. The first two chapters consider graphs in theory and the science of networks, before the following chapters cover networks in vario...

Editorial for special issue of AJIS on Green IT/IS (Sustainable computing

Directory of Open Access Journals (Sweden)

Michael Steven Lane

2011-03-01

Full Text Available We are pleased to present this AJIS Special issue on Green IT/IS (Sustainable Computing. There are five papers published in this special issue of the AJIS which reflect the diversity of this emerging and important area of research in Information Systems. Environmental sustainability is one of if not the most important challenge facing organisations and society in the 21st century. Information systems and information technology have a major role to play in both reducing its environmental impact and providing the systems and technological innovation to reduce the environmental impact of organisations. Currently there is a lack of rigorous empirical studies which are theory and evidence based to provide a sound basis for understanding IT green best practices and how these can be best adopted in organisations. This special issue of the AJIS contributes this current gap in the knowledge concerning green IS and IT with five empirical research papers which examined five different aspects of green IS and IT.

Some critical issues in special needs education as they relate to ...

African Journals Online (AJOL)

The study examines five critical issues in special education as they relate to visual impairment vis a vis mercy killing (euthanasia), gender, seclusion, castration and genetic engineering. Literature in the five stated issues was reviewed to provide an insight into these areas with particular reference to visual impairment.

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.

Special Issue: 3D Printing for Biomedical Engineering.

Science.gov (United States)

Chua, Chee Kai; Yeong, Wai Yee; An, Jia

2017-02-28

Three-dimensional (3D) printing has a long history of applications in biomedical engineering. The development and expansion of traditional biomedical applications are being advanced and enriched by new printing technologies. New biomedical applications such as bioprinting are highly attractive and trendy. This Special Issue aims to provide readers with a glimpse of the recent profile of 3D printing in biomedical research.

Special Issue Dedication to Stephen H. Schneider

Directory of Open Access Journals (Sweden)

Paul Baer

2011-12-01

Full Text Available It is with both pleasure and sadness that we dedicate this special climate change issue of Portal to the late Dr. Stephen H. Schneider. Steve, as he was known to his friends and colleagues, was as rare a bird as any he sought out in his passion as a birdwatcher. A brilliant climate scientist, author of countless books and papers, path breaking inter-disciplinarian, eminent public communicator, mentor to dozens of young scholars; the list of roles and adulatory adjectives could fill an IPCC special report. Steve would have appreciated this special issue, with its multidisciplinary approach, and its quest for solutions based on analytical scholarship. He understood better than most the inseparability of normative and descriptive concerns, the need for academics and scientists of all kinds to be involved with public processes of communication, policy design and deliberation. While his last book was called “Science as a Contact Sport,” the unspoken title of his career might have been “Science as a Public Service.” He was endlessly testifying, consulting and giving interviews, and encouraged others to learn to do the same. Notwithstanding a battle with lymphoma in the last decade (chronicled in the wonderful book The Patient from Hell, Steve maintained a frenetic level of activity and was still going strong when he was felled by a pulmonary embolism in July of 2010 at age 65. He leaves behind a legacy embodied in his publications, institutions like the IPCC and the journal Climatic Change, and in the hearts and minds of the countless persons he interacted with, mentored, and loved. Exuberant, passionate, full of warmth and good humor, Steve was a mensch among mensches. He will be sorely missed. Paul Baer, with the assistance of Terry Root and Ian McGregor.

Islamic Education, Possibilities, Opportunities and Tensions: Introduction to the Special Issue

Science.gov (United States)

Waghid, Yusef; Davids, Nuraan

2014-01-01

If Islam continues to evoke skepticism, as it has done most intensely since 9/11, then it stands to reason that its tenets and education are viewed with equal mistrust, and as will be highlighted in this special issue, equal misunderstanding. The intention of this special edition is neither to counter the accusations Islam stands accused of, nor…

Inferentialism in mathematics education : introduction to a special issue

NARCIS (Netherlands)

Bakker, Arthur; Hußmann, Stephan

2017-01-01

Inferentialism, as developed by the philosopher Robert Brandom (1994, 2000), is a theory of meaning. The theory has wide-ranging implications in various fields but this special issue concentrates on the use and content of concepts. The key idea, relevant to mathematics education research, is that

Preface : Special Issue on Physical Movements and Playful Interaction

NARCIS (Netherlands)

Nijholt, Antinus; Nijholt, A.; Reidsma, D.; Reidsma, Dennis; Unknown, [Unknown

2010-01-01

This Special Issue of IJART is devoted to the 3rd International Conference on Intelligent Technologies for Interactive Entertainment (INTETAIN 09). This 3rd conference was held in Amsterdam, the Netherlands, in June 2009. It was organized by the Human Media Interaction (HMI) department of the

Foreword: Special issue devoted to the ESSDERC'07 conference

NARCIS (Netherlands)

Thewes, Roland; Schmitz, Jurriaan; Schmitz, J.

2008-01-01

This special issue of Solid-State Electronics is dedicated to topics discussed during the 37th European Solid-State Device Research Conference (ESSDERC) held in Munich in September 2007. It comprises seven plenary and invited papers written by eminent experts as well as 23 full-length contributed

Purchasing & supply management for a sustainable world: Introduction to the IPSERA 2013 conference special issue

DEFF Research Database (Denmark)

Johnsen, T. E.; Giannakis, M.; Miemczyk, J.

2014-01-01

Special issue of best papers of the 22nd annual IPSERA conference 2013: Purchasing & Supply Management for a Sustainable World......Special issue of best papers of the 22nd annual IPSERA conference 2013: Purchasing & Supply Management for a Sustainable World...

Psychosocial Studies of Migration and Community: Introduction to the Special Issue

OpenAIRE

Douglas D. Perkins; Neal A. Palmer; Manuel García-Ramírez

2011-01-01

Introducing the special issue on psychosocial studies of migration and community, we briefly reflect on the global increase in, and issues related to, both international and domestic migration, particularly from rural areas of less developed countries, which has fueled rapid urbanization and intercultural tensions in both post-industrial and developing countries. Topics covered in the issue are summarized, including an Italian study of the emotional impact of discrimination against immigrant ...

Special Issue on Gender and Writing | Gender and literacy issues and research: Placing the spotlight on writing

Directory of Open Access Journals (Sweden)

Judy M. Parr

2012-03-01

Full Text Available In this introduction to a special issue of the Journal of Writing Research, we review four decades of research, bringing writing to the forefront in conversations devoted to gender and literacy. We identify the impetus for much of the research on gender and writing and situate the four articles in this special issue within three themes: gender patterns in what and how students write, cognitive and socio-cultural factors influencing gender differences in student writing, and attempts to provide alternatives to stereotypical gender patterns in student writing. These interdisciplinary themes, further developed within the four articles, underscore the need to consider gender as a complex social, cognitive and linguistic characteristic of both reading and writing.

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.

Introduction to This Special Issue on Transnational HCI

DEFF Research Database (Denmark)

Shklovski, Irina; Vertesi, Janet; Lindtner, Silvia

2014-01-01

It is not surprising that HCI researchers are attracted to the role of technology in global processes as many of us already live inherently transnational lives. While the notion of global connectedness is hardly new, the issues that confront us are more than specific concerns for remote migration......, distributed work, or developing nations. Rather, we argue that transnational HCI is a contemporary condition of the design and use of technological systems, both at home and abroad. This special issue of Human-Computer Interaction is dedicated to exploring how and why a transnational lens matters to the study......, design, and development of computational systems. We consider this theoretical perspective in terms of both present technology use to construct and manage transnational relations and processes, and the possibilities such a lens opens for future research and design. The papers in this issue contribute...

Introduction to This Special Issue on Context-Aware Computing.

Science.gov (United States)

Moran, Thomas P.; Dourish, Paul

2001-01-01

Discusses pervasive, or ubiquitous, computing; explains the notion of context; and defines context-aware computing as the key to disperse and enmesh computation into our lives. Considers context awareness in human-computer interaction and describes the broad topic areas of the essays included in this special issue. (LRW)

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

Introduction to the Special Issue “Sport for Social Inclusion: Critical Analyses and Future Challenges”

Directory of Open Access Journals (Sweden)

Reinhard Haudenhuyse

2015-06-01

Full Text Available “Sport for Social Inclusion: Critical Analyses and Future Challenges” brings together a unique collection of papers on the subject of sport and social inclusion. The special issue can be divided into three major parts. The first part consists of three papers tacking on a broad perspective on sport and social exclusion, with specific attention to austerity policies, sport-for-change and exclusion in youth sports. The second part of the special issue tackles specific themes (e.g., group composition and dynamics, volunteering, physical education, youth work, equality, public health and groups (e.g., people with disabilities, disadvantaged girls, youth in society in relation to sport and social exclusion. The third part consists of three papers that are related to issues of multiculturalism, migration and social inclusion. The special issue is further augmented with a book review on Mike Collins and Tess Kay’s Sport and social exclusion (2nd edition and a short research communication. The editors dedicate the special issue to Mike Collins (deceased.

Special Issue: 3D Printing for Biomedical Engineering

Directory of Open Access Journals (Sweden)

Chee Kai Chua

2017-02-01

Full Text Available Three-dimensional (3D printing has a long history of applications in biomedical engineering. The development and expansion of traditional biomedical applications are being advanced and enriched by new printing technologies. New biomedical applications such as bioprinting are highly attractive and trendy. This Special Issue aims to provide readers with a glimpse of the recent profile of 3D printing in biomedical research.

SSDL Newsletter, No. 58 (Special Issue), June 2010

International Nuclear Information System (INIS)

2010-06-01

This is a Special Issue of the SSDL Newsletter. The original idea is to highlight the 40th anniversary of the IAEA/WHO TLD postal dose audit service. After forty years of operation, the service has verified the calibration of approximately 8000 radiotherapy beams in about 1700 hospitals worldwide. Several hundreds of dosimetry deviations have been identified and reconciled, thus avoiding potential dose misadministration to patients

A linear graph for digoxin radioimmunoassay

International Nuclear Information System (INIS)

Smith, S.E.; Richter, A.

1975-01-01

The determination of drug or hormone concentrations by radio-immunoassay involves interpolation of values for radioisotope counts within standard curves, a technique which requires some dexterity in curve drawing and which results in some inaccuracy in practice. Most of the procedures designed to overcome these difficulties are complex and time-consuming. In radioimmunoassays involving saturation of the antibody-binding sites a special case exists in that the bound radioactivity is directly proportional to the specific activity of the ligand in the system. Thus a graph of the ratio of radioactivity bound in the absence to that in the presence of added non-radioactive ligand is linear against the concentration of added ligand (Hales,C.N., and Randle, P.J., 1963, Biochem. J., vol. 88, 137). A description is given of a simple and convenient modification of their method, and its application to the routine clinical determination of digoxin using a commercial kit (Lanoxitest β digoxin radioimmunoassay kit, Wellcome Reagents Ltd.). Specially constructed graph paper, which yields linearity with standard solutions, was designed so that it could be used directly without data transmission. The specific activity function appears as the upper arithmetical horizontal scale; corresponding values of the concentration of non-radioactive ligand in the solution added were individually calculated and appear on the lower scale opposite the appropriate values of the upper scale. The linearity of the graphs obtained confirmed that binding of digoxin was approximately constant through the range of clinical concentrations tested (0.5 to 8ng/ml), although binding declined slightly at higher concentrations. (U.K.)

Special Issue: Outcome of Anorexia Nervosa with Teenage Onset.

Science.gov (United States)

Casper, Regina C., Ed.

1996-01-01

The articles of this special issue report on studies of the outcomes of treatment of adolescent anorexia nervosa. These studies leave no doubt about the mortality risk and debilitating nature of chronic anorexia nervosa, but they do suggest that the prognosis, given expert treatment, is favorable for the most part. (SLD)

Special issue of Higher-Order and Symbolic Computation

DEFF Research Database (Denmark)

solicited from papers presented at ASIAPEPM 02, the 2002 SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation [1]. The four articles were subjected to the usual process of journal reviewing. "Cost-Augmented Partial Evaluation of Functional Logic Programs" extends previous......The present issue is dedicated to Partial Evaluation and Semantics-Based Program Manipulation. Its first two articles were solicited from papers presented at PEPM 02, the 2002 ACMSIGPLANWorkshop on Partial Evaluation and Semantics-Based Program Manipulation [2], and its last two articles were...... narrowing-driven techniques of partial evaluation for functional-logic programs by the inclusion of abstract computation costs into the partial-evaluation process. A preliminary version of this work was presented at PEPM 02. "Specialization Scenarios: A Pragmatic Approach to Declaring Program Specialization...

Special issue call for papers from Business Systems Research Journal

OpenAIRE

Pejić Bach, Mirjana

2011-01-01

A special issue oft he Business Systems Research Journal with extended versions of selected papers from the 11th International Symposium on Operations Research in Slovenia (SOR’11) will be published under the journal ‘s publishing standards.

Introduction to special issue on the ecology of clonal plants

Czech Academy of Sciences Publication Activity Database

Gross, K. L.; Herben, T.; Klimešová, Jitka

2017-01-01

Roč. 52, 3-4 (2017), s. 265-267 ISSN 1211-9520 Institutional support: RVO:67985939 Keywords : Introduction to special issue * clonal plants * clonal meeting Subject RIV: EH - Ecology, Behaviour OBOR OECD: Ecology Impact factor: 1.017, year: 2016

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.

Special issues as criterion for journal quality evaluation: Letter to editor

Directory of Open Access Journals (Sweden)

Dadkhah Mehdi

2015-01-01

Full Text Available Predatory publishers are defined as publishers who have financial goals. This definition was introduced for the first time by Jeffrey Beall (2012. In some predatory publishers, we can find some papers that are not related to journal's aim and scope. These journals create special issues in order to publish papers that are not related to journal's aim and scope. Thus, we are faced with a question of how the editor of these journals could evaluate these papers. In some trusted journals, editor invites guest editors for special issues, which are related to journal's aim and scope. On the other hand predatory publishers, publish papers without any external reviewers or guest editors. In addition, some journals that publish irrelevant papers in regular issues are also found. This problem can be seen especially in some biological or life science journals. It seems that these problems pose new challenge for the academic world.

1. Introduction to the special issue on “Gastronomy and Revolution”

Directory of Open Access Journals (Sweden)

Manuela Albertone

2016-04-01

Full Text Available This number of our Journal is again a special, thematic issue, that brings to our readers the results of the Call on “Gastronomy and Revolution”, that we announced in 2014, and of the 2015 Seminar that followed the Call. In these few pages, we would like to provide a brief introduction to the theme of the issue.

Support of Publication Costs, Atlantic Meridional Overturning Circulation Special Issue of Deep Sea Research II Journal

Energy Technology Data Exchange (ETDEWEB)

Amy Honchar

2012-11-12

The contribution of funds from DOE supported publication costs of a special issue of Deep Sea Research arising from presentations at the First U.S. Atlantic Meridional Overturning Circulation (AMOC) Meeting held 4-6 May, 2009 to review the US implementation plan and its coordination with other monitoring activities. The special issue includes a total of 16 papers, including publications from three DOE-supported investigators (ie Sevellec, F., and A.V. Fedorov; Hu et. al., and Wan et. al.,). The special issue addresses DOE interests in understanding and simulation/modeling of abrupt climate change.

INTRODUCTION TO THE SPECIAL ISSUE ON COMBAT SPORT

Directory of Open Access Journals (Sweden)

Andrew M. Lane

2006-07-01

Full Text Available Combat Sports Special Issue Editorial INTRODUCTION TO THE SPECIAL ISSUE ON COMBAT SPORT The World heavyweight professional boxing championship is arguable the biggest prize in sport. Why is this the case? It is not just the glamour that is appealing, but also the intriguing appeal of two combatants in a fixed environment. All combat sports share this similarity and in doing so, combat sports become appealing for spectators to watch, provide competitors with their ultimate challenge, and provide sport scientists and medics with a rich environment to apply their work. The role of research and theory driven interventions is key to the credibility of sport science and sports medicine. An intervention and/or treatment must be based on sound reason and the effects should be considered beforehand, both positive and negative. Equally, the nature of combat sport, where the aim is to strike, throw, or grapple with an opponent which can lead to injury, invariably raises questions on whether it is morally acceptable for these activities to be called a sport. Therefore, thorough investigation of the nature of medical issues is needed. The case for banning boxing in inextricably linked to the notion that the aim of the sport is to cause harm to the opponent; if harm was minimized and injury became less of an injury, the case for banning boxing would be weak. Quite clearly there are a plethora of arguments that point to a need for theory driven research in combat sport, and plugging this gap in the literature is an aim of this special issue of the Journal of Sports Science and Medicine. Possibly the most convincing argument for me to get involved in driving this issue stems from experiences in applied work with professional boxers (Hall and Lane, 2001; Lane and Hall, 2003, amateur boxers (Lane, 2002, kickboxers (Lane, et al., 1999 and tae-kwon-do athletes (Chapman et al., 1997 in which a raft of situations and issues were presented that required answers based

Significance evaluation in factor graphs

DEFF Research Database (Denmark)

Madsen, Tobias; Hobolth, Asger; Jensen, Jens Ledet

2017-01-01

in genomics and the multiple-testing issues accompanying them, accurate significance evaluation is of great importance. We here address the problem of evaluating statistical significance of observations from factor graph models. Results Two novel numerical approximations for evaluation of statistical...... significance are presented. First a method using importance sampling. Second a saddlepoint approximation based method. We develop algorithms to efficiently compute the approximations and compare them to naive sampling and the normal approximation. The individual merits of the methods are analysed both from....... Conclusions The applicability of saddlepoint approximation and importance sampling is demonstrated on known models in the factor graph framework. Using the two methods we can substantially improve computational cost without compromising accuracy. This contribution allows analyses of large datasets...

Special issue on electron cyclotron wave physics, technology, and applications - Part 2

International Nuclear Information System (INIS)

Uckan, Nermin A.

2008-01-01

This issue of Fusion Science and Technology (FS and T) contains a compendium of full-length, peer-reviewed papers on electron cyclotron (EC) wave physics, technology, and applications on magnetically confined plasmas. The interest in this special issue started with a simple question from a single individual who asked if he could submit for publication in FS and T his paper ''ITER ECH Front Steering Upper Launcher,'' parts of which he was planning to present at the 14th Joint Workshop on Electron Cyclotron Emission and Electron Cyclotron Resonance Heating, Santorini Island, Greece, May 2006. Such interest quickly grew, and the decision was made to offer the same opportunity to other workshop participants as well as to other interested researchers from around the world to contribute to a special FS and T issue on EC wave physics, technology, and applications. The person who started this ''wave'' of interest is no other than Dr. Mark Henderson, who was later drafted and kindly agreed to serve as the guest editor for this issue. The worldwide research program on EC wave physics, technology, and applications has shown impressive progress over the past couple of years, and much of this progress is reflected in the fifty or so papers that are included in this two-part special issue - part 1 in August 2007 and part 2 in January 2008. To complement the contributed papers, several informative reviews, which will be valuable for years to come, were also invited and are included. These review papers provide an objective summary of the current state of the art in EC emission research, theory of EC waves, EC heating and current drive experiments, gyrotron development, launcher development, and transmission systems. In preparation for ITER, this special issue is timely and should be of interest to those already working in the field and to the new generation of scientists and engineers who will be the ones to design, build, and carry out experiments on ITER. We extend our

Introduction to the Special Issue on “Optomechatronics”

Directory of Open Access Journals (Sweden)

Alexander W. Koch

2014-03-01

Full Text Available The field of optomechatronics combines the synergistic effects of optics, mechanics and electronics for efficient sensor development. Optical sensors for the measurement of mechanical quantities, equipped with appropriate electronic signal (preprocessing have a wide range of applications, from surface testing, stress monitoring, and thin film analysis to biochemical sensing. The aim of this special issue is to provide an overview of current research and innovative applications of optomechatronics in sensors.

BRAIN JOURNAL - PREFACE (OF THE FIRST SPECIAL ISSUE)

OpenAIRE

Bogdan Patrut

2010-01-01

BRAIN. Broad Research in Artificial Intelligence and Neuroscience, ISSN 2067-3957, Volume 1, July 2010, Special Issue on Complexity in Sciences and Artificial Intelligence Editors • Barna Iantovics, Petru Maior University, Targu Mures, Romania • Dumitru Rădoiu, Petru Maior University, Targu Mures, Romania • Marius Măruşteri, Universiy of Medicine and Pharmacy, Targu Mures, Romania • Matthias Dehmer, Institute for Bioinformatics and Translational Research, The Health and Life Scien...

A Ranking Approach on Large-Scale Graph With Multidimensional Heterogeneous Information.

Science.gov (United States)

Wei, Wei; Gao, Bin; Liu, Tie-Yan; Wang, Taifeng; Li, Guohui; Li, Hang

2016-04-01

Graph-based ranking has been extensively studied and frequently applied in many applications, such as webpage ranking. It aims at mining potentially valuable information from the raw graph-structured data. Recently, with the proliferation of rich heterogeneous information (e.g., node/edge features and prior knowledge) available in many real-world graphs, how to effectively and efficiently leverage all information to improve the ranking performance becomes a new challenging problem. Previous methods only utilize part of such information and attempt to rank graph nodes according to link-based methods, of which the ranking performances are severely affected by several well-known issues, e.g., over-fitting or high computational complexity, especially when the scale of graph is very large. In this paper, we address the large-scale graph-based ranking problem and focus on how to effectively exploit rich heterogeneous information of the graph to improve the ranking performance. Specifically, we propose an innovative and effective semi-supervised PageRank (SSP) approach to parameterize the derived information within a unified semi-supervised learning framework (SSLF-GR), then simultaneously optimize the parameters and the ranking scores of graph nodes. Experiments on the real-world large-scale graphs demonstrate that our method significantly outperforms the algorithms that consider such graph information only partially.

Taking Development Seriously: Critique of the 2008 "JME" Special Issue on Moral Functioning

Science.gov (United States)

Gibbs, John C.; Moshman, David; Berkowitz, Marvin W.; Basinger, Karen S.; Grime, Rebecca L.

2009-01-01

This essay comments on articles comprising a "Journal of Moral Education" Special Issue (September, 2008, 37[3]). The issue was intended to honour the 50th anniversary of Lawrence Kohlberg's doctoral dissertation and his subsequent impact on the field of moral development and education. The articles were characterised by the Issue editor (Don…

Guest editorial preface : Special Issue on Advances in Computer Entertainment

NARCIS (Netherlands)

Nijholt, Anton; Romão, Teresa; Cheok, Adrian D.

2013-01-01

This special issue of the International Journal of Creative Interfaces and Computer Graphics contains a selection of papers from ACE 2012, the 9th International Conference on Advances in Computer Entertainment (Nijholt et al., 2012). ACE is the leading scientific forum for dissemination of

Conceptual Metaphor and Embodied Cognition in Science Learning: Introduction to Special Issue

Science.gov (United States)

Amin, Tamer G.; Jeppsson, Fredrik; Haglund, Jesper

2015-01-01

This special issue of "International Journal of Science Education" is based on the theme "Conceptual Metaphor and Embodied Cognition in Science Learning." The idea for this issue grew out of a symposium organized on this topic at the conference of the European Science Education Research Association (ESERA) in September 2013.…

Finding shortest non-trivial cycles in directed graphs on surfaces

Directory of Open Access Journals (Sweden)

Sergio Cabello

2016-04-01

Full Text Available Let $D$ be a weighted directed graph cellularly embedded in a surface of genus $g$, orientable or not, possibly with boundary.  We describe algorithms to compute shortest non-contractible and shortest surface non-separating cycles in $D$, generalizing previous results that dealt with undirected graphs.Our first algorithm computes such cycles in $O(n^2\\log n$ time, where $n$ is the total number of vertices and edges of $D$, thus matching the complexity of the best general algorithm in the undirected case.  It revisits and extends Thomassen's 3-path condition; the technique applies to other families of cycles as well.We also provide more efficient algorithms in special cases, such as graphs with small genus or bounded treewidth, using a divide-and-conquer technique that simplifies the graph while preserving the topological properties of its cycles.  Finally, we give an efficient output-sensitive algorithm, whose running time depends on the length of the shortest non-contractible or non-separating cycle.

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.

EDITORIAL: Special Issue on advanced and emerging light sources Special Issue on advanced and emerging light sources

Science.gov (United States)

Haverlag, Marco; Kroesen, Gerrit; Ferguson, Ian

2011-06-01

The papers in this special issue of Journal of Physics D: Applied Physics (JPhysD) originate from the 12th International Symposium on the Science and Technology of Light Sources and the 3rd International Conference on White LEDs and Solid State Lighting, held 11-16 July 2010 at Eindhoven University. Abstracts of all papers presented at this combined conference were published in the Conference Proceedings LS-WLED 2010 by FAST-LS, edited by M Haverlag, G M W Kroesen and T Taguchi. Special issues of the previous three LS conferences have been well-cited and have proven to be an important source of information for the lighting community. The 2010 LS-Symposium was a combined conference with the White LED Conference in order to enhance the scope of this conference series towards new light source technologies such as LEDs and OLEDs, and this co-operation will be continued in the future. Given the faster technology development in these areas it was also decided to shorten the interval between conferences from three to two years. Well over 200 invited presentations, landmark presentations and poster contributions were presented at the 2010 LS-Symposium. The organizing committee have selected from these a number of outstanding contributions with a high technological content and invited the authors to submit a full paper in JPhysD. The criteria were that the work should not be a repetition of the work already published in the Proceedings, but should be new, complete, within the scope of JPhysD, and meeting the normal quality standards of this journal. After peer review a combined set of 18 papers is published in this JPhysD special issue. In addition, a number of lighting-application-orientated papers will be published in a special issue of Journal of Light & Visual Environment later in 2011. The papers in this special issue of JPhysD show that research in the science and technology of light sources still covers a broad set of subject areas which includes both 'classical

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.

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

Effects of the euro changeover on consumer behaviour: Introduction to the special issue

DEFF Research Database (Denmark)

Gärling, Tommy; Thøgersen, John

2007-01-01

This paper introduces the special issue "Effects of the euro changeover on consumer behaviour" by briefly reviewing the contents of the included papers. The introduction follows the organization of the papers in three sections each focusing on a common set of issues. In the first section, research...... revealing the perceived and actual problems consumers face after the euro changeover is described. Research illuminating learning and adaptation to the euro changeover is the focus of the second section. A special problem is the misperception of inflation after the euro changeover. Research on this problem...

Mapping Between Semantic Graphs and Sentences in Grammar Induction System

Directory of Open Access Journals (Sweden)

Laszlo Kovacs

2010-06-01

Full Text Available The proposed transformation module performs mapping be-
tween two di®erent knowledge representation forms used in grammar induction systems. The kernel knowledge representation form is a special predicate centered conceptual graph called ECG. The ECG provides a semantic-based, language independent description of the environment. The other base representation form is some kind of language. The sentences of the language should meet the corresponding grammatical rules. The pilot project demonstrates the functionality of a translator module using this transformation engine between the ECG graph and the Hungarian language.

Special issue on advances in computer entertainment: editorial

OpenAIRE

Romão, T.; Romão, Teresa; Nijholt, Antinus; Cheok, J.D.; Cheok, Adrian David

2015-01-01

This special issue of the International Journal of Arts and Technology comprises a selection of papers from ACE 2012, the 9th International Conference on Advances in Computer Entertainment (Nijholt et al., 2012). ACE is the leading scientific forum for dissemination of cutting-edge research results in the area of entertainment computing. The main goal of ACE is to stimulate discussion in the development of new and compelling entertainment computing and interactive art concepts and application...

Introduction to a special issue on genotype by environment interaction

Science.gov (United States)

Expression of a phenotype is a function of the genotype, the environment, and the differential sensitivity of certain genotypes to different environments, also known as genotype by environment (G × E) interaction. This special issue of Crop Science includes a collection of manuscripts that reviews t...

Overview on the ‘Atmospheric Emissions from Volcanoes’ Special Issue

Directory of Open Access Journals (Sweden)

Shona Mackie

2015-02-01

Full Text Available The session ‘Atmospheric Emissions from Volcanoes’ formed part of the 2014 General Assembly of the Europe-an Geosciences Union (EGU, held in Vienna from 27 April to 2 May. This special issue presents some of the work that was discussed during the session. [...

Entrepreneurial activity and regional development: an introduction to this special issue

Directory of Open Access Journals (Sweden)

Maribel Guerrero

2013-01-01

Full Text Available The main objective of this special issue is to analyze the relationship between entrepreneurial intention and entrepreneurial activity and its impact on regional development. The last convulsive decade, with expansionary and recessionary economic cycles, offers a good opportunity to study how economic cycles affect the propensity of becoming an entrepreneur and, in turn, to observe how entrepreneurial activity contributes to change (improvement in the economy.Previous studies have analyzed the complicated endogenous relationship between entrepreneurship and economic growth, but these studies have examined the countries’ performance under a static view. This special issue focuses on analyzing complex entrepreneurial behavior from a sub-national perspective (examining several regions in the Spanish autonomous communities and a dynamic view (using data from several years, which adds rigor and valuable knowledge to this research field.

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

Introduction to the special issue 'unintended effects of international cooperation'.

Science.gov (United States)

Koch, Dirk-Jan; Schulpen, Lau

2018-06-01

The 'Evaluation and Program Planning' journal has contributed to the launch of an academic discussion of unintended effects of international cooperation, notably by publishing in 2016 articles by Bamberger, Tarsilla, & Hesse-Biber and by Jabeen. This special issue aims to take up the academic challenges as laid down by those authors, by providing among others a clear typology and applying it, by outlining various methodological options and testing them, and elaborating on suggestions on how to deal with the barriers that prevent unintended effects being taken into account. This special issue makes clear that it is possible to reduce the share of unforeseen effects of international cooperation. Turning the spotlight on unintended effects that can be anticipated, and aiming to make progress on uncovering those that are particularly difficult to detect and debunking those that are exaggerated is the task that lies ahead of us. Copyright © 2017 Elsevier Ltd. All rights reserved.

Introduction to the Special Issue on Clinical Neuropsychology of Movement Disorders.

Science.gov (United States)

Tröster, Alexander I

2017-11-01

The special issue on the clinical neuropsychology of movement disorders provides an overview for the non-subspecialist clinical neuropsychologist and other clinical neuroscientists of the neuropsychological features, assessment and treatment of Parkinson's disease and Lewy body dementias, atypical parkinsonian disorders (corticobasal syndrome, progressive supranuclear palsy, and multiple system atrophy), Huntington's disease, dystonia, and amyotrophic lateral sclerosis. Additionally, articles provide overviews of neuropsychological and ethical issues related to deep brain stimulation and a discussion of non-pharamcologic and non-invasive treatment of cognitive dysfunction in Parkinson's disease. A search of PubMed using neuropsycholog* and parkinson* as search terms indicates that the number of articles dealing with neuropsychology of parkinsonian disorders has more than doubled in each of the past three decades (1990-99:269 entries, 2000-09:575 entries, 2010-17:967 entries). This rapid growth of research makes a special issue on the topic very timely. © The Author 2017. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Editorial Special Issue on Fluid Mechanics and Fluid Power (FMFP ...

Indian Academy of Sciences (India)

This special issue of Sadhana contains selected papers from two conferences related to fluid mechanics held in India recently, Fluid Mechanics and Fluid Power conference at NIT, Hamirpur, and an International Union of Theoretical ... A simple, well thought out, flow visualization experiment or a computation can sometimes ...

Special Issue: Honey Bee Viruses

Directory of Open Access Journals (Sweden)

Sebastian Gisder

2015-10-01

Full Text Available Pollination of flowering plants is an important ecosystem service provided by wild insect pollinators and managed honey bees. Hence, losses and declines of pollinating insect species threaten human food security and are of major concern not only for apiculture or agriculture but for human society in general. Honey bee colony losses and bumblebee declines have attracted intensive research interest over the last decade and although the problem is far from being solved we now know that viruses are among the key players of many of these bee losses and bumblebee declines. With this special issue on bee viruses we, therefore, aimed to collect high quality original papers reflecting the current state of bee virus research. To this end, we focused on newly discovered viruses (Lake Sinai viruses, bee macula-like virus, or a so far neglected virus species (Apis mellifera filamentous virus, and cutting edge technologies (mass spectrometry, RNAi approach applied in the field.

Special Issue: Honey Bee Viruses

Science.gov (United States)

Gisder, Sebastian; Genersch, Elke

2015-01-01

Pollination of flowering plants is an important ecosystem service provided by wild insect pollinators and managed honey bees. Hence, losses and declines of pollinating insect species threaten human food security and are of major concern not only for apiculture or agriculture but for human society in general. Honey bee colony losses and bumblebee declines have attracted intensive research interest over the last decade and although the problem is far from being solved we now know that viruses are among the key players of many of these bee losses and bumblebee declines. With this special issue on bee viruses we, therefore, aimed to collect high quality original papers reflecting the current state of bee virus research. To this end, we focused on newly discovered viruses (Lake Sinai viruses, bee macula-like virus), or a so far neglected virus species (Apis mellifera filamentous virus), and cutting edge technologies (mass spectrometry, RNAi approach) applied in the field. PMID:26702462

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.

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

Faucet: streaming de novo assembly graph construction.

Science.gov (United States)

Rozov, Roye; Goldshlager, Gil; Halperin, Eran; Shamir, Ron

2018-01-01

We present Faucet, a two-pass streaming algorithm for assembly graph construction. Faucet builds an assembly graph incrementally as each read is processed. Thus, reads need not be stored locally, as they can be processed while downloading data and then discarded. We demonstrate this functionality by performing streaming graph assembly of publicly available data, and observe that the ratio of disk use to raw data size decreases as coverage is increased. Faucet pairs the de Bruijn graph obtained from the reads with additional meta-data derived from them. We show these metadata-coverage counts collected at junction k-mers and connections bridging between junction pairs-contain most salient information needed for assembly, and demonstrate they enable cleaning of metagenome assembly graphs, greatly improving contiguity while maintaining accuracy. We compared Fauceted resource use and assembly quality to state of the art metagenome assemblers, as well as leading resource-efficient genome assemblers. Faucet used orders of magnitude less time and disk space than the specialized metagenome assemblers MetaSPAdes and Megahit, while also improving on their memory use; this broadly matched performance of other assemblers optimizing resource efficiency-namely, Minia and LightAssembler. However, on metagenomes tested, Faucet,o outputs had 14-110% higher mean NGA50 lengths compared with Minia, and 2- to 11-fold higher mean NGA50 lengths compared with LightAssembler, the only other streaming assembler available. Faucet is available at https://github.com/Shamir-Lab/Faucet. rshamir@tau.ac.il or eranhalperin@gmail.com. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press.

2008 Special NSREC Issue of the IEEE Transactions on Nuclear Science Comments by the Editors

Science.gov (United States)

Schwank, Jim; Buchner, Steve; Marshall, Paul; Duzellier, Sophie; Brown, Dennis; Poivey, Christian; Pease, Ron

2008-12-01

The December 2008 special issue of the IEEE Transactions on Nuclear Science contains selected papers from the 45th annual IEEE International Nuclear and Space Radiation Effects Conference (NSREC) held in Tucson, Arizona, July 14 - 18, 2008. Over 115 papers presented at the 2008 NSREC were submitted for consideration for this year's special issue. Those papers that appear in this special issue were able to successfully complete the review process before the deadline for the December issue. A few additional papers may appear in subsequent issues of the TRANSACTIONS. This publication is the premier archival journal for research on space and nuclear radiation effects in materials, devices, circuits, and systems. This distinction is the direct result of the conscientious efforts of both the authors, who present and document their work, and the reviewers, who selflessly volunteer their time and talent to help review the manuscripts. Each paper in this journal has been reviewed by experts selected by the editors for their expertise and knowledge of the particular subject areas.

Reactome graph database: Efficient access to complex pathway data

Science.gov (United States)

Korninger, Florian; Viteri, Guilherme; Marin-Garcia, Pablo; Ping, Peipei; Wu, Guanming; Stein, Lincoln; D’Eustachio, Peter

2018-01-01

Reactome is a free, open-source, open-data, curated and peer-reviewed knowledgebase of biomolecular pathways. One of its main priorities is to provide easy and efficient access to its high quality curated data. At present, biological pathway databases typically store their contents in relational databases. This limits access efficiency because there are performance issues associated with queries traversing highly interconnected data. The same data in a graph database can be queried more efficiently. Here we present the rationale behind the adoption of a graph database (Neo4j) as well as the new ContentService (REST API) that provides access to these data. The Neo4j graph database and its query language, Cypher, provide efficient access to the complex Reactome data model, facilitating easy traversal and knowledge discovery. The adoption of this technology greatly improved query efficiency, reducing the average query time by 93%. The web service built on top of the graph database provides programmatic access to Reactome data by object oriented queries, but also supports more complex queries that take advantage of the new underlying graph-based data storage. By adopting graph database technology we are providing a high performance pathway data resource to the community. The Reactome graph database use case shows the power of NoSQL database engines for complex biological data types. PMID:29377902

Reactome graph database: Efficient access to complex pathway data.

Directory of Open Access Journals (Sweden)

Antonio Fabregat

2018-01-01

Full Text Available Reactome is a free, open-source, open-data, curated and peer-reviewed knowledgebase of biomolecular pathways. One of its main priorities is to provide easy and efficient access to its high quality curated data. At present, biological pathway databases typically store their contents in relational databases. This limits access efficiency because there are performance issues associated with queries traversing highly interconnected data. The same data in a graph database can be queried more efficiently. Here we present the rationale behind the adoption of a graph database (Neo4j as well as the new ContentService (REST API that provides access to these data. The Neo4j graph database and its query language, Cypher, provide efficient access to the complex Reactome data model, facilitating easy traversal and knowledge discovery. The adoption of this technology greatly improved query efficiency, reducing the average query time by 93%. The web service built on top of the graph database provides programmatic access to Reactome data by object oriented queries, but also supports more complex queries that take advantage of the new underlying graph-based data storage. By adopting graph database technology we are providing a high performance pathway data resource to the community. The Reactome graph database use case shows the power of NoSQL database engines for complex biological data types.

Reactome graph database: Efficient access to complex pathway data.

Science.gov (United States)

Fabregat, Antonio; Korninger, Florian; Viteri, Guilherme; Sidiropoulos, Konstantinos; Marin-Garcia, Pablo; Ping, Peipei; Wu, Guanming; Stein, Lincoln; D'Eustachio, Peter; Hermjakob, Henning

2018-01-01

Reactome is a free, open-source, open-data, curated and peer-reviewed knowledgebase of biomolecular pathways. One of its main priorities is to provide easy and efficient access to its high quality curated data. At present, biological pathway databases typically store their contents in relational databases. This limits access efficiency because there are performance issues associated with queries traversing highly interconnected data. The same data in a graph database can be queried more efficiently. Here we present the rationale behind the adoption of a graph database (Neo4j) as well as the new ContentService (REST API) that provides access to these data. The Neo4j graph database and its query language, Cypher, provide efficient access to the complex Reactome data model, facilitating easy traversal and knowledge discovery. The adoption of this technology greatly improved query efficiency, reducing the average query time by 93%. The web service built on top of the graph database provides programmatic access to Reactome data by object oriented queries, but also supports more complex queries that take advantage of the new underlying graph-based data storage. By adopting graph database technology we are providing a high performance pathway data resource to the community. The Reactome graph database use case shows the power of NoSQL database engines for complex biological data types.

A New Urban Agenda: Introduction to the Special Issue on “Sustainable Urban Development”

Directory of Open Access Journals (Sweden)

Steffen Lehmann

2015-07-01

Full Text Available Since the start of the 21st century, humanity has been a predominantly urban species. This Special Issue is about the future of cities and how urbanization will develop when based on principles of sustainability. It explores the underlying dimensions of the transformation of existing cities and the design of low carbon green precincts and their urban systems. The view of the papers presented in this Special Issue is holistic and takes questions of social sustainability into account. This editorial highlights the contents and methodologies of 13 selected papers, while presenting diverse issues in strategies, concepts and policies for sustainable urban development.

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.

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

Special issue on Modern Trends in Inorganic Chemistry (MTIC-XV ...

Indian Academy of Sciences (India)

This Special Issue is based on the contributions from the invited speakers of the. Fifteenth Symposium on Modern Trends in Inorganic Chemistry (MTIC-XV) held at the Indian Institute of Technology, Roorkee during 13–16, December 2013. The MTIC series of biennial symposia has been an important forum for the inorganic ...

Introduction to the special issue Hermann Weyl and the philosophy of the 'New Physics'

Science.gov (United States)

De Bianchi, Silvia; Catren, Gabriel

2018-02-01

This Special Issue Hermann Weyl and the Philosophy of the 'New Physics' has two main objectives: first, to shed fresh light on the relevance of Weyl's work for modern physics and, second, to evaluate the importance of Weyl's work and ideas for contemporary philosophy of physics. Regarding the first objective, this Special Issue emphasizes aspects of Weyl's work (e.g. his work on spinors in n dimensions) whose importance has recently been emerging in research fields across both mathematical and experimental physics, as well as in the history and philosophy of physics. Regarding the second objective, this Special Issue addresses the relevance of Weyl's ideas regarding important open problems in the philosophy of physics, such as the problem of characterizing scientific objectivity and the problem of providing a satisfactory interpretation of fundamental symmetries in gauge theories and quantum mechanics. In this Introduction, we sketch the state of the art in Weyl studies and we summarize the content of the contributions to the present volume.

Research Article Special Issue

African Journals Online (AJOL)

pc

2018-03-07

Mar 7, 2018 ... characterized by historically developed specialization, a special geographical location ... We are listed under Research Associations category. ... product, service or technology providing economic and/or public benefit, additional in ...... the region's competitiveness // International Business Management.

EmptyHeaded: A Relational Engine for Graph Processing.

Science.gov (United States)

Aberger, Christopher R; Tu, Susan; Olukotun, Kunle; Ré, Christopher

2016-01-01

There are two types of high-performance graph processing engines: low- and high-level engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures and computation models but require users to write low-level imperative code, hence ensuring that efficiency is the burden of the user. In high-level engines, users write in query languages like datalog (SociaLite) or SQL (Grail). High-level engines are easier to use but are orders of magnitude slower than the low-level graph engines. We present EmptyHeaded, a high-level engine that supports a rich datalog-like query language and achieves performance comparable to that of low-level engines. At the core of EmptyHeaded's design is a new class of join algorithms that satisfy strong theoretical guarantees but have thus far not achieved performance comparable to that of specialized graph processing engines. To achieve high performance, EmptyHeaded introduces a new join engine architecture, including a novel query optimizer and data layouts that leverage single-instruction multiple data (SIMD) parallelism. With this architecture, EmptyHeaded outperforms high-level approaches by up to three orders of magnitude on graph pattern queries, PageRank, and Single-Source Shortest Paths (SSSP) and is an order of magnitude faster than many low-level baselines. We validate that EmptyHeaded competes with the best-of-breed low-level engine (Galois), achieving comparable performance on PageRank and at most 3× worse performance on SSSP.

Combining Vertex-centric Graph Processing with SPARQL for Large-scale RDF Data Analytics

KAUST Repository

Abdelaziz, Ibrahim

2017-06-27

Modern applications, such as drug repositioning, require sophisticated analytics on RDF graphs that combine structural queries with generic graph computations. Existing systems support either declarative SPARQL queries, or generic graph processing, but not both. We bridge the gap by introducing Spartex, a versatile framework for complex RDF analytics. Spartex extends SPARQL to support programs that combine seamlessly generic graph algorithms (e.g., PageRank, Shortest Paths, etc.) with SPARQL queries. Spartex builds on existing vertex-centric graph processing frameworks, such as Graphlab or Pregel. It implements a generic SPARQL operator as a vertex-centric program that interprets SPARQL queries and executes them efficiently using a built-in optimizer. In addition, any graph algorithm implemented in the underlying vertex-centric framework, can be executed in Spartex. We present various scenarios where our framework simplifies significantly the implementation of complex RDF data analytics programs. We demonstrate that Spartex scales to datasets with billions of edges, and show that our core SPARQL engine is at least as fast as the state-of-the-art specialized RDF engines. For complex analytical tasks that combine generic graph processing with SPARQL, Spartex is at least an order of magnitude faster than existing alternatives.

Perspectives on working memory: introduction to the special issue.

Science.gov (United States)

Logie, Robert H; Cowan, Nelson

2015-04-01

More than 40 years ago, Baddeley and Hitch (1974) published an article with a wealth of experimentation and theorization on working memory, the small amount of information held in mind and often used within cognitive processes such as language comprehension and production, reasoning, and problem solving. We honor this seminal accomplishment in the present special issue, and take this opportunity to provide an introduction to our perspectives on the origin of the theory of working memory, how it has affected our work, what may be coming in the near future, and how the research articles in the present issue contribute to several related themes within the clearly thriving field of working memory.

Special Issue: NextGen Materials for 3D Printing

Directory of Open Access Journals (Sweden)

Chee Kai Chua

2018-04-01

Full Text Available Only a handful of materials are well-established in three-dimensional (3D printing and well-accepted in industrial manufacturing applications. However, recent advances in 3D printable materials have shown potential for enabling numerous novel applications in the future. This special issue, consisting of 2 reviews and 10 research articles, intends to explore the possible materials that could define next-generation 3D printing.

Editorial. Special issue on strategies and self-regulation in self-access learning

Directory of Open Access Journals (Sweden)

Heath Rose

2012-12-01

Full Text Available Learner strategy and self-regulation theory have been in a state of flux in recent years, and this is an exciting time to share new ideas, conceptualizations and models of research in order to move the field forward. Therefore, the editor was eager to pursue a special issue where emerging voices in these fields could be heard, and these new ideas could be shared. The representation of strategic learning in recent conferences is indicative of a growing trend in the field to move towards a self-access and learner autonomy perspective. There is great potential to share knowledge between these fields. This special issue brings these fields, which have already been gravitating together, closer in a more concrete and published format.

CALL FOR PAPERS: Special Issue on “The Gender Dimension in Technology”

Directory of Open Access Journals (Sweden)

Alejandro Jimenez M.

2009-12-01

Full Text Available This Special Issue aims to present to the scientific, business and policy-making communities a concentrated and multi-faceted body of recent research, that has the potential to raise awareness on the increasing importance of gender in technology, broaden the current understanding of the dynamics and implications of the phenomenon, inspire new research projects in this and related areas, and disseminate good practice. Note: The authors of the papers included in this Special Issue will have the opportunity to present them at the International Conference Triple Helix 8 (Madrid, October 2010, which will include a track on Gender and Technology. Further details on this track will be available shortly on the conference website http://www.triplehelix8.org/information.html

Association of American Geographers, Remote Sensing Specialty Group Special Issue of Geocarto International

Science.gov (United States)

Allen, Thomas R. (Editor); Emerson, Charles W. (Editor); Quattrochi, Dale A. (Editor); Arnold, James E. (Technical Monitor)

2001-01-01

This special issue continues the precedence of the Association of American Geographers (AAG), Remote Sensing Specialty Group (RSSG) for publishing selected articles in Geocarto International as a by-product from the AAG annual meeting. As editors, we issued earlier this year, a solicitation for papers to be published in a special issue of Geocarto International that were presented in RSSG-sponsored sessions at the 2001 AAG annual meeting held in New York City on February 27-March 3. Although not an absolute requisite for publication, the vast majority of the papers in this special issue were presented at this year's AAG meeting in New York. Other articles in this issue that were not part of a paper or poster session at the 2001 AAG meeting are authored by RSSG members. Under the auspices of the RSSG, this special Geocarto International issue provides even more compelling evidence of the inextricable linkage between remote sensing and geography. The papers in this special issue fall into four general themes: 1) Urban Analysis and Techniques for Urban Analysis; 2) Land Use/Land Cover Analysis; 3) Fire Modeling Assessment; and 4) Techniques. The first four papers herein are concerned with the use of remote sensing for analysis of urban areas, and with use or development of techniques to better characterize urban areas using remote sensing data. As the lead paper in this grouping, Rashed et al., examine the usage of spectral mixture analysis (SMA) for analyzing satellite imagery of urban areas as opposed to more 'standard' methods of classification. Here SMA has been applied to IRS-1C satellite multispectral imagery to extract measures that better describe the 'anatomy' of the greater Cairo, Egypt region. Following this paper, Weng and Lo describe how Landsat TM data have been used to monitor land cover types and to estimate biomass parameters within an urban environment. The research reported in this paper applies an integrated GIS (Geographic Information System

Feynman amplitude and the Meijer's function. A unified representation for divergent and convergent graphs

Energy Technology Data Exchange (ETDEWEB)

Kucheryavyi, V I

1974-12-31

A parametric alpha -representation of Feynman amplitude for any spinor graph, which is expressed in terms of the Meijer's G functions, is obtained. This representation is valid both for divergent and convergent graphs. The available ChisholmNakanishi-Symanzik alpha -representation for convergent scalar graph turns out to be a special of the formula obtained. Besides that, the expression has a number of useful features. This representation automatically removes the infrared divergencies connected with zero photon mass. The expression has a form in which the scale-invariant terms are explicitly separated from the terms breaking the invariance. It is shown by considering the simplest graphs of quantum electrodynamics that this representation keeps gauge invariance and Ward's identity for renormalized amplitudes. (auth)

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

Contributions to the Content Analysis of Gender Roles: An Introduction to a Special Issue.

Science.gov (United States)

Rudy, Rena M; Popova, Lucy; Linz, Daniel G

2011-02-01

This special issue on gender-related content analysis is the second of two parts (see Rudy et al. 2010b). The current special issue is more diverse than was the first in the number of countries that are represented and in the variety of media genres and content types that are included. The primary aim of this paper is to outline some of the contributions of the individual papers in this second special issue. Some of these advancements and innovations include (a) examining underresearched measures, countries, time spans, sexual orientations, and individual media programs; (b) addressing both international and intranational differences in gender-role portrayals; (c) comparing multiple content formats within the same media unit; (d) updating past findings to take into consideration the current media landscape; (e) employing established measures in novel ways and novel contexts; (f) uncovering limitations in established intercultural measures and media-effects theories; (g) suggesting variables that could predict additional differences in gender-role portrayals; (h) adopting virtually identical methods and measures across distinct content categories in order to facilitate comparisons; (i) conducting multiple tests of a given hypothesis; (j) examining, from multiple perspectives, the implications of racial differences in gender portrayals; and (k) examining the implications of underrepresentation of women and the perspectives that women hold. In addition to the original content-analytical research presented in this special issue, two reviews, one methodological and the other analytical, offer recommendations of procedures and perspectives to be implemented in future research.

Introduction to the special issue on visual aesthetics

Directory of Open Access Journals (Sweden)

Marković Slobodan

2017-01-01

Full Text Available Visual aesthetics encompasses the studies of the relationship between vision and various aesthetic phenomena - from the beauty ratings of simple visual patterns to the appreciation of visual art, from the preference for natural objects and scenes to the preference for products of human creativity, from the aesthetic effects of culture to the aesthetic effects of biology, from the universal aesthetic sensitivity to the individual differences in taste, and so on. In this special issue ten papers reported the most recent studies on very different subjects related to visual aesthetics.

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

Research Article Special Issue

African Journals Online (AJOL)

pc

2018-03-07

Mar 7, 2018 ... Eurostat and the Ministry of Economic Development. 4. .... regard to the application of special national schemes for small enterprises. ... 2013) mentions a two-year exemption from the tax on joint stock companies and local taxes. ... specialized support programs are developed, such as the introduction of the ...

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

Optimal improvement of graphs related to nuclear safeguards problems

International Nuclear Information System (INIS)

Jacobsen, S.E.

1977-08-01

This report develops the methodology for optimally improving graphs related to nuclear safeguards issues. In particular, given a fixed number of dollars, the report provides a method for optimally allocating such dollars over the arcs of a weighted graph (the weights vary as a function of dollars spent on arcs) so as to improve the system effectiveness measure which is the shortest of all shortest paths to several targets. Arc weights can be either clock times or detection probabilities and the algorithm does not explicitly consider all paths to the targets

Graphing trillions of triangles.

Science.gov (United States)

Burkhardt, Paul

2017-07-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.

Special Issue of The Lancet on Sexual and Reproductive Rights and ...

International Development Research Centre (IDRC) Digital Library (Canada)

The Lancet is the world's leading general medical journal and also publishes four monthly ... The special issue will feature research, policy, and program information to ... This group will consist of emerging and renowned population scientists, ... and international processes and events shaping the sexual and reproductive ...

Constrained Agency in Later Working Lives: Introduction to the Special Issue

NARCIS (Netherlands)

Damman, M.; Henkens, K.

2017-01-01

In the social sciences there is an ongoing debate about the primacy of structure or agency in shaping individual behaviors. This Special Issue presents a comprehensive set of papers on structure and agency in the area of later working lives and retirement, specifically focusing on situations where

Introduction to the Special Issue on Climate Ethics: Uncertainty, Values and Policy

OpenAIRE

Roeser, S.

2017-01-01

Climate change is a pressing phenomenon with huge potential ethical, legal and social policy implications. Climate change gives rise to intricate moral and policy issues as it involves contested science, uncertainty and risk. In order to come to scientifically and morally justified, as well as feasible, policies, targeting climate change requires an interdisciplinary approach. This special issue will identify the main challenges that climate change poses from social, economic, methodological ...

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

Total Domination Versus Paired-Domination in Regular Graphs

Directory of Open Access Journals (Sweden)

Cyman Joanna

2018-05-01

Full Text Available A subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G, is the minimum cardinality of a dominating set of G, while the minimum cardinalities of a total dominating set and paired-dominating set are the total domination number, γt(G, and the paired-domination number, γpr(G, respectively. For k ≥ 2, let G be a connected k-regular graph. It is known [Schaudt, Total domination versus paired domination, Discuss. Math. Graph Theory 32 (2012 435–447] that γpr(G/γt(G ≤ (2k/(k+1. In the special case when k = 2, we observe that γpr(G/γt(G ≤ 4/3, with equality if and only if G ≅ C5. When k = 3, we show that γpr(G/γt(G ≤ 3/2, with equality if and only if G is the Petersen graph. More generally for k ≥ 2, if G has girth at least 5 and satisfies γpr(G/γt(G = (2k/(k + 1, then we show that G is a diameter-2 Moore graph. As a consequence of this result, we prove that for k ≥ 2 and k ≠ 57, if G has girth at least 5, then γpr(G/γt(G ≤ (2k/(k +1, with equality if and only if k = 2 and G ≅ C5 or k = 3 and G is the Petersen graph.

Special issue: engineering toxins for 21st-century therapies: introduction.

Science.gov (United States)

Acharya, K Ravi

2011-12-01

This special issue on 'Engineering toxins for 21st century therapies' provides a critical review of the current state of multifaceted aspects of toxin research by some of the leading researchers in the field. It also highlights the clinical potential and challenges for development of novel biologics based on engineered toxin derived products. © 2011 The Author Journal compilation © 2011 FEBS.

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.

Introduction to the Special Issue: Precarious Solidarity-Preferential Access in Canadian Health Care.

Science.gov (United States)

Reid, Lynette

2017-06-01

Systems of universal health coverage may aspire to provide care based on need and not ability to pay; the complexities of this aspiration (conceptual, practical, and ethical) call for normative analysis. This special issue arises in the wake of a judicial inquiry into preferential access in the Canadian province of Alberta, the Vertes Commission. I describe this inquiry and set out a taxonomy of forms of differential and preferential access. Papers in this special issue focus on the conceptual specification of health system boundaries (the concept of medical need) and on the normative questions raised by complex models of funding and delivery of care, where patients, providers, and services cross system boundaries.

Introduction to the special issue on visual working memory.

Science.gov (United States)

Wolfe, Jeremy M

2014-10-01

Visual working memory is a volatile, limited-capacity memory that appears to play an important role in our impression of a visual world that is continuous in time. It also mediates between the contents of the mind and the contents of that visual world. Research on visual working memory has become increasingly prominent in recent years. The articles in this special issue of Attention, Perception, & Psychophysics describe new empirical findings and theoretical understandings of the topic.

EDITORIAL: Special issue on optical micromanipulation

Science.gov (United States)

Heckenberg, N.; Dholakia, K.

2007-08-01

Few would have predicted the impact the laser has had across all of the natural sciences. Laser technology in tandem with microscopy has fuelled a revolutionary advance in biology and chemistry. Microscopic methods permit imaging of cells, nanoparticles, atoms and single molecules. Without doubt, biophotonics has emerged in many guises as a major player on the international arena, and has spawned an industry with an explosive growth rate. Notably, the influence of light is not restricted to passive imaging—it may also move, trap and manoeuvre objects from single atoms right through to the size of a large cell with no damage whatsoever. Given the well-known uses of high power lasers in surgery and industrial cutting, this sounds like science fiction, but at the size scale of these objects it is science fact: it is the area of optical micromanipulation that is the subject of this special issue. The field of optical micromanipulation has continued to impact right across the sciences in an unprecedented fashion, since its inception in the late 1960s. Excitingly the field has made an exceptional impact in single molecule biophysics and the physics of non-equilibrium systems largely due to the fact that an optical trap is an elegant and powerful force transducer. The field is also branching out into new directions: cell biology is benefiting from this advance. Trapping and microfluidics is an exciting combination within the broader remit of the field of optofluidics: methods of multiple traps using diffractive optics are permitting cell sorting, traps are aiding local viscosity measurements and novel biological studies are being performed. Combining traps with other spectroscopic methods and imaging modes is an interesting theme that poses interesting challenges but promises exciting new knowledge. All these areas are represented in this special issue, along with a number of contributions to quantitative modelling of optical fields suitable for trapping and of the

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.

Special Issue: Next Generation DNA Sequencing

Directory of Open Access Journals (Sweden)

Paul Richardson

2010-10-01

Full Text Available Next Generation Sequencing (NGS refers to technologies that do not rely on traditional dideoxy-nucleotide (Sanger sequencing where labeled DNA fragments are physically resolved by electrophoresis. These new technologies rely on different strategies, but essentially all of them make use of real-time data collection of a base level incorporation event across a massive number of reactions (on the order of millions versus 96 for capillary electrophoresis for instance. The major commercial NGS platforms available to researchers are the 454 Genome Sequencer (Roche, Illumina (formerly Solexa Genome analyzer, the SOLiD system (Applied Biosystems/Life Technologies and the Heliscope (Helicos Corporation. The techniques and different strategies utilized by these platforms are reviewed in a number of the papers in this special issue. These technologies are enabling new applications that take advantage of the massive data produced by this next generation of sequencing instruments. [...

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

Personality and politics: introduction to the special issue.

Science.gov (United States)

Duncan, Lauren E; Peterson, Bill E; Zurbriggen, Eileen L

2010-12-01

This special issue of Journal of Personality brings together 10 original articles addressing the intersection of personality and politics. Articles build on classic traditions in political psychology by presenting both idiographic and nomothetic work on the motivational, cognitive, ideological, attitudinal, and identity correlates of many different aspects of political behavior. This work is used to understand political activism and leadership as well as everyday political behavior. We hope this collection of articles will inspire our readers to explore new investigations in personality and political psychology. © 2010 The Authors. Journal of Personality © 2010, Wiley Periodicals, Inc.

Participatory Design in an Era of Participation, Special Issue

DEFF Research Database (Denmark)

This special issue on participatory design in an era of participation presents emerging topics and discussions from the thirteenth Participatory Design conference (PDC), held at Aarhus University in August 2016. The PDC 2016 marked the twenty-fifth anniversary of the Participatory Design conference...... series, which began in 1990 with the first biannual conference in Seattle. Since then, the PDC conferences have continued to bring together a multidisciplinary, international community of researchers and practitioners around issues of cooperative design. The theme for the 2016 PDC conference...... was ‘Participatory Design in an Era of Participation.’ Critical and constructive discussions were invited on the values, characteristics, politics and future practices of participatory design in an era in which participation has now become pervasive (Bossen, Smith, Kanstrup, McDonnell, et al. 2016, Bossen, Smith...

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.

EDITORIAL: Special Issue: CAMOP MOLEC XV

Science.gov (United States)

2006-01-01

The advances in recent years in the field of molecular dynamics are numerous and impressive. In sophisticated experimental and theoretical studies it is nowadays possible to steer chemical reactions with quantum-number-prepared molecules, to study reaction products fully state-specifically, and to derive accurate potential energy surfaces with the goal of determining the pathways along which molecular interaction can take place. Both experimental and theoretical techniques have rapidly improved, and our understanding of the dynamical nature of chemical processes is continuously growing. In this special issue of CAMOP/Physica Scripta we have tried to present a snapshot of the state-of-the-art in the field of molecular dynamics. It contains a collection of papers submitted in association with the most recent MOLEC meeting (MOLEC XV) held in September 2004 in Nunspeet, The Netherlands. This biannual meeting started in 1976 in Trento and was subsequently organized in Brandbjerg Højskole (Denmark, 1978), Oxford (UK, 1980), Nijmegen (The Netherlands, 1982), Jerusalem (Israel, 1984), Aussois (France, 1986), Assissi (Italy, 1988), Bernkastel-Kues (Germany, 1990), Prague (Czech Republic, 1992), Salamanca (Spain, 1994), Nyborg Strand (Denmark, 1996), Bristol (UK, 1998), Jerusalem (Israel, 2000) and Istanbul (Turkey, 2002). Within the philosophy of CAMOP we have asked invited speakers to report on outstanding problems in their particular field. This comprises discussion of open questions, important applications, new theoretical and experimental approaches and also predictions of future developments. A good comment, in addition to being an authoritative contribution of an acknowledged expert, should also be readable by the non-expert and we have taken special care that the work presented here is introduced in an understandable way and has been placed within the context of accessible literature for the interested reader. The sequence of 16 papers that is presented in this

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.

Special Education for Children with Attention Deficit Disorder: Current Issues. CRS Report for Congress.

Science.gov (United States)

Aleman, Steven R.

This paper examines issues concerning the eligibility of children with attention deficit disorder (ADD) for special education and related services under the Individuals with Disabilities Education Act (IDEA). A policy memorandum was issued by the Department of Education in September 1991, identifying those circumstances under which such children…

Bond graph modelling of engineering systems: theory, applications and software support

National Research Council Canada - National Science Library

Borutzky, Wolfgang; Margolis, Donald L

2011-01-01

... way such that analytical or computer response predictions can be straightforwardly carried out. Bond graphs are a concise pictorial representation of all types of interacting energetic systems. In my experience working with engineers on the development of complex systems it is obvious that these systems suffer from thermal problems, structural problems, vibration and noise problems, and control and stability issues that do not fit into a single discipline. Bond graphs provide the link by which all these different ...

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.

The century of the sun starts in the year 2000. Special issue

International Nuclear Information System (INIS)

Janse, F.; De Vries, E.; Brandsma, M.; Wiezer, F.

1997-01-01

In this special issue of the magazine a large number of brief articles on several aspects of solar energy is presented. In particular thermal solar energy has reached a phase from where a breakthrough is only a matter of some years

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

Special issue on new ideas and emerging results in understanding software

NARCIS (Netherlands)

Vinju, J.J.

2015-01-01

Welcome to the special issue on new ideas and emerging results in understanding software. It is a present to Prof. Dr. Paul Klint on the occasion of his 65th birthday. His colleagues and friends who share similar research interests have written the papers, wanting to present Paul with a worthy gift.

Introduction to the Special Issue on the Theory of Human Values

Directory of Open Access Journals (Sweden)

Eldad Davidov

2012-04-01

Full Text Available Research on human values in the social sciences took of after Schwartz introduced his theory of basic human values in 1992. This special issue includes articles dealing with methods of data analysis applied to measurements of some or all of the values postulated by the theory and of other variables.

Editorial: AABFJ Volume 8, Issue 4 Special Issue in Financial Markets and Financial Instruments

Directory of Open Access Journals (Sweden)

Ciorstan Smark

2014-10-01

Full Text Available Financial planning in Australia is in a time of change and challenge. Educational standards and regulation are in flux. There is a strong need to move financial planning into a more esteemed professional position as financial planners are not always considered the safest source of advice for people in Asia and the pacific rim when it comes to investing their much needed retirement funds. This Special Issue on Financial Planning and Financial Instruments brings together articles from financial planning, banking, financial markets and retirement policy.

Traversing every edge in each direction once, but not at once: Cubic (polyhedral graphs

Directory of Open Access Journals (Sweden)

Vladimir R. Rosenfeld

2017-04-01

Full Text Available A {\\em retracting-free bidirectional circuit} in a graph $G$ is a closed walk which traverses every edge exactly once in each direction and such that no edge is succeeded by the same edge in the opposite direction. Such a circuit revisits each vertex only in a number of steps. Studying the class $\\mathit{\\Omega}$ of all graphs admitting at least one retracting-free bidirectional circuit was proposed by Ore (1951 and is by now of practical use to nanotechnology. The latter needs in various molecular polyhedra that are constructed from a single chain molecule in the retracting-free way. Some earlier results for simple graphs, obtained by Thomassen and, then, by other authors, are specially refined by us for a cubic graph $Q$. Most of such refinements depend only on the number $n$ of vertices of $Q$.

Introduction to the Social Media + Society Special Issue on Selfies: Me-diated Inter-faces

Directory of Open Access Journals (Sweden)

Katie Warfield

2016-04-01

Full Text Available This introduction to the special issue entitled Me-diated Inter-faces begins by bringing into question the concept of positioning: what is it that we are doing when we take a position within the study of social media? Reviewing the work of the inaugural manifestos of the journal Social Media + Society on one hand, and the introduction to the special issue on selfies for the International Journal of Communications on the other, this introduction provides both critical and creative in-roads for thinking and re-thinking digital self-images shared on social media. Given the constantly changing nature of social media, this paper is a call to researchers of social media to not fall prey to the ossification of our current positions since theorizing the “social” in social media means always at once theorizing the body. As such this intro offers numerous and diverse perspectives on the body that might inform emerging thoughts on the socially media body. The introduction then provides an overview of the papers in this special issue and concludes by offering openings and ruptures for further discussion, rather than closure of conclusions.

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.

EDITORIAL: Special issue on silicon photonics

Science.gov (United States)

Reed, Graham; Paniccia, Mario; Wada, Kazumi; Mashanovich, Goran

2008-06-01

mechanisms for modulation in silicon that have yielded increasingly impressive results (see, for example, Liao L et al 2007 Electron. Lett. 43 issue 22). The convergence of computing and communications and the resultant demand for increased bandwidth has been one of the factors influencing the upsurge of interest in silicon, together with the requirement for photonic and electronic integration, all to be realized at low cost. Thus emerging applications such as short-reach communications links for optical interconnect and fibre to the home (FTTH) (as well as a multitude of other applications) are frequently offered as examples of where silicon photonics will have a significant, perhaps a revolutionary, impact. One of the major conclusions of the joint MIT-industry Communication Technology Roadmap (http://mph-roadmap.mit.edu/index.php), was that 'Photonics technology will be driven by electronic-photonic synergy and short (intelligence. Thus the limitations of silicon as an optical material can be offset against the very significant advantages, to both commercial as well as technological success. Of course, there is still much to do, hence the increasing global investment in silicon technology and the massive increase in research activity in silicon photonics since the early work in the 1980s. Only time will tell if silicon can realize its potential to satisfy the ever-increasing array of applications. However, the indications are positive, and the contributors to this cause employ increasingly impressive levels of intellectual and technological capability to realize the desired goals. It is an interesting time to be involved in slicon photonics, and it will be equally fascinating to watch the evolution of the technology in the future. Whatever happens, silicon will make the transition from being regarded as purely an electronic material to recognition as an optoelectronic material. The evidence for this is represented in the collection of papers that form this special issue

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.

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.

PREFACE: Celebrating 100 years of superconductivity: special issue on the iron-based superconductors Celebrating 100 years of superconductivity: special issue on the iron-based superconductors

Science.gov (United States)

Crabtree, George; Greene, Laura; Johnson, Peter

2011-12-01

In honor of this year's 100th anniversary of the discovery of superconductivity, this special issue of Reports on Progress in Physics is a dedicated issue to the 'iron-based superconductors'—a new class of high-temperature superconductors that were discovered in 2008. This is the first time the journal has generated a 'theme issue', and we provide this to the community to provide a 'snapshot' of the present status, both for researchers working in this fast-paced field, and for the general physics community. Reports on Progress in Physics publishes three classes of articles—comprehensive full Review Articles, Key Issues Reviews and, most recently, Reports on Progress articles that recount the current status of a rapidly evolving field, befitting of the articles in this special issue. It has been an exciting year for superconductivity—there have been numerous celebrations for this centenary recounting the fascinating history of this field, from seven Nobel prizes to life-saving discoveries that brought us medically useful magnetic resonance imaging. The discovery of a completely new class of high-temperature superconductors, whose mechanism remains as elusive as the cuprates discovered in 1986, has injected a new vitality into this field, and this year those new to the field were provided with the opportunity of interacting with those who have enjoyed a long history in superconductivity. Furthermore, as high-density current carriers with little or no power loss, high-temperature superconductors offer unique solutions to fundamental grid challenges of the 21st century and hold great promise in addressing our global energy challenges. The complexity and promise of these materials has caused our community to more freely share our ideas and results than ever before, and it is gratifying to see how we have grown into an enthusiastic global network to advance the field. This invited collection is true to this agenda and we are delighted to have received contributions

Distributed Graphs for Solving Co-modal Transport Problems

OpenAIRE

Karama , Jeribi; Hinda , Mejri; Hayfa , Zgaya; Slim , Hammadi

2011-01-01

International audience; The paper presents a new approach based on a special distributed graphs in order to solve co-modal transport problems. The co-modal transport system consists on combining different transport modes effectively in terms of economic, environmental, service and financial efficiency, etc. However, the problem is that these systems must deal with different distributed information sources stored in different locations and provided by different public and private companies. In...

Distance Magic-Type and Distance Antimagic-Type Labelings of Graphs

Science.gov (United States)

Freyberg, Bryan J.

Generally speaking, a distance magic-type labeling of a graph G of order n is a bijection l from the vertex set of the graph to the first n natural numbers or to the elements of a group of order n, with the property that the weight of each vertex is the same. The weight of a vertex x is defined as the sum (or appropriate group operation) of all the labels of vertices adjacent to x. If instead we require that all weights differ, then we refer to the labeling as a distance antimagic-type labeling. This idea can be generalized for directed graphs; the weight will take into consideration the direction of the arcs. In this manuscript, we provide new results for d-handicap labeling, a distance antimagic-type labeling, and introduce a new distance magic-type labeling called orientable Gamma-distance magic labeling. A d-handicap distance antimagic labeling (or just d-handicap labeling for short) of a graph G = ( V,E) of order n is a bijection l from V to the set {1,2,...,n} with induced weight function [special characters omitted]. such that l(xi) = i and the sequence of weights w(x 1),w(x2),...,w (xn) forms an arithmetic sequence with constant difference d at least 1. If a graph G admits a d-handicap labeling, we say G is a d-handicap graph. A d-handicap incomplete tournament, H(n,k,d ) is an incomplete tournament of n teams ranked with the first n natural numbers such that each team plays exactly k games and the strength of schedule of the ith ranked team is d more than the i + 1st ranked team. That is, strength of schedule increases arithmetically with strength of team. Constructing an H(n,k,d) is equivalent to finding a d-handicap labeling of a k-regular graph of order n.. In Chapter 2 we provide general constructions for every d for large classes of both n and k, providing breadfth and depth to the catalog of known H(n,k,d)'s. In Chapters 3 - 6, we introduce a new type of labeling called orientable Gamma-distance magic labeling. Let Gamma be an abelian group of order

Editorial for special issue on Perception and Navigation for Autonomous Vehicles

OpenAIRE

Laugier , Christian; Philippe , Martinet; Urbano , Nunes

2014-01-01

International audience; This Special Issue of the IEEE Robotics and Automation Magazine has been prepared in the scope of the activities of the Technical Committee on "Autonomous Ground Vehicle and Intelligent Transportation System" (AGV-ITS) (http://www.ieee-ras.org/autonomous-groundvehicles- and-intelligent-transportation-systems) of the IEEE Robotics and Automation Society (IEEE RAS).

Religious, Secular, and Spiritual Identities Convergence: Introduction to the Special Issue

Science.gov (United States)

Small, Jenny L.; Bowman, Nicholas A.

2018-01-01

The purpose of this special issue is to share the best research, theory, practice, and perspectives from presenters at the 2017 Religious, Secular, and Spiritual Identities Convergence conference, alongside the new writing of scholars and practitioners who were inspired by the themes of the conference. Readers will have access both to the best of…

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.

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.

Foreword of Special Issue on “Nomadic Services and Applications”

OpenAIRE

Jason C. Hung

2011-01-01

Nomadic Service has emerged rapidly as an exciting new paradigm that offers a challenging model of cyber-physical services and poses fascinating problems regarding distributed resource management, ranging from information sharing to cooperative computing. This special issue is intended to foster state-of-the-art research in the area of nomadic services and related applications, cloud computing technologies and services, including the topics of collaboration environment, implementation and exe...

2012 Special NSREC Issue of the IEEE Transactions on Nuclear Science Comments by the Editors

Science.gov (United States)

Schwank, Jim; Brown, Dennis; Girard, Sylvain; Gouker, Pascale; Gerardin, Simone; Quinn, Heather; Barnaby, Hugh

2012-12-01

The December 2012 special issue of the IEEE Transactions on Nuclear Science contains selected papers from the 49th annual IEEE International Nuclear and Space Radiation Effects Conference (NSREC) held July 16-20, 2012, in Miami, Florida USA. 95 papers presented at the 2012 NSREC were submitted for consideration for this year’s special issue. Those papers that appear in this special issue were able to successfully complete the review process before the deadline for the December issue. A few additional papers may appear in subsequent issues of the TRANSACTIONS. This publication is the premier archival journal for research on space and nuclear radiation effects in materials, devices, circuits, and systems. This distinction is the direct result of the conscientious efforts of both the authors, who present and document their work, and the reviewers, who selflessly volunteer their time and talent to help review the manuscripts. Each paper in this journal has been reviewed by experts selected by the editors for their expertise and knowledge of the particular subject areas. The peer review process for a typical technical journal generally takes six months to one year to complete. To publish this special issue of the IEEE Transactions on Nuclear Science (in December), the review process, from initial submission to final form, must be completed in about 10 weeks. Because of the short schedule, both the authors and reviewers are required to respond very quickly. The reviewers listed on the following pages contributed vitally to this quick-turn review process.We would like to express our sincere appreciation to each of them for accepting this difficult, but critical role in the process. To provide consistent reviews of papers throughout the year, the IEEE Transactions on Nuclear Science relies on a year-round editorial board that manages reviews for submissions throughout the year to the TRANSACTIONS in the area of radiation effects. The review process is managed by a Senior

Psychology of Game Playing: Introduction to a Special Issue

Directory of Open Access Journals (Sweden)

Andrew M. Colman

2015-12-01

Full Text Available Game theory has focused attention on different problems at different times in its history. Currently, attention is devoted to investigating how human decision makers with bounded rationality choose strategies in interactive decisions. Behavioral economics, and more generally experimental games, have appeared in the literature with accelerating frequency since 1990, and this cannot continue indefinitely without a proportional expansion of journal space. This Special Issue includes contributions to behavioral economics, experimental games, and evolutionary game theory, using theoretical, experimental, and agent-based modeling techniques.

Waste management in space: a NASA symposium. Special issue

Science.gov (United States)

Wydeven, T. (Principal Investigator)

1991-01-01

This special issue contains papers from the NASA Symposium on Waste Processing for Advanced Life Support, which was held at NASA Ames Research Center on September 11-13, 1990. Specialists in waste management from academia, government, and industry convened to exchange ideas and advise NASA in developing effective methods for waste management in a Controlled Ecological Life Support System (CELSS). Innovative and well-established methods were presented to assist in developing and managing wastes in closed systems for future long-duration space missions, especially missions to Mars.

Preface paper to the Semi-Arid Land-Surface-Atmosphere (SALSA) Program special issue

Science.gov (United States)

Goodrich, D.C.; Chehbouni, A.; Goff, B.; MacNish, B.; Maddock, T.; Moran, S.; Shuttleworth, W.J.; Williams, D.G.; Watts, C.; Hipps, L.H.; Cooper, D.I.; Schieldge, J.; Kerr, Y.H.; Arias, H.; Kirkland, M.; Carlos, R.; Cayrol, P.; Kepner, W.; Jones, B.; Avissar, R.; Begue, A.; Bonnefond, J.-M.; Boulet, G.; Branan, B.; Brunel, J.P.; Chen, L.C.; Clarke, T.; Davis, M.R.; DeBruin, H.; Dedieu, G.; Elguero, E.; Eichinger, W.E.; Everitt, J.; Garatuza-Payan, J.; Gempko, V.L.; Gupta, H.; Harlow, C.; Hartogensis, O.; Helfert, M.; Holifield, C.; Hymer, D.; Kahle, A.; Keefer, T.; Krishnamoorthy, S.; Lhomme, J.-P.; Lagouarde, J.-P.; Lo, Seen D.; Luquet, D.; Marsett, R.; Monteny, B.; Ni, W.; Nouvellon, Y.; Pinker, R.; Peters, C.; Pool, D.; Qi, J.; Rambal, S.; Rodriguez, J.; Santiago, F.; Sano, E.; Schaeffer, S.M.; Schulte, M.; Scott, R.; Shao, X.; Snyder, K.A.; Sorooshian, S.; Unkrich, C.L.; Whitaker, M.; Yucel, I.

2000-01-01

The Semi-Arid Land-Surface-Atmosphere Program (SALSA) is a multi-agency, multi-national research effort that seeks to evaluate the consequences of natural and human-induced environmental change in semi-arid regions. The ultimate goal of SALSA is to advance scientific understanding of the semi-arid portion of the hydrosphere-biosphere interface in order to provide reliable information for environmental decision making. SALSA approaches this goal through a program of long-term, integrated observations, process research, modeling, assessment, and information management that is sustained by cooperation among scientists and information users. In this preface to the SALSA special issue, general program background information and the critical nature of semi-arid regions is presented. A brief description of the Upper San Pedro River Basin, the initial location for focused SALSA research follows. Several overarching research objectives under which much of the interdisciplinary research contained in the special issue was undertaken are discussed. Principal methods, primary research sites and data collection used by numerous investigators during 1997-1999 are then presented. Scientists from about 20 US, five European (four French and one Dutch), and three Mexican agencies and institutions have collaborated closely to make the research leading to this special issue a reality. The SALSA Program has served as a model of interagency cooperation by breaking new ground in the approach to large scale interdisciplinary science with relatively limited resources.

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

Editorial: 2nd Special Issue on behavior change, health, and health disparities.

Science.gov (United States)

Higgins, Stephen T

2015-11-01

This Special Issue of Preventive Medicine (PM) is the 2nd that we have organized on behavior change, health, and health disparities. This is a topic of fundamental importance to improving population health in the U.S. and other industrialized countries that are trying to more effectively manage chronic health conditions. There is broad scientific consensus that personal behavior patterns such as cigarette smoking, other substance abuse, and physical inactivity/obesity are among the most important modifiable causes of chronic disease and its adverse impacts on population health. As such behavior change needs to be a key component of improving population health. There is also broad agreement that while these problems extend across socioeconomic strata, they are overrepresented among more economically disadvantaged populations and contribute directly to the growing problem of health disparities. Hence, behavior change represents an essential step in curtailing that unsettling problem as well. In this 2nd Special Issue, we devote considerable space to the current U.S. prescription opioid addiction epidemic, a crisis that was not addressed in the prior Special Issue. We also continue to devote attention to the two largest contributors to preventable disease and premature death, cigarette smoking and physical inactivity/obesity as well as risks of co-occurrence of these unhealthy behavior patterns. Across each of these topics we included contributions from highly accomplished policy makers and scientists to acquaint readers with recent accomplishments as well as remaining knowledge gaps and challenges to effectively managing these important chronic health problems. Copyright © 2015 Elsevier Inc. All rights reserved.

Introduction to the Special Issue on Gender and Geoethics in the Geosciences.

Science.gov (United States)

Thornbush, Mary

2016-04-01

In this introduction to the Special Issue on Gender and Geoethics in the Geosciences is a focus on the participation of women in traditionally male-dominated professions, with geography as an exemplary academic subject. The Special Issue stems from the Commission of Gender and Geoethics as part of the International Association of Geoethics, and endeavors to bring together efforts at various spatial scales that examine the position of women in science and engineering in particular, as conveyed in engineering geology, disaster management sciences, and climate change adaptation studies. It has been discovered, for instance, that men are more active and personally prepared at the community level (in Atlantic Canada coastal communities), and more action is still required in developing countries especially to promote gender equality and empower women. Studies contained in this Special Issue also reveal that tutoring and mentoring by other women can promote further involvement in non-traditional professions, such as professional engineering geology, where women are preferring more traditional (less applied) approaches that may circumscribe their ability to find suitable employment after graduation. Moreover, the hiring policy needs to change in many countries, such as Canada, where there are fewer women at entry-level and senior ranks within geography, especially in physical geography as the scientific part of the discipline. The exclusion of women in traditionally male-dominated spheres needs to be addressed and rectified for the ascent of women to occur in scientific geography and in other geosciences as well as science and engineering at large.

Introduction to the Special Issue on Gender and Geoethics in the Geosciences

Directory of Open Access Journals (Sweden)

Mary Thornbush

2016-04-01

Full Text Available In this introduction to the Special Issue on Gender and Geoethics in the Geosciences is a focus on the participation of women in traditionally male-dominated professions, with geography as an exemplary academic subject. The Special Issue stems from the Commission of Gender and Geoethics as part of the International Association of Geoethics, and endeavors to bring together efforts at various spatial scales that examine the position of women in science and engineering in particular, as conveyed in engineering geology, disaster management sciences, and climate change adaptation studies. It has been discovered, for instance, that men are more active and personally prepared at the community level (in Atlantic Canada coastal communities, and more action is still required in developing countries especially to promote gender equality and empower women. Studies contained in this Special Issue also reveal that tutoring and mentoring by other women can promote further involvement in non-traditional professions, such as professional engineering geology, where women are preferring more traditional (less applied approaches that may circumscribe their ability to find suitable employment after graduation. Moreover, the hiring policy needs to change in many countries, such as Canada, where there are fewer women at entry-level and senior ranks within geography, especially in physical geography as the scientific part of the discipline. The exclusion of women in traditionally male-dominated spheres needs to be addressed and rectified for the ascent of women to occur in scientific geography and in other geosciences as well as science and engineering at large.

Introduction to the Special Issue on Gender and Geoethics in the Geosciences

Science.gov (United States)

Thornbush, Mary

2016-01-01

In this introduction to the Special Issue on Gender and Geoethics in the Geosciences is a focus on the participation of women in traditionally male-dominated professions, with geography as an exemplary academic subject. The Special Issue stems from the Commission of Gender and Geoethics as part of the International Association of Geoethics, and endeavors to bring together efforts at various spatial scales that examine the position of women in science and engineering in particular, as conveyed in engineering geology, disaster management sciences, and climate change adaptation studies. It has been discovered, for instance, that men are more active and personally prepared at the community level (in Atlantic Canada coastal communities), and more action is still required in developing countries especially to promote gender equality and empower women. Studies contained in this Special Issue also reveal that tutoring and mentoring by other women can promote further involvement in non-traditional professions, such as professional engineering geology, where women are preferring more traditional (less applied) approaches that may circumscribe their ability to find suitable employment after graduation. Moreover, the hiring policy needs to change in many countries, such as Canada, where there are fewer women at entry-level and senior ranks within geography, especially in physical geography as the scientific part of the discipline. The exclusion of women in traditionally male-dominated spheres needs to be addressed and rectified for the ascent of women to occur in scientific geography and in other geosciences as well as science and engineering at large. PMID:27043609

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.

Introduction to the Special Issue: New and Interdisciplinary Approaches to Linguistic Relativity

Science.gov (United States)

Athanasopoulos, Panos; Bylund, Emanuel; Casasanto, Daniel

2016-01-01

This Special Issue of "Language Learning" presents an interdisciplinary state-of-the-art overview of current approaches to linguistic relativity. It contains empirical and theoretical studies and reflections on linguistic relativity from a variety of perspectives, such as associative learning, conceptual transfer, multilingual awareness,…

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

AGM: A DSL for mobile cloud computing based on directed graph

Science.gov (United States)

Tanković, Nikola; Grbac, Tihana Galinac

2016-06-01

This paper summarizes a novel approach for consuming a domain specific language (DSL) by transforming it to a directed graph representation persisted by a graph database. Using such specialized database enables advanced navigation trough the stored model exposing only relevant subsets of meta-data to different involved services and components. We applied this approach in a mobile cloud computing system and used it to model several mobile applications in retail, supply chain management and merchandising domain. These application are distributed in a Software-as-a-Service (SaaS) fashion and used by thousands of customers in Croatia. We report on lessons learned and propose further research on this topic.

Current Issues in the Neurology and Genetics of Learning-Related Traits and Disorders: Introduction to the Special Issue.

Science.gov (United States)

Gilger, Jeffrey W.

2001-01-01

This introductory article briefly describes each of the following eight articles in this special issue on the neurology and genetics of learning related disorders. It notes the greater appreciation of learning disability as a set of complex disorders with broad and intricate neurological bases and of the large individual differences in how these…

Editorial: 3rd Special Issue on behavior change, health, and health disparities.

Science.gov (United States)

Higgins, Stephen T

2016-11-01

This Special Issue of Preventive Medicine (PM) is the 3rd that we have organized on behavior change, health, and health disparities. This is a topic of critical importance to improving U.S. population health. There is broad scientific consensus that personal behaviors such as cigarette smoking, other substance abuse, and physical inactivity/obesity are among the most important modifiable causes of chronic disease and its adverse impacts on population health. Hence, effectively promoting health-related behavior change needs to be a key component of health care research and policy. There is also broad recognition that while these problems extend throughout the population, they disproportionately impact economically disadvantaged populations and other vulnerable populations and represent a major contributor to health disparities. Thus, behavior change represents an essential step in curtailing health disparities, which receives special attention in this 3rd Special Issue. We also devote considerable space to the longstanding challenges of reducing cigarette smoking and use of other tobacco and nicotine delivery products in vulnerable populations, obesity, and for the first time food insecurity. Across each of these topics we include contributions from highly accomplished policymakers and scientists to acquaint readers with recent accomplishments as well as remaining knowledge gaps and challenges. Copyright © 2016 Elsevier Inc. All rights reserved.

Workplace learning: panacea or challenge? : Epilogue of a special issue on boundaries of workplace learning

NARCIS (Netherlands)

Dr. J. Onstenk

2012-01-01

This article reflects on the previous articles in this special issue by discussing some common themes and raising some proposals for future research on the topic of workplace learning and its boundaries. The article subsequently discusses objects and results of workplace learning, the issue of

Evolutionary stability of mixed strategies on graphs

International Nuclear Information System (INIS)

Li, Yan; Liu, Xinsheng; Claussen, Jens Christian

2016-01-01

Up to the present time, the study of evolutionary dynamics mostly focused on pure strategy games in finite discrete strategy space, either in well-mixed or structured populations. In this paper, we study mixed strategy games in continuous strategy space on graphs of degree k . Each player is arranged on a vertex of the graph. The edges denote the interaction between two individuals. In the limit of weak selection, we first derive the payoff functions of two mixed strategies under three different updating rules, named birth–death, death–birth and imitation. Then we obtain the conditions for a strategy being a continuously stable strategy (CSS), and we also confirm that the equilibrium distribution corresponding to the CSS is neighborhood attracting and strongly uninvadable. Finally, we apply our theory to the prisoner’s dilemma and the snowdrift game to obtain possible CSS. Simulations are performed for the two special games and the results are well consistent with the conclusions we made. (paper)

Random geometric graphs with general connection functions

Science.gov (United States)

Dettmann, Carl P.; Georgiou, Orestis

2016-03-01

In the original (1961) Gilbert model of random geometric graphs, nodes are placed according to a Poisson point process, and links formed between those within a fixed range. Motivated by wireless ad hoc networks "soft" or "probabilistic" connection models have recently been introduced, involving a "connection function" H (r ) that gives the probability that two nodes at distance r are linked (directly connect). In many applications (not only wireless networks), it is desirable that the graph is connected; that is, every node is linked to every other node in a multihop fashion. Here the connection probability of a dense network in a convex domain in two or three dimensions is expressed in terms of contributions from boundary components for a very general class of connection functions. It turns out that only a few quantities such as moments of the connection function appear. Good agreement is found with special cases from previous studies and with numerical simulations.

Special issue review of pollution prevention management within the Department of Energy, final report

International Nuclear Information System (INIS)

1994-08-01

The Department of Energy's (DOE) national role and overall mission has been undergoing significant change. In the post-Cold War era, a new emphasis on cleaning up the wastes from the past has emerged. These changes provide both significant challenges as well as new opportunities for DOE. While the challenges may seem overwhelming as DOE realizes the magnitude of its environmental problems, its network of national laboratories and sites provide the resources to become a leader in environmental management through the development of new technologies and management practices. Because of the growing importance of pollution prevention in the United States and more specifically to DOE's environmental management strategy, the Office of Environmental Audit (EH-24) identified this as an area worthy of a Special Issue Review. A Special Issue Review is not an audit but rather an in-depth review of key environmental programs or activities which cut across organizational boundaries. The purpose of a Special Issue Review is to identify strengths and weaknesses of a program as well as significant crosscutting issues or challenges that are important to the future success of that program. The scope of the review included an assessment of pollution prevention program activities at Headquarters, selected operations offices, and selected sites offices and contractor organizations. All aspects of a pollution prevention program were considered including program strategy, infrastructure, management systems, and implementation practices. Also summarized are future pollution prevention challenges and recommendations

SPECIAL ISSUE VETERINARY IMMUNOLOGY IMMUNOPATHOLOGY: PROCEEDINGS 8TH INTERNATIONAL VETERINARY IMMUNOLOGY SYMPOSIUM

Science.gov (United States)

This is the Special Issue of Vet. Immunol. Immunopathol. that summarizes the 8th International Veterinary Immunology Symposium (8 th IVIS) held August 15th-19th, 2007, in Ouro Preto, Brazil. The 8 th IVIS highlighted the importance of veterinary immunology for animal health, vaccinology, reproducti...

Trace formulae and spectral statistics for discrete Laplacians on regular graphs (I)

Energy Technology Data Exchange (ETDEWEB)

Oren, Idan; Godel, Amit; Smilansky, Uzy [Department of Physics of Complex Systems, Weizmann Institute of Science, Rehovot 76100 (Israel)], E-mail: idan.oren@weizmann.ac.il, E-mail: amit.godel@weizmann.ac.il, E-mail: uzy.smilansky@weizmann.ac.il

2009-10-16

Trace formulae for d-regular graphs are derived and used to express the spectral density in terms of the periodic walks on the graphs under consideration. The trace formulae depend on a parameter w which can be tuned continuously to assign different weights to different periodic orbit contributions. At the special value w = 1, the only periodic orbits which contribute are the non-back-scattering orbits, and the smooth part in the trace formula coincides with the Kesten-McKay expression. As w deviates from unity, non-vanishing weights are assigned to the periodic walks with backscatter, and the smooth part is modified in a consistent way. The trace formulae presented here are the tools to be used in the second paper in this sequence, for showing the connection between the spectral properties of d-regular graphs and the theory of random matrices.

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

An industrial robot singular trajectories planning based on graphs and neural networks

Science.gov (United States)

Łęgowski, Adrian; Niezabitowski, Michał

2016-06-01

Singular trajectories are rarely used because of issues during realization. A method of planning trajectories for given set of points in task space with use of graphs and neural networks is presented. In every desired point the inverse kinematics problem is solved in order to derive all possible solutions. A graph of solutions is made. The shortest path is determined to define required nodes in joint space. Neural networks are used to define the path between these nodes.

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

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.

Editorial: Special issue on smart optical instruments and systems for space applications

Institute of Scientific and Technical Information of China (English)

XING; Fei

2015-01-01

Optical systems are playing more and more important roles for space applications,such as high accurate attitude determination and remote sensing systems etc.Innovations in optical systems have brought great advantages,some even revolutionary for the space applications.Accordingly,in this special issue of Smart Optical systems and instruments

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

Popper and Dingle on special relativity and the issue of symmetry

Science.gov (United States)

Dotson, Allen Clark

2012-02-01

Karl Popper and Herbert Dingle engaged in a fascinating debate concerning the kind of theory the special theory of relativity is. One of the issues was whether applications of the theory could be made consistent with the principle of relativity, a cornerstone of the theory itself. The principle of relativity seems to imply some sort of symmetry in results obtained for similar experiments as observed in two different inertial reference frames. Peter Hayes has recently dealt with the Dingle-Popper debate on this matter, as well as other issues. The present paper seeks to clarify what kind of symmetry is appropriate in a situation discussed by Popper, Dingle, and Hayes.

Introduction to the Special Issue on Marketing and Operations Management Interfaces and Coordination

OpenAIRE

Teck H. Ho; Christopher S. Tang

2004-01-01

This special issue, by addressing problems surrounding marketing and operations management, depicts state-of-the-art approaches, methodologies, and insights to improve a firm's or supply chain's overall performance. Top scholars in the field address many of the ways in which companies can synchronize their marketing and operations departments or their supply chain partners to improve competitiveness and profit. The information in this issue should be of interest both to academics and managers...

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

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

Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii

Energy Technology Data Exchange (ETDEWEB)

Kupavskii, A B; Raigorodskii, A M [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)

2013-10-31

We investigate in detail some properties of distance graphs constructed on the integer lattice. Such graphs find wide applications in problems of combinatorial geometry, in particular, such graphs were employed to answer Borsuk's question in the negative and to obtain exponential estimates for the chromatic number of the space. This work is devoted to the study of the number of cliques and the chromatic number of such graphs under certain conditions. Constructions of sequences of distance graphs are given, in which the graphs have unit length edges and contain a large number of triangles that lie on a sphere of radius 1/√3 (which is the minimum possible). At the same time, the chromatic numbers of the graphs depend exponentially on their dimension. The results of this work strengthen and generalize some of the results obtained in a series of papers devoted to related issues. Bibliography: 29 titles.

Research, Learning Theory, and the Ideas of Robert G. Sidnell. Special Issue.

Science.gov (United States)

Alexander, David, Ed.; And Others

1987-01-01

Intended as a memorial to Robert G. Sidnell, this special issue contains articles about areas of music education which he promoted. In "The Dimensions of Research in Music Education," Sidnell concluded that music education research encompasses all humanistic disciplines as well as the behavioral and social sciences. James Carlsen, in…

Graphs as a Visual Aid in English for Special Purposes. Lenguas para objetivos especificos (Languages for Special Purposes), No. 5.

Science.gov (United States)

Stark, Merritt W.; Stark, Kathleen LaPiana

Visual aids have been developed to strengthen non-English speaking students' ability to speak and write English effectively in their subject areas. Among these aids, graphs have been valuable for economics students because they readily illustrate the nature of the relationship between two sets of numbers. Frequently, the ability to analyze graphs…

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

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.

Legislation for the countermeasures on special issues of nuclear safety regulations

International Nuclear Information System (INIS)

Cho, Byung Sun; Lee, Mo Sung; Chung, Gum Chun; Kim, Heon Jin; Oh, Ho Chul

2004-02-01

Since the present nuclear safety regulation has some legal problems that refer to special issues and contents of regulatory provisions, this report has preformed research on the legal basic theory of nuclear safety regulation to solve the problems. In addition, this report analyzed the problems of each provisions and suggested the revision drafts on the basis of analyzing problems and the undergoing theory of nuclear safety regulation

Legislation for the countermeasures on special issues of nuclear safety regulations

Energy Technology Data Exchange (ETDEWEB)

Cho, Byung Sun; Lee, Mo Sung; Chung, Gum Chun; Kim, Heon Jin; Oh, Ho Chul [Chongju Univ., Cheongju (Korea, Republic of)

2004-02-15

Since the present nuclear safety regulation has some legal problems that refer to special issues and contents of regulatory provisions, this report has preformed research on the legal basic theory of nuclear safety regulation to solve the problems. In addition, this report analyzed the problems of each provisions and suggested the revision drafts on the basis of analyzing problems and the undergoing theory of nuclear safety regulation.

On a directed tree problem motivated by a newly introduced graph product

Directory of Open Access Journals (Sweden)

Antoon H. Boode

2015-10-01

Full Text Available In this paper we introduce and study a directed tree problem motivated by a new graph product that we have recently introduced and analysed in two conference contributions in the context of periodic real-time processes. While the two conference papers were focussing more on the applications, here we mainly deal with the graph theoretical and computational complexity issues. We show that the directed tree problem is NP-complete and present and compare several heuristics for this problem.

Special Issue on Automatic Application Tuning for HPC Architectures

Directory of Open Access Journals (Sweden)

Siegfried Benkner

2014-01-01

Full Text Available High Performance Computing architectures have become incredibly complex and exploiting their full potential is becoming more and more challenging. As a consequence, automatic performance tuning (autotuning of HPC applications is of growing interest and many research groups around the world are currently involved. Autotuning is still a rapidly evolving research field with many different approaches being taken. This special issue features selected papers presented at the Dagstuhl seminar on “Automatic Application Tuning for HPC Architectures” in October 2013, which brought together researchers from the areas of autotuning and performance analysis in order to exchange ideas and steer future collaborations.

Evaluating de Bruijn graph assemblers on 454 transcriptomic data.

Directory of Open Access Journals (Sweden)

Xianwen Ren

Full Text Available Next generation sequencing (NGS technologies have greatly changed the landscape of transcriptomic studies of non-model organisms. Since there is no reference genome available, de novo assembly methods play key roles in the analysis of these data sets. Because of the huge amount of data generated by NGS technologies for each run, many assemblers, e.g., ABySS, Velvet and Trinity, are developed based on a de Bruijn graph due to its time- and space-efficiency. However, most of these assemblers were developed initially for the Illumina/Solexa platform. The performance of these assemblers on 454 transcriptomic data is unknown. In this study, we evaluated and compared the relative performance of these de Bruijn graph based assemblers on both simulated and real 454 transcriptomic data. The results suggest that Trinity, the Illumina/Solexa-specialized transcriptomic assembler, performs the best among the multiple de Bruijn graph assemblers, comparable to or even outperforming the standard 454 assembler Newbler which is based on the overlap-layout-consensus algorithm. Our evaluation is expected to provide helpful guidance for researchers to choose assemblers when analyzing 454 transcriptomic data.

Editorial: Introduction to the Special Issue ;Slope Tectonics: Inherited Structures, Morphology of Deformation and Catastrophic Failure;

Science.gov (United States)

Hermanns, R. L.; Oppikofer, T.; Jaboyedoff, M.; Clague, J. J.; Scarascia-Mugnozza, G.

2017-07-01

The "Conference on Slope Tectonics" has become an international scientific meeting point to present and discuss a variety of topics related to slope deformation and the deposits of related failures. The first conference took place on February 15-16, 2008 at University of Lausanne (Switzerland). It was followed by a second conference on September 6-10, 2011, in Austria (organized by the Geological Survey of Austria) and a third on September 8-12, 2014, in Norway (organized by the Geological Survey of Norway). The two later events included field trips. It has become a tradition that selected papers from these conference are published - papers from the first conference were published by the Geological Society as Special Publication 351 (Jaboyedoff, 2011), and those from the second conference were published in a special issue of Tectonophysics (Baron and Jaboyedoff, 2013). This special issue of Geomorphology is a collection of papers presented at the Norwegian Conference on Slope Tectonics. This collection of papers focuses on the role of tectonics in gravitationally induced rock-slope instabilities. The slopes either deform over long periods as deep-seated gravitational slope deformation (DSGSD) or more rapidly as rockslides or rock avalanches. The reconstruction of slope deformation is an integral part of the studies captured in this special issue.

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.

Towards Equitable and Sustainable Urban Space: Introduction to Special Issue on “Urban Land and Sustainable Development”

Directory of Open Access Journals (Sweden)

Yehua Dennis Wei

2016-08-01

Full Text Available The unprecedented wave of global urbanization has exerted increased pressure on urban land and made land-use sustainability an urgent concern. This Special Issue examines patterns, structures, and dynamics of urban land use from the economic, social, and, to a lesser extent, environmental standpoints, in light of the goal of equitable and sustainable development. This introduction discusses the background and design of the Special Issue and highlights the contribution of the selected papers.

Special issue on compact x-ray sources

Science.gov (United States)

Hooker, Simon; Midorikawa, Katsumi; Rosenzweig, James

2014-04-01

Journal of Physics B: Atomic, Molecular and Optical Physics is delighted to announce a forthcoming special issue on compact x-ray sources, to appear in the winter of 2014, and invites you to submit a paper. The potential for high-brilliance x- and gamma-ray sources driven by advanced, compact accelerators has gained increasing attention in recent years. These novel sources—sometimes dubbed 'fifth generation sources'—will build on the revolutionary advance of the x-ray free-electron laser (FEL). New radiation sources of this type have widespread applications, including in ultra-fast imaging, diagnostic and therapeutic medicine, and studies of matter under extreme conditions. Rapid advances in compact accelerators and in FEL techniques make this an opportune moment to consider the opportunities which could be realized by bringing these two fields together. Further, the successful development of compact radiation sources driven by compact accelerators will be a significant milestone on the road to the development of high-gradient colliders able to operate at the frontiers of particle physics. Thus the time is right to publish a peer-reviewed collection of contributions concerning the state-of-the-art in: advanced and novel acceleration techniques; sophisticated physics at the frontier of FELs; and the underlying and enabling techniques of high brightness electron beam physics. Interdisciplinary research connecting two or more of these fields is also increasingly represented, as exemplified by entirely new concepts such as plasma based electron beam sources, and coherent imaging with fs-class electron beams. We hope that in producing this special edition of Journal of Physics B: Atomic, Molecular and Optical Physics (iopscience.iop.org/0953-4075/) we may help further a challenging mission and ongoing intellectual adventure: the harnessing of newly emergent, compact advanced accelerators to the creation of new, agile light sources with unprecedented capabilities

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.

Toward a Sustainable Low-Carbon China: A Review of the Special Issue of “Energy Economics and Management”

Directory of Open Access Journals (Sweden)

Ning Zhang

2016-08-01

Full Text Available Severe environmental quality deterioration, along with predatory exploitation of energy resources, are generally associated with economic growth, especially in China. Against this background, the 6th Annual Conference of Energy Economics and Management provides a platform for examining outperforming governance factors and mechanisms of energy economics and policy. Thanks to Sustainability for providing this special issue. This editorial highlights the contents and methodologies of the special issue for this conference, presenting diverse issues in energy economics and management. We also suggest guidelines for future study in energy economics and management.

Information-optimal genome assembly via sparse read-overlap graphs.

Science.gov (United States)

Shomorony, Ilan; Kim, Samuel H; Courtade, Thomas A; Tse, David N C

2016-09-01

In the context of third-generation long-read sequencing technologies, read-overlap-based approaches are expected to play a central role in the assembly step. A fundamental challenge in assembling from a read-overlap graph is that the true sequence corresponds to a Hamiltonian path on the graph, and, under most formulations, the assembly problem becomes NP-hard, restricting practical approaches to heuristics. In this work, we avoid this seemingly fundamental barrier by first setting the computational complexity issue aside, and seeking an algorithm that targets information limits In particular, we consider a basic feasibility question: when does the set of reads contain enough information to allow unambiguous reconstruction of the true sequence? Based on insights from this information feasibility question, we present an algorithm-the Not-So-Greedy algorithm-to construct a sparse read-overlap graph. Unlike most other assembly algorithms, Not-So-Greedy comes with a performance guarantee: whenever information feasibility conditions are satisfied, the algorithm reduces the assembly problem to an Eulerian path problem on the resulting graph, and can thus be solved in linear time. In practice, this theoretical guarantee translates into assemblies of higher quality. Evaluations on both simulated reads from real genomes and a PacBio Escherichia coli K12 dataset demonstrate that Not-So-Greedy compares favorably with standard string graph approaches in terms of accuracy of the resulting read-overlap graph and contig N50. Available at github.com/samhykim/nsg courtade@eecs.berkeley.edu or dntse@stanford.edu Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

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

The impacts and acceptance of agricultural biotechnology: an introduction to the special issue

NARCIS (Netherlands)

Zilberman, D.; Wesseler, J.H.H.

2014-01-01

Attitudes towards and acceptance of agricultural biotechnology, which involves inserting genes that carry new traits into existing varieties, has been subject to much debate. This special issue aims to address several gaps in the literature on genetically modified (GM) technology in agriculture.

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

GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics1

Energy Technology Data Exchange (ETDEWEB)

Simmhan, Yogesh; Kumbhare, Alok; Wickramaarachchi, Charith; Nagarkar, Soonil; Ravi, Santosh; Raghavendra, Cauligi; Prasanna, Viktor

2014-08-25

Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ratio and slow convergence of iterative superstep. In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters. We introduce a sub-graph centric programming abstraction that combines the scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation.

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.

Putting Emotion into the Self: A Response to the 2008 "Journal of Moral Education" Special Issue on Moral Functioning

Science.gov (United States)

Kristjansson, Kristjan

2009-01-01

This paper takes as its starting point the Journal of Moral Education Special Issue (September, 2008, 37[3]) "Towards an integrated model of moral reasoning". Although explicitly post-Kohlbergian, the authors in this Special Issue do not, I argue, depart far enough from Kohlberg's impoverished notion of the role of the affective in moral life--or…

Special issue photovoltaic

International Nuclear Information System (INIS)

2004-01-01

In this letter of the INES (french National Institute of the Solar Energy), a special interest is given to photovoltaic realizations in Europe. Many information are provided on different topics: the China future fifth world producer of cells in 2005, batteries and hydrogen to storage the solar energy and a technical sheet on a photovoltaic autonomous site installation for electric power production. (A.L.B.)

Psychosocial Studies of Migration and Community: Introduction to the Special Issue

Directory of Open Access Journals (Sweden)

Douglas D. Perkins

2011-11-01

Full Text Available Introducing the special issue on psychosocial studies of migration and community, we briefly reflect on the global increase in, and issues related to, both international and domestic migration, particularly from rural areas of less developed countries, which has fueled rapid urbanization and intercultural tensions in both post-industrial and developing countries. Topics covered in the issue are summarized, including an Italian study of the emotional impact of discrimination against immigrant adolescents; acculturation, integration and adaptation of Muslim immigrant youth in New Zealand; perceptions of human trafficking in Moldova; Chinese migrant workers´ social networks, life satisfaction and political participation; physician brain drain from sub-Saharan Africa; and a critical analysis of the oppressive and liberating impact of organizations on immigrants, multiculturalism, and social justice. The issue concludes with commentary articles by four leading international scholars of migration and community. The breadth of topics helps to address wide-ranging gaps in the literature, but more psychological and social research must connect ecologically across multiple levels and to cultural, political, economic, and environmental studies of migration and community.

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

Special Issue: 14th International Symposium on Novel and Nano Materials

Science.gov (United States)

Kim, Woo-Byoung; Choa, Yong-Ho; Ahn, Hyo-Jin; Park, Il-Kyu

2017-09-01

This Special Issue of Applied Surface Science is intended to provide a collection of peer-reviewed contributions presented at the 14th International Symposium on Novel Nano Materials (ISNNM) held in Budapest, Hungary as one of the most beautiful cities in Europe from July 3 to July 8, 2016. All selected papers underwent the regular peer review process as set by the journal of Applied Surface Science and its publisher (Elsevier).

Special cluster issue on tribocorrosion of dental materials

Science.gov (United States)

Mathew, Mathew T.; Stack, Margaret M.

2013-10-01

Tribocorrosion affects all walks of life from oil and gas conversion to biomedical materials. Wear can interact with corrosion to enhance it or impede it; conversely, corrosion can enhance or impede wear. The understanding of the interactions between physical and chemical phenomena has been greatly assisted by electrochemical and microscopic techniques. In dentistry, it is well recognized that erosion due to dissolution (a term physicists use to denote wear) of enamel can result in tooth decay; however, the effects of the oral environment, i.e. pH levels, electrochemical potential and any interactions due to the forces involved in chewing are not well understood. This special cluster issue includes investigations on the fundamentals of wear-corrosion interactions involved in simulated oral environments, including candidate dental implant and veneer materials. The issue commences with a fundamental study of titanium implants and this is followed by an analysis of the behaviour of commonly used temporomandibular devices in a synovial fluid-like environment. The analysis of tribocorrosion mechanisms of Ti6Al4V biomedical alloys in artificial saliva with different pHs is addressed and is followed by a paper on fretting wear, on hydroxyapatite-titanium composites in simulated body fluid, supplemented with protein (bovine serum albumin). The effects of acid treatments on tooth enamel, and as a surface engineering technique for dental implants, are investigated in two further contributions. An analysis of the physiological parameters of intraoral wear is addressed; this is followed by a study of candidate dental materials in common beverages such as tea and coffee with varying acidity and viscosity and the use of wear maps to identify the safety zones for prediction of material degradation in such conditions. Hence, the special cluster issue consists of a range of tribocorrosion contributions involving many aspects of dental tribocorrosion, from analysis of physiological

Preface to special issue of selected papers from Theoretical, Experimental, and Computational Mechanics (TECM)

DEFF Research Database (Denmark)

Jabbari, Masoud; Sarlak Chivaee, Hamid; Hattel, Jesper Henri

2017-01-01

We are pleased to introduce this special issue of the Applied Mathematical Modelling journal with highlights from theTheoretical, Experimental, and Computational Mechanics Symposium (TECM-2015). This special issue consists of four rigorouslyselected papers originally presented at TECM-2015...... as a part of the 13th International Conference of Numerical Analysisand Applied Mathematics 2015 (ICNAAM 2015), which was held on 23-29 September 2015 in Rhodes, Greece.The symposium attracted a broad range of international and local leaders in theoretical, experimental, and computational mechanics across...... various fields and application. The symposium did an excellent job of outlining the current landscape of computational mechanics and its capabilities in solving complex industrial problems in the process industries, and we agree with the editor-in-chief of the journal that it is certainly worthwhile...

Introduction to the special issue: Observed and projected changes in weather and climate extremes

Directory of Open Access Journals (Sweden)

John E. Hay

2016-03-01

Full Text Available This Special Issue documents not only the more recent progress made in detecting and attributing changes in temperature and precipitation extremes in the observational record, but also in projecting changes in such extremes at regional and local scales. It also deals with the impacts and other consequences and implications of both the historic and anticipated changes in extreme weather and climate events. Impact assessments using both dynamical downscaling and statistical modelling for two tropical cyclones are reported, as well as for storm surge and extreme wave changes. The Special Issue concludes with a consideration of some policy implications and practical applications arising from our relatively robust understanding of how the build up of greenhouse gases in the Earth’s atmosphere affects weather and climate extremes.

Virtual Reality and Its Potential Use in Special Education. Identifying Emerging Issues and Trends in Technology for Special Education.

Science.gov (United States)

Woodward, John

As part of a 3-year study to identify emerging issues and trends in technology for special education, this paper addresses the possible contributions of virtual reality technology to educational services for students with disabilities. An example of the use of virtual reality in medical imaging introduces the paper and leads to a brief review of…

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.

Special issue “International Geomagnetic Reference Field—the twelfth generation”

OpenAIRE

Thébault, E.; Finlay, C. C.; Toh, H.

2015-01-01

This special issue of Earth, Planets and Space, synthesizes the efforts made during the construction of the twelfth generation of the International Geomagnetic Reference Field (IGRF-12) that was released online in December 2014 (http://www.ngdc.noaa.gov/IAGA/vmod/ igrf.html). The IGRF-12 is a series of standard mathematical models describing the large scale internal part of the Earth’s magnetic field between epochs 1900.0 and 2015.0 with a forecast to epoch 2020.0. This activity has been main...

Special Issue: Software-engineering, Properites of Language and Aspect Technologies

DEFF Research Database (Denmark)

Bergmans, Lodewijk; Gybels, Kris; Ernst, Erik

2008-01-01

, comprehensibility and evolvability. As (aspect) languages are being pushed to meet their boundaries and limitations, the trade-offs in language design become increasingly difficult to make. In particular, a trade-off may be perfectly sensible in one application context, but much less so in another. In this special...... issue you will find three full papers, originating from the SPLAT workshop series, that address this last issue. Each of these papers resolves a fundamental language design trade-off by offering a language mechanism that lifts the design decisions to the application programmers: The first paper, "User......-Defined Join Point Selectors-An Extension Mechanism for Pointcut Languages" by Breuel and Reverbel, addresses the fact that aspect programmers are pushing the boundaries of pointcut languages. As a result, aspect language designers have to make a trade-off between limited expressiveness of traditional types...

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)

Graph theory favorite conjectures and open problems 1

CERN Document Server

Hedetniemi, Stephen; Larson, Craig

2016-01-01

This is the first in a series of volumes, which provide an extensive overview of conjectures and open problems in graph theory. The readership of each volume is geared toward graduate students who may be searching for research ideas. However, the well-established mathematician will find the overall exposition engaging and enlightening. Each chapter, presented in a story-telling style, includes more than a simple collection of results on a particular topic. Each contribution conveys the history, evolution, and techniques used to solve the authors’ favorite conjectures and open problems, enhancing the reader’s overall comprehension and enthusiasm. The editors were inspired to create these volumes by the popular and well attended special sessions, entitled “My Favorite Graph Theory Conjectures," which were held at the winter AMS/MAA Joint Meeting in Boston (January, 2012), the SIAM Conference on Discrete Mathematics in Halifax (June,2012) and the winter AMS/MAA Joint meeting in Baltimore(January, 2014). In...

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.

Research Article Special Issue

African Journals Online (AJOL)

2016-05-15

May 15, 2016 ... Near-fault earthquake issue is almost a new issue in earthquake engineering. ... although those countries had advanced regulations for seismic design of ... allocating the plastic joints according to development guideline and ...

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.

“Introduction to Coolabah special issue on placescape, placemaking, placemarking, placedness … geography and cultural production”

Directory of Open Access Journals (Sweden)

Bill Boyd

2013-10-01

Full Text Available This special issue of the journal Coolabah comprises contributed papers that examine the relationships between place, placescape and landscape – Australian places and imaginings. Australian perspectives of place and cultural production unavoidably confront issues of identity simultaneously from antipodean and elsewhere vantage points.

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

Disaster Mental Health and Positive Psychology-Considering the Context of Natural and Technological Disasters: An Introduction to the Special Issue.

Science.gov (United States)

Schulenberg, Stefan E

2016-12-01

This article serves as an introduction to the Journal of Clinical Psychology's special issue on disaster mental health and positive psychology. The special issue comprises two sections. The first section presents a series of data-driven articles and research-informed reviews examining meaning and resilience in the context of natural and technological disasters. The second section presents key topics in the area of disaster mental health, with particular relevance for positive psychology and related frameworks. The special issue is intended to bridge the gap between these two areas of applied science, with the audience being experienced clinicians or clinicians in training. © 2016 Wiley Periodicals, Inc.

A Comparative Study of Theoretical Graph Models for Characterizing Structural Networks of Human Brain

Directory of Open Access Journals (Sweden)

Xiaojin Li

2013-01-01

Full Text Available Previous studies have investigated both structural and functional brain networks via graph-theoretical methods. However, there is an important issue that has not been adequately discussed before: what is the optimal theoretical graph model for describing the structural networks of human brain? In this paper, we perform a comparative study to address this problem. Firstly, large-scale cortical regions of interest (ROIs are localized by recently developed and validated brain reference system named Dense Individualized Common Connectivity-based Cortical Landmarks (DICCCOL to address the limitations in the identification of the brain network ROIs in previous studies. Then, we construct structural brain networks based on diffusion tensor imaging (DTI data. Afterwards, the global and local graph properties of the constructed structural brain networks are measured using the state-of-the-art graph analysis algorithms and tools and are further compared with seven popular theoretical graph models. In addition, we compare the topological properties between two graph models, namely, stickiness-index-based model (STICKY and scale-free gene duplication model (SF-GD, that have higher similarity with the real structural brain networks in terms of global and local graph properties. Our experimental results suggest that among the seven theoretical graph models compared in this study, STICKY and SF-GD models have better performances in characterizing the structural human brain network.

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

Special Issue “Actuarial and Financial Risks in Life Insurance, Pensions and Household Finance”

Directory of Open Access Journals (Sweden)

Luca Regis

2017-12-01

Full Text Available The aim of the Special Issue is to address some of the main challenges individuals and companies face in managing financial and actuarial risks, when dealing with their investment/retirement or business-related decisions [...

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

Computing paths and cycles in biological interaction graphs

Directory of Open Access Journals (Sweden)

von Kamp Axel

2009-06-01

Full Text Available Abstract Background Interaction graphs (signed directed graphs provide an important qualitative modeling approach for Systems Biology. They enable the analysis of causal relationships in cellular networks and can even be useful for predicting qualitative aspects of systems dynamics. Fundamental issues in the analysis of interaction graphs are the enumeration of paths and cycles (feedback loops and the calculation of shortest positive/negative paths. These computational problems have been discussed only to a minor extent in the context of Systems Biology and in particular the shortest signed paths problem requires algorithmic developments. Results We first review algorithms for the enumeration of paths and cycles and show that these algorithms are superior to a recently proposed enumeration approach based on elementary-modes computation. The main part of this work deals with the computation of shortest positive/negative paths, an NP-complete problem for which only very few algorithms are described in the literature. We propose extensions and several new algorithm variants for computing either exact results or approximations. Benchmarks with various concrete biological networks show that exact results can sometimes be obtained in networks with several hundred nodes. A class of even larger graphs can still be treated exactly by a new algorithm combining exhaustive and simple search strategies. For graphs, where the computation of exact solutions becomes time-consuming or infeasible, we devised an approximative algorithm with polynomial complexity. Strikingly, in realistic networks (where a comparison with exact results was possible this algorithm delivered results that are very close or equal to the exact values. This phenomenon can probably be attributed to the particular topology of cellular signaling and regulatory networks which contain a relatively low number of negative feedback loops. Conclusion The calculation of shortest positive

Special Issue: New trends and applications on hybrid artificial intelligence systems

OpenAIRE

Corchado Rodríguez, Emilio; Graña Romay, Manuel; Woźniak, MichaŁ

2017-01-01

This Special Issue is an outgrowth of the HAIS'10, the 5th International Conference on Hybrid Artificial Intelligence Systems, which was held in San Sebastián, Spain, 23–25 June 2010. The HAIS conference series is devoted to the presentation of innovative techniques involving the hybridization of emerging and active topics in data mining and decision support systems, information fusion, evolutionary computation, visualization techniques, ensemble models, intelligent agent-based systems (compl...

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.

Introduction to the Special Issue on Specification Analysis and Verification of Reactive Systems

NARCIS (Netherlands)

Delzanno, Giorgio; Etalle, Sandro; Gabbrielli, Maurizio

2006-01-01

This special issue is inspired by the homonymous ICLP workshops that took place during ICLP 2001 and ICLP 2002. Extending and shifting slightly from the scope of their predecessors (on verification and logic languages) held in the context of previous editions of ICLP, the aim of the SAVE workshops

Preface [Special issue on dataTEL – Data Supported Research in Technology-Enhanced Learning

NARCIS (Netherlands)

Drachsler, Hendrik; Verbert, Katrien; Manouselis, Nikos; Vuorikari, Riina; Wolpers, Martin; Lindstaedt, Stefanie

2012-01-01

Drachsler, H., Verbert, K., Manouselis, N., Vuorikari, R., Wolpers, M., & Lindstaedt, S. (2012). Preface [Special issue on dataTEL – Data Supported Research in Technology-Enhanced Learning]. International Journal Technology Enhanced Learning, Vol. 4, Nos. 1/2, 2012.

Astrophysical implications of extraterrestrial materials: A special issue for Ernst K. Zinner

Science.gov (United States)

Nittler, Larry R.

2018-01-01

This special issue is dedicated to the memory of Dr. Ernst K. Zinner (Fig. 1). Dr. Zinner (1937-2015) was a pioneer in the use of Secondary Ion Mass Spectrometry (SIMS) in geo- and cosmochemistry. His contributions to science were vast, but in addition to his foundational SIMS development work, he is best known for the discovery and detailed characterization of presolar stardust grains in meteorites. This discovery opened up important new connections between astrophysics and meteoritical research and this is the overarching theme of this issue. Throughout his career, Ernst was a teacher, mentor, friend, and generous collaborator to legions of scientists. This issue presents research by many who were taught by, inspired by, and/or collaborated with this innovative cosmochemist and astrophysicist. In addition to the author, Ernst's former students and collaborators Drs. Christine Floss (Washington University) Peter Hoppe (MPI for chemistry, Mainz, Germany), and Kevin McKeegan (University of California, Los Angeles) served as Guest Editors for this issue.

Preface of the Special Issue: “Recent CMV Research”

Directory of Open Access Journals (Sweden)

Kayla Dufrene

2014-01-01

Full Text Available This Viruses Special Issue on Recent Cytomegalovirus (CMV Research is dedicated to the patients who have suffered CMV infection and to their parents, families and caregivers. We are including as a Preface to this issue the insights of a young college student, Kayla Dufrene, who suffered congenital CMV infection and contacted me and Dr. Roberta DeBiasi, to interview us to learn more about CMV. As I was just returning to the DC area from the 4th Congenital CMV Conference in San Francisco, I was particularly receptive to her request. When we met Kayla, we were both impressed with her personal strength and ability to cope with her disabilities and needed medical treatments. Despite it all, Kayla has an exceptionally positive outlook on life, feeling even lucky. She has not only coped, but has transcended her difficulties. I am proud to say that she was on the Dean’s List (Figure 1 at Gallaudet University. Ultimately, her hope lies in our fields’ efforts to develop a vaccine to prevent CMV disease in other children.

EDITORIAL: Special issue featuring articles arising from the 11th High-Tech Plasma Processes Conference Special issue featuring articles arising from the 11th High-Tech Plasma Processes Conference

Science.gov (United States)

Bruggeman, Peter; Degrez, Gérard; Delplancke, Marie-Paule; Gleizes, Alain

2011-05-01

The 11th High-Tech Plasma Processes Conference (HTPP) was held in Brussels, Belgium, 27 June-2 July, 2010. HTPP started as a thermal plasma conference and gradually expanded to include low-temperature plasmas. The conference was founded by Jacques Amouroux and Pierre Fauchais, and aims to bring together different scientific communities to facilitate contacts between science, technology and industry, providing a platform for the exploration of elementary processes and applications in and by plasmas. The first HTPP was held in Odeillo, France, in 1990. Since then it has been held every other year in different European cities: Paris, Aachen, Athens, Strasbourg, Saint-Petersburg, Patras and Brussels. The 11th HTPP conference was attended by 125 participants from 19 countries. The program involved 14 invited talks, 34 contributed talks, 72 posters and a software demonstration and hands-on session for plasma modelling. The 12th HTPP conference will be held 24-28 June 2012, in Bologna, Italy. A larger part of the contributions to the 11th HTPP has been published in the Journal of Physics: Conference Series (JPCS) volume 275, 2011. All invited speakers and other contributors, as selected by the Steering, Scientific and Organizing Committee, were invited to submit a paper based on their contributions for this special issue which is peer reviewed by the journal. Both this special issue and the JPCS volume aim to bring the 11th HTPP to a wider audience. The publications are a nice example of the broad topic range of the conference. The JPCS volume contains papers covering fundamental aspects on radiative processes of thermal plasmas, modelling of thermal arcs and non-thermal RF plasma jets, plasma diagnostics including flow and heat flux measurements of thermal plasmas, radical density measurements and laser-induced breakdown spectroscopy. The applications-oriented contributions of the JPCS volume include plasma spraying, synthesis of (nano-sized) materials, surface

Research Article Special Issue

African Journals Online (AJOL)

pc

2017-10-17

Oct 17, 2017 ... delivery system which are primary care, secondary care, tertiary care, ..... services are usually delivered by nurse practitioners, medical assistants, ... The quaternary care is a highly specialized care with a target to cure.

Research Article Special Issue

African Journals Online (AJOL)

2016-07-16

Jul 16, 2016 ... In this research, two questionnaires of knowledge management and employees' ... development, human resources are the most important tool and capital of ... foster talent, to improve public and specialized awareness, and to ...

Research Article Special Issue

African Journals Online (AJOL)

pc

2018-05-01

May 1, 2018 ... quantitative method used, data analysis and findings of Telehealth ... The users' acceptance of wireless sensor devise (Motes) for ..... access to specialized health care: the Telehealth Network of Minas Gerais, Brazil. Bulletin ...

Research Article Special Issue

African Journals Online (AJOL)

2017-09-07

Sep 7, 2017 ... special experience of urban environments in the development process. ... Internet and social networking, and eventually poor performance of the police .... was shown that different regions have different levels of fear of crime.

Overview of the Health and Retirement Study and Introduction to the Special Issue.

Science.gov (United States)

Fisher, Gwenith G; Ryan, Lindsay H

2018-01-01

Twenty five years ago, the largest academic behavioral and social science project ever undertaken in the U.S. began: the Health and Retirement Study (HRS). The HRS is an invaluable publicly available dataset for investigating work, aging, and retirement and informing public policy on these issues. This biennial longitudinal study began in 1992 and has studied more than 43,000 individuals and produced almost 4000 journal articles, dissertations, books, book chapters, and reports to date. The purpose of this special issue of Work, Aging and Retirement is to describe the HRS and highlight relevant research that utilizes this rich and complex dataset. First, we briefly describe the background that led to the development of the HRS. Then we summarize key aspects of the study, including its development, sampling, and methodology. Our review of the content of the survey focuses on the aspects of the study most relevant to research on worker aging and retirement. Next, we identify key strengths and important limitations of the study and provide advice to current and future HRS data users. Finally, we summarize the articles in this Special Issue (all of which use data from the HRS) and how they advance our knowledge and understanding of worker aging and retirement.

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.

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

Preface to the Special Issue on "Geophysical and Climate Change Studies in Tibet, Xinjiang, and Siberia (TibXS from Satellite Geodesy"

Directory of Open Access Journals (Sweden)

Cheinway Hwang

2013-01-01

Full Text Available This special issue publishes papers on recent results in geophysical and climate change studies over Tibet, Xinjiang and Siberia (TibXS based upon some of the key sensors used in satellite geodesy, including satellite gravimetric sensors (GRACE and GOCE, satellite altimeters (TOPEX, Jason-1 and -2, and ENVISAT, and Global Positioning System satellites. Results from ground- and airborne-based geodetic observations, notably those based on airborne gravimeter, superconducting gravimeter (SG and seismometers are also included in the special issue. In all, 22 papers were submitted for this special issue; 17 papers were accepted.

The Context of Current Content Analysis of Gender Roles: An Introduction to a Special Issue

Science.gov (United States)

Popova, Lucy; Linz, Daniel G.

2010-01-01

The aim of this paper is to provide context for the quantitative content analyses of gender roles that are to be included in both parts of this special issue. First, a timeline of historical uses of the content analysis methodology is presented. Second, research objectives that frequently drive content analysis of gender roles are described; these include: to support feminist claims, to compare media with real life, to predict effects on audiences, and to detect effects of media producers on content. Third, previous content analyses published in Sex Roles and other gender-focused journals are reviewed and categorized in terms of medium, genre, time span, gender, and nationality. Finally, contributions of each of the articles in this special issue are outlined. PMID:20694031

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

Special Issue: Recent Progress in the Vertical Coupling in the Atmosphere-Ionosphere System\

Czech Academy of Sciences Publication Activity Database

Pancheva, D.; Shiokawa, K.; Knížová, Petra; Wan, W.

90-91, Special Issue (2012), s. 5-6 ISSN 1364-6826 Institutional support: RVO:68378289 Keywords : ionosphere * neutral atmosphere * atmospheric waves Subject RIV: DG - Athmosphere Sciences, Meteorology OBOR OECD: Meteorology and atmospheric sciences Impact factor: 1.417, year: 2012 http://www.sciencedirect.com/science/article/pii/S1364682612002581?via%3Dihub

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

Research Article Special Issue

African Journals Online (AJOL)

2017-09-10

. Special ... is 4000 pps, in 1 ms there are 4 sampling intervals. Fig. .... Although this type of radar is simple, generally it is not very sensitive because of increased ... processing) to determine the true sign of Doppler frequency.

Research Article Special Issue

African Journals Online (AJOL)

2016-07-18

Jul 18, 2016 ... and 1340s, centralization and organizational unity in the early 1350s, ... appropriate productivity in specialized costs of welfare and social ..... and finally the lack of compliance with commitments by the government to the social.

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.

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.

A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS Problem

Directory of Open Access Journals (Sweden)

Zhan Peng

2017-08-01

Full Text Available Searching for the Multiple Longest Common Subsequences (MLCS of multiple sequences is a classical NP-hard problem, which has been used in many applications. One of the most effective exact approaches for the MLCS problem is based on dominant point graph, which is a kind of directed acyclic graph (DAG. However, the time and space efficiency of the leading dominant point graph based approaches is still unsatisfactory: constructing the dominated point graph used by these approaches requires a huge amount of time and space, which hinders the applications of these approaches to large-scale and long sequences. To address this issue, in this paper, we propose a new time and space efficient graph model called the Leveled-DAG for the MLCS problem. The Leveled-DAG can timely eliminate all the nodes in the graph that cannot contribute to the construction of MLCS during constructing. At any moment, only the current level and some previously generated nodes in the graph need to be kept in memory, which can greatly reduce the memory consumption. Also, the final graph contains only one node in which all of the wanted MLCS are saved, thus, no additional operations for searching the MLCS are needed. The experiments are conducted on real biological sequences with different numbers and lengths respectively, and the proposed algorithm is compared with three state-of-the-art algorithms. The experimental results show that the time and space needed for the Leveled-DAG approach are smaller than those for the compared algorithms especially on large-scale and long sequences.

Using Behavior Over Time Graphs to Spur Systems Thinking Among Public Health Practitioners.

Science.gov (United States)

Calancie, Larissa; Anderson, Seri; Branscomb, Jane; Apostolico, Alexsandra A; Lich, Kristen Hassmiller

2018-02-01

Public health practitioners can use Behavior Over Time (BOT) graphs to spur discussion and systems thinking around complex challenges. Multiple large systems, such as health care, the economy, and education, affect chronic disease rates in the United States. System thinking tools can build public health practitioners' capacity to understand these systems and collaborate within and across sectors to improve population health. BOT graphs show a variable, or variables (y axis) over time (x axis). Although analyzing trends is not new to public health, drawing BOT graphs, annotating the events and systemic forces that are likely to influence the depicted trends, and then discussing the graphs in a diverse group provides an opportunity for public health practitioners to hear each other's perspectives and creates a more holistic understanding of the key factors that contribute to a trend. We describe how BOT graphs are used in public health, how they can be used to generate group discussion, and how this process can advance systems-level thinking. Then we describe how BOT graphs were used with groups of maternal and child health (MCH) practitioners and partners (N = 101) during a training session to advance their thinking about MCH challenges. Eighty-six percent of the 84 participants who completed an evaluation agreed or strongly agreed that they would use this BOT graph process to engage stakeholders in their home states and jurisdictions. The BOT graph process we describe can be applied to a variety of public health issues and used by practitioners, stakeholders, and researchers.

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.

Research Article Special Issue

African Journals Online (AJOL)

pc

Published online: 1 May 2018. ABSTRACT ... CMOS technology with many special features that can overcome all the limitations in CMOS. QCA is of high speed, small size ... is done depending on position of single electrons. This shows that ...

Research Article Special Issue

African Journals Online (AJOL)

pc

2018-05-01

May 1, 2018 ... such as the athletes. This is done through gene doping, ... reduced risk of injury and drug abuse, talent selection through DNA and special training ..... GJB2 gene among Malays with non-syndromic hearing loss. International ...

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

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

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

Introduction to the Special Issue on Autism Spectrum Disorders Approaches to Training, Teaching, and Treatment

Directory of Open Access Journals (Sweden)

Kamil ÖZERK

2016-12-01

Full Text Available The strength of an educational system rests in its design and implementation. Part of what informs the design process is knowledge of student needs and valued goals and outcomes. As systems are designed, research evidence informs the implementation process. We are pleased to present a series of articles in this special issue that will aide special educators and administrators design and implement effective educational systems for children with autism spectrum disorders.

Introduction to the Special Issue on Inequality in the Digital Environment

Directory of Open Access Journals (Sweden)

Roderick Graham

2013-11-01

Full Text Available The purpose of this special issue is to explore social inequalities in the digital environment. The motivation for this issue is derived from the disproportionate focus on technological and economic aspects of the Information Society to the detriment of sociological and cultural aspects. The research presented here falls along three dimensions of inequality. Two papers explore the ways that race orders interaction online. A second pair of papers explores the experiences of technology users with physical and mental disabilities. A final paper looks at gender, and the higher rates of intimate partner violence experienced by women online. Taken as a whole, these five papers highlight some of the ways that the digital environment can reproduce or mitigate inequalities that have been molded and routinized in the physical environment.

Research Article Special Issue

African Journals Online (AJOL)

2016-05-15

May 15, 2016 ... of specific musical terms; attention to the Quran and Ahl al-Bayt and special devotion to ... Another factor that plays a role in making the poetry of Shahriar .... world, they start reading the masterpieces of world literature and ...

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

EDITORIAL: Special issue: overview reports from the Fusion Energy Conference (FEC) (Daejeon, South Korea, 2010) Special issue: overview reports from the Fusion Energy Conference (FEC) (Daejeon, South Korea, 2010)

Science.gov (United States)

Thomas, Paul

2011-09-01

The group of 27 papers published in this special issue of Nuclear Fusion aims to monitor the worldwide progress made in the period 2008-2010 in the field of thermonuclear fusion. Of these papers, 22 are based on overview reports presented at the 23rd Fusion Energy Conference (FEC 2010) and five are summary reports. The conference was hosted by the Republic of Korea and organized by the IAEA in cooperation with the National Fusion Research Institute and the Daejeon Metropolitan City. It took place in Daejeon on 11-16 October 2010. The overviews presented at the conference have been rewritten and extended for the purpose of this special issue and submitted to the standard double-referee peer-review of Nuclear Fusion. The articles are placed in the following sequence: Conference summaries of the sessions devoted to: Tokamak and stellarator experiments, experimental divertor physics and plasma wall interaction experiments, stability experiments and waves and fast particles; ITER activities, fusion technology, safety and economics; Magnetic confinement theory and modelling; Inertial confinement fusion; Innovative confinement concepts, operational scenarios and confinement. Overview articles, presented in programme order, are as follows: Tokamaks Overview of KSTAR initial experiments; Recent progress in RF heating and long-pulse experiments on EAST; Overview of JET results; DIII-D contributions toward the scientific basis for sustained burning plasmas; Overview of JT-60U results toward the resolution of key physics and engineering issues in ITER and JT-60SA; Overview of physics results from NSTX; Overview of ASDEX Upgrade results; Overview of physics results from MAST; Contribution of Tore Supra in preparation of ITER; Overview of FTU results; Overview of experimental results on the HL-2A tokamak; Progress and scientific results in the TCV tokamak; Overview of the JT-60SA project; Recent results of the T-10 tokamak; The reconstruction and research progress of the TEXT

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

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

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

Introduction to the special issue - Labor Market Outcomes : A Transatlantic Perspective

OpenAIRE

Arnaud CHERON; François LANGOT

2009-01-01

The ADRES conference "Labor market outcomes: a transatlantic perspective" took place in Paris, in January 2008. It was jointly organized by the University of Le Mans and the EDHEC Business School. Approximately 40 papers were presented in plenary and parallel sessions. The plenary speakers were G. Berola, P. Cahuc, F. Kramarz, L. Ljungqvist, E. Prescott, R. Rogerson, R. Shimer, V. Rios-Rull, E. Wasmer and C. Zimmerman. A selection of the papers are published in this special issue of the "Anna...

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

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

Research Article Special Issue

African Journals Online (AJOL)

pc

2017-08-08

Aug 8, 2017 ... Special attention is paid to human capital agglomeration, which is regarded as a .... the innovation sector, on the periphery of the ... Agglomeration is an effective form of concentration of human capital, intellectual ... participants of social relations (public, entrepreneurs) or the formation of clusters, emerging.

Graph theory applied to noise and vibration control in statistical energy analysis models.

Science.gov (United States)

Guasch, Oriol; Cortés, Lluís

2009-06-01

A fundamental aspect of noise and vibration control in statistical energy analysis (SEA) models consists in first identifying and then reducing the energy flow paths between subsystems. In this work, it is proposed to make use of some results from graph theory to address both issues. On the one hand, linear and path algebras applied to adjacency matrices of SEA graphs are used to determine the existence of any order paths between subsystems, counting and labeling them, finding extremal paths, or determining the power flow contributions from groups of paths. On the other hand, a strategy is presented that makes use of graph cut algorithms to reduce the energy flow from a source subsystem to a receiver one, modifying as few internal and coupling loss factors as possible.

A special issue devoted to gold deposits in northern Nevada: Part 2. Carlin-type Deposits

Science.gov (United States)

Hofstra, Albert H.; John, David A.; Theodore, Ted G.

2003-01-01

This is the second of two special issues of Economic Geology devoted to gold deposits in northern Nevada. Readers interested in a general overview of these deposits, their economic significance, their context within the tectonic evolution of the region, and synoptic references on each gold deposit type are directed to the preface of the first special issue (John et al., 2003). Volume 98, issue 2, contains five papers that address regional aspects important to the genesis of gold deposits in northern Nevada and five papers that present detailed studies of epithermal deposits and districts. All of the regional papers are pertinent to Carlin-type gold deposits, because they address the age of mineralization (Arehart et al., 2003), origin and evolutionary history of the northwest-striking mineral belts that localize many deposits (Grauch et al., 2003), nature of the middle and lower crust below these mineral belts (Howard, 2003), district- to deposit-scale stream sediment and lithogeochemical anomalies (Theodore et al., 2003), and stratigraphy and structure of a district located along a northeast-striking lineament (Peters et al., 2003).

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.

Research Article Special Issue

African Journals Online (AJOL)

pc

2018-04-18

Apr 18, 2018 ... WORLD THROUGH THE PRISM OF THE INTERNATIONAL FESTIVAL ... It has been explored by many a Russian and foreign researcher. ... attempt to focus, instead of going back to the analysis of past experience, on the subject from ... intercultural interaction between various nations, was given special ...

Research Article Special Issue

African Journals Online (AJOL)

2017-02-15

Feb 15, 2017 ... they have no special development plan and their authorities actually do not know about the ... Keywords: Converted villages to city centers, urban network, SWOT analysis, ... rural areas and can decrease regional differences in developing ... Small scale cities are necessary for integration of rural and urban.

Graph Quasicontinuous Functions and Densely Continuous Forms

Directory of Open Access Journals (Sweden)

Lubica Hola

2017-07-01

Full Text Available Let $X, Y$ be topological spaces. A function $f: X \\to Y$ is said to be graph quasicontinuous if there is a quasicontinuous function $g: X \\to Y$ with the graph of $g$ contained in the closure of the graph of $f$. There is a close relation between the notions of graph quasicontinuous functions and minimal usco maps as well as the notions of graph quasicontinuous functions and densely continuous forms. Every function with values in a compact Hausdorff space is graph quasicontinuous; more generally every locally compact function is graph quasicontinuous.

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

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.

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.

Research Article Special Issue

African Journals Online (AJOL)

2016-06-15

Jun 15, 2016 ... International License. ... confirmatory factor analysis which is a technique to study the structure of a ... School as a social institution is part of a special community that has ... specifies the amount of support that teacher thinks that students ..... social adjustment and academic performance in third grade female ...

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.

Special Issue “50th Anniversary of the Kohn–Sham Theory—Advances in Density Functional Theory”

Directory of Open Access Journals (Sweden)

Ágnes Nagy

2016-11-01

Full Text Available The properties of many materials at the atomic scale depend on the electronic structure, which requires a quantum mechanical treatment. The most widely used approach to make such a treatment feasible is density functional theory (DFT, the advances in which were presented and discussed during the DFT conference in Debrecen. Some of these issues are presented in this Special Issue.

Special Issue: Aviation Alternative Fuels

Directory of Open Access Journals (Sweden)

Yang Zhang

2014-12-01

Full Text Available The investigation of aviation alternative fuels has increased significantly in recent years in an effort to reduce the environment and climate impact by aviation industry. Special requirements have to be met for qualifying as a suitable aviation fuel. The fuel has to be high in energy content per unit of mass and volume, thermally stable and avoiding freezing at low temperatures. There are also many other special requirements on viscosity, ignition properties and compatibility with the typical aviation materials. There are quite a few contending alternative fuels which can be derived from coal, natural gas and biomass.[...

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.