Optimizing redundant-data clustering for interactive walkthrough applications In modern walkthrough applications, storing massive datasets has become easy and inexpensive due to the availability of gigantic disk-based storage devices including hard drives, DVDs, and Blu-ray discs. However, fetching data from these devices for processing and rendering in interactive environments remains a bottleneck as data transfer speed has not kept pace with the sizes of both the secondary storage and main memory.Out-of-core algorithms are commonly used as a solution to transfer data efficiently from the secondary storage to main memory. Existing algorithms strongly rely on suitable data layout algorithms to reduce the data fetch time. However, in spite of all commonly used techniques, the total time required to seek and transfer data can still easily exceed the budget for total data fetch time. In this work, we propose an orthogonal approach to aggregate data and store them redundantly in multiple places in the storage device to ensure consistent data fetching performance. We pose this as a linear integer programming problem to minimize the amount of redundancy subject to the fetch time budget constraint. We provide an implementation on datasets with hundreds of millions of triangles to demonstrate how this data clustering can be created in practice and how the optimal solution is found.

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

out-of-core rendering
secondary storage devices
redundant data
linear programming
walkthrough rendering
seek time
transfer time


Encoding brain network response to free viewing of videos A challenging goal for cognitive neuroscience researchers is to determine how mental representations are mapped onto the patterns of neural activity. To address this problem, functional magnetic resonance imaging (fMRI) researchers have developed a large number of encoding and decoding methods. However, previous studies typically used rather limited stimuli representation, like semantic labels and Wavelet Gabor filters, and largely focused on voxel-based brain patterns. Here, we present a new fMRI encoding model to predict the human brains responses to free viewing of video clips which aims to deal with this limitation. In this model, we represent the stimuli using a variety of representative visual features in the computer vision community, which can describe the global color distribution, local shape and spatial information and motion information contained in videos, and apply the functional connectivity to model the brains activity pattern evoked by these video clips. Our experimental results demonstrate that brain network responses during free viewing of videos can be robustly and accurately predicted across subjects by using visual features. Our study suggests the feasibility of exploring cognitive neuroscience studies by computational image/video analysis and provides a novel concept of using the brain encoding as a test-bed for evaluating visual feature extraction.

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


A non-linear programming-based similarity reasoning scheme for modelling of monotonicity-preserving multi-input fuzzy inference systems In this paper, the zero-order Sugeno Fuzzy Inference System (FIS) that preserves the monotonicity property is studied. The sufficient conditions for the zero-order Sugeno FIS model to satisfy the monotonicity property are exploited as a set of useful governing equations to facilitate the FIS modelling process. The sufficient conditions suggest a fuzzy partition (at the rule antecedent part) and a monotonically-ordered rule base (at the rule consequent part) that can preserve the monotonicity property. The investigation focuses on the use of two Similarity Reasoning (SR)-based methods, i.e., Analogical Reasoning (AR) and Fuzzy Rule Interpolation (FRI), to deduce each conclusion separately. It is shown that AR and FRI may not be a direct solution to modelling of a multi-input FIS model that fulfils the monotonicity property, owing to the difficulty in getting a set of monotonically-ordered conclusions. As such, a Non-Linear Programming (NLP)-based SR scheme for constructing a monotonicity-preserving multi-input FIS model is proposed. In the proposed scheme, AR or FRI is first used to predict the rule conclusion of each observation. Then, a search algorithm is adopted to look for a set of consequents with minimized root means square errors as compared with the predicted conclusions. A constraint imposed by the sufficient conditions is also included in the search process. Applicability of the proposed scheme to undertaking fuzzy Failure Mode and Effect Analysis (FMEA) tasks is demonstrated. The results indicate that the proposed NLP-based SR scheme is useful for preserving the monotonicity property for building a multi-input FIS model with an incomplete rule base.

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

fuzzy inference system
similarity reasoning
analogical reasoning
fuzzy rule interpolation
monotonicity property
failure mode and effect analysis


array regrouping and structure splitting using whole-program reference affinity While the memory of most machines is organized as a hierarchy, program data are laid out in a uniform address space. This paper defines a model of reference affinity , which measures how close a group of data are accessed together in a reference trace. It proves that the model gives a hierarchical partition of program data. At the top is the set of all data with the weakest affinity. At the bottom is each data element with the strongest affinity. Based on the theoretical model, the paper presents k-distance analysis , a practical test for the hierarchical affinity of source-level data. When used for array regrouping and structure splitting, k -distance analysis consistently outperforms data organizations given by the programmer, compiler analysis, frequency profiling, statistical clustering, and all other methods we have tried.

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

analysis
group
paper
model
practical
distance
partition
array regrouping
reference affinity
structure
test
space
data
programmer

measurement
statistics
traces
arrays
addressing
hierarchies
organization
hierarchic
method
memorialized
compilation
program locality
profiles
volume distance
structure splitting
reuse signature
program transformation
cluster


An architecture for generic extensions We examine what is necessary to allow generic libraries to be used naturally in a multi-language, potentially distributed environment. Language-neutral library interfaces usually do not support the full range of programming idioms that are available when a library is used natively. We investigate how to structure the language bindings of the neutral interface to achieve a better expressibility and code re-use. We furthermore address how language-neutral interfaces can be extended with import bindings to recover the desired programming idioms. We also address the question of how these extensions can be organized to minimize the performance overhead that arises from using objects in manners not anticipated by the original library designers. Our approach is to treat a library as a software component and to view the problem as one of component extension. We use C++ as an example of a mature language, with libraries using a variety of patterns, and use the Standard Template Library as an example of a complex library for which efficiency is important. By viewing the library extension problem as one of component organization, we enhance software composibility, hierarchy maintenance and architecture independence. (c) 2009 Elsevier B.V. All rights reserved.

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

curiously reoccurring template pattern (crtp)


Sections, categories and keywords as interest specification tools for personalised news services Through an evaluation of system performance and user satisfaction for the Mercurio system, considers the general applicability and usefulness of different methods of specifying user interest for the general case of digital news services. Outlines the specific characteristics distinguishing such systems from more general information systems and discusses their effect. Proposes an evaluation blueprint for them starting from information retrieval procedures, existing work on search engine evaluation, and a close study of the working principles and the required evaluation according to the particular properties and conditions of the services under consideration. Presents and discusses actual evaluation results for system tests based both on real users and customised test cases. Conclusions cover the nature of the information handling tasks that digital news services are faced with, the relative merits of sections, categories and keywords with respect to this particular set of tasks, and the risks of careless application of recall and precision measures in systems such as these.

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

information systems
information retrieval


Factor versus palindromic complexity of uniformly recurrent infinite words We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n) + P(n + 1) <= Delta C(n) + 2, for all n epsilon N. For a large class of words this is a better estimate of the palindromic complexity in terms of the factor complexity than the one presented in [J.-P. Allouche, M. Baake, J. Cassaigne, D. Damanik, Palindrome complexity, Theoret. Comput. Sci. 292 (2003) 9-31]. We provide several examples of infinite words for which our estimate reaches its upper bound. In particular, we derive an explicit prescription for the palindromic complexity of infinite words coding r-interval exchange transformations. If the permutation pi connected with the transformation is given by pi(k) = r + 1 - k for all k, then there is exactly one palindrome of every even length, and exactly r palindromes of every odd length. (c) 2007 Elsevier B.V. All rights reserved.

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

palindrome
infinite words
palindromic complexity
factor complexity
uniformly recurrent words


