Two-Factor Remote Authentication Protocol with User Anonymity Based on Elliptic Curve Cryptography In order to provide secure remote access control, a robust and efficient authentication protocol should realize mutual authentication and session key agreement between clients and the remote server over public channels. Recently, Chun-Ta Li proposed a password authentication and user anonymity protocol by using smart cards, and they claimed that their protocol has satisfied all criteria required by remote authentication. However, we have found that his protocol cannot provide mutual authentication between clients and the remote server. To realize real mutual authentication, we propose a two-factor remote authentication protocol based on elliptic curve cryptography in this paper, which not only satisfies the criteria but also bears low computational cost. Detailed analysis shows our proposed protocol is secure and more suitable for practical application.

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

authentication
key agreement
user anonymity
elliptic curve


A study on the performance of local search versus population-based methods for mesh router nodes placement problem Node placement problems have been long investigated in the optimization field due to numerous applications in facility location, logistics, services, etc. Such problems are attracting again the attention of researchers now from the networking domain, and more especially from Wireless Mesh Networks (WMNs) field. Indeed, the placement of mesh routers nodes appears to be crucial for the performance and operability of WMNs, in terms of network connectivity and stability. However, node placement problems are known for their hardness in solving them to optimality, and therefore heuristics methods are approached to near-optimally solve such problems. In this work we evaluate the performance of different heuristic methods in order to judge on their suitability of solving mesh router nodes problem. We have selected methods from two different families, namely, local search methods (Hill Climbing and Simulated Annealing) and population-based methods (Genetic Algorithms). The former are known for their capability to exploit the solution space by constructing a path of visited solutions, while the later methods use a population of individuals aiming to largely explore the solution space. In both cases, a bi-objective optimization consisting in the maximization of the size of the giant component in the mesh routers network (for measuring network connectivity) and that of user coverage are considered. In the experimental evaluation, we have used a benchmark of instances-varying from small to large size-generated using different distributions of mesh node clients (Uniform, Normal, Exponential and Weibull).

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

wireless mesh networks
local search
genetic algorithms
user coverage


Autuomated effect-specific mammographic pattern measures We investigate the possibility to develop methodologies for assessing effect specific structural changes of the breast tissue using a general statistical machine learning framework. We present an approach of obtaining objective mammographic. pattern measures quantifying a specific biological effect, such as hormone replacement therapy (HRT). We compare results using this approach to using standard density measures. We show that the proposed method can quantify both age related effects and effects caused by HRT. Age effects are significantly detected by our method where standard methodologies fail. The separation of HRT subpopulations using our approach is comparable to the best methodology, which is interactive.

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

mammograms
pattern classification
structural change


Preconditioned multiwavelet Galerkin boundary element solution of Laplace's equation In this paper, we study the boundary element solution of Laplace's equation using a Galerkin method with multiwavelet basis functions. This leads to significant matrix compression, requiring computation of only O ( n log n ) elements. We also develop a block diagonal preconditioner for the discrete single layer potential which reduces the condition number of the matrix from O(n) O ( n ) to O(log2n) O ( log 2 n ) . We provide numerical results supporting our theory.

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

multiwavelets
boundary element equations
laplace's equation


Instructing in generalized knowledge structures to develop flexible problem solving skills In contrast to routine knowledge and skills, flexible problem solving is associated with the ability to apply ones knowledge structures in relatively new situations. In the absence of specific knowledge-based guidance, such processes could be very cognitively demanding. This paper suggests that learning flexible problem solving skills could be enhanced by explicitly instructing learners in generalized forms of schematic knowledge structures that are applicable to a greater variety of problems. The paper presents results of an experimental study that has investigated this approach in learning the operation of a technical device, and discusses implications of these results for the design of computer-based instruction.

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

general-to-specific approach to instruction


On the security of a certificateless online/offline signcryption for Internet of Things With the development of the Internet of Things (IOT) application, information security and user privacy protection in the IOT have attracted wide attention across the globe. To solve this problem, Luo et al. proposed an efficient certificateless online/offline signcryption (COOSC) scheme for IOT. They have also demonstrated that their scheme is provably in the random oracle model. However, in this paper, we will show their scheme is vulnerable to the private key compromised problem, i.e., an adversary could get a users private key through an intercepted message. The analysis show that Luo et al.s scheme is not suitable for the IOT.

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

certificateless cryptography
online/offline signcryption
bilinear pairing


Study

of

plasma

mechanisms

of

hybrid

a-SiOC:H

low-k

film

deposition

from

decamethylcyclopentasiloxane

and

cyclohexene

oxide

The

deposition

of

hybrid

a-SiOC:H

dielectric

films

from

decamethylcyclopentasiloxane/cyclohexene

oxide/helium

plasmas

has

been

investigated

in

various

operating

conditions.

In

order

to

understand

the

influence

of

molecule

fragmentation

on

the

film

formation,

the

species

in

the

plasma

were

monitored

by

optical

emission

spectroscopy

and

mass

spectroscopy.

The

films

were

analyzed

with

spectroscopic

ellipsometry

and

Fourier

transform

infrared

spectroscopy.

The

CHO

molecule

loss

rate

under

fragmentation

and

film

formation

was

always

much

higher

than

that

of

with

the

ratio

depending

on

the

plasma

conditions.

The

CHO

was

found

to

lose

at

least

CO,

CH,

H

and

groups

whereas

main

reactions

in

plasma

occurred

through

and

CH

bond

dissociation,

leaving

its

cyclic

structure

unaltered.

This

suggested

that

different

hydrocarbon

fragments

got

incorporated

in

the

film

thanks

to

the

presence

of

CHO

in

the

gas

feed

compared

to

alone

deposited

films.

Moreover

some

SiOSi

structure

indicated

a

high

level

of

the

cycle

preservation

in

the

film.

The

deposition

rate

increased

linearly

with

RF

plasma

power

for

films

and

for

films.

It

was

enhanced

by

the

presence

of

CHO

in

the

plasma.

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


Spiking neuro-fuzzy clustering system and its memristor crossbar based implementation This study proposes a spiking neuro-fuzzy clustering system based on a novel spike encoding scheme and a compatible learning algorithm. In this system, we utilize an analog to binary encoding scheme that properly maps the concept of distance in multi-dimensional analog spaces to the concept of dissimilarity of binary bits in the equivalent binary spaces. When this scheme is combined with a novel binary to spike encoding scheme and a proper learning algorithm is applied, a powerful clustering algorithm is produced. This algorithm creates flexible fuzzy clusters in its analog input space and modifies their shapes to different convex shapes during the learning process. This system has plausible biological support due to its spike-based learning mechanism, its Quasi Spike Time Dependent Plasticity learning policy and its brain-like fuzzy clustering performance. Moreover, this neuro-fuzzy system is fully implementable on the hybrid memristor-crossbar/CMOS platform. The resultant circuit was simulated on one clustering task carried out in the binary input space on the Simon Lucas handwritten dataset and another clustering task carried out in the analog input space on Fisher?s Iris standard dataset. The results show that it attained a higher clustering rate in comparison with other algorithms such as the Self Organizing Map, K-mean and the Spiking Radial Basis Function. The circuit was also successfully simulated on an image segmentation task and some clustering tasks performed in noisy spaces with various cluster sizes. Furthermore, the circuit variability analysis shows that device and signal variations up to 20% had no significant impact on the circuit?s clustering performance, so the system is sufficiently immune to different variations due to its fuzzy nature.

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

qstdp quasi spike time dependent plasticity


