A method of illumination compensation for human face image based on quotient image Illumination variation is one of the critical factors affecting face recognition rate. A novel approach for human face illumination compensation is presented in this paper. It constructs the nine-dimension face illumination subspace based on quotient image. In addition, with the aim to improve algorithm efficiency, a half-face illumination image is proposed and the low-dimension training set of the face image under different illumination conditions are obtained by means of PICA and wavelet transform. After processing, two different illumination compensation strategies are given: one is adding light, and the other is removing light. Based on the illumination compensation strategy, we implement the typical illumination sample image synthesis and the standard illumination sample image synthesis on a PCA feature subspace and a wavelet transform subspace, respectively, and the illumination compensation of the gray images and the color images are further realized. Experimental results based on the Yale Face Database B, the Extended Yale Face Database B and the CAS-PEAL Face Database indicate that execution time after compensation is approximately half the time and face recognition rate is improved by 20% compared with that of the original images. (C) 2008 Elsevier Inc. All rights reserved.

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

face recognition
quotient image
illumination compensation


Load capacity of high-strength reinforced concrete slabs by yield line theory The objective of this study is to determine whether or not the yield line theory, an effective method widely used for slabs made of ordinary concrete, can be used also for the reinforced concrete slabs made of high-strength concrete. Flexural behavior of simply supported slabs in three different sizes were investigated under concentrated load at mid-span. Additionally, behavior of high strength reinforced concrete slabs with 50 mm and 150 mm reinforcement spacings also studied. Failure loads, deflections, experimental and theoretical failure mechanisms were evaluated. The difference between the moments based on yield line theory and experimental moments varied between 1% to 3%. Experimental and analysis results revealed that yield line analysis could conveniently be employed in the analysis of high strength reinforced concrete slabs.

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

high strength concrete
reinforced concrete slab
collapse mechanism


Video documentation of urban areas The massive amount of information that is currently available is challenging the ability of urban communities to organize, process, and analyze all the information they require. This paper focuses on the concepts and principles for multimedia assets (especially videos) aiming to provide easier access to geographically relevant views on urban areas. Geo-referenced videos can be a great support in the management process of urban communities. This paper explains the process of acquisition and geo-referencing videos using low cost equipment. Furthermore, it describes the architecture of a Geo-Multimedia service infrastructure which enables users to store, retrieve, and share geo-referenced video content. Via a standard and state-of-the-art Web Service interface, geographic and multimedia objects can be retrieved from the Geo-Multimedia service by systems and applications already in use for administration (e.g. street management) or marketing purposes.

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

geographical information system
metadata standards


Associativity based clustering and query stride for on-demand routing protocols in ad hoc networks An ad hoc network is a collection of wireless mobile nodes without the support of a stationary infrastructure. In ad hoc networks, each node acts as a router to support multiple hops to overcome limited range of packet radios. While a variety of routing protocols have been developed recently, a class of routing schemes called on-demand protocols have attracted a lot of attentions due to their low routing overhead. However, their efficiency is limited by the enormous query flooding overhead and the route acquisition latency. In this paper, we propose two new schemes - Associativity Based Clustering (ABC) and Query Stride (QS) which offer benefits to on-demand protocols by surmounting those limitations. First, ABC provides a proactive routing information on associatively-stable nodes in the network. Thus, nodes can communicate immediately with a node in ABC without any query-reply exchange. Second, QS enables a query to be flooded to the whole network with a minimum number of broadcasts. While ABC reduces the route acquisition latency, QS saves the bandwidth in flooding. Although ABC and QS can be used independently, the combined effect is even greater since they provide complementary benefits sharing common overhead.

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

associativity based clustering
query stride

mobile ad-hoc networks
on-demand routing


Reliability Databases in perspective Concepts and methods used in designing modern RDB (reliability data banks) are reviewed. Taxonomies for failures and maintenance actions are not fully standardized and can cause confusion. Section H summarizes current usages. The structure of the raw data is identified as: component socket histories with competing risk. Successive sections discuss data-structure and operations on data, data analysis with and without competing risk, and the analysis of uncertainty. In the context of reliability data, the assumption that competing risks are s-independent is frequently unwarranted. Models for dependent competing risk are discussed, and illustrated with examples from pressure-relief-valve data at two Swedish nuclear-power stations. Some lessons learned are: The needs of various users of reliability databases must be distinguished. The interests and requirements of a maintenance engineer are very different from those of a risk analyst or a component designer. It is unlikely that a single reliability number serves these diverse needs. The problem of analyzing reliability-data has become a problem of data compression. Years ago, analysts justifiably complained about the sparseness of reliability data. With the advent of computers, automated sensors, and condition monitoring, there is no reason for sparseness today. The problem is knowing what to collect, how to make sense of the wealth of data that one can gather, and what to do with it. To be useful, reliability data must reveal not only the probability of failure, but also the cause of failure. Thus, competing factors causing the termination of service sojourns must be quantifiable from reliability data. Failure-causes interact, and this interaction makes the problem of quantification very challenging.

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

censoring
colored poisson process
dependent censoring
dependent competing risk
maintenance model
reliability database


Image-Processing Approach Based on Nonlinear Image-Decomposition It is a very important and intriguing problem in digital image-processing to decompose an input image into intuitively convincible image-components such as a structure component and a texture component, which is all inherently nonlinear problem. Recently. several numerical schemes to solve the nonlinear image-decomposition problem have been proposed. The use of the nonlinear image-decomposition its it pre-process of several image-processing tasks will possibly pave the way to solve difficult problems posed by the classic approach of digital image-processing. Since the new image-processing, approach via the nonlinear image-decomposition treats cacti separated component with a processing method suitable to it, the approach will successfully attain target items seemingly contrary to each other, for instance invisibility of ringing artifacts and sharpness of edges and textures. which have not attained simultaneously by the classic image-processing approach. This paper reviews quite recently developed state-of-the-art schemes of the nonlinear image-decomposition, and introduces some examples of the decomposition-and-processing approach.

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

image decomposition
total variation
variational problem
image processing
image interpolation
image denoising


Comparison of PI controllers designed for the delay model of TCP/AQM networks One of the major problems of communication networks is congestion. In order to address this problem in TCP/IP networks, Active Queue Management (AQM) scheme is recommended. AQM aims to minimize the congestion by regulating the average queue size at the routers. To improve upon AQM, recently, several feedback control approaches were proposed. Among these approaches, PI controllers are gaining attention because of their simplicity and ease of implementation. In this paper, by utilizing the fluid-flow model of TCP networks, we study the PI controllers designed for TCP/AQM. We compare these controllers by first analyzing their robustness and fragility. Then, we implement these controllers in ns-2 platform and conduct simulation experiments to compare their performances in terms of queue length. Taken together, our results provide a guideline for choosing a PI controller for AQM given specific performance requirements. (C) 2013 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 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 B I O O O O O O O O O O O O O


Quad-tree motion estimation in the frequency domain using gradient correlation We propose a new motion estimation scheme particularly suitable for broad cast-quality digital video applications due to its performance-complexity characteristics. The proposed scheme is based on the principle of gradient correlation and its computational efficiency is due to the fact that it operates in the frequency domain. The scheme involves the quad-tree decomposition of a frame thus providing a better level of adaptation to scene contents compared to fixed block size approaches. Quad-tree decompositions are obtained by using the motion compensated prediction error to control the partition of a parent block to four children quadrants. The partition criterion is applied iteratively until a target number of motion vectors or a target level of motion compensated prediction error is achieved or, ultimately, until no more than a single motion component can be identified. The partition criterion also guarantees a monotonic decrease of the motion compensated prediction error with an increasing number of iterations making our scheme suitable for progressive transmission and embedded coding applications. Our results show that our scheme outperforms fixed block size phase correlation as well as quad-tree motion estimation based on phase correlation in terms of rate-distortion characteristics yielding smoother motion vector fields as well as more compressible motion-compensated prediction residuals.

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

