approximating a collection of frequent sets One of the most well-studied problems in data mining is computing the collection of frequent item sets in large transactional databases. One obstacle for the applicability of frequent-set mining is that the size of the output collection can be far too large to be carefully examined and understood by the users. Even restricting the output to the border of the frequent item-set collection does not help much in alleviating the problem.In this paper we address the issue of overwhelmingly large output size by introducing and studying the following problem: What are the k sets that best approximate a collection of frequent item sets? Our measure of approximating a collection of sets by k sets is defined to be the size of the collection covered by the the k sets, i.e., the part of the collection that is included in one of the k sets. We also specify a bound on the number of extra sets that are allowed to be covered. We examine different problem variants for which we demonstrate the hardness of the corresponding problems and we provide simple polynomial-time approximation algorithms. We give empirical evidence showing that the approximation methods work well in practice.

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

foundations of data mining
mining frequent itemsets


Galois connections between categories of L-topological spaces A Galois connection between two concrete categories A and B is a pair of concrete functors F : A -> B, G:B -> A such that {idy id : FG(Y) -> Y vertical bar Y is an element of B} is a natural trtransformationrom the functor F circle G to the identity functor on B and {idx : X -> GF(X) vertical bar X is an element of A} is a natural transformation from the identity functor on A to G circle F. In this paper, it is demonstrated that for any complete lattices L(1), L(2), every Galois connection between the category L(1) -Top of L(1) -topological spaces and the category L(2)-Top of L(2)-topologically spaces is determined by an L(1)-topology Delta on L(2). Several examples of such Galois connections are given. Under a mild assumption, it is showed that every element of the L(1)-topology Delta is order-preserving. (c) 2004 Elsevier B.V. All rights reserved.

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

complete lattice
topological category
l-topological space


Visual measurement and tracking in laser hybrid welding This paper presents a novel system for the automatic analysis of a hybrid welding process. High-speed imaging and laser illumination are used to measure the regularity of electric arc frequency and flight directions of filler metal droplets. A fuzzy c-means clustering method is used to detect arcs and segment the video sequences. The droplets are localized by combining principal component analysis and a support vector machine classifier. The flight of a droplet is tracked using Kalman filtering. Experiments indicate that the system is able to track the flights of droplets and to determine the regularity of the arc frequency with a high accuracy if the imaging conditions are stable.

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

hybrid welding
support vector machine
principal component analysis

kalman tracking
fuzzy c-means clustering


tracking for context extraction in athletic events Personalisation of large scale athletic events requires camera-specific annotations to provide for reasoning about incidents being best viewed by specific cameras. This needs an automatic system for annotating athletes on the video streams, to be achieved by the use of person trackers. In this paper we present a novel approach towards combining scene segmentation, motion outliers, face and bib tracks into body hypotheses and tracking them across time. Preliminary evaluation results demonstrate the potential of the proposed approach.

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

face and text detection
person tracking
motion analysis


Exploiting domain-specific properties: Compiling parallel dynamic neural network algorithms into efficient code Domain-specific constraints can be exploited to implement compiler optimizations that are not otherwise feasible. Compilers for neural network learning algorithms can achieve near-optimal colocality of data and processes and near-optimal balancing of load over processors, even for dynamically irregular problems. This is impossible for general programs, but restricting programs to the neural algorithm domain allows for the exploitation of domain-specific properties. The operations performed by neural algorithms are broadcasts, reductions, and object-local operations only; the load distribution is regular with respect to the (perhaps irregular) network topology; changes of network topology occur only from time to time. A language, compilation techniques, and a compiler implementation on the MasPar MP-1 are described and quantitative results for the effects of various optimizations used in the compiler are shown. Conservative experiments with weight pruning algorithms yield performance improvements of 27 percent due to load balancing and 195 percent improvement is achieved due to data locality, both compared to unoptimized versions. Two other optimizations-connection allocation and selecting the number of replicates-speed programs up by about 50 percent and 100 percent, respectively. This work can be viewed as a case study in exploiting domain-specific information; some of the principles presented here may apply to other domains as well.

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

compiler optimizations
irregular problems

high-level parallel language
dynamic data structures
communication optimization


The Banzhaf index in complete and incomplete shareholding structures: A new algorithm In this global world, many firms present a complex shareholding structure with indirect participation, such that it may become difficult to assess a firms controllers. Furthermore, if there are numerous dominant shareholders, the control can be shared between them. Determining who has the most influence is often a difficult task. To measure this influence, game theory allows the modeling of voting games and the computing of the Banzhaf index. This paper firstly offers a new algorithm to compute this index in all structures and then suggests some modelisations of the floating shareholder. Then, our model is applied to a real case study: the French group Lafarge. This exemplary case demonstrates how the floats structure and hidden coalition can impact the power relationship between dominant shareholders.

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


Using digital terrain analysis modeling techniques for the parameterization of a hydrologic model This paper discusses the application of digital terrain analysis modeling techniques to the parameterization of a semi-distributed hydrologic model. Most current techniques for deriving physiographic parameters in watershed analyses, including those using commercial geographic information systems (GIS), are tedious, costly and time consuming. The demands of these techniques result in them usually being limited in practical application to deriving parameters at only one level of detail or for only one set of sub-basins. This paper presents a computerized interface (SLURPAZ) that was developed to combine the output of an established digital terrain analysis model (TOPAZ) with digital land cover data to derive all the necessary physiographic parameters required as input by a widely used semi-distributed hydrological model (SLURP). This interface makes it possible to derive physiographic parameters rapidly and accurately, at several different levels of detail and for varying numbers of sub-basins. This paper describes the methods by which the SLURPAZ interface integrates land cover data with the topographic parameters derived by TOPAZ from a digital elevation model (DEM). It also presents an example application of the interface to an intermediate-sized alpine basin in Yukon, Canada. Hydrological model outputs obtained using the computerized interface are compared with those obtained using manual techniques.

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

digital elevation model (dem)
grid
raster
automated techniques
spatial scale
drainage basins


a study of mass-mailing worms Mass-mailing worms have made a significant impact on the Internet. These worms consume valuable network resources and can also be used as a vehicle for DDoS attacks. In this paper, we analyze network traffic traces collected from a college campus and present an in-depth study on the effects of two mass-mailing worms, SoBig and MyDoom, on outgoing traffic. Rather than proposing a defense strategy, we focus on studying the fundamental behavior and characteristics of these worms. This analysis lends insight into the possibilities and challenges of automatically detecting, suppressing and stopping mass mailing worm propagation in a enterprise network environment.

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

network traces enterprise analysis behavior internet paper traffic worms propagation

challenge
network security
strategies
traffic analysis
environments
internet worms
effect
resource
attack


On-line scheduling of scalable real-time tasks on multiprocessor systems The computation time of scalable tasks depends on the number of processors allocated to them in multiprocessor systems. As more processors are allocated to a scalable task, the overall computation time of the task decreases but the total amount of processors' time devoted to the execution of the task, called workload, increases due to parallel execution overhead. In this paper, we propose a task scheduling algorithm that utilizes the property of scalable tasks for on-line and real-time scheduling. In the proposed algorithm, the total workload of all scheduled tasks is reduced by managing processors allocated to the tasks as few as possible without missing their deadlines. As a result, the processors in the system have less load to execute the scheduled tasks and can execute more newly arriving tasks before their deadlines. Simulation results show that the proposed algorithm performs significantly better than the conventional algorithm based on a fixed number of processors to execute each task. (C) 2003 Elsevier Inc. All rights reserved.

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

