Triggered vacuum gap for initiating electric arcs in vacuum

Describes a simple triggered vacuum gap developed for initiating electric arcs in vacuum which uses the property that the voltage required to breakdown a gap in vacuum in the presence of a solid insulating material is considerably less than the voltage required in the absence of such material. In this triggered vacuum gap a solid insulating material is used in the angular space between the main cathode and the concentric trigger electrode forming the auxiliary gap. Different materials like epoxy resin, Teflon (PTFE) and mica have been used. The trigger voltage was found to vary in the range 560-1840 V. The results with epoxy and Teflon were unsatisfactory because the trigger voltages showed wide scatter and the auxiliary gap was soon bridged by metal particles eroded from the electrodes. Though the trigger voltages required with mica were relatively high, consistent triggering could be obtained for a large number of trials before the auxiliary gap was bridged. This was probably due to better thermal stability of mica as compared with either epoxy or Teflon.

High efficiency infrared antireflection coatings (ARCs) for space optics

Simple ARC designs for germanium (Ge) optics useful in spaceborne electro-optical systems have been generated. It is seen that the designs which are non-quarterwave in nature are efficient in terms of spectral coverage and residual reflection loss. They have been realised experimentally and the resulting ARCs are found to have very good spectral and durability properties.

DEPRESSION OF MAGNETlCALLY FIXED EMISSION ZONE IN LOW PRESSURE MERCURY ARCS

A transverse magnetic field was used to fix the cathode spot of a low pressure mercury arc with liquid cathode It was noticed that such fixation causes consider-abledepression of the emission zone below the mercury level.This depression varies with the arc current and the magnetic field and is associated with an increase in the arc voltage drop. It indicates appreciable pressure in the emission zone.

Ordering transformation in icosahedral quasicrystals and related crystalline phases

Arcs of diffuse intensity appear in various shapes and positions in the diffraction patterns from the icosahedral phase, violating the parity rule for simple icosahedral (SI) symmetry. In the process of annealing treatment, the diffuse spots also evolve in the centre of the arcs and become sharp. These extra diffuse spots change the symmetry of the quasilattice from P-type to F-type. The ordered and disordered structures in quasicrystal have been linked to the ordered and disordered structures present in the crystalline alpha (Al-Mn-Si) and alpha (Al-Fe-Si) alloys.

Load Transfer from a Smooth Elastic Pin to a Large Sheet

The plane problem of load transfer from an elastic interference or clearance fit pin to a large elastic sheet with a perfectly smooth interface is solved. As the load on the pin is monotonically increased, the pin-hole interface is in partial contact above certain critical load in interference fit and throughout the loading range in clearance fit.Such situations result in mixed boundary-value problems with moving boundaries and the arc of contact varies nonlinearly with applied load. These problems are analyzed by an inverse technique in which the arcs of contact/separation are prescribed and the causative loads are evaluated. A direct method of analysis is adopted using biharmonic polar trigonometric stress functions and a simple collocation method for satisfying the boundary conditions. A unified analytical formulation is achieved for interference and clearance fits. The solutions for the linear problem of push fits are inherent in the unified analysis. Numerical results highlighting the effects of pin and sheet elasticity parameters are presented.

Planar pursuit-evasion with variable speeds, part 1, extremal trajectory maps

Pursuit evasion in a plane is formulated with both players allowed to vary their speeds between fixed limits. A suitable choice of real-space coordinates confers open-loop optimality on the game. The solution in the small is described in terms of the individual players'' extremal trajectory maps (ETM). Each map is independent of role, adversary, and capture radius. An ETM depicts the actual real-space trajectories. A template method of generating constant control arcs is described. Examples of ETM for an aircraft flying at a constant altitude with fixed and varying speeds are presented.

An HI study of three long-tailed irregular galaxies in the cluster Abell 1367

We present the results on the distribution and kinematics of HI gas with higher sensitivity and in one case of higher spectral resolution as well than reported earlier, of three irregular galaxies CGCG 097073, 097079 and 097087 (UGC 06697) in the cluster Abell 1367. These galaxies are known to exhibit long (50 - 75 kpc) tails of radio continuum and optical emission lines (H alpha) pointing away from the cluster centre and arcs of starformation on the opposite sides of the tails, These features as well as the HI properties, with two of the galaxies (CGCG 097073 and 097079) exhibiting sharper gradients in HI intensity on the side of the tails, are consistent with the HI gas being affected by the ram pressure of the intracluster medium. However the HI emission in all the three galaxies extends to much smaller distances than the radio-continuum and H alpha tails, and are possibly still bound to the parent galaxies. Approximately 20 - 30 per cent of the HI mass is seen to accumulate on the downstream side due to the effects of ram pressure.

The Bertele arc

THE electron emission in the cathode spot of arcs has remained an unexplained phenomenon since K. T. Compton1 first directed attention to it. It appears that the arc discharge discovered by H. von Bertele 2 puts this paradox into an even more acute form.

Hamilton’s theory of turns and a new geometrical representation for polarization optics

