Interhemispheric inhibition of corticospinal projections to forearm muscles

OBJECTIVE: Interhemispheric inhibition (IHI) is typically examined via responses elicited in intrinsic hand muscles. As the cortical representations of proximal and distal muscles in the upper limb are distinguished in terms of their inter-hemispheric projections, we sought to determine whether the IHI parameters established for the hand apply more generally.

METHODS: We investigated IHI at 5 different conditioning stimulus (CS) intensities and a range of short-latency inter-stimulus intervals (ISIs) in healthy participants. Conditioning and test stimuli were delivered over the M1 representation of the right and left flexor carpi radialis respectively.

RESULTS: IHI increased as a function of CS intensity, and was present for ISIs between 7 and 15ms. Inhibition was most pronounced for the 10ms ISI at all CS intensities.

CONCLUSIONS: The range of parameters for which IHI is elicited in projections to the forearm is similar to that reported for the hand. The specific utility lies in delineation of stimulus parameters that permit both potentiation and attenuation of IHI to be assessed.

SIGNIFICANCE: In light of evidence that there is a greater density of callosal projections between cortical areas that represent proximal muscles than between those corresponding to distal limb muscles, and in view of the assumption that variations in functional connectivity to which such differences give rise may have important implications for motor behavior, it is critical to determine whether processes mediating the expression of IHI depend on the effector that is studied. This issue is of further broad significance given the practical utility of movements generated by muscles proximal to the wrist in the context of upper limb rehabilitation.

Dominating induced matchings

We study the problem of determining whether or not a graph G has an induced matching that dominates every edge of the graph, which is also known as efficient edge domination. This problem is known to be NP-complete in general as well as in some restricted domains, such as bipartite graphs or regular graphs. In this paper, we identify a graph parameter to which the complexity of the problem is sensible and produce results of both negative (intractable) and positive (solvable in polynomial time) type. © 2009 Springer Berlin Heidelberg.

Efficient edge domination in regular graphs

An induced matching of a graph G is a matching having no two edges joined by an edge. An efficient edge dominating set of G is an induced matching M such that every other edge of G is adjacent to some edge in M. We relate maximum induced matchings and efficient edge dominating sets, showing that efficient edge dominating sets are maximum induced matchings, and that maximum induced matchings on regular graphs with efficient edge dominating sets are efficient edge dominating sets. A necessary condition for the existence of efficient edge dominating sets in terms of spectra of graphs is established. We also prove that, for arbitrary fixed p ≥ 3, deciding on the existence of efficient edge dominating sets on p-regular graphs is NP-complete. © 2008 Elsevier B.V. All rights reserved.

Convex Quadratic Programming Approach to the Maximum Matching Problem

The problem of determining a maximum matching or whether there exists a perfect matching, is very common in a large variety of applications and as been extensively studied in graph theory. In this paper we start to introduce a characterisation of a family of graphs for which its stability number is determined by convex quadratic programming. The main results connected with the recognition of this family of graphs are also introduced. It follows a necessary and sufficient condition which characterise a graph with a perfect matching and an algorithmic strategy, based on the determination of the stability number of line graphs, by convex quadratic programming, applied to the determination of a perfect matching. A numerical example for the recognition of graphs with a perfect matching is described. Finally, the above algorithmic strategy is extended to the determination of a maximum matching of an arbitrary graph and some related results are presented.

Politopo de Birkhoff acíclico

Neste trabalho estabelece-se uma interpreta c~ao geom etrica, em termos da teoria dos grafos, para v ertices, arestas e faces de uma qualquer dimens~ao do politopo de Birkho ac clico, Tn = n(T), onde T e uma arvore com n v ertices. Generaliza-se o resultado obtido por G. Dahl, [18], para o c alculo do di^ametro do grafo G( t n), onde t n e o politopo das matrizes tridiagonais duplamente estoc asticas. Adicionalmente, para q = 0; 1; 2; 3 s~ao obtidas f ormulas expl citas para a contagem do n umero de q faces do politopo de Birkho tridiagonal, t n, e e feito o estudo da natureza geom etrica dessas mesmas faces. S~ao, tamb em, apresentados algoritmos para efectuar contagens do n umero de faces de dimens~ao inferior a de uma dada face do politopo de Birkho ac clico.

A recursive construction of the regular exceptional graphs with least eigenvalue -2

