Image denoising and deblurring: non-convex regularization, inverse diffusion and shock filter A large number of applications in image processing and computer vision depend on image quality. In this paper, main concerns are image denoising and deblurring simultaneously in a restoration task by three types of methodologies: non-convex regularization, inverse diffusion and shock filter. We discuss their relations in the context of image deblurring: the inverse diffusion implied by the non-convex regularization, and the superior ability of deblurring edge of the shock filter to that of the inverse diffusion, both in 1D and 2D cases. Finally, we propose a region-based adaptive anisotropic diffusion with shock filter method, which shows advantages of deblurring edges, denoising and smoothing contours in experiments, compared with some related methods. Therein an idea of "divide and rule" is introduced.

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

image denoising
image deblurring
inverse diffusion
shock filter
adaptive anisotropic diffusion


Strategic investment under uncertainty: A synthesis Investment is a central theme in economics, finance, and operational research. Traditionally, the focus of analysis has been either on assessing the value of flexibility (investment under uncertainty) or on describing commitment effects in competitive settings (industrial organization). Research contributions addressing the intersection of investment under uncertainty and industrial organization have become numerous in recent years. In this paper, we provide an overview aimed at categorizing and relating these research streams. We highlight managerial insights concerning the nature of competitive advantage (first- versus second-mover advantage), the manner in which information is revealed, firm heterogeneity, capital increment size, and the number of competing firms.

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

investment analysis
real options
option games


a unified model for metasearch, pooling, and system evaluation We present a unified model which, given the ranked lists of documents returned by multiple retrieval systems in response to a given query, simultaneously solves the problems of (1) fusing the ranked lists of documents in order to obtain a high-quality combined list (metasearch); (2) generating document collections likely to contain large fractions of relevant documents (pooling); and (3) accurately evaluating the underlying retrieval systems with small numbers of relevance judgments (efficient system assessment). Our approach is based on the Hedge algorithm for on-line learning. In effect, our proposed system "learns" which documents are likely to be relevant from a sequence of on-line relevance judgments. In experiments using TREC data, our methodology is shown to outperform standard methods for metasearch, pooling, and system evaluation, often remarkably so.

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

assessment order evaluation systems methodology pooling retrieval data relevance response learning algorithm model metasearch effect sequence query

quality
method
efficiency
collect
standardization
active learning
experience
documentation


Constrained approximation of rational Bzier curves based on a matrix expression of its end points continuity condition For high order interpolations at both end points of two rational Bzier curves, we introduce the concept of C(v,u) C ( v , u ) -continuity and give a matrix expression of a necessary and sufficient condition for satisfying it. Then we propose three new algorithms, in a unified approach, for the degree reduction of Bzier curves, approximating rational Bzier curves by Bzier curves and the degree reduction of rational Bzier curves respectively; all are in L2 L 2 norm and C(v,u) C ( v , u ) -continuity is satisfied. The algorithms for the first and second problems can get the best approximation results, and for the third one, resorting to the steepest descent method in numerical optimization obtains a series of degree reduced curves iteratively with decreasing approximation errors. Compared to some well-known algorithms for the degree reduction of rational Bzier curves, such as the uniformizing weights algorithm, canceling the best linear common divisor algorithm and shifted Chebyshev polynomials algorithm, the new one presented here can give a better approximation error, do multiple degrees of reduction at a time and preserve high order interpolations at both end points.

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

rational bzier curves
constrained approximation
degree reduction
numerical optimization

c(v
u) c ( v
u ) -continuity c(v
u ) c(v
u ) c ( v
u )


Bound-based decision rules in multistage stochastic programming We study bounding approximations for a multistage stochastic program with expected value constraints. Two simpler approximate stochastic programs, which provide upper and lower bounds on the original problem, are obtained by replacing the original stochastic data process by finitely supported approximate processes. We model the original and approximate processes as dependent random vectors on a joint probability space. This probabilistic coupling allows us to transform the optimal solution of the upper bounding problem to a near-optimal decision rule for the original problem. Unlike the scenario tree based solutions of the bounding problems, the resulting decision rule is implementable in all decision stages, i.e., there is no need for dynamic reoptimization during the planning period. Our approach is illustrated with a mean-risk portfolio optimization model.

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

stochastic programming
bounds
decision rules
expected value constraints
portfolio optimization


Modeling of Robustness Margins of the Control of a Predictive Control-Supervisory Architecture In this article a new Control-Supervisory architecture of Flexible Manufacturing Systems (FMS) is presented. We are interested particularly in construction and modelling of FMS robust control of flow-shop type to time constraints. Other than the control of production system, the goal is to observe and interpreted the robustness of resources and of manufacturing system. The P-time Petri Nets which is used for modeling of the time constraints. A methodology of construction of a robust control system generating the margins of passive and active robustness is elaborated. The redundancy of the robustness of the elementary parameters between passive and active leads us to define the ways ensuring the total robustness of the system. To do so, a set of definitions lemmas and theorems are developed and affirmed by examples of applications.

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

modeling
robustness
time constraints
fms

control-supervisory architecture
p-time petri nets


Static Analysis of Aspect Interaction and Composition in Component Models Component based software engineering and aspect orientation are claimed to be two complementary approaches. While the former ensures the modularity and the reusability of software entities, the latter enables the modularity of crosscutting concerns that cannot be modularized as regular components. Nowadays, several approaches and frameworks are dedicated to integrate aspects into component models. However, when several aspects are woven, aspects may interact with each other which often results in undesirable behavior. The contribution of this paper is twofold. First, we show how aspectized component models can be formally modeled in UPPAAL model checker in order to detect negative interactions (a.k.a., interferences) among aspects. Second, we provide an extendible catalog of composition operators used for aspect composition. We illustrate our general approach with an airport Internet service example.

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

aspectized component models
aspect composition

languages
verification
aspect interaction analysis


Process of design and usability evaluation of a telepsychology web and virtual reality system for the elderly: Butler Butler is a multi-application system based on Internet technology and virtual reality, designed to meet the needs of elderly users. Its objectives are to assist elderly populations in accessing technology and new forms of communication, replicating, as far as possible the way of lineal interaction that this population group had traditionally to interact with information in order to facilitate the first contacts with technology. Butler is equipped with e-mail, videoconferencing, blogging, access to the Internet through a well-known web search engine, image and sound gallery, new contacts searcher, and two virtual reality environments. In this paper we describe Butler's most relevant features taking into account the usability design process and the usability evaluation of the system, which, after pilot testing, have proven to be highly acceptable and satisfactory to users. We also present the results of evaluations pertaining to the iconography used in the program, the navigation and users' help design process, and the first functional prototype, all of which were designed and redesigned with the aid of web heuristics and guidelines for the web design for elderly users. Results suggest important features to be taken into account when designing and developing this sort of application for the elderly.

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

social network
digital divide
social networking service


Analysis and comparison of three discrete-time feedforward model-inverse control techniques for nonminimum-phase systems Noncollocated sensors and actuators, and/or fast sample rates with plants having high relative degree, can lead to nonminimum-phase (NMP) discrete-time zero dynamics that complicate the control system design. In this paper, we examine three stable approximate model-inverse feedforward control techniques, the nonminimum-phase zeros ignore (NPZ-Ignore), the zero-phase-error tracking controller (ZPETC), and the zero-magnitude-error tracking controller (ZMETC), which have frequently been used for NMP systems. We analyze how the discrete-time NMP zero locations in the z-plane affect the success of the NPZ-Ignore, ZPETC, and ZMETC model-inverse techniques. We also examine the use of low-pass filters with the three model-inversion techniques. Experimental results on the x direction of an AFM piezoscanner are provided to support the discussions. Tips on the use of these three model-inversion discrete-time feedforward methods are presented throughout the paper. (C) 2012 Elsevier Ltd. All rights reserved.

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

