A Low Complexity Subband Adaptive Filter with Two-Stage Decomposition The conventional subband adaptive filter (SAF) based on poly-phase decomposition has fast convergence behavior compared by fullband adaptive filter. However, the complexity for one-stage signal decomposition increases significantly, as increasing the number of subband to improve the convergence further. To solve this problem, a new SAF is proposed in this letter, which is constructed with two-stage decomposition. Based on the proposed structure, an adaptive algorithm of updating coefficients is derived based on the principle of minimal disturbance. Compared to the conventional SAF with one-stage decomposition, the proposed one has similar convergence rate with a lower complexity. Theoretical analysis and simulation results validated the superiority of the proposed SAF.

O O O B I I 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

adaptive filtering
two-stage decomposition


genotype-phenotype mapping in dynamic environments with grammatical evolution The application of a genotype-phenotype mapping in Evolutionary Computation is not a new idea, however, how this mapping process is interpreted, and implemented varies wildly. In the majority of cases a very simple abstraction of the biological genotype-phenotype mapping is used, but as our understanding of this process increases, the deficiencies in current approaches become more evident. In this paper, an outline of what approaches have been taken in the investigation of the genotype-phenotype map in Grammatical Evolution are presented and an outline of proposed future work is introduced.

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 B I O O O O O O O O O O O


Conductivity of two-dimensional metalorganic hybrid films We calculate the conductivity of two-dimensional hybrid multilayer films formed by the self-assembly of an ordered liquid crystalline array of molecular columns on an ultra-thin MBE grown metal layer. Electrons in the metal interact with the molecular overlayer, forming new energy bands which have novel transport properties. Because of the short mean free path encountered in these structures due to strong Coulomb and surface roughness scattering, conductivity changes occur where the molecular columns bond strongly to the metal surface. The local conductivities are calculated using KuboGreenwood formula for the hybrid system, and the global conductivity is obtained via a many-body diffusion model. The model includes both the general effects of a dielectric overlayer on electron scattering in the metal, and the specific effect of real and virtual electron capture by the molecular columns. The frequency-dependent conductivity is calculated for a range of columnar lengths and external gate fields.

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

surface resistance
molecular gates
2-d hybrids


Diameter vulnerability of iterated line digraphs in terms of the girth Iterated line digraphs arise naturally in designing fault tolerant systems. Diameter vulnerability measures the increase in diameter of a digraph when some of its vertices or arcs fail. Thus, the study of diameter vulnerability is a suitable approach to the fault tolerance of a network. In this article we present some upper bounds for diameter vulnerability of iterated line digraphs L(k)G. Our bounds depend basically on the girth of the digraph G and on the number of iterations k. These bounds generalize some previous results on diameter vulnerability of line digraphs. Also, we apply our results to several important families of line digraphs such as Kautz digraphs and deBruijn generalized cycles, which contain deBruijn digraphs, the Reddy-Pradhan-Kuhl digraphs, and the butterflies. Our bounds allow us to obtain improvements in known results on diameter vulnerability for all these families. (C) 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 45(2), 49-542005

B I O O O O O O O O B 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 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 B 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 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

diameter vulnerability
girth
debruijn digraphs


Characterising the Martin-Lof random sequences using computably enumerable sets of measure one A sequence omega is Martin-Lof random if and only if it appears early in every Lebesgue measure one set of computably enumerable intervals. (C) 2004 Elsevier B.V. All rights reserved.

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

martin-lof random
kolmogorov complexity
compressibility coefficient
probability law
computational complexity


Novel Consecutive-Pilot Design for Phase Noise Suppression in OFDM System In this paper, a novel consecutive-pilot design is proposed to suppress phase noise (PHN) in orthogonal frequency-division multiplexing (OFDM) system. The estimation of PHN is performed by a cross-correlation between the received and locally generated pilots in frequency-domain. Simulations show that the proposed scheme can effectively ameliorate the impairment due to PHN, at the cost of acceptable additional transmission bandwidth and low implementation complexity.

O O O O B I O O B 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 O O O O O O O O O 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 scaleable document clustering approach for large document corpora In this paper, the scalability and quality of the contextual document clustering (CDC) approach is demonstrated for large data-sets using the whole Reuters Corpus Volume 1 (RCV1) collection. CDC is a form of distributional clustering, which automatically discovers contexts of narrow scope within a document corpus. These contexts act as attractors for clustering documents that are semantically related to each other. Once clustered, the documents are organized into a minimum spanning tree so that the topical similarity of adjacent documents within this structure can be assessed. The pre-defined categories from three different document category sets are used to assess the quality of CDC in terms of its ability to group and structure semantically related documents given the contexts. Quality is evaluated based on two factors, the category overlap between adjacent documents within a cluster, and how well a representative document categorizes all the other documents within a cluster. As the RCV1 collection was collated in a time ordered fashion, it was possible to assess the stability of clusters formed from documents within one time interval when presented with new unseen documents at subsequent time intervals. We demonstrate that CDC is a powerful and scaleable technique with the ability to create stable clusters of high quality. Additionally, to our knowledge this is the first time that a collection as large as RCV1 has been analyzed in its entirety using a static clustering approach.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


An Extreme Form of Superactivation for Quantum Zero-Error Capacities The zero-error capacity of a channel is the rate at which it can send information perfectly, with zero probability of error, and has long been studied in classical information theory. We show that the zero-error capacity of quantum channels exhibits an extreme form of nonadditivity, one which is not possible for classical channels, or even for the usual capacities of quantum channels. By combining probabilistic arguments with algebraic geometry, we prove that there exist channels epsilon(2) and epsilon(2) with no zero-error classical capacity whatsoever, C-0(epsilon(1)) = C-0(epsilon(2)) = 0, but whose joint zero-error quantum capacity is positive, Q(0)(epsilon(1) circle times epsilon(2)) >= 1. This striking effect is an extreme form of the superactivation phenomenon, as it implies that both the classical and quantum zero-error capacities of these channels can be superactivated simultaneously, while being a strictly stronger property of capacities. Superactivation of the quantum zero-error capacity was not previously known.

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 B I 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 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

classical capacity
quantum capacity
superactivation

additivity violation
channel coding
communication channels
information rates
quantum theory
zero-error capacity


Difference sets over Galois rings with odd extension degrees and characteristic an even power of 2 We construct an infinite family of (2 (ns) , 2 (ns/2 -1)(2 (ns/2)-1), 2 (ns/2 -1)(2 (ns/2 -1) -1)) difference sets over a Galois ring GR(2 (n) , s) with characteristic an even power n of 2 and an odd extension degree s. It makes a chain of difference sets preserving the structures when n increases and s is fixed. We introduce a new operation into GR(2 (n) , s). The Gauss sum associated with the multiplicative character defined by the subgroup with respect to the new operation plays an important role in the construction.

O O O O O O O O O O O O O O O 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 B I O O O O O O O O O O O O O O O O O O O O O O


An efficient continuation method for quadratic assignment problems In this article, we propose a Lagrangian smoothing algorithm for quadratic assignment problems, where the continuation subproblems are solved by the truncated Frank-Wolfe algorithm. We establish practical stopping criteria and show the algorithm finitely terminates at a KKT point of a continuation subproblem. The quality of the returned solution is studied in detail. Finally, limited numerical results are provided. (C) 2009 Elsevier Ltd. All rights reserved.

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 O O O O O O O O O O O O O O

quadratic assignment problem
frank-wolfe algorithm
heuristic


