Highly reliable LDPC coded data transfer in home networks by using Canetes PLC channel model A power line communication system for smart grids is investigated in this study. Canetes PLC channel model is employed in this study. Several channel codes and decoder types are compared for performance evaluation. LDPC codes can be efficiently utilized for channel coding purposes in smart grids.

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

low-density parity-check codes
bit error rate performance simulation


Seascorr: A MATLAB program for identifying the seasonal climate signal in an annual tree-ring time series A common research task in dendroclimatology is identification of the monthly or seasonal climate signal in an annual time series of indices of ring width. A MATLAB function, seascorr, is introduced as a general statistical tool for identifying the signal. Monthly time series of primary and secondary climate variables are input to the function along with a tree-ring time series and specifications for seasonal groupings. The relationship of the tree-ring series with the seasonalized primary climate variable is summarized by simple correlations. The relationship with the secondary climate variable is summarized by partial correlations, controlling for the influence of the primary climate variable. Confidence intervals on sample correlations and partial correlations are estimated with the help of Monte Carlo simulation of the tree-ring series by exact simulation, which preserves the spectral properties of the observed series. Results are summarized in graphical and statistical output. The function is illustrated with examples from Tunisia and Russia. (C) 2011 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 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 B I O 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

dendroclimatology
exact simulation
tunisia


Implementation of a direct procedure for critical point computations using preconditioned iterative solvers Computation of critical points on an equilibrium path requires the solution of a non-linear eigenvalue problem. These critical points could be either bifurcation or limit points. When the external load is parametrized by a single parameter, the non-linear stability eigenvalue problem consists of solving the equilibrium equations along the criticality condition. Several techniques exist for solution of such a system. Their algorithmic treatment is usually focused for direct linear solvers and thus use the block elimination strategy. In this paper special emphasis is given for a strategy which can be used also with iterative linear solvers. Comparison to the block elimination strategy with direct linear solvers is given. Due to the non-uniqueness of the critical eigenmode a normalizing condition is required. In addition, for bifurcation points, the Jacobian matrix of the augmented system is singular at the critical point and additional stabilization is required in order to maintain the quadratic convergence of the Newtons method. Depending on the normalizing condition, convergence to a critical point with negative load parameter value can happen. The form of the normalizing equation is critically discussed. Due to the slenderness of the buckling sensitive structures the resulting matrices are ill-conditioned and a good preconditioner is mandatory for efficient solution.

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

non-linear eigenvalue problem
preconditioned iterations


ubiquitous ims emergency services over cooperative heterogeneous networks There are various emergency services based on wireless sensor network being proposed recently. However, the ability of these services/networks is inherently limited by geographical restrictions and need to be deployed in advance. This paper proposes an application level approach to enhance the service coverage and availability of emergency services. Specifically, we augment these services with All-IP network infrastructure based on IP Multimedia Subsystem (IMS). Furthermore, we integrate the IMS Emergency Services architecture with Cooperative Network technology to provide ubiquitous emergency services. We also investigate the prime problems of cooperation between heterogeneous networks and IMS. Finally, we present and discuss the experimental results of performance in our Cooperative Emergency IMS Testbed.

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

cooperative networks
ip multimedia subsystems
emergency service


Gaussian Process Models of Dynamic PET for Functional Volume Definition in Radiation Oncology In routine oncologic positron emission tomography (PET), dynamic information is discarded by time-averaging the signal to produce static images of the "standardised uptake value" (SUV). Defining functional volumes of interest (VOIs) in terms of SUV is flawed, as values are affected by confounding factors and the chosen time window, and SUV images are not sensitive to functional heterogeneity of pathological tissues. Also, SUV iso-contours are highly affected by the choice of threshold and no threshold, or other SUV-based segmentation method, is universally accepted for a given VOI type. Gaussian Process (GP) time series models describe macro-scale dynamic behavior arising from countless interacting micro-scale processes, as is the case for PET signals from heterogeneous tissue. We use GPs to model time-activity curves (TACs) from dynamic PET and to define functional volumes for PET oncology. Probabilistic methods of tissue discrimination are presented along with novel contouring methods for functional VOI segmentation. We demonstrate the value of GP models for voxel classification and VOI contouring of diseased and metastatic tissues with functional heterogeneity in prostate PET. Classification experiments reveal superior sensitivity and specificity over SUV calculation and a TAC-based method proposed in recent literature. Contouring experiments reveal differences in shape between gold-standard and GP VOIs and correlation with kinetic models shows that the novel VOIs contain extra clinically relevant information compared to SUVs alone. We conclude that the proposed models offer a principled data analysis technique that improves on SUVs for oncologic VOI definition. Continuing research will generalize GP models for different oncology tracers and imaging protocols with the ultimate goal of clinical use including treatment planning.

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

gaussian processes
image classification
nonlinear dynamical systems
object segmentation
positron emission tomography (pet)


The effects of exploration strategies and communication models on the performance of cooperative exploration Exploration with mobile robots is utilized in a wide range of applications including search and rescue missions, planetary exploration, homeland security, surveillance, and reconnaissance. Cooperative exploration offers the potential of exploring an unknown zone more quickly and robustly than single-robot case. However, coordinating multiple robots is a challenging task due to heterogeneous processing and communication requirements, and the complexities of exploration algorithms. This paper presents a comparison of different cooperative exploration strategies, such as frontier-based exploration, market-driven exploration, and role-based exploration, based on their exploration performances and processing time requirements. To show the effect of CPU power on the processing time of the exploration algorithms, two notebooks and a netbook with different specifications have been extensively used. Comparative simulation results of our own application developed in Java show that the processing time requirements are consistent with the computational complexities of the exploration strategies. The results we obtained are consistent with the CPU power tests of independent organizations, and show that higher processing power reduces processing time accordingly.

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

cooperative exploration strategies
communication models
processing time requirements
exploration performances


parabolic cable element for static analysis of cable structures Purpose - The purpose of this paper is to present a finite element formulation of enhanced two-node parabolic cable element for the static analysis of cable structures. Design/methodology/approach - Unlike the assumed polynomial displacement interpolation functions, the present approach uses the analytical cable dynamic stiffness matrix to obtain the explicit expression of the static stiffness matrix of an inclined sagging cable by setting the frequency at zero. The Newton-Raphson-based iterative method is used to obtain the solution. Findings - It is demonstrated that the present results agree well with those obtained from the nonlinear analytical theory of a parabolic cable and previous reported methods in the literature. Originality/value - This paper proposes a two-node parabolic cable element. For comparable accuracy with the truss element method, fewer numbers of such cable elements are needed.

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

finite element analysis
newton method
physical properties of materials
strength of materials
structural analysis
design and theory


Dominating Induced Matchings for P 7-Free Graphs in Linear Time LetG be a finite undirected graph with edge set E. An edge set E??E is an induced matching inG if the pairwise distance of the edges of E? inG is at least two; E? is dominating inG if every edge e?E?E? intersects some edge in E?. The Dominating Induced Matching Problem (DIM, for short) asks for the existence of an induced matching E? which is also dominating inG; this problem is also known as the Efficient Edge Domination Problem.

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

dominating induced matching
efficient edge domination

p 7-free graphs
linear time algorithm
robust algorithm


energy-aware dual-mode voltage scaling for weakly hard real-time systems In this paper we study the problem of minimizing energy while ensuring the designated QoS requirements for weakly hard realtime systems on a dual-mode variable voltage processor. The QoS is quantified with the (m, k)-constraints. We proposed a dynamic scheduling strategy, based on pattern variation and the enhanced dual priority scheduling, to guarantee the (m, k)-constraints while optimizing the energy consumption. The simulation results demonstrate that our proposed techniques can achieve significant energy saving performance while ensuring the (m, k)-guarantee.

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