real-time task
on-line scheduling
multiprocessor system


Provably secure multisignatures in formal security model and their optimality We first model the formal security model of multisignature scheme following that of group signature scheme. Second, we prove that the following three probabilistic multisignature schemes based on a trapdoor permutation have tight security; PFDH (probabilistic full domain hash) based multisignature scheme (PFDH-MSS), PSS (probabilistic signature scheme) based multisignature scheme (PSS-MSS), and short signature PSS based multisignature scheme (S-PSS-MSS). Third, we give an optimal proof (general result) for multisignature schemes, which derives the lower bound for the length of random salt. We also estimate the upper bound for the length in each scheme and derive the optimal length of a random salt. Two of the schemes are promising in terms of security tightness and optimal signature length. In appendix, we describe a multisignature scheme using the claw-free permutation and discuss its security.

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

trapdoor one-way permutation (towp)
claw-free permutation (cfp)
random oracle model


A mixed 0-1 nonlinear optimization model and algorithmic approach for the collision avoidance in ATM: Velocity changes through a time horizon In this paper a mixed 0-1 nonlinear model for the Collision Avoidance problem in Air Traffic Management is presented. The aim of the problem consists of deciding the best strategy for an arbitrary aircraft configuration such that all conflicts in the airspace are avoided where a conflict is the loss of the minimum safety distance that two aircraft have to keep in their flight plans. The optimization model is based on geometric constructions. It requires knowing the initial flight plan (coordinates, angles and velocities in each period). The objective is the minimization of the acceleration variations when the aircraft are forced to return to the original flight plan once there is no aircraft in conflict. A linear approximation by using iteratively Taylor polynomials is presented to solve the problem in mixed 0-1 linear terms. An extensive computational experience for a testbed of large-scale instances is reported. (C) 2012 Elsevier Ltd. All rights reserved.

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

air traffic management (atm)
mixed 0-1 nonlinear optimization
taylor approximations


High-level library mapping for memories We present high-level library mapping, a technique that synthesizes a source memory module from a library of target memory modules. In this paper, we define the problem of high-level library mapping for memories, identify and solve the three subproblems associated with this task, and finally combine these solutions into a suite of two memory mapping algorithms. Experimental results on a number of memory-intensive designs demonstrate that our memory mapping approach generates a wide variety of cost-effective designs, often counter-intuitive ones, based on a user-given cost function, the target library, and the mapping algorithm used.

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

high-level synthesis
memory libraries
technology-mapping


Merit Factor of Chu Sequences and Best Merit Factor of Polyphase Sequences Chu sequences are a family of polyphase sequences that have perfect periodic autocorrelations and good aperiodic autocorrelations. It has previously been proved that the maximum offpeak (aperiodic) autocorrelation (in absolute value) of the Chu sequence of length n is asymptotically equal to 0.480261 root n. It has also been empirically observed that the merit factor of Chu sequences appears to grow like a constant times root n. In this note, we provide an analytic proof that the merit factor of the Chu sequence of length n is bounded below by a constant multiple of root n for all n. To the author's knowledge, this is the first time a family of polyphase sequences of all lengths has been proved to have merit factor growing at least like order root n.

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

autocorrelation
chu sequence
merit factor


A partitional clustering algorithm validated by a clustering tendency index based on graph theory Applying graph theory to clustering, we propose a partitional clustering method and a clustering tendency index. No initial assumptions about the data set are requested by the method. The number of clusters and the partition that best fits the data set, are selected according to the optimal clustering tendency index value.

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

unsupervised learning
clustering algorithms
clustering validity


Computing Issues of Asynchronous CA This work studies some aspects of the computational power of fully asynchronous cellular automata (ACA). We deal with some notions of simulation between ACA and Turing Machines. In particular, we characterize the updating sequences specifying which are "universal", i.e., allowing a (specific family of) ACA to simulate any Turing machine on any input. We also consider the computational cost of such simulations. Finally, we deal with ACA equipped with peculiar updating sequences, namely those generated by random walks.

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

asynchronous cellular automata
turing machines

turing universality
computational complexity


Formulation and procedure to treat a discrete particle model as a continuum Purpose - The pm-pose of this paper is to continue the path opened by previous researches that focused on the stress and deformation behaviour of discrete particle models, along with mechanical and morphological analyses. Design/methodology/approach - This work presents a formulation that allows the study of discrete particle models as if they were continuum. By knowing forces, torques, displacements and rotations that occur inside a particle media whenever a force is loading it, this formulation permits to obtain the stress, the torque, strain and rotation tensors of the media. Findings - These tensors are equivalent to the ones that would have been obtained by treating a discrete media as if it were a continuum. In addition, a procedure to apply the formulas to a numerical model has been detailed in the text. Finally, these formulas are compared to the one obtained from an energy balance approach to establish a connection between the forces and the increase of the energy produced inside the media. Originality/value - This paper presents a proposal of formulation to calculate the stress, torque, deformation and curvature tensor for discrete particle medias, welded or non-welded, in order to study them as if they were continuous.

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

stress (materials)
granular materials
discrete element method
finite element method
contact problems


Making retweeting social: The influence of content and context information on sharing news in Twitter Two studies investigate criteria of content and context on sharing news in Twitter. Both informational value and agent awareness influence the retweeting of news. The influence of awareness is mediated by the perceived importance of the news. Influences are moderated by the reference to a salient in-group.

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

agent awareness
informational value
news
retweeting
twitter


The anatomy of a cyber power Cyberspace, the ever-expanding manifestation of the pervasive information and communications infrastructure, is a rich environment for the projection of power and influence. Entities of all types nation-states, corporations, terrorist and criminal organizations, and non-profit groups are embedding critical aspects of their operations in cyberspace hoping to reap the benefits offered by the domain. Cyberspace is an equalizer. It offers all actors speed and reach, anonymity and protection, and the ability to create and participate in virtual economies and wield cyber weapons, all with a low buy-in cost. This drastically alters the power equation. The gap between major powers and lesser powers is shrinking; non-state actors could become cyber powers. This paper attempts to clarify the important notions of cyberpower and cyber power. It considers nation-states as well as non-state actors, and articulates the essential components and characteristics required to acquire and maintain cyberpower.

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

cyberpower
cyber power
anatomy
characteristics


Benchmarking e-government policy within the e-Europe programme Purpose - The paper aims to provide a benchmark study of the European Union (EU) e-government policy within the e-Europe programme. The main objective of the European strategy for the development of e-government was that the member states should ensure "online public services". To monitor this policy the European Commission defined two indicators. Design/methodology/approach - The European Commission developed a list of 20 basic public services. The Commission and Capgemini defined a framework to evaluate the online availability of each of the services in each of the EU member states, plus Norway, Iceland and Switzerland. Findings - The study finds that since 2001 a considerable improvement in online public service provision was measured, even so the 2004 result of 65 per cent online sophistication of public service delivery in the EU still shows an important gap with the 100 per cent objective, the result was considered a positive. When considering the different types of public services, income generating services including income tax, VAT and corporate tax are by far the most developed online. The new member countries seem to be only two years behind in the development of online public service. The most advanced countries exceed 80 per cent but seem to evolve to a "plateau". They have developed their most feasible services, demanding less effort, now only the "hard" ones are undeveloped, mostly services delivered at a decentralised level. Research limitations/implications - The study provides information on the online development of public services, i.e. the provision and interactivity of public services through the internet. It does not analyse the provision of services through other channels, neither the quality of the service delivery, nor the use or impact of these new ways of public service supply. Therefore a new EU e-government measurement system must change the focus from "availability" of e-government services, to "use" and desired positive "impact" of e-government programmes. Originality/value - This study provides the only available data measured scientifically over a longer period concerning the development of e-government in the EU.

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


