Dynamic subgrid modelling for time dependent convection-diffusion-reaction equations with fractal solutions A dynamic scale similarity model is proposed. The subgrid model is tested for model problems related to time dependent non-linear convection-diffusion-reaction systems with fractal solutions. The error of an approximate solution with subgrid model on a scale h is typically smaller than that of a solution without subgrid model on the scale h/2. We also consider the problem of a posteriori error estimation for fractal solutions, splitting the total computational error into a numerical error, related to the discretization of the continuous equations, and a modelling error, taking into account the quality of the subgrid model. Copyright (C) 2002 John Wiley Sons, Ltd.

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

dynamic subgrid modelling
a posteriori error estimation


Robust Network Coding in the Presence of Untrusted Nodes While network coding can be an efficient means of information dissemination in networks, it is highly susceptible to "pollution attacks," as the injection of even a single erroneous packet has the potential to corrupt each and every packet received by a given destination. Even when suitable error-control coding is applied, an adversary can, in many interesting practical situations, overwhelm the error-correcting capability of the code. To limit the power of potential adversaries, a broadcast transformation is introduced, in which nodes are limited to just a single (broadcast) transmission per generation. Under this broadcast transformation, the multicast capacity of a network is changed (in general reduced) from the number of edge-disjoint paths between source and sink to the number of internally disjoint paths. Exploiting this fact, a family of networks is proposed whose capacity is largely unaffected by a broadcast transformation. This results in a significant achievable transmission rate for such networks, even in the presence of adversaries.

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

broadcast transformation
multicast capacity
network coding

adversarial nodes
error correction
jlc networks


Dynamic replica control based on fairly assigned variation of data for loosely coupled distributed database systems This paper proposes a decentralized and asynchronous replica control method based on a fair assignment of the variation in numerical data that has weak consistency for loosely coupled database systems managed or used by different organizations of human activity. Our method eliminates the asynchronous abort of already committed transactions even if replicas in all network partitions continue to process transactions when network partitioning occurs. A decentralized and asynchronous approach is needed because it is difficult to keep a number of loosely coupled systems in working order, and replica operations performed in a centralized and synchronous way can degrade the performance of transaction processing. We eliminate the transaction abort by fairly distributing the variation in numerical data to replicas according to their demands and updating the distributed variation using only asynchronously propagated update transactions without calculating the precise global state among reachable replicas. In addition, fairly assigning the variation of data to replicas equalizes the disadvantages of processing update transactions among replicas. Fairness control for assigning the data variation is performed by averaging the variation requested by the replicas. A simulation showed that our system can achieve extremely high performance for processing update transactions and fairness among replicas.

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

weak consistency
numerical data
fairness


Real-time implementation of morphological filters with polygonal structuring elements In mathematical morphology, circular structuring elements (SE) are used whenever one needs angular isotropy. The circlesdifficult to implement efficientlyare often approximated by convex, symmetric polygons that decompose under the Minkowski addition to 1-D inclined segments. In this paper, we show how to perform this decomposition efficiently, in stream with almost optimal latency to compute gray-scale erosion and dilation by flat regular polygons. We further increase its performance by introducing a spatial parallelism while maintaining sequential access to data. We implement these principles in a dedicated hardware block. Several of these blocks can be concatenated to efficiently compute sequential filters, or granulometries in one scan. With a configurable image size and programmable SE size, this architecture is usable in high-end, real-time industrial applications. We show on an example that it conforms to real-time requirements of the 100Hz 1080p FullHD TV standard, even for serial morphological filters using large hexagons or octagons.

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

hardware implementation
alternating sequential filter
parallel computation
polygonal structuring element


A medium access protocol exploiting multiuser-detection in CDMA ad-hoc networks A new medium access protocol which exploits the physical layer capability of multiuser detection is proposed to help in improving the throughput/delay performance of ad-hoc networks. When more than one node has packets buffered for a common node in the neighborhood, all such nodes can simultaneously transmit their packets to the common receiver after reserving their surrounding channel. This is achieved in our protocol by extending the (sender-initiated) CSMA/CA collision avoidance framework by the receiver-initiated medium access technique and incorporating the transmission power control. We analyze the improvement in the throughput that can be achieved over the basic sender-initiated collision avoidance protocol in the network. Since the throughput improvement via multi-packet reception is influenced by the network layer activity as well, the performance of our protocol rolls back to that of the basic sender-initiated protocol in case of no coordination from the network layer. For the evaluation of performance of our protocol we simulate ad-hoc networks for different network topologies and traffic configurations. We observe the scheme to be capable in significantly improving the throughput/delay performance of the network.

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

multiuser detection
medium access protocol

wireless ad-hoc networks
performance analysis


Inference From Lumen Degradation Data Under Wiener Diffusion Process The lumen degradation of light emitting diodes subject to increasing stress loading is investigated by using a cumulative damage model. The cumulative damage process is taken as a Wiener diffusion process with a drift which depends on two stress loadings. General statistical inferences on the parameters and percentiles of the light emitting diode lifetime distribution are presented based on the cumulative damage measurements, collected from a two-variable constant-stress loading accelerated degradation test. Approximate lower s-confidence bounds of the light emitting diode lighting lifetime percentiles are given using the Fisher information of the maximum-likelihood estimators, and Bonferroni's inequality. The application of the proposed method is illustrated by a lumen cumulative damage data set of high power light emitting diodes.

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

arrhenius law model
draft parameter
exponential law model
power law model
step-stress loading method


order preserving minimal perfect hash functions and information retrieval Rapid access to information is essential for a wide variety of retrieval systems and applications. Hashing has long been used when the fastest possible direct search is desired, but is generally not appropriate when sequential or range searches are also required. This paper describes a hashing method, developed for collections that are relatively static, that supports both direct and sequential access. Indeed, the algorithm described gives hash functions that are optimal in terms of time and hash table space utilization, and that preserve any a priori ordering desired. Furthermore, the resulting order preserving minimal perfect hash functions (OPMPHFs) can be found using space and time that is on average linear in the number of keys involved.

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

order
applications
method
hashing
systems
space
retrieval
direct
hash table
algorithm
paper
hash functions
access
minimal
search

optimality
collect
timing
informal
information retrieval


Discrete-time analysis of throughput and response time for LAP derivative protocols under Markovian block-error pattern We study how well the channel memory can be used in the evaluation of widely used error control schemes. For this we assume a special error pattern named as the simplest Markovian block-error pattern, in which each block is classified into two classes of whether the block transmission is in error or not. We apply the derived pattern to the performance evaluation of the practical link-level procedures, LAPB/D/M with multi-reject options, and investigate both throughput and user-perceived response time behaviors on the discrete-time domain to determine how much the performance of error recovery action is improved under burst error condition. Through numerical examples, we show that the simplest Markovian block-error pattern tends to be superior in throughput and delay characteristics to the random error case. Also, instead of mean alone, we use a new measure of the response time specified as mean plus two standard deviations so as to consider user-perceived worst cases, and show that it results in much greater sensitivity to parameter variations than does mean alone. (C) 1999 Elsevier Science B.V. All rights reserved.

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

markovian error pattern
link access procedure (lap)


