Power characteristics of inductive interconnect The width of an interconnect line affects the total power consumed by a circuit. The effect of wire sizing on the power characteristics of an inductive interconnect line is presented in this paper. The matching condition between the driver and the load affects the power consumption since the short-circuit power dissipation may decrease and the dynamic power will increase with wider lines. A tradeoff, therefore, exists between short-circuit and dynamic power in inductive interconnects. The short-circuit power increases with wider linewidths only if the line is underdriven. The power characteristics of inductive interconnects therefore may have a great influence on wire sizing optimization techniques. An analytic solution of the transition time of a signal propagating along an inductive interconnect with an error of less than 15% is presented. The solution is useful in wire sizing synthesis techniques to decrease the overall power dissipation. The optimum linewidth that minimizes the total transient power dissipation is determined. An analytic solution for the optimum width with an error of less than 6% is presented. For a specific set of line parameters and resistivities, a reduction in power approaching 80% is achieved as compared to the minimum wire width. Considering the driver size in the design process, the optimum wire and driver size that minimizes the total transient power is also determined.

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

dynamic power
inductive interconnect
transient power dissipation

characteristic impedance
short-circuit power
underdamped systems


Convergence acceleration of RungeKutta schemes for solving the NavierStokes equations The convergence of a RungeKutta (RK) scheme with multigrid is accelerated by preconditioning with a fully implicit operator. With the extended stability of the RungeKutta scheme, CFL numbers as high as 1000 can be used. The implicit preconditioner addresses the stiffness in the discrete equations associated with stretched meshes. This RK/implicit scheme is used as a smoother for multigrid. Fourier analysis is applied to determine damping properties. Numerical dissipation operators based on the Roe scheme, a matrix dissipation, and the CUSP scheme are considered in evaluating the RK/implicit scheme. In addition, the effect of the number of RK stages is examined. Both the numerical and computational efficiency of the scheme with the different dissipation operators are discussed. The RK/implicit scheme is used to solve the two-dimensional (2-D) and three-dimensional (3-D) compressible, Reynolds-averaged NavierStokes equations. Turbulent flows over an airfoil and wing at subsonic and transonic conditions are computed. The effects of the cell aspect ratio on convergence are investigated for Reynolds numbers between 5.7106 5.7 10 6 and 100106 100 10 6 . It is demonstrated that the implicit preconditioner can reduce the computational time of a well-tuned standard RK scheme by a factor between 4 and 10.

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


Realizations of the game domination number Domination game is a game on a finite graph which includes two players. First player, Dominator, tries to dominate a graph in as few moves as possible; meanwhile the second player, Staller, tries to hold him back and delay the end of the game as long as she can. In each move at least one additional vertex has to be dominated. The number of all moves in the game in which Dominator makes the first move and both players play optimally is called the game domination number and is denoted by \(\gamma _g\). The total number of moves in a Staller-start game is denoted by \(\gamma _g^{\prime }\). It is known that \(|\gamma _g(G)-\gamma _g^{\prime }(G)|\le 1\) for any graph \(G\). Graph \(G\) realizes a pair \((k,l)\) if \(\gamma _g(G)=k\) and \(\gamma _g^{\prime }(G)=l\). It is shown that pairs \((2k,2k-1)\) for all \(k\ge 2\) can be realized by a family of 2-connected graphs. We also present 2-connected classes which realize pairs \((k,k)\) and \((k,k+1)\). Exact game domination number for combs and 1-connected realization of the pair \((2k+1,2k)\) are also given.

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

domination game
game domination number
realizations


Lumiproxy: A Hybrid Representation of Image-Based Models In this paper, we present a hybrid representation of image-based models combining the textured planes and the hierarchical points. Taking a set of depth images as input, our method starts from classifying input pixels into two categories, indicating the planar and non-planar surfaces respectively. For the planar surfaces, the geometric coefficients are reconstructed to form the uniformly sampled textures. For nearly planar surfaces, some textured planes, called lumiproxies, are constructed to represent the equivalent visual appearance. The Hough transform is used to find the positions of these textured planes, and optic flow measures are used to determine their textures. For remaining pixels corresponding to the non-planar geometries, the point primitive is applied, reorganized as the OBB-tree structure. Then, texture mapping and point splatting are employed together to render the novel views, with the hardware acceleration.

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

sampling
surface fitting
image-based rendering


Constraint based methods for biological sequence analysis The need for processing biological information is rapidly growing, owing to the masses of new information in digital form being produced at this time. Old methodologies for processing it can no longer keep up with this rate of growth. The methods of Artificial Intelligence (AI) in general and of language processing in particular can offer much towards solving this problem. However, interdisciplinary research between language processing and molecular biology is not yet widespread, partly because of the effort needed for each specialist to understand the other one's jargon. We argue that by looking at the problems of molecular biology from a language processing perspective, and using constraint based logic methodologies we can shorten the gap and make interdisciplinary collaborations more effective. We shall discuss several sequence analysis problems in terms of constraint based formalisms such Concept Formation Rules, Constraint Handling Rules (CHR) and their grammatical counterpart, CHRG. We postulate that genetic structure analysis can also benefit from these methods, for instance to reconstruct from a given RNA secondary structure, a nucleotide sequence that folds into it. Our proposed methodologies lend direct executability to high level descriptions of the problems at hand and thus contribute to rapid while efficient prototyping.

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

rna secondary structure
concept formation
constraint handling rules

protein structure
gene prediction
constraint handling rule grammars


Adaptive load balancing algorithm for multiple homing mobile nodes ? In places where mobile users can access multiple wireless networks simultaneously, a multipath scheduling algorithm can benefit the performance of wireless networks and improve the experience of mobile users. However, existing literature shows that it may not be the case, especially for TCP flows. According to early investigations, there are mainly two reasons that result in bad performance of TCP flows in wireless networks. One is the occurrence of out-of-order packets due to different delays in multiple paths. The other is the packet loss which is resulted from the limited bandwidth of wireless networks. To better exploit multipath scheduling for TCP flows, this paper presents a new scheduling algorithm named Adaptive Load Balancing Algorithm (ALBAM) to split traffic across multiple wireless links within the ISP infrastructure. Targeting at solving the two adverse impacts on TCP flows, ALBAM develops two techniques. Firstly, ALBAM takes advantage of the bursty nature of TCP flows and performs scheduling at the flowlet granularity where the packet interval is large enough to compensate for the different path delays. Secondly, ALBAM develops a Packet Number Estimation Algorithm (PNEA) to predict the buffer usage in each path. With PNEA, ALBAM can prevent buffer overflow and schedule the TCP flow to a less congested path before it suffers packet loss. Simulations show that ALBAM can provide better performance to TCP connections than its other counterparts.

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

multiple path scheduling
multiple interface
local domain


query by output It has recently been asserted that the usability of a database is as important as its capability. Understanding the database schema, the hidden relationships among attributes in the data all play an important role in this context. Subscribing to this viewpoint, in this paper, we present a novel data-driven approach, called Query By Output (QBO) , which can enhance the usability of database systems. The central goal of QBO is as follows: given the output of some query Q on a database D , denoted by Q ( D ), we wish to construct an alternative query Q ? such that Q ( D ) and Q ? ( D ) are instance-equivalent. To generate instance-equivalent queries from Q ( D ), we devise a novel data classification-based technique that can handle the at-least-one semantics that is inherent in the query derivation. In addition to the basic framework, we design several optimization techniques to reduce processing overhead and introduce a set of criteria to rank order output queries by various notions of utility. Our framework is evaluated comprehensively on three real data sets and the results show that the instance-equivalent queries we obtain are interesting and that the approach is scalable and robust to queries of different selectivities.

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