gradient motion estimation
quad-tree decomposition


Finite variability interpretation of monadic logic of order We consider an interpretation of monadic second-order logic of order in the continuous time structure of finitely variable signals. We provide a characterization of the expressive power of monadic logic. As a by-product of our characterization we show that many fundamental theorems which hold in the discrete time interpretation of monadic logic are still valid in the continuous time interpretation. (C) 2002 Elsevier Science B.V. All rights reserved.

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

definability
continuous time specification


IDD Info: A software to manage surveillance data of Iodine Deficiency Disorders IDD info, a new software for managing survey data of Iodine Deficiency Disorders (IDD), is presented in this paper. IDD Info aims to create IDD project databases, process, analyze various national or regional surveillance data and form final report. It has series measures of choosing database from existing ones, revising it, choosing indicators from pool to establish database and adding indicators to pool. It also provides simple tools to scan one database and compare two databases, to set IDD standard parameters, to analyze data by single indicator and multi-indicators, and finally to form typeset report with content customized. IDD Info was developed using Chinese national IDD surveillance data of 2005. Its validity was evaluated by comparing with survey report given by China CDC. The IDD Info is a professional analysis tool, which succeeds in speeding IDD data analysis up to about 14.28% with respect to standard reference routines. It consequently enhances analysis performance and user compliance. IDD Info is a practical and accurate means of managing the multifarious IDD surveillance data that can be widely used by non-statisticians in national and regional IDD surveillance.

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

idd info
software
iodine deficiency disorders


Heuristic design procedure for structures with displacement-dependent damping devices Purpose - The use of supplemental damping to dissipate energy is one of the most economical and effective ways to mitigate the effects of earthquake on structures. For practicing engineers, the ideal design procedure for buildings with supplemental damping should not be too complex to implement in practice. Building on the existing theoretical frame, the purpose of this paper is to develop simple and heuristic methods for the above design procedure. Design/methodology/approach - Passive displacement-dependent devices are considered in this paper. Based on the theoretical results for added damping and added stiffness (ADAS) devices, the paper first analyzes the generated forces and the effects of ADAS devices on structures under seismic impact. We identify design parameters and variables are identified, and present the procedure of how the values of the variables (e.g. column shear force, ductility ratio) are finalized so that the design requirements can be met is presented. A four-story six-bay steel building frame and a ten-story, one-bay steel building frame, equipped with ADAS devices, are used to demonstrate the performance of the design procedure. Findings - Empirical results show that the arrangement of damping devices based on the proposed procedure not only significantly reduces earthquake-induced energy, but also accomplishes the goal of being cost-effective by the control of ductility ratio. Originality/value - The proposed step-by-step procedure is easy for practicing engineers to apply for structures equipped with displacement-dependent dampers, although the modeling requirements may be complex. It will also allow practicing engineers to effectively design economic seismic dampers in the preliminary design phase and further explore the cost factors by comparing different building seismic performance objectives throughout design.

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

structural design
seismic loading
framed structures
earthquakes


Kernel methods for point symmetry-based clustering Generalization (by kernelization) of a family of point symmetry distances. Kernelized-SBKM that offers new possibilities for point symmetry-based clustering. Empirical recognition of symmetric clusters using any proximity measure. Highlighting new simple examples, hard to manage by original methods. New complex examples well-managed with KSBKM by using implicit projections.

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

pattern recognition
point symmetry-based distance measure
kernel function
k-means


Finite element surface fitting for bridge management We propose a new finite element surface fitting method which can handle very large databases. This method uses finite element discretization to find an approximation of a smooth function which minimizes a sum of data residuals and second derivatives under some constraints on data. The finite element discretization derives a large scale constrained quadratic program, which can be reformulated as a system of piecewise linear equations. We develop a preconditioned Newton method to solve the system efficiently. We apply this method to form surfaces over Aomori Region in Japan by geographic databases, such that every bridge became associated with environmental information.

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

finite element method
nonsmooth equation
newton's method


Identification of Resonance in Hybrid Stepper Motor Through Measured Current Dynamics in Online for Accurate Position Estimation and Control Stepper motors suffer with skipped steps due to the occurrence of resonance and instability, under certain load conditions. Unlike in other machines, variation of torque is not reflected in the current. Hence the current measurement based position estimation techniques fail. Experimental investigations reveal that high frequency ripples are present in the current dynamics during the resonating periods. This paper proposes an identification technique which works based on ripple content during the transient period of the current rise. It is shown that resonance can be identified and compensated well before the motor misses the step through the excitation voltage. With such compensation, current measurement based estimation techniques provide accurate speed & position estimation. The paper also matches experimental results with the simulation.

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

hybrid stepper motor
position estimation
resonance


Determining worst-case gust loads on aircraft structures using an evolutionary algorithm Determining the characteristics of wind gusts that result in the critical loading of an aircraft structure is an extremely complex problem. On the other hand, identifying these "worst-case gusts" is terribly important for aircraft designers because they need to ensure that aircraft are designed to withstand the dynamic loads associated with these turbulent gusts. In this paper an evolutionary algorithm (EA) is shown to be a feasible approach to solving this problem. The EA outperforms a traditional method suitable for solving linear problems, then is extended to nonlinear problems for which there is no effective solution methodology.

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


Analytical and numerical prediction of inviscid free surface flow in rotating channel Starting from two-dimensional Euler's equations in a rotating reference frame, a stream function-based Galerkin finite element method is formulated for inviscid free surface flow in a rotating channel. A new equation governing the free surface is derived to form the Galerkin residual for the free surface. A deforming mesh is used with combined Newton's iteration to solve for the free surface as well as the stream function. Furthermore, an approximate analytical solution is also obtained for the problem. Results show very good agreement between the analytical and numerical solutions, especially when the channel entrance is situated at the axis of rotation. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

deforming finite element analysis
inviscid irrotational flow


Speed synchronization control for integrated automotive motortransmission powertrain system with random delays A generalized PI controller. CAN-induced delay analysis and compensation method. Delay-dependent controller.

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

integrated motortransmission
energy-to-peak control
markov chains
lmi


Database Lexicography This paper introduces database lexicography, a metadata analysis discipline that applies lexical graph theory to data design. Database lexicography proposes a formal design criterion for data dependencies, and it provides metrics to evaluate the conformance of designs to this criterion. It treats the data dictionary as a first class object encoding design concepts, and its benefits include identification of database dependency architecture; quantification of interdependent data elements' sensitivity to change; categorization of core and peripheral data elements; model integration; and figures of merit by which to fortify data architectures to withstand design fossilization and guide their evolution amidst changing requirements.

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

database lexicography
lexical graph
data dictionary
model integration


Identifying

Gene

Clusters

within

Localized

Regions

in

Multiple

Genomes

An

important

strategy

to

study

genome

evolution

is

to

investigate

the

clustering

of

orthologous

genes

among

multiple

genomes,

in

which

