On studying business models in mobile social networks based on two-sided market (TSM) In contrast to the huge popularity of Mobile Social Network (MSN) services, not sufficient attention has been reserved to the dynamics of revenue streams and business models in MSN. In this paper, we investigate how a two-sided market (TSM) formulation can be used to provide insight for the problem above from the perspective of MSN platform. Intuitively, MSN service platform could be described as a two-sided market, in which the critical feature is indirect value flow (indirect network externality): one/both sides of the market benefit from increasing adoption and/or consumption of the other side. For instance, participants, like consumers and the third service providers (or advertisers), are the two sides of MSN platform. In this paper, our contributions are threefold. First, we thoroughly characterize the economic features of MSN as TSM, including mobility, network externalities and herd effect, as well as long tail property. Second, we provide the various revenue streams within the framework of TSM, including advertising, subscription, and transactions, and characterize the basic components of general business model in MSN. Finally, the free plus premium (Freemium) business model in MSN is formally analyzed. Specifically, we quantitatively characterize the relationship of participation levels among free and premium users as well as service providers, and illustrate the mutual enhancement among those participants. And moreover, Freemium is theoretically compared with the traditional business model with no free users (NF model). The numerical results show that, in Freemium, the participation levels of premium users and service providers, as well as the profit of MSN platform always exceed the corresponding terms in NF model.

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

mobile social networks (msn)
two-sided market


Multidimensional HLLE Riemann solver: Application to Euler and magnetohydrodynamic flows In this work we present a general strategy for constructing multidimensional HLLE Riemann solvers, with particular attention paid to detailing the two-dimensional HLLE Riemann solver. This is accomplished by introducing a constant resolved state between the states being considered, which introduces sufficient dissipation for systems of conservation laws. Closed form expressions for the resolved fluxes are also provided to facilitate numerical implementation. The Riemann solver is proved to be positively conservative for the density variable; the positivity of the pressure variable has been demonstrated for Euler flows when the divergence in the fluid velocities is suitably restricted so as to prevent the formation of cavitation in the flow. We also focus on the construction of multidimensionally upwinded electric fields for divergence-free magnetohydrodynamical (MHD) flows. A robust and efficient second order accurate numerical scheme for two and three-dimensional Euler and MHD flows is presented. The scheme is built on the current multidimensional Riemann solver and has been implemented in the authors RIEMANN code. The number of zones updated per second by this scheme on a modern processor is shown to be cost-competitive with schemes that are based on a one-dimensional Riemann solver. However, the present scheme permits larger timesteps. Accuracy analysis for multidimensional Euler and MHD problems shows that the scheme meets its design accuracy. Several stringent test problems involving Euler and MHD flows are also presented and the scheme is shown to perform robustly on all of them.

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

riemann solvers
multidimensional
conservation laws
euler
mhd


data extraction and label assignment for web databases Many tools have been developed to help users query, extract and integrate data from web pages generated dynamically from databases, i.e., from the Hidden Web. A key prerequisite for such tools is to obtain the schema of the attributes of the retrieved data. In this paper, we describe a system called, DeLa , which reconstructs (part of) a "hidden" back-end web database. It does this by sending queries through HTML forms, automatically generating regular expression wrappers to extract data objects from the result pages and restoring the retrieved data into an annotated (labelled) table. The whole process needs no human involvement and proves to be fast (less than one minute for wrapper induction for each site) and accurate (over 90\% correctness for data extraction and around 80\% correctness for label assignment).

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

help
hidden web
web
human
schema
attributes
paper
label
regular expression
users
extraction
correctness
assignment
process
wrapper
data
queries
html forms
database
tools
query

automatic wrapper induction
information integration
data annotation
object
systems
web page
data extraction
inductance
web information extraction
integrability


On the fly authentication and signature schemes based on groups of unknown order In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature scheme that combine provable security based on the problem of computing discrete logarithms in any group, short keys, very short transmission and minimal on-line computation. This leads to both efficient and secure applications well suited to implementation on low cost smart cards. We introduce GPS, a Schnorr-like scheme that does not require knowledge of the order of the group nor of the group element. As a consequence, it can be used with most cryptographic group structures, including those of unknown order. Furthermore, the computation of the prover's response is done over the integers, hence can be done with very limited computational capabilities. This paper provides complete security proofs of the identification scheme. From a practical point of view, the possible range of parameters is discussed and a report on the performances of an actual implementation on a cheap smart card is included: a complete and secure authentication can be performed in less than 20 milliseconds with low cost equipment.

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

identification scheme
low cost smart cards

digital signature
discrete logarithm problem
minimal on-line computation


Coordinating activities and change: An event-driven architecture for situated MAS Agent activities and environment change are what make things happen in a multi-agent system (MAS). Complexity in a MAS comes from non-trivial dependencies between activities (social interaction), and between activities and environment change (situated interaction). As they are used to manage social (agentagent) dependencies, coordination artefacts could also be used to govern situated (agentenvironment) dependencies. Along this line, in this paper we propose an event-driven architecture for complex MAS that exploits coordination to handle all sorts of dependencies in a uniform way. We first motivate the underlying meta-model and put some well-known agent-based frameworks in perspective, then we discuss its general articulation along with its reification within the TuCSoN coordination middleware.

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

mas architecture
event-driven model
situatedness
tucson tucson


Prediction of biodegradability from structure: Imidazoles A project for the development of Structure-Activity Relationship for Biodegradation is presented. The aim of the project is to assemble sets of structural rules governing the potential microbial degradability of (classes of) chemicals. These rules will provide tools to take into account the biodegradation aspects of a product-and all precursors in the production process-early in the product development. The modeling concept is to take all experimental biodegradation data available and combine structural trends in the data with mechanistical information from degradation pathways. The rules that are derived should give insight into the possibility of biodegradation for specific classes of chemicals, thereby revealing why a compound is biodegradable or not. For the class of imidazole derivatives such rules are derived, and a model degradation mechanism is proposed in analogy to the urocanate-hydratase mechanism from histidine metabolism. The model is validated using 12 imidazole-compounds, which are all predicted correctly to be poorly biodegradable. It is demonstrated that both data analysis and information on enzymatic reaction mechanisms are necessary to yield valid Structure-Biodegradation Relationship.

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


A convergent finite element approximation for the quasi-static MaxwellLandauLifshitzGilbert equations ? We propose a ? ? -linear scheme for the numerical solution of the quasi-static MaxwellLandauLifshitzGilbert (MLLG) equations. Despite the strong nonlinearity of the LandauLifshitzGilbert equation, the proposed method results in a linear system at each time step. We prove that as the time and space steps tend to zero (with no further conditions when ? ? ( 1 2 , 1 ] ), the finite element solutions converge weakly to a weak solution of the MLLG equations. Numerical results are presented to show the applicability of the method.

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


Spatial decision support for assisted housing mobility counseling This paper presents a prototype spatial decision support system (SDSS) that enables clients in the Housing Choice Voucher Program to make better decisions about neighborhoods in which to search for housing and specific units to evaluate for occupancy. Application requirements are based on field research establishing limitations of housing counselors to provide detailed assistance to clients, and the capability of clients to use a spatial decision support system. Decision opportunities are identified using value-focused thinking and spatial analysis. Specific destination alternatives are ranked using a destination choice algorithm based on multicriteria decision models that incorporates alternative relocation strategies.

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

