Rings, Group Rings, and Their Graphs

We associate some graphs to a ring R and we investigate the interplay between the ring-theoretic properties of R and the graph-theoretic properties of the graphs associated to R. Let Z(R) be the set of zero-divisors of R. We define an undirected graph ᴦ(R) with nonzero zero-divisors as vertices and distinct vertices x and y are adjacent if xy=0 or yx=0. We investigate the Isomorphism Problem for zero-divisor graphs of group rings RG. Let Sk denote the sphere with k handles, where k is a non-negative integer, that is, Sk is an oriented surface of genus k. The genus of a graph is the minimal integer n such that the graph can be embedded in Sn. The annihilating-ideal graph of R is defined as the graph AG(R) with the set of ideals with nonzero annihilators as vertex such that two distinct vertices I and J are adjacent if IJ=(0). We characterize Artinian rings whose annihilating-ideal graphs have finite genus. Finally, we extend the definition of the annihilating-ideal graph to non-commutative rings.

Swarming on optimized graphs for n-way broadcast

In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective data files. BitTorrent-like swarming protocols are ideal choices for handling such massive data volume transfers. The original BitTorrent targets one-to-many broadcasts of a single file to a very large number of receivers and thus, by necessity, employs an almost random overlay topology. n-way broadcast applications on the other hand, owing to their inherent n-squared nature, are realizable only in small to medium scale networks. In this paper, we show that we can leverage this scale constraint to construct optimized overlay topologies that take into consideration the end-to-end characteristics of the network and as a consequence deliver far superior performance compared to random and myopic (local) approaches. We present the Max-Min and MaxSum peer-selection policies used by individual nodes to select their neighbors. The first one strives to maximize the available bandwidth to the slowest destination, while the second maximizes the aggregate output rate. We design a swarming protocol suitable for n-way broadcast and operate it on top of overlay graphs formed by nodes that employ Max-Min or Max-Sum policies. Using trace-driven simulation and measurements from a PlanetLab prototype implementation, we demonstrate that the performance of swarming on top of our constructed topologies is far superior to the performance of random and myopic overlays. Moreover, we show how to modify our swarming protocol to allow it to accommodate selfish nodes.

A comparison between bond graphs switching modelling techniques implemented on a boost dc-dc converter

A Bond Graph is a graphical modelling technique that allows the representation of energy flow between the components of a system. When used to model power electronic systems, it is necessary to incorporate bond graph elements to represent a switch. In this paper, three different methods of modelling switching devices are compared and contrasted: the Modulated Transformer with a binary modulation ratio (MTF), the ideal switch element, and the Switched Power Junction (SPJ) method. These three methods are used to model a dc-dc Boost converter and then run simulations in MATLAB/SIMULINK. To provide a reference to compare results, the converter is also simulated using PSPICE. Both quantitative and qualitative comparisons are made to determine the suitability of each of the three Bond Graph switch models in specific power electronics applications

O uso da análise de Fourier, de Wavelets e dos expoentes de Lyapunov no estudo de um sistema dinâmico não-ideal com atrito seco e excitação externa

Pós-graduação em Física - IGCE

A multi-hypothesis topological SLAM approach for loop closing on edge-ordered graphs

We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing, we propose a probabilistically grounded multi-hypothesis technique that relies on the incremental construction of a map/state hypothesis tree. Loop closing is introduced automatically within the tree expansion, and likely hypotheses are chosen based on their posterior probability after a sequence of sensor measurements. Careful pruning of the hypothesis tree keeps the growing number of hypotheses under control and a recursive formulation reduces storage and computational costs. Experiments are used to validate the approach.

Modelling ideal turbulent vortex breakdown

In this computational study we investigate the role of turbulence in ideal axisymmetric vortex breakdown. A pipe geometry with a slight constriction near the inlet is used to stabilise the location of the breakdown within the computed domain. Eddy-viscosity and differential Reynolds stress models are used to model the turbulence. Changes in upstream turbulence levels, flow Reynolds and Swirl numbers are considered. The different computed solutions are monitored for indications of different breakdown flow configurations. Trends in vortex breakdown due to turbulent flow conditions are identified and discussed.

