912 resultados para incremental computation
Resumo:
The role intra-organizational knowledge exchanges play in innovation processes has been widely acknowledged in the organizational literature. This paper contributes to the understanding of which specific configurations knowledge networks assume during different phases of radical and incremental innovation processes. The case study we selected is a FLOSS (Free/Libre Open Source Software) community consisting of 233 developers committed to the development of a web browser application since November 2002. By harvesting the mailing list, official blog and code repository of a FLOSS community, we investigate the patterns of knowledge exchange and individual contributions of its developers. We measure structural cohesion and compare global and local network properties at different points in time. Preliminary results show that phases of radical and incremental innovation are associated with specific configurations of the knowledge network as a whole as well as with different network positions of the core developers of the software.
Resumo:
The aim of this study was to examine the effects of cadence and power output on physiological and biomechanical responses to incremental arm-crank ergometry (ACE). Ten male subjects (mean +/- SD age, 30.4 +/-5.4 y; height, 1.78 +/-0.07 m; mass, 86.1 +/-14.2 kg) undertook 3 incremental ACE protocols to determine peak oxygen uptake (VO2 peak; mean of 3 tests: 3.07 +/- 0.17 L.min-1) at randomly assigned cadences of 50, 70, or 90 r.min-1. Heart rate and expired air were continually monitored. Central (RPE-C) and local (RPE-L) ratings of perceived exertion were recorded at volitional exhaustion. Joint angles and trunk rotation were analysed during each exercise stage. During submaximal power outputs of 50, 70, and 90 W, oxygen consumption (VO2) was lowest for 50 r.min-1 and highest for 90 r.min-1 (p < 0.01). VO2 peak was lowest during 50 r.min-1 (2.79 +/-0.45 L.min-1; p < 0.05) when compared with both 70 r.min-1 and 90 r.min-1 (3.16 +/-0.58, 3.24 +/-0.49 L.min-1, respectively; p > 0.05). The difference between RPE-L and RPE-C at volitional exhaustion was greatest during 50 r.min-1 (2.9 +/- 1.6) when compared with 90 r.min-1 (0.9 +/- 1.9, p < 0.05). At VO2 peak, shoulder range of motion (ROM) and trunk rotation were greater for 50 and 70 r.min-1 when compared with 90 r.min-1 (p < 0.05). During submaximal power outputs, shoulder angle and trunk rotation were greatest at 50 r.min-1 when compared with 90 r.min-1 (p < 0.05). VO2 was inversely related to both trunk rotation and shoulder ROM during submaximal power outputs. The results of this study suggest that the greater forces required at lower cadences to produce a given power output resulted in greater joint angles and range of shoulder and trunk movement. Greater isometric contractions for torso stabilization and increased cost of breathing possibly from respiratory-locomotor coupling may have contributed increased oxygen consumption at higher cadences.
Resumo:
A BSP (Bulk Synchronous Parallelism) computation is characterized by the generation of asynchronous messages in packages during independent execution of a number of processes and their subsequent delivery at synchronization points. Bundling messages together represents a significant departure from the traditional ‘one communication at a time’ approach. In this paper the semantic consequences of communication packaging are explored. In particular, the BSP communication structure is identified with a general form of substitution—predicate substitution. Predicate substitution provides a means of reasoning about the synchronized delivery of asynchronous communications when the immediate programming context does not explicitly refer to the variables that are to be updated (unlike traditional operations, such as the assignment $x := e$, where the names of the updated variables can be extracted from the context). Proofs of implementations of Newton's root finding method and prefix sum are used to illustrate the practical application of the proposed approach.
Resumo:
We study universal quantum computation using optical coherent states. A teleportation scheme for a coherent-state qubit is developed and applied to gate operations. This scheme is shown to be robust to detection inefficiency.
Resumo:
A long-lived coherent state and nonlinear interaction have been experimentally demonstrated for the vibrational mode of a trapped ion. We propose an implementation of quantum computation using coherent states of the vibrational modes of trapped ions. Differently from earlier experiments, we consider a far-off resonance for the interaction between external fields and the ion in a bidimensional trap. By appropriate choices of the detunings between the external fields, the adiabatic elimination of the ionic excited level from the Hamiltonian of the system allows for beam splitting between orthogonal vibrational modes, production of coherent states, and nonlinear interactions of various kinds. In particular, this model enables the generation of the four coherent Bell states. Furthermore, all the necessary operations for quantum computation, such as preparation of qubits and one-qubit and controlled two-qubit operations, are possible. The detection of the state of a vibrational mode in a Bell state is made possible by the combination of resonant and off-resonant interactions between the ion and some external fields. We show that our read-out scheme provides highly efficient discrimination between all the four Bell states. We extend this to a quantum register composed of many individually trapped ions. In this case, operations on two remote qubits are possible through a cavity mode. We emphasize that our remote-qubit operation scheme does not require a high-quality factor resonator: the cavity field acts as a catalyst for the gate operation.
Resumo:
We assess the effects of a realistic intrinsic model for imperfections in cluster states by introducing noisy cluster states and characterizing their role in the one-way computational model. A suitable strategy to counter-affect these non-idealities is represented by the use of small clusters, stripped of any redundancy, which leads to the search for compact schemes for one-way quantum computation. In light of this, we quantitatively address the behavior of a simple four-qubit cluster which simulates a controlled-NOT under the influences of our model for decoherence. Our scheme can be particularly useful in an all-optical setup and the strategy we address can be directly applied in those, experimental situations where small cluster states can be constucted.
Resumo:
As semiconductor electronic devices scale to the nanometer range and quantum structures (molecules, fullerenes, quantum dots, nanotubes) are investigated for use in information processing and storage, it, becomes useful to explore the limits imposed by quantum mechanics on classical computing. To formulate the problem of a quantum mechanical description of classical computing, electronic device and logic gates are described as quantum sub-systems with inputs treated as boundary conditions, outputs expressed.is operator expectation values, and transfer characteristics and logic operations expressed through the sub-system Hamiltonian. with constraints appropriate to the boundary conditions. This approach, naturally, leads to a description of the subsystem.,, in terms of density matrices. Application of the maximum entropy principle subject to the boundary conditions (inputs) allows for the determination of the density matrix (logic operation), and for calculation of expectation values of operators over a finite region (outputs). The method allows for in analysis of the static properties of quantum sub-systems.