Experimental evaluation of machinability performance of CNT coated HSS tool during turning of titanium alloy

Journal of Mechanical Science and Technology - The present research deals with the deposition of carbon nanotubes (CNT) over the HSS tool, and to evaluate the machining performance of the coated...     

Negation as Failure as Resolution

Providing a clean procedural semantics of the Negation As Failure rule in Logic Programming has been an open problem for some time now. This rule has been treated as a technique in nonmonotonic reasoning, not as a rule in classical logic. This paper contains a demonstration of the negation as failure rule as a resolution procedure in first-order logic. We present a sound and complete resolution scheme for negation as failure rule for the larger class of constraint logic programs. The approach is to consider a canonical partition of the completion of a definite (constraint) program into the IF and the FI programs. We show that a negated goal, provable from the completed definite program is provable from just the FI part. The clauses in this program have a structure dual to that of definite Horn clauses. We describe a sound and complete linear resolution rule for this fragment, and show that a resolution proof of the negated goal from the FI part corresponds to a finite failure tree resulting from classical linear resolution applied to the goal on the If part of the original definite program. Our work shows that negation as failure rule can be computationally efficient in the sense that the SLD-resolution on the If part of a definite program along with the negation as failure rule is more efficient than a direct resolution procedure on the completion of that program.     

Predicting the position of adjacent nodes with QoS in mobile ad hoc networks

The Mobile Ad Hoc Networks are a self-regulatory set of autonomous nodes which perform communication to all the other nodes within their communication ranges. The nodes which are not in straightforward range make use of in between nodes to perform communication with one another. In mobile ad hoc network, each and every autonomous node holds displacements and shifts based on the precise positions within the network. Hence the verification of node position is crucial in mobile ad hoc networks and it is mainly a great dispute during the existence of opponents focusing on damaging the system. The intention is to design a standard termed as Adjacent Node Location Confirmation (ANLC) for confirming the location of its transmitting adjacent nodes for interchanging the messages and confirms the location of the nodes in transmission within the network. Initially, the method focuses on finding the nodes based on which the transmission connection is set up or it is within the fixed distance. The distance is estimated based on message interchanges among the confirmer and its adjacent nodes in transmission. Soon after the estimation of distances the confirmer authenticates the location of nodes in transmission within the network based on straight balanced, traverse balanced and multi-lateration analysis. The analysis is performed based on QoS of the transmitting node choice for minimizing the delays and acquiring improved throughput. The performance of the designed scheme is estimated based on network throughput and delays.

     

Volume modelling for emerging manufacturing technologies

The next generation manufacturing technologies will draw on new developments in geometric modelling. Based on a comprehensive analysis of the desiderata of next generation geometric modellers, we present a critical review of the major modelling paradigms, namely, CSG, B-Rep, non-manifold, and voxel models. We present arguments to support the view that voxel-based modellers have attributes that make it the representation scheme of choice in meeting the emerging requirements of geometric modelling.     

PERCE's GRIPES: A robot grasp planner

PERCE's GRIPES (Purdue Engineering Research Center's Grip Evaluation System) is an offline robot grasp planner for three-fingered grippers. The planner is based on a generate and test paradigm. Candidate triples of faces (or grasp configurations) are generated using heuristics. The precise coordinates of grip points are selected for each configuration by numerical solution of optimization problems. The constraints imposed by stability considerations are built into the optimization formulations. The accessibility of each candidate grasp is checked based on swept volume computation. Other criteria are used to rank the feasible grasps. This paper describes the modular design and the implementation of PERCE's GRIPES.     

Heuristic algorithms for scheduling heat-treatment furnaces of steel casting industries

This paper addresses a research problem of scheduling parallel, non-identical batch processors in the presence of dynamic job arrivals, incompatible job-families and non-identical job sizes. We were led to this problem through a real-world application involving the scheduling of heat-treatment operations of steel casting. The scheduling of furnaces for heat-treatment of castings is of considerable interest as a large proportion of the total production time is the processing times of these operations. In view of the computational intractability of this type of problem, a few heuristic algorithms have been designed for maximizing the utilization of heat-treatment furnaces of steel casting manufacturing. Extensive computational experiments were carried out to compare the performance of the heuristics with the estimated optimal value (using the Weibull technique) and for relative effectiveness among the heuristics. Further, the computational experiments show that the heuristic algorithms proposed in this paper are capable of obtaining near (statistically estimated) optimal utilization of heat-treatment furnaces and are also capable of solving any large size real-life problems with a relatively low computational effort.     

Adjacent Node based Energetic Association Factor Routing Protocol in Wireless Sensor Networks

Mobile Ad-Hoc Network (MANET) consist a numerous nodes and these nodes are structured with remote transceivers. These nodes forward the message with one another by getting to the typical channel. In MANET, security is the principle challenge to be analyzed. Due to the behaviour of malevolent nodes, the network security is weakened. Along these lines, the significant goal of this research is to enhance the network security by detecting the malevolent nodes. So, for the detection of malevolent node, an effective trust management method is presented in this paper. Improving the trust score the optimized fuzzy framework is proposed. For enhancing the execution of the fuzzy framework, the triangular membership function of the input parameters is improved with the Cat Swarm Optimization. After estimating the trust score for every node in the network, threshold depend decision module is processed for detecting the activity of malevolent nodes. Implementation results illustrate that the execution of the proposed model achieves maximum network lifetime and minimum energy consumption.