eEfficient appointment information extraction from short messages in mobile devices with limited hardware resources With the rapid evolution of the mobile environment demand for information extraction from mobile devices is increasing This paper proposes an information extraction system that is designed for mobile devices with limited hardware resources The proposed system extracts temporal (dates and times) and named instances (locations and title) from Korean short messages in an appointment management domain To efficiently extract temporal instances with limited numbers of surface forms the proposed system uses well-refined finite state automata To effectively extract various surface forms of named instances with limited hardware resources the proposed system uses a modified hidden Markov model (HMM) based on character n-grams In the experiment on instance boundary labeling the proposed system showed comparable performances with representative conventional classifiers The proposed system was Implemented in a commercial mobile phone to test its ability to automatically extract appointment information from a short message and store the information into a schedule database The system performed well with a reasonable response time (C) 2010 Elsevier B V All rights reserved

O B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

appointment information extraction
mobile environment


The Parzen Window method: In terms of two vectors and one matrix ? We revisit the Parzen Window approach widely employed in pattern recognition. The Parzen Window approach can suffer from a severe computational bottleneck. This manuscript introduces a new scheme to ameliorate this computational drawback.

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 B I O O O O O O O O O O O O O O O O O O O

probability density function
kernel functions


An arbitrary LagrangianEulerian method for simulating bubble growth in polymer foaming We present a sharp-interface algorithm for simulating the diffusion-driven bubble growth in polymer foaming. A moving mesh of unstructured triangular elements tracks the expanding and deforming bubble surface. In the interior of the liquid, the mesh velocity is determined by solving a Laplace equation to ensure spatially smooth mesh movement. When mesh distortion becomes severe, remeshing and interpolation are performed. The governing equations are solved using a Galerkin finite-element formalism, with fully implicit time marching that requires iteration among the bubble and mesh deformation, gas diffusion and the flow and stress fields. Besides numerical stability, the implicit scheme also guarantees a smooth interfacial curvature as numerical disturbances on the interface are automatically relaxed through the iterations. The polymer melt is modeled as a viscoelastic Oldroyd-B fluid. First, we compute three benchmark problems to validate various aspects of the algorithm. Then we use a periodic hexagonal cell to simulate bubble growth in an isothermal two-dimensional foam, fed by a gaseous blowing agent initially dissolved in the melt to supersaturation. Results show two distinct stages: a rapid initial expansion followed by slow drainage of the liquid film between bubbles driven by capillarity. The effect of viscoelastic rheology is to enhance the speed of bubble growth in the first stage, and hinder film drainage in the second. Finally, we use axisymmetric simulations to investigate the thinning film between a bubble and a free surface. Melt viscoelasticity is shown to initially enhance film thinning but later resist it. An important insight from the simulations is that polymer strain-hardening, namely the steep increase of elongational viscosity with strain, helps stabilize the foam structure by suppressing bubblebubble coalescence and bubble burst at the foam surface. This confirms prior observations in foam extrusion experiments.

O O 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 O O O O O O O O O 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 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

moving mesh
viscoelasticity
film drainage
capillarity

free surface problem
interfacial flows
finite elements
oldroyd-b fluids


Numerical verification of solutions for elasto-plastic torsion problems In this paper, we consider a numerical technique which enables us to verify the existence of solutions for the elasto-plastic torsion problems governed by the variational inequality. Based upon the finite element approximations and the explicit a priori error estimates for a simple problem, we present an effective verification procedure that through numerical computation generates a set which includes the exact solution. This paper is an extension of the previous paper [1] in which we mainly dealt with the obstacle problems, but some special techniques are utilized to verify the solutions for nondifferentiable nonlinear equations concerned with the present problem. A numerical example is illustrated. (C) 2000 Elsevier Science Ltd. 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 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

numerical verification
variational inequality

nondifferentiable nonlinear problem
fixed-point theorem


Artifact removal and texture-based rendering for visualization of 3D fetal ultrasound images Convenient and non-invasive ultrasonography has become an essential tool for diagnosing fetal abnormalities. However, the noisy and blurry nature of sonographic data poses a challenge. To improve object visualization, we first develop a modified diffusion filter that utilizes the local standard deviation and edge of local-average-difference to define an adaptive edge stopping function in diffusion filtering. The proposed method overcomes the drawbacks of traditional diffusion filters and shows good results in comparative experiments. Moreover, we propose a novel light absorbing function to remove large regions of interface artifacts. An advanced imaging mode, called texture-based rendering, is employed to provide more realistic rendering. Experimental results show that the proposed methods enhance final image quality in 3D fetal sonograms.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

ultrasonography
diffusion filter
visualization


workflows for parameter studies of multi-cell modeling Running simulations for multi-cell tissue models can involve numerous parameters and consume considerable computing resources. This paper presents an overview and use case of two open source projects - CompuCell3D, a multi-cell modeling framework, and VisTrails, a workflow system for parameter exploration and data management.

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

scientific workflows
visualization
scripting languages
cluster computing


POSSIBILITY-PROBABILITY TRANSFORMATION - A NEW RESULT VIA INFORMATION-THEORY OF DETERMINISTIC FUNCTIONS By combining the theory of relative information and the information of deterministic functions, one can obtain a model of possibility-probability transformation. Relative information defines possibility in terms of syntax-semantics coupling of natural languages, while entropy of deterministic functions refers to the maximum conditional entropy principle. These two theories use the basic concepts of Shannon information theories, and do not apply any of the new recent notions such as belief, necessity, confusion, dissonance, nonspecificity, and so on. The model appears as a direct consequence of the Shannon theory itself.

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


Space mapping optimization of waveguide filters using finite element and mode-matching electromagnetic simulators For the first time in design optimization of microwave circuits, the aggressive space mapping (SM) optimization technique is applied to automatically align electromagnetic (EM) models based on hybrid mode-matching/network theory simulations with models based on finite-element (FEM) simulations. SM optimization of an H-plane resonator biter with rounded corners illustrates the advantages as well as the challenges of the approach. The parameter extraction phase of SM is given special attention. The impact of selecting responses and error functions on the convergence and uniqueness of parameter extraction is discussed. A statistical approach to parameter extraction involving ii and penalty concepts facilitates a key requirement by SM for uniqueness and consistency. A multipoint parameter extraction approach to sharpening the solution uniqueness and improving the SM convergence is also introduced. Once the mapping is established, the effects of manufacturing tolerances are rapidly estimated with the FEM accuracy. SM has also been successfully applied to optimize waveguide transformers using two hybrid mode-matching/network theory models: a coarse model using very few modes and a fine model using many modes to represent discontinuities. (C) 1999 John Wiley & Sons, Inc.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


design of dynamic load-balancing tools for parallel applications The design of general-purpose dynamic load-balancing tools for parallel applications is more challenging than the design of static partitioning tools. Both algorithmic and software engineering issues arise. We have addressed many of these issues in the design of the Zoltan dynamic load-balancing library. Zoltan has an object-oriented interface that makes it easy to use and provides separation between the application and the load-balancing algorithms. It contains a suite of dynamic load-balancing algorithms, including both geometric and graph-based algorithms. Its design makes it valuable both as a partitioning tool for a variety of applications and as a research test-bed for new algorithmic development. In this paper, we describe Zoltan's design and demonstrate its use in an unstructured-mesh finite element application.

B O B O B O B B O B O O B O B O B B O O O O O B O O O B O O O B I 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 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 B O O O O O O O B O O O O B O O O B O O O O O O O B O O O B O B O B O O O B I O

applications
research
use
parallel
dynamic
design
tool
demonstrate
paper
software engineering
tools
finite element

partition
mesh
test
developer
load balancing
graph
interfaces
general
algorithm
libraries
object-oriented


