Theory and Limitations of Genetic Network Inference from Microarray Data Since the advent of gene expression microarray technology more than 10 years ago, many computational approaches have been developed aimed at using statistical associations between mRNA abundance profiles to predict transcriptional regulatory interactions. The ultimate goal is to develop causal network models describing the transcriptional influences that genes exert on each other (via their protein products), which can be used to predict network disruptions (e.g., mutations) leading to a disease phenotype, as well as the appropriate therapeutic intervention. However, microarray data measure only a small component of the interacting variables in a genetic regulatory network, as cells are known to regulate gene expression via many diverse mechanisms. Although many researchers have acknowledged the questionable interpretation of statistical dependencies between mRNA profiles, very little work has been done on theoretically characterizing the nature of inferred dependencies using models that account for unobserved interacting variables. In this work, we review the theory behind reverse engineering algorithms derived from three separate disciplinessystem control theory, graphical models, and information theoryand highlight several mathematical relationships between the various methods. We then apply recent theoretical work on constructing graphical models with latent variables to the context of reverse engineering genetic networks. We demonstrate that even the addition of simple latent variables induces statistical dependencies between nondirectly interacting (e.g., co-regulated) genes that cannot be eliminated by conditioning on any observed variables

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

reverse engineering
gene expression
latent variables


Cored-based tree with forwarding regions (CBT-FR); a protocol for reliable multicasting in mobile ad hoc networks In this paper we propose a new protocol for reliable multicast in a Multihop mobile radio network. The protocol is reliable, i.e.. it guarantees message delivery to all multicast nodes even when the topology of the network changes during multicasting. The proposed protocol uses a core-based shared tree. The multicast tree may get fragmented due to node movements. The notion of a forwarding region is introduced which is used to glue together fragments of multicast trees. The gluing process involves flooding the forwarding region of only those nodes that witness topology change due to node mobility. Delivery of multicast messages to mobile nodes is expedited through (i) pushing the message by witness nodes in their forwarding regions and (ii) pulling messages by a mobile node during (re)joining process. Hence, the protocol conserves network bandwidth by using a combination of the push-pull approach and by restricting flooding only to the essential parts of the network that are affected by topology change. We develop a theoretical model to compute the probability of packet loss (as a function of the mobility rate) for our proposed scheme compared to the the core-based tree protocol (CBT); we also evaluate the effectiveness of forwarding regions as compared to traditional flooding. Our analysis shows that the proposed scheme significantly outperforms CBT. (C) 2001 Academic Press.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 ad hoc network
mobile multi-hop radio network
multicast routing
group communication
reliable communication
fault-tolerant communication


Product-cost modelling approach for the development of a decision support system for optimal roofing material selection Selection of optimal roofing materials is very important but it is a complex and onerous task as varieties of materials are available for housing roof construction. In order to select suitable materials, an extensive range of criteria would need to be considered. This paper presents the framework and the development of a knowledge-based decision support system for material selection implemented in roofing material selection domain, called Knowledge-based Decision Support system for roofing Material Selection and cost estimating (KDSMS). It was developed to facilitate the selection of optimal materials for different roof sub elements. The system consists of a database and knowledge base that is equipped with an inference engine. The former is used to store different types of roofing materials with assigned attribute values. The later is used to hold qualitative and quantitative knowledge which were collected from domain experts and other technical literatures such as building regulations, price guide book and product catalogues. The proposed system employs the TOPSIS (Technique of ranking Preferences by Similarity to the Ideal Solution) multiple criteria decision making method to solve materials selection and optimisation problem. This study utilised the available roofing materials in the UK housing market in developing the system reported. The main contribution of the developed system is that it provides a tool for the architects, quantity surveyors or self house builder to select optimal materials from a wide array of possibilities for different roof sub elements and also to estimate the conceptual cost for the roof element in the early stage of building design.

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

topsis
decision support system
roofing material selection

knowledge-based system
energy efficient building
product-cost modelling


Non-Uniform Coverage by n-Detection Test Sets The use of n-detection test sets increases the likelihood of defect detection. With a uniform value of n for all the target faults, the expectation is that defects across the circuit will be covered uniformly. This paper demonstrates that this may not be the case by considering the four-way bridging faults detected by n-detection test sets for single stuck-at faults in benchmark circuits. Partitioning the bridging faults into subsets according to their dominated line, the results show that certain subsets have significantly lower bridging fault coverage than others. Thus, certain defect sites are significantly less covered than others. This paper also shows that it is possible to predict which subsets will have low bridging fault coverage based on the numbers of detections of single stuck-at faults under a conventional one-detection test set. This observation leads to a simplified n-detection test generation strategy. It also points to the possibility of using higher numbers of detections for certain single stuck-at faults, or targeting other fault models only at the sites that are expected to be less covered.

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

full-scan circuits
n-detection test sets
stuck-at faults


Circularly orthogonal moments for geometrically robust image watermarking Circularly orthogonal moments, such as Zernike moments (ZMs) and pseudo-Zernike moments (PZMs), have attracted attention due to their invariance properties. However, we find that for digital images, the invariance properties of some ZMs/PZMs are not perfectly valid. This is significant for applications of ZMs/PZMs. By distinguishing between the good and bad ZMs/PZMs in terms of their invariance properties, we design image watermarks with good ZMs/PZMs to achieve watermark's robustness to geometric distortions, which has been considered a crucial and difficult issue in the research of digital watermarking. Simulation results show that the embedded information can be decoded at low error rates, robust against image rotation, scaling, flipping, as well as a variety of other common manipulations such as lossy compression, additive noise and lowpass filtering.

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

zernike moment
pseudo-zernike moment
watermark robustness
geometric distortion


Throughput and energy-efficiency-aware protocol for ultrawideband communication in wireless sensor networks: A cross-layer approach In this paper, we propose an efficient MAC protocol: the throughput maximized MAC protocol ( TM-MAC), inspired by the availability that a number of ultrawideband ( UWB) transmission parameters can be tuned to better match the requirements of data flow. In TM-MAC, we implement a concurrent multiuser access scheme instead of a mutual exclusion method such as TDMA and random access. For multiuser interference, we establish a model to adaptively adjust the data transmission rate to generate the expected signal to interference noise ratio ( SINR) at the receiver side for reliable communications. We also analyze the relationship among the theoretical maximum channel capacity, achievable maximum channel capacity, and data transmission rate. According to network topology, TM-MAC redivides each piconet into several subsets in which communication pairs can make communication simultaneously and achieve the maximum throughput using the highest data rate. In subset formation, we propose a general analytical framework that captures the unique characteristics of shared wireless channel and throughput variance, as well as allows the modeling of a large class of systemwide throughput maximization via the specification of the per-link utilization function. For algorithm essential parameters design, we consider the influence of traffic type on the system performance. Heavy tailed distribution, compared to Poisson distribution for most existing work, is exploited to accurately model the real traffic to achieve the adaptation of our algorithm. Simulation results show that our algorithm can maximize throughput to achieve short latency.

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

wireless sensor networks
ultrawideband communication
multiuser interference
mutual exclusion

mac protocl
network throughput
energy efficiency
multiuser access control


