Artificial intelligence applications in Permanent Magnet Brushless DC motor drives

Permanent Magnet Brushless DC (PMBLDC) machines are more popular due its simple structure and low cost. Improvements in permanent magnetic materials and power electronic devices have resulted in reliable, cost effective PMBLDC drives, for many applications. Advances in artificial intelligent applications like neural network, fuzzy logic, Genetic algorithm etc. have made tremendous impact on electric motor drives. The brushless DC motor is a multivariable and non-linear system. In conventional PMBLDC drives speed and position sensing of brushless DC motors require high degree of accuracy. Unfortunately, traditional methods of control require detailed modelling of all the motor parameters to achieve this. The Intelligent control techniques like, fuzzy logic control/Neural network control etc. uses heuristic input–output relations to deal with vague and complex situations. This paper presents a literature survey on the intelligent control techniques for PMBLDC motor drives. Various AI techniques for PMBLDC motor drives are described. Attempt is made to provide a guideline and quick reference for the researchers and practicing engineers those are working in the area of PMBLDC motor drives.     

Adaptive broadcast by fault-tolerant spanning tree switching

Adaptation is a desirable requirement in a distributed system as it helps the system to perform efficiently under different environments. For many problems, more than one protocol exists, such that one protocol performs better in one environment while the other performs better in another. In such cases, adaptive distributed systems can be designed by dynamically switching between the protocols as the environment changes. Distributed protocol switching is also important for performance enhancement, or fault-tolerance of a distributed system. In this work, we illustrate distributed protocol switching by providing a distributed algorithm for adaptive broadcast that dynamically switches from a BFS tree to a DFS tree. The proposed switching algorithm can also handle arbitrary crash failures. It ensures that switching eventually terminates in spite of failures and the desired tree (DFS tree) results as the output. We also investigate the properties that can be guaranteed on the delivery of broadcast messages under specific failure conditions. We show that under no failure, each broadcast message is eventually correctly delivered to all the nodes in spite of switching. Under arbitrary crash fault, we ensure that switching eventually terminates with the desired tree as the broadcast topology. We also investigate the specific delivery guarantees that can be provided when a single crash fault happens, both during switching and when no switching is in progress.     

Layered Approach Using Conditional Random Fields for Intrusion Detection

Intrusion detection faces a number of challenges; an intrusion detection system must reliably detect malicious activities in a network and must perform efficiently to cope with the large amount of network traffic. In this paper, we address these two issues of Accuracy and Efficiency using Conditional Random Fields and Layered Approach. We demonstrate that high attack detection accuracy can be achieved by using Conditional Random Fields and high efficiency by implementing the Layered Approach. Experimental results on the benchmark KDD '99 intrusion data set show that our proposed system based on Layered Conditional Random Fields outperforms other well-known methods such as the decision trees and the naive Bayes. The improvement in attack detection accuracy is very high, particularly, for the U2R attacks (34.8 percent improvement) and the R2L attacks (34.5 percent improvement). Statistical Tests also demonstrate higher confidence in detection accuracy for our method. Finally, we show that our system is robust and is able to handle noisy data without compromising performance.     

Effect of geometry on droplet formation in the squeezing regime in a microfluidic T-junction

In the surface tension-dominated microchannel T-junction, droplets can be formed as a result of the mixing of two dissimilar, immiscible fluids. This article presents results for very low Capillary numbers and different flow rates of the continuous and dispersed phases. Through three-dimensional lattice Boltzmann-based simulations, the mechanism of the formation of “plugs” in the squeezing regime has been examined and the size of the droplets quantified. Results for Re_\textc << 1 Re_{\text{c}} \ll 1 show the dependence of flow rates of the two fluids on the length of the droplets formed, which is compared with existing experimental data. It is shown that the size of plugs formed decreases as the Capillary number increases in the squeezing regime. This article clearly shows that the geometry effect, i.e., the widths of the two channels and the depth of the assembly, plays an important role in the determination of the length of the plugs, a fact that was ignored in earlier experimental correlations.     

Recovery of sensor embedded washing machines using a multi-kanban controlled disassembly line

Product recovery involves the recovery of materials and components from returned or end-of-life products. Disassembly, an element of product recovery, is the systematic separation of an assembly into its components, subassemblies or other groupings. Stricter environmental regulations together with dramatic decrease in natural resources and landfills have increased the importance of disassembly as all product recovery options require some level of disassembly. Due to changes made during the lifetime of a product by customers or service personnel, the number and the version of components prior to disassembly is unknown. Customers may also discriminate between and demand different versions of components. The existence of non-functional components further adds to the uncertainty associated with disassembly yield. Sensors implanted into products during their production can address this uncertainty by providing information on the number, condition and version of components prior to disassembly. In this study, we evaluate the impact of sensor embedded products (SEPs) on the various performance measures of a washing machine (WM) disassembly line controlled by a multi-kanban system, which takes into consideration the highly stochastic behavior of the line while managing material and kanban flows. First, separate design of experiments studies based on orthogonal arrays are performed for conventional products and SEPs. In order to observe the response of each experiment, detailed discrete event simulation (DES) models for both types of products are developed considering the precedence relationships among the components of a WM. Then, pair-wise t-tests are conducted to compare the two cases based on different performance measures. According to the results, SEPs provide significant reductions in all costs (viz., backorder, holding, disassembly, disposal, testing and transportation) while increasing revenue and profit.     