Laplace mixture of linear experts Mixture of Linear Experts (MoLE) models provide a popular framework for modeling nonlinear regression data. The majority of applications of MoLE models utilizes a Gaussian distribution for regression error. Such assumptions are known to be sensitive to outliers. The use of a Laplace distributed error is investigated. This model is named the Laplace MoLE (LMoLE). Links are drawn between the Laplace error model and the least absolute deviations regression criterion, which is known to be robust among a wide class of criteria. Through application of the minorizationmaximization algorithm framework, an algorithm is derived that monotonically increases the likelihood in the estimation of the LMoLE model parameters. It is proven that the maximum likelihood estimator (MLE) for the parameter vector of the LMoLE is consistent. Through simulation studies, the robustness of the LMoLE model over the Gaussian MOLE model is demonstrated, and support for the consistency of the MLE is provided. An application of the LMoLE model to the analysis of a climate science data set is described.

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

laplace distribution
mixture of experts
robust regression


Compact low-power time-based conversion with noise immunity similar to digital conversion An analog signal representation based on the inter-pulse-interval (IPI) time is presented. Voltage-to-IPI and IPI-to-voltage conversion circuits based on the representation are described. The circuits have been fabricated using a 0.35 mu m mixed-signal CMOS process. Simulation and test results agree with the theory. Voltage-to-IPI conversion needs significantly less area and power than ADC and is significantly more immune to noise and other problems than using analog voltage/current signals.

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

inter-pulse interval
mixed signal
low power
integrated circuits
soc


Using a composite grid approach in a complex coastal domain to estimate estuarine residence time We investigate the processes that influence residence time in a partially mixed estuary using a three-dimensional circulation model. The complex geometry of the study region is not optimal for a structured grid model and so we developed a new method of grid connectivity. This involves a novel approach that allows an unlimited number of individual grids to be combined in an efficient manner to produce a composite grid. We then implemented this new method into the numerical Regional Ocean Modeling System (ROMS) and developed a composite grid of the Hudson River estuary region to investigate the residence time of a passive tracer. Results show that the residence time is a strong function of the time of release (spring vs. neap tide), the along-channel location, and the initial vertical placement. During neap tides there is a maximum in residence time near the bottom of the estuary at the mid-salt intrusion length. During spring tides the residence time is primarily a function of along-channel location and does not exhibit a strong vertical variability. This model study of residence time illustrates the utility of the grid connectivity method for circulation and dispersion studies in regions of complex geometry.

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

residence time
estuary
roms
composite grid

three-dimensional model
hudson river estuary


DISTRIBUTED VERIFICATION AND HARDNESS OF DISTRIBUTED APPROXIMATION We study the verification problem in distributed networks, stated as follows. Let H be a subgraph of a network G where each vertex of G knows which edges incident on it are in H. We would like to verify whether H has some properties, e. g., if it is a tree or if it is connected (every node knows at the end of the process whether H has the specified property or not). We would like to perform this verification in a decentralized fashion via a distributed algorithm. The time complexity of verification is measured as the number of rounds of distributed communication. In this paper we initiate a systematic study of distributed verification and give almost tight lower bounds on the running time of distributed verification algorithms for many fundamental problems such as connectivity, spanning connected subgraph, and s-t cut verification. We then show applications of these results in deriving strong unconditional time lower bounds on the hardness of distributed approximation for many classical optimization problems including minimum spanning tree (MST), shortest paths, and minimum cut. Many of these results are the first nontrivial lower bounds for both exact and approximate distributed computation, and they resolve previous open questions. Moreover, our unconditional lower bound of approximating MST subsumes and improves upon the previous hardness of approximation bound of Elkin [M. Elkin, SIAM J. Comput., 36 (2006), pp. 433-456] as well as the lower bound for (exact) MST computation of Peleg and Rubinovich [D. Peleg and V. Rubinovich, SIAM J. Comput., 30 (2000), pp. 1427-1442]. Our result implies that there can be no distributed approximation algorithm for MST that is significantly faster than the current exact algorithm for any approximation factor. Our lower bound proofs show an interesting connection between communication complexity and distributed computing which turns out to be useful in establishing the time complexity of exact and approximate distributed computation of many problems.

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

lower bounds
hardness of approximation
communication complexity

distributed algorithms
graph optimization problems


Biomechanical study of different plate configurations for distal humerus osteosynthesis Fractures of the distal humerus are most commonly fixed by open reduction and internal fixation, using plates and screws, either in a locking or in a non-locking construct. Three different plating systems are commonly used in practice. The most important differences between them are in plate orientation, which affects both the rigidity of the osteosynthesis and invasiveness of the surgical procedure. Unfortunately, there is no common agreement between surgeons about which plate configuration brings the best clinical outcome. In this study, we investigate the theoretical rigidity of plate osteosyntheses considering two types of AO/ASIF configurations (90 angle between plates), Mayo clinic (Acumed) configuration (180 between plates) and dorsal fixation of both plates. We also compared the results for cases with and without contact between the bone fragments. In the case of no bone contact, the Mayo clinic plate configuration is found to be the most rigid, followed by both AO/ASIF plate configurations, and the least rigid system is the Korosec plate configuration. On the other hand, no significant differences between all types of fixation configurations are found in cases with contact in-between the bone fragments. Our findings show that this contact is very important and can compensate for the lack of load carrying capacity of the implants. This could therefore incite other implant fixation solutions, leading to less invasive surgical procedures and consequently improved clinical outcome.

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

fracture
minimally invasive surgery
finite element analysis


Stochastic Traffic Engineering in Multihop Cognitive Wireless Mesh Networks In this work, the stochastic traffic engineering problem in multihop cognitive wireless mesh networks is addressed. The challenges induced by the random behaviors of the primary users are investigated in a stochastic network utility maximization framework. For the convex stochastic traffic engineering problem, we propose a fully distributed algorithmic solution which provably converges to the global optimum with probability one. We next extend our framework to the cognitive wireless mesh networks with nonconvex utility functions, where a decentralized algorithmic solution, based on learning automata techniques, is proposed. We show that the decentralized solution converges to the global optimum solution asymptotically.

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


Mid-air display experiments to create novel user interfaces Displays are the most visible part of most computer applications. Novel display technologies strongly influence and inspire new forms of computer use and interaction. We are particularly interested in the interplay of novel displays and interaction for ubiquitous computing or ambient media environments, as emerging display technologies may become game-changers in how we define and use computers, possibly changing the context of computing fundamentally.

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


