Calculating the Thermal Conductivity of Heated Powder Compacts

This work is devoted to the theoretical understanding of the microstructure and thermal conductivity relationships of compacted ceramic powders in the initial, nondensifying stage of sintering. A model based on surface diffusion of vacancies for the growth of the neck between particles is combined with numerical fully three-dimensional code calculations, which solve for the effective heat conductivity coefficient of lightly sintered particles. The predictions of the model are in agreement with experimental observations. The approach presented can be applied to solve a series of related problems, like dielectric properties, with arbitrary microstructure and multicomponent composite of the powders.     

CoRAL: A transparent fault-tolerant web service

The Web is increasingly used for critical applications and services. We present a client-transparent mechanism, called CoRAL, that provides high reliability and availability for Web service. CoRAL provides fault tolerance even for requests being processed at the time of server failure. The scheme does not require deterministic servers and can thus handle dynamic content. CoRAL actively replicates the TCP connection state while maintaining logs of HTTP requests and replies. In the event of a primary server failure, active client connections fail over to a spare, where their processing continues seamlessly. We describe key aspects of the design and implementation as well as several performance optimizations. Measurements of system overhead, failover performance, and preliminary validation using fault injection are presented.     

Incremental application of knowledge to continuously arriving time-oriented data

In our previous work, we introduced a computational architecture that effectively supports the tasks of continuous monitoring and of aggregation querying of complex domain meaningful time-oriented concepts and patterns (temporal abstractions), in environments featuring large volumes of continuously arriving and accumulating time-oriented raw data. Examples include provision of decision support in clinical medicine, making financial decisions, detecting anomalies and potential threats in communication networks, integrating intelligence information from multiple sources, etc. In this paper, we describe the general, domain-independent but task-specific problem-solving method underling our computational architecture, which we refer to as incremental knowledge-based temporal abstraction (IKBTA). The IKBTA method incrementally computes temporal abstractions by maintaining persistence and validity of continuously computed temporal abstractions from arriving time-stamped data. We focus on the computational framework underlying our reasoning method, provide well-defined semantic and knowledge requirements for incremental inference, which utilizes a logical model of time, data, and high-level abstract concepts, and provide a detailed analysis of the computational complexity of our approach.     

Soft syntactic constraints for Arabic–English hierarchical phrase-based translation

In adding syntax to statistical machine translation, there is a tradeoff between taking advantage of linguistic analysis and allowing the model to exploit parallel training data with no linguistic analysis: translation quality versus coverage. A number of previous efforts have tackled this tradeoff by starting with a commitment to linguistically motivated analyses and then finding appropriate ways to soften that commitment. We present an approach that explores the tradeoff from the other direction, starting with a translation model learned directly from aligned parallel text, and then adding soft constituent-level constraints based on parses of the source language. We argue that in order for these constraints to improve translation, they must be fine-grained: the constraints should vary by constituent type, and by the type of match or mismatch with the parse. We also use a different feature weight optimization technique, capable of handling large amount of features, thus eliminating the bottleneck of feature selection. We obtain substantial improvements in performance for translation from Arabic to English.     

Is there more to complicated grief than depression and posttraumatic stress disorder? A test of incremental validity.

There is growing interest in complicated grief reactions as a possible new diagnostic category for inclusion in the Diagnostic and Statistical Manual of Mental Disorders. However, no research has yet shown that complicated grief has incremental validity (i.e., predicts unique variance in functioning). The authors addressed this issue in 2 studies by comparing grief, depression, and posttraumatic stress disorder (PTSD) symptoms with different measures of functioning (interviewer ratings, friend ratings, self-report, and autonomic arousal). The 1st study (N = 73) used longitudinal data collected at 4 and 18 months postloss, and the 2nd study (N = 447) used cross-sectional data collected 2.5-3.5 years postloss. With depression and PTSD controlled, grief emerged as a unique predictor of functioning, both cross-sectionally and prospectively. The findings provide convergent support for the incremental validity of complicated grief as an independent marker of bereavement-related psychopathology. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Losslessness and stability of LDI ladders and filters

The stability of digital ladder filters close in form, via the lossless discrete integrator (LDI) transformation, to doubly terminatedLC Cauer ladder low-pass filters is studied. The LDI transformation does not necessarily map stable analogue into stable digital filters. Necessary and sufficient conditions for these digital filter to be lossless and for a corresponding doubly terminated filter to be stable are given. LDIs are often used in the design of switched capacitor (SC) filters. For this case we provide a threshold sampling rate above which the SC LDI filter retains the stability of the analogue filter. In spite of the stability problem with the LDI mapping, it has been observed that when applied to simulate analogue filters the resulting filter is stable. It can now be argued that, in these cases, other factors in the determination of the sampling rate leads typically to a choice that is also sufficiently above the threshold rate for stability. The theory described is also useful to derive more general digital filters and to perform the design of stable LDI filters exclusively in the Z-plane without reference to analogue prototypes.This work was partly supported by the U.S.-Israel Binational Science Foundation under Grant No. 88-425.     

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