Bayesian Mixed-Effects Inference on Classification Performance in Hierarchical Data Sets Classification algorithms are frequently used on data with a natural hierarchical structure. For instance, classifiers are often trained and tested on trial-wise measurements, separately for each subject within a group. One important question is how classification outcomes observed in individual subjects can be generalized to the population from which the group was sampled. To address this question, this paper introduces novel statistical models that are guided by three desiderata. First, all models explicitly respect the hierarchical nature of the data, that is, they are mixed-effects models that simultaneously account for within-subjects (fixed-effects) and across-subjects (random-effects) variance components. Second, maximum-likelihood estimation is replaced by full Bayesian inference in order to enable natural regularization of the estimation problem and to afford conclusions in terms of posterior probability statements. Third, inference on classification accuracy is complemented by inference on the balanced accuracy, which avoids inflated accuracy estimates for imbalanced data sets. We introduce hierarchical models that satisfy these criteria and demonstrate their advantages over conventional methods using MCMC implementations for model inversion and model selection on both synthetic and empirical data. We envisage that our approach will improve the sensitivity and validity of statistical inference in future hierarchical classification studies.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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

beta-binomial
normal-binomial
group studies


Algorithm for dealing with depressions in dynamic landscape evolution models Depressions in landscapes function as buffers for water and sediment. A landscape with depressions has less runoff, less erosion and more sedimentation than a landscape without depressions. Sinks in digital elevation models (DEMs) can be existing features that correctly represent depressions in actual landscapes or spurious features that result from errors in DEM creation. In many erosion, landscape and hydrological models, all sinks are considered spurious features and, as a result, these models do not deal with sinks that do represent real depressions. Consequently, erosion is overestimated and sedimentation is underestimated. Dynamic geomorphological models that simulate soil redistribution in modelled landscapes in multiple timesteps have this problem in every timestep. A method that allows these models to deal with depressions in a realistic way is needed. This paper presents an algorithm that allows models in general, and dynamic geomorphological model LAPSUS in particular, to deal with sinks in a DEM and, thus, with depressions in a landscape. An application is presented where LAPSUS runs with the new algorithm are compared to the conventional runs. Results indicate that the new algorithm can realistically model the sediment buffer function of depressions. The inclusion of the new depression algorithm allows modelling landscape processes that can result in depressions, like landsliding, glacial processes and tectonics. It is also demonstrated that static models, running only once with a DEM without sinks, display effects from the filling of the sinks before running.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B 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 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


Evaluation of the Pattern-based method for Secure Development (PbSD): A controlled experiment Security in general, and database protection from unauthorized access in particular, are crucial for organizations. Although it has been long accepted that the important system requirements should be considered from the early stages of the development process, non-functional requirements such as security tend to get neglected or dealt with only at later stages of the development process. We present an empirical study conducted to evaluate a Pattern-based method for Secure Development PbSD that aims to help developers, in particular database designers, to design database schemata that comply with the organizational security policies regarding authorization, from the early stages of development. The method provides a complete framework to guide, enforce and verify the correct implementation of security policies within a system design, and eventually generate a database schema from that design. The PbSD method was evaluated in comparison with a popular existing method that directly specifies the security requirements in SQL and Oracles VPD. The two methods were compared with respect to the quality of the created access control specifications, the time it takes to complete the specification, and the perceived quality of the methods. We found that the quality of the access control specifications using the PbSD method for secure development were better with respect to privileges granted in the table, column and row granularity levels. Moreover, subjects who used the PbSD method completed the specification task in less time compared to subjects who used SQL. Finally, the subjects perceived the PbSD method clearer and more easy to use. The pattern-based method for secure development can enhance the quality of security specification of databases, and decrease the software development time and cost. The results of the experiment may also indicate that the use of patterns in general has similar benefits; yet this requires further examinations.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

database design
model driven development
secure software development
security patterns


Deep brain stimulation for movement and other neurologic disorders Deep brain stimulation (DBS) was introduced as a treatment for patients with parkinsonism and other movement disorders in the early 1990s. The technique rapidly became the treatment of choice for these conditions, and is now also being explored for other diseases, including Tourette syndrome, gait disorders, epilepsy, obsessive-compulsive disorder, and depression. Although the mechanism of action of DBS remains unclear, it is recognized that DBS works through focal modulation of functionally specific circuits. The fact that the same DBS parameters and targets can be used in multiple diseases suggests that DBS does not counteract the pathophysiology of any specific disorder, but acts to replace pathologic activities in disease-affected brain circuits with activity that is more easily tolerated. Despite the progress made in the use of DBS, much remains to be done to fully realize the potential of this therapy. We describe some of the most active areas of research in this field, both in terms of exploration of new targets and stimulation parameters, and in terms of new electrode or stimulator designs.

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

parkinson's disease
dystonia
subthalamic nucleus
internal pallidal segment
pedunculopontine nucleus
segregated circuits


type-checking smalltalk Although most attempts to speed-up Smalltalk have focused on providing more efficient interpreters, code optimization is probably necessary for further increases in speed. A type-system for Smalltalk is a prerequisite for building an optimizing compiler. Unfortunately, none of the type-systems so far proposed for Smalltalk are adequate; they either cause nearly all Smalltalk programs to be type incorrect, allow run-time type errors, or do not provide enough information for optimization. This paper presents a type-system for Smalltalk that is suitable for code optimization.

O B O O O O O B O O O O O O O B I 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 B 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 B O O O O B O O O O B I

optimizing compiler
paper
code optimization
errors
smalltalk

type system
program
timing
efficiency
optimality
informal
interpretation


evaluating multimodal affective fusion using physiological signals In this paper we present an evaluation of an affective multimodal fusion approach utilizing dimensional representations of emotion. The evaluation uses physiological signals as a reference measure of users' emotional states. Surface electromyography (EMG) and galvanic skin response (GSR) signals are known to be correlated with specific dimensions of emotion (Pleasure and Arousal) and are compared here to real time continuous values of these dimensions obtained from affective multimodal fusion. The results (both qualitative and quantitative) suggest that the particular multimodal fusion approach described is consistent with physiological indicators of emotion, constituting a first positive evaluation of the approach.

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

affective interfaces
physiological evaluation
multimodal interfaces


Reducing the cost of accessing relations in incremental view maintenance In the data warehouse environment, the concept of a materialized view is common and important for efficient support of OLAP query processing. Materialized views are generally derived from several relations. These materialized views need to be updated when source relations change. Since the propagation of updates to the views may impose a significant overhead, it is essential to update the warehouse views efficiently. Though various view maintenance strategies have been discussed in the past, optimizations on the total accesses to relations have not been sufficiently investigated. In this paper we propose an efficient incremental view maintenance method called optimal delta evaluation that can minimize the total accesses to relations. We first present the delta evaluation expression and a delta evaluation tree which are core concepts of the method. Then, a dynamic programming algorithm that can find the optimal delta evaluation tree is proposed. We also present various experimental results that show the usefulness and efficiency of our proposed method.

O O 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 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 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


Allocating fragments in distributed databases For a distributed database system to function efficiently, the fragments of the database need to be located judiciously at various sites across the relevant communications network. The problem of allocating these fragments to the most appropriate sites is a difficult one to solve, however, with most approaches available relying on heuristic techniques. Optimal approaches are usually based on mathematical programming, and formulations available for this problem are based on the linearization of nonlinear binary integer programs and have been observed to be ineffective except on very small problems. This paper presents new integer programming formulations for the nonredundant version of the fragment allocation problem. This formulation is extended to address problems which have both storage and processing capacity constraints; the approach is observed to be particularly effective in the presence of capacity restrictions. Extensive computational tests conducted over a variety of parameter values indicate that the reformulations are very effective even on relatively large problems, thereby reducing the need for heuristic approaches.

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