the

most

popular

approaches

require

that

the

distance

between

adjacent

genes

in

a

cluster

be

small.

We

investigate

a

different

formulation

based

on

constraining

the

overall

size

of

a

cluster

and

develop

statistical

significance

estimates

that

allow

direct

comparison

of

clusters

of

different

sizes.

We

first

consider

a

restricted

version

which

requires

that

orthologous

genes

are

strictly

ordered

within

each

cluster

and

show

that

it

can

be

solved

in

polynomial

time.

We

then

develop

practical

exact

algorithms

for

the

unrestricted

problem

that

allows

paralogous

genes

within

a

genome

and

clusters

that

may

not

appear

in

every

genome

while

considering

a

general

model

in

which

a

gene

is

allowed

to

appear

in

more

than

one

orthologous

group.

We

show

that

our

algorithm

can

identify

biologically

relevant

gene

clusters

on

four

bacterial

genomes

Bacillus

subtilis,

Streptococcus

pyogenes,

Streptococcus

pneumoniae,

and

Clostridium

acetobutylicum.

We

also

show

that

our

algorithm

can

identify

significantly

more

functionally

enriched

gene

clusters

on

four

yeast

genomes

Saccharomyces

cerevisiae,

Saccharomyces

paradoxus,

Saccharomyces

mikatae,

and

Saccharomyces

bayanus

than

previous

algorithms.

A

software

program

(GCFinder)

and

a

list

of

gene

clusters

found

on

the

bacterial

and

the

yeast

genomes

are

available

at

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

np-hardness
ordered clusters
unordered clusters


Neighborhood functions and hill-climbing strategies dedicated to the generalized ungapped local multiple alignment Ungapped Local Multiple Alignment is a widely used procedure in bioinformatics. It roughly consists of locating in a given set of nucleotide (DNA) or amino acid (proteins) sequences, a number of non-overlapping fixed-size factors (also called occurrences), that are likely to have evolved from a common ancestor. In addition to the widely known statistical approaches, we define the problem from a pure combinatorial optimization point of view, by defining specific neighborhood functions and a hill-climbing strategy for each of four particular instances of this problem: (1) one occurrence per sequence, (2) at most one occurrence per sequence, (3) at least one occurrence per sequence, and (4) any number of occurrences per sequence. The method is implemented in a tool called Nomad (Neighborhood Optimization for Multiple Alignment Discovery) and a web interface is available at www.expasy.org/tools/nomad.html.

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


Reference frames in visual selection We review neuropsychological evidence for visual selection operating in different reference frames. There is general agreement that there may be a separation of coding space near to and farther from the body, and that deficits in selecting stimuli within each form of spatial representation may be impaired in patients with unilateral neglect. However, there remains a lack of consensus about whether all forms of spatial representation relate to the body or whether there are spatial representations based on reference frames abstracted from the body (allocentric and object-centered spatial codes). Here we will review the evidence for spatial coding in these more abstracted reference frames (allocentric and object-centered but also environmental) and argue for the psychological reality of (at least) allocentric spatial coding. We discuss computational accounts of how such codes may be created as objects are selected.

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


Research status and trends in limnology journals: a bibliometric analysis based on SCI database An effective bibliometric analysis was applied in this work to evaluate global scientific production of the subject category of limnology from 2001 to 2010. Data was based on the Science Citation Index compiled by Institute for Scientific Information (ISI), Philadelphia, USA. The h-index and NetDraw were designed to characterize the limnology publications. The results showed that the limnology research constantly increased over the past decade. The researchers paid most attention to diatoms, eutrophication and phosphorus. Moreover, the keywords plus of growth, model, dynamic, offered a thorough description for the limnology research. Among the research institutes interested in limnologic research, the US Geological Survey was the flagship while the USA attained a dominant position in the global research in the field.

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


Analysis of discontinuous Galerkin methods for multicomponent reactive transport problems Primal discontinuous Galerkin (DG) methods, including the Oden-Babuska-Baumann version of DC, are formulated for solving multicomponent reactive transport problems in porous media. Using the information of chemical stoichiometry, an efficient approach is proposed for a special case of multicomponent reactive transport without immobile species. A priori error analysis is conducted to establish the convergence of DC methods for multicomponent reactive transport systems, which is optimal in h and nearly optimal in p. (c) 2006 Elsevier Ltd. All rights reserved.

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

discontinuous galerkin methods
transport

error estimates
multicomponent systems
reaction


Temporal binding as an inducer for connectionist recruitment learning over delayed lines The temporal correlation hypothesis proposes using distributed synchrony for the binding of different stimulus features. However, synchronized spikes must travel over cortical circuits that have varying length pathways, leading to mismatched arrival times. This raises the question of how initial stimulus-dependent synchrony might be preserved at a destination binding site. Earlier, we proposed constraints on tolerance and segregation parameters for a phase-coding approach, within cortical circuits, to address this question [Proceedings of the International Joint Conference on Neural Networks, Washington, DC, 2001]. The purpose of the present paper is twofold. First, we conduct simulation experiments to test the proposed constraints. Second, we explore the practicality of temporal binding to drive a process of long-term memory formation based on a recruitment learning method [Biol. Cybernet. 46 (1982) 27]. A network based on Valiant's neuroidal architecture [Circuits of the mind, 1994] is used to demonstrate the coalition between temporal binding and recruitment. Complementing similar approaches, we implement a continuous-time learning procedure allowing computation with spiking neurons. The viability of the proposed binding scheme is investigated by conducting simulation studies which examine binding errors. In the simulation, binding errors cause the perception of illusory conjunctions among features belonging to separate objects. Our results indicate that when tolerance and segregation parameters obey our proposed constraints, the assemblies of correct bindings are dominant over assemblies of spurious bindings in reasonable operating conditions.

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

synchrony
temporal correlation
binding
recruitment learning


Tracking Large-Scale Video Remix in Real-World Events Content sharing networks, such as YouTube, contain traces of both explicit online interactions (such as likes, comments, or subscriptions), as well as latent interactions (such as quoting, or remixing, parts of a video). We propose visual memes, or frequently re-posted short video segments, for detecting and monitoring such latent video interactions at scale. Visual memes are extracted by scalable detection algorithms that we develop, with high accuracy. We further augment visual memes with text, via a statistical model of latent topics. We model content interactions on YouTube with visual memes, defining several measures of influence and building predictive models for meme popularity. Experiments are carried out with over 2 million video shots from more than 40,000 videos on two prominent news events in 2009: the election in Iran and the swine flu epidemic. In these two events, a high percentage of videos contain remixed content, and it is apparent that traditional news media and citizen journalists have different roles in disseminating remixed content. We perform two quantitative evaluations for annotating visual memes and predicting their popularity. The proposed joint statistical model of visual memes and words outperforms an alternative concurrence model, with an average error of 2% for predicting meme volume and 17% for predicting meme lifespan.

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


Efficient static analysis of XML paths and types We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically type-check XPath queries. To this end, we prove the decidability of a logic with converse for finite ordered trees whose time complexity is a simple exponential of the size of a formula. The logic corresponds to the alternation free modal mu-calculus without greatest fixpoint, restricted to finite trees, and where formulas are cycle-free. Our proof method is based on two auxiliary results. First, XML regular tree types and XPath expressions have a linear translation to cycle-free formulas. Second, the least and greatest fixpoints are equivalent for finite trees, hence the logic is closed under negation. Building on these results, we describe a practical, effective system for solving the satisfiability of a formula. The system has been experimented with some decision problems such as XPath emptiness, containment, overlap, and coverage, with or without type constraints. The benefit of the approach is that our system can be effectively used in static analyzers for programming languages manipulating both XPath expressions and XML type annotations ( as input and output types).

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