at-least-one semantics
instance-equivalent queries


Three-dimensional quantitative structureactivity relationships study on HIV-1 reverse transcriptase inhibitors in the class of dipyridodiazepinone derivatives, using comparative molecular field analysis1 A three-dimensional quantitative structureactivity relationships (3D QSAR) method, Comparative Molecular Field Analysis (CoMFA), was applied to a set of dipyridodiazepinone (nevirapine) derivatives active against wild-type (WT) and mutant-type (Y181C) HIV-1 reverse transcriptase. The starting geometry of dipyridodiazepinone was taken from X-ray crystallographic data. All 75 derivatives, divided into a training set of 53 compounds and a test set of 22 molecules, were then constructed and full geometrical optimizations were performed, based on a semiempirical molecular orbital method (AM1). CoMFA was used to discriminate between structural requirements for WT and Y181C inhibitory activities. The resulting CoMFA models yield satisfactory predictive ability regarding WT and Y181C inhibitions, with r2cv = 0.624 and 0.726, respectively. CoMFA contour maps reveal that steric and electrostatic interactions corresponding to the WT inhibition amount to 58.5% and 41.5%, respectively, while steric and electrostatic effects have approximately equal contributions for the explanation of inhibitory activities against Y181C. The contour maps highlight different characteristics for different types of wild-type and mutant-type HIV-1 RT. In addition, these contour maps agree with experimental data for the binding topology. Consequently, the results obtained provide information for a better understanding of the inhibitorreceptor interactions of dipyridodiazepinone analogs. 2000 Elsevier Science Inc.

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

hiv-1 rt
nnrti
3d-qsar
quantum chemical calculations
molecular modeling


A shared-memory implementation of the hierarchical radiosity method The radiosity method is a simulation method from computer graphics to visualize the global illumination in scenes containing diffuse objects within an enclosure. A variety of realizations (including parallel approaches) were proposed to achieve a high efficiency while guaranteeing the same accuracy of the graphical representation. The hierarchical radiosity method reduces the computational costs considerably but results in a highly irregular algorithm which makes a parallel implementation more difficult. We investigate a task-oriented shared memory implementation and present optimizations with different behavior concerning locality and granularity. To be able to concentrate on load balancing and scalability issues, we use a shared-memory machine with uniform memory access time, the SB-PRAM. (C) 1998-Elsevier Science B.V. All rights reserved.

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

hierarchical radiosity method
shared memory implementation
scalability
granularity


A transaction mapping algorithm for frequent itemsets mining In this paper, we present a novel algorithm for mining complete frequent itemsets. This algorithm is referred to as the TM ( Transaction Mapping) algorithm from hereon. In this algorithm, transaction ids of each itemset are mapped and compressed to continuous transaction intervals in a different space and the counting of itemsets is performed by intersecting these interval lists in a depth-first order along the lexicographic tree. When the compression coefficient becomes smaller than the average number of comparisons for intervals intersection at a certain level, the algorithm switches to transaction id intersection. We have evaluated the algorithm against two popular frequent itemset mining algorithms, FP-growth and dEclat, using a variety of data sets with short and long frequent patterns. Experimental data show that the TM algorithm outperforms these two algorithms.

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


Semi-continuous network flow problems We consider semi-continuous network flow problems, that is, a class of network flow problems where some of the variables are restricted to be semi-continuous. We introduce the semi-continuous inflow set with variable upper bounds as a relaxation of general semi-continuous network flow problems. Two particular cases of this set are considered, for which we present complete descriptions of the convex hull in terms of linear inequalities and extended formulations. We consider a class of semi-continuous transportation problems where inflow systems arise as substructures, for which we investigate complexity questions. Finally, we study the computational efficacy of the developed polyhedral results in solving randomly generated instances of semi-continuous transportation problems.

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


Construct message authentication code with one-way hash functions and block ciphers We suggest an MAC scheme which combines a hash function and an block cipher in order. We strengthen this scheme to prevent the problem of leaking the intermediate hash value between the hash function and the block cipher by additional random bits. The requirements to the used hash function are loosely. Security of the proposed scheme is heavily dependent on the underlying block cipher. This scheme is efficient on software implementation for processing long messages and has clear security properties.

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


Estimation of uncertainty in dynamic simulation results This paper presents a new approach for calculation of uncertainty in dynamic simulation results. The statistical moments (mean, variance, skewness etc.) of the simulation results are calculated using Gaussian-quadrature with ''customized'' weight function. Based on these moments, an approximating probability density function (pdf) is created by expansion into orthogonal polynomial series. The percentiles of the distribution can then be calculated. The method is computationally less demanding than Monte-Carlo simulation when the number of uncertain parameters are limited. A number of examples are used to illustrate the applicability of the proposed framework.

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

uncertainty propagation
stochastic simulation


A neural implementation of the JADE algorithm (nJADE) using higher-order neurons A neural implementation of the JADE algorithm, called nJADE, is developed which adaptively determines the mixing matrices to be jointly diagonalized with the JADE algorithm. This alleviates the problem of algebraically determining these mixing matrices which becomes a very tedious if not impossible undertaking with high-dimensional data. The new learning rule uses higher-order neurons and generalizes Oja's PCA learning rule. As a test case the new nJADE algorithm is applied to high-dimensional natural image ensembles to learn appropriate edge filter structures. Quantitative comparison concerning various filter characteristics is made with results obtained with a probabilistic ICA algorithm with kernel-based source density estimation.

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

independent component analysis
higher order neurons
neural network
natural images


JPEG 2000 encoding method for reducing tiling artifacts This paper proposes an effective JPEG 2000 encoding method for reducing tiling artifacts, which cause one of the biggest problems in JPEG 2000 encoders. Symmetric pixel extension is generally thought to be the main factor in causing artifacts. However this paper shows that differences in quantization accuracy between tiles are a more significant reason for tiling artifacts at middle or low bit rates. This paper also proposes an algorithm that predicts whether tiling artifacts will occur at a tile boundary in the rate control process and that locally improves quantization accuracy by the original post quantization control. This paper further proposes a method for reducing processing time which is yet another serious problem in the JPEG 2000 encoder. The method works by predicting truncation points using the entropy of wavelet transform coefficients prior to the arithmetic coding. These encoding methods require no additional processing in the decoder. The experiments confirmed that tiling artifacts were greatly reduced and that the coding process was considerably accelerated.

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


Laparoscopic Myomectomy The appearance of uterine myomas has been linked to infertility. It has been suggested that surgical management of myomas by laparoscopic myomectomy improves fertility rates in these group of patients. In this paper we initially describe specific aspects of the surgical technique of laparoscopic myomectomy including the set-up, precise technique for hysteroromy, enucleation of the myoma, suturing of the uterus, and extraction of the myoma. We detail recent findings that demonstrate improved fertility rates in women undergoing laparoscopic myomectomy. We recommend that, when criteria for selection of patients is strictly adhered to and patients present with no other associated infertility, laparoscopic myomectomy be used to increase the implantation rate.

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


Theoretical

study

on

the

antioxidant

properties

of

H-atom

vs.

electron

transfer

mechanism

The

free

radical

scavenging

activity

of

six

has

been

studied

in

gas

phase

and

solvents

using

the

density

functional

theory

(DFT)

method.

The

three

main

working