subsidized housing
geographic information systems
spatial decision support systems


Concurrent exception handling and resolution in distributed object systems We address the problem of how to handle exceptions in distributed object systems. In a distributed computing environment, exceptions may be raised simultaneously in different processing nodes and thus need to be treated in a coordinated manner. Mishandling concurrent exceptions can lead to catastrophic consequences. We take two kinds of concurrency into account: 1) Several objects are designed collectively and invoked concurrently to achieve a global goal and 2) multiple objects (or object groups) that are designed independently compete for the same system resources. We propose a new distributed algorithm for resolving concurrent exceptions and show that the algorithm works correctly even in complex nested situations, and is an improvement over previous proposals in that it requires only O(n(max)N(2)) messages, thereby permitting quicker response to exceptions.

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

concurrent exeception handling
distributed systems
exception resolution
nested atomic actions
object-oriented programming


collusion-resistant privacy-preserving data mining Recent research in privacy-preserving data mining (PPDM) has become increasingly popular due to the wide application of data mining and the increased concern regarding the protection of private and personal information. Lately, numerous methods of privacy-preserving data mining have been proposed. Most of these methods are based on an assumption that semi-honest is and collusion is not present. In other words, every party follows such protocol properly with the exception that it keeps a record of all its intermediate computations without sharing the record with others. In this paper, we focus our attention on the problem of collusions, in which some parties may collude and share their record to deduce the private information of other parties. In particular, we consider a general problem in PPDM - multiparty secure computation of some functions of secure summations of data spreading around multiple parties. To solve such a problem, we propose a new method that entails a high level of security - full-privacy. With this method, no sensitive information of a party will be revealed even when all other parties collude. In addition, this method is efficient with a running time of O ( m ). We will also show that by applying this general method, a large number of problems in PPDM can be solved with enhanced security.

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

privacy
secure multiparty computation
distributed


The multi-item newsvendor model with cross-selling and the solution when demand is jointly normally distributed We model the multi-item newsvendor problem considering cross-selling effect. We derive the first-order optimality conditions for the centralized model. The pure-strategy Nash equilibrium conditions of the competitive model are developed. Develop efficient algorithms to solve the centralized and the competitive models. Provide insights into the influences of cross-selling on newsvendor decision.

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

inventory
multi-item newsvendor
cross-selling


the new generation of computer literacy A tremendous mismatch is developing between two of the most critical components of any computer literacy course: the textbooks and the students. We are encountering a new generation of students (literally as well as figuratively!) who are much better acquainted with computer usage than their earlier counterparts. Yet many textbooks with increasing emphasis in those same computer tools continue to appear. There are signs of a coming change in that a few authors and publishers apparently are becoming aware of the need for innovations in texts for non-scientists. These textbooks open the door for a new orientation to principles in the teaching of computer literacy.

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

teaching
generation
computer literacy
change
tools
orientation

innovating author critic computation student component


Color edge detection using multiscale quaternion convolution This article presents a novel color edge detection algorithm based on quaternion convolution. A set of multiscale quaternion masks are presented, and the filtered results are multiplied at adjacent scales using dot product to enhance the edge structures while diluting noise. Experimental results show that the proposed method is efficient and robust for color images. 2010 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 20, 354358, 2010

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

quaternion convolution
edge detection
dot product
multiscale


Genetic optimization of a vehicle fuzzy decision system for intersections This paper presents a case study in which an autonomous vehicle must cooperate with a supposedly manually driven one to carry out a cross-roads manuvre without risk. The main difference with other intersection systems is that the manual vehicle is driven without paying attention to the controlled one, so a cooperative coordination between vehicles is not possible. In this case is the autonomous vehicle the responsible of adapting its speed to the state of the manually driven, for finalizing the manuvre both in a safe and efficient way. For this purpose, a three layer hierarchical fuzzy rule-based system (FRBS) is developed with the aim of dealing with such a situation: the first layer is in charge of detecting the kind of manuvre that will be necessary; the second, in the case that an intersection is going to be crossed, is in charge of determining the suitable speed to do so without risk; and the third acts on the vehicles real speed. The first two layers are implemented by means of fuzzy decision systems, with the second being optimized by a genetic algorithm (GA). The GA evaluates candidates in random simulated scenarios taking into account different factors to calculate the fitness. These factors are: implementing a free collision policy, avoiding unnecessary stops, and terminating the manuvre as rapidly as possible.

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

genetic algorithms
fuzzy logic
autonomous vehicles
vehicle cooperation


structural and nodal mutation in grammatical evolution This study focuses on mutation in Grammatical Evolution and divides mutation events into those that are structural in nature and those that are nodal. A structural event being one that alters the length of the phenotype. A nodal event simply alters the value at any node of a derivation tree. We analyse and compare the effect of integer, nodal and structural mutations on fitness for randomly generated individuals before continuing this analysis to their relative problem-solving performance over full runs. The study highlights the importance of understanding how the search operators of an evolutionary algorithm behave. The result in this case being a form of mutation for Grammatical Evolution, node mutation, with a better property of locality than standard integer-based mutation, which does not discriminate between structural and nodal contexts.

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


An Image-Based CAPTCHA Scheme Exploiting Human Appearance Characteristics CAPTCHAs are automated tests that are there to avoid misuse of computing and information resources by bots. Typical text-based CAPTCHAs are proven to be vulnerable against malicious automated programs. In this paper, we present an image-based CAPTCHA scheme using easily identifiable human appearance characteristics that overcomes the weaknesses of current text-based schemes. We propose and evaluate two applications for our scheme involving 25 participants. Both applications use same characteristics but different classes against those characteristics. Application 1 is optimized for security while application 2 is optimized for usability. Experimental evaluation shows promising results having 83% human success rate with Application 2 as compared to 62% with Application 1.

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

captcha
usability
security
human appearance characteristics


Compact Architecture for ASIC Implementation of the MISTY1 Block Cipher This paper proposes a compact hardware (H/W) implementation for the MISTY1 block cipher, which is one of the ISO/IEC 18033-3 standard encryption algorithms. In designing the compact H/W, we focused on optimizing the implementation of FO/FI/FL functions, which are the main components of MISTY1. For this optimization, we propose three new methods; reducing temporary registers for the FO function, shortening the critical path for the FI function, and merging the FL/FL(-1) functions. According to our logic synthesis on a 0.18-mu m CMOS standard cell library based on our proposed methods, the gate size is 3.4 Kgates, which is the smallest as far as we know.

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