Automatic tag expansion using visual similarity for photo sharing websites In this paper we present an automatic photo tag expansion method designed for photo sharing websites. The purpose of the method is to suggest tags that are relevant to the visual content of a given photo at upload time. Both textual and visual cues are used in the process of tag expansion. When a photo is to be uploaded, the system asks for a couple of initial tags from the user. The initial tags are used to retrieve relevant photos together with their tags. These photos are assumed to be potentially content related to the uploaded target photo. The tag sets of the relevant photos are used to form the candidate tag list, and visual similarities between the target photo and relevant photos are used to give weights to these candidate tags. Tags with the highest weights are suggested to the user. The method is applied on Flickr (http://?www.?flickr.?com). Results show that including visual information in the process of photo tagging increases accuracy with respect to text-based methods.

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


PASTA: splice junction identification from RNA-Sequencing data Next generation transcriptome sequencing (RNA-Seq) is emerging as a powerful experimental tool for the study of alternative splicing and its regulation, but requires ad-hoc analysis methods and tools. PASTA (Patterned Alignments for Splicing and Transcriptome Analysis) is a splice junction detection algorithm specifically designed for RNA-Seq data, relying on a highly accurate alignment strategy and on a combination of heuristic and statistical methods to identify exon-intron junctions with high accuracy.

O 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

computational analysis of alternative splicing


ray tracing deformed surfaces A collection of new methods for ray tracing differentiable surfaces is developed. The methods are general, and extend the set of "ray-traceable" surfaces suitable for use in geometric modeling. We intersect a ray l = at + b , t > 0 with a parametric surface x = f (u, v) , and with implicit surfaces f(x,y,z) = 0. A smooth surface is treated as a deformation of a flat sheet; the intersection problem is converted to a new coordinate system in which the surfaces are flat, and the rays are bent. We develop methods for providing good initial estimates of the parametric intersection values, and a "closeness criterion," to reduce computation. These same criteria help us substitute a set of simpler surfaces for the more complex surface. The parametric method produces the intersection values of u, v , and t . These are suitable for shading calculations and for mapping textures onto the surface; they can also produce the local coordinate frame values, suitable for anisotropic lighting models.

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

help
intersection
method
use
values
ray tracing
implicit surfaces
computation
parametric
general
smooth
lighting
deformation
surface

coordination texture systems collect map complexity model locality


Probability density of the differential phase difference in applications to passive wireless surface acoustic wave sensing ? The probability density function (pdf) is discussed of the differential phase difference (DPD) in the radio frequency (RF) pulse-burst perturbed by Gaussian noise at the coherent receiver. Statistical properties of the DPD are of importance for error estimation in coherent systems such as remote passive wireless surface acoustic wave (SAW) sensing with multiple differential phase measurement. The rigorous probability density of the DPD is derived and its particular functions, all having no closed forms, are given for different signal-to-noise ratios (SNRs) in the RF pulses. Employing the von Mises/Tikhonov distribution, an efficient approximation is proposed via the modified Bessel functions of the first kind and zeroth order. Engineering features and small errors of the approximation are demonstrated. Applications are given for the phase difference drift rate and error probability for the drift rate to exceed a threshold.

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

differential phase difference
probability density
drift rate
error probability


Ultra-deep sequencing enables high-fidelity recovery of biodiversity for bulk arthropod samples without PCR amplification Next-generation-sequencing (NGS) technologies combined with a classic DNA barcoding approach have enabled fast and credible measurement for biodiversity of mixed environmental samples. However, the PCR amplification involved in nearly all existing NGS protocols inevitably introduces taxonomic biases. In the present study, we developed new Illumina pipelines without PCR amplifications to analyze terrestrial arthropod communities.

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

next-generation-sequencing
species richness
abundance
biomonitoring
insect biodiversity
mitochondria
pcr-independent
metabarcoding


PHAST: Hardware-accelerated shortest path trees ? We present a novel algorithm to solve the non-negative single-source shortest path problem on road networks and graphs with low highway dimension. After a quick preprocessing phase, we can compute all distances from a given source in the graph with essentially a linear sweep over all vertices. Because this sweep is independent of the source, we are able to reorder vertices in advance to exploit locality. Moreover, our algorithm takes advantage of features of modern CPU architectures, such as SSE and multiple cores. Compared to Dijkstras algorithm, our method needs fewer operations, has better locality, and is better able to exploit parallelism at multi-core and instruction levels. We gain additional speedup when implementing our algorithm on a GPU, where it is up to three orders of magnitude faster than Dijkstras algorithm on a high-end CPU. This makes applications based on all-pairs shortest-paths practical for continental-sized road networks. Several algorithms, such as computing the graph diameter, arc flags, or exact reaches, can be greatly accelerated by our method.

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

shortest paths
route planning
high performance computing


towards secure dataflow processing in open distributed systems Open distributed systems such as service oriented architecture and cloud computing have emerged as promising platforms to deliver software as a service to users. However, for many security sensitive applications such as critical data processing, trust management poses significant challenges for migrating those critical applications into open distributed systems. In this paper, we present the design and implementation of a new secure dataflow processing system that aims at providing trustworthy continuous data processing in multi-party open distributed systems. We identify a set of major security attacks that can compromise the integrity of dataflow processing and provide effective protection mechanisms to counter those attacks. We have implemented a prototype of the secure dataflow processing framework and tested it on the PlanetLab testbed. Our experimental results show that our protection schemes are effective and impose low performance impact for dataflow processing in large-scale open distributed systems.

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

service oriented architecture
cloud computing

secure data processing
secure component composition


a case study on interactive exploration and guidance aids for visualizing historical data In this paper, we address the problem of historical data visualization. We describe the data acquisition, preparation, and visualization. Since the data contain four dimensions, the standard 3D exploration techniques have to be extended or appropriately adapted in order to enable interactive exploration. We discuss in detail two interaction concepts: (1) navigation with one fixed dimension, and (2) quasi 4D navigation allowing to simultaneously explore the four-dimensional space. In addition, we also present a picture-in-picture display mode, enabling the user to interactively view the data, while "flying with" a particular event, tracking its motion in time and space. Finally, we present a technique for guided exploration and animation generation, allowing for a vivid gain of insight into the historical data.

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

data visualization
order
generation
event
interaction
paper
navigation
motion
user
exploration
visualization
historical data
space
data acquisition
data
3d
tracking
animation

concept
addressing
standardization
timing
case studies
time-dependent data
visualization techniques


Video-to-Shot Tag Propagation by Graph Sparse Group Lasso Traditional approaches to video tagging are designed to propagate tags at the same level, such as assigning the tags of training videos (or shots) to the test videos (or shots), such as generating tags for the test video when the training videos are associated with the tags at the video-level or assigning tags to the test shot when given a collection of annotated shots. This paper focuses on automatical shot tagging given a collection of videos with the tags at the video-level. In other words, we aim to assign specific tags from the training videos to the test shot. The paper solves the V2S issue by assigning the test shot with the tags deriving from parts of the tags in a part of training videos. To achieve the goal, the paper first proposes a novel Graph Sparse Group Lasso (shorted for GSGL) model to linearly reconstruct the visual feature of the test shot with the visual features of the training videos, i.e., finding the correlation between the test shot and the training videos. The paper then proposes a new tagging propagation rule to assign the video-level tags to the test shot by the learnt correlations. Moreover, to effectively build the reconstruction model, the proposed GSGL simultaneously takes several constraints into account, such as the inter-group sparsity, the intra-group sparsity, the temporal-spatial prior knowledge in the training videos and the local structure of the test shot. Extensive experiments on public video datasets are conducted, which clearly demonstrate the effectiveness of the proposed method for dealing with the video-to-shot tag propagation.

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

manifold learning
sparse coding
structure sparsity
video annotation


Computational and statistical study on the molecular interaction between antigen and antibody Simulations were performed to clarify the factors in antigenantibody interaction. Appearance rate of each kind of amino acid residue at CDR was counted. The residues strongly involved in the antigenantibody binding were suggested. The binding free energy and its energetic components were examined.

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

complex structure
binding energy
molecular dynamics simulation


The receptor-dependent LQTA-QSAR: application to a set of trypanothione reductase inhibitors A new Receptor-Dependent LQTA-QSAR approach, RD-LQTA-QSAR, is proposed as a new 4D-QSAR method. It is an evolution of receptor independent LQTA-QSAR. This approach uses the free GROMACS package to carry out molecular dynamics simulations and generates a conformational ensemble profile for each compound. Such an ensemble is used to build molecular interaction field-based QSAR models, as in CoMFA. To show the potential of this methodology, a set of 38 phenothiazine derivatives that are specific competitive T. cruzi trypanothione reductase inhibitors, was chosen. Using a combination of molecular docking and molecular dynamics simulations, the binding mode of the phenotiazine derivatives was evaluated in a simulated induced fit approach. The ligands alignments were performed using both ligand and binding site atoms, enabling unbiased alignment. The models obtained were extensively validated by leave-N-out cross-validation and y-randomization techniques to test for their robustness and absence of chance correlation. The final model presented Q (2) LOO of 0.87 and RA(2) of 0.92 and a suitable external prediction of = 0.78. The adapted binding site obtained is useful to perform virtual screening and ligand structure-based design and the descriptors in the final model can aid in the design new inhibitors.

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


adaptive configuration of wpans and wlans communications using multi-scale statistical process control Quality of communication in wireless systems is heavily dependent on several factors including interference on the radio signal and mobility of the communicating devices. However, it is very difficult to assess the transmitted signal and predict when a bad quality signal is being caused by interference or mobility. This work presents a new method for monitoring and analyzing wireless communications on two types of networks: IEEE 802.11 and Bluetooth. This technique uses a multi-scale control chart approach known as MCEWMA - Moving Centerline Exponential Weighted Moving Average - associated with multi-resolution analysis. The implementation of this control chart allows the description of the transmitted signal on each wireless channel with low cost and, more important, it can be used on on-line applications. To prove the efficiency of this method, a simple application was developed and tested and the results proved the efficiency of the proposed method.

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

wifi
adaptive middleware
statistical control process


A method for simulating Atomic Force Microscope nanolithography in the Level Set framework During the last decades it has been shown that the Atomic Force Microscope (AFM) can be used in non-contact mode as an efficient lithographic technique capable of manufacturing nanometer sized devices on the surface of a silicon wafer. The AFM nanooxidation approach is based on generating a potential difference between a cantilever needle tip and a silicon wafer. A water meniscus builds up between the tip and the wafer, resulting in a medium for oxyions to move due to the high electric field in the region. A simulator for nanooxidation with a non-contact AFM, implemented in a Level Set environment, was developed. The presented simulator implements the growth of thicker oxides by analyzing the potential, electric field, and ion concentrations at the ambient/oxide and oxide/silicon interfaces, while the growth of thin oxides assumes a single liquid/silicon interface, which is modeled as an infinitely long conducting plane. The nanodot shapes have been shown to follow the electric field and hence the surface charge distribution shape; therefore, a Monte Carlo particle distribution for the surface charge density is generated for two-dimensional and three-dimensional topography simulations in a Level Set framework.

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

level set
monte carlo
atomic force microscope

topography simulation
local anodic oxidation
oxide nanodots


the gardener's problem for web information monitoring We introduce and theoretically study the Gardener's problem that well models many web information monitoring scenarios, where numerous dynamically changing web sources are monitored and local information needs to be periodically updated under communication and computation capacity constraints. Typical such examples include maintenance of inverted indexes for search engines and maintenance of extracted structures for unstructured data management systems. We formulate a corresponding multicriteria optimization problem and propose heuristic solutions.

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

olap
multicriteria maintenance scheduling
np-hard
gardener's problem


An Eulerian method for computation of multimaterial impact with ENO shock-capturing and sharp interfaces A technique is presented for the numerical simulation of high-speed multimaterial impact. Of particular interest is the interaction of solid impactors with targets. The computations are performed on a fixed Cartesian mesh by casting the equations governing material deformation in Eulerian conservation law form. The advantage of the Eulerian setting is the disconnection of the mesh from the boundary deformation allowing for large distortions of the interfaces. Eigenvalue analysis reveals that the system of equations is hyperbolic for the range of materials and impact velocities of interest. High-order accurate ENO shock-capturing schemes are used along with interface tracking techniques to evolve sharp immersed boundaries. The numerical technique is designed to tackle the following physical phenomena encountered during impact: (1) high velocities of impact leading to large deformations of the impactor as well as targets; (2) nonlinear wave-propagation and the development of shocks in the materials; (3) modeling of the constitutive properties of materials under intense impact conditions and accurate numerical calculation of the elasto-plastic behavior described by the models; (4) phenomena at multiple interfaces (such as impactortarget, targetambient and impactorambient), i.e. both free surface and surfacesurface dynamics. Comparison with Lagrangian calculations is made for the elasto-plastic deformation of solid material. The accuracy of convex ENO scheme for shock capturing, with the MieGruneisen equation of state for pressure, is closely examined. Good agreement of the present finite difference fixed grid results is obtained with exact solutions in 1D and benchmarked moving finite element solutions for axisymmetric Taylor impact.

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

moving boundaries
multimaterial flows
high-strain rate


policy modeling in risk-driven environment In this paper, the main challenges of applying ICT in policy modeling are described and a solution is proposed, which emphasizes policy impact exploration, monitoring and risk management. State of the art of policy modeling is given, with the summary of those features of our solution, which goes beyond the available approaches. The paper will be structured as follows: First, the challenges of the ICT utilization for policy modeling are detailed. Next theoretical background of policy modeling is discussed, followed by research overview. The proposed solution -- policy modeling cycle and the corresponding system is presented in the following section. Finally, conclusion and future work are shown.

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

ict
policy modeling
policy impact
risk management


Decision support for Web service adaptation With the Internet of Services, Web services from all areas of life and business will be offered to service consumers. Even though Web service technologies make it easy to consume services on arbitrary devices due to their platform independence, service messaging is heavyweight. This may cause problems if services are invoked using devices with limited resources, e.g., smartphones. To overcome this issue, several adaptation mechanisms to decrease service messaging have been proposed. However, none of these are the best-performing under all possible system contexts. In this paper, we present a decision support system that aims at helping an operator to apply appropriate adaptation mechanisms based on the system context. We formulate the corresponding decision problem and present two scoring algorithmsone Quality of Service-based and one Quality of Experience-based. Missing data and, thus, an incomplete system context is a serious challenge for scoring algorithms. Regarding the problem at hand, missing data may lead to errors with respect to the recommended adaptation mechanisms. To address this challenge, we apply the statistical concept of imputation, i.e., substituting missing data. Based on the evaluation of different imputation algorithms used for one of our scoring algorithms, we show which imputation algorithms significantly decrease the error imposed by the missing data and decide whether imputation algorithms tailored to our scenario should be investigated.

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


Micromechanics-based progressive failure analysis of fibre-reinforced composites with non-iterative element-failure method This paper proposes a micromechanics-based progressive failure analysis strategy for fibre-reinforced composites. A non-iterative element-failure method (NEFM) is developed and integrated with a micromechanics-based failure criterion. The micromechanics of failure (MMF) is further investigated and modified to improve predictions. The NEFM is focused on implementation of damaged elements with direct solution and implicit nodal forces. Progressive failure of fibre-reinforced laminates is analysed with the micromechanics-based NEFM and the results are compared with those from the traditional finite element method or experiments. The comparison demonstrates computational efficiency and validity of the micromechanics-based NEFM in progressive failure analysis of composites.

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

micromechanics of failure (mmf) criterion

non-iterative element-failure method (nefm)


Optimal control of service rates and arrivals in Jackson networks We can represent each dynamic job shop system as a network of queues, in which each service station indicates a machine or a production department. Now, assume that we can control the service rates of these service stations and also the arrival rates to the service stations, in which the arrival rate to each service station corresponds to the total rates of demands for the products which are processed by this service station. In this paper, we develop a new model for optimal control of service rates of all service stations and also the arrival rates to these service stations in a class of Jackson networks, in which the expected value of shortest path of the network and also the total operating costs of all service stations of the network per period are minimized. The expected value of shortest path of such networks of queues is equal to the expected value of the completion time of the first product, which is an important factor in production systems. The networks of queues, which we analyze in this paper, have all specifications of Jackson networks, except they do not include M/M/C queueing systems.

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


A note on differentiable palindromes We give a characterization of the palindromes in a class of infinite words over Sigma = {1,2} related to the Kolakoski word K. This characterization, based on the left palindromic closure of all prefixes of K, is obtained by using a bijection between the class of right infinite words over Sigma and a class of words over the same alphabet, and reveals the first link between the existence of some palindromes and the recurrence of K. Indeed, the existence of arbitrarily long palindromes implies the recurrence of K, and a stronger assumption implies the closure of the set of its factors by permutation of the letters in Sigma. (C) 2002 Elsevier Science B.V. All rights reserved.

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

combinatorics on words
palindrome complexity


Postprandial performance of Dexcom SEVEN PLUS and Medtronic Paradigm Veo: Modeling and statistical analysis ? Minimizing excessive postprandial glucose excursion is still an unmet need in treating diabetes. This work addresses the analysis and modeling in the postprandial state of two commercial CGM devices. Twelve patients with type 1 diabetes were studied in the postprandial state on four different occasions under controlled conditions. Each time, we performed simultaneous glucose monitoring using the Dexcom SEVEN PLUS (47 datasets) and the Medtronic Paradigm Veo (42 datasets). The following statistical properties of the error signal were analyzed and modeled sequentially for the two devices: the lag time, the error stationarity, the error probability distribution and the time correlation. Finally, models were built for sensor simulation in silico studies. Lag time followed an exponential probability distribution for both monitors (?sevenplus=108, ?veo=1.69). Standard deviation and mean of the error signal, calculated as time-dependent signals across the population of sensors, were time-varying and correlated with the reference value and its rate of change, respectively. In both cases, a high variability of postprandial behaviors was observed. After non-stationarity compensation, a logistic distribution was obtained for the SEVEN PLUS error (close to normal distribution). Regarding the Paradigm Veo, a multimodal distribution was obtained, which turned into normal after elimination of five unstable sensors. Finally, a first order autoregressive model fitted the SEVEN PLUS error time-series while a third-order filter was necessary for the Paradigm Veo. The Paradigm Veo device exhibited greater delay variability with higher delay time and higher probability of abnormal sensor behaviors as compared to the SEVEN PLUS device. In both cases, the observed variability may have important clinical implications in postprandial performance. Therefore, further improvements are needed in calibration algorithms to reduce this variability.

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

continuous glucose monitoring
statistical modeling
error analysis
modeling errors
biomedical systems


Spin Kostka polynomials We introduce a spin analogue of Kostka polynomials and show that these polynomials enjoy favorable properties parallel to the Kostka polynomials. Further connections of spin Kostka polynomials with representation theory are established.

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

symmetric groups
schur q-functions
halllittlewood functions
q-weight multiplicity
heckeclifford algebra


A state of the art on ADC modelling The state of the art of the research on modelling of analog-to-digital converter (ADC)-based measuring devices is surveyed. Main topics of modelling are reviewed according to the fields of prevailing scientific interest in metrological research such as quantization models, error models, and correction-aimed models. In these fields, recent developments are analysed with the aim of focusing both the contemporary situation and the imminent trends.

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

adc
modelling
error models
quantization models


Efficient descriptor tree growing for fast action recognition Our method significantly reduces the time complexity of a popular classifier. Our method achieves state-of-the-art classification accuracy. We present an efficient algorithm to organize the training data used by our method. An important parameter of the data organization algorithm is analyzed.

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

nearest neighbor
instance-to-class distance


Glomerular microcircuits in the olfactory bulb Microcircuits in the olfactory bulb have long received particular attention from both experimentalists and theoreticians, due in part to an abundance of dendrodendritic interactions and other specialized modifications to the canonical cortical circuit architecture. Recent experimental and theoretical results have elucidated the mechanisms and function of these circuits and their presumed contributions to olfactory stimulus processing and odor perception. We here review the architecture and functionality of a prominent olfactory bulb microcircuit: the glomerular network.

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

olfaction
computational modeling
glomerulus
decorrelation
normalization


An Euler-Monte Carlo algorithm assessing Moment Lyapunov Exponents for stochastic bridge flutter predictions Wind-induced coupled flutter may lead to the collapse of cable-supported bridges. This study investigates several issues, associated with the assessment of bridge flutter. These include: influence of turbulence modeling, simulated by random perturbation to the span-wise correlation length of buffeting loads; effects of errors in the motion-induced or aeroelastic loads. The study makes use of random differential equations and numerically evaluates two-mode flutter by means of stochastic stability beyond mean squares through Moment Lyapunov Exponents. The development and implementation of a numerical algorithm are presented. Results, obtained for two simplified bridge examples, are discussed. (C) 2012 Elsevier Ltd. All rights reserved.

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

flutter
turbulence
stochastic stability
moment lyapunov exponents

long-span bridge aeroelasticity
uncertainty propagation


CORM: A reference model for future computer networks This paper acknowledges the need for revolutionary designs to devise the Future Internet by presenting a clean-slate Concern-Oriented Reference Model (CORM) for architecting future networks. CORM is derived in accordance to the FunctionBehaviorStructure engineering framework, conceiving computer networks as a distributed software-dependent complex system. CORM networks are designed along two main dimensions: a vertical dimension addressing structure and configuration of network building blocks; and a horizontal dimension addressing communication and interaction among the previously formulated building blocks. For each network dimension, CORM factors the design space into function, structure, and behavior, applying to each the principle of separation of concerns for further systematic decomposition. Perceiving the network as a complex system, CORM constructs the network recursively in a bottomup approach starting by the network building block, whose structure and behavior are inspired by an evolutionary bacterium cell. Hence, CORM is bio-inspired, it refutes the long-endorsed concept of layering, it accounts intrinsically for emergent behavior fostering network integrity and stability. We conjecture that networks designed according to CORM-based architectures can adapt and further evolve to better fit their contexts. To justify our conjecture, we derive and simulate a CORM-based architecture for ad hoc networks.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 adaptive systems
computer network architecture
computer network reference model
protocol design


agent programming via planning programs We imagine agent "planning" programs as programs built from achievement and maintenance goals. Their executions require the ability to meet such goals while respecting the programs' control flow. The question then is: can we always guarantee the execution of such programs? In this paper, we define this novel planning-programming problem formally, and propose a sound, complete and optimal wrt computational complexity technique to actually generate a solution by appealing to recent results in LTL-based synthesis of reactive systems.

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


Computational and experimental analyses on impact reduction when a humanoid robot lands on the ground The purpose of this study is to reduce the impact force when a humanoid robot lands on the ground or the floor. First, the landing postures of a human subject were analyzed while measuring the impact forces when the subject lands on the floor. Through the experimentally observed relations between the landing postures and the impact forces, it was hypothesized that a human being may reduce the impact force by motion control of his or her center of gravity, for example, to lengthen the time of the landing motion. Then, a landing robot was developed, and an experiment to measure the impact forces was conducted to prove the hypothesis.

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

humanoid robot
impact reduction
center of gravity


efficient editing of aged object textures Real objects present an enormous amount of detail, including aging effects. Artists need an intuitive control when they iteratively review and redesign their work to achieve a specific aging effect pattern but physically based and empirical simulations rarely provide an appropriate control. Our motivation comes from simplifying the redesign step by providing appropriate tools. In our system the user interactively identifies aging effects in a source image or photograph. The user then designs a target aging mask presenting the wanted aging effects pattern. Our system then synthesizes the output texture within a few seconds using a texture synthesis approach adapted to aged object texture editing. Thus, the user can quickly redesign the aging mask to achieve better results or test new configurations.

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

weathering
realistic rendering
deterioration
blemishes
texture synthesis


Searching for Zimin patterns In the area of pattern avoidability the central role is played by special words called Zimin patterns. The symbols of these patterns are treated as variables and the rank of the pattern is its number of variables. Zimin type of a word x is introduced here as the maximum rank of a Zimin pattern matching x. We show how to compute Zimin type of a word on-line in linear time. Consequently we get a quadratic time, linear-space algorithm for searching Zimin patterns in words. Then we demonstrate how the Zimin type of the length n prefix of the infinite Fibonacci word is related to the representation of n in the Fibonacci numeration system. Using this relation, we prove that Zimin types of such prefixes and Zimin patterns inside them can be found in logarithmic time. Finally, we give some upper bounds on the function f(n,k) f ( n , k ) such that every k -ary word of length at least f(n,k) f ( n , k ) has a factor that matches the rank n Zimin pattern.

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

zimin word
unavoidable pattern
on-line algorithm


Local and Global Information Exchange for Enhancing Object Detection and Tracking Object detection and tracking using visual sensors is a critical component of surveillance systems, which presents many challenges. This paper addresses the enhancement of object detection and tracking via the combination of multiple visual sensors. The enhancement method we introduce compensates for missed object detection based on the partial detection of objects by multiple visual sensors. When one detects an object or more visual sensors, the detected object's local positions transformed into a global object position. Local and global information exchange allows a missed local object's position to recover. However, the exchange of the information may degrade the detection and tracking performance by incorrectly recovering the local object position, which propagated by false object detection. Furthermore, local object positions corresponding to an identical object can transformed into nonequivalent global object positions because of detection uncertainty such as shadows or other artifacts. We improved the performance by preventing the propagation of false object detection. In addition, we present an evaluation method for the final global object position. The proposed method analyzed and evaluated using case studies.

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

visual sensor
localization
distributed detection system
sensor network
data combination


DtiStudio: Resource program for diffusion tensor computation and fiber bundle tracking A versatile resource program was developed for diffusion tensor image (DTI) computation and fiber tracking. The software can read data formats from a variety of MR scanners. Tensor calculation is performed by solving an over-determined linear equation system using least square fitting. Various types of map data, such as tensor elements, eigenvalues, eigenvectors, diffusion anisotropy, diffusion constants, and color-coded orientations can be calculated. The results are visualized interactively in orthogonal views and in three-dimensional mode. Three-dimensional tract reconstruction is based on the Fiber Assignment by Continuous Tracking (FACT) algorithm and a brute-force reconstruction approach. To improve the time and memory efficiency, a rapid algorithm to perform the FACT is adopted. An index matrix for the fiber data is introduced to facilitate various types of fiber bundles selection based on approaches employing multiple regions of interest (ROIs). The program is developed using C++ and OpenGL on a Windows platform.

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

diffusion tensor imaging
fiber tractography
magnetic resonance imaging (mri)
medical image visualization


Impact of gate insulator on the dc and dynamic performance of AlGaN/GaN MIS-HEMTs The impact of SiN gate insulator on the performance of AlGaN/GaN MIS-HEMTs is studied. Lower gate leakage and trapping effects are measured in PEALD SiN devices. Measurable threshold voltage shift is measured when positive gate bias is applied. Threshold voltage dynamic shift is well correlated with gate leakage current. Trapping effects studied are mainly due to electrons injected in the gate insulator.

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


An ontology-based approach for the reconstruction and analysis of digital incidents timelines Due to the democratisation of new technologies, computer forensics investigators have to deal with volumes of data which are becoming increasingly large and heterogeneous. Indeed, in a single machine, hundred of events occur per minute, produced and logged by the operating system and various software. Therefore, the identification of evidence, and more generally, the reconstruction of past events is a tedious and time-consuming task for the investigators. Our work aims at reconstructing and analysing automatically the events related to a digital incident, while respecting legal requirements. To tackle those three main problems (volume, heterogeneity and legal requirements), we identify seven necessary criteria that an efficient reconstruction tool must meet to address these challenges. This paper introduces an approach based on a three-layered ontology, called ORD2I, to represent any digital events. ORD2I is associated with a set of operators to analyse the resulting timeline and to ensure the reproducibility of the investigation.

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

digital forensics
event reconstruction
forensic ontology
knowledge extraction
ontology population
timeline analysis


Exploring the relationship of a files history and its fault-proneness: An empirical method and its application to open source programs The knowledge about particular characteristics of software that are indicators for defects is very valuable for testers because it helps them to focus the testing effort and to allocate their limited resources appropriately. In this paper, we explore the relationship between several historical characteristics of files and their defect count. For this purpose, we propose an empirical approach that uses statistical procedures and visual representations of the data in order to determine indicators for a files defect count. We apply this approach to nine open source Java projects across different versions. Only 4 of 9 programs show moderate correlations between a files defects in previous and in current releases in more than half of the analysed releases. In contrast to our expectations, the oldest files represent the most fault-prone files. Additionally, late changes correlate with a files defect count only partly. The number of changes, the number of distinct authors performing changes to a file as well as the files age are good indicators for a files defect count in all projects. Our results show that a softwares history is a good indicator for ist quality. We did not find one indicator that persists across all projects in an equal manner. Nevertheless, there are several indicators that show significant strong correlations in nearly all projects: DA (number of distinct authors) and FC (frequency of change). In practice, for each software, statistical analyses have to be performed in order to evaluate the best indicator(s) for a files defect count.

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

empirical study
software testing
software history/evolution


Motion constraint In this paper, we propose a hybrid postural control approach taking advantage of data-driven and goal-oriented methods while overcoming their limitations. In particular, we take advantage of the latent space characterizing a given motion database. We introduce a motion constraint operating in the latent space to benefit from its much smaller dimension compared to the joint space. This allows its transparent integration into a Prioritized Inverse Kinematics framework. If its priority is high the constraint may restrict the solution to lie within the motion database space. We are more interested in the alternate case of an intermediate priority level that channels the postural control through a spatiotemporal pattern representative of the motion database while achieving a broader range of goals. We illustrate this concept with a sparse database of large range full-body reach motions.

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


CPO semantics of timed interactive actor networks We give a denotational framework for composing interactive components into closed or open systems and show how to adapt classical domain-theoretic approaches to open systems and to timed systems. For timed systems, prior approaches are based on temporal logics, automata theory, or metric spaces. In this paper, we base the semantics on a CPO with a prefix order, as has been done previously for untimed systems. We show that existence and uniqueness of behaviors are ensured by continuity with respect to this prefix order. Existence and uniqueness of behaviors, however, do not imply that a composition of components yields a useful behavior. The unique behavior could be empty or smaller than expected. We define liveness and show that appropriately defined causality conditions ensure liveness and freedom from Zeno conditions. In our formulation, causality does not require a metric and can embrace a wide variety of models of time. (C) 2008 Elsevier B.V. All rights reserved.

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

cpos
posets
interaction
actors
agents
process networks
discrete events
dataflow


Analytical solution and entanglement swapping of a double JaynesCummings model in non-Markovian environments Analytical solution and entanglement swapping of a double JaynesCummings model in non-Markovian environments are investigated by the time convolution less master equation method. We obtain the analytical solution of this model and discuss in detail the influence of atomcavity coupling, non-Markovian effect and initial state purity on entanglement dynamics. The results show that in the non-Markovian environments, the entanglement between two cavities can be swapped to other bipartite subsystems by interaction between an atom and its own cavity. Due to the dissipation of environment, the entanglements of all bipartite subsystems will eventually decay to zero when the atom couples weakly to its cavity and the non-Markovian effect is also weak. All bipartite subsystems can tend to steady entanglement states if and only if there is the strong atomcavity coupling or the strong non-Markovian effect. The steady state of the subsystem composed of an atom and its own cavity is independent on the purity, but the steady states of other bipartite subsystems are dependent on the purity.

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

analytical solution
entanglement swapping
double jaynescummings model


New bin packing fast lower bounds In this paper, we address the issue of computing fast lower bounds for the Bin Packing problem, i.e., bounds that have a computational complexity dominated by the complexity of ordering the items by non-increasing values of their volume. We introduce new classes of fast lower bounds with improved asymptotic worst-case performance compared to well-known results for similar computational effort. Experimental results on a large set of problem instances indicate that the proposed bounds reduce both the deviation from the optimum and the computational effort.

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


A Type-2 Fuzzy Ontology and Its Application to Personal Diabetic-Diet Recommendation It has been widely pointed out that classical ontology is not sufficient to deal with imprecise and vague knowledge for some real-world applications like personal diabetic-diet recommendation. On the other hand, fuzzy ontology can effectively help to handle and process uncertain data and knowledge. This paper proposes a novel ontology model, which is based on interval type-2 fuzzy sets (T2FSs), called type-2 fuzzy ontology (T2FO), with applications to knowledge representation in the field of personal diabetic-diet recommendation. The T2FO is composed of 1) a type-2 fuzzy personal profile ontology (type-2 FPPO); 2) a type-2 fuzzy food ontology (type-2 FFO); and 3) a type-2 fuzzy-personal food ontology (type-2 FPFO). In addition, the paper also presents a T2FS-based intelligent diet-recommendation agent (IDRA), including 1) T2FS construction; 2) a T2FS-based personal ontology filter; 3) a T2FS-based fuzzy inference mechanism; 4) a T2FS-based diet-planning mechanism; 5) a T2FS-based menu-recommendation mechanism; and 6) a T2FS-based semantic-description mechanism. In the proposed approach, first, the domain experts plan the diet goal for the involved diabetes and create the nutrition facts of common Taiwanese food. Second, the involved diabetics are requested to routinely input eaten items. Third, the ontology-creating mechanism constructs a T2FO, including a type-2 FPPO, a type-2 FFO, and a set of type-2 FPFOs. Finally, the T2FS-based IDRA retrieves the built T2FO to recommend a personal diabetic meal plan. The experimental results show that the proposed approach can work effectively and that the menu can be provided as a reference for the involved diabetes after diet validation by domain experts.

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

