Population variation in genetic programming A new population variation approach is proposed, whereby the size of the population is systematically varied during the execution of the genetic programming process with the aim of reducing the computational effort compared with standard genetic programming (SGP). Various schemes for altering population size under this proposal are investigated using a comprehensive range of standard problems to determine whether the nature of the population variation, i.e. the way the population is varied during the search, has any significant impact on GP performance. The initial population size is varied in relation to the initial population size of the SGP such that the worst case computational effort is never greater than that of the SGP. It is subsequently shown that the proposed population variation schemes do have the capacity to provide solutions at a lower computational cost compared with the SGP.

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

genetic programming
computational effort
population variation

average number of evaluations
convergence


The Need for Power Debugging in the Multi-Core Environment Debugging an application for power has a wide array of benefits ranging from minimizing the thermal hotspots to reducing the likelihood of CPU malfunction. In this work, we justify the need for power debugging, and show that performance debugging of a parallel application does not automatically guarantee power balance across multiple cores. We perform experiments and show our results using two case study benchmarks, Volrend from Splash-2 and Bodytrack from Parsec-1.0.

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


Human resource assignment system for distribution centers Information technology and its wide range of applications have begun to make their presence in a new generation of logistic and distribution service industry. A more flexible breed of application packages Is emerging by the application of fourth generation language (4GL) technologies, which are able to provide foundations for true enterprise resource planning (ERP). There are many good reasons for adopting enterprise-wide resource planning systems. This research, however, focuses on the development of a human resource assignment module (HR module), usually considered as an essential part of an ERP system. This module provides crucial human resource data and supports decisions in human resource utilization in distribution center operations. We detail the crucial algorithm for the HR module, which provides efficient and effective manpower management for key logistic/distribution center operations.

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

human resource management
decision-support systems
order picking


Quantized circulation in dilute Bose-Einstein condensates We compute using a microscopic mean-field theory the structure and the quasiparticle excitation spectrum of a dilute. trapped Bose-Einstein condensate penetrated by an axisymmetric vortex line. The Gross-Pitaevskii equation for the condensate and the coupled Hartree-Fock-Bogoliubov-Popov equations describing the elementary excitations are solved self-consistently using finite-difference methods. We find locally stable vortex configurations at all temperatures below T-c. (C) 2001 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

bose-einstein condensation
vortices
finite-difference methods


the design and evaluation of a high-performance soft keyboard The design and evaluation of a high performance soft keyboard for mobile systems are described. Using a model to predict the upper-bound text entry rate for soft keyboards, we designed a keyboard layout with a predicted upper-bound entry rate of 58.2 wpm. This is about 35\% faster than the predicted rate for a QWERTY layout. We compared our design (OPTI) with a QWERTY layout in a longitudinal evaluation using five participants and 20 45-minute sessions of text entry. Average entry rates for OPT1 increased from 17.0 wpm initially to 44.3 wpm at session 20. The average rates exceeded those for the QWERTY layout after the 10 session (about 4 hours of practice). A regression equation (R = .997) in the form of the power-law of learning predicts that our upper-bound prediction would be reach at about session 50.

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

regression
design
layout
learning
text entry
model
soft keyboards
evaluation
mobile systems
predict

pen input
power law
high-performance
linguistic models
digraph probabilities
practical
fitts' law
stylus input
participant


Stereoscopic video coding and disparity estimation for low bitrate applications based on MPEG-4 multiple auxiliary components Using an MPEG-4 MAC (multiple auxiliary component) system is a good way to encode stereoscopic video with existing standard CODECs, especially when it comes to low bitrate applications. In this paper, we discuss the properties and problems of MAC systems when encoding stereoscopic video, and propose an MAC-based stereoscopic video coder and disparity estimation scheme to solve those problems. We used a reconstructed disparity map during the disparity compensation process and took that disparity map into account while estimating the base-view sequence motion vectors. Moreover, we proposed a search range finding and illumination imbalance decision system. We also proposed a block-based disparity map regularization process as well as block splitting in the object boundary and occlusion regions (to reduce the number of bits to encode in both the disparity map and the residual image). Last, we compensated for the imbalance between two cameras with a novel system that used MAC characteristics. Experimental results indicate that the proposed MAC system outperformed conventional stereo coding systems by a maximum of 3.5dB in terms of the PSNR and 1018% in terms of bitsaving, especially in low bitrate applications.

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

stereoscopic video coder
disparity estimation


Robust Recovery of Subspace Structures by Low-Rank Representation In this paper, we address the subspace clustering problem. Given a set of data samples (vectors) approximately drawn from a union of multiple subspaces, our goal is to cluster the samples into their respective subspaces and remove possible outliers as well. To this end, we propose a novel objective function named Low-Rank Representation (LRR), which seeks the lowest rank representation among all the candidates that can represent the data samples as linear combinations of the bases in a given dictionary. It is shown that the convex program associated with LRR solves the subspace clustering problem in the following sense: When the data is clean, we prove that LRR exactly recovers the true subspace structures; when the data are contaminated by outliers, we prove that under certain conditions LRR can exactly recover the row space of the original data and detect the outlier as well; for data corrupted by arbitrary sparse errors, LRR can also approximately recover the row space with theoretical guarantees. Since the subspace membership is provably determined by the row space, these further imply that LRR can perform robust subspace clustering and error correction in an efficient and effective way.

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

low-rank representation
segmentation
outlier detection


On an efficient CAD implementation of the distance term in Pelgrom's mismatch model In 1989, Pelgrom et al published a mismatch model for MOS transistors, where the variation of parameter mismatch between two identical transistors is given by two independent terms: a size-dependent term and a distance-dependent term. Some CAD tools based on a nonphysical interpretation of Pelgrom's distance term result in excessive computationally expensive algorithms, which become nonviable even for circuits with a reduced number of transistors. Furthermore, some researchers are reporting new variations on the original nonphysically interpreted algorithms, which may render false results. The purpose of this paper is to clarify the physical interpretation of the distance term of Pelgrom et al. and indicate how to model it efficiently in prospective CAD tools.

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

analog design
mismatch gradient planes
mismatch modeling
pelgrom model
sigma-space analysis


Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number Asteroidal Triple-free (AT-free) graphs have received considerable attention due to their inclusion of various important graphs families, such as interval and cocomparability graphs. The asteroidal number of a graph is the size of a largest subset of vertices such that the removal of the closed neighborhood of any vertex in the set leaves the remaining vertices of the set in the same connected component. (AT-free graphs have asteroidal number at most 2.) In this article, we characterize graphs of bounded asteroidal number by means of a vertex elimination ordering, thereby solving a long-standing open question in algorithmic graph theory. Similar characterizations are known for chordal, interval, and cocomparability graphs.

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


Clustering validity checking methods: Part II Clustering results validation is an important topic in the context of pattern recognition. We review approaches and systems in this context. In the first part of this paper we presented clustering validity checking approaches based on internal and external criteria. In the second, current part, we present a review of clustering validity approaches based on relative criteria. Also we discuss the results of an experimental study based on widely known validity indices. Finally the paper illustrates the issues that are under-addressed by the recent approaches and proposes the research directions in the field.

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

clustering validation
pattern discovery
unsupervised learning