The moderating effects of psychological reactance and product involvement on online shopping recommendation mechanisms based on a causal map The use of the Internet in the daily activities of individuals and firms has become entrenched, and online shopping has become commonplace. However, debates about how online shopping recommendation mechanisms (OREMs) should be designed have not been completely resolved. The challenge with traditional online shopping recommendation mechanisms (TR-OREMs) is that they focus too much on quantitative factors. Thus, they ignore causal interrelationships with qualitative factors that are believed to significantly impact quantitative factors. Considering only quantitative factors and ignoring qualitative ones likely distorts the final recommendation results. Another problem with TR-OREMs is that they ignore the perceived psychological reactance of consumers against the recommended products. Such consumer reactance may be reduced when the causal interrelationships among all the quantitative and qualitative factors are analyzed and incorporated properly into the OREM. To overcome these problems, we propose a causal map - online shopping recommendation mechanisms (CM-OREMs) based on a causal map. We analyzed possible causal relationships among quantitative and qualitative factors and incorporated them in the recommendation process to reduce consumer reactance against the recommendation results. Furthermore, an elaboration likelihood model (ELM) was used to build hypotheses about how the online shopping behavior of consumers is affected by OREMs based on the proposed causal map. Specifically, the performance of the proposed OREM was empirically analyzed by gathering experiment data from qualified respondents who were asked to refer to the proposed OREM before making purchasing decisions via mobile phones. Statistical results showed that the proposed OREMs could enhance consumer decision satisfaction, decision confidence, and attitude toward the recommended products. It could also positively affect consumer purchasing intentions. The OREM had a greater effect on the high-reactance group of participants than on the low-reactance group as well as on a high-involvement product versus a low-involvement product. (C) 2010 Elsevier B.V. All rights reserved.

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

causal map
reactance
product involvement

online shopping recommendation mechanism (orem)


Development and validation of an epitope prediction tool for swine (PigMatrix) based on the pocket profile method T cell epitope prediction tools and associated vaccine design algorithms have accelerated the development of vaccines for humans. Predictive tools for swine and other food animals are not as well developed, primarily because the data required to develop the tools are lacking. Here, we overcome a lack of T cell epitope data to construct swine epitope predictors by systematically leveraging available human information. Applying the pocket profile method, we use sequence and structural similarities in the binding pockets of human and swine major histocompatibility complex proteins to infer Swine Leukocyte Antigen (SLA) peptide binding preferences.

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

pigmatrix
epitope prediction
sla
t cell epitope

epimatrix
computational vaccinology
hla
mhc
class i
class ii
porcine
prrsv
influenza
genome-derived vaccine


CONNECTOR ALGEBRAS FOR C/E AND P/T NETS' INTERACTIONS A quite flourishing research thread in the recent literature on componentbased systems is concerned with the algebraic properties of different classes of connectors. In a recent paper, an algebra of stateless connectors was presented that consists of fi ve kinds of basic connectors, namely symmetry, synchronization, mutual exclusion, hiding and inaction, plus their duals, and it was shown how they can be freely composed in series and in parallel to model sophisticated "glues". In this paper we explore the expressiveness of stateful connectors obtained by adding one-place buffers or unbounded buffers to the stateless connectors. The main results are: i) we show how different classes of connectors exactly correspond to suitable classes of Petri nets equipped with compositional interfaces, called nets with boundaries; ii) we show that the difference between strong and weak semantics in stateful connectors is re flected in the semantics of nets with boundaries by moving from the classic step semantics (strong case) to a novel banking semantics (weak case), where a step can be executed by taking some "debit" tokens to be given back during the same step; iii) we show that the corresponding bisimilarities are congruences (w. r. t. composition of connectors in series and in parallel); iv) we show that suitable monoidality laws, like those arising when representing stateful connectors in the tile model, can nicely capture concurrency (in the sense of step semantics) aspects; and v) as a side result, we provide a basic algebra, with a fi nite set of symbols, out of which we can compose all P/T nets with boundaries, ful fi lling a long standing quest.

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

c/e nets with boundaries
p/t nets with boundaries
tiles


Visualization and quantitative study in bibliographic databases: A case in the field of universityindustry cooperation Our visualization and quantitative method formed a new research framework to evaluate the performance of some research areas. Our method can clearly reveal the key elements of certain discipline. The relationships among the important cited authors, references, journals and keywords can be explained visually. It should be noted that the potential problems and evolutionary trends of certain research field such as universityindustry cooperation can also be found out via our method.

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

bibliometrics
visualizing
citespace
universityindustry collaboration


a symbolic design system for integrated circuits As integrated circuit design has become increasingly complex, the need for more effective data description techniques has become critical. Design verification from mask artwork data alone can consume vaste amounts of computer time for VLSI circuits, if it can be performed at all. The use of a symbolic design description, which allows the designer or synthesis program to express circuit structure as well as maintain full connectivity information, can reduce dramatically the burden placed on the verification tools: This paper describes a symbolic design system, its associated data manager, its color graphics viewport manager, and its application to a variety of design methods. The data manager can store a variety of representations of the design, including simulation data, geometric layout, symbolic layout, and schematic diagrams. The viewport manager can manage a number of viewports concurrently and the use of a model frame buffer allows it to function easily on a variety of graphics terminals and hard-copy devices. The system is designed with an engineering work station in mind .

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

integrated circuit design
diagrams
color
use
simulation
design
layout
graphics
model
paper
terminals
structure
verification
data
synthesis
tools
circuits

applications
engine
association
maintainability
computation
timing
integrated circuit
buffers
informal
management
systems
device
functional
complexity
critic
connection
effect
design method


Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring Z(N) Recently Kocarev and Tasev [20] proposed to use Chebyshev polynomials over real numbers to design a public key algorithm by employing the semigroup property. Bergamo et al. [4] pointed out that the public key algorithm based on Chebyshev polynomials working on real numbers is not secure and devised an attack which permits to recover the corresponding plaintext from a given ciphertext. Later Kocarev et al. [19] generalized the Chebyshev polynomials from real number fields to finite fields and finite rings to make the public key algorithm more secure and practical. However, we analyzed the period distribution of the sequences generated by the Chebyshev polynomials over finite fields [21]. When the modulus N is prime, we found this algorithm was also not secure and proposed an attack on this algorithm over finite fields. We then proposed some schemes to improve the security. In this paper, we further analyze in detail the period distribution of the sequences generated by Chebyshev polynomials over the integer ring Z(N) when N is composite. It turns out that the period distribution is poor if N is not chosen properly and there are many small periods, which are not secure in the sense of cryptology. Based on these findings, we devise an attack on the public key algorithm based on Chebyshev polynomials over the integer ring Z(N). We also propose some suggestions to avoid this attack. (C) 2011 Elsevier Inc. All rights reserved.

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

public key algorithm
period distribution
security analysis


Optimization analysis for design and planning of multi-project programs Program management concerns the long term planning, coordination, and control of major technological, engineering, scientific, and/or developmental activities. In general, programs tend to be exceptionally large, consisting of several parallel or sequential projects or groups of projects. While a large number of modeling efforts have focused at the project level, this paper looks at the application of optimization techniques to the initial design and development of multi-project programs. The classic work breakdown structure (WBS) is used as a framework to provide an aggregate model to investigate the effects of funding levels, resource allocation, and program, project, and component durations. Decomposition, sensitivity analysis, and parametric programming are utilized to provide the decision maker detailed information for establishing program parameters, conditions, and bounds.

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

planning
decomposition
sensitivity analysis
parametric programming


Generating domain-specific methodical knowledge for requirement analysis based on methodology ontology A methodology ontology is proposed to help requirement analysis. It helps the software engineer to generate methodical knowledge for requirement analysis (RA). It includes a method library and a set of modeling support entities. The method library contains method templates and components, e.g., primitive methods, inference functions, inference structures, domain models, and a domain ontology. The modeling support entities use the library to construct the desired methodical knowledge. An example is given showing how this approach constructs an object-oriented RA method. Thus generated methodical knowledge can be further coupled with domain knowledge to form a domain-specific RA tool, which relieves the software engineer of selecting and applying a distinct RA tool for a domain. This approach allows ready enhancement, since it is designed as an open architecture, which helps us to evolve it to assimilate new software methodology. (C) 1999 Elsevier Science Inc. All rights reserved.

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