model-inverse control
nonminimum-phase zeros
discrete-time
npz-ignore


Intermediary infrastructures for the World Wide Web Intermediaries are software entities, deployed on hosts of the wireline and wireless network, that mediate the interaction between clients and servers of the World Wide Web. In this paper we present a survey of intermediaries, focusing on systems beyond simple caching proxies. We classify different intermediary systems into three categories, based on their functionality and focus: First, we investigate notification intermediaries, which are driven by end-user profiles and operate even in the absence of end-user connection. Then, we study intermediaries developed to support wireless connectivity, mobility, and ubiquity. Finally, we examine intermediary infrastructures designed to extend the support of the core network for the development and deployment of new services. Based on this survey, we propose a detailed taxonomy of intermediaries and identify key features of emerging intermediary infrastructures. Taking into account recent advances and trends in wireless and pervasive Internet technologies, we present a number of research challenges, which need to be addressed in order to integrate intermediary systems in next-generation Internet infrastructures.

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

proxy servers
edge services
personalized and mobile services


Phase oscillator neural network as artificial central pattern generator for robots We design an artificial central pattern generator and we exemplify its integration using different prototypic virtual robot models. The artificial central pattern generator is modeled through a network of phase oscillators. Virtual robots are controlled by this central pattern generator using an interface that interpolates stored angular states of their target poses. Finally, we consider control signals coming from the robot's environment to the central pattern generator and to the interface between the central pattern generator and the robot. We show that the control signals can change the dynamics of the system in order to modify the robot's movement patterns. We study three cases: changing the frequency of the pattern sequences, switching between gaits of locomotion and the reorientation of a robotic entity.

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

central pattern generator
phase oscillators
neural network


Testing the Stability of 2-D Recursive QP, NSHP and General Digital Filters of Second Order Several methods for testing stability of first quadrant quarter-plane two dimensional (2-D) recursive digital filters have been suggested in 1970's and 80's. Though Jury's row and column algorithms, row and column concatenation stability tests have been considered as highly efficient mapping methods. They still fall short of accuracy as they need infinite number of steps to conclude about the exact stability of the filters and also the computational time required is enormous. In this paper, we present procedurally very simple algebraic method requiring only two steps when applied to the second order 2-D quarter - plane filter. We extend the same method to the second order Non-Symmetric Half-plane (NSHP) filters. Enough examples are given for both these types of filters as well as some lower order general recursive 2-D digital filters. We applied our method to barely stable or barely unstable filter examples available in the literature and got the same decisions thus showing that our method is accurate enough.

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


Fuzzy referral based cooperation in social networks of agents Since intelligent agents aim to represent human reasoning and behaviour, multiagent systems are supposed to reflect the collective behaviour of human societies. In human societies, each individual determine who collaborate with, and this selected group forms a social network that will improve the quality of the decisions of individuals. Several models of computation have been proposed in literature. Among them, the approach of the authors relies on the ability of fuzzy logic to operate with vague and uncertain terms. This paper studies how much effective is the cooperation between agents modelled by these proposals in different scenarios. The scenarios test the evolution of the deception caused by overvalued/undervalued predictions, with cooperation of low/high reliability, and with three different levels of variability in the behaviour of the agents evaluated.

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


Integrity of Cell-Free Plasma DNA in Patients with Lung Cancer and Nonmalignant Lung Disease In several papers an increased quantity of cell-free plasma DNA as well as the presence of long DNA fragments in cell-free plasma and serum has been described. We isolated cell-free DNA from plasma, serum, and bronchial lavage supernatants from 33 lung cancer patients and 27 patients with a benign lung disease. The DNA was amplified by real-time PCR, and the quantity as well as the DNA integrity was determined. We did not find significant differences between the patient populations. Our results led us to conclude that this method is not useful in a diagnostic setting and is not able to differentiate between lung cancer patients and patients with a benign lung disease.

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

real-time pcr
cell-free dna
isolation method


Divisible difference sets, relative difference sets and sequences with ideal autocorrelation ? In this correspondence, we consider the equivalent condition that a sequence possesses ideal autocorrelation function. As we know, for a binary sequence, the equivalent condition is that the characteristic class of this sequence consists of two cyclic difference sets. This paper proves that, for a p-ary sequence with d-form property, the equivalent condition is that its characteristic class consists of one cyclic divisible difference sets and p?1 relative difference sets. Moreover, a new way to construct cyclic divisible difference sets is presented.

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

sequences
divisible difference sets
relative difference sets


Inductively coupled plasma etching of a Pb(ZrxTi1?x)O3 thin film in a HBr/Ar plasma The etching of Pb(ZrxTi1?x)O3 (PZT) thin films was performed using HBr/Ar gas in an inductively coupled plasma. The etch rate and etch profile of the PZT films were investigated as a function of the gas concentration of the HBr/Ar mixture. In addition, the etch parameters, including coil power, dc bias and gas pressure, were examined to characterize the etching process of the PZT films. An enhancement of the etch rate with increasing gas concentration was found, which indicates that PZT etching by HBr/Ar follows the reactive ion etching mechanism. It was found that the maximum etch rate and selectivity for Pt films was around 40% HBr under the etch conditions used in this study. From X-ray photoelectron spectroscopy (XPS) analysis, it was observed that the Pb component in PZT solid solution showed a faster etching than the Zr and Ti components. The etch rate and the degree of anisotropy of the PZT films were enhanced by increasing the coil power and dc-bias voltage, and by lowering the gas pressure. An etch rate of 900 /min and a steep etch profile of >70 could be achieved with HBr/Ar chemistry.

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

high-density etching
pb(zrxti1?x)o3 thin film
hbr/ar gas


tracking topological changes in feature models Current feature models do not explicitly represent the relation between the parameters and the topology of the model. For theoretical and practical purposes, it is important to make this relation more explicit. A method is presented here that determines parameter values for which the topology of a feature model changes, i.e. the critical values of a given variant parameter. The considered feature model consists of a system of geometric constraints, relating parameters to feature geometry, and a cellular model. The cellular model partitions Euclidean space into quasi-disjoint cells, determined by the intersections of the feature geometry. Our method creates a new system of geometric constraints to relate the parameters of the model to topological entities in the cellular model. For each entity that is dependent on the variant parameter, degenerate cases are enforced by specific geometric constraints. Solving this system of constraints yields the critical parameter values. Critical values can be used to compute parameter ranges corresponding to families of objects, e.g. all parameter values which correspond to models that satisfy given topological constraints.

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

parametric modelling
constraint solving
families of object
feature modelling


PARTIC: Power-Aware Response Time Control for Virtualized Web Servers Both power and performance are important concerns for enterprise data centers. While various management strategies have been developed to effectively reduce server power consumption by transitioning hardware components to lower power states, they cannot be directly applied to today's data centers that rely on virtualization technologies. Virtual machines running on the same physical server are correlated because the state transition of any hardware component will affect the application performance of all the virtual machines. As a result, reducing power solely based on the performance level of one virtual machine may cause another to violate its performance specification. This paper proposes PARTIC, a two-layer control architecture designed based on well-established control theory. The primary control loop adopts a multi-input multi-output control approach to maintain load balancing among all virtual machines so that they can have approximately the same performance level relative to their allowed peak values. The secondary performance control loop then manipulates CPU frequency for power efficiency based on the uniform performance level achieved by the primary loop. Empirical results demonstrate that PARTIC can effectively reduce server power consumption while achieving required application-level performance for virtualized enterprise servers.

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