mechanisms,

hydrogen

atom

transfer

(HAT),

stepwise

electron-transfer-proton-transfer

(ET-PT)

and

sequential-proton-loss-electron-transfer

(SPLET)

have

been

considered.

The

O-H

bond

dissociation

enthalpy

(BDE),

ionization

potential

(IP),

proton

affinity

(PA)

and

electron

transfer

energy

(ETE)

parameters

have

been

computed

in

gas

phase

and

solvents.

The

theoretical

results

confirmed

the

important

role

of

the

B

ring

in

the

antioxidant

properties

of

hydroxychalcones.

In

addition,

the

calculated

results

matched

well

with

experimental

values.

The

results

suggested

that

HAT

would

be

the

most

favorable

mechanism

for

explaining

the

radical-scavenging

activity

of

hydroxychalcone

in

gas

phase,

whereas

SPLET

mechanism

is

thermodynamically

preferred

pathway

in

aqueous

solution.

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

dft
hydrogen atom transfer
hydroxychalcones
radical scavenging


program analysis for event-based distributed systems Designing distributed applications around the idiom of events has several benefits including extensibility and scalability. To improve conciseness, safety, and efficiency of corresponding programs, several authors have recently proposed programming languages or language extensions with support for event-based programming. The presence of a dedicated programming language and compilation process offers avenues for program analyses to further improve simplicity, safety, and expressiveness of distributed event-based software. This paper presents three program analyses specifically designed for event-based programs: immutability analysis avoids costly cloning of events in the presence of co-located handlers for same events; guard analysis allows for simple yet expressive subscriptions which can be further simplified and handled efficiently; causality analysis determines causal dependencies among events which are related, allowing unrelated events to be transferred independently for efficiency. We convey the benefits of our approach by empirically evaluating their performance benefits.

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


Automatic determination of envelopes and other derived curves within a graphic environment Dynamic geometry programs provide environments where accurate construction of geometric configurations can be done. Nevertheless, intrinsic limitations in their standard development technology mostly produce objects that are equationally unknown and so can not be further used in constructions. In this paper, we pursue the development of a geometric system that uses in the background the symbolic capabilities of two computer algebra systems, CoCoA and Mathematica. The cooperation between the geometric and symbolic modules of the software is illustrated by the computation of plane envelopes and other derived curves. These curves are described both graphically and analytically. Since the equations of these curves are known, the system allows the construction of new elements depending on them. (C) 2004 IMACS. Published by Elsevier B.V. All rights reserved.

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

symbolic computing
symbolic-numeric interface
groebner bases
caustics
pedals


a platform for okapi-based contextual information retrieval We present an extensible java-based platform for contextual retrieval based on the probabilistic information retrieval model. Modules for dual indexes, relevance feedback with blind or machine learning approaches and query expansion with context are integrated into the Okapi system to deal with the contextual information. This platform allows easy extension to include other types of contextual information.

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


The ternary description language as a formalism for the parametric general systems theory: Part III This part is a continuation of the first and second parts of my article that were published in the International Journal of General Systems, vol. 28 (4-5), pp. 351-366; vol. 31 (2), pp. 131-151. In Part III, we deal with the construction of the axiomatic system of the ternary description language (TDL). Axioms and rules of inference are formulated. On the basis of these axioms and rules some theorems of TDL are proved. Several system-theoretical laws, which concern the values of systems parameters, are proved as theorems of TDL. Thus the deductive construction of general systems theory is made.

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

syntactical priority
synonymy
rules of substitution
rules of replacement
theorems of the tdl
system-theoretical laws


Definitions and approaches to model quality in model-based software development - A review of literature More attention is paid to the quality of models along with the growing importance of modelling in software development. We performed a systematic review of studies discussing model quality published since 2000 to identify what model quality means and how it can be improved. From forty studies covered in the review, six model quality goals were identified; i.e., correctness, completeness, consistency, comprehensibility, confinement and changeability. We further present six practices proposed for developing high-quality models together with examples of empirical evidence. The contributions of the article are identifying and classifying definitions of model quality and identifying gaps for future research. (C) 2009 Elsevier B.V. All rights reserved.

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

systematic review
modelling
model quality


Animal identification: introduction and history In the beginning of the 1970 research institutes in different countries developed the first electronic animal identification systems. These systems were tested on experimental farms. The first systems were all built with the conventional components and attached to a collar around the cows neck. In the 1980s however special integrated circuits were developed minimising the size of the transponders. Now in the 1990s, official organisations are testing systems for identification and registration of all animals to control movements from birth to slaughterhouse. This will enable farm livestock to be traced at the outbreak of diseases and residues in slaughter animals to be followed up. Injectable transponders, electronic eartags and rumenal bolusses are being 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

electronic identification
transponder
electronic eartag
ruminant bolus


A fractional variational iteration method for solving fractional nonlinear differential equations Recently, fractional differential equations have been investigated by employing the famous variational iteration method. However, all the previous works avoid the fractional order term and only handle it as a restricted variation. A fractional variational iteration method was first proposed in [G.C. Wu, E.W.M. Lee, Fractional variational iteration method and its application, Phys. Lett. A 374 (2010) 25062509] and gave a generalized Lagrange multiplier. In this paper, two fractional differential equations are approximately solved with the fractional variational iteration method.

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

modified riemannliouville derivative
fractional corrected functional


three-level privacy control for sensing-based real-world content digital diorama Digital Diorama, the sensing-based real-world content, can be constructed by integrating real-time information obtained from sensors monitoring the real world. In order to increase the benefits of viewers without violating the privacy of monitored persons, this paper proposes three-level privacy control over the monitored persons based on their agreement to the usage of their information obtained from sensors: privacy control with i) no agreement, ii) partial agreement. and iii) mutual agreement. i) presents only their positions to show where persons are. ii) additionally presents the information which can be automatically obtained from sensors such as age and gender to show what kinds of persons are where without disclosing the visual appearances. iii) presents their visual appearances based on their mutual agreement with specific viewers. Our evaluation indicated that the representation simulating each privacy control presented information from sensors with acceptable privacy protection.

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


enhancing wireless video streaming using lightweight approximate authentication In this paper we propose a novel lightweight approximate authentication algorithm that provides efficient protection for wireless video streaming where bit errors are frequent. The benefits of the proposed algorithm over other algorithms are fast execution, due to its simplicity, and small message authentication code size. The algorithm is capable of detecting even a small number of bit errors in relatively small packets that are used in video streaming. These features have never previously been available at the same time. Another benefit of the approximate authentication is that it supports error resilient video decoding by dropping packets with too many bit errors, thus improving the perceived quality of the video stream. The performance of the algorithm is demonstrated via simulations and measurements

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

approximate authentication
wireless video streaming

error resilient video coding
security
qos


Distributed federative QoS resource management In a distributed multimedia system QoS resources have to be managed carefully to utilize the resource pool in a way that bottlenecks can be avoided. Our key idea is to let the applications participate on the resource management. We propose a distributed architecture with a fine granulated, balanced resource management with explicit QoS characteristics. The architecture is based on a distributed cooperative resource manager which combines both the adaption and reservation principle for guaranteeing QoS. We have designed and implemented a prototype of our federative QoS resource manager (FQRM) in the Java environment.

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

distributed resources
cooperative resource sharing