Pattern-based time-series subsequence clustering using radial distribution functions Clustering of time series subsequence data commonly produces results that are unspecific to the data set. This paper introduces a clustering algorithm, that creates clusters exclusively from those subsequences that occur more frequently in a data set than would be expected by random chance. As such, it partially adopts a pattern mining perspective into clustering. When subsequences are being labeled based on such clusters, they may remain without label. In fact, if the clustering was done on an unrelated time series it is expected that the subsequences should not receive a label. We show that pattern-based clusters are indeed specific to the data set for 7 out of 10 real-world sets we tested, and for window-lengths up to 128 time points. While kernel-density-based clustering can be used to find clusters with similar properties for window sizes of 8-16 time points, its performance degrades fast for increasing window sizes.

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

density-based clustering
time series subsequence clustering
clustering noisy data
noise elimination
time series labeling


Papers written by Nobel Prize winners in physics before they won the prize: an analysis of their language and journal of publication In this paper, we analyzed data relating to the language of papers written by winners of Nobel Prizes in physics before they won the prize and their journals of publication, and we identified the change in scientific language corresponding with shifts of the center of the scientific world. Using the science citation index as the main data source, we also collected information on the distribution of prize-winning scientists by country, by each scientists number of published papers, and by language. We then analyzed their papers in terms of the different journals based in different countries. The results are presented in three parts: (1) the main languages used in the papers are English and German. The proportion of papers in English is gradually increasing, while that of papers in German is decreasing. (2) The prize winning scientists papers have been published mainly in journals in their own nation and in the United States. (3) Journals based in their own countries are very helpful to these scientists early in their careers.

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

journal language
english journal
mother-tongue journal


memory-based chc algorithms for the dynamic traveling salesman problem The CHC algorithm uses an elitist selection method that, combined with an incest prevention mechanism and a method to diverge the population whenever it converges, allows the maintenance of the population diversity. This algorithm was successfully used in the past for static optimization problems. The use of memory in Evolutionary Algorithms has been proved to be advantageous when dealing with dynamic optimization problems. In this paper we investigate the use of three different explicit memory strategies included in the CHC algorithm. These strategies - direct, immigrant and associative - combined with the CHC algorithm are used to solve different instances of the dynamic Traveling Salesman Problem in cyclic, noisy and random environments. The experimental results, statistically validated, show that the memory schemes significantly improve the performance of the original CHC algorithm for all types of studied environments. Moreover, when compared with the equivalent memory-based standard EAs with the same memory schemes, the memory-based CHC algorithms obtain superior results when the environmental changes are slower.

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


Improved Competitive Performance Bounds for CIOQ Switches Combined Input and Output Queued (CIOQ) architectures with a moderate fabric speedup S > 1 have come to play a major role in the design of high performance switches. In this paper we study CIOQ switches with First-In-First-Out (FIFO) buffers providing Quality of Service (QoS) guarantees. The goal of the switch policy is to maximize the total value of packets sent out of the switch. We analyze the performance of a switch policy by means of competitive analysis, where a uniform worst-case performance guarantee is provided for all traffic patterns. Azar and Richter (ACM Trans. Algorithms 2(2):282-295, 2006) proposed the beta-PG algorithm (Preemptive Greedy with a preemption factor of beta) that is 8-competitive for an arbitrary speedup value when beta=3. We improve upon their result by showing that this algorithm achieves a competitive ratio of 7.5 and 7.47 for beta=3 and beta=2.8, respectively. Basically, we demonstrate that beta-PG is at most beta(2) + 2 beta/beta- 1 and at least beta(2)/ beta-1-competitive.

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

buffered crossbar switches
control policies


insights into component testing process Effective component testing (or commonly termed as Unit Testing) is important to control defect slippage into the testing stage. Often testing teams lack in-process visibility into the effectiveness of ongoing component testing. Using project data such as code coverage and schedule and effort estimates, we generate temporal and rate-based insights into component testing effectiveness. A simple composite metric is used for measuring and forecasting the health of the component testing process. The early warning signals, based on the forecast and associated insights, lead teams to take proactive actions for improving component testing. In our ongoing experimental studies, we have observed that use of these insights cause a substantial reduction in defect slippage.

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


SystemC fine-grained HW-SW fully heterogeneous WSN simulation and UML metamodel behavioural extraction Wireless sensor networks are becoming an essential part of our lives, being frequently used for monitoring and control applications. It is essential that these networks be modelled before their deployment so as to identify the possible problems that may arise. SystemC is fast becoming an important modelling paradigm in the context of SoC design and verification, as well as other fields that require accurate (sometimes Transaction Level Modelled) characterization of digital processes (i.e.: communication on a bus interface, over a radio channel, etc). SystemC has successfully been used in the IDEA1 WSN exploration framework to model wireless sensor networks at the timed functional level of abstraction. As a first contribution, we refined the initial implementation of IDEA1 to cope with a finer-grade simulation of the node hardware, going beyond the timed functional description of the node and enabling support for a bus cycle-accurate simulation. The new and improved version is called IDEA1TLM and can also model the software aspect of the nodes in question by means of a custom-built instruction set simulator called BLISS. The second part of this contribution focuses on extracting the metamodel from SystemC source files. The metamodel is the information which can be generated concerning the model; in our case, a diagram representation with states and transitions between them. Because current work focuses on generating C++ code (SystemC-compliant) from UML metamodels, there is no support to achieve this in reverse. We developed a tool called DiaSig that takes SystemC source files as input and generates UML diagrams of the model in SVG format.

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


three-dimensional representations for computer graphics and computer vision Representing complex three-dimensional objects in a computer involves more than just evaluating its display capabilities. Other factors are the uses and costs of the representation, what operations can be performed on it and, ultimately, how useful it is for computer recognition or description or three-dimensional objects. Many of the questions which are posed arise from the joint consideration of computer graphics and computer vision, and a specific representation hierarchy is proposed for complex objects which makes them amenable to display, manipulation, measurement, and analysis.

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

measurement
computer vision
capabilities
recognition
analysis
computer graphics
manipulation
representation

object modelling
representation coversions
curved objects
data structures
factor
computation
object
operability
hierarchies
complexity
three dimensional representations
representation hierarchy


Reliability of Cu nanoparticle joint for high temperature power electronics Power cycle reliability of Cu nanoparticle joint has been studied for high temperature operation of power devices. Al2O3 heater chips and Cu65wt%Mo baseplates were joined by Cu nanoparticles and Sn0.7Cu and power cycle tests of 65/200C and 65/250C were carried out on the joints. The Cu nanoparticles were prepared by reducing Cu carbonate in ethylene glycol with dodecanoic acid+dodecyl amine (C12) and decanoic acid and decyl amine (C10) as capping agents. A power cycle test of 65/200C did not inflict severe damage on the Cu nanoparticle joints so that there were not many cracks formed after 3000 cycles. Vertical cracks were formed in the C12 Cu nanoparticle joint after 3000 cycles of 65/250C test, however the maximum temperature during the power cycle test did not change at all because vertical cracks did not have an effect on preventing heat flow. On the contrary, lateral cracks were completely formed in the Sn0.7Cu soldered joint after 200 cycles of 65/200C test and in the C10 Cu nanoparticle joint after 360 cycles of 65/250C test. In these experiments, the maximum temperatures were rapidly increased because heat conduction was prevented across the formed lateral cracks.

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


