Investigation of aspect ratio of hole drilling from micro to nanoscale via focused ion beam fine milling

Holes with different sizes from microscale to nanoscale were directly fabricated by focused ion beam (FIB) milling in this paper. Maximum aspect ratio of the fabricated holes can be 5:1 for the hole with large size with pure FIB milling, 10:1 for gas assistant etching, and 1:1 for the hole with size below 100 nm. A phenomenon of volume swell at the boundary of the hole was observed. The reason maybe due to the dose dependence of the effective sputter yield in low intensity Gaussian beam tail regions and redeposition. Different materials were used to investigate variation of the aspect ratio. The results show that for some special material, such as Ni-Be, the corresponding aspect ratio can reach 13.8:1 with Cl₂ assistant etching, but only 0.09:1 for Si(100) with single scan of the FIB.

Plasma polymerization of C[subscript 4]F[subscript 8] thin film on high aspect ratio silicon molds

High aspect ratio polymeric micro-patterns are ubiquitous in many fields ranging from sensors, actuators, optics, fluidics and medical. Second generation PDMS molds are replicated against first generation silicon molds created by deep reactive ion etching. In order to ensure successful demolding, the silicon molds are coated with a thin layer of C[subscript 4]F[subscript 8] plasma polymer to reduce the adhesion force. Peel force and demolding status are used to determine if delamination is successful. Response surface method is employed to provide insights on how changes in coil power, passivating time and gas flow conditions affect plasma polymerization of C[subscript 4]F[subscript 8].

Comparing correspondence analysis and the log-ratio alternative for representing categorical data

We compare correspondance análisis to the logratio approach based on compositional data. We also compare correspondance análisis and an alternative approach using Hellinger distance, for representing categorical data in a contingency table. We propose a coefficient which globally measures the similarity between these approaches. This coefficient can be decomposed into several components, one component for each principal dimension, indicating the contribution of the dimensions to the difference between the two representations. These three methods of representation can produce quite similar results. One illustrative example is given

alr approach for replacing values below the detection limit

All of the imputation techniques usually applied for replacing values below the detection limit in compositional data sets have adverse effects on the variability. In this work we propose a modification of the EM algorithm that is applied using the additive log-ratio transformation. This new strategy is applied to a compositional data set and the results are compared with the usual imputation techniques

A concurrent region growing algorithm guided by circumscribed contours

Image segmentation of natural scenes constitutes a major problem in machine vision. This paper presents a new proposal for the image segmentation problem which has been based on the integration of edge and region information. This approach begins by detecting the main contours of the scene which are later used to guide a concurrent set of growing processes. A previous analysis of the seed pixels permits adjustment of the homogeneity criterion to the region's characteristics during the growing process. Since the high variability of regions representing outdoor scenes makes the classical homogeneity criteria useless, a new homogeneity criterion based on clustering analysis and convex hull construction is proposed. Experimental results have proven the reliability of the proposed approach

Replicated nil associations of digit ratio (2D:4D) and absolute finger lengths with implicit and explicit measures of aggression. 'Replicaci??n de asociaciones nulas del ratio del segundo y cuarto dedo (2D:4D) y la longitud absoluta de los dedos con medidas de agresi??n impl??citas y expl??citas'

Resumen tomado de la publicaci??n

Proposal of a parallel architecture for a motion detection algorithm

This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed

Pose-based SLAM with probabilistic scan matching algorithm using a mechanical scanned imaging sonar

This paper proposes a pose-based algorithm to solve the full SLAM problem for an autonomous underwater vehicle (AUV), navigating in an unknown and possibly unstructured environment. The technique incorporate probabilistic scan matching with range scans gathered from a mechanical scanning imaging sonar (MSIS) and the robot dead-reckoning displacements estimated from a Doppler velocity log (DVL) and a motion reference unit (MRU). The proposed method utilizes two extended Kalman filters (EKF). The first, estimates the local path travelled by the robot while grabbing the scan as well as its uncertainty and provides position estimates for correcting the distortions that the vehicle motion produces in the acoustic images. The second is an augment state EKF that estimates and keeps the registered scans poses. The raw data from the sensors are processed and fused in-line. No priory structural information or initial pose are considered. The algorithm has been tested on an AUV guided along a 600 m path within a marina environment, showing the viability of the proposed approach

Fast calculation of the CAC convolution algorithm using the multinomial distribution function

The authors focus on one of the methods for connection acceptance control (CAC) in an ATM network: the convolution approach. With the aim of reducing the cost in terms of calculation and storage requirements, they propose the use of the multinomial distribution function. This permits direct computation of the associated probabilities of the instantaneous bandwidth requirements. This in turn makes possible a simple deconvolution process. Moreover, under certain conditions additional improvements may be achieved