Dynamic Point Coverage Problem in Wireless Sensor Networks: A Cellular Learning Automata Approach One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynamic point coverage problem, which is to detect some moving target points in the area of the sensor network, a node is needed to be active only when a target point is in its sensing region. A node can be aware of such limes using a predicting mechanism. In this paper, we propose a solution to the problem of dynamic point coverage using irregular cellular learning automata. In this method, learning automaton residing in each cell in cooperation with the learning automata residing in its neighboring cells predicts the existence of any target point in the vicinity of its corresponding node in the network. This prediction is then used to schedule the active times of that node. In order to show the performance of the proposed method, computer experimentations have been conducted. The results show that the proposed method outperforms the existing methods such as LEACH, GAF, PEAS and PW in terms of energy consumption.

B I I O O O O O O O B I 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 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 B I I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

wireless sensor network
dynamic point coverage
learning automata


On a Derivative-Free Fan-Beam Reconstruction Formula We clarify that the derivative-free fan-beam reconstruction formula [IEEE Trans. Image Process. 2, 543-547, 1993] only allows exact reconstruction of an object for a circular trajectory or at the origin of the coordinate system for a radially symmetric noncircular trajectory.

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

x-rays
computed tomography
fan beam
image reconstruction


Voice controlled wheelchairs: Fine control by humming People without disabilities seamlessly control devices with their hands. Interestingly, their hands can perform coarse and fine control. Implementing smooth control for computerized systems is not straightforward and most of the time it is not intuitive either. Here we offer a solution to that problem: smooth control through humming. Voice commands have become ubiquitous in modern technology. Speech-to-text applications abound. Smooth control, on the other hand, has not been tackled yet. Here we design and implement a humming control technique, and demonstrate a hardware implementation with a powered wheelchair. Once actuated, the speed with which the chair moves will depend on the subtle variation on the fundamental frequency of the user's humming, acquired through an accelerometer measuring vocal cord vibration. We also discuss two signal processing techniques that handle commonly encountered issues when trying to resolve frequencies in real time data. The hardware implementation shows performance of 80% and higher in speech recognition for signal-to-noise ratio (SNR) higher than 8dB and 100% in smooth control and frequency detection for all tested SNRs. We also discuss potential applications of smooth humming control to other assistive technology.

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 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 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 O O O O O O O O O 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 B I O O O O O O O O O O O O O O B O O O B I

assistive technology
humming
smooth control

voice control
accelerometry
power wheelchair


Smart Security Assessment of Composed Web Services As more and more organizations use Service-Oriented Architecture (SOA) to design and implement their information systems the systems' architects also need more intelligent and reliable tools. The complexity, modularity, and heterogeneity of the information systems make the security evaluation a difficult process. In this work, we propose a method for the assesment and optimization of a security level of composed web services, assuming layered security architecture and the multi-agent approach. As the security evaluation requires the precise definition of the set of evaluation criteria, the basic criteria for each functional layer of SOA have been presented. An information fusion scheme, based on subjective logic formalism, was proposed to gather information coming from different layers and agents.

O B 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 O O O O O O O O O O O O B O O O B I O O B 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


REACHABILITY FOR FINITE-STATE PROCESS ALGEBRAS USING HORN CLAUSES In this work we present an algorithm for solving the reachability problem in finite systems that are modelled with process algebras. Our method is based on Static Analysis, in particular, Data Flow Analysis, of the syntax of a process algebraic system with multi way synchronisation. The results of the Data Flow Analysis are used in order to build a set of Horn clauses whose least model corresponds to an overapproximation of the reachable states. The computed model can be refined after each transition, and the algorithm runs until either a state whose reachability should be checked is encountered or it is not in the least model for all constructed states and thus is definitely unreachable. The advantages of the algorithm are that in many cases only a part of the Labelled Transition System will be built which leads to lower time and memory consumption. Also, it is not necessary to save all the encountered states which leads to further reduction of the memory requirements of the algorithm.

B O O O O O B I 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 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

reachability
static analysis
horn clauses


Evolutionary circuit design for fast FPGA-based classification of network application protocols ? The evolutionary design can produce fast and efficient implementations of digital circuits. It is shown in this paper how evolved circuits, optimized for the latency and area, can increase the throughput of a manually designed classifier of application protocols. The classifier is intended for high speed networks operating at 100Gbps. Because a very low latency is the main design constraint, the classifier is constructed as a combinational circuit in a field programmable gate array (FPGA). The classification is performed using the first packet carrying the application payload. The improvements in latency (and area) obtained by Cartesian genetic programming are validated using a professional FPGA design tool. The quality of classification is evaluated by means of real network data. All results are compared with commonly used classifiers based on regular expressions describing application protocols.

O O O O O O O O O O O O O O O O O O O O O O O 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 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 I 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

classifier
cartesian genetic programming
field programmable gate array


A comparative analysis of fine-grain threads packages ? The rising availability of multiprocessing platforms has increased the importance of providing programming models that allow users to express parallelism simply, portably, and efficiently. One popular way to write parallel programs is to use threads for concurrent sections of code. User-level threads packages allow programmers to implement multithreaded programs in which thread creation, thread management, and thread synchronization are relatively inexpensive. Fine-grain programs are multithreaded programs in which the work is divided into a large number of threads, where each thread contains a relatively small amount of work. The potential benefit of large numbers of threads include easier load balancing, better scalability, greater potential for overlapping communication and computation, and improved platform-independence. However, fine-grain programs are largely considered inefficient due to the overheads involved in managing numerous threads. In this paper, we survey several thread packages that take different approaches to the problem of efficiently supporting the creation and management of large numbers of fine-grain threads. Each package is compared based on its level of support of the general thread model as well as its performance on a set of fine-grain parallel programs. We find that while the thread packages we tested may support medium-grain parallelism efficiently, they do not always support fine-grain parallelism. Although no package supports fine-grain parallelism and a general thread model, we believe that it can potentially be done with help from the compiler.

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 B 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 B O O O O O 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Dreamware: edutainment system for children with developmental disability We designed and implemented an edutainment platform, Dreamware. It effectively helps education, sensibility treatment and intelligence training for children with developmental disability. We developed special toy-like hardware and software tools: a content authoring tool that makes a variety of multimedia content operating on the hardware, a management tool that provides training results to instructors, and a real-time monitoring tool to observe the current state of learning. The hardware is designed to consider the characteristics of children with developmental disability. It can provide sensibility training, such as visual, auditory, and tactile senses to them. The easy-to-use authoring tool enables teachers and non-specialists to make educational content conveniently. In addition, the real-time monitoring tool helps observe the users status, even outside the classroom. The management tool stores training results and provides the result for further steps. Efficient repetitive training is possible without restriction of time and location using this platform. We can recognize that our system is effective in improving their concentration and learning.

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 O B I 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 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

edutainment system
developmental disability
authoring tool

multimedia system
embedded system
sensory integration


An unsupervised feature learning framework for basal cell carcinoma image analysis A framework for basal cell carcinoma detection based on unsupervised feature learning. Experimental results show an improvement when compared to state-of-the-art methods. The framework integrates a digital staining method which improves interpretability. Digital staining highlights regions in the image which the model relates to cancer.

O B I I O O B I I O O O O O B I I 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

unsupervised feature learning
basal cell carcinoma

digital pathology
representation learning