a training software model of an interrupt system The paper justifies the necessity to introduce the students from the 'Computer Systems and Technologies' degree course to the structuce and way of operation of the interrupt system - one of the important components of the processor. Analysis of the basic funcionality of an example interrupt system is presented, an existing interrupt system is selected as a prototype of the training model and the arguments for its selection are proposed. The paper also describes the implemented model and its features. The work with the model will enable students to comprehend the way of operation of the interrupt system and it will be also used to check and assess their knowledge.

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

interrupt system
training software model


Efficient network QoS provisioning based on per node traffic shaping This paper addresses the problem of providing per-connection end-to-end delay guarantees in a high-speed network, We assume that the network is connection oriented and enforces some admission control which ensures that the source traffic conforms to specified traffic characteristics. We concentrate on the class of rate-controlled service (RCS) disciplines, in which traffic from each connection is reshaped at every hop, and develop end-to-end delay bounds for the general case where different reshapers are used at each hop. In addition, we establish that these bounds can also be achieved when the shapers at each hop have the same ''minimal'' envelope. The main disadvantage of this class of service discipline is that the end-to-end delay guarantees are obtained as the sum of the worst-case delays at each node, but we show that this problem can be alleviated through ''proper'' reshaping of the traffic, We illustrate the impact of this reshaping by demonstrating its use in designing RCS disciplines that outperform service disciplines that are based on generalized processor sharing (GPS), Furthermore, we show that we fan restrict the space of ''good'' shapers to a family which is characterized by only one parameter, We also describe extensions to the service discipline that make it work conserving and as a result reduce the average end-to-end delays.

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

real-time traffic
atm
scheduling
end-to-end delay guarantees


AS-level source routing for multi-provider connection-oriented services In this paper, we study the inter-domain Autonomous System (AS)-level routing problem within an alliance of ASs. We first describe the framework of our work, based on the introduction of a service plane for automatic multi-domain service provisioning. We adopt an abstract representation of domain relationships by means of directional metrics which are applied to a triplet (ingress point, transit AS, egress point) where the ingress and egress points can be ASs or routers. Then, we focus on the point-to-point and multipoint AS-level routing problems that arise in such an architecture. We propose an original approach that reaches near optimal solutions with tractable computation times. A further contribution of this paper is that a heavy step in the proposed heuristic can be precomputed, independently of the service demands. Moreover, we describe how in this context AS-level path diversity can be considered, and present the related extension of our heuristic. By extensive tests on AS graphs derived from the Internet, we show that our heuristic is often equal or a few percent close to the optimal, and that, in the case of precomputation, its time consumption can be much lower than with other well-known 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

inter-domain routing
inter-as mpls
qos routing
multipoint routing
as-level routing


Parallel and distributed simulation of sediment dynamics in shallow water using particle decomposition approach ? This paper describes the parallel simulation of sediment dynamics in shallow water. By using a Lagrangian model, the problem is transformed to one in which a large number of independent particles must be tracked. This results in a technique that can be parallelised with high efficiency. We have developed a sediment transport model using three different sediment suspension methods. The first method uses a modified mean for the Poisson distribution function to determine the expected number of the suspended particles in each particular grid cell of the domain over all available processors. The second method determines the number of particles to suspend with the aid of the Poisson distribution function only in those grid cells which are assigned to that processor. The third method is based on the technique of using a synchronised pseudo-random-number generator to generate identical numbers of suspended particles in all valid grid cells for each processor. Parallel simulation experiments are performed in order to investigate the efficiency of these three methods. Also the parallel performance of the implementations is analysed. We conclude that the second method is the best method on distributed computing systems (e.g., a Beowulf cluster), whereas the third maintains the best load distribution.

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

lagrangian particle model
stochastic differential equation
parallel processing
speed up
load balance


A numerical technique to predict periodic and quasi-periodic response of nonlinear dynamic systems A frequency domain based algorithm using Fourier approximation and Galerkin error minimization has been used to obtain the periodic orbits of large order nonlinear dynamic systems. The stability of these periodic response is determined through a bifurcation analysis using Floquet theory. This technique is applicable to dynamic systems having both analytic and nonanalytic nonlinearities. This technique is compared with numerical time integration and is found to be much faster in predicting the steady state periodic 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fouriergalerkinnewton technique
floquet analysis
bifurcations


Rough fuzzy approximations on two universes of discourse In rough set theory, the lower and upper approximation operators can be constructed via a variety of approaches. Various fuzzy generalizations of rough approximation operators have been made over the years. This paper presents a framework for the study of rough fuzzy sets on two universes of discourse. By means of a binary relation between two universes of discourse, a covering and three relations are induced to a single universe of discourse. Based on the induced notions, four pairs of rough fuzzy approximation operators are proposed. These models guarantee that the approximating sets and the approximated sets are on the same universes of discourse. Furthermore, the relationship between the new approximation operators and the existing rough fuzzy approximation operators on two universes of discourse are scrutinized, and some interesting properties are investigated. Finally, the connections of these approximation operators are made, and conditions under which some of these approximation operators are equivalent are obtained.

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O B 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 I O O O O O O O O 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 B I O O O O O O O O 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 sets
rough fuzzy approximation operators
two universes


Identification of different stages of diabetic retinopathy using retinal optical images Diabetes is a disease which occurs when the pancreas does not secrete enough insulin or the body is unable to process it properly. This disease affects slowly the circulatory system including that of the retina. As diabetes progresses, the vision of a patient may start to deteriorate and lead to diabetic retinopathy. In this study on different stages of diabetic retinopathy, 124 retinal photographs were analyzed. As a result, four groups were identified, viz., normal retina, moderate non-proliferative diabetic retinopathy, severe non-proliferative diabetic retinopathy and proliferative diabetic retinopathy. Classification of the four eye diseases was achieved using a three-layer feedforward neural network. The features are extracted from the raw images using the image processing techniques and fed to the classifier for classification. We demonstrate a sensitivity of more than 90% for the classifier with the specificity of 100%.

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

eye
normal
features
retinopathy
neural network
image processing
feedforward
classification


Constrained ZIP code segmentation by a PCNN-based thinning algorithm This paper proposes a novel thinning algorithm and applies it to automatic constrained ZIP code segmentation. The segmentation method consists of two main stages: removal of rectangle boxes and location of ZIP code digits. Both the two stages are implemented on the skeleton of boxes, which is extracted by the proposed pulse coupled neural network (PCNN) based thinning algorithm. This algorithm is specially designed to merely skeletonize the boxes. At the second stage, a projection method is employed to segment ZIP code image into its constituent digits. Experimental results show that the proposed method is very efficient in segmenting ZIP code images even with noise.

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

constrained zip code segmentation
pulse coupled neural network
skeleton
projection


multimodal authentication based on random projections and source coding In this paper, we consider an authentication framework for independent modalities based on binary hypothesis testing using source coding jointly with the random projections. The source coding ensures the multimodal signals reconstruction at the decoder based on the authentication data. The random projections are used to cope with the security, privacy, robustness and complexity issues. Finally, the authentication performance is investigated for both direct and random projections domains. The asymptotic performance approximation is derived and compared with the exact solutions. The impact of modality fusion on the authentication system performance is demonstrated.

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

fusion
hypothesis testing
random projections
multimodal authentication