Modeling and optimization of an adaptive dynamic load shedding using the ANFIS-PSO algorithm This paper presents a new optimal adaptive dynamic load-shedding scheme for a large steelmaking industry with cogeneration units. The proposed method is based on the initial rate of a frequency change (df(0)/dt) and is coordinated with tie-lines frequency protection relays. An adaptive network-based fuzzy inference system (ANFIS) with a new training algorithm is developed in order to increase the speed of the load-shedding scheme and to have an optimum response at different loading conditions. To overcome the ANFIS training difficulties, a new hybrid approach composed of particle swarm optimization and gradient decent algorithms is used. The training data set for the ANFIS is prepared by a transient stability analysis to determine the minimum load shedding for various operation scenarios without causing the tripping problem of cogeneration units. By using an accurate dynamic modeling of the Mobarakeh steelmaking company in Esfahan Regional Electrical Company network, the performance of the proposed method is compared with the traditional ANFIS learning algorithms, adaptive artificial neural network load-shedding scheme and transient stability analysis. Simulation results show the effectiveness of the proposed method.

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

artificial neural network
particle swarm optimization


Solving a separation-network synthesis problem by interval global optimization technique A novel method is presented here for solving certain classes of separation-network synthesis (SNS) problems, which are inherently non-linear, using branch-and-bound framework and linear programming. The proposed method determines effectively the structure and flowrates of the optimal separation network. The examined problem contains simple and sharp separators, mixers, and dividers; its aim is to produce three pure product streams from two three-component feed streams with minimal cost. The cost of the network is the sum of the costs of the separators and the cost of a separator is a concave function of its mass load. The mathematical programming model generated from the rigorous super-structure is non-linear. The goal of our work is to determine the optimum of the aforementioned model effectively. The splitting ratios of the dividers are handled as intervals. A B&B method operates on them. The cost functions of the separators are approximated with lower estimating functions. (C) 2013 Elsevier Ltd. All rights reserved.

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

separation synthesis
interval method
branch-and-bound framework


A hybrid fuzzy-GA algorithm for the integrated machine allocation problem with fuzzy demands A new hybrid algorithm method for facility location is improved. Fuzzy demand for location problem is considered. A genetic algorithm and a fuzzy simulation approach are applied for solving the problem. The efficiency and the effectiveness of the hybrid algorithm in examined using numerical examples.

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


An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks The connected dominating set (CDS) is widely used as a virtual backbone in mobile ad hoc networks. Although many distributed algorithms for constructing the CDS have been proposed, nearly all of them require two or more separated phases, which may cause problems such as long delay in the later phases when the network size is large. This paper proposes a Distributed Single-Phase algorithm for constructing a connected dominating set, DSP-CDS, in ad hoc networks. The DSP-CDS is an asynchronous distributed algorithm and converges quickly in a single phase. Each node uses one-hop neighborhood information and makes a local decision on whether to join the dominating set. Each node bases its decision on a key variable, strength, which guarantees that the dominating set is connected when the algorithm converges. The rules for computing strength can be changed to accommodate different application needs. The DSP-CDS adapts well to dynamic network topologies, upon which the algorithm makes only necessary local updates to maintain the CDS of the network. The performance of the DSP-CDS can be tuned by adjusting two main parameters. Extensive simulations have demonstrated that those parameters can affect the CDS size, the CDS diameter, and number of rounds for the algorithm to converge. Comparisons with other multiple-phase CDS algorithms have shown that the DSP-CDS converges fast and generates a CDS of comparable size.

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

connected dominating set
ad hoc networks

distributed clustering algorithm
dynamic topology


TAMS Analyzer - Anthropology as cultural critique in a digital age This article provides an overview of an open source qualitative coding and analysis program called TAMS Analyzer, where TANIS stands for Text Analysis Mark-up System. The article reviews the history and design of this software. This history focuses on transformations in the software that have allowed it to work with larger scale projects, more abstract analytic categories, and wider varieties of media. In examining the software design, the article reflects variously on the value of software-assisted qualitative research, issues of openness with respect to software standards and licensing, and transparency to the user. It concludes by looking at some future directions for software-assisted qualitative research and by noting contradictions in the qualitative marketplace that will likely shape what will be available to qualitative researchers.

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

qualitative analysis
coding software
mark-up systems


Coprime sampling for nonstationary signal in radar signal processing Estimating the spectrogram of non-stationary signal relates to many important applications in radar signal processing. In recent years, coprime sampling and array attract attention for their potential of sparse sensing with derivative to estimate autocorrelation coefficients with all lags, which could in turn calculate the power spectrum density. But this theoretical merit is based on the premise that the input signals are wide-sense stationary. In this article, we discuss how to implement coprime sampling for non-stationary signal, especially how to attain the benefits of coprime sampling meanwhile limiting the disadvantages due to lack of observations for estimations. Furthermore, we investigate the usage of coprime sampling for calculating ambiguity function of matched filter in radar system. We also examine the effect of it and conclude several useful guidelines of choosing configuration to conduct the sparse sensing while retain the detection quality.

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

coprime sampling
radar signal processing

non-stationary signal
short-time fourier transform


Ensemble methods for anomaly detection and distributed intrusion detection in Mobile Ad-Hoc Networks This paper examines the problem of distributed intrusion detection in Mobile Ad-Hoc Networks (MANETs), utilizing ensemble methods. A three-level hierarchical system for data collection, processing and transmission is described. Local IDSs (intrusion detection systems) are attached to each node of the MANET, collecting raw data of network operation, and computing a local anomaly index measuring the mismatch between the current node operation and a baseline of normal operation. Anomaly indexes from nodes belonging to a cluster are periodically transmitted to a cluster head, which averages the node indexes producing a cluster-level anomaly index. Cluster heads periodically transmit these cluster-level anomaly indexes to a manager which averages them. On the theoretical side, we show that averaging improves detection rates under very mild conditions concerning the distributions of the anomaly indexes of the normal class and the anomalous class. On the practical side, the paper describes clustering algorithms to update cluster centers and machine learning algorithms for computing the local anomaly indexes. The complete suite of algorithms was implemented and tested, under two types of MANET routing protocols and two types of attacks against the routing infrastructure. Performance evaluation was effected by determining the receiver operating characteristics (ROC) curves and the corresponding area under the ROC curve (AUC) metrics for various operational conditions. The overall results confirm the theoretical developments related with the benefits of averaging with detection accuracy improving as we move up in the node-cluster-manager hierarchy. (C) 2007 Elsevier B.V. All rights reserved.

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

ensemble methods
anomaly detection
intrusion detection

multiple classifier systems
distributed detection
mobile ad-hoc networks


The Foundational Work of Harrison-Ruzzo-Ullman Revisited The work by Harrison, Ruzzo, and Ullman (the HRU paper) on safety in the context of the access matrix model is widely considered to be foundational work in access control. In this paper, we address two errors we have discovered in the HRU paper. To our knowledge, these errors have not been previously reported in the literature. The first error regards a proof that shows that safety analysis for mono-operational HRU systems is in NP. The error stems from a faulty assumption that such systems are monotonic for the purpose of safety analysis. We present a corrected proof in this paper. The second error regards a mapping from one version of the safety problem to another that is presented in the HRU paper. We demonstrate that the mapping is not a reduction, and present a reduction that enables us to infer that the second version of safety introduced in the HRU paper is also undecidable for the HRU scheme. These errors lead us to ask whether the notion of safety as defined in the HRU paper is meaningful. We introduce other notions of safety that we argue have more intuitive appeal, and present the corresponding safety analysis results for the HRU scheme.

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