A robust watermarking scheme using phase shift keying with the combination of amplitude boost and low amplitude block selection Watermarking is a potential method for copyright protection and authentication of multimedia data in the internet. The watermarking process can be viewed as a communication task, where the watermark acting like information is embedded into a host image acting like noise in a communication channel which is susceptible to all kinds of attacks acting like jamming. In a previous paper, we proposed a robust watermarking scheme using frequency shift keying (FSK). In the scheme, high-variance block selection (HVBS) is employed to enhance robustness. In this paper, a novel watermarking scheme using phase shift keying (PSK) modulation with amplitude boost (AB) and low amplitude block selection (LABS) is proposed. AB is hired to increase the robustness while LABS is employed to improve the imperceptibility. With proper combination of AB and LABS, the proposed scheme achieves superior performance in terms of robustness and imperceptibility. In order to demonstrate the effectiveness of the proposed scheme, simulations under various conditions were conducted. The empirical results showed that QPSK is the best choice among other PSKs and the proposed scheme can sustain most common attacks including JPEG compression, rotating, resizing, cropping, painting, noising and blurring etc. The empirical results also showed that the scheme with AB and LABS properly combined outperforms the scheme without. The gain of the former over the latter is more significant for host images with smooth characteristics than those with high-frequency characteristics. Simulation comparison with two other schemes (the Hsu's scheme and the Chen's scheme) showed that the proposed scheme is the most robust among the three.

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

spread spectrum (ss)
phase shift keying (psk)
discrete fourier transform (dft)
pseudo-random number sequence (pn)
joint photographic experts group (jpeg)


A portfolio optimization model with three objectives and discrete variables We formulate the portfolio selection as a tri-objective optimization problem so as to find tradeoffs between risk, return and the number of securities in the portfolio. Furthermore, quantity and class constraints are introduced into the model in order to limit the proportion of the portfolio invested in assets with common characteristics and to avoid very small holdings. Since the proposed portfolio selection model involves mixed integer decision variables and multiple objectives finding the exact efficient frontier may be very hard. Nevertheless, finding a good approximation of the efficient surface which provides the investor with a diverse set of portfolios capturing all possible tradeoffs between the objectives within limited computational time is usually acceptable. We experiment with the current state of the art evolutionary multiobjective optimization techniques, namely the Non-dominated Sorting Genetic Algorithm II (NSGA-II), Pareto Envelope-based Selection Algorithm (PESA) and Strength Pareto Evolutionary Algorithm 2 (SPEA2), for solving the mixed-integer multiobjective optimization problem and provide a performance comparison among them using metrics proposed by the community.

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

multiobjective portfolio selection
nsga-ii
quantity constraints


A qualitative mathematical analysis of a class of linear variational inequalities via semi-complementarity problems: applications in electronics The main object of this paper is to present a general mathematical theory applicable to the study of a large class of linear variational inequalities arising in electronics. Our approach uses recession tools so as to define a new class of problems that we call "semi-complementarity problems". Then we show that the study of semi-complementarity problems can be used to prove new qualitative results applicable to the study of linear variational inequalities of the second kind.

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

set-valued ampere-volt characteristics in electronics


software verification for tinyos We describe the first software tool for the verification of TinyOS 2, MSP430 applications at compile-time . Given assertions upon the state of the sensor node, the tool boundedly explores all program executions and returns to the programmer an error trace leading to any assertion violation. Besides memory-related errors (out-of-bounds arrays, nullpointer dereferences), we verify application-specific assertions, including low-level assertions upon the state of the registers and peripherals.

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

sensor networks
safety
telos
reliability
model checking


Neurogenic contributions made by dietary regulation to hippocampal neurogenesis Adult neural stem cells in the dentate gyrus of the hippocampus are negatively and positively regulated by a broad range of environmental stimuli that include aging, stress, social interaction, physical activity, and dietary modulation. Interestingly, dietary regulation has a distinct outcome, such that reduced dietary intake enhances neurogenesis, whereas excess calorie intake by a high-fat diet has a negative effect. As a type of metabolic stress, dietary restriction (DR) is also known to extend life span and increase resistance to age-related neurodegenerative diseases. However, the potential application of DR as a neurogenic enhancer in humans remains problematic because of the severity of restriction and the protracted duration of the treatment required. Therefore, the authors consider that an understanding of the neurogenic mechanisms of DR would provide a basis for the identification of the pharmacological and nutraceutical interventions that mimic the beneficial effects of DR without limiting caloric intake. The current review describes the regulatory effect of DR on hippocampal neurogenesis and presents a possible neurogenic mechanism.

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

dietary restriction
hippocampal neurogenesis


Complex regulation of Hsf1-Skn7 activities by the catalytic subunits of PKA in Saccharomyces cerevisiae: experimental and computational evidences The cAMP-dependent protein kinase regulatory network (PKA-RN) regulates metabolism, memory, learning, development, and response to stress. Previous models of this network considered the catalytic subunits (CS) as a single entity, overlooking their functional individualities. Furthermore, PKA-RN dynamics are often measured through cAMP levels in nutrient-depleted cells shortly after being fed with glucose, dismissing downstream physiological processes.

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

yeast
signal transduction
hsf1 function
skn7 function
windowed discrete model


A checkpointingrecovery scheme for Time Warp parallel simulation This paper presents a checkpointingrecovery scheme for Time Warp parallel simulation. The scheme relies on a checkpointing protocol, namely mixed state saving, embedding both sparse and incremental state saving modes, and on a state recovery procedure embedding both forward and backward recovery modes. This scheme is a generalization of many previous solutions, which can be obtained as particular instances of it by selecting appropriate values for the checkpointing protocol parameters. We also present two regulating algorithms to adaptively tune the checkpointing protocol parameters, in order to make the protocol reacting to variable rollback behavior. A synthetic benchmark in several different configurations has been used for evaluating and comparing our scheme with previous solutions. The obtained data show that our solution allows faster execution and, in addition, keeps quite low the amount of memory used for recording state information; this allows the scheme to not adversely affect performance when memory is a critical resource.

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

optimistic synchronization
rollback-recovery
performance optimization
parallel discrete event simulation


Estimation of periodic-like motions of chaotic evolutions using detected unstable periodic patterns We introduce an approach to detect cyclical patterns embedded within chaotic data and make use of the detected patterns to estimate periodic-like motions in a chaotic process. A chaotic attractor contains many unstable periodic orbits (UPOs). The UPOs are hidden cyclical patterns that dominate the dynamical evolution of the system. Knowledge of UPOs can be used for estimating the trends of chaotic evolutions. A numerical experiment is conducted to illustrate an application on the business cycle detection.

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


