New nine-node Lagrangian quadrilateral plate element based on Mindlin-Reissner theory using IFM

This paper presents a new nine-node Lagrangian quadrilateral plate bending element (MQP9) using the Integrated Force Method (IFM) for the analysis of thin and moderately thick plate bending problems. Three degrees of freedom: transverse displacement w and two rotations theta(x) and theta(y) are considered at each node of the element. The Mindlin-Reissner theory has been employed in the formulation which accounts the effect of shear deformation. Many standard plate bending benchmark problems have been analyzed using the new element MQP9 for various grid sizes via Integrated Force Method to estimate defections and bending moments. These results of the new element MQP9 are compared with those of similar displacement-based plate bending elements available in the literature. The results are also compared with exact solutions. It is observed that the presented new element MQP9 is free from shear locking and produced, in general, excellent results in all plate bending benchmark problems considered.

Discovering injective episodes with general partial orders

Frequent episode discovery is a popular framework for temporal pattern discovery in event streams. An episode is a partially ordered set of nodes with each node associated with an event type. Currently algorithms exist for episode discovery only when the associated partial order is total order (serial episode) or trivial (parallel episode). In this paper, we propose efficient algorithms for discovering frequent episodes with unrestricted partial orders when the associated event-types are unique. These algorithms can be easily specialized to discover only serial or parallel episodes. Also, the algorithms are flexible enough to be specialized for mining in the space of certain interesting subclasses of partial orders. We point out that frequency alone is not a sufficient measure of interestingness in the context of partial order mining. We propose a new interestingness measure for episodes with unrestricted partial orders which, when used along with frequency, results in an efficient scheme of data mining. Simulations are presented to demonstrate the effectiveness of our algorithms.

Fast algorithms for frequent episode discovery in event sequences

In this paper we consider the process of discovering frequent episodes in event sequences. The most computationally intensive part of this process is that of counting the frequencies of a set of candidate episodes. We present two new frequency counting algorithms for speeding up this part. These, referred to as non-overlapping and non-inteleaved frequency counts, are based on directly counting suitable subsets of the occurrences of an episode. Hence they are different from the frequency counts of Mannila et al [1], where they count the number of windows in which the episode occurs. Our new frequency counts offer a speed-up factor of 7 or more on real and synthetic datasets. We also show how the new frequency counts can be used when the events in episodes have time-durations as well.

Generalized frequent episodes in Event Sequences

Discovering patterns in temporal data is an important task in Data Mining. A successful method for this was proposed by Mannila et al. [1] in 1997. In their framework, mining for temporal patterns in a database of sequences of events is done by discovering the so called frequent episodes. These episodes characterize interesting collections of events occurring relatively close to each other in some partial order. However, in this framework(and in many others for finding patterns in event sequences), the ordering of events in an event sequence is the only allowed temporal information. But there are many applications where the events are not instantaneous; they have time durations. Interesting episodesthat we want to discover may need to contain information regarding event durations etc. In this paper we extend Mannila et al.’s framework to tackle such issues. In our generalized formulation, episodes are defined so that much more temporal information about events can be incorporated into the structure of an episode. This significantly enhances the expressive capability of the rules that can be discovered in the frequent episode framework. We also present algorithms for discovering such generalized frequent episodes.

New Insights into Optimal Discrete Rate Adaptation for Average Power Constrained Single and Multi-Node Systems

The throughput-optimal discrete-rate adaptation policy, when nodes are subject to constraints on the average power and bit error rate, is governed by a power control parameter, for which a closed-form characterization has remained an open problem. The parameter is essential in determining the rate adaptation thresholds and the transmit rate and power at any time, and ensuring adherence to the power constraint. We derive novel insightful bounds and approximations that characterize the power control parameter and the throughput in closed-form. The results are comprehensive as they apply to the general class of Nakagami-m (m >= 1) fading channels, which includes Rayleigh fading, uncoded and coded modulation, and single and multi-node systems with selection. The results are appealing as they are provably tight in the asymptotic large average power regime, and are designed and verified to be accurate even for smaller average powers.

Torque Angle Loop Analysis of Synchronous Machines

This paper reports the dynamic stability analysis of a single machine infinite bus system through torque angle loop analysis and forms an extension of the work on Block diagrams and torque angle loop analysis of synchronous machines reported by I. Nagy [3]. It aims to incorporate in the machine model, the damper windings (one on each axis) and to compare the dynamic behaviour of the system with and without damper windings. The effect of using different stabilizing signals (viz. active power and speed deviations) on the dynamic performance is analysed and the significant effect of damper windings on the dynamic behaviour of the system is highlighted.

Evaporation Heat Transfer Coefficient in a Capillary Pumped Loop and Loop Heat Pipe for Different Working Fluids