reducibility and completeness
computational complexity


A laboratory comparison of computer navigation and individualized guides for distal radius osteotomy This article presents the results of a multiuser, randomized laboratory trial comparing the accuracy and precision of image-based navigation against individualized guides for distal radius osteotomy (DRO).

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

individualized instruments
3d printing
computer-assisted surgery


Sage, guide, both, or even more? An examination of instructor activity in online MBA courses This study examined faculty characteristics and behaviors in 46 MBA courses conducted over a two-year period. We found that both formal instructor activities, referred to in the online learning literature as teaching presence, and informal instructor activities, known as immediacy behaviors, were positive predictors of student perceived learning and satisfaction with the educational delivery medium. We also found that instructor login intensity, the average amount of time spent per login session, was a negative predictor of perceived learning. Collectively, these findings suggest the need for instructors to structure and organize their courses beforehand so they can focus on efficient engagement with their students while the class is in session. Although teaching presence and instructor immediacy were significant predictors of delivery medium satisfaction, they explained only 6% of the variance. This finding should help instructors avoid taking unnecessary responsibility for students' attitudes toward online learning. The paper concludes with a discussion of implications for training of online instructors and the appropriate use of multilevel analytical tools in online learning and education research. (C) 2010 Elsevier Ltd. All rights reserved.

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

distributed learning environments
teaching/learning strategies
pedagogical issues
adult learning


Linear-scaling density-functional-theory calculations of electronic structure based on real-space grids: design, analysis, and scalability test of parallel algorithms We have implemented parallel algorithms for density-functional-theory (DFT) based electronic-structure calculations. These include a plane-wave based algorithm, a real-space-grid algorithm based on a high-order finite difference method, and a linear-scaling real-space algorithm using localized orbitals. Parallelization schemes are described for these algorithms, and the computational complexity and the communications involved in the resulting parallel algorithms are analyzed. Scalability tests of these algorithms on massively parallel computers show that the linear-scaling DFT algorithm is highly scalable. For a 110,592-atom gallium arsenide system on 1024 IBM SP3 processors, the parallel efficiency is as high as 93%. (C) 2001 Elsevier Science B.V. All rights reserved.

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

parallel computing
density functional theory
linear seating algorithm


new constructions of fuzzy identity-based encryption In this paper we construct two new fuzzy identity-based encryption (IBE) schemes in the random oracle model. Not only do our schemes provide public parameters whose size is independent of the number of attributes in each identity (used as public key) but they also have useful structures which result in more efficient key extraction and/or encryption than the random oracle version of Sahai and Water's fuzzy IBE scheme, considered recently by Pirretti et al. We prove that the confidentiality of the proposed schemes is relative to the Bilinear Decisional Bilinear Diffie-Hellman problem.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 identity-based encryption
efficient constructions


Debugging shared memory parallel programs using record/replay This paper presents a debugging aid for parallel program developers. The tool presented enables programmers to use cyclic debugging techniques for debugging non-deterministic parallel programs running on multiprocessor systems with shared memory. The solution proposed consists of a combination of record/replay with automatic on-the-fly data race detection. This combination enables us to limit the record phase to the more efficient recording of the synchronization operations, and checking for data races (using intrusive methods) during a replayed execution. As the record phase is highly efficient, there is no need to switch it off, hereby eliminating the possibility of Heisenbugs because tracing can be left on all the time.

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

record/replay
non-deterministic parallel programs


Gronwall's inequality on discrete fractional calculus In this paper, we introduce discrete fractional sum equations and inequalities. We obtain the equivalence of an initial value problem for a discrete fractional equation and a discrete fractional sum equation. Then we give an explicit solution to the linear discrete fractional sum equation. This allows us to state and prove an analogue of Gronwall's inequality on discrete fractional calculus. We employ a nabla, or backward difference: we employ the Riemann-Liouville definition of the fractional difference. As a result, we obtain Gronwall's inequality for discrete calculus with the nabla operator. We illustrate our results with an application that gives continuous dependence of solutions of initial value problems on initial conditions. (C) 2011 Elsevier Ltd. All rights reserved.

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

discrete fractional calculus
discrete fractional sum equation


An Effective Algorithm for Computing Energy-Efficient Broadcasting Trees in All-Wireless Networks Given a wireless network in which node positions are fixed and a specific source node r in the network, the minimum energy broadcasting problem (MEB) asks each node to adjust its transmission range to create a spanning tree rooted at r with minimum total energy. This problem is NP-complete for both general graphs and Euclidean space graphs. We propose a heuristic algorithm called Greedy Tradeoff (GT) for the MEB problem. We compare the broadcasting trees computed by our GT algorithm with the broadcasting trees computed by two previously proposed algorithms, BIP and IMBM, in terms of total power, tree height, and the number of leave nodes. Our results show that the performance of our GT algorithm is better than the performances of BIP and IMBM.

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

broadcast algorithm
energy efficiency
minimum-energy broadcast
performance analysis
wireless ad hoc network


towards one world web with hearsay3 In this paper, we present the key functionalities of HearSay 3, a non-visual web browser designed with the goal of improving web accessibility across the world. The featured functionalities include transparent support for multiple languages, collaborative labeling that harnesses the power of the social web, and a usable interface for handling dynamic web content.

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

blind users
dynamic content
collaborative accessibility
screen reader
multilingual browser


secondary navigation in software wizards The authors conducted a study of three approaches to secondary navigation in software wizards. Secondary navigation refers to user interface navigation controls that are in addition to the standard "Back" and "Next" buttons in a software wizard. We tested three secondary navigation controls: table of contents, tabs, and drop down menu. The goal of this study was to assess the benefits of secondary navigation controls in terms of user success with and user preference for the controls in the context of a software wizard. Thirty participants across three IBM sites tested prototypes of wizards with secondary navigation controls. We found that study participants were more successful with and preferred the table of contents secondary navigation control, participants continued to rely on the Back and Next buttons for navigation in the wizard, and participants preferred a secondary navigation control to having no secondary navigation control in a wizard.

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


Use of internally resonant energy transfer from the symmetrical to anti-symmetrical modes of a curved beam isolator for enhancing the isolation performance and reducing the source mass translation vibration: Theory and experiment This study aims to use the internally resonant energy transfer from the symmetrical to anti-symmetrical modes of a simply supported curved beam isolator to enhance the isolation performance and reduce the source mass vibration. The model is setup and based on the differential equation of the EulerBernoulli beam. The dynamic modal displacements and forces are then obtained from the model using a numerical integration method. The numerical and experimental results indicate that when the ratio of the resonant frequencies of the first bending symmetric and anti-symmetric modes is close to 2 and the excitation frequency is equal to the resonant frequency of the first symmetric mode, the contribution of the first anti-symmetric mode is significant, even though the curved beam and excitation are symmetrical. The net modal force induced by the first anti-symmetric mode acting on the ground is much smaller than that of the first symmetric mode because the two reaction forces at the beam ends induced by the first anti-symmetric mode are equal but opposite. Further, the source mass translational vibration is significantly reduced because it is placed on the node of the anti-symmetric mode.

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

curved panel
nonlinear vibration
structural dynamics
vibration isolation


