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.     

Application of autoregressive spectral analysis to missing data problems

Time series solutions for spectral analysis in missing data problems use reconstruction of the missing data, or a maximum likelihood approach that analyzes only the available measured data. Maximum likelihood estimation yields the most accurate spectra. An approximate maximum likelihood algorithm is presented that uses only previous observations falling in a finite interval to compute the likelihood, instead of all previous observations. The resulting nonlinear estimation algorithm requires no user-provided initial solution, is suited for order selection, and can give very accurate spectra even if less than 10% of the data remains.     

Finite sample properties of ARMA order selection

The cost of order selection is defined as the loss in model quality due to selection. It is the difference between the quality of the best of all available candidate models that have been estimated from a finite sample of N observations and the quality of the model that is actually selected. The order selection criterion itself has an influence on the cost because of the penalty factor for each additionally selected parameter. Also, the number of competitive candidate models for the selection is important. The number of candidates is, of itself, small for the nested and hierarchical autoregressive/moving average (ARMA) models. However, intentionally reducing the number of selection candidates can be beneficial in combined ARMA(p,q) models, where two separate model orders are involved: the AR order p and the MA order q. The selection cost can be diminished by creating a nested sequence of ARMA(r,r-1) models. Moreover, not evaluating every combination (p,q) of the orders considerably reduces the required computation time. The disadvantage may be that the true ARMA(p,q) model is no longer among the nested candidate models. However, in finite samples, this disadvantage is largely compensated for by the reduction in the cost of order selection by considering fewer candidates. Thus, the quality of the selected model remains acceptable with only hierarchically nested ARMA(r,r-1) models as candidates.     

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)     

It takes two to mimic: Behavioral consequences of self-construals.

The present studies demonstrated the moderation of self-construal orientation on mimicry. Recent research has indicated that an interdependent self-construal is associated with assimilation of the other to the self whereas an independent self-construal is associated with minimizing the influence of others on the self (H. R. Markus & S. Kitayama, 1991; D. Stapel & W. Koomen, 2001). Therefore, the authors hypothesized that an interdependent self-construal would be associated with more mimicry than an independent self-construal. When self-construal orientations were experimentally primed. as in Studies 1 and 2, independent self-construals produced less nonconscious mimicry than interdependent self-construals. When self-construals were examined as cultural differences with either a chronically dominant independent (Americans) or interdependent (Japanese) construal of the self, these results were replicated. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Critical Shear Stress of Bimodal Sediment in Sand-Gravel Rivers

A new model for the critical shear stress and the transport of graded sediment is presented. The model is based on the size distribution of the bed surface and can be used to compute sediment transport rates in numerical simulations with an active layer model. This model makes a distinction between unimodal and bimodal sediments. It is assumed that all size fractions of unimodal sediments have the same critical shear stress while there is selective transport for the gravel fractions of bimodal sediments. A recently published laboratory transport data set is used to calibrate our model.     

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.