Organic vapor sensors based on functionalized macroporous Si using single and double-side electrochemical etching Organic sensors for ethanol vapor detection were developed by means of electrochemical etching of crystalline silicon as initial substrate following two procedures: front side etching (FSE) and front- and backside (double) surface etching (DSE). The first consists on the attack of the crystalline silicon surface by hydrofluoric acid (HF) in presence of a constant current flow to form a layer of vertically oriented pattern of pores with diameters in the 25?m range and a thickness of about 50?m. The second procedure is similar to the first one but allowing a similar etching to the opposite side of the silicon wafer. The etching times for both surfaces were adjusted in such a way to produce a free standing porous layer of around 300?m in thickness. The samples produced by FSE and DSE were submitted to a functionalization methodology using 4-aminopyridine to cover the porous surface. The obtained specimens were mounted in a holder with two soldered contacts and placed in a testing chamber where different flows of ethanol vapors were injected. Conductance responses of both kinds of sensors were recorded and compared between them and with respect to nontreated crystalline silicon samples in terms of sensing capability, reproducibility, and response times. The results indicate that both FSE and DSE sensors have improved sensing properties compared to the nontreated surfaces.

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


A probabilistic relational approach for web document clustering The exponential growth of information available on the World Wide Web, and retrievable by search engines, has implied the necessity to develop efficient and effective methods for organizing relevant contents. In this field document clustering plays an important role and remains an interesting and challenging problem in the field of web computing. In this paper we present a document clustering method, which takes into account both contents information and hyperlink structure of web page collection, where a document is viewed as a set of semantic units. We exploit this representation to determine the strength of a relation between two linked pages and to define a relational clustering algorithm based on a probabilistic graph representation. The experimental results show that the proposed approach, called RED-clustering, outperforms two of the most well known clustering algorithm as k-Means and Expectation Maximization.

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

relational document clustering
relational web structure estimation


Enhanced Product Lifecycle Information Management using communicating materials A system for an enhanced Product LifeCycle Information Management (PLIM) is proposed. A dual challenge is addressed: providing a new intelligent material & a high degree of data synchronization. These challenges are addressed with the combination of CL 2 M and communicating materials. A scenario using medical garments shows how the desired degree of data synchronization is reached. Research perspectives on data synchronization regarding existing standards are introduced.

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

product lifecycle management
closed-loop lifecycle management
intelligent product
communicating material


the deployment of pda accessible clinical-log for medical education in pbl-approach This study was undertaken to determine the important features, advantages and disadvantages of PDA-based/web-based clinical-log for PBL-based medical curriculum at the Graduate School of Medicine, University of Wollongong for the incorporation of personal digital assistants (PDAs) in the future. Method: The in-depth interviews were designed and conducted with medical faculty, clinicians and medical education technology specialists. Results: Four major features, benefits and limitation of PDA-based/web-based clinical-log were identified. Conclusion: PDA-based/web-based clinical-log is a vital learning tool to be incorporated as a in PBL-medical curriculum in particular while offsite.

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

personal digital assistants
medical education

clinical-log
information technology
problem-based learning


A heuristic time-invariant model for fuzzy time series forecasting Many forecasting models based on the concepts of fuzzy time series have been proposed in the past decades. These models have been applied to predict enrollments, temperature, crop production and stock index, etc. In this paper, we present a simple heuristic time-invariant fuzzy time series forecasting model, which uses prediction accuracy of model observations to train the trend predictor in the training phase, and uses these trend predictor to generate forecasting values in the testing phase. This model can capture the trends of the time series more accurately and hence improve the forecasting results. The proposed method is applied for forecasting university enrollment of Alabama and the Taiwan Futures Exchange (TAIFEX). It is shown that the proposed model achieves a significant improvement in forecasting accuracy as compared to other fuzzy time series forecasting models. (C) 2010 Elsevier Ltd. All rights reserved.

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

fuzzy time series
forecasting
enrollment
taifex


approximating the cut-norm via grothendieck's inequality The cut-norm ||A|| C of a real matrix A=(a ij ) i? R,j?S is the maximum, over all I ? R, J ? S of the quantity | ? i ? I, j ? J a ij |. This concept plays a major role in the design of efficient approximation algorithms for dense graph and matrix problems. Here we show that the problem of approximating the cut-norm of a given real matrix is MAX SNP hard, and provide an efficient approximation algorithm. This algorithm finds, for a given matrix A=(a ij ) i ? R, j ? S , two subsets I ? R and J ? S, such that | ? i ? I, j ? J a ij | ? ? ||A|| C , where ? > 0 is an absolute constant satisfying $? > 0. 56. The algorithm combines semidefinite programming with a rounding technique based on Grothendieck's Inequality. We present three known proofs of Grothendieck's inequality, with the necessary modifications which emphasize their algorithmic aspects. These proofs contain rounding techniques which go beyond the random hyperplane rounding of Goemans and Williamson [12], allowing us to transfer various algorithms for dense graph and matrix problems to the sparse case.

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


Some new extremal codes of lengths 76 and 78 We find new extremal [76, 38, 14] and (78, 39, 14] binary self-dual codes. The code of length 76 is the first known self-dual code with these parameters. It is shadow extremal and the shortest known self-dual code with minimal distance 14. It has an automorphism of order 19 without fixed coordinates. The code of length 78 has a new weight enumerator and an automorphism of order 19 with two fixed coordinates.

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

automorphism of codes
binary self-dual codes


Importance Sampling for Objective Function Estimations in Neural Detector Training Driven by Genetic Algorithms To train Neural Networks (NNs) in a supervised way, estimations of an objective function must be carried out. The value of this function decreases as the training progresses and so, the number of test observations necessary for an accurate estimation has to be increased. Consequently, the training computational cost is unaffordable for very low objective function value estimations, and the use of Importance Sampling (IS) techniques becomes convenient. The study of three different objective functions is considered, which implies the proposal of estimators of the objective function using IS techniques: the Mean-Square error, the Cross Entropy error and the Misclassification error criteria. The values of these functions are estimated by IS techniques, and the results are used to train NNs by the application of Genetic Algorithms. Results for a binary detection in Gaussian noise are provided. These results show the evolution of the parameters during the training and the performances of the proposed detectors in terms of error probability and Receiver Operating Characteristics curves. At the end of the study, the obtained results justify the convenience of using IS in the training.

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

genetic algorithms
neural networks
importance sampling
cross entropy error
misclassification error


Automated Pattern-Based Service Deployment in Programmable Networks This paper presents a flexible service deployment architecture for the automated, on-demand deployment of distributed services in programmable networks. The novelty of our approach is (a) the customization of the deployment protocol by utilizing modular building blocks, namely navigation patterns, aggregation patterns, and capability functions, and (b) the definition of a corresponding service descriptor. A customizable deployment protocol has several important advantages: It supports a multitude of services, and it allows for an ad hoc optimization of the protocol according to the specific needs of a service and the current network conditions. Moreover, our architecture provides an environment for studying new patterns which aim at reducing deployment latency and bandwidth for certain services. We demonstrate how the developed architecture can be used to setup a virtual private network, and we present measurements conducted with our prototype in the PlanetLab test network. Furthermore, a comparison of a distributed pattern with a centralized pattern illustrates the performance trade-off for different deployment strategies.

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

service description
on-demand service deployment
resource discovery


Effect of Immobilization Site and Membrane Materials on Multiphasic Enantiocatalytic Enzyme Membrane Reactors In the experimental work reported here the optical resolution of racemic naproxen methyl ester with crude lipase immobilized in a membrane reactor was studied. The multiphasic enantiocatalytic enzyme membrane reactor consisted of an organic phase that dissolved the naproxen methyl ester, a lipase-loaded membrane, and an aqueous phase that extracted the reaction product. Lipase preferentially converted the (S)-naproxen methyl ester to (S)-naproxen acid that was simultaneously separated by a membrane. The effect of the immobilization site and membrane type on the performance of the enzyme membrane reactor was studied. Capillary polyamide membrane with 10kDa nominal molecular weight cutoff (NMWCO) and polysulfone membrane with 30kDa NMWCO were applied, with lipase loaded in the sponge layer or on a membrane thin layer. With various immobilization sites and membrane types, the enzyme membrane reactors showed different productivity and enantioselectivity resulting from the varying amounts of immobilized enzyme and varying microenvironment of the hydrolysis reaction. Higher amounts of immobilized enzyme led to increased productivity and generally higher enantioslectivity of the membrane reactor. It seems that the location of organic/aqueous interface on membrane, which plays an important role in a multiphasic enzyme membrane reactor, was influenced by the immobilization site and membrane type and this affected the productivity and enantioselectivity. As much as 90% enantioexcess was obtained with a polyamide membrane, and lower values with a polysulfone membrane. A sponge layer of polyamide membrane is the preferred immobilization site for its higher productivity than a thin membrane layer, and for its higher enantioselectivity than a polysulfone membrane. In comparison with the unstable hydrolysis activity of free lipase in stirred tank reactor, a stable lipase activity can be obtained with the lipase-immobilized membrane reactor, irrespective of whether a polyamide or polysulfone membrane is used.

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

multiphasic membrane reactor
immobilized lipase
kinetic resolution
(s)-naproxen


Partial abductive inference in Bayesian belief networks by simulated annealing Abductive inference in Bayesian belief networks (BBN) is intended as the process of generating the K most probable configurations given observed evidence, When we are only interested in a subset of the network variables, this problem is called partial abductive inference, Due to the noncommutative behaviour of the two operators (summation and maximum) involved in the computational process of solving partial abductive inference in BBNs, the process can be unfeasible by exact computation even for networks in which other types of probabilistic reasoning are not very complicated, This paper describes an approximate method to perform partial abductive inference in BBNs based on the simulated annealing (SA) algorithm, The algorithm can be applied to multiple connected networks and for any value of K, The evaluation function is based on clique tree propagation, and allow to evaluate neighbour configurations by means of local computations, in this way the efficiency with respect to previous algorithms (based on the use of genetic algorithms (GAs)) is improved, (C) 2001 Elsevier Science Inc, All rights reserved.

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

simulated annealing
probabilistic reasoning

bayesian networks
abductive reasoning
maximum a posteriori hypothesis


On the correlation of sojourn times in open networks of exponential multiserver queues We consider the joint distribution of successive sojourn times of customers traversing a path in Jackson network. It is shown in a general setting that sojourn times exhibit positive dependence. This especially applies to paths which admit overtaking due to the network topology as well as due to the internal node structure.

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

joint sojourn time vector
association
positive upper orthant-dependence


Production and use of information. Characterization of informetric distributions using effort function and density function - Exponential informetric process Statistical regularities observed in the production or use of information have been studied for a long time. In this article we define an exponential informetric process to formalize these stochastic process. It is defined by combining an effort function with a density function. Without using the powerful results of Price on the cumulative advantages process this characterization clarifies the principle of least effort. Some links between statistical theory of information and some informetric distributions are enhanced. (c) 2005 Elsevier Ltd. All rights reserved.

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


world wide web as usability tester, collector, recruiter The usability team at Wildfire Communications Inc. conducted a usability test using the World Wide Web (WWW) as a method to advertise the test, recruit participants and gather data --- all automatically.The test was conducted over the course of only 2 days during which we collected useful information from 96 people.The usability test was for a speech system using participants recruited by Internet Newsgroups, e-mail lists and the WWW. Using these resources helped us to get a large population to test the system in a short period of time.

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


Balancing energy consumption with mobile agents in wireless sensor networks For Wireless Sensor Networks (WSNs), an unbalanced energy consumption will decrease the lifetime of network. In this paper, we leverage mobile agent technology to investigate the problem of how to balance the energy consumption during data collection in WSNs. We first demonstrate that for a sensor network with uniform node distribution and constant data reporting, balancing the energy of the whole network cannot be realized when the distribution of data among sensor nodes is unbalanced. We design a method to mitigate the uneven energy dissipation problem by controlling the mobility of agents, which is achieved by an energy prediction strategy to find their positions. Finally, we propose energy balancing cluster routing based on a mobile agent (EBMA) for WSNs. To obtain better performance, the cluster structure is formed based on cellular topology taking into consideration the energy balancing of inter-cluster and intra-cluster environments. Extensive simulation experiments are carried out to evaluate EBMA with several performance criteria. Our simulation results show that EBMA can effectively balance energy consumption and perform high efficiency in large-scale network deployment.

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

wireless sensor network
data fusion
cellular structure


Cauchy theater phenomenon in diagonal method and test principle of finite positional differences Purpose - The paper's purpose is to show a class of well-used methods in set theory is invalid. Design/methodology/approach - A conceptual approach is taken. Findings - Based on the concept of Cauchy theater introduced elsewhere, it is proven that the argument employing the diagonal method for the fact that the set of all real numbers R = {x vertical bar r(x)}, were r(x) =(df) "x is a real number" has an uncountable cardinality, is not valid. The diagonal method has appeared in naive and modem axiomatic set theories. Originality/value - Point out more 'paradoxes in the methodology of mathematics.

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


parsing and evaluation of apl with operators The importance of operators in APL is now well recognised, and considerable attention has been paid to the inclusion of more general operators into the language. In this article we consider some of the consequences for the implementation of interpreters and compilers for APL. We first consider the difficulties that arise with the introduction of function valued and basic valued operators. We then discuss various modifications to the syntactic and semantic structure of APL that serve to avoid these difficulties. Abstraction operators as in the lambda calculus are also introduced. Finally, we describe an abstract machine for interpreting APL-like expressions which is analogous to the SECD machine used in the lambda calculus.

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

attention
structure
abstraction
semantic
inclusion
language
implementation
lambda calculus
general
evaluation
parsing

abstract-machine interpretation functional express operability compilation