Hamilton’s theory of turns for the group SU(2) is exploited to develop a new geometrical representation for polarization optics. While pure polarization states are represented by points on the Poincaré sphere, linear intensity preserving optical systems are represented by great circle arcs on another sphere. Composition of systems, and their action on polarization states, are both reduced to geometrical operations. Several synthesis problems, especially in relation to the Pancharatnam-Berry-Aharonov-Anandan geometrical phase, are clarified with the new representation. The general relation between the geometrical phase, and the solid angle on the Poincaré sphere, is established.

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.

Constructing Reeb Graphs using Cylinder Maps

The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Arcs in the Reeb graph are computed in the second step using a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The algorithm is also able to handle non-manifold domains.

Investigation of the characteristics of an SF6 rotating arc by a mathematical model

A mathematical model has been developed for predicting the performance of rotating arcs in SF6 gas by considering the energy balance and force balance equations. The finite difference technique has been adopted for the computer simulation of the arc characteristics. This method helps in considering the spatial variation of the transport and radiative properties of the arc. All the three heat loss mechanisms-conduction, convection, and radiation-have been considered. Results obtained over a 10 ms (half cycle of 50 Hz wave) current flow period for 1.4 kA (peak) and 4.2 kA (peak), show that the proposed arc model gives the expected behavior of the arc over the range of currents studied.

Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks

Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dataflow graphs have been widely regarded as a powerful programming model for DSP applications. In this paper we propose a method to minimize buffer storage requirement in constructing rate-optimal compile-time (MBRO) schedules for multi-rate dataflow graphs. We demonstrate that the constraints to minimize buffer storage while executing at the optimal computation rate (i.e. the maximum possible computation rate without storage constraints) can be formulated as a unified linear programming problem in our framework. A novel feature of our method is that in constructing the rate-optimal schedule, it directly minimizes the memory requirement by choosing the schedule time of nodes appropriately. Lastly, a new circular-arc interval graph coloring algorithm has been proposed to further reduce the memory requirement by allowing buffer sharing among the arcs of the multi-rate dataflow graph. We have constructed an experimental testbed which implements our MBRO scheduling algorithm as well as (i) the widely used periodic admissible parallel schedules (also known as block schedules) proposed by Lee and Messerschmitt (IEEE Transactions on Computers, vol. 36, no. 1, 1987, pp. 24-35), (ii) the optimal scheduling buffer allocation (OSBA) algorithm of Ning and Gao (Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, Jan. 10-13, 1993, pp. 29-42), and (iii) the multi-rate software pipelining (MRSP) algorithm (Govindarajan and Gao, in Proceedings of the 1993 International Conference on Application Specific Array Processors, Venice, Italy, Oct. 25-27, 1993, pp. 77-88). Schedules generated for a number of random dataflow graphs and for a set of DSP application programs using the different scheduling methods are compared. The experimental results have demonstrated a significant improvement (10-20%) in buffer requirements for the MBRO schedules compared to the schedules generated by the other three methods, without sacrificing the computation rate. The MBRO method also gives a 20% average improvement in computation rate compared to Lee's Block scheduling method.

Study of temperature distribution along an artificially polluted insulator string

Insulator becomes wet partially or completely, and the pollution layer on it becomes conductive, when collecting pollutants for an extended period during dew, light rain, mist, fog or snow melting. Heavy rain is a complicated factor that it may wash away the pollution layer without initiating other stages of breakdown or it may bridge the gaps between sheds to promote flashover. The insulator with a conducting pollution layer being energized, can cause a surface leakage current to flow (also temperature-rise). As the surface conductivity is non-uniform, the conducting pollution layer becomes broken by dry bands (at spots of high current density), interrupting the flow of leakage current. Voltage across insulator gets concentrated across dry bands, and causes high electric stress and breakdown (dry band arcing). If the resistance of the insulator surface is sufficiently low, the dry band arcs can be propagated to bridge the terminals causing flashover. The present paper concerns the evaluation of the temperature distribution along the surface of an energized artificially polluted insulator string.

Faster Algorithms for Incremental Topological Ordering.Robert Tarjan

We present two online algorithms for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm takes O(m 1/2) amortized time per arc and our second algorithm takes O(n 2.5/m) amortized time per arc, where n is the number of vertices and m is the total number of arcs. For sparse graphs, our O(m 1/2) bound improves the best previous bound by a factor of logn and is tight to within a constant factor for a natural class of algorithms that includes all the existing ones. Our main insight is that the two-way search method of previous algorithms does not require an ordered search, but can be more general, allowing us to avoid the use of heaps (priority queues). Instead, the deterministic version of our algorithm uses (approximate) median-finding; the randomized version of our algorithm uses uniform random sampling. For dense graphs, our O(n 2.5/m) bound improves the best previously published bound by a factor of n 1/4 and a recent bound obtained independently of our work by a factor of logn. Our main insight is that graph search is wasteful when the graph is dense and can be avoided by searching the topological order space instead. Our algorithms extend to the maintenance of strong components, in the same asymptotic time bounds.