CoMed: a real-time collaborative medicine system CoMed is a prototype of a real-time collaborative medicine system that allows medical specialists to share patient records and to communicate with each other on the Internet. CoMed consists of a multimedia medical database containing relevant information about laryngeal diseases and a real-time collaboration system including a teleconferencing system, a whiteboard and a chatting system. CoMed is web-based. We adopted the object database O2 and CORBA technologies for the multimedia medical database. Therefore, our system can provide the flexibility, extensibility and location transparency of patient databases. We developed a SeeYou Active X control for the teleconferencing system and a Java applet for the whiteboard and chatting system. CoMed improves the efficiency of the overall system by separating the servers on a UNIX machine and a Windows NT machine. CoMed can be utilized for stand-alone research, for collaborative consultations among medical specialists and for a telemedicine in participation with the patients and medical specialists. Our system can be extended easily into other types of the collaborative systems, such as collaborative distance learning, collaborative science system, etc.

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

teleconsultation
teleotolaryngology
multimedia patient database
web-based
real-time collaboration


An Intelligent Ubiquitous Middleware for U-City: SmartUM In this paper, we present an intelligent ubiquitous middleware which provides semantic service discovery based on context-awareness and a variety of intelligent ubiquitous convergence services for the applications of ubiquitous city. It is composed of four layers: Common Interface Layer, Context-aware Computing Layer, Ubiquitous Core Computing Layer and Grid Computing Layer. The layers cooperate to give intelligent ubiquitous convergence services and provide the advantages of layered architecture. The middleware has been developed to construct an intelligent ubiquitous system since 2005.

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

service-oriented architectures
component-oriented architectures
context-aware computing


Perceived consistency between process models Process-aware information systems typically involve various kinds of process stakeholders. That, in turn, leads to multiple process models that capture a common process from different perspectives and at different levels of abstraction. In order to guarantee a certain degree of uniformity, the consistency of such related process models is evaluated using formal criteria. However, it is unclear how modelling experts assess the consistency between process models, and which kind of notion they perceive to be appropriate. In this paper, we focus on control flow aspects and investigate the adequacy of consistency notions. In particular, we report findings from an online experiment, which allows us to compare in how far trace equivalence and two notions based on behavioural profiles approximate expert perceptions on consistency. Analysing 69 expert statements from process analysts, we conclude that trace equivalence is not suited to be applied as a consistency notion, whereas the notions based on behavioural profiles approximate the perceived consistency of our subjects significantly. Therefore, our contribution is an empirically founded answer to the correlation of behaviour consistency notions and the consistency perception by experts in the field of business process modelling.

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

process model consistency
behavior equivalence
model refinement


Modeling skin thermal pain sensation: Role of non-Fourier thermal behavior in transduction process of nociceptor Skin thermal pain is one of the most common phenomena in human daily life (e.g. contact with hot substances) and in clinical thermal therapies (e.g. laser assisted diseased skin ablation), where the thermal behavior in skin tissue is the critical process. However, the underlying physical and neural mechanisms of skin thermal pain are not clearly understood, and there are few attempts to model it. Besides, due to the lengthy thermal relaxation time in biological tissue, non-Fourier thermal behavior has been experimentally observed, attracting increasingly attention to this phenomenon. In this paper, a new thermal-neural model was developed in order to investigate the possible role of non-Fourier thermal behavior in the transduction process of skin thermal pain sensation. In the model, the non-Fourier thermal behavior of skin tissue was coupled to the neural response of the nociceptor (special receptor for pain sensation). The results demonstrated that the predicted thermal-neural responses of nociceptors from different bioheat transfer models can deviate substantially under constant surface temperature heating, implying that the non-Fourier thermal feature may play an important role in the nociceptor transduction process of skin thermal pain.

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

skin tissue
neural response
thermal pain
modeling
nociceptor


Hybrid k-Anonymity Anonymization-based privacy protection ensures that published data cannot be linked back to an individual. The most common approach in this domain is to apply generalizations on the private data in order to maintain a privacy standard such as k-anonymity. While generalization-based techniques preserve truthfulness, relatively small output space of such techniques often results in unacceptable utility loss especially when privacy requirements are strict. In this paper, we introduce the hybrid generalizations which are formed by not only generalizations but also the data relocation mechanism. Data relocation involves changing certain data cells to further populate small groups of tuples that are indistinguishable with each other. This allows us to create anonymizations of finer granularity confirming to the underlying privacy standards. Data relocation serves as a tradeoff between utility and truthfulness and we provide an input parameter to control this tradeoff. Experiments on real data show that allowing a relatively small number of relocations increases utility with respect to heuristic metrics and query answering accuracy.

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

anonymization
privacy-preserving databases
k-anonymity
utility in data publishing


A nonlinear, recurrence-based approach to traffic classification The ability to accurately classify and identify the network traffic associated with different applications is a central issue for many network operation and research topics including Quality of Service enforcement, traffic engineering, security, monitoring and intrusion-detection. However, traditional classification approaches for traffic to higher-level application mapping, such as those based on port or payload analysis, are highly inaccurate for many emerging applications and hence useless in actual networks. This paper presents a recurrence plot-based traffic classification approach based on the analysis of non-stationary hidden transition patterns of IP traffic flows. Such nonlinear properties cannot be affected by payload encryption or dynamic port change and hence cannot be easily masqueraded. In performing a quantitative assessment of the above transition patterns, we used recurrence quantification analysis, a nonlinear technique widely used in many fields of science to discover the time correlations and the hidden dynamics of statistical time series. Our model proved to be effective for providing a deterministic interpretation of recurrence patterns derived by complex protocol dynamics in end-to-end traffic flows, and hence for developing qualitative and quantitative observations that can be reliably used in traffic classification.

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

recurrence quantification analysis
traffic classification


Fuzzy Distance-Based Range Queries over Uncertain Moving Objects Data obtained from real world are imprecise or uncertain due to the accuracy of positioning devices, updating protocols or characteristics of applications. On the other hand, users sometimes prefer to qualitatively express their requests with vague conditions and different parts of search region are in-equally important in some applications. We address the problem of efficiently processing the fuzzy range queries for uncertain moving objects whose whereabouts in time are not known exactly, for which the basic syntax is find objects always/sometimes near to the query issuer with the qualifying guarantees no less than a given threshold during a given temporal interval. We model the location uncertainty of moving objects on the utilization of probability density functions and describe the indeterminate boundary of query range with fuzzy set. We present the qualifying guarantee evaluation of objects, and propose pruning techniques based on the alpha-cut of fuzzy set to shrink the search space efficiently. We also design rules to reject non-qualifying objects and validate qualifying objects in order to avoid unnecessary costly numeric integrations in the refinement step. An extensive empirical study has been conducted to demonstrate the efficiency and effectiveness of algorithms under various experimental settings.

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

moving object
distance-based range query