A multimodal logic approach to order of magnitude qualitative reasoning with comparability and negligibility relations Non-classical logics have proven to be an adequate framework to formalize knowledge representation. In this paper we focus on a multimodal approach to formalize order-of-magnitude qualitative reasoning, extending the recently introduced system MQ, by means of a certain notion of negligibility relation which satisfies a number of intuitively plausible properties, as well as a minimal axiom system allowing for interaction among the different qualitative relations. The main aim is to show the completeness of the formal system introduced. Moreover, we consider some definability results and discuss possible directions for further research.


A new type of nonlinear integrals and the computational algorithm In information fusion, aggregations with various backgrounds require a variety of integrals to handle. These integrals are generally nonlinear since the set functions used are nonadditive in many real problems. In this study, the set functions considered are nonnegative and vanishing at the empty set. They are a class of set functions including fuzzy measures and even imprecise probabilities. A new type of nonlinear integrals with respect to such a set function for nonnegative functions is introduced and its primary properties are detailed. These type of integrals has a natural explanation and, therefore, has wide applicability. We also show a comparison between the newly introduced nonlinear integral and other nonlinear integrals, such as the Choquet integral, the natural extension in the theory of imprecise probabilities, and the common pan-integral. With a flowchart, the algorithm for calculating the integral is given in this paper when the universe of discourse (the set of all information sources) is finite. (C) 2000 Elsevier Science B.V. All rights reserved.

O O O O B 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 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 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 O O

fuzzy measures
imprecise probabilities
nonlinear integrals
information fusion


Finding, Frequent Closed Itemsets in Sliding Window in Linear Time One of the most well-studied problems in data mining is computing the collection of frequent itemsets in large transactional databases. Since the introduction of the Famous Apriori algorithm [14], many others have been proposed to find the frequent itemsets. Among Such algorithms, the approach of mining closed itemsets has raised much interest in data mining community. The algorithms taking this approach include TITANIC 181, CLOSET+ [6], DCI-Closed[4], FCI-Stream [3]. GC-Tree [15], TGC-Tree[16] etc. Among these algorithms, FCI-Stream, GC-Tree and TGC-Tree are online algorithms work under sliding window environments. By the performance evaluation in [16]. GC-Tree 1151 is the fastest one. In this paper, an improved algorithm based on GC-Tree is proposed. the computational complexity of which is proved to be a linear combination of the average transaction size and the average closed itemset size. The algorithm is based oil the essential theorem presented in Sect. 4.2. Empirically, the new algorithm is several orders of Magnitude faster than the state of art algorithm, GC-Tree.

O O B I O O O O O O O O O O O O O B 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 B I O O O O O O O B 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

frequent itemsets
closed itemsets
data mining


accelerating apl programs with sac The paper investigates, how S AC , a purely functional language based on C syntax, relates to A PL in terms of expressiveness and run-time behavior. To do so, three different excerpts of real world A PL programs are examined. It is shown that after defining the required A PL primitives in S AC , the example programs can be re-written in S AC with an almost one-to-one correspondence. Run-time comparisons between interpreting A PL programs and compiled S AC programs show that speedups due to compilation vary between 2 and 500 for three representative benchmark programs.

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 B O O O O O O O O O O


Analysis of a retrial queuing model with MAP arrivals and two types of customers In this paper, we consider a queuing model in which two types of customers, say, Types 1 and 2, arrive according to a Markovian arrival process (MAP). Type 1 customers have a buffer of capacity K and are served in groups of varying sizes ranging from a predetermined value L to a maximum size, K. The service times are exponentially distributed. Type 2 customers are served one at a time and the service times are assumed to be exponential. The system has two servers, of which one is totally dedicated to serving Type 2 customers. The other server can serve both Types 1 and 2 customers. Any arriving Type 1 customer finding the buffer full is considered lost. Any Type 2 customer not-entering into service immediately orbit in an infinite space. These orbiting customers compete for service by sending out signals that are exponentially distributed. The steady state probability vector of this queuing model is of matrix-geometric type with a highly sparse rate matrix. This sparsity is exploited in the analysis and several interesting numerical examples are discussed. The Laplace-Stieltjes transform LST of the waiting time distribution of a Type 1 customer at an arrival epoch is derived. (C) 2003 Elsevier Science Ltd. All rights reserved.

O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


An improved list decoding algorithm for the second order Reed-Muller codes and its applications We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order Reed-Muller code RM(2, m), of length n = 2(m), and we analyse its theoretical and practical complexity. This improvement allows a better theoretical complexity. Moreover, we conjecture another complexity which corresponds to the results of our simulations. This algorithm has the strong property of being deterministic and this fact drives us to consider some applications, like determining some lower bounds concerning the covering radius of the RM(2, m) code.

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 O O O O O O O O O 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

reed-muller codes
boolean functions
cryptography


Radio-Frequency Current Density Imaging Based on a 180 degrees Sample Rotation With Feasibility Study of Full Current Density Vector Reconstruction Radio-frequency current density imaging (RF-CDI) is a technique that noninvasively measures current density distributions at the Larmor frequency utilizing magnetic resonance imaging. Previously implemented RF-CDI methods reconstruct the applied current density component J(z) along the static magnetic field of the imager (B) over right arrow (0) (the z direction) based on the assumption that the z-directional change of the magnetic field component H(z) can be ignored compared to J(z). However, this condition may be easily violated in biomedical applications. We propose a new reconstruction method for RF-CDI, which does not rely on the aforementioned assumption. Instead, the sample is rotated by 180 degrees in the horizontal plane to collect magnetic resonance data from two opposite positions. Using simulations and experiments, we have verified that this approach can fully recover one component of current density. Furthermore, this approach can be extended to measure three dimensional current density vectors by one additional sample orientation in the horizontal plane. We have therefore demonstrated for the first time the feasibility of imaging the magnitude and phase of all components of a radio-frequency current density vector field.

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

current density imaging (cdi)
magnetic resonance imaging (mri)
radio-frequency cdi (rf-cdi)


AAOP-based dynamically reconfigurable monitoring system A key aspect of resource management is efficient and effective deployment of available resources whenever needed. The issue typically covers two areas: monitoring of resources used by software systems and managing the consumption of resources. A key aspect of each monitoring system is its reconfigurability the ability of a system to limit the number of resources monitored at a given time to those that are really necessary at any particular moment. The authors of this article propose a fully dynamic and reconfigurable monitoring system based on the concept of Adaptable Aspect-Oriented Programming (AAOP) in which a set of AOP aspects is used to run an application in a manner specified by the adaptability strategy. The model can be used to implement systems that are able to monitor an application and its execution environment and perform actions such as changing the current set of resource management constraints applied to an application if the application/environment conditions change. Any aspect that implements a predefined interface may be used by the AAOP-based monitoring system as a source of information. The system utilizes the concept of dynamic AOP, meaning that the aspects (which are sources of information) may be dynamically enabled/disabled.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

adaptive software
adaptive monitoring
aspect composition


Modernising healthcare - is the NPfIT for purpose? This paper responds to the findings of the research by Currie and Guah on the introduction of the National Programme for Information Technology through an institutional theory perspective. It considers both the appropriateness and applicability of the method chosen in the light of what is already known about UK healthcare organisations and the complex and changing process that is involved in both the organisation and any research that takes place. This is further confounded by an unstable political environment both nationally and locally and a failure to understand the changing location, role and status of the medical record. Only when this is resolved will a transformational change occur, in line with the new patient- focused government agenda and the external world of technology that must engage with the emotional as well as the rational role that both technology and health play in people's lives.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