In spectral graph theory a graph with least eigenvalue 2 is exceptional if it is connected, has least eigenvalue greater than or equal to 2, and it is not a generalized line graph. A ðk; tÞ-regular set S of a graph is a vertex subset, inducing a k-regular subgraph such that every vertex not in S has t neighbors in S. We present a recursive construction of all regular exceptional graphs as successive extensions by regular sets.

On the Faria's inequality for the Laplacian and signless Laplacian spectra: a unified approach

Let p(G)p(G) and q(G)q(G) be the number of pendant vertices and quasi-pendant vertices of a simple undirected graph G, respectively. Let m_L±(G)(1) be the multiplicity of 1 as eigenvalue of a matrix which can be either the Laplacian or the signless Laplacian of a graph G. A result due to I. Faria states that mL±(G)(1) is bounded below by p(G)−q(G). Let r(G) be the number of internal vertices of G. If r(G)=q(G), following a unified approach we prove that mL±(G)(1)=p(G)−q(G). If r(G)>q(G) then we determine the equality mL±(G)(1)=p(G)−q(G)+mN±(1), where mN±(1) denotes the multiplicity of 1 as eigenvalue of a matrix N±. This matrix is obtained from either the Laplacian or signless Laplacian matrix of the subgraph induced by the internal vertices which are non-quasi-pendant vertices. Furthermore, conditions for 1 to be an eigenvalue of a principal submatrix are deduced and applied to some families of graphs.

Grafos para todos

Dissertação de Mestrado, Matemática, Especialização em Matemática para o Ensino, Faculdade de Ciências e Tecnologia, Universidade do Algarve, 2007

Mögliche neue Strukturen im Ortsnetz und ihre minimale Länge

Auch für das Teilnehmeranschlußnetz werden neben dem heute üblichen „Sternnetz" neuerdings „Ring-" und „Verzweigungsnetze" genannt, und es wird die Frage diskutiert, ob damit geringere Kosten zu erwarten sind. Mit Begriffen der Graphentheorie werden hier z.B. die Strukturen Stern, Ring, Baum definiert. Ein gedachtes Ortsnetz wird dann in quadratische Bereiche mit der Seitenlänge l und mit M Teilnehmern aufgeteilt. Für verschiedene Strukturen des Leiternetzes in der Teilnehmerebene werden die Mindestlängen der Leiter und der Kabelkanäle berechnet. Unter anderem zeigt sich, daß unabhängig von der Struktur des Leiternetzes die Kabelkanäle, ein dominierender Kostenanteil in der Teilnehmerebene, praktisch gleich lang sind, nämlich l/M^0,5 je Teilnehmer.

Análise de risco em organizações: caso de estudo

Dissertação Final de Mestrado para obtenção do grau de Mestre em Engenharia Mecânica no perfil de Manutenção e Produção

Models and tools for value systems analysis in collaborative environments

Dissertation to obtain the degree of Doctor in Electrical and Computer Engineering, specialization of Collaborative Networks

The role of daytime napping in sleepiness and cognitive function in 24-70 year olds /

