Filament-wound composite soft tissue prostheses:controlling compliance and strength by water absorption and degradation

This paper deals with the effect of water absorption on the mechanical performance of selectively biodegradable filament-wound composite soft tissue prostheses. It shows how the water absorption phenomenon can be utilized as a new concept of material design, in contrast to the current view that associates moisture absorption by composite materials exclusively with damage. Harnessing water absorption to property design of vascular grafts has two advantages. The first is the controlled increase of the compliance of the graft during healing, aiming to reach a final stage of isocompliance with the host artery. The second is the water-induced biodegradation which enables regulation of the mural porosity during healing of an initially impervious graft. Filament-wound composite vascular prostheses comprising partially biodegradable matrices, different compositions and various winding angles are studied. Water absorption and material degradation are expressed in terms of relative weight gain/loss, which in turn is correlated with changes in the compliance and in the ultimate strength of the grafts.     

Compact and localized distributed data structures

This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the information into small local pieces, or labels , selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The survey concentrates mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and covers complexity results on various applications, focusing on compact localized schemes for message routing in communication networks.Received: August 2001, Accepted: May 2002, Supported in part by a grant from the Israel Science Foundation.     

Expressing the equivalence of non‐isothermal and isothermal heat sterilization processes

Currently, the sterility of heat‐processed food and pharmaceuticals is assessed in terms of an F₀ value, based on the equivalence of the heat treatment to an isothermal process at a reference temperature. This F₀ value, however, has a meaning if, and only if, the inactivation kinetics of the targeted spores (or cells) follow a first‐order relationship and the temperature dependence of the D value, the reciprocal of the rate constant, is log‐linear. There is growing evidence that these conditions are not satisfied by many spores, including those of Clostridium botulinum and vegetative cells. Consequently, a replacement for the F₀ value is proposed in the form of a momentary equivalent time at the reference temperature based on the actual survival pattern of the spores, which need not be log‐linear. This equivalent time can be calculated together with the theoretical survival ratio in real time, thus enabling an operator to monitor the lethality of ongoing industrial heat processes. The concept is demonstrated with published survival data of C. botulinum, for which the Weibullian and log‐logistic models served as primary and secondary models, respectively. The safety factor according to the proposed method is in the number of added minutes of processing, beyond the theoretical time needed to reduce the survival ratio of the targeted spores or cells to a level that would produce practical (or commercial) sterility. Copyright © 2006 Society of Chemical Industry     

The spiritually responsible therapist: Religious material in the psychotherapeutic setting.

There exists a movement within the field of psychology to incorporate religious material into the overall conceptualization and treatment of the client. This article questions the appropriateness of such incorporation and emphasizes instead the distinction the therapist needs to make between religious and psychological material in the psychotherapeutic setting. The therapist must also be aware of how religious material can intensify the transference, resistance, and countertransference, thereby complicating the therapeutic process. Client issues that relate to the religious identity of the therapist or invoke a sense of exclusive similarity in the therapeutic dyad can further complicate the therapy. Such complications suggest that the avoidance of both overt and covert messages that communicate the therapist's personal values and beliefs may be beneficial for therapy. Case examples with 4 clients (aged 18–56 yrs) are presented. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

On the use of the WLF model in polymers and foods.

The validity of the WLF model with fixed "universal" coefficients was tested against that of the model original form with variable coefficients using published coefficients of polymers and amorphous sugars crystallization and viscosity data. The disagreement between the two versions of the model is particularly large at temperature ranges starting about 20 to 30 degrees K above the glass transition or reference temperature, excluding the former from being a model of general applicability. Because the WLF model mathematical structure entails the existence of an almost linear region near the reference temperature, establishment of its validity as a kinetic model and meaningful determination of its constants requires data spread over an extended temperature range, especially when the experimental results have a scatter.     

Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification

This paper introduces the notion of distributed verification without preprocessing. It focuses on the Minimum-weight Spanning Tree (MST) verification problem and establishes tight upper and lower bounds for the time and message complexities of this problem. Specifically, we provide an MST verification algorithm that achieves simultaneously $\tilde{O}(m)$ messages and $\tilde{O}(\sqrt{n} + D)$ time, where m is the number of edges in the given graph G, n is the number of nodes, and D is G’s diameter. On the other hand, we show that any MST verification algorithm must send $\tilde{\varOmega}(m)$ messages and incur $\tilde{\varOmega}(\sqrt{n} + D)$ time in worst case. Our upper bound result appears to indicate that the verification of an MST may be easier than its construction, since for MST construction, both lower bounds of $\tilde{\varOmega}(m)$ messages and $\tilde{\varOmega}(\sqrt{n} + D)$ time hold, but at the moment there is no known distributed algorithm that constructs an MST and achieves simultaneously $\tilde{O}(m)$ messages and $\tilde{O}(\sqrt{n} + D)$ time. Specifically, the best known time-optimal algorithm (using ${\tilde{O}}(\sqrt {n} + D)$ time) requires O(m+n ^3/2) messages, and the best known message-optimal algorithm (using ${\tilde{O}}(m)$ messages) requires O(n) time. On the other hand, our lower bound results indicate that the verification of an MST is not significantly easier than its construction.     

Compact separator decompositions in dynamic trees and applications to labeling schemes

This paper presents an efficient scheme maintaining a separator decomposition representation in dynamic trees using asymptotically optimal labels. In order to maintain the short labels, the scheme uses relatively low message complexity. In particular, if the initial dynamic tree contains only the root, then the scheme incurs an O(log⁴ n) amortized message complexity per topology change, where n is the current number of vertices in the tree. As a separator decomposition is a fundamental decomposition of trees used extensively as a component in many static graph algorithms, our dynamic scheme for separator decomposition may be used for constructing dynamic versions to these algorithms. The paper then shows how to use our dynamic separator decomposition to construct efficient labeling schemes on dynamic trees, using the same message complexity as our dynamic separator scheme. Specifically, we construct efficient routing schemes on dynamic trees, for both the designer and the adversary port models, which maintain optimal labels, up to a multiplicative factor of O(log log n). In addition, it is shown how to use our dynamic separator decomposition scheme to construct dynamic labeling schemes supporting the ancestry and NCA relations using asymptotically optimal labels, as well as to extend a known result on dynamic distance labeling schemes. Supported in part at the Technion by an Aly Kaufman fellowship. Supported in part by a grant from the Israel Science Foundation.     

Honey bees find the shortest path: a collective flow-mediated approach

Artificial Life and Robotics - Honey bees (Apis mellifera L.) are social insects that makes frequent use of volatile pheromone signals to collectively navigate unpredictable and unknown...