[PDF] Top 20 Programa de Educación para la Salud de Prevención de las recaídas de los Trastornos de la Conducta Alimentaria

... a secure channel between them. The works that do consider general graph topologies usually take the following ...given graph G. Although this framework yields protocols that are secure in the ... See full document

... a graph-theoretic parallelization scheme trying to minimize the gap between the optimal solution and the practical ...evenly distributed among all levels, and the majority is in the lower level of ... See full document

... merical technique of sparse matrix inversions for VLSI cir- cuits or networks has been developed by using the block- triangularization of matrices (see, for instance, Orlandea et al., 1977a; Murata et al., 1985), where a ... See full document

... Proposed measurement placement method is based on network graph theory. The metering scheme assures that each branch of power system network is incidental by power injection or flow measurements at either ends or ... See full document

... To give our formal definition of a cluster, we start withthe intuitive idea that the assignment of the edge- weightsinduces, in some way to be described, an assignment ofweights on the vertices. This perspective gives us ... See full document

... This work could not have been realized without the help of many different people. First of all I thank Siemens Netherlands, location Hengelo, for giving me the opportunity to write my final thesis at and about their ... See full document

... The GA-based GAHSI segmentation scheme [23] is a novel and simple approach to robustly segment an outdoor field image into plant and background regions under variable lighting conditions. The GAHSI obtained an ... See full document

... ABSTRACT: The meter placement problem involves selection of meters, number, type and place. This paper describes graph theoretic approach to solve the measurement placement problem for power system ... See full document

... the approach adopted by Telos for programming of computations on large ...overlay-based approach takes inspiration from approaches that have proved to be robust and efficient in massively distributed ... See full document

... original graph is low, the simple fact that a subgraph is connected will be sufficiently improbable so that any connected subgraph will appear sufficiently complete or ...connected graph of n points must ... See full document

... If this hypothesis is correct, it is natural to ask why the SVM result using concepts shows a substantial increase in accuracy from 10 to 30 training documents. If larger texts yield nosier semantic profiles, why does ... See full document

... To illustrate the utility of the graph-theoretic ap- proach, we use it to analyze maps of chromosome 1 of rice (Oryza sativa L.). Several dense molecular genetic maps have been developed by different groups ... See full document

... attack graph is a general formalism used to model security vulnerabilities of a system and all possible sequences of exploits which an intruder can use to achieve a specific ...attack graph complexity and ... See full document

... Network Security is one of the most important topics which catch lot of attention and interest in the field of internet and networking. The security paradigms in the world of the corporate network, or intranet, and the ... See full document

... of graph in general: Math- ematically, graph is defined as a set of sets – one of which contains the nodes and other, a set of ordered pairs or ...of graph will be dis- cussed, namely „tree‟. A tree ... See full document

... and distributed approach with their ...on distributed approach will be merged with deluge protocol which is based on centralized approach is efficiently used for reprogramming sensor ... See full document

... Distributed Storage for User Information. Another peer resource that can be harnessed is disk storage. As we discuss later, personalisation of services is a major challenge that ubiquitous environments need to ... See full document

... Big data is difficult to handle, process and analyse using traditional approach. Using services, we can resolve problem like resource sharing, storage capacity and data transfer bottlenecks etc. But there is a ... See full document

... Motivated by the emerging applications of UCs in various privacy preserving computa- tion scenarios, we revisit Valiant’s universal circuits, and propose a 4-way supernode of size 18, and an EUG of size 4.5n log n. As ... See full document

... Abstract — A distributed routing control algorithm for dy- namic networks has recently been presented in the literature. The networks were modeled using time evolution of density at network edges and the routing ... See full document