Multiresolution fragile watermarking using complex chirp signals for content authentication This paper proposes a wavelet-domain multiresolution fragile watermarking scheme using an improved quantization-index-modulation (QIM) embedding technique. A secure embedding zone is exploited in our proposed scheme to reduce the false detection rate of Kundur's scheme. The frequency modulated (FM) complex chirp signal is employed as watermark. Both the real and the imaginary parts of the chirp signal are embedded simultaneously in a hierarchical manner. Unlike the conventional schemes, the proposed scheme does not require the original watermark for content integrity verification and quality assessment for the distorted watermarked content. The blind authentication process allows embedding of arbitrary FM chirp watermarks.

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

fragile watermarking
authentication
multiresolution
complex chirp signals


On linguistic representation of quantitative dependencies A description of quantitative dependencies by a novel type of fuzzy rules like If X is SMALL then Y is QUICKLY INCREASING is considered. The use of such rules for representation of perception based and numerical information about dependencies between variables is discussed. These rules are based on a granulation of directions of function change or slope values. Perception based information given by rules is represented by a fuzzy function Y(X). A method of solution of a fuzzy equation Y(X)=B is considered. A linguistic representation of given numerical information about dependencies between variables X and Y is based on a fuzzy partition of the domain of X on fuzzy intervals, on a linear approximations of data on these intervals and on a linguistic retranslation of results. A genetic algorithm is used for obtaining fuzzy partitions. In conclusion, the possible applications of proposed methods in petroleum industry are discussed.

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

fuzzy relation
granular model
soft computing
computing with words


unsupervised query segmentation using clickthrough for information retrieval Query segmentation is an important task toward understanding queries accurately, which is essential for improving search results. Existing segmentation models either use labeled data to predict the segmentation boundaries, for which the training data is expensive to collect, or employ unsupervised strategy based on a large text corpus, which might be inaccurate because of the lack of relevant information. In this paper, we propose a probabilistic model to exploit clickthrough data for query segmentation, where the model parameters are estimated via an efficient EM algorithm. We further study how to properly interpret the segmentation results and utilize them to improve retrieval accuracy. Specifically, we propose an integrated language model based on the standard bigram language model to exploit the probabilistic structure obtained through query segmentation. Experiment results on two datasets show that our segmentation model outperforms existing segmentation models. Furthermore, extensive experiments on a large retrieval dataset reveals that the results of query segmentation can be leveraged to improve retrieval relevance by using the proposed integrated language model.

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

language modeling
expectation maximization algorithm
qslm


a user interface for online assistance This paper describes a software user interface that enables programmers to provide and maintain online aids in an interactive system. Through the interface, users are given a set of consistent and unobtrusive aids that display summary information, command descriptions, explanations of error messages, and other online documentation. The interface is presented here from the views of both the end-user and the programmer.

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

software
views
users
online documentation
paper
online assistance
online
programmer

training
man-machine communication
computer assisted instruction
human factors
message
maintainability
ease of use
user interfaces
interfaces
end-user
consistency
interactive systems
documentation
errors
informal
explanation


XML in Enterprise Systems The widespread use of the XML formal for document representation and message exchange has influenced techniques for data integration in last years. A development of various XML languages, methods and, tools gave rise to so called XML technology. Enterprise Information Integration (EII) requires an accurate, precise and complete understanding of the disparate data sources, the needs of the information consumers, and how these map to the business concepts of the enterprise. Any integration takes place in context of an Enterprise Information System (EIS). In the paper we explain various approaches to EII, its architectures as well as its association to Enterprise Application Integration (EAI). We introduce basic features and issues of EII and justify why XML technology contributes to finding sufficiently powerful support for tools for enabling EII. In particular. a database approach. to XML provides a universal solution enabling to construct tools for achieving EII. In the paper we present some features of the XML technology, mainly its database part, and show how it is usable in EII.

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


Improving detection of surface discontinuities in visualforce control systems In this paper, a new approach to detect surface discontinuities in a visualforce control task is described. A task which consists in tracking a surface using visualforce information is shown. In this task, in order to reposition the robot tool with respect to the surface it is necessary to determine the surface discontinuities. This paper describes a new method to detect surface discontinuities employing sensorial information obtained from a force sensor, a camera and structured light. This method has proved to be more robust than previous systems even in situations where high frictions occur.

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

surface discontinuity recognition
visualforce fusion
visual robot guidance


Self-Adaptive System for Addressing Permanent Errors in On-Chip Interconnects We present a self-contained adaptive system for detecting and bypassing permanent errors in on-chip interconnects. The proposed system reroutes data on erroneous links to a set of spare wires without interrupting the data flow. To detect permanent errors at runtime, a novel in-line test (ILT) method using spare wires and a test pattern generator is proposed. In addition, an improved syndrome storing-based detection (SSD) method is presented and compared to the ILT method. Each detection method (ILT and SSD) is integrated individually into the noninterrupting adaptive system, and a case study is performed to compare them with Hamming and Bose-Chaudhuri-Hocquenghem (BCH) code implementations. In the presence of permanent errors, the probability of correct transmission in the proposed systems is improved by up to 140% over the standalone Hamming code. Furthermore, our methods achieve up to 38% area, 64% energy, and 61% latency improvements over the BCH implementation at comparable error performance.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 systems
digital systems
fault tolerance
forward error correction (fec)
integrated circuit interconnections
networks-on-chip (nocs)
reliability
self-testing


On fuzzy h-ideals in \(\Upgamma\)-hemirings By means of a kind of new idea, we introduce the concepts of some kinds of fuzzy h-ideals in \(\Upgamma\)-hemirings. Some new characterization theorems of these kinds of fuzzy h-ideals of a \(\Upgamma\)-hemiring are also given. In particular, we show that the h-hemiregular \(\Upgamma\)-hemirings can be described by using these kinds of fuzzy h-ideals.

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


rank-based dimension reduction for many-criteria populations Interpreting individuals described by a set of criteria can be a difficult task when the number of criteria is large. Such individuals can be ranked, for instance in terms of their average rank across criteria as well as by each distinct criterion. We therefore investigate criteria selection methods which aim to preserve the average rank of individuals but with fewer criteria. Our experiments show that these methods perform effectively, identifying and removing redundancies within the data, and that they are best incorporated into a multi-objective algorithm.

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

visualisation
multi-criteria decision making
feature selection