diet recommendation
intelligent agents
interval type-2 fuzzy sets (it2fss)
type-2 fuzzy ontology (t2fo)


An advanced queueing model to analyze appointment-driven service systems Many service systems are appointment-driven. In such systems, customers make an appointment and join an external queue (also referred to as the waiting list). At the appointed date, the customer arrives at the service facility and receives service. Important measures of interest include the size of the waiting list as well as the time spent in the waiting list. We develop a model to assess these performance measures. The model may be used to support strategic decisions concerning server capacity (e.g. how often should a server be online, how many customers should be served during each service session, etc.). The model is a vacation model that uses efficient algorithms and matrix analytical techniques to obtain waiting list performance measures.

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

appointment system
queueing system
algorithm


technique for eliminating irrelevant terms in term rewriting for annotated media retrieval In this paper, we present an efficient term rewriting technique that computes a degree of term to domain relevance. The proposed method resolves the problems in ontology integrated concept search. Those problems are (i) Pre-defined concept classes in ontology are not relevant to users (no proper concept class for a target annotation has not found). (ii) Too many similar concept classes are provided to a user therefore, a user may fail to choose a correct semantic class for a target annotation (ordinary users are not an expert in concept classification). The method uses sense disambiguation task for finding relevant terms for a given domain. Sense disambiguation requires term-to-term similarity measurement and term frequency measurement. For fair modeling of not observed term frequencies, discounting and redistribution model is applied. The proposed method is a compliment to our previous work presented in [13][14]. Robustness of our method is demonstrated through human judgment test that shows our method allows prediction of precise term list (overall 75\% of correct prediction) that are relevant to a given domain.

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

