EEG signal classification using wavelet feature extraction and a mixture of expert model Mixture of experts (ME) is modular neural network architecture for supervised learning. A double-loop Expectation-Maximization (EM) algorithm has been introduced to the ME network structure for detection of epileptic seizure. The detection of epileptiform discharges in the EEG is an important component in the diagnosis of epilepsy. EEG signals were decomposed into the frequency sub-bands using discrete wavelet transform (DWT). Then these sub-band frequencies were used as an input to a ME network with two discrete outputs: normal and epileptic. In order to improve accuracy, the outputs of expert networks were combined according to a set of local weights called the gating function. The invariant transformations of the ME probability density functions include the permutations of the expert labels and the translations of the parameters in the gating functions. The performance of the proposed model was evaluated in terms of classification accuracies and the results confirmed that the proposed ME network structure has some potential in detecting epileptic seizures. The ME network structure achieved accuracy rates which were higher than that of the stand-alone neural network model.

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

electroencephalogram (eeg)
discrete wavelet transform (dwt)
expectation-maximization (em) algorithm


A world survey of artificial brain projects, Part I: Large-scale brain simulations Driven by rapid ongoing advances in computer hardware, neuroscience and computer science, Artificial Brain research and development are blossoming. This article constitutes the first half of a two-part world survey of artificial brain projects: this part dealing with large-scale brain simulations, and the second part with biologically inspired cognitive architectures (BICAs). The large-scale brain simulations we consider in depth here include those by Markram, Modha, Boahen, Horwitz, Edelman, Izhikevich, and Just. As well as reviewing the particulars of these simulation projects, we position them in a broader perspective, comparing at the different underlying definitions of the concept of simulation, noting that in many ways the projects are modeling neurosystems at different levels as well as using different methodologies.

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

artificial brains
large-scale brain simulations


Restructuring decision tables for elucidation of knowledge Decision tables are widely used in many knowledge-based and decision support systems. They allow relatively complex logical relationships to be represented in an easily understood form and processed efficiently. This paper describes second-order decision tables (decision tables that contain rows whose components have sets of atomic values) and their role in knowledge engineering to: (1) support efficient management and enhance comprehensibility of tabular knowledge acquired by knowledge engineers, and (2) automatically generate knowledge from a tabular set of examples. We show how second-order decision tables can be used to restructure acquired tabular knowledge into a condensed but logically equivalent second-order table. We then present the results of experiments with such restructuring. Next, we describe SORCER, a learning system that induces second-order decision tables from a given database. We compare SORCER with IDTM, a system that induces standard decision tables, and a state-of-the-art decision tree learner, C4.5. Results show that in spite of its simple induction methods, on the average over the data sets studied, SORCER has the lowest error rate.

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

knowledge acquisition
machine learning
representation
knowledge-based systems


Pluggable verification modules: An extensible protection mechanism for the JVM Through the design and implementation of a JVM that supports Pluggable Verification Modules (PVMs), the idea of an extensible protection mechanism is entertained. Link-time bytecode verification becomes a pluggable service that can be readily replaced, reconfigured and augmented. Application-specific verification services can be safely introduced into the dynamic linking process of the JVM. This feature is enabled by the adoption of a previously proposed modular verification architecture, Proof Linking [23, 24], which decouples bytecode verification from the dynamic linking process, rendering the verifier a replaceable module. The PVM mechanism has been implemented in an open source JVM, the Aegis VM [21]. To evaluate the software engineering and security engineering benefits of this extensible protection mechanism, an augmented type system JAC (Java Access Control) [37] has been successfully implemented as a PVM.

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

security
verification
proof linking
extensible protection mechanism
aegis vm

languages
pluggable verification modules
java virtual machine
bytecode verification
mobile code security
extensible systems


A new overview of the Trilinos project Since An Overview of the Trilinos Project [ACM Trans. Math. Softw. 31( 3) (2005),397-423] was published in 2005, Trilinos has grown significantly. It now supports the development of a broad collection of libraries for scalable computational science and engineering applications, and a full-featured software infrastructure for rigorous lean/agile software engineering. This growth has created significant opportunities and challenges. This paper focuses on some of the most notable changes to the Trilinos project in the last few years. At the time of the writing of this article, the current release version of Trilinos was 10.12.2.

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


Constructing a meta-model for assembly tolerance types with a description logic based approach Constraint relations are formalized by assertional axioms. Assembly tolerance types are defined with terminological axioms. Assembly tolerance types are generated automatically in the meta-model. The meta-model has rigorous logic-based semantics. The meta-model lays a good foundation for realizing semantic interoperability.

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

assembly tolerance types
semantic interoperability


A new hybrid active/passive sound absorber with variable surface impedance The context of the present paper is the wall treatment of flow ducts, notably aero-engine nacelle intakes and outlets. For this purpose, hybrid active/passive absorbers have been developed at the LMFA for about 15 years. A hybrid cell combines passive absorbent properties of a porous layer and active control at its rear face. Active control is mainly used to increase absorption at low frequencies by cancelling the imaginary part of the surface impedance presented by the absorber. However, the optimal impedance (i.e. the one that produces the highest noise reduction) of an absorber for flow duct applications is generally complex and frequency dependent. A new hybrid absorber intended to realise any of impedance has therefore been developed. The new cell uses one microphone on each side of a resistive cloth. Normal velocity can then be deduced by a simple pressure difference, which allows an estimation of the surface impedance of the absorber. In order to obtain an error signal related to a target impedance, the target impedance has to be reproduced in time domain. The design of a stable and causal filter is a difficult task, considering the kind of frequency response we seek. An alternative way of representing the impedance in time domain is therefore given. The new error signal is integrated into a feedback control structure. Fast convergence and good stability are observed for a wide range of target impedances. Typical optimal impedances with a positive increasing real part and a negative decreasing imaginary part have been successfully realised. Measurements in a grazing-incidence tube show that the new complex impedance absorber clearly outperforms the former active absorber.

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


A lightweight active service migration framework for computational offloading in mobile cloud computing Cloud computing enables access to the widespread services and resources in cloud datacenters for mitigating resource limitations in low-potential client devices. Computational cloud is an attractive platform for computational offloading due to the attributes of scalability and availability of resources. Therefore, mobile cloud computing (MCC) leverages the application processing services of computational clouds for enabling computational-intensive and ubiquitous mobile applications on smart mobile devices (SMDs). Computational offloading frameworks focus on offloading intensive mobile applications at different granularity levels which involve resource-intensive mechanism of application profiling and partitioning at runtime. As a result, the energy consumption cost (ECC) and turnaround time of the application is increased. This paper proposes an active service migration (ASM) framework for computational offloading to cloud datacenters, which employs lightweight procedure for the deployment of runtime distributed platform. The proposed framework employs coarse granularity level and simple developmental and deployment procedures for computational offloading in MCC. ASM is evaluated by benchmarking prototype application on the Android devices in the real MCC environment. It is found that the turnaround time of the application reduces up to 45% and ECC of the application reduces up to 33% in ASM-based computational offloading as compared to traditional offloading techniques which shows the lightweight nature of the proposed framework for computational offloading.

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

mobile application
distributed system
application offloading


