Group technology based adaptive cell formation using predator-prey genetic algorithm

In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predator-prey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future.     

Multivariability speaker recognition database in Indian scenario

In this paper we describe the collection and organization of the speaker recognition database in Indian scenario named as IITG Multivariability Speaker Recognition Database. The database contains speech from 451 speakers speaking English and other Indian languages both in conversational and read speech styles recorded using various sensors in parallel under different environmental conditions. The database is organized into four phases on the basis of different conditions employed for the recording. The results of the initial studies conducted on a speaker verification system exploring the impact of mismatch in training and test conditions using the collected data are also included. A copy of this database can be obtained from the authors by contacting them.     

A systematic mapping of semi-formal and formal methods in requirements engineering of industrial Cyber-Physical systems

Journal of Intelligent Manufacturing - The requirements engineering of Industrial Cyber-Physical Systems is extremely challenging due to large system sizes, component heterogeneity, involvement of...     

Verification of evolving software via component substitutability analysis

This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniques for checking correctness of software upgrades: (1) a technique based on simultaneous use of over-and under-approximations obtained via existential and universal abstractions; (2) a dynamic assume-guarantee reasoning algorithm—previously generated component assumptions are reused and altered on-the-fly to prove or disprove the global safety properties on the updated system. When upgrades are found to be non-substitutable, our solution generates constructive feedback to developers showing how to improve the components. The substitutability approach has been implemented and validated in the ComFoRT reasoning framework, and we report encouraging results on an industrial benchmark. This is an extended version of a paper, Dynamic Component Substitutability Analysis, published in the Proceedings of the Formal Methods 2005 Conference, Lecture Notes in Computer Science, vol. 3582, by the same authors. This research was sponsored by the National Science Foundation under grant nos. CNS-0411152, CCF-0429120, CCR-0121547, and CCR-0098072, the Semiconductor Research Corporation under grant no. TJ-1366, the US Army Research Office under grant no. DAAD19-01-1-0485, the Office of Naval Research under grant no. N00014-01-1-0796, the ICAST project and the Predictable Assembly from Certifiable Components (PACC) initiative at the Software Engineering Institute, Carnegie Mellon University. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of any sponsoring institution, the US government or any other entity.     

Limits of compensation in a failed antenna array

In large antenna arrays, the possibility of occurrence of faults in some of the radiating elements cannot be precluded at all times. In such situations, the radiation pattern of the array gets distorted, mostly with an increase in sidelobe level and decrease in gain. Although it is not possible to restore the pattern fully by rearranging the excitations of the functioning elements, compensation methods have been reported in the literature for restoring one performance parameter of the array and making a trade‐off on some other parameter. In this article, we have made a study on the tolerance level of this compensation process. One part of the study deals with the thinning in the failed array, that is, to find a limit on the minimum number of functioning elements of the array that can restore the digital beamforming of the failed array. The second part of study deals with finding the maximum number of element failures that can be compensated. The study was carried out by optimizing the amplitude excitations of the failed array. Instead of classical optimization techniques, particle swarm optimization was used for the compensation process. © 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 24:635–645, 2014.     

Detailed Real-Time Urban 3D Reconstruction from Video

The paper presents a system for automatic, geo-registered, real-time 3D reconstruction from video of urban scenes. The system collects video streams, as well as GPS and inertia measurements in order to place the reconstructed models in geo-registered coordinates. It is designed using current state of the art real-time modules for all processing steps. It employs commodity graphics hardware and standard CPU’s to achieve real-time performance. We present the main considerations in designing the system and the steps of the processing pipeline. Our system extends existing algorithms to meet the robustness and variability necessary to operate out of the lab. To account for the large dynamic range of outdoor videos the processing pipeline estimates global camera gain changes in the feature tracking stage and efficiently compensates for these in stereo estimation without impacting the real-time performance. The required accuracy for many applications is achieved with a two-step stereo reconstruction process exploiting the redundancy across frames. We show results on real video sequences comprising hundreds of thousands of frames.     

An Integrated Approach to Designing and Evaluating Collaborative Applications and Infrastructures

Collaborative systems include both general infrastructures and specific applications for supporting collaboration. Because of the relative newness and complexity of these systems, it has been unclear what approach should be used to design and evaluate them. Based on the lessons learned from our work and that of others on collaborative systems, we have derived an integrated approach to researching collaborative applications and infrastructures. The approach can be described as a sequence of steps: We decompose the functionality of collaboration systems into smaller functions that can be researched more-or-less independently. For each of these functions, we adopt general (system-independent) principles regarding the design and implementation of the function, identify collaboration scenarios at multiple levels of abstraction, identify requirements based on the scenarios, adopt an interaction model to meet the requirements, realize the interaction model as a concrete user interface, develop a logical architecture of the system, identify a physical architecture for placing the logical components in a distributed system, develop infrastructure abstractions, use the abstractions to implement applications, and perform lab studies, field experiments, and simulations to evaluate the infrastructure and applications. As in other models with multiple phases, feedback from subsequent phases is used to modify the results from the previous phases. In this paper, we describe, illustrate and motivate this research plan.     

Feature tracking and matching in video using programmable graphics hardware

This paper describes novel implementations of the KLT feature tracking and SIFT feature extraction algorithms that run on the graphics processing unit (GPU) and is suitable for video analysis in real-time vision systems. While significant acceleration over standard CPU implementations is obtained by exploiting parallelism provided by modern programmable graphics hardware, the CPU is freed up to run other computations in parallel. Our GPU-based KLT implementation tracks about a thousand features in real-time at 30 Hz on 1,024 × 768 resolution video which is a 20 times improvement over the CPU. The GPU-based SIFT implementation extracts about 800 features from 640 × 480 video at 10 Hz which is approximately 10 times faster than an optimized CPU implementation.