response time
virtualization
web servers
data centers


Toward an Understanding of the Molecules that Sense Myocardial Ischemia Cardiac afferent neurons are activated in the setting of myocardial ischemia and mediate the sensation of angina. However, the precise stimuli and receptive molecules responsible are not completely understood. To further investigate the molecular components involved, cardiac afferents were isolated in dissociated culture and patch-clamp experiments were performed on these cells. It was found that acidic pH evoked large inward currents in almost all cardiac sympathetic afferents. By comparison, the responses to other potential chemical mediators were inconsistent and much smaller. The biophysical properties of the acid-evoked currents in cardiac afferents match the acid-sensing ion channel 3 (ASIC3).

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

enac/deg ion channel
myocardial ischemia protons


Discovering statistically non-redundant subgroups The objective of subgroup discovery is to find groups of individuals who are statistically different from others in a large data set. Most existing measures of the quality of subgroups are intuitive and do not precisely capture statistical differences of a group with the other, and their discovered results contain many redundant subgroups. Odds ratio is a statistically sound measure to quantify the statistical difference of two groups for a certain outcome and it is a very suitable measure for quantifying the quality of subgroups. In this paper, we propose a statistically sound framework for statistically non-redundant subgroup discovery: measuring the quality of subgroups by the odds ratio and defining statistically non-redundant subgroups by the error bounds of odds ratios. We show that our proposed method is faster than most existing methods and discovers complete statistically non-redundant subgroups.

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

non-redundancy
rules
search space pruning


shadows for cel animation We present a semi-automatic method for creating shadow mattes in cel animation. In conventional cel animation, shadows are drawn by hand, in order to provide visual cues about the spatial relationships and forms of characters in the scene. Our system creates shadow mattes based on hand-drawn characters, given high-level guidance from the user about depths of various objects. The method employs a scheme for inflating a 3D figure based on hand-drawn art. It provides simple tools for adjusting object depths, coupled with an intuitive interface by which the user specifies object shapes and relative positions in a scene. Our system obviates the tedium of drawing shadow mattes by hand, and provides control over complex shadows falling over interesting shapes.

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

spatial order method relationships drawing object 3d art shadows animation control user tools scheme

character
visualization
systems
interfaces
npr
sketching
relation
complexity
shape
cel animation
inflation


Optimum pinch grips in the handling of dies Handling roller-press dies has caused numerous work-related musculoskeletal disorders in the leather industry. The dies are quite large (0.610.30m), heavy (3.5kg) and are difficult to handle because of the large pinch span requirements (up to 16cm). The purpose of this study was to determine the optimum pinch span and optimum crossbar angulation to minimize die handling forces. Five-finger pulp-pinch forces were measured on five males and five females with a force-sensitive-resistor instrumented glove while handling a simulated adjustable die. Maximum pinch forces occurred at pinch spans between 1.27 and 3.81cm, with average female strengths being 57% of average male pinch strengths. Minimum pinch forces to hold the die occurred at a 45 angulation and increased linearly as the angle approached 90 or the normal vertical orientation. The simplest solution to redesigning the dies is to: (1) decrease the distance between the braces to less than 4cm and (2) slant the braces at 45.

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

pinch forces
pinch span
musculoskeletal disorders


On the simulation of continuous in scale universal multifractals, part I: Spatially continuous processes Cascade processes generically lead to multifractal fields and have been used for simulating turbulent systems including clouds, rain, temperature, passive scalars and the wind as well as for solid earth fields, such as rock density, magnetization and topography. In spite of their importance, most applications use primitive discrete scale ratio processes, which singularize scales which are integer powers of integers. Realistic simulations are continuous in scale, but suffer from strong finite size effects i.e. deviations from pure power law scaling, which can take surprisingly large ranges of scale to disappear. In this two part series, we quantify and show the origin of the problem and quantify its magnitude (part I), while in part II we show how to largely overcome it and give a Mathematica code for the corresponding simulations for causal and acausal space-time simulations.

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

fractals
turbulence
numerical simulations


Performance Bounds for Single Layer Threshold Networks when Tracking a Drifting Adversary This paper finds upper bounds for the generalization error of three tracking algorithms when confronted with a worst case adversary. A system identification model is used where both the target and tracking network are single layer threshold networks, with the target weights changing slowly (the drift problem). Previous work considered random unbiased drifting adversaries. This paper focuses on the analysis of a worst case drifting adversary. For a small drift rate of ?, we find that upper bounds for the optimal conservative tracker, the perceptron tracker, and the least mean square (LMS) tracker are respectively

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

system identification
generalization error

time-varying systems
neural networks
adaptive systems
tracking drift


Optimal window width choice in spectral density estimation - Review and simulation This paper deals with optimal window width choice in non-parametric lag or spectral window estimation of the spectral density of a stationary zero-mean process. Several approaches are reviewed: cross-validation-based methods as described by Hurvich (1985), Beltrao and Bloomfield (1987) and Hurvich and Beltrao (1990); an iterative procedure developed by Buhlmann (1996); and a bootstrap approach followed by Franke and Hardle (1992). These methods are compared in terms of the mean square error, the mean square percentage error, and a third measure of the distance between the true spectral density and its estimate. The comparison is based on a simulation study, the simulated processes being in the class of ARMA (5,5) processes. On the basis of simulation evidence we suggest to use a slightly modified version of Buhlmann's (1996) iterative method. This paper also makes a minor correction of the bootstrap criterion by Franke and Hardle (1992).

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


AIEIA: Software for fuzzy environmental impact assessment Human activity has an inevitable impact on the environment and this is generally negative. It is undeniable that society is increasingly aware of the state of the surrounding environment, since it forms the basis for all human activity. There has therefore been a proliferation of environmental impact assessment (EIA) tools which enable this impact on the environment to be measured. The EIA process involves an enormous amount of quantitative and qualitative information which traditional EIA methods are unable to handle properly. This article presents a new fuzzy EIA model which perfectly incorporates both qualitative and quantitative information, using in its formulation the fuzzy set theory proposed by Zadeh. We also present AIEIA, an ingenious software program which implements this fuzzy methodology by providing an efficient tool for the prevention of environmental impacts. (C) 2008 Elsevier Ltd. All rights reserved.

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

environmental impact assessment
fuzzy set theory
environment