Algorithms for on-line order batching in an order picking warehouse In manual order picking systems, order pickers walk or ride through a distribution warehouse in order to collect items required by (internal or external) customers. Order batching consists of combining these indivisible customer orders into picking orders. With respect to order batching, two problem types can be distinguished: in off-line (static) batching, all customer orders are known in advance; in on-line (dynamic) batching, customer orders become available dynamically over time. This paper considers an on-line order batching problem in which the maximum completion time of the customer orders arriving within a certain time period has to be minimized. The author shows how heuristic approaches for off-line order batching can be modified in order to deal with the on-line situation. In a competitive analysis, lower and upper bounds for the competitive ratios of the proposed algorithms are presented. The proposed algorithms are evaluated in a series of extensive numerical experiments. It is demonstrated that the choice of an appropriate batching method can lead to a substantial reduction of the maximum completion time.

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

warehouse management
on-line optimization


Passive and Active Reduction Techniques for On-Chip High-Frequency Digital Power Supply Noise Signal integrity has become a major problem in digital IC design. One cause is device scaling that results in a sharp reduction of supply voltage, creating stringent noise margin requirements to ensure functionality. This paper introduces both a novel on-chip decoupling capacitance methodology and active noise cancellation (ANC) structure. The decoupling methodology focuses on quantification and location. The ANC structure, with an area of 50 mu m x 55 mu m, uses decoupling capacitance to sense noise and inject a proportional current into V(SS) as a method of reduction. A chip has been designed and fabricated using TSMC's 90-nm technology. Measurements show that the decoupling methodology improved the average voltage headroom loss by 17% while the ANC structure improved the average voltage headroom loss by 18%.

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

decoupling capacitance
power supply noise

active noise cancellation (anc)
on-chip interconnect
power distribution


ON MODAL mu-CALCULUS OVER FINITE GRAPHS WITH SMALL COMPONENTS OR SMALL TREE WIDTH This paper is a continuation and correction of a paper presented by the same authors at the conference GANDALF 2010. We consider the Modal mu-calculus and some fragments of it. For every positive integer k we consider the class SCCk of all finite graphs whose strongly connected components have size at most k, and the class TWk of all finite graphs of tree width at most k. As upper bounds, we show that for every k, the temporal logic CTL* collapses to alternation free mu-calculus in SCCk; and in TW1, the winning condition for parity games of any index n belongs to the level Delta(2) of Modal mu-calculus. As lower bounds, we show that Buchi automata are not closed under complement in TW2 and coBuchi nondeterministic and alternating automata differ in TW1.

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

modal mu-calculus
strongly connected component


Product line selection and pricing analysis: Impact of genetic relaxations A model for the product line selection and pricing problem (PLSP) is presented and three solution procedures based on a genetic algorithm are developed to analyze the results based on consumer preference patterns. Since the PLSP model is nonlinear and integer, two of the solution procedures use genetic encoding to "relax" the NP hard model. The relaxations result in linear integer and shortest path models for the fitness evaluation which are solved using branch and bound and labeling algorithms, respectively. Performance of the quality of solutions generated by the procedures is evaluated for various problem sizes and customer preference structures. The results show that the genetic relaxations provide efficient and effective solution methodologies for the problem, when compared to the pure artificial intelligence technique of genetic search. The impact of the preference structure on the product line and the managerial implications of the Solution characteristics generated by the genetic relaxations are also discussed. The models can be used to explicitly consider tradeoffs between marketing and operations concerns in designing a product line. (c) 2005 Elsevier Ltd. All rights reserved.

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


A decomposed-model predictive functional control approach to air-vehicle pitch-angle control The requirements for the pitch-angle control of an air vehicle are a very fast response with as few vibrations as possible. The vibrations can damage the equipment that is carried within the body of the vehicle. The main problem to deal with is the relatively fast and under damped dynamics of the vehicle and the slow actuators and sensors. We have solved the problem by using a predictive approach. The main idea of this approach is a process output prediction based on a decomposed process model. The decomposition enables the extension of the model-based approach to processes with integrative behavior such as in the case of a rocket's pitch-angle control. The proposed approach is not only useful in this case but it gives us a framework to design the control for a wide range of processes. We compared the predictive design methodology with the classical compensator control approach, known from aerospace system control. The advantage of the new approach is the reduced vibrations during the transient response.

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

compensation
decomposition methods
modelling
predictive control


The impact of electronic medical record systems on outpatient workflows: A longitudinal evaluation of its workflow effects The promise of the electronic medical record (EMR)1 lies in its ability to reduce the costs of health care delivery and improve the overall quality of care a promise that is realized through major changes in workflows within the health care organization. Yet little systematic information exists about the workflow effects of EMRs. Moreover, some of the research to-date points to reduced satisfaction among physicians after implementation of the EMR and increased time, i.e., negative workflow effects. A better understanding of the impact of the EMR on workflows is, hence, vital to understanding what the technology really does offer that is new and unique. (i) To empirically develop a physician centric conceptual model of the workflow effects of EMRs; (ii) To use the model to understand the antecedents to the physicians workflow expectation from the new EMR; (iii) To track physicians satisfaction overtime, 3 months and 20 months after implementation of the EMR; (iv) To explore the impact of technology learning curves on physicians reported satisfaction levels. The current research uses the mixed-method technique of concept mapping to empirically develop the conceptual model of an EMR's workflow effects. The model is then used within a controlled study to track physician expectations from a new EMR system as well as their assessments of the EMR's performance 3 months and 20 months after implementation. The research tracks the actual implementation of a new EMR within the outpatient clinics of a large northeastern research hospital. The pre-implementation survey netted 20 physician responses; post-implementation Time 1 survey netted 22 responses, and Time 2 survey netted 26 physician responses. The implementation of the actual EMR served as the intervention. Since the study was conducted within the same setting and tracked a homogenous group of respondents, the overall study design ensured against extraneous influences on the results. Outcome measures were derived empirically from the conceptual model. They included 85 items that measured physician perceptions of the EMR's workflow effect on the following eight issues: (1) administration, (2) efficiency in patient processing, (3) basic clinical processes, (4) documentation of patient encounter, (5) economic challenges and reimbursement, (6) technical issues, (7) patient safety and care, and (8) communication and confidentiality. The items were used to track expectations prior to implementation and they served as retrospective measures of satisfaction with the EMR in post-implementation Time 1 and Time 2. The findings suggest that physicians conceptualize EMRs as an incremental extension of older computerized provider order entries (CPOEs) rather than as a new innovation. The EMRs major functional advantages are seen to be very similar to, if not the same as, those of CPOEs. Technology learning curves play a statistically significant though minor role in shaping physician perceptions. The physicians expectations from the EMR are based on their prior beliefs rather than on a rational evaluation of the EMR's fit, functionality, or performance. Their decision regarding the usefulness of the EMR is made very early, within the first few months of use of the EMR. These early perceptions then remain stable and become the lens through which subsequent experience with the EMR is interpreted. The findings suggest a need for communication based interventions aimed at explaining the value, fit, and usefulness of EMRs to physicians early in the pre- and immediate post-EMR implementation stages.

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

physicians adoption of emrs
diffusion of technology
health information technology
work flow effects
outpatient emr use