neural network approach for intrusion detection Intrusion Detection System is based on the belief that an intruder's behavior will be noticeably different from that of a legitimate user and would exploit security vulnerabilities. This paper proposes a neural network approach to improve the alert throughput of a network and making it attack prohibitive using IDS. For evolving and testing intrusion the KDD CUP 99 dataset are used. The result of proposed approach is found to be more efficient in the area of Intrusion Detection and promises a good scope for further research.

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

neural network
intrusion detection system


Multi-view classification with cross-view must-link and cannot-link side information Side information, like must-link (ML) and cannot-link (CL), has been widely used in single-view classification tasks. However, so far such information has never been applied in multi-view classification tasks. In many real world situations, data with multiple representations or views are frequently encountered, and most proposed algorithms for such learning situations require that all the multi-view data should be paired. Yet this requirement is difficult to satisfy in some settings and the multi-view data could be totally unpaired. In this paper, we propose an learning framework to design the multi-view classifiers by only employing the weak side information of cross-view must-links (CvML) and cross-view cannot-links (CvCL). The CvML and the CvCL generalize the traditional single-view must-link (SvML) and single-view cannot-link (SvCL), and to the best of our knowledge, are first definitely introduced and applied into the multi-view classification situations. Finally, we demonstrate the effectiveness of our method in our experiments.

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

multi-view learning
without correspondence
unpaired multi-view data
cross-view side information


Clustering semantically related classes in a heterogeneous multidatabase system In this paper we present an approach for detecting semantically related classes in an object-oriented multidatabase system. This process is a vital one in the realization of multidatabase systems, as the semantic contents of local databases must be exploited before the integration process takes place. Each class in the multidatabase is enriched with information extracted from the schema definitions and database designers before it is processed to determine its semantic relevance to other classes in the multidatabase. The proposed approach is scalable in the sense that it is possible to classify several classes, based on their semantic content, at once. This is a vital contribution when considering the explosion of information resources available for integration in the presence of the Internet and the Web.

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

semantic heterogeneity
federated database systems
knowledge discovery


Expansion of transient operating data Real time operating data is very important to understand actual system response. Unfortunately, the amount of physical data points typically collected is very small and often interpretation of the data is difficult. Expansion techniques have been developed using traditional experimental modal data to augment this limited set of data. This expansion process allows for a much improved description of the real time operating response. This paper presents the results from several different structures to show the robustness of the technique. Comparisons are made to a more complete set of measured data to validate the approach. Both analytical simulations and actual experimental data are used to illustrate the usefulness of the technique.

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

transient data
orthogonal projection vectors


LogGP in theory and practice An in-depth analysis of modern interconnection networks and benchmarking methods for collective operations Accurate measurement and modeling of network performance is important for predicting and optimizing the running time of high-performance computing applications. Although the LogP family of models has proven to be a valuable tool for assessing the communication performance of parallel architectures, non-intrusive LogP parameter assessment of real systems remains a difficult task. Based on an analysis of accuracy and contention properties of existing measurement methods, we develop a new low-overhead measurement method which also assesses protocol changes in the underlying transport layers. We use the gathered parameters to simulate LogGP models of collective operations and demonstrate the errors in common benchmarking methods for collective operations. The simulations provide new insight into the nature of collective algorithms and their pipelining properties. We show that the error of conventional benchmark methods can grow linearly with the system size.

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

logp
loggp
benchmarking
collective operations


Group decision making based on multiple types of linguistic preference relations In this paper, we investigate group decision making problems with multiple types of linguistic preference relations. The paper has two parts with similar structures. In the first part, we transform the uncertain additive linguistic preference relations into the expected additive linguistic preference relations, and present a procedure for group decision making based on multiple types of additive linguistic preference relations. By using the deviation measures between additive linguistic preference relations, we give some straightforward formulas to determine the weights of decision makers, and propose a method to reach consensus among the individual preferences and the group's opinion. In the second part, we extend the above results to group decision making based on multiple types of multiplicative linguistic preference relations, and finally, a practical example is given to illustrate the application of the results. (c) 2007 Elsevier Inc. All rights reserved.

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

linguistic preference relation
aggregation operator
expectation function
linguistic label


An approach for constructing complex discriminating surfaces based on Bayesian interference of the maximum entropy In this paper we present a comprehensive Maximum Entropy (MaxEnt) procedure for the classification tasks. This MaxEnt is applied successfully to the problem of estimating the probability distribution function (pdf) of a class with a specific pattern, which is viewed as a probabilistic model handling the classification task. We propose an efficient algorithm allowing to construct a non-linear discriminating surfaces using the MaxEnt procedure. The experiments that we carried out shows the performance and the various advantages of our approach.

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

probability estimation
neural networks
hebbian learning


Fuzzy Logic Control Design for a Stair-Climbing Robot In the paper, a robot is designed to move up-and-down stairs for providing service. This robot consists of a main body, actuating system, roller chains, a front arm and a rear arm for assisting in moving up and down stairs. The actuating system includes two brushless DC motors for locomotion, two worm gears for torque magnification, and two DC motors to control arms. A DSP-based board acts as control center. Some rubber blocks attached to the roller chains are used to generate friction with ground and stairs for moving. A fuzzy logic controller integrates the outputs of DC bus current sensor and an inclinometer to steer the robot. Two walking experiments of moving up and down stairs with the rise/depth of 120/400 mm and 175/280 mm are shown in the taped pictures from videos to verify the proposed design.

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


Detection of obstacles on runways using ego-motion compensation and tracking of significant features ? This paper describes a method for obstacle detection on a runway for autonomous navigation and landing of an aircraft, in presence of extraneous features, such as tire-marks. An obstacle is defined as an object, which has a significant motion or height relative to the runway. Suitable features are extracted from the image and warping is performed, using approximately known camera and plane parameters, to compensate the ego-motion as far as possible. Residual disparity after warping is estimated using an optical flow algorithm. Features are tracked from frame to frame to obtain more reliable estimates of their motion. The residual disparities are used to correct the motion parameters with a robust method, where features having large residual disparities are signaled as obstacles. Nelson's optical flow constraint is proposed to separate moving obstacles from stationary ones. A Bayesian framework is used at every stage so that the confidence in the estimates can be determined.

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

computer vision
motion detection
aircraft navigation


Runge-Kutta discontinuous Galerkin methods with WENO limiter for the special relativistic hydrodynamics This paper develops the P-K-based Runge-Kutta discontinuous Galerkin (RKDG) methods with WENO limiter for the one-and two-dimensional special relativistic hydrodynamics, K = 1, 2, 3, which is an extension of the work [J.X. Qiu, C.-W. Shu, Runge-Kutta discontinuous Galerkin method using WENO limiters, SIAM J. Sci. Comput. 26 (2005) 907-929]. The WENO limiter for the RKDG method is adaptively implemented via two following steps: the "troubled'' cells are first identified by using a TVB modified minmod function, and then a new polynomial solution inside the "troubled'' cells is locally reconstructed to replace the RKDG solution by using the WENO technique based on the cell average values of the RKDG solution in the neighboring cells as well as the original cell averages of the "troubled'' cells. Several test problems in one and two dimensions are computed using the developed RKDG methods with WENO limiter. The computations demonstrate that our methods are stable, accurate, and robust in maintaining accuracy for simulating flows in the special relativistic hydrodynamics. (C) 2013 Elsevier Inc. All rights reserved.

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

discontinuous galerkin method
weno limiter
relativistic hydrodynamics


Background replacement using chromatic adaptation transform for visual communication ? ?? Chromatic adaptation, an ability of human vision, was implemented in video chat. Illuminant colors of landscapes are required by the function of chromatic adaptation. We estimated landscape illuminant colors based on the dichromatic reflection model. Background replacement using chromatic adaptation produces the sense of realism.

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

