Terminally ill patients and volunteer support: Is it the right intervention?

Comments on the article by K. T. Herbst-Damm and J. A. Kulik (see record 2005-02260-012) entitled Volunteer support, marital status, and the survival times of terminally ill patients. Can a simple and low-cost intervention, such as a visit by a volunteer, extend the life of terminally ill patients? The answer, according to a study by Herbst-Damm and Kulik (2005), is yes. When it comes to quality of life, however, the effects of volunteer visits remain murky. Thus, it is critical that we look beyond effects on longevity and assess how such a program would influence quality of life. Extending the life of terminally ill patients might not always a blessing. Prolonging their life might even cause harm, as it can extend unwanted physical and mental suffering. It may also go against some patients' desire to hasten their death. Despite Herbst-Damm and Kulik's important findings, the current author remains unconvinced as to the merits of implementing volunteer visits as an intervention policy. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Assessment of the types of public building maintenance contracts in Saudi Arabia

The study revealed that Fixed Price, Cost Plus and Purchased Labour contracts are the top three maintenance contracts adopted whilst Unit Price, Cost Plus A Percentage Fee contracts are alternatives used in the Kingdom. Some other types of maintenance contract were thought to be inappropriate by ministry departments.     

Greedy hot-potato routing on the two-dimensional mesh

Summary We propose hot-potato (or, deflection) packet routing algorithms on the two-dimensional mesh. The algorithms are strongly greedy in the sense that they attempt to send packets in good directions whenever possible. Furthermore, the routing operations are simple and independent of the time that has elapsed. The first algorithm gives the best evacuation time known for delivering all the packets to their destinations. A batch ofk packets with maximal source-to-destination distanced _max is delivered in 2(k-1)+d _max. The second algorithm improves this bound tok+d _max when all packets are destined to the same node. This also implies a new bound for the multitarget case, which is the first to take into account the number of in-edges of a node. The third algorithm is designed for routing permutations with source-to-destination distance at most three, in which case the algorithm terminates in at most seven steps. We also show a lower bound of five steps for this problem. Ishai Ben-Aroya received the B.A. and M.Sc. in computer science from the Technion (Israel Institute of Technology). He is currently working with Microsoft Israel R&D group. His main interests include Routing Algorithms, Cryptography and Computer Security. Tamar Eilam received the B.A. degree in Computer Science from the Technion IIL in 1995, and is currently studying towards her M.A. degree. Assaf Schuster received his B.A., M.A. and Ph.D. degrees in Computer Science from the Hebrew University of Jerusalem (the last one in 1991). He is currently a lecturer at the Technion IIL. His main interests include Networks and Routing Algorithms, Parallel and Distributed Computation, Optical Computation and Communication, Dynamically Reconfiguring Networks, and Greedy Hot Potato Routing.This work was supported in part by the French-Israeli grant for cooperation in Computer Science, and by a grant from the Israeli Ministry of Science. An extended abstract appeared in proc. 2nd European Symposium on Algorithms, September 1994     

Fusing distributional and experiential information for measuring semantic relatedness

Models of semantic relatedness have usually focused on language-based distributional information without taking into account “experiential data” concerning the embodied sensorial source of the represented concepts. In this paper, we present an integrative cognitive model of semantic relatedness. The model – semantic family resemblance – uses a variation of the co-product as a mathematical structure that guides the fusion of distributional and experiential information. Our algorithm provides superior results in a set expansion task and a significant correlation with two benchmarks of human rated word-pair similarity datasets.     

Improving the SMAC atmospheric correction code by analysis of Meteosat Second Generation NDVI and surface reflectance data