Application of the lattice Boltzmann method to flow in aneurysm with ring-shaped stent obstacles To resolve the characteristics of a highly complex flow, a lattice Boltzmann method with an extrapolation boundary technique was used in aneurysms with and without transverse objects oil the upper wall, and results were compared with the non-stented aneurysm. The extrapolation boundary concept allows the use of Cartesian grids even when the boundaries do not conform to Cartesian coordinates. To case the code development and facilitate the incorporation of new physics, a new scientific programming strategy based on object-oriented concepts was developed. The reduced flow, smaller vorticity magnitude and wall shear stress, and smaller du/dy near the dome of the aneurysm were observed when the proposed stent obstacles were used. The height of the stent obstacles was more effective to reduce the vorticity near the dome of the aneurysm than the width of the stent. The rectangular stent with 20% height-of-vessel radius was observed to be optimal and decreased the magnitude of the vorticity by 21% near the dome of the aneurysm. Copyright (C) 2008 John Wiley & Sons, Ltd.

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

computational fluid dynamics
object-oriented program


Simplification rules for the coherent probability assessment problem In this paper we develop a procedure for checking the consistency (coherence) of a partial probability assessment. The general problem (called CPA) is NP-complete, hence, to have a reasonable application some heuristic is needed. Our proposal differs from others because it is based on a skilful use of the logical relations present among the events. In other approaches the consistency problem is reduced directly to the satisfiability of a system of linear constraints. Here, thanks to the characterization of particular configurations and to the elimination of variables, an instance of the problem is reduced to smaller instances. To obtain such results, we introduce a procedure based on rules resembling those given by Davis-Putnam for the satisfiability of Boolean formulas. At the end a particularized description of an actual implementation is given.

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

coherent probability assessment
simplification rules


Constructing special k-dominating sets using variations on the greedy algorithm This paper focuses on the efficient selection of a special type of subset of network nodes, which we call a k k -SPR set, for the purpose of coordinating the routing of messages through a network. Such a set is a special k k -hop-connected k k -dominating set that has an additional property that promotes the regular occurrence of routers in all directions. The distributed algorithms introduced here for obtaining a k k -SPR set require that each node broadcast at most three messages to its k k -hop neighbors. These transmissions can be made asynchronously. The time required to send these messages and the sizes of the resulting sets are compared by means of data collected from simulations. The main contribution is the adaptation of some variations of the distributed greedy algorithms to the problem of generating a small k k -SPR set. These variations are much faster than the standard distributed greedy algorithm. Yet, when used with a sensible choice for a certain parameter, our empirical evidence strongly suggests that the resulting set size will generally be very close to the set size for the standard greedy algorithms.

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

distributed greedy algorithm
routing
dominating set


The convergence test of transformation performance of resource cities in China considering undesirable output The main challenge for sustainable development of resource cities is to work out a feasible strategy for transformation processes. This paper introduces a new approach for analysis of transformation performance. Using the environmental production technology and a Malmquist resource performance index (MRPI), we conduct sigma, absolute beta and conditional beta convergence tests for the transformation performance of 21 resource cities in China. The results show that MRPI does not follow the same trend as economic strength of three Chinese regions. In addition, the transformation performance results exhibit a convergence trend for the 21 resource cities. Crown Copyright (c) 2012 Published by Elsevier Ltd. All rights reserved.

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

resource cities
transformation performance
convergence test


Ant Colony Optimization based clustering methodology A novel ACO based methodology (ACO-C) is proposed for spatial clustering. It works in data sets with no a priori information. It includes solution evaluation, neighborhood construction and data set reduction. It has a multi-objective framework, and yields a set of non-dominated solutions. Experimental results show that ACO-C outperforms other competing approaches.

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

clustering
ant colony optimization
data set reduction


Breaching Euclidean distance-preserving data perturbation using few known inputs ? We examine Euclidean distance-preserving data perturbation as a tool for privacy-preserving data mining. Such perturbations allow many important data mining algorithms (e.g. hierarchical and k-means clustering), with only minor modification, to be applied to the perturbed data and produce exactly the same results as if applied to the original data. However, the issue of how well the privacy of the original data is preserved needs careful study. We engage in this study by assuming the role of an attacker armed with a small set of known original data tuples (inputs). Little work has been done examining this kind of attack when the number of known original tuples is less than the number of data dimensions. We focus on this important case, develop and rigorously analyze an attack that utilizes any number of known original tuples. The approach allows the attacker to estimate the original data tuple associated with each perturbed tuple and calculate the probability that the estimation results in a privacy breach. On a real 16-dimensional dataset, we show that the attacker, with 4 known original tuples, can estimate an original unknown tuple with less than 7% error with probability exceeding 0.8.

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


consistent interactive augmentation of live camera images with correct near-field illumination Inserting virtual objects in real camera images with correct lighting is an active area of research. Current methods use a high dynamic range camera with a fish-eye lens to capture the incoming illumination. The main problem with this approach is the limitation to distant illumination. Therefore, the focus of our work is a real-time description of both near - and far-field illumination for interactive movement of virtual objects in the camera image of a real room. The daylight, which is coming in through the windows, produces a spatially varying distribution of indirect light in the room; therefore a near-field description of incoming light is necessary. Our approach is to measure the daylight from outside and to simulate the resulting indirect light in the room. To accomplish this, we develop a special dynamic form of the irradiance volume for real-time updates of indirect light in the room and combine this with importance sampling and shadow maps for light from outside. This separation allows object movements with interactive frame rates (10--17 fps). To verify the correctness of our approach, we compare images of synthetic objects with real objects.

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

global illumination
augmented image synthesis


Dynamic programming based approximation algorithms for sequence alignment with constraints Given two sequences X and Y, the classical dynamic programming solution to the local alignment problem searches for two subsequences I subset of or equal to X and J subset of or equal to Y with maximum similarity score under a given scoring scheme. In several applications, variants of this problem arise with different objectives and with length constraints on the subsequences I and J. This constraint can be explicit, such as requiring \I\ + \J\ greater than or equal to t, or \J\ < T, or may be implicit such as in cyclic sequence comparison, or as in the maximization of length-normalized scores, and driven by practical considerations. We present a survey of approximation algorithms for various alignment problems with constraints, and several new approximation algorithms. These approximations are in two distinct senses: In one the constraints are satisfied but the score computed is within a prescribed tolerance of the optimum instead of the exact optimum. In another, the alignment returned is assured to have at least the Optimum score with respect to the given constraints, but the length constraints are satisfied to within a prescribed tolerance from the required values. The algorithms proposed involve applications of techniques from fractional programming and dynamic programming.

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

local alignment
cyclic sequence comparison
dynamic programming
fractional programming

normalized local alignment
length-restricted local alignment
approximation algorithm
ratio maximization


A model of multisecond timing behaviour under peak-interval procedures In this study, the authors developed a fundamental theory of interval timing behaviour, inspired by the learning-to-time (LeT) model and the scalar expectancy theory (SET) model, and based on quantitative analyses of such timing behaviour. Our experiments used the peak-interval procedure with rats. The proposed model of timing behaviour comprises clocks, a regulator, a mixer, a response, and memory. Using our model, we calculated the basic clock speeds indicated by the subjects behaviour under such peak procedures. In this model, the scalar property can be defined as a kind of transposition, which can then be measured quantitatively. The Akaike information criterion (AIC) values indicated that the current model fit the data slightly better than did the SET model. Our model may therefore provide a useful addition to SET for the analysis of timing behaviour.

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

akaike information criterion
scalar property
scalar expectancy theory

basic clock speed
learning-to-time model
peak procedure


The support vector machine under test Support vector machines (SVMs) are rarely benchmarked against other classification or regression methods. We compare a popular SVM implementation (libsvm) to 16 classification methods and 9 regression methodsall accessible through the software Rby the means of standard performance measures (classification error and mean squared error) which are also analyzed by the means of bias-variance decompositions. SVMs showed mostly good performances both on classification and regression tasks, but other methods proved to be very competitive.

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

support vector machines
regression
classification


using cascade method for table access on small devices Users increasingly expect access to Web data from a wide range of devices, both wired and wireless. The goal of our research is to inform the design of applications that support data access by providing reasonably seamless migration of Web data among internet-compatible devices with minimal loss of effectiveness and efficiency. This study focuses on the tables of data on small mobile devices. In this paper we report on the results of a user study that compare effectiveness, efficiency and preference of two methods for the display and use of tables on small screens: Column/Row Expansion and Cascade, a cell based expansion method.

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

handheld device
small screen
pda
auto-transformation
focus + context


practical use of polynomials over the reals in proofs of termination Nowadays, polynomial interpretations are an essential ingredient in the development of tools for proving termination. We have recently proven that polynomial interpretations over the reals are strictly better for proving polynomial termination of rewriting than those which only use integer coefficients. Some essential aspects of their practical use, though, remain unexplored or underdeveloped. In this paper, we compare the two current frameworks for using polynomial intepretations over the reals and show that one of them is strictly better than the other, thus making a suitable choice for implementations. We also prove that the use of algebraic real co-efficients in the interpretations suffice for termination proofs. We also discuss the use of algorithms and techniques from Tarski's first-order logic of the real closed fields for implementing their use in proofs of termination. We argue that more standard constraint-solving techniques are better suited for this. We propose an algorithm to solve the polynomial constraints which arise when specific finite subsets of rational (or even algebraic real) numbers are considered for giving value to the coefficients. We provide a preliminary experimental evaluation of the algorithm which has been implemented as part of the termination tool MU-TERM.

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

program analysis
term rewriting
polynomial orderings


DETECTING COHERENT ENERGY We apply the mathematics of cognitive radio to a single receiver to obtain a new coherent energy metric. This allows us to derive the time correlation law separating Gaussian colored noise from coherent signal energy.

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

cognitive radio
coherent energy
colored noise


Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks In this paper we study the delivery of quality contextual information in mobile ad-hoc networks. We consider that information has a certain quality level that fades over time. Mobile context-aware applications receive and process disseminated information given that the corresponding quality is above the lowest level. The necessity for optimally scheduling information delivery arises from the dynamic nature of the network, e.g., probabilistic spreading, caching, deferred delivery, and mobility of nodes. We propose two policies for optimal scheduling information delivery consumption based on the Optimal Stopping Theory. The mobile nodes delay the reporting of information to mobile context-aware applications in search for better quality. The proposed policies efficiently deal with the delivery of quality information in mobile ad-hoc networks.

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

quality information delivery
mobile ad-hoc networks


partnering enhanced-nlp with semantic analysis in support of information extraction Information extraction using Natural Language Processing (NLP) tools focuses on extracting explicitly stated information from textual material. This includes Named Entity Recognition (NER), which produces entities and some of the relationships that may exist among them. Intelligent analysis requires examining the entities in the context of the entire document. While some of the relationships among the recognized entities may be preserved during extraction, the overall context of a document may not be preserved. In order to perform intelligent analysis on the extracted information, we provide an ontology, which describes the domain of the extracted information, in addition to rules that govern the classification and interpretation of added elements. The ontology is at the core of an interactive system that assists analysts with the collection, extraction, organization, analysis and retrieval of information, with the topic of "terrorism financing" as a case study. User interaction provides valuable assistance in assigning meaning to extracted information. The system is designed as a set of tools to provide the user with the flexibility and power to ensure accurate inference. This case study demonstrates the information extraction features as well as the inference power that is supported by the ontology.

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

semantic analysis
information extraction
nlp
natural language processing
intelligent analysis
ontology


On stabilization of gradient-based training strategies for computationally intelligent systems This paper develops a novel training methodology for computationally intelligent systems utilizing gradient information in parameter updating. The devised scheme uses the first-order dynamic model of the training procedure and applies the variable structure systems approach to control the training dynamics. This results in an optimal selection of the learning rate, which is continually updated as prescribed by the adopted strategy. The parameter update rule is then mixed with the conventional error backpropagation method in a weighted average. The paper presents an analysis of the imposed dynamics, which is the response of the training dynamics driven solely by the inputs designed by variable structure control approach. The analysis continues with the global stability proof of the mixed training methodology and the restrictions on the design parameters. The simulation studies presented are focused on the advantages of the proposed scheme with regards to the compensation of the adverse effects of the environmental disturbances and its capability to alleviate the inherently nonlinear behavior of the system under investigation. The performance of the scheme is compared with that of a conventional backpropagation, It is observed that the method presented is robust under noisy observations and time varying parameters due to the integration of gradient descent technique with variable structure systems methodology, In the application example studied, control of a two degrees of freedom direct-drive robotic manipulator is considered. A standard fuzzy system is chosen as the controller in which the adaptation is carried out only on the defuzzifier parameters.

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

gradient descent
variable structure systems


Improving recruit distribution decisions in the US Marine Corps The United States Marine Corps (USMC) accomplishes its mission to put the right Marine in the right place at the right time with the right skills and quality of life in various ways. One of these is a recruit distribution modeling (RDM) and information system that assigns new recruits to entry-level schools, thereby determining the entire career paths. This article proposes improvements to the existing Marine Corps decision processes and information systems for recruit distribution. The proposed system, recruit distribution decision support system (RDdss), provides intuitive navigation through a hierarchy of switchboards, and promotes data integrity by eliminating manual data entry for data already available in the system. It incorporates four objective measures for understanding the quality of proposed distributions, and allows the user to generate and compare multiple solutions based on the trade-off between these objectives. It is a fully functional working prototype system that was installed into the USMC manpower environment, and demonstrated to provide several improvements over the current technology.

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

decision support system
recruit distribution


Boundary effects on the Soil Water Characteristic Curves obtained from lattice Boltzmann simulations Pore-scale simulations using a Lattice Boltzmann Method (LBM)-based numerical model were conducted to examine how the capillary pressure (Pc) ( P c ) and saturation (S ) evolve within a virtual porous medium subjected to drainage and imbibition cycles. The results show the presence of a sharp front (interface separating the wetting and non-wetting fluids) across the cell during the test, which expectably moves up and down as the controlling non-wetting fluid pressure at the upper boundary varies to simulate different Pc P c levels over the drainage and imbibition cycle. This phenomenon, representing inhomogeneity at the simulated scale, is in conflict with the homogenization applied to the pressure cell for deriving the constitutive PcS P c S relationship. Different boundary conditions, adopted to achieve more homogeneous states in the virtual soil, resulted in different PcS P c S curves. No unique relationship between Pc P c and S , even with the interfacial area (Anw) ( A nw ) included, could be found. This study shows dependence of the LBM-predicted PcS P c S relation on the chosen boundary conditions. This effect should be taken into account in future numerical studies of multiphase flow within porous media.

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

lattice boltzmann methods
unsaturated soil physics


A generic sampling framework for improving anomaly detection in the next generation network The heterogeneous nature of network traffic in next generation networks (NGNs) may impose scalability issue to traffic monitoring applications. While this issue can be well addressed by existing sampling approaches, owing to their inherent 'lossy' characteristic and data reduction principle, traditional sampling techniques suffer from incomplete traffic statistics, which can lead to inaccurate inferences of the network traffic. By focusing on two distinct traffic monitoring applications, namely, anomaly detection and traffic measurement, we highlight the possibility of addressing the accuracy of both applications without having to sacrifice one for the sake of the other. In light of this, we propose a generic sampling framework, which is capable of providing creditable network traffic statistics for accurate anomaly detection in the NON, while at the same time preserves the principal purpose of sampling (i.e., to sample dominant traffic flows for accurate traffic measurement), and thus addressing the accuracy of both applications concurrently. With the emphasize on the accuracy of anomaly detection and the scalability of monitoring devices, the performance evaluation over real network traces demonstrates the superiority of the proposed framework over traditional sampling techniques. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