Prediction of human breast and colon cancers from imbalanced data using nearest neighbor and support vector machines ? This study proposes a novel prediction approach for human breast and colon cancers using different feature spaces. The proposed scheme consists of two stages: the preprocessor and the predictor. In the preprocessor stage, the mega-trend diffusion (MTD) technique is employed to increase the samples of the minority class, thereby balancing the dataset. In the predictor stage, machine-learning approaches of K-nearest neighbor (KNN) and support vector machines (SVM) are used to develop hybrid MTD-SVM and MTD-KNN prediction models. MTD-SVM model has provided the best values of accuracy, G-mean and Matthew's correlation coefficient of 96.71%, 96.70% and 71.98% for cancer/non-cancer dataset, breast/non-breast cancer dataset and colon/non-colon cancer dataset, respectively. We found that hybrid MTD-SVM is the best with respect to prediction performance and computational cost. MTD-KNN model has achieved moderately better prediction as compared to hybrid MTD-NB (Nave Bayes) but at the expense of higher computing cost. MTD-KNN model is faster than MTD-RF (random forest) but its prediction is not better than MTD-RF. To the best of our knowledge, the reported results are the best results, so far, for these datasets. The proposed scheme indicates that the developed models can be used as a tool for the prediction of cancer. This scheme may be useful for study of any sequential information such as protein sequence or any nucleic acid sequence.

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

support vector machines
nave bayes
random forest

breast/colon cancer
mega-trend diffusion
k-nearest neighbor


Skeletonization of volumetric vascular images - Distance information utilized for visualization This paper deals with two techniques to represent relevant information from volumetric vascular images in a more compact format. The images are obtained with contrast-enhanced magnetic resonance angiography (MRA). After segmentation of the vessels, the curve skeleton is extracted by an algorithm based on the distance transformation. The algorithm first reduces the original object to a surface skeleton and then to a curve skeleton, after which "pruning" can be performed to remove irrelevant small branches. Applying this procedure to MRA data from the pelvic arteries resulted in a good description of the tree structure of the vessels with a much smaller number of voxels. To detect stenoses, 2D projections such as maximum intensity projection (MIP) are usually employed, but these often fail to demonstrate a stenosis if the projection angle is not suitably chosen. A new presentation method surrounds each voxel in the distance-labeled curve skeleton of the segmented vascular tree with a ball whose radius represents the minimum vessel radius at that level. Experiments with synthetic data indicate that stenoses invisible in an ordinary projection may be seen with this technique. It is concluded that the distance-labelled curve skeleton seems to be useful for visualizing variations in vessel calibre and in the future possibly also for quantification of arterial stenoses.

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

shape representation
3d skeleton
reverse distance transform
stenosis detection


A principled approach to image denoising with similarity kernels involving patches Denoising is a cornerstone of image analysis and remains a very active research field. This paper deals with image filters that rely on similarity kernels to compute weighted pixel averages. Whereas similarities have been based on the comparison of isolated pixel values until recently, modern filters extend the paradigm to groups of pixels called patches. Significant quality improvements result from the mere replacement of pixel differences with patch-to-patch comparisons directly into the filter. Our objective is to cast this generalization within the framework of mode estimation. Starting from objective functions that are extended to patches, this leads us to slightly different formulations of filters proposed in the literature, such as the local M-smoothers, bilateral filters, and the nonlocal means. A fast implementation of these new filters relying on separable linear-time convolutions is detailed. Experiments show that this principled approach further improves the denoising quality without increasing the computational complexity.

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

image denoising
mode estimation
nonlocal means

bilateral filtering
local m-smoothers
image patches


Simulation of Assembly Tolerance and Characteristics of High Pressure Common Rail Injector Fuel injector is the key part of a high-pressure common rail fuel injection system. Its manufacturing precision and assembly quality affect system's property and performance. According to the characteristics and demands of assembly of the fuel injector, an intelligent optimization algorithm is proposed to resolve the problem of assembly sequence planning. Based on geometric modeling, assembly dimension chain of the injector control chamber is established, and the relationship between assembly tolerance and volume change of control chamber is analyzed. The optimization model of the assembly is established. The impact of assembly tolerance on injector's performance is simulated according to the optimization algorithm. The simulation result shows that quantity of injection fuel changes correspondingly with the change of assembly tolerance, while injection rate and pressure do not change significantly, and the response rate of needle considerably slow. Similarly, the leakage rate of fuel in control chamber is calculated, indicating that the assembly tolerance has obvious impact on fuel leakage and its rate. The study illuminates that injector's assembly tolerance has prominent effect on injection.

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

assembly tolerance
intelligent optimization algorithm
high pressure common rail
simulation


A practical application of our MDD approach for modeling secure XML data warehouses Data warehouses are systems that provide useful information to support the decision making process, thus improving organizations' business processes. These systems integrate heterogeneous sources which are not only limited to their internal business data but also include data from the Web, the latter of which have become increasingly more important in the decision making process in recent years. This has motivated the extensive use of XML in the implementation of data warehouses, in a manner which facilitates data and metadata interchange among the heterogeneous data sources from the Web and the data warehouse. However, the business information that data warehouses manage is crucial and highly sensitive, and must be carefully protected. Security is thus a key issue in the design of data warehouses, regardless of the implementation technology used. It is important to note that the data available on the Web requires particular security considerations which have been specifically tailored to these systems in order to permit their particularities to be captured correctly. Unfortunately, although security issues have been considered in the development of traditional data warehouses, current research lacks approaches with which to consider security when the target platform is based on XML technology. In order to deal with this situation, in this paper we propose a methodological approach for the model driven development of secure XML data warehouses. We also specify a set of transformation rules that are able to automatically generate not only the corresponding XML structure of the data warehouse from secure conceptual data warehouse models, but also the security rules specified within the data warehouse XML structure, thus allowing both aspects to be implemented simultaneously. We additionally introduce our secure XML DW development approach, in which the secure conceptual DW data model, the PIM, is transformed into a secure XML DW, as a PSM, by applying a set of transformation rules. Our proposal is validated through the practical application of our model driven development approach for Modeling Secure XML Data Warehouses to a case study, which is based on a central Airport DW. We first describe the transformation rules defined, then use a step by step illustration to show how they will be applied to the secure conceptual model of the case study to obtain the Secure XML Data Warehouse, thus demonstrating the benefits of our proposal, and finally we analyze how to achieve the secure implementation into commercial database management systems, providing details of the secure implementation in Oracle XML DB 11g.

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

data warehouse
xml
security
model driven development
transformation rules
case study


fire training and evaluation through the scientific visualization of fire phenomena Virtual reality based fire training enables the provision of emergency response training through a computer-created fire environment. Because the accuracy of fire behavior can play a very important role in the training and evaluation process, we can utilize a specialized numeric solver to generate fire dynamics data, and apply scientific visualization techniques to effectively display these data in 3D. With the exception of volume rendering, typical scientific visualization methods pose an obstacle for people to understand and experience fire behavior in an intuitive manner in the virtual reality environment. We present an approach that enables the use of scientific visualization for fire training and evaluation through the real-time volume rendering of various physical quantities in fire dynamics. We found that this enabled users to easily grasp the useful information of a fire, as well as to evaluate safety achievement during training activities.

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

fire training
virtual reality
scientific visualization


Back to the Beginning The Journal is Dead, Long Live Science This paper synthesises literature on the evolution of the academic journal, showing that the weaknesses of the journal strategy of science information dissemination are nothing new in the history of science. The paper avers that information technology has provided a solution to the age-long constraints associated with the journal. It is shown that by expanding the public's participation in science, and by enabling research results to be presented to the public in various formats, the rapid development in electronic technologies has touched the essential structure and functions of the journal. Formal and informal means of science dissemination and communication have emerged to blur the boundaries between journals, articles and ideas. Most significantly, the journal as an information product has been dismembered into different new and legitimate forms of the research effort, formerly packaged as a single product.