Three-dimensional numerical analyses of load-bearing behavior and failure of multiple double-shear dowel-type connections in timber engineering The goals of three-dimensional numerical studies of wooden double-shear dowel-type connections are the determination of the load-carrying capacity and the analysis of the load-bearing behavior and the failure of the construction. A suitable finite-element modeling requires different element and constitutive formulations with respect to material, contact and path-following. Particularly, the constitutive modeling of wood is of great importance. Therefore, element approaches and material models are introduced, which take into consideration the ductile and the brittle failure behavior of wood. In this way, failure mechanisms like plasticizing and cracking are represented realistically. The verification of the FE-modeling is carried out on the basis of structural experiments and nonlinear numerical simulations including the post-failure domain. These simulations predict the load-carrying capacity very accurately and allow for a deeper analysis of the failure mechanisms.

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

material modeling
wood mechanics
dowel-type connection
plasticity
load-bearing behavior


The impact of registration accuracy on imaging validation study design: A novel statistical power calculation Misregistration impacts power/cost of registration-based imaging validation studies. We derive 3 power calculations that model the uncertainty due to registration error. Formulae relate sample size, registration error and minimum detectable difference. Formulae predicted sample size, minimum detectable difference and power to within 1%. We illustrate applying the formulae using a case study modeled on an ongoing study.

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

registration error
sample size
minimum detectable difference
statistical power calculation
imaging validation studies


Finite Input-Memory Automaton Based Checker Synthesis of SystemVerilog Assertions for FPGA Prototyping Checker synthesis for assertion based verification becomes popular because of the recent progress on the FPGA prototyping environment. In the paper, we propose a checker synthesis method based on the finite input-memory automaton suitable for embedded RAM modules in FPGA. There are more than 1 Mbit memories in medium size FPGA's and such embedded memory cells have the capability to be used as the shift registers. The main idea is to construct a checker circuit using the finite input-memory automata and implement shift register chain by logic elements or embedded RAM modules. When using RAM module, the method does not consume any logic element for storing the value. Note that the shift register chain of input memory can be shared with different assertions and we can reduce the hardware resource significantly. We have checked the effectiveness of the proposed method using several assertions.

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

systemverilog assertion
assertion checker
finite input-memory automaton


Joint Decoding of Unequally Protected JPEG2000 Bitstreams and Reed-Solomon Codes In this paper we present joint decoding of JPEG2000 bitstreams and Reed-Solomon codes in the context of unequal loss protection. Using error resilience features of JPEG2000 bitstreams, the joint decoder helps to restore the erased symbols when the Reed-Solomon decoder fails to retrieve them on its own. However, the joint decoding process might become time-consuming due to a search through the set of possible erased symbols. We propose the use of smaller codeblocks and transmission of a relatively small amount of side information with high reliability as two approaches to accelerate the joint decoding process. The accelerated joint decoder can deliver essentially the same quality enhancement as the nonaccelerated one, while operating several times faster.

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

joint source-channel decoding
reed-solomon code


A new weighted upwind finite volume element method based on non-standard covolume for time-dependent convection-diffusion problems In modern numerical simulation of problems in energy resources and environmental science, it is important to develop efficient numerical methods for time-dependent convection-diffusion problems. On the basis of nonstandard covolume grids, we propose a new kind of high-order upwind finite volume element method for the problems. We first prove the stability and mass conservation in the discrete forms of the scheme. Optimal second-order error estimate in L-2-norm in spatial step is then proved strictly. The scheme is effective for avoiding numerical diffusion and nonphysical oscillations and has second-order accuracy. Numerical experiments are given to verify the performance of the scheme. Copyright (c) 2013 John Wiley & Sons, Ltd.

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

nonstandard covolume
mass conservation
stability

convection-diffusion
weighted upwind fvem
high-order accuracy


A programming methodology for designing block recursive algorithms In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem in its matrix form. Next, we formulate a matrix equation for the matrix of the computational problem. Then, we try to find a solution of the matrix equation such that the solution is composed of simple matrices. Finally, we recursively factorize the subproblem to obtain a tensor product formula representing an algorithm for the given problem. In this methodology, the operations of a tensor product formula can be mapped to language constructs of high-level programming languages. That is, we can generate computer programs, including programs for parallel computers and distributed-memory multiprocessors, from tensor product formulas. In this paper, we use the parallel prefix problem and the discrete Fourier transform problem as examples to illustrate the methodology and derive various parallel prefix and fast Fourier transform algorithms.

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

programming methodology
tensor product
parallel prefix
fast fourier transform

block recursive algorithm
parallel processing
distributed processing


Control approach for legged robots with fast gaits A constructive control approach is proposed for legged robots with fast dynamic gaits. These systems interact intermittently with the environment. Our approach is based on Controlled Limit Cycles (CLC) and stabilizes periodic system trajectories. The designed control law generates (on-line) the desired trajectories and control input.

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

hopping robots
legged robots control
passive feedback systems


football animations for mobile phones Animations, based on a streamed model, are a cost and bandwidth efficient way to transmit data to an end-user on the mobile network. They might also be enlightening and enjoyable to view. An experiment was performed to contrast different animations and video codings in terms of their cognitive and emotional effectiveness for spectating a football game on the mobile phone. Analysis shows that different renderings of the same model give differential results for understandability and enjoyment of a game. The conclusion is that more advanced renderings might be able to give an individually optimized blend between emotional and cognitive effectiveness.

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

tracking
video coding
displays
mobile communications


COMPLETE SPACE QUANTUM CHEMISTRY BY MULTIRESOLUTION MULTIWAVELET BASIS SET Quantum chemistry program based on Multiresolution Multiwavelet (MRMW) basis set is much simpler and can be more efficient than the conventional one based on Gaussian basis set in molecular geometry optimization because the Hellmann Fynman Theorem (HFT) holds for the complete space which MRMW provides. It is numerically shown that large Gaussian basis sets can provide the chemical information with chemical accuracy for very small molecular systems despite the incompleteness of their basis set. However, even for the relatively small size molecule of CH4, the error from the basis set incompleteness results in an error larger than an acceptable chemical accuracy. The advantage of the MRMW complete basis set in vibrational analysis is also discussed.

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

complete space
quantum chemistry
geometry optimization
multiresolution multiwavelet


Corrections for systematic boundary effects in pixel-based area counts Consider digitising a binary pattern on a regular lattice, so that each "face" or pixel of the lattice is given just one of the two colours in the pattern. If the pixelation algorithm is symmetric, meaning that a pixel which straddles the boundary between two colours inherits the colour that predominates in that particular face, then the systematic errors in pixel counts are generally small. However, they can be significant for asymmetric pixelations. In this paper we provide explicit corrections for systematic errors in area estimates based on asymmetric pixelation algorithms. The corrections are derived by interpreting systematic error as the bias in a statistical estimation problem, and arguing that the pattern was placed into the lattice in a stochastically uniform way. We suggest two sorts of correction: first, a "local" adjustment based on tracking the boundary and accumulating small amendments along the way; and secondly, a "global" correction based on parametric knowledge of the type of shape that is being digitised. (C) 1999 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

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

convex set
curvature
digitised image
gridded data