visual communication
background replacement
chromatic adaptation transform
dichromatic reflection model
video chat

illuminant color estimation
gray world assumption
subjective evaluation


Evapotranspiration estimation based on the SEBAL model in the Nansi Lake Wetland of China As a major component of the water budget of a wetland, evaporation has proven difficult to measure evapotranspiration accurately. This paper developed a scheme to assess actual evapotranspiration (ETa) across a range of land uses in Nansi Lake Wetland, China, using a remote sensing technique and the Surface Energy Balance Algorithm for Land (SEBAL) model. The estimation of pixel-scaled ETa was conducted via SEBAL using Landsat-7 ETM+ images, DEM and meteorological data. Compared with the recorded pan evaporation, the estimated evapotranspiration calculated by SEBAL agreed well with the results derived from pan observations. Then, the spatial distribution characteristic of daily evapotranspiration was analyzed by referencing the land-use map of 2000. It was found that the open water body and creed swamp were at a high evapotranspiration rate, while the crop land, grassland and rural residential land took the second place, and the overflow land, town constructed land and bare soil were at the lowest evapotranspiration rate, which accorded with the evapotranspiration theory. The research demonstrates the considerable potential of SEBAL model for estimation of spatial ETa with little ground-based weather data over large areas such as wetlands. Crown Copyright (c) 2010 Published by Elsevier Ltd. All rights reserved.

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

evapotranspiration
sebal
nansi lake
wetland


On the construction of permutation arrays via mappings from binary vectors to permutations An (n, d, k)-mapping f is a mapping from binary vectors of length n to permutations of length n + k such that for all x, y is an element of {0, 1}(n), d(H) (f (x), f (y)) >= d(H)(x, y) + d, if d(H) (x, y) (n + k)-d. In this paper, we construct an (n, 3, 2)-mapping for any positive integer n >= 6. An (n, r)-permutation array is a permutation array of length n and any two permutations of which have Hamming distance at least r. Let P (n, r) denote the maximum size of an (n, r)-permutation array and A (n, r) denote the same setting for binary codes. Applying (n, 3, 2)-mappings to the design of permutation array, we can construct an efficient permutation array (easy to encode and decode) with better code rate than previous results [Chang (2005). IEEE Trans inf theory 51:359-365, Chang et al. (2003). IEEE Trans Inf Theory 49:1054-1059; Huang et al. (submitted)]. More precisely, we obtain that, for n >= 8, P(n, r) >= A(n-2, r-3) > A(n-1, r-2) = A (n, r-1) when n is even and P(n, r) >= A(n-2, r-3) = A(n-1, r-2) > A(n, r-1) when n is odd. This improves the best bound A(n-1, r-2) so far [Huang et al. (submitted)] for n >= 8.

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


A practical subspace blind identification algorithm with reduced computational complexity We propose a practical blind channel identification algorithm based on the principal component analysis. The algorithm estimates (1) the channel order, (2) the noise variance, and then identifies (3) the channel impulse response, from the autocorrelation of the channel output signal without using the eigenvalue and singular-value decomposition. The special features of the proposed algorithm are (1) practical method to find the channel order and (2) reduction of computational complexity. Numerical examples show the effectiveness of the proposed algorithm.

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

principal component analysis
autocorrelation
computational complexity
channel order
noise variance


Numerical simulation of three dimensional non-Newtonian free surface flows in injection molding using ALE finite element method This paper presents a scheme for numerical simulation of non-Newtonian fluid flows in three-dimensional injection molding process using arbitrary LagrangianEulerian (ALE) finite element method. The proposed scheme is based on the pressure-stabilized fractional step algorithm for incompressible NavierStokes equations. In light of the ALE description, the moving free surface is accurately tracked in a self-adaptive manner by introduction of the moving least square (MLS) surface fitting method to fully determine the movement of the nodes on the moving free surface, meanwhile the mesh distortions are effectively alleviated. By virtue of the ALE method, a local remeshing strategy is developed for the mesh regeneration frequently required in moving free surface flow problems, so that the interpolation errors due to the mesh regeneration process are minimized and occur only limited to some local regions, and the computational cost for the remeshing process is reduced decisively. The numerical examples of three dimensional injection molding flows are presented to demonstrate the capabilities of the proposed numerical scheme.

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

ale
free surface flow
moving least square
local remeshing


Optimal edge coloring of large graphs Most of the general families of large considered graphs in the context of the so-called (Delta, D) problem - that is, how to obtain graphs with maximum order, given their maximum degree Delta and their diameter D-known up to now for any value of Delta and D, are obtained as product graphs, compound graphs, and generalized compound graphs. It is shown that many of these graph constructions have a minimum chromatic index Delta. Optimal edge coloring of large (Delta, D) graphs is interesting, for instance, for the design of large packet radio networks. Furthermore, a complete table with the best-known edge-colored large graphs is also presented for 2 less than or equal to D less than or equal to 10. (C) 1999 John Wiley & Sons, Inc. Networks 34: 61-65, 1999.

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

packet radio networks
edge coloring
chromatic index
large graphs
compound graphs


comparison of three one-question, post-task usability questionnaires Post-task ratings of difficulty in a usability test have the potential to provide diagnostic information and be an additional measure of user satisfaction. But the ratings need to be reliable as well as easy to use for both respondents and researchers. Three one-question rating types were compared in a study with 26 participants who attempted the same five tasks with two software applications. The types were a Likert scale, a Usability Magnitude Estimation (UME) judgment, and a Subjective Mental Effort Question (SMEQ). All three types could distinguish between the applications with 26 participants, but the Likert and SMEQ types were more sensitive with small sample sizes. Both the Likert and SMEQ types were easy to learn and quick to execute. The online version of the SMEQ question was highly correlated with other measures and had equal sensitivity to the Likert question type.

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

usability evaluation
post-task ratings
satisfaction measures
external validity


symbolic representation of text documents This paper presents a novel method of representing a text document by the use of interval valued symbolic features. A method of classification of text documents based on the proposed representation is also presented. The newly proposed model significantly reduces the dimension of feature vectors and also the time taken to classify a given document. Further, extensive experimentations are conducted on vehicles-wikipedia datasets to evaluate the performance of the proposed model. The experimental results reveal that the obtained results are on par with the existing results for vehicles-wikipedia dataset. However, the advantage of the proposed model is that it takes relatively a less time for classification as it is based on a simple matching strategy.

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

symbolic representation
text document
classification


An optimal multicast algorithm for cube-connected cycles This paper presents an efficient algorithm that implements one-to-many, or multicast, communication in one-port wormhole-routed cube-connected cycles (CCCs) in the absence of hardware multicast support. BY exploiting the properties of the switching technology and the use of virtual channels, a minimum-time multicast algorithm is presented for n-dimensional CCCs that use deterministic routing of unicast messages. The algorithm can deliver a multicast message to m-1 destinations in inverted right perpendicular log(2) m inverted left perpendicular message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on CCCs with up to 10,240 nodes are also given.

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

cube-connected cycle
wormhole routing
dimension-ordered routing
one-port architecture