Simplified NewtonRaphson power-flow solution method This paper presents a simplified version of the well-known NewtonRaphson power-flow solution method, which is based on the current balance principle to formulate a set of nonlinear equations. Although there exist several powerful power flow solvers based on the standard NewtonRaphson (NR) method, their corresponding problem formulation is not simple due to the need for calculation of derivatives in their Jacobian matrix. The proposed method employs nonlinear current mismatch equations instead of the commonly-used power mismatches to simplify overall equation complexity. Derivation of Jacobian matrixs updating formulae is illustrated in comparison with those of the standard NewtonRaphson method. To demonstrate its use, a simple 3-bus power system was selected as a numerical example. The effectiveness of the proposed method was examined by computer simulations through five test systems: (1) 5-bus test system, (2) 6-bus test system, (3) 24-bus IEEE test system, (4) 30-bus IEEE test system and (5) 57-bus IEEE test system. Its convergence and calculation time were observed carefully and compared with solutions obtained by the standard NR power flow method. The results show that the proposed NR method spends less execution time than the standard method does with similar convergence characteristics.

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

power-flow solution
newtonraphson iterative method
floating-point operation counting
quadratic convergence


Integrated business and engineering framework for synthesis and design of enterprise-wide processing networks The synthesis and design of processing networks is a complex and multidisciplinary problem, which involves many strategic and tactical decisions at business (considering financial criteria, market competition, supply chain network, etc.) and engineering levels (considering synthesis, design and optimization of production technology, R&D, etc.), all of which have a deep impact on the profitability of processing industries. In this study, an integrated business and engineering framework for synthesis and design of processing networks is presented. The framework employs a systematic approach to manage the complexity while solving simultaneously both the business and the engineering aspects of problems, allowing at the same time, comparison of a large number of alternatives at their optimal points. The results identify the optimal raw material, the product portfolio and select the process technology for a given market scenario together with the optimal material flows through the network and calculate the corresponding performance and sustainability metrics. The framework includes a software infrastructure for integrating different methods and tools needed for problem definition, formulation and solution of the design problem as a MINLP, reducing thereby the time and cost needed to generate and solve the design/synthesis problems and providing efficient data transfer between the tools. A generic structural process model has been implemented within the framework to describe the multidimensional engineering issues allowing thereby fast and flexible model development for various production processes. A case study from vegetable oil industry is used successfully to demonstrate the applicability of the integrated framework for making optimal business and engineering decisions. (C) 2011 Elsevier Ltd. All rights reserved.

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

integrated business and engineering
vegetable oil

mixed-integer non-linear program (minlp)


An efficient algebraic algorithm for the geometric completion to involution We describe an adaption of a differential algebraic completion algorithm for linear systems of partial differential equations that allows us to deduce intrinsic differential geometric information like the number of prolongations and projections needed for the completion. This new hybrid algorithm represents a much more efficient realisation of the classical Cartan-Kuranishi completion than previous purely geometric ones. A classical problem in geometric completion theory is the existence of delta-singular coordinate systems in which the algorithms do not terminate. We develop a new and a very simple criterion for delta-singularity based on a comparison of the Janet and the Pommaret division. This criterion can also be used for the direct construction of delta-regular coordinates.

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

partial differential equation
cartan-kuranishi theorem
involutive basis
delta-regularity


Development, implementation, and a cognitive evaluation of a definitional question answering system for physicians The published medical literature and online medical resources are important sources to help physicians make patient treatment decisions. Traditional sources used for information retrieval (e.g., PubMed) often return a list of documents in response to a users query. Frequently the number of returned documents from large knowledge repositories is large and makes information seeking practical only after hours and not in the clinical setting. This study developed novel algorithms, and designed, implemented, and evaluated a medical definitional question answering system (MedQA). MedQA automatically analyzed a large number of electronic documents to generate short and coherent answers in response to definitional questions (i.e., questions with the format of What is X?). Our preliminary cognitive evaluation shows that MedQA out-performed three other online information systems (Google, OneLook, and PubMed) in two important efficiency criteria; namely, time spent and number of actions taken for a physician to identify a definition. It is our contention that question answering systems that aggregate pertinent information scattered across different documents have the potential to address clinical information needs within a timeframe necessary to meet the demands of clinicians.

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

question answering
information retrieval
evaluation

question analysis
text summarization
machine-learning


design of superbuffers in sub-100nm cmos technologies with significant gate leakage In this paper, we first study the behavior of gate leakage current in a simple inverter. We make some important observations about the gate leakage in both PMOS and NMOS devices. We then study the trade off between power and delay in a standard inverter within a particular buffer chain when reducing the size of the pull-down device. In the last part of this paper, we present an alternate leakage suppressed inverter for driving large loads. We finally compare the performance of our proposed circuit with those of standard and scaled-down inverters and show that we can significantly reduce the standby power in certain situations with a modest reduction in speed.

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


Measuring elongation from shape boundary Shape elongation is one of the basic shape descriptors that has a very clear intuitive meaning. That is the reason for its applicability in many shape classification tasks. In this paper we define a new method for computing shape elongation. The new measure is boundary based and uses all the boundary points. We start with shapes having polygonal boundaries. After that we extend the method to shapes with arbitrary boundaries. The new elongation measure converges when the assigned polygonal approximation converges toward a shape. We express the measure with closed formulas in both cases: for polygonal shapes and for arbitrary shapes. The new measure finds the elongation for shapes whose boundary is not extracted completely, which is impossible to achieve with area based measures.

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

orientation
image processing
computer vision
early vision


meaning and the semantic web The meaning of names (URI references) is a contentious issue in the Semantic Web. Numerous proposals have been given for how to provide meaning for names in the Semantic Web, ranging from a strict localized model-theoretic semantics to proposals for a unified single meaning. We argue that a slight expansion of the standard model-theoretic semantics for names is sufficient for the present, and can easily be augmented where necessary to allow communities of interest to strengthen this spartan theory of meaning.

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


Chordally signed graphs Define a chordally signed graph to be a signed chordal graph (meaning that each edge is designated as being positive or negative and every induced cycle is a triangle) in which every positive cycle C (meaning every cycle C that contains an even number of negative edges) has a chord e such that C?{e} forms two positive cycles. Two characterizations of chordally signed graphs support the naturalness of this definition. In addition, chordally signed graphs can be easily recognized when the underlying graph has at most two maximal complete subgraphs (with minimal balancing vertex sets playing a key role).

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


Parameterized linear matrix inequality techniques in fuzzy control system design This paper proposes different parameterized linear matrix inequality (PLMI) characterizations for fuzzy control systems. These PLMI characterizations are, in turn, relaxed into pure LMI programs, which provides tractable and effective techniques for the design of suboptimal fuzzy control systems. The advantages of the proposed methods over earlier ones are then discussed and illustrated through numerical examples and simulations.

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

parameterized linear matrix inequality (plmi)


A fully general, exact algorithm for nesting irregular shapes This paper introduces a fully general, exact algorithm for nesting irregular shapes. Both the shapes and material resource can be arbitrary nonconvex polygons. Moreover, the shapes can have holes and the material can have defective areas. Finally, the shapes can be arranged using both translations and arbitrary rotations (as opposed to a finite set of rotation angles, such as 0\(^\circ \)and 180\(^\circ \)). The insight that has made all this possible is a novel way to relax the constraint that the shapes not overlap. The key idea is to inscribe a few circles in each irregular shape and then relax the non-overlap constraints for the shapes by replacing them with non-overlap constraints for the inscribed circles. These relaxed problems have the form of quadratic programming problems (QPs) and can be solved to optimality to provide valid lower bounds. Valid upper bounds can be found via local search with strict non-overlap constraints. If the shapes overlap in the solution to the relaxed problem, new circles are inscribed in the shapes to prevent this overlapping configuration from recurring, and the QP is then resolved to obtain improved lower bounds. Convergence to any fixed tolerance is guaranteed in a finite number of iterations. A specialized branch-and-bound algorithm, together with some heuristics, are introduced to find the initial inscribed circles that approximate the shapes. The new approach, called QP-Nest, is applied to three problems as proof of concept. The most complicated of these is a problem due to Milenkovic that has four nonconvex polygons with 94, 72, 84, and 74 vertices, respectively. QP-Nest is able prove global optimality when nesting the first two or the first three of these shapes. When all four shapes are considered, QP-Nest finds the best known solution, but cannot prove optimality.

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