Multimodal fusion of biomedical data at different temporal and dimensional scales The introduction of integrative approaches to biomedical research (integrative biology, physiome, Virtual Physiological Human, etc.) poses original problems to computer aided medicine: the need to operate with large amounts of data that are strongly heterogeneous in structure, format and even in the knowledge domain that generated them; the need to integrate all of these data into a coherent whole; the further complication imposed by the fact that more and more frequently these data are captured at very different dimensional and/or temporal scales. The present study describes a first attempt at providing an interactive visualisation environment for homogeneous biomedical data defined over radically different spatial or temporal scales. In particular, we describe new strategies for the management of the dimensional information of highly heterogeneous data types; the management of temporal multiscaling; for 3D unstructured spatial multiscale visualisation and the related interaction paradigms and user interface. Preliminary results with a prototype implementation based on the OpenMAF application framework (http://www.openmaf.org) indicate that it is possible to develop effective environments for interactive visualisation of multiscale biomedical data.

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

multiscale visualisation
virtual physiological human


Flipping triangles and rectangles We study the chromatic number of the flip graph of triangles determined by n points in convex position in the plane, and present new or improved bounds on several related parameters for this graph. We also find the chromatic numbers of two related graphs: the rectangle flip graph which generalizes the shift graph, and the rolling block graph from the popular puzzle Rolling Block Maze.

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


A distributed group mobility adaptive clustering algorithm for mobile ad hoc networks This paper proposes a distributed group mobility adaptive (DGMA) clustering algorithm for mobile ad hoc networks (MANETs) on the basis of a revised group mobility metric, linear distance based spatial dependency (LDSD), which is derived from the linear distance of a node's movement instead of its instantaneous speed and direction. In particular, it is suitable for group mobility pattern where group partitions and mergence are prevalent behaviors of mobile groups. The proposed clustering scheme aims to form more stable clusters by prolonging cluster lifetime and reducing the clustering iterations even in highly dynamic environment. Simulation results show that the performance of the proposed framework is superior to two widely referenced clustering approaches, the Lowest-ID clustering scheme and the mobility based clustering algorithm MOBIC, in terms of average clusterhead lifetime, average resident time, average number of clusterhead changes, and average number of cluster reaffiliations. (C) 2008 Elsevier B.V. All rights reserved.

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

clustering algorithm
group mobility
spatial dependency
ad hoc networks


Foveal development and nystagmus The combination of optical coherence tomography (OCT) and genetic methods along with other clinical diagnostic tools permit the discrimination of infantile nystagmus subtypes with a precision that has not previously been possible. Analysis of specific diseases, such as albinism and achromatopsia as well as known genetic abnormalities, such as?FRMD7?and?PAX6?mutations, shows subtle but significant differences between nystagmus subtypes using eye movement recordings. In addition, OCT can be used to chart the progression of retinal diseases with age, for example, as has been shown in achromatopsia. OCT can also be used to predict the level of visual deficit due to retinal abnormalities, as demonstrated for albinism. These findings suggest that the classification of all infantile nystagmus into one single entity is premature.

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

infantile nystagmus
optical coherence tomography
albinism
achromatopsia


Novel stability criteria for recurrent neural networks with time-varying delay ? This paper is concerned with the problem of stability analysis of recurrent neural networks with time-varying delay. An augmented LyapunovKrasovskii functional containing a triple integral term and considering more information of activation functions is constructed. Then, Wirtinger-based inequality and two zero-value free-weighting matrix equations are used to deal with the derivative of the LyapunovKrasovskii functional. Those treatments lead to less conservatism. A numerical example is given to verify the effectiveness and benefit of the proposed criteria.

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

recurrent neural networks
stability
lyapunovkrasovskii functional


Characterization of bistability for stochastic multistep methods The focus of this article lies on the bistability of multistep methods applied to stochastic ordinary differential equations. Here bistability is understood in the sense of F. Stummel and leads to two-sided estimates of the strong error of convergence. It is shown that bistability can be characterized by Dahlquist's strong root condition. The main ingredient of the stability analysis is a stochastic version of Spijker's norm. We use our results to discuss the maximum order of convergence for higher order schemes. In particular, we are concerned with the stochastic theta method, BDF2-Maruyama and higher order It-Taylor schemes.

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

sode
ito-taylor schemes
bdf2-maruyama
stochastic multistep method
two-sided error estimate
stochastic spijker norm


Spacetime variograms and a functional form for total air pollution measurements A spacetime functional form for some contaminants is obtained and used for estimating total air pollution (TAP) in the district of Milan, Italy, during selected high-risk days of 1999. This functional form is determined through a spacetime productsum variogram model for TAP measurements and the dual form of kriging, i.e., radial basis functions. Data for nitric oxide (NO), nitrogen dioxide (NO2) and carbon monoxide (CO) collected in Milan district, Italy are used to generate a combined indicator of traffic pollution, called TAP. In a previous study the weightings were obtained by multiple principal component analyses of the daily concentration levels. It was found that the first component explains approximately 70% of the total variance for each day and this component is treated as samples defined over space and time. A systematic pattern, which follows the corridor along which survey stations, characterized by heavy traffic are located, has been observed for TAP throughout Milan district, for all days considered. Note that the pollution data set is just an illustration for the new statistical method proposed.

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

productsum model
spacetime correlation models
principal component analysis


Use of functional specifications as objective functions in topological optimization of compliant mechanism Instead of using the concepts of minimum compliance or maximum mutual compliance, alternative formulation, based on functional specification is proposed to solve for topology of compliant mechanism. Among mechanical advantage, geometrical advantage and work ratio, one of the functional specifications is posed as objective function while displacement constraint and material constraint are imposed. The topological design of compliant mechanism is then solved as a problem of material distribution using spring and SIMP model without filtering technique. The solution of this problem is obtained by using the method of moving asymptotes (MMA). The effect of problem formulation on final topology of compliant mechanism is then illustrated using two examples and the results are compared against their rigid-body counterparts.

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

topological optimization
compliant mechanism
functional specifications


An enterprise modelling method based on an extension mechanism To meet the demands of the enterprise models for the various application systems, an enterprise modelling method supporting model extension is proposed in this paper. In this method, first, the model is classified into three meta-model levels: core level, basic level and application level. The core-level meta-model describes some core conceptions of enterprise modelling. The basic-level meta-model extends the core level on the base of the some current modelling methods to meet the generic needs of the application system. The application-level model can build the elements and their attributes extensions to meet the needs of the different systems according to extension mechanism. The model of each level and the extension mechanism are discussed in detail. Furthermore, a method is given to guarantee the consistency of the extended model. Also the modelling process of this method is specified. This method is flexible and can meet the various modelling demands. An application example is provided to confirm the validity and feasibility of this method.

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

enterprise modelling
extension mechanism


Multimodal Integration-A Statistical View This paper presents a statistical approach to developing multimodal recognition systems and, in particular, to integrating the posterior probabilities of parallel input signals involved in the multimodal system. We first identify the primary factors that influence multimodal recognition performance by evaluating the multimodal recognition probabilities. We then develop two techniques, an estimate approach and a learning approach, which are designed to optimize accurate recognition during the multimodal integration process. We evaluate these methods using Quickset, a speech/gesture multimodal system, and report evaluation results based on an empirical corpus collected with Quickset. From an architectural perspective, the integration technique presented here offers enhanced robustness. It also is premised on more realistic assumptions than previous multimodal systems using semantic fusion. From a methodological standpoint, the evaluation techniques that we describe provide a valuable tool for evaluating multimodal systems.

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

combination of multiple classifiers
decision making
gesture recognition
speech recognition
uncertainty


Vehicle and crew scheduling for urban bus lines A solution to the urban transportation problem is given by vehicle and crew schedules. These schedules must meet the passenger demand and satisfy technical and contractual restrictions stemming from the daily operation of the lines, while optimizing some measure of operational cost. This work describes a computational tool developed to solve the urban transportation problem in the large metropolitan area of So Paulo, Brazil. The techniques used are based on integer programming models coupled with heuristics. The former produces good feasible solutions, and the latter improves the quality of the final solutions. While the operational and labor restrictions are specific to the city of So Paulo, the same ideas can inspire similar approaches for solving the urban transportation problem arising in other metropolitan areas.

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


Biological movement increases acceptance of humanoid robots as human partners in motor interaction The automatic tendency to anthropomorphize our interaction partners and make use of experience acquired in earlier interaction scenarios leads to the suggestion that social interaction with humanoid robots is more pleasant and intuitive than that with industrial robots. An objective method applied to evaluate the quality of humanrobot interaction is based on the phenomenon of motor interference (MI). It claims that a face-to-face observation of a different (incongruent) movement of another individual leads to a higher variance in ones own movement trajectory. In social interaction, MI is a consequence of the tendency to imitate the movement of other individuals and goes along with mutual rapport, sense of togetherness, and sympathy. Although MI occurs while observing a human agent, it disappears in case of an industrial robot moving with piecewise constant velocity. Using a robot with human-like appearance, a recent study revealed that its movements led to MI, only if they were based on human prerecording (biological velocity), but not on constant (artificial) velocity profile. However, it remained unclear, which aspects of the human prerecorded movement triggered MI: biological velocity profile or variability in movement trajectory. To investigate this issue, we applied a quasi-biological minimum-jerk velocity profile (excluding variability in the movement trajectory as an influencing factor of MI) to motion of a humanoid robot, which was observed by subjects performing congruent or incongruent arm movements. The increase in variability in subjects movements occurred both for the observation of a human agent and for the robot performing incongruent movements, suggesting that an artificial human-like movement velocity profile is sufficient to facilitate the perception of humanoid robots as interaction partners.

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

motor interference
humanoid robot
interaction

motor resonance
mirror neuron system
actionperception coupling


A data parallel strategy for aligning multiple biological sequences on multi-core computers In this paper, we address the large-scale biological sequence alignment problem, which has an increasing demand in computational biology. We employ data parallelism paradigm that is suitable for handling large-scale processing on multi-core computers to achieve a high degree of parallelism. Using the data parallelism paradigm, we propose a general strategy which can be used to speed up any multiple sequence alignment method. We applied five different clustering algorithms in our strategy and implemented rigorous tests on an 8-core computer using four traditional benchmarks and artificially generated sequences. The results show that our multi-core-based implementations can achieve up to 151-fold improvements in execution time while losing 2.19% accuracy on average. The source code of the proposed strategy, together with the test sets used in our analysis, is available on request.

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

data parallelism
multiple sequence alignment
biological sequences
clustering


Uncertainty measures of well-tempered systems Investigations of tone systems are motivated by mathematical models in acoustics. In the present paper, tone systems are represented by the systems of fuzzy numbers. The construction idea of these systems consists of using approximations of 3/2. A formalization of well-tempered systems is given. Uncertainty-based-information measures are considered. The Huygens-Fokker, Opelt, Haba, Sumec, Petzval, and more other tone systems (used in the musical theory and practice and also new ones) are derived as consequences of the theory.

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

applied harmonic analysis
uncertainty-based information
uncertainty measure


Correlation analysis between pattern and non-pattern wafer for characterization of shallow trench isolationchemicalmechanical polishing (STICMP) process ? This study is about control of oxide removal amounts on the shallow trench isolation (STI) patterned wafers using removal rate and thickness of blanket (non-patterned) wafers. At first, the removal properties of plasma enhanced tetra-ethyl ortho-silicate (PETEOS) blanket wafers was investigated, and then it was compared with the removal properties and the planarization (step height) as a function of polishing time of the specific STI patterned wafers. We found that there is a relationship between the amount of oxide removal by blanket and patterned wafers. We analyzed this relationship, and the post-CMP thickness of patterned wafers could be controlled by removal rate and removal target thickness of blanket wafers. As the result of correlation analysis, we confirmed that there was the strong correlation between patterned and blanket wafers (correlation factor: 0.7109). So, we could confirm the repeatability as applying to STI CMP process from the linear formula obtained.

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

shallow trench isolation (sti)
chemicalmechanical polishing (cmp)
blanket (non-pattern)


Towards collaborative component-based modelling Collaborative modelling enables dispersed users to develop component-based system models in group settings. A realization of such an approach requires coordinating and maintaining the causality of the users' activities. We propose the Collaborative DEVS Modelling (CDM) approach and its realization based on the Computer Supported Collaborative Work (CSCW) and the Discrete Event System Specification (DEVS) concepts and technologies. The CSCW concepts are introduced into the DEVS modelling framework in order to support model development in virtual team settings. A set of modelling rules and tasks enabling collaborative, visual, and persistent model construction and synthesis is developed. To support separate groups of modellers to independently develop models, the realization of CDM supports independent modelling sessions. An illustrative example is developed to demonstrate collaborative and incremental model development. The design of the CDM realization and future research are briefly described.

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

collaborative modelling
computer supported collaborative work
discrete event system specification


Comparison between lattice Boltzmann method and NavierStokes high order schemes for computational aeroacoustics Computational aeroacoustic (CAA) simulation requires accurate schemes to capture the dynamics of acoustic fluctuations, which are weak compared with aerodynamic ones. In this paper, two kinds of schemes are studied and compared: the classical approach based on high order schemes for NavierStokes-like equations and the lattice Boltzmann method. The reference macroscopic equations are the 3D isothermal and compressible NavierStokes equations. A Von Neumann analysis of these linearized equations is carried out to obtain exact plane wave solutions. Three physical modes are recovered and the corresponding theoretical dispersion relations are obtained. Then the same analysis is made on the space and time discretization of the NavierStokes equations with the classical high order schemes to quantify the influence of both space and time discretization on the exact solutions. Different orders of discretization are considered, with and without a uniform mean flow. Three different lattice Boltzmann models are then presented and studied with the Von Neumann analysis. The theoretical dispersion relations of these models are obtained and the error terms of the model are identified and studied. It is shown that the dispersion error in the lattice Boltzmann models is only due to the space and time discretization and that the continuous discrete velocity Boltzmann equation yield the same exact dispersion as the NavierStokes equations. Finally, dispersion and dissipation errors of the different kind of schemes are quantitatively compared. It is found that the lattice Boltzmann method is less dissipative than high order schemes and less dispersive than a second order scheme in space with a 3-step RungeKutta scheme in time. The number of floating point operations at a given error level associated with these two kinds of schemes are then compared.

O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 I O O B O O O O O O O O O O O O O O O O O O O O O O B O O O B I O O O O O O O O O O O O O O O O O O O O O O B O O O O O B O B O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B 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 aeroacoustics
lattice boltzmann
rungekutta
dispersion
dissipation
von neumann analysis


Automatic terrain generation with a sketching tool Nowadays, applications such as scientific simulations, virtual reality or computer games are increasing the detail of their environments with the aim of offering more realism. Terrain is a very important element in these outdoor scenarios. Artists are currently requiring a higher level of customization. In this sense, the objective of the work presented in this paper is to provide the final user with an easy-to-use terrain generation application. More precisely, our aim is to ease the creation of islands. We propose a sketching solution which, combined with a simple terrain algorithm, is capable of suiting the user needs. The application is composed of two windows, which offer 2D and 3D representations of the terrain respectively. These windows are sufficient for providing the user with an interactive feedback about the island that is being designed. We try to show that relatively simple algorithms can be combined and improved to provide successful results.

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

sketching interface
virtual environment
simulation


A taxonomy for privacy enhancing technologies Privacy-enhancing technologies (PETs) belong to a class of technical measures which aim at preserving the privacy of individuals or groups of individuals. Numerous PETs have been proposed for all kinds of purposes, but are difficult to be compared with each other. The challenge here lies in the fact that information privacy is a comprehensive concept with solutions being diverse, with different focus and aims. As existing taxonomies cover information security-related aspects, while neglecting privacy-specific properties, this work aims at filling this gap by describing a universal taxonomy of PETs where the taxonomy aspects are selected such that they allow the categorization of PETs in different dimensions and properties to cover a wide area of privacy (e.g., user privacy, data privacy). It provides the reader with a tool for the systematic comparison of different PETs. This helps in identifying limitations of existing PETs, complementary technologies, and potential research directions. To demonstrate its applicability, the proposed taxonomy is applied to a set of key technologies covering different disciplines such as data anonymization, privacy-preserving data querying, communication protection, and identity hiding.

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

privacy-enhancing technologies
survey
classification


Conditional entropy for incomplete decision systems and its application in data mining Rough set theory is a useful mathematic tool for dealing with vague and uncertain information. Shannon's entropy and its variants have been applied to measure uncertainty in rough set theory from the viewpoint of information theory. However, few studies have been carried out on information-theoretical measure of attribute importance in incomplete decision system (IDS) considering the relation between decision attribute and condition attributes. In this paper, we introduce the concept of conditional entropy together with entropy and joint entropy in IDSs. By using the new conditional entropy, we propose a measure for attribute importance. Based on the measure, a heuristic attribute reduction algorithm is presented. Some test experiments on real-lift data-sets show the effectiveness of the algorithm. The attribute importance measure and the attribute reduction algorithm can be used in data mining or machine learning for handling incomplete data.

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

rough set theory
incomplete decision systems
conditional entropy
attribute reduction


A methodology for building content-oriented hypermedia systems Recently there have been many efforts to develop hypermedia systems. Hypermedia applications can be categorized into process-oriented and content-oriented. However, it is not a trivial task to build content-oriented hypermedia in a systematic fashion. Content-oriented hypermedia systems are developed primarily for the applications of marketing or information services. This paper proposes a methodology for building a content-oriented hypermedia system. Hypermedia contents are typically structured in the form of hierarchies. An index node can be used to gain access to this hierarchical structure. The proposed methodology adopts three types of nodes (content, index and function) and two navigation mechanisms (simple and operational). Furthermore, various design techniques are proposed for maintaining content-oriented hypermedia systems that have an evolutionary feature. To demonstrate its practical usefulness, the methodology is applied to developing a hypermedia system.

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

content-oriented hypermedia system
hypermedia design methodology
database
navigation mechanism


How different? Comparing the use of design in service innovation in Nordic and American new technology-based firms This paper explores differences in the use of design in service innovation in Nordic and American new technology-based firms and is based on a systematic qualitative comparison of case data collected on eight service innovation projects in each of the locations. Differences were expected due to these two locations' disparity in terms of agglomeration of technology-based firms and access to design resources. The results of the comparison indicate that there are more similarities than there are differences in how design is used in service innovation in these two locations. Possible explanations are explored and implications suggested.

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

case studies
design activity
design practice
service innovation


Enhanced security in internet voting protocol using blind signature and dynamic ballots In this paper, we introduce an internet voting protocol which satisfies desired security requirements of electronic voting. In the newly proposed protocol, we allow the adversaries to get more power than in any previous works. They can be coercers or vote buyers outside, and corrupted parties inside our system. These adversaries also have ability to collude with each other to ruin the whole system. Our main contribution is to design an internet voting protocol which is unsusceptible to most of sophisticated attacks. We employ the blind signature technique and the dynamic ballots instead of complex cryptographic techniques to preserve privacy in electronic voting. Moreover, we also aim at the practical system by improving the blind signature scheme and removing physical assumptions which have often been used in the previous works.

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

voting protocol
dynamic ballot
receipt-freeness


An efficient sealed-bid auction protocol with two servers We propose an efficient and secure sealed-bid auction protocol with two servers, a third party A and a seller S. A server A is not a trusted third party, but is assumed not to collude with a server S. Barring collusion between A and S, neither party gains any information about the bids, and moreover, the outcome of the auction will be correct. Moreover, the proposed auction protocol has a very small computational complexity and a similar communication overhead compared with Naor et al.'s scheme. Especially since a computation and communication overhead of a bidder are very efficient than Naor et al.'s scheme, the proposed scheme is more suitable to lightweight devices such as PDA, mobile phone, etc.

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

sealed-bid
cryptographic protocol
two-party computation
goldwasser-micali encryption


Robust image retrieval with hidden classes ? We address a new robust problem, named hidden classes, in content-based image retrieval (CBIR). We propose a new robust CBIR scheme using multi-image queries to tackle the difficule problem. We develop a novel query detection technique to separate queries as common or novel according to their underlying classes. We apply a self-adaptive retrieval strategy to handle different types of queries automatically. We design and carry out a number of experiments to demonstrate the effectiveness of our scheme.

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

hidden classes
robust image retrieval
novel query detection

content-based image retrieval
image classification


The maximum entropy approach and probabilistic IR models This paper takes a fresh look at modeling approaches to information retrieval that have been the basis of much of the probabilistically motivated IR research over the last 20 years. We shall adopt a subjectivist Bayesian view of probabilities and argue that classical work on probabilistic retrieval is best understood from this perspective. The main focus of the paper will be the ranking formulas corresponding to the Binary Independence Model (BIM), presented originally by Roberston and Sparck Jones [1977] and the Combination Match Model (CMM), developed shortly thereafter by Croft and Harper [1979]. We will show how these same ranking formulas can result from a probabilistic methodology commonly known as Maximum Entropy (MAXENT).

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

binary independence model
combination match

theory
linked dependence
idf weighting
probability ranking principle


Three-dimensional automatic routing for the design of moulded interconnect devices One of the fundamental innovations in the field of mechatronics is the direct material integration of mechanical and electronic functions through using moulded interconnect devices (MID) technology. Unlike conventional circuit boards, they are not limited to two dimensions but offer the possibility to arbitrarily lay printed circuit traces on the surfaces of the three-dimensional carrier. Traditional 2D layout function in electronic computer aided design (ECAD), especially automatic routing algorithm cannot be directly applied in MID. In this article, two 3D routing algorithms with their own advantages and disadvantages are presented. The related 3D routing functions, which are not supported by conventional mechanic CAD (MCAD) and ECAD systems, have been integrated in the design system MIDCAD. With these 3D routing functions, MIDCAD enables a more effective product design based on the MID technology.

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

moulded interconnect devices (mid)
three dimensional


A lower bound for weighted completion time variance We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard. We propose a heuristic and a lower bound based on job splitting and the Viswanathkumar and Srinivasan procedure. The test on more than 2000 instances shows that this lower bound is very tight and the heuristic yields solutions very close to optimal ones since the gap between the solution given by the heuristic and the lower bound is very small.

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

scheduling
single machine
weighted completion time variance
lower bound
heuristic


A neural network model for solving convex quadratic programming problems with some applications This paper presents a capable neural network for solving strictly convex quadratic programming (SCQP) problems with general linear constraints. The proposed neural network model is stable in the sense of Lyapunov and can converge to an exact optimal solution of the original problem. A block diagram of the proposed model is also given. Several applicable examples further show the correctness of the results and the good performance of the model.

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

optimality conditions
dynamic model
convergent
stability


An Evolving Fuzzy Predictor for Industrial Applications A reliable and online predictor is very useful to a wide array of industries to forecast the behavior of time-varying dynamic systems. In this paper, an evolving fuzzy system (EFS) is developed for system state forecasting. An evolving clustering algorithm is proposed for cluster generation. Clusters are established and modified based on constraint criteria of mapping consistence and compatible measurement. A novel recursive Levenberg-Marquardt (R-LM) method is proposed for online training of nonlinear EFS parameters. The viability of the developed EFS predictor is evaluated based on both simulation from benchmark data and real-time tests corresponding to machinery condition monitoring and material property testing. Test results show that the developed EFS predictor is an effective and accurate forecasting tool. It can capture the system's dynamic behavior quickly and track the system's characteristics accurately. The proposed clustering algorithm is an effective structure identification method. The recursive training technique is computationally efficient, and can effectively improve reasoning convergence.

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

machinery condition monitoring
material property testing

adaptive training
evolving fuzzy system (efs)
multi-step prediction
recursive levenberg-marquardt (r-lm)


energy/power estimation of regular processor arrays We propose a high-level analytical model for estimating the energy and/or power dissipation in VLSI processor (systolic) array implementations of loop programs, particularly for implementations on FPGA based CO-processors. We focus on the respective impact of the array design parameters on the overall off-chip i/o traffic and the number and sizes of the local memories in the array. The model is validated experimentally and shows good results (12.7\% RMS error in the predictions).

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

programmable logic
design space exploration
processor array partitioning
power estimation


audiovisual 3d rendering as a tool for multimodal interfaces In this talk, we will start with a short overview of 3D audiovisual rendering and its applicability to multimodal interfaces. In recent years, we have seen the generalization of 3D applications, ranging from computer games, which involve a high level of realism, to applications such as SecondLife, in which the visual and auditory quality of the 3D environment leaves much to be desired. In our introduction will attempt to examine the relationship between the audiovisual rendering of the environment and the interface. We will then review some of the audio-visual rendering algorithms we have developed in the last few years. We will discuss four main challenges we have addressed. The first is the development of realistic illumination and shadow algorithms which contribute greatly to the realism of 3D scenes, but could also be important for interfaces. The second involves the application of these illumination algorithms to augmented reality settings. The third concerns the development of perceptually-based techniques, and in particular using audio-visual cross-modal perception. The fourth challenge has been the development of approximate but "plausible", interactive solutions to more advanced rendering effects, both for graphics and audio. On the audio side, our review will include the introduction of clustering, masking and perceptual rendering for 3D spatialized audio and our recently developed solution for the treatment of contact sounds. On the graphics side, our discussion will include a quick overview of our illumination and shadow work, its application to augmented reality, our work on interactive rendering approximations and perceptually driven algorithms. For all these techniques we will discuss their relevance to multimodal interfaces, including our experience in a urban design case-study and attempt to relate them to recent interface research. We will close with a broad reflection on the potential for closer collaboration between 3D audiovisual rendering and multimodal interfaces.

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


Connectivity of iterated line graphs In this paper we present lower bounds for the connectivity of the i-iterated line graph Li(G) of a graph G. We prove that if G is a connected regular graph and i?5, then the connectivity of Li(G) is equal to the degree of Li(G), that is, the connectivity of Li(G) attains its theoretical maximum (we remark that the bound on i is best possible). Moreover, if a hypothesis on the growth of the minimum degree of the i-iterated line graph is true, then an analogous result is true for an arbitrary graph G if i is sufficiently large.

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


Disjunctive logic programs with inheritance The paper proposes a new knowledge representation language, called DLP<, which extends disjunctive logic programming (with strong negation) by inheritance. The addition of inheritance enhances the knowledge modeling features of the language providing a natural representation of default reasoning with exceptions. A declarative model-theoretic semantics of DLP< is provided, which is shown to generalize the Answer Set Semantics of disjunctive logic programs. The knowledge modeling features of the language are illustrated by encoding classical nonmonotonic problems in DLP<. The complexity of DLP< is analyzed, proving that inheritance does not cause any computational overhead, as reasoning in DLP< has exactly the same complexity as reasoning in disjunctive logic programming. This is confirmed by the existence of an efficient translation from DLP< to plain disjunctive logic programming. Using this translation, an advanced KR system supporting the DLP< language has been implemented on top of the DLV system and has subsequently been integrated into DLV.

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

knowledge representation
disjunctive logic programming
inheritance
exceptions


Automated cellular modeling and prediction on a large scale We describe CHAMP (CHurn Analysis, Modeling, and Prediction), an automated system for modeling cellular subscriber churn that is predicting which customers will discontinue cellular phone service. We describe various issues related to developing and deploying this system including automating data access from a remote data warehouse, preprocessing, feature selection, model validation, and optimization to reflect business tradeoffs. Using data from GTE's data warehouse for cellular phone customers, CHAMP is capable of developing churn models customized by region for over one hundred GTE cellular phone markets totaling over 5 million customers. Every month churn factors are identified for each geographic region and models are updated to generate churn scores predicting who is likely to chum in the short term. Learning methods such as decision trees and genetic algorithms are used for feature selection and a cascade neural network is used for predicting chum scores. In addition to producing churn scores, CHAMP also produces qualitative results in the form of rules and comparison of market trends that are disseminated through a web based interface.

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


named graphs, provenance and trust The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that describe graphs, which is beneficial in many Semantic Web application areas. As a case study, we explore the application area of Semantic Web publishing: Named Graphs allow publishers to communicate assertional intent, and to sign their graphs; information consumers can evaluate specific graphs using task-specific trust policies, and act on information from those Named Graphs that they accept. Graphs are trusted depending on: their content; information about the graph; and the task the user is performing. The extension of RDF to Named Graphs provides a formally defined framework to be a foundation for the Semantic Web trust layer.

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


A dynamic model for advertising and pricing competition between national and store brands We study the relationship between the pricing and advertising decisions in a channel where a national brand is competing with a private label. We consider a differential game that incorporates the carryover effects of brand advertising over time for both the manufacturer and the retailer and we account for the complementary and competitive roles of advertising. Analysis of the obtained equilibrium Markov strategies shows that the relationship between advertising and pricing decisions in the channel depends mainly on the nature of the advertising effects. In particular, the manufacturer reacts to higher competitive retailers advertising levels by offering price concessions and limiting his advertising expenditures. The retailers optimal reaction to competitive advertising effects in the channel depends on two factors: (1) the price competition level between the store and the national brands and (2) the strength of the competitive advertising effects. For example, in case of intense price competition between the two brands combined with a strong manufacturers competitive advertising effect, the retailer should lower both the store and the national brands prices as a reaction to higher manufacturers advertising levels. For the retailer, the main advantage from boosting his competitive advertising investments seems to be driven by increased revenues from the private label. The retailer should however limit his investments in advertising if the latter generates considerable competitive effects on the national brands sales.

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


Information for perception and information processing Do psychologists and computer/cognitive scientists mean the same thing by the term 'information'? In this essay, I answer this question by comparing information as understood by Gibsonian, ecological psychologists with information as understood in Barwise and Perry's situation semantics. I argue that, with suitable massaging, these views of information can be brought into line. I end by discussing some issues in (the philosophy of) cognitive science and artificial intelligence.

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

barwise
information
perception
situation semantics


bi-objective release planning for evolving software systems The release planning (RP) problem can be investigated from two dimensions -- what to release and when to release. We investigate the "what" to release decision in terms of which new features or change requests should be assigned and implemented in which releases of a software system. RP for evolving systems is challenging, because the new features might require changes to the existing system. A major drawback of existing RP methods is that, they do not consider the existing systems in making RP decisions. In this paper, we present a technique to detect coupling between features based on relatedness of the components that would implement the features. The components implementing the features are derived from change impact analysis. We integrate the results from feature coupling into a RP strategy that encourages the assignment of highly coupled features in the same release. This helps to avoid haphazard implementation of related features. We present a decision support approach that formulates the RP problem as a bi-objective optimization problem. Our Bi-Objective Release Planning for Evolving Systems (BORPES) is aimed at optimizing the value of release plans from both the business perspectives and the implementation perspectives. This paper presents BORPES in detail and reports on a proof-of-concept case study that investigates the applicability of the proposed approach. The bi-objective optimization offers a set of Pareto-optimal solutions.

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

evolving systems
release planning
feature coupling
impact analysis


Changing assessment methods: New rules, new roles ? ?? Over the past 20 years, the use of Computer Algebra Systems (CAS) has helped with the teaching of mathematics in engineering schools. However the traditional use of CAS only in math labs has led to a narrow view by the student: the CAS is an additional work, not included in the learning process. The didactic guidelines of the European Higher Education Area (EHEA) propose a new teachinglearning model based on competencies. We suggest the use of the CAS be adapted to the new rules. In this paper, we present a model for the integrated use of the CAS, and we describe and analyze two experiments carried out in the academic year 20112012. Our analysis suggests that the use of CAS in all learning and assessment activities has the potential to positively influence the development of competencies.

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

computer algebra systems
assessment
competencies


Creating Portable, Repeatable, Realistic Benchmarks for Embedded Systems and the Challenges Thereof To appreciate the challenges of analysing embedded processor behaviour, step back in time to understand the evolution of embedded processors. Only a few decades ago, embedded processors were relatively simple devices (compared to today), represented by a host of 8- and 16-bit microcontrollers, and 32-bit microprocessors, with minimal integration. Today, these processors (even the so-called, low-end microcontrollers), have evolved into highly-integrated SoCs with a wide variety of architectures capable of tackling both specific and general-purpose tasks. Associated with these transformations, the benchmarks used to quantify the capabilities have also grown in complexity and range. At the simplest level, benchmarks such as CoreMark analyse the fundamental processor cores. At the other end of the spectrum, system benchmarks, such BrowsingBench, analyse the entire SoC as well as the system software stack and even the physical interfaces. This paper examines some of the challenges of applying such benchmarks, and explains the methodologies used at EEMBC to manage portability, repeatability, and realism.

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

algorithms
measurement
performance
standardization
benchmark
workload characterization
performance analysis


On the throughput-energy tradeoff for data transmission between cloud and mobile devices Mobile cloud computing has recently emerged as a new computing paradigm promising to improve the capabilities of resource-constrained mobile devices. As the data processing and storage are moved from mobile devices to powerful cloud platforms, data transmission has become an important issue affecting user experiences of mobile applications. One of the challenges is how to optimize the tradeoff between system throughput and energy consumption, which are potentially conflicting objectives. Inspired by the feasibility of transmission scheduling for prefetching-friendly or delay-tolerant applications, we mathematically formulate this problem as a stochastic optimization problem, and design an online control algorithm to balance such an energy-performance tradeoff based on the Lyapunov optimization framework. Our algorithm is able to independently and simultaneously make control decisions on admission and transmission to maximize a joint utility of the average application throughput and energy cost, without requiring any statistical information of traffic arrivals and link bandwidth. Rigorous analysis and extensive simulations have demonstrated both the system stability and the utility optimality achieved by our control algorithm.

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

mobile cloud computing
lyapunov optimization

throughput-energy tradeoff
dynamic scheduling
queue stability


Successive Group Selection for Microaggregation In this paper, we propose an efficient clustering algorithm that has been applied to the microaggregation problem. The goal is to partition N given records into clusters, each of them grouping at least K records, so that the sum of the within-partition squared error (SSE) is minimized. We propose a successive Group Selection algorithm that approximately solves the microaggregation problem in O(N-2 logN) time, based on sequential Minimization of SSE. Experimental results and comparisons to existing methods with similar computation cost on real and synthetic data sets demonstrate the high performance and robustness of the proposed scheme.

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


The S-transform using a new window to improve frequency and time resolutions The S-transform presents arbitrary time series as localized invertible timefrequency spectra. This transformation improves the short-time Fourier transform and the wavelet transform by merging the multiresolution and frequency-dependent analysis properties of wavelet transform with the absolute phase retaining of Fourier transform. The generalized S-transform utilizes a combination of a Fourier transform kernel and a scalable-sliding window. The common S-transform applies a Gaussian window to provide appropriate time and frequency resolution and minimizes the product of these resolutions. However, the Gaussian S-transform is unable to obtain uniform time and frequency resolution for all frequency components. In this paper, a novel window based on the \(t\) student distribution is proposed for the S-transform to achieve a more uniform resolution. Simulation results show that the S-transform with the proposed window provides in comparison with the Gaussian window a more uniform resolution for the entire time and frequency range. The result is suitable for applications such as spectrum sensing.

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

s-transform
short-time fourier transform
spectral localization
\(t\) student


Digital-Controlled Single-Phase Transformer-Based Inverter for Non-Linear Load Applications The paper presents a new digital-controlled single-phase transformer-based inverter for non-linear load applications. A capacitive full-bridge circuit is added to provide instant current under non-linear load condition and thereby reducing the harmonics significantly to meet the required harmonic standard, IEEE 519-1992, even under non-linear load condition. The redundant capacity, cost, size and weight of line frequency transformer can therefore be dramatically reduced. Moreover, a new integrated controller for inverter control is proposed to eliminate both DC current component and steady state error even under heavy load condition. The proposed integrated controller consists of a Proportional (P) controller acts as voltage controller, DC offset canceller, an RMS compensator and non-linear load compensator. Experimental results derived from a DSP-based inverter system will be presented. The inverter rating is 1.5 kVA. It will be shown that both redundant capacity of line frequency transformer and voltage harmonics are significantly reduced even with non-linear load. It will also be demonstrated that the DC current component and steady state error are eliminated even under heavy load condition. These experimental results therefore confirm the superb performance of the proposed inverter and control techniques.

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

inverter
line frequency transformer
voltage harmonics


bi-criteria algorithm for scheduling jobs on cluster platforms We describe in this paper a new method for building an efficient algorithm for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT) which can be scheduled on any number of processors. The main feature is to consider two criteria that are optimized together. These criteria are the makespan and the weighted minimal average completion time ( minsum ). They are chosen for their complementarity, to be able to represent both user-oriented objectives and system administrator objectives.We propose an algorithm based on a batch policy with increasing batch sizes, with a smart selection of jobs in each batch. This algorithm is assessed by intensive simulation results, compared to a new lower bound (obtained by a relaxation of ILP) of the optimal schedules for both criteria separately. It is currently implemented in an actual real-size cluster platform.

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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 computing
bi-criteria
moldable tasks
algorithms


