|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
24.
|
|
Resolving photon number states in a superconducting circuit
/ Schuster, D I ; Houck, A A ; Schreier, J A ; Wallraff, A ; Gambetta, J M ; Blais, A ; Frunzio, L ; Johnson, B ; Devoret, M H ; Girvin, S M et al.
Electromagnetic signals are always composed of photons, though in the circuit domain those signals are carried as voltages and currents on wires, and the discreteness of the photon's energy is usually not evident. [...]
cond-mat/0608693.
-
2006. - 6 p.
Access to fulltext document
|
|
|
Detailed record
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
41.
|
|
Liquid-vapor transition of systems with mean field universality class
/ Pauschenwein, G J ; Caillol, J M ; Levesque, D ; Weis, J J ; Schoell-Paschinger, E ; Kahl, G
We have considered a system where the interaction, v(r) = v_IS(r) + xi^2 v_MF(r), is given as a linear combination of two potentials, each of which being characterized with a well-defined critical behavior: for v_IS(r) we have chosen the potential of the restricted primitive model which is known to belong to the Ising 3D (IS) universality class, while for v_MF(r) we have considered a long-range interaction in the Kac-limit, displaying mean field (MF) behavior. [...]
cond-mat/0609096.
-
2006. - 9 p.
Access to fulltext document
|
|
|
Detailed record
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
61.
|
|
On the logical definability of certain graph and poset languages
/ Weil, P
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order logic, a natural extension of monadic second-order logic), and to be recognizable in an algebraic framework induced by the notion of modular decomposition of a finite graph. More precisely, we consider the set $F\_\infty$ of composition operations on graphs which occur in the modular decomposition of finite graphs. [...]
cs.LO/0609048.-
2004
- Published in : J. Automat. Lang. Comput.: 9 (2004) , pp. 147-165
External link: cs.LO/0609048 PDF
|
|
|
Detailed record
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
97.
|
|
On Bus Graph Realizability
/ Ada, A ; Coggan, M ; Marco, P D ; Doyon, A ; Flookes, L ; Heilala, S ; Kim, E ; Wing, J L O ; Preville-Ratelle, L F ; Whitesides, S et al.
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1; V2;E), where the maximum degree of vertices in V2 is 4, can G be embedded on a two dimensional grid such that each vertex in V1 is drawn as a line segment along a grid line, each vertex in V2 is drawn as a point at a grid point, and each edge e = (u; v) for some u 2 V1 and v 2 V2 is drawn as a line segment connecting u and v, perpendicular to the line segment for u? We show that this problem is NP-complete, and sketch how our proof techniques can be used to show the hardness of several other related problems..
cs.CG/0609127 ; SOCS-TR-2006-1.
-
2006.
Access to fulltext document
|
|
|
Detailed record
|
|
|
|
|
|
|
|
104.
|
Position-sensitive Si pad detectors for electron emission channeling experiments
/ ISOLDE Collaboration
Position-sensitive detector systems, initially developed for the detection of X-rays, have been adapted for their use in electron emission channeling experiments. Each detection system consists of a 30.8x30.8 mm$^{2}$ 22x22 -pad Si detector, either of 0.3 mm, 0.5 mm or 1 mm thickness, four 128$-$channel preamplifier chips, a backplane trigger circuit, a sampling analog to digital converter, a digital signal processor, and a personal computer for data display and storage. [...]
CERN-OPEN-2006-045.-
Geneva : CERN, 2004 - 15 p.
- Published in : Nucl. Instrum. Methods Phys. Res., A 524 (2004) 245-256
Access to fulltext document: PDF;
|
|
|
Detailed record
|
|
|
106.
|
|
Statistical Models of Fracture
/ Alava, M J ; Nukala, P K ; Zapperi, S
Disorder and long-range interactions are two of the key components that make material failure an interesting playfield for the application of statistical mechanics. The cornerstone in this respect has been lattice models of the fracture in which a network of elastic beams, bonds or electrical fuses with random failure thresholds are subject to an increasing external load. [...]
cond-mat/0609650.-
2006 - 148 p.
- Published in : Adv. Phys.: 55 (2006) , pp. 349-476
External link: cond-mat/0609650 PDF
|
|
|
Detailed record
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
127.
|
|
On the dynamics of spin systems in the Landau-Lifshitz theory
/ Krey, U
In the framework of the Landau-Lifshitz equations without any dissipation (an approximation which may also be helpful for finite, but weak Gilbert damping), with all interactions included (specifically always with exchange and magnetic dipole interactions), for general ground states, geometries and domain structures, and many types of effective fields (including contributions from spin currents etc.) the dynamics of the spin precession around the ground state is considered. [...]
cond-mat/0610122.
-
2006. - 12 p.
Access to fulltext document
|
|
|
Detailed record
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
142.
|
Simulating at Realistic Quark Masses: Pseudoscalar Decay Constants and Chiral Logarithms
/ Göckeler, M ; Horsley, R ; Nakamura, Y ; Pleiter, D ; Rakow, P E L ; Schierholz, G ; Schroers, W ; Streuer, T ; Stüben, H ; Zanotti, J M
Due to improvements in computer performance and algorithms, the rapidly increasing cost for unquenched Wilson-type fermions with lighter quarks has been ameliorated and new simulations are now possible. Here we present results using two flavours of O(a)-improved Wilson fermions for meson decay constants at pseudoscalar masses down to 320MeV. [...]
hep-lat/0610066; DESY-06-169; DESY-2006-169; Edinburgh-2006-31; Liverpool-LTH-724.-
Hamburg : DESY, 2006 - 7 p.
- Published in : PoS: LAT2006 (2006) , pp. 179
Fulltext: PDF; Published version from PoS: PDF; External link: hep-lat/0610066 PDF
In : 24th International Symposium on Lattice Field Theory, Tucson, AZ, USA, 23 - 28 Jul 2006, pp.179
|
|
|
Detailed record
|
|
|
|
|
|
|
|
|
|
|
152.
|
|
Inductive-data-type Systems
/ Blanqui, F ; Jouannaud, J P ; Okada, M
In a previous work (``Abstract Data Type Systems'', TCS 173(2), 1997), the last two authors presented a combined language made of a (strongly normalizing) algebraic rewrite system and a typed lambda-calculus enriched by pattern-matching definitions following a certain format, called the ``General Schema'', which generalizes the usual recursor definitions for natural numbers and similar ``basic inductive types''. [...]
cs.LO/0610066.
-
2006.
Access to fulltext document
|
|
|
Detailed record
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|