Digital forensics of printed source identification for Chinese characters Recently, digital forensics, which involves the collection and analysis of the origin digital device, has become an important issue. Digital content can play a crucial role in identifying the source device, such as serve as evidence in court. To achieve this goal, we use different texture feature extraction methods such as graylevel co-occurrence matrix (GLCM) and discrete wavelet transform (DWT), to analyze the Chinese printed source in order to find the impact of different output devices. Furthermore, we also explore the optimum feature subset by using feature selection techniques and use support vector machine (SVM) to identify the source model of the documents. The average experimental results attain a 98.64% identification rate which is significantly superior to the existing known method of GLCM by 1.27%. The superior testing performance demonstrates that the proposed identification method is very useful for source laser printer identification.

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

digital image forensics
graylevel co-occurrence matrix (glcm)
discrete wavelet transform (dwt)


Virtual reality aided visualization of fluid flow simulations with application in medical education and diagnostics Medical education, training and preoperative diagnostics can be drastically improved with advanced technologies, such as virtual reality. The method proposed in this paper enables medical doctors and students to visualize and manipulate three-dimensional models created from CT or MRI scans, and also to analyze the results of fluid flow simulations. Simulation of fluid flow using the finite element method is performed, in order to compute the shear stress on the artery walls. The simulation of motion through the artery is also enabled. The virtual reality system proposed here could shorten the length of training programs and make the education process more effective.

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

virtual reality simulator
ct scan
3d model reconstruction
shear stress computation
3d visualization
full 3d interaction


Chemical diversity approach for evaluating mechanistic relatedness among toxicological phenomena The CASE/MULTICASE structure activity relationship (SAR) system was used to assess a new procedure to investigate the mechanistic relatedness of various toxicological endpoints. The method consisted of predicting the activity of 10,000 randomly selected chemicals using validated and characterized SAR models from a variety of biological and toxicological endpoints. The prevalence of chemicals predicted to possess the ability to induce two or more toxicological effects simultaneously should provide a measure of the mechanistic relatedness of these phenomena. Eight toxicological endpoints were predicted and the results were compared to predictions based on an eye irritation SAR model. Allergic contact dermatitis demonstrated a 29.6% greater than expected overlap between expected and observed results (p<0.001). Similar results were seen for respiratory hypersensitivity (33.1%), sensory irritation (28.9%), cell toxicity (25.9%), and Ah receptor binding (19.8%). A lesser degree of overlap was seen between eye irritation and Salmonella mutagenicity (11.5%) and the inhibition of gap junction intercellular communication (6.7%). Moreover, a negative overlap, suggesting possibly an antagonistic phenomena, was observed between eye irritation and alpha 2 mu-induced nephropathy. These results indicate that this method can provide a useful tool to investigate mechanistic relatedness between diverse toxicological endpoints.

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

structure-activity relationship
case/multicase
mechanism


A projective invariant generalization of the de Casteljau algorithm A projective invariant generalization of the de Casteljau algorithm is described by using the cross ratio and an auxiliary line We describe the implicit form of the section conics obtained by the algorithm proposed in this paper Finally we show how to construct specific conic sections using this approach (C) 2010 Elsevier Ltd All rights reserved

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

projective invariance
rational bezier curves


Set space diagrams ? Set space diagrams (SSDs) can be more easily constructed than Venn diagrams. Usefulness of SSDs derives from relevance of Venn diagrams which are widespread. SSDs provide tidy overview on sets and their relations, even for more than four sets. Details can be easily verified, such as intersections or containment relations. Operations and equations among sets can be easily visualised and verified.

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

diagrammatic reasoning
set theory
boolean algebra
cardinalities
euler circles


Real-time data driven deformation using kernel Canonical Correlation Analysis Achieving intuitive control of animated surface deformation white observing a specific style is an important but challenging task in computer graphics. Solutions to this task can find many applications in data-driven skin animation, computer puppetry, and computer games. In this paper, we present an intuitive and powerful animation interface to simultaneously control the deformation of a large number of local regions on a deformable surface with a minimal number of control points. Our method learns suitable deformation subspaces from training examples, and generate new deformations on the fly according to the movements of the control points. Our contributions include a novel deformation regression method based on kernel Canonical Correlation Analysis (CCA) and a Poisson-based translation solving technique for easy and fast deformation control based on examples. Our run-time algorithm can be implemented on GPUs and can achieve a few hundred frames per second even for large datasets with hundreds of training examples.

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


visual structure-based web page clustering and retrieval Clustering and retrieval of web pages dominantly relies on analyzing either the content of individual web pages or the link structure between them. Some literature also suggests to use the structure of web pages, notably the structure of its DOM tree. However, little work considers the visual structure of web pages for clustering. In this paper ( i ) we motivate visual structure-based web page clustering and retrieval for a number of applications, ( ii ) we formalize a visual box model-based representation of web pages that supports new metrics of visual similarity, and ( iii ) we report on our current work on evaluating human perception of visual similarity of web pages and applying the learned visual similarity features to web page clustering and retrieval.

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

similarity measures
web page representation
web page retrieval


Kinematic and Elastostatic Design Optimisation of the 3-DOF Gantry-Tau Parallel Kinematic Manipulator One of the main advantages of the Gantry-Tau machine is a large accessible workspace/footprint ratio compared to many other parallel machines. The Gantry-Tau improves this ration further by allowing a change of assembly mode without internal link collisions or collisions between the links and end-effector. The reconfigurable Gantry-Tau kinematic design obtained by multi-objective optimisation according to this paper gives the following features: 3-D workspace/footprint ration is more than 3.19, lowest Cartesian stiffness in the workspace is 5/N mu m and no link collisions detected. The optimisation parameters are the support frame lengths, the actuator positions and the robot's arm lengths. The results comparison between the evolutionary complex search algorithm and gradient-based method used for the Gantry-Tau design in the past is also presented in this paper. The detailed statics model analysis of the Gantry-Tau based on a functionally dependency is presented in this paper for the first time. Both the statics model and complex search algorithm may be applied for other 3-DOF Hexapods without major changes. The existing lab prototype of the Gantry-Tau was assembled and completed at the University of Agder, Norway.

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


A dual-scale approach to model time-dependent deformation, creep and fracturing of brittle rocks A physically-motivated dual-scale modeling approach is proposed to model the time-dependent damage, deformation and fracturing behavior of heterogeneous brittle rocks during creep. The proposed model uses a microcrack-based damage constitutive law established at the elemental scale, in which the time-dependent degradation of elastic stiffness and damage-induced anisotropy are directly linked to microcrack growth. The evolution of mechanical heterogeneity is based on a Weibull distribution that captures the transition from distributed damage to localized failure. The key feature of the proposed model is to establish an adequate prediction of macroscopic creep behavior based on the microscopic kinetics of microcrack growth rather than the phenomenological material degradation laws adopted in previously-developed statistical models. The general capabilities of the proposed model are illustrated with numerical simulations of biaxial creep tests. The influences of differential stresses, heterogeneities and microscopic element sizes on creep behavior in brittle rocks are also examined. Results from such analyses indicate that the proposed model not only accurately replicates the trimodal phases of creep deformation and the associated temporal evolution of acoustic emission but also follows the progressive evolution of fracture modes and morphology commonly observed. Thus, subject to suitable calibration, this model provides an attractive virtual experimental tool to probe process-based understanding of complex long-term problems related to structures on an in geologic media.

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

damage evolution
microcracks
subcritical propagation
finite element method


