An interactive graphics system for 2-D drawing and design

This paper is about a software system, GRASS-Graphic Software System for 2-D drawing and design—which has been implemented on a PDP-11/35 system with RSX-11M operating system. It is a low cost interactive graphics system for the design of two dimensional drawings and uses a minimum of hardware. It provides comprehensive facilities for creating, editing, storing and retrieving pictures. It has been implemented in the language Pascal and has the potential to be used as a powerful data-imputting tool for a design-automation system. The important features of the system are its low cost, software character generation and a user-trainable character recognizer, which has been included.

Distributed Scheduling for Multi-Hop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. We suggest how the greedy heuristic can be implemented in a distributed manner. We evaluate an analytical bound in detail, for the special case of a line graph and also provide a loose bound on the greedy heuristic for the case of an arbitrary graph.

Multi-time scale analysis applied to long time simulation of power systems

The results are presented of applying multi-time scale analysis using the singular perturbation technique for long time simulation of power system problems. A linear system represented in state-space form can be decoupled into slow and fast subsystems. These subsystems can be simulated with different time steps and then recombined to obtain the system response. Simulation results with a two-time scale analysis of a power system show a large saving in computational costs.

Robustness of the partitions in grouping multi-item inventories

A recent work obtained closed-form solutions to the.problem of optimally grouping a multi-item inventory into subgroups with a common order cycle per group, when the distribution by value of the inventory could be described by a Pareto function. This paper studies the sensitivity of the optimal subgroup boundaries so obtained. Closed-form expressions have been developed to find intervals for the subgroup boundaries for any given level of suboptimality. Graphs have been provided to aid the user in selecting a cost-effective level of aggregation and choosing appropriate subgroup boundaries for a whole range of inventory distributions. The results of sensitivity analyses demonstrate the availability of flexibility in the partition boundaries and the cost-effectiveness of any stock control system through three groups, and thus also provide a theoretical support to the intuitive ABC system of classifying the items.

Non-Destructive Method to Estimate the Moisture Content in Bread using Multi-Channel Electrical Impedance Spectroscopy

Bread undergoes several physicochemical changes during storage that results in a rapid loss of freshness. These changes depend on moisture content present in bread product. An instrument based on electrical impedance spectroscopy technique is developed to estimate moisture content of bread at different zones using designed multi-channel ring electrodes. A dedicated AT89S52 microcontroller and associated peripherals are employed for hardware. A constant current is applied across bread loaf through central pair of electrodes and developed potential across different zones of bread loaf are measured using remaining four ring electrode pairs. These measured values of voltage and current are used to measure the impedance at each zone. Electrical impedance behavior of the bread loaf at crust and crumb is investigated during storage. A linear relationship is observed between the measured impedance and moisture content present in crust and crumb of bread loaf during storage of 120 hours.

I/O Device Virtualization in the multi-core era, a QoS perspective

In this paper, we propose an extension to the I/O device architecture, as recommended in the PCI-SIG IOV specification, for virtualizing network I/O devices. The aim is to enable fine-grained controls to a virtual machine on the I/O path of a shared device. The architecture allows native access of I/O devices to virtual machines and provides device level QoS hooks for controlling VM specific device usage. For evaluating the architecture we use layered queuing network (LQN) models. We implement the architecture and evaluate it using simulation techniques, on the LQN model, to demonstrate the benefits. With the architecture, the benefit for network I/O is 60% more than what can be expected on the existing architecture. Also, the proposed architecture improves scalability in terms of the number of virtual machines intending to share the I/O device.

On the propagation of a multi-dimensional shock of arbitrary strength

In this paper the kinematics of a curved shock of arbitrary strength has been discussed using the theory of generalised functions. This is the extension of Moslov’s work where he has considered isentropic flow even across the shock. The condition for a nontrivial jump in the flow variables gives the shock manifold equation (sme). An equation for the rate of change of shock strength along the shock rays (defined as the characteristics of the sme) has been obtained. This exact result is then compared with the approximate result of shock dynamics derived by Whitham. The comparison shows that the approximate equations of shock dynamics deviate considerably from the exact equations derived here. In the last section we have derived the conservation form of our shock dynamic equations. These conservation forms would be very useful in numerical computations as it would allow us to derive difference schemes for which it would not be necessary to fit the shock-shock explicitly.

Statistical significance of sequential firing patterns in multi-neuronal spike trains