BYY harmony learning on finite mixture: Adaptive gradient implementation and a floating RPCL mechanism In tackling the learning problem on a set of finite samples, Bayesian Ying-Yang (BYY) harmony learning has developed a new learning mechanism that makes model selection implemented either automatically during parameter learning or in help of evaluating a new class of model selection criteria. In this paper, parameter learning with automated model selection has been studied for finite mixture model via an adaptive gradient learning algorithm for BYY harmony learning on a specific bidirectional architecture (BI-architecture). Via theoretical analysis, it has shown that the adaptive gradient learning implements a mechanism of floating rival penalized competitive learning (RPCL) among the components in the mixture. Also, the simulation results are demonstrated well for the adaptive gradient algorithm on the sample data sets from Gaussian mixtures with certain degree of overlap. Moreover, the adaptive gradient algorithm is applied to classification of the Iris data and unsupervised color image segmentation.

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

harmony learning
finite mixture
rival penalized competitive learning

bayesian ying-yang system
clustering analysis


Newton methods for parametric surface registration. Part I. Theory Surface registration is the process of determining the rigid body transformation that relocates a set of three-dimensional Cartesian coordinates as close as possible to a corresponding surface model. This procedure is used in free-form surface inspection, computer vision, and a wide variety of other applications. Newton methods for non-linear numerical minimization are rarely applied to this problem because of the high cost of computing the first and second derivatives through finite difference methods. This paper presents an approach to reduce this cost by providing analytic formulas for the derivatives. The resulting Newton methods are more efficient and accurate than those implemented in past research and have distinct advantages compared to the registration methods most widely used today. In this first part, the formulation of the analytic derivatives is presented along with a discussion of their application in various Newton methods.

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


Introducing facilitymetrics: a first review and analysis of commonly used measures of scientific leadership among synchrotron radiation facilities worldwide Big Science accelerator complexes are no longer mere tools for nuclear and particle physics, but modern-day experimental resources for a wide range of natural sciences and often named instrumental to scientific and technological development for innovation and economic growth. Facilities compete on a global market to attract the best users and facilitate the best science, and advertise the achievement of their users as markers of quality and productivity. Thus a need has risen for (quantitative) quality assessment of science on the level of facilities. In this article, we examine some quantitative performance measurements frequently used by facilities to display quality: technical reliability, competition for access, and publication records. We report data from the worlds three largest synchrotron radiation facilities from the years 20042010, and discuss their meaning and significance by placing them in proper context. While we argue that quality is not possible to completely capture in these quantitative metrics, we acknowledge their apparent importance and, hence, we introduce and propose facilitymetrics as a new feature of the study of modern big science, and as a new empirical focus for scientometrical study, in the hope that future studies can contribute to a deeper, much-needed analysis of the topic.

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

big science
synchrotron radiation facilities
quality assessment
productivity


A fuzzy clustering algorithm with spatial robust estimation constraint for noisy color image segmentation In this paper, we introduce two enhanced Fuzzy C-Means (FCM) clustering algorithms with spatial constraints for noisy color image segmentation. The Rank M-type L (RM-L) and L-estimators are used to obtain the sufficiently spatial information of the pixels. These estimators are involved into the FCM algorithm to provide robustness for the proposed segmentation schemes. The performance of the proposed algorithms is tested in real images under different noise conditions by simulating salt and pepper, Gaussian, and speckle noises, as well as with two mixtures of them. Simulation results indicate that the proposed methods consistently outperform other color image segmentation algorithms used as comparative. Additionally, the proposed algorithms are tested for segmenting a remote sensing image, where the noise is not known beforehand implied. Finally, the proposed algorithms have the robustness and effectiveness needed for image segmentation in the presence and absence of noise.

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

fuzzy c-means
rm-l-estimator
l-estimator
color images
segmentation noise


Finding \(k\) most favorite products based on reverse top-\(t\) queries A reverse top-t query for a product returns a set of customers, named potential customers, who regard the product as one of their top-t favorites. Given a set of customers with different preferences on the features of the products, we want to select at most \(k\) products from a pool of candidate products such that their total number of potential customers is maximized. Two versions of the problem are defined according to whether the competitive existing products are given. For solving this NP-hard problem, we first propose an incremental greedy approach to find an approximate solution of the problem with quality guaranteed. For further speeding up this basic greedy approach, we exploit several properties of the top-\(t\) queries and skyline queries to reduce the solution space of the problem. In addition, an upper bound of the potential customers is estimated to reduce the cost of computing the reverse top-\(t\) queries for the candidate products. Finally, when the candidate products are formed from multiple component tables, we propose a strategy to reduce the number of the accessed tuples in the component tables such that only the tuples that are possibly components of the top-\(t\) favorites of the customers need to be accessed. By applying these pruning strategies, we propose another faster greedy approach. The experiment results demonstrate that the proposed pruning strategies work very well and make the faster greedy algorithms for both versions of the problem achieve excellent performance on both efficiency and memory utilization.

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

reverse top-\(t\) query
query processing
maximum coverage problem


Fast DOA estimation based on a split subspace decomposition on the array covariance matrix A novel real-valued root multiple signal classification (RV-root-MUSIC) algorithm for estimating the direction-of-arrival (DOA) of multiple narrow-band signals is presented. Compared with the conventional root-MUSIC with a complex subspace decomposition on the entire array covariance matrix (ACM), RV-root-MUSIC exploited a split subspace decomposition on either the real-part of ACM (R-ACM) or the imaginary-part of ACM (I-ACM) with real-valued computations. Unlike the unitary root-MUSIC (U-root-MUSIC) with exploitations on the centro-Hermitian property of ACM, the proposed method developed a new result showing that R-ACM shares the same null subspace with I-ACM, which collides with the intersection of the original noise subspace and its conjugate one. Thanks to the real coefficients, the roots of RV-root-MUSIC appear in conjugate pairs, which allows fast rooting with only real-valued computations. Therefore, both subspace decomposition and polynomial rooting can be implemented with real-valued computations, which hence results in a significant reduction in computational cost as compared to root-MUSIC and U-root-MUSIC. Simulations are conducted to verify the effectiveness of the new technique.

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

real-valued root multiple signal classification (rv-root-music)


Improvement of grey models by least squares In this paper, we present an approach to the least squares solution to grey Verhulst model, and verify its feasibility by numerical examples. We also present the least squares solutions of grey models GM (1,1) and GM (2,1). For the convenience of applications in expert systems, the parameters computing formulas of grey models are also presented here. We carry out some numerical examples to examine the modeling precision of grey models in conventional way and in least squares. The numerical results reveal that the modeling precision of grey models in least squares is always better than that in conventional way.

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

grey models
least squares
verhulst model


Tuning a two-round group key agreement In 2007, Bohli et al. (Int J Inf Secur 6:243254, 2007) proposed a two-round group key agreement protocol in the random oracle model, which in addition to semantic security offers strong entity authentication and a security guarantee against malicious insiders. We suggest a modification of this protocol that preserves the security guarantees and the round complexity, but reduces the amount of data that has to be sent and also reduces the number of signature computations and verifications by 50%. Moreover, we propose a variant of Bohli et al.s protocol whose security analysis does not require a random oracle or other idealizing assumptions.

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


Rivals for the crown: Reply to Opthof and Leydesdorff We reply to the criticism of Opthof and Leydesdorff on the way in which our institute applies journal and field normalizations to citation counts. We point out why we believe most of the criticism is unjustified, but we also indicate where we think Opthof and Leydesdorff raise a valid point.

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