irregular shape
quadratic programming
rotation

fabric nesting
leather nesting
nonconvex polygon
inscribed circle
inner approximation
global optimization
cutting and packing
translation
guaranteed optimality


fragile watermarking scheme based on the block-wise dependence in the wavelet domain In transform-domain fragile watermarking schemes for authentication purposes, a common practice is to watermark some selected transform coefficients in order to achieve low embedding distortion. However, we point out in this work that leaving most of the coefficients, usually the low frequency and zero-valued ones, unmarked opens wide security gap for attacks to be mounted on them. In this work, a fragile watermarking scheme is proposed to implicitly watermark all the coefficients by registering the zero-valued coefficients with a key-generated binary sequence so as to create the watermark and involving the unwatermarkable coefficients within a hierarchical neigh-bourhood of the watermarkable coefficients in a random manner during the embedding process. The benefit of this approach is twofold: Firstly, only a small amount of coefficients are marked while all the coefficients are protected, so that high transparency is achieved. Secondly, when the relationship established in a random manner within a hierarchical neighbourhood is disturbed, the watermark detector would fail to extract the watermarking. This puts up resistance to the vector quantisation attack and transplantation attack.

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

multimedia security
selective embedding algorithm
non-deterministic block-wise dependence


Performance Enhancement of UWB Power Control Using Ranging and Narrowband Interference Mitigation Technique Power control is a critical parameter for the design and evaluation of UWB-based WPAN networks due to its distributed control nature and non-fixed topology. The main issues in UWB PC are the channel gain fluctuations induced by indoor channel fluctuation and interference arising from narrowband systems. In this paper we introduce a joint PHY/MAC technique for DS-UWB power control design by exploiting the high time resolution of the UWB signal for channel gain improvement and mitigate the narrowband interference to reduce transmitted power. The results indicate that the proposed approach achieves better BER and throughput over previous works.

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


A heuristic for the continuous capacity and flow assignment This work deals with the Continuous Capacity and Flow Assignment (CFA) problem for the design of computer networks. This is a nonconvex optimization problem which has been usually solved by applying local optimization techniques. By rephrasing the problem in the context of concave programming and bringing an alternative formulation of the projected pairwise multicommodity flow polyhedron, a heuristic method for the search of a global minimum of the CFA is proposed. Its implementation is discussed, and computational tests with real backbone networks show that the proposed method compares favorably to previous approaches.

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

global optimization
multicommodity flows


A multinomial selection procedure for evaluating pattern recognition algorithms This paper introduces a multinomial selection problem (MSP) procedure as an alternative to classification accuracy and receiver operating characteristic analysis for evaluating competing pattern recognition algorithms. This new application of MSP demonstrates increased differentiation power over traditional classifier evaluation methods when applied to three toy problems of varying difficulty. The MSP procedure is also used to compare the performance of statistical classifiers and artificial neural networks on three real-world classification problems. The results provide confidence in the MSP procedure as a useful tool in distinguishing between competing classifiers and providing insights on the strength of conviction of a classifier.

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

artificial neural network (ann)
multilayer perceptron (mlp)
multinomial selection problem (msp)
pattern recogntion
receiver operating characteristic (roc)


Performance feature identification by comparative trace analysis This work introduces a method for instrumenting applications, producing execution traces, and visualizing multiple trace instances to identify performance features. The approach provides information on the execution behavior of each process within a parallel application and allows differences across processes to be readily identified. Traces events are directly related to the source code and call-chain that produced them. This allows the identification of the causes of events to be easily obtained. The approach is particularly suited to aid in the understanding of the achieved performance from an application centric viewpoint. In particular, it can be used to assist in the formation of analytical performance models which can be a time-consuming task for large complex applications. The approach is one of human-effort reduction: focus the interest of the performance specialist on performance critical code regions rather than automating the performance model formulation process completely. A supporting implementation analyses trace files from different runs of an application to determine the relative performance characteristics for critical regions of code and communication 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

performance modeling
high performance systems
dynamic trace analysis
performance visualization


Determining radius and position of a sphere from a single catadioptric image In order to improve robot capabilities related to playing with a flying ball, reliable methods to localize a sphere in the 3D space are needed. When the radius of the sphere is known, it can be localized by analyzing a single, perspective image of it. When the sphere radius is not known, a single perspective image is not sufficient. In this paper we consider axial-symmetric catadioptric cameras, i.e. devices consisting of an axial-symmetric mirror plus a perspective camera, whose viewpoint is on the symmetry axis. If the viewing rays are not all concurrent at a single point, this camera is said to be non-central. We show that, using a noncentral axial-symmetric catadioptric camera, a single image is sufficient to determine both the position of a sphere and its radius. Some preliminary experimental results are also presented.

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

non-central cameras
sphere reconstruction


The minimum number of minimal codewords in an [n,k] [ n , k ] -code and in graphic codes We survey some lower bounds on the function in the title based on matroid theory and address the following problem by Dosa etal. (2004): Determine the smallest number of circuits in a loopless matroid with no parallel elements and with a given size and rank. In the graphic 3-connected case we provide a lower bound which is a product of a linear function of the number of vertices and an exponential function of the average degree. We also prove that, for p?38 p ? 38 , every 3-connected graph with p p vertices has at least as many cycles as the wheel with p p vertices.

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


Direct numerical simulation of preferential particle concentration in decaying turbulence under the influence of magnetic field This paper presents a direct numerical simulation of an isotropic turbulence at Reynolds number R(lambda)=71.4. The statistics of heavy particles in such turbulence has been investigated. The numerical results indicate the merit of method in solving the magnetohydrodynamic turbulence. The revision of the paper was made based on the reviewers' comments. The paper was improved significantly. Hence, review suggests accepting the submission in current form. Copyright (C) 2009 John Wiley & Sons, Ltd.

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

direct numerical simulation
decaying turbulence
magnetic field

multiphase flow
preferential concentration
fourier-galerkin spectral method


Microlens array produced using hot embossing process In this paper, the fabrication of molds that are suitable for the production of microlens arrays using the replication technique is discussed. Variation of parameters in the replication process were investigated. A focused ion beam was used to fabricate the microlens cavities on three materials, with silicon showing the best result. Hot embossing was used to produce replicated polycarbonate lens array. The temperature of the mold and the embossing force were the two parameters varied. The microlens array produced using the embossing replication process demonstrates the possibility of nanometre fabrication.

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

microlens array
focused ion beam
hot embossing


