Condition Monitoring Parameters for Fault Diagnosis of Fixed Axis Gearbox: A Review

Condition monitoring of gearboxes which is considered as a key element of rotating machines ensures to continuously reduce and eliminate cost, unscheduled downtime and unexpected breakdowns. Although, a lot of work on condition monitoring and fault diagnosis of fixed-axis gearbox has been reported in the literature, however only a few have found their way to industrial applications. The ability of condition statistical indicators is to provide accurate and precise information about the health of various components at different levels of damage. In this paper, frequently used condition indicators are addressed domain-wise and their characteristics are stated. This paper presents the review of work to provide a wide and good reference for researchers to be utilized. The structure of a fixed-axis gearbox in addition to the unique behaviors and fault characteristics of fixed-axis gearbox has been recognized and represented. By extensively reviewing and categorizing important papers and articles, this paper is able to summarize the conditional monitoring indicators on basis of adopted methodologies. Lastly, open problems are stated and further research prospects pointed out.     

An improved timestamp-based remote user authentication scheme

To protect the remote server from various malicious attacks, many authentication schemes have been proposed. Some schemes have to maintain a password verification table in the remote server for checking the legitimacy of the login users. To overcome potential risks of verification tables, researchers proposed remote user authentication schemes using smartcard, in which the remote server only keeps a secret key for computing the user’s passwords and does not need any verification table for verifying legal user. In 2003 Shen, Lin, and Hwang proposed a timestamp-based password authentication scheme using smartcards in which the remote server does not need to store the passwords or verification table for user authentication. Unfortunately, this scheme is vulnerable to some deadly attacks. In this paper, we analyze few attacks and finally propose an improved timestamp-based remote user authentication scheme. The modified scheme is more efficient and secure than original scheme.     

Dynamic vs. Oblivious Routing in Network Design

Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impact of different routing models in this robust setting: in particular, we compare oblivious routing, where the routing between each terminal pair must be fixed in advance, to dynamic routing, where routings may depend arbitrarily on the current demand. Our main result is a construction that shows that the optimal cost of such a network based on oblivious routing (fractional or integral) may be a factor of Ω(log n) more than the cost required when using dynamic routing. This is true even in the important special case of the asymmetric hose model. This answers a question in (Chekuri, SIGACT News 38(3):106–128, 2007), and is tight up to constant factors. Our proof technique builds on a connection between expander graphs and robust design for single-sink traffic patterns (Chekuri et al., Networks 50(1):50–54, 2007).     

OBSERVER: An Approach for Query Processing in Global Information Systems Based on Interoperation Across Pre-Existing Ontologies

There has been an explosion in the types, availability and volume of data accessible in an information system, thanks to the World Wide Web (the Web) and related inter-networking technologies. In this environment, there is a critical need to replace or complement earlier database integration approaches and current browsing and keyword-based techniques with concept-based approaches. Ontologies are increasingly becoming accepted as an important part of any concept or semantics based solution, and there is increasing realization that any viable solution will need to support multiple ontologies that may be independently developed and managed. In particular, we consider the use of concepts from pre-existing real world domain ontologies for describing the content of the underlying data repositories. The most challenging issue in this approach is that of vocabulary sharing, which involves dealing with the use of different terms or concepts to describe similar information. In this paper, we describe the architecture, design and implementation of the OBSERVER system. Brokering across the domain ontologies is enabled by representing and utilizing interontology relationships such as (but not limited to) synonyms, hyponyms and hypernyms across terms in different ontologies. User queries are rewritten by using these relationships to obtain translations across ontologies. Well established metrics like precision and recall based on the extensions underlying the concepts are used to estimate the loss of information, if any.     

Design of fructose-2,6-bisphosphatase inhibitors: a novel virtual screening approach

Fructose-2,6-bisphosphatase (FBPase-2) is a switch between gluconeogenesis and glycolysis in the hepatic cells. The structural features required for inhibitory activity of FBPase-2 were unidentified; no leads are available for inhibiting this important enzyme. In this paper pharmacophore mapping, molecular docking methods were employed in a virtual screening strategy to identify leads for FBPase-2. A receptor based pharmacophore map was modeled which comprised of important interactions as observed in co-crystal of rat liver isozyme with the product inhibitor fructose-6-phosphate. The pharmacophore model was validated against two databases of best docked structural analogues of fructose-2,6-bisphosphate and fructose-6-phosphate. The query generated was submitted for flexible search of ligands in chemical databases, namely LeadQuest, Maybridge and NCI. The hits obtained were further screened by molecular docking using FlexX.     

Effect of impurities (graphite) on the high-temperature creep properties of NiAl