bibliometric indicator
crown indicator
field normalization
research performance assessment


Deriving real-time action systems in a sampling logic Action systems have been shown to be applicable for modelling and constructing systems in both discrete and hybrid domains. We present a novel semantics for action systems using a sampling logic that facilitates reasoning about the truly concurrent behaviour between an action system and its environment. By reasoning over the apparent states, the sampling logic allows one to determine whether a state predicate is definitely or possibly true over an interval. We present a semantics for action systems that allows the time taken to sample inputs and evaluate expressions (and hence guards) into account. We develop a temporal logic based on the sampling logic that facilitates formalisation of safety, progress, timing and transient properties. Then, we incorporate this logic to the method of enforced properties, which facilitates stepwise refinement of action systems. Crown Copyright (C) 2012 Published by Elsevier B.V. All rights reserved.

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

sampling logic
action systems
temporal logic
enforced properties

program refinement
derivation
true concurrency
safety-critical systems


Differential radio map-based robust indoor localization While wireless local area network-based indoor localization is attractive, the problems concerning how to capture the signal-propagating character in the complex dynamic environment and how to accommodate the receiver gain difference of different mobile devices are challenging. In this article, we solve these problems by modeling them as common mode noise and develop a localization algorithm based on a novel differential radio map approach. We propose a differential operation to improve the performance of the radio map module, where the location is estimated according to the difference of received signal strength (RSS) instead of RSS itself. The particle filter algorithm is adopted to realize the target localization and tracking task. Furthermore, to calculate the particle weight at arbitrary locations, we propose a local linearization technique to realize continuous interpolation of the radio map. The indoor experiment results demonstrate the effectiveness and robustness of our approach.

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

indoor localization
differential radio map
rss
particle filter


Commentary: Failure-rate functions for doubly-truncated random variables Navarro and Ruiz [1] express the nonparametric maximum likelihood estimator (NPMLE) of the distribution of a failure-time random variable as a function of the NPMLE of generalized failure-rate functions. These generalized failure-rate functions are equal to the probability density functions of a doubly-truncated failure-time random variable at the endpoints of the truncating interval. Readers can infer from this paper that this simple estimator can be applied to a doubly-truncated sample of failure times. This commentary explains why that estimator does not apply to the general setting in which the observed failure times are doubly-truncated with subject-specific truncating intervals. A doubly-truncated sample of times to brain tumor progression illustrates the deviation of that estimator [1] from the NPMLE for these data. Definitions quasar: unusually luminous objects found in remote areas of the universe; stellar object: nonquasar object; redshift: the shift in an object's spectral lines toward the red end, indicating how fast the object is moving away from the observer.

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


Hyperanalytic denoising A new threshold rule for the estimation of a deterministic image immersed in noise is proposed. The full estimation procedure is based on a separable wavelet decomposition of the observed image, and the estimation is improved by introducing the new threshold to estimate the decomposition coefficients. The observed wavelet coefficients are thresholded, using the magnitudes of wavelet transforms of a small number of "replicates" of the image. The "replicates" are calculated by extending the image into a vector-valued hyperanalytic signal. More than one hyperanalytic signal may be chosen, and either the hypercomplex or Riesz transforms are used, to calculate this object. The deterministic and stochastic properties of the observed wavelet coefficients of the hyperanalytic signal, at a fixed scale and position index, are determined. A "universal" threshold is calculated for the proposed procedure. An expression for the risk of an individual coefficient is derived. The risk is calculated explicitly when the "universal" threshold is used and is shown to be less than the risk of "universal" hard thresholding, under certain conditions. The proposed method is implemented and the derived theoretical risk reductions substantiated.

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

hilbert transform
image denoising
2-d analytic
wavelets


Numerical modelling of a high-speed rigid rotor in a single-aerostatic bearing using modified Euler equations of motion Accurate rotordynamic analysis is critical in the achievement of efficient rotary machine design, however the majority of models concern flexible shafts with concentrated supports. The modified Euler equations of motion are used in a numerical model to calculate the natural frequencies and whirl amplitudes of a rigid rotor supported by a single-aerostatic bearing. The bearing is modelled with a non-constant stiffness distribution along its length and a non-symmetric centre of gravity. The results are compared with experimental modal analysis (EMA).

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

numerical modelling
modified euler equations
rigid rotor

gyroscopic forces
overhung
aerostatic bearing


on throughput in linear wireless networks This paper investigates fundamental properties of throughput and energy cost in large wireless linear networks with very limited local resources that do not grow with the size of the network. The maximum throughput of the network is derived and the arrival process that maximizes throughput, given a fixed arrival rate, is established. An asymptotically critical loading regime is identified such that the probability of an arbitrary packet being lost is strictly within (0, 1) as the network size increases. Such a regime delivers throughput comparable to the maximum at a reasonable energy cost. The paper also establishes the asymptotic network energy cost under this critical loading. These results are then used to consider a performance-cost tradeoff within an optimization problem for which the unique equilibrium point that maximizes the difference between performance benefits and costs is derived. Finally, from a mathematical perspective, the paper furthers our understanding of large stochastic linear networks for which, in general, no explicit solutions have been previously available.

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

asymptotic properties
linear loss networks
critical load
throughput properties


Hypothetical in silico model of the early-stage intermediate in protein folding This paper presents a method for determining the structure of the early stage (ES) intermediate in the multistage protein folding process. ES structure is modeled on the basis of a limited conformational subspace of the Ramachandran plot. The model distinguishes seven structural motifs corresponding to seven local probability maxima within the limited conformational subspace. Three of these are assigned to well-defined secondary structures, while the remaining four are found to represent various types of random coils. The presented heuristic approach also provides insight into the reasons behind incorrect predictions occurring when the folding process depends on external factors (e.g., ligands, ions or other proteins) rather than on the characteristics of the backbone itself. The accuracy of the presented method is estimated at around 48 %.

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


Indistinguishability and identifiability of kinetic models for the MurC reaction in peptidoglycan biosynthesis An important question in Systems Biology is the design of experiments that enable discrimination between two (or more) competing chemical pathway models or biological mechanisms. In this paper analysis is performed between two different models describing the kinetic mechanism of a three-substrate three-product reaction, namely the MurC reaction in the cytoplasmic phase of peptidoglycan biosynthesis. One model involves ordered substrate binding and ordered release of the three products; the competing model also assumes ordered substrate binding, but with fast release of the three products. The two versions are shown to be distinguishable; however, if standard quasi-steady-state assumptions are made distinguishability cannot be determined. Once model structure uniqueness is ensured the experimenter must determine if it is possible to successfully recover rate constant values given the experiment observations, a process known as structural identifiability. Structural identifiability analysis is carried out for both models to determine which of the unknown reaction parameters can be determined uniquely, or otherwise, from the ideal system outputs. This structural analysis forms an integrated step towards the modelling of the full pathway of the cytoplasmic phase of peptidoglycan biosynthesis.

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

experiment design
biomedical systems
parameter identification


Creating social entrepreneurship in local government The public sector is often considered synonym with inefficiency and a lack of motivation to be innovative. This paper seeks to contribute towards the literature surrounding social entrepreneurship in the public sector, through using institutional theory to underpin an e-Innovations model that promotes social entrepreneurship, while recognising how the adoption of innovation within the public sector is fostered. The proposed model seeks to serve as a process that threatens the conservative and risk-averse culture endemic in the public sector.

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