Hydro unit commitment and loading problem for day-ahead operation planning problem We describe a new model for the hydro unit commitment and loading (HUCL) problem that has been developed to be used as a support tool for day-ahead operation in the Brazilian system. The objective is to determine the optimal unit commitment and generation schedules for cascaded plants with multiple units and a head-dependent hydropower model. In this paper, we propose a new mathematical model for the hydropower function where the mechanical and electrical losses in the turbine-generator are included. We model the HUCL problem as a nonlinear mixed 01 programming problem and solve it with a strategy that includes a two-phase approach based on dual decomposition. The computational tool allows the model to effectively schedule hydro units for the problem in the Brazilian regulatory framework. Application of the approach is demonstrated by determining a 24-time step HUCL schedule for four cascaded plants with 4170MW of installed capacity.

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

hydro unit commitment and loading problem

lagrangian relaxation
inexact augmented lagrangian


Matching macroscopic properties of binary fluids to the interactions of dissipative particle dynamics We investigate the role played by conservative forces in dissipative particle dynamics (DPD) simulation of single-component, and binary fluids. We employ equations from kinetic theory for matching the coefficients of DPD interparticle force to the macroscopic properties of fluid such as: density, temperature, diffusion coefficient, kinematic viscosity and sound velocity The sound velocity c is coupled with scaling factor pi(1) of conservative component of the DFD collision operator. Its value sets up an upper limit on the mass S of a single particle in DPD fluid. The Kirkwood-Alder fluid-solid transition is observed for a sufficiently large S. We emphasize the role of the scaling factor pi(12) for particles of different types in simulating phase separation in binary fluids. The temporal growth of average domain size R(t) in the phase separation process depends on the value of immiscibility coefficient Delta = pi(12) - pi(1). For small immiscibility, R(t) proportional to t(beta), where beta approximate to 1/2 for R(t) R-H, R-H is the hydrodynamic length. Finally, both phases separate out completely. For larger immiscibility, R(t) increases exponentially at the beginning of simulation, while finally the domain growth process becomes marginal. We also observe the creation of emulsion-like structures. This effect results from an increase of the surface tension on the two-phase interface along with increasing immiscibility.

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

dissipative particle dynamics
phase separation

particle interactions
computer simulations


An experiment on the effectiveness of creativity enhancing decision-making support systems Recent research suggests that creativity can enhance the performance of people for a variety of tasks, including decision-making. Creativity enhancements can be delivered through a decision-making support system. In theory, such delivery should improve the decision performance of the system's user. This paper tests the theory empirically and discusses the implications for decision-making.

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

decision-making support
creativity enhancement and delivery
decision support


Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring We solve a problem already investigated by Mohri in 1997: we show that the twins property for weighted finite automata over the tropical semiring is decidable and PSPACE-complete. We also point out that it is undecidable whether two given states are twins. (C) 2011 Elsevier B.V. All rights reserved.

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

weighted finite automata
tropical semiring
twins property


A novel implicit numerical treatment for non-linear turbulence models using high and low Reynolds number formulations Non-linear turbulence models can be seen as an improvement of the classical eddy-viscosity concept due to their better capacity to simulate characteristics of important flows. However, application of non-linear models demand robustness of the numerical method applied, requiring a stable discretization scheme for convergence of all variables involved. Usually, non-linear terms are handled in an explicit manner leading to possible numerical instabilities. Thus, the present work shows the steps taken to adapt a general non-linear constitutive equation using a new semi-implicit numerical treatment for the non-linear diffusion terms. The objective is to increase the degree of implicitness of the solution algorithm to enhance convergence characteristics. Flow over a backward-facing step was computed using the control volume method applied to a boundary-fitted coordinate system. The SIMPLE algorithm was used to relax the algebraic equations. Classical wall function and a low Reynolds number model were employed to describe the flow near the wall. The results showed that for certain combination of relaxation parameters, the semi-implicit treatment proposed here was the sole successful treatment in order to achieve solution convergence. Also, application of the implicit method described here shows that the stability of the solution either increases (high Reynolds with non-orthogonal mesh) or preserves the same (low Reynolds number applications). Additional advantages of the procedure proposed here lie in the possibility of testing different non-linear expressions if one considers the enhanced robustness and stability obtained for the entire numerical algorithm. Copyright (C) 2010 John Wiley & Sons, Ltd.

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


Fabrication of multi-dimensional colloid crystals on raised surfaces via reversal nanoimprint lithography Fabrication of multi-dimensional colloidal crystals on raised polymer substrate has been achieved by reversal nanoimprint technique. The combine effects of the feature size of the mold, particle diameter and imprinting steps control ordering of the colloidal particles. It is shown that using Reversal nanoimprint lithography, 3D colloidal particles can be selectively patterned on soft (polymer) substrates. Reversal nanoimprint lithography offers a relatively easy, fast and versatile method for patterning of colloidal particles.

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

patterning
nanoimprint lithography
colloidal particles


Existence results for fractional order functional differential equations with impulse In this paper, we use the analytic semigroup theory of linear operators and the fixed point method to prove the existence of mild solutions for the semilinear fractional order functional differential equations with impulse in a Banach space. (C) 2012 Elsevier Ltd. 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 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

impulsive functional differential equations


Surjunctivity for Cellular Automata in Besicovitch Spaces The Besicovitch pseudodistance measures the relative size of the set of points where two functions take different values; the quotient space modulo the induced equivalence relation is endowed with a natural metric. We study the behavior of cellular automata in the new topology and show that, under suitable additional hypotheses, they retain certain properties possessed in the usual product topology; in particular, injectivity implies surjectivity.

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

finitely generated groups
besicovitch topology


Growth mechanism and optical properties of semiconducting Mg2Si thin films Reactive deposition of magnesium onto a hot silicon substrate (200500C) does not result in any accumulation of magnesium or its silicide the condensation coefficient of magnesium being zero. On the other hand, codeposition of magnesium with silicon at 200C, using a magnesium-rich flux ratio, gives a stoichiometric Mg2Si film. The number of magnesium atoms which condense is equal to twice the number of silicon atoms which were deposited. The Mg2Si layers are polycrystalline with a (111) texture. These stoichiometric silicide films still show a tendency to sublimate; whereas capping with an oxide results in extensive intermixing during annealing. The Mg2Si films thus obtained exhibit optical transparency at sufficiently long wavelength, and an absorption edge. Extraction of the absorption coefficient from the data, and analysis of its energy dependence suggest an indirect bandgap of ?0.74 eV, plus direct transitions at ?0.83 and ?0.99 eV.

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