Acetylcholine nicotinic receptors: finding the putative binding site of allosteric modulators using the "blind docking" approach Allosteric potentiation of acetylcholine nicotinic receptors is considered to be one of the most promising approaches for the treatment of Alzheimer's disease. However, the exact localization of the allosteric binding site and the potentiation mechanism at the molecular level are presently unknown. We have performed the "blind docking" of three known allosteric modulators (galanthamine, codeine and eserine) with the Acetylcholine Binding Protein and models of human alpha 7, alpha 3 beta 4 and alpha 4 beta 2 nicotinic receptors, created by homology modeling. Three putative binding sites were identified in the channel pore, each one showing different affinities for the ligands. One of these sites is localized opposite to the agonist binding site and is probably implicated in the potentiation process. On the basis of these results, a possible mechanism for nicotinic acetylcholine receptor (nAChRs) activation is proposed. The present findings may represent an important advance for understanding the allosteric modulation mechanism of nAChRs.

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

allosteric modulators
acetylcholine nicotinic receptors
docking


Distillation Column Control: the use of feed temperature to respond to modest variations in feed composition Mast distillation columns operate with feed temperature controlled to some fixed value at or close to the boiling point of the feed, variations in this temperature being seen as unwanted disturbances to the column. Conventional control schemes can meet top and bottom composition specifications within the scope of the column but at the price of long response times due to the considerable inventory of a column in relation to its throughput. This paper shows that by admitting the feed temperature as a control variable and using feed forward control, much faster responses can be achieved.

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


On feasible cases of checking multi-agent systems behavior The complexity of multi-agent systems behavior properties is studied. The behavior properties are formulated using classical temporal logic languages and are checked relative to the transition system induced by the multi-agent system definition. We show that there are deterministic or nondeterministic polynomial time check algorithms under some realistic structural and semantic restrictions on agent programs and actions. (C) 2002 Elsevier Science B.V. All rights reserved.

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

multi-agent system
temporal logics
model checking


Ontological analysis of whole-part relationships in OO-models Earlier semantic and formal analyses of whole-part (WP) relationships in object-oriented models have led to a framework, which distinguishes between primary, consequential, secondary and dependent characteristics of WP relationships. This paper interprets, validates and elaborates on that framework using an existing ontological theory and an associated formal model of objects. The revised framework confirms most of the original characteristics and suggests a number of additions and modifications. The analysis also grounds the characteristics in the framework and thereby suggests more precise definitions for some of them. (C) 2001 Elsevier Science B.V. All rights reserved.

object-oriented modelling
whole-part
part-whole
aggregation
ontological analysis and evaluation