Capillary pumped loop (CPL) and loop heat pipe (LHP) are passive two-phase heat transport devices. They have been gaining importance as a part of the thermal control system of spacecraft. The evaporation heat transfer coefficient at the tooth-wick interface of an LHP or CPL has a significant impact on the evaporator temperature. It is also the main parameter in sizing of a CPL or LHP. Experimentally determined evaporation heat transfer coefficients from a three-port CPL with tubular axially grooved (TAG) evaporator and a TAG LHP with acetone, R-134A, and ammonia as working fluids are presented in this paper. The influences of working fluid, hydrodynamic blocks in the core, evaporator configuration (LHP or CPL), and adverse elevation (evaporator above condenser) on the heat transfer coefficient are presented.

Optimal multi-layered congestion based pricing schemes for enhanced QoS

Pricing is an effective tool to control congestion and achieve quality of service (QoS) provisioning for multiple differentiated levels of service. In this paper, we consider the problem of pricing for congestion control in the case of a network of nodes with multiple queues and multiple grades of service. We present a closed-loop multi-layered pricing scheme and propose an algorithm for finding the optimal state dependent price levels for individual queues, at each node. This is different from most adaptive pricing schemes in the literature that do not obtain a closed-loop state dependent pricing policy. The method that we propose finds optimal price levels that are functions of the queue lengths at individual queues. Further, we also propose a variant of the above scheme that assigns prices to incoming packets at each node according to a weighted average queue length at that node. This is done to reduce frequent price variations and is in the spirit of the random early detection (RED) mechanism used in TCP/IP networks. We observe in our numerical results a considerable improvement in performance using both of our schemes over that of a recently proposed related scheme in terms of both throughput and delay performance. In particular, our first scheme exhibits a throughput improvement in the range of 67-82% among all routes over the above scheme. (C) 2011 Elsevier B.V. All rights reserved.

Higher spin quasinormal modes and one-loop determinants in the BTZ black hole

We solve the wave equations of arbitrary integer spin fields in the BTZ black hole background and obtain exact expressions for their quasinormal modes. We show that these quasinormal modes precisely agree with the location of the poles of the corresponding two point function in the dual conformal field theory as predicted by the AdS/CFT correspondence. We then use these quasinormal modes to construct the one-loop determinant of the higher spin field in the thermal BTZ background. This is shown to agree with that obtained from the corresponding heat kernel constructed recently by group theoretic methods.

Delay Optimal Event Detection on Ad Hoc Wireless Sensor Networks

We consider a small extent sensor network for event detection, in which nodes periodically take samples and then contend over a random access network to transmit their measurement packets to the fusion center. We consider two procedures at the fusion center for processing the measurements. The Bayesian setting, is assumed, that is, the fusion center has a prior distribution on the change time. In the first procedure, the decision algorithm at the fusion center is network-oblivious and makes a decision only when a complete vector of measurements taken at a sampling instant is available. In the second procedure, the decision algorithm at the fusion center is network-aware and processes measurements as they arrive, but in a time-causal order. In this case, the decision statistic depends on the network delays, whereas in the network-oblivious case, the decision statistic does not. This yields a Bayesian change-detection problem with a trade-off between the random network delay and the decision delay that is, a higher sampling rate reduces the decision delay but increases the random access delay. Under periodic sampling, in the network-oblivious case, the structure of the optimal stopping rule is the same as that without the network, and the optimal change detection delay decouples into the network delay and the optimal decision delay without the network. In the network-aware case, the optimal stopping problem is analyzed as a partially observable Markov decision process, in which the states of the queues and delays in the network need to be maintained. A sufficient decision statistic is the network state and the posterior probability of change having occurred, given the measurements received and the state of the network. The optimal regimes are studied using simulation.

Loop Heat Pipes: A Review of Fundamentals, Operation, and Design

The loop heat pipe (LHP) is a passive two-phase heat transport device that is gaining importance as a part of spacecraft thermal control systems and also in applications such as in avionics cooling and submarines. A major advantage of a loop heat pipe is that the porous wick structure is confuned to the evaporator section, and connection between the evaporator and condenser sections is by smooth tubes, thus minimizing pressure drop. A brief overview of loop heat pipes with respect to basic fundamentals, construction details, operating principles, and typical operating characteristics is presented in this paper. Finally, the paper presents the current developments in modeling of thermohydraulics and design methodologies of LHPs.

Dynamics of end-to-end loop formation: A flexible chain in the presence of hydrodynamic interaction

Based on the Wilemski-Fixman approach G. Wilemski, M. Fixman, J. Chem. Phys. 60 (1974) 866], we show that, for a flexible chain in theta solvent, hydrodynamic interaction treated with a pre-averaging approximation makes ring closing faster if the chain is not very short. We also show that the ring closing time for a long chain with hydrodynamic interaction in theta solvent scales with the chain length (N) as N-1.5, in agreement with the previous renormalization group calculation based prediction by Freidman and O'Shaughnessy B. Friedman, B. O'Shaughnessy, Phys. Rev. A 40 (1989) 5950]. (C) 2012 Elsevier B.V. All rights reserved.