a nonparametric hierarchical bayesian framework for information filtering Information filtering has made considerable progress in recent years. The predominant approaches are content-based methods and collaborative methods. Researchers have largely concentrated on either of the two approaches since a principled unifying framework is still lacking. This paper suggests that both approaches can be combined under a hierarchical Bayesian framework . Individual content-based user profiles are generated and collaboration between various user models is achieved via a common learned prior distribution. However, it turns out that a parametric distribution (e.g. Gaussian) is too restrictive to describe such a common learned prior distribution. We thus introduce a nonparametric common prior , which is a sample generated from a Dirichlet process which assumes the role of a hyper prior . We describe effective means to learn this nonparametric distribution, and apply it to learn users' information needs. The resultant algorithm is simple and understandable, and offers a principled solution to combine content-based filtering and collaborative filtering. Within our framework, we are now able to interpret various existing techniques from a unifying point of view. Finally we demonstrate the empirical success of the proposed information filtering methods.

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

framework
point
dirichlet process
paper
filtering
role
collaboration
users
parametric
demonstrate
algorithm

information filter
nonparametric bayesian modelling
sampling
content-based filtering
user model
contention
hierarchic
research
method
information need
learning
distributed
collaborative filtering
effect
user-profile


Observability-based local path planning and obstacle avoidance using bearing-only measurements We analyze observability of state estimation with bearing-only measurements. We use the observability analysis to explicitly design a path planning algorithm. The algorithm minimizes uncertainties of TTC estimate while avoiding obstacles.

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

collision avoidance
miniature air vehicle


Building and evaluating a location-based service recommendation system with a preference adjustment mechanism The location-based service (LBS) of mobile communication and the personalization of information recommendation are two important trends in the development of electric commerce. However, many previous researches have only emphasized oil one of the two trends. In this paper, we integrate the application of LBS with recommendation technologies to present a location-based service recommendation model (LBSRM) and design a prototype system to simulate and measure the validity of LBSRM. Due to the accumulation and variation of preference, in the recommendation model we conduct an adaptive method including long-term and short-term preference adjustment to enhance the result of recommendation. Research results show, with the assessments of relative index, the rate of recommendation precision could be 85.48%. (C) 2008 Elsevier Ltd. All rights reserved.

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

recommendation system
preference adjustment


Brain-like Computing Based on Distributed Representations and Neurodynamics A key to overcoming the limitations of classical artificial intelligence and to deal well with enormous amounts of information might be brain-like computing in which distributed representations of information are processed by dynamical systems without using symbols. We present a, method for such computing. We constructed an inference system using a non monotone neural network, which is a kind of recurrent neural network with continuous-time dynamics. This system deduces a conclusion according to state transitions of the network in which knowledge is embedded as trajectory attractors. It has the powerful ability of analogical reasoning without special treatment for exceptional knowledge. We also propose a method of linking different neurodynamical systems and show that two mutually interacting systems can process complex spatiotemporal patterns.

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

nonmonotone neural network
selective desensitization
brain-like information processing


how will future learning work in the third dimension? In this paper, we describe the possibilities of virtual worlds for educational purposes, and justify the need for special design and usability concepts for learning applications within these worlds.

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

awareness
learning management systems
social presence
vr
second life


Humanoid robot simulator for the METI HRP Project A simulator of humanoid robots and a controller of their whole body motions in METIs Humanoid Robotics Project are developed. The simulator can emulate the dynamics of the motions of the robots whose structure may vary, and generate a sequence of the fields of view from the eyes of the robot according to the motions. The structure-varying system is managed by introducing virtual links. The controller can handle a biped locomotion, a dynamic balance control at the standing position and collision avoidance motions for the robots. These software modules are integrated via CORBA, which enables the Internet clients to use the software. A humanoid robot testbed has also been developed to verify the accuracy of the simulation by experiments in the real world. We call the system Virtual Humanoid Robot Platform, which we expect is the virtual counterpart of the hardware robot platform for humanoid robotics.

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

humanoid simulator
dynamics simulation
view simulation
humanoid testbed


some subjective validation methods using graphical displays of data Subjective methods for operational validity are presented that use graphical displays of histograms, box plots, and behavior graphs. These methods allow the data to be correlated, have any statistical distribution, and be limited in the number of observations. Model data are used for the reference distribution (instead of a theoretical distribution such as the t or F) and for reference to compare the system data against. These methods are very general and can be used in validating different types of models.

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

use behavior types validation data general model

histogram observability statistics method systems graph graphics display distributed


Instances of Arabic Cryptography in Morocco II In a previous article [5], the authors have presented some examples of cryptography in Morocco before the sixteenth century. In the present article, they continue to describe other methods of cryptography and steganography used by Moroccans between the seventeenth and the nineteenth centuries. In particular, there was intense use of the Hissab al Jomal calculation to encrypt numbers and use of a grid filled with verses of poetry in the form of a chessboard to write a given message.

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

alaouite cryptography
arithmetical cryptography
chess cryptography


Performance profiling for predictive train schedules The concept of performance profiling was introduced for train schedules. The proposed sensitivity analysis quantifies the effect of deviations and delays. The analysis identifies which parts of the schedule are at most risk. The analysis can validate the claim that an existing schedule is robust. The information in the profiles can help improve existing schedules.

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

schedule analysis
profile of performance
robustness
railways


A Study of the Scalability of Stop-the-world Garbage Collectors on Multicores Large-scale multicore architectures create new challenges for garbage collectors (GCs). In particular, throughput-oriented stop-the-world algorithms demonstrate good performance with a small number of cores, but have been shown to degrade badly beyond approximately 8 cores on a 48-core with OpenJDK 7. This negative result raises the question whether the stop-the-world design has intrinsic limitations that would require a radically different approach. Our study suggests that the answer is no, and that there is no compelling scalability reason to discard the existing highly-optimised throughput-oriented GC code on contemporary hardware. This paper studies the default throughput-oriented garbage collector of OpenJDK 7, called Parallel Scavenge. We identify its bottlenecks, and show how to eliminate them using well-established parallel programming techniques. On the SPECjbb2005, SPECjvm2008 and DaCapo 9.12 benchmarks, the improved GC matches the performance of Parallel Scavenge at low core count, but scales well, up to 48 cores.

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


The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations We consider the network loading problem (NLP) under a polyhedral uncertainty description of traffic demands. After giving a compact multicommodity flow formulation of the problem, we state a decomposition property obtained from projecting out the flow variables. This property considerably simplifies the resulting polyhedral analysis and computations by doing away with metric inequalities. Then we focus on a specific choice of the uncertainty description, called the "hose model," which specifies aggregate traffic upper bounds for selected endpoints of the network. We study the polyhedral aspects of the NLP under hose demand uncertainty and use the results as the basis of an efficient branch-and-cut algorithm. The results of extensive computational experiments on well-known network design instances are reported.

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

network loading problem
hose model
polyhedral analysis

polyhedral demand uncertainty
robust optimization
branch and cut


Stimulating appropriate uses of simulation in design This article addresses the issue of educating undergraduate engineering students in the appropriate use of computer simulation in the design process. The premise that poorly designed assignments involving simulation can actually impair understanding is addressed. A set of goals for simulation-based exercises is suggested, and some tactics for meeting these goals are introduced. Finally, a specific example of a half-term assignment that is used to meet these goals is provided for illustration.

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


On counting independent sets in sparse graphs We prove two results concerning approximate counting of independent sets in graphs with constant maximum degree Delta. The first implies that the Markov chain Monte Carlo technique is likely to fail if Delta greater than or equal to 6. The second shows that no fully polynomial randomized approximation scheme can exist for Delta greater than or equal to 25, unless RP = NP.

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


