Restless Exploration of Periodic Temporal Graphs

A temporal graph is a sequence of graphs, indexed by discrete time steps, with a fixed vertex set but with an edge set that is able to change over time. In the temporal graph exploration problem, an agent wants to visit all the vertices of a given temporal graph. In the classical model, at each time step the agent can either stay where they are, or move along one edge. In this work we add a constraint called restlessness that forces the agent to move along one edge at each time step. We mainly focus on (infinite) periodical temporal graphs. We show that if the period is 2 one can decide in polynomial time whether exploring the whole graph is possible or not, while this problem turns out to be NP-hard for any period p ? 3. We also show some time bounds on the explorations of such graphs when the exploration is possible

Enabling personalized healthcare by analyzing semantic dependencies in a conceptual co-occurrence network based on a medical vocabulary

The amount of medical knowledge is constantly growing thus providing new hope for people having health-related problems. However a challenge is to develop flexible methods to facilitate managing and interpreting large medical knowledge entities. There is a need to enhance health literacy by developing personalized health support tools. Furthermore there is a need to assist decision-making with decision support tools. The recent and on-going changes in everyday life both on technological and societal levels (for example adoption of smart phones and personal mobile medical tracking devices, social networking, open source and open data initiatives, fast growth of accumulated medical data, need for new self-care solutions for aging European population) motivate to invest in the development of new computerized personalized methods for knowledge management of medical data for diagnosis and treatment. To enable creation of new adaptive personalized health support tools we have carried out an evaluation of semantic dependencies in a conceptual co-occurrence network covering a set of concepts of a medical vocabulary with experimental results ranging up to 2994 unique nouns, 82814 unique conceptual links and 200000 traversed link steps.Peer reviewe

Evaluation of semantic dependencies in a conceptual co-occurrence network of a medical vocabulary

The amount of medical knowledge is constantly growing thus providing new hope for people having health-relatedproblems. However a challenge is to develop flexible methods to facilitate managing and interpretinglarge medical knowledge entities. There is a need to enhance health literacy by developing personalized healthsupport tools. Furthermore there is a need to assist decision-making with decision support tools. The recent andon-going changes in everyday life both on technological and societal levels (for example adoption of smartphones and personal mobile medical tracking devices, social networking, open source and open data initiatives,fast growth of accumulated medical data, need for new self-care solutions for aging European population)motivate to invest in the development of new computerized personalized methods for knowledge management ofmedical data for diagnosis and treatment. To enable creation of new adaptive personalized health support toolswe have carried out an evaluation of semantic dependencies in a conceptual co-occurrence network covering aset of concepts of a medical vocabulary with experimental results ranging up to 2994 unique nouns, 82814unique conceptual links and 200000 traversed link steps.Peer reviewe

Evolution of the CKM Matrix in the Universal Extra Dimension Model

The evolution of the Cabibbo-Kobayashi-Maskawa matrix and the quark Yukawa couplings is performed for the one-loop renormalization group equations in the universal extra dimension model. It is found that the evolution of mixing angles and the CP violation measure J may rapidly vary in the presence of the Kaluza-Klein modes, and this variation becomes dramatic as the energy approaches the unification scale.Comment: 10 pages, 4 figure

Query-Competitive Sorting with Uncertainty

We study the problem of sorting under incomplete information, when queries are used to resolve uncertainties. Each of n data items has an unknown value, which is known to lie in a given interval. We can pay a query cost to learn the actual value, and we may allow an error threshold in the sorting. The goal is to find a nearly-sorted permutation by performing a minimum-cost set of queries. We show that an offline optimum query set can be found in polynomial time, and that both oblivious and adaptive problems have simple query-competitive algorithms. The query-competitiveness for the oblivious problem is n for uniform query costs, and unbounded for arbitrary costs; for the adaptive problem, the ratio is 2. We then present a unified adaptive strategy for uniform query costs that yields: (i) a 3/2-query-competitive randomized algorithm; (ii) a 5/3-query-competitive deterministic algorithm if the dependency graph has no 2-components after some preprocessing, which has query-competitive ratio 3/2 + O(1/k) if the components obtained have size at least k; (iii) an exact algorithm if the intervals constitute a laminar family. The first two results have matching lower bounds, and we have a lower bound of 7/5 for large components. We also show that the advice complexity of the adaptive problem is floor[n/2] if no error threshold is allowed, and ceil[n/3 * lg 3] for the general case

Mean-field methods in evolutionary duplication-innovation-loss models for the genome-level repertoire of protein domains

We present a combined mean-field and simulation approach to different models describing the dynamics of classes formed by elements that can appear, disappear or copy themselves. These models, related to a paradigm duplication-innovation model known as Chinese Restaurant Process, are devised to reproduce the scaling behavior observed in the genome-wide repertoire of protein domains of all known species. In view of these data, we discuss the qualitative and quantitative differences of the alternative model formulations, focusing in particular on the roles of element loss and of the specificity of empirical domain classes.Comment: 10 Figures, 2 Table

Visual analytics of Hebrew manuscripts codicological metadata

This paper presents the CodicoDaViz research project, developed with the goal of applying data visualisation techniques to the field of codicology. Adding to the multidisciplinary nature of digital humanities (DH), this project brings together a group of experts of DH, business intelligence and computer science. Using Hebrew manuscript data as a starting point, CodicoDaViz proposes an environment for exploratory analysis to be used by Humanities experts to deepen their understanding of codicological data, and to formulate new research hypotheses. In this paper we demonstrate how data visualisation was instrumental in understanding and structuring the dataset. Examples of the dashboards that have been designed (in Tableau) to enable an interactive and ad-hoc exploration of data are also discussed.info:eu-repo/semantics/acceptedVersio