concept based interactive retrieval for social environment Following the recent developments in social networking, there is an emerging interest to share experiences online with social peers through multimedia data. Consequently, exponential amount of multimedia information has been generated by everyday users and shared among social peers. As opposed to conventional digital archives, the user generated content archive does not confine to one particular domain and therefore semantic indexing of the content requires the creation of large number of training samples for each semantic query concept. Addressing this problem, we present an interactive multi-concept based browsing and retrieval framework using which users can construct high-level semantic queries based on mid-level primitive features. The proposed framework integrates innovative visualisation methodology developed for browsing, navigating and retrieving information from multimedia database. The framework is user centric and supports interactive formulation of high-level semantic queries for content retrieval using available content annotation. The performance of the proposed framework is evaluated using annotation based on automatic algorithms against Support Vector Machines, Multi-feature classification and particle swarm optimisation based relevance feedback techniques.

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

precision-recall
support vector machine
multimedia information retrieval
concept co-existence
multi-concept browser


Swarm intelligent approaches to auto-localization of nodes in static UWB networks Soft computing techniques for wireless sensor networks. Particle swarming optimization (PSO) algorithm for static localization of nodes. Swarm-based approaches can outperform standard geometrical algorithms. Hybrid particle swarming. The proposed hybrid PSO allows obtaining faster convergence.

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

two-stage maximum-likelihood (tmsl) method


Low resolution, degraded document recognition using neural networks and hidden Markov models We collected a large, real world database, containing degraded, old and faxed documents and present a comparison between two leading edge commercial software packages and human reading performance which shows quantitatively the huge performance gap between humans and machines, even on random character documents where no context can be used. This indicates room for possible improvements. We implemented an integrated segmentation and recognition algorithm using neural networks and hidden Markov models trained on the database and present results which show the superior performance of the algorithm.

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

document recognition
low resolution
neural networks
hidden markov models


Designing effective visualizations of habits data to aid clinical decision making Changes in daily habits can provide important information regarding the overall health status of an individual. This research aimed to determine how meaningful information may be extracted from limited sensor data and transformed to provide clear visualization for the clinicians who must use and interact with the data and make judgments on the condition of patients. We ascertained that a number of insightful features related to habits and physical condition could be determined from usage and motion sensor data.

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

visualization
decision making
habits data


Image-matching as a medical diagnostic support tool (DST) for brain diseases in children Imaging-matching is an important research area in imaging informatics. We have developed and evaluated a novel diagnostic support tool (DST) based on medical image matching using MR brain images. The approach consists of two steps, database generation and image matching. The database contains pre-diagnosed MR brain images. As the images are added to the database, they are registered to the 3D Talairach coordinate system. In addition, regions of interests (ROI) are generated, and image-processing techniques are used to extract relevant image parameters related to the brain and diseases from the ROIs and from the entire MR image. The second step is to retrieve relevant information from the database by performing image matching. In this step, the physician first submits a query image. The DST computes the similarity between the query image and each of the images in the database, and then presents the most similar images to the user. Since the database contains pre-diagnosed images, the retrieved cases tend to contain relevant diagnostic information. To evaluate the usefulness of the DST in a clinical setting, pediatric brain diseases were used. The database contains 2500 pediatric patients between ages 0 and 18 with brain Magnetic Resonance (MR) images of known brain lesions. A testbed was established at the Childrens Hospital Los Angeles (CHLA) for acquiring MR images from the PACS server of patients with known lesions. These images were matched against those in the DST pediatric brain MR database. An expert pediatric neuroradiologist evaluated the matched results. We found that in most cases, the image-matching method was able to quickly retrieve images with relevant diagnostic content. The evaluation method and results are given.

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

image-matching
neuroanatomy
medical image databases


Mobile phone as a platform for numerical simulation In this work numerical simulations performed on mobile devices equipped with ARM microprocessors are shown. Calculations include: light propagation in linear and nonlinear media based on one-dimensional Schrdinger equation and molecules reorientation in nematic liquid crystals. The purpose of this publication is to show advantages and disadvantages of using mobile devices as a platform for education and research. Discussion about software development is provided.

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

embedded system
mobile device
java me
cholesterics


Multiplicative Update Rules for Concurrent Nonnegative Matrix Factorization and Maximum Margin Classification The state-of-the-art classification methods which employ nonnegative matrix factorization (NMF) employ two consecutive independent steps. The first one performs data transformation (dimensionality reduction) and the second one classifies the transformed data using classification methods, such as nearest neighbor/centroid or support vector machines (SVMs). In the following, we focus on using NMF factorization followed by SVM classification. Typically, the parameters of these two steps, e. g., the NMF bases/coefficients and the support vectors, are optimized independently, thus leading to suboptimal classification performance. In this paper, we merge these two steps into one by incorporating maximum margin classification constraints into the standard NMF optimization. The notion behind the proposed framework is to perform NMF, while ensuring that the margin between the projected data of the two classes is maximal. The concurrent NMF factorization and support vector optimization are performed through a set of multiplicative update rules. In the same context, the maximum margin classification constraints are imposed on the NMF problem with additional discriminant constraints and respective multiplicative update rules are extracted. The impact of the maximum margin classification constraints on the NMF factorization problem is addressed in Section VI. Experimental results in several databases indicate that the incorporation of the maximum margin classification constraints into the NMF and discriminant NMF objective functions improves the accuracy of the classification.

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

joint optimization
nonnegative matrix factorization (nmf)
support vector machines (svms)


learning latent semantic relations from clickthrough data for query suggestion For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to the complexity of the Web structure and the ambiguity of users' inputs, most of the suggestion algorithms suffer from the problem of poor recommendation accuracy. In this paper, aiming at providing semantically relevant queries for users, we develop a novel, effective and efficient two-level query suggestion model by mining clickthrough data, in the form of two bipartite graphs (user-query and query-URL bipartite graphs) extracted from the clickthrough data. Based on this, we first propose a joint matrix factorization method which utilizes two bipartite graphs to learn the low-rank query latent feature space, and then build a query similarity graph based on the features. After that, we design an online ranking algorithm to propagate similarities on the query similarity graph, and finally recommend latent semantically relevant queries to users. Experimental analysis on the clickthrough data of a commercial search engine shows the effectiveness and the efficiency of our method.

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

efficiency
matrix factorization
analysis
web
design
query suggestion
paper
model
online
user
mining
recommendation
method
structure
accuracy
search engine
users
semantic
space
graph
queries
similarity
learning
complexity
algorithm
feature
clickthrough data
ranking
query

ambiguities
relevance
experimentation
information need
bipartite graph
web search
similarity propagation
effect


RECOGNIZING OVERLAPPED HUMAN ACTIVITIES FROM A SEQUENCE OF PRIMITIVE ACTIONS VIA DELETED INTERPOLATION The high-level recognition of human activity requires a priori hierarchical domain knowledge as well as a means of reasoning based on that knowledge. Based on insights from perceptual psychology, the problem of human action recognition is approached on the understanding that activities are hierarchical, temporally constrained and at times temporally overlapped. A hierarchical Bayesian network (HBN) based on a stochastic context-free grammar (SCFG) is implemented to address the hierarchical nature of human activity recognition. Then it is shown how the HBN is applied to different substrings in a sequence of primitive action symbols via deleted interpolation (DI) to recognize temporally overlapped activities. Results from the analysis of action sequences based on video surveillance data show the validity of the approach.

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

activity recognition
deleted interpolation

