Effects of observer metamerism in the determination of human color-matching functions

This article addresses the results of the recent North and Fairchild article on observer metamerism. It reports on the results of a different experiment that produced similar results to those of North and Fairchild. The history of observer metamerism is outlined briefly and some possible sources of the large variations in inter-observer matches are suggested. Finally, a plea for a commercially viable special index of metamerism for change in observer is formulated. © 1995 John Wiley & Sons, Inc.     

A comparative study of thin film insulation techniques for gold electrodes

The increasing use of microelectrodes in small sample volumes and biological environments require the use of thin film insulators. The insulating ability of the thin film insulators electrophoretic paint, polyimide, allylphenol phenol copolymer and an epoxy dip coat have been assessed using gold wires coated in the relevant film. Insulation was assessed by recording the current from the wires in a solution of known redox couple. The effect of prolonged storage in aqueous solutions was also investigated. The most successful insulating approach, with regards to insulative ability, prolonged use in aqueous environments and speed of application, was the combination of cathodic electrophoretic paint followed by polyimide.     

Environment as a first class abstraction in multiagent systems

The current practice in multiagent systems typically associates the environment with resources that are external to agents and their communication infrastructure. Advanced uses of the environment include infrastructures for indirect coordination, such as digital pheromones, or support for governed interaction in electronic institutions. Yet, in general, the notion of environment is not well defined. Functionalities of the environment are often dealt with implicitly or in an ad hoc manner. This is not only poor engineering practice, it also hinders engineers to exploit the full potential of the environment in multiagent systems. In this paper, we put forward the environment as an explicit part of multiagent systems.We give a definition stating that the environment in a multiagent system is a first-class abstraction with dual roles: (1) the environment provides the surrounding conditions for agents to exist, which implies that the environment is an essential part of every multiagent system, and (2) the environment provides an exploitable design abstraction for building multiagent system applications. We discuss the responsibilities of such an environment in multiagent systems and we present a reference model for the environment that can serve as a basis for environment engineering. To illustrate the power of the environment as a design abstraction, we show how the environment is successfully exploited in a real world application. Considering the environment as a first-class abstraction in multiagent systems opens up new horizons for research and development in multiagent systems.     

An analysis of lighting energy savings and switching frequency for a daylit corridor under various indoor design illuminance levels

Visual comfort and electric lighting energy issues are essential criteria to justify daylighting schemes. The evaluation of energy efficiency due to daylight linked lighting control systems is best demonstrated by case studies. This paper presents field measurements on daylighting for a fully air-conditioned daylit corridor. Artificial lighting load, brightness of the fluorescent luminaires, daylight availability for various switching illuminance levels were systematically recorded and analyzed. The general features and characteristics of the findings including the number of switching operations and electric-lighting energy savings are presented and discussed. Daylighting theories, using cumulative frequency distribution of outdoor illuminance and regression models based on brightness of light output, outdoor illuminance and electric light power to estimate daylight-linked lighting control savings, have been developed and assessed. It has been found that data from both approaches show reasonably good agreements with measured results. The findings from this study provide some operational and energy information, which would be useful and applicable to other interior spaces with similar architectural designs.     

Multiplicative Operator Splittings in Nonlinear Diffusion: From Spatial Splitting to Multiple Timesteps