Density estimation for data with rounding errors Rounding of data is common in practice. The problem of estimating the underlying density function based on data with rounding errors is addressed. A parametric maximum likelihood estimator and a nonparametric bootstrap kernel density estimator are proposed. Simulations indicate that the maximum likelihood approach performs well when prior information on the functional form of the underlying distribution is available, while the kernel-type estimator attains stable and good performance in various cases. The proposed methods are further applied to detect the distributional difference of head circumferences from two Chernobyl impacted regions of Ukraine. (C) 2012 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 O O O O O O O O O O O O O O O O

bootstrapping
kernel density estimation
measurement error
fast fourier transformation
deconvolution density estimation


Communication/computation tradeoffs for prolonging network lifetime in wireless sensor networks: The case of digital signatures In the context of wireless sensor networks, computation/communication tradeoffs may appear in many aspects of the system design. In this paper, we present a linear programming framework to guide designers in effectively using these tradeoffs for prolonging network lifetime. To investigate the tradeoff in more concrete terms, as our representative problem we choose a security service; non-repudiation which can be supported with different types of digital signature algorithms. Since these algorithms have high computation and/or communication overheads, supporting non-repudiation of sensor data has been traditionally considered to be infeasible in wireless sensor networks. Using our framework, we compare three signature algorithms with respect to their effect on network lifetime in different topologies and operating conditions. We have shown that with proper algorithm selection the lifetime reduction due to the utilization of digital signatures can be as low as 10%; however, non-optimal algorithm selection can result in more than 90% lifetime reduction compared to a network not supporting non-repudiation.

O O O O B I 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 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 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 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 O O O O O O 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
digital signature
network lifetime
linear programming


structuring and supporting persistent chat conversations Persistence of conversations has been found to be a useful feature in group chat tools. When conversations are stored and made accessible to all members of a group, they can facilitate organizational memory, group awareness, and other beneficial practices. However, the lack of structure in chat conversations makes it difficult for users to read and keep track of lengthy conversation histories. To contend with this problem, we have developed a persistent chat system that incorporates a number of features which facilitate participation in long, ongoing conversations.

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


Correlation between electromigration and Cu-contact angle after de-wetting An alternative, and quicker way of assessing the electromigration (EM) reliability of Cu interconnects is investigated. It is based on observations of de-wetting and contact angle measurement of Cu thin films. Contact angle results are compared to EM tests, and the correlation between Cu de-wetting and electromigration performance is demonstrated. PVD TaNx/Ta or ALD TaN barrier layers are tested, while the seed layer is either pure copper or a CuAl1 at%. In addition, three types of barrier treatments are investigated: different exposure times to plasma of ALD TaN; tantalum flash between ALD TaN and pure copper seed deposition; ALD TaN exposure to atmospheric oxygen.

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

seed layer
ald tan
electromigration
reliability
interconnects


Hybrid prediction model with missing value imputation for medical data Proposed novel hybrid prediction model with missing value imputation. HPM-MI has improved accuracy, sensitivity, specificity, kappa and ROC on 3 datasets. The best accuracy is achieved for diabetes, hepatitis, and breast cancer datasets. MVI is one of the important step of proposed model.

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

multilayer perceptron (mlp)
k-means clustering
data mining


The curvature of the tracking frontier: A new criterion for the partial index tracking problem Index tracking aims to select portfolios that imitate the behavior of a stock index. A tracking strategy is referred to as partial when the tracking portfolio is solely formed by a subset of stocks, so enabling a substantial cost reduction in comparison with full tracking. Three criteria are usually employed in the literature when building the tracking portfolio: tracking error variance, excess return and tracking portfolio variance. This paper considers a new parameter for use with the above: frontier curvature. This criterion is not defined for a particular portfolio, but for all the portfolios that define the tracking frontier. The main implication is that a manager can satisfy different investment profiles with the same subset of stocks. The manager will therefore reduce transaction costs as all the portfolios on the frontier contain the same stocks. (C) 2011 Elsevier Ltd. All rights reserved.

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

index tracking
frontier curvature
tracking error variance


a framework and tool supports for generating test inputs of aspectj programs Aspect-oriented software development is gaining popularity with the wider adoption of languages such as AspectJ. To reduce the manual effort of testing aspects in AspectJ programs, we have developed a framework, called Aspectra, that automates generation of test inputs for testing aspectual behavior, i.e., the behavior implemented in pieces of advice or intertype methods defined in aspects. To test aspects, developers construct base classes into which the aspects are woven to form woven classes. Our approach leverages existing test-generation tools to generate test inputs for the woven classes; these test inputs indirectly exercise the aspects. To enable aspects to be exercised during test generation, Aspectra automatically synthesizes appropriate wrapper classes for woven classes. To assess the quality of the generated tests, Aspectra defines and measures aspectual branch coverage (branch coverage within aspects). To provide guidance for developers to improve test coverage, Aspectra also defines interaction coverage. We have developed tools for automating Aspectra's wrapper synthesis and coverage measurement, and applied them on testing 12 subjects taken from a variety of sources. Our experience has shown that Aspectra effectively provides tool supports in enabling existing test-generation tools to generate test inputs for improving aspectual branch coverage.

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

aspectj
coverage measurement
test generation

software testing
aspect-oriented software development
coverage criteria
aspect-oriented programs


ANN-based prediction of ferrite fraction in continuous cooling of microalloyed steels In the present study, an artificial neural networks-based model was developed to predict the ferrite fraction of microalloyed steels during continuous cooling. Fourteen parameters affecting the ferrite fraction were considered as inputs, including the cooling rate, initial austenite grain size, and different chemical compositions. The network was then trained to predict the ferrite fraction amounts as outputs. A multilayer feed-forward back-propagation network was developed and trained using experimental data form literatures. The predicted values are in very good agreement with the measured ones indicating that the developed model is very accurate and has the great ability for predicting the ferrite fraction.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 neural network (ann)
microalloyed steel
low-carbon nb steel


software designers, are you biased? Methods of representing and capturing design rationale have been studied in past years. Many meta-models, methods and techniques have been proposed. Are these software engineering methods sufficient to help designers make logical and appropriate design decisions? Studies have shown that people make biased decisions, software designers may also be subjected to such cognitive biases. In this paper, I give an overview of how cognitive biases and reasoning failures may lead to unsound design decisions. I conjecture that in order to improve the overall quality of software design, we as a community need to improve our understanding and teaching of software design reasoning.

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


Combinatorial properties of Sturmian palindromes We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.

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

sturmian word
sturmian palindrome
central word
special factor


Directional integration on unstructured meshes via supermesh construction Unstructured meshes are in widespread use throughout computational physics, but calculating diagnostics of simulations on such meshes can be challenging. For example, in geophysical fluid dynamics, it is frequently desirable to compute directional integrals such as vertical integrals and zonal averages; however, it is difficult to compute these on meshes with no inherent spatial structure. This is widely regarded as an obstacle to the adoption of unstructured mesh numerical modelling in this field. In this paper, we describe an algorithm by which one can exactly compute such directional integrals on arbitrarily unstructured meshes. This is achieved via the solution of a problem of computational geometry, constructing the supermesh of two meshes. We demonstrate the utility of this approach by applying it to a classical geophysical fluid dynamics system: the thermally driven rotating annulus. This addresses an important objection to the more widespread use of unstructured mesh modelling.

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

finite element
galerkin projection
vertical integration
zonal integration
azimuthal integration


