Modeling and design of a solar thermal system for hybrid cooking application

This paper proposes a hybrid solar cooking system where the solar energy is brought to the kitchen. The energy source is a combination of the solar thermal energy and the Liquefied Petroleum Gas (LPG) that is in common use in kitchens. The solar thermal energy is transferred to the kitchen by means of a circulating fluid. The transfer of solar heat is a twofold process wherein the energy from the collector is transferred first to an intermediate energy storage buffer and the energy is subsequently transferred from the buffer to the cooking load. There are three parameters that are controlled in order to maximize the energy transfer from the collector to the load viz, the fluid flow rate from collector to buffer, fluid flow rate from buffer to load and the diameter of the pipes. This is a complex multi energy domain system comprising energy flow across several domains such as thermal, electrical and hydraulic. The entire system is modeled using the bond graph approach with seamless integration of the power flow in these domains. A method to estimate different parameters of the practical cooking system is also explained. Design and life cycle costing of the system is also discussed. The modeled system is simulated and the results are validated experimentally. (C) 2010 Elsevier Ltd. All rights reserved.

Managing interprocessor delays in distributed recursive algorithms

For a class of distributed recursive algorithms, it is shown that a stochastic approximation-like tapering stepsize routine suppresses the effects of interprocessor delays.

Surface-ray tracing on hybrid surfaces of revolution for UTD mutual coupling analysis

An angle invariance property based on Hertz's principle of particle dynamics is employed to facilitate the surface-ray tracing on nondevelopable hybrid quadric surfaces of revolution (h-QUASOR's). This property, when used in conjunction with a Geodesic Constant Method, yields analytical expressions for all the ray-parameters required in the UTD formulation. Differential geometrical considerations require that some of the ray-parameters (defined heuristically in the UTD for the canonical convex surfaces) be modified before the UTD can be applied to such hybrid surfaces. Mutual coupling results for finite-dimensional slots have been presented as an example on a satellite launch vehicle modeled by general paraboloid of revolution and right circular cylinder.

Line clipping revisited: Two efficient algorithms based on simple geometric observations

Two new line clipping algorithms, the opposite-corner algorithm and the perpendicular-distance algorithm, that are based on simple geometric observations are presented. These algorithms do not require computation of outcodes nor do they depend on the parametric representations of the lines. It is shown that the opposite-corner algorithm perform consistently better than an algorithm due to Nicholl, Lee, and Nicholl which is claimed to be better than the classic algorithm due to Cohen-Sutherland and the more recent Liang-Barsky algorithm. The pseudo-code of the opposite-corner algorithm is provided in the Appendix.

Modulation of vesicular properties by variation of shapes of bolaform counter ions in hybrid-ion paired surfactants

Four new vesicle-forming bolaphile/amphiphile ion pairs are synthesized; the bolaphile shapes in such hybrid systems strongly control their vesicular properties.

Some Algorithms for Eigensubspace Estimation

An important tool in signal processing is the use of eigenvalue and singular value decompositions for extracting information from time-series/sensor array data. These tools are used in the so-called subspace methods that underlie solutions to the harmonic retrieval problem in time series and the directions-of-arrival (DOA) estimation problem in array processing. The subspace methods require the knowledge of eigenvectors of the underlying covariance matrix to estimate the parameters of interest. Eigenstructure estimation in signal processing has two important classes: (i) estimating the eigenstructure of the given covariance matrix and (ii) updating the eigenstructure estimates given the current estimate and new data. In this paper, we survey some algorithms for both these classes useful for harmonic retrieval and DOA estimation problems. We begin by surveying key results in the literature and then describe, in some detail, energy function minimization approaches that underlie a class of feedback neural networks. Our approaches estimate some or all of the eigenvectors corresponding to the repeated minimum eigenvalue and also multiple orthogonal eigenvectors corresponding to the ordered eigenvalues of the covariance matrix. Our presentation includes some supporting analysis and simulation results. We may point out here that eigensubspace estimation is a vast area and all aspects of this cannot be fully covered in a single paper. (C) 1995 Academic Press, Inc.

Spontaneously Igniting Hybrid Fuel-Oxidizer Systems

After briefly outlining the recent developments in hybrid rockets, the work carried out by the author on self-igniting (hypergolic) solid fuel-liquid oxidiser systems has been reviewed. A major aspect relates to the solid derivatives of hydrazines, which have been conceived as fuels for hybrid rockets. Many of these N-N bonded compounds ignite readily, with very short ignition delays, on coming into contact with liquid oxidisers, like HNO3 and N2O4. The ignition characteristics have been examined as a function of the nature of the functional group in the fuel molecule, in an attempt to establish a basis for the hypergolic ignition in terms of chemical reactivity of the fuel-oxidiser combination. Important chemical reactions occurring in the pre-ignition stage have been identified by examining the quenched reaction products. Hybrid systems exhibiting synergistic hypergolicity in the presence of metal powders have been investigated. An estimation of the rocket performance parameters, experimental determination of the heats of combustion in HNO3, thermal decomposition characteristics, temperature profile by thin film thermometry and and product identification by the rapid scan FT-IR, are among the other relevant studies made on these systems. A significant recent development has been the synthesis of new N-N bonded viscous binders, capable of retaining the hypergolicity of the fuel powders embedded therein as well as providing the required mechanical strength to the grain. Several of these resins have been characterised. Metallised fuel composites of these resins having high loading of magnesium are found to have short ignition delays and high performance parameters.

Vibration and buckling of hybrid laminated curved panels