context-free grammars
bayesian networks
syntactic pattern recognition


the social and communication networks of a grassroots organization in kibera, kenya Shining Hope for the Community (SHOFCO) is a community-based organization in Kibera, Kenya focused on improving the lives of youth in the slum through grassroots, bottom-up initiatives. It is a unique organization in that it was founded and grew from within the slum, without any initiation from external organizations or institutions. Since its founding, SHOFCO has obtained a great deal of support from urban groups in Kenya, as well as individual supporters and small organizations in Europe and North America. Following interviews and observations of SHOFCO, this paper provides an overview of the social and communication network structures that have shaped the organization and have led to its growth and success. It is argued that other organizations can increase the likelihood of their own success through use of similar communication structures as those of SHOFCO with its international supporters and other groups in Kibera, as well as mimicking SHOFCO's focus on network heterogeneity.

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


Standardisation in medical image management A medical image without the relevant associated data is of no value. What is relevant depends on the use which is to be made of the image. The associated data may be divided into groups associated with the patient, the image data (array size, data type), the image itself (e.g. acquisition method), the requested imaging procedure to which it belongs, graphical, numerical and time information associated with the images, relevant results of other medical procedures, etc. Images, digital images and the associated data must be managed in an efficient manner in order to deliver appropriate patient care. In order to realise fully the potential of digital imaging, digital image data must be transmitted from acquisition units and stored in such a way as to allow appropriate access to health care practitioners in the imaging department, hospital and community. Standards exist for the formatting and transmission of image and related data (Digital Imaging and Communications in Medicine (DICOM). NEMA PS 3.1-PS3.12, The National Electrical Manufacturers Association, Rosslyn, VA, 1992, 1993, 1995; Health Level Seven, An Application Protocol for Electronic Data Exchange In Healthcare Environment, version 2.2, Health Level Seven Inc., Ann Arbor, MI, 1994; Comit European de Normalisation, Technical Committee 251: Medical Informatics) although further work is required in order to improve interoperability. There is some overlap in current standards, thus an important area is the agreement on the scope of the work to be done by different bodies. Standards are lacking in the areas of image management and presentation. Strategies for the efficient use of a memory hierarchy to achieve satisfactory archiving and access must be developed and this depends on the existence of appropriate descriptive data fields. Specific issues exist regarding security of image data. Key areas requiring immediate work are the profiling of descriptive data elements according to different clinical application needs in order to improve interoperability and the development of strategies for evolution from legacy systems to modern networked systems. The best way forward is to consolidate and refine existing specifications.

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

standards
image management
digital image

image display
image descriptive data
descriptive data profiles


Combining knowledge with many-valued logics During the process of knowledge acquisition from different experts it is usual that contradictions occur. Therefore strategies are needed for dealing with divergent statements and conflicts. We provide a formal framework to represent, process and combine distributed knowledge. The representation formalism is many-valued logic, which is a widely accepted method for expressing uncertainty, vagueness, contradictions and lack of information. Combining knowledge as proposed here makes use of the bilattice approach, which turns out to be very flexible and suggestive in the context of combining divergent information. We give some guidelines for choosing truth value spaces, assigning truth values and defining global operators to encode integration strategies.

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

semantic conflicts
distributed knowledge acquisition
signed logics
bilattices


Infinitely many positive solutions of the diophantine equation x(2)-kxy+y(2)+x=0 We prove that the equation x(2) - kxy+y(2) + x = 0 with k is an element of N+ has an infinite number of positive integer solutions x and y if and only if k = 3. For k = 3 the quotient x/y is asymptotically equal to (3 + root5)/2 or (3 - root5)/2. Results of the paper are based on data obtained via Computer Algebra System (DERIVE 5). Some DERIVE procedures presented in the paper made it possible to discover interesting regularities concerning simple continued fractions of certain numbers. (C) 2004 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 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


The use of runtime reconfiguration on FPGA circuits to increase the performance of the AES algorithm implementation This article presents an architecture that encrypts data with the AES algorithm. This architecture can be implemented on the Xilinx Virtex II FPGA family, by applying pipelining and dynamic total reconfiguration (DTR). The originality of our implementation is that it computes sequentially in the FPGA the Key and Cipher part of the AES algorithm. This dynamic reconfiguration implementation allows a good optimization of logic resources with a high throughput. This architecture employs only 11619 slices allowing a considerable economy of the resources and reaching a maximum throughput of 44 Gbps.

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

aes
fpga
dynamic total reconfiguration
throughput

reconfiguration controller
pipeline
registers
iterative looping
unrolling looping
metrics
latency
reconfiguration time


A methodology for the development of machining fixtures for components with complicated geometry At present, fixture design in industry is largely an experienced-based, ad-hoc process. In the case of the design of fixtures for complex components, this approach often results in a need for rework and consequent delays to production. Machining fixture design has been the subject of considerable research efforts; however most research activities have addressed one or a small number of interactions between fixture and other manufacturing system elements. In this paper, a novel fixture design methodology based on concurrent engineering is described. This methodology models physical space, loads, stress, deformation, thermal effects, vibration, etc., determines the loads and deflections arising from the locating, clamping and machining procedures, and estimates the resultant effects on component quality. To assist in the development of the methodology, the high technology industrial partner originally provided the researchers with a range of complex machined components of various sizes, incorporating many different features. The methodology has been tested against a range of successful and unsuccessful fixture designs supplied by the industrial partner.

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

virtual simulations
cad/cam
fea
kinematic


Young students using iPads: App design and content influences on their learning pathways The past few years have seen an array of new technological gadgets arrive on the education scene, perhaps the best known of these being Apple's i-Device range, particularly the iPad. Such devices have been described by some as 'game changers', and promoted as a key component to stimulating much-needed educational reform. However, history suggests the hype and rhetoric surrounding these technological innovations has failed to match the reality of their performance, in action. Some have attributed this failure to a lack of alignment by teachers of pedagogical models with the potential of technologies, while others argue that claims made are simply unrealistic sales hype. Regardless, schools continue to be seduced by these new technologies, purchasing ever increasing amounts based on the alleged learning promises they offer their students. This study presents an innovative approach to exploring student interaction with iPad apps, and is an attempt to begin to unpack factors that affect their learning pathways, in an effort to improve the educational potential of these popular devices. It focuses specifically on design and content features of apps selected by an experienced teacher to enhance literacy, numeracy and problem-solving capabilities of her 5 year old students. Findings reveal a complex matrix of influencing factors. These include the effect of embedded pedagogical scaffolds (eg., modelling, reflection time), corrective and formative feedback, text-to-speech functionality, imposed interaction parameters, impediments (eg., web links, advertisements, buying content) and the entertainment/education balance. Arguments are made for researchers, teachers and developers to work together and adopt methodologies such as that introduced in this article, to gather data to radically improve the design of apps used by young students for learning. (C) 2013 Elsevier Ltd. All rights reserved.

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