Effects of additive elements on the phase formation and morphological stability of nickel monosilicide films Alloying elements can substantially affect the formation and morphological stability of nickel monosilicide. A comprehensive study of phase formation was performed on 24 Ni alloys with varying concentrations of alloying elements. Silicide films have been used for more than 15 years to contact the source, drain and gate of state-of-the-art complementary-metal-oxide-semiconductor (CMOS) devices. In the past, the addition of alloying elements was shown to improve the transformation from the high resistivity C49 to the low resistivity C54-TiSi2 phase and to allow for the control of surface and interface roughness of CoSi2 films as well as produce significant improvements with respect to agglomeration of the films. Using simultaneous time-resolved X-ray diffraction (XRD), resistance and light scattering measurements, we follow the formation of the silicide phases in real time during rapid thermal annealing. Additions to the NiSi system lead to modifications in the phase formation sequence at low temperatures (metal-rich phases), to variations in the formation temperatures of NiSi and NiSi2, and to changes in the agglomeration behavior of the films formed. Of the 24 elements studied, additions of Mo, Re, Ta and W are amongst the most efficient to retard agglomeration while elements such as Pd, Pt and Rh are most efficient to retard the formation of NiSi2.

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


HIGH-ORDER MULTIPLE-MODE AND TRANSADMITTANCE-MODE OTA-C UNIVERSAL FILTERS This paper presents two new high-order OTA-C universal filters. The first proposed filter structure employs n + 3 operational transconductance amplifiers (OTAs) and n grounded capacitors, which can realize nth-order multiple-mode (including voltage, current, transadmittance, and transimpedance modes) universal filtering responses (lowpass, highpass, bandpass, bandreject, and allpass) from the same topology. Since the OTA has high input and output impedances, it is very suitable for transadmittance-mode circuit applications. Therefore, a new high-order transadmittance-mode OTA-C universal filter structure using the minimum components is introduced. The second proposed filter structure uses only n + 1 OTAs and n grounded capacitors, which are the minimum components necessary for realizing nth-order transadmittance-mode universal filtering responses (lowpass, highpass, bandpass, bandreject, and allpass) from the same topology. This represents the attractive feature from chip area and power consumption point of view. Moreover, the two new OTA-C universal filters still enjoy many important advantages: no need of extra inverting or double-type amplifiers for special input signals, using only n grounded capacitors, no need of any resistors, cascadably connecting the former voltage-mode stage and the latter current-mode stage, and low sensitivity performance. H-Spice simulations with TSMC 0.35 mu m process and +/- 1.65V supply voltages are included and confirm the theoretical predictions.

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

multiple-mode
universal high-order filter
transimpedance-mode
transadmittance-mode


Random fuzzy fractional integral equations theoretical foundations This paper presents mathematical foundations for studies of random fuzzy fractional integral equations which involve a fuzzy integral of fractional order. We consider two different kinds of such equations. Their solutions have different geometrical properties. The equations of the first kind possess solutions with trajectories of nondecreasing diameter of their consecutive values. On the other hand, the solutions to equations of the second kind have trajectories with nonincreasing diameter of their consecutive values. Firstly, the existence and uniqueness of solutions is investigated. This is showed by using a method of successive approximations. An estimation of error of nth approximation is given. Also a boundedness of the solution is indicated. To show well-posedness of the considered theory, we prove that solutions depend continuously on the data of the equations. Some concrete examples of random fuzzy fractional integral equations are solved explicitly.

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


Efficient Opportunistic Routing in Utility-Based Ad Hoc Networks Due to resource scarcity, a paramount concern in ad hoc networks is utilizing limited resources efficiently. The self-organized nature of ad hoc networks makes the network utility-based approach an efficient way to allocate limited resources. However, the effect of link instability has not yet been adequately addressed in literature. To efficiently address the routing problem in ad hoc networks, we integrate the cost and stability into a network utility metric, and adopt the metric to evaluate the routing optimality in a unified, opportunistic routing model. Based on this model, an efficient algorithm is designed, both centralized and distributed implementations are presented, and extensive simulations on NS-2 are conducted to verify our results.

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

ad hoc networks
network utility
opportunistic routing
stability


A Computation to Integrate the Analysis of Genetic Variations Occurring within Regulatory Elements and Their Possible Effects Single nucleotide polymorphisms (SNPs) and short tandem repeats (STRs) are the most common genetic variations, are widespread within genomes, and form the diversity within species. These genetic variations affect many regulatory elements such as transcription factor binding sites (TFBSs), DNA methylation sites on CpG islands, and microRNA target sites; these elements have been found to play major as well as indirect roles in regulating gene expression. Currently, systems are available to display such genetic variation occurring within regulatory elements. To understand and display all the potential variation described above, we have developed a web-based system tool, the Regulatory Element and Genetic Variation Viewer (REGV Viewer [REGV]), which provides a friendly web interface for users and shows genetic variation information within regulatory elements by either inputting a gene list or selecting a chromosome by name. Moreover, our tool not only supports logic operation queries, but after a query is submitted, it also shows a high-throughput simulation, including combined data, statistical graphs, and graphical views of the genetic variants and regulatory elements. Additionally, when the SNP variation occurs within TFBSs and if the SNP allele frequency and TFBS position weight matrices (PWMs) are available, our system will show the new putative TFBSs resulting from the SNP variation.

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


Programs as visual, interactive documents We present a novel approach to combined textual and visual programming by allowing visual, interactive objects to be embedded within textual source code and segments of source code to be further embedded within those objects. We retain the strengths of text-based source code, while enabling visual programming where it is beneficial. Additionally, embedded objects and code provide a simple object-oriented approach to adding a visual form of LISP-style macros to a language. The ability to freely combine source code and visual, interactive objects with one another allows for the construction of interactive programming tools and experimentation with novel programming language extensions. Our visual programming system is supported by a type coercion-based presentation protocol that displays normal Java and Python objects in a visual, interactive form. We have implemented our system within a prototype interactive programming environment called The Larch Environment. Copyright 2013 John Wiley & Sons, Ltd.

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

java
python
environment
visual programming
interactive


The equilibrium limit of a constitutive model for two-phase granular mixtures and its numerical approximation In this paper we analyze the equilibrium limit of the constitutive model for two-phase granular mixtures introduced in Papalexandris (2004) [13], and develop an algorithm for its numerical approximation. At, equilibrium, the constitutive model reduces to a strongly coupled, overdetermined system of quasilinear elliptic partial differential equations with respect to the pressure and the volume fraction of the solid granular phase. First we carry a perturbation analysis based on standard hydrostatic-type scaling arguments which reduces the complexity of the coupling of the equations. The perturbed system is then supplemented by an appropriate compatibility condition which arises from the properties of the gradient operator. Further, based on the Helmholtz decomposition and Ladyzhenskayas decomposition theorem, we develop a projection-type, Successive-Over-Relaxation numerical method. This method is general enough and can be applied to a variety of continuum models of complex mixtures and mixtures with micro-structure. We also prove that this method is both stable and consistent hence, under standard assumptions, convergent. The paper concludes with the presentation of representative numerical results.

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

complex fluids
overdetermined elliptic systems
ladyzhenskayas theorem
successive-over-relaxation
predictorcorrector methods


Analysis of sonar targets by teager-huang transform (THT) In this paper, an approach for Sonar targets analysis based on a new energy-time-frequency representation, called Teager-Huang Transform (THT), is presented. The THT is the combination of the empirical mode decomposition of Huang and the Teager-Kaiser signal demodulation method. The THT is free of interferences and does not requires basis functions for signals decomposition. The analysis is carried out, in free field, from the impulse responses of Sonar targets. We compare the analysis results of impulse responses of spherical and cylindrical targets given by THT to those of the smoothed Wigner-Ville transformation.

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

time frequency analysis
teager-kaiser energy operator
teager huang transform (tht)
sonar echos.


International Standard Development for Knowledge Based Engineering Services for Product Lifecycle Management In September 2005, the international information technology standard body Object Management Group (OMG) published a Request for Proposal (RFP) for an international standard for Knowledge Based Engineering (KBE) Services for Product Lifecycle Management (PLM). The standard aims to facilitate the integration of KBE applications in a PLM environment. KBE has been used in key engineering industry to deliver significant business benefits and has been a catalyst for changes in engineering processes. In recent years, mainstream CAD vendors begin to incorporate KBE functionalities in their solutions. PLM is evolving from the platform to manage engineering data to the repository of complete enterprise knowledge. As CAD becomes more knowledge based, the convergence of KBE and PLM is expected to happen soon. The OMG standard RFP is an action to accelerate this convergence. The RFP is the result of an international effort with a team that includes engineering end users, software vendors and researchers. This paper presents the essence and the development process of the RFP to widen the engagement with the engineering research community.

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

knowledge based engineering
product lifecycle management


An image topic model for image denoising Topic model is a powerful tool for the basic document or image processing tasks. In this study we introduce a novel image topic model, called Latent Patch Model (LPM), which is a generative Bayesian model and assumes that the image and pixels are connected by a latent patch layer. Based on the LPM, we further propose an image denoising algorithm namely multiple estimate LPM (MELPM). Unlike other works, the proposed denoising framework is totally implemented on the latent patch layer, and it is effective for both Gaussian white noises and impulse noises. Experimental results demonstrate that LPM performs well in representing images. And its application in image denoising achieves competitive PSNR and visual quality with conventional algorithms.

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


improving test case generation for web applications using automated interface discovery With the growing complexity of web applications, identifying web interfaces that can be used for testing such applications has become increasingly challenging. Many techniques that work effectively when applied to simple web applications are insufficient when used on modern, dynamic web applications, and may ultimately result in inadequate testing of the applications' functionality. To address this issue, we present a technique for automatically discovering web application interfaces based on a novel static analysis algorithm. We also report the results of an empirical evaluation in which we compare our technique against a traditional approach. The results of the comparison show that our technique can (1) discover a higher number of interfaces and (2) help generate test inputs that achieve higher coverage.

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

help
applications
test
dynamic
static analysis
interfaces
web application
complexity
algorithm
coverage
empirical evaluation

interface extraction
web-application testing
functional
addressing
web interface
test case generation
discoveries
comparisons
automation


Numerical study of stream-function formulation governing flows in multiply-connected domains by integrated RBFs and Cartesian grids This paper describes a new numerical procedure, based on point collocation, integrated multiquadric functions and Cartesian grids, for the discretisation of the stream-function formulation for flows of a Newtonian fluid in multiply-connected domains. Three particular issues, namely (i) the derivation of the stream-function values on separate boundaries, (ii) the implementation of cross derivatives in irregular regions, and (iii) the treatment of double boundary conditions, are studied in the context of Cartesian grids and approximants based on integrated multiquadric functions in one dimension. Several test problems, i.e. steady flows between a rotating circular cylinder and a fixed square cylinder and also between eccentric cylinders maintained at different temperatures, are investigated. Results obtained are compared well with numerical data available in the literature. Crown Copyright (C) 2010 Published by Elsevier Ltd. All rights reserved.

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


Linear techniques to correct for temperature-induced spectral variation in multivariate calibration The influence of external physical variation such as temperature fluctuations on near-infrared (NIR) spectra and their effect on the predictive power of calibration models such as PLS have been studied. Different methods to correct for the temperature effect by explicitly including the temperature in a calibration model have been tested. The results are compared to the implicit inclusion, which takes the temperature into account only through the calibration design. Two data sets are used, one well-designed data set measured in the laboratory and one industrial data set consisting of measurements for process samples. For both data sets, the explicit inclusion of the temperature in the calibration models did not result in an improvement of the prediction accuracy compared to implicit inclusion. (C) 2000 Elsevier Science B.V. All rights reserved.

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

spectral variation
temperature
nir spectra


Overlapping B+-trees: An implementation of a transaction time access method A new variation of Overlapping B+ -trees is presented, which provides efficient indexing of transaction time and keys in a two dimensional key-time space. Modification operations (i.e. insertions, deletions and updates) are allowed at the current version, whereas queries are allowed to any temporal version, i.e. either in the current or in past versions. Using this structure, snapshot and range-timeslice queries can be answered optimally. However, the fundamental objective of the proposed method is to deliver efficient performance in case of a general pure-key query (i.e. 'history of a key'). The trade-off is a small increase in time cost for version operations and storage requirements. (C) 1999 Elsevier Science B.V. All rights reserved.

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

temporal databases
access methods
algorithms
time and space performance


Using a strategy-aligned fuzzy competitive analysis approach for market segment evaluation and selection This study applies Five Forces Analysis to evaluate and select market segments for international business using a strategy-aligned fuzzy approach. An illustration segment evaluation procedure is used to demonstrate that our procedure is an effective quantification approach for integrating five forces, generic strategies and marketing information in a group decision-making process. The final decision-maker (DM) synthesizes the total crisp scores of individual alternatives by choosing judgmental coefficients ? based on individual attitude towards core business competitiveness and market risks to accommodate differences among market segments to the specific environment with a better understanding of the decision problem and individual decision-making behavior. In the illustration presented here, the final solution is then obtained by identifying the best market segment for further development and negotiation.

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

market segment selection
fuzzy factor rating system
strategy alignment
multiple attributes decision-making


Using AdaBoost classifiers in a hierarchical framework for classifying surface images of marble slabs In this paper, a new hierarchical classification method based on the use of various types of AdaBoost classification algorithms is proposed for automatic classification of marble slab images according to their quality. At first, features are extracted using the sum and difference histograms method and, at the second stage, different versions of the AdaBoost algorithms are used as classifiers together with those extracted features in a proposed hierarchical fashion. Performance of the proposed method is compared against performances of different types of neural network classifiers and a support vector machine (SVM) classifier. Computational results show that the proposed hierarchical structure employing AdaBoost algorithms performs superior to neural networks and the SVM classifier for classifying marble slab images in our large and diversified data set. (C) 2010 Elsevier Ltd. All rights reserved.

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

classification of marble slab images
hierarchical classification
adaboost classification algorithms


On bridging the gap between stochastic integer programming and MIP solver technologies Stochastic integer programs (SIPs) represent a very difficult class of optimization problems arising from the presence of both uncertainty and discreteness in planning and decision problems. Although applications of SIPs are abundant, nothing is available by way of computational software. On the other hand, commercial software packages for solving deterministic integer programs have been around for quite a few years, and more recently, a package for solving stochastic linear programs has been released. In this paper, we describe how these software tools can be integrated and exploited for the effective solution of general-purpose SIPs. We demonstrate these ideas on four problem classes from the literature and show significant computational advantages.

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


Historiographic mapping of knowledge domains literature To better understand the topic of this colloquium, we have created a series of databases related to knowledge domains (dynamic systems [small world/Milgram], information visualization [Tufte], co-citation [Small], bibliographic coupling [Kessler], and scientometrics [Scientometrics]). I have used a software package called HistCite(TM) which generates chronological maps of subject (topical) collections resulting from searches of the ISI Web of Science(R) or ISI citation indexes (SCI, SSCI, and/or AHCI) on CD-ROM. When a marked list is created on WoS, an export file is created which contains all cited references for each source document captured. These bibliographic collections, saved as ASCII files, are processed by HistCite in order to generate chronological and other tables as well as historiographs which highlight the most-cited works in and outside the collection. HistCite also includes a module for detecting and editing errors or variations in cited references as well as a vocabulary analyzer which generates both ranked word lists and word pairs used in the collection. Ideally the system will be used to help the searcher quickly identify the most significant work on a topic and trace its year-by-year historical development. In addition to the collections mentioned above, historiographs based on collections of papers that cite the Watson-Crick 1953 classic paper identifying the helical structure of DNA were created. Both year-by-year as well as month-by-month displays of papers from 1953 to 1958 were necessary to highlight the publication activity of those years.

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

mapping
knowledge domains
information visualization
software
histcite

small world concept
dna structure
citation analysis
historiography


Bot detection evasion: a case study on local-host alert correlation bot detection methods Botnets have continuously evolved since their inception as a malicious entity. Attackers come up with new botnet designs that exploit the weaknesses in existing defense mechanisms and continue to evade detection. It is necessary to analyze the weaknesses of existing defense mechanisms to find out the lacunae in them. This research exposes a weakness found in an existing bot detection method (BDM) by implementing a specialized P2P botnet model and carrying out experiments on it. Weaknesses that are found and validated can be used to predict the development path of botnets, and as a result, detection and mitigation measures can be implemented in a proactive fashion. The main contribution of this work is to demonstrate the exploitation pattern of an inherent weakness in local-host alert correlation (LHAC) based methods and to assert that current LHAC implementations could allow pockets of cooperative bots to hide in an enterprise size network. This work suggests that additional monitoring capabilities must be added to current LHAC-based methods in order for them to remain a viable bot detection mechanism. Copyright (C) 2012 John Wiley & Sons, Ltd.

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


New plating bath for electroless copper deposition on sputtered barrier layers A new copper plating bath for electroless deposition directly on conductive copper-diffusion barrier layers has been developed. This plating bath can be operated at temperatures between 20 and 50C and has good stability. High temperature processing allows for increased deposition rates and decreased specific resistivity values for the deposited copper films. Electroless Cu films deposited from this bath showed a conformal step coverage in high aspect ratio trenches and, therefore, are promising as seed layers for copper electroplating. The effect of the bath composition, activation procedure and processing temperature on the plating rate and morphology of the deposited copper has been studied and is presented here.

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


An adaptive finite element procedure for fully-coupled point contact elastohydrodynamic lubrication problems This paper presents an automatic locally adaptive finite element solver for the fully-coupled EHL point contact problems. The proposed algorithm uses a posteriori error estimation in the stress in order to control adaptivity in both the elasticity and lubrication domains. The implementation is based on the fact that the solution of the linear elasticity equation exhibits large variations close to the fluid domain on which the Reynolds equation is solved. Thus the local refinement in such region not only improves the accuracy of the elastic deformation solution significantly but also yield an improved accuracy in the pressure profile due to increase in the spatial resolution of fluid domain. Thus, the improved traction boundary conditions lead to even better approximation of the elastic deformation. Hence, a simple and an effective way to develop an adaptive procedure for the fully-coupled EHL problem is to apply the local refinement to the linear elasticity mesh. The proposed algorithm also seeks to improve the quality of refined meshes to ensure the best overall accuracy. It is shown that the adaptive procedure effectively refines the elements in the region(s) showing the largest local error in their solution, and reduces the overall error with optimal computational cost for a variety of EHL cases. Specifically, the computational cost of proposed adaptive algorithm is shown to be linear with respect to problem size as the number of refinement levels grows.

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

elastohydrodynamic lubrication
linear elasticity

finite element method
fully coupled approach
adaptive h-refinement
optimization of meshes


Allowing each node to communicate only once in a distributed system: shared whiteboard models In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and links may indicate telephone calls). Since such graphs are massive they need to be processed in a distributed way. When computing graph-theoretic properties, nodes become natural units for distributed computation. Links do not necessarily represent communication channels between the computing units and therefore do not restrict the communication flow. Our goal is to model and analyze the computational power of such distributed systems where one computing unit is assigned to each node. Communication takes place on a whiteboard where each node is allowed to write at most one message. Every node can read the contents of the whiteboard and, when activated, can write one small message based on its local knowledge. When the protocol terminates its output is computed from the final contents of the whiteboard. We describe four synchronization models for accessing the whiteboard. We show that message size and synchronization power constitute two orthogonal hierarchies for these systems. We exhibit problems that separate these models, i.e., that can be solved in one model but not in a weaker one, even with increased message size. These problems are related to maximal independent set and connectivity. We also exhibit problems that require a given message size independently of the synchronization model.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 computing
local computation
graph properties
bounded communication


A dual spinal cord lesion paradigm to study spinal locomotor plasticity in the cat After a complete spinal cord injury (SCI) at the lowest thoracic level (T13), adult cats trained to walk on a treadmill can recover hindlimb locomotion within 23 weeks, resulting from the activity of a spinal circuitry termed the central pattern generator (CPG). The role of this spinal circuitry in the recovery of locomotion after partial SCIs, when part of descending pathways can still access the CPG, is not yet fully understood. Using a dual spinal lesion paradigm (first hemisection at T10 followed three weeks after by a complete spinalization at T13), we showed that major changes occurred in this locomotor spinal circuitry. These plastic changes at the spinal cord level could participate in the recovery of locomotion after partial SCI. This short review describes the main findings of this paradigm in adult cats.

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

central pattern generator
plasticity
spinal cord injury
locomotion


Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking We present the way in which we have constructed an implementation of a sparse Cholesky factorization based on a hypermatrix data structure. This data structure is a storage scheme which produces a recursive 2D partitioning of a sparse matrix. It can be useful on some large sparse matrices. Subblocks are stored as dense matrices. Thus, efficient BLAS3 routines can be used. However, since we are dealing with sparse matrices some zeros may be stored in those dense blocks. The overhead introduced by the operations on zeros can become large and considerably degrade performance. We present the ways in which we deal with this overhead. Using matrices from different areas (Interior Point Methods of linear programming and Finite Element Methods), we evaluate our sequential in-core hypermatrix sparse Cholesky implementation. We compare its performance with several other codes and analyze the results. In spite of using a simple fixed-size partitioning of the matrix our code obtains competitive performance.

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

hypermatrix structure
windows in submatrices
small matrix library


Atomic precision patterning on Si: An opportunity for a digitized process H depassivation lithography is a process by which a monolayer of H absorbed on a Si(100) 21 surface may be patterned by the removal of H atoms using a scanning tunneling microscope. This process can achieve atomic resolution where individual atoms are targeted and removed. This paper suggests that such a patterning process can be carried out as a digital process, where the pixels of the pattern are the individual H atoms. The goal is digital fabrication rather than digital information processing. The margins for the read and write operators appear to be sufficient for a digital process, and the tolerance for physical addressing of the atoms is technologically feasible. A digital fabrication process would enjoy some of the same advantages of digital computation; namely high reliability, error checking and correction, and the creation of complex systems.

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

lithography
scanning tunneling microscope
si
digital process


Automated Worst-Case Execution Time Analysis Based on Program Modes A program mode is a regular trajectory of the execution of a program that is determined by the values of its input variables. By exploiting program modes, we may make worst-case execution time (WCET) analysis more precise. This paper presents a novel method to automatically find program modes and calculate the WCET estimates of programs. First, the modes of a program will be identified automatically by mode-relevant program slicing, and the precondition will be calculated for each mode using a path-wise test data generation method. Then, for each feasible mode, we show how to calculate its WCET estimate for modern reduced instruction set computer (RISC) processors with caches and pipelines and for traditional complex instruction set computer (CISC) processors. We also present a method to obtain the symbolic expression for each mode for CISC processors. The experimental results show the effectiveness of the method.

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

wcet analysis
program mode
program slicing

real-time systems
iterative relaxation method


Non-agricultural databases and thesauri Retrieval of subject headings and non-controlled terms in relation to agriculture Purpose - The paper aims to assess the utility of non-agriculture-specific information systems, databases, and respective controlled vocabularies (thesauri) in organising and retrieving agricultural information. The purpose is to identify thesaurus-linked tree structures, controlled subject headings/terms (heading words, descriptors), and principal database-dependent characteristics and assess how controlled terms improve retrieval results (recall) in relation to free-text/uncontrolled terms in abstracts and document titles. Design/methodology/approach - Several different hosts (interfaces, platforms, portals) and databases were used: CSA Illumina.(ERIC, LISA), Ebscohost (Academic Search Complete, Medline, Political Science Complete), Ei-Engineering Village (Compendex, Inspec), OVID (PsycINFO), ProQuest (ABI/Inform Global). The search-terms agriculture and agricultural and truncated word-stem agricultur- were employed. Permuted (rotated index) search fields were used to retrieve terms from thesauri. Subject-heading search was assessed in relation to free-text search, based on abstracts and document titles. Findings - All thesauri contain agriculture-based headings; however, associative, hierarchical and synonymous relationships show important inter-database differences. Using subject headings along with abstracts and titles in search syntax (query) sometimes improves retrieval by up to 60 per cent. Retrieval depends on search fields and database-specifics, such as autostemming (lemmatization), explode function, word-indexing, or phrase-indexing. Research limitations/implications - Inter-database and host comparison, on consistent principles, can be limited because of some particular host- and database-specifics. Practical implications - End-users may exploit databases more competently and thus achieve better retrieval results in searching for agriculture-related information. Originality/value - The function of as many as ten databases in different disciplines in providing information relevant to subject matter that is not a topical focus of databases is assessed.

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

thesauri
controlled vocabularies
subject headings
databases
agriculture


Efficient Packet Classification with a Hybrid Algorithm Packet classification categorizes incoming packets into multiple forwarding classes based on pre-defined filters. This categorization makes information accessible for quality of service or security handling in the network. In this paper, we propose a scheme which combines the Aggregate Bit Vector algorithm and the pruned Tuple Space Search algorithm to improve the performance of packet classification in terms of speed and storage. We also present the procedures of incremental update. Our scheme is evaluated with filter databases of varying sizes and characteristics. The experimental results demonstrate that our scheme is feasible and scalable.

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

network intrusion defection systems
firewalls
qos
packet forwarding


The Intra-Americas Sea Low-level Jet A relevant climate feature of the Intra-Americas Sea (IAS) is the low-level jet (IALLJ) dominating the IAS circulation, both in summer and winter; and yet it is practically unknown with regard to its nature, structure, interactions with mid-latitude and tropical phenomena, and its role in regional weather and climate. This paper updates IALLJ current knowledge and its contribution to IAS circulationprecipitation patterns and presents recent findings about the IALLJ based on first in situ observations during Phase 3 of the Experimento Climtico en las Albercas de Agua Clida (ECAC), an international field campaign to study IALLJ dynamics during July 2001. Nonhydrostatic fifth-generation Pennsylvania State University National Center for Atmospheric Research Mesoscale Model (MM5) simulations were compared with observations and reanalysis. Large-scale circulation patterns of the IALLJ northern hemisphere summer and winter components suggest that trades, and so the IALLJ, are responding to landocean thermal contrasts during the summer season of each continent. The IALLJ is a natural component of the American monsoons as a result of the continent's approximate northsouth land distribution. During warm (cold) El NioSouthern Oscillation phases, winds associated with the IALLJ core (IALLJC) are stronger (weaker) than normal, so precipitation anomalies are positive (negative) in the western Caribbean near Central America and negative (positive) in the central IAS. During the ECAC Phase 3, strong surface winds associated with the IALLJ induced upwelling, cooling down the sea surface temperature by 12 C. The atmospheric mixed layer height reached 1 km near the surface wind maximum below the IALLJC. Observations indicate that primary water vapor advection takes place in a shallow layer between the IALLJC and the ocean surface. Latent heat flux peaked below the IALLJC. Neither the reanalysis nor MM5 captured the observed thermodynamic and kinematic IALLJ structure. So far, IALLJ knowledge is based on either dynamically initialized data or simulations of global (regional) models, which implies that a more systematic and scientific approach is needed to improve it. The Intra-Americas Study of Climate Processes is a great regional opportunity to address trough field work, modeling, and process studies, many of the IALLJ unknown features.

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

intra-americas low-level jet
tropical climate variability
mm5 modeling
enso


Operational knowledge representation for practical decision-making For the design of an "intelligent" assistant system aimed at supporting operators' decision in subway control, we modeled operators' activity and know-how. As a result, we introduce the notion of a contextual graph, which appears as a simple solution to describe and manage operational decision-making.

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

context representation
contextual graphs
decision tree
operational knowledge


ORGANIZATIONAL STRUCTURE-SATISFACTORY SOCIAL LAW DETERMINATION IN MULTIAGENT WORKFLOW SYSTEMS The multiagent workflow systems can be formalized from an organizational structure viewpoint, which includes three parts: the interaction structure among agents, the temporal flow of activities, and the critical resource sharing relations among activities. While agents execute activities, they should decide their strategies to satisfy the constraints brought by the organizational structure of multiagent workflow system. To avoid collisions in the multiagent workflow system, this paper presents a method to determine social laws in the system to restrict the strategies of agents and activities; the determined social laws can satisfy the characteristics of organization structures so as to minimize the conflicts among agents and activities. Moreover, we also deal with the social law adjustment mechanism for the alternations of interaction relations, temporal flows, and critical resource sharing relations. It is proved that our model can produce useful social laws for organizational structure of multiagent workflow systems, i.e., the conflicts brought by the constraints of organization structure can be minimized.

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

multiagents
.workflows
coordination
social strategies
organizational structures


CONTENT-AWARE RETARGETING FOR SOCCER VIDEO ADAPTATION A content-aware retargeting method is proposed for adapting soccer video to heterogeneous terminals. According to domain-specific knowledge, ball, player and player's face are defined as user interested objects (UIOs) in different view-types. The UIOs are extracted by semantic analysis on soccer video, and then a region of interest (ROI) of each shot is determined jointly by three factors: terminal size, scaling factor and aspect ratio. The proposed method optimizes the retargeted region to contain more semantic content while adapting the constraint of terminal screen. The simulation results prove that the proposed CAR system wins better viewing experiences than the traditional methods such as resizing in a "Letter box" mechanism or cropping directly.

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

video retargarting
user interested object
video analysis
view-type