hardware acceleration for spatial selections and joins Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly determine a set of candidate objects, and in the refinement step, the actual geometries of the objects are retrieved and compared to the query geometry or each other. Because of the complexity of the computational geometry algorithms involved, the CPU cost of the refinement step is usually the dominant cost of the operation for complex geometries such as polygons. In this paper, we propose a novel approach to address this problem using efficient rendering and searching capabilities of modern graphics hardware. This approach does not require expensive pre-processing of the data or changes to existing storage and index structures, and it applies to both intersection and distance predicates. Our experiments with real world datasets show that by combining hardware and software methods, the overall computational cost can be reduced substantially for both spatial selections and joins.

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

hardware acceleration
intersection
geometry
paper
distance
graphics hardware
spatial
software
capabilities
rendering
storage
data
hardware
complexity
cost
query

efficiency
computation
spatial selection
object
addressing
experience
combinational
change
select
indexing
method
spatial join
spatial database
operability
process
algorithm
refine
computational geometry


Algorithms and Data Structures for Massively Parallel Generic Adaptive Finite Element Codes Today's largest supercomputers have 100,000s of processor cores and offer the potential to solve partial differential equations discretized by billions of unknowns. However, the complexity of scaling to such large machines and problem sizes has so far prevented the emergence of generic software libraries that support such computations, although these would lower the threshold of entry and enable many more applications to benefit from large-scale computing. We are concerned with providing this functionality for mesh-adaptive finite element computations. We assume the existence of an "oracle" that implements the generation and modification of an adaptive mesh distributed across many processors, and that responds to queries about its structure. Based on querying the oracle, we develop scalable algorithms and data structures for generic finite element methods. Specifically, we consider the parallel distribution of mesh data, global enumeration of degrees of freedom, constraints, and postprocessing. Our algorithms remove the bottlenecks that typically limit large-scale adaptive finite element analyses. We demonstrate scalability of complete finite element workflows on up to 16,384 processors. An implementation of the proposed algorithms, based on the open source software p4est as mesh oracle, is provided under an open source license through the widely used deal. II finite element software library.

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