DCR-based causal design knowledge evaluation method and system for future CAD applications This paper presents a new causal design knowledge evaluation method and system for future CAD applications. Current product development processes still include unintended feedback due to insufficient product design knowledge. Previous research on design knowledge support system focuses on search by matching keywords and file names, or search by specific indices, which has various drawbacks. Furthermore, current CAD systems need manual input to incorporate the designers knowledge. To systematize the knowledge management process for the next-generation CAD systems, a prerequisite is to capture ever-evolving causal design knowledge. In this paper, we present a new causal knowledge network evaluation method, which has not been well addressed in design knowledge support system research. For the network evaluation, we present a degree of causal representation (DCR)-based knowledge network evaluation method. In this method, causality and network connectivity are used for the causal knowledge network with weighted vertices and weighted network connectivity for a network with weighted edges. To validate the proposed method, this evaluation method has been compared with structural measures. Finally, the causal design knowledge evaluation system, KNOES, is implemented and tested with a new valve design scenario.

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

causal knowledge
degree of causal representation
network evaluation
cad

design knowledge network
network analysis


realistic and robust head-eye coordination of conversational robot actors in human tracking applications Recent advances in computing and robot technology create new opportunities for building robots with increasingly more sophisticated interactivity. One such application is the visual interaction between humans and humanoid in tasks such as mimicking and following. Achieving realistic head-eye motion of the humanoid requires understanding of human kinesiology that dictates the way human coordinate head-eye motion and the ability to control the motion of humanoid to move in the same manner that humans do. In this paper we propose an efficient head-eye motion coordination scheme using an optimization approach - an objective function is formed based on human kinesiology and then optimized for obtaining a realistic head-eye trajectory. The tracking robustness during conversational interaction with a human is further enhanced through a visual feedback scheme, which reduces modelling errors of the humanoid hardware. Experimental results show the tracking efficiency and realism of the motion generated by the proposed scheme with Lilly, a humanoid under development in our lab.

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

robotic actor
human-robot interaction
humanoid robot


Sub-10nm patterning by focused He-ion beam milling for fabrication of downscaled graphene nano devices We report a novel, hybrid fabrication process for sub-10nm patterning of graphene. It is a combination of conventional e-beam lithography and He-ion milling. He-ion milling is used to pattern the graphene flakes with intricate DQD devices. We demonstrate the first electrically characterized He-ion beam patterned graphene device. This method could pave the way to more detailed study of graphene quantum devices.

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

helium ion microscope
nanofabrication
nanoelectronics
helium ion beam milling
graphene quantum dot devices
graphene downscaled nano devices


Nanometer and high aspect ratio patterning by electron beam lithography using a simple DUV negative tone resist The micro resist technologys ma-N 2400 series DUV negative tone resist is evaluated for electron beam lithography using the Gaussian beam machine LION LV1. We could demonstrate the high resolution capability of this resist and the possibility of delineating dense patterns with high aspect ratios. Lines and spaces with dimensions down to 150 nm in an 800 nm resist layer and down to 50 nm in a 180 nm resist layer can be resolved. The patterns show steep sidewalls and demonstrate the possibility of generating resist features with high aspect ratios using a simple single-layer resist technology. The aspect ratio has a value of, at least, about 5. The exposure doses for the resist layers in these experiments range from 120 to 200 ?C/cm2 using 20 keV electrons. Exposures with electron energies less than 20 keV show that the resist sensitivity increases with decreasing electron energy. For 2.5 keV electron energy a dose of only 10 ?C/cm2 is sufficient. Due to the small penetration depth of low energy electrons only resist layers of less than 100 nm thickness can be used in the low energy range.

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

resist
electron beam lithography
high aspect ratio


improving markov chain classification using string transformations and evolutionary search Markov chain classification or n-gram modeling, as it is sometimes called, is a very common and powerful tool for many problems that involve sequences of finite tokens. It has been used in a wide range of tasks, including natural language modeling, author identification, protein similarity searches, and even bird-song recognition. Clearly, an improvement in the Markov chain classification will have broad implications in many fields. Our new system, called SCS, improves upon Markov chain classification by introducing a preprocessing step in which an arbitrary set of transformation functions are performed on the input sequences. Since the space of possible transformations is unbounded, a genetic algorithm search is used to search for functions that improve classification. We show that GA is able to consistently find preprocessing functions that substantially improve the performance of the Markov chain model.

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


an interactive run length control for simulation on pcs This paper describes an interactive procedure implementing a new confidence interval estimation technique that determines how long or how many times a simulation should be run to produce results that satisfy a relative precision criterion. It also identifies initial transients and ignores transient data points when determining run length. This technique has been implemented for use with personal computers (PCs) as an interactive program that notifies the user of estimated computation times, thus permitting the scheduling of runs or the modification of run lengths as desired.

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

scheduling use simulation interval computation data paper control user

interaction
precise
point
estimates
personal computer
relation


teaching both pl/i and fortran to beginners The overall approach to programming languages taken in the course is to use PL/I (with the PL/C compiler) during the first part of the semester to introduce programming concepts and techniques, then teach Fortran (with the WATFIV compiler) during the last part of the semester [2,3]. Except for a brief discussion of conventional flowcharts to help students read the examples in the texts, Nassi-Shneiderman structured flowcharts are used throughout the lectures and labs [4]. Algorithms are written in PL/I using DO-WHILE as the primary control structure, and GOTOs are not introduced except in Fortran.

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

help teaching structure use examples read control

concept
program
compilation
algorithm
student
programming language


A PZT actuator control of a single-link flexible manipulator based on linear velocity feedback and actuator placement This paper describes an approach for the use of smart materials, specifically, piezoelectric materials (PZT), in control of a single-link flexible manipulator. It is investigated by a Lyapunov approach that a combined scheme of PD feedback and command voltages applied to segmented PZT actuators, which are bonded to the surface of the flexible link, can effectively control the rigid body motion and at the same time, damp link vibrations. The unique features of the proposed PZT actuator control are twofolds: First, it utilizes linear in contrast to angular velocities of particular points on the link, signals which are readily available. Second, the actuator placement is examined based on the analysis of mode shape functions. Stability of the system with the proposed PZT actuator control is analyzed using a virtual joint model. Simulation and experimental results confirm these theoretical predictions. (C) 2003 Elsevier Ltd. All rights reserved.

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

flexible manipulator
pzt actuator
linear velocity
actuator placement


Model-based system design of annealing simulators We discuss several aspects of mechatronic product development processes, such as finding and evaluating design concepts and dependencies between design parameters. One of the key issues in the development of modern mechatronic systems is the benefit of consistent integration of mechanical, electrical, and electronic control and software aspects from the very beginning of the earliest design phases. Even for a single design problem defined by a given specification, different designers will probably respond with a variety of different design concepts, each of which may be acceptable in terms of meeting the specification. In the conceptual design phase, we propose that some aspects of design, such as hierarchy of parameters and modularity of the design, are analysed with conceptual models. The application presented in this paper shows the conceptual design of an experimental laboratory annealing simulator (anneal.sim-lab). Physical simulation of the annealing process requires consideration of different heating methods for various types of specimen. One critical step is the modularisation of sections (annealing, cooling, and quenching), and their geometric arrangement. We use a design structure matrix to analyse the requirements and their structure and demonstrate a realisation in a parametric 3D-CAD model. (C) 2012 Elsevier Ltd. All rights reserved.

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

model-based design
mechatronic design
experimental simulators


