Maximum Cardinality Search for Computing Minimal Triangulations of Graphs

We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: LEX M and MCS. LEX M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that not only recognizes chordality, but also computes a minimal triangulation of an arbitrary graph. MCS simplifies the fundamental concept used in Lex-BFS, resulting in a simpler algorithm for recognizing chordal graphs. The new algorithm MCS-M combines the extension of LEX M with the simplification of MCS, achieving all the results of LEX M in the same time complexity.     

A distributed adverse drug reaction detection system using intelligent agents with a fuzzy recognition‐primed decision model

Discovering unknown adverse drug reactions (ADRs) in postmarketing surveillance as early as possible is highly desirable. Nevertheless, current postmarketing surveillance methods largely rely on spontaneous reports that suffer from serious underreporting, latency, and inconsistent reporting. Thus these methods are not ideal for rapidly identifying rare ADRs. The multiagent systems paradigm is an emerging and effective approach to tackling distributed problems, especially when data sources and knowledge are geographically located in different places and coordination and collaboration are necessary for decision making. In this article, we propose an active, multiagent framework for early detection of ADRs by utilizing electronic patient data distributed across many different sources and locations. In this framework, intelligent agents assist a team of experts based on the well‐known human decision‐making model called Recognition‐Primed Decision (RPD). We generalize the RPD model to a fuzzy RPD model and utilize fuzzy logic technology to not only represent, interpret, and compute imprecise and subjective cues that are commonly encountered in the ADR problem but also to retrieve prior experiences by evaluating the extent of matching between the current situation and a past experience. We describe our preliminary multiagent system design and illustrate its potential benefits for assisting expert teams in early detection of previously unknown ADRs. © 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 827–845, 2007.     

Hippocampal lesions impair memory of short-delay conditioned eye blink in rabbits.

Involvement of hippocampus in short-delay eye blink conditioning was reexamined during conditioned response (CR) consolidation. Rabbits received bilateral hippocampectomy, removal of overlying neocortex, or sham lesions and were trained with tone/puff pairings to early acquisition (consolidation) or well trained (overtraining); retention was tested. Two effects were observed: (1) Rabbits with hippocampal lesions showed less retention in the consolidation experiment than controls. Previous studies may not have found this because initial training was more complete. Overtrained hippocampal rabbits showed more retention, which agrees with this suggestion. (2) Hippocampectomized rabbits showed larger CR amplitudes in the overtraining experiment. The complementary roles of hippocampus in the consolidation process during early learning and in modulating the expression of the amplitude/time course of behavioral CRs after associations are well learned are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Particle Penetration through Inclined and L-Shaped Cracks

This paper presents a particle penetration model predicting particle penetration coefficient (Pp) through a narrow crack of arbitrary incline angles (θ). The objective was to simulate Pp for outdoor-to-indoor particle penetration for residential infiltration conditions. This model assumes laminar infiltration flow and considers particle deposition from both gravitational sedimentation and Brownian diffusion. For micron-sized particles, modeling results indicate that gravitational sedimentation is the major deposition mechanism. Pp increases monotonically with ∣θ∣ because effective particle sedimentation velocity (vs?cos?θ) decreases monotonically with ∣θ∣. For submicron-sized particles (0.1?μm), Brownian diffusion is the major particle deposition mechanism. Because Brownian diffusion is a nondirectional deposition mechanism, crack inclination did not affect Pp. This study applied this model to estimate Pp for L-shaped cracks, and validated modeling results with experiments. Experimental results indicated that inertial impaction and crack entrance cutoff effects were not significant particle deposition mechanisms for the test micron-sized particles. Gravitational sedimentation was the major deposition mechanism. An L-shaped crack can be simulated as the combination of horizontal and vertical sections. This model agreed reasonably with experimental results.     

Two-Dimensional Physical and Numerical Modeling of a Pile-Supported Earth Platform over Soft Soil

This paper focuses on the mechanisms occurring in a granular earth platform over soft ground improved by rigid piles. Two-dimensional physical model experiments were performed using the Schneebeli’s analogical soil to investigate the load transfer mechanisms by arching and the settlement reduction and homogenization. Experimental outputs are compared to results obtained on a numerical model using a plane strain continuum approach. The impact of the constitutive model complexity to simulate the platform material behavior was first assessed, but no large difference was recorded. As far as the proposed model, which takes the main features of the observed behavior satisfactorily into account, the numerical procedure could be validated and the parametric studies extended numerically. Both approaches of this study underlined the main geometrical and geotechnical parameters which should inevitably be taken into account in a simplified design method, namely the capping ratio, the platform height, and the platform material shear strength.     

Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers

A finite recurrent system over sets of natural numbers of dimension n is a pair composed of n n-ary functions over sets of natural numbers and an n-tuple of singleton sets of natural numbers. Every function is applied to the entries of the tuple and computes a set of natural numbers, that may also be empty. The results are composed into another tuple, and the process is started anew. Thus, a finite recurrent system defines an infinite sequence of n-tuples containing sets of natural numbers. The last entry of a generated n-tuple is called the output of a step, and the union of the output sets of all steps is the set defined by the finite recurrent system. Membership problems ask whether a given number is in a specified output set or in some output set. We study membership problems for special finite recurrent systems, whose functions are built from the set operations union, intersection and complementation and the arithmetical operations addition and multiplication. Sum and product of two sets of natural numbers are defined elementwise. We restrict the set of operations from which functions are built and determine the impact on the complexity of the membership problems. We focus on PSPACE-decidable membership problems and show completeness results for the complexity classes NL, NP and PSPACE.     

Hearing the horror: A comment on the final report of the APA Task Force on the Victims of Crime and Violence.

Comments that a critical element in the final report of the American Psychological Association (APA) Task Force on the Victims of Crime and Violence may be lost simply because of the enormity and complexity of the issues involved. The real nature of the victim's emotional experience is often not directly addressed by researchers or service providers in the mental health community. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Some electron microscope observations of longitudinal splitting from surface flaws in Kevlar 29

Journal of Materials Science Letters -     

Representing temporal knowledge in conceptual graphs

This study was motivated by some difficulties encountered by the authors when trying to express temporal knowledge using Sowa's conceptual graph (CG) approach. An overview of Sowa's approach is given and the difficulties encountered when trying to model temporal knowledge are outlined: the disparity of notations allowed by CG theory for expressing temporal information; the ambiguity and incompleteness of tense sspecification; the difficulty of harmonizing tenses and intergraph temporal relations. Various approaches suggested for representing time both in artificial intelligence and linguistics are presented, and an extension to Sowa's approach is proposed in which temporal and nontemporal knowledge are differentiated. In this model points in time are represented as well as time intervals. A semantic interpretation of verbs is provided based on an extension of Reichenbach's model of temporal markers. The authors show how their approach enables the representation of tenses as well as the aspectual properties of natural language sentences.