O O O O O O O O O O B O O O O O O O O O B I O O O 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 B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O 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 models for scalable cluster computing 1 In this paper, we make a thorough study of scalable parallel computing performance models, point out some of the weaknesses of existing performance models, and discuss how one can improve and generalize them. We start with analyzing and accurately defining several kinds of serial and parallel execution times, discuss parallel speedup models, and present a generalized speedup model. We propose a formal definition of scalability, and discuss scalability of cluster systems from three aspects. As an extension to the isoefficiency metric and isospeed metric, we propose and define scalability of parallel algorithm-architecture combinations based on the fixed ratio of computation time to communication overhead, analyze some relevant theoretical perspectives, and compare scalability with speedup.

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

performance model
performance evaluation


Highly nonlinear balanced S-boxes with improved bound on unrestricted and generalized nonlinearity We construct two classes of balanced S-boxes with high nonlinearity 2(n-1) - 2((n-1)/2) for n odd. From known results, it can be deduced that for any S-box which has nonlinearity 2(n-1) -2((n-1)/2) , the unrestricted nonlinearity is lower bounded by 2(n-1) -2((m+n-1)/2) while the generalized nonlinearity is lower bounded by 2(n-1) -(2(m) -1) 2((n-1)/2). We prove that the lower bound on the unrestricted nonlinearity of both our S-box constructions can be increased to 2(n-1) -2((m+n)/2-1). For the first class of S-box, the lower bound on generalized nonlinearity can be increased to 2(n-1) -2((n-1)/2+m-1). For the second class, the generalized nonlinearity is proven to be exactly 2(n-1) -2((m+n)/2-1), which is much higher than the lower bound for our first construction. The first class of S-boxes have low maximum differential while the second class corresponds to GMW sequences, whose algebraic structure allows us to construct a larger family of S-boxes. Moreover, both classes of S-boxes can attain high algebraic degree. We also compare our constructions with some known functions with high unrestricted and/or generalized nonlinearity.

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

generalized nonlinearity
unrestricted nonlinearity

vectorial boolean functions
power functions


Interactive requirements prioritization using a genetic algorithm The order in which requirements are implemented affects the delivery of value to the end-user, but it also depends on technical constraints and resource availability. The outcome of requirements prioritization is a total ordering of requirements that best accommodates the various kinds of constraints and priorities. During requirements prioritization, some decisions on the relative importance of requirements or the feasibility of a given implementation order must necessarily resort to a human (e.g., the requirements analyst), possessing the involved knowledge. In this paper, we propose an Interactive Genetic Algorithm (IGA) that includes incremental knowledge acquisition and combines it with the existing constraints, such as dependencies and priorities. We also assess the performance of the proposed algorithm. The validation of IGA was conducted on a real case study, by comparing the proposed algorithm with the state of the art, interactive prioritization technique Incomplete Analytic Hierarchy Process (IAHP). The proposed method outperforms IAHP in terms of effectiveness, efficiency and robustness to decision maker errors. IGA produces a good approximation of the reference requirements ranking, requiring an acceptable manual effort and tolerating a reasonable human error rate.

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

interactive genetic algorithms
search based software engineering


extensible optimization in overlay dissemination trees We introduce XPORT, a profile-driven distributed data dissemination system that supports an extensible set of data types, profile types, and optimization metrics. XPORT efficiently implements a generic tree-based overlay network, which can be customized per application using a small number of methods that encapsulate application-specific data filtering, profile aggregation, and optimization logic. The clean separation between the "plumbing" and "application" enables the system to uniformly support disparate dissemination-based applications.We first provide an overview of the basic XPORT model and architecture. We then describe in detail an extensible optimization framework, based on a two-level aggregation model, that facilitates easy specification of a wide range of commonly used performance goals. We discuss distributed tree transformation protocols that allow XPORT to iteratively optimize its operation to achieve these goals under changing network and application conditions. Finally, we demonstrate the flexibility and the effectiveness of XPORT using real-world data and experimental results obtained from both prototype-based LAN emulation and deployment on PlanetLab.

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


A Compression Model for DNA Multiple Sequence Alignment Blocks A particularly voluminous dataset in molecular genomics, known as whole genome alignments, has gained considerable importance over the last years. In this paper, we propose a compression modeling approach for the multiple sequence alignment (MSA) blocks, which make up most of these datasets. Our method is based on a mixture of finite-context models. Contrarily to other recent approaches, it addresses both the DNA bases and gap symbols at once, better exploring the existing correlations. For comparison with previous methods, our algorithm was tested in the multiz28way dataset. On average, it attained 0.94 bits per symbol, approximately 7% better than the previous best, for a similar computational complexity. We also tested the model in the most recent dataset, multiz46way. In this dataset, that contains alignments of 46 different species, our compression model achieved an average of 0.72 bits per MSA block symbol.

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

finite-context models
lossless compression
multiple sequence alignments (msas)


Runtime Resonance Noise Reduction with Current Prediction Enabled Frequency Actuator Power delivery network (PDN) is a distributed resistance-in-ductance-capacitance (RLC) network with its dominant resonance frequency in the low-to-middle frequency range. Though high-performance chips' working frequencies are much higher than this resonance frequency in general, chip runtime loading frequency is not. When a chip executes a chunk of instructions repeatedly, the induced current load may have harmonic components close to this resonance frequency, causing excessive power integrity degradation. Existing PDN design solutions are, however, mainly targeted at reducing high-frequency noise and not effective to suppress such resonance noise. In this work, we propose a novel approach to proactively suppress this type of noise. A method based on the high dimension generalized Markov process is developed to predict current load variation. Based on such prediction, a clock frequency actuator design is proposed to proactively select an optimal clock frequency to suppress the resonance. To the best of our knowledge, this is the first in-depth study on proactively reducing instruction loop induced PDN resonance noise at the runtime.

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


An ID-based signcryption scheme with compartmented secret sharing for unsigncryption We extend an ID based signcryption scheme to a compartmented scheme. Our scheme allows any member of a compartment to participate in unsigncryption. The security of this scheme is just as strong as the original. Much of the setup work is naturally parallelizable. It is applicable to modern situations and lends itself easily to implementation.

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

signcryption
compartmented secret sharing

cryptography
digital signature
bilinear maps


Constructing cost-effective and targetable industrial control system honeypots for production networks Critical infrastructure assets and especially industrial control systems are at risk. Malicious actors are constantly developing exploits that sneak past security controls. Honeypots offer an opportunity to acquire knowledge about the tactics, techniques and procedures used by malicious entities to compromise sensitive systems. However, the proprietary, and often expensive, hardware and software used by industrial control systems make it very challenging to build flexible, economical and scalable honeypots. This paper describes a technique that uses proxy technology to produce multiple high-interaction honeypots using a single programmable logic controller. The technique provides a cost-effective method for distributing multiple, authentic, targetable honeypots at slightly more than the cost of a single programmable logic controller.

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

industrial control systems
production networks
honeypots


Nogood-FC for solving partitionable constraint satisfaction problems Many real problems can be naturally modelled as constraint satisfaction problems (CSPs). However, some of these problems are of a distributed nature, which requires problems of this kind to be modelled as distributed constraint satisfaction problems (DCSPs). In this work, we present a distributed model for solving CSPs. Our technique carries out a partition over the constraint network using a graph partitioning software; after partitioning, each sub-CSP is arranged into a DFS-tree CSP structure that is used as a hierarchy of communication by our distributed algorithm. We show that our distributed algorithm outperforms well-known centralized algorithms solving partitionable CSPs.

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


