An investigation into the performance and cost effectiveness of thermosyphon solar water heaters

In this paper, the TRNSYS Simulation Program is used to investigate the monthly and annual solar fraction of a Thermosyphon Solar Water Heater and to evaluate its economic viability in terms of its life cycle savings over a conventional water heating system. The results of the simulation indicate that the yearly solar contribution of the system ranges from 63% for a high hot water consumption profile to 89% for a low consumption pattern. The payback period of the system is as low as 3 years when compared to electric water heating systems. As long as the competitor is diesel oil, the payback period increases to 7–9 years, depending on the hot water consumption profile used.     

Fault-accommodation with intelligent sensors

Optimal sensor fault-accommodation is considered for faults modelled by an increase in measurement noise. This noise is taken to be bounded and its probabilistic properties unknown. It is assumed that intelligent (e.g. self-validating) instrumentation is in use and estimates of the noise bounds are available. The fault-tolerant controller is designed to optimize a noise rejection and a nominal reference tracking index and leads to a mixed norm minimization problem (l₁/l₂). We exploit known results and a particular feedback configuration to show that it is possible to optimize simultaneously without a trade-off the two performance indices. The results are applied to systems where the presence of auxiliary measurements allows for an optimal fault-accommodation strategy. Using properties of the optimal solution, we define a factorization for the optimal controller alternative to the Youla parametrization, leading to an algorithm which is optimal, transparent and efficient.     

Tracking trajectories of the cart-pendulum system

The problem of tracking a periodic trajectory of the well-known cart-pendulum system is solved. After a change of coordinates and a change of feedback, the equations of this system are nonlinear but feedforward. This property is extensively used to carry out for this system the design of uniformly asymptotically stabilizing time-varying state feedbacks by using the forwarding approach.     

An LP-based heuristic procedure for the generalized assignment problem with special ordered sets

The generalized assignment problem with special ordered sets (GAPS2), is the problem of allocating n tasks to m time-periods, where each task must be assigned to a time-period, or shared between two consecutive time-periods. For reasonably large values of m and n the NP-hard combinatorial problem GAPS2 becomes intractable for standard mathematical programming software, hence there is a need for heuristic algorithms to solve such problems. It will be shown how an LP-based heuristic developed previously for the well-established generalized assignment problem can be modified and extended to solve GAPS2. Encouraging results, in terms of speed and accuracy, in particular when compared to an existing heuristic for GAPS2, are described.     

Managing Impressions Online: Self-Presentation Processes in the Online Dating Environment

This study investigates self-presentation strategies among online dating participants, exploring how participants manage their online presentation of self in order to accomplish the goal of finding a romantic partner. Thirty-four individuals active on a large online dating site participated in telephone interviews about their online dating experiences and perceptions. Qualitative data analysis suggests that participants attended to small cues online, mediated the tension between impression management pressures and the desire to present an authentic sense of self through tactics such as creating a profile that reflected their "ideal self," and attempted to establish the veracity of their identity claims. This study provides empirical support for Social Information Processing theory in a naturalistic context while offering insight into the complicated way in which "honesty" is enacted online.     

A wavelet-based procedure for process fault detection

To detect faults in a time-dependent process, we apply a discrete wavelet transform (DWT) to several independently replicated data sets generated by that process. The DWT can capture irregular data patterns such as sharp "jumps" better than the Fourier transform and standard statistical procedures without adding much computational complexity. Our wavelet coefficient selection method effectively balances model parsimony against data reconstruction error. The few selected wavelet coefficients serve as the "reduced-size" data set to facilitate an efficient decision-making method in situations with potentially large-volume data sets. We develop a general procedure to detect process faults based on differences between the reduced-size data sets obtained from the nominal (in-control) process and from a new instance of the target process that must be tested for an out-of-control condition. The distribution of the test statistic is constructed first using normal distribution theory and then with a new resampling procedure called "reversed jackknifing" that does not require any restrictive distributional assumptions. A Monte Carlo study demonstrates the effectiveness of these procedures. Our methods successfully detect process faults for quadrupole mass spectrometry samples collected from a rapid thermal chemical vapor deposition process     

A time aggregation approach to Markov decision processes

We propose a time aggregation approach for the solution of infinite horizon average cost Markov decision processes via policy iteration. In this approach, policy update is only carried out when the process visits a subset of the state space. As in state aggregation, this approach leads to a reduced state space, which may lead to a substantial reduction in computational and storage requirements, especially for problems with certain structural properties. However, in contrast to state aggregation, which generally results in an approximate model due to the loss of Markov property, time aggregation suffers no loss of accuracy, because the Markov property is preserved. Single sample path-based estimation algorithms are developed that allow the time aggregation approach to be implemented on-line for practical systems. Some numerical and simulation examples are presented to illustrate the ideas and potential computational savings.