d-cube decompositions of K-n/K-m

Necessary conditions on n, m and d are given for the existence of an edge-disjoint decomposition of K-n\K-m into copies of the graph of a d-dimensional cube. Sufficiency is shown when d = 3 and, in some cases, when d = 2(t). We settle the problem of embedding 3-cube decompositions of K-m into 3-cube decompositions of K-n; where n greater than or equal to m.

2m-cycle systems of K2m+1/C-m

For all m greater than or equal to 3 the edges of complete graph on 2m + 1 vertices can he partitioned into m 2m-cycles and an m-cycle.

Neurodynamics of an election

Variables influencing decision-making in real settings, as in the case of voting decisions, are uncontrollable and in many times even unknown to the experimenter. In this case, the experimenter has to study the intention to decide (vote) as close as possible in time to the moment of the real decision (election day). Here, we investigated the brain activity associated with the voting intention declared 1 week before the election day of the Brazilian Firearms Control Referendum about prohibiting the commerce of firearms. Two alliances arose in the Congress to run the campaigns for YES (for the prohibition of firearm commerce) and NO (against the prohibition of firearm commerce) voting. Time constraints imposed by the necessity of studying a reasonable number (here, 32) of voters during a very short time (5 days) made the EEG the tool of choice for recording the brain activity associated with voting decision. Recent fMRI and EEG studies have shown decision-making as a process due to the enrollment of defined neuronal networks. In this work, a special EEG technique is applied to study the topology of the voting decision-making networks and is compared to the results of standard ERP procedures. The results show that voting decision-making enrolled networks in charge of calculating the benefits and risks of the decision of prohibiting or allowing firearm commerce and that the topology of such networks was vote-(i.e., YES/NO-) sensitive. (C) 2010 Elsevier B.V. All rights reserved.

A Graphical Representation Model for Telemedicine and Telehealth Center Sustainability

This study shows the creation of a graphical representation after the application of a questionnaire to evaluate the indicative factors of a sustainable telemedicine and telehealth center in Sao Paulo, Brazil. We categorized the factors into seven domain areas: institutional, functional, economic-financial, renewal, academic-scientific, partnerships, and social welfare, which were plotted into a graphical representation. The developed graph was shown to be useful when used in the same institution over a long period and complemented with secondary information from publications, archives, and administrative documents to support the numerical indicators. Its use may contribute toward monitoring the factors that define telemedicine and telehealth center sustainability. When systematically applied, it may also be useful for identifying the specific characteristics of the telemedicine and telehealth center, to support its organizational development.

Puzzling challenges in contemporary neuroscience: Insights from complexity and emergence in epileptogenic circuits

The brain is a complex system that, in the normal condition, has emergent properties like those associated with activity-dependent plasticity in learning and memory, and in pathological situations, manifests abnormal long-term phenomena like the epilepsies. Data from our laboratory and from the literature were classified qualitatively as sources of complexity and emergent properties from behavior to electrophysiological, cellular, molecular, and computational levels. We used such models as brainstem-dependent acute audiogenic seizures and forebrain-dependent kindled audiogenic seizures. Additionally we used chemical OF electrical experimental models of temporal lobe epilepsy that induce status epilepticus with behavioral, anatomical, and molecular sequelae such as spontaneous recurrent seizures and long-term plastic changes. Current Computational neuroscience tools will help the interpretation. storage, and sharing of the exponential growth of information derived from those studies. These strategies are considered solutions to deal with the complexity of brain pathologies such as the epilepsies. (C) 2008 Elsevier Inc. All rights reserved.

Reference distribution of the bioelectrical impedance vector in healthy term newborns