The role of experience in the interpretation of noun-noun combinations Gagne and Shoben's (J Exp Psychol Learn Mem Cogn 23:71-87, 1997) Competition Among Relations In Nominals (CARIN) theory maintains that the interpretation of modifier-noun combinations is influenced primarily by how the modifying noun has been used in the past. As support for this theory, they found that modifiers typically associated with the instantiated relation are interpreted reliably faster than those whose modifiers are less frequently associated with the relation. The CARIN theory explains this phenomenon by proposing that people store statistical distributions regarding the frequency with which modifying nouns have combined with each relation in the past. However, we maintain that an association between relation frequency and response time does not imply a causal influence. In this study we explore whether the effects observed by Gagne and Shoben were caused by the influence of relation frequency per se. Two experiments were conducted in which experiential knowledge about the modifier was controlled. The first experiment involved combinations whose modifiers were relatively rare and the second involved the presentation of nouns without a modifier-head syntax. In both of these experiments, knowledge about historical modifier usage was irrelevant. Our results show that correlations between modifier preference and response time persist even in situations where a knowledge of the modifier's history is not available. These findings provide converging evidence that the relationship between relation frequency and response time is not a causal one. Instead, an understanding of the relationship between modifier properties and usage, as appropriate to the given context, may be the dominant influence on interpretation in many circumstances. In light of this, we propose an alternative account of the factors influencing ease of interpretation.

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

conceptual combination
noun-noun compounds


DETECTION OF DOUBLE MPEG-2 COMPRESSION BASED ON DISTRIBUTIONS OF DCT COEFFICIENTS Detection of double compression in digital multimedia is considered to reveal the history of multimedia signal processing, which is very useful in digital forensics. In this paper, distributions of quantized DCT coefficients are analyzed in depth after double MPEG-2 compression with constant bit rate (CBR) mode, and a new algorithm is presented to detect double MPEG-2 compression based on convex patterns in the distribution of quantized DCT coefficients. In order to demonstrate the practical value of our proposed algorithm, two digital video cameras (DV) and two MPEG-2 software coders are utilized to simulate the general process of double MPEG-2 compression. Experiment results show that the proposed scheme can effectively detect doubly MPEG-2 compressed videos with CBR mode and the target output bit rate can vary in a large range.

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

digital video forensics
digital tampering
double mpeg-2 compression
quantization


Organizing Search Results with a Reference Map We propose a method to highlight query hits in hierarchically clustered collections of interrelated items such as digital libraries or knowledge bases. The method is based on the idea that organizing search results similarly to their arrangement on a fixed reference map facilitates orientation and assessment by preserving a user's mental map. Here, the reference map is built from an MDS layout of the items in a Voronoi treemap representing their hierarchical clustering, and we use techniques from dynamic graph layout to align query results with the map. The approach is illustrated on an archive of newspaper articles.

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

search results
mental map
dynamic graph layout

voronoi treemaps
multidimensional scaling
edge bundling


Modeling the evaporation of a hydrocarbon feedstock in the convection section of a steam cracker A model has been developed allowing to simulate the flow boiling process of a hydrocarbon feedstock. For the calculation of the different horizontal two-phase flow regimes that evolve during flow boiling, use is made of the Volume Of Fluid (VOF) model that uses a Piecewise Linear Interface Calculation (PLIC) method to reconstruct the interface between both phases in each computational cell. In-house developed codes calculate the mass and energy transfer phenomena occurring during this flow boiling process. As such, an existing CFD code is completed with a newly developed complete evaporation model. The developed model is used to simulate the flow boiling process of a hydrocarbon feedstock in the tubes of a convection section heat exchanger of a steam cracker. The simulation results show a succession of horizontal two-phase flow regimes in agreement with the literature. (C) 2008 Elsevier Ltd. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O O O B O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B 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 B I O O O O O O O O O O O O O O O O O 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 SAT-based approach to separation logic The SAT-based approach to the decision problem for expressive, decidable, quantifier-free first-order theories has been investigated with remarkable results at least since 1993. One such theory, successfully employed in the formal verification of complex, infinite state systems, is Separation Logic (SL), which combines Boolean logic with arithmetic constraints of the form x - y x c, where x is , >=, =, or not equal. The SAT-based approach to SL was first proposed and implemented in 1999: the results in terms of performance were good, and since then a number of other systems for SL have appeared. In this paper we focus on the problem of building efficient SAT-based decision procedures for SL. We present the basic procedure and four optimizations that improve dramatically its effectiveness in most cases: (a) IS (2) preprocessing, (b) early pruning, (c) model reduction, and (d) best reason detection. For each technique we give an example of how it might improve the performance. Furthermore, for the first three techniques, we give a pseudo-code representation and formally state the soundness and completeness of the resulting optimized procedure. We also show how it is possible to check the satisfiability of valuations involving constraints of the form x - y < c using the Bellman-Ford algorithm. Lastly, we present an extensive comparative experimental analysis, showing that our solver TSAT++, built along the lines described in this paper, is currently the state of the art on various classes of problems, including randomly generated, hand-made, and real-world instances.

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 data collection for evaluating collaborative systems The purpose of this Special Interest Group (SIG) session is to share lessons learned about using automated logging techniques to collect data for evaluating collaborative (multi-user) systems. Automated logging techniques are frequently used in evaluating the human-computer interaction of single-user systems. There has been much less experience in using logging techniques for evaluating collaborative systems. We will discuss logging to collect data that are useful for evaluating collaborative systems.

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

automated logging tools
evaluation
metrics


Partial product reduction by using look-up tables for MN multiplier In this paper we present a new technique for partial product reduction in multiplication operations. The method is based on the construction of counter elements by means of look-up tables. The organization of these counters into reduction trees takes advantage of the inherent benefits of the integration of the memories and provides an alternative to classic operation methods. We show several reduction schemes that illustrate the proposed technique and describe hybrid examples that combine stored logic with classic combinational counters in order to adapt them better to each scheme. Our approach outperforms other schemes used for comparison. In this sense, not only an independent technology model has been established, but also an FPGA approximation has been implemented to measure such factors in a real-life technology platform.

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

computer arithmetic
arithmetic and logic structures
high speed arithmetic


Generalized predictive control using genetic algorithms (GAGPC) Generalized predictive controllers (GPCs) have been successfully applied in process control during the last decade. The performance of unstable, non-minimum-phase, or linear processes with dead-time are improved with this type of controller. However, the kind of process that can be controlled, or the kind of optimization method used to derive the controller, can present important restrictions: the performance index must be quadratic, and the model of the process must be linear and without actuator constraints. In other words, GPCs are limited when used to control real industrial processes. In this paper the genetic algorithms (GA) technique is used for optimization in GPCs. As this technique is robust under the presence of nonlinear structures in the cost function and constraints, it will be shown that a GPC optimized using the GA technique (GAGPC) can perform better in a real industrial environment.

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

predictive control
optimization
actuator constraints
genetic algorithms


