No abstract

Most of the engineering products are made with multiple components. The products with multiple subassemblies offer greater flexibility for parallel assembly operation and also disassembly operation during its end of life. Assembly cost and time can be minimized by reducing the number of assembly levels. In this paper, Elephant search algorithm is used to perform Optimal Assembly Sequence Planning (OASP) in order to minimize the number of assembly levels. Subassembly identification technique is used as an integral part of algorithm to identify the parallel assembly possibilities. The proposed method is implemented on industrial products and a detailed comparative assessment has been made with suitable product illustrations to corroborate the efficiency.

Abstract. This paper presents a new unified algorithm for cluster assignment and region scheduling, and its integration into an experimental retargetable code generation framework. The components of the framework are an instruction selector generator based on a recent technique, the IMPACT front end, a machine description module which uses a modification of the HMDES machine description language to include cluster information, a combined cluster allocator and an acyclic region scheduler, and a register allocator. Experiments have been carried out on the targeting of the tool to the Texas Instruments TMS320c62x architecture. We report preliminary results on a set of TI benchmarks.

No abstract

No abstract

No abstract

Abstract. Counter systems are a well-known and powerful modeling notation for specifying infinite-state systems. In this paper we target the problem of checking liveness properties in counter systems. We propose two semi decision techniques towards this, both of which return a formula that encodes the set of reachable states of the system that satisfy a given liveness property. A novel aspect of our techniques is that they use reachability analysis techniques, which are well studied in the literature, as black boxes, and are hence able to compute precise answers on a much wider class of systems than previous approaches for the same problem. Secondly, they compute their results by iterative expansion or contraction, and hence permit an approximate solution to be obtained at any point. We state the formal properties of our techniques, and also provide experimental results using standard benchmarks to show the usefulness of our approaches. Finally, we sketch an extension of our liveness checking approach to check general CTL properties.

Cyber security is most widely seen in many domains. From various domains these attacks plays the major role in damaging the servers and making websites unavailable. Many challenges are facing with the various cyber attacks.Internet of Things (IoT) is most widely used to define as a pervasive network of a (broad) range of connected smart nodes that offer diverse digital services, including the collection of environmental and user data. Detection of cyber attacks is difficult task and this may cause the loss of data packets and may interrupt the server. In this paper, the Enhancement is developed to handle the attack packets effectively. This is the window based application i,e based on the window size the data is processed. The Enhancement is called as an Amplified and Forward for Bi- Directional traffic from Attacks. This is very significant model to detect the several types of attacks that occur in IoT. Results show the performance of proposed system.