Vibration and buckling of curved plates, made of hybrid laminated composite materials, are studied using first-order shear deformation theory and Reissner's shallow shell theory. For an initial study, only simply-supported boundary conditions are considered. The natural frequencies and critical buckling loads are calculated using the energy method (Lagrangian approach) by assuming a combination of sine and cosine functions in the form of double Fourier series. The effects of curvature, aspect ratio, stacking sequence and ply-orientation are studied. The non-dimensional frequencies and critical buckling load of a hybrid laminate lie in between the values for laminates made of all plies of higher strength and lower strength fibres. Curvature enhances natural frequencies and it is more predominant for a thin panel than a thick one.

On an exact populationary model of genetic algorithms

Genetic algorithms (GAs) are search methods that are being employed in a multitude of applications with extremely large search spaces. Recently, there has been considerable interest among GA researchers in understanding and formalizing the working of GAs. In an earlier paper, we have introduced the notion of binomially distributed populations as the central idea behind an exact ''populationary'' model of the large-population dynamics of the GA operators for objective functions called ''functions of unitation.'' In this paper, we extend this populationary model of GA dynamics to a more general class of objective functions called functions of unitation variables. We generalize the notion of a binomially distributed population to a generalized binomially distributed population (GBDP). We show that the effects of selection, crossover, and mutation can be exactly modelled after decomposing the population into GBDPs. Based on this generalized model, we have implemented a GA simulator for functions of two unitation variables-GASIM 2, and the distributions predicted by GASIM 2 match with those obtained from actual GA runs. The generalized populationary model of GA dynamics not only presents a novel and natural way of interpreting the workings of GAs with large populations, but it also provides for an efficient implementation of the model as a GA simulator. (C) Elsevier Science Inc. 1997.

Some algorithms for discrete time queues with finite capacity

We consider a discrete time queue with finite capacity and i.i.d. and Markov modulated arrivals, Efficient algorithms are developed to calculate the moments and the distributions of the first time to overflow and the regeneration length, Results are extended to the multiserver queue. Some illustrative numerical examples are provided.

Optimal control of a stochastic hybrid system with discounted cost

We address the optimal control problem of a very general stochastic hybrid system with both autonomous and impulsive jumps. The planning horizon is infinite and we use the discounted-cost criterion for performance evaluation. Under certain assumptions, we show the existence of an optimal control. We then derive the quasivariational inequalities satisfied by the value function and establish well-posedness. Finally, we prove the usual verification theorem of dynamic programming.

Synthesis of ASIPs for DSP algorithms

ASICs offer the best realization of DSP algorithms in terms of performance, but the cost is prohibitive, especially when the volumes involved are low. However, if the architecture synthesis trajectory for such algorithms is such that the target architecture can be identified as an interconnection of elementary parameterized computational structures, then it is possible to attain a close match, both in terms of performance and power with respect to an ASIC, for any algorithmic parameters of the given algorithm. Such an architecture is weakly programmable (configurable) and can be viewed as an application specific integrated processor (ASIP). In this work, we present a methodology to synthesize ASIPs for DSP algorithms. (C) 1999 Elsevier Science B.V. All rights reserved.

Cyclic Prefix Based Cooperative Sequential Spectrum Sensing Algorithms for OFDM

This paper considers the problem of spectrum sensing in cognitive radio networks when the primary user is using Orthogonal Frequency Division Multiplexing (OFDM). For this we develop cooperative sequential detection algorithms that use the autocorrelation property of cyclic prefix (CP) used in OFDM systems. We study the effect of timing and frequency offset, IQ-imbalance and uncertainty in noise and transmit power. We also modify the detector to mitigate the effects of these impairments. The performance of the proposed algorithms is studied via simulations. We show that sequential detection can significantly improve the performance over a fixed sample size detector.

Automatic decomposition of unstructured meshes employing genetic algorithms for parallel FEM computations

Parallel execution of computational mechanics codes requires efficient mesh-partitioning techniques. These mesh-partitioning techniques divide the mesh into specified number of submeshes of approximately the same size and at the same time, minimise the interface nodes of the submeshes. This paper describes a new mesh partitioning technique, employing Genetic Algorithms. The proposed algorithm operates on the deduced graph (dual or nodal graph) of the given finite element mesh rather than directly on the mesh itself. The algorithm works by first constructing a coarse graph approximation using an automatic graph coarsening method. The coarse graph is partitioned and the results are interpolated onto the original graph to initialise an optimisation of the graph partition problem. In practice, hierarchy of (usually more than two) graphs are used to obtain the final graph partition. The proposed partitioning algorithm is applied to graphs derived from unstructured finite element meshes describing practical engineering problems and also several example graphs related to finite element meshes given in the literature. The test results indicate that the proposed GA based graph partitioning algorithm generates high quality partitions and are superior to spectral and multilevel graph partitioning algorithms.

Bandwidth management in a hybrid wireless network: For superstore applications

The integration of different wireless networks, such as GSM and WiFi, as a two-tier hybrid wireless network is more popular and economical. Efficient bandwidth management, call admission control strategies and mobility management are important issues in supporting multiple types of services with different bandwidth requirements in hybrid networks. In particular, bandwidth is a critical commodity because of the type of transactions supported by these hybrid networks, which may have varying bandwidth and time requirements. In this paper, we consider such a problem in a hybrid wireless network installed in a superstore environment and design a bandwidth management algorithm based on the priority level, classification of the incoming transactions. Our scheme uses a downlink transaction scheduling algorithm, which decides how to schedule the outgoing transactions based on their priority level with efficient use of available bandwidth. The transaction scheduling algorithm is used to maximize the number of transaction-executions. The proposed scheme is simulated in a superstore environment with multi Rooms. The performance results describe that the proposed scheme can considerably improve the bandwidth utilization by reducing transaction blocking and accommodating more essential transactions at the peak time of the business.