Management of hyperglycemia in hospitalized patients Hyperglycemia is a common occurrence in hospitalized patients, and several studies have shown a strong association between hyperglycemia and the risk of complications, prolonged hospitalization, and death for patients with and without diabetes. Past studies have shown that glucose management in the intensive care setting improves clinical outcomes by reducing the risk of multiorgan failure, systemic infection, and mortality, and that the importance of hyperglycemia also applies to noncritically ill patients. Based on several past observational and interventional studies, aggressive control of blood glucose had been recommended for most adult patients with critical illness. Recent randomized controlled trials, however, have shown that aggressive glycemic control compared to conventional control with higher blood glucose targets is associated with an increased risk of hypoglycemia and may not result in the improvement in clinical outcomes. This review aims to give an overview of the evidence for tight glycemic control (blood glucose targets <140 mg/dL), the evidence against tight glycemic control, and the updated recommendations for the inpatient management of diabetes in the critical care setting and in the general wards.

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

inpatient hyperglycemia
guidelines
intensive care unit


a comparative analysis of similarity measurement techniques through simreq framework The study of semantic similarity has long been an essential part of natural language processing. In informational retrieval, usage of similarity measurement is getting popularity day by day, but usage of similarity measurements in requirements engineering is not very common. Previously, we have presented SimReq, a Similarity Measurement Framework for requirements engineering. In this paper, we have used different similarity measurement techniques with SimReq framework, and perform a comparative analysis among those similarity measurement techniques. Results have shown that efficiency of Cosine similarity measurement is always better than rest of other similarity measurement techniques.

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

requirements similarity measurement simreq


Linear and Fractal Heart Rate Dynamics during Sleep at High Altitude Investigation with Textile Technology Objectives: To investigate the effects of hypoxia during sleep on linear and self-similar components of heart rate variability (HRV) in eight healthy subjects at high altitude on Mount Everest. Methods: ECG was monitored by using an innovative textile-based device, the MagIC system. For each subject three night recordings were performed at sea level (SL), at 3500 m and 5400 m above SL. RR Interval (RRI) was derived on a beat-by-beat basis from the ECG and the VLF, LF and HF spectral components and the LF/HF ratio were estimated. Short(alpha(1)) and long-term (alpha(2)) scale exponents as well as the recently proposed spectrum of self-similarity coefficients, alpha(n) were estimated by detrended fluctuation analysis (DFA). Results: With respect to SL, all HRV parameters but one (alpha(2)) were significantly modified at 3500 m. However, at 5400 m they tended to return to the SL values and this was in contrast with the increase in the hypobaric hypoxia and in the number of Central sleep apneas occurring at higher altitude. The only HRV index that displayed changes at 5400 m was the DFA alpha(n) spectrum, with alpha(n) values significantly lower than at SL for 20 < n < 50 and higher for 200 < n < 400, being n the box size. Conclusions: While the biological interpretation of these results is still in progress, our data indicates that the cardiac response to high altitude hypoxia during sleep can hardly be fully. explored by traditional HRV estimators only, and requires the additional support of more sophisticated indexes exploring also nonlinear and fractal features of cardiac variability.

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

heart rate variability
detrended fluctuation analysis
hypoxia


Multi-Spreader Routing for sparsely populated mobile ad hoc networks We propose Multi-Spreader Routing, a store-carry-forward routing scheme for sparsely populated mobile ad hoc networks. Multi-Spreader Routing includes Epidemic Routing and Two-Hop Forwarding as special cases, and it can manage trade-off between message delivery delay and resource consumption effectively. We analyze various performance measures of Multi-Spreader Routing with a recovery scheme called VACCINE, and we evaluate its performance. Further, through simulation experiments with real mobility trace data, we demonstrate that Multi-Spreader Routing shows stable performance in various network environments.

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

mobile ad hoc networks
recovery scheme
message delivery delay

store-carry-forward routing
performance trade-off


An object-oriented framework for finite element pavement analysis In this study, we developed an object-oriented (OO) framework with interactive graphics to assist pavement studies using finite element analysis (FEA). FEA has been proven to be effective in studying various pavement failure problems; however, it is time consuming and error prone to manually generate the load sequences where non-regular tire footprints, non-uniform tire-pavement contact stresses, and transverse wheel wander distributions are used. After FEA, extracting the deformations for failure analysis is necessary but tedious. The OO framework developed in this study handles the preprocessing and postprocessing tasks for the FEA of pavements. It has a graphical user interface and is platform independent. It was successfully used in developing a new criterion for characterizing pavement failures that involved approximately four hundred different FEA simulations.

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

framework
finite element analysis
pavement
failure
graphical user interface


An accurate adaptive NURBS curve interpolator with real-time flexible acceleration/deceleration control Parametric interpolation has been widely used in CNC machining because of its advantages over the traditional linear or circular interpolation. Many researchers focused on this field and have made great progress in the specific one, NURBS curve interpolation. These works greatly improved the CNC machining with constant feedrate, confined chord error and limited acceleration/deceleration. However, during CNC machining process, mechanical shocks to machine tool caused by the undesired acceleration/deceleration profile will dramatically deteriorate the surface accuracy and quality of the machined parts. This is, in most occasions, very harmful to machine tools. In this paper, an accurate adaptive NURBS curve interpolator is proposed with consideration of accelerationdeceleration control. The proposed design effectively reduces the machining shocks by constraining the machine tool jerk dynamically. Meanwhile, the constant feedrate is maintained during most time of machining process, and thus high accuracy is achieved while the feedrate profile is greatly smoothed. In order to deal with the sudden change of the acceleration/deceleration around the corner with large curvature, a real-time flexible acceleration/deceleration control scheme is introduced to adjust the feedrate correspondingly. Case study has been taken to verify the feasibility and advantages of the proposed design.

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


general behavioral thermal modeling and characterization for multi-core microprocessor design This paper proposes a new architecture-level thermal modeling method to address the emerging thermal related analysis and optimization problem for high-performance multi-core microprocessor design. The new approach builds the thermal behavioral models from the measured or simulated thermal and power information at the architecture level for multi-core processors. Compared with existing behavioral thermal modeling algorithms, the proposed method can build the behavioral models from given arbitrary transient power and temperature waveforms used as the training data. Such an approach can make the modeling process much easier and less restrictive than before, and more amenable for practical measured data. The new method is based on a subspace identification method to build the thermal models, which first generates a Hankel matrix of Markov parameters, from which state matrices are obtained through minimum square optimization. To overcome the overfitting problems of the subspace method, the new method employs an over-fitting mitigation technique to improve model accuracy and predictive ability. Experimental results on a real quad-core microprocessor show that ThermSID is more accurate than the existing ThermPOF method. Furthermore, the proposed overfitting mitigation technique is shown to significantly improve modeling accuracy and predictability.

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

architecture thermal modeling
thermal analysis
multicore processor


A general framework for component substitution image fusion: An implementation using the fast image fusion method Many image fusion algorithms have been developed while more algorithms are being developed to improve the ability of preserving spectral information. Starting from the analysis of component substitution (COS) image fusion technique, a novel general component substitution (GCOS) image fusion framework is proposed, which could be used in three aspects: (1) comparative analysis to existing algorithms, (2) providing a fast technique for current COS fusion methods, and (3) guiding the development of the new COS algorithm. A demonstrative implementation of GCOS is provided, which can employ radiometric properties of sensors in the process of image fusion. An experiment based on degraded IKONOS images was carried out to demonstrate the effectiveness of the method, and the fusion image processed through the proposed method shows a higher correlation coefficient (CC) and a universal image quality index (UIQI), and a lower relative difference (RD) with the reference image in comparison to those yielded through GramSchmidt (GS) spectral sharpening, principal component analysis (PCA), smoothing filter-based intensity modulation (SFIM) and additive wavelet transform (AWT) methods, and provides more reasonable spatial details by visual validation. Validation of the proposed algorithm proved the ability of the proposed GCOS framework.

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

