913 resultados para Vehicular ad hoc networks
Resumo:
El primer fallo de la Corte Penal Internacional ha confirmado que el Artículo 25(3) del Estatuto de Roma se basa en la teoría del dominio del hecho para hacer la distinción entre autoría y participación. Por el contrario, desde 2003, la jurisprudencia de los tribunales ad hoc construye el concepto de coautoría con base en la doctrina de la empresa criminal conjunta y emplea un criterio subjetivo de autor. En el presente texto analizaremos primero los problemas planteados por esta línea jurisprudencial de los tribunales ad hoc,para proseguir con el análisis del artículo del Estatuto de Roma que más parece asemejarse a la doctrina de la empresa criminal conjunta :el Artículo 25 (3) (d). El documento concluye que ninguna de las categorías de la empresa criminal conjunta tiene cabida en dicha disposición.
Resumo:
Documento incluído en el volumen 'Experiències d'innovació educativa. Acció tutorial i formació'. En el crédito variable para la educación secundaria obligatoria 'Análisis demográfico de la localidad con el ordenador como herramienta de trabajo' se han repartido la materia a exponer dos profesores de dos disciplinas (ciencias sociales y tecnología administrativa). Trabajar en grupo con el objetivo de hacer un crédito, mejora la motivación del profesorado. Se explica la temporalización, justificación, objetivos, proceso de trabajo del grupo de profesores. Se sintetizan los resultados de la experiencia y se alude a la aplicabilidad para otros profesores. Se incluye en un anexo un test de evaluación del crédito.
Resumo:
Resumen tomado de la publicación
Resumo:
Resumen basado en el del autor. Resumen en castellano e ingl??s
Resumo:
La 'Conferencia ah hoc sobre la educación de los emigrantes', se celebró bajo los auspicios del Consejo de Europa y de la Conferencia permanente de Ministros europeos de Educación, en Estrasburgo en noviembre de 1974, con asistencia de representantes de diecinueve países europeos y de organismos internacionales tales como la UNESCO y la OCDE. Esta Conferencia tenía como objetivos establecer unas conclusiones y recomendaciones sobre las acciones a emprender en este campo desde un punto de vista nacional, bilateral y multilateral. Las propuestas giraron en torno a: mejorar la situación de emigrantes y su familia, sobre todo en el plano educativo, a la llegada del país de acogida; dar garantías en materia de educación antes y durante el período de escolaridad obligatoria y proporcionar también garantías en materia de formación profesional, formación técnica y educación general de adultos y adolescentes. Las resoluciones adoptadas en la Conferencia a este respecto, fueron: 1. La mejora de la situación del emigrante y de su familia a su llegada al país de recepción, particularmente en el plano de la educación. 2. Garantías en materia de educación antes y después del periodo de escolaridad obligatoria en el país de recepción. 3. Garantías en materia de Formación Profesional, de Formación Técnica y de educación general de adultos y adolescentes.
Resumo:
This paper analyzes the performance of enhanced relay-enabled distributed coordination function (ErDCF) for wireless ad hoc networks under transmission errors. The idea of ErDCF is to use high data rate nodes to work as relays for the low data rate nodes. ErDCF achieves higher throughput and reduces energy consumption compared to IEEE 802.11 distributed coordination function (DCF) in an ideal channel environment. However, there is a possibility that this expected gain may decrease in the presence of transmission errors. In this work, we modify the saturation throughput model of ErDCF to accurately reflect the impact of transmission errors under different rate combinations. It turns out that the throughput gain of ErDCF can still be maintained under reasonable link quality and distance.
Resumo:
This paper analyzes the delay performance of Enhanced relay-enabled Distributed Coordination Function (ErDCF) for wireless ad hoc networks under ideal condition and in the presence of transmission errors. Relays are nodes capable of supporting high data rates for other low data rate nodes. In ideal channel ErDCF achieves higher throughput and reduced energy consumption compared to IEEE 802.11 Distributed Coordination Function (DCF). This gain is still maintained in the presence of errors. It is also expected of relays to reduce the delay. However, the impact on the delay behavior of ErDCF under transmission errors is not known. In this work, we have presented the impact of transmission errors on delay. It turns out that under transmission errors of sufficient magnitude to increase dropped packets, packet delay is reduced. This is due to increase in the probability of failure. As a result the packet drop time increases, thus reflecting the throughput degradation.
Resumo:
The K-Means algorithm for cluster analysis is one of the most influential and popular data mining methods. Its straightforward parallel formulation is well suited for distributed memory systems with reliable interconnection networks, such as massively parallel processors and clusters of workstations. However, in large-scale geographically distributed systems the straightforward parallel algorithm can be rendered useless by a single communication failure or high latency in communication paths. The lack of scalable and fault tolerant global communication and synchronisation methods in large-scale systems has hindered the adoption of the K-Means algorithm for applications in large networked systems such as wireless sensor networks, peer-to-peer systems and mobile ad hoc networks. This work proposes a fully distributed K-Means algorithm (EpidemicK-Means) which does not require global communication and is intrinsically fault tolerant. The proposed distributed K-Means algorithm provides a clustering solution which can approximate the solution of an ideal centralised algorithm over the aggregated data as closely as desired. A comparative performance analysis is carried out against the state of the art sampling methods and shows that the proposed method overcomes the limitations of the sampling-based approaches for skewed clusters distributions. The experimental analysis confirms that the proposed algorithm is very accurate and fault tolerant under unreliable network conditions (message loss and node failures) and is suitable for asynchronous networks of very large and extreme scale.
Resumo:
Recently the focus given to Web Services and Semantic Web technologies has provided the development of several research projects in different ways to addressing the Web services composition issue. Meanwhile, the challenge of creating an environment that provides the specification of an abstract business process and that it is automatically implemented by a composite service in a dynamic way is considered a currently open problem. WSDL and BPEL provided by industry support only manual service composition because they lack needed semantics so that Web services are discovered, selected and combined by software agents. Services ontology provided by Semantic Web enriches the syntactic descriptions of Web services to facilitate the automation of tasks, such as discovery and composition. This work presents an environment for specifying and ad-hoc executing Web services-based business processes, named WebFlowAH. The WebFlowAH employs common domain ontology to describe both Web services and business processes. It allows processes specification in terms of users goals or desires that are expressed based on the concepts of such common domain ontology. This approach allows processes to be specified in an abstract high level way, unburdening the user from the underline details needed to effectively run the process workflow