On the impact of overlapping access points in detecting node encounters

Data traces, consisting of logs about the use of mobile and wireless networks, have been used to study the statistics of encounters between mobile nodes, in an attempt to predict the performance of opportunistic networks. Understanding the role and potential of mobile devices as relaying nodes in message dissemination and delivery depends on the knowledge about patterns and number of encounters among nodes. Data traces about the use of WiFi networks are widely available and can be used to extract large datasets of encounters between nodes. However, these logs only capture indirect encounters between nodes, and the resulting encounters datasets might not realistically represent the spatial and temporal behaviour of nodes. This paper addresses the impact of overlapping between the coverage areas of different Access Points of WiFi networks in extracting encounters datasets from the usage logs. Simulation and real-world experimental results show that indirect encounter traces extracted directly from these logs strongly underestimate the opportunities for direct node-to- node message exchange in opportunistic networks.

Ki-67 expression in CRC lymph node metastasis does not predict survival

Colorectal cancer is one of the most common malignancies and a leading cause of cancer death worldwide. Molecular markers may improve clinicopathologic staging and provide a basis to guide novel therapeutic strategies which target specific tumourassociated molecules according to individual tumour biology; however, so far, no ideal molecular marker has been found to predict disease progression. We tested Ki-67 proliferation marker in primary and lymph node metastasis of CRC. We observed a statistical significant difference between the positive rates of neoplastic cells positively stained byKi-67 in both sites, with remarkable increased number of Ki-67 positive cells in primary tumor cells compared to cancer cells that invaded lymph nodes. We can speculate that the metastatic CRC in lymph node can be more resistant to the drugs that target cellular division.

Minilaparoscopy and sentinel lymph node in uterine cancer

CRSLS MIS Case Reports from SLS.org.

Ontological representation of tumor-node-metastasis classification and an ontology-driven classifier: a study on colorectal cancer

Dissertação de mestrado integrado em Engenharia Biomédica (área de especialização em Informática Médica)

Flow updating: fault-tolerant aggregation for dynamic networks

Documento submetido para revisão pelos pares. A publicar em Journal of Parallel and Distributed Computing. ISSN 0743-7315

Refinement in hybridised institutions

Hybrid logics, which add to the modal description of transition structures the ability to refer to specific states, offer a generic framework to approach the specification and design of reconfigurable systems, i.e., systems with reconfiguration mechanisms governing the dynamic evolution of their execution configurations in response to both external stimuli or internal performance measures. A formal representation of such systems is through transition structures whose states correspond to the different configurations they may adopt. Therefore, each node is endowed with, for example, an algebra, or a first-order structure, to precisely characterise the semantics of the services provided in the corresponding configuration. This paper characterises equivalence and refinement for these sorts of models in a way which is independent of (or parametric on) whatever logic (propositional, equational, fuzzy, etc) is found appropriate to describe the local configurations. A Hennessy–Milner like theorem is proved for hybridised logics.

Concise server-wide causality management for eventually consistent data stores

Large scale distributed data stores rely on optimistic replication to scale and remain highly available in the face of net work partitions. Managing data without coordination results in eventually consistent data stores that allow for concurrent data updates. These systems often use anti-entropy mechanisms (like Merkle Trees) to detect and repair divergent data versions across nodes. However, in practice hash-based data structures are too expensive for large amounts of data and create too many false conflicts. Another aspect of eventual consistency is detecting write conflicts. Logical clocks are often used to track data causality, necessary to detect causally concurrent writes on the same key. However, there is a nonnegligible metadata overhead per key, which also keeps growing with time, proportional with the node churn rate. Another challenge is deleting keys while respecting causality: while the values can be deleted, perkey metadata cannot be permanently removed without coordination. Weintroduceanewcausalitymanagementframeworkforeventuallyconsistentdatastores,thatleveragesnodelogicalclocks(BitmappedVersion Vectors) and a new key logical clock (Dotted Causal Container) to provides advantages on multiple fronts: 1) a new efficient and lightweight anti-entropy mechanism; 2) greatly reduced per-key causality metadata size; 3) accurate key deletes without permanent metadata.