Daytime napping improves well-being and performance for young adults. The benefits of napping in older adults should be investigated because they have fragmented nocturnal sleep, cognitive declines, and more opportunity to nap. In addition, experience with napping might influence the benefits of napping. Study 1 examined the role of experience with napping in young adults. Habitual (n = 23) and non-habitual nappers (n = 16) were randomly assigned to a 20-minute nap or a 20- minute reading condition. Both groups slept the same according to macro architecture. However, microarchitecture showed greater theta, alpha, and beta power during Stage 1, and greater delta, alpha, and sigma power during Stage 2 for habitual nappers, for the most part indicating better sleep. Both groups felt less sleepy after the nap. P2 latency, reflecting information processing, decreased after the nap for habitual nappers, and after the control condition for non-habitual nappers. In sum, both groups who slept felt better, but only the habitual nappers who napped gained a benefit in terms of information processing. Based on this outcome, experience with napping was investigated in Study 2. Study 2 examined the extent to which daytime napping enhanced cognition in older adults, especially frontal lobe function. Cognitive deficits in older adults may be due to sleep loss and age-related decline in brain functioning. Longer naps were expected to provide greater improvement, particularly for older adults, by reducing sleep pressure. Thirty-two adults, aged 24-70 years, participated in a repeated measures dose-response manipulation of sleep pressure. Twenty- and sixty-minute naps were compared to a no-nap condition in three age groups. Mood, subjective sleepiness, reaction time, working memory, 11 novelty detection, and waking electro physiological measures were taken before and after each condition. EEG was also recorded during each nap or rest condition. Napping reduced subjective sleepiness, improved working memory (serial addition / subtraction task), and improved attention (reduced P2 amplitude). Physiological sleepiness (i.e., waking theta power) increased following the control condition, and decreased after the longer nap. Increased beta power after the short nap, and seen with older adults overall, may have reflected increased mental effort. Older adults had longer latencies and smaller amplitudes for several event-related potential components, and higher beta and gamma power. Following the longer nap, gamma power decreased for older adults, but increased for young adults. Beta and gamma power may represent enhanced alertness or mental effort. In addition, Nl amplitude showed that benefits depend on the preceding nap length as well as age. Since the middle group had smaller Nl amplitudes following the short nap and rest condition, it is possible that they needed a longer nap to maintain alertness. Older adults did not show improvements to Nl amplitude following any condition; they may have needed a nap longer than 60 minutes to gain benefits to attention or early information processing. Sleep characteristics were not related to benefits of napping. Experience with napping was also investigated. Subjective data confirmed habitual nappers were happier to nap, while non-habitual nappers were happier to stay awake, reflecting self-identified napping habits. Non-habitual nappers were sleepier after a nap, and had faster brain activity (i.e., heightened vigilance) at sleep onset. These reasons may explain why non-habitual nappers choose not to nap.

Individual differences in risk-taking and associated characteristics : a test of specificity in executive functions /

Multiple measures have been devised by clinicians and theorists from many different backgrounds for the purpose of assessing the influence of the frontal lobes on behaviour. Some utilize self-report measures to investigate behavioural characteristics such as risktaking, sensation seeking, impulsivity, and sensitivity to reward and punishment in an attempt to understand complex human decision making. Others rely more on neuroimaging and electrophysiological investigation involving experimental tasks thought to demonstrate executive functions in action, while other researchers prefer to study clinical populations with selective damage. Neuropsychological models of frontal lobe functioning have led to a greater appreciation of the dissociations among various aspects of prefrontal cortex function. This thesis involves (1) an examination of various psychometric and experimental indices of executive functions for coherence as one would predict on the basis of highly developed neurophysiological models of prefrontal function, particularly those aspects of executive function that involve predominantly cognitive abilities versus processes characterized by affect regulation; and (2) investigation of the relations between risk-taking, attentional abilties and their associated characteristics using a neurophysiological model of prefrontal functions addressed in (1). Late adolescence is a stage in which the prefrontal cortices undergo intensive structural and functional maturational changes; this period also involves increases in levels of risky and sensation driven behaviours, as well as a hypersensitivity to reward and a reduction in inhibition. Consequently, late adolescence spears to represent an ideal developmental period in which to examine these decision-making behaviours due to the maximum variability of behavioural characteristics of interest. Participants were 45 male undergraduate 18- to 19-year olds, who completed a battery of measures that included self-report, experimental and behavioural measures designed to assess particular aspects of prefrontal and executive functioning. As predicted, factor analysis supported the grouping of executive process by type (either primarily cognitive or affective), conforming to the orbitofrontal versus dorsolateral typology; risk-taking and associated characteristics were associated more with the orbitofrontal than the dorsolateral factor, whereas attentional and planning abilities tended to correlate more strongly with the dorsolateral factor. Results are discussed in light of future assessment, investigation and understanding of complex human decision-making and executive functions. Implications, applications and suggestions for future research are also proposed.

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area.

Square Root Finding In Graphs

Abstract: Root and root finding are concepts familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Graph square is a basic operation with a number of results about its properties in the literature. We study the characterization and recognition problems of graph powers. There are algorithmic and computational approaches to answer the decision problem of whether a given graph is a certain power of any graph. There are polynomial time algorithms to solve this problem for square of graphs with girth at least six while the NP-completeness is proven for square of graphs with girth at most four. The girth-parameterized problem of root fining has been open in the case of square of graphs with girth five. We settle the conjecture that recognition of square of graphs with girth 5 is NP-complete. This result is providing the complete dichotomy theorem for square root finding problem.