Optimizing functionally graded nickel–zirconia coating profiles for thermal stress relaxation

The investigations on optimization of composite composition of nickel–zirconia for the functionally graded layered thermal barrier coating for the lowest but uniform stress field under thermal loading is presented. The procedure for obtaining temperature- and composition-dependent thermal and mechanical properties of various coating compositions is discussed. These material parameters were used in thermo-mechanical finite element stress analyses of a nickel substrate with the coating. The results showed that the Von-Mises stresses in the substrate and the interfaces were the lowest with the coating profile that followed a concave power law relationship with the index n ≈ 2.65.     

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R ₁×R ₂×???×R _k where R _i (for 1≤i≤k) is a closed interval of the form [a _i ,b _i ] on the real line. For a graph G, its boxicity box?(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a $\lfloor 1+\frac{1}{c}\log n\rfloor^{d-1}An axis-parallel k-dimensional box is a Cartesian product R ₁×R ₂×⋅⋅⋅×R _k where R _i (for 1≤i≤k) is a closed interval of the form [a _i ,b _i ] on the real line. For a graph G, its boxicity box (G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a ?1+\frac1clogn?^d-1\lfloor 1+\frac{1}{c}\log n\rfloor^{d-1} approximation ratio for any constant c≥1 when d≥2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard.     

Filtering Data Streams for Entity-Based Continuous Queries

The idea of allowing query users to relax their correctness requirements in order to improve performance of a data stream management system (e.g., location-based services and sensor networks) has been recently studied. By exploiting the maximum error (or tolerance) allowed in query answers, algorithms for reducing the use of system resources have been developed. In most of these works, however, query tolerance is expressed as a numerical value, which may be difficult to specify. We observe that in many situations, users may not be concerned with the actual value of an answer, but rather which object satisfies a query (e.g., "who is my nearest neighbor?”). In particular, an entity-based query returns only the names of objects that satisfy the query. For these queries, it is possible to specify a tolerance that is "nonvalue-based.” In this paper, we study fraction-based tolerance, a type of nonvalue-based tolerance, where a user specifies the maximum fractions of a query answer that can be false positives and false negatives. We develop fraction-based tolerance for two major classes of entity-based queries: 1) nonrank-based query (e.g., range queries) and 2) rank-based query (e.g., k-nearest-neighbor queries). These definitions provide users with an alternative to specify the maximum tolerance allowed in their answers. We further investigate how these definitions can be exploited in a distributed stream environment. We design adaptive filter algorithms that allow updates be dropped conditionally at the data stream sources without affecting the overall query correctness. Extensive experimental results show that our protocols reduce the use of network and energy resources significantly.     

Distributed algorithms for barrier coverage using relocatable sensors

We study the barrier coverage problem using relocatable sensor nodes. We assume each sensor can sense an intruder or event inside its sensing range. Sensors are initially located at arbitrary positions on the barrier and can move along the barrier. The goal is to find final positions for sensors so that the entire barrier is covered. In recent years, the problem has been studied extensively in the centralized setting. In this paper, we study a barrier coverage problem in the distributed and discrete setting. We assume that we have n identical sensors located at grid positions on the barrier, and that each sensor repeatedly executes a Look-Compute-Move cycle: based on what it sees in its vicinity, it makes a decision on where to move, and moves to its next position. We make two strong but realistic restrictions on the capabilities of sensors: they have a constant visibility range and can move only a constant distance in every cycle. In this model, we give the first two distributed algorithms that achieve barrier coverage for a line segment barrier when there are enough nodes in the network to cover the entire barrier. Our algorithms are synchronous, and local in the sense that sensors make their decisions independently based only on what they see within their constant visibility range. One of our algorithms is oblivious whereas the other uses two bits of memory at each sensor to store the type of move made in the previous step. We show that our oblivious algorithm terminates within \(\varTheta (n^2)\) steps with the barrier fully covered, while the constant-memory algorithm is shown to take \(\varTheta (n)\) steps to terminate in the worst case. Since any algorithm in which a sensor can only move a constant distance in one step requires \(\varOmega (n)\) steps on some inputs, our second algorithm is asymptotically optimal.     

Dynamic Modeling and Simulation of Impact in Tether Net/Gripper systems

The objective of this paper is to study the dynamic modeling andsimulation of a tether-net/gripper system during an impact, while it isbeing deployed or retrieved by a winch on a satellite orbiting aroundearth. We stick to Tether-Net system but the analysis is applicable toTether-Gripper systems too. We assume that the net is deployed from thesatellite in orbit and the motion is restricted to the orbital plane.This net captures a second satellite and tows it. The motion of atether-net system can be broken down into the following phases: (i)Phase 1: Net is shot out from the satellite with the tether completelyslack, (ii) Phase 2: Net comes to a location where the tether is tautwhile the drum on the orbiter is locked, (iii) Phase 3: Drum is unlockedand the net moves with the tether, (iv) Phase 4: Net captures a body.The continua (tether) is modeled using mode functions and coordinates.The theory of impulse and momentum can be used to model Phases 1, 2, and4 of motion of the tether-net system. The dynamics of the motion of thesystem in phase 3 is characterized by differential and algebraicequations (DAEs). Matlab ODE solvers were used to solve these DAEs.     

Enhancing spoken connected-digit recognition accuracy by error correction codes — A novel scheme

Recognizing spoken connected-digit numbers accurately is an important problem and has very many applications. Though state-of-the-art word recognition systems have gained acceptable accuracy levels, the accuracy of recognition of current connected spoken digits (and other short words) is very poor. In this paper, we develop a novel scheme to enhance the accuracy of recognizing a connected number. The basic idea proposed in this paper is to increase the number of digits in a number and use these appended digits to increase the overall accuracy of recognizing the number, as is done in the error-correcting code literature. We further show that the developed scheme is able to uniquely and exactly correct single-digit errors.     

Distributed Arithmetic based Split-Radix FFT

In this paper we have designed a Split-radix type FFT unit without using multipliers. All the complex multiplications required for this type of FFT are implemented using Distributed Arithmetic (DA) technique. A method is incorporated to overcome the result overflow problem introduced by DA method. Proposed FFT architecture is implemented in 180 nm CMOS technology at a supply voltage of 1.8 V.     

Effect of Temperature on Hydraulic Parameters of Cable-In-Conduit-Conductor of SST-1

Stable operation of superconducting magnets depend critically on the balance of heat deposition rate versus heat extraction rate by the cryo-coolant. Thus, the mass flow rate of the coolant in case of force-flow cooled superconducting magnet with Cable-In-Co-nduit-Conductor (CICC) construction becomes an important factor for optimum stability of magnets. The Toroidal and Poloidal Field magnets of Steady-state Superconducting Tokamak-1 (SST-1) is made of superconducting CICC with a void fraction of 40 %±2 %. For adequate cooling of magnets, supercritical helium at 4 bar and 4.5 K is forced-flown through the voids. Effect of temperature on mass flow rate and pressure drop in SST-1 CICC is studied in a 7 m long piece wound helically. The experimental friction factor of the CICC is also measured at different temperatures and flow rates and is compared with the standard Katheder equation and Tada equation. Also, based on the new findings obtained from the experimental results, the dimensionless Reynolds number has been slightly modified. This new number is used to propose a modified Katheder correlation for the friction factor in CICCs similar to that of SST-1.     

Influence of equal channel angular pressing in an acute angle die with a back pressure notch on grain refinement,torsion and mechanical properties of aluminium

Severe plastic deformation improves the strength of a metal by strain hardening. Of the various severe plastic deformation processes, equal channel angular pressing proves to be the right candidate for bulk metal processing. Extensive works were carried out on equal channel angular pressing with channel angle ranging from 90° to 120 ° with or without back pressure on the exit channel. Numerical analyses suggest that reducing the channel angle below 90° would enhance the magnitude of strain imparted and, with prediction of a lesser strain homogeneity in such cases. Hence an acute angled equal channel angular pressing die with a back‐pressure notch sunken into the roof of the exit channel was designed, fabricated and was used for processing pure aluminium. Various mechanical properties of the processed materials were tested and acute angle processing imparted superior tensile strength to the work pieces in a single pass that would require several passes in a conventional equal channel angular pressing die. Substantial improvement in grain refinement and torsional properties was identified.