Management's Role in the Approval and Administration of Decision Support Systems Decision support systems (DSS) have become an increasingly important type of computer-based information system. However, there has been limited research on management's role, in DSS approval and administration. Because of this, the authors recently investigated eighteen decision support systems and report the findings here. The specific areas explored include motivations for developing a DSS, methods for evaluating the desirability of creating a DSS, planning and organizing for building. a DSS, techniques for reviewing and controlling DSS projects, and managing a DSS as an organizational entity.

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

decision support systems (dss)
system planning and management
administrative policies
operating procedures


Horizontal two-phase jet behavior with an annular nozzle ejector in the water tank The behavior of gasliquid two-phase jets has been extensively studied over many years, due to their fundamental importance in many multiphase systems. Understanding jet behaviors is essential for predicting many processes of practical importance. The objective of this study is to investigate horizontal airwater jet behavior with an annular nozzle ejector in a shallow water tank and to present the effect of overall jet behavior on oxygen transfer characteristics from air bubbles to water. The experimental apparatus consisted of an electric motor-pump, an annular nozzle ejector assembly, a high-speed camera unit, a circulation water tank, and measuring or controlling accessories. The images of the airwater mixed jet issuing from the ejector are analyzed qualitatively, and the dissolved oxygen concentration is measured using the clean water unsteady state technique. The horizontal mixed jet behaves like a buoyancy jet, a quasi-horizontal bubble jet, or a horizontal momentum jet owing to the momentum of the primary flow and air bubble size. It can be concluded that the higher the momentum of primary water flow and the lower the entrainment ratio, the smaller the air bubble size. The buoyancy force of the air bubble and the penetration of the mixed flow are found to be important parameters for the oxygen transfer rate owing to the contact area and time of the two phases.

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 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 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

horizontal two-phase jet
buoyancy and momentum jet
air entrainment


Multi-objective control for stochastic model reference systems based on LMI approach and sliding mode control concept In this article, a multi-objective control u(t) is designed for stochastic model reference systems to achieve the following three objectives simultaneously: the pole placement constraint, H 8-norm constraint and individual error state variance constraint. Using the invariance property of sliding mode control, the reference model input and the plant error term will disappear on the sliding mode of the error system. By combining the upper bound covariance control theory, pole placement skill and H 8-norm control theory, a controller, in which the control feedback gain matrix is synthesised utilising linear matrix inequality (LMI) approach, is derived to achieve the above multiple objectives. Furthermore, a practical example for the problem of ship yaw-motion systems is adopted to illustrate the proposed method.

O O O B I I I O O O O O B I I 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 B I I I I 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

ship yaw-motion systems
linear matrix inequality approach


New Technique: A low drift current reference based on PMOS temperature correction technology A low drift current reference based on PMOS temperature correction technology is proposed. To achieve the minimum temperature coefficient (TC), the PMOS cascode current mirror is designed as a cross structure. By exchanging the bias for two layers of the self-biased PMOS cascode structure, the upper PMOS, which is used to adjust the TC together with the resistor of the self-biased PMOS cascode structure, is forced to work in the linear region. As the proposed current reference is the on-chip current reference of a high voltage LED driver with high accuracy, it was designed using a CSMC 1 mu m 40 V BCD process. Simulation shows that the TC of the reference current was only 23.8x10(-6)/A degrees C over the temperature range of -40-120 A degrees C under the typical condition.

O O O B I B I O O O O O O O B I B I O O O O O O O O O O O O B I O O B I 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 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

current reference
cross structure
pmos cascode
temperature coefficient
low drift


A hybrid approach using two-level SOM and combined AHP rating and AHP/DEA-AR method for selecting optimal promising emerging technology Emerging technologies are playing an important role in establishing competitive advantage for technology based companies. Selecting an efficient and important emerging technology to invest in is significant to the companies also. In this study, we propose a method for selecting optimal emerging technology which is efficient, important and the most suitable to a companys actual levels of input resource among various emerging technology alternatives. In order to select optimal emerging technology, the proposed method uses two-level-SOM to cluster the emerging technology alternatives based on alternatives required levels of input resource. For selecting efficient and important promising emerging technology, the proposed method calculates emerging technology alternatives efficiency score by using AHP/DEA-AR and their importance score by using AHP rating method in each technology cluster generated by two-level-SOM. Finally, the proposed method selects optimal promising emerging technology according to a companys actual levels of input resource and each emerging technology alternatives combined scores which is calculated by adding its efficiency score and importance score. A Korean companys case of selecting optimal promising nanotechnology is employed to illustrate the proposed method. The result shows that the proposed method can provide an effective and reasonable selection of optimal promising emerging technology.

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 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 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 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 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 O O O O O O O O O O O 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

dea-ar (data envelopment analysis-assurance region)


Efficient deadline-based QoS algorithms for high-performance networks Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because, in those environments, there are different traffic types, each one having its own requirements. In that sense, deadline-based algorithms can provide powerful QoS provision. However, the cost associated with keeping ordered lists of packets makes these algorithms impractical for high-performance networks. In this paper, we explore how to efficiently adapt the Earliest Deadline First family of algorithms to high-speed network environments. The results show excellent performance using just two virtual channels, FIFO queues, and a cost feasible with today's technology.

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


Two-mode limited feedback block-fading adaptive transmission with minimum guaranteed rate in MIMO channel This paper develops an adaptive scheme relying on a part-time availability of the channel state information and supplying the constant minimum rate achievable for an arbitrary fading realization. The two-mode transmission is investigated with the instantaneous perfect channel state information being known at the transmitter in the limited portion of time. We derived a general procedure for a suitable probabilistic description of the channel under such a scheme. The first mode is without any feedback and it uses a simple uniform symbol energy assignment. The second one is the emergency mode with the perfect instantaneous channel state information. It is implemented by the channel inversion (or eigenmode sub-space channel inversion) guaranteeing the minimum required rate regardless of the channel observation. The parameters of the transmission are the total available transmitted symbol energy, the portion of time the perfect feedback channel is used, the minimum required rate, and the average symbol energy transmitted in the first and the second mode. For these cases, we have found very essential trade-off among the system parameters and also we have derived a general procedure how to evaluate long-term performance. Copyright (c) 2010 John Wiley & Sons, Ltd.

O O O O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Design trade-offs for user-level I/O architectures To address the growing I/O bottleneck, next-generation distributed I/O architectures employ scalable point-to-point interconnects and minimize operating system overhead by providing user-level access to the I/O subsystem. Reduced I/O overhead allows I/O intensive applications to efficiently employ latency hiding techniques for improved throughput. This paper presents the design of a novel scalable user-level I/O architecture and evaluates the impact of various architectural mechanisms in terms of overall performance improvement. Results demonstrate that eliminating data movement across protection domains is the dominant contributor to improved scalability. Eliminating system call and interrupt overhead only has a small additional benefit that may not justify the additional hardware support required. While this evaluation is based on one specific design, the conclusions can be generalized to other user-level I/O architectures.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

user-level
input/output devices
performance analysis
simulation


MRO-MPI: MapReduce overlapping using MPI and an optimized data exchange policy MRO-MPI is an enhanced MapReduce model using MPI for intensive data processing. We maintain the simplicity, improve the speedup and decrease the dependency. Validation was done through three application based on different parameters. Results show that our model outperformed the current Hadoop and MPI-MapReduce.

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

mpi-mapreduce
parallel mapreduce
big data
large scale data processing


recognizing and supporting roles in cscw In this paper, we describe our experience with the long-term, widespread use of CoWeb, an asynchronous collaborative tool that is mostly used to complement existing face-to-face groups (such as classes). The CoWeb is an openended tool that does not enforce or explicitly support specific roles or usage, yet several well-defined uses and roles have emerged over time. In our design methodology, we recognize these roles and refine our collaboration environment to better support them.

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