Theoretical analysis of serrated chip formation based on ideal models in high speed cutting

In this paper, two ideal formation models of serrated chips, the symmetric formation model and the unilateral right-angle formation model, have been established for the first time. Based on the ideal models and related adiabatic shear theory of serrated chip formation, the theoretical relationship among average tooth pitch, average tooth height and chip thickness are obtained. Further, the theoretical relation of the passivation coefficient of chip's sawtooth and the chip thickness compression ratio is deduced as well. The comparison between these theoretical prediction curves and experimental data shows good agreement, which well validates the robustness of the ideal chip formation models and the correctness of the theoretical deducing analysis. The proposed ideal models may have provided a simple but effective theoretical basis for succeeding research on serrated chip morphology. Finally, the influences of most principal cutting factors on serrated chip formation are discussed on the basis of a series of finite element simulation results for practical advices of controlling serrated chips in engineering application.

Drawing on imagination : primary students' ideal learning environments

Research has established a close relationship between learning environments and learning outcomes (Department of Education and Early Childhood Development, Victoria, 2008; Woolner, Hall, Higgins, McCaughey & Wall, 2007) yet little is known about how students in Australian schools imagine the ways that their learning environments could be improved to enhance their engagement with the processes and content of education and children are rarely consulted on the issue of school design (Rudduck & Flutter, 2004). Currently, school and classroom designers give attention to operational matters of efficiency and economy, so that architecture for children’s education is largely conceived in terms of adult and professional needs (Halpin, 2007). This results in the construction of educational spaces that impose traditional teaching and learning methods, reducing the possibilities of imaginative pedagogical relationships. Education authorities may encourage new, student-centred pedagogical styles, such as collaborative learning, team-teaching and peer tutoring, but the spaces where such innovations are occurring do not always provide the features necessary to implement these styles. Heeding the views of children could result in the creation of spaces where more imaginative pedagogical relationships and student-centred pedagogical styles can be implemented. In this article, a research project conducted with children in nine Queensland primary schools to investigate their ideas of the ideal ‘school’ is discussed. Overwhelmingly, the students’ work emphasised that learning should be fun and that learning environments should be eco-friendly places where their imaginations can be engaged and where they learn from and in touch with reality. The children’s imagined schools echo ideas that have been promoted over many decades by progressive educators such as John Dewey (1897, in Provenzo, 2006) (“experiential learning”), AS Neill (in Cassebaum, 2003) (Summerhill school) and Ivan Illich (1970) (“deschooling”), with a vast majority of students suggesting that, wherever possible, learning should take place away from classrooms and in environments that support direct, hands-on learning.

Ideal victims in human trafficking awareness campaigns

Amidst a proliferation of bestseller books, blockbuster films, television documentaries and sensational news reports, public awareness campaigns have claimed their place in a growing chorus of concern about the crime of human trafficking. These campaigns aim to capture the public’s support in efforts to eliminate a ‘modern slave trade’ in which individuals seeking a better life are transported across borders and forced into exploitative labour conditions. Constrained by the limitations of primary campaign materials (posters, print ads, billboards) typically allowing for only a single image and minimal text, it is unlikely that these awareness campaigns can accurately convey the complexity of the trafficking problem. This chapter explores how the depictions of trafficking victims in awareness campaigns can exclude those who do not fit a restrictive narrative mould. Nils Christie’s pivotal work on the construction of society’s ideal victim is the lens through which this paper examines the literal ‘poster child’ of the anti-trafficking movement.

Data transformations in custom digital workflows : property graphs as a data model for user-defined mappings

This paper describes the use of property graphs for mapping data between AEC software tools, which are not linked by common data formats and/or other interoperability measures. The intention of introducing this in practice, education and research is to facilitate the use of diverse, non-integrated design and analysis applications by a variety of users who need to create customised digital workflows, including those who are not expert programmers. Data model types are examined by way of supporting the choice of directed, attributed, multi-relational graphs for such data transformation tasks. A brief exemplar design scenario is also presented to illustrate the concepts and methods proposed, and conclusions are drawn regarding the feasibility of this approach and directions for further research.