1,294 research outputs found

    The role of avatars in e-government interfaces

    Get PDF
    This paper investigates the use of avatars to communicate live message in e-government interfaces. A comparative study is presented that evaluates the contribution of multimodal metaphors (including avatars) to the usability of interfaces for e-government and user trust. The communication metaphors evaluated included text, earcons, recorded speech and avatars. The experimental platform used for the experiment involved two interface versions with a sample of 30 users. The results demonstrated that the use of multimodal metaphors in an e-government interface can significantly contribute to enhancing the usability and increase trust of users to the e-government interface. A set of design guidelines, for the use of multimodal metaphors in e-government interfaces, was also produced

    On the Number of Unbordered Factors

    Full text link
    We illustrate a general technique for enumerating factors of k-automatic sequences by proving a conjecture on the number f(n) of unbordered factors of the Thue-Morse sequence. We show that f(n) = 4 and that f(n) = n infinitely often. We also give examples of automatic sequences having exactly 2 unbordered factors of every length

    An efficient numerical algorithm on irreducible multiparty correlations

    Full text link
    We develop a numerical algorithm to calculate the degrees of irreducible multiparty correlations for an arbitrary multiparty quantum state, which is efficient for any quantum state of up to five qubits. We demonstrate the power of the algorithm by the explicit calculations of the degrees of irreducible multiparty correlations in the 4-qubit GHZ state, the Smolin state, and the 5-qubit W state. This development takes a crucial step towards practical applications of irreducible multiparty correlations in real quantum many-body physics.Comment: 4 pages. Comments are welcom

    Tetrathiafulvalene-Calix[4]Pyrrole in the Chloride Anion Controled Molecular Recognition of 2,5,7-trinitro-9-dicyanomethylenefluorene-C60

    Get PDF
    Date du colloque : 05/2008International audienc

    Weakly bound atomic trimers in ultracold traps

    Full text link
    The experimental three-atom recombination coefficients of the atomic states 23^{23}NaF=1,mF=1>|F=1,m_F=-1>, 87^{87}RbF=1,mF=1>|F=1,m_F=-1> and 85^{85}RbF=2,mF=2>|F=2,m_F=-2>, together with the corresponding two-body scattering lengths, allow predictions of the trimer bound state energies for such systems in a trap. The recombination parameter is given as a function of the weakly bound trimer energies, which are in the interval 1<m(a/)2E3<6.9 1<m(a/\hbar)^2 E_3< 6.9 for large positive scattering lengths, aa. The contribution of a deep-bound state to our prediction, in the case of 85^{85}RbF=2,mF=2>|F=2,m_F=-2>, for a particular trap, is shown to be relatively small.Comment: 5 pages, 1 figur

    On the complexity of strongly connected components in directed hypergraphs

    Full text link
    We study the complexity of some algorithmic problems on directed hypergraphs and their strongly connected components (SCCs). The main contribution is an almost linear time algorithm computing the terminal strongly connected components (i.e. SCCs which do not reach any components but themselves). "Almost linear" here means that the complexity of the algorithm is linear in the size of the hypergraph up to a factor alpha(n), where alpha is the inverse of Ackermann function, and n is the number of vertices. Our motivation to study this problem arises from a recent application of directed hypergraphs to computational tropical geometry. We also discuss the problem of computing all SCCs. We establish a superlinear lower bound on the size of the transitive reduction of the reachability relation in directed hypergraphs, showing that it is combinatorially more complex than in directed graphs. Besides, we prove a linear time reduction from the well-studied problem of finding all minimal sets among a given family to the problem of computing the SCCs. Only subquadratic time algorithms are known for the former problem. These results strongly suggest that the problem of computing the SCCs is harder in directed hypergraphs than in directed graphs.Comment: v1: 32 pages, 7 figures; v2: revised version, 34 pages, 7 figure

    The fully entangled fraction as an inclusive measure of entanglement applications

    Get PDF
    Characterizing entanglement in all but the simplest case of a two qubit pure state is a hard problem, even understanding the relevant experimental quantities that are related to entanglement is difficult. It may not be necessary, however, to quantify the entanglement of a state in order to quantify the quantum information processing significance of a state. It is known that the fully entangled fraction has a direct relationship to the fidelity of teleportation maximized under the actions of local unitary operations. In the case of two qubits we point out that the fully entangled fraction can also be related to the fidelities, maximized under the actions of local unitary operations, of other important quantum information tasks such as dense coding, entanglement swapping and quantum cryptography in such a way as to provide an inclusive measure of these entanglement applications. For two qubit systems the fully entangled fraction has a simple known closed-form expression and we establish lower and upper bounds of this quantity with the concurrence. This approach is readily extendable to more complicated systems.Comment: 14 pages, 2 figures, accepted in Physics Letters

    The diagonalization method in quantum recursion theory

    Full text link
    As quantum parallelism allows the effective co-representation of classical mutually exclusive states, the diagonalization method of classical recursion theory has to be modified. Quantum diagonalization involves unitary operators whose eigenvalues are different from one.Comment: 15 pages, completely rewritte

    Human Blood Lipoprotein Predictions from <sup>1</sup>H NMR Spectra:Protocol, Model Performances, and Cage of Covariance

    Get PDF
    Lipoprotein subfractions are biomarkers for the early diagnosis of cardiovascular diseases. The reference method, ultracentrifugation, for measuring lipoproteins is time-consuming, and there is a need to develop a rapid method for cohort screenings. This study presents partial least-squares regression models developed using 1H nuclear magnetic resonance (NMR) spectra and concentrations of lipoproteins as measured by ultracentrifugation on 316 healthy Danes. This study explores, for the first time, different regions of the 1H NMR spectrum representing signals of molecules in lipoprotein particles and different lipid species to develop parsimonious, reliable, and optimal prediction models. A total of 65 lipoprotein main and subfractions were predictable with high accuracy, Q2 of >0.6, using an optimal spectral region (1.4-0.6 ppm) containing methylene and methyl signals from lipids. The models were subsequently tested on an independent cohort of 290 healthy Swedes with predicted and reference values matching by up to 85-95%. In addition, an open software tool was developed to predict lipoproteins concentrations in human blood from standardized 1H NMR spectral recordings
    corecore