Sequencing the head and neck cancer genome: implications for therapy Head and neck squamous cell carcinoma (HNSCC) is a disease with significant morbidity and mortality. The advancement of next-generation sequencing technologies now enables the landscape of genetic alterations in HNSCCs to be deciphered. In this review, we describe the mutation spectrum discovered in HNSCCs, especially human papilloma virusassociated and/or tobacco smoke exposureassociated HNSCCs. We also describe related research from two independent investigators and from the Cancer Genome Atlas. Emphasis is placed on the therapeutic implications of genes frequently altered in HNSCCs (i.e., TP53, PIK3CA, and NOTCH1) and their corresponding pathways, with a particular focus on recent findings of Notch signaling pathway activation in HNSCC. We also discuss the application of integrated genomic pathwaybased analysis for precision cancer therapy in HNSCC.

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


Cyclic polling-based dynamic bandwidth allocation for differentiated classes of service in ethernet passive optical networks Ethernet passive optical networks (EPONs) are an emerging access network technology that provides a low-cost method of deploying optical access lines between a carrier's central office and customer sites. Dynamic bandwidth allocation (DBA) provides statistical multiplexing between the optical network units for efficient upstream channel utilization. To support dynamic bandwidth distribution, a cyclic polling-based DBA algorithm for differentiated classes of service in EPONs is proposed. It is shown that an interleaved polling scheme severely decreases downstream channel capacity for user traffic when the upstream network load is low. To obtain realistic simulation results, synthetic traffic that exhibits the properties of self-similarity and long-range dependence is used. Network performance under various loads is analyzed. Specifically, frame delays for different classes of traffic are considered.

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


Sum coloring interval and k-claw free graphs with application to scheduling dependent jobs We consider the sum coloring and sum multicoloring problems on several fundamental classes of graphs, including the classes of interval and k-claw free graphs. We give an algorithm that approximates sum coloring within a factor of 1.796, for any graph in which the maximum k-colorable subgraph problem is polynomially solvable. In particular, this improves on the previous best known ratio of 2 for interval graphs. We introduce a new measure of coloring, robust throughput, that indicates how "quickly" the graph is colored, and show that our algorithm approximates this measure within a factor Of 1.4575. In addition. we study the contiguous (or non-preemptive) sum multicoloring problem on k-claw free graphs. This models, for example, the scheduling of dependent jobs on multiple dedicated machines, where each job requires the exclusive use of at most k machines. Assuming that k is a fixed constant, we obtain the first constant factor approximation for the problem.

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

coloring
multicoloring
scheduling dependent jobs


video summarization via transferrable structured learning It is well-known that textual information such as video transcripts and video reviews can significantly enhance the performance of video summarization algorithms. Unfortunately, many videos on the Web such as those from the popular video sharing site YouTube do not have useful textual information. The goal of this paper is to propose a transfer learning framework for video summarization: in the training process both the video features and textual features are exploited to train a summarization algorithm while for summarizing a new video only its video features are utilized. The basic idea is to explore the transferability between videos and their corresponding textual information. Based on the assumption that video features and textual features are highly correlated with each other, we can transfer textual information into knowledge on summarization using video information only. In particular, we formulate the video summarization problem as that of learning a mapping from a set of shots of a video to a subset of the shots using the general framework of SVM-based structured learning. Textual information is transferred by encoding them into a set of constraints used in the structured learning process which tend to provide a more detailed and accurate characterization of the different subsets of shots. Experimental results show significant performance improvement of our approach and demonstrate the utility of textual information for enhancing video summarization.

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


Evaluating chi-squared automatic interaction detection ? We propose a method to compute confidence bounds around the predictions from chi-squared automatic interaction detection (CHAID). These bounds are useful for ex ante target selection as some clusters may or may not overlap. They are also useful for ex post evaluation of the predictive quality of CHAID. The method is illustrated using simulated data.

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


Perceptions of environmental management systems An examination of the Mexican manufacturing sector Purpose - Over the last several years, there has been a significant increase worldwide in the implementation of environmental management systems (EMS). Yet, few studies have provided feedback on managerial views of key components and performance of these systems. The purpose of this paper is to examine variations in perceptions of a number of environmental and human resource constructs that are operationalized and measured in the field at Mexican maquiladoras. Differences between organizations with a certified EMS, informal EMS, and no EMS are examined. Design/methodology/approach - A survey was administered to 220 manufacturing organizations in Mexico. The survey instrument was self-report format with attitudinal variables. Items were adopted from previously published scales. A global hypothesis was proposed in order to test the difference between groups across multiple dependent variables. A MANCOVA and post hoc MANOVA were used to simultaneously evaluate the difference among the multiple metric dependent variables in this study. Findings - The paper found that significant facility differences existed for all environmental management practices and perceived environmental performance across all levels of EMS, with certified EMS facilities being the highest, informal EMS facilities being second and facilities with no EMS being lowest. Originality/value - This study contributes to both theory and practice. First, it extends the literature related to EMS and environmental and human resource constructs. Second, it tests the role of EMS certification in firm environmental management. Third, the study is the first to compare EMS differences among firms in the Mexican manufacturing sector. Finally, the study has relevant implications for practitioners.

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


Two-axis-of-rotation drive system in electron-beam lithography apparatus for nanotechnology applications A two-axis-of-rotation drive system has been developed that enables electron-beam lithography (EBL) to be applied to three-dimensional (3D) nanofabrication. It is built on a pallet that can be loaded into the EBL apparatus, and rotates a sample while the e-beam writes on it. It has a positional accuracy of a few milliradians. In addition, a height-measurement system has also been developed. This helps to focus the e-beam on the surface of a rotating or non-planar sample, and enables fine patterns to be formed on such samples. These systems allow samples to be exposed to the e-beam from various directions, resulting in 3D fabrication with a high degree of freedom. A demonstration carried out on a polymethylmethacrylate sphere resulted in the formation of pillars with various shapes and about 100 nm in diameter.

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

e-beam nanolithography
rotation drive
pmma


Generalized finite element method for modeling nearly incompressible bimaterial hyperelastic solids An extension of the generalized finite element method to the class of mixed finite element methods is presented to tackle heterogeneous systems with nearly incompressible non-linear hyperelastic material behavior. In particular, heterogeneous systems with large modulus mismatch across the material interface undergoing large strains are investigated using two formulations, one based on a continuous deformation map, the other on a discontinuous one. A bimaterial patch test is formulated to assess the ability of the two formulations to reproduce constant stress fields, while a mesh convergence study is used to examine the consistency of the formulations. Finally, compression of a model heterogeneous propellant pack is simulated to demonstrate the robustness of the proposed discontinuous deformation map formulation.

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

mixed finite element method
lagrange multipliers
bimaterial solid
incompressible hyperelasticity


Ontology based semantic conflicts resolution in collaborative editing of design documents Semantic conflicts happen frequently during collaborative editing of design documents. The problem of semantic consistency of words and the maintenance of users' editing intentions are the two major challenges when resolving those semantic conflicts. Based on WordNet this paper presents an ontology description languageFLoDL and introduces it to describe the global ontology library (GOL) and the individual ontology library (IOL) in collaborative editing. By this means, we reconstruct the architecture of collaborative editing and propose a mixed peer-to-peer structured semantic collaborative editing architecture. Then a new algorithm for inserting operations, from which semantic conflicts are often caused, is designed to solve the problem of semantic consistency of words. Moreover, by adding users' individualized semantic information into their IOL, we provide the users with individualized services and successfully maintain users' editing intensions. Finally, through some detailed experiments, we perform a compared analysis to show that semantic collaborative editing not only keeps smaller clients (less storage space) but also localizes many editing operations and thereby improves the performance of collaborative editing.

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