an approach to refactoring of executable uml models Design erosion is one of the unavoidable effects of software evolution. This destructive phenomenon occurs also in the context of executable UML models, which are primary artefacts in Agile MDA software development methodology. Model refactorings are model transformations that can be applied with the aim of counteracting design erosion of UML models. In this paper, we present a systematic approach to specification of both executable UML model refactorings as well as associated bad smells in models. The application of this method is illustrated on an exemplary refactoring and a related bad smell. Moreover, we show how this transformation and detection of the bad smell can be implemented in Telelogic TAU, a state-of-the art UML CASE tool.

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


A use-rate based failure model for two-dimensional warranty We consider the problem of constructing probability model for product failure instances indexed by two scales, namely, age and usage. This is an important element in the analysis of two-dimensional warranty for automobiles. Specifically, we deal with models that apply to components or parts. The motivation for the same is stressed, and a model is proposed. The key feature of this model is: how use-rate affects life. Some existing models are then analyzed in the light of this feature, and the results are presented. Numerical examples are also provided to illustrate the application of this model in calculating warranty cost. (c) 2007 Elsevier Ltd. All rights reserved.

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

bivariate probability distribution
two-scales
automobile part


Simulation of plant cell shrinkage during drying A SPHDEM approach Plant based dried food products are popular commodities in global market where much research is focused to improve the products and processing techniques. In this regard, numerical modeling is highly applicable and in this work, a coupled meshfree particle-based two-dimensional (2-D) model was developed to simulate microscale deformations of plant cells during drying. Smoothed Particle Hydrodynamics (SPH) was used to model the viscous cell protoplasm (cell fluid) by approximating it to an incompressible Newtonian fluid. The visco-elastic characteristic of the cell wall was approximated to a Neo-Hookean solid material augmented with a viscous term and modeled with a Discrete Element Method (DEM). Compared to a previous work [44], this study proposes three model improvements: linearly decreasing positive cell turgor pressure during drying, cell wall contraction forces and cell wall drying. The improvements made the model more comparable with experimental findings on dried cell morphology and geometric properties such as cell area, diameter, perimeter, roundness, elongation and compactness. This single cell model could be used as a building block for advanced tissue models which are highly applicable for product and process optimizations in Food Engineering.

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

sph
dem
plant cells
numerical modeling
drying


Automatic eye feature extraction in human face images This paper presents a fuzzy-based method to extract the eye features in a head-shoulder image with plain background. This method is comprised of two stages, namely the face region estimation and the eye features extraction. In the first stage, a region growing method is adopted to estimate the face region. In the second stage, the coarse eye area is firstly determined based on the location of the nasion, then the deformable template algorithm is completed in two steps to extract the features of the eyes. Experimental results show the efficiency and robustness of this method.

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

face identification
integral projection
deformable templates


can we measure quality in design and do we need to? The new usability agenda is driving empirical and experimental studies into a growing range of quality criteria such as engagement, user experience, and aesthetics. Some see this as a positive move to theorise about the nature of good design qualities, and to objectively test such hypotheses on the new usability theme. However, others (e.g. [1], [2]) have argued for interpretation-based inquiry into user engagement and experience on the grounds that such phenomena can only be understood by investigations into contexts of use which defy quantitative approaches. Many in the design community would agree with them and go further to argue that quality in design is a matter of creativity and can not be measured or theorised per se ; instead, research should focus on understanding and improving the process of design. This panel will debate the tensions between these positions and explore possible common ground between them as a contribution towards the research agenda that is being debated in the DIS conference series.

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


Existence results for impulsive neutral stochastic functional integro-differential inclusions with nonlocal initial conditions ? In this paper, we prove the existence of mild solutions for a class of impulsive neutral stochastic functional integro-differential inclusions with nonlocal initial conditions and resolvent operators. Sufficient conditions for the existence are derived with the help of the fixed point theorem for multi-valued operators due to Dhage and the fractional power of operators. An example is provided to illustrate the theory.

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


performance evaluation of lan sorting algorithms We adapt several parallel sorting algorithms (block sorting algorithms) and distributed sorting algorithms for implementation on an Ethernet network with diskless Sun workstations. We argue that the performance of sorting algorithms on local area networks (LANs) should be analyzed in a manner that is different from the ways that parallel and distributed sorting algorithms are usually analyzed. Consequently, we propose an empirical approach which will provide more insight into the performance of the algorithms. We obtain data on communication time, local processing time, and response time (i.e. total running time) of each algorithm for various file sizes and different numbers of processors. Comparing the performance data with our theoretical analysis, we attempt to provide rationale for the behaviour of the algorithms and project the future behaviour of the algorithms as file size, number of processors, or interprocessor communication facilities change.

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

communication
network
sorting
analysis
parallel
size
performance
response time
implementation
project
data
algorithm
distributed
future
ethernet
change

processor
process
timing
performance evaluation
locality
blocking


Efficient multimedia coprocessor with enhanced SIMD engines for exploiting ILP and DLP A simple 8-way TTA coprocessor with cost-effective SIMD functional units can efficiently exploit ILP and DLP. Long vector capabilities built upon existing SIMD hardware achieves better cost-performance tradeoff. Unified scalar and vector approach eliminates the transformation overhead between them. The implicit data permutation mechanism can address the conventional permutation limitations of SIMD architecture.

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

scalar
vector
simd
tta
multimedia coprocessor


a new method for analysing feedback-based protocols with applications to engineering web traffic over the internet Most of the studies of feedback-based flow and congestion control consider only persistent sources which always have data to send. However, with the rapid growth of Internet applications built on TCP/IP such as the World Wide Web and the standardization of traffic management schemes such as Available Bit Rate (ABR) in Asynchronous Transfer Mode (ATM) networks, it is essential to evaluate the performance of feedback-based protocols using traffic models which are specific to dominant applications. This paper presents a method for analysing feedback-based protocols with a Web-user-like input traffic where the source alternates between "transfer" periods followed by "think" periods. Our key results, which are presented for the TCP protocol, are:(1) The goodputs and the fraction of time that the system has some given number of transferring sources are insensitive to the distributions of transfer (file or page) sizes and think times except through the ratio of their means. Thus, apart from network round-trip times, only the ratio of average transfer sizes and think times of users need be known to size the network for achieving a specific quality of service.(2) The Engset model can be adapted to accurately compute goodputs for TCP and TCP over ATM, with different buffer management schemes. Though only these adaptations are given in the paper, the method based on the Engset model can be applied to analyze other feedback systems, such as ATM ABR, by finding a protocol specific adaptation. Hence, the method we develop is useful not only for analysing TCP using a source model significantly different from the commonly used persistent sources, but also can be useful for analysing other feedback schemes.(3) Comparisons of simulated TCP traffic to measured Ethernet traffic shows qualitatively similar autocorrelation when think times follow a Pareto distribution with infinite variance. Also, the simulated and measured traffic have long range dependence. In this sense our traffic model, which purports to be Web-user-like, also agrees with measured traffic.

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

network
applications
input
web
traffic model
performance
asynchronous transfer mode
standardization
model
congestion control
paper
traffic
ethernet
management
method
systems
users
size
data
flow
feedback
internet

paging
simulation
engine
computation
timing
world wide web
evaluation
user
buffer management
persistence
long-range dependence
adapt
distributed
quality-of-service
scheme


