Search results for "PROTOCOL"
showing 10 items of 1808 documents
Régimen jurídico del Protocolo en España
2018
Propugnamos que el protocolo es el conjunto de principios, normas jurídicas, usos y costumbres, también jurídicas, principios generales del Derecho y criterios de los Tribunales de Justicia que determinan el orden de celebración de los actos oficiales y los elementos que intervienen en los mismos, que tienen como fin transmitir el reflejo externo de la caracterización y consideración, tanto social como jurídica del Poder en el Estado. Es, pues, ese reflejo externo, en su doble vertiente, uno de los fines del protocolo. No obstante entendemos el mismo como un conjunto de elementos: símbolos, tratamientos, regulación de la Casa Real, Derecho Premial y Nobiliario y, sobre todo, normas regulado…
Hypoxia: Importance in tumor biology, noninvasive measurement by imaging, and value of its measurement in the management of cancer therapy
2006
The Cancer Imaging Program of the National Cancer Institute convened a workshop to assess the current status of hypoxia imaging, to assess what is known about the biology of hypoxia as it relates to cancer and cancer therapy, and to define clinical scenarios in which in vivo hypoxia imaging could prove valuable.Hypoxia, or low oxygenation, has emerged as an important factor in tumor biology and response to cancer treatment. It has been correlated with angiogenesis, tumor aggressiveness, local recurrence, and metastasis, and it appears to be a prognostic factor for several cancers, including those of the cervix, head and neck, prostate, pancreas, and brain. The relationship between tumor oxy…
Subcutaneous octreotide versus oral loperamide in the treatment of diarrhea following chemotherapy
1993
Forty patients with chemotherapy-related diarrhea were randomized to receive (i) octreotide 0.5 mg three times per day s.c. or (ii) loperamide 4 mg three times per day p.o. until complete remission of diarrhea was achieved. In the octreotide group 80% of patients showed complete resolution of loose bowel movements within 4 days of therapy, while in the loperamide group this goal was obtained in only 30% of cases (p < 0.001). If after 4 days no benefit was seen, patients were considered to have failed antidiarrheal therapy. Failure was recorded in only one case (5%) treated with s.c. octreotide and in five patients (25%) who received loperamide. The mean duration of antidiarrheal therapy nec…
Physics, Techniques and Review of Neuroradiological Applications of Diffusion Kurtosis Imaging (DKI)
2016
In recent years many papers about diagnostic applications of diffusion tensor imaging (DTI) have been published. This is because DTI allows to evaluate in vivo and in a non-invasive way the process of diffusion of water molecules in biological tissues. However, the simplified description of the diffusion process assumed in DTI does not permit to completely map the complex underlying cellular components and structures, which hinder and restrict the diffusion of water molecules. These limitations can be partially overcome by means of diffusion kurtosis imaging (DKI). The aim of this paper is the description of the theory of DKI, a new topic of growing interest in radiology. DKI is a higher or…
If P ≠ NP then Some Strongly Noninvertible Functions Are Invertible
2001
Rabi, Rivest, and Sherman alter the standard notion of noninvertibility to a new notion they call strong noninvertibility, and show--via explicit cryptographic protocols for secret-key agreement ([RS93, RS97] attribute this to Rivest and Sherman) and digital signatures [RS93, RS97]--that strongly noninvertible functions would be very useful components in protocol design. Their definition of strong noninvertibility has a small twist ("respecting the argument given") that is needed to ensure cryptographic usefulness. In this paper, we show that this small twist has a large, unexpected consequence: Unless P = NP, some strongly noninvertible functions are invertible.
If P≠NP then some strongly noninvertible functions are invertible
2006
AbstractRabi, Rivest, and Sherman alter the standard notion of noninvertibility to a new notion they call strong noninvertibility, and show—via explicit cryptographic protocols for secret-key agreement (Rabi and Sherman attribute this protocol to Rivest and Sherman) and digital signatures (Rabi and Sherman)—that strongly noninvertible functions are very useful components in protocol design. Their definition of strong noninvertibility has a small twist (“respecting the argument given”) that is needed to ensure cryptographic usefulness. In this paper, we show that this small twist has a consequence: unless P=NP, some strongly noninvertible functions are invertible.
A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms
2013
Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.
Building Semantic Trees from XML Documents
2016
International audience; The distributed nature of the Web, as a decentralized system exchanging information between heterogeneous sources, has underlined the need to manage interoperability, i.e., the ability to automatically interpret information in Web documents exchanged between different sources, necessary for efficient information management and search applications. In this context, XML was introduced as a data representation standard that simplifies the tasks of interoperation and integration among heterogeneous data sources, allowing to represent data in (semi-) structured documents consisting of hierarchically nested elements and atomic attributes. However, while XML was shown most …
A novel XML document structure comparison framework based-on sub-tree commonalities and label semantics
2012
International audience; XML similarity evaluation has become a central issue in the database and information communities, its applications ranging over document clustering, version control, data integration and ranked retrieval. Various algorithms for comparing hierarchically structured data, XML documents in particular, have been proposed in the literature. Most of them make use of techniques for finding the edit distance between tree structures, XML documents being commonly modeled as Ordered Labeled Trees. Yet, a thorough investigation of current approaches led us to identify several similarity aspects, i.e., sub-tree related structural and semantic similarities, which are not sufficient…
Building Ontologies from XML Data Sources
2009
In this paper, we present a tool called X2OWL that aims at building an OWL ontology from an XML datasource. This method is based on XML schema to automatically generate the ontology structure, as well as, a set of mapping bridges. The presented method also includes a refinement step that allows to clean the mapping bridges and possibly to restructure the generated ontology.