How to approximate users values while preserving privacy: experiences with using attitudes towards work tasks as proxies for personal value elicitation Software users have different sets of personal values, such as benevolence, self-direction, and tradition. Among other factors, these personal values influence users emotions, preferences, motivations, and ways of performing tasksand hence, information needs. Studies of user acceptance indicate that personal traits like values and related soft issues are important for the users approval of software. If a users dominant personal value were known, software could automatically show an interface variant which offers information and functionality that best matches his or her dominant value. A users dominant personal value is the one that most strongly influences his or her attitudes and behaviors. However, existing methods for measuring a users values are work intensive and/or interfere with the users privacy needs. If interface tailoring for very large groups of users is planned, value approximation has to be achieved on a large scale to assign individualized software to all users of the software. Our work focuses on approximating the dominant values of a user with less effort and less impact on privacy. Instead of probing for a users values directly, we explore the potential of approximating these values based on the users preferences for key tasks. Producing tailored versions of software is a separate topic not in the focus here. In this paper we rather describe a method to identify user values from task preferences and an empirical study of applying parts of this method. We are proposing the method in this paper for the first time except for a preliminary version orally presented at a workshop. The method consists of a research process and an application process. In the research process a researcher has to identify key tasks occurring in a context under investigation which have a relationship to personal values. These key tasks can be used in the application process to approximate the dominant values of new users in a similar context. In this empirical study we show that the research process of our method allows us to determine key tasks which approximate values in the shared context of nursing. The majority of the nurses were found to have one of the three following dominant values: benevolence, self-direction, or hedonism. Data confirmed common expectations: that nurses with the value of benevolence, when compared to all other nurses, had a higher preference for tasks which helped people immediately or improved their circumstances of the treatment. In relation to all other nurses, participants with self-direction disliked tasks which affected their personal freedom, and users with hedonism had a lower preference for tasks which involved physical work and preferred tasks which promised gratification. Our findings advance measurement of personal values in large user groups by asking questions with less privacy concern. However, the method requires substantial efforts during the initial research process to prepare such measurements. Future work includes replicating our method in other contexts and identifying value-dependent tasks for users with other values than the three values our empirical study mainly focused on.

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

personal values
value elicitation
value approximation
privacy

software tailoring
individualized interface
value-sensitive design


The application of statistical reliability theory in the context of Intelligent Environments: a tutorial review Intelligent Environments often require the integration of multi-modal sensing and actuating technologies with high performance real-time computation, including artificial intelligence systems for analysis, learning patterns and reasoning. Such systems may be complex, and involve multiple components. However, in order to make them affordable, Intelligent Environments sometimes require many of their individual components to be low-cost. Nevertheless, in many applicationsincluding safety-critical systems, and systems monitoring the health and well-being of vulnerable individuals, it is essential that these Intelligent Environment systems are reliable, which the issue of affordability must not compromise. If such environments are to find real application and deployment in these types of domain, it is necessary to be able to obtain accurate predictions of how probable any potential failure of the system is in any given timeframe, and of statistical parameters regarding the expected time to the first, or between successive, failures. Such quantities must be kept within what are deemed to be acceptable tolerances if the Intelligent Environment is to be suitable for applications in these critical areas, without requiring excessively high levels of human monitoring and/or intervention. In this paper, an introductory overview of statistical reliability theory is presented. The applicability of this to the context of Intelligent Environmentsparticularly those involving safety critical or other sensitive issuesis discussed, along with how such reliability modelling can be used to influence the design, implementation and application of an Intelligent Environment.

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


web-based knowledge database construction method for supporting design Recently, designers have been required solving comprehensive problem becoming greater and more complicated. In relation to this background, we have proposed Universal Abduction Studio (UAS); a computer environment that synthetically supports creative design. However, it is difficult for a designer to manually acquire multiple domain knowledge required for UAS. Therefore, we propose a Web-based knowledge database construction method for supporting design by UAS in this paper.

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


An Adaptive Network Coded Retransmission Scheme for Single-Hop Wireless Multicast Broadcast Services Network coding has recently attracted attention as a substantial improvement to packet retransmission schemes in wireless multicast broadcast services (MBS). Since the problem of finding the optimal network code maximizing the bandwidth efficiency is hard to solve and hard to approximate, two main network coding heuristic schemes, namely opportunistic and full network coding, were suggested in the literature to improve the MBS bandwidth efficiency. However, each of these two schemes usually outperforms the other in different receiver, demand, and feedback settings. The continuous and rapid change of these settings in wireless networks limits the bandwidth efficiency gains if only one scheme is always employed. In this paper, we propose an adaptive scheme that maintains the highest bandwidth efficiency obtainable by both opportunistic and full network coding schemes in wireless MBS. The proposed scheme adaptively selects, between these two schemes, the one that is expected to achieve the better bandwidth efficiency performance. The core contribution in this adaptive selection scheme lies in our derivation of performance metrics for opportunistic network coding, using random graph theory, which achieves efficient selection when compared to appropriate full network coding parameters. To compare between different complexity levels, we present three approaches to compute the performance metric for opportunistic coding using different levels of knowledge about the opportunistic coding graph. For the three considered approaches, simulation results show that our proposed scheme almost achieves the bandwidth efficiency performance that could be obtained by the optimal selection between the opportunistic and full coding schemes.

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

opportunistic and full network coding
packet retransmission

chromatic number of random graphs
graph coloring
multicast broadcast services (mbs)


Structural coverage criteria for LUSTRE/SCADE programs LUSTRE is a data-flow synchronous language, on which is based the SCADE tool-suite, widely used for specifying and programming critical reactive applications in the areas of avionics, energy or transport. Therefore, testing LUSTRE programs, that is, generating test data and assessing the achieved test coverage, is a major issue. Usual control-flow-based test coverage criteria (statement coverage, branch coverage, etc.) are not relevant for LUSTRE programs. In this paper, a new hierarchy of adequacy criteria tailored to the LUSTRE language is presented. These criteria are defined on operator networks, which are usual models for LUSTRE programs. The criteria satisfaction measure is automated in LUSTRUCTU, a non-intrusive tool (no instrumentation of the code), based on the symbolic computation of path activation conditions. The applicability and the relevance of the criteria are assessed on a case study. Copyright (C) 2008 John Wiley & Sons, Ltd.

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

structural testing
synchronous software
coverage measurements


Natural and extended formulations for the Time-Dependent Traveling Salesman Problem In this paper, we present a new formulation for the Time-Dependent Traveling Salesman Problem (TDTSP). We start by reviewing well known natural formulations with some emphasis on the formulation by Picard and Queyranne (1978) [22]. The main feature of this formulation is that it uses, as a subproblem, an exact description of the n n -circuit problem. Then, we present a new formulation that uses more variables and is based on using, for each node, a stronger subproblem, namely an n n -circuit subproblem with the additional constraint that the corresponding node is not repeated in the circuit. Although the new model has more variables and constraints than the original PQ model, the results given from our computational experiments show that the linear programming relaxation of the new model gives, for many of the instances tested, gaps that are close to zero. Thus, the new model is worth investigating for solving TDTSP instances. We have also provided a complete characterization of the feasible set of the corresponding linear programming relaxation in the space of the variables of the PQ model. This characterization permits us to suggest alternative methods of using the proposed formulations.

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

time dependent traveling salesman problem


Modeling and simulation of WDM optical networks under traffic control protocols A proper node architecture design capable to support different network protocol enhances the data transport capability of a wavelength division multiplexed system. In the present paper a simple node architecture model has been developed to simulate the node throughput based on media access control protocols for bursty data traffic of variable time slot duration and data rate. An appropriate mathematical model has been derived to evaluate different types of traffic reservation protocols used in WDM networks. It has been observed that the network performance is well controlled through implemented protocols and network design parameters.

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

destination initiated reservation protocols