Ribosome kinetics and aa-tRNA competition determine rate and fidelity of peptide synthesis It is generally accepted that the translation rate depends on the availability of cognate aa-tRNAs. In this study it is shown that the key factor that determines translation rate is the competition between near-cognate and cognate aa-tRNAs. The transport mechanism in the cytoplasm is diffusion, thus the competition between cognate, near-cognate and non-cognate aa-tRNAs to bind to the ribosome is a stochastic process. Two competition measures are introduced; C(i) and R(i) (i=1, 64) are quotients of the arrival frequencies of near-cognates vs. cognates and non-cognates vs. cognates, respectively. Furthermore, the reaction rates of bound cognates differ from those of bound near-cognates. If a near-cognate aa-tRNA binds to the A site of the ribosome, it may be rejected at the anti-codon recognition step or proofreading step or it may be accepted. Regardless of its fate, the near-cognates and non-cognates have caused delays of varying duration to the observed rate of translation. Rate constants have been measured at a temperature of 20C by (Gromadski, K.B., Rodnina, M.V., 2004. Kinetic determinants of high-fidelity tRNA discrimination on the ribosome. Mol. Cell 13, 191200). These rate constants have been re-evaluated at 37C, using experimental data at 24.5C and 37C (Varenne, S., et al., 1984. Translation in a non-uniform process: effect of tRNA availability on the rate of elongation of nascent polypeptide chains. J. Mol. Biol. 180, 549576). The key results of the study are: (i) the average time (at 37C) to add an amino acid, as defined by the ith codon, to the nascent peptide chain is: ?(i)=9.06+1.445[10.48C(i)+0.5R(i)] (in ms); (ii) the misreading frequency is directly proportional to the near-cognate competition, E(i)=0.0009C(i); (iii) the competition from near-cognates, and not the availability of cognate aa-tRNAs, is the most important factor that determines the translation rate the four codons with highest near-cognate competition (in the case of E. coli) are [GCC]>[CGG]>[AGG]>[GGA], which overlap only partially with the rarest codons: [AGG]<[CCA]<[GCC]<[CAC]; (iv) based on the kinetic rates at 37C, the average time to insert a cognate amino acid is 9.06ms and the average delay to process a near-cognate aa-tRNA is 10.45ms and (vii) the model also provides estimates of the vacancy times of the A site of the ribosome an important factor in frameshifting.

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

ribosome kinetics
translation
trna availability


An efficient and spectrally accurate numerical method for computing dynamics of rotating Bose-Einstein condensates In this paper, we propose an efficient and spectrally accurate numerical method for computing the dynamics of rotating Bose-Einstein condensates (BEC) in two dimensions (2D) and 3D based on the Gross-Pitaevskii equation (GPE) with an angular momentum rotation term. By applying a time-splitting technique for decoupling the nonlinearity and properly using the alternating direction implicit (ADI) technique for the coupling in the angular momentum rotation term in the GPE, at every time step, the GPE in rotational frame is decoupled into a nonlinear ordinary differential equation (ODE) and two partial differential equations with constant coefficients. This allows us to develop new time-splitting spectral methods for computing the dynamics of BEC in a rotational frame. The new numerical method is explicit, unconditionally stable, and of spectral accuracy in space and second-order accuracy in time. Moreover, it is time reversible and time transverse invariant, and conserves the position density in the discretized level if the GPE does. Extensive numerical results are presented to confirm the above properties of the new numerical method for rotating BEC in 2D and 3D. (c) 2006 Elsevier Inc. 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 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 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

rotating bose-einstein condensates
gross-pitaevskii equation
time spitting


The entropy of traces in parallel computation The following problem arises in thtr context of parallel computation: how many bits of information are required to specify any one element from an arbitrary (nonempty) X-subset of a set? We characterize optimal coding techniques for this problem. We calculate the asymptotic behavior of the amount of information necessary, and construct an algorithm that specifies an element from a subset in an optimal manner.

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


Proteomic Technologies to Study Diseases of the Lymphatic Vascular System Now that the human genome has been mapped, a new challenge has emerged

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

proteomics
cancer
lymph
lymphatic endothelium
lymphedema
laser capture microdissection
protein microarrays
seldi-tof-mass spectroscopy


leveraging eclipse for integrated model-based engineering of web service compositions In this paper we detail the design and implementation of an Eclipse plug-in for an integrated, model-based approach, to the engineering of web service compositions. The plug-in allows a designer to specify a service's obligations for coordinated web service compositions in the form of Message Sequence Charts (MSCs) and then generate policies in the form of WS-CDL and services in the form of BPEL4WS. The approach uses finite state machine representations of web service compositions and service choreography rules, and assigns semantics to the distributed process interactions. The move towards implementing web service choreography requires design time verification of these service interactions to ensure that service implementations fulfill requirements for multiple interested partners before such compositions and choreographies are deployed. The plug-in provides a tool for integrated specification, formal modeling, animation and providing verification results from choreographed web service interactions. The LTSA-Eclipse (for Web Services) plug-in is publicly available, along with other plug-ins, at: http://www.doc.ic.ac.uk/ltsa.

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

verification
web service choreography
implementation

eclipse plug-in
service design
standards
validation
model checking


Targeted Recruitment of Histone Modifications in Humans Predicted by Genomic Sequences Histone modifications are important epigenetic regulators and play a critical role in development. The targeting mechanism for histone modifications is complex and still incompletely understood. Here we applied a computational approach to predict genome-scale histone modification targets in humans by the genomic DNA sequences using a set of recent ChIP-seq data. We found that a number of histone modification marks could be predicted with high accuracy. On the other hand, the impact of DNA sequences for each mark is intrinsically different dependent upon the target-and tissue-specificity. Diverse patterns are associated with different repetitive elements. Unexpectedly, we found that non-overlapping, functionally opposite histone modification marks could share similar sequence features. We propose that these marks may target a common set of loci but are mutually exclusive and that the competition may be important for developmental control. Taken together, we show that our computational approach has provided new insights into the targeting mechanism of histone modifications.

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


Normal vector voting: Crease detection and curvature estimation on large, noisy meshes This paper describes a robust method for crease detection and curvature estimation on large, noisy triangle meshes. We assume that these meshes are approximations of piecewise-smooth surfaces derived from range or medical imaging systems and thus may exhibit measurement or even registration noise. The proposed algorithm, which we call normal vector voting, uses an ensemble of triangles in the geodesic neighborhood of a vertex-instead of its simple umbrella neighborhood-to estimate the orientation and curvature of the original surface at that point. With the orientation information, we designate a vertex as either lying on a smooth surface, following a crease discontinuity, or having no preferred orientation. For vertices on a smooth surface, the curvature estimation yields both principal curvatures and principal directions while for vertices on a discontinuity we estimate only the curvature along the crease. The last case for no preferred orientation occurs when three or more surfaces meet to form a corner or when surface noise is too large and sampling density is insufficient to determine orientation accurately. To demonstrate the capabilities of the method, we present results for both synthetic and real data and compare these results to the G. Taubin (1995, in Proceedings of the Fifth International Conference on Computer Vision, pp. 902-907) algorithm. Additionally, we show practical results for several large mesh data sets that are the motivation for this algorithm. (C) 2002 Elsevier Science (USA).

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

normal vector estimation
dense triangle meshes
piecewise-smooth surfaces