Sequential firings with fixed time delays are frequently observed in simultaneous recordings from multiple neurons. Such temporal patterns are potentially indicative of underlying microcircuits and it is important to know when a repeatedly occurring pattern is statistically significant. These sequences are typically identified through correlation counts. In this paper we present a method for assessing the significance of such correlations. We specify the null hypothesis in terms of a bound on the conditional probabilities that characterize the influence of one neuron on another. This method of testing significance is more general than the currently available methods since under our null hypothesis we do not assume that the spiking processes of different neurons are independent. The structure of our null hypothesis also allows us to rank order the detected patterns. We demonstrate our method on simulated spike trains.

Propagation of ion-acoustic waves in a multi-component plasma

The authors derive the Korteweg-de Vries equation in a multicomponent plasma that includes any number of positive and negative ions. The solitary wave solutions are also found explicitly for the case of isothermal and non-isothermal electrons.

Multi-state-choice automata model for expedient learning in random environment

A new automata model Mr,k, with a conceptually significant innovation in the form of multi-state alternatives at each instance, is proposed in this study. Computer simulations of the Mr,k, model in the context of feature selection in an unsupervised environment has demonstrated the superiority of the model over similar models without this multi-state-choice innovation.

Positional Consensus in Multi-Agent Systems using a Broadcast Control Mechanism

In this paper a strategy for controlling a group of agents to achieve positional consensus is presented. The proposed technique is based on the constraint that every agents must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. We propose a novel linear programming formulation that is computationally less intensive than earlier proposed methods. Moreover, we introduce a random perturbation input in the control command that helps us to achieve perfect consensus even for a large number of agents, which was not possible with the existing strategy in the literature. Moreover, we extend the method to achieve positional consensus at a pre-specified location. The effectiveness of the approach is illustrated through simulation results.

Korteweg-de Vries equation for the propagation of fast ion-acoustic waves in multi-dimensions

Abstract is not available.

Theory of Non-linear Waves in Multi-dimensions: with Special Reference to Surface Water Waves

The surface water waves are "modal" waves in which the "physical space" (t, x, y, z) is the product of a propagation space (t, x, y) and a cross space, the z-axis in the vertical direction. We have derived a new set of equations for the long waves in shallow water in the propagation space. When the ratio of the amplitude of the disturbance to the depth of the water is small, these equations reduce to the equations derived by Whitham (1967) by the variational principle. Then we have derived a single equation in (t, x, y)-space which is a generalization of the fourth order Boussinesq equation for one-dimensional waves. In the neighbourhood of a wave froat, this equation reduces to the multidimensional generalization of the KdV equation derived by Shen & Keller (1973). We have also included a systematic discussion of the orders of the various non-dimensional parameters. This is followed by a presentation of a general theory of approximating a system of quasi-linear equations following one of the modes. When we apply this general method to the surface water wave equations in the propagation space, we get the Shen-Keller equation.

Negotiation schemes for multi-agent cooperative search

Because of limited sensor and communication ranges, designing efficient mechanisms for cooperative tasks is difficult. In this article, several negotiation schemes for multiple agents performing a cooperative task are presented. The negotiation schemes provide suboptimal solutions, but have attractive features of fast decision-making, and scalability to large number of agents without increasing the complexity of the algorithm. A software agent architecture of the decision-making process is also presented. The effect of the magnitude of information flow during the negotiation process is studied by using different models of the negotiation scheme. The performance of the various negotiation schemes, using different information structures, is studied based on the uncertainty reduction achieved for a specified number of search steps. The negotiation schemes perform comparable to that of optimal strategy in terms of uncertainty reduction and also require very low computational time, similar to 7 per cent to that of optimal strategy. Finally, analysis on computational and communication requirement for the negotiation schemes is carried out.

Electrical Percolation studies of Polystyrene-multi wall carbon nanotubes Composites

Composites of Polystyrene-multi wall carbon nanotubes (PS-MWNTs) were prepared with loading up to 7 wt% of MWNTs by simple solvent mixing and drying technique. MWNTs with high aspect ratio similar to 4000 were used to make the polymer composites. A very high degree of dispersion of MWNTs was achieved by ultrasonication technique. As a result of high dispersion and high aspect ratio of the MWNTs electrical percolation was observed at rather low weight fraction similar to 0.0021. Characterization of the as prepared PS-MWNTs composites was done by Electron microscopy (EM), X-ray diffraction technique (XRD) and Thermogravimetery analysis (TGA).