an investigation of potential success factors for an introductory model-driven programming course In order to improve the course design of a CS1 model-driven programming course we study potential indicators of success for such a course. We explain our specific interpretation of objects-first. Of eight potential indicators of success, we have found only two to be significant at a 95\% confidence interval: math grade from high school and course work. The two significant indicators explain 24.2\% of the variation of the exam grade. The result concerning math grade contradicts earlier findings. We discuss four aspects of our research: the explanation power of the potential success indicators, the impact of our findings on teaching, limits of what to conclude from the available data, and the variety of the notion "objects-first". Because of the variety of interpretations of "objects-first", the present research is necessary as a supplement to earlier research in order to make generalizable results on the success factors for objects-first programming.

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

high school
order
research
interval
interpretation
variation
data
teaching
power
cs1
course design
explanation

program
aspect
model-driven programming
factor
object-oriented programming
predictors of success
model
objects-first


Computer-mediated communication use by the deaf and hard-of-hearing Discusses the potential of computer-mediated communication to reduce the social isolation experienced by many deaf and hard-of-hearing individuals. Communication presents significant problems for this group of people, some of which can be bridged by communicating via the Internet or e-mail, deaf Internet users were surveyed by use of a questionnaire. Their options, summarised in this paper emphasise the significance of computer-mediated communication for the deaf namely that interaction can be both less stressful and faster thereby reducing the isolation many feel due to the Physical constraints imposed by their deafness.

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

cybernetics
communications
computers
disabled people


A-MAC: Adaptive medium access control for next generation wireless terminals Next Generation (NG) wireless networks are envisioned to provide high bandwidth to mobile users via bandwidth aggregation over heterogeneous wireless architectures. NG wireless networks, however, impose challenges due to their architectural heterogeneity in terms of different access schemes, resource allocation techniques as well as diverse quality of service requirements. These heterogeneities must be captured and handled dynamically as mobile terminals roam between different wireless architectures. However, to address these challenges, the existing proposals require either a significant modification in the network structure and in base stations or a completely new architecture, which lead to integration problems in terms of implementation costs, scalability and backward compatibility. Thus, the integration of the existing medium access schemes, e.g., CSMA, TDMA and CDMA, dictates an adaptive and seamless medium access control (MAC) layer that can achieve high network utilization and meet diverse Quality of Service (QoS) requirements. In this paper, an adaptive medium access control (A-MAC) layer is proposed to address the heterogeneities posed by the NG wireless networks. A-MAC introduces a two-layered MAC framework that accomplishes the adaptivity to both architectural heterogeneities and diverse QoS requirements. A novel virtual cube concept is introduced as a unified metric to model heterogeneous access schemes and capture their behavior. Based on the Virtual Cube concept, A-MAC provides architecture-independent decision and QoS based scheduling algorithms for efficient multi-network access. A-MAC performs seamless medium access to multiple networks without requiring any additional modifications in the existing network structures. It is shown via extensive simulations that A-MAC provides adaptivity to the heterogeneities in NG wireless networks and achieves high performance.

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

adaptive medium access control
virtual cube concept

heterogeneous networks
heterogeneous qos requirements
next generation wireless networks


Objective Assessment of Sonographic: Quality II Acquisition Information Spectrum This paper describes a task-based, information-theoretic approach to the assessment of image quality in diagnostic sonography. We expand the Kullback-Leibler divergence metric J, which quantifies the diagnostic information contained within recorded radio-frequency echo signals, into a spatial-frequency integral comprised of two spectral components: one describes patient features for low-contrast diagnostic tasks and the other describes instrumentation properties. The latter quantity is the acquisition information spectrum (AIS), which measures the density of object information that an imaging system is able to transfer to the echo data at each spatial frequency. AIS is derived based on unique properties of acoustic scattering in tissues that generate object contrast. Predictions made by the J integral expression were validated through Monte Carlo studies using echo-signal data from simulated lesions. Our analysis predicts the diagnostic performance of any sonographic system at specific diagnostic tasks based on engineering properties of the instrument that constitute image quality.

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

breast lesions
ideal observer
kullback-leibler divergence


Some formulations for the group steiner tree problem The group Steiner tree problem consists of, given a graph G , a collection R R of subsets of V(G) V ( G ) and a cost c(e) c ( e ) for each edge of G , finding a minimum-cost subtree that connects at least one vertex from each R?R R ? R . It is a generalization of the well-known Steiner tree problem that arises naturally in the design of VLSI chips. In this paper, we study a polyhedron associated with this problem and some extended formulations. We give facet defining inequalities and explore the relationship between the group Steiner tree problem and other combinatorial optimization problems.

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

polyhedral combinatorics
integer programming formulations
branch-and-cut algorithms


Memetic feature selection algorithm for multi-label classification We present a memetic feature selection algorithm for multi-label classification. This method employs memetic procedures to refine the feature subsets found through GAs. This hybridization improves the multi-label classification performance compared to counterparts.

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

multi-label feature selection
memetic algorithm
local refinement


Understanding the mechanisms amenable to CRT response: from pre-operative multimodal image data to patient-specific computational models This manuscript describes our recent developments towards better understanding of the mechanisms amenable to cardiac resynchronization therapy response. We report the results from a full multimodal dataset corresponding to eight patients from the euHeart project. The datasets include echocardiography, MRI and electrophysiological studies. We investigate two aspects. The first one focuses on pre-operative multimodal image data. From 2D echocardiography and 3D tagged MRI images, we compute atlas based dyssynchrony indices. We complement these indices with presence and extent of scar tissue and correlate them with CRT response. The second one focuses on computational models. We use pre-operative imaging to generate a patient-specific computational model. We show results of a fully automatic personalized electromechanical simulation. By case-per-case discussion of the results, we highlight the potential and key issues of this multimodal pipeline for the understanding of the mechanisms of CRT response and a better patient selection.

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

cardiac resynchronization therapy
dyssynchrony indices
computational models


Matrix-product codes over Fq Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code C = [C-1 (...) C-M] (.) A consisting of all matrix products [c(1) (...) c(M)] (.) A. This generalizes the (u/u + v)-, (u + v + w/2u + v/u)-, (a + x/b + x/a + b + x)-, (u + v/u - v)- etc. constructions. We study matrix-product codes using Linear Algebra. This provides a basis for a unified analysis of /C/, d(C), the minimum Hamming distance of C, and C-perpendicular to. It also reveals an interesting connection with MDS codes. We determine /C/ when A is non-singular. To underbound d(C), we need A to be 'non-singular by columns (NSC)'. We investigate NSC matrices. We show that Generalized Reed-Muller codes are iterative NSC matrix-product codes, generalizing the construction of Reed-Muller codes, as are the ternary 'Main Sequence codes'. We obtain a simpler proof of the minimum Hamming distance of such families of codes. If A is square and NSC, C-perpendicular to can be described using C-1(perpendicular to),...,C-M(perpendicular to) and a transformation of A. This yields d(C-perpendicular to). Finally we show that an NSC matrix-product code is a generalized concatenated code.

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

ternary (u plus v + w vertical bar 2u+v vertical bar u)-construction


Dynamic characterization of bolted joints using FRF decoupling and optimization An experimental identification method is developed for structural joints. FRF decoupling method is used in the identification of joint stiffness and damping. The optimization algorithm improved the identified parameters significantly. Very good results are obtained for bolted beams. The method is found to be promising to be applied to more complex structures.

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

