Geodesics and Almost Geodesic Cycles in Random Regular Graphs

A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d(G)(u, v) is at least d(C)(u, v) - e(n). Let omega(n) be any function tending to infinity with n. We consider a random d-regular graph on n vertices. We show that almost all pairs of vertices belong to an almost geodesic cycle C with e(n)= log(d-1)log(d-1) n+omega(n) and vertical bar C vertical bar =2 log(d-1) n+O(omega(n)). Along the way, we obtain results on near-geodesic paths. We also give the limiting distribution of the number of geodesics between two random vertices in this random graph. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 66: 115-136, 2011

Distance learning for laboratory practical work in microcontrollers

This paper presents a simple and relatively straightforward solution to the problems of equity in laboratory practical exposure between distance-education students and their traditional, on-campus, fellow cohort. This system has been implemented for the past five years in a university that is amongst the leaders in distance education delivery and has proved to be extremely successful and very well accepted by all students. While the intention was to allow distance education students easy access to the required laboratory practical content of the course, the solution found has proved to have many advantages for the on-campus students. Although this specific implementation is based upon microcontroller technology units in an engineering degree course, the methodology is easily transferable to other disciplines and courses.

Changing times in research? A speculative analysis of refereed contributions to distance education journal from 1980 to 2003

The paper observes a number of possible changes impacting on the field of distance education research and suggests that these are likely to have lead to an increasing interest in research on computer-based instructional design and delivery, and a concomitant decrease in interest in other areas of distance education research. A fairly simple analysis of contributions to Distance Education since 1980 bears out the suggestion. Some opportunities and some threats to distance education as a field are discussed as a consequence of the analysis.

Polyhedral studies for minimum-span graph labelling with integer distance constraints

This paper studies the polytope of the minimum-span graph labelling problems with integer distance constraints (DC-MSGL). We first introduce a few classes of new valid inequalities for the DC-MSGL defined on general graphs and briefly discuss the separation problems of some of these inequalities. These are the initial steps of a branch-and-cut algorithm for solving the DC-MSGL. Following that, we present our polyhedral results on the dimension of the DC-MSGL polytope, and that some of the inequalities are facet defining, under reasonable conditions, for the polytope of the DC-MSGL on triangular graphs.

Modelling regular and estimable inverse demand systems : a distance function approach

To be useful for policy simulation in the current climate of rapid structural change, inverse demand systems must remain regular over substanstial variations in quantities. The distance function is a convenient vehicle for generating such systems. It also allows convenient imposition of prior ideas about the structure of preferences required for realistic policy work. While the distance function directly yields Hicksian inverse demand functions via the Shepard-Hanoch lemma, they are usually explicit in the unobservable level of utility (u), but lack a closed-form representation in terms of the observable variables. Note however that the unobservability of u need not hinder estimation. A simple one-dimensional numerical inversion allows the estimation of the distance function via the parameters of the implied Marshallian inverse demand functions. This paper develops the formal theory for using distance functions in this context, and reports on initial trials on the operational feasibility of the method.

Picture this : a simple graph that reveals much ado about research

Funnel graphs provide a simple, yet highly effective, means to identify key features of an empirical literature. This paper illustrates the use of funnel graphs to detect publication selection bias, identify the existence of genuine empirical effects and discover potential moderator variables that can help to explain the wide variation routinely found among reported research findings. Applications include union–productivity effects, water price elasticities, common currency-trade effects, minimum-wage employment effects, efficiency wages and the price elasticity of prescription drugs.

Malware variant detection using similarity search over sets of control flow graphs

Static detection of polymorphic malware variants plays an important role to improve system security. Control flow has shown to be an effective characteristic that represents polymorphic malware instances. In our research, we propose a similarity search of malware using novel distance metrics of malware signatures. We describe a malware signature by the set of control flow graphs the malware contains. We propose two approaches and use the first to perform pre-filtering. Firstly, we use a distance metric based on the distance between feature vectors. The feature vector is a decomposition of the set of graphs into either fixed size k-sub graphs, or q-gram strings of the high-level source after decompilation. We also propose a more effective but less computationally efficient distance metric based on the minimum matching distance. The minimum matching distance uses the string edit distances between programs' decompiled flow graphs, and the linear sum assignment problem to construct a minimum sum weight matching between two sets of graphs. We implement the distance metrics in a complete malware variant detection system. The evaluation shows that our approach is highly effective in terms of a limited false positive rate and our system detects more malware variants when compared to the detection rates of other algorithms.