Secondary electron detection for distributed axis electron beam systems A secondary electron detection scheme for the distributed axis, fixed-aperture system is described. It employs a multi-channel detector array with a through-hole for a primary beamlet on each channel, a field terminator installed between the detector array and sample, and a deflector forming a static transverse electric field between the field terminator and sample. These elements enable detection of the secondary electrons stimulated by the primary beamlet. In order to achieve a high detection rate, small separation of the primary beamlets, and small aberrations, the size and the layout of the through-holes of the field terminator are studied. The equation of motion in an ideal field distribution is analytically solved and the dispersion of the secondary electrons caused by the helical motion in an axial magnetic field and chromatic variation of deflection are calculated. Aberrations are calculated by using numerical simulation. On the basis of these calculations, two types of the field terminator are proposed. One has a single through-hole, which is shared by a primary beamlet and the secondary electrons stimulated by the primary beamlet, per primary beamlet. The other has a through-hole exclusively for a primary beamlet and an extra slot for the secondary electrons, per primary beamlet. Simulations reveal that the former achieves a secondary electron detection rate of 99.7% and aberrations smaller than 4.6nm, but doesnt enable the separation of the primary beamlet to be smaller than 1000?m. In contrast, the latter achieves a secondary electron detection rate of 95.0%, aberrations smaller than 9.7nm. Furthermore, it also enables the separation of the primary beamlet to be as small as 250?m, the same as in our detector array at this moment.

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

multi-electron-beam system
lithography
inspection
difa
diva


context-aware ranking in web search The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused on the development of context models or limited to a relatively small scale investigation under a controlled laboratory setting. Particularly, about context-aware ranking for Web search, the following two critical problems are largely remained unsolved. First, how can we take advantage of different types of contexts in ranking? Second, how can we integrate context information into a ranking model? In this paper, we tackle the above two essential problems analytically and empirically. We develop different ranking principles for different types of contexts. Moreover, we adopt a learning-to-rank approach and integrate the ranking principles into a state-of-the-art ranking model by encoding the context information as features of the model. We empirically test our approach using a large search log data set obtained from a major commercial search engine. Our evaluation uses both human judgments and implicit user click data. The experimental results clearly show that our context-aware ranking approach improves the ranking of a commercial search engine which ignores context information. Furthermore, our method outperforms a baseline method which considers context information in ranking.

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

scale log human context model paper evaluation user search method test types data laboratory query ranking

learning-to-rank application
context-aware ranking
developer
art
informal
web search
experimentation
search engine
context aware
learning to rank
context model
critic
feature
encode
integrability


Treatment of Pemphigus Vulgaris with Protein A Immunoadsorption: Case Report of Long-Term History Showing Favorable Outcome Abstract: A pemphigus vulgaris (PV) patient with a 14-year history of severe and painful blistering of skin and mucous membranes as well as side effects from corticosteroids and concomitant immunosuppressive drug treatment was managed successfully by protein A immunoadsorption (IA). After 19 sessions of protein A IA, the patient showed remission of PV and healing of mucocutaneous lesions and the skin. The level of the pathogenic autoantibodies to the adhesion proteins desmoglein 1 (Dsg-1) and desmoglein 3 (Dsg-3) measured by ELISA and immunofluorescence microscopy revealed a significant removal of autoantibodies after each IA therapy. There was a weak rebound of anti-Dsg-1 and anti-Dsg-3 antibodies between IA sessions but an overall decrease over the period of IA therapy. This case demonstrates the effective use of protein A IA as an adjuvant and corticosteroid-sparing therapy in severe pemphigus refractory to standard immunosuppressive therapy and underscores the need for careful monitoring of autoantibodies.

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


Spatio-temporal polygonal clustering with space and time as first-class citizens Detecting spatio-temporal clusters, i.e. clusters of objects similar to each other occurring together across space and time, has important real-world applications such as climate change, drought analysis, detection of outbreak of epidemics (e.g. bird flu), bioterrorist attacks (e.g. anthrax release), and detection of increased military activity. Research in spatio-temporal clustering has focused on grouping individual objects with similar trajectories, detecting moving clusters, or discovering convoys of objects. However, most of these solutions are based on using a piece-meal approach where snapshot clusters are formed at each time stamp and then the series of snapshot clusters are analyzed to discover moving clusters. This approach has two fundamental limitations. First, it is point-based and is not readily applicable to polygonal datasets. Second, its static analysis approach at each time slice is susceptible to inaccurate tracking of dynamic cluster especially when clusters change over both time and space. In this paper we present a spatio-temporal polygonal clustering algorithm known as the Spatio-Temporal Polygonal Clustering (STPC) algorithm. STPC clusters spatial polygons taking into account their spatial and topological properties, treating time as a first-class citizen, and integrating density-based clustering with moving cluster analysis. Our experiments on the drought analysis application, flu spread analysis and crime cluster detection show the validity and robustness of our algorithm in an important geospatial application.

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

spatio-temporal data mining
temporal data analysis
trend analysis


A 8 mW 72 dB Sigma Delta-modulator ADC with 2.4 MHz BW in 130 nm CMOS A double-sampling split I I"-ADC pound with bilinear integrators and a 7-level quantizer is presented. It achieves third order noise shaping with a second order modulator through quantization noise-coupling. The modulator is integrated in a 130 nm CMOS technology. For a clock frequency of 48 MHz and an oversampling ratio of 20 (2.4 MHz signal bandwidth), it achieves 72 dB DR and 68 dB SNR. The prototype consumes 8 mW from a 1.2 V voltage supply.

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

analog-to-digital converters
double sampling
sigma delta-modulation
noise-coupling


Fast Image Correspondence with Global Structure Projection This paper presents a method for recognizing images with flat objects based on global keypoint structure correspondence. This technique works by two steps: reference keypoint selection and structure projection. The using of global keypoint structure is an extension of an orderless bag-of-features image representation, which is utilized by the proposed matching technique for computation efficiency. Specifically, our proposed method excels in the dataset of images containing "flat objects" such as CD covers, books, newspaper. The efficiency and accuracy of our proposed method has been tested on a database of nature pictures with flat objects and other kind of objects. The result shows our method works well in both occasions.

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

image correspondence
structure projection


some context fuzzy clustering methods for classification problems In this paper, we will propose a two-context fuzzy clustering algorithm (2C-FCM) and its parallel solution so called P2C-FCM for the classification problems. Some initial experiments show the effectiveness of P2C-FCM and 2C-FCM when comparing with traditional Context FCM. The applications of P2C-FCM and 2C-FCM are the basis to generate fuzzy rules for classifying member countries of United Nation Organization (UNO) according to the Human Development Index based on the statistics of UNO in 2005.

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


Fast algorithm for multiplicative noise removal In this work, we consider a variational restoration model for multiplicative noise removal problem. By using a maximum a posteriori estimator, we propose a strictly convex objective functional whose minimizer corresponds to the denoised image we want to recover. We incorporate the anisotropic total variation regularization in the objective functional in order to preserve the edges well. A fast alternating minimization algorithm is established to find the minimizer of the objective functional efficiently. We also give the convergence of this minimization algorithm. A broad range of numerical results are given to prove the effectiveness of our proposed model. Crown Copyright (C) 2011 Published by Elsevier Inc. All rights reserved.

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

multiplicative noise
anisotropic total variation
maximum a posteriori
alternating minimization algorithm

convex function
proximal operator
gamma distribution
newton method


Kolmogorov complexity and characteristic constants of formal theories of arithmetic We investigate two constants cT and rT, introduced by Chaitin and Raatikainen respectively, defined for each recursively axiomatizable consistent theory T and universal Turing machine used to determine Kolmogorov complexity. Raatikainen argued that cT does not represent the complexity of T and found that for two theories S and T, one can always find a universal Turing machine such that . We prove the following are equivalent: for some universal Turing machine, for some universal Turing machine, and T proves some ?1-sentence which S cannnot prove. 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

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

characteristic constant
msc (2010) 03a99
03b25


