968 resultados para Behavior problem
Resumo:
Effect of aging on swelling and swell-shrink behavior of a compacted expansive soil is investigated in this paper. An expansive soil having a liquid limit of 100% is used for this purpose. Compacted specimens were prepared and aged for a predetermined number of days (7, 15, 30, and 90 days) to study their swelling and swell-shrink behavior. It has been shown that aging improves the resistance to compression of compacted specimens. The swelling potentials of specimens also decreased with aging. The dominant factors that influence the aging effects are the water content and degree of saturation at the beginning of the aging process. The changed behavior of aged specimens is attributed to particle rearrangements and formation of bonds, which affect the surface area absorbing water during swelling. The cyclic swell-shrink tests on aged specimens indicated that the differences in vertical displacement during the first swelling were eliminated in the subsequent cycles when specimens were shrunk more, but the aging effect was found to persist with cycles for specimens subjected to lower shrinkage magnitudes.
Resumo:
We study the statistical properties of spatially averaged global injected power fluctuations for Taylor-Couette flow of a wormlike micellar gel formed by surfactant cetyltrimethylammonium tosylate. At sufficiently high Weissenberg numbers the shear rate, and hence the injected power p(t), at a constant applied stress shows large irregular fluctuations in time. The nature of the probability distribution function (PDF) of p(t) and the power-law decay of its power spectrum are very similar to that observed in recent studies of elastic turbulence for polymer solutions. Remarkably, these non-Gaussian PDFs can be well described by a universal, large deviation functional form given by the generalized Gumbel distribution observed in the context of spatially averaged global measures in diverse classes of highly correlated systems. We show by in situ rheology and polarized light scattering experiments that in the elastic turbulent regime the flow is spatially smooth but random in time, in agreement with a recent hypothesis for elastic turbulence.
Resumo:
Part classification and coding is still considered as laborious and time-consuming exercise. Keeping in view, the crucial role, which it plays, in developing automated CAPP systems, the attempts have been made in this article to automate a few elements of this exercise using a shape analysis model. In this study, a 24-vector directional template is contemplated to represent the feature elements of the parts (candidate and prototype). Various transformation processes such as deformation, straightening, bypassing, insertion and deletion are embedded in the proposed simulated annealing (SA)-like hybrid algorithm to match the candidate part with their prototype. For a candidate part, searching its matching prototype from the information data is computationally expensive and requires large search space. However, the proposed SA-like hybrid algorithm for solving the part classification problem considerably minimizes the search space and ensures early convergence of the solution. The application of the proposed approach is illustrated by an example part. The proposed approach is applied for the classification of 100 candidate parts and their prototypes to demonstrate the effectiveness of the algorithm. (C) 2003 Elsevier Science Ltd. All rights reserved.
Effects of phase inhomogeneity and boundary conditions on the dynamic response of SMA wire actuators
Resumo:
This paper reports the simulation results from the dynamic analysis of a Shape Memory Alloy (SMA) actuator. The emphasis is on understanding the dynamic behavior under various loading rates and boundary conditions, resulting in complex scenarios such as thermal and stress gradients. Also, due to the polycrystalline nature of SMA wires, presence of microstructural inhomogeneity is inevitable. Probing the effect of inhomogeneity on the dynamic behavior can facilitate the prediction of life and characteristics of SMA wire actuator under varieties of boundary and loading conditions. To study the effect of these factors, an initial boundary value problem of SMA wire is formulated. This is subsequently solved using finite element method. The dynamic response of the SMA wire actuator is analyzed under mechanical loading and results are reported. Effect of loading rate, micro-structural inhomogeneity and thermal boundary conditions on the dynamic response of SMA wire actuator is investigated and the simulation results are reported.
Resumo:
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices and inflated response times. In this paper, we investigate mitigating this problem by replacing selectivity error-sensitive plan choices with alternative plans that provide robust performance. Our approach is based on the recent observation that even the complex and dense "plan diagrams" associated with industrial-strength optimizers can be efficiently reduced to "anorexic" equivalents featuring only a few plans, without materially impacting query processing quality. Extensive experimentation with a rich set of TPC-H and TPC-DS-based query templates in a variety of database environments indicate that plan diagram reduction typically retains plans that are substantially resistant to selectivity errors on the base relations. However, it can sometimes also be severely counter-productive, with the replacements performing much worse. We address this problem through a generalized mathematical characterization of plan cost behavior over the parameter space, which lends itself to efficient criteria of when it is safe to reduce. Our strategies are fully non-invasive and have been implemented in the Picasso optimizer visualization tool.
Resumo:
Swarm Intelligence techniques such as particle swarm optimization (PSO) are shown to be incompetent for an accurate estimation of global solutions in several engineering applications. This problem is more severe in case of inverse optimization problems where fitness calculations are computationally expensive. In this work, a novel strategy is introduced to alleviate this problem. The proposed inverse model based on modified particle swarm optimization algorithm is applied for a contaminant transport inverse model. The inverse models based on standard-PSO and proposed-PSO are validated to estimate the accuracy of the models. The proposed model is shown to be out performing the standard one in terms of accuracy in parameter estimation. The preliminary results obtained using the proposed model is presented in this work.
Resumo:
We investigate the spatial search problem on the two-dimensional square lattice, using the Dirac evolution operator discretized according to the staggered lattice fermion formalism. d=2 is the critical dimension for the spatial search problem, where infrared divergence of the evolution operator leads to logarithmic factors in the scaling behavior. As a result, the construction used in our accompanying article [ A. Patel and M. A. Rahaman Phys. Rev. A 82 032330 (2010)] provides an O(√NlnN) algorithm, which is not optimal. The scaling behavior can be improved to O(√NlnN) by cleverly controlling the massless Dirac evolution operator by an ancilla qubit, as proposed by Tulsi Phys. Rev. A 78 012310 (2008). We reinterpret the ancilla control as introduction of an effective mass at the marked vertex, and optimize the proportionality constants of the scaling behavior of the algorithm by numerically tuning the parameters.
Resumo:
Wireless networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem – the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node.In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels,where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information(CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a corresponding factored class of control policies corresponding to local cooperation between nodes with a local outage constraint. The resulting optimal scheme in this class can again be computed efficiently in a decentralized manner. We demonstrate significant energy savings for both slow and fast fading channels through numerical simulations of randomly distributed networks.
Resumo:
In this paper, we address a key problem faced by advertisers in sponsored search auctions on the web: how much to bid, given the bids of the other advertisers, so as to maximize individual payoffs? Assuming the generalized second price auction as the auction mechanism, we formulate this problem in the framework of an infinite horizon alternative-move game of advertiser bidding behavior. For a sponsored search auction involving two advertisers, we characterize all the pure strategy and mixed strategy Nash equilibria. We also prove that the bid prices will lead to a Nash equilibrium, if the advertisers follow a myopic best response bidding strategy. Following this, we investigate the bidding behavior of the advertisers if they use Q-learning. We discover empirically an interesting trend that the Q-values converge even if both the advertisers learn simultaneously.