Ingeniería Informática


Envíos recientes

Mostrando1 - 5 de 51
  • Ponencia en Congreso
    Equilivest: A robotic vest to aid in post-stroke dynamic balance rehabilitation
    (2023-01) Paviotti, Franco; Buniak, Esteban; Ramele, Rodrigo; Freixes, Orestes; Santos, Juan Miguel
    Brain stroke is a devastating medical condition, that affects world population and is the main cause of disabilities worldwide. Disabilities related to stroke can affect motor pathways, and may lead to several motor function disorders. One important aspect of motor function is balance which is the ability to control the body’s center of mass inside the base support provided by the lower limb. Stroke can affect dynamic balance as well, which is manifested while walking, impairing autonomy and independence, important factors in Activities of Daily Living (ADL) particularly for young patients.
  • Ponencia en Congreso
    Models and query languages for temporal property graph database
    (2022) Soliani, Valeria
    "Although property graphs are increasingly being studied by the research community, most authors do not consider the evolution of such graphs over time. However, this is needed to capture a wide range of real-world situations, where changes normally occur. In this work, we propose a temporal model and a high level query language for property graphs and analyse the real-world cases where they can be useful, with focus on transportation networks (like road and river networks) equipped with sensors that measure different variables over time. Many kinds of interesting paths arise in this scenario. To efficiently compute these paths, also path indexing techniques must be studied."
  • Ponencia en Congreso
    Modeling and querying sensor networks using temporal graph databases
    (2022) Kuijpers, Bart; Soliani, Valeria; Vaisman, Alejandro Ariel
    "Transportation networks (e.g., river systems or road net works) equipped with sensors that collect data for several different pur poses can be naturally modeled using graph databases. However, since networks can change over time, to represent these changes appropriately, a temporal graph data model is required. In this paper, we show that sensor-equipped transportation networks can be represented and queried using temporal graph databases and query languages. For this, we extend a recently introduced temporal graph data model and its high-level query language T-GQL to support time series in the nodes of the graph. We redefine temporal paths and study and implement a new kind of path, called Flow path. We take the Flanders’ river system as a use case."
  • Ponencia en Congreso
    Indexing continuous paths in temporal graphs
    (2022) Kuijpers, Bart; Ribas, Ignacio; Soliani, Valeria; Vaisman, Alejandro Ariel
    "Temporal property graph databases track the evolution over time of nodes, properties, and edges in graphs. Computing temporal paths in these graphs is hard. In this paper we focus on indexing Continuous Paths, defined as paths that exist continuously during a certain time interval. We propose an index structure called TGIndex where index nodes are defined as nodes in the graph database. Two different indexing strategies are studied. We show how the index is used for querying and also present different search strategies, that are compared and analyzed using a large synthetic graph."
  • Ponencia en Congreso
    Incorporating coverage criteria in bounded exhaustive black box test generation of structural inputs
    (2011) Aguirre, Nazareno; Bengolea, Valeria; Galeotti, Juan Pablo; Frías, Marcelo
    "The automated generation of test cases for heap allocated, complex, structures is particularly difficult. Various state of the art tools tackle this problem by bounded exhaustive exploration of potential test cases, using constraint solving mechanisms based on techniques such as search, model checking, symbolic execution and combinations of these. In this article we present a technique for improving the bounded ex haustive constraint based test case generation of structurally complex inputs, for “filtering” approaches. The technique works by guiding the search considering a given black box test criterion. Such a test criterion is incorporated in the constraint based mechanism so that the exploration of potential test cases can be pruned without missing coverable classes of inputs, corresponding to the test criterion. We present the technique, together with some case studies illustrating its performance for some black box testing criteria. The experimental results associated with these case studies are shown in the context of Korat, a state of the art tool for constraint based test case generation, but the approach is applicable in other contexts using a filtering approach to test generation."