Achieving Oblivious Transfer Capacity of Generalized Erasure Channels in the Malicious Model Information-theoretically secure string oblivious transfer (OT) can be constructed based on discrete memoryless channel (DMC). The oblivious transfer capacity of a channel characterizes-similarly to the (standard) information capacity-how efficiently it can be exploited for secure oblivious transfer of strings. The OT capacity of a generalized erasure channel (GEC)-which is a combination of a (general) DMC with the erasure channel-has been established by Ahlswede and Csizar at ISIT'07 in the case of passive adversaries. In this paper, we present the protocol that achieves this capacity against malicious adversaries for GEC with erasure probability at least 1/2. Our construction is based on the protocol of Crepeau and Savvides from Eurocrypt'06 which uses interactive hashing (IH). We solve an open question posed by the above paper, by basing it upon a constant round IH scheme (previously proposed by Ding et al. at TCC'04). As a side result, we show that the Ding et al. IH protocol can deal with transmission errors.

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

generalized erasure channel
interactive hashing
oblivious transfer

information-theoretic security
oblivious transfer capacity


The impact of realistic biophysical parameters for eucalypts on the simulation of the January climate of Australia Climate models use broad definitions of vegetation-based biophysical parameters that may not represent the continentally-specific nature of Australian vegetation well. This paper explores the impact on the January simulation of climate over Australia of this common simplification. First, we map the Australian distribution of vegetation types onto the default classification used in one high-resolution climate model. Second, through a search of the literature we chose replacement values for the biophysical parameters to better reflect the properties of eucalypts. Third, we choose several sets of biophysical parameters and allow these to vary regionally. We assess the impact of these changes on simulated rainfall, temperature and latent heat flux over an ensemble of six different Januaries. We find that the model simulates rainfall and temperature reasonably well over Australia in January and that replacing the default parameter set with a single set of more appropriate values degrades model performance slightly. Allowing the biophysical parameters to vary regionally leads to some small improvements in the simulation of temperature and precipitation. We find large impacts on the simulated latent heat flux. Overall, the model is not substantially improved by careful selection of eucalypt parameters. We comment that given the shortage of observed data on eucalypts and the almost total absence of biophysical parameters for other Australian vegetation types, this lack of sensitivity to the biophysical parameters is reassuring since it implies that the lack of data is not presently seriously limiting to our particular modelling capability.

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

climate modeling
regional atmospheric modeling system
atmospheric modeling
land surface processes


Application of Monte Carlo method to phase separation dynamics of complex systems We report the application of the Monte Carlo simulation to phase separation dynamics. First, we deal with the phase separation under shear flow. The thermal effect on the phase separation is discussed, and the anisotropic growth exponents in the late stage are estimated. Next, we study the effect of surfactants on the three-component solvents. We obtain the mixture of macrophase separation and microphase separation, and investigate the dynamics of both phase separations.

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

phase separation
shear flow
growth exponents
monte carlo method


Families of non-IRUP instances of the one-dimensional cutting stock problem In case of the one-dimensional cutting stock problem (CSP) one can observe for any instance a very small gap between the integer optimal value and the continuous relaxation bound. These observations have initiated a series of investigations. An instance possesses the integer round-up property (IRUP) if its gap is smaller than 1. In the last 15 years, some few instances of the CSP were published possessing a gap greater than 1. In this paper, various families of non-IRUP instances are presented and methods to construct such instances are given, showing in this way, there exist much more non-equivalent non-IRUP instances as computational experiments with randomly generated instances suggest. Especially, an instance with gap equal to is obtained. Furthermore, an equivalence relation for instances of the CSP is considered to become independent from the real size parameters.

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

one-dimensional cutting stock problem
integer round-up property


On the Use of Fake Sources for Source Location Privacy: Trade-Offs Between Energy and Privacy Wireless sensor networks have enabled novel applications such as monitoring, where security is invariably a requirement. One aspect of security, namely source location privacy, is becoming an increasingly important property of some wireless sensor network applications. The fake source technique has been proposed as an efficient technique to handle the source location privacy problem. However, there are several factors that limit the usefulness of current results: (i) the selection of fake sources is dependent on sophisticated nodes, (ii) fake sources are known a priori and (iii) the selection of fake sources is based on a prohibitively expensive pre-configuration phase. In this paper, we investigate the privacy enhancement and energy efficiency of different implementations of the fake source technique that circumvents these limitations. Our results show that the fake source technique is indeed effective in enhancing privacy. Specifically, one implementation achieves near-perfect privacy when there is at least one fake source in the network, at the expense of increased energy consumption. In the presence of multiple attackers, the same implementation yields only a 30% decrease in capture ratio with respect to flooding. To address this problem, we propose a hybrid technique which achieves a corresponding 50% reduction in the capture ratio and a near-perfect privacy whenever at least one fake source exists in the network.

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

wireless sensor networks
privacy
energy
fake sources


Reservoir description using dynamic parameterisation selection with a combined stochastic and gradient search There is a correspondence between flow in a reservoir and large scale permeability trends. This correspondence can be derived by constraining reservoir models using observed production data. One of the challenges in deriving the permeability distribution of a field using production data involves determination of the scale of resolution of the permeability. The Adaptive Multiscale Estimation (AME) seeks to overcome the problems related to choosing the resolution of the permeability field by a dynamic parameterisation selection. The standard AME uses a gradient algorithm in solving several optimisation problems with increasing permeability resolution. This paper presents a hybrid algorithm which combines a gradient search and a stochastic algorithm to improve the robustness of the dynamic parameterisation selection. At low dimension, we use the stochastic algorithm to generate several optimised models. We use information from all these produced models to find new optimal refinements, and start out new optimisations with several unequally suggested parameterisations. At higher dimensions we change to a gradient-type optimiser, where the initial solution is chosen from the ensemble of models suggested by the stochastic algorithm. The selection is based on a predefined criterion. We demonstrate the robustness of the hybrid algorithm on sample synthetic cases, which most of them were considered insolvable using the standard AME algorithm.

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

gradient optimiser
inverse problem
neighbourhood approximation algorithm
permeability estimation
reservoir simulation
stochastic search algorithm
two-phase flow


Generation of 3D shape, density, cortical thickness and finite element mesh of proximal femur from a DXA image 3D shape, vBMD and FE mesh of the proximal femur were reconstructed from a DXA image. Surface reconstruction error was 1.0?1.4mm. Use of DXA, instead of projected CT images, had no significant effect on the reconstruction accuracy. DXA-based FE agreed well with CT-based FE analysis (stiffness r2=0.85, MAC=0. 0.977). DXA-based FE analysis may help to simulate patient-specific bone mechanics.

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

shape reconstruction
bone mineral density
statistical appearance model


Compressed property suffix trees ? Property matching is a biologically motivated problem where the task is to find those occurrences of an online pattern P in a string text T (of size n), such that the matched text part satisfies some conceptual property. The property of a string is a set ? of (possibly overlapping) intervals {(s1,f1),(s2,f2),} { ( s 1 , f 1 ) , ( s 2 , f 2 ) , } corresponding to the part of text and an occurrence of a pattern P=T[i,,(i+|P|?1)] P = T [ i , , ( i + | P | ? 1 ) ] is a valid output only if T[i,,(i+|P|?1)] T [ i , , ( i + | P | ? 1 ) ] is completely contained in at least one interval (sj,fj)?? ( s j , f j ) ? ? . The indexing version of this problem was introduced by A. Amir (2008), where the text is preprocessed in O ( n log ? + n log log n ) time and an O ( n log n ) bits index, named Property Suffix Tree (PST) is maintained. PST can perform property matching in O ( | P | log ? + occ ? ) time, where occ? occ ? is the number of occurrences of P in T satisfying the property. T. Kopelowitz (2010) considered the dynamic version of this problem where intervals can be added or deleted. However, all these indexes take space linear to the size of text ( O ( n log n ) bits), which can be much more than the size of the text ( n log ? bits). In this paper, we propose the first index for property matching occupying space close to the entropy compressed space requirement of the text. Our compressed index takes |CSA|+n(2+?+o(1)) | CSA | + n ( 2 + ? + o ( 1 ) ) bits space and performs query answering in O ( t ( | P | ) + 1 ? ( 1 + occ ? ) t SA ) time, where |CSA| | CSA | is the size of compressed suffix array of T , t(|P|) t ( | P | ) be the time for searching a pattern of length |P| | P | in CSA, tSA t SA is the time for computing the suffix array value and ?>0 ? > 0 is a constant. We also introduce a dynamic index, which takes | CSA | + O ( n + | ? | log n ) bits space and performs query answering in O ( t ( | P | ) + ( 1 + occ ? ) log n ( t SA + log n / log log n ) ) time and can update (insert/delete) an interval (s,f) ( s , f ) in O ( ( f ? s ) ( log n + t SA ) ) time.

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


Evaluation of annualized agricultural nonpoint source model for a watershed in the Siwalik Hills of Nepal A study was undertaken to determine the predictive capability of Annualized Agricultural NonPoint Source (AnnAGNPS) model with respect to runoff volume, peak flows, and sediment yield from a 130.8ha watershed in the Siwalik Hills of Nepal. AnnAGNPS simulations are compared with two years of field observations from the study watershed. The model predicted the runoff volume within the range of acceptable accuracy. The event-based peak flows were overpredicted by 105% with R2 of 0.85 during calibration and 162% with R2 of 0.77 during validation. Similarly, the model overpredicted the event-based sediment yield by 59% with R2 of 0.63 during calibration and 92% with R2 of 0.59 during validation. These results show that the model performs well in simulating runoff volumes compared to the peak flows and sediment yields. It is observed that there is a need to modify or improve the estimation methods of the peak flow and sediment yield to increase the performance of the model which can aid watershed management in local conditions.

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

peak flow
sediment yield
watershed management
siwalik hills


Dynamic task scheduling using online optimization Algorithms for scheduling independent tasks on to the processors of a multiprocessor system must trade-off processor load balance, memory locality, and scheduling overhead. Most existing algorithms, however, do not adequately balance these conflicting factors. This paper introduces the Self-Adjusting Dynamic Scheduling (SADS) class of algorithms that use a unified cost model to explicitly account for these factors at runtime. A dedicated processor performs scheduling in phases by maintaining a tree of partial schedules and incrementally assigning tasks to the least-cost schedule. A scheduling phase terminates whenever any processor becomes idle, at which time partial schedules are distributed to the processors. An extension of the basic SADS algorithm, called DBSADS, controls the scheduling overhead by giving higher priority to partial schedules with more task-to-processor assignments. These algorithms are compared to two distributed scheduling algorithms within a database application on an Intel Paragon distributed-memory multiprocessor system.

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

scheduling costs
load balancing
locality management


Singularities of rational Bezier curves We prove that if an nth degree rational Bezier curve has a singular point, then it belongs to the two (n-1)th degree rational Bezier curves defined in the (n-1)th step of the de Casteljau algorithm. Moreover, both curves are tangent at the singular point. A procedure to construct Bezier curves with singularities of any order is given. (C) 2001 Elsevier Science B.V. All rights reserved.

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

singularity
discriminant
order of singular points
weights


Split-plot design for mixture experiments with process variables: A comparison of design strategies In many industrial processes with mixtures, the end-product quality depends both on the proportions of the mixture components and on the levels of the process variables. The experimental region is often just a sub-region of the entire mixture simplex, and standard mixture designs are usually not applicable. In addition, large-scale experiments are often not run in random order due to practical and economical considerations. This leads to a split-plot structure of the data, and affects both the experimental design and the statistical modelling. D-optimal designs are widely used for these kinds of restricted mixture process experiments. We have compared the performance of Doptimal designs to a less known design strategy; projection designs. Projection designs are generated from standard orthogonal designs, e.g. fractional factorials, and the mixture variables are projected onto the subspace defined by the mixture restrictions. Main focus of the comparisons is precision of coefficient estimates and predictive ability of the fitted models. It was found that the different designs have different properties when it comes to precision of coefficient estimates. While D-optimal designs produce overall good precision for all coefficients, projection designs have the possibility to proritise between coefficients, i.e. assure that some coefficients are more precisely estimated than others. The predictive abilities of the fitted models were quite similar for all the designs. (c) 2005 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 O O O O O O O O O O O O O O O O O O O O O O O O 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

projection design
d-optimal design
constrained design
split-plot


A Kleene-Schutzenberger Theorem for Trace Series over Bounded Lattices We study weighted trace automata with weights in strong bimonoids. Traces form a generalization of words that allow to model concurrency; strong bimonoids are algebraic structures that can be regarded as "semirings without distributivity". A very important example for the latter arc hounded lattices, especially non-distributive ones. We show that if both operations of the bimonoid are locally finite, then the classes of recognizable and me-rational trace series coincide and, in general, are properly contained in the class of e-rational series. Moreover, if, in addition, in the bimonoid the addition is idempotent and the multiplication is commutative, then all three classes coincide.

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

weighted automata
multi-valued logics
formal power series


Exact and heuristic algorithms for the aerial refueling parallel machine scheduling problem with due date-to-deadline window and ready times The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for fighter aircrafts (jobs) on multiple tankers (machines) to minimize the total weighted tardiness. ARSP can be modeled as a parallel machine scheduling with ready times and due date-to-deadline window to minimize total weighted tardiness. ARSP assumes that the jobs have different ready times and a due date-to-deadline window between refueling due date and a deadline to return without refueling. In this paper, we first formulate the ARSP as a mixed integer programming model. The objective function is a piece-wise tardiness cost that takes into account due date-to-deadline windows and job priorities. Since ARSP is NP-hard, two heuristics are proposed to obtain solutions in reasonable computation times, namely (1) modified ATC rule (MATC), (2) a simulated annealing method (SA). The proposed heuristic algorithms are tested in terms of solution quality and CPU time through computational experiments with data randomly generated to represent aerial refueling operations of an in-theater air operation. Solutions provided by both algorithms were compared to optimal solutions for problems with up to 12 jobs and to each other for larger problems with up to 60 jobs. The results show that, MATC is more likely to outperform SA especially when the problem size increases, although it has significantly worse performance than SA in terms of deviation from optimal solution for small size problems. Moreover CPU time performance of MATC is significantly better than SA in both cases. (C) 2011 Elsevier Ltd. All rights reserved.

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

parallel machine scheduling
total weighted tardiness
simulated annealing

due date-to-deadline window
ready time
dispatching rule


On principal component analysis in L1 Four formulations of principal component analysis in L1 norm were developed by Galpin and Hawkins (Comput. Statist. Data Anal. 5 (1987) 305), QPmax, QPmin, LPmax, and LPmin. Choulakian (Comput. Statist. Data Anal. 37 (2001)135) claimed that of the four formulations, only QPmax produces a non-trivial solution. The objective is to present counter-examples that illustrate that the QPmin and LPmin formulations also give non-trivial solutions that may be unique except for the sign.

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


Automated tools within workflows for 3D structural construction from surface and subsurface data Mainstream techniques for the construction of 3D geological models frequently rely on high-density subsurface datasets, such as 3D seismic surveys or dense 2D seismic grids. In settings where the available geological and/or geophysical data are relatively sparse, the construction of a consistent 3D structural framework is seldom straightforward and is strongly dependent on the optimization of the use of surface data. To deal with this challenge, workflows for constructing 3D models from sparse surface data have been proposed by multiple authors. This paper presents three automated techniques which optimize the use of data and enhance the time-efficiency of 3D model construction: 3D geological contact analysis, 3D dip-domain construction, and 3D isopach measurement and 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

structural modeling
orientation analysis
dip-domain


Evaluation of energy and buffer aware application mapping for networks-on-chip Networks-on-Chip (NoC) is a communication paradigm for Systems-on-Chip (SoC). NoC design flow contains many problems, one of which is called as application mapping problem, which is generally solved in the literature by considering minimization of the communication energy consumption only. Energy and Buffer Aware Application Mapping (EBAM) is a recently proposed method, which handles the application mapping issue as a joint optimization problem for minimizing the energy consumption and buffer utilization simultaneously. EBAM avoids possible high input loads on router buffers at the early mapping stage by using a priori traffic characteristics of the application. Self similarity is already an accepted model in local and wide area networks and many on-chip applications have also been proven to have self similar characteristics. EBAM therefore employs self similar traffic in its joint optimization process and a genetic algorithm is already proposed for its solution. This paper presents a simulation study that evaluates EBAM in terms of network parameters such as buffer utilization and end-to-end delay. For this, a self-similar traffic generator module is implemented first on a well known NoC simulator and then buffer utilization of routers and end-to-end delay under self similar traffic are observed. Simulation results show that the method enhances buffer utilization and end-to-end delay against a reasonable energy trade off. A routing protocol selection task follows the mapping stage in a typical NoC design flow hence our paper also presents a computational study that evaluates the effect of EBAM use on commonly encountered on-chip routing algorithms. Results reveal that simple XY routing protocol, compared to others, performs better on mappings obtained by EBAM, which indicates that the need for complicated routing protocols may be eliminated.

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

application mapping
buffer utilization
self similar traffic


On the practical importance of the SSP property for Runge-Kutta time integrators for some common Godunov-type schemes We investigate through analysis and computational experiment explicit second and third-order strong-stability preserving (SSP) Runge-Kutta time discretization methods in order to gain perspective on the practical necessity of the SSP property. We consider general theoretical SSP limits for these schemes and present a new optimal third-order low-storage SSP method that is SSP at a CFL number of 0.838. We compare results of practical preservation of the TVD property using SSP and non-SSP time integrators to integrate a class of semi-discrete Godunov-type spatial discretizations. Our examples involve numerical solutions to Burgers' equation and the Euler equations. We observe that 'well-designed' non-SSP and non-optimal SSP schemes with SSP coefficients less than one provide comparable stability when used with time steps below the standard CFL limit. Results using a third-order non-TVD CWENO scheme are also presented. We verify that the documented SSP methods with the number of stages greater than the order provide a useful enhanced stability region. We show by analysis and by numerical experiment that the non-oscillatory third-order reconstructions used in (Liu and Tadmor Numer. Math. 1998; 79:397-425, Kurganov and Petrova Numer. Math. 2001; 88:683-729) are in general only second-and first-order accurate, respectively. Copyright © 2005 John Wiley & Sons, Ltd.

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

strong stability preserving
total variation diminishing
runge-kutta methods
high-resolution
hyperbolic conservation laws
godunov
central schemes
riemann solvers


Development of maraviroc, a CCR5 antagonist for treatment of HIV, using a novel tropism assay Assays to identify infectious organisms are critical for diagnosis and enabling the development of therapeutic agents. The demonstration that individuals with a 32-bp deletion within the CCR5 locus were resistant to human immunodeficiency virus (HIV) infection, while those heterozygous for the mutation progressed more slowly, led to the discovery of maraviroc (MVC), a CCR5 antagonist. As MVC is only active against CCR5-tropic strains of HIV, it was critical to develop a diagnostic assay to identify appropriate patients. Trofile, a novel phenotypic tropism assay, was used to identify patients with CCR5-tropic virus for the MVC development program. Results of these clinical studies demonstrated that the assay correctly identified patients likely to respond to MVC. Over time, the performance characteristics of the phenotypic assay were enhanced, necessitating retesting of study samples. Genotypic tropism tests that have the potential to allow for local use and more rapid turnaround times are also being developed.

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


Beyond the Online/Offline Divide: How Youth's Online and Offline Civic Activities Converge In this article, the authors investigate whether and how young people combine online and offline civic activities in modes of participation. The authors discuss four participation modes in which online and offline activities may converge: Politics, Activism, Consumption, and Sharing. Applying confirmatory factor analysis to survey data about the civic participation among Dutch youth (aged 15-25 years; N = 808), the authors find that online and offline activities are combined in the Politics, Activism, and Sharing modes, and that these three modes correlate significantly with each other. Conversely, the Consumption mode can only be validated as a separate offline participation mode. The results confirm the conclusion of previous studies that youth's participation patterns are relatively dependent of mode, and add that their participation is concurrently relatively independent of place (offline vs. online).

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

modes of civic participation
online participation


A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs A graph is distance hereditary if it preserves distances in all its connected induced subgraphs. The MINIMUM FILL-IN problem is the problem of finding a chordal supergraph with the smallest possible number of edges. The TREEWIDTH problem is the problem of finding a chordal embedding of the graph with the smallest possible clique number. In this paper we show that both problems are solvable in linear time for distance hereditary graphs.

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

distance hereditary graphs
treewidth
linear time algorithm

minimum fill-in
chordal graphs
fragment tree
tree representation


Reduced transition metal oxides as electron injection layers in hybrid-PLEDs Here we report on the improved performance of hybrid polymer light emitting diodes (HyPLEDs) upon inserting an ultra thin layer of partially reduced tungsten oxide (WO2.5) or molybdenum oxide (MoO2.7), deposited (by heating a W or Mo filament while hydrogen was flowing through the chamber) at the polymer/Al cathode interface. Improved current densities, luminances and efficiencies were achieved as a result of improved electron injection and transport at its interface with Al. The observed electron injection improvement is attributed to the lowering of the effective cathode interfacial barrier due to the occupation of gap states with electrons after partial reduction.

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

hybrid polymer light emitting diodes
reduced transition metal oxides
reduction


Stochastic adaptive control model for traffic signal systems An adaptive control model of a network of signalized intersections is proposed based on a discrete-time, stationary, Markov decision process. The model incorporates probabilistic forecasts of individual vehicle actuations at downstream inductance loop detectors that are derived from a macroscopic link transfer function. The model is tested both on a typical isolated traffic intersection and a simple network comprised of five four-legged signalized intersections, and compared to full-actuated control. Analyses of simulation results using this approach show significant improvement over traditional full-actuated control, especially for the case of high volume, but not saturated, traffic demand.

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

adaptive control
traffic signal systems
traffic


A Similarity Measure for Image and Volumetric Data Based on Hermann Weyl's Discrepancy The paper focuses on similarity measures for translationally misaligned image and volumetric patterns. For measures based on standard concepts such as cross-correlation, L(p)-norm, and mutual information, monotonicity with respect to the extent of misalignment cannot be guaranteed. In this paper, we introduce a novel distance measure based on Hermann Weyl's discrepancy concept that relies on the evaluation of partial sums. In contrast to standard concepts, in this case, monotonicity, positive-definiteness, and a homogenously linear upper bound with respect to the extent of misalignment can be proven. We show that this monotonicity property is not influenced by the image's frequencies or other characteristics, which makes this new similarity measure useful for similarity-based registration, tracking, and segmentation.

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

mutual information
registration
tracking
similarity measure

similarity of images
normalized cross correlation
autocorrelation
discrepancy norm
image processing


Existence and uniqueness theorem for uncertain differential equations Canonical process is a Lipschitz continuous uncertain process with stationary and independent increments, and uncertain differential equation is a type of differential equations driven by canonical process. This paper presents some methods to solve linear uncertain differential equations, and proves an existence and uniqueness theorem of solution for uncertain differential equation under Lipschitz condition and linear growth condition.

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

uncertain process
differential equation
existence and uniqueness theorem


simple and effective link-time optimization of modula-3 programs Modula-3 supports development of modular programs by separating an object's interface from its implementation. This separation induces a runtime overhead in the implementation of objects, because it prevents the compiler from having complete information about a program's type hierarchy. This overhead can be reduced at link time, when the entire type hierarchy becomes available. We describe opportunities for link-time optimization of Modula-3, present two link-time optimizations that reduce the runtime costs of Modula-3's opaque types and methods, and show how link-time optimization could provide C++ which the benefits of opaques types at no additional runtime cost. Our optimization techniques are implemented in mld, a retargetable linker for the MIPS, SPARC, and Intel 486, mld links a machine-independent intermediate code that is suitable for link-time optimization and code generation. Linking intermediate code simplifies implementation of the optimizations and makes it possible to evaluate them on a wide range of architectures. mld's optimizations are effective: they reduce the total number of instructions executed by up to 14\% and convert as many as 79\% of indirect calls to direct calls.

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

direct modular links runtime linking code types implementation cost

timing optimization
developer
object
interfaces
hierarchies
timing
informal
evaluation
program
method
optimality
architecture
instruction
compilation
effect
code generation
completeness


A recursive construction for new symmetric designs We introduce a recursive construction of regular Handamard matrices with row sum 2h for h = +/- 3(n). Whenever q = (2h - 1)(2) is a prime power, we construct, for every positive integer m, a symmetric designs with parameters (4h(2)(q(m+1) - 1)/(q - 1), (2h(2) - h) q(m), (h(2) - h) q(m)).

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

regular hadamard matrix
symmetric design
balanced generalized weighing matrix


Token-ordered LRU: an effective page replacement policy and its implementation in Linux systems Most computer systems use a global page replacement policy based on the LRU principle to approximately select a Least Recently Used page for a replacement in the entire user memory space. During execution interactions, a memory page can be marked as LRU even when its program is conducting page faults. We define the LRU pages under such a condition as false LRU pages because these LRU pages are not produced by program memory reference delays, which is inconsistent with the LRU principle. False LRU pages can significantly increase page faults, even cause system thrashing. This poses a more serious risk in a large parallel systems with distributed memories because of the existence of coordination among processes running on individual node. In the case, the process thrashing in a single node or a small number of nodes could severely affect other nodes running coordinating processes, even crash the whole system. In this paper, we focus on how to improve the page replacement algorithm running on one node. After a careful study on characterizing the memory usage and the thrashing behaviors in the multi-programming system using LRU replacement. we propose an LRU replacement alternative, called token-ordered LRU, to eliminate or reduce the unnecessary page faults by effectively ordering and scheduling memory space allocations. Compared with traditional thrashing protection mechanisms such as load control, our policy allows more processes to keep running to support synchronous distributed process computing. We have implemented the token-ordered LRU algorithm in a Linux kernel to show its effectiveness.

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

global lru replacement
performance evaluation


stretch-based tetrahedral mesh manipulation We present a novel least scaling distortion metric to measure the deformation distortion for tetrahedral meshes. The stretch-like metric is a combination of Jacobian matrix norm and tetrahedron volume and has the properties of good shape preservation and rotation invariance. Based on our metric, we propose a uniform non-linear optimization solution to a variety of tetrahedral mesh manipulation applications including shape deformation, interpolation, deformation transfer, and deformation learning. Our approach can produce volume preserving and flip free tetrahedral mesh results, which performs much better than the previous tetrahedral manipulation approaches. We also demonstrate an efficient and practical application using free-form deformation technique. The object is embedded in a rough control tetrahedral mesh and deformed by editing the tetrahedral mesh with various constraints. Each vertex of the object can be obtained by its barycentric coordinates according to its embedding tetrahedron of the control tetrahedral mesh.

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

volume distortion metric
free-form deformation
shape manipulation


New progress in real and complex polynomial root-finding ? Matrix methods are increasingly popular for polynomial root-finding. The idea is to approximate the roots as the eigenvalues of the companion or generalized companion matrix associated with an input polynomial. The algorithms also solve secular equation. QR algorithm is the most customary method for eigen-solving, but we explore the inverse Rayleigh quotient iteration instead, which turns out to be competitive with the most popular root-finders because of its excellence in exploiting matrix structure. To advance the iteration we preprocess the matrix and incorporate Newtons linearization, repeated squaring, homotopy continuation techniques, and some heuristics. The resulting algorithms accelerate the known numerical root-finders for univariate polynomial and secular equations, and are particularly well suited for the acceleration by using parallel processing. Furthermore, even on serial computers the acceleration is dramatic for numerical approximation of the real roots in the typical case where they are much less numerous than all complex roots.

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

polynomial root-finding
companion matrices
dpr1 matrices
eigenvectors
rayleigh quotients
homotopy continuation methods


Type 2 diabetes in East Asians: similarities and differences with populations in Europe and the United States There is an epidemic of diabetes in Asia. Type 2 diabetes develops in East Asian patients at a lower mean body mass index (BMI) compared with those of European descent. At any given BMI, East Asians have a greater amount of body fat and a tendency to visceral adiposity. In Asian patients, diabetes develops at a younger age and is characterized by early ? cell dysfunction in the setting of insulin resistance, with many requiring early insulin treatment. The increasing proportion of young-onset and childhood type 2 diabetes is posing a particular threat, with these patients being at increased risk of developing diabetic complications. East Asian patients with type 2 diabetes have a higher risk of developing renal complications than Europeans and, with regard to cardiovascular complications, a predisposition for developing strokes. In addition to cardiovascularrenal disease, cancer is emerging as the other main cause of mortality. While more research is needed to explain these interethnic differences, urgent and concerted actions are needed to raise awareness, facilitate early diagnosis, and encourage preventive strategies to combat these growing disease burdens.

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

type 2 diabetes
east asians
diabetic complications
visceral adiposity

chinese
japanese
koreans
pathophysiology
genetics
? cell function
gestational diabetes


Automatic surface inspection using wavelet reconstruction In this paper, we present a multiresolution approach for the inspection of local defects embedded in homogeneous textured surfaces. The proposed method does not rely on the extraction of local textural features in a pixel-by-pixel basis. It is based on an efficient image restoration scheme using the wavelet transforms. By properly selecting the smooth subimage or the combination of detail subimages in different decomposition levels for backward wavelet transform, the reconstructed image will remove regular, repetitive texture patterns and enhance only local anomalies. Then, a simple thresholding can be used to discriminate between defective regions and homogeneous regions in the reconstructed image. This converts the difficult defect detection in complicated textured images into a simple binary thresholding in nontextured images. Effects of different wavelet bases, the number of multiresolution levels, the decomposed subimages used for reconstruction, and the change in image rotation on defect detection are thoroughly evaluated and discussed based on the experiment on a variety of real textures including machined surfaces, natural wood, textile fabrics, sandpaper and leather.

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

surface inspection
defect detection
wavelet transform

textured surface
image reconstruction
multiresolution analysis


on the efficiency and optimality of dixon-based resultant methods Structural conditions on polynomial systems are developed for which the Dixon-based resultant methods often compute exact resultants. For cases when this cannot be done, the degree of the extraneous factor in the projection operator computed using the Dixon-based methods is typically minimal. A method for constructing a resultant matrix based on a combination of Sylvester-dialytic and Dixon methods is proposed. A heuristic for variable ordering for this construction often leading to exact resultants is developed.

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

multiplier matrices
sylvester-type matrices
support
dialytic method
bezoutians
dixon method
bkk bound


small-world datacenters In this paper, we propose an unorthodox topology for datacenters that eliminates all hierarchical switches in favor of connecting nodes at random according to a small-world-inspired distribution. Specifically, we examine topologies where the underlying nodes are connected at the small scale in a regular pattern, such as a ring, torus or cube, such that every node can route efficiently to nodes in its immediate vicinity, and amended by the addition of random links to nodes throughout the datacenter, such that a greedy algorithm can route packets to far away locations efficiently. Coupled with geographical address assignment, the resulting network can provide content routing in addition to traditional routing, and thus efficiently implement key-value stores. The irregular but self-similar nature of the network facilitates constructing large networks easily using prewired, commodity racks. We show that Small-World Datacenters can achieve higher bandwidth and fault tolerance compared to both conventional hierarchical datacenters as well as the recently proposed CamCube topology. Coupled with hardware acceleration for packet switching, small-world datacenters can achieve an order of magnitude higher bandwidth than a conventional datacenter, depending on the network traffic.

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

network topology
small-world network
datacenter network


application of packet assembly technology to digital video and voip The Internet is composed of many kinds of networks and the networks are composed of network nodes such as routers. Routers use processor power for forwarding each packet with any size. At that time, node processor would be a bottleneck in respect to the high throughput if there would be too many packets to forward. Then, authors propose the packet assembly method. This aims to decrease the number of packets for the reduction of processor load, based on the fact that there are many packets much smaller than maximum transferable unit in backbone network. For the examination of the packet assembly, authors conducted two experiments. One is the experiment that conducts the packet assembly method for the traffic of digital video, and it provides the comparison of the image of digital video forwarded via routers without packet assembly with the one with packet assembly, and transition of edge router load and core router load. The other is the experiment that conducts the packet assembly method for the traffic of VoIP, and investigated about the influence on PSQM score, latency, and jitter.

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


An evaluation of the adequacy of project network generators with systematically sampled networks This paper evaluates and compares different network generators to generate project scheduling problem instances based on indicators measuring the topological network structure. We review six topological network indicators in order to describe the detailed structure of a project network. These indicators were originally developed by [L.V. Tavares, J.A. Ferreira and J.S. Coelho, The risk of delay of a project in terms of the morphology of its network, European Journal of Operational Research 119 (1999), 510537] and have been modified, or sometimes completely replaced, by alternative indicators to describe the network topology. The contribution of this paper is twofold. Firstly, we generate a large amount of different networks with four project network generators. Our general conclusions are that none of the network generators are able to capture the complete feasible domain of all networks. Additionally, each network generator covers its own network-specific domain and, consequently, contributes to the generation of data sets. Secondly, we perform computational results on the well-known resource-constrained project scheduling problem to prove that our indicators are reliable and have significant, predictive power to serve as complexity indicators.

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


Optimization of an industrial three phase distillation column train with experimental verification An industrial plant was optimized with the help of synthesis methods, By the use of these methods new flow sheets could be developed and, furthermore, by a simulation tool the developed improved structure alternatives were analysed and valued. For the validation of the simulation tool and for the verification of the structure alternatives a pilot plant was built. First experimental results will be shown.

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

three phase distillation
simulation tool

synthesis of flow sheets
experimental validation


Aging analysis in large-scale wireless sensor networks ? Most research on the lifetime of wireless sensor networks has focused primarily on the energy depletion of the very first node. In this study, we analyze the entire aging process of the sensor network in a periodic data gathering application. In sparse node deployments, it is observed that the existence of multiple alternate paths to a sink leads to a power law relation between connectivity to a sink and hop levels, where the probability of connection to a sink decreases in proportion to the hop level with an exponent, when device failures occur over time. Then, we provide distance-level analysis for the dense deployment case by taking into account the re-construction of a data gathering tree and workload shift caused by the energy depletion of nodes with larger workload. Extensive simulation results obtained with a realistic wireless link model are compared to our analytical results. Finally, we show through an analysis of the aging of first-hop nodes that increasing node density with a fixed radio range does not affect the network disconnection time.

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

wireless sensor networks
aging process
data gathering tree
connectivity

reliability
residual energy
network lifetime


Three-dimensional simulation of the construction process of the Zipingpu concrete face rockfill dam based on a generalized plasticity model Concrete face rockfill dams (CFRDs) are becoming a widely used type of rockfill dam in China. In many cases, the design and construction of CFRDs are based primarily on precedent and engineering judgments. Few numerical or analytical methods have been developed to properly evaluate the deformation of CFRDs, which is important for dam safety and for subsequent evaluation of seismic performance. In this study, a finite element procedure was developed to simulate the construction process of a CFRD, using the Zipingpu CFRD in China as an illustrative example. The Zipingpu dam was subjected to a strong earthquake in 2008, and can be used as a benchmark problem to assess the safety of CFRD. It is thus important to the engineering community to establish the state of stressstrain in the dam prior to the earthquake. A generalized plasticity model was modified to better model the rockfill materials, and the interfaces between face slabs and cushions are modeled using zero-thickness interface elements that follow a hyperbolic stressstrain model in the tangential direction. The model parameters were calibrated by large-scale triaxial tests and direct shear tests performed on materials used in the dam. The step-by-step construction followed by subsequent impounding of the reservoir was simulated in the numerical procedure. The numerical results agree well with in situ monitoring records of dam settlements, indicating that a three-dimensional finite element procedure based on a modified generalized plasticity model and a hyperbolic interface model can be used to evaluate the deformation of CFRDs.

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

generalized plasticity
concrete face rockfill dam
construction


Uniform convergence and a posteriori error estimation for assumed stress hybrid finite element methods Assumed stress hybrid methods are known to improve the performance of standard displacement-based finite elements and are widely used in computational mechanics. The methods are based on the HellingerReissner variational principle for the displacement and stress variables. This work analyzes two existing 4-node hybrid stress quadrilateral elements due to Pian and Sumihara [T.H.H. Pian, K. Sumihara, Rational approach for assumed stress finite elements, Int. J. Numer. Methods Engrg. 20 (9) (1984) 16851695] and due to Xie and Zhou [X.P. Xie, T.X. Zhou, Optimization of stress modes by energy compatibility for 4-node hybrid quadrilaterals, Int. J. Numer. Methods Engrg. 59 (2004) 293313], which behave robustly in numerical benchmark tests. For the finite elements, the isoparametric bilinear interpolation is used for the displacement approximation, while different piecewise-independent 5-parameter modes are employed for the stress approximation. We show that the two schemes are free from Poisson-locking, in the sense that the error bound in the a priori estimate is independent of the relevant Lam constant ?. We also establish the equivalence of the methods to two assumed enhanced strain schemes. Finally, we derive reliable and efficient residual-based a posteriori error estimators for the stress in L2-norm and the displacement in H1-norm, and verify the theoretical results by some numerical experiments.

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

assumed stress hybrid method
hellingerreissner principle
poisson-locking
a posteriori estimator


Applying linear interaction energy method for binding affinity calculations of podophyllotoxin analogues with tubulin using continuum solvent model and prediction of cytotoxic activity Podophyllotoxin and its analogues have important therapeutic value in the treatment of cancer, due to their ability to induce apoptosis in cancer cells in a proliferation-independent manner. These ligands bind to colchicine binding site of tubulin near the ?- and ?-tubulin interface and interfere with tubulin polymerization. The binding free energies of podophyllotoxin-based inhibitors of tubulin were computed using a linear interaction energy (LIE) method with a surface generalized Born (SGB) continuum solvation model. A training set of 76 podophyllotoxin analogues was used to build a binding affinity model for estimating the free energy of binding for 36 inhibitors (test set) with diverse structural modifications. The average root mean square error (RMSE) between the experimental and predicted binding free energy values was 0.56kcal/mol which is comparable to the level of accuracy achieved by the most accurate methods, such as free energy perturbation (FEP) or thermodynamic integration (TI). The squared correlation coefficient between experimental and SGBLIE estimates for the free energy for the test set compounds is also significant (R2=0.733). On the basis of the analysis of the binding energy, we propose that the three-dimensional conformation of the A, B, C and D rings is important for interaction with tubulin. On the basis of this insight, 12 analogues of varying ring modification were taken, tested with LIE methodology and then validated with their experimental potencies of tubulin polymerization inhibition. Low levels of RMSE for the majority of inhibitors establish the structure-based LIE method as an efficient tool for generating more potent and specific inhibitors of tubulin by testing rationally designed lead compounds based on podophyllotoxin derivatization.

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

podophyllotoxin
free energy of binding
binding affinity
linear interaction energy

surface generalized born continuum salvation model


QoS-friendly wavelength assignment in dynamic wavelength-routed optical networks In-band crosstalk has been widely considered as a major transmission impairment that significantly impacts the bit error rate ( BER) performance of lightpaths in circuit-switched all-optical wavelength-routed networks. Such crosstalk usually occurs when multiple wavelengths pass through an optical crossconnect node, and the magnitude of the crosstalk is largely dependent on the wavelengths assigned to the lightpaths. Traditional wavelength assignment ( WA) schemes pay little regard to the physical layer quality of service ( QoS), and hence cannot provide optimized network performance in practical networks with imperfect physical transmission media. In this paper, we. first present our categorization of in-band crosstalk based on the location of crosstalk generation, then we propose two QoS-friendly WA approaches, one of which selects the wavelength based on the estimated BERs, and the other based on the weighted crosstalk number counting. The two approaches have different computation complexities. Numerical results show that both approaches can significantly improve the BER blocking rate by suppressing the created in-band crosstalk, but the BER-based approach generally gives the better performance at the price of more extensive computation.

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


A system identification analysis of neural adaptation dynamics and nonlinear responses in the local reflex control of locust hind limbs Nonlinear type system identification models coupled with white noise stimulation provide an experimentally convenient and quick way to investigate the often complex and nonlinear interactions between the mechanical and neural elements of reflex limb control systems. Previous steady state analysis has allowed the neurons in such systems to be categorised by their sensitivity to position, velocity or acceleration (dynamics) and has improved our understanding of network function. These neurons, however, are known to adapt their output amplitude or spike firing rate during repetitive stimulation and this transient response may be more important than the steady state response for reflex control. In the current study previously used system identification methods are developed and applied to investigate both steady state and transient dynamic and nonlinear changes in the neural circuit responsible for controlling reflex movements of the locust hind limbs. Through the use of a parsimonious model structure and Monte Carlo simulations we conclude that key system dynamics remain relatively unchanged during repetitive stimulation while output amplitude adaptation is occurring. Whilst some evidence of a significant change was found in parts of the systems nonlinear response, the effect was small and probably of little physiological relevance. Analysis using biologically more realistic stimulation reinforces this conclusion.

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

nonlinear system identification
local reflex response
volterra
motor neuron


SINGULAR FRACTIONAL LINEAR SYSTEMS AND ELECTRICAL CIRCUITS A new class of singular fractional linear systems and electrical circuits is introduced. Using the Caputo definition of the fractional derivative, the Weierstrass regular pencil decomposition and the Laplace transformation, the solution to the state equation of singular fractional linear systems is derived. It is shown that every electrical circuit is a singular fractional system if it contains at least one mesh consisting of branches only with an ideal supercapacitor and voltage sources or at least one node with branches with supercoils.

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

singular
fractional system
regular pencil
supercapacitor


A discontinuous enrichment method for capturing evanescent waves in multiscale fluid and fluid/solid problems An evanescent wave is produced when a propagating incident wave impinges on an interface between two media or materials at a sub-critical angle. The sub-scale nature of such a wave makes it difficult to be captured computationally. In this paper, the Discontinuous Enrichment Method (DEM) developed in [C. Farhat, I. Harari, L.P. Franca, The discontinuous enrichment method, Comput. Methods Appl. Mech. Engrg. 190 (2001) 64556479; C. Farhat, I. Harari, U. Hetmaniuk, A discontinuous Galerkin method with Lagrange multipliers for the solution of Helmholtz problems in the mid-frequency regime, Comput. Methods Appl. Mech. Engrg. 192 (2003) 13891419; C. Farhat, I. Harari, U. Hetmaniuk, The discontinuous enrichment method for multiscale analysis, Comput. Methods Appl. Mech. Engrg. 192 (2003) 31953210; C. Farhat, R. Tezaur, P. Weidemann-Goiran, Higher-order extensions of a discontinuous Galerkin method for mid-frequency Helmholtz problems, Int. J. Numer. Methods Engrg. 61 (2004) 19381956; C. Farhat, P. Wiedemann-Goiran, R. Tezaur, A discontinuous Galerkin method with plane waves and Lagrange multipliers for the solution of short wave exterior Helmholtz problems on unstructured meshes. New computational methods for wave propagation, Wave Motion 39(4) (2004) 307317; L. Zhang, R. Tezaur, C. Farhat, The discontinuous enrichment method for elastic wave propagation in the medium-frequency regime, Int. J. Numer. Methods Engrg. 66 (2006) 20862114; R. Tezaur, C. Farhat, Three-dimensional discontinuous Galerkin elements with plane waves and Lagrange multipliers for the solution of mid-frequency Helmholtz problems, Int. J. Numer. Methods Engrg. 66 (2006) 796815] is extended to a class of evanescent wave problems. New DEM elements are constructed by enriching polynomial approximations with free-space evanescent solutions in order to achieve high accuracy for problems with fluid/fluid or fluid/solid interfaces on which evanescent waves may occur. The new DEM elements are applied to the solution of various two-dimensional model problems with evanescent waves. Their performance is observed to be better than that of the basic Helmholtz type DEM elements, and superior to that of the classical higher-order polynomial finite element method.

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

discontinuous galerkin
enrichment
evanescent waves
helmholtz
lagrange multipliers
multiscale
wave propagation


exploring personal broadcast channels for rich media sharing in close relationships Building on the Internet (IP) platforms available on mobile devices and personal computers (PCs), we implemented a service called weConnect that facilitates broadcast of content via dedicated and personal media channels. weConnect includes simple tools for integrating content into media 'mixes' and provides 'content viewers' for ubiquitous access to weConnect channels via mobile, desktop, and other IP enabled devices. In this paper we present an exploratory user study based on deployment of the weConnect service among individuals in close relationships. The study focuses on the user perception and experience with the 'always-on' channels, delivering personalized content. We started with images, text, and animations as familiar and easily accessible media. We observed a high level of reciprocity in creating and exchanging expressive content and a need for persistence, reuse, and notification of content delivery. The users voiced their enthusiasm for receiving personalized media across mobile and desktop devices. The always-on nature of the weConnect channels raised new requirements for the service design to assist content producers with creating streams of personalized media efficiently and to enable recipients to view the content flexibly.

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

broadcast channel
desktop client
sustained connection
mobile service
web service


Safety and usability evaluation of a web-based insulin self-titration system for patients with type 2 diabetes mellitus The rising incidence of type 2 diabetes mellitus (T2DM) induces severe challenges for the health care system. Our research group developed a web-based system named PANDIT that provides T2DM patients with insulin dosing advice using state of the art clinical decision support technology. The PANDIT interface resembles a glucose diary and provides advice through pop-up messages. Diabetes nurses (DNs) also have access to the system, allowing them to intervene when needed. The objective of this study was to establish whether T2DM patients can safely use PANDIT at home. To this end, we assessed whether patients experience usability problems with a high risk of compromising patient safety when interacting with the system, and whether PANDIT's insulin dosing advice are clinically safe. The study population consisted of patients with T2DM (aged 1880) who used a once daily basal insulin as well as DNs from a university hospital. The usability evaluation consisted of think-aloud sessions with four patients and three DNs. Video data, audio data and verbal utterances were analyzed for usability problems encountered during PANDIT interactions. Usability problems were rated by a physician and a usability expert according to their potential impact on patient safety. The usability evaluation was followed by an implementation with a duration of four weeks. This implementation took place at the patients homes with ten patients to evaluate clinical safety of PANDIT advice. PANDIT advice were systematically compared with DN advice. Deviating advice were evaluated with respect to patient safety by a panel of experienced physicians, which specialized in diabetes care. We detected seventeen unique usability problems, none of which was judged to have a high risk of compromising patient safety. Most usability problems concerned the lay-out of the diary, which did not clearly indicate which data entry fields had to be entered in order to obtain an advice. 27 out of 74 (36.5%) PANDIT advice differed from those provided by DNs. However, only one of these (1.4%) was considered unsafe by the panel. T2DM patients with no prior experience with the web-based self-management system were capable of consulting the system without encountering significant usability problems. Furthermore, the large majority of PANDIT advice were considered clinically safe according to the expert panel. One advice was considered unsafe. This could however easily be corrected by implementing a small modification to the system's knowledge base.

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

clinical decision support systems
self care
diabetes mellitus type 2


web document text and images extraction using dom analysis and natural language processing Web has emerged as the most important source of information in the world. This has resulted in need for automated software components to analyze web pages and harvest useful information from them. However, in typical web pages the informative content is surrounded by a very high degree of noise in the form of advertisements, navigation bars, links to other content, etc. Often the noisy content is interspersed with the main content leaving no clean boundaries between them. This noisy content makes the problem of information harvesting from web pages much harder. Therefore, it is essential to be able to identify main content of a web page and automatically isolate it from noisy content for any further analysis. Most existing approaches rely on prior knowledge of website specific templates and hand-crafted rules specific to websites for extraction of relevant content. We propose a generic approach that does not require prior knowledge of website templates. While HTML DOM analysis and visual layout analysis approaches have sometimes been used, we believe that for higher accuracy in content extraction, the analyzing software needs to mimic a human user and understand content in natural language similar to the way humans intuitively do in order to eliminate noisy content. In this paper, we describe a combination of HTML DOM analysis and Natural Language Processing (NLP) techniques for automated extractions of main article with associated images from web pages.

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

dom trees
html documents
image extraction
web page text extraction


Generalized Gauss-Radau and Gauss-Lobatto formulae Computational methods are developed for generating Gauss-type quadrature formulae having nodes of arbitrary multiplicity at one or both end points of the interval of integration. Positivity properties of the boundary weights are investigated numerically, and related conjectures are formulated. Applications are made to moment-preserving spline approximation.

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

gauss-radau quadrature
gauss-lobatto quadrature
multiple boundary node(s)
moment-preserving spline approximation


Elastic image registration using hierarchical spatially based mean shift In this paper, a novel estimation technique for corresponding points using a hierarchical, spatially based mean shift algorithm is proposed. We proposed a spatially based probability estimation using different spatial masks. For a given point on reference image, its corresponding register point is found along the search trajectory generated by optimizing Bhattacharyya coefficient between two windows centered at the points on the register and reference images. The outliers are further eliminated by analyzing statistical information on the displacements of the candidate register points. Experiments on various monomodal medical images show that the proposed method is feasible and fast.

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

image registration
mean shift
probability estimation

corresponding control point
similarity measure


Analysis of a spatial gene expression database for sea anemone Nematostella vectensis during early development The spatial distribution of many genes has been visualized during the embryonic development in the starlet sea anemone Nematostella vectensis in the last decade. In situ hybridization images are available in the Kahi Kai gene expression database, and a method has been developed to quantify spatial gene expression patterns of N. vectensis. In this paper, gene expression quantification is performed on a wide range of gene expression patterns from this database and descriptions of observed expression domains are stored in a separate database for further analysis.

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

nematostella vectensis
gene expression quantification
embryonic development
gene expression database

cluster analysis
in situ hybridization (ish)