An improved method for discovering link criticality in transport networks

Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network's resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio

A Label space reduction algorithm for P2MP LSPs using asymmetric tunnels

The aim of traffic engineering is to optimise network resource utilization. Although several works on minimizing network resource utilization have been published, few works have focused on LSR label space. This paper proposes an algorithm that uses MPLS label stack features in order to reduce the number of labels used in LSPs forwarding. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The algorithm described sets up the NHLFE tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the algorithm achieves a large reduction factor in the label space. The work presented here applies for both types of connections: P2MP and P2P

Speculative parallelization of multipath radiosity algorithm

In computer graphics, global illumination algorithms take into account not only the light that comes directly from the sources, but also the light interreflections. This kind of algorithms produce very realistic images, but at a high computational cost, especially when dealing with complex environments. Parallel computation has been successfully applied to such algorithms in order to make it possible to compute highly-realistic images in a reasonable time. We introduce here a speculation-based parallel solution for a global illumination algorithm in the context of radiosity, in which we have taken advantage of the hierarchical nature of such an algorithm

Partial disjoint path for multi-layer protection in GMPLS networks

In this paper, different recovery methods applied at different network layers and time scales are used in order to enhance the network reliability. Each layer deploys its own fault management methods. However, current recovery methods are applied to only a specific layer. New protection schemes, based on the proposed partial disjoint path algorithm, are defined in order to avoid protection duplications in a multi-layer scenario. The new protection schemes also encompass shared segment backup computation and shared risk link group identification. A complete set of experiments proves the efficiency of the proposed methods in relation with previous ones, in terms of resources used to protect the network, the failure recovery time and the request rejection ratio

Factores relacionados con el manejo quirúrgico de estrechez de la unión pieloureteral en niños

Objetivo: Describir los factores relacionados con la toma de decisión de manejo quirúrgico en pacientes con hidronefrosis secundaria a estrechez de la unión pieloureteral en el servicio de Urología Pediátrica de una institución de IV nivel. Materiales y Métodos: Se realizó un estudio descriptivo retrospectivo. Se seleccionaron por conveniencia a 100 pacientes con diagnóstico antenatal de hidronefrosis, 37 fueron llevados a manejo quirúrgico por estrechez de la unión pieloureteral (EUPU) entre los años 2009 y 2012. Se evaluaron los factores que llevaron a la toma| de esta decisión. Resultados: Los pacientes con diagnóstico postnatal de EUPU representaron el 37% de la población, la indicación de manejo quirúrgico en 13 pacientes (35,1%) fue dilatación caliceal (SFU 3), en 21 pacientes (56,8%) de deterioro de la función renal y en los restantes (8,1%) infección urinaria recurrente. Se encontró una progresión de 30% en la severidad de la dilatación en el periodo postnatal, habían 9 pacientes (24% de la muestra) SFU de 3 y 4 en el periodo prenatal y 20 (54%) en el periodo postnatal que fueron llevados a manejo quirúrgico. De los pacientes que disponíamos de datos precisos de valores de variación porcentual de gammagrafía 16% de la muestra, se encontró que había una variación del 50% en deterioro de la función renal. Conclusión: En el grupo de pacientes colombianos de la consulta externa del servicio de urología pediátrica estudiado se encontró que la decisión de manejo quirúrgico en pacientes con EUPU, está en concordancia con lo encontrado en la literatura mundial, siendo estos la presencia de dilatación caliceal deterioro de la función renal en gammagrafía DMSA.

salud financiera y riesgo en los estados financieros de la empresa avianca del sector aeronautico

La globalización y la competitividad como realidad de las empresas, implica que los gerentes preparen a sus empresas de la mejor manera para sobrevivir en este mundo tan inestable y cambiante. El primer paso consta de investigar y medir como se encuentra la empresa en cada uno de sus componentes, tales como recurso humano, mercadeo, logística, operación y por último y más importante las finanzas. El conocimiento de salud financiera y de los riesgos asociados a la actividad de las empresas, les permitirá a los gerentes tomar las decisiones correctas para ser rentables y perdurables en el mundo de los negocios inmerso en la globalización y competitividad. Esta apreciación es pertinente en Avianca S.A. esto teniendo en cuenta su progreso y evolución desde su primer vuelo el 5 de diciembre de 1919 comercial, hasta hoy cuando cotiza en la bolsa de Nueva York. Se realizó un análisis de tipo descriptivo, acompañado de la aplicación de ratios y nomenclaturas, dando lugar a establecer la salud financiera y los riesgos, no solo de Avianca sino también del sector aeronáutico. Como resultado se obtuvo que el sector aeronáutico sea financieramente saludable en el corto plazo, pero en el largo plazo su salud financiera se ve comprometida por los riegos asociados al sector y a la actividad desarrollada.