Compile-time dynamic voltage scaling settings: Opportunities and limits With power-related concerns becoming dominant aspects of hardware and software design, significant research effort has been devoted towards system power minimization. Among run-time power-management techniques, dynamic voltage scaling (DVS) has emerged as an important approach, with the ability to provide significant power savings. DVS exploits the ability to control the power consumption by varying a processor's supply voltage (V) and clock frequency (f). DVS controls energy by scheduling different parts of the computation to different (V, f) pairs; the goal is to minimize energy while meeting performance needs. Although processors like the Intel XScale and Transmeta Crusoe allow software DVS control, such control has thus far largely been used at the process/task level under operating system control. This is mainly because the energy and time overhead for switching DVS modes is considered too large and difficult to manage within a single program. In this paper we explore the opportunities and limits of compile-time DVS scheduling. We derive an analytical model for the maximum energy savings that can be obtained using DVS given a few known program and processor parameters. We use this model to determine scenarios where energy consumption benefits from compile-time DVS and those where there is no benefit. The model helps us extrapolate the benefits of compile-time DVS into the future as processor parameters change. We then examine how much of these predicted benefits can actually be achieved through optimal settings of DVS modes. This is done by extending the existing Mixed-integer Linear Program (MILP) formulation for this problem by accurately accounting for DVS energy switching overhead, by providing finer-grained control on settings and by considering multiple data categories in the optimization. Overall, this research provides a comprehensive view of compile-time DVS management, providing both practical techniques for its immediate deployment as well theoretical bounds for use into the future.

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

dynamic voltage scaling
analytical model

low power
compiler
mixed-integer linear programming


design and implementation of multicast operations for atm-based high performance computing This paper presents the results of an investigation into the efficient implementation of multicast operations for cluster-based parallel computing on Asynchronous Transfer Mode (ATM) networks. Both software- and hardware-based multicast operations have been implemented and studied on a three-switch ATM network testbed. Performance measurements are presented that illustrate how software approaches can best take advantage of switch-based network architectures, and what additional advantage can be gained from using underlying hardware support.

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

network
software
design
high performance computing
asynchronous transfer mode
implementation
multicast
testbed
support
hardware
paper

efficiency
architecture
performance measurement
operability
switch
parallel computation
cluster


Application-Specific Signatures for Transactional Memory in Soft Processors As reconfigurable computing hardware and in particular FPGA-based systems-on-chip comprise an increasing number of processor and accelerator cores, supporting sharing and synchronization in away that is scalable and easy to program becomes a challenge. Transactional Memory (TM) is a potential solution to this problem, and an FPGA-based system provides the opportunity to support TM in hardware (HTM). Although there are many proposed approaches to HTM support for ASICs, these do not necessarily map well to FPGAs. In particular in this work we demonstrate that while signature-based conflict detection schemes (essentially bit-vectors) should intuitively be a good match to the bit parallelism of FPGAs, previous approaches result in unacceptable multicycle stalls, operating frequencies, or false-conflict rates. Capitalizing on the reconfigurable nature of FPGA-based systems, we propose an application-specific signature mechanism for HTM conflict detection. Our evaluation uses real and projected FPGA-based soft multiprocessor systems that support HTM and implement threaded, shared-memory network packet processing applications. We find that our application-specific approach: (i) maintains a reasonable operating frequency of 125 MHz, (ii) achieves a 9% to 71% increase in packet throughput relative to signatures with bit selection on a 2-thread architecture, and (iii) allows our HTM to achieve 6%, 54%, and 57% increases in packet throughput on an 8-thread architecture versus a baseline lock-based synchronization for three of four packet processing applications studied, due to reduced false synchronization.

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

algorithms
design
performance
soft processor


Reproducibility and homogeneity in step and repeat UV-nanoimprint lithography A new approach to step and repeat UV-based nanoimprint lithography (UV-NIL) using sequential imprints on a large-area spin-coated surface is presented. A detailed study has been performed in order to assess the reproducibility and homogeneity of the process. The imprint tool features a movable wafer stage for 4 in. wafers, allowing the high precision vertical and lateral positioning necessary for a step and repeat imprint technique. More than 1000 imprints with a single mold were performed without any cleaning of the mold. This demonstrates the high asymmetry between the detachment from the mold and the adhesion to the substrate achieved, an essential issue for reproducibility. Furthermore, the uniformity of the residual resist thickness was analyzed. The measured thicknesses, 5712.5 nm and 11812.5 nm for initial film thicknesses of 210 and 275 nm, respectively, revealed the uniformity to be sufficient for accurate pattern transfer.

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


making an immersive projection environment with our living room Immersive projection technologies surrounding users with large and high quality images are fundamental elements in our near-future information society. However, such large projection systems are frequently based on large implementation and high-cost components like a special projector and screen. This situation limits users receiving the benefits with those technologies. Therefore, in this paper, we propose a technique for changing our living room into an immersive projection environment. The surrounding images are projected with simple projection units with a convex mirror and projectors. The projected images are properly corrected in order to reduce geometric and luminance distortions. Pseudo wide viewangle images generated with standard-sized images also leverage the projection environment effectively as our accessible entertainment space. This paper describes each technique of those, and shows some results.

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

image correction
pseudo wide view-angle image


managing non-native widgets in model-based ui engineering This paper sets out to describe on-going research and development activities aiming to provide new insights to building advanced user interfaces by assembling diverse widgets. To this end, we draw upon the relative merits and drawbacks of the two dominant approaches for developing interactive applications, namely toolkit programming and model-based user interface engineering. We motivate the problem by considering a simple example representative of what toolkit programming may deliver and then contrast its implications on prevailing model-based UI principles and practice. Our analysis reveals the key role of widget abstraction in developing specification-based tools to manage radically different widget sets in a uniform manner. The ultimate goal of this work is to extend MBUI engineering approaches so as to enable them to take account of richer interaction vocabularies becoming increasingly available.

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

toolkits
creativity
model-based ui development
specifications


Non-contact 3D flow-structure interaction measurement (FSIM) system for motion and flow fields - Interactions of a vertical cylinder motion A simultaneous measurement system that can analyze the flow-structure interactions has been developed. This system consists of four CCD cameras, two for capturing instantaneous flow fields and two for tracking a solid body. The three-dimensional vector fields around a cylinder are measured while the motion of the cylinder forced by the flow field is measured simultaneously with the constructed system. The cylinder is suspended in the circulating water channel and the surface of the working fluid is forced sinusoidal to make the cylinder bounced. Reynolds number for the mean main stream is about 3500. The interaction between the flow fields and the cylinder motion is examined quantitatively.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-view clustering via pairwise sparse subspace representation Multi-view clustering, which aims to cluster datasets with multiple sources of information, has a wide range of applications in the communities of data mining and pattern recognition. Generally, it makes use of the complementary information embedded in multiple views to improve clustering performance. Recent methods usually find a low-dimensional embedding of multi-view data, but often ignore some useful prior information that can be utilized to better discover the latent group structure of multi-view data. To alleviate this problem, a novel pairwise sparse subspace representation model for multi-view clustering is proposed in this paper. The objective function of our model mainly includes two parts. The first part aims to harness prior information to achieve a sparse representation of each high-dimensional data point with respect to other data points in the same view. The second part aims to maximize the correlation between the representations of different views. An alternating minimization method is provided as an efficient solution for the proposed multi-view clustering algorithm. A detailed theoretical analysis is also conducted to guarantee the convergence of the proposed method. Moreover, we show that the must-link and cannot-link constraints can be naturally integrated into the proposed model to obtain a link constrained multi-view clustering model. Extensive experiments on five real world datasets demonstrate that the proposed model performs better than several state-of-the-art multi-view clustering methods.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-view clustering
subspace clustering
pairwise sparse representation