adaptive mesh refinement
parallel algorithms
software design
object-orientation


Analysis of job arrival patterns and parallel scheduling performance In this paper we present a study of the job arrival patterns from a parallel computing system and the impact of such arrival patterns on the performance of parallel scheduling strategies. Using workload data from the Cornell Theory Center, we develop a class of traffic models to characterize these arrival patterns. Our analysis of the job arrival data illustrates traffic patterns that exhibit heavy-tailed behavior and other characteristics which are quite different from the arrival processes used in previous studies of parallel scheduling. We then investigate the impact of these arrival traffic patterns on the performance of parallel space-sharing strategies, including the derivation of some scheduling optimality results.

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

traffic modeling
queueing analysis
heavy-tail distributions
parallel and distributed systems


On the Convergence Rate of l(p)-Norm Multiple Kernel Learning We derive an upper bound on the local Rademacher complexity of l(p)-norm multiple kernel learning, which yields a tighter excess risk bound than global approaches. Previous local approaches analyzed the case p - 1 only while our analysis covers all cases 1 <= p <= infinity, assuming the different feature mappings corresponding to the different kernels to be uncorrelated. We also show a lower bound that shows that the bound is tight, and derive consequences regarding excess loss, namely fast convergence rates of the order O( n(-)1+alpha/alpha where alpha is the minimum eigenvalue decay rate of the individual kernels.

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

multiple kernel learning
local rademacher complexity


A sampling approach for skyline query cardinality estimation A skyline query returns a set of candidate records that satisfy several preferences. It is an operation commonly performed to aid decision making. Since executing a skyline query is expensive and a query plan may combine skyline queries with other data operations such as join, it is important that the query optimizer can quickly yield an accurate cardinality estimate for a skyline query. Log Sampling (LS) and Kernel-Based ( KB) skyline cardinality estimation are the two state-of-the-art skyline cardinality estimation methods. LS is based on a hypothetical model A(log(n)) (B) . Since this model is originally derived under strong assumptions like data independence between dimensions, it does not apply well to an arbitrary data set. Consequently, LS can yield large estimation errors. KB relies on the integration of the estimated probability density function (PDF) to derive the scale factor I (ds) . As the estimation of PDF and the ensuing integration both involve complex mathematical calculations, KB is time consuming. In view of these problems, we propose an innovative purely sampling-based (PS) method for skyline cardinality estimation. PS is non-parametric. It does not assume any particular data distribution and is, thus, more robust than LS. PS does not require complex mathematical calculations. Therefore, it is much simpler to implement and much faster to yield the estimates than KB. Extensive empirical studies show that for a variety of real and synthetic data sets, PS outperforms LS in terms of estimation speed, estimation accuracy, and estimation variability under the same space budget. PS outperforms KB in terms of estimation speed and estimation variability under the same performance mark.

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

skyline query
cardinality estimation
sampling


auditing for secure statistical databases A statistical database (SDB) is an ordinary database that returns statistical information to user queries. The security problem for the SDB is to control the use of the SDB so that only statistical information is available and no sequence of queries is sufficient to infer protected information about any individual. When such information is obtained, the SDB is said to be compromised. Many researchers have studied different protection mechanisms to prevent an SDB from being compromised. However, most of these mechanisms are either ineffective or inefficient or are only applicable to large SDBs. Auditing in SDBs is initially proposed in the form of investigating log trails manually. In this paper, we present a practical technique for managing the past history of user's queries, discuss how the sequence of all the answered queries of the SDB can be reduced and stored in finite storage, and describe how this storage scheme can provide an effective way of checking compromise. We believe that this will help us to develop a more practical and efficient tool for protection in a small SDB than the previously known mechanisms. We also extend the idea to batched queries and a more general environment for better protection and performance. We also state that the problem of maximizing the amount of information to the users without compromising the SDB is NP-complete.

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

help use protection log performance tool general paper practical control user users storage queries secure database sequence scheme

statistics efficiency informal management research histories environments audit effect completeness


automatic quality assessment of affymetrix genechip data Computing reliable gene expression levels from microarray experiments is a sophisticated process with many potential pitfalls. Quality control is one of the most important steps in this process. We present a web based expert system for automatic quality assessment of Affymetrix GeneChip data. Our approach combines multiple quality metrics with supervised machine learning in order to identify data of low quality. Our system approximates expert opinion as represented in a knowledge base consisting of 41 microarray experiments with 352 CEL files annotated by a domain expert. GeneChips of low quality are detected automatically and can be excluded from subsequent analysis. This is especially important for large experiments or can assist the inexperienced users. Our expert system is fully implemented and integrated into a publicly available remote analysis computation engine for gene expression data.

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

automated quality assessment
knowledge based expert system