design methodology
use
collaboration environment
coweb
tool
support
experience
paper
roles

collaboration tools
cscl
asynchronicity
wiki
timing
long-term
group
website
class


Two-tier project and job scheduling for SaaS cloud service providers This study addresses a two-tier job scheduling problem for SaaS cloud service providers which rely on resources leased from IaaS cloud providers to achieve elasticity to computational power. In our model, a project represents a user request which consists of multiple jobs; the SaaS is obligated to complete projects using multiple resources leased from IaaS or PaaS providers. The goals are to reduce the project turn-around time and to support priority scheduling by employing suitable scheduling algorithms. We propose a set of two-tier backfilling algorithms which extend the well-known conservative backfilling algorithm with project slack-time and priority concepts. Among the proposed algorithms, Two-Tier Strict Backfilling (2TSB) does not allow preemption in job waiting queues. On the other hand, preemption is allowable in Two-tier Flexible Backfilling which has two versions: 2TFB and 2TFB-SF (slack factor). In 2TFB, a new incoming project can preempt waiting jobs but not waiting projects, while 2TFB-SF permits preemption in both job and project waiting queues. Two-Tier Priority Backfilling (2TPB) algorithm takes priority into account such that only high-priority projects can preempt the low-priority ones. The experimental results indicate that, compared with 2TSB, 2TPB could reduce the mean turn-around time of high-priority projects by more than 25%.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 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 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


observation-based design methods for gestural user interfaces The design of gestural user interfaces is uniquely challenging because the input is freeform, personal, and often carries subconscious meanings that are domain-specific and difficult to articulate. These features suggest an approach of observation-based design: learning from what people do, rather than relying on what they say. To facilitate observation-based design, this dissertation is exploring two design methods: gesture brainstorming, a Wizard of Oz method for early prototyping of new interfaces, and gesture log analysis, a machine learning-based log analysis method for improving existing interfaces. These design methods will be tested by applying them to two gestural interfaces: a 3D pathway selection interface (CINCH, see Figure 1), and a 3D modeler (Google SketchUp). Experience with CINCH already suggests the utility of observation-based design, while work on Google SketchUp is anticipated to begin this summer. These test cases should inform observation-based design for gestural user interfaces in general.

O O O O B I I 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 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 B I I O O

usage log analysis
observation-based design


Variable selection in high-dimensional partially linear additive models for composite quantile regression A new estimation procedure based on the composite quantile regression is proposed for the semiparametric additive partial linear models, of which the nonparametric components are approximated by polynomial splines. The proposed estimation method can simultaneously estimate both the parametric regression coefficients and nonparametric components without any specification of the error distributions. The proposed estimation method is empirically shown to be much more efficient than the popular least-squares-based estimation method for non-normal random errors, especially for Cauchy error, and almost as efficient for normal random errors. To achieve sparsity in high-dimensional and sparse additive partial linear models, of which the number of linear covariates is much larger than the sample size but that of significant covariates is small relative to the sample size, a variable selection procedure based on adaptive Lasso is proposed to conduct estimation and variable selection simultaneously. The procedure is shown to possess the oracle property, and is much superior to the adaptive Lasso penalized least-squares-based method regardless of the random error distributions. In particular, two kinds of weights in the penalty are considered, namely the composite quantile regression estimates and Lasso penalized composite quantile regression estimates. Both types of weights perform very well with the latter performing especially well in terms of precisely selecting significant variables. The simulation results are consistent with the theoretical properties. A real data example is used to illustrate the application of the proposed methods.

B I O O O O O O O B I I 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 B I 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 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 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 O O O O O O O O O O O

adaptive lasso
composite quantile regression
variable selection


A

Matlab-based

finite-difference

solver

for

the

Poisson

problem

with

mixed

DirichletNeumann

boundary

conditions

A

Matlab-based

finite-difference

numerical

solver

for

the

Poisson

equation

for

a

rectangle

and

a

disk

in

two

dimensions,

and

a

spherical

domain

in

three

dimensions,

is

presented.

The

solver

is

optimized

for

handling

an

arbitrary

combination

of

Dirichlet

and

Neumann

boundary

conditions,

and

allows

for

full

user

control

of

mesh

refinement.

The

solver

routines

utilize

effective

and

parallelized

sparse

vector

and

matrix

operations.

Computations

exhibit

high

speeds,

numerical

stability

with

respect

to

mesh

size

and

mesh

refinement,

and

acceptable

error

values

even

on

desktop

computers.

Program

title:

FDMRP

Catalogue

identifier:

Program

summary

Program

obtainable

from:

CPC

Program

Library,

Queens

University,

Belfast,

N.

Ireland

Licensing

provisions:

GNU

General

Public

License

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

Matlab

Computer:

PC,

Macintosh.

Operating

system:

Windows,

OSX,

Linux.

RAM:

bytes)

Classification:

Nature

of

problem:

To

solve

the

Poisson

problem

in

a

standard

domain

with

patchy

surface-type

(strongly

heterogeneous)

Neumann/Dirichlet

boundary

conditions.

Solution

method:

Finite

difference

with

mesh

refinement.

Restrictions:

Spherical

domain

in

rectangular

domain

or

a

disk

in

Unusual

features:

Choice

between

mldivide/iterative

solver

for

the

solution

of

large

system

of

linear

algebraic

equations

that

arise.

Full

user

control

of

Neumann/Dirichlet

boundary

conditions

and

mesh

refinement.

Running

time:

Depending

on

the

number

of

points

taken

and

the

geometry

of

the

domain,

the

routine

may

take

from

less

than

a

second

to

several

hours

to

execute.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

mixed boundary conditions
finite-difference solver
mean first passage time


digital capture for automated scanner workflows The use of scanners and other capture devices to incorporate film- and paper-based materials into digital workflows is an important part of "digital convergence", or the bringing of paper-based and electronic documents together into the same electronic workflows. The diversity of captured information-from text and mixed-type documents to photos, negatives, slides and transparencies-requires a combination of document analysis techniques to perform, automatically, the segmentation, classification and workflow assignment of the scanned images. We herein present technologies that provide fast ( 95\% job accuracy) capture solutions for all of these input content types. These solutions offer near real-time capture that provides automated workflow capabilities to a repertoire of scanning hardware: scanners, all-in-one devices, copiers and multifunctional printers. The techniques used to categorize the documents, perform zoning analysis on the documents, and then perform closed loop quality assurance on the documents are presented.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B B 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 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

photos zoning classification slides negatives scanning segmentation


Compact interdigital filters with transmission zeros in LTCC technology This article presents a simple topology for the implementation of cross-couplings between nonadjacent resonators in interdigital stripline filters. This topology affords the inclusion of transmission zeros maintaining a cross-sectional structure similar to that of a stripline. Therefore, the manufacturing cost is very close to an all-pole prototype. Two design strategies for the coupling structure are discussed: one of them achieving filters with enhanced performance. Both strategies have been assessed implementing prototypes in low-temperature cofired ceramic (LTCC) technology. The fabricated filters exhibit operating frequencies at 5775 MHz and 8000 MHz with 2.6% and 3.75% pass-band fractional bandwidths, respectively, and up to 60 dB IL in the rejection band. 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 24:560570, 2014.

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 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