Linear and sublinear time algorithms for the basis of abelian groups It is well known that every finite abelian group G can be represented as a direct product of cyclic groups: G congruent to G(1) x G(2) x ... x G(t), where each G(i) is a cyclic group of order p(j) for some prime p and integer j >= 1. If a(i) generates the cyclic group of G(j), i = 1,2, ..., t, then the elements a(1), a(2), ..., a(t) are called a basis of G. We show a randomized algorithm such that given a set of generators M = {x(1), ..., x(k)} for an abelian group G and the prime factorization of order ord(x(i)) (i = 1, ..., k), it computes a basis of G in O(vertical bar M vertical bar(log n)(2) + Sigma(t)(i=1) n(i)p(j)(nj/2)) time, where n = vertical bar G vertical bar has prime factorization p(1)(n1)p(2)(n2) ... p(t)(nt) (which is not a part of input). This generalizes Buchmann and Schmidt's algorithm that takes O(vertical bar M vertical bar root vertical bar G vertical bar) time. In another model, all elements in an abelian group are put into a list as a part of input. We obtain an O(n) time deterministic algorithm and a sublinear time randomized algorithm for computing a basis of an abelian group. (C) 2010 Elsevier B.V. All rights reserved.

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

randomization
decomposition
basis of abelian group


Digital library research in the US: an overview with a knowledge management perspective The provision of information resources and services is now readily available online via digital libraries furnished by a wide variety of information providers. Information is no longer just text and pictures, and is now available in a wide variety of multimedia formats. Digital libraries represent a new form of information technology in which content management, service delivery and social impact matter as much as technological advancement. In addition, for digital library researchers there is a need to transform information access to knowledge creation and management. Based on research in the USA in the Digital Libraries Initiative and the National Science Digital Library programmes, a review is provided of significant past and emerging digital library research activities, and research based on new knowledge management concepts and technologies is suggested.

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

digital libraries
research
knowledge management


Depth estimation using multiwavelet analysis based stereo vision approach The problem of dimensional defects in aluminum die-casting is widespread throughout the foundry industry and their detection is of paramount importance in maintaining product quality. Due to the unpredictable factory environment and metallic, with highly reflective, nature of aluminum die-castings, it is extremely hard to estimate true dimensionality of the die-casting, autonomously. In this work, we propose a novel robust 3D reconstruction algorithm capable of reconstructing dimensionally accurate 3D depth models of the aluminum die-castings. The developed system is very simple and cost effective as it consists of only a stereo camera pair and a simple fluorescent light. The developed system is capable of estimating surface depths within the tolerance of 1.5 mm. Moreover, the system is invariant to illuminative variations and orientation of the objects in the input image space, which makes the developed system highly robust. Due to its hardware simplicity and robustness, it can be implemented in different factory environments without a significant change in the setup.

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

3d depth estimation
multiwavelets transform modulus maxima
disparity estimation


Information processing with structured excitable medium There are many ways in which a nonlinear chemical medium can be used for information processing. Here we are concerned with an excitable medium and the straightforward method of information coding: a single excitation pulse represents a bit of information and a group of excitations forms a message. Our attention is focused on a specific type of nonhomogeneous medium that has an intentionally introduced geometrical structure of regions characterized by different excitability levels. We show that in information processing applications the geometry plays an equally important role as the dynamics of the medium and allows one to construct devices that perform complex signal processing operations even for a relatively simple kinetics of the reactions involved. In the paper we review a number of published chemical realizations of simple information processing devices like logical gates or memory cells and we show that by combining these devices as building blocks the medium can perform complex operations like for example counting of arriving excitations. We also present a new, simple realizations of chemical signal diode that transmits pulses in one direction only.

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

oregonator model
belousovzhabotinsky reaction


interval completion with few edges We present an algorithm with runtime O(k (2k) n 3 * m) for the following NP-complete problem: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the long-standing open question, first posed by Kaplan, Shamir and Tarjan, of whether this problem could be solved in time f(k) * n (O(1)) .The problem has applications in Physical Mapping of DNA and in Profile Minimization for Sparse Matrix Computations. For the first application, our results show tractability for the case of a small number k of false negative errors, and for the second, a small number k of zero elements in the envelope. Our algorithm performs bounded search among possible ways of adding edges to a graph to obtain an interval graph, and combines this with a greedy algorithm when graphs of a certain structure are reached by the search. The presented result is surprising, as it was not believed that a bounded search tree algorithm would suffice to answer the open question affirmatively.

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

branching
fpt algorithm
edge completion
interval graphs


Modeling process asymmetries with Laplace moving average Many records in environmental science exhibit asymmetries: for example in shallow water and with variable bathymetry, the sea wave time series shows frontback asymmetries and different shapes for crests and troughs. In such situation, numerical models are available but their computational cost and complexity are high. A stochastic process aimed at modeling such asymmetries has recently been proposed, the Laplace moving average process, which consists in applying a linear filter on a non-Gaussian noise built using the generalized Laplace distribution. The objective is to propose a new non-parametric estimator for the kernel involved in the definition of this process. Results based on a comprehensive numerical study will be shown in order to evaluate the performances of the proposed method.

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

non-linear time series
fir estimation
splines
high-order spectrum


Lower bounds for resource-constrained project scheduling problems A destructive lower bound for the multi-mode resource-constrained project scheduling problem with minimal and maximal time-lags is presented. Given are n activities which may be processed in different modes without preemptions. During processing certain amounts of renewable and non-renewable resources are needed where the available capacity of each resource type is limited. Furthermore, minimal and maximal time-lags between the activities are given. The objective is to determine a schedule with minimal makespan. The lower bound calculations are based on two methods for proving infeasibility of a given threshold value T for the makespan. The first uses constraint propagation techniques, while the second is based on a linear programming formulation which is solved by a column generation procedure. Computational results are reported for several test instances of the multi-mode problem with and without time-lags and the single-mode version with time-lags.

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

scheduling
lower bounds
column generation
constraint propagation


Robust latent low rank representation for subspace clustering Subspace clustering has found wide applications in machine learning, data mining, and computer vision. Latent Low Rank Representation (LatLRR) is one of the state-of-the-art methods for subspace clustering. However, its effectiveness is undermined by a recent discovery that the solution to the noiseless LatLRR model is non-unique. To remedy this issue, we propose choosing the sparest solution in the solution set. When there is noise, we further propose preprocessing the data with robust PCA. Experiments on both synthetic and real data demonstrate the advantage of our robust LatLRR over state-of-the-art methods.

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

subspace clustering
latent low rank representation


On the Reuse of TLM Mutation Analysis at RTL Mutation analysis has gained consensus during the last decades as being an efficient technique for measuring the quality of SW testbench. More recently, it has been efficiently applied for validating testbenches of embedded system models implemented in hardware description language (HDL) at different abstraction levels (i.e., RTL, TLM). This article analyzes how mutation analysis performed at TLM can be reused at RTL and, in particular, how such a reuse can help designers in (i) optimizing the time spent for simulation at RTL, and (ii) improving the RTL testbench quality. Two alternatives of TLM mutation analysis reuse are presented and investigated for proposing an efficient methodology of RTL mutation analysis. Through experimental results, the proposed methodology is compared to the standard RTL mutation analysis to confirm its efficiency in terms of both simulation time and reached mutation coverage.

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

mutation testing
systemc
transaction-level modeling
register-transfer level