980 resultados para Minimum distance


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Guía práctica sobre lenguaje y alfabetización para profesores en formación (nivel bachillerato). Les permite identificar y desarrollar sus propias habilidades lingüísticas y de alfabetización y al mismo tiempo apoyar la evolución de los alumnos. Contiene todas las áreas claves de conocimiento, compresión y habilidades personales, además de analizar en un contexto amplio cómo el lenguaje y la alfabetización se adquieren y se desarrollan a nivel personal, social y cultural. El contenido está adaptado para la obtención de los certificados QTLS (Qualified Teacher, Learning and Skills) y ATLS (Associate Teacher, Learning and Skills).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Guía práctica sobre tecnologías de la información y la comunicación para profesores en formación (nivel bachillerato). Les permite identificar y desarrollar sus propias habilidades tecnológicas aplicadas a la enseñanza y al mismo tiempo apoyar la evolución de los alumnos. Contiene todas las áreas claves de conocimiento, compresión y habilidades personales, además de analizar en un contexto amplio cómo las habilidades tecnológicas en información y comunicación se adquieren y se desarrollan a nivel personal, social y cultural. El contenido está adaptado para la obtención de los certificados QTLS (Qualified Teacher, Learning and Skills) y ATLS (Associate Teacher, Learning and Skills).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Resumen tomado de la publicación. Con el apoyo económico del departamento MIDE de la UNED. Incluye anexos

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Resumen basado en el de la publicaci??n

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present algorithms for computing approximate distance functions and shortest paths from a generalized source (point, segment, polygonal chain or polygonal region) on a weighted non-convex polyhedral surface in which obstacles (represented by polygonal chains or polygons) are allowed. We also describe an algorithm for discretizing, by using graphics hardware capabilities, distance functions. Finally, we present algorithms for computing discrete k-order Voronoi diagrams

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An overview is given on a study which showed that not only in chemical reactions but also in the favorable case of nontotally symmetric vibrations where the chemical and external potentials keep approximately constant, the generalized maximum hardness principle (GMHP) and generalized minimum polarizability principle (GMPP) may not be obeyed. A method that allows an accurate determination of the nontotally symmetric molecular distortions with more marked GMPP or anti-GMPP character through diagonalization of the polarizability Hessian matrix is introduced

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The characteristics of service independence and flexibility of ATM networks make the control problems of such networks very critical. One of the main challenges in ATM networks is to design traffic control mechanisms that enable both economically efficient use of the network resources and desired quality of service to higher layer applications. Window flow control mechanisms of traditional packet switched networks are not well suited to real time services, at the speeds envisaged for the future networks. In this work, the utilisation of the Probability of Congestion (PC) as a bandwidth decision parameter is presented. The validity of PC utilisation is compared with QOS parameters in buffer-less environments when only the cell loss ratio (CLR) parameter is relevant. The convolution algorithm is a good solution for CAC in ATM networks with small buffers. If the source characteristics are known, the actual CLR can be very well estimated. Furthermore, this estimation is always conservative, allowing the retention of the network performance guarantees. Several experiments have been carried out and investigated to explain the deviation between the proposed method and the simulation. Time parameters for burst length and different buffer sizes have been considered. Experiments to confine the limits of the burst length with respect to the buffer size conclude that a minimum buffer size is necessary to achieve adequate cell contention. Note that propagation delay is a no dismiss limit for long distance and interactive communications, then small buffer must be used in order to minimise delay. Under previous premises, the convolution approach is the most accurate method used in bandwidth allocation. This method gives enough accuracy in both homogeneous and heterogeneous networks. But, the convolution approach has a considerable computation cost and a high number of accumulated calculations. To overcome this drawbacks, a new method of evaluation is analysed: the Enhanced Convolution Approach (ECA). In ECA, traffic is grouped in classes of identical parameters. By using the multinomial distribution function instead of the formula-based convolution, a partial state corresponding to each class of traffic is obtained. Finally, the global state probabilities are evaluated by multi-convolution of the partial results. This method avoids accumulated calculations and saves storage requirements, specially in complex scenarios. Sorting is the dominant factor for the formula-based convolution, whereas cost evaluation is the dominant factor for the enhanced convolution. A set of cut-off mechanisms are introduced to reduce the complexity of the ECA evaluation. The ECA also computes the CLR for each j-class of traffic (CLRj), an expression for the CLRj evaluation is also presented. We can conclude that by combining the ECA method with cut-off mechanisms, utilisation of ECA in real-time CAC environments as a single level scheme is always possible.

Relevância:

20.00% 20.00%

Publicador: