A general topology-based framework for adaptive insertion of cohesive elements in finite element meshes Large-scale simulation of separation phenomena in solids such as fracture, branching, and fragmentation requires a scalable data structure representation of the evolving model. Modeling of such phenomena can be successfully accomplished by means of cohesive models of fracture, which are versatile and effective tools for computational analysis. A common approach to insert cohesive elements in finite element meshes consists of adding discrete special interfaces (cohesive elements) between bulk elements. The insertion of cohesive elements along bulk element interfaces for fragmentation simulation imposes changes in the topology of the mesh. This paper presents a unified topology-based framework for supporting adaptive fragmentation simulations, being able to handle two- and three-dimensional models, with finite elements of any order. We represent the finite element model using a compact and complete topological data structure, which is capable of retrieving all adjacency relationships needed for the simulation. Moreover, we introduce a new topology-based algorithm that systematically classifies fractured facets (i.e., facets along which fracture has occurred). The algorithm follows a set of procedures that consistently perform all the topological changes needed to update the model. The proposed topology-based framework is general and ensures that the model representation remains always valid during fragmentation, even when very complex crack patterns are involved. The framework correctness and efficiency are illustrated by arbitrary insertion of cohesive elements in various finite element meshes of self-similar geometries, including both two- and three-dimensional models. These computational tests clearly show linear scaling in time, which is a key feature of the present data-structure representation. The effectiveness of the proposed approach is also demonstrated by dynamic fracture analysis through finite element simulations of actual engineering problems.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fragmentation simulation
topological data structure

cohesive zone models (czm)
intrinsic model
extrinsic model


Identification of elastic materials using wavelet transform This paper presents an identification method for material parameters using the observational boundary conditions and the wavelet analysis. The material parameter identification methods which belong to the deterministic approaches are classified into the inverse and direct approaches. The proposed method combines the inverse approach and the direct approach [Swoboda G, Ichikawa Y, Dong Q, Zaki M. Back analysis of large geotechnical models. Int J Numer Meth Geomech 1999;23:145572, Ichikawa Y, Ohkami T. A parameter identification procedure as a dual boundary control problem for linear elastic materials. Soils Foundat 1992;32(2):3544], and by applying the discrete wavelet transform to the system matrix of the iteration equation, we estimate unknown material parameters for the case in which the number of unknown parameters exceeds the observed data. The validity of this method is examined for geotechnical engineering problems. This paper is a revised and extended version of reference [Ohkami T, Nagao J, Koyama S. Parameter identification method using wavelet transform. In: Topping B.H.V., editor, Proceedings of the ninth international conference on civil and structural engineering computing. Civil-Comp Press, Stirling (UK); 2003; Paper 116].

O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O

parameter identification
wavelet transform
back analysis

elastic constants
finite element analysis
ill-posed problems


WAMR: An adaptive wavelet method for the simulation of compressible reacting flow. Part I. Accuracy and efficiency of algorithm The Wavelet Adaptive Multiresolution Representation (WAMR) method provides a robust method for controlling spatial grid adaptation fine grid spacing in regions where a solution varies greatly (i.e., near steep gradients, or near-singularities) and a much coarser grid where the solution varies slowly. Subsequently, a wide range of spatial scales, often demanded in challenging continuum physics problems, can be efficiently captured. Furthermore, the wavelet transform provides a direct measure of local error at each collocation point, effectively producing automatically verified solutions. The method is applied to the solution of unsteady, compressible, reactive flow equations, and includes detailed diffusive transport and chemical kinetics models. Accuracy and performance of the method are examined on several test problems. The sparse grids produced by the WAMR method exhibit an impressive compression of the solution, reducing the number of collocation points used by factors of many orders of magnitude when compared to uniform grids of equivalent resolution.

O O B B O O O O O B I I O O O O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

wavelet
adaptive
compressible reacting flow

newtonian fluid
detailed kinetics
multicomponent diffusion


re-engineering global variables in ada This paper describes one method for identifying global variables in Ada procedures and adding them to the parameter list of appropriate procedures. Global variables, ones that are visible to the entire program, are considered harmful to the maintainability of software systems because of the side effects that can result. A tool has been developed based on the Ada Semantic Interface Specification (ASIS) that can be used to identify global variables and re-engineer Ada procedures. By adding global variables to the parameter lists of appropriate procedures, the variables can be removed from the globally visible data space and introduced into the local declaration space.

O B I O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O


Typing linear algebra: A biproduct-oriented approach Interested in formalizing the generation of fast running code for linear algebra applications, the authors show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category with biproducts. This shifts the traditional view of matrices as indexed structures to a type-level perspective analogous to that of the pointfree algebra of programming. The derivation of fusion, cancellation and abide laws from the biproduct equations makes it easy to calculate algorithms implementing matrix multiplication, the central operation of matrix algebra, ranging from its divide-and-conquer version to its vectorization implementation. From errant attempts to learn how particular products and coproducts emerge from biproducts, not only blocked matrix algebra is rediscovered but also a way of extending other operations (e.g. Gaussian elimination) blockwise, in a calculational style, is found. The prospect of building biproduct-based type checkers for computer algebra systems such as MATLAB (TM) is also considered. (C) 2012 Elsevier B.V. All rights reserved.

O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Adoption of open source software in software-intensive organizations - A systematic literature review Context: Open source software (OSS) is changing the way organizations develop, acquire, use, and commercialize software. Objective: This paper seeks to identify how organizations adopt OSS, classify the literature according to these ways of adopting OSS, and with a focus on software development evaluate the research on adoption of OSS in organizations. Method: Based on the systematic literature review method we reviewed publications from 24 journals and seven conference and workshop proceedings, published between 1998 and 2008. From a population of 24,289 papers, we identified 112 papers that provide empirical evidence on how organizations actually adopt OSS. Results: We show that adopting OSS involves more than simply using OSS products. We moreover provide a classification framework consisting of six distinctly different ways in which organizations adopt OSS. This framework is used to illustrate some of the opportunities and challenges organizations meet when approaching OSS, to show that OSS can be adopted successfully in different ways, and to organize and review existing research. We find that existing research on OSS adoption does not sufficiently describe the context of the organizations studied, and it fails to benefit fully from related research fields. While existing research covers a large number of topics, it contains very few closely related studies. To aid this situation, we offer directions for future research. Conclusion: The implications of our findings are twofold. On the one hand, practitioners should embrace the many opportunities OSS offers, but consciously evaluate the consequences of adopting it in their own context. They may use our framework and the success stories provided by the literature in their own evaluations. On the other hand, researchers should align their work, and perform more empirical research on topics that are important to organizations. Our framework may be used to position this research and to describe the context of the organization they are studying. (C) 2010 Elsevier B.V. All rights reserved.

O O B I I O O B O O B I I O B I I O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B I O O O O O O O O B O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O

open source software
organizations
software development
systematic literature review


Iterative methods for the force-based quasicontinuum approximation: Analysis of a 1D model problem ? Force-based atomistic-continuum hybrid methods are the only known pointwise consistent methods for coupling a general atomistic model to a finite-element continuum model. For this reason, and due to their algorithmic simplicity, force-based coupling methods have become a popular class of atomistic-continuum hybrid models as well as other types of multiphysics models. However, the recently discovered unusual stability properties of the linearized force-based quasicontinuum (QCF) approximation, especially its indefiniteness, present a challenge to the development of efficient and reliable iterative methods. We present analytic and computational results for the generalized minimal residual (GMRES) solution of the linearized QCF equilibrium equations. We show that the GMRES method accurately reproduces the stability of the force-based approximation and conclude that an appropriately preconditioned GMRES method results in a reliable and efficient solution method.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O

atomistic-to-continuum coupling
quasicontinuum method


Mediated social touch: a review of current research and future directions In this paper, we review research and applications in the area of mediated or remote social touch. Whereas current communication media rely predominately on vision and hearing, mediated social touch allows people to touch each other over a distance by means of haptic feedback technology. Overall, the reviewed applications have interesting potential, such as the communication of simple ideas (e.g., through Hapticons), establishing a feeling of connectedness between distant lovers, or the recovery from stress. However, the beneficial effects of mediated social touch are usually only assumed and have not yet been submitted to empirical scrutiny. Based on social psychological literature on touch, communication, and the effects of media, we assess the current research and design efforts and propose future directions for the field of mediated social touch.

O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I

physical contact
interpersonal interaction
literature review
computer mediated communication


Resource-based striping: An efficient striping strategy for video servers using heterogeneous disk-subsystems In building a large-scale video server, it is highly desirable to use heterogeneous disk-subsystems for the following reasons. First, existing disks may fail, especially in an environment with a large number of disks, enforcing the use of new disks. Second, for a scalable server, to cope with the increasing demand of customers, new disks may be needed to increase the server's storage capacity and throughput. With rapid advances in the performance of disks, the newly added disks generally have a higher data transfer rate and a larger storage capacity than the disks originally in the system. In this paper, we propose a novel striping scheme, termed as resource-based striping (RBS), for video servers built on heterogeneous disks. RBS combines the techniques of wide striping and narrow striping so that it can obtain the optimal stripe allocation and efficiently utilize both the I/O bandwidth and storage capacity of all disks. RBS is suitable for applications whose files are not updated frequently, such as course-on-demand and movie-on-demand. We examine the performance of RBS via simulation experiments. Our results show that RBS greatly outperforms the conventional striping schemes proposed for video servers with heterogeneous or homogeneous disks, in terms of the number of simultaneous streams supported and the number of files that can be stored.

O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multimedia storage
video-on-demand
data striping
heterogeneous disk-subsystems


Modified big-M method to recognize the infeasibility of linear programming models This paper provides an effective modification to the big-M method which leads to reducing the iterations of this method, when it is used to recognize the infeasibility of linear systems.

O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

simplex algorithm
big-m method
artificial variables


The solution to an elliptic partial differential equation for facilitating exact volume integral transformation in the 3D BEM analysis In the direct boundary element method (BEM), the body-force or its equivalence will reveal itself as a volume integral that shall destroy the important notion of boundary discretisation. For resolving this issue, the most elegant approach would be to analytically transform the volume integral to boundary ones. In the process of such attempt for 3D anisotropic elastostatics, the key lies in analytically formulating the fundamental solution to a partial differential equation. In this paper, the partial differential equation is presented in an elliptic form, followed by formulating its analytical solution. In the BEM analysis, the formulated solution will be a key part to the success of performing exact volume-to-surface integral transformation.

O O O O O B I I O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

partial differential equation
exact volume integral transformation

boundary element analysis
3d anisotropic elasticity
body-force effect


Approximately optimal trees for group key management with batch updates We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost effective than individual rekeying. One model for batch rekeying is to assume that every user has probability p, of being replaced by a new user during a batch period with the total number of users unchanged. Under this model, it was recently shown that an optimal key tree can be constructed in linear time when p is a constant and in O(n(4)) time when p -> 0. In this paper, we investigate more efficient algorithms for the case p -> 0, i.e., when membership changes are sparse. We design an O(n) heuristic algorithm for the sparse case and show that it produces a nearly 2-approximation to the optimal key tree. Simulation results show that its performance is even better in practice. We also design a refined heuristic algorithm and show that it achieves an approximation ratio of 1 + is an element of for any fixed is an element of > 0 and n, as p -> 0. Finally, we give another approximation algorithm for any p is an element of (0, 0.693) which is shown to be quite good by our simulations. (C) 2008 Elsevier B.V. All rights reserved.

O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

key trees
batch update
approximation algorithms
optimality


Computational grading of hepatocellular carcinoma using multifractal feature description Cancer grading has become an important topic in the field of image interpretation-based computer aided diagnosis systems. This paper proposes a novel feature descriptor to observe the characteristics of histopathological textures in a discriminative manner. The proposed feature descriptor utilizes fractal geometric analysis with four multifractal measures to construct an eight dimensional feature space. The proposed method employed a bag-of-feature-based classification model to discriminate a set of hepatocellular carcinoma images into five categories according to Edmondson and Steiner's grading system. Three feature selection methods were utilized to obtain the most discriminative features of codeword dictionary (codebook). Furthermore, we incorporated four other textural feature descriptors: Gabor-filters, LM-filters, local binary patterns, and Haralick, to obtain a benchmark of the accuracy of the classification. Two experiments were performed: (i) classifying non-neoplastic tissues and tumors and (ii) grading the hepatocellular carcinoma images into five classes. Experimental results indicated the significance of the multifractal features for describing the histopathological image texture because it outperformed other four feature descriptors. We graded a given ROI image by defining a threshold-based majority-voting rule and obtained an average correct classification rate around 95% for five classes classification.

O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multifractal measures
feature selection
cancer grading

fractal geometry
multifractal computation
textural feature descriptor
hcc histopathological images


The impact of technological advances on recording studio practices Since the invention of sound reproduction in the late 19th century, studio practices in musical recording evolved in parallel with technological improvements. Recently, digital technology and Internet file sharing led to the delocalization of professional recording studios and the decline of traditional record companies. A direct consequence of this new paradigm is that studio professions found themselves in a transitional phase, needing to be reinvented. To understand the scope of these recent technological advances, we first offer an overview of musical recording culture and history and show how studio recordings became a sophisticated form of musical artwork that differed from concert representations. We then trace the economic evolution of the recording industry through technological advances and present positive and negative impacts of the decline of the traditional business model on studio practices and professions. Finally, we report findings from interviews with six world-renowned record producers reflecting on their recording approaches, the impact of recent technological advances on their careers, and the future of their profession. Interviewees appreciate working on a wider variety of projects than they have in the past, but they all discuss trade-offs between artistic expectations and budget constraints in the current paradigm. Our investigations converge to show that studio professionals have adjusted their working settings to the new economic situation, although they still rely on the same aesthetic approaches as in the traditional business model to produce musical recordings.

O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Novel insights into the structural requirements for the design of selective and specific aldose reductase inhibitors Aldose reductase (ALR2) plays a vital role in the etiology of long-term diabetic microvascular complications (DMCs) such as retinopathy, nephropathy and neuropathy. It initializes the polyol pathway and under hyperglycemic conditions, catalyzes the conversion of glucose into sorbitol in the presence of NADPH. Many ALR2 inhibitors have been withdrawn from clinical trial studies due to their cross reactivity with other analogues enzymes or due to impairment with detoxification role of ALR2. To address these issues we characterized the possible rationalities behind the selectivity problem associated with the enzyme-inhibitor interactions. Novel molecules were designed for the induce fit cavity region of ALR2. Docking studies were carried out using Glide to analyze the binding affinity of the designed molecules for ALR2. The analysis showed that the designed ALR2 inhibitors are selective for ALR2 over its close analogs. These inhibitors are also specific for the induced cavity region of ALR2 and do not interfere with the detoxification role of ALR2.

O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O B O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B B O O O O O O O O O O O O O O O O B O O O O O O B O O O O B O O O O O O O O O O O O O O O B O O O O O O B O O B


Vision based target tracking and collision avoidance for mobile robots A real-time object tracking and collision avoidance method is presented for mobile robot navigation in indoors environments using stereo vision and a laser sensor. Stereo vision is used to identify the target and to calculate its relative distance from the mobile robot while laser based range measurements are utilized to avoid collision with surrounding objects. The target is tracked by its predetermined or dynamically defined color. The mobile robot's velocity is dynamically adjusted according to its distance from the target. Experimental results in indoor environments demonstrate the effectiveness of the method.

O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

moving target tracking
vision based navigation


The construction of viewpoint aspect: the imperfective revisited This paper argues for a constructionist approach to viewpoint Aspect by exploring the idea that it does not exert any altering force on the situation-aspect properties of predicates. The proposal is developed by analyzing the syntax and semantics of the imperfective, which has been attributed a coercer role in the literature as a de-telicizer and de-stativizer in the progressive, and as a de-eventivizer in the so-called ability (or attitudinal) and habitual readings. This paper proposes a unified semantics for the imperfective, preserving the properties of eventualities throughout the derivation. The paper argues that the semantics of viewpoint aspect is encoded in a series of functional heads containing interval-ordering predicates and quantifiers. This richer structure allows us to account for a greater amount of phenomena, such as the perfective nature of the individual instantiations of the event within a habitual construction or the nonculminating reading of perfective accomplishments in Spanish. This paper hypothesizes that nonculminating accomplishments have an underlying structure corresponding to the perfective progressive. As a consequence, the progressive becomes disentangled from imperfectivity and is given a novel analysis. The proposed syntax is argued to have a corresponding explicit morphology in languages such as Spanish and a nondifferentiating one in languages such as English; however, the syntax-semantics underlying both of these languages is argued to be the same.

O O O O B O B O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O B B O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

aspect imperfective perfective progressive


Calculation of end-turn leakage inductances of electrical machines using the edge element method The end-film leakage inductances of the armature winding of the permanent magnet motor have been calculated. In order to describe the magnetic field distribution the edge element method using vector magnetic potential has been applied First; the formulae that describe the total self-inductance and total mutual conductance for phase windings are presented. Three-dimensional and two-dimensional formulations are considered. The end-turn leakage inductances have been obtained by comparing the results of these formulations. The symmetrical components transformation has been applied, and the self inductances and mutual inductances have been transformed into the zero-sequence and positive-sequence inductances. The calculations have been performed for different dimensions of the coil-end region. The influence of the position of the boundary surfaces on the results has been investigated.

O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

finite element method
electromagnetics
electrical machine
magnet motors


retrieving highly dynamic widely distributed information Wide area networks provide a variety of information sources which can be exploited only by appropriate information retrieval techniques such as repeated automatic query of remote databases and bulletin boards. Distinctive features of the content and access methods of information on wide area nets are discussed from an IR perspective. The development, algorithms, and analysis of a functioning system are also presented.

O O B O B O O O O O O O O O O O O O O O O O B I O O O O O B O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O

analysis
dynamic
distributed
access
information retrieval
query

network contention method systems developer algorithm feature informal database


Measuring Outcomes in PAH Pulmonary arterial hypertension (PAH) has poor prognosis in systemic sclerosis (SSc), and at present the gold standard for diagnosis and follow-up of PAH in SSc is right heart catheterization (RHC) but it would be very useful to have a noninvasive way to follow these patients. Using the OMERACT criteria for validation of measures of response, the only fully validated measure for PAH in SSc has been the 6-min walking test. Multiple other measures are particularly valid (e.g., echocardiography, brain natriuretic protein [BNP], FV/DLCO) while a few are unlikely ever to be validated for various reasons (e.g., symptoms, MRA). A Delphi exercise among 78 experts (EPOSS) has been done and has developed a consensus document consisting of eight domains (lung vascular/PAP, exercise capacity, cardiac function, dyspnea, discontinuation of treatment, quality of life, lung parenchymal, and global state), which can be used and must be tested

O O O O B I I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

pulmonary arterial hypertension
systemic sclerosis


complexity-reduced adaptive opportunistic spatial division multiple access for downlink with close-loop control Future wireless communication systems are required to support extremely high speed packet data transmission. Multiple antennas and multi-user packet scheduling are two promising techniques to achieve this target with limited available spectrum resource in PHY layer and MAC layer, respectively. One interesting synergy of these two is the opportunistic beamforming method proposed in [1]. Unlike traditional deterministic beamforming method where the beams are generated pointing to a designated user, beams are generated randomly in opportunistic beamforming method. By reporting the resultant channel gain, one user who opportunistically fall into the main lobe will be scheduled. However, the original method only generates one random beam so that large part of spatial resource is wasted. Later in [2], the author proposed to generate multiple random beams so that opportunistic spatial division multiple access (SDMA) is possible. However, there are always n T number of scheduled users which is not necessary optimal due to variation of channel condition. On the other hand, the adaptive method proposed in [3] can properly adjust the number of scheduled users, however, with large amount of feedback information. This paper propose a new complex reduced adaptive method by utilization of time-correlation of resultant fading channel. In particular, the number of scheduled users will be tuned by a close-loop control procedure between the base station and mobile users over different scheduling intervals. Simulation results show that proposed method can perform quite close to optimal method with tremendous reduction of feedback information.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

random beamforming
close-loop contral
user scheduling


Gray-level grouping (GLG): An automatic method for optimized image contrast enhancement - Part I: The basic method Contrast enhancement has an important role in image processing applications. Conventional contrast enhancement techniques either often fail to produce satisfactory results for a broad variety of low-contrast images, or cannot be automatically applied to different images, because their parameters must be specified manually to produce a satisfactory result for a given image. This paper describes a new automatic method for contrast enhancement. The basic procedure is to first group the histogram components of a low-contrast image into a proper number of bins according to a selected criterion, then redistribute these bins uniformly over the grayscale, and finally ungroup the previously grouped gray-levels. Accordingly, this new technique is named gray-level grouping (GLG). GLG not only produces results superior to conventional contrast enhancement techniques, but is also fully automatic in most circumstances, and is applicable to a broad variety of images. An extension of GLG, selective GLG (SGLG), and its variations will be discussed in Part II of this paper. SGLG selectively groups and ungroups histogram components to achieve specific application purposes, such as eliminating background noise, enhancing a specific segment of the histogram, and so on. The extension of GLG to color images will also be discussed in Part II.

O O O O O O O O O B I O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O


Uplink-downlink duality via minimax duality The sum capacity of a Gaussian vector broadcast channel is the saddle point of a minimax Gaussian mutual information expression where the maximization is over the set of transmit covariance matrices subject to a power constraint and the minimization is over the set of noise covariance matrices subject to a diagonal constraint. This sum capacity result has been proved using two different methods, one based on decision-feedback equalization and the other based on a duality between uplink and downlink channels. This paper illustrates the connection between the two approaches by establishing that uplink-downlink duality is equivalent to Lagrangian duality in minimax optimization. This minimax Lagrangian duality relation allows the optimal transmit covariance and the least-favorable-noise covariance matrices in a Gaussian vector broadcast channel to be characterized in terms of the dual variables. In particular, it reveals that the least favorable noise is not unique. Further, the new Lagrangian interpretation of uplink-downlink duality allows the duality relation to be generalized to Gaussian vector broadcast channels with arbitrary linear constraints. However, duality depends critically on the linearity of input constraints. Duality breaks down when the input constraint is an arbitrary convex constraint. This shows that the minimax representation of the broadcast channel sum capacity is more general than the uplink-downlink duality representation.

O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O

broadcast channel
lagrangian duality
minimax optimization

multiple-input multiple-output (mimo)
multiple-access channel
multi pie-antenna


SENSITIVITY ANALYSIS OF FUZZY SQUARE TRANSITIVE MATRICES AND THEIR APPLICATIONS We consider the problem of possible changes of a single membership value in the entry of a square fuzzy matrix, without loosing the preassumed transitivity. This problem is called sensitivity analysis and is presented for decomposable and max-min transitive fuzzy matrices. Exemplary applications are also discussed in the context of the fuzzy discrete optimization.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O B I O O O O O O O O O O O O O O O O O O O O B I I

transitivity
sensitivity analysis
fuzzy discrete optimization


circuit-level modeling for concurrent testing of operational defects due to gate oxide breakdown As device sizes shrink and current densities increase, the probability of device failures due to gate oxide breakdown (OBD) also increases. To provide designs that are tolerant to such failures, we must investigate and understand the manifestations of this physical phenomenon at the circuit and system level. In this paper, we develop a model for operational OBD defects, and we explore how to test for faults due to OBD. For a NAND gate, we derive the necessary input conditions that excite and detect errors due to OBD defects at the gate level. We show that traditional pattern generators fail to exercise all of these defects. Finally, we show that these test patterns can be propagated and justified for a combinational circuit in a manner similar to traditional ATPG.

O O O O O O O O O O O O O O B O O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O B O O O O O O O O O B O O O O O O O O O O O O O B O O O O O B O O O O O O O O O O O O B O O O B O O O O O O O O O B O O O O O O O O B I O O O O O O O

combinational circuit
input
test
device
exercise
probability
physical
model
paper
errors
pattern

systems design concurrency fault failure exploration circuits


software development Software development has emerged as a critical bottleneck in the human use of automatic data processing. Beginning with ad hoc, heuristic methods of design and implementation of software systems, problems of software maintenance and changes have become unexpectedly large. It is contended that improvement is possible only with more rigor in software design and development methodology. Rigorous software design should survive its implementation and be the basis for further evolution. Software development should be done incrementally, in stages with continuous user participation and replanning, and with design to cost programming within each stage.

B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O B I I I O O O

software maintenance
design to cost programming
software development
software design


an improved algorithm to accelerate regular expression evaluation Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. While deterministic finite automata (DFAs) allow this operation to be performed in linear time, they may exhibit prohibitive memory requirements. In [9], Kumar et al. propose Delayed Input DFAs (D 2 FAs), which provide a trade-off between the memory requirements of the compressed DFA and the number of states visited for each character processed, which corresponds directly to the memory bandwidth required to evaluate regular expressions. In this paper we introduce a general compression technique that results in at most 2N state traversals when processing a string of length N. In comparison to the D 2 FA approach, our technique achieves comparable levels of compression, with lower provable bounds on memory bandwidth (or greater compression for a given bandwidth bound). Moreover, our proposed algorithm has lower complexity, is suitable for scenarios where a compressed DFA needs to be dynamically built or updated, and fosters locality in the traversal process. Finally, we also describe a novel alphabet reduction scheme for DFA-based structures that can yield further dramatic reductions in data structure size.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


developing business object models with patterns and ontologies We propose a new approach for developing Business Object Model (BOMs). The approach uses ontologies to unify the representation and integration of knowledge from analysis patterns with different structures.

O B I I O O O B O O O O O O O O O O O O O O B O O O O O O O O O B I O O O

business object models
analysis patterns
ontologies


Multi-models adaptive control systems A multiple models adaptive control system will be presented. The advantages of this system with respect to the classical multi-model control will be illustrated on a level control system with nonlinear model plant. A recently recursive methods in open and close-loop identification and a R-S-T controller design has been proposed to improve the performances in the adaptive control scheme. The real time experimental results confirm the opportunity of using the multi-models adaptive control architecture in the case when the plant model has a typical large parameter variation.

O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O


Ranking Factors in Peer-to-Peer Overlay Networks A large number of peer processes are distributed in a peer-to-peer (P2P) overlay network. It is difficult, maybe impossible for a peer to perceive the membership and location of every resource object due to the scalability and openness of a P2P network. In this article, we discuss a fully distributed P2P system where there is no centralized controller. Each peer has to obtain service information from its acquaintance peers and also send its service information to the acquaintance peers. An acquaintance peer of a peer p is a peer about whose service the peer p knows and with which the peer p can directly communicate in an overlay network. Some acquaintance peer might hold obsolete service information and might be faulty. Each peer has to find a more trustworthy one among acquaintance peers. There are many discussions on how to detect peers that hold a target object. However, a peer cannot manipulate an object without being granted access rights (permissions). In addition to detecting what peers hold a target object, we have to find peers granted access rights to manipulate the target object. The trustworthiness of each acquaintance is defined in terms of the satisfiability and ranking factor in this article. The satisfiability of an acquaintance peer shows how much each peer can trust the acquaintance peer through direct communication to not only detect target objects but also obtain their access rights. On the other hand, the ranking factor of an acquaintance peer indicates how much the acquaintance peer is trusted only by trustworthy acquaintance peers which is different from the traditional reputation concept. We evaluate how the trustworthiness of an acquaintance peer is changed through interactions among peers in a detection algorithm.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B O B I O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O

ranking factor
satisfiability
trustworthiness

reliability
security
p2p overlay networks
acquaintances


Can ISPs and P2P users cooperate for improved performance? Peer-to-peer (P2P) systems, which are realized as overlays on top of the underlying Internet routing architecture, contribute a significant portion of today's Internet traffic. While the P2P users are a good source of revenue for the Internet Service Providers (ISPs), the immense P2P traffic also poses a significant traffic engineering challenge to the ISPs. This is because P2P systems either implement their own routing in the overlay topology or may use a P2P routing underlay [1], both of which are largely independent of the Internet routing. and thus impedes the ISP's traffic engineering capabilities. On the other hand, P2P users are primarily interested in finding their desired content quickly, with good performance. But as the P2P system has no access to the underlying network, it either has to measure the path performance itself or build its overlay topology agnostic of the underlay. This situation is disadvantageous for both the ISPs and the P2P users. To overcome this, we propose and evaluate the feasibility of a solution where the ISP offers an "oracle" to the P2P users. When the P2P user supplies the oracle with a list of possible P2P neighbors, the oracle ranks them according to certain criteria, like their proximity to the user or higher bandwidth links. This can be used by the P2P user to choose appropriate neighbors, and therefore improve its performance. The ISP can use this mechanism to better manage the immense P2P traffic, e.g., to keep it inside its network, or to direct it along a desired path. The improved network utilization will also enable the ISP to provide better service to its customers.

O O O B O O O O B O B O O O O O O O O O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O B O O O O O O O O B B O O O O O O O O O O O B O O O O O O O O O O O O B O O O O O O O O O O O O B O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B O O O O O B O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O

design
experimentation
management
cooperation
biased neighbor selection


parallel symbolic execution for structural test generation Symbolic execution is a popular technique for automatically generating test cases achieving high structural coverage. Symbolic execution suffers from scalability issues since the number of symbolic paths that need to be explored is very large (or even infinite) for most realistic programs. To address this problem, we propose a technique, Simple Static Partitioning , for parallelizing symbolic execution. The technique uses a set of pre-conditions to partition the symbolic execution tree, allowing us to effectively distribute symbolic execution and decrease the time needed to explore the symbolic execution tree. The proposed technique requires little communication between parallel instances and is designed to work with a variety of architectures, ranging from fast multi-core machines to cloud or grid computing environments. We implement our technique in the Java PathFinder verification tool-set and evaluate it on six case studies with respect to the performance improvement when exploring a finite symbolic execution tree and performing automatic test generation. We demonstrate speedup in both the analysis time over finite symbolic execution trees and in the time required to generate tests relative to sequential execution, with a maximum analysis time speedup of 90x observed using 128 workers and a maximum test generation speedup of 70x observed using 64 workers.

B B I O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O B I O O O O O O O O B I O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

parallel
symbolic execution
java pathfinder


Analysis of left censored data from the generalized exponential distribution The generalized exponential distribution proposed by Gupta and Kundu [Gupta, R.D and Kundu, D., 1999, Generalized exponential distributions. Australian and New Zealand Journal of Statistics, 41(2), 173-188.] is an important lifetime distribution in survival analysis. In this paper, we consider the maximum likelihood estimation procedure of the parameters of the generalized exponential distribution when the data are left censored. We obtain the maximum likelihood estimators of the unknown para-meters and the Fisher information matrix. Simulation studies are carried out to observe the performance of the estimators in small sample.

O O O O O O O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O B I I O O O O O O O O O B O O O O O O O O B I O O O O O O O O O O O O O O O O

fisher information
generalized exponential distribution
maximum


A model of the leakage in the frequency domain and its application to CPA and DPA This paper introduces a leakage model in the frequency domain to enhance the efficiency of side channel attacks of CMOS circuits. While usual techniques are focused on noise removal around clock harmonics, we show that the actual leakage is not necessary located in those expected bandwidths as experimentally observed by Mateos and Gebotys (A new correlation frequency analysis of the side channel, p 4, 2010). We start by building a theoretical modeling of power consumption and electromagnetic emanations before deriving from it a criterion to guide standard attacks. This criterion is then validated on real experiments, both on FPGA and ASIC, showing an impressive increase of the yield of SCA.

O O O O O O O B I O O O O B O B O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B

sca
dpa
cpa
leakage model
frequency domain


Linear optimization problem constrained by fuzzy max-min relation equations Fang and Li introduced the optimization model with a linear objective function and constrained by fuzzy max-min relation equations. They converted this problem into a 0-1 integer programming problem and solved it using the jump-tracking branch-and-bound method. Subsequently, Wu et al. improved this method by providing an upper bound on the optimal objective value and presented three rules for simplifying the computation of an optimal solution. This work presents new theoretical results concerning this optimization problem. They include an improved upper bound on the optimal objective value, improved rules for simplifying the problem and a rule for reducing the solution tree. Accordingly, an accelerated approach for finding the optimal objective value is presented, and represents an improvement on earlier approaches. Its potential applications are discussed. (C) 2011 Elsevier Inc. All rights reserved.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

branch-and-bound method
fuzzy relations
fuzzy relation equations
max-min composition


Charging effects in CdSe nanocrystals embedded in SiO2 matrix produced by rf magnetron sputtering Charging effects in CdSe nanocrystals embedded in SiO2 matrix fabricated by rf magnetron co-sputtering technique were electrically characterized by means of capacitancevoltage (CV) combined with currentvoltage (IV). The presence of CdSe nanocrystals was demonstrated by X-ray diffraction technique. The average size of nanocrystals was found to be approximately 3nm. The carriers transport in the CdSe/SiO2 structure was shown to be a combination of FowlerNordheim tunnelling and PooleFrenkel mechanisms. A memory effect was demonstrated and a retention time was measured.

O O O B B O O B O O O O O O O O O B B O O B O O O O O O O O O O O O O O O O O O O O O O B B O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


A high-order tangential basis algorithm for electromagnetic scattering by curved surfaces We describe, analyze, and demonstrate a high-order spectrally accurate surface integral algorithm for simulating time-harmonic electromagnetic waves scattered by a class of deterministic and stochastic perfectly conducting three-dimensional obstacles. A key feature of our method is spectrally accurate approximation of the tangential surface current using a new set of tangential basis functions. The construction of spectrally accurate tangential basis functions allows a one-third reduction in the number of unknowns required compared with algorithms using non-tangential basis functions. The spectral accuracy of the algorithm leads to discretized systems with substantially fewer unknowns than required by many industrial standard algorithms, which use, for example, the method of moments combined with fast solvers based on the fast multipole method. We demonstrate our algorithm by simulating electromagnetic waves scattered by medium-sized obstacles (diameter up to 50 times the incident wavelength) using a direct solver (in a small parallel cluster computing environment). The ability to use a direct solver is a tremendous advantage for monostatic radar cross section computations, where thousands of linear systems, with one electromagnetic scattering matrix but many right hand sides (induced by many transmitters) must be solved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Complexity bounds in elimination theory - A survey This paper is devoted to some last algorithmic progress in classical elimination theory from the complexity point of view. These results will be presented as a short survey (without proofs) treating essentially upper and lower bounds problems. The first aim of this paper is to show that the upper bounds results - as much progress as they may represent - seem not to solve satisfactorily the basic problems we are considering. On the other hand we shall also show how both the improvement of general algorithms and the research of lower bounds are related to certain mathematical tools as duality theory or arithmetic intersection theory.

B O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Role modelsimplementation-based approaches to using roles A role of an entity can be defined as the set of properties that are important for an object in order to behave in a certain way, as expected by a set of other objects. A role model is a software that specifies a style of designing and implementing roles. This paper evaluates roles in the context of modeling dynamic systems by examining its foundations, surveying the recent role models available for academic use and giving implementation examples. Copyright 2010 John Wiley & Sons, Ltd.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O

instance-level specialization
object-level inheritance


Organizational Factors Associated With Decreased Mortality Among Veterans Affairs Patients With an ICU Stay In-hospital mortality rates associated with an ICU stay are high and vary widely among units. This variation may be related to organizational factors such as staffing patterns, ICU structure, and care processes. We aimed to identify organizational factors associated with variation in in-hospital mortality for patients with an ICU stay. This was a retrospective observational cross-sectional study using administrative data from 34 093 patients from 171 ICUs in 119 Veterans Health Administration hospitals. Staffing and patient data came from Veterans Health Administration national databases. ICU characteristics came from a survey in 2004 of ICUs within the Veterans Health Administration. We conducted multilevel multivariable estimation with patient-, unit-, and hospital-level data. The primary outcome was in-hospital mortality. Of 34 093 patients, 2141 (6.3%) died in the hospital. At the patient level, risk of complications and having a medical diagnosis were significantly associated with a higher risk of mortality. At the unit level, having an interface with the electronic medical record was significantly associated with a lower risk of mortality. The finding that electronic medical records integrated with ICU information systems are associated with lower in-hospital mortality adds support to existing evidence on organizational characteristics associated with in-hospital mortality among ICU patients.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

electronic record
hospital organization
in-hospital mortality
intensive care


identifying commented passages of documents using implicit hyperlinks This paper addresses the issue of automatically selecting passages of blog posts using readers' comments. The problem is difficult because: (i) the textual content of blogs is often noisy, (ii) comments do not always target passages of the posts and, (iii) comments are not equally useful for identifying important passages. We have developed a system for selecting commented passages which takes as input blog posts and their comments and delivers, for each post, the sentences of the post which are the most commented and/or the most discussed. Our approach combines three steps to identify commented passages of a post. The first step is to remove the complexity of processing the contents of posts and comments using heuristics adapted to the language of the blog. The second step is to find useful comments and assigns them a degree of relevance using a model automatically built and validated by an expert. The third step is to identify important passages using relevant comments. We conducted two experiments to evaluate the usefulness and the effectiveness of our approach. The first study show that in only 50\% of the posts, the most commented sentence elicited by our approach corresponds to the post extract generated using generic summarization. In the second study, human participants confirmed that, in practice, selected passages are frequently commented passages.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

weblogs
passage extraction
implicit links


Two-color microarray experiments - Technology and sources of variance Objectives: Microarray gene expression experiments have a complex technical background. Knowledge about certain technical details is inevitable to judge alternatives for both experimental design and analysis. Here, we introduce the necessary details for the so-called two-color microarray experiments and review major sources of technical variance. Methods: We follow the sequence of experimental steps during a typical two-color microarray gene expression experiment, stressing decisive points in the choice of technique, experimental handling and biophysical basics. We point out where technical variation is to be expected. Results: Tissue storage, RNA extraction techniques, as well as the microarray hybridization represent major components of technical variance to be considered. Depending on the possibilities for access to the biomedical material under investigation, choice of amplification and labeling techniques can also be decisive to avoid additional technical variance. The two-color microarray experimental approach seeks to avoid a group of probe-level technical biases making use of the advantages of an incomplete block-design. Conclusions: It is worth to know the major sources of technical variance during the typical experimental sequence, both for choice of experimental design and techniques of molecular biology, as well as for the understanding of quality control and normalization approaches. Here, early investments pay at the level of reduced technical variance, allowing for enhanced detection levels for the effects under investigation.

O B O O O O O O O O B B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O B I O O O O O O O O O O O O B B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O

gene expression
microarray
technical variance


Spatiotemporal selective extrapolation for 3-D signals and its applications in video communications In this paper, we derive a spatiotemporal extrapolation method for 3-D discrete signals. Extending a discrete signal beyond a limited number of known samples is commonly referred to as discrete signal extrapolation. Extrapolation problems arise in many applications in video communications. Transmission errors in video communications may cause data losses which are concealed by extrapolating the surrounding video signal into the missing area. The same principle is applied for TV logo removal. Prediction in hybrid video coding is also interpreted as an extrapolation problem. Conventionally, the unknown areas in the video sequence are estimated from either the spatial or temporal surrounding. Our approach considers the spatiotemporal signal including the missing area in a volume and replaces the unknown samples by extrapolating the surrounding signal from spatial, as well as temporal direction. By exploiting spatial and temporal correlations at the same time, it is possible to inherently compensate motion. Deviations in luminance occurring from frame to frame can be compensated, too.

O O B O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

extrapolation
prediction
tv logo removal


improving retrievability of patents with cluster-based pseudo-relevance feedback documents selection High findability of documents within a certain cut-off rank is considered an important factor in recall-oriented application domains such as patent or legal document retrieval. Findability is hindered by two aspects, namely the inherent bias favoring some types of documents over others introduced by the retrieval model, and the failure to correctly capture and interpret the context of conventionally rather short queries. In this paper, we analyze the bias impact of different retrieval models and query expansion strategies. We furthermore propose a novel query expansion strategy based on document clustering to identify dominant relevant documents. This helps to overcome limitations of conventional query expansion strategies that suffer strongly from the noise introduced by imperfect initial query results for pseudo-relevance feedback documents selection. Experiments with different collections of patent documents suggest that clustering based document selection for pseudo-relevance feedback is an effective approach for increasing the findability of individual documents and decreasing the bias of a retrieval system.

O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

measurement
experimentation
pseudo-relevance feedback
text clustering


A study of variable selection using g-prior distribution with ridge parameter In the Bayesian stochastic search variable selection framework, a common prior distribution for the regression coefficients is the g-prior of Zellner. However there are two standard cases where the associated covariance matrix does not exist and the conventional prior of Zellner cannot be used: if the number of observations is lower than the number of variables (large p and small n paradigm), or if some variables are linear combinations of others. In such situations, a prior distribution derived from the prior of Zellner can be considered by introducing a ridge parameter. This prior is a flexible and simple adaptation of the g-prior and its influence on the selection of variables is studied. A simple way to choose the associated hyper-parameters is proposed. The method is valid for any generalized linear mixed model and particular attention is paid to the study of probit mixed models when some variables are linear combinations of others. The method is applied to both simulated and real datasets obtained from Affymetrix microarray experiments. Results are compared to those obtained with the Bayesian Lasso. (c) 2011 Elsevier B.V. All rights reserved.

O O O O O O O O O B I O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O

bayesian lasso
generalized linear mixed model
ridge parameter
stochastic search variable selection

metropolis-within-gibbs algorithm
probit mixed regression model
zellner prior


Convergent innovation for affordable nutrition, health, and health care: the global pulse roadmap The paper outlines how the principles of convergent innovation (CI) can be applied to bring about a transformation in the pulse value chain. The paper presents three pioneering CI initiativestwo in conception and one in operationby various actors in the pulse ecosystem, which are delivering economic and human development impact in particular segments of the pulse value chain. It goes on to propose the way forward to scale up these efforts and connect them into a roadmap so as to achieve transformation throughout society, calling into action a number of actors in the ecosystem.

B I O O O B O B O O O O O O O O O O O O B I O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

convergent innovation
pulse value chain
health


On existence and uniqueness of stationary points in semi-infinite optimization The paper deals with semi-infinite optimization problems which are defined by finitely many equality constraints and infinitely many inequality constraints. We generalize the concept of strongly stable stationary points which was introduced by Kojima for finite problems; it refers to the local existence and uniqueness of a stationary point for each sufficiently small perturbed problem, where perturbations up to second order are allowed. Under the extended Mangasarian-Fromovitz constraint qualification we present equivalent conditions for the strong stability of a considered stationary point in terms of first and second derivatives of the involved functions. In particular, we discuss the case where the reduction approach is not satisfied.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O B I O O O

reduction approach
stationary point
strong stability

extended mangasarian-fromovitz constraint qualification


The economic impact of broadband on growth: A simultaneous approach This paper investigates how broadband penetration affects economic growth. A macroeconomic production function with a micro-model for broadband investment is used to estimate the impact of broadband infrastructure and growth. The results indicate a significant causal positive link especially when a critical mass of infrastructure is present. The scope of this research is 22 OECD countries based on data collected for the period 20022007.

O O O O B O O O O O O O O O B O O B I O O O O O O O O B O O O O O O O O B O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O


How accurately does Thomas Kuhns model of paradigm change describe the transition from the static view of the universe to the big bang theory in cosmology? Up to the 1960s the prevalent view of science was that it was a step-by-step undertaking in slow, piecemeal progression towards truth. Thomas Kuhn argued against this view and claimed that science always follows this pattern: after a phase of normal science, a scientific revolution occurs. Taking as a case study the transition from the static view of the universe to the Big Bang theory in cosmology, we appraised Kuhns theoretical approach by conducting a historical reconstruction and a citation analysis. As the results show, the transition in cosmology can be linked to many different persons, publications, and points in time. The findings indicate that there was not one (short term) scientific revolution in cosmology but instead a paradigm shift that progressed as a slow, piecemeal process.

O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O B I O O B I O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O B O O O O O O O O

thomas kuhn
paradigm
historical reconstruction
cosmology
citation analysis