methodology ontology
requirement analysis
methodical knowledge


Acceleration of Differential Power Analysis through the Parallel Use of GPU and CPU This paper proposes methods for accelerating DPA by using the CPU and the GPU in a parallel manner. The overhead of naive DPA evaluation software increases excessively as the number of points in a trace or the number of traces is enlarged due to the rapid increase of file I/O overhead. This paper presents some techniques, with respect to DPA-arithmetic and file handling, which can make the overhead of DPA software become not extreme but gradual as the increase of the amount of trace data to be processed. Through generic experiments, we show that the software, equipped with the proposed methods, using both CPU and GPU can shorten the time for evaluating the DPA resistance of devices by almost half.

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

compute unified device architecture (cuda)


Executing tree routing algorithms on a high-performance pattern associative router In this paper a novel programmable approach to execute implicit routing algorithms is presented. The proposed router is based on an associative scheme that uses the attributes of the routing algorithm and the interconnection network topology. In this approach routing algorithms are mapped (or programmed) onto a set of bit-patterns that are matched in parallel. To show the applicability of this router, we have selected oblivious and fault-tolerant routing algorithms for ten different tree interconnection network topologies; however, the proposed scheme is flexible enough to accommodate other network topologies and routing algorithms. For the studied topologies, the number of required bit-patterns is of the same order as the topology degree. The proposed organization requires only one comparison and one read delays. This in turn yields a high-speed port assignment that is comparable to single topology routers (non-flexible routers). In the context of flexible router schemes, the proposed approach not only is one of the fastest but also requires a very small amount of hardware for its implementation.

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

routing algorithm execution
interconnection networks
pattern associative memories
oblivious routing
fault-tolerant routing
flexible routers


Preserving correctness during business process model configuration A configurable process model captures a family of related process models in a single artifact. Such models are intended to be configured to fit the requirements of specific organizations or projects, leading to individualized process models that are subsequently used for domain analysis or solution design. This article proposes a formal foundation for individualizing configurable process models incrementally, while preserving correctness, both with respect to syntax and behavioral semantics. Specifically, assuming the configurable process model is behaviorally sound, the individualized process models are guaranteed to be sound. The theory is first developed in the context of Petri nets and then extended to a process modeling notation widely used in practice, namely Event-driven Process Chains.

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

configurable process model
configuration


Practical Password-Authenticated Three-Party Key Exchange Password-based authentication key exchange (PAKE) protocols in the literature typically assume a password that is shared between a client and a server. PAKE has been applied in various environments, especially in the "client-server" applications of remotely accessed systems, such as e-banking. With the rapid developments in modern communication environments, such as ad-hoc networks and ubiquitous computing, it is customary to construct a secure peer-to-peer channel, which is quite a different paradigm from existing paradigms. In such a peer-to-peer channel, it would be much more common for users to not share a password with others. In this paper, we consider password-based authentication key exchange in the three-party setting, where two users do not share a password between themselves but only with one server. The users make a session-key by using their different passwords with the help of the server. We propose an efficient password-based authentication key exchange protocol with different passwords that achieves forward secrecy in the standard model. The protocol requires parties to only memorize human-memorable passwords; all other information that is necessary to run the protocol is made public. The protocol is also light-weighted, i.e., it requires only three rounds and four modular exponentiations per user. In fact, this amount of computation and the number of rounds are comparable to the most efficient password-based authentication key exchange protocol in the random-oracle model. The dispensation of random oracles in the protocol does not require the security of any expensive signature schemes or zero-knowlegde proofs.

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

cryptography
provably security
three-party setting
dictionary attacks
undetectable dictionary attacks


1-out-of-2 signature We consider a scenario in which Alice entitles Bob to serve as her proxy with the right to sign one out of two possible documents, say m 1 and m 2 . The protocol guarantees that the data given to Bob cannot be recognized as signatures of m 1 and m 2 , unless Bob transforms them with his private key. The most important feature is, however, then if Bob finalizes both signatures (of m 1 and of m 2 ) - violating the delegated rights, then Bob's private key will be revealed to Alice. So we propose an undeniable proof of misbehavior instead of other means that turn out to be less effective and more difficult to implement. The presented solution can be applied for providing agents or representatives in negotiations to provide the original signed documents on behalf of represented parties. The solution can be immediately extended to a version with any fixed number of documents, from which only one can be signed finally. Security of the scheme can be shown in random oracle model. We also provide a solution, for which security of the signer is protected within the fail-stop framework.

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

limited transformation
proxy signature
undeniability


Reconfigurable content-based router using hardware-accelerated language parser This article presents a dense logic design for matching multiple regular expressions with a field programmable gate array ( FPGA) at 10+ Gbps. It leverages on the design techniques that enforce the shortest critical path on most FPGA architectures while optimizing the circuit size. The architecture is capable of supporting a maximum throughput of 12.90 Gbps on a Xilinx Virtex 4 LX200 and its performance is linearly scalable with size. Additionally, this article presents techniques for parsing data streams to provide semantic information for patterns found within a data stream. We illustrate how a content-based router can be implemented with our parsing techniques using an XML parser as an example. The content-based router presented was designed, implemented, and tested in a Xilinx Virtex XCV2000E FPGA on the FPX platform. It is capable of processing 32- bits of data per clock cycle and runs at 100 MHz. This allows the system to process and route XML messages at 3.2 Gbps.

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


A hybrid Newton method for solving the variational inequality problem via the D-gap function The variational inequality problem (VIP) can be reformulated as an unconstrained minimization problem through the D-gap function. It is proved that the D-gap function has bounded level sets for the strongly monotone VIP. A hybrid Newton-type method is proposed for minimizing the D-gap function. Under some conditions, it is shown that the algorithm is globally convergent and locally quadratically convergent.

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

d-gap function
newton's method
unconstrained optimization
global convergence
quadratic convergence


using formal methods for security in the xenon project This paper reports on the Xenon project's use of formal methods. Xenon is a higher-assurance secure hypervisor based on re-engineering the Xen open-source hypervisor. The Xenon project used formal specifications both for assurance and as guides for security re-engineering. We formally modeled the fundamental definition of security, the hyper-call interface behavior, and the internal modular design. We used 3 formalisms: CSP, Z, and Circus for this work. Circus is a combination of Standard Z, CSP, with its semantics given in Hoare and He's unifying theories of programming. Circus is suited for both event-based and state-based modeling. In this extended abstract, we report our experiences with using these formalisms for assurance.

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

open-source
information-flow security
circus refinement


fusion of multiple features for chinese named entity recognition based on crf model This paper presents the ability of Conditional Random Field (CRF) combining with multiple features to perform robust and accurate Chinese Named Entity Recognition. We describe the multiple feature templates including local feature templates and global feature templates used to extract multiple features with the help of human knowledge. Besides, we show that human knowledge can reasonably smooth the model and thus the need of training data for CRF might be reduced. From the experimental results on People's Daily corpus, we can conclude that our model is an effective pattern to combine statistical model and human knowledge. And the experiments on another data set also confirm the above conclusion, which shows that our features have consistence on different testing data.

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