The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups

A k-L(2,1)-labelling of a graph G is a mapping f:V(G)→{0,1,2,…,k} such that |f(u)−f(v)|≥2 if uv∈E(G) and f(u)≠f(v) if u,v are distance two apart. The smallest positive integer k such that G admits a k-L(2,1)-labelling is called the λ-number of G. In this paper we study this quantity for cubic Cayley graphs (other than the prism graphs) on dihedral groups, which are called brick product graphs or honeycomb toroidal graphs. We prove that the λ-number of such a graph is between 5 and 7, and moreover we give a characterisation of such graphs with λ-number 5.

Ontogeny of long distance migration

The movements of some long-distance migrants are driven by innate compass headings that they follow on their first migrations (e.g., some birds and insects), while the movements of other first-time migrants are learned by following more experienced conspecifics (e.g., baleen whales). However, the overall roles of innate, learned, and social behaviors in driving migration goals in many taxa are poorly understood. To look for evidence of whether migration routes are innate or learned for sea turtles, here for 42 sites around the world we compare the migration routes of >400 satellite-tracked adults of multiple species of sea turtle with ∼45 000 Lagrangian hatchling turtle drift scenarios. In so doing, we show that the migration routes of adult turtles are strongly related to hatchling drift patterns, implying that adult migration goals are learned through their past experiences dispersing with ocean currents. The diverse migration destinations of adults consistently reflected the diversity in sites they would have encountered as drifting hatchlings. Our findings reveal how a simple mechanism, juvenile passive drift, can explain the ontogeny of some of the longest migrations in the animal kingdom and ensure that adults find suitable foraging sites.

Understanding the critical distance in sparse distributed memory

Modelos de tomada de decisão necessitam refletir os aspectos da psi- cologia humana. Com este objetivo, este trabalho é baseado na Sparse Distributed Memory (SDM), um modelo psicologicamente e neuro- cientificamente plausível da memória humana, publicado por Pentti Kanerva, em 1988. O modelo de Kanerva possui um ponto crítico: um item de memória aquém deste ponto é rapidamente encontrado, e items além do ponto crítico não o são. Kanerva calculou este ponto para um caso especial com um seleto conjunto de parâmetros (fixos). Neste trabalho estendemos o conhecimento deste ponto crítico, através de simulações computacionais, e analisamos o comportamento desta “Critical Distance” sob diferentes cenários: em diferentes dimensões; em diferentes números de items armazenados na memória; e em diferentes números de armazenamento do item. Também é derivada uma função que, quando minimizada, determina o valor da “Critical Distance” de acordo com o estado da memória. Um objetivo secundário do trabalho é apresentar a SDM de forma simples e intuitiva para que pesquisadores de outras áreas possam imaginar como ela pode ajudá-los a entender e a resolver seus problemas.

A Simple Method for Enema Administration in One-Day-Old Broiler Chicks

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A simple and green analytical method for determination of glyphosate in commercial formulations and water by diffuse reflectance spectroscopy

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

On a regular convex solver potential for an elastic-damage constitutive model: a theoretical analysis

This work is related with the proposition of a so-called regular or convex solver potential to be used in numerical simulations involving a certain class of constitutive elastic-damage models. All the mathematical aspects involved are based on convex analysis, which is employed aiming a consistent variational formulation of the potential and its conjugate one. It is shown that the constitutive relations for the class of damage models here considered can be derived from the solver potentials by means of sub-differentials sets. The optimality conditions of the resulting minimisation problem represent in particular a linear complementarity problem. Finally, a simple example is present in order to illustrate the possible integration errors that can be generated when finite step analysis is performed. (C) 2003 Elsevier Ltd. All rights reserved.

The pioneering use of ISSR (Inter Simple Sequence Repeat) in Neotropical anurans: Preliminary assessment of genetic diversity in populations of Physalaemus cuvieri (Amphibia, Leiuperidae)

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Unsupervised manifold learning using Reciprocal kNN Graphs in image re-ranking and rank aggregation tasks

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)