a monitor for complex cad systems The complexity and number of CAD tools is increasing day by day. As a consequence the designer is faced with the problem of selecting the appropriate sequence of operations and of keeping in mind the current status of the design. This paper describes a flexible supervisor, called Monitor, based on an extended Petri Net model, that handles the interactions among a user definable set of tools. The designer, using this interface to the CAD system, has at his fingertips the updated situation of each subpart of the project that he is developing. A high degree of priority has been given to the friendliness and naturality of this supervisor: the user can really start using it without any training and manuals seem to be superfluous.

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

training systems design project complexity monitor paper model sequence user tools

situated select interaction operability interfaces flexibility priorities


Designing a cluster-based covert channel to evade disk investigation and forensics ? Data confidentiality on a computer can be achieved using encryption. However, encryption is ineffective under a forensic investigation mainly because the presence of encrypted data on a disk can be easily detected and disk owners can subsequently be forced (by law or other means) to release decryption keys. To evade forensic investigation, intelligent information hiding techniques that support plausible deniability have been proposed as an alternative to encryption; plausible deniability allows an evader to hide data in a manner such that he/she can deny the very existence of the data. In this paper, we present a new, plausible deniability approach to store sensitive information on a cluster-based filesystem. Under the proposed approach, a covert channel is used to encode the sensitive information by modifying the fragmentation patterns in the cluster distribution of an existing file. As opposed to existing schemes, the proposed covert channel does not require storage of any additional information on the filesystem. Moreover, the channel provides two-fold plausible deniability so that an investigator without the key cannot prove the presence of hidden information. We derive the theoretical capacity of the covert channel and show that a capacity of up to 24 bits/cluster can be achieved on a half-empty disk. The proposed data hiding and recovery algorithms are implemented on FAT32 based disk drives and we show that the disk (read/write) access time of the algorithms is quite low as compared to the contemporary approaches. We also present statistics about the incidence of file fragmentation on actual file systems from 52 disk drives belonging to a diverse set of users. Based on these statistics, we present guidelines for selecting good cover files. Finally, we show that even if an investigator gets suspicious, he/she will incur an unreasonably high O(m2) complexity to reveal an m bit hidden message.

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

steganography
covert channels
disk forensics
digital watermarking


Curves and Surfaces Construction Based on New Basis with Exponential Functions By incorporating two exponential functions into the cubic Bernstein basis functions, a new class of ??-Bernstein basis functions is constructed. Based on these ??-Bernstein basis functions, a kind of ??-Bzier-like curve with two shape parameters, which include the cubic Bernstein-Bzier curve, is proposed. The C 1 and C 2 continuous conditions for joining two ??-Bzier-like curves are given. By using tensor product method, aclass of rectangular Bzier-like patches with four shape parameters is shown. The G 1 and G 2 continuous conditions for joining two rectangular Bzier-like patches are derived. By incorporating three exponential functions into the cubic Bernstein basis functions over triangular domain, a new class of ???-Bernstein basis functions over triangular domain is also constructed. Based on the ???-Bernstein basis functions, a kind of triangular ???-Bzier-like patch with three shape parameters, which include the triangular Bernstein-Bzier cubic patch, is presented. The conditions for G 1 continuous smooth joining two triangular ???-Bzier-like patches are discussed. The shape parameters serve as tension parameters and have a predictable adjusting role on the curves and patches.

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

bernstein-bzier curve
triangular bernstein-bzier patch
geometric continuity
shape parameter
65d07
65d17


Multivariate analysis of human behavior data using fuzzy windowing: Example with driver-car-environment system In most human component system studies performed in simulators, several factors (or independent variables) (at least two, i.e., individual and time) and many variables (or dependent variables) are present. Large and complex databases have to be analyzed. Instead of using rather automatic procedures, this article suggest that, for a very first analysis at least, the human being must be present and he/she must choose a method being adapted to the data, which is different to run a method supposing that the data fit such or such model. This article suggests starting the analysis while keeping both the multifactorial (MF) and multivariate (MV) aspects. To achieve this aim, with the possibility to show nonlinear relationships, a MFMV exploration of the experimental database is performed using the pair (fuzzy space windowing, Multiple Correspondence Analysis). Then may come an inference analysis. This long (due to multiple large graphical views) but rich procedure is illustrated and discussed using a car driving study example. (C) 2012 Elsevier Ltd. All rights reserved.

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

multiple correspondence analysis
fuzzy windowing
car driving


A continuum-mechanics interpretation of Reissner's non-linear shear-deformable beam theory This article deals with the non-linear modelling of beams that are bent, sheared and stretched by external forces and moments. In the following, we restrict to plane-deformations and static conditions. Our task is to present a continuum mechanics-based interpretation of the celebrated large displacement finite deformation structural mechanics theory, which was presented by Eric Reissner [On one-dimensional finite-strain beam theory: the plane problem, J. Appl. Math. Phys. 23 (1972), pp. 795-804]. The latter formulation was restricted to the notions of structural mechanics and thus did not use the notions of stress and strain, which are fundamental for continuum mechanics. Thus, the common continuum mechanics-based constitutive modelling at the stress-strain level cannot be utilized in connection with Reissner's original theory. Instead, Reissner suggested that constitutive relations between certain generalized strains (bending, shear and axial force strains) and generalized static entities (bending moments, shear and normal forces) should be evaluated from physical experiments. This means that the beam to be studied must be first built up, and the experiments must be performed for the real beam as a whole. Although such physical experiments are indeed to be performed in practice for safety reasons in sensible cases, for example, bridge decks or aircraft wings, it is nevertheless felt to be a drawback that the results of simple standardized stress-strain experiments concerning the constitutive behaviour of the materials, from which the beam is built up, cannot be used. Moreover, relying only on physical experiments on the whole beam means that computations (virtual experiments) can be made only after the beam has been built up. To overcome this problem, we subsequently present a continuum mechanics-based interpretation of Reissner's structural mechanics modelling, by attaching a proper continuum mechanics-based meaning to both the generalized static entities and the generalized strains in Reissner's theory [E. Reissner, On one-dimensional finite-strain beam theory: the plane problem, J. Appl. Math. Phys. 23 (1972), pp. 795-804]. Consequently, these generalized static entities can be related to the generalized strains on the basis of a constitutive modelling on the stress-strain level. We show this in some detail in this contribution for a hyperelastic material proposed by Simo and Hughes [Computational Inelasticity, Springer, New York, 1998]. An illustrative numerical example is given which shows the results of large bending and axial deformation behaviour for different constitutive relations. This article represents an extended version of a preliminary work published in [H. Irschik and J. Gerstmayr, A hyperelastic Reissner-type model for non-linear shear deformable beams, Proceedings of the Mathmod 09 Vienna, I. Troch and F. Breitenecker, eds., 2009, pp. 1-7].

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

reissner's shear-deformable beam
non-linear material model


Mismatch modeling and simulation - A comprehensive approach This article describes a comprehensive approach to mismatch simulation and modeling as needed for integrated circuit design. Local device mismatch as well as global process variations and parameter correlations are regarded. A method for mismatch modeling based on spatial frequencies is described, which enables to overcome insufficiencies of the first order models. Measurement results are presented to demonstrate the achieved modeling precision. All models and methods mentioned here are commercially available in the simulation tool GAME (General Analysis of Mismatch Effects) which is used in the semiconductor industry since 1998.

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

mismatch simulation modeling correlations


