140 resultados para Optimum-path forests
Resumo:
This study examines the effect of electric field on energy absorption capacity of carbon nanotube forests (CNTFs), comprising of vertically aligned multiwalled carbon nanotubes, under both quasistatic (strain rate, (epsilon) over dot = 10(-3) s(-1)) and dynamic ((epsilon) over dot = similar to 10(3) s(-1)) loading conditions. Under quasistatic condition, the CNTFs were cyclically loaded and unloaded while electric field was applied along the length of carbon nanotube (CNT) either throughout the loading cycle or explicitly during either the loading or the unloading segment. The energy absorbed per cycle by CNTF increased monotonically with electric field when the field was applied only during the loading segment: A 7 fold increase in the energy absorption capacity was registered at an electric field of 1 kV/m whereas no significant change in it was noted for other schemes of electro-mechanical loading. The energy absorption capacity of CNTF under dynamic loading condition also increased monotonically with electric field; however, relative to the quasistatic condition, less pronounced effect was observed. This intriguing strain rate dependent effect of electric field on energy absorption capacity of CNTF is explained in terms of electric field induced strengthening of CNTF, originating from the time dependent electric field induced polarization of CNT. (C) 2015 Elsevier Ltd. All rights reserved.
Resumo:
The present study deals with the diffusion and phase transition behaviour of paraffin reinforced with carbon nano-additives namely graphene oxide (GO) and surface functionalized single walled carbon nanotubes (SWCNT). Bulk disordered systems of paraffin hydrocarbons impregnated with carbon nano-additives have been generated in realistic equilibrium conformations for potential application as latent heat storage systems. Ab initio molecular dynamics(MD) in conjugation with COMPASS forcefield has been implemented using periodic boundary conditions. The proposed scheme allows determination of optimum nano-additive loading for improving thermo-physical properties through analysis of mass, thermal and transport properties; and assists in determination of composite behaviour and related performance from microscopic point of view. It was observed that nanocomposites containing 7.8% surface functionalised SWCNT and 55% GO loading corresponds to best latent heat storage system. The propounded methodology could serve as a by-pass route for economically taxing and iterative experimental procedures required to attain the optimum composition for best performance. The results also hint at the large unexplored potential of ab-initio classical MD techniques for predicting performance of new nanocomposites for potential phase change material applications. (C) 2015 Author(s).
Resumo:
A ray tracing based path length calculation is investigated for polarized light transport in a pixel space. Tomographic imaging using polarized light transport is promising for applications in optical projection tomography of small animal imaging and turbid media with low scattering. Polarized light transport through a medium can have complex effects due to interactions such as optical rotation of linearly polarized light, birefringence, diattenuation and interior refraction. Here we investigate the effects of refraction of polarized light in a non-scattering medium. This step is used to obtain the initial absorption estimate. This estimate can be used as prior in Monte Carlo (MC) program that simulates the transport of polarized light through a scattering medium to assist in faster convergence of the final estimate. The reflectance for p-polarized (parallel) and s-polarized (perpendicular) are different and hence there is a difference in the intensities that reach the detector end. The algorithm computes the length of the ray in each pixel along the refracted path and this is used to build the weight matrix. This weight matrix with corrected ray path length and the resultant intensity reaching the detector for each ray is used in the algebraic reconstruction (ART) method. The proposed method is tested with numerical phantoms for various noise levels. The refraction errors due to regions of different refractive index are discussed, the difference in intensities with polarization is considered. The improvements in reconstruction using the correction so applied is presented. This is achieved by tracking the path of the ray as well as the intensity of the ray as it traverses through the medium.
Resumo:
The problem of continuous curvature path planning for passages is considered. This problem arises when an autonomous vehicle traverses between prescribed boundaries such as corridors, tunnels, channels, etc. Passage boundaries with curvature and heading discontinuities pose challenges for generating smooth paths passing through them. Continuous curvature half-S shaped paths derived from the Four Parameter Logistic Curve family are proposed as a prospective path planning solution. Analytic conditions are derived for generating continuous curvature paths confined within the passage boundaries. Zero end curvature highlights the scalability of the proposed solution and its compatibility with other path planners in terms of larger path planning domains. Various scenarios with curvature and heading discontinuities are considered presenting viability of the proposed solution.
Resumo:
We consider a Social Group' of networked nodes, seeking a universe' of segments. Each node has a subset of the universe and access to an expensive resource for downloading data. Nodes can also acquire the universe by exchanging copies of segments among themselves, at low cost, using inter-node links. While exchanges over inter-node links ensure minimum cost, some nodes in the group try to exploit the system. We term such nodes as non-reciprocating nodes' and prohibit such behavior by proposing the give-and-take' criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the problem of maximizing the number of nodes with the universe at the end of local exchanges. First, we present a randomized algorithm that is shown to be optimal in the asymptotic regime. Then, we present greedy links algorithm, which performs well for most of the scenarios and yields an optimal result when the number of nodes is four. The polygon algorithm is proposed, which yields an optimal result when each of the nodes has a unique segment. After presenting some intuitive algorithms (e.g., greedy incremental algorithm and rarest first algorithm), we compare the performances of all proposed algorithms with the optimal. Copyright (c) 2015 John Wiley & Sons, Ltd.