acoustic super models for large scale video event detection Given the exponential growth of videos published on the Internet, mechanisms for clustering, searching, and browsing large numbers of videos have become a major research area. More importantly, there is a demand for event detectors that go beyond the simple finding of objects but rather detect more abstract concepts, such as "feeding an animal" or a "wedding ceremony". This article presents an approach for event classification that enables searching for arbitrary events, including more abstract concepts, in found video collections based on the analysis of the audio track. The approach does not rely on speech processing, and is language-indepent, instead it generates models for a set of example query videos using a mixture of two types of audio features: Linear-Frequency Cepstral Coefficients and Modulation Spectrogram Features. This approach can be used in complement with video analysis and requires no domain specific tagging. Application of the approach to the TRECVid MED 2011 development set, which consists of more than 4000 random "wild" videos from the Internet, has shown a detection accuracy of 64\% including those videos which do not contain an audio track.

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

multimedia event detection
audio processing


Morphological influence of the beam overlap in focused ion beam induced deposition using raster scan Material addition using focused ion beam induced deposition (FIBID) is a well-established local deposition technology in microelectronic engineering. We investigated FIBID characteristics as a function of beam overlap using phenanthrene molecules. To initiate the localization of gas molecules, we irradiated the ion beams using a raster scan. We varied the beam overlap between ?900% and 50% by adjusting the pixel size from 300nm to 15nm. We discuss the changes in surface morphologies and deposition rates due to delocalization by the range effect of excited surface atoms, the divided structure by continuous effect from the raster scan, enhanced localization by discrete effect from replenished gas molecules, the competition between deposition and sputtering processes, and the change in processing time with scan speed (smaller overlap case).

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


Content-aware rate allocation for efficient video streaming via dynamic network utility maximization Nowadays it is vital to design robust mechanisms to provide QoS for multimedia applications as an integral part of the network traffic. The main goal of this paper is to provide an efficient rate control scheme to support content-aware video transmission mechanism with buffer underflow avoidance at the receiver in congested networks. Towards this, we introduce a content-aware time-varying utility function, in which the quality impact of video content is incorporated into its mathematical expression. Moreover, we analytically model the buffer requirements of video sources in two ways: first as constraints of the optimization problem to guarantee a minimum rate demand for each source, and second as a penalty function embedded as part of the objective function attempting to achieve the highest possible rate for each source. Then, using the proposed analytical model, we formulate a dynamic network utility maximization problem, which aims to maximize the aggregate hybrid objective function of sources subject to capacity and buffer constraints. Finally, using primaldual method, we solve DNUM problem and propose a distributed algorithm called CA-DNUM that optimally allocates the shared bandwidth to video streams. The experimental results demonstrate the efficacy and performance improvement of the proposed content-aware rate allocation algorithm for video sources in different scenarios.

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

video streaming
dynamic network utility maximization
buffer underflow avoidance

content-aware video utility model
convex optimization


INVERSE PROBLEM FOR FRICATIVES Articulatory parameters, vocal tract shape and cross-sectional area function were determined from fricative spectra. A model of fricative generation was used for providing acoustical constraints for an optimization procedure with muscles work as the criterion of optimality. A distance between spectra was measured with the use of the Cauchy-Bounjakovsky non-equality. A proper initial approximation of articulatory parameters is required to obtain an accurate and stable solution of the inverse problem.

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

inverse problem
vocal tract shape
fricatives
optimization


efficient web usage mining process for sequential patterns The tremendous growth in volume of web usage data results in the boost of web mining research with focus on discovering potentially useful knowledge from web usage data. This paper presents a new web usage mining process for finding sequential patterns in web usage data which can be used for predicting the possible next move in browsing sessions for web personalization. This process consists of three main stages: preprocessing web access sequences from the web server log, mining preprocessed web log access sequences by a tree-based algorithm, and predicting web access sequences by using a dynamic clustering-based model. It is designed based on the integration of the dynamic clustering-based Markov model with the Pre-Order Linked WAP-Tree Mining (PLWAP) algorithm to enhance mining performance. The proposed mining process is verified by experiments with promising results.

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

web usage mining (wum)
pre-order linked wap-tree (plwap-tree)
web access patterns (wap)


experimenting with an organic metaphor and hypervisual links for the interface of a video collection In this paper we describe the prototype of an archive of short movies. The project proposes two original solutions for implementing the interface of this archive: an organic metaphor and a hypervisual navigation mechanism.

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

user interfaces
metaphors
hyperlinks
hypervideo


A Randomized Exhaustive Propositionalization Approach for Molecule Classification Drug discovery is the process of designing compounds that have desirable properties, such as activity and nontoxicity. Molecule classification techniques are used along with this process to predict the properties of the compounds to expedite their testing. Ideally, the classification rules found should be accurate and reveal novel chemical properties, but current molecule representation techniques lead to less-than-adequate accuracy and knowledge discovery. This work extends the propositionalization approach recently proposed for multirelational data mining in two ways: it generates expressive attributes exhaustively, and it uses randomization to sample a limited set of complex ("deep") attributes. Our experimental tests show that the procedure is able to generate meaningful and interpretable attributes from molecular structural data, and that these features are effective for classification purposes.

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

propositionalization
molecule classification
drug discovery


Error propagation analysis for underwater cooperative multi-hop communications The potential gains of cooperative Communication and multi-hopping in underwater acoustic communication channels is examined. In particular, performance of such systems is compared to a comparable single hop system (direct transmission) with a common transmission distance. The effects of error propagation with decode and forward at each relay are explicitly treated and it is shown that strong gains can be achieved by multi-hopping (an effective SNR gain) is well as cooperation, which contributes to a diversity gain. We observe that cooperative diversity gains are retained even when considering error propagation. The analysis is done via a Markov chain analysis for both regular linear and grid networks. Our initial analysis is for single path channels; the effects of inter symbol interference as well as multi.-user interference are examined. It is found that due to the strong decay of signal power as a function of transmission distance, multi-user interference is not as significant as inter-symbol interference. In both cases, cooperative and multi-hopping gains are observed. (C) 2008 Published by Elsevier B.V.

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

underwater acoustic communications
cooperative communications
multi-hopped networks
fading multipath channels
sensor networks


evolutionary algorithms for reasoning in fuzzy description logics with fuzzy quantifiers The task of reasoning with fuzzy description logics with fuzzy quantification is approached by means of an evolutionary algorithm. An essential ingredient of the proposed method is a heuristic, implemented as an intelligent mutation operator, which observes the evolutionary process and uses the information gathered to guess at the mutations most likely to bring about an improvement of the solutions. The viability of the method is demonstrated by applying it to reasoning on a resource sheduling problem.

B I O O O O B I O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 quantification
evolutionary algorithms
description logics


Deadline-based scheduling in support of real-time data delivery The use of deadline-based scheduling in support of real-time delivery of application data units (ADUs) in a packet-switched network is investigated. Of interest is priority scheduling where a packet with a smaller ratio of T/H (time until delivery deadline over number of hops remaining) is given a higher priority. We refer to this scheduling algorithm as the T/H algorithm. T/H has time complexity of O(logN) for a backlog of N packets and was shown to achieve good performance in terms of the percentage of ADUs that are delivered on-time. We develop a new and efficient algorithm, called T/H?p, that has O(1) time complexity. The performance difference of T/H, T/H?p and FCFS are evaluated by simulation. Implementations of T/H and T/H?p in high-speed routers are also discussed. We show through simulation that T/H?p is superior to FCFS but not as good as T/H. In view of the constant time complexity, T/H?p is a good candidate for high-speed routers when both performance and implementation cost are taken into consideration.

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

real-time data delivery
deadline-based scheduling
packet-switched networks
performance evaluation