Constructions of Quadratic and Cubic Rotation Symmetric Bent Functions In this paper, we consider constructions of rotation symmetric bent functions, which are of the forms: f(c)(x) = Sigma(m-1)(i=1) c(i)(Sigma(n-1)(j=0) x(j)x(i+j)) + c(m) (Sigma(m-1)(j=0) x(j)x(m+j)) and, f(t)(x) = Sigma(n-1)(i=0) (x(i)x(t)+(i)x(m+i) + x(i)x(t+i)) + Sigma(m-1)(i=0) x(i)x(m+i) where, n = 2m, c(i) is an element of {0, 1} (the subscript u of x(u) in the previous expressions is taken as u modulo n). For each case, a necessary and sufficient condition is obtained. To the best of our knowledge, this class of cubic rotation symmetric bent functions is the first example of an infinite class of nonquadratic rotation symmetric bent functions.

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

maiorana-mcfarland class of bent function

rotation symmetric (rots) boolean function


formal verification of hybrid systems In formal verification , a designer first constructs a model, with mathematically precise semantics, of the system under design, and performs extensive analysis with respect to correctness requirements. The appropriate mathematical model for embedded control systems is hybrid systems that combines the traditional state-machine based models for discrete control with classical differential-equations based models for continuously evolving physical activities. In this article, we briefly review selected existing approaches to formal verification of hybrid systems, along with directions for future research.

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


system f with type equality coercions We introduce System F C , which extends System F with support for non-syntactic type equality. There are two main extensions: (i) explicit witnesses for type equalities, and (ii) open, non-parametric type functions, given meaning by top-level equality axioms. Unlike System F, F C is expressive enough to serve as a target for several different source-language features, including Haskell's newtype, generalised algebraic data types, associated types, functional dependencies, and perhaps more besides.

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

haskell
systems
advanced type features
association
language
parametric
typed intermediate language
express
mean
extensibility
functional dependency
feature


A novel portfolio selection model based on fuzzy goal programming with different importance and priorities A novel fuzzy portfolio selection approach is proposed. This approach is based on the fuzzy goal programming techniques. Portfolio return, risk and beta coefficient are defined as the fuzzy goals. This approach allows defining certain importance and priority among fuzzy goals. The proposed approach considers the risk preferences of investor and market trend.

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

fuzzy goal programming
portfolio selection model

multiple objective programming
risk preferences of investors
capital asset pricing model


A fuzzy sets theory application in determining the severity of respiratory failure This paper proposes to apply the theory of fuzzy sets in determining the severity of respiratory distress of a patient in an intensive care unit. The problem is modelled as a fuzzy multicriteria decision-making one. Theoretical approaches to the situation are considered. The proposed fuzzy selection method, based on the usage of the fuzzy intervals, is described. An example of determining the severity of respiratory distress is used to illustrate the presentation. Computer implementation of the model is considered, and the directions for possible further work are pointed out.

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

health care
decision-making
respiratory disturbance


Three-dimensional video compression using subband wavelet transform with lower buffering requirements Three-dimensional (3-D) video compression using wavelets decomposition along the temporal axis dictates that a number of video frames must be buffered to allow for the temporal decomposition. Buffering of frames allows for the temporal correlation to be made use of, and the larger the buffer the more effective the decomposition. One problem inherent in such a set up in interactive applications such as video conferencing, is that buffering translates into a corresponding time delay. In this paper, we show that 3-D coding of such image sequences can be achieved in the true sense of temporal direction decomposition but with much less buffering requirements. For a practical coder, this can be achieved by introducing an approximation to the may the transform coefficients are encoded. Applying wavelet decomposition using some types of filters may introduce edge errors, which become more prominent in short signal segments. We also present a solution to this problem for the Daubechies family of filters.

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


applying case-based reasoning in the evolution of deforestation patterns in the brazilian amazonia Patterns of deforestation in Brazilian Amazonia are often associated with different actors, their economic activities and their land use and land cover change strategies. These patterns are often analyzed as static landscape objects, they are not treated as objects evolving along the time. This paper proposes to apply the Case-Based Reasoning (CBR) technique to establish rules and detect object deforestation evolution in an Amazonia region. The objects were analyzed in a sequence of images from different periods creating the base and rules to apply CBR. The application of CBR can help the specialist to understand how different landscape objects evolve, to establish object trajectories and to represent that evolution.

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


Information technology and open innovation: A strategic alignment perspective Advances in information technology (IT) have enabled firms to increasingly rely on open innovation. Although researchers and practitioners are interested in this phenomenon, there is a lack of theoretically driven research on how IT impacts organizational open innovation performance. Drawing on the strategic IT alignment perspective and related literature, we proposed a model to explain the performance of organizational open innovation; i.e., the alignment between IT strategies and the openness of open innovation strategies results in different outcomes for open innovation. Through the analysis of data from 225 firms in China, we found that the alignment between IT flexibility and breadth enhances innovation radicalness and innovation volume, whereas the alignment between IT integration and depth positively affects innovation volume only. Innovation volume and radicalness were found to enhance organizational performance in terms of sales growth. Our study contributes to the literature on open innovation and strategic alignment. Its findings also have important managerial implications for practitioners.

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

open innovation
strategic it alignment
it flexibility
it integration
innovation radicalness
innovation volume


Structural optimization of the pumping kite wind generator This paper focuses on structural optimization of the so-called pumping kite wind generator whose operating principle consists in mechanically driving a ground-based electric generator by means of tethered kites. The employed mathematical model of the kite wind generator is based on the refined crosswind motion law derived under the assumption of equilibrium motion of the kite. The resulting simple approximate analytical formula for the mean mechanical power generated by the deploying kite is used for the constrained structural optimization of the pumping kite wind generator maximizing its electrical power output by adjusting the key structural parameters of the kite wind generator.

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

structural optimization
mechanical power
crosswind motion


Present and future industrial applications of bio-inspired VLSI systems Biology can be a rich source of inspiration for engineers. In particular, designers of VLSI processing circuits and systems can draw inspiration from several aspects of the brain. Inspired from evolution, the opportunistic exploitation of all the properties of the technology provides very efficient analog circuit techniques. The collective computation carried out by the brain in its massively parallel architecture can be emulated on silicon. Strategies like learning and adaptation are very beneficial to VLSI processing. The same is true for the unusual ways used by the brain to represent signals and information. Four industrial chips developed with this bio-inspired approach are described, as well as several experimental circuits that demonstrate its potential for future products.

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


Robust analysis of hybrid dynamical systems for 1, 3-propanediol transport mechanisms in microbial continuous fermentation A better understanding of the biological phenomena observed in cells requires the creation and analysis of mathematical models of cellular metabolism and physiology. In the study of the glycerol continuous bioconversion to 1, 3-propanediol by Klebsiella pneumoniae, there are some uncertain factors such as the mechanism about the transports of substances across cell membrane. In this paper, a nonlinear hybrid system which describes the intracellular reductive pathway is presented, according to the possible transport mechanisms of 1, 3-propanediol across cell membrane. The existence, uniqueness, and continuity of the solutions for the nonlinear hybrid system are discussed. It is difficult to measure the concentrations of intracellular substances; so, a quantitative robustness analysis method is proposed. Taking the robustness of intracellular substance concentrations as the performance index, an identification model is proposed, which is subjected to the constraint of nonlinear hybrid dynamical system. Finally, an algorithm procedure is constructed to solve the parameter identification model, and the most possible transport mechanism of 1, 3-propanediol and the optimal parameters of the corresponding system are also given. (C) 2011 Elsevier Ltd. All rights reserved.

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