In order to obtain high quality data, the correction of atmospheric perturbations acting upon land surface reflectance measurements recorded by a space-based sensor is an important topic within remote sensing. For many years the Second Simulation of the Satellite Signal in the Solar Spectrum (6S) radiative transfer model and the Simplified Method for Atmospheric Correction (SMAC) codes have been used for this atmospheric correction, but previous studies have shown that in a number of situations the quality of correction provided by the SMAC is low. This paper describes a method designed to improve the quality of the SMAC atmospheric correction algorithm through a slight increase in its computational complexity. Data gathered from the SEVIRI aboard Meteosat Second Generation (MSG) is used to validate the additions to SMAC, both by comparison to simulated data corrected using the highly accurate 6S method and by comparison to in-situ and 6S corrected SEVIRI data gathered for two field sites in Africa. The additions to the SMAC are found to greatly increase the quality of atmospheric correction performed, as well as broaden the range of atmospheric conditions under which the SMAC can be applied. When examining the Normalised Difference Vegetation Index (NDVI), the relative difference between SMAC and in-situ values decreases by 1.5% with the improvements in place. Similarly, the mean relative difference between SMAC and 6S reflectance values decreases by a mean of 13, 14.5 and 8.5% for Channels 1, 2 and 3 respectively. Furthermore, the processing speed of the SMAC is found to remain largely unaffected, with only a small increase in the time taken to process a full SEVIRI scene. Whilst the method described within this paper is only applicable to SEVIRI data, a similar approach can be applied to other data sources than SEVIRI, and should result in a similar accuracy improvement no matter which instrument supplies the original data.     

Shrinking‐horizon dynamic programming

We describe a heuristic control policy for a general finite‐horizon stochastic control problem, which can be used when the current process disturbance is not conditionally independent of the previous disturbances, given the current state. At each time step, we approximate the distribution of future disturbances (conditioned on what has been observed) by a product distribution with the same marginals. We then carry out dynamic programming (DP), using this modified future disturbance distribution, to find an optimal policy, and in particular, the optimal current action. We then execute only the optimal current action. At the next step, we update the conditional distribution, and repeat the process, this time with a horizon reduced by one step. (This explains the name ‘shrinking‐horizon dynamic programming’). We explain how the method can be thought of as an extension of model predictive control, and illustrate our method on two variations on a revenue management problem. Copyright © 2010 John Wiley & Sons, Ltd.     

Scheduling a maintenance activity and due-window assignment on a single machine

We study a single machine scheduling and due-window assignment problem. In addition to the traditional decisions regarding sequencing the jobs and scheduling the due-window, we allow an option for performing a maintenance activity. This activity requires a fixed time interval during which the machine is turned off and no production is performed. On the other hand, after the maintenance time, the machine becomes more efficient, as reflected in the new shortened job processing times. The objective is to schedule the jobs, the due-window and the maintenance activity, so as to minimize the total cost consisting of earliness, tardiness, and due-window starting time and size. We introduce an efficient (polynomial time) solution for this problem.     

Regularizing Flows over Lie Groups

In this paper we discuss regularization of images that take their value in matrix Lie groups. We describe an image as a section in a principal bundle which is a fibre bundle where the fiber (the feature space) is a Lie group. Via the scalar product on the Lie algebra, we define a bi-invariant metric on the Lie-group manifold. Thus, the fiber becomes a Riemannian manifold with respect to this metric. The induced metric from the principal bundle to the image manifold is obtained by means of the bi-invariant metric. A functional over the space of sections, i.e., the image manifolds, is defined. The resulting equations of motion generate a flow which evolves the sections in the spatial-Lie-group manifold. We suggest two different approaches to treat this functional and the corresponding PDEs. In the first approach we derive a set of coupled PDEs for the local coordinates of the Lie-group manifold. In the second approach a coordinate-free framework is proposed where the PDE is defined directly with respect to the Lie-group elements. This is a parameterization-free method. The differences between these two methods are discussed. We exemplify this framework on the well-known orientation diffusion problem, namely, the unit-circle S ¹ which is identified with the group of rotations in two dimensions, SO(2). Regularization of the group of rotations in 3D and 4D, SO(3) and SO(4), respectively, is demonstrated as well.

Online dynamic graph drawing

This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided.