244 research outputs found
Fatigue crack growth behaviour of wire and arc additively manufactured ER70S-6 low carbon steel components
No full textThe new emerging Wire and Arc Additive Manufacturing (WAAM) technology has significant potential to improve material design and efficiency for structural components as well as reducing manufacturing costs. Due to repeated and periodic melting, solidification and reheating of the layers, the WAAM deposition technique results in some elastic, plastic and viscous deformations that can affect material degradation and crack propagation behaviour in additively manufactured components. Therefore, it is crucial to characterise the cracking behaviour in WAAM built components for structural design and integrity assessment purposes. In this work, fatigue crack growth tests have been conducted on compact tension specimens extracted from ER70S-6 steel WAAM built components. The crack propagation behaviour of the specimens extracted with different orientations (i.e. horizontal and vertical with respect to the deposition direction) has been characterised under two different cyclic load levels. The obtained fatigue crack growth rate data have been correlated with the linear elastic fracture mechanics parameter ΔK and the results are compared with the literature data available for corresponding wrought structural steels and the recommended fatigue crack growth trends in the BS7910 standard. The obtained results have been found to fall below the recommended trends in the BS7910 standard and above the data points obtained from S355 wrought material. The obtained fatigue growth trends and Paris law constants from this study contribute to the overall understanding of the design requirements for the new optimised functionally graded structures fabricated using the WAAM technique. © 2021, The Author(s)
Green synthesis and swelling behavior of Ag-nanocomposite semi-IPN hydrogels and their drug delivery using <i>Dolichos biflorus</i> Linn
No full text
Optimization based bandwidth allocation in mobile cellular networks
No full textEfficient bandwidth allocation strategy with simultaneous fulfillment of QoS requirement of a user in a mobile cellular network is still a critical and an important practical issue. We explore the problem of minimizing the amount of time for which bandwidth has to be allocated in a cell while meeting the QoS constraint. With the knowledge about the the arrival and residence time distribution of a user in a cell, the above problem can be optimally solved using a dynamic programming based approach in polynomial time. To be able to use the solution, we provide a mechanism for constructing the arrival/residence time distribution based on the measurement of hand-off events in a cell. The above solution allows us to propose an optimal time based bandwidth reservation and call admission scheme. By being scalable and distributed, the proposed scheme justifies for practical implementation. Simulations results are also presented to show the effectiveness of the scheme to achieve the target QoS level and optimal bandwidth utilization.Technical report DCS-TR-45
Optimizing queries for coarse grain parallelism
No full textWe consider the problem of optimizing select-project-join relational queries for minimum response time on parallel machines. The design of the optimizer is based on three ideas: (1) the concept and quantification of degree of coarse grain parallelism for an execution tree, (2) the design of a parallelizing scheduler for a tree of coarse grain operations which is provably near optimal, and (3) the analysis of the scheduling algorithm to obtain a cost formula for parallel execution time. The search algorithm of the optimizer is presented as a multi-dimensional dynamic programming algorithm. We present two three- dimensional search algorithms for the case when placement of relations in the parallel machine do not overlap. We propose the tree placement strategy and demonstrate, by means of examples, how the number of dimensions in the search can be significantly reduced, thereby increasing the efficiency of the search algorithm.Technical report lcsr-tr-21
Query optimization in mobile environments
No full textWe consider the issue of optimizing queries for distributed processing in mobile environment. An interesting characteristic of mobile machines is that they depend on battery as a source of energy which may not be substantial enough. Hence, the appropriate optimization criterion in a mobile environment considers both resource utilization and energy consum- ption at the mobile client.
In this scenario, the optimal plan for a query depends on the residual battery level of the mobile client and the load at the server. We approach this problem by compiling a query into a sequence of candidate plans, such that for any state of the client-server system, the optimal plan is one of the candidate plans.
A general solution is proposed by adapting the partial order dynamic programming search algorithm (p.o dp) such that the coverset of the query is the set of candidate plans. We propose two novel algorithms, namely, the linear combinations algorithm and the linearset algorithm (referred to as the linear algorithms) that compute the linearset of a query. The linear- set of a query is an approximation to the coverset returned by p.o. dp.
We show, by means of simulation, that (1) the linearset is an excellent approximation of the coverset, (2) query compilation using the linear algorithms outperform query compilation using p.o. dp by factors ranging from 2 to 9, (3) the time taken to compile queries using the linear algorithms for the general optimization criterion is at most twice the time taken by a System R* like standard query optimizer search algorithm, and (4) the run time overhead incurred by the linear algorithms technique is minimal.
The techniques presented in the paper are of general applicability to multi-criterion optimization problems in distributed databases, where each criterion is an additive metric.Technical report lcsr-tr-21
- …