Previous high-temperature compression creep studies of NiAl have shown peculiar behaviour in the temperature range 700 to 900° C, which was perhaps due to precipitation of impurities in the matrix. To isolate the impurity effect, high-purity NiAl samples with 0.15 at% and 0.20 at% carbon (graphite) additions have been creep tested at four temperatures between 700 and 850° C. Addition of graphite has been shown to produce a significant reduction in the creep strength of the alloyS. However, alloys with higher graphite concentrations have shown better creep resistance than those with lower graphite concentrations. Transmission electron microscopy indicates the presence of competing softening and hardening mechanisms in the alloys. Softening is due to the graphite particles acting as a dislocation source. Hardening results from a grain-boundary hardening mechanism due to the graphite particles segregating at grain boundaries and a dislocation-impurity (fine graphite) interaction, developing a Cottrell-like atmosphere.     

Exact fuzzy optimal solution of fully fuzzy linear programming problems with unrestricted fuzzy variables

Kumar et al. (Appl. Math. Model. 35:817?C823, 2011) pointed out that there is no method in literature to find the exact fuzzy optimal solution of fully fuzzy linear programming (FFLP) problems and proposed a new method to find the fuzzy optimal solution of FFLP problems with equality constraints having non-negative fuzzy variables and unrestricted fuzzy coefficients. There may exist several FFLP problems with equality constraints in which no restriction can be applied on all or some of the fuzzy variables but due to the limitation of the existing method these types of problems can not be solved by using the existing method. In this paper a new method is proposed to find the exact fuzzy optimal solution of FFLP problems with equality constraints having non-negative fuzzy coefficients and unrestricted fuzzy variables. The proposed method can also be used to solve the FFLP problems with equality constraints having non-negative fuzzy variables and unrestricted fuzzy coefficients. To show the advantage of the proposed method over existing method the results of some FFLP problems with equality constraints, obtained by using the existing and proposed method, are compared. Also, to show the application of proposed method a real life problem is solved by using the proposed method.     

Towards locally and globally shape-aware reverse 3D modeling

The process of re-creating CAD models from actual physical parts, formally known as digital shape reconstruction (DSR) is an integral part of product development, especially in re-design. While, the majority of current methods used in DSR are surface-based, our overarching goal is to obtain direct parameterization of 3D meshes, by avoiding the actual segmentation of the mesh into different surfaces. As a first step towards reverse modeling physical parts, we extract (1) locally prominent cross-sections (PCS) from triangular meshes, and (2) organize and cluster them into sweep components, which form the basic building blocks of the re-created CAD model. In this paper, we introduce two new algorithms derived from Locally Linear Embedding (LLE) (Roweis and Sauk, 2000 [3]) and Affinity Propagation (AP) (Frey and Dueck, 2007 [4]) for organizing and clustering PCS. The LLE algorithm analyzes the cross-sections (PCS) using their geometric properties to build a global manifold in an embedded space. The AP algorithm, then clusters the local cross sections by propagating affinities among them in the embedded space to form different sweep components. We demonstrate the robustness and efficiency of the algorithms through many examples including actual laser-scanned (point cloud) mechanical parts.     

崛起的印度钢铁业

一、印度钢铁工业发展历史和现状从远古时代开始,铁在人类的生活中就非常重要。无论是战争还是和平年代,钢铁对现代文明的发展是必不可少的。为了了解印度的钢铁工业,首先有必要简要地回顾一下印度的钢铁制造史。印度是一个古老的国度,文化遗产丰富。印度是一片不同地域间存在惊人差异的土地,而两百多年的殖民统治更造就了多样化的印度。除了几家糖厂和纺     

Design and Analysis of Internet-Based Tele-Coordinated Multi-Robot Systems

The coordination of multi-robots is required in many scenarios for efficiency and task completion. Combined with teleoperation capabilities, coordinating robots provide a powerful tool. Add to this the Internet and now it is possible for multi-experts at multi-remote sites to control multi-robots in a coordinated fashion. For this to be feasible there are several hurdles to be crossed including Internet type delays, uncertainties in the environment and uncertainties in the object manipulated. In addition, there is a need to measure and control the quality of tele-coordination. To this end, the measure of force sensed by each robot is suggested and justified as a coordination index. It was proven that if n robots are event-transparent and event-synchronous then they can be teleoperated under random delay conditions to coordinate to any index value, which is feasible under no delay conditions. The design procedure that ensures a system can satisfy a small coordination index was presented and analyzed.In addition, the design and analysis of event-synchronous systems using Petri Nets is detailed. The Petri Net design methodology is presented for both event-synchronous single operator single robot teleoperation systems and event-synchronous multi-operator multi-robot teleoperation systems.The theory developed was tested by bilaterally tele-coordinating two mobile manipulators via the Internet. The experimental results confirmed the theoretical results presented.