Solving some NP-complete problems using split decomposition ? We show how to use the split decomposition to solve some NP-hard optimization problems on graphs. We give algorithms for clique problem and domination-type problems. Our main result is an algorithm to compute a coloration of a graph using its split decomposition. Finally we show that the clique-width of a graph is bounded if and only if the clique-width of each representative graph in its split decomposition is bounded.

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

graph algorithms
graph coloring
np-complete problems
clique-width


Multiview Deblurring for 3-D Images from Light-Sheet-Based Fluorescence Microscopy We propose an algorithm for 3-D multiview deblurring using spatially variant point spread functions (PSFs). The algorithm is applied to multiview reconstruction of volumetric microscopy images. It includes registration and estimation of the PSFs using irregularly placed point markers (beads). We formulate multiview deblurring as an energy minimization problem subject to L1-regularization. Optimization is based on the regularized Lucy-Richardson algorithm, which we extend to deal with our more general model. The model parameters are chosen in a profound way by optimizing them on a realistic training set. We quantitatively and qualitatively compare with existing methods and show that our method provides better signal-to-noise ratio and increases the resolution of the reconstructed images.

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

deblurring with spatially variant point spread function (psf)

registration with irregularly placed point markers


Decision tree-based learning to predict patient controlled analgesia consumption and readjustment Appropriate postoperative pain management contributes to earlier mobilization, shorter hospitalization, and reduced cost. The under treatment of pain may impede short-term recovery and have a detrimental long-term effect on health. This study focuses on Patient Controlled Analgesia (PCA), which is a delivery system for pain medication. This study proposes and demonstrates how to use machine learning and data mining techniques to predict analgesic requirements and PCA readjustment.

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

classification
data cleaning
decision tree-based learning
patient controlled analgesia (pca)


keyword generation for search engine advertising using semantic similarity between terms An important problem in search engine advertising is key-word 1 generation. In the past, advertisers have preferred to bid for keywords that tend to have high search volumes and hence are more expensive. An alternate strategy involves bidding for several related but low volume, inexpensive terms that generate the same amount of traffic cumulatively but are much cheaper. This paper seeks to establish a mathematical formulation of this problem and suggests a method for generation of several terms from a seed keyword. This approach uses a web based kernel function to establish semantic similarity between terms. The similarity graph is then traversed to generate keywords that are related but cheaper.

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

generation
method
search engine
semantic similarity
graph
similarity
paper
traffic
search

strategies
web-based
sponsored search
search engine optimization
functional
keyword generation
advertisement


Key e-government issues in China: an empirical study based on the orientation-maturity framework The Chinese government has long been striving to promote the development of e-government by using information communication technologies (ICT) in the public sector for accelerating administrative transformation. e-Government projects in different sectors of Chinese governmental agencies, however, often start with multiple objectives and are performed in different ways. To understand the general characteristics of e-government in China, this paper investigates the key issues of e-government through a questionnaire survey, and proposes a specific analytical framework, the orientation-maturity framework for better explaining the key issues. Based on data collected from Chinese government employees, this paper ranks the key issues related to e-government and discusses the implications of the results based on the proposed framework. The findings provide a helpful reference for both practitioners and scholars to better understand the current state of e-government in China and to respond to the forthcoming challenge of administrative transformation caused by the diffusion and utilization of ICT.

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

e-government
orientation-maturity
ict diffusion


using predictive analysis to improve invoice-to-cash collection It is commonly agreed that accounts receivable (AR) can be a source of financial difficulty for firms when they are not efficiently managed and are underperforming. Experience across multiple industries shows that effective management of AR and overall financial performance of firms are positively correlated. In this paper we address the problem of reducing outstanding receivables through improvements in the collections strategy. Specifically, we demonstrate how supervised learning can be used to build models for predicting the payment outcomes of newly-created invoices, thus enabling customized collection actions tailored for each invoice or customer. Our models can predict with high accuracy if an invoice will be paid on time or not and can provide estimates of the magnitude of the delay. We illustrate our techniques in the context of real-world transaction data from multiple firms. Finally, simulation results show that our approach can reduce collection time up to a factor of four compared to a baseline that is not model-driven.

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

knowledge discovery
invoice to cash
order to cash
payment collection
predictive modeling


Simulation to estimate RF mesh parameters for the AMI in constrained bandwidth Advanced metering infrastructure (AMI) is an important and integral component of Smart Grid. AMI requires a two way communication network to connect metering and load control endpoints spread over the residential area with the head end system. The most challenging part of AMI is to design this last leg of communication network which reliably and securely fulfills the requirement of the coverage, latency, scalability and compliance to country specific standards and regulations at the right cost. RF mesh technology is a proven way to implement the AMI network and this has been proven in the USA where the RF mesh networks have been functioning satisfactorily for more than a decade in the sub 1GHz Industrial, Scientific and Medical (ISM) band with an available bandwidth of 26MHz. In comparison, India has a narrow ISM bandwidth of only 2MHz, which raises a doubt on achievement of AMI functionality within this constrained bandwidth. To carry out a high level feasibility for India, the relevant AMI data load and throughput requirements were estimated on the basis of data collected from published work and also through a survey involving Indian experts from utilities, regulatory bodies and metering companies. Based on the Pareto analysis of the estimated AMI data, the use case of interval data push by the residential meters was considered for network simulation in a real world scenario of RF mesh AMI network. Utilizing only 20% of the network capacity, for the estimated AMI data throughput of about 20MB/day, the simulation exercise resulted in an estimate of size of network accommodating about 4800 endpoints per collector based on the acceptable latency of 5s per hop.

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

rf mesh
ami
smart grid
constrained bandwidth


enforcing model network citizenship by remote administration Higher education institutions have been striving to improve services and keep pace with new technologies. In a Higher education environment, the users utilize the available computing resources 24 hours a day 7 days a week. Although we cannot have the 24 by 7 uptime guaranteed, due to issues like budget constraints, we could certainly reduce the downtime by deploying a cost effective open source network monitoring solution such as Big Brother. Commercially available network management systems are complex and expensive systems with a steep learning curve associated with them. Network management systems are popular in organizations that maintain large and complex networks. Therefore, we enhanced Big Brother solution by extending its service to support SNMP based devices.

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

network monitoring
big brother
snmp
network management

rmon
system monitoring
system reliability
monitoring


Characterization of an optical frequency-shift-keying transmitter based on carrier-suppressed phase modulation We experimentally characterize an optical frequency-shift-keying transmitter based on optical carrier-suppressed phase modulation. Only one laser source is needed to generate an optical FSK signal. The demonstration of 10-Gb/s FSK signal generation and 50-km transmission verified the improved performance of the proposed transmitter, compared with the previous two-laser schemes. To further reduce the complexity of the transmitter, the phase modulator is omitted and a single MZM modulator is used for both optical carrier-suppression (OCS) and phase modulation. This simplified structure is verified by simulation, implying the feasibility that a FSK transmitter can be constructed with only one laser source and one modulator.

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


integrating participatory sensing in application development practices With the widespread capabilities of commodity mobile devices, applications will increasingly incorporate participatory sensing functionality. Participatory sensing directly involves end-users in collecting (and ultimately sharing) information about the environment. Applications that rely on participatory sensing range from those that simply enable information sharing, to environmental monitoring and response, and route and behavior planning. As more and more applications demand the incorporation of participatory sensing, it becomes imperative to create software architectures, design patterns, and programming libraries that enable the integration of participatory sensing with software engineering theory and practice. In this position paper, we explore the new challenges that participatory sensing applications present, specifically focusing on challenges that demand a reevaluation of software engineering design principles, tools, and techniques. For these challenges, we also posit possible ways forward.

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