Operator splitting is a powerful concept used in many diversed fields of applied mathematics for the design of effective numerical schemes. Following the success of the additive operator splitting (AOS) in performing an efficient nonlinear diffusion filtering on digital images, we analyze the possibility of using multiplicative operator splittings to process images from different perspectives.We start by examining the potential of using fractional step methods to design a multiplicative operator splitting as an alternative to AOS schemes. By means of a Strang splitting, we attempt to use numerical schemes that are known to be more accurate in linear diffusion processes and apply them on images. Initially we implement the Crank-Nicolson and DuFort-Frankel schemes to diffuse noisy signals in one dimension and devise a simple extrapolation that enables the Crank-Nicolson to be used with high accuracy on these signals. We then combine the Crank-Nicolson in 1D with various multiplicative operator splittings to process images. Based on these ideas we obtain some interesting results. However, from the practical standpoint, due to the computational expenses associated with these schemes and the questionable benefits in applying them to perform nonlinear diffusion filtering when using long timesteps, we conclude that AOS schemes are simple and efficient compared to these alternatives.We then examine the potential utility of using multiple timestep methods combined with AOS schemes, as means to expedite the diffusion process. These methods were developed for molecular dynamics applications and are used efficiently in biomolecular simulations. The idea is to split the forces exerted on atoms into different classes according to their behavior in time, and assign longer timesteps to nonlocal, slowly-varying forces such as the Coulomb and van der Waals interactions, whereas the local forces like bond and angle are treated with smaller timesteps. Multiple timestep integrators can be derived from the Trotter factorization, a decomposition that bears a strong resemblance to a Strang splitting. Both formulations decompose the time propagator into trilateral products to construct multiplicative operator splittings which are second order in time, with the possibility of extending the factorization to higher order expansions. While a Strang splitting is a decomposition across spatial dimensions, where each dimension is subsequently treated with a fractional step, the multiple timestep method is a decomposition across scales. Thus, multiple timestep methods are a realization of the multiplicative operator splitting idea. For certain nonlinear diffusion coefficients with favorable properties, we show that a simple multiple timestep method can improve the diffusion process.     

Estimation of foetal brain dose from I-131 in the foetal thyroid

The ingestion of I-131 by pregnant women can have consequences for the developing foetus, in particular brain function. As the foetal thyroid accumulates iodine from the twelfth week of gestation onwards, the determination of foetal brain dose resulting from such I-131 accumulation is essential. Normal dosimetric methods fail to treat the case of foetus. Using an approximation method based on the MIRD approach, a foetal dose estimation scheme is developed to allow the determination of foetal brain dose from foetal thyroid irradiation. Dose values are obtained for the foetus based on the maternal intake of I-131. It was found that the choice of biokinetic model for the mother/foetus has a large impact on the determined dose estimate.     

Path Hitting in Acyclic Graphs

An instance of the path hitting problem consists of two families of paths, and ℋ, in a common undirected graph, where each path in ℋ is associated with a non-negative cost. We refer to and ℋ as the sets of demand and hitting paths, respectively. When p∈ℋ and share at least one mutual edge, we say that p hits q. The objective is to find a minimum cost subset of ℋ whose members collectively hit those of . In this paper we provide constant factor approximation algorithms for path hitting, confined to instances in which the underlying graph is a tree, a spider, or a star. Although such restricted settings may appear to be very simple, we demonstrate that they still capture some of the most basic covering problems in graphs. Our approach combines several novel ideas: We extend the algorithm of Garg, Vazirani and Yannakakis (Algorithmica, 18:3–20, 1997) for approximate multicuts and multicommodity flows in trees to prove new integrality properties; we present a reduction that involves multiple calls to this extended algorithm; and we introduce a polynomial-time solvable variant of the edge cover problem, which may be of independent interest. An extended abstract of this paper appeared in Proceedings of the 14th Annual European Symposium on Algorithms, 2006. This work is part of D. Segev’s Ph.D. thesis prepared at Tel-Aviv University under the supervision of Prof. Refael Hassin.     

The next generation models for crops and agro-ecosystems

Growth in population, decrease in arable land area, and change in climate are endangering our food security. Precision agriculture has the potential to increase crop productivity thorough tailored agricultural practices for different growing areas. Many models of crops and agro-ecosystems capable of predicting interaction between plants and environments have been developed for precision agriculture. Currently, there are several representative categories of crop and agro-ecosystem models, including the de Wi...     

Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks

This paper presents the first hierarchical Byzantine fault-tolerant replication architecture suitable to systems that span multiple wide-area sites. The architecture confines the effects of any malicious replica to its local site, reduces message complexity of wide-area communication, and allows read-only queries to be performed locally within a site for the price of additional standard hardware. We present proofs that our algorithm provides safety and liveness properties. A prototype implementation is evaluated over several network topologies and is compared with a flat Byzantine fault-tolerant approach. The experimental results show considerable improvement over flat Byzantine replication algorithms, bringing the performance of Byzantine replication closer to existing benign fault-tolerant replication techniques over wide area networks.