multiple features
named entity recognition
conditional random field


Identity-based strong designated verifier signature schemes: Attacks and new construction A strong designated verifier signature scheme makes it possible for a signer to convince a designated verifier that she has signed a message in such a way that the designated verifier cannot transfer the signature to a third party, and no third party can even verify the validity of a designated verifier signature. We show that anyone who intercepts one signature can verify subsequent signatures in Zhang-Mao ID-based designated verifier signature scheme and Lal-Verma ID-based designated verifier proxy signature scheme. We propose a new and efficient ID-based designated verifier signature scheme that is strong and unforgeable. As a direct corollary, we also get a new efficient ID-based designated verifier proxy signature scheme.

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

designated verifier signature
proxy signature

identity base cryptography
identity-based signature
bilinear parirings


Visual Person Identification Using a Distance-dependent Appearance Model for a Person Following Robot This paper describes a person identification method for a mobile robot which performs specific person following under dynamic complicated environments like a school canteen where many persons exist. We propose a distance-dependent appearance model which is based on scale-invariant feature transform (SIFT) feature. SIFT is a powerful image feature that is invariant to scale and rotation in the image plane and also robust to changes of lighting condition. However, the feature is weak against affine transformations and the identification power will thus be degraded when the pose of a person changes largely. We therefore use a set of images taken from various directions to cope with pose changes. Moreover, the number of SIFT feature matches between the model and an input image will decrease as the person becomes farther away from the camera. Therefore, we also use a distance-dependent threshold. The person following experiment was conducted using an actual mobile robot, and the quality assessment of person identification was performed.

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

scale-invariant feature transform (sift) feature


Inverse problem for coefficient identification in the Euler-Bernoulli equation A special technique has been developed for the identification of the solution and the unknown coefficient in the Euler-Bernoulli equation. The original problem of the unknown coefficient identification from over-posed data is transferred into a higher-order well-posed problem following the idea of the Method of Variational Imbedding. The new boundary value problem is solved by means of an iterative finite difference scheme. The scheme is thoroughly validated and is shown to have a second-order truncation error. (C) 2009 Elsevier Ltd. All rights reserved.

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

inverse problem
coefficient identification
method of variational imbedding


Membership values in arrow categories In this paper we consider an internal representation of the lattice of membership values used by the relations in an arbitrary arrow category. This is achieved by defining a more general construction that pairs regular with membership values in one object. We will show basic properties of this construction including its relationship to the lattice of membership values. This characterization of the lattice of membership values allows to specify and reason about the lattice elements as elements of an object of the category. Furthermore, this representation also leads to an abstract approach to higher-order fuzziness based on arrow categories.

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

goguen category
dedekind category
type-2 fuzzy relation


Robust ? ? -filter using support vector machines This Letter presents a new approach to time-series modelling using the support vector machines (SVM). Although the ? ? -filter can provide stability in several time-series models, the SVM is proposed here to provide robustness in the estimation of the ? ? -filter coefficients. Examples in chaotic time-series prediction and channel equalization show the advantages of the joint SVM ? ? -filter.

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

support vector machines
channel equalization

? ? -filter ? ? ? ? ?
iterated prediction


Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions A Rosenbrock artificial bee colony algorithm (RABC) that combines Rosenbrocks rotational direction method with an artificial bee colony algorithm (ABC) is proposed for accurate numerical optimization. There are two alternative phases of RABC: the exploration phase realized by ABC and the exploitation phase completed by the rotational direction method. The proposed algorithm was tested on a comprehensive set of complex benchmark problems, encompassing a wide range of dimensionality, and it was also compared with several algorithms. Numerical results show that the new algorithm is promising in terms of convergence speed, success rate, and accuracy. The proposed RABC is also capable of keeping up with the direction changes in the problems.

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

evolutionary computation
rosenbrock method
unconstrained optimization
memetic algorithm


Fuzzy Based Packet Dropping Scheme in Wireless Cellular Networks Wireless multimedia networks are becoming very popular owing to the user demands for multimedia services. Packet dropping in the event of buffer congestion is one of the important issue in wireless multimedia networks. A packet dropping scheme has to be flexible and adaptive such that acceptable quality of an application is maintained. The paper presents a fuzzy based packet dropping scheme for wireless multimedia networks. A buffer manager placed at the base station performs packet dropping depending upon the traffic conditions and type of an application. Packet dropping is performed by computing dropping factor by considering packet priority, queue length and adaptive queue length threshold. The adaptive queue length threshold is used to dynamically adjust the dropping factor. The queue length threshold is varied by using two fuzzy input parameters, channel condition and rate of flow of an application. The scheme has been extensively simulated to test the performance in terms of acceptance and dropping probability of real-time handoff and new calls.

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


controlled propagation in continuous numerical constraint networks Local consistency is usually enforced on continuous constraints by decomposing them beforehand into so-called primitive constraints. It has long been observed that such a decomposition drastically slows down the computation of solutions. Five years ago, Benhamou et al. introduced an algorithm that avoids formally decomposing constraints, and whose efficiency is often on a par with state-of-the-art methods. It is shown here that this algorithm implements a strategy to enforce on a continuous constraint a consistency akin to directional bounds consistency as introduced by Dechter and Pearl for discrete problems. The actual impact of decomposition is also thoroughly analyzed by means of new experimental results.

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

constraint propagation
directional consistency


Evaluating Sketchiness as a Visual Variable for the Depiction of Qualitative Uncertainty We report on results of a series of user studies on the perception of four visual variables that are commonly used in the literature to depict uncertainty. To the best of our knowledge, we provide the first formal evaluation of the use of these variables to facilitate an easier reading of uncertainty in visualizations that rely on line graphical primitives. In addition to blur, dashing and grayscale, we investigate the use of 'sketchiness' as a visual variable because it conveys visual impreciseness that may be associated with data quality. Inspired by work in non-photorealistic rendering and by the features of hand-drawn lines, we generate line trajectories that resemble hand-drawn strokes of various levels of proficiency-ranging from child to adult strokes-where the amount of perturbations in the line corresponds to the level of uncertainty in the data. Our results show that sketchiness is a viable alternative for the visualization of uncertainty in lines and is as intuitive as blur; although people subjectively prefer dashing style over blur, grayscale and sketchiness. We discuss advantages and limitations of each technique and conclude with design considerations on how to deploy these visual variables to effectively depict various levels of uncertainty for line marks.

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

uncertainty visualization
qualitative evaluation
quantitative evaluation


Application of the asymptotic solution to EM field scattering problem for creation of media with prescribed permeability Scattering of electromagnetic (EM) waves by many small impedance particles (bodies), embedded in a homogeneous medium, is studied. Physical properties of the particles are described by their boundary impedances. The limiting equation is obtained for the effective EM field in the limiting medium, in the limit a?0, where a is the characteristic size of a particle and the number M(a) of the particles tends to infinity at a suitable rate. The proposed theory allows one to create a medium with a desirable spatially inhomogeneous permeability. The main new physical result is the explicit analytical formula for the permeability ?(x) of the limiting medium. The computational results confirm a possibility to create the media with various distributions of ?(x).

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