precise
measurement
media
task
human
concept
relevance
paper
model
user
search
classification
method
term rewriting
users
semantic
test
annotation
retrieval
class

efficiency
robust
predict
ontologies
similarity measure
integrability


A mobility constraint model to infer sensor behaviour in forest fire risk monitoring Wireless sensor networks (WSNs) play an important role in forest fire risk monitoring. Various applications are in operation. However, the use of mobile sensors in forest risk monitoring remains largely unexplored. Our research contributes to fill this gap by designing a model which abstracts mobility constraints within different types of contexts for the inference of mobile sensor behaviour. This behaviour is focused on achieving a suitable spatial coverage of the WSN when monitoring forest fire risk. The proposed mobility constraint model makes use of a Bayesian network approach and consists of three components: (1) a context typology describing different contexts in which a WSN monitors a dynamic phenomenon; (2) a context graph encoding probabilistic dependencies among variables of interest; and (3) contextual rules encoding expert knowledge and application requirements needed for the inference of sensor behaviour. As an illustration, the model is used to simulate the behaviour of a mobile WSN to obtain a suitable spatial coverage in low and high fire risk scenarios. It is shown that the implemented Bayesian network within the mobility constraint model can successfully infer behaviour such as sleeping sensors, moving sensors, or deploying more sensors to enhance spatial coverage. Furthermore, the mobility constraint model contributes towards mobile sensing in which the mobile sensor behaviour is driven by constraints on the state of the phenomenon and the sensing system.

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

forest fire risk monitoring
mobility constraints
sensor behaviour
spatial coverage

mobile wireless sensor network
bayesian networks


VLSI architecture for real-time fractal image coding processors This paper proposes an efficient architecture for fractal image coding processors. The proposed architecture achieves high-speed image coding comparable to conventional JPEG processing. This architecture achieves less than 33.3 msec fractal image compression coding against a 512 x 512 pixel image and enables full-motion fractal image coding. The circuit size of the proposed architecture design is comparable to those of JPEG processors and much smaller than those of previously proposed fractal processors.

B I O O O B I O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O 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 heuristics in feature selection for high dimensional data Massive data sets have become common in many applications making the task of finding an optimum subset of attributes extremely difficult. Traditional feature selection techniques can be very inefficient in high dimensional data, especially when the subset evaluation is obtained through a learning algorithm. We describe a method based on the statistical significance of adding a feature from a ranked-list to the final subset. To measure individual feature, we propose a new simple and fast criterion based on the projections of data set elements onto each attribute.

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

machine learning
preprocessing
feature ranking


Clusterfile: a flexible physical layout parallel file system This paper presents Clusterfile, a parallel file system that provides parallel file access on a cluster of computers. We introduce a file partitioning model that has been used in the design of Clusterfile. The model uses a data representation that is optimized for multidimensional array partitioning while allowing arbitrary partitions. The paper shows how the file model can be employed for file partitioning into both physical subfiles and logical views. We also present how the conversion between two partitions of the same file is implemented using a general memory redistribution algorithm. We show how we use the algorithm to optimize non-contiguous read and write operations. The experimental results include performance comparisons with the Parallel Virtual File System (PVFS) and an MPI-IO implementation for PVFS. Copyright (C) 2003 John Wiley Sons, Ltd.

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

