912 resultados para Call Graph


Relevância:

10.00% 10.00%

Publicador:

Resumo:

This article examines contemporary feminist arguments about contract. It does not aim to advance new arguments for or against contract but to call into question the dominant feminist position which is that contract has to be cast aside and/or that alternative approaches to contract have to be developed in order to advance the position of women. In a reworking of Elizabeth Kingdom's anti-essentialist approach to rights, Sullivan argues that a feminist but non-essentialist approach to contract is both possible and desirable. Sullivan explores a number of concrete situations in the Australian context where contract approaches have been deployed in law and public policy and demonstrates that contract may be detrimental or advantageous to the position of women. Sullivan argues, therefore, for a strategic and critical feminist approach to the utilisation of the language and practice of contract.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this study of articulation issues related to languages other than English (LOTE), "articulation" is defined and the challenges surrounding it are overviewed. Data taken from an independent school's admission documents over a 4-year period provide insights and reveal trends concerning students' preferences for language study, LOTE study continuity, and reasons for LOTE selection. The data also provides an accounting of some multiple LOTE learning experiences. The analysis indicates that many students who begin a LOTE in the early grades are thwarted in becoming proficient, because (1) continuation in the language is impossible due to unavailability of instruction; (2) expanded learning is hampered by teachers' inability to deal with a range of learners, (3) extended learning is hampered by administrative decisions or policies, or (4) students lose interest in the first LOTE and switch to another. Finally, a call is made for data gathering and research in local contexts to gain a better understanding of LOTE articulation challenges at the local, state, national, and international levels.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper we use the mixture of topological and measure-theoretic dynamical approaches to consider riddling of invariant sets for some discontinuous maps of compact regions of the plane that preserve two-dimensional Lebesgue measure. We consider maps that are piecewise continuous and with invertible except on a closed zero measure set. We show that riddling is an invariant property that can be used to characterize invariant sets, and prove results that give a non-trivial decomposion of what we call partially riddled invariant sets into smaller invariant sets. For a particular example, a piecewise isometry that arises in signal processing (the overflow oscillation map), we present evidence that the closure of the set of trajectories that accumulate on the discontinuity is fully riddled. This supports a conjecture that there are typically an infinite number of periodic orbits for this system.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The Hamilton-Waterloo problem asks for a 2-factorisation of K-v in which r of the 2-factors consist of cycles of lengths a(1), a(2),..., a(1) and the remaining s 2-factors consist of cycles of lengths b(1), b(2),..., b(u) (where necessarily Sigma(i)(=1)(t) a(i) = Sigma(j)(=1)(u) b(j) = v). In thus paper we consider the Hamilton-Waterloo problem in the case a(i) = m, 1 less than or equal to i less than or equal to t and b(j) = n, 1 less than or equal to j less than or equal to u. We obtain some general constructions, and apply these to obtain results for (m, n) is an element of {(4, 6)1(4, 8), (4, 16), (8, 16), (3, 5), (3, 15), (5, 15)}.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We compare two different approaches to the control of the dynamics of a continuously monitored open quantum system. The first is Markovian feedback, as introduced in quantum optics by Wiseman and Milburn [Phys. Rev. Lett. 70, 548 (1993)]. The second is feedback based on an estimate of the system state, developed recently by Doherty and Jacobs [Phys. Rev. A 60, 2700 (1999)]. Here we choose to call it, for brevity, Bayesian feedback. For systems with nonlinear dynamics, we expect these two methods of feedback control to give markedly different results. The simplest possible nonlinear system is a driven and damped two-level atom, so we choose this as our model system. The monitoring is taken to be homodyne detection of the atomic fluorescence, and the control is by modulating the driving. The aim of the feedback in both cases is to stabilize the internal state of the atom as close as possible to an arbitrarily chosen pure state, in the presence of inefficient detection and other forms of decoherence. Our results (obtained without recourse to stochastic simulations) prove that Bayesian feedback is never inferior, and is usually superior, to Markovian feedback. However, it would be far more difficult to implement than Markovian feedback and it loses its superiority when obvious simplifying approximations are made. It is thus not clear which form of feedback would be better in the face of inevitable experimental imperfections.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The trade spectrum of a graph G is essentially the set of all integers t for which there is a graph H whose edges can be partitioned into t copies of G in two entirely different ways. In this paper we determine the trade spectrum of complete partite graphs, in all but a few cases.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Let K-k(d) denote the Cartesian product of d copies of the complete graph K-k. We prove necessary and sufficient conditions for the existence of a K-k(r)-factorization of K-pn(s), where p is prime and k > 1, n, r and s are positive integers. (C) 2002 Elsevier Science B.V. All rights reserved.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Let K(r,s,t) denote the complete tripartite graph with partite sets of sizes r, s and t, where r less than or equal to s less than or equal to t. Necessary and sufficient conditions are given for decomposability of K(r, s, t) into 5-cycles whenever r, s and t are all even. This extends work done by Mahmoodian and Mirza-khani (Decomposition of complete tripartite graphs into 5-cycles, in: Combinatorics Advances, Kluwer Academic Publishers, Netherlands, 1995, pp. 235-241) and Cavenagh and Billington. (C) 2002 Elsevier Science B.V. All rights reserved.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper we establish a foundation for understanding the instrumentation needs of complex dynamic systems if ecological interface design (EID)-based interfaces are to be robust in the face of instrumentation failures. EID-based interfaces often include configural displays which reveal the higher-order properties of complex systems. However, concerns have been expressed that such displays might be misleading when instrumentation is unreliable or unavailable. Rasmussen's abstraction hierarchy (AH) formalism can be extended to include representations of sensors near the functions or properties about which they provide information, resulting in what we call a sensor-annotated abstraction hierarchy. Sensor-annotated AHs help the analyst determine the impact of different instrumentation engineering policies on higher-order system information by showing how the data provided from individual sensors propagates within and across levels of abstraction in the AH. The use of sensor-annotated AHs with a configural display is illustrated with a simple water reservoir example. We argue that if EID is to be effectively employed in the design of interfaces for complex systems, then the information needs of the human operator need to be considered at the earliest stages of system development while instrumentation requirements are being formulated. In this way, Rasmussen's AH promotes a formative approach to instrumentation engineering. (C) 2002 Elsevier Science Ltd. All rights reserved.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this note strongly regular graphs with new parameters are constructed using nested "blown up" quadrics in projective spaces. (C) 2002 Elsevier Science B.V. All rights reserved.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper, I describe my journey through a field of research in which I have been involved for some years - lipolysis in milk and dairy products. While I call it my journey, I have had many fellow travellers who have helped me along the way. These have been my research colleagues and collaborators, and, since I joined the University of Queensland, my students. The research has covered a variety of aspects but I have chosen to describe only a selection of these.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A 4-cycle trade of volume t corresponds to a simple graph G without isolated vertices, where the edge set can be partitioned into t 4-cycles in at least two different ways such that the two collections of 4-cycles have no 4-cycles in common. The foundation of the trade is v = \V(G)\. This paper determines for which values oft and a there exists a 4-cycle trade of volume t and foundation v.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Background: Increasingly there is a call from clinicians and researchers for measures that document the impact of aphasia on a person's everyday communication. Do existing assessments of communication disability adequately sample communication activities relevant to our clients? Communication skills and networks change with age. A need exists to determine the everyday communication activities of older people and in particular those with aphasia. Aims: The primary aim of this study was to describe and compare the everyday communication activities of older people with aphasia and healthy older people who are living in the community. A secondary aim was to investigate the content validity of the American Speech-Language Hearing Association Functional Assessment of Communication Skills for Adults (ASHA FACS, 1997) for older Australians. Methods & Procedures: Naturalistic observation was the method of choice for detailing the everyday communication of 15 older people with chronic aphasia following stroke and a matched group of 15 healthy older people who were living in the community. Researchers, in the role of participant observer, took field notes for 8 hours, over three occasions within a week. A total of 240 hours of observation have been coded in terms of communication activity, topic, communication partners, and place of communication. A brief 5-day diary served to check the representativeness of the observational data. After each hour of observation, the researcher checked which ASHA FACS items had been observed. Outcomes & Results: Naturalistic observation provided a rich, rigorous, and systematic methodology for detailing the dynamics and complexities of authentic communication. The most common communication activities for both groups were conversations at home and in social groups. Real-life communication was revealed to serve the dual purposes of transaction and interaction. Results indicate that older people with aphasia engage in similar communication activities to healthy older people although differences were evident in the frequency of communication and in specific activities such as story telling, writing, commenting, and acknowledging. ASHA FACS items were generally relevant to older Australians living in the community. Conclusions: This study demonstrated that communication activity is multifaceted in terms of the type of communication and contextual factors. The observational data describe the effects of aphasia on a person's everyday communication activity and reveal the impact of aphasia on the social functions of communication including sharing information, maintaining and establishing relationships, and telling one's story. Functional communication assessment requires a greater focus on the interactional and uniquely interpersonal aspects of social communication.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The most widely used method for predicting the onset of continuous caving is Laubscher's caving chart. A detailed examination of this method was undertaken which concluded that it had limitations which may impact on results, particularly when dealing with stronger rock masses that are outside current experience. These limitations relate to inadequate guidelines for adjustment factors to rock mass rating (RMR), concerns about the position on the chart of critical case history data, undocumented changes to the method and an inadequate number of data points to be confident of stability boundaries. A review was undertaken on the application and reliability of a numerical method of assessing cavability. The review highlighted a number of issues, which at this stage, make numerical continuum methods problematic for predicting cavability. This is in particular reference to sensitivity to input parameters that are difficult to determine accurately and mesh dependency. An extended version of the Mathews method for open stope design was developed as an alternative method of predicting the onset of continuous caving. A number of caving case histories were collected and analyzed and a caving boundary delineated statistically on the Mathews stability graph. The definition of the caving boundary was aided by the existence of a large and wide-ranging stability database from non-caving mines. A caving rate model was extrapolated from the extended Mathews stability graph but could only be partially validated due to a lack of reliable data.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.