On Local Properties of Summability of Fourier Series In this note we have improved the result of Sulaiman [2] on local property of absolute weighted mean summability with index delta and k, of factored Fourier series by proving under weaker conditions.

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


A cooperative multi-agent platform for invention based on patent document analysis and ontology We propose a cooperative multi-agent platform to support the invention process based on the patent document analysis. It helps industrial knowledge managers to retrieve and analyze existing patent documents and extract structure information from patents with the aid of ontology and natural language processing techniques. It allows the invention process to be carried out through the cooperation and coordination among software agents delegated by the various domain experts in the complex industrial R&D environment. Furthermore, it integrates the patent document analysis with the inventive problem solving method known as TRIZ method that can suggest invention directions based on the heuristics or principles to resolve the contradictions among design objectives and engineering parameters. We chose the patent invention for chemical mechanical polishing (CMP) as our case study. However, the platform and techniques could be extended to most cooperative invention domains.

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

patent document analysis
cooperative invention
ontology

patent claims information extraction
multi-agent systems


A TWO-STAGE WINWIN MULTIATTRIBUTE NEGOTIATION MODEL: OPTIMIZATION AND THEN CONCESSION Many automated negotiation models have been developed to solve the conflict in many distributed computational systems. However, the problem of finding winwin outcome in multiattribute negotiation has not been tackled well. To address this issue, based on an evolutionary method of multiobjective optimization, this paper presents a negotiation model that can find winwin solutions of multiple attributes, but needs not to reveal negotiating agents private utility functions to their opponents or a third-party mediator. Moreover, we also equip our agents with a general type of utility functions of interdependent multiattributes, which captures human intuitions well. In addition, we also develop a novel time-dependent concession strategy model, which can help both sides find a final agreement among a set of winwin ones. Finally, lots of experiments confirm that our negotiation model outperforms the existing models developed recently. And the experiments also show our model is stable and efficient in finding fair winwin outcomes, which is seldom solved in the existing models.

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

multiattribute decision making
agent
e-business
evolutionary computing


Set-membership filtering for polytopic uncertain discrete-time systems In this paper, a set-membership filtering problem is considered for systems with polytopic uncertainty. A recursive algorithm for calculating an ellipsoid which always contains the state is developed. In the prediction step, a predicted state ellipsoid is determined; in the update step, a state estimation ellipsoid is computed by combining the predicted state ellipsoid and the set of states compatible with the measurement equation. A smallest possible estimate set is calculated recursively by solving the semi-definite programming problems. Hence, the proposed set-membership filter relies on a two-step prediction-correction structure, which is similar to the Kalman filter. Simulation results are provided to demonstrate 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 B I 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 B I I O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

predicted state ellipsoid
state estimation ellipsoid
polytopic uncertainty

set-membership filtering
semi-definite programming


Efficient MR image reconstruction for compressed MR imaging In this paper, we propose an efficient algorithm for MR image reconstruction. The algorithm minimizes a linear combination of three terms corresponding to a least square data fitting, total variation (TV) and L1 norm regularization. This has been shown to be very powerful for the MR image reconstruction. First, we decompose the original problem into L1 and TV norm regularization subproblems respectively. Then, these two subproblems are efficiently solved by existing techniques. Finally, the reconstructed image is obtained from the weighted average of solutions from two subproblems in an iterative framework. We compare the proposed algorithm with previous methods in term of the reconstruction accuracy and computation complexity. Numerous experiments demonstrate the superior performance of the proposed algorithm for compressed MR image reconstruction.

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


FoDoSu: Multi-document summarization exploiting semantic analysis based on social Folksonomy A novel multi-document summarization system that employs the tag cluster on Flickr. The FoDoSu detects meaningful words by exploiting tag cluster for summarizing multi-documents. We demonstrate the superiority of FoDoSu through experiments on TAC2008 and TAC2009.

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

folksonomy
tag cluster
semantic analysis


Exploration of the performance of a data mining application via hardware based monitoring The performance of software on modern architectures has grown more and more difficult to predict and analyze, as modern microprocessors have grown more complex. The execution of a program now entails the complex interaction of code, compiler and processor architecture. The current generation of microprocessors is optimized to an existing set of commercial and scientific benchmarks but new applications such as data mining are becoming a significant part of the workload. In this paper we explore the use of performance monitoring hardware to analyze the execution of C4.5, a data mining application, on the IBM Power2 architecture. We see how the data gathered by the hardware can be used to identify potential changes that can be made to the program and the processor micro-architecture to improve performance. We then go on to evaluate changes to C4.5 and to the micro-architecture. Based on our experience, we identify issues that limit the use of performance monitoring hardware in user level tuning and in extending its use to high performance computing environments.

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

performance
monitoring
application
data mining
tuning


Reliable and efficient equilibrated a posteriori finite element error control in elastoplasticity and elastoviscoplasticity with hardening This paper establishes the reliability and efficiency of equilibrated a posteriori estimates for L2 stress error control of conforming displacement finite element approximations of incremental plasticity and viscoplasticity with hardening. Explicit expressions for upper bounds of the reliability constant that enters the guaranteed upper error bound illustrate its crucial dependence on the hardening material constants. Numerical experiments show that adaptive finite element solutions with marking strategy based on the max-refinement rule and local equilibrated error estimators lead to optimal empirical convergence rates.

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

elastoviscoplasticity hardening reliability efficiency

finite element method
a posteriori error estimate
adaptive algorithms


Manifold-based canonical correlation analysis for wireless sensor network localization Signal-strength-based location estimation in wireless sensor networks is to locate the physical positions of unknown sensors via the received signal strengths. In this field, there are few localization researches sufficiently exploiting topology structures of the network in both signal space and physical space. The goal of this paper is to first establish two effective localization models based on specific manifold (or local) structures of both signal space and physical (location) space by using our previous locality preserving canonical correlation analysis (LPCCA) model and a newly-proposed locality correlation analysis (LCA) model, and then develop their corresponding novel location algorithms, called location estimationLPCCA (LELPCCA) and location estimationLCA (LELCA). Since both LPCCA and LCA relatively sufficiently take into account locality characteristics of the manifold structures in both the spaces, our localization algorithms developed from them consequently achieve better localization accuracy than other publicly available advanced algorithms. Copyright (C) 2011 John Wiley & Sons, Ltd.

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

locality preserving canonical correlation analysis (lpcca)


Minimal energy asynchronous dynamic adders In battery-operated portable-or implantable digital devices, where battery life needs to be maximized, it is necessary to minimize not only power consumption but also energy dissipation. Typical energy optimization measures include voltage reduction and operating at the slowest possible speed. We employ additional methods, including hybrid asynchronous dynamic design to enable operating over a wide range of battery voltage, aggregating large combinational logic blocks, and transistor sizing and reordering. We demonstrate the methods on simple adders, and discuss extension to other circuits. Three novel adders are proposed and analyzed: a 2-bit pass transistor logic (PTL) adder and two dynamic 2-bit adders. Circuit simulations on a 0.18-mu m process at low voltage show that leakage energy is below 1%. The proposed adders achieve up to 40% energy savings relative to previously published results, while also operating faster.

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

asynchronous logic
dual-rail
low energy
single-rail