parallel i/o
physical and logical partitioning
non-contiguous i/o
data redistribution
mapping functions


latency effects on reachability in large-scale peer-to-peer networks In this paper we study the latency effects introduced in large scale internet applications. In particular, we study the effects of heterogeneous latency on reachability in decentralized, distributed networks operating under flooding protocols. We show that the standard protocol mechanisms of time-to-live (TTL) and unique message identification (UID), used to govern flooding message transmissions, can combine to potentially devastating effect on the reachability of message broadcast. We call this combined effect short-circuiting , and we investigate consequences of this phenomenon. We show that in the worstcase, short-circuiting resulting from heterogeneous latencies can near-completely eliminate the reach of broadcast messages, even with an ability to place k ⪈ 1 broadcast servers optimally. This dramatic negative effect on reachability shows that application protocol designs need to be sensitive to latency models. In addition, we show that short-circuiting can have a negative effect on well known approximation algorithms for maximizing reachability. We show that with respect to distance measures that account for short-circuiting, the standard k -center problem can not be approximated within n 1-e , unless P = NP . Our theoretical results suggest that it may be quite difficult to find near optimal solutions to certain internet server selection problems. We consider the significance of our results on a large-scale peer-to-peer searching application, that relies on related flooding protocols. We report measurements through experimental studies with both simulated networks and a large network application known as Gnutella. Our empirical results, using statistics obtained from both the simulations and real applications, support the conclusion that, on average, the real effects of short-circuiting are significant, but not devastating to the performance of an overall large-scale system.

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