frf decoupling
experimental identification

joint dynamics
dynamics of bolted connections
structural joint modeling
joint parameter identification


Multi-phase algorithms for throughput maximization for real-time scheduling We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the versions of the problem discussed here were already treated by Bar-Noy et al. (Proc. 31st ACM STOC, 1999, pp. 622-631; http://www.eng.tau.ac.il/(similar to)amotz/). Our main contribution is to provide algorithms that do not use linear programming, are simple and much faster than the corresponding ones proposed in Bar-Noy et al. (ibid., 1999), while either having the same quality of approximation or improving it. More precisely, compared to the results of in Bar-Noy et al. (ibid., 1999), our pseudo-polynomial algorithm for multiple unrelated machines and all of our strongly-polynomial algorithms have better performance ratios, all of our algorithms run much faster, are combinatorial in nature and avoid linear programming. Finally, we show that algorithms with better performance ratios than 2 are possible if the stretch factors of the jobs are bounded; a straightforward consequence of this result is an improvement of the ratio of an optimal solution of the integer programming formulation of the JISP2 problem (see Spieksma, Journal of Scheduling, vol. 2, pp. 215-227, 1999) to its linear programming relaxation.

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

real-time scheduling
approximation algorithms


Knowledge extraction from Chinese wiki encyclopedias The vision of the Semantic Web is to build a 'Web of data' that enables machines to understand the semantics of information on the Web. The Linked Open Data (LOD) project encourages people and organizations to publish various open data sets as Resource Description Framework (RDF) on the Web, which promotes the development of the Semantic Web. Among various LOD datasets, DBpedia has proved a successful structured knowledge base, and has become the central interlinking-hub of the Web of data in English. However, in the Chinese language, there is little linked data published and linked to DBpedia. This hinders the structured knowledge sharing of both Chinese and cross-lingual resources. This paper deals with an approach for building a large-scale Chinese structured knowledge base from Chinese wiki resources, including Hudong and Baidu Baike. The proposed approach first builds an ontology based on the wiki category system and infoboxes, and then extracts instances from wiki articles. Using Hudong as our source, our approach builds an ontology containing 19 542 concepts and 2381 properties. 802 593 instances are extracted and described using the concepts and properties in the extracted ontology and 62 679 of them are linked to equivalent instances in DBpedia. As from Baidu Baike, our approach builds an ontology containing 299 concepts, 37 object properties, and 5590 data type properties. 1 319 703 instances are extracted from Baidu Baike, and 84 343 of them are linked to instances in DBpedia. We provide RDF dumps and SPARQL endpoint to access the established Chinese knowledge bases. The knowledge bases built using our approach can be used not only in Chinese linked data building, but also in many useful applications of large-scale knowledge bases, such as question-answering and semantic search.

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

semantic web
linked data
ontology
knowledge base


Using process-oriented holonic (PrOH) modelling to increase understanding of information systems Abstract.? Methodologies for understanding business processes and their information systems (IS) are often criticized, either for being too imprecise and philosophical (a criticism often levied at softer methodologies) or too hierarchical and mechanistic (levied at harder methodologies). The process-oriented holonic modelling methodology combines aspects of softer and harder approaches to aid modellers in designing business processes and associated IS. The methodology uses holistic thinking and a construct known as the holon to build process descriptions into a set of models known as a holarchy. This paper describes the methodology through an action research case study based in a large design and manufacturing organization. The scientific contribution is a methodology for analysing business processes in environments that are characterized by high complexity, low volume and high variety where there are minimal repeated learning opportunities, such as large IS development projects. The practical deliverables from the project gave IS and business process improvements for the case study company.

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

business process
modelling
is development projects

systems thinking
problem structuring methods


consistency and correctness of duplicate database systems Solutions to the duplicate database update problem are considered, and a formal validation technique using the theory of L systems is developed and applied to the problem. The paper shows some particular solutions but is primarily concerned with general properties of the problem, convenient representational techniques, and formal proof procedures which are general enough to apply to this and to a number of other problems in parallel processing and synchronization.

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

parallel processing
systems
synchronization
correctness
theory
general
consistency
paper
database
update


A locality analysis on purchasing helper at e-commerce webpage - The example in TW, CN, MO and HK The webpage is often one of the key factors that determine whether or not the browsers will stay. Limited webpage space should be utilized to design the optimal structure of layout in order to offer the important message, increase the surfing, and, furthermore, fully stimulate the click-through rate. Based on content analysis method, this study took female shopping websites as examples to categorize the major purchasing helper from most websites and further obtains the common principles of layout at e-commerce webpage; the layout of purchasing helper as well as the correlation analysis between purchasing helper and product categories are also analyzed. These common principles actually provide position-oriented characteristics that could offer guidelines for planning e-commerce webpage. (C) 2010 Elsevier Ltd. All rights reserved.

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

e-commerce
webpage layout
shopping sites


Adaptive conjugate gradient algorithm for perceptron training An adaptive algorithm for function minimization based on conjugate gradients for the problem of finding linear discriminant functions in pattern classification is developed. The algorithm converges to a solution in both consistent and inconsistent cases in a finite number of steps on several datasets. We have applied our algorithm and compared its performance with the adaptive versions of the Ho-Kashyap procedure (AHK). We have also compared the batch version of the algorithm with the batch mode AHK. The results show that the proposed adaptive conjugate gradient algorithm (CGA) gives vastly superior performance in terms of both the number of training cycles required and the classification rate. Also, the batch mode CGA performs much better than the batch mode AHK.

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

conjugate-gradient
linear separability
linear inequalities


wireless link scheduling under a graded sinr interference model In this paper, we revisit the wireless link scheduling problem under a graded version of the SINR interference model. Unlike the traditional thresholded version of the SINR model, the graded SINR model allows use of "imperfect links", where communication is still possible, although with degraded performance (in terms of data rate or PRR). Throughput benefits when graded SINR model is used instead of thresholded SINR model to schedule transmissions have recently been shown in an experimental testbed. Here, we formally define the wireless link scheduling problem under the graded SINR model, where we impose an additional constraint on the minimum quality of the usable links, (expressed as an SNR threshold ? Q ). Then, we present an approximation algorithm for this problem, which is shown to be within a constant factor from optimal. We also present a more practical greedy algorithm, whose performance bounds are not known, but which is shown through simulation to have much better average performance than the approximation algorithm. Furthermore, we investigate, through both simulation and implementation on an experimental testbed, the tradeoff between the minimum link quality threshold ? Q and the resulting network throughput.

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


HOW NOT TO DEMARCATE COGNITIVE SCIENCE AND FOLK PSYCHOLOGY - A RESPONSE TO PICKERING AND CHATER Pickering and Chater (P&C) maintain that folk psychology and cognitive science should neither compete nor cooperate. Each is an ''independent enterprise,'' with a distinct subject matter and characteristic modes of explanation. P&C's case depends upon their characterizations of cognitive science and folk psychology. We question the basis for their characterizations, challenge both the coherence and the individual adequacy of their contrasts between the two, and show that they waver in their views about the scope of each. We conclude that P&C do not so much discover as create the gap they find between folk psychology and cognitive science. It is an artifact of their implausible and unmotivated attempt to demarcate the two areas, and of the excessively narrow accounts they give of each.

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


On a redundant repairable system with switching failure: Bayesian approach System characteristics of a redundant repairable system are studied from a Bayesian viewpoint with different types of priors assumed for the unknown parameters. The system consists of two primary units, one standby unit, and one repair facility which is activated when switching to standby fails. Times to failure and times to repair of the operating units are assumed to follow exponential distributions. When time to failure and time to repair have uncertain parameters, a Bayesian approach is adopted to evaluate system characteristics. Monte Carlo simulation is used to derive the posterior distribution for the mean time to system failure and steady-state availability. Some numerical experiments are performed to illustrate the results derived in this paper.

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

availability
mean time to system failure
switching failure


geographical perspectives on location for location based services In this position paper the question of how location is employed in location based services (LBS) is considered. The importance of the notion of location is highlighted as a means of blurring the boundary between forms of experiences that are direct, and sensed in the environment, and those that are indirect, and learned from information. It is suggested that current methods for modeling location are limited by their lack of strong theoretical underpinning. To help bridge this gap the notions of Space, Place, and Region, from geographical theory, are proposed and implications of these for considering location in LBS outlined.

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


Generalized sequential kriging (GSK) for heterogeneous cell size: property modeling without matrices Sequential kriging avoids the use of matrices and resolves the issue of unstable solutions. It allows for stepwise ways to get joint estimations and cosimulations that are equivalent to the simultaneous solution. The approach is proposed as the solution for geocellular modeling with variable cell size from heterogeneous structural properties (HSPs) as required for modeling with structural constraints. Rock properties are controlled by structural domains, regions, and structural geology parameters. In some cases, rock properties are cross-correlated to formation thickness, curvature of structures, and other structural attributes. Cell thickness may be proportional to formation thickness and may enter as a conditioning property in the estimation of rock property parameters for simulation. In addition, cell volume controls the upscaling of covariance structures (i.e., regularized variograms). Structural properties are priorly modeled. Perturbation response functions (PRFs) are computed for each cell vs all possible sample point locations to facilitate sequential kriging. Upscaled PRFs are modified following conditional updating after each new data value is included in the estimation of parameters. Generalized sequential kriging is expected to become the main tool for real-time spatial modeling of 3D cellular models with HSP. In addition, some new developments related to the sequential kriging algorithm are included. Sequential kriging can be used for the estimation of parameters for simulation in the so-called unstructured grids.

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


Nonlinear normalization of input patterns to speaker variability in speech recognition neural networks The issue of input variability resulting from speaker changes is one of the most crucial factors influencing the effectiveness of speech recognition systems. A solution to this problem is adaptation or normalization of the input, in a way that all the parameters of the input representation are adapted to that of a single speaker, and a kind of normalization is applied to the input pattern against the speaker changes, before recognition. This paper proposes three such methods in which some effects of the speaker changes influencing speech recognition process is compensated. In all three methods, a feed-forward neural network is first trained for mapping the input into codes representing the phonetic classes and speakers. Then, among the 71 speakers used in training, the one who is showing the highest percentage of phone recognition accuracy is selected as the reference speaker so that the representation parameters of the other speakers are converted to the corresponding speech uttered by him. In the first method, the error back-propagation algorithm is used for finding the optimal point of every decision region relating to each phone of each speaker in the input space for all the phones and all the speakers. The distances between these points and the corresponding points related to the reference speaker are employed for offsetting the speaker change effects and the adaptation of the input signal to the reference speaker. In the second method, using the error back-propagation algorithm and maintaining the reference speaker data as the desirable speaker output, we correct all the speech signal frames, i.e., the train and the test datasets, so that they coincide with the corresponding speech of the reference speaker. In the third method, another feed-forward neural network is applied inversely for mapping the phonetic classes and speaker information to the input representation. The phonetic output retrieved from the direct network along with the reference speaker data are given to the inverse network. Using this information, the inverse network yields an estimation of the input representation adapted to the reference speaker. In all three methods, the final speech recognition model is trained using the adapted training data, and is tested by the adapted testing data. Implementing these methods and combining the final network results with un-adapted network based on the highest confidence level, an increase of 2.1, 2.6 and 3% in phone recognition accuracy on the clean speech is obtained from the three methods, respectively.

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

speaker variability
nonlinear normalization
speech recognition

input adaptation
inverse neural networks


Real-time analysis of intrusion detection alerts via correlation With the growing deployment of networks and the Internet, the importance of network security has increased. Recently, however, systems that detect intrusions, which are important in security countermeasures, have been unable to provide proper analysis or an effective defense mechanism. Instead, they have overwhelmed human operators with a large volume of intrusion detection alerts. This paper presents a fast and efficient system for analyzing alerts. Our system basically depends on the probabilistic correlation. However, we enhance the probabilistic correlation by applying more systematically defined similarity functions and also present a new correlation component that is absent in other correlation models. The system can produce meaningful information by aggregating and correlating the large volume of alerts and can detect large-scale attacks such as distributed denial of service (DDoS) in early stage. We measured the processing rate of each elementary component and carried out a scenario-based test in order to analyze the efficiency of our system. Although the system is still imperfect, we were able to reduce the numerous redundant alerts 5.5% of the original volume without distorting the meaning through two-phase reduction. This ability reduces the management overhead drastically and makes the analysis and correlation easy. Moreover, we were able to construct attack scenarios for multistep attacks and detect large-scale attacks in real time.

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

security
intrusion detection
correlation
reduction


An enhancement of timestamp-based password authentication scheme Yang and Shieh proposed a timestamp-based password authentication scheme. Chan and Cheng proved that it is insecure. In this paper, we will give a further cryptanalysis of the scheme, and give an easier attack on it. Finally, we will propose an improved scheme that can withstand both of the attacks. Compared to other authentication schemes, this improved scheme allows the host to authenticate a user only with his login request. The host need not keep any secret or information of the user.

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


An Approach Based on Generalized Functions to Regularize Divergent Integrals This article addresses weakly singular, hypersingular integrals, which arise when the boundary integral equation (BIE) methods are used for 3-D potential theory problem solutions. An approach based on the theory of distributions and the application of the second Green theorem has been explored for the calculation of such divergent integrals. The divergent integrals have been transformed to a form that allows easy and uniform calculation of weakly singular and hypersingular integrals. For flat boundary elements (BE), piecewise constants and piecewise linear approximations, only regular integrals over the contour of the BE have to be evaluated. Furthermore, all calculations can be done analytically, so no numerical integration is required. In the case of 3-D, rectangular and triangular BE have been considered. The behavior of divergent integrals has been studied in the context that the collocation point moves to the contour of the BE.

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

singular
regularization
boundary integral equations


an embedding of the acl2 logic in hol We describe an embedding of the ACL2 logic into higher-order logic. An implementation of this embedding allows ACL2 to be used as an oracle for higher-order logic provers.

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

formal methods
first-order logic
sound translation
proof oracle
hol4
verification
higher-order logic


MIFS-ND: A mutual information-based feature selection method We propose a greedy feature selection method using mutual information theory. The method uses featureclass and featurefeature mutual information. We use NSGA-II method to select an optimal feature subset. The accuracy of the proposed method is evaluated using multiple classifiers.

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