Track based relevance feedback for tracing persons in surveillance videos ? While surveillance cameras are a powerful tool for the prevention, detection and resolving of crimes, for most cases the amount of video data has become unmanageable. To ease the analysis, various automatic methods have been proposed, focusing on data-management, detecting suspicious behavior, person recognition, or event reconstruction. In this paper we focus on event reconstruction, in particular on tracing the whereabouts of people. The standard approach for such event reconstruction is to first detect persons in single frames and then match a query to all detections to retrieve the same person in multiple cameras. However, since the number of detected persons is large and performance of matching techniques limited, this process is slow and prone to errors. Intelligent interactive techniques are urged for. We propose to represent detected persons by their complete track within a single camera instead of a single detection and thereby reduce the search-space. On these tracks we use Relevance Feedback to improve recall with only a small effort of the user. Testing the tracking method on a benchmark dataset and a real-life dataset led to a reduction of the search space of 90%, while tracing accuracy based on the distance between tracks improved recall by up to 110% when compared to random tracing. Adding Relevance Feedback led to an additional improvement in recall of up to 400% compared to sequential scanning using the same number of visual assessments.

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

surveillance
event reconstruction
relevance feedback


Tlib - a library to support programming with hierarchical multi-processor tasks The paper considers the modular programming with hierarchically structured multi-processor tasks on top of SPMD tasks for distributed memory machines. The parallel execution requires a corresponding decomposition of the set of processors into a hierarchical group structure onto which the tasks are mapped. The result is a multi-level group SPMD computation model with varying processor group structures. The advantage of this kind of mixed task and data parallelism is a potential to reduce the communication overhead and to increase scalability. We present a runtime library to support the coordination of hierarchically structured multi-processor tasks. The library exploits an extended parallel group SPMD programming model and manages the entire task execution including the dynamic hierarchy of processor groups. The library is built on top of MPI, has an easy-to-use interface, and leads to only a marginal overhead while allowing static planning and dynamic restructuring. (c) 2004 Elsevier Inc. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 task and data parallelism
multilevel group spmd
distributed memory

hierarchical decomposition of processor sets


Deformable models with sparsity constraints for cardiac motion analysis We propose a new class of deformable models using sparse regularization. It is able to handle gross errors or outliers robustly and adaptively during deformation. It is formulated as convex optimization problems, and solved by harnessing sparse structures. We apply this method to tackle a challenging problem, i.e., mouse LV motion analysis using tMRI.

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

deformable models
sparse regularization
cardiac motion analysis


Sectoral sierpinski gasket fractal antenna for wireless LAN applications A sectoral Sierpinski Gasket fractal (SSGF) antenna is proposed for dual-band operation with wide-bandwidth covering GPS, DCS-1800, PCS-1800, UMTS, IMT-2000, Wireless broadband Internet Services (WiBro), Bluetooth, and WLAN bands. The SSGF antenna consists of volume 65.5 27 1.6 mm3. To analyze its performance, measurements are carried out. The proposed antenna model exhibits resonances in 1.513.39 GHz (2:1 VSWR BW 76.6%) and 5.316.32 GHz (2:1 VSWR BW 17.3%) bands with 2.55 dBi gain. Very good agreement is obtained between simulation and experimental results. 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2012.

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

microstrip antenna
sectoral geometry
dual-wideband


An expert system to derive carryover effect for pharmaceutical sales detailing optimization Most pharmaceutical companies that rely heavily on their sales force for success do not fully understand the effect of details made in previous quarters have on the current quarter, which is also known as the carryover effect. This paper proposes an expert system that utilizes neural networks with nonlinear programming to accurately derive the carryover effect at the customer level. Results suggest that using this adaptive and easy-to-implement expert system helped a firm increase its sales by 3.4% while reducing its sales force expenditure by 8.9%, compared to the control group. The implications of this approach are considered.

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

carryover effect
expert system
neural networks
nonlinear programming


Ties with government, strategic capability, and organizational ambidexterity: evidence from Chinas information communication technology industry Organizations that are capable of pursuing exploration and exploitative innovation strategies simultaneously have demonstrated superior performance. For information and communication technology (ICT) firms, it is especially critical to achieve such organizational ambidexterity in order to both allocate limited resources and pursue different innovation strategies appropriately. As the ICT industry in China faces higher environmental uncertainty, a less developed institutional framework, and increased power of market competition, we explore the antecedents of ambidexterity conjointly, considering the effects of institutions and organizational capabilities. Building on ambidexterity literature, we develop a capability-building framework to explore firms strategic choice-making between exploratory innovation strategy versus exploitation innovation strategy, and their orientation to pursuit one, or both. With survey data from Chinas ICT industry, we find that ties with government promote an ambidextrous focus on both types of innovation strategies. In addition, we find that strategic capability partially mediates the main effects of ties with government on both exploratory and exploitative innovation strategies. Implications for organizational ambidexterity in Chinas ICT industry are discussed.

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


Software prefetching for mark-sweep garbage collection: Hardware analysis and software redesign Tracing garbage collectors traverse references from live program variables, transitively tracing out the closure of live objects. Memory accesses incurred during tracing are essentially random: a given object may contain references to any other object. Since application heaps are typically much larger than hardware caches, tracing results in many cache misses. Technology trends will make cache misses more important, so tracing is a prime target for prefetching. Simulation of Java benchmarks running with the Boehm-Demers-Weiser mark-sweep garbage collector for a projected hardware platform reveal high tracing overhead (up to 65% of elapsed time), and that cache misses are a problem. Applying Boehm's default prefetching strategy yields improvements in execution time (16% on average with incremental/generational collection for GC-intensive benchmarks), but analysis shows that his strategy suffers from significant timing problems: prefetches that occur too early or too late relative to their matching loads. This analysis drives development of a new prefetching strategy that yields up to three times the performance improvement of Boehm's strategy for GC-intensive benchmarks (27% average speedup), and achieves performance close to that of perfect timing (ie, few misses for tracing accesses) on some benchmarks. Validating these simulation results with live runs on current hardware produces average speedup of 6% for the new strategy on GC-intensive benchmarks with a GC configuration that tightly controls heap growth. In contrast, Boehm's default prefetching strategy is ineffective on this platform.

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

cache architecture
mark-sweep
prefetch-on-grey
buffered prefetch
depth-first
breadth-first


Non-crossing matchings of points with geometric objects ? Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between pointobject pairs. In this paper, we address the algorithmic problem of determining whether a non-crossing matching exists between a given pointobject pair. We show that when the objects we match the points to are finite point sets, the problem is NP-complete in general, and polynomial when the objects are on a line or when their size is at most 2. When the objects are line segments, we show that the problem is NP-complete in general, and polynomial when the segments form a convex polygon or are all on a line. Finally, for objects that are straight lines, we show that the problem of finding a min-max non-crossing matching is NP-complete.

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


On approximation measures for functional dependencies We examine the issue of how to measure the degree to which a functional dependency (FD) is approximate. The primary motivation lies in the fact that approximate FDs represent potentially interesting patterns existent in a table. Their discovery is a valuable data mining problem. However, before algorithms can be developed, a measure must be defined quantifying their approximation degree. First we develop an approximation measure by axiomatizing the following intuition: the degree to which X?Y is approximate in a table T is the degree to which T determines a function from ?X(T) to ?Y(T). We prove that a unique unnormalized measure satisfies these axioms up to a multiplicative constant. Next we compare the measure developed with two other measures from the literature. In all but one case, we show that the measures can be made to differ as much as possible within normalization. We examine these measure on several real datasets and observe that many of the theoretically possible extreme differences do not bear themselves out. We offer some conclusions as to particular situations where certain measures are more appropriate than others.

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

