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

Asymmetric Ramsey Properties of Random Graphs Involving Cliques

Consider the following problem: Forgiven graphs G and F(1),..., F(k), find a coloring of the edges of G with k colors such that G does not contain F; in color i. Rodl and Rucinski studied this problem for the random graph G,,, in the symmetric case when k is fixed and F(1) = ... = F(k) = F. They proved that such a coloring exists asymptotically almost surely (a.a.s.) provided that p <= bn(-beta) for some constants b = b(F,k) and beta = beta(F). This result is essentially best possible because for p >= Bn(-beta), where B = B(F, k) is a large constant, such an edge-coloring does not exist. Kohayakawa and Kreuter conjectured a threshold function n(-beta(F1,..., Fk)) for arbitrary F(1), ..., F(k). In this article we address the case when F(1),..., F(k) are cliques of different sizes and propose an algorithm that a.a.s. finds a valid k-edge-coloring of G(n,p) with p <= bn(-beta) for some constant b = b(F(1),..., F(k)), where beta = beta(F(1),..., F(k)) as conjectured. With a few exceptions, this algorithm also works in the general symmetric case. We also show that there exists a constant B = B(F,,..., Fk) such that for p >= Bn(-beta) the random graph G(n,p) a.a.s. does not have a valid k-edge-coloring provided the so-called KLR-conjecture holds. (C) 2008 Wiley Periodicals, Inc. Random Struct. Alg., 34, 419-453, 2009

The disk-percolation model on graphs

We study a long-range percolation model whose dynamics describe the spreading of an infection on an infinite graph. We obtain a sufficient condition for phase transition and prove all upper bound for the critical parameter of spherically symmetric trees. (C) 2008 Elsevier B.V. All rights reserved.

Universal Experimental Measurement System «Sun-Walker» : Automotive measurement system for the evaluation of the solar irradiation distribution for the tests of the solar concentrated systems.

This Thesis project is a part of the research conducted in Solar industry. ABSOLICON Solar Concentrator AB has invented and started production of the prospective solar concentrated system Absolicon X10. The aims of this Thesis project are designing, assembling, calibrating and putting in operation the automatic measurement system intended to evaluate distribution of density of solar radiation in the focal line of the concentrated parabolic reflectors and to measure radiation from the artificial source of light being a calibration-testing tool.On the basis of the requirements of the company’s administration and needs of designing the concentrated reflectors the operation conditions for the Sun-Walker were formulated. As the first step, the complex design of the whole system was made and division on the parts was specified. After the preliminary conducted simulation of the functions and operation conditions of the all parts were formulated.As the next steps, the detailed design of all the parts was made. Most components were ordered from respective companies. Some of the mechanical components were made in the workshop of the company. All parts of the Sun-Walker were assembled and tested. The software part, which controls the Sun-Walker work and conducts measurements of solar irradiation, was created on the LabVIEW basis. To tune and test the software part, the special simulator was designed and assembled.When all parts were assembled in the complete system, the Sun-Walker was tested, calibrated and tuned.

Universal nonuniform random vector generator based on acceptance-rejection

The acceptance/rejection approach is widely used in universal nonuniform random number generators. Its key part is an accurate approximation of a given probability density from above by a hat function. This article uses a piecewise constant hat function, whose values are overestimates of the density on the elements of the partition of the domain. It uses a sawtooth overestimate of Lipschitz continuous densities, and then examines all local maximizers of such an overestimate. The method is applicable to multivariate multimodal distributions. It exhibits relatively short preprocessing time and fast generation of random variates from a very large class of distributions

Giving content to the principle of proportionality: happiness and pain as the universal currency for matching offence seriousness and penalty severity

The principle of proportionality prescribes that the punishment should equal the crime. It is one of the most important principles of sentencing. Yet, despite its widespread acceptance it offers no meaningful guide to sentencing. Hence penalty levels fluctuate greatly between jurisdictions and within jurisdictions. This is because there is no universally agreed criterion for measuring offence seriousness or penalty severity. This article suggests that the appropriate criteria for matching offence seriousness and penalty severity is the level of unhappiness or pain stemming from each of these impositions. Thus, for example, the level of pain meted out to a rape offender should equal the level of pain caused to a rape victim. Emerging scientific studies on human well-being and happiness show that human beings are similarly built in terms of the experiences that are either conducive or inimical to well-being. This commonality provides a strong foundation to be confident to make reasonably accurate predictions concerning the extent to which adverse events, such as being the victim of a criminal offence or subjected to a form of criminal sanction will stifle human flourishing. This will then allow us to match accurately offence seriousness and penalty level.

An almost universal scheme of national service in Australia in the 1950s

While the Australian Government partly justified the introduction of a universal National Service Training Scheme for eighteen-year old males in 1951 by highlighting the threat of imminent war and the consequent need for military preparedness, advocates also believed that national service encouraged the development of a sense of civil responsibility. Its confidence in the potential of national service to promote citizenship explains why the government was so strongly committed to the scheme's universality. Nonetheless, although the government went to great lengths to enforce compliance, Aborigines and those from other "non-white" backgrounds were actively discouraged from participation and women were only reluctantly admitted to the professional army. As would be expected in this period, they were never considered for national service. An examination of the rationale for national service and the associated discourse for inclusion and exclusion not only indicates the social assumptions shaping policy-making by government and bureaucratic elites in 1950s Australia, but also reveals their wider social aspirations.

Extracting Causal Graphs from an Open Provenance Data Model

The open provenance architecture (OPA) approach to the challenge was distinct in several regards. In particular, it is based on an open, well-defined data model and architecture, allowing different components of the challenge workflow to independently record documentation, and for the workflow to be executed in any environment. Another noticeable feature is that we distinguish between the data recorded about what has occurred, emphprocess documentation, and the emphprovenance of a data item, which is all that caused the data item to be as it is and is obtained as the result of a query over process documentation. This distinction allows us to tailor the system to separately best address the requirements of recording and querying documentation. Other notable features include the explicit recording of causal relationships between both events and data items, an interaction-based world model, intensional definition of data items in queries rather than relying on explicit naming mechanisms, and emphstyling of documentation to support non-functional application requirements such as reducing storage costs or ensuring privacy of data. In this paper we describe how each of these features aid us in answering the challenge provenance queries.

Towards universal accessibility : including users with a disability in the design process

While increased awareness of disability issues has resulted in the development of guidelines for developing accessible software, such guidelines do not guarantee that the end product will be optimal for users with a disability. We present an overview of a user-centred approach to the needs analysis and ultimate design of a disability aware email client (Multimail). We discuss the process we used to work with participants in developing the software and reflect on the benefits and challenges of the process.