Reconciling simplicity and realism in parallel disk models ? For the design and analysis of algorithms that process huge data sets, a machine model is needed that handles parallel disks. There seems to be a dilemma between simple and flexible use of such a model and accurate modeling of details of the hardware. This paper explains how many aspects of this problem can be resolved. The programming model implements one large logical disk allowing concurrent access to arbitrary sets of variable size blocks. This model can be implemented efficiently on multiple independent disks even if zones with different speed, communication bottlenecks and failed disks are allowed. These results not only provide useful algorithmic tools but also imply a theoretical justification for studying external memory algorithms using simple abstract models. The algorithmic approach is random redundant placement of data and optimal scheduling of accesses. The analysis generalizes a previous analysis for simple abstract external memory models in several ways (higher efficiency, variable block sizes, more detailed disk model).

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 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

high performance i/o
hashing
fault tolerance
randomized algorithm
chernoffhoeffding bound


A survey of recursive analysis and Moore's notion of real computation The theory of analog computation aims at modeling computational systems that evolve in a continuous space. Unlike the situation with the discrete setting there is no unified theory of analog computation. There are several proposed theories, some of them seem quite orthogonal. Some theories can be considered as generalizations of the Turing machine theory and classical recursion theory. Among such are recursive analysis and Moore's class of recursive real functions. Recursive analysis was introduced by Turing (Proc Lond Math Soc 2(42):230-265, 1936), Grzegorczyk (Fundam Math 42:168-202, 1955), and Lacombe (Compt Rend l'Acad Sci Paris 241:151-153, 1955). Real computation in this context is viewed as effective (in the sense of Turing machine theory) convergence of sequences of rational numbers. In 1996 Moore introduced a function algebra that captures his notion of real computation; it consists of some basic functions and their closure under composition, integration and zero-finding. Though this class is inherently unphysical, much work have been directed at stratifying, restricting, and comparing it with other theories of real computation such as recursive analysis and the GPAC. In this article we give a detailed exposition of recursive analysis and Moore's class and the relationships between them.

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 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 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 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 O O O O O O O O O B I O O B O O O O O O O O O B I O O O O O O O O

recursive analysis
turing machine
gpac
analog computation
function algebra


repository mining and six sigma for process improvement In this paper, we propose to apply artifact mining in a global development environment to support measurement based process management and improvement, such as SEI/CMMI's GQ(I)M and Six Sigma's DMAIC. CMM has its origins in managing large software projects for the government and emphasizes achieving expected outcomes. In GQM, organizational goals are identified. The appropriate questions with corresponding measurements are defined and collected. Six Sigma has its origins in manufacturing and emphasizes reducing cost and defects. In DMAIC, a major component of a Six Sigma approach, sources of waste are identified. Then changes are made in the process to reduce effort and increase the quality of the product produced. GQM and Six Sigma are complementary. Both approaches rely heavily on the measurement of input and output metrics. Mining development artifacts can provide usable metrics for the application of DMAIC and GQM in the software domain.

O O O B I 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 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 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 B 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 B O O O O


Understanding the experience of non contributory online participants (readers) in National College for School Leadership online communities This study explored the range of participation taking place in the National College for School Leadership (NCSL) online communities and focussed on participants who defined themselves as not actively contributing to the online discussion. We called these non-contributory participants readers Whilst we recognised that an individual community members degree of participation might simply reflect their choice, we wanted to ensure that where fuller active participation was sought, there were no system or personal barriers to prevent it. A literature review with a dual focus was therefore made, the first element being factors in the online environment that might affect participation, and the second being personal motivation where we drew especially on dynamic motivation theory. A questionnaire was constructed based on this dual review. This had questions that generated both numerical and text based responses. After a pilot study, alterations in the questionnaire were made and the revised version was sent to 2,600 recently active community members. Over 750 replies were received yielding qualitative and quantitative data. Of these, 587 identified themselves as readers and only their responses were analysed for this paper. Analysis produced a very rich picture of motivational factors affecting participation in online communities. Benefits of various types of online interaction were put forward and suggestions about barriers to online interaction were made. This paper suggests that online participation may be seen as a continuum and that non contributory online participants (readers) are a far from homogeneous group ranging from those who experience technical and personal barriers to those who value and gain much from readership. Suggestions are made to assist readers who would like to take further scaffolded steps towards the role of contributor

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 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 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 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

lurkers
legitimate peripheral participants
barriers to active participation
encouraging active participation


on the evolution of the yahoo! answers qa community While question answering communities have been gaining popularity for several years, we wonder if the increased popularity actually improves or degrades the user experience. In addition, automatic QA systems, which utilize different sources such as search engines and social media, are emerging rapidly. QA communities have already created abundant resources of millions of questions and hundreds of millions of answers. The question whether they will continue to serve as an effective source is of information for web search and question answering is of vital importance. In this poster, we investigate the temporal evolution of a popular QA community - Yahoo! Answers, with respect to its effectiveness in answering three basic types of questions: factoid, opinion and complex questions. Our experiments show that Yahoo! Answers keeps growing rapidly, while its overall quality as an information source for factoid question-answering degrades. However, instead of answering factoid questions, it might be more effective to answer opinion and complex questions.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


An approximate and efficient method for optimal rotation alignment of 3D models In many shape analysis applications, the ability to find the best rotation that aligns two models is an essential first step in the analysis process. In the past, methods for model alignment have either used normalization techniques, such as PCA alignment, or have performed an exhaustive search over the space of rotation to find the best optimal alignment. While normalization techniques have the advantage of efficiency, providing a quick method for registering two shapes, they are often imprecise and can give rise to poor alignments. Conversely, exhaustive search is guaranteed to provide the correct answer, but, even using efficient signal processing techniques, this type of approach can be prohibitively slow. In this paper, we present a new method for aligning two 3D shapes. We show that the method is markedly faster than existing approaches based on efficient signal processing and we provide registration results demonstrating that the alignments obtained using our method have a high degree of precision and are markedly better than those obtained using normalization.

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 B 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 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 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


Orthogonal ECLMS algorithm for double-talk echo cancelling In order to solve the double-talk problem in the echo cancelling for teleconference system, the authors have proposed the extended correlation least mean squares (ECLMS) algorithm. However, this algorithm does not give a fast convergence. The purpose of this paper is to derive an orthogonal ECLMS (OECLMS) with the lattice structure in order to speed up the convergence characteristics and to reduce the computational load for the adaptation. (C) 2000 IMACS. Published by Elsevier Science B.V. All rights reserved.

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 O O O O O O O O O O O O O O O O O O O O O

double-talk problem
correlation algorithm


A framework for software process deployment and evaluation Software Process Engineering promotes the systematic production of software by following a set of well-defined technical and management processes. A comprehensive management of these processes involves the accomplishment of a number of activities such as model design, verification, validation, deployment and evaluation. However, the deployment and evaluation activities need more research efforts in order to achieve greater automation. With the aim of minimizing the required time to adapt the tools at the beginning of each new project and reducing the complexity of the construction of mechanisms for automated evaluation, the Software Process Deployment & Evaluation Framework (SPDEF) has been elaborated and is described in this paper. The proposed framework is based on the application of well-known techniques in Software Engineering, such as Model Driven Engineering and Information Integration through Linked Open Data. It comprises a systematic method for the deployment and evaluation, a number of models and relationships between models, and some software tools. Automated deployment of the OpenUP methodology is tested through the application of the SPDEF framework and support tools to enable the automated quality assessment of software development or maintenance projects. Making use of the method and the software components developed in the context of the proposed framework, the alignment between the definition of the processes and the supporting tools is improved, while the existing complexity is reduced when it comes to automating the quality evaluation of software processes.

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 B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

software process engineering
information integration
linked open data

software quality
model-driven engineering