participatory sensing
design patterns
programming libraries
tools
techniques


ARBOLOGY: TREES AND PUSHDOWN AUTOMATA We present a unified and systematic approach to basic principles of Arbology, a new algorithmic discipline focusing on algorithms on trees. Stringology, a highly developed algorithmic discipline in the area of string processing, can use finite automata as its basic model of computation. For various kinds of linear notations of ranked and unranked ordered trees it holds that subtrees of a tree in a linear notation are substrings of the tree in the linear notation. Arbology uses pushdown automata reading such linear notations of trees as its basic model of computation. Basic principles known from stringology are used for the construction of particular arbology algorithms, in which the underlying tree structure is processed with the use of the pushdown store. Arbology results are shown for the basic problems subtree matching and tree indexing for ranked and unranked ordered trees.

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


Multi-scale Image Harmonization Traditional image compositing techniques, such as alpha matting and gradient domain compositing, are used to create composites that have plausible boundaries. But when applied to images taken from different sources or shot under different conditions, these techniques can produce unrealistic results. In this work, we present a framework that explicitly matches the visual appearance of images through a process we call image harmonization, before blending them. At the heart of this framework is a multi-scale technique that allows us to transfer the appearance of one image to another. We show that by carefully manipulating the scales of a pyramid decomposition of an image, we can match contrast, texture, noise, and blur, while avoiding image artifacts. The output composite can then be reconstructed from the modified pyramid coefficients while enforcing both alpha-based and seamless boundary constraints. We show how the proposed framework can be used to produce realistic composites with minimal user interaction in a number of different scenarios.

O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-domain compositing
poisson blending
image pyramids
visual appearance transfer


Development of remote control and monitoring of web-based distributed OPC system This paper focuses on implementing remote control and monitoring of a web-based distributed OLE for Process Control (OPC) system. Remote monitoring and control of OPC-based systems realized at N different local control points on the Internet are achieved by using a distributed OPC (DOPC) architecture. In this proposed architecture, every local control center can control and monitor every other control point. DOPC architecture is developed by using an OPC standard created for the automation industry. This OPC was developed as an industrial standard using Microsoft's Object Linking and Embedding (OLE) technology. OPC enables different control devices to communicate with each other by exchanging data. This proposed architecture permits different OPC-based process control architectures from a wide range of fields to communicate with each other. Thus, OPC-based local control systems located in different places can communicate with each other on the Internet without using bus architecture. The basic functions of the proposed system were implemented using the Delphi software package. Local control architectures developed at N points can communicate with each other and a remote control point on a dynamic web page constructed using Active Server Pages (ASP). Consequently, the proposed DOPC architecture allows the user to control and monitor local systems from any location with internet access, and to implement data exchange between N OPC points.

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


STABILITY AND KINK-ANTIKINK SOLITON SOLUTION FOR TOTAL GENERALIZED OPTIMAL VELOCITY MODEL We proposed a new car-following model named as total generalized optimal velocity model (TGOVM) based on the analysis of the previous models. TGOVM is superior to the previous models in stabilizing the uniform traffic flow by considering all the front influencing factors: headways, relative velocities, and interactions. The linear analysis result showed its superiority to the GOVM, FLOVM, and FLRVM. The nonlinear analysis method is adopted to analyze this model, which described by a differential-difference equation. The modified Korteweg-de Vries (KdV) equation is derived and the kink-antikink soliton solution is obtained near the critical point. The simulation results show that the stabilization is enhanced by the improvement.

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