Thermal Marangoni Instability and Magnetic Pressure for a Thin Ferrofluid Layer We study the linear coupling between the Marangoni and CowleyRosensweig instabilities for a thin layer of ferrofluid subjected to a temperature gradient and a magnetic field. Both are perpendicular to the reference horizontal boundaries, one of which is a rigid plate, while the other is a free surface remaining flat as long as the magnetic field is smaller than the critical value of the onset of the static isothermal CowleyRosensweig instability. Our study considers at first a ferrofluid layer resting on the rigid border. In the stationary case, when heating is directed from the rigid side, a magnetic field, smaller than the CowleyRosensweig critical one, can induce a new pattern: the critical Marangoni number is much lower than in the nonmagnetic undeformable case, for a dimensionless wavenumber of less than 1.992, its Newtonian classical value. When heating from the gaseous phase, an oscillatory marginal case exists theoretically, but for unphysical conditions. We consider also the case when the ferrofluid is hanging down from the rigid side. Only the wavelength critical value of the RayleighTaylor instability that separates a stable region from an unstable one changes.

O B I O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O

ferrofluid
marangoni instability
cowleyrosensweig instability


expressive policy analysis with enhanced system dynamicity Despite several research studies, the effective analysis of policy based systems remains a significant challenge. Policy analysis should at least ( i ) be expressive ( ii ) take account of obligations and authorizations, ( iii ) include a dynamic system model, and ( iv ) give useful diagnostic information. We present a logic-based policy analysis framework which satisfies these requirements, showing how many significant policy-related properties can be analysed, and we give details of a prototype implementation.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

security
authorization
policies
formal analysis


Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times We tackle the job shop scheduling problem with sequence dependent setup times and maximum lateness minimization by means of a tabu search algorithm. We start by defining a disjunctive model for this problem, which allows us to study some properties of the problem. Using these properties we define a new local search neighborhood structure, which is then incorporated into the proposed tabu search algorithm. To assess the performance of this algorithm, we present the results of an extensive experimental study, including an analysis of the tabu search algorithm under different running conditions and a comparison with the state-of-the-art algorithms. The experiments are performed across two sets of conventional benchmarks with 960 and 17 instances respectively. The results demonstrate that the proposed tabu search algorithm is superior to the state-of-the-art methods both in quality and stability. In particular, our algorithm establishes new best solutions for 817 of the 960 instances of the first set and reaches the best known solutions in 16 of the 17 instances of the second set.

B I O B I O O O B O O O O B I O O O O O B O O O O B I O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

scheduling
tabu search
setup times
lateness minimization


Growing RBFNN-based soft computing approach for congestion management In the emerging restructured power system, the congestion management (CM) has become extremely important in order to ensure the security and reliability of the system. In addition to this, lack of CM can impose a hindrance in electricity trading. This paper presents a novel, growing radial basis function neural network (GRBFNN)-based approach for CM. For achieving CM, Nodal congestion price (NCP) forecasting is performed in real time competitive power market. NCP forecasting is an effective way of price-based preventive CM as it directly indicates the presence as well as the severity of the congestion in the system. In present paper, GRBFNN has been developed for NCP forecasting dividing the whole power system into various congestion zones. An unsupervised learning vector quantization (VQ) clustering algorithm is applied as feature selection technique for the developed GRBFNN and for partitioning the power system into different congestion zones. For each congestion zone a separate neural network has been developed to ensure faster training and accurate forecasting results. The proposed approach of CM is implemented on an RTS 24-bus system. The results obtained are compared with a different constructive algorithm-based RBF network called as general regression neural network (GRNN) and two back-propagation algorithms based ANNs. Comparison results show that proposed GRBFNN is more computationally efficient with better predictive ability.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

congestion management (cm)
restructuring
nodal congestion prices
vector quantization clustering


Open patent services The nature, definition, typical services, utility and future developments in Open Patent Services (OPS) are described. This is with particular reference to the European Patent Office (EPO), and German Patent and Trademark Office (GPTO) systems. The impact of OPS on both information providers and users is discussed.

B I I O O O O O O O O O O B I I B O O O O O O O O O B I I B O B I I I I B O O O O B O O O O O O O O

open patent services
ops
european patent office
epo
german patent and trademark office
gpto


a polyrepresentational approach to interactive query expansion Interactive Query Expansion (IQE) presents suggested terms to the user during their search to enable better Information Retrieval (IR). However, IQE terms are poorly used, and tend to lack information meaningful to the user. The lack of cognitive and functional support during query refinement is a well documented problem, and despite the work carried out, it is still an under researched area. This stagnation in progress has been partly due to the long held belief that users are able to make good IQE term selections, and that the de facto way IQE terms are presented is effective. In this paper, we introduce a novel method to improve the presentation of IQE terms by providing supplementary information alongside them. We describe a user study that compared our novel polyrepresentational approach to IQE against a conventional IQE system and a baseline system. Our findings have shown that a polyrepresentational approach to IQE can address the ambiguity and uncertainty surrounding IQE, and improve the perceived usefulness of the terms.

O O O O B I I B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost We study a single machine serial batch scheduling problem with rejection. The objectives are to minimize total completion time and total rejection cost. We study four different variants of the problem. We prove that one variant is efficiently solvable while all other are NP NP -hard. We provide an ? -approximation algorithm for one of the NP NP -hard variants.

O O O O B I O O B O O B I I O O B O O O O O O O B I O O B O O O O O B I I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

batch scheduling
rejection
total completion time


Protected control packets to prevent denial of services attacks in IEEE 802.11 wireless networks Denial-of-service (DoS) attack exploits inherent limitation of resources in wireless networks in attempt to overwhelm and exhaust their finite capacity. In wireless networks, clear-text form of control packets (CP) exhibits a security flaw that can be exploited by attackers to render the networks incapable of providing normal services. While these attacks are quite damaging in terms of consuming available processing and bandwidth resources, they are easy to conduct against the wireless networks. In this study, we propose two distinct models to prevent wireless DoS and replay attacks based on trust in CP for IEEE 802.11 wireless networks. The first model is based on original HMAC-SHA1 algorithm and the second one is based on a proposed modified HMAC-SHA1 (M-hmac) algorithm. Both models are implemented and the results are obtained and evaluated based on a number of metrics. The results show that the two models successfully prevent both wireless DoS and replay attacks. In addition, the newly proposed M-hmac algorithm provides better network performance in term of the metrics.

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

dos attacks
hash functions
modified hmac-sha1
replay attack


On the optimal robot routing problem in wireless sensor networks Given a set of sparsely distributed sensors in the euclidean plane, a mobile robot is required to visit all sensors to download the data and finally return to its base. The effective range of each sensor is specified by a disk, and the robot must at least reach the boundary to start communication. The primary goal of optimization in this scenario is to minimize the traveling distance by the robot. This problem can be regarded as a special case of the Traveling Salesman Problem with Neighborhoods (TSPN), which is known to be NP-hard. In this paper, we present a novel TSPN algorithm for this class of TSPN, which can yield significantly improved results compared to the latest approximation algorithm.

O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

global optimization
heuristic algorithms


A ranking model in uncertain, imprecise and multi-experts contexts: The application of evidence theory We consider ranking problems where the actions are evaluated on a set of ordinal criteria. The evaluation of each alternative with respect to each criterion may be imperfect and is provided by one or several experts. We model each imperfect evaluation as a basic belief assignment (BBA). In order to rank the BBAs characterizing the performances of the actions according to each criterion, a new concept called RBBD and based on the comparison of these BBAs to ideal or nadir BBAs is proposed. This is performed using belief distances that measure the dissimilarity of each BBA to the ideal or nadir BBAs. A model inspired by Xu et al.'s method is also proposed and illustrated by a pedagogical example. (C) 2011 Elsevier Inc. All rights reserved.