collaborative editing
ontology
semantic conflicts
wordnet

collaborative design
ontology description language


LIBSVM: A Library for Support Vector Machines LIBSVM is a library for Support Vector Machines (SVMs). We have been actively developing this package since the year 2000. The goal is to help users to easily apply SVM to their applications. LIBSVM has gained wide popularity in machine learning and many other areas. In this article, we present all implementation details of LIBSVM. Issues such as solving SVM optimization problems theoretical convergence multiclass classification probability estimates and parameter selection are discussed in detail.

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

classification libsvm optimization regression support vector machines svm


An automated, objective and open source tool for stream threshold selection and upstream riparian corridor delineation Automated threshold selection for stream extraction. Goodness of fit of extracted networks with mapped stream networks. Automated delineation of upstream riparian corridors for stream sampling points. Algorithms developed by combining R and GRASS GIS. Computer code and data provided.

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

automation
algorithm
stream network
digital elevation model
stream sampling point


Adaptively embedding binary data in an image In this paper, we propose an embedding algorithm, of high visual quality, that can adaptively embed a binary message into an image. The binary message to be embedded is divided into two segments, each of which is then decomposed into n + 1 or n types of sub-messages (where n >= 3 enables each pixel to embed a sub-message), respectively, according to the desired embedding capacity. Embedding is done by leaving the pixel value unchanged or changing it into one of its n or n - 1 neighboring values according to the type of the sub-message. From the results of this study, each pixel may not embed a fixed number of message bits and the adjustment of the pixel value is minimal, thus the image quality is significantly improved by adaptively decomposing the message into sub-messages and embedding them into the host image.

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


effectiveness of annotating by hand for non-alphabetical languages Unlike documents, annotation for multimedia information needs to be input as text, not in the form of symbols such as underlines and circles. This is problematic with keyboard input for non-alphabetical languages, especially the East Asian languages such as Chinese and Japanese, because it is labor intensive and imposes a high cognitive load. This study provides a quantitative analysis of the effectiveness of making annotations by hand during a note-taking task in Japanese. Although the lessons learned from this study come from Japanese text input, they are also generally applicable to other East Asian Languages which use ideographic characters such as Chinese. In our study, we focused on both the ergonomic and cognitive aspects and found that during annotation and note-taking task input by hand is more effective than input by keyboard. Finally, we anatomized the keyboard input problem and discuss it in this 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 B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

input speed
non-alphabetical languages
handwritten annotation


An O(n) O ( n ) algorithm for weighted least squares regression by integer quasi-convex and unimodal or umbrella functions The problem of fitting n n data points by an integer quasi-convex (also quasi-concave, umbrella or unimodal) function using the weighted least squares distance function is considered. An algorithm of linear time (O(n) O ( n ) ) worst-case complexity and thus optimal is constructed for computing a best fit. This problem arises in the context of curve fitting or statistical estimation.

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

integer quasi-convex regression
integer unimodal regression
integer umbrella regression
umbrella ordering
isotonic regression
linear time algorithms
greatest convex minorant (gcm)
least concave majorant (lcm)


Rigorous modeling and simulation of molecular distillators: development of a simulator under conditions of non ideality of the vapor phase In this work, a more rigorous model of the vapor phase was considered in characterizing the molecular distillation more realistically. The model used here tries to predict the behavior of the molecular distillation in terms of several factors that, in a considerable way, influence the evaporation efficiency, e.g, design of the molecular distillators in relation to the distance between the evaporator and the condenser and their geometries, pressure of the system, and condensation temperature. This model was developed in the literature by several authors. The objective here is to consider it in the DISMOL software (developed by the authors of this work) taking into account the main contributions available. (C) 2000 Elsevier Science 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 B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


Usage of DDS Data-Centric Middleware for Remote Monitoring and Control Laboratories Communication middleware technologies are powerful instruments to develop and deploy remote laboratories for students to practice the control of real application cases. Middleware allows the rapid development and deployment of actual distributed settings since it abstracts the specifics of the different hardware platforms and communication media involved in the access of students to the lab material. This paper describes the practical settings carried out in the a case of a successful laboratory experience that allows students to simulate the on-line monitoring and control of remote systems, i.e., the train traffic in a simulated metro system. The innovative contribution of this experiment is the usage of data-centric middleware based on the publish/subscribe paradigm that has real-time properties. Up to our knowledge, such deployment with this particular middleware type has not been done, and it has given rise to a flexible setting that grows with the contributions of students. We have validated the idea by gathering the feedback of students with respect to the operation of the assignment, showing that this motivates the students' learning and enrollment in the assignment.

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

dds
middleware
remote monitoring and control

networked embedded systems
remote laboratory


A splitting integration scheme for the SPH simulation of concentrated particle suspensions Simulating nearly contacting solid particles in suspension is a challenging task due to the diverging behavior of short-range lubrication forces, which pose a serious time-step limitation for explicit integration schemes. This general difficulty limits severely the total duration of simulations of concentrated suspensions. Inspired by the ideas developed in [S. Litvinov, M. Ellero, X.Y. Hu, N.A. Adams, J. Comput. Phys. 229 (2010) 54575464] for the simulation of highly dissipative fluids, we propose in this work a splitting integration scheme for the direct simulation of solid particles suspended in a Newtonian liquid. The scheme separates the contributions of different forces acting on the solid particles. In particular, intermediate- and long-range multi-body hydrodynamic forces, which are computed from the discretization of the NavierStokes equations using the smoothed particle hydrodynamics (SPH) method, are taken into account using an explicit integration; for short-range lubrication forces, velocities of pairwise interacting solid particles are updated implicitly by sweeping over all the neighboring pairs iteratively, until convergence in the solution is obtained. By using the splitting integration, simulations can be run stably and efficiently up to very large solid particle concentrations. Moreover, the proposed scheme is not limited to the SPH method presented here, but can be easily applied to other simulation techniques employed for particulate suspensions.

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

smoothed particle hydrodynamics
splitting integration

non-colloidal suspension
concentrated suspension
lubrication force
couette flow
pairwise implicit integration


Partitioned systolic architecture for modular multiplication in GF(2(m)) This letter proposes a partitioned systolic array for MSB-first approach multiplication in GF(2(m)). When compared to the related multiplier presented by Wang, the proposed systolic array requires a significantly smaller number of basic cells. It requires only m/2 basic cells and exhibits the same latency when it has two bands. (C) 2000 Elsevier Science B.V. All rights reserved.

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

cryptography
modular multiplier
lpgs partition


Enabling stability analysis of tubular reactor models using PDE/PDAE integrators We discuss the construction of computational superstructures enabling time-dependent process simulation codes to perform stability. continuation and bifurcation calculations-tasks in principle not accessible to them-directly. The basis of the approach is the so-called Recursive Projection Method of Shroff and Keller (SIAM Journal of Numerical Analysis 31). We discuss its implementation and performance for the detection of different types of bifurcations (with emphasis on Hopf bifurcations) as well as slight modifications appropriate for index 1 partial differential/algebraic equations (PDAE) simulators. Tests that help discriminate between physical and numerical (spurious) bifurcations detected in the process are discussed and illustrated through the standard example of a tubular reactor with a single irreversible exothermic reaction. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

recursive projection method
stability analysis
tubular reactor