Examining knowledge contribution from the perspective of an online identity in blogging communities

Knowledge contribution is one of the essential factors behind the success of blogging communities (BCs). This research studies knowledge contribution behavior in a BC from the perspective of knowledge contributors and their characteristics using the lens of social identity theory. Social identity theory asserts that individuals are fundamentally motivated to present or communicate their identities in everyday social life through behavior. A similar line of reasoning can be used to argue that members of a BC would also be motivated to communicate their online identities through their behavior, that is, through knowledge contribution in the BC. Specifically, this study conceptualized the online identity and examined the effects of its personal (online kindness, online social skills, and online creativity) and social aspects (BC involvement) on knowledge contribution. The data was collected using an online survey from the members of Cyworld, a popular BC in South Korea and a few other countries (members from South Korea were included in this study). The results indicate that both the personal and social aspects of online identity and their interactions significantly influenced knowledge contribution. Based on the findings, this study offers suggestions to organizers of BCs to enhance the knowledge contribution from their members.     

Temperature dependent H2S and Cl2 sensing selectivity of Cr2O3 thin films

The conductometric gas sensing characteristics of Cr₂O₃ thin films - prepared by electron-beam deposition of Cr films on quartz substrate followed by oxygen annealing - have been investigated for a host of gases (CH₄, CO, NO₂, Cl₂, NH₃ and H₂S) as a function of operating temperature (between 30 and 300 °C) and gas concentration (1-30 ppm). We demonstrate that these films are highly selective to H₂S at an operating temperature of 100 °C, while at 220 °C the films become selective to Cl₂. This result has been explained on the basis of depletion of chemisorbed oxygen from the surface of films due to temperature and/or interaction with Cl₂/H₂S, which is supported experimentally by carrying out the work function measurements using Kelvin probe method. The temperature dependent selectivity of Cr₂O₃ thin films provides a flexibility to use same film for the sensing of Cl₂ as well as H₂S.     

Optimal testing resource allocation during module testing considering cost, testing effort and reliability

Software reliability is one of the most important quality attributes of commercial software. During software testing, software reliability growth models (SRGMs) are commonly used to describe the phenomenon of failure occurrence and/or fault removal which consequently enhancements software reliability. Large software systems are developed by integrating a number of relatively small and independent modules, which are tested independently during module testing phase. The amount of testing resource available is limited which is desired to be consumed judiciously so as to optimize the testing process. In this paper we formulate a resource allocation problem of minimizing the cost of software testing under available amount of testing resource, given a reliability constraint. We use a flexible SRGM considering testing effort which, depending upon the values of parameters, can describe either exponential or S-shaped failure pattern of software modules. A systematic and sequential Algorithm is proposed to solve the optimization problem formulated. Numerical examples are given to illustrate the formulation and solution procedures. Sensitivity analysis is performed to examine the behavior of some parameters of SRGM with most significant influence.     

Algorithms for generating multi-stage molding plans for articulated assemblies

Multi-stage molding is capable of producing better-quality articulated products at a lower cost. During the multi-stage molding process, assembly operations are performed along with the molding operations. Hence, it gives rise to a new type of planning problem. It is difficult to perform the planning manually because it involves evaluating large number of combinations and solving complex geometric reasoning problems. This paper investigates the problem of generating multi-stage molding plans for articulated assemblies. We present a planning framework that allows us to utilize constraints from experimentally proven molding plans. As a part of the planning problem, we determine the molding sequence and intermediate assembly configurations. We present algorithms for all the steps in the planning problem and characterize their computational complexities. Finally, we illustrate our approach with representative examples.     

Automated dynamic detection of busy–wait synchronizations

With the advent of multicores, multithreaded programming has acquired increased importance. In order to obtain good performance, the synchronization constructs in multithreaded programs need to be carefully implemented. These implementations can be broadly classified into two categories: busy–wait and schedule‐based. For shared memory architectures, busy–wait synchronizations are preferred over schedule‐based synchronizations because they can achieve lower wakeup latency, especially when the expected wait time is much shorter than the scheduling time. While busy–wait synchronizations can improve the performance of multithreaded programs running on multicore machines, they create a challenge in program debugging, especially in detecting and identifying the causes of data races. Although significant research has been done on data race detection, prior works rely on one important assumption—the debuggers are aware of all the synchronization operations performed during a program run. This assumption is a significant limitation as multithreaded programs, including the popular SPLASH‐2 benchmark have busy–wait synchronizations such as barriers and flag synchronizations implemented in the user code. We show that the lack of knowledge of these synchronization operations leads to unnecessary reporting of numerous races. To tackle this problem, we propose a dynamic technique for identifying user‐defined synchronizations that are performed during a program run. Both software and hardware implementations are presented. Furthermore, our technique can be easily exploited by a record/replay system to significantly speedup the replay. It can also be leveraged by a transactional memory system to effectively resolve a livelock situation. Our evaluation confirms that our synchronization detector is highly accurate with no false negatives and very few false positives. We further observe that the knowledge of synchronization operations results in 23% reduction in replay time. Finally, we show that using synchronization knowledge livelocks can be efficiently avoided during runtime monitoring of programs. Copyright © 2009 John Wiley & Sons, Ltd.