nonlinear hybrid dynamical system
transport mechanism
robustness analysis


Parallel H-matrix arithmetics on shared memory systems H-matrices, as they were introduced in previous papers, allow the usage of the common matrix arithmetic in an efficient, almost optimal way. This article is concerned with the parallelisation of this arithmetics, in particular matrix building, matrix-vector multiplication, matrix multiplication and matrix inversion. Of special interest is the design of algorithms, which reuse as much as possible of the corresponding sequential methods, thereby keeping the effort to update an existing implementation at a minimum. This could be achieved by making use of the properties of shared memory systems as they are widely available in the form of workstations or compute servers. These systems provide a simple and commonly supported programming interface in the form of POSIX-threads. The theoretical results for the parallel algorithms are confirmed with numerical examples from BEM and FEM applications.

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

parallel algorithms
shared memory systems


Experience-based optimization of universal manipulation strategies for industrial assembly tasks The trend towards smaller lot sizes and shorter product life cycles requires automation solutions with higher flexibility. Todays robotic systems often are uneconomical for frequently changing boundary conditions and varying tasks due to high engineering costs needed for a well-defined supply of parts and pallets. At the same time, even small inaccuracies due to shape deviations in parts or pallets often cause high downtime. This work contributes to the robustness of industrial assembly processes with high inaccuracy concurrent to narrow tolerances. Therefore, contact-based manipulation strategies are defined, which are model-free and object-independent and solve common industrial tasks as palletizing, packaging and machine feeding. While the strategies are robust to inaccuracy up to 5mm/5 due to localization uncertainty or object displacement, they handle usual industrial assembly tolerance of far below 1mm. The necessary flexibility and reusability for new tasks is guaranteed by hierarchical decomposition into atomic sub-strategies. In order to accelerate the execution, the manipulation strategies are customized to each specific task by unsupervised experience-based learning. The flexibility of the manipulation strategies and the progress in cycle time during the execution are shown on common industrial tasks with varying objects, tolerances and inaccuracies.

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

industrial manipulation
robotic assembly
hierarchical task decomposition
cycle-time optimization
experience-based learning
case-based reasoning


Improving code completion with program history Code completion is a widely used productivity tool. It takes away the burden of remembering and typing the exact names of methods or classes: As a developer starts typing a name, it provides a progressively refined list of candidates matching the name. However, the candidate list usually comes in alphabetic order, i.e., the environment is only second-guessing the name based on pattern matching, relying on human intervention to pick the correct one. Finding the correct candidate can thus be cumbersome or slower than typing the full name. We present an approach to improve code completion based on recorded program histories. We define a benchmarking procedure measuring the accuracy of a code completion engine and apply it to several completion algorithms on a dataset consisting of the history of several systems. Further, we use the change history data to improve the results offered by code completion tools. Finally, we propose an alternative interface for completion tools that we released to developers and evaluated.

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

software evolution
first-class changes
integrated development environments
benchmark


Swarm-oriented mobile services: Step towards green communication Green communication is a new focus within the telecommunications industry, leading to various innovative ideas on how to optimize communication in order to achieve energy savings. While the majority of those ideas target the transport layer of communication systems, this paper takes a different approach and proposes an innovation for the application layer by introducing a novel concept in the mobile telecom service provisioning process: the swarm-oriented services. The presented proof-of-concept swarm-oriented mobile telecom service is called the Collaborative Downloading and its primary goal is to lower the mobile users overall energy consumption while they are downloading data. In order to enable this service, we designed the self-organizing market-based algorithm (SOMA), which combines swarm intelligence (i.e. self-organization) and market-based (i.e. auctions) mechanisms, while the proof-of-concept implementation is based on multi-agent technology. Analytical results show that the proposed Collaborative Downloading service saved up to 76% of energy in mobile device batteries when compared with the current mobile data download practice (in a scenario with 6 mobile users whose mobile devices support GPRS and Bluetooth networking technologies).

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

user collaboration
energy efficiency
swarm-oriented service
mobile ad hoc network


benchmarks for intuitive interaction with mobile devices The QUESI (Questionnaire for the subjective consequences of intuitive use), a specific measure of the satisfaction of users interacting with a product, is presented. In addition, first benchmark values for mobile devices and applications are provided.

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

usability
evaluation
design for intuitive use


Unstructured lattice Boltzmann equation with memory Starting from a second-order differential form of the semi-discrete Boltzmann equation, we construct a new finite-volume lattice Boltzmann equation on unstructured grids (ULBE). The new scheme (ULBE with memory) is demonstrated for the case of a Taylor-vortex flow and shown to produce stable and accurate results with time-step more than an order of magnitude above the standard LBE stability threshold. (c) 2006 IMACS. Published by Elsevier B.V. All rights reserved.

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

lattice boltzmann equation
unstructured grids
stability


Dynamic performance improvement of an isolated wind turbine induction generator A dynamic model of a variable speed stand alone wind generation system is developed. The transient performance of the system under variable wind gust and other disturbance conditions has been studied. It has been observed that a stand alone generator is very vulnerable to transient disturbances in the system. A variable susceptance excitation control system, installed at the generator terminal, has been shown to improve the dynamic performance of the system following transient disturbances. Additional pole-placement based PI and PID controllers in the excitation control circuit are shown to control the violently oscillating and even growing transients very effectively. The robustness of the proposed controller has been tested for various disturbances and also for a range of operation.

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

wind energy system
variable susceptance control
pid control
pole-placement


the engineering community sig The Engineering Community may be the least populated and the least understood of the new communities at CHI, perhaps because so many definitions of engineering exist (as evidenced by the quotes in the margins). This SIG will provide a forum for people interested in bringing the best of the field of engineering to the field of HCI.

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


interactive training of advanced classifiers for mining remote sensing image archives Advances in satellite technology and availability of downloaded images constantly increase the sizes of remote sensing image archives. Automatic content extraction, classification and content-based retrieval have become highly desired goals for the development of intelligent remote sensing databases. The common approach for mining these databases uses rules created by analysts. However, incorporating GIS information and human expert knowledge with digital image processing improves remote sensing image analysis. We developed a system that uses decision tree classifiers for interactive learning of land cover models and mining of image archives. Decision trees provide a promising solution for this problem because they can operate on both numerical (continuous) and categorical (discrete) data sources, and they do not require any assumptions about neither the distributions nor the independence of attribute values. This is especially important for the fusion of measurements from different sources like spectral data, DEM data and other ancillary GIS data. Furthermore, using surrogate splits provides the capability of dealing with missing data during both training and classification, and enables handling instrument malfunctions or the cases where one or more measurements do not exist for some locations. Quantitative and qualitative performance evaluation showed that decision trees provide powerful tools for modeling both pixel and region contents of images and mining of remote sensing image archives.

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

decision tree classifiers
remote sensing
missing data


An exploratory study of the effects of frequency and duration of messaging on impression development in computer-mediated communication This experimental study indicates that computer-mediated communication (CMC) is a viable mode of social-emotion-oriented communication. In this study, the effects of frequency and duration of messaging on impression development in CMC were investigated. Undergraduate participants were randomly assigned to each of the four experimental groups. For a period of 2 weeks, participants monitored discussion lists that differed in relation to the frequency and duration of messaging in asynchronous CMC environments. ANOVA results indicated that duration and frequency had significant main effects on impression development in asynchronous CMC environments. No interaction effects were found. The results of this study support the social-emotion-oriented model in CMC.

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

duration of messaging
impression development

frequency of messaging
nonverbal cues
computer-mediated communication
social-emotion-oriented model
social-information-processing model


characterizing the association between mobile users using wireless network traces In Delay Tolerant Networks (DTN), the performance heavily depends on the association between mobile users, which decides how frequently the users meet with each other. It is therefore very important to understand the association. In this paper, by analyzing a number of wireless network traces, we verified the exponential distribution of the association of mobile users, which means that most mobile users are not closely associated. Furthermore, we examined the distribution of the inter-connectivity time of those mobile users more closely associated.

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

wireless network trace
mobile user association
delay tolerant network


An implementation of a garment-fitting simulation system using laser scanned 3D body data We propose a garment-fitting system for an online retail model, which uses a consumer's 3D body data for garment fitting. This system uses front and back images to model the garment and 3D laser scanned body data to model the body. In order to recognize characteristic points on the 3D body data, a moment template composed of central moments of vector angle sets on 3D body data is proposed, and an implementation combining the 3D data and garment images is reported, which includes modeling, collision detection and feedback handling. The resulting system would support an online retail business model for garments. In the proposed business model, a body data center would scan the body and store the 3D data, the simulated garment-fitting program would be provided to individual consumers for fitting on a home PC, and retail shops would exhibit garment images on their websites. In this proposed model, security of personal data and computational cost will not be an issue. Crown Copyright (C) 2010 Published by Elsevier B.V. All rights reserved.

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

3d body data
moment template
vector angle
garment fitting
simulation


On the use of kernel PCA for feature extraction in speech recognition This paper describes an approach to feature extraction in speech recognition systems using kernel principal component analysis (KPCA). This approach represents speech features as the projection of the mel-cepstral coefficients mapped into a feature space via a non-linear mapping onto the principal components. The non-linear mapping is implicitly performed using the kernel-trick, which is a useful way of not mapping the input space into a feature space explicitly, making this mapping computationally feasible. It is shown that the application of dynamic (Delta) and acceleration (DeltaDelta) coefficients, before and/or after the KPCA feature extraction procedure, is essential in order to obtain higher classification performance. Better results were obtained by using this approach when compared to the standard technique.

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

kernel
feature space
principal component analysis
feature extraction
speech recognition


A representation theorem for fuzzy pseudometrics In this paper, we show that there exists a one to one correspondence between a certain class of fuzzy pseudometrics (in the sense of Kramosil and Michalek) and [0,1)-indexed families of ordinary pseudometrics satisfying a property of lower semicontinuity. The aforementioned bijection is proved to be independent of the t-norm and it provides a representation theorem for a large class of fuzzy pseudometric spaces. Further, the relations between the uniformities and topologies both generated by the fuzzy pseudometric and by the corresponding family of ordinary pseudometrics are also investigated. (C) 2011 Elsevier B.V. All rights reserved.

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

uniformity
fuzzy metric space
fuzzy pseudometric space
lower semicontinuous family
t-norm


Production technology selection: Deploying market requirements, competitive and operational strategies, and manufacturing attributes The success and survival of companies are becoming increasingly difficult to ensure in this era of increasing competition and ever-changing environments. Modern technology is playing a key role in the ability of manufacturing companies to compete as world-class enterprises. Therefore, new manufacturing technologies are needed to assist in compressing the production time to move products to the market more quickly and efficiently than competitors. Acquiring and implementing new technologies are perceived as high-risk investments and determinants of competition. To ensure that a selected technology meets these requirements, companies should simultaneously explore and communicate the relationships between evolving and developing markets, as well as competitive and operational strategies over time. However, the published literature on new technology selection hitherto has failed to sufficiently address the relevant perspectives in such analyses. The relationship matrix in the quality function deployment (QFD) method provides an excellent tool for aligning important concepts and linking processes. This report suggests an operational strategy for the selection of a new production technology that integrates the market trends, competitive and operational strategies, as well as manufacturing attributes by using the relationship matrix in the QFD method and also describes how this robust approach has been applied to the selection of new manufacturing technology in a Taiwanese company. This selection substantiates our assertion that the proposed framework and procedures do in fact meet the real requirements of an individual commercial entity as well as ensuring a competitive edge.

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

new technology selection
operational strategy
relationship matrix
manufacturing attributes


Fully implicit 1D radiation hydrodynamics: Validation and verification A fully implicit finite difference scheme has been developed to solve the hydrodynamic equations coupled with radiation transport. Solution of the time-dependent radiation transport equation is obtained using the discrete ordinates method and the energy flow into the Lagrangian meshes as a result of radiation interaction is fully accounted for. A tridiagonal matrix system is solved at each time step to determine the hydrodynamic variables implicitly. The results obtained from this fully implicit radiation hydrodynamics code in the planar geometry agrees well with the scaling law for radiation driven strong shock propagation in aluminium. For the point explosion problem the self similar solutions are compared with results for pure hydrodynamic case in spherical geometry. Results obtained when radiation interaction is also accounted agree with those of point explosion with heat conduction for lower input energies. Having, thus, benchmarked the code, self convergence of the method w.r.t. time step is studied in detail for both the planar and spherical problems. Spatial as well as temporal convergence rates are ?1 as expected from the difference forms of mass, momentum and energy conservation equations. This shows that the asymptotic convergence rate of the code is realized properly.

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

implicit radiation hydrodynamics
lagrangian meshes
finite difference scheme
point explosion problem
self similar solutions


Multimodal augmented reality tangible gaming This paper presents tangible augmented reality gaming environment that can be used to enhance entertainment using a multimodal tracking interface. Players can interact using different combinations between a pinch glove, a Wiimote, a six-degrees-of-freedom tracker, through tangible ways as well as through I/O controls. Two tabletop augmented reality games have been designed and implemented including a racing game and a pile game. The goal of the augmented reality racing game is to start the car and move around the track without colliding with either the wall or the objects that exist in the gaming arena. Initial evaluation results showed that multimodal-based interaction games can be beneficial in gaming. Based on these results, an augmented reality pile game was implemented with goal of completing a circuit of pipes (from a starting point to an end point on a grid). Initial evaluation showed that tangible interaction is preferred to keyboard interaction and that tangible games are much more enjoyable.

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

serious games
pervasive computing
multimodal interfaces


Application of structural topology optimisation to perforated steel beams Structural topology optimisation to design steel I-section beam web openings. Numerical analysis and parametric study of local beam sections. Initial suggestion of web opening shapes by the optimal topology. Shear buckling characteristics of optimised beam webs using a nonlinear FEA. Barriers to the implementation of the topology optimisation techniques.

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

castellated
cellular
novel web opening
simp technique
opening configuration


using an interaction model as a resource for communication in design Many design models and representations have been proposed to support user-centered system design, such as scenarios, use cases, and prototypes. With these artifacts, designers typically deal with representations of fragments of the application, and sometimes have difficulties communicating with one another about design decisions. To face some of the communication challenges during design, we believe that we could use a global view of the system's apparent behavior, from the users' point of view. Such a representation would serve as a common reference for HCI designers from different disciplinary backgrounds, helping to foster communication among them. In our goal to promote a shared understanding of the application, we have investigated different professionals' usage of MoLIC, an interaction modeling language that follows an interaction-as-conversation metaphor. MoLIC allows designers to build a blueprint of all the interactions that may take place when the application is used.

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

multidisciplinary design teams
software design representations