Learning Automata-assisted Predictive Clustering approach for Vehicular Cyber-Physical System LA-based predictive clustering is proposed by predicting the future mobility of the nodes in VANETs. Connecting dominating set is constructed to maintain connectivity of the vehicles. Predictive Clustering Algorithm using LA is proposed. The performance of the proposed scheme is evaluated in different network scenarios with respect to various metrics.

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

vehicular adhoc cyber-physical systems
learning automata
stochastic environment
reward
penalty


combined model for text entry rate development We combine the power law of learning and theoretical upper limit predictions to describe the development of text entry rates from users' first contact to asymptotic expert usage. The combined model makes comparing text entry methods easier. We present the rationale for the model and two candidate implementations. The first is a simple regression model with a reasonable fit to the data. The second fits measured data better, but is more complicated.

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

text entry
fit
regression
users
power law
data
learning

method
power law of learning
developer
implementation
modeling
predict


LMI-Based Approach for Output-Feedback Stabilization for Discrete-Time Takagi-Sugeno Systems Static output-feedback stabilizing controllers for nonlinear systems represented by discrete-time Takagi-Sugeno fuzzy models are studied. The main result concerns the stabilization based on the parallel distributed compensation (PDC) approach. Sufficient conditions are provided for quadratic and nonquadratic stability. To design static output-feedback stabilizing controllers, a numerical procedure based on the cone complementarity algorithm is given. It is shown that the relaxed conditions proposed in the nonquadratic case outperform those for the quadratic case. Two numerical examples are given to illustrate the efficiency of the proposed approach.

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

cone complementarity formulation
linear matrix inequalities (lmis)
lyapunov function
takagi-sugeno (t-s) fuzzy model


Online Reorganization of Databases In practice, any database management system sometimes needs reorganization, that is, a change in some aspect of the logical and/or physical arrangement of a database. In traditional practice, many types of reorganization have required denying access to a database (taking the database offline) during reorganization. Taking a database offline can be unacceptable for a highly available (24-hour) database, for example, a database serving electronic commerce or armed forces, or for a very large database. A solution is to reorganize online (concurrently with usage of the database, incrementally during users' activities, or interpretively). This article is a tutorial and survey on requirements, issues, and strategies for online reorganization. It analyzes the issues and then presents the strategies, which use the issues. The issues, most of which involve design trade-offs, include use of partitions, the locus of control for the process that reorganizes (a background process or users' activities), reorganization by copying to newly allocated storage (as opposed to reorganizing in place), use of differential files, references to data that has moved, performance, and activation of reorganization. The article surveys online strategies in three categories of reorganization. The first category, maintenance, involves restoring the physical arrangement of data instances without changing the database definition. This category includes restoration of clustering, reorganization of an index, rebalancing of parallel or distributed data, garbage collection for persistent storage, and cleaning (reclamation of space) in a log-structured file system. The second category involves changing the physical database definition; topics include construction of indexes, conversion between B(+)-trees and linear hash files, and redefinition (e. g., splitting) of partitions. The third category involves changing the logical database definition. Some examples are changing a column's data type, changing the inheritance hierarchy of object classes, and changing a relationship from one-to-many to many-to-many. The survey encompasses both research and commercial implementations, and this article points out several open research topics. As highly available or very large databases continue to become more common and more important in the world economy, the importance of online reorganization is likely to continue growing.

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

design
performance
clustering
indexes
maintenance
online reorganization
redefinition
reorganization
very large databases

algorithms
concurrent reorganization
log-structured file systems
restructuring
schema evolution


A solution for the transition zone isosats in two-phase primary drainage in the presence of gravity Primary drainage in a water-wet saturated medium in the absence of capillarity is typically a combination of shock (discontinuous) and rarefaction (continuous) waves. Using nonlinear relative permeability functions for the host fluid and the invading fluid leads to the existence of a shock wave front, and the degree of nonlinearity of the relative permeability functions has an inverse relationship with the size of the shock wave (i.e., difference of saturation between upstream and downstream of the shock wave), whereas for linear relative permeability functions, the shock wave size approaches 0. Injection of a lower-viscosity immiscible phase such as gas or solvent into a water-wet porous medium in the presence of large capillary pressure leads to development of an extended and growing saturation transition zone that follows the discontinuous shock wave front. In this article, a semianalytical solution for the position of equisaturation contours (isosats) in the transition zone in the presence of gravity is obtained for a set of linearized relative permeability functions. The capillary (diffusive) and buoyancy terms are neglected, and the generalized convective equation for mass conservation is obtained. The set of equations is then reduced to a one-dimensional steady-state differential equation through forcing the isosat formulation to obey mass conservation. This scheme allows the isosat distribution to be solved, and the case of injection into an axisymmetric geometry for a confined planar configuration is solved and presented. A finite element model was developed to demonstrate the reasonable agreement between analytical and numerical solutions.

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

analytical solution
hyperbolic equation
co2 sequestration-capillary fringe


A distributed routing and wavelength assignment algorithm for real-time multicast in WDM networks Routing and wavelength assignment for online real-time multicast connection setup is a difficult task due to the dynamic change of availabilities of wavelengths and the consideration of wavelength conversion delay in wavelength division multiplexing (WDM) networks. This paper presents a distributed routing and wavelength assignment scheme for the setup of real-time multicast connections. It integrates routing and wavelength assignment as a single process, which greatly reduces the connection setup time. The proposed routing method is based on the Prim's minimum spanning tree (MST) algorithm and the K-restricted breadth-first search method, which can produce a subminimal cost tree under a given delay bound. The wavelength assignment uses the least-conversion and load balancing strategies. (C) 2002 Elsevier Science B.V. All rights reserved.

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

wavelength division multiplexing networks


FLASK-SG: A program to compute chemical equilibria in metamorphic petrology Chemical equilibrium calculation program for metamorphic petrology, FLASK-SG, was written for Unix variants (Linux, IRIX, Tru64 UNIX). It is also ported to Windows 95/98. The user specifies a temperature, pressure, and substance amounts (in moles of any chemical formula in C-H-O-Si-Al-Ti-Fe-Mn-Mg-Ca-Na-K system) to this program, then it calculates the stable mineral assemblage, mineral amounts, and gas composition under the given conditions using Gibbs free energy minimization method with the Holland and Powell (1990) data set. Searching algorithm for the stable mineral assemblage is the Metropolis Monte Carlo method. The coding language is C++, and experimental object oriented programming style is adopted to make the train program part as a class library. Model-dependent functions such as fugacity coefficients and activities are implemented as virtual methods of the "systems" class, so they can be easily changed as methods of inherited class from the "system" class. These characteristics are aimed for a future "simulation kit". (C) 2001 Elsevier Science Ltd. All rights reserved.

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

chemical equilibrium
gibbs free energy minimization
metamorphic petrology
monte carlo method


question classification using support vector machines Question classification is very important for question answering. This paper presents our research work on automatic question classification through machine learning approaches. We have experimented with five machine learning algorithms: Nearest Neighbors (NN), Naive Bayes (NB), Decision Tree (DT), Sparse Network of Winnows (SNoW), and Support Vector Machines (SVM) using two kinds of features: bag-of-words and bag-of-ngrams. The experiment results show that with only surface text features the SVM outperforms the other four methods for this task. Further, we propose to use a special kernel function called the tree kernel to enable the SVM to take advantage of the syntactic structures of questions. We describe how the tree kernel can be computed efficiently by dynamic programming. The performance of our approach is promising, when tested on the questions from the TREC QA track.

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