remote sensing
spectral response function


Hamiltonicity of the WK-recursive network with and without faulty nodes Recently, the WK-recursive network has received much attention due to its many favorable properties such as a high degree of scalability. By K(d, t), we denote the WK-recursive network of level t, each of whose basic modules is a d-node complete graph, where d > 1 and t >= 1. In this paper, we first show that K(d, t) is Hamiltonian-connected, where d >= 4. A network is Hamiltonian-connected if it contains a Hamiltonian path between every two distinct nodes. In other words, a Hamiltonian-connected network can embed the longest linear array between any two distinct nodes with dilation, congestion, load, and expansion all equal to one. Then, we construct fault-free Hamiltonian cycles in K(d, t) with at most d - 3 faulty nodes, where d >= 4. Since the connectivity of K(d, t) is d - 1, the result is optimal.

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

wk-recursive
embedding
hamiltonian-connected
interconnection network
fault-tolerant embedding
hamiltonian cycle


Computations of non-isothermal viscous and viscoelastic flows in abrupt contractions using a finite volume method A finite volume method is applied to numerical simulations of steady isothermal and non-isothermal flows of fluids obeying different constitutive equations: Newtonian, purely viscous with shear-thinning properties (Carreau law) and viscoelastic Upper Convected Maxwell differential model whose temperature dependence is described by a William-Landel-Ferry equation. The flow situations concern various abrupt axisymmetric contractions from 2:1 to 16:1. Such flow geometries are involved in Polymer Processing operations. The governing equations are discretized on a staggered grid with an upwind scheme for the convective-type terms and are solved by a decoupled algorithm, stabilized by a pseudo-transient stress term and an elastic viscous stress splitting technique. The numerical results highlight the influence of temperature on the flow situations, and also the complex behaviour of the materials under non-isothermal conditions.

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


Intelligent leaky bucket algorithms for sustainable-cell-rate usage parameter control in ATM networks In this paper, we propose two intelligent leaky bucket algorithms for sustainable-cell-rate usage parameter control of multimedia transmission in asynchronous transfer mode networks. One is the fuzzy leaky bucket algorithm, in which a fuzzy increment controller (FIC) is incorporated with the conventional leaky bucket algorithm; the other is the neural fuzzy leaky bucket algorithm, where a neural fuzzy increment controller (NFIC) is added with the conventional leaky bucket algorithm. Both the FIC and the NFIC properly choose the long-term mean cell rate and the short-term mean cell rate as input variables to intelligently determine the increment value. Simulation results show that both intelligent leaky bucket algorithms have significantly outperformed the conventional leaky bucket algorithm, by responding about 160% faster when taking control actions against a nonconforming connection while reducing as much as 50% of the queueing delay experienced by a conforming connection. In addition, the neural fuzzy leaky bucket algorithm outperforms the fuzzy leaky bucket algorithm, in aspects of three performance measures such as selectivity, responsiveness, and queueing delay, especially when the traffic flow is bursty, dynamic, and nonstationary.

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

leaky bucket algorithm
neural fuzzy
usage parameter control

asynchronous transfer mode (atm)
fuzzy logic
sustainable cell rate


a preliminary evaluation of head and facial feature tracking for input on mobile devices This paper discusses the concept of using head and facial feature tracking as an input mechanism for mobile devices. We present our concept and ideas, along with preliminary findings from two prototype implementations. Suggestions for further work and implications are presented in the final sections of the paper.

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

text input
mobile device interfaces
computer vision


Constraint-based simulation of carton folding operations Cartons are a common means for packaging a variety of items. These are usually erected by dedicated machines which fold the carton into shape from a flat net. When there is a need to use new forms of cartons, dedicated machinery may not be appropriate and reconfigurable systems may be used instead. There is a need to simulate the erection process itself to ensure that this behaves as expected. This paper investigates the use of constraint-based techniques to produce such a simulation. The necessary commands are generated from the geometry of the carton net. Geometric constraints are imposed to ensure that the net remains intact and so resolve cases where loops of faces are present.

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


Fast and Accurate Alignment of Multiple Protein Networks Comparative analysis of protein networks has proven to be a powerful approach for elucidating network structure and predicting protein function and interaction. A fundamental challenge for the successful application of this approach is to devise an efficient multiple network alignment algorithm. Here we present a novel framework for the problem. At the heart of the framework is a novel representation of multiple networks that is only linear in their size as opposed to current exponential representations. Our alignment algorithm is very efficient, being capable of aligning 10 networks with tens of thousands of proteins each in minutes. We show that our algorithm outperforms previous approaches for the problem, and produces results that are more in line with current biological knowledge.

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

combinatorial proteomics
computational molecular biology
gene expression
gene networks
genetic variation
sequence analysis


a metrics system for quantifying operational coupling in embedded computer control systems One central issue in system structuring and quality prediction is the interdependencies of system modules. This paper proposes a novel technique for determining the operational coupling in embedded computer control systems. It allows us to quantify dependencies between modules, formed by different kinds of relationships in a solution, and therefore promotes a more systematic approach to the reasoning about modularity. Compared to other existing coupling metrics, which are often implementation-technology specific such as confining to the inheritance and method invocation relationships in OO software, this metrics system considers both communication and synchronization and can be applied throughout system design. The metrics system has two parts. The first part supports a measurement of coupling by considering individual relationship types separately. The quantification is performed by considering the topology of connections, as well as the multiplicity, replication, frequency, and accuracy of component properties that appear in a relationship. The second part provides a methodology for combining coupling by individual relationship types into an overall coupling, where domain specific heuristics and technology constraints are used to determine the weighting.

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

system functions
modularization and components
coupling measure


Curvilinear parabolic approximation for surface wave transformation with wave-current interaction The direct coordinate transformation method, which only transforms independent variables and retains Cartesian dependent variables, may not be an appropriate method for the purpose of simplifying the curvilinear parabolic approximation of the vector form of the wave-current equation given by Kirby [Higher-order approximations in the parabolic equation method for water waves, J. Geophys. Res. 91 (1986) 933-952]. In this paper, the covariant-contravariant tensor method is used for the curvilinear parabolic approximation. We use the covariant components of the wave number vector and contravariant components of the current velocity vector so that the derivation of the curvilinear equation closely follows the higher-order approximation in rectangular Cartesian coordinates in Kirby [Higher-order approximations in the parabolic equation method for water waves, J. Geophys. Res. 91 (1986) 933-952]. The resulting curvilinear equation can be easily implemented using the existing model structure and numerical schemes adopted in the Cartesian parabolic wave model [J.T. Kirby, R.A. Dalrymple, F. Shi, Combined Refraction/Diffraction Model REF/DIF 1, Version 2.6. Documentation and User's Manual, Research Report, Center for Applied Coastal Research, Department of Civil and Environmental Engineering, University of Delaware, Newark, 2004]. Several examples of wave simulations in curvilinear coordinate systems, including a case with wave-current interaction, are shown with comparisons to theoretical solutions or measurement data. (c) 2004 Elsevier Inc. All rights reserved.

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

curvilinear coordinates
wave equations
surface wave simulation
wave-current interaction