sampling framework
accuracy
scalability
anomaly detection
traffic measurement


The \(k\)-separator problem: polyhedra, complexity and approximation results Given a vertex-weighted undirected graph \(G=(V,E,w)\) and a positive integer \(k\), we consider the \(k\)-separator problem: it consists in finding a minimum-weight subset of vertices whose removal leads to a graph where the size of each connected component is less than or equal to \(k\). We show that this problem can be solved in polynomial time for some graph classes including bounded treewidth, \(m K_2\)-free, \((G_1, G_2, G_3, P_6)\)-free, interval-filament, asteroidal triple-free, weakly chordal, interval and circular-arc graphs. Polyhedral results with respect to the convex hull of the incidence vectors of \(k\)-separators are reported. Approximation algorithms are also presented.

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

graph partitioning
complexity theory
optimization


Structural and electronic properties of Z isomers of (4 alpha -> 6 '',2 alpha -> O -> 1 '')-phenylflavans substituted with R=H, OH and OCH3 calculated in aqueous solution with PCM solvation model In the search for new antioxidants, flavan structures called our attention, as substructures of many important natural compounds, including catechins (flavan-3-ols), simple and dimeric proanthocyanidins, and condensed tannins. In this work the conformational space of the Z-isomers of (4 alpha -> 6 '', 2 alpha -> O -> 1 '')-phenylflavans substituted with R=H, OH and OCH3 was scanned in aqueous solution, simulating the solvent by the polarizable continuum model (PCM). Geometry optimizations were performed at B3LYP/6-31 G** level. Electronic distributions were analyzed at a better calculation level, thus improving the basis set (6-311++G**). A topological study based on Bader's theory (atoms in molecules) and natural bond orbital (NBO) framework was performed. Furthermore, molecular electrostatic potential maps (MEPs) were obtained and thoroughly analyzed. The stereochemistry was discussed, and the effect of the solvent was addressed. Moreover, intrinsic properties were identified, focusing on factors that may be related to their antioxidant properties. Hyperconjugative and inductive effects were described. The coordinated NBO/AIM analysis allowed us to rationalize the changes of MEPs in a polar solvent. To investigate the molecular and structural properties of these compounds in biological media, the polarizabilities and dipolar moments were predicted which were further used to enlighten stability and reactivity properties. All conformers were taken into account. Relevant stereoelectronic aspects were described for understanding the stabilization and antioxidant function of these structures.

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

(4 alpha -> 6 '',2 alpha -> o -> 1 '')-phenylflavans


Re-thinking metaphor, experience and aesthetic awareness Purpose - The purpose of this paper is to explore current questions about metaphor, experience and aesthetic awareness that persist through the variations of critical approaches and projective research in architectural theory and practice. Design/methodology/approach - Further considerations focus on the advanced technological possibilities which re-invest the relations between principles of cybernetics and architecture. Findings - The current between art and architecture is more than ever manifested in fields related to the computer sciences and its conceptual background: cybernetic sciences. Originality/value - The paper re-thinks the aesthetic value of architecture and architectural experience in this time of digital productivity.

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

cybernetics architecture experience metaphor


Agent Technologies for Sensor Networks The development of agent technologies for sensor networks has received increasing research attention within both the sensor network and multi-agent systems research communities. The International Workshops on Agent Technologies for Sensor Networks (ATSN) held in 2007, 2008 and 2009 sought to bring these communities together, and this special issue of The Computer Journal presents extended versions of some of the papers that appeared at these workshops, along with new submissions specifically for this journal.

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


Optimal consensus of fuzzy opinions under group decision making environment The gist of this paper is to propose a new method for aggregating individual fuzzy opinions into an optimal group consensus. By optimality, we mean the sum of weighted dissimilarity among aggregated consensus and individual opinions is minimized. We propose an iterative procedure for approximating the optimal consensus of expert opinions. Finally, the importance of each expert is taken into consideration in the process of aggregation. (C) 2002 Elsevier Science B.V. All rights reserved.

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

fuzzy individual opinions
fuzzy opinions aggregation
group consensus opinion
fuzzy numbers
multi-criteria decision making


Multiscale Bagging and Its Applications We propose multiscale bagging as a modification of the bagging procedure. In ordinary bagging, the bootstrap resampling is used for generating bootstrap samples. We replace it with the multiscale bootstrap algorithm. In multiscale bagging, the sample size in of bootstrap samples may be altered from the sample size n of learning dataset. For assessing the output of a classifier, we compute bootstrap probability of class label; the frequency of observing a specified class label in the outputs of classifiers learned from bootstrap samples. A scaling-law of bootstrap probability with respect to sigma(2) = n/m has been developed in connection with the geometrical theory. We consider two different ways for using multiscale bagging of classifiers. The first usage is to construct a confidence set of class labels, instead of a single label. The second usage is to find. inputs close to decision boundaries in the context of query by bagging for active learning. It turned out, interestingly, that an appropriate choice of m is m = -n, i.e., sigma(2) = -1, for the first usage, and m = infinity, i.e., sigma(2) = 0, for the second usage.

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


Estimation of lower and upper bounds on the power consumption from scheduled data flow graphs In this paper, we present an approach for the calculation of lower and upper bounds on the power consumption of data path resources like functional units, registers, I/O ports, and busses from scheduled data flow graphs executing a specified input data stream. The low power allocation and binding problem is formulated, First, it is shown that this problem without constraining the number of resources can be relaxed to the bipartite weighted matching problem which is solvable in O(n)(3). n is the number of arithmetic operations, variables, I/O-access or bus-access operations which have to be bound to data path resources, In a second step we demonstrate that the relaxation can be efficiently extended by including Lagrange multipliers in the problem formulation to handle a resource constraint, The estimated bounds take into account the effects of resource sharing. The technique can be used, for example, to prune the design space in high-level synthesis for low power before the allocation and binding of the resources. The application of the technique on benchmarks with real application input data shows the tightness of the bounds.

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

bound estimation
high-level synthesis
low-power
power dissipation
power estimation
switching activity


The effects of perceived risk and technology type on users acceptance of technologies ? Previous studies on technology adoption disagree regarding the relative magnitude of the effects of perceived usefulness and perceived ease of use. However these studies did not consider moderating variables. We investigated four potential moderating variables perceived risk, technology type, user experience, and gender in users technology adoption. Their moderating effects were tested in an empirical study of 161 subjects. Results showed that perceived risk, technology type, and gender were significant moderating variables. However the effects of user experience were marginal after the variance of errors was removed.

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

perceived risk
technology type
user experience
gender

technology acceptance
utaut
moderating variable