network
decision tree
tree
task
machine learning
research
use
performance
text
dynamic programming
question answering
paper
surface
classification

nearest neighbor
method
support vector machine
functional
kernel method
experience
tracking
algorithm
feature
text classification


linear feature extraction using perceptual grouping and graph-cuts In this paper we present a novel system for the detection and extraction of road map information from high-resolution satellite imagery. Uniquely, the proposed system is an integrated solution that merges the power of perceptual grouping theory (gabor filtering, tensor voting) and segmentation (graph-cuts) into a unified framework to address the problems of road feature detection and classification. Local orientation information is derived using a bank of gabor filters and is refined using tensor voting. A segmentation method based on global optimization by graph-cuts is developed for segmenting foreground(road pixels) and background objects while preserving oriented boundaries. Road centerlines are detected using pairs of gaussian-based filters and road network vector maps are finally extracted using a tracking algorithm. The proposed system works with a single or multiple images, and any available elevation information. User interaction is limited and is performed at the begining of the system execution. User intervention is allowed at any stage of the process to refine or edit the automatically generated results.

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

perceptual grouping
global optimization
feature extraction
road network


Residential area extraction based on saliency analysis for high spatial resolution remote sensing images ? We propose a residential area extraction method based on saliency analysis. The ADP-LWT is utilized for orientation feature extraction. The logarithm co-occurrence histogram is used to compute the intensity features. The color opponency and diagram objection are applied to capture the color features. The saliency map is obtained through a weighted combination of the three features.

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

residential area extraction
saliency analysis
color opponency

remote sensing image processing
lifting wavelet transform
logarithm co-occurrence histogram
feature competition
threshold


Coronary artery disease prediction method using linear and nonlinear feature of heart rate variability in three recumbent postures In present study, we proposed not only a novel methodology useful in developing the various features of heart rate variability (HRV), but also a suitable prediction model to enhance the reliability of medical examinations and treatments for coronary artery disease. In order to develop the various features of HRV, we analyzed HRV for three recumbent postures. The interaction effects between the recumbent postures and groups of normal people and heart patients were observed based on linear and nonlinear features of HRV. Forty-three control subjects and 64 patients with coronary artery disease participated in this study. In order to extract various features, we tested five classification methods and evaluated performance of classifiers. As a result, SVM and CMAR (gave about 7288% goodness of accuracy) outperformed the other classifiers.

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

classification
linear and nonlinear features
heart rate variability


Clustering of domains of functionally related enzymes in the interaction database PRECISE by the generation of primary sequence patterns The PRECISE database was developed by our laboratory to allow for the systematic study of the ligand interactions common to a set of functionally related enzymes, where an interaction site is defined broadly as any residue(s) that interact with a ligand. During the construction of PRECISE, enzyme chains are extracted from the protein data bank (PDB) and clustered according to functional homology as defined by the enzyme commission (EC) nomenclature system. A sequence representative is chosen from each cluster based on the criterion set forth by the non-redundant PDB set, and pair-wise alignments of each cluster member to the representative are performed. Atom-based residueligand interactions are calculated for each cluster member, and the summation of ligand interactions for all cluster members at each aligned position is determined. Although we were able to successfully align most clusters using a simple dynamic programming algorithm, several cluster created exhibited poor pair-wise alignments of each cluster member to its sequence representative. We hypothesized that the observed alignment problems were, in most cases, due to the incorrect separation and alignment of different domains in multi-domain proteins, a mistake that frequently causes error proliferation in functional annotation. Here we present the results of generating primary sequence patterns for each poorly aligned cluster in PRECISE to assess the extent to which multi-domain proteins that are incorrectly aligned contributes to poor pair-wise alignments of each cluster member to its representative. This requires the use of an iterative locally optimal pair-wise alignment algorithm to build a hierarchical similarity-based sequence pattern for a set of functionally related enzymes. Our results show that poor alignments in PRECISE are caused most frequently by the misalignment of multi-domain proteins, and that the generation of primary sequence patterns for the assignment of sequence family membership yields better alignments for the functionally related enzyme clusters in PRECISE than our original alignment algorithm.

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

pattern-induced multiple sequence alignment


NuMDG: A New Tool for Multiway Decision Graphs Construction Multiway Decision Graphs (MDGs) are a canonical representation of a subset of many-sorted first-order logic. This subset generalizes the logic of equality with abstract types and uninterpreted function symbols. The distinction between abstract and concrete sorts mirrors the hardware distinction between data path and control. Here we consider ways to improve MDGs construction. Efficiency is achieved through the use of the Generalized-If-Then-Else (GITE) commonly operator in Binary Decision Diagram packages. Consequently, we review the main algorithms used for MDGs verification techniques. In particular, Relational Product and Pruning by Subsumption are algorithms defined uniformly through this single CITE operator which will lead to a more efficient implementation. Moreover, we provide their correctness proof. This work can be viewed as a way to accommodate the ROBBD algorithms to the realm of abstract sorts and uninterpreted functions. The new tool, called NuMDG, accepts an extended SMV language, supporting abstract data sorts. Finally, we present experimental results demonstrating the efficiency of the NuMDG tool and evaluating its performance using a set of benchmarks from the SMV package.

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

multiway decision graphs
uninterpreted functions


atomic incremental garbage collection and recovery for a large stable heap A stable heap is storage that is managed automatically using garbage collection, manipulated using atomic transactions, and accessed using a uniform storage model. These features enhance reliability and simplify programming by preventing errors due to explicit deallocation, by masking failures and concurrency using transactions, and by eliminating the distinction between accessing temporary storage and permanent storage. Stable heap management is useful for programming languages for reliable distributed computing, programming languages with persistent storage, and object-oriented database systems. Many applications that could benefit from a stable heap (e.g., computer-aided design, computer-aided software engineering, and office information systems) require large amounts of storage, timely responses for transactions, and high availability. We present garbage collection and recovery algorithms for a stable heap implementation that meet these goals and are appropriate for stock hardware. The collector is incremental: it does not attempt to collect the whole heap at once. The collector is also atomic: it is coordinated with the recovery system to prevent problems when it moves and modifies objects. The time for recovery is independent of heap size, even if a failure occurs during garbage collection.

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

applications
recovery
goals
collect
design
model
errors
software engineering
management
failure
incremental
availability
systems
reliability
size
storage
implementation
concurrency
hardware

computation
object
timing
distributed computation
information system
program
persistence
atom
object-oriented database
algorithm
feature
transaction
programming language


stack bounds analysis for microcontroller assembly code An important criterion for correctness of embedded software is stack safety, which requires that the stack must never overflow. This paper presents a static analysis for assembly code that determines upper and lower bounds of the stack. These bounds serve two purposes. First, they can be used to verify stack safety. Second, they can be used to increase the precision of several other static analyses, which are used in the context of model checking. Interrupts play an important role in embedded software, but they are a major challenge for the static analysis of stack bounds. In different micro--controller architectures, the handling of interrupts varies. In some architectures, interrupt handlers are executed atomically, while in others, they are interruptible. Therefore, we applied this analysis to two different microcontrollers, namely the ATMEL ATmega16 and the Intel MCS-51. In a case study, we show the applicability and efficiency of this analysis.

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

embedded software
static analysis
assembly code
model checking