Bioelectrical impedance vector analysis (BIVA) is a new method that is used for the routine monitoring of the variation in body fluids and nutritional status with assumptions regarding body composition values. The aim of the present study was to determine bivariate tolerance intervals of the whole-body impedance vector and to describe phase angle (PA) values for healthy term newborns aged 7-28 d. This descriptive cross-sectional study was conducted on healthy term neonates born at a low-risk public maternity. General and anthropometric neonatal data and bioelectrical impedance data (800 mu A-50 kHz) were obtained. Bivariate vector analysis was conducted with the resistance-reactance (RXc) graph method. The BIVA software was used to construct the graphs. The study was conducted on 109 neonates (52.3% females) who were born at term, adequate for gestational age, exclusively breast-fed and aged 13 (SD 3.6) d. We constructed one standard, reference, RXc-score graph and RXc-tolerance ellipses (50, 75 and 95 %) that can be used with any analyser. Mean PA was 3.14 (SD 0.43)degrees (3.12 (SD 0.39)degrees for males and 3.17 (SD 0.48)degrees for females). Considering the overlapping of ellipses of males and females with the general distribution, a graph for newborns aged 7-28 d with the same reference tolerance ellipse was defined for boys and girls. The results differ from those reported in the literature probably, in part, due to the ethnic differences in body composition. BIVA and PA permit an assessment without the need to know body weight and the prediction error of conventional impedance formulas.

The mu-way intersection problem for m-cycle systems

An m-cycle system of order upsilon is a partition of the edge-set of a complete graph of order upsilon into m-cycles. The mu -way intersection problem for m-cycle systems involves taking mu systems, based on the same vertex set, and determining the possible number of cycles which can be common to all mu systems. General results for arbitrary m are obtained, and detailed intersection values for (mu, m) = (3, 4), (4, 5),(4, 6), (4, 7), (8, 8), (8, 9). (For the case (mu, m)= (2, m), see Billington (J. Combin. Des. 1 (1993) 435); for the case (Cc,m)=(3,3), see Milici and Quattrochi (Ars Combin. A 24 (1987) 175. (C) 2001 Elsevier Science B.V. All rights reserved.

The metamorphosis of lambda-fold 4-wheel systems into lambda-fold 4-cycle systems

A 4-wheel is a simple graph on 5 vertices with 8 edges, formed by taking a 4-cycle and joining a fifth vertex (the centre of the 4-wheel) to each of the other four vertices. A lambda -fold 4-wheel system of order n is an edge-disjoint decomposition of the complete multigraph lambdaK(n) into 4-wheels. Here, with five isolated possible exceptions when lambda = 2, we give necessary and sufficient conditions for a lambda -fold 4-wheel system of order n to be transformed into a lambda -fold Ccyde system of order n by removing the centre vertex from each 4-wheel, and its four adjacent edges (retaining the 4-cycle wheel rim), and reassembling these edges adjacent to wheel centres into 4-cycles.

Star decompositions of cubes

Let Sk denote the complete bipartite graph K-1k and let e,, denote the ii-cube. We prove that the obvious necessary conditions for the existence of an S-k-decomposition of Q(n) are sufficient.

On the intersection problem for 1-factorizations and near 1-factorizations of K-v

The number of 1-factors (near 1-factors) that mu 1-factorizations (near 1-factorizations) of the complete graph K-v, v even (v odd), can have in common, is studied. The problem is completely settled for mu = 2 and mu = 3.

Identity and security in Korea

The summit meeting between the two Korean heads of state, which took place in Pyongyang in June 2000, constitutes a major turning point in the peninsula's history. As the effects of the meeting are gradually unfolding, a period of detente no longer seems impossible. But major difficulties remain unsolved and Korea will continue to be one of the world's most volatile areas. The task of this essay is to identify and analyse some of the entrenched political patterns that will challenge policy-makers in the years ahead. To do so it is necessary to portray the conflict in Korea not only in conventional ideological and geopolitical terms, but also, and primarily, as a question of identity. From such a vantage-point two components are essential in the search for a more peaceful peninsula. Substantial progress has recently been made in the first realm, the need to approach security problems, no matter how volatile they seem. in a cooperative and dialogical, rather than merely a coercive manner. The second less accepted but perhaps more important factor, revolves around the necessity to recognize that dialogue has its limits, that the party on the other side of the DMZ cannot always be accommodated or subsumed into compromise. Needed is an ethics of difference: a willingness to accept that the other's sense of identity and politics may be inherently incompatible with one's own.

On the Hamilton-Waterloo problem

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

Trade spectra of complete partite graphs

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.

Factorizations of and by powers of complete graphs

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.