network
sensitive
statistics
applications
approximation algorithms
performance
account
paper
distance
place
latency
message
broadcast
identification
support
internet
distributed
effect
server
reachability

measurement simulation peer-to-peer large-scale design standardization timing model heterogeneity select flood live systems experimentation optimality operability decentralization


INDIRECT QUANTUM CONTROL FOR FINITE-DIMENSIONAL COUPLED SYSTEMS We present a new analysis on the quantum control for a quantum system coupled to a quantum probe. This analysis is based on the coherent control for the quantum system and a hypothesis that the probe can be prepared in specified initial states. The results show that a quantum system can be manipulated by probe state-dependent coherent control. In this sense, the present analysis provides a new control scheme which combines the coherent control and state preparation technology.

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


Quantifying Success Factors for IT Projects-An Expert-Based Bayesian Model Large investments are made annually to develop and maintain IT systems. Successful outcome of IT projects is therefore crucial for the economy. Yet, many IT projects fail completely or are delayed or over budget, or they end up with less functionality than planned. This article describes a Bayesian decision-support model. The model is based on expert elicited data from 51 experts. Using this model, the effect management decisions have upon projects can be estimated beforehand, thus providing decision support for the improvement of IT project performance.

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

it project success factors
bayesian networks
noisy-or
expert elicitation


progressive transmission of scientific data using biorthogonal wavelet transform An important issue in scientific visualization systems is the management of data sets. Most data sets in scientific visualization, whether created by measurement or simulation, are usually voluminous. The goal of data management is to reduce the storage space and the access time of these data sets to speed up the visualization process. A new progressive transmission scheme using spline biorthogonal wavelet bases is proposed in this paper. By exploiting the properties of this set of wavelet bases, a fast algorithm involving only additions and subtractions is developed. Due to the multiresolutional nature of the wavelet transform, this scheme is compatible with hierarchical-structured rendering algorithms. The formula for reconstructing the functional values in a continuous volume space is given in a simple polynomial form. Lossless compression is possible, even when using floating-point numbers. This algorithm has been applied to data from a global ocean model. The lossless compression ratio is about 1.5:1. With a compression ratio of 50:1, the reconstructed data is still of good quality. Several other wavelet bases are compared with the spline biorthogonal wavelet bases. Finally, the reconstructed data is visualized using various algorithms and the results are demonstrated.

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

measurement
quality
simulation
polynomial
model
access
data management
paper
management
visualization
systems
values
space
rendering
wavelet
storage
functional
data
process
algorithm
compression
global
scheme

floating point
timing
hierarchic
structure
wavelet transform
scientific visualiztion
continuation


bci control protocol pseudocode Brain computer interface (BCI) is a device which allows the people to communicate without using their mouths or hands. The information about the subject's intention is issued by his brain and exists in his electroencephalogram (EEG), recorded from the scalp. In this paper a pseudo code of a protocol for BCIs control of three environment functions is described. The protocol is based on the phenomenal pattern of the mental task "Hyperventilation".

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


An effective quasi-human based heuristic for solving the rectangle packing problem In this paper, we introduce an effective deterministic heuristic, Less Flexibility First, for solving the classical NP-complete rectangle packing problem. Many effective heuristics implemented for this problem are CPU-intensive and non-deterministic in nature. Others, including the polynomial approximation methodology [J. Assoc. Comput. Mach. 32 (1) (1985) 130] are too laborious for practical problem sizes. The technique we propose is inspired and developed by enhancing some rule-of-thumb guidelines resulting from the generation-long work experience of human professionals in ancient days. Although the Less Flexibility First heuristic is a deterministic algorithm, the results are very encouraging. This algorithm can consistently produce packing densities of around 99% on most randomly generated large examples. As compared with the recent results of a well known simulated annealing based Rectangle Packing (RP) algorithm [IEEE Trans. Computer-aided Design Integrated Circuits Systems 17 (1) (1998) 60], the results are much better both in less dead space2 (4% vs 6.7%) and much less CPU time (9.57 vs 331.78 seconds). Experimenting our heuristics on a public rectangle packing data set covering instances of 1697 rectangles, the average unpack ratio is quite satisfactory (0.92% for bounding boxes limited to be optimum and 2.68% for the completed packing), while most cases spend only a few minutes in CPU time.

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

two-dimensional packing and cutting
vlsi floor planning


Hierarchical clustering of XML documents focused on structural components Clustering XML documents by structure is the task of grouping them by common structural components. Hitherto, this has been accomplished by looking at the occurrence of one preestablished type of structural components in the structures of the XML documents. However, the a-priori chosen structural components may not be the most appropriate for effective clustering. Moreover, it is likely that the resulting clusters exhibit a certain extent of inner structural inhomogeneity, because of uncaught differences in the structures of the XML documents, due to further neglected forms of structural components. To overcome these limitations, a new hierarchical approach is proposed, that allows to consider (if necessary) multiple forms of structural components to isolate structurally-homogeneous clusters of XML documents. At each level of the resulting hierarchy, clusters are divided by considering some type of structural components (unaddressed at the preceding levels), that still differentiate the structures of the XML documents. Each cluster in the hierarchy is summarized through a novel technique, that provides a clear and differentiated understanding of its structural properties. A comparative evaluation over both real and synthetic XML data proves that the devised approach outperforms established competitors in effectiveness and scalability. Cluster summarization is also shown to be very representative.

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

xml cluster summarization and representative