The optimal diamond wheels for grinding diamond tools Grinding is the most suitable process for manufacturing good quality diamond tools. In this paper, diamond wheels have been studied. From the grinding of polycrystalline diamond (PCD) insets, the effects of certain factors such as the bonding material, the grit size and structure of a diamond wheel have been investigated. It is concluded that vitrified bond diamond wheels are the most suitable for grinding PCDs and the recommended grit size is mesh number 1000, which can get a good surface quality within an appropriate time. The wheel structure is another important factor. Rougher wheels (mesh #800, #1000) with the softer grade scale P yield a higher material removal rate (MRR) than scale Q. However, a finer wheel (mesh #1200) needs a tougher structure to promote its grinding ability and to have a higher MRR.

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

grinding
diamond wheel
polycrystalline diamond


Loopback: Exploiting collaborative caches for large-scale streaming In this paper, we propose a Loopback approach in a two-level streaming architecture to exploit collaborative client/proxy buffers for improving the quality and efficiency of large-scale streaming applications. At the upper level we use a content delivery network (CDN) to deliver video from a central server to proxy servers. At the lower level a proxy server delivers video with the help of collaborative client caches. In particular, a proxy server and its clients in a local domain cache different portions of a video and form delivery loops. In each loop, a single video stream originates at the proxy, passes through a number of clients, and finally is passed back to the proxy. As a result, with limited bandwidth and storage space contributed by collaborative clients, we are able to significantly reduce the required network bandwidth, I/O bandwidth, and cache space of a proxy. Furthermore, we develop a local repair scheme to address the client failure issue for enhancing service quality and eliminating most required repairing load at the central server. For popular videos, our local repair scheme is able to handle most of single-client failures without service disruption and retransmissions from the central server. Our analysis and simulations have shown the effectiveness of the proposed scheme.

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

content distribution
peer-to-peer streaming
video streaming


Composition of augmented marked graphs and its application to component-based system design Augmented marked graphs possess some structural characteristics which are especially desirable for modelling systems with common resources. This paper first investigates the composition of augmented marked graphs via common resource places. Special focus is placed on preservation of four properties, namely, liveness, boundedness, reversibility and conservativeness. It is then applied to component-based system design, where the system components are specified as augmented marked graphs and composed via their common resource places. Based on the preservation of properties of this composition, the liveness, boundedness, reversibility and conservativeness of the integrated system can be readily derived. Examples of manufacturing system integration are used for illustration.

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

petri net
augmented marked graph
component-based design
system synthesis


Globally guaranteed robustness adaptive fuzzy control with application on highly uncertain robot manipulators This study proposes a novel adaptive fuzzy control methodology to remove disadvantages of traditional fuzzy approximation based control. Meanwhile, the highly uncertain robot manipulator is taken as an application with either guaranteed robust tracking performances or asymptotic stability in a global sense. First, the design concept, namely, feedforward fuzzy approximation based control, is introduced for a simple uncertain system. Here the desired commands are utilized as the inputs of the Takagi-Sugeno (T-S) fuzzy system to closely compensate the unknown feedforward term required during steady state. Different to traditional works, the assumption on bounded fuzzy approximation error is not needed, while this scheme allows easier implementation architecture. Next, the concept is extended to controlling manipulators and achieves global robust tracking performances. Note that a linear matrix inequality (LMI) technique is applied and provides an easier gain design. Finally, numerical simulations are carried out on a two-link robot to illustrate the expected performances.

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


Unsupervised skeleton extraction and motion capture from 3D deformable matching This paper presents a novel method to extract skeletons of complex articulated objects from 3D point cloud sequences collected by the Kinect. Our approach is more robust than the traditional video-based and stereo-based approaches, as the Kinect directly provides 3D information without any markers, 2D-to-3D-transition assumptions, and feature point extraction. We track all the raw 3D points on the object, and utilize the point trajectories to determine the object skeleton. The point tracking is achieved by the 3D non-rigid matching based on the Markov Random Field (MRF) Deformation Model. To reduce the large computational cost of the non-rigid matching, a coarse-to-fine procedure is proposed. To the best of our knowledge, this is the first to extract skeletons of highly deformable objects from 3D point cloud sequences by point tracking. Experiments prove our method's good performance, and the extracted skeletons are successfully applied to the motion capture.

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


Performance analysis of multicarrier CDMA system based on complex wavelet packet and space-time block codes in Rayleigh fading channel On the basis of analyzing the principle of multicarrier CDMA (MC-CDMA) technique and space-time coding technique, using the optimized complex wavelet packet as multicarrier modulation, a novel MC-CDMA system based on complex wavelet packet and space-time block codes is proposed. The bit error rate (BER) performance of the system is investigated in Rayleigh fading channel, and the corresponding BER expression is derived in detail. The system can overcome the decrease of spectrum efficiency of conventional MC-CDMA due to inserting cyclic prefix (CP). Moreover, the application of space-time coding technique strengthens the capability against fading channel significantly and perfects the system performance. Theoretical analysis shows that the proposed system with 2-transmitter antenna and 2-receiver antenna space-time block codes performs four times better than the single-antenna MC-CDMA system based on complex wavelet packet (CWP-MC-CDMA); the same conclusion is also reached by the simulation results in fading channel. As a result, the performance of the proposed CWP-MC-CDMA system outperforms a conventional MC-CDMA system based on DFT, it is close or superior to that of the conventional MC-CDMA with CP. Especially, the CWP-MC-CDMA system with space-time coding has superior ability to combat spatial fading and multi-access interference, and it slightly outperforms conventional MC-CDMA with CP and space-time coding.

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

multicarrier code division multiple access

orthogonal frequency division multiplexing (ofdm)


A

hybrid

atomistic-continuum

model

for

fluid

flow

using

LAMMPS

and

OpenFOAM

A

fully

parallelized

hybrid

atomistic-continuum

(HAC)

model,

built

from

the

open

source

codes

LAMMPS

and

OpenFOAM,

is

developed

to

resolve

nanoscale

features

of

fluid

flow.

The

domain

is

decomposed

into

an

atomistic

domain,

where

individual

atomic

interactions

are

computed,

and

a

continuum

domain,

where

the

Navier-Stokes

equations

are

solved.

The

two

domains

are

coupled

through

an

overlap

region

in

which

the

solutions

in

both

domains

are

consistent.

The

accuracy

of

the

HAC

model

is

demonstrated

through

the

simulation

of

sudden

start

Couette

flow.

The

hybrid

model

is

shown

to

reduce

computation

time

by

a

factor

of

five

for

a

nm

channel

as

compared

to

a

fully-atomistic

simulation;

this

speedup

is

expected

to

become

even

greater

for

larger

systems.

Program

Summary

Program

title:

HacFoam

Catalogue

identifier:

Program

summary

URL:

Program

obtainable

from:

CPC

Program

Library,

Queen's

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

C++.

Computer:

All

capable

of

running

Linux.

Operating

system:

Linux.

Has

the

code

been

vectorized

or

parallelized?:

Parallelized

with

MPI

Classification:

External

routines:

MPI,

LAMMPS

OpenFOAM

Nature

of

problem:

Continuum

methods

are

often

incapable

of

resolving

features

and

flow

patterns

in

confined

nanoscale

liquid

flows.

Macroscopic

simulations

are

far

beyond

the

reach

of

atomistic

simulations.

Combining

the

atomistic

resolution

of

molecular

dynamics

with

the

reduced

computational

expense

of

traditional

continuum

numerical

techniques

for

fluid

flow

would

allow

larger

scale

problems

to

be

studied.

Solution

method:

The

domain

is

decomposed

into

an

atomistic

domain

and

a

continuum

domain.

Molecular

dynamics

(LAMMPS)

is

used

in

the

atomistic

domain

while

the

Navier-Stokes

equations

are

solved

(OpenFOAM)

in

the

continuum

domain.

The

two

domains

are

coupled

through

an

overlap

region

where

the

two

solutions

communicate.

LAMMPS

and

OpenFOAM

are

combined

into

a

single

executable,

in

the

form

of

an

OpenFOAM

solver

named

HacFoam.

Running

time:

HacFoam

can

vary

from

minutes

to

days

to

weeks

depending

on

the

size

of

the

system,

length

of

time

simulated

and

number

of

processors

used.

(C)

Elsevier

B.V.

All

rights

reserved.

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


Fault tolerance in the framework of support vector machines based model predictive control Model based predictive control (MBPC) has been extensively investigated and is widely used in industry. Besides this, interest in non-linear systems has motivated the development of MBPC formulations for non-linear systems. Moreover, the importance of security and reliability in industrial processes is in the origin of the fault tolerant strategies developed in the last two decades. In this paper a MBPC based on support vector machines (SVM) able to cope with faults in the plant itself is presented. The fault tolerant capability is achieved by means of the accurate on-line support vector regression (AOSVR) which is capable of training an SVM in an incremental way. Thanks to AOSVR is possible to train a plant model when a fault is detected and to change the nominal model by the new one, that models the faulty plant. Results obtained under simulation are presented.

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

accurate online support vector regression

continuous stirred tank reactor
fault tolerant control


Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces For a real square-free multivariate polynomial F, we treat the general problem of finding real solutions of the equation F=0, provided that the real solution set {F=0}(a"e) is compact. We allow that the equation F=0 may have singular real solutions. We are going to decide whether this equation has a non-singular real solution and, if this is the case, we exhibit one for each generically smooth connected component of {F=0}(a"e). We design a family of elimination algorithms of intrinsic complexity which solves this problem. In the worst case, the complexity of our algorithms does not exceed the already known extrinsic complexity bound of (nd) (O(n)) for the elimination problem under consideration, where n is the number of indeterminates of F and d its (positive) degree. In the case that the real variety defined by F is smooth, there already exist algorithms of intrinsic complexity that solve our problem. However, these algorithms cannot be used in case when F=0 admits F-singular real solutions. An elimination algorithm of intrinsic complexity presupposes that the polynomial F is encoded by an essentially division-free arithmetic circuit of size L (i.e., F can be evaluated by means of L additions, subtractions and multiplications, using scalars from a previously fixed real ground field, say a"e) and that there is given an invariant delta(F) which (roughly speaking) depends only on the geometry of the complex hypersurface defined by F. The complexity of the algorithm (measured in terms of the number of arithmetic operations in a"e) is then linear in L and polynomial in n,d and delta(F). In order to find such a geometric invariant delta(F), we consider suitable incidence varieties which in fact are algebraic families of dual polar varieties of the complex hypersurface defined by F. The generic dual polar varieties of these incidence varieties are called bipolar varieties of the equation F=0. The maximal degree of these bipolar varieties then becomes the essential ingredient of our invariant delta(F).

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

real polynomial equation solving
singularities
polar and bipolar varieties
degree of varieties


A tabu-search-based heuristic for clustering This paper considers a clustering problem where a given data set is partitioned into a certain number of natural and homogeneous subsets such that each subset is composed of elements similar to one another but different from those of any other subset. For the clustering problem, a heuristic algorithm is exploited by combining the tabu search heuristic with two complementary functional procedures, called packing and releasing procedures. The algorithm is numerically tested for its effectiveness in comparison with reference works including the tabu search algorithm, the K-means algorithm and the simulated annealing algorithm.

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

tabu search
heuristic
clustering
packing
releasing