O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multicriteria decision aid
rbbd concept
xu et al.'s method
multi-experts context


Radiofrequency Field Distribution Assessment in Indoor Areas Covered by Wireless Local Area Networks Electromagnetic environment becomes day by day more congested. Radio communication systems in the short range are now part of everyday life, and there is a need to also assess the pollution level due to their emission if we take into account human health and protection. There is consistent scientific evidence that environmental electromagnetic field may cause undesirable biological effects or even health hazards. Present paper aims at giving a view on exposure level due to wireless local area networks (WLAN) emission solely, as part of environmental radiofrequency pollution. Highly accurate measurements were made indoor by using a frequency-selective measurement system and identifying the correct settings for an error-minimum assessment. We focused on analysis of the electric flux density distribution inside a room, in the far field of the emitting antennas, in case of a single network communication channel. We analyze the influence the network configuration parameters have on the field level. Distance from the source and traffic rate are also important parameters that affect the exposure level. Our measurements indicate that in the immediate vicinity of the WLAN stations the average field may reach as much as 13% from the present accepted reference levels given in the human exposure standards.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B I O

ieee 802.11
electric field level
frequency-selective measurement


Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA Since complemented cellular automata (CA) are nonlinear, the analysis of complemented CA is more difficult than that of linear CA. We present a detailed analysis of the behavior of complemented CA derived from a linear TPMACA. We especially investigate the behavior of complemented CA derived from a linear TPMACA C whose complement vector is an acyclic state lying on some nonzero tree of C. (C) 2002 Elsevier Science Ltd. All rights reserved.

O O O O O O O O O O O O B O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O B O O O O O O O B O O O O B O O O O O O O O O O

depth
predecessor
characteristic matrix
attractor


ISO 10303-based PCB assembly data model for assembly analysis Today, time is one of the key factors in making a company the best in its industry. Translating information correctly and efficiently would reduce the time required to communicate between departments not only within a company but also among different companies. STEP, comprising many application protocols, is a standard for the exchange of product model data that has a great capability for describing product shape and managing product life cycle information. Therefore, effective information translation and the Concurrent Engineering (CE) could be achieved using STEP enabling technology. AP 210, an ISO/STEP committee drafted document, is an application protocol that describes printed circuit board (PCB) and PCB assembly product data. This paper focuses on the standard data modeling of PCB assembly based on AP 210. The data models are implemented as object classes and used to demonstrate the evaluation analysis application of the PCB assembly.

O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O O O O O O O B I O O O O O O O B I O O O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O B I

concurrent engineering
application protocol
pcb assembly
ap 210


Slow oscillations in neural networks with facilitating synapses The synchronous oscillatory activity characterizing many neurons in a network is often considered to be a mechanism for representing, binding, conveying, and organizing information. A number of models have been proposed to explain high-frequency oscillations, but the mechanisms that underlie slow oscillations are still unclear. Here, we show by means of analytical solutions and simulations that facilitating excitatory (E f) synapses onto interneurons in a neural network play a fundamental role, not only in shaping the frequency of slow oscillations, but also in determining the form of the up and down states observed in electrophysiological measurements. Short time constants and strong E f synapse-connectivity were found to induce rapid alternations between up and down states, whereas long time constants and weak E f synapse connectivity prolonged the time between up states and increased the up state duration. These results suggest a novel role for facilitating excitatory synapses onto interneurons in controlling the form and frequency of slow oscillations in neuronal circuits.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

dynamic synapse
synchrony
recurrent network
temporal processing
neocortex
model


user-oriented design and tangible interaction for kindergarten children This paper describes a tabletop prototype that allows kindergarten children to take the benefits of the new pedagogical possibilities that tangible interaction and tabletop technologies offer to manipulative learning. After analyzing children's cognitive and psychomotorial skills, we have designed and tuned a prototype game suitable for children aged 3 to 4 years old. Our prototype uniquely combines low cost tangible interaction and tabletop technology with tutored learning. The design has been based on observations of the children using the technology, letting them freely play with the application during three play sessions. These observational sessions informed the design decisions for the game whilst also confirming the children's enjoyment with the prototype.

O O O B I O O B O O O O B O O O O B O O O O O O O O O O B I O B O O O O B O O O O O O O O O O O O O O B O O B O O O O O O O O O O O O B I O B O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O

children
tangible interaction
learning
game
tabletop

input devices
interaction design
augmented reality
user center design


Detection and measurement of coverage loss in interleaved multi-acquisition brain MRIs due to motion-induced inter-slice misalignment In MRI scans that are acquired in a slice-by-slice manner, patient motion during scanning can cause adjacent slices to overlap, resulting in duplicate coverage in some areas and missing coverage in others. Scans in which multiple slices are acquired simultaneously and interleaved with other sets of slices are particularly vulnerable because a single movement can result in the misalignment and overlap of many slices. Despite the fact that considerable data losses can occur even with few visible artifacts, this problem has received very little attention from MRI researchers. The primary goals of this paper are: (1) to raise awareness of the problem in the MRI community and (2) to present an efficient multiscale algorithm that accurately quantifies the amount of data loss. Validation of the algorithms accuracy is performed on 200 scans with simulated patient motion so that the true amount of data loss is known for each scan. The motion parameters are chosen to simulate scans that have significant data loss (mean missing coverage=14.39% of head volume, SD=6.61%, range=2.7632.98%) but with few visual indications of the problem. The algorithm is shown to be very accurate, yielding estimates that differ from the true values by a mean of only 1.1% point (SD=0.98pt, range=0.006.54pt). The algorithm is also shown to be consistent and robust when tested on a large set of scans from a recent multiple sclerosis clinical trial.

O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

interleaving
motion artifact
inter-slice misalignment


Incremental modeling with rough and fine tuning method In this paper, we propose a new learning approach for designing an incremental model that has a cascade learning structure combined with a rough and fine tuning method for the learning scheme. Recently, various fuzzy logic-based modeling methods, with fuzzy if-then type rules, have been proposed in an attempt to obtain good approximations and generalization performances. In contrast to these various modeling methods, the new proposed incremental modeling scheme presented here is combined with a rough and fine tuning scheme, to learn and construct the best architecture for the model. A compensation idea is introduced in the fine tuning stage to solve the over-fitting problem caused from testing data. For this purpose, a construct of an extreme learning machine (ELM) is used as a global model, and this is compensated through a conditional fuzzy C-means (CFCM)-based fuzzy inference system (FIS) with a TakagiSugenoKang (TSK)-type method, which captures the remaining localized nonlinearities of the model. The experimental results, obtained by the proposed model have proved to show better performances in comparison with previous works.

O O O B I I I O O O O O O O O O O O O O B I O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

incremental model
extreme learning machine
rough and fine tuning


ranking quality factors for measuring web service quality In the emerging electronic environment, knowing how to measure Web service quality is of great importance. To attain the desired quality of Website services, it is necessary to produce a framework that enables evaluation of a web service quality. This paper defines and categorizes the quality factors for measuring web service quality. Moreover, the paper includes a framework to establish quality factors in terms of attributes, in addition to their level of importance based on the opinion of highly-skilled professionals. The primary goals are identifying, qualifying, categorizing and ranking these factors. These factors would be used to give indications for the improvement of the web services quality.

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O