Estimation of process parameter variations in a pre-defined process window using a Latin hypercube method The aim of this paper is to present a methodology that provides an analytical tool for estimation of robustness and response variation within a pre-defined process window. To exemplify the developed methodology, the stochastic simulation technique is used for a sheet-metal forming application. A sampling plan based on the Latin hypercube sampling method for variation of design parameters is utilized, and the thickness reduction is specified as the response. Moreover, the response surface methodology is applied for understanding the quantitative relationship between design parameters and response value. The conclusions of this study are that the applied method gives a possibility to illustrate and interpret the variation of the response versus a design parameter variation. Consequently, it gives significant insights into the usefulness of individual design parameters. It has been shown that the method enables us to estimate the admissible design parameter variations and to predict the actual safe margin for given process parameters. Furthermore, the dominating design parameters can be predicated using sensitivity analysis, and this in its turn clarifies how the reliability criteria are met. Finally, the developed software can be used as an additional module for set-up of stochastic finite element simulations and to collect the numerical results from different solvers within different applications.

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

stochastical analysis
sensitivity indicator
admissible process parameter variation
finite element method
sheet-metal forming


Architecture and applications of the FingerMouse: a smart stereo camera for wearable computing HCI In this paper we present a visual input HCI system for wearable computers, the FingerMouse. It is a fully integrated stereo camera and vision processing system, with a specifically designed ASIC performing stereo block matching at 5Mpixel/s (e.g. QVGA 320240at 30fps) and a disparity range of 47, consuming 187mW (78mW in the ASIC). It is button-sized (43mm18mm) and can be worn on the body, capturing the users hand and processing in real-time its coordinates as well as a 1-bit image of the hand segmented from the background. Alternatively, the system serves as a smart depth camera, delivering foreground segmentation and tracking, depth maps and standard images, with a processing latency smaller than 1ms. This paper describes the FingerMouse functionality and its applications, and how the specific architecture outperforms other systems in size, latency and power consumption.

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

wearable computing
foreground segmentation
hci

stereo vision
mobile embedded vision
hand tracking


wireless sensor networking for rain-fed farming decision support Wireless sensor networks (WSNs) can be a valuable decision-support tool for farmers. This motivated our deployment of a WSN system to support rain-fed agriculture in India. We defined promising use cases and resolved technical challenges throughout a two-year deployment of our COMMON-Sense Net system, which provided farmers with environment data. However, the direct use of this technology in the field did not foster the expected participation of the population. This made it difficult to develop the intended decision-support system. Based on this experience, we take the following position in this paper: currently, the deployment of WSN technology in developing regions is more likely to be effective if it targets scientists and technical personnel as users, rather than the farmers themselves. We base this claim on the lessons learned from the COMMON-Sense system deployment and the results of an extensive user experiment with agriculture scientists, which we describe in this paper.

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

developing country
wireless sensor network


On stable parametric finite element methods for the Stefan problem and the MullinsSekerka problem with applications to dendritic growth We introduce a parametric finite element approximation for the Stefan problem with the GibbsThomson law and kinetic undercooling, which mimics the underlying energy structure of the problem. The proposed method is also applicable to certain quasi-stationary variants, such as the MullinsSekerka problem. In addition, fully anisotropic energies are easily handled. The approximation has good mesh properties, leading to a well-conditioned discretization, even in three space dimensions. Several numerical computations, including for dendritic growth and for snow crystal growth, are presented.

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

stefan problem
mullinssekerka problem
kinetic undercooling
gibbsthomson law
dendritic growth
snow crystal growth

surface tension
anisotropy
parametric finite elements


Binomial moments of the distance distribution: Bounds and applications We study a combinatorial invariant of codes which counts the number of ordered pairs of codewords in all subcodes of restricted support in a code. This invariant can be expressed as a linear form of the components of the distance distribution of the code with binomial numbers as coefficients. For this reason we call it a binomial moment of the distance distribution. Binomial moments appear in the proof of the MacWilliams identities and in many other problems of combinatorial coding theory. We introduce a linear programming problem for bounding these linear forms from below. It turns out that some known codes (1-error-correcting perfect codes, Golay codes, Nordstrom-Robinson code, etc.) yield optimal solutions of this problem, i.e., have minimal possible binomial moments of the distance distribution. We derive several general feasible solutions of this problem, which give lower bounds on the binomial moments of codes with given parameters, and derive the corresponding asymptotic bounds. Applications of these bounds include new lower bounds on the probability of undetected error for binary codes used over the binary-symmetric channel with crossover probability p and optimality of many codes for error detection. Asymptotic analysis of the bounds enables us to extend the range of code rates in which the upper bound on the undetected error exponent is tight.

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

binomial moments
distance distribution
linear programming
undetected error


Characteristics of WAP traffic This paper considers the characteristics of Wireless Application Protocol (WAP) traffic. We start by constructing a WAP traffic model by analysing the behaviour of users accessing public WAP sites via a monitoring system. A wide range of different traffic scenarios were considered, but most of these scenarios resolve to one of two basic types. The paper then uses this traffic model to consider the effects of large quantities of WAP traffic on the core network. One traffic characteristic which is of particular interest in network dimensioning is the degree of self-similarity, so the paper looks at the characteristics of aggregated traffic with WAP, Web and packet speech components to estimate its self-similarity. The results indicate that, while WAP traffic alone does not exhibit a significant degree of self-similarity, a combined load from various traffic sources retains almost the same degree of self-similarity as the most self-similar individual source.

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

traffic modelling
mobile data
self-similarity


Multimodal interactions in typically and atypically developing children: natural versus artificial environments This review addresses the central role played by multimodal interactions in neurocognitive development. We first analyzed our studies of multimodal verbal and nonverbal cognition and emotional interactions within neuronal, that is, natural environments in typically developing children. We then tried to relate them to the topic of creating artificial environments using mobile toy robots to neurorehabilitate severely autistic children. By doing so, both neural/natural and artificial environments are considered as the basis of neuronal organization and reorganization. The common thread underlying the thinking behind this approach revolves around the brains intrinsic properties: neuroplasticity and the fact that the brain is neurodynamic. In our approach, neural organization and reorganization using natural or artificial environments aspires to bring computational perspectives into cognitive developmental neuroscience.

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

verbal/nonverbal development
autism
mobile toy robot
free game play
positive emotion
neural mediator


Theoretical demonstration of symmetric IV I V curves in asymmetric molecular junction of monothiolate alkane A molecular junction of an asymmetric molecule generally demonstrates an asymmetric currentvoltage (IV I V ) curve, due to the unequal voltage drops at the two moleculeelectrode contacts. However, for asymmetric S(CH2)nCH3 S ( CH 2 ) n CH 3 molecules, symmetric IV I V curves are always obtained in the experimental measurements. Here, we investigate the electronic transport of the AuS(CH2)7CH3Au Au S ( CH 2 ) 7 CH 3 Au molecular junction in order to reveal the mechanism of the symmetric IV I V curve with ATK package, in which the density functional theory is combined with Keldysh nonequilibrium Green's function method to calculate the electronic and transport properties of nanoscale systems. And the symmetric IV I V curve can be interpreted by the curved surface model, which reproduces curved surface of the top electrode in the experiment.

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

first-principles
symmetry
iv i v curve iv i v iv i v i v
thiolalkane monolayer junction


Fuzzy reliability analysis of repairable industrial systems using soft-computing based hybridized techniques The present study analyzes the fuzzy reliability of a repairable industrial system utilizing uncertain data. One traditional (FLT) and two soft-computing based hybridized techniques (GABLT and NGABLT) are used. Some very important fuzzy reliability indices of a washing system in a paper plant have been computed. It is observed that GABLT performs consistently well in comparison to other two techniques. The analysis may be helpful for improving the performance of the considered system.

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

flt technique
gablt technique
ngablt technique
nonlinear programming
genetic algorithm
artificial neural networks (ann)