functional dependency
approximation measures


mining for misconfigured machines in grid systems Grid systems are proving increasingly useful for managing the batch computing jobs of organizations. One well-known example is Intel, whose internally developed NetBatch system manages tens of thousands of machines. The size, heterogeneity, and complexity of grid systems make them very difficult, however, to configure. This often results in misconfigured machines, which may adversely affect the entire system.We investigate a distributed data mining approach for detection of misconfigured machines. Our Grid Monitoring System (GMS) non-intrusively collects data from all sources (log files, system services, etc.) available throughout the grid system. It converts raw data to semantically meaningful data and stores this data on the machine it was obtained from, limiting incurred overhead and allowing scalability. Afterwards, when analysis is requested, a distributed outliers detection algorithm is employed to identify misconfigured machines. The algorithm itself is implemented as a recursive workflow of grid jobs. It is especially suited to grid systems, in which the machines might be unavailable most of the time and often fail altogether.

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

distributed data mining
grid systems
outliers detection

system monitoring
grid information system


Robotic palpation and mechanical property characterization for abnormal tissue localization Palpation is an intuitive examination procedure in which the kinesthetic and tactile sensations of the physician are used. Although it has been widely used to detect and localize diseased tissues in many clinical fields, the procedure is subjective and dependent on the experience of the individual physician. Palpation results and biomechanics-based mechanical property characterization are possible solutions that can enable the acquisition of objective and quantitative information on abnormal tissue localization during diagnosis and surgery. This paper presents an integrated approach for robotic palpation combined with biomechanical soft tissue characterization. In particular, we propose a new palpation method that is inspired by the actual finger motions that occur during palpation procedures. To validate the proposed method, robotic palpation experiments on silicone soft tissue phantoms with embedded hard inclusions were performed and the force responses of the phantoms were measured using a robotic palpation system. Furthermore, we carried out a numerical analysis, simulating the experiments and estimating the objective and quantitative properties of the tissues. The results indicate that the proposed approach can differentiate diseased tissue from normal tissue and can characterize the mechanical information of diseased tissue, which means that this method can be applied as a means of abnormality localization to diagnose prostate cancers.

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

robotic palpation
mechanical property characterization
abnormal tissue localization


A robust real-time algorithm for facial shape recovery from a single image containing cast shadow under general, unknown lighting It is difficult to find a non-iterative solution for statistical shape from shading (SFS) for a single image containing cast shadow under unknown, arbitrary light conditions. This is because it is not trivial to find a mapping from a convex cone in the image space to a point in the depth space. To find a non-iterative solution for the statistical SFS, which has not been done yet to our knowledge, we show that it is possible to approximate a cone of images (illumination cone) to a polytope by a nonlinear function, which is a transform from Cartesian coordinates to hyperspherical coordinates. The images of a subject form a convex cone in the image space, and it can be better to use the direction of an image in hyperspherical coordinates as an input feature for the mapping rather than the image itself. The maximum error occurs on one of the vertices of the polytope if we choose the objective function to be the squared error of a linear function in the hyperspherical space. Hence, we can solve the least square problem using the cost only for the vertices. In deriving the solution, we use the generalized Rayleigh quotient, canonical correlation analysis (CCA), and prior information on input images, to reduce the solution space and improve 3-D reconstruction performance. In experiments, the proposed scheme performs robustly under light variations, and is fast enough for real-time applications.

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

facial shape recovery
shape from shading


A generalized multiple projection axes method for fast encoding of vector quantization The encoding process of vector quantization (VQ) is computationally very expensive due to a lot of k-dimensional Euclidean distance computations. In order to speed up VQs encoding process, it is very effective to use a computationally inexpensive distance estimation first to try to reject a candidate codeword instead of an immediate actual distance computation. If a successful rejection is achieved, the computational burden can be reduced because the actual distance computation becomes unnecessary. A very search-efficient VQ encoding method by using multiple projection axes has already been developed in the previous work, which is a general version of the central axis. In this paper, a further generalized version of this previous work is proposed, which can completely remove the constraints for selecting the projection axis in a diagonally symmetric way as required by the previous work. Meanwhile, a theoretical criterion of how to select an optimal projection axis for a candidate codeword is also given. Furthermore, in order to use the generalized multi projection axes simultaneously, the energy accumulation property in an orthogonal space is integrated. Experimental results confirmed the effectiveness of the proposed method.

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


Perceptive admission control for wireless network quality of service As wireless networks become more widely used, there is a growing need to support advanced services, such as multimedia streaming and voice over IP. Traditional approaches to guarantee quality of service (QoS) work well only with predictable channel and network access. In wireless mobile networks, where conditions dynamically change as nodes move about the network, a stateless, high level approach is required. Since shared wireless resources are easily over-utilized, the load in the network must be controlled so that an acceptable QoS for real-time applications can be maintained. If minimum real-time requirements are not met, these unusable packets waste scarce bandwidth and hinder other traffic, compounding the problem. To enable high QoS for all admitted traffic, we propose the Perceptive Admission Control (PAC) protocol. PAC monitors the wireless channel and dynamically adapts admission control decisions to enable high network utilization while preventing congestion. Through discussion, simulations and testbed experiments, we demonstrate that PAC ensures low packet loss and delay for all admitted flows.

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

wireless
mobile
quality of service
admission control


Stray field due to eddy currents on a cylinder with azimuthal cuts - A comparative analysis of the cut shape effect The paper deals with the design of azimuthal cuts on a conducting cylinder. It analyses the effect of various cut shapes in minimising the stray magnetic field in the cut region, when an orthogonal magnetic field is penetrating through the cylinder. Both an analytical model and a finite element code are used for the analyses in the time and frequency domain. Results from both methods are compared and a fairly good agreement is found The non-linearly tapered cut results as the best solution for minimising the stray field.

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


Vertical Handover Over Intermediate Switching Framework: Assuring Service Quality for Mobile Users Ensuring quality of service (QoS) for the mobile users during vertical handover between IEEE 802.11 wireless local area networks (WLAN) and data network provided by Ultramodern Telecommunication Systems (UMTS) is one of the key requirements for seamless mobility and transfer of existing connections from one network to another. QoS fulfillment is a complex problem and requires participation of both the mobile users as well as the connection networks. The QoS assurance criteria for existing connections can be affected by fluctuations of data rates when a user moves from the high speed WLAN network to the low speed UMTS network, even in the presence of another WLAN network in its vicinity. This can happen if the alternate WLAN network is highly loaded. Therefore handover from a high speed network to a low speed network should be avoided, whenever possible. This paper proposes a QoS based handover procedure that prioritizes the existing connection over the new connections so that rate fluctuations due to handover can be avoided if there exist another WLAN network in the range of the mobile user. Whenever the possibility of handover is detected, a pre-handover bandwidth reservation technique is used to reserve bandwidth at the alternate WLAN networks to avoid QoS degradation. The proposed scheme is implemented in Qualnet network simulator and the performance is analyzed and compared with traditional handover techniques.

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

qos
vertical handover
bandwidth reservation