363 research outputs found
Quality and Reliability Engineering: Trends and Future Directions
No full textMishra, Alok/0000-0003-1275-2050; Khatri, Prof. Sunil Kumar/0000-0003-4373-9000[No Abstract Available]Science Citation Index Expande
A Review on Gas-Liquid Reactions in Light Oil Sweetening: Kinetics and Reactor Design Aspects
No full textModelling and Automatic Design and Control of Robot Systems using Collaborative Intelligent Systems
No full textThe application of hierarchical fuzzy logic system using genetic fuzzy rule generator architecture to robot navigation in presence of moving obstacles is considered. A hierarchical fuzzy logic system is proposed for collision avoidance and guidance of a robot systems. Simulation results and analysis are presented to show the effectiveness of the proposed method.</p
Review on Breast Cancer Disease Predictive Modelling using Swarm Intelligence
No full textBreast Cancer (BC) is one among the most critical diseases affecting women across the world mostly between the ages 35-55 and is growing every year in a capricious rate. By identifying the disease in its early stages, we can control the occurrence of BC. The manual approach used by radiologists has failed since they are similar in the appearance of micro-calcifications, and segmentation of breast images are complicated process. Hence there is a need of automated systems for detection of the disease in early-stage which helps to assist radiologists for diagnosing the disease in a precise manner and make necessary decisions for patients' treatment in the future. For classifying and predicting the disease, swarm intelligence (SI) plays a major role in terms of obtaining an optimal solution and reducing its training time. This paper presents study on review and analyses the performance of breast cancer disease predictive modelling using swarm intelligence. Also, it recommends the solution for forthcoming exertion to predict the location of the tumour in an efficient manner. </p
An Efficient Arithmetic Sum-of-Product (SOP) based Multiplication Approach for FIR Filters and DFT
No full textDiscrete Fourier Transform (DFT) and Finite Impulse Response (FIR) filters are extensively used in Digital Signal Processing (DSP) and Image Processing. As a result, there is a strong motivation to come up with area- and delay-efficient hardware realizations of DFT and FIR filters. In this thesis, we propose an arithmetic Sum-of-Product (SOP) based approach to implement area- and delay-efficient Discrete Fourier Transform (DFT) and FIR filter circuits. Our SOP based engine uses an improved column compression algorithm, and handles the sign of the input efficiently. The partial products of the computation are compressed down to 2 operands, which are then added using a single hybrid adder (which is comprised of a ripple carry adder for the early-arriving lower-order bits, a Kogge-Stone adder for the slower middle bits, and a carry-select adder for the early-arriving higher order bits).
The DFT and FIR filters can also be cast as instances of the Multiple Constant Multiplication (MCM) problem. RAG-n is one of the best known algorithms for realizing an MCM block with the minimum number of adders. We compare our SOP-based implementations with the RAG-n algorithm. We implement both approaches using a 45 nm cell library, and demonstrate that our approach yields a faster DFT circuit (by about 12-13%), with a small (about 5%) area penalty and a significantly better algorithmic runtime. We also demonstrate that our approach realizes FIR filters with hard-to-implement coefficients with a 4.4�� speedup and 1.38�� area penalty as compared to two recent adder cascade based approaches. For a set of symmetric and asymmetric filters, we compare the area-delay curves of the circuits generated by using our SOP based approach with that of the circuits generated by using a Common Sub-expression Elimination (CSE) based algorithm, which tries to minimize the number of adders utilized under a maximum adder cascade length constraint. We show that for a large range of delays, the circuits generated by using our approach have the smallest area.
Finally, we propose a new hybrid form realization for FIR filters. The hybrid form realization attempts to perform the computation using both the Direct and Transposed Direct form realization styles. We discuss conditions under which it would improve on both the Direct and Transposed Direct form realizations, in terms of circuit area and delay
A new balloon dissector for totally extraperitoeneal hernia repair
No full textBackground: Balloon dissectors (BD) find their use in totally extraperitoneal (TEP) and retroperitoneoscopic procedures. Commercial BD is prohibitively expensive. The author uses an indigenously assembled BD and describes the same. Material and Methods: The author assembles the BD by tying glove-fingers on an NG tube and then tying this assembly in the concavity of a Kelly′s clamp, premounted with peanut gauze (KC-BD). Results: The author has used it in the last 75 cases of TEP. A large working space is created, without any iatrogenic injuries or balloon rupture. This cheap indigenous BD can be assembled easily and in no time at all. Conclusions: KC-BD offers several advantages because of its unique design. It is effective, totally nontraumatic, inexpensive, and easy to assemble
Computational Intelligence for Risk Analysis in Software Testing
No full textSoftware testing is a complex, demanding, and crucial task required in any software development project Due to rapid changes in emerging technologies there is a need for constant improvement and adjustment to software testing management in software projects. There are a large number of processes involved in software testing. The interdependencies of the processes in software testing make this task a complex and difficult activity for software test managers. The complexity involved makes it difficult for software test managers to comprehend and by fully aware of effect of inefficiencies that may exist in software testing development of these processes in their organization. This paper considers the implementation of a Fuzzy Cognitive Maps (FCM) to provide facilities to capture and represent complex relationships in software testing to improve the understanding of software test manager about the software testing and its associated risks. By using a FCMs a test managers can regularly review and improve their software testing and provide greater improvement in development and monitoring in software testing. Software testing managers can perform what-if analysis to better understand vulnerabilities in their software testing management
Modelling and Adaptive Systems for Smart Cities
No full textThis paper considers the use of a multi-agent system for control of a multi traffic lights. The proposed model consists of a community of agents that autonomously act in cooperation with other agents using a set of fuzzy logic (FL) systems to control traffic at several intersections. Each agent system acts initially independently to control each traffic signal in an online real-time manner. Each agent adjusts traffic timing on each traffic signal. The effectiveness of the multi-agent system for controlling traffic signals is established through simulations. The multi-agent system used controls multi traffic signals. The results are promising, and they support the expandability of the model used using hierarchical fuzzy logic systems and multi-agent systems.</p
Techniques for the performance analysis of queueing networks
No full textETDs are only available to UIUC Users without author permissionU of I OnlyAnalyzing the performance of queueing networks that do not admit a product form solution is a challenging problem. In this thesis we present some tools for doing so. Our attention is restricted to Markovian queueing networks.We first present a technique for bounding the performance of such networks. Assuming a steady state for functionals of the state, we obtain linear programs which bound the performance. This technique is illustrated using quadratic functionals to bound the performance of a class of Markovian queueing networks called reentrant lines. We also show how this technique may be applied to bound throughput and blocking probabilities in networks with buffer capacity constraints. In some cases bounds obtained using multimedial functional of the state are shown to approach the exact value when the degree of the multimedial increases.We also study another important technique for the analysis of queueing networks, namely, the fluid limit approach. This approach is used to establish the stability of a class of policies called Fluctuation Smoothing policies for open reentrant lines. We also show how the fluid limit approach can be used to obtain the asymptotic performance of closed queueing networks in heavy traffic. We then use fluid limits to establish the efficiency of Fluctuation Smoothing policies for closed reentrant lines, as well as the Harrison-Wein policy for two station closed reentrant lines.Made available in DSpace on 2011-05-07T14:22:46Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9712342.pdf: 3631108 bytes, checksum: 5422ba3637cbb350f0300bee0e301aca (MD5)
Previous issue date: 1996Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T15:06:04Z
Item is restricted indefinitely.Restriction data tranferred 2014-07-01T11:31:42-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissio
Efficient uniformly convergent numerical methods for singularly perturbed parabolic reaction–diffusion systems with discontinuous source term
No full textFinanciación de acceso abierto proporcionada por los Fondos Europeos FEDER y la Junta de Castilla y León en el marco de la Estrategia de Investigación e Innovación para la Especialización Inteligente (RIS3) de Castilla y León 2021-2027[EN] This article is concerned with the construction and analysis of efficient uniformly convergent methods for a class of parabolic systems of coupled singularly perturbed reaction–diffusion problems with discontinuous source term. Due to the discontinuity in the source term, the solution to this problem exhibits interior layers along with boundary layers, which are overlapping and interacting in nature. To achieve an efficient numerical solution for the coupled system under consideration, at interior points (excluding the interface point) we employ a special finite difference scheme in time (where the components of the approximate solution are decoupled at each time level) and the central difference scheme in space; for mesh points on the interface, a special finite difference scheme decoupling the components of the approximate solution is developed. A rigorous error analysis is provided, establishing the method’s uniform convergence. In terms of computational cost, our numerical methods are more efficient than existing approaches for solving this class of problems. Finally, we provide numerical results to substantiate the theory and showcase the efficiency of our methods.The first author expresses gratitude to the Indian Institute of Technology (BHU) for
the assistance provided during the work tenure. Sunil Kumar extends thanks to the Science and Engineering
Research Board (SERB) for awarding the research support grant CRG/2023/003228 for this work
- …
