design and implementation of the glue-nail database system We describe the design and implementation of the Glue-Nail database system. The Nail language is a purely declarative query language; Glue is a procedural language used for non-query activities. The two languages combined are sufficient to write a complete application. Nail and Glue code both compile into the target language IGlue. The Nail compiler uses variants of the magic sets algorithm, and supports well-founded models. Static optimization is performed by the Glue compiler using techniques that include peephole methods and data flow analysis. The IGlue code is executed by the IGlue interpreter, which features a run-time adaptive optimizer. The three optimizers each deal with separate optimization domains, and experiments indicate that an effective synergism is achieved. The Glue-Nail system is largely complete and has been tested using a suite of representative applications.

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

applications
design
data flow analysis
code
language
implementation
algorithm
database
query

activation domain experience timing model writing method adapt systems optimality procedure interpretation compilation feature effect completeness


Analog integrated circuit for detection of an approaching object with simple-shape recognition based on lower animal vision A network for the detection of an approaching object with simple-shape recognition is proposed based on lower animal vision. The locust can detect an approaching object through a simple process in the descending contralateral movement detector (DCMD) in the locust brain, by which the approach velocity and direction of the object is determined. The frog can recognize simple shapes through a simple process in the tectum and thalamus in the frog brain. The proposed network is constructed of simple analog complementary metal oxide semiconductor (CMOS) circuits. The integrated circuit of the proposed network is fabricated with the 1.2 mu m CMOS process. Measured results for the proposed circuit indicate that the approach velocity and direction of an object can be detected by the output current of the analog circuit based on the DCMD response. The shape of moving objects having simple shapes, such as circles, squares, triangles and rectangles, was recognized using the proposed frog-visual-system-based circuit.

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

edge detection
motion sensor
shape recognition
vision chip


The safety of electronic prescribing: manifestations, mechanisms, and rates of system-related errors associated with two commercial systems in hospitals Objectives To compare the manifestations, mechanisms, and rates of system-related errors associated with two electronic prescribing systems (e-PS). To determine if the rate of system-related prescribing errors is greater than the rate of errors prevented. Methods Audit of 629 inpatient admissions at two hospitals in Sydney, Australia using the CSC MedChart and Cerner Millennium e-PS. System related errors were classified by manifestation (eg, wrong dose), mechanism, and severity. A mechanism typology comprised errors made: selecting items from drop-down menus; constructing orders; editing orders; or failing to complete new e-PS tasks. Proportions and rates of errors by manifestation, mechanism, and e-PS were calculated. Results 42.4% (n=493) of 1164 prescribing errors were system-related (78/100 admissions). This result did not differ by e-PS (MedChart 42.6% (95% CI 39.1 to 46.1); Cerner 41.9% (37.1 to 46.8)). For 13.4% (n=66) of system-related errors there was evidence that the error was detected prior to study audit. 27.4% (n=135) of system-related errors manifested as timing errors and 22.5% (n=111) wrong drug strength errors. Selection errors accounted for 43.4% (34.2/100 admissions), editing errors 21.1% (16.5/100 admissions), and failure to complete new e-PS tasks 32.0% (32.0/100 admissions). MedChart generated more selection errors (OR=4.17; p=0.00002) but fewer new task failures (OR=0.37; p=0.003) relative to the Cerner e-PS. The two systems prevented significantly more errors than they generated (220/100 admissions (95% CI 180 to 261) vs 78 (95% CI 66 to 91)). Conclusions System-related errors are frequent, yet few are detected. e-PS require new tasks of prescribers, creating additional cognitive load and error opportunities. Dual classification, by manifestation and mechanism, allowed identification of design features which increase risk and potential solutions. e-PS designs with fewer drop-down menu selections may reduce error risk.

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

cpoe
unintended consequences
information technology
clinical information systems


Sliding Windows and Persistence: An Application of Topological Methods to Signal Analysis We develop in this paper a theoretical framework for the topological study of time series data. Broadly speaking, we describe geometrical and topological properties of sliding window embeddings, as seen through the lens of persistent homology. In particular, we show that maximum persistence at the point-cloud level can be used to quantify periodicity at the signal level, prove structural and convergence theorems for the resulting persistence diagrams, and derive estimates for their dependency on window size and embedding dimension. We apply this methodology to quantifying periodicity in synthetic data sets and compare the results with those obtained using state-of-the-art methods in gene expression analysis. We call this new method SW1PerS, which stands for Sliding Windows and 1-Dimensional Persistence Scoring.

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


Stochastic learning solution for distributed discrete power control game in wireless data networks Distributed power control is an important issue in wireless networks. Recently, noncooperative game theory has been applied to investigate interesting solutions to this problem. The majority of these studies assumes that the transmitter power level can take values in a continuous domain. However, recent trends such as the GSM standard and Qualcomm's proposal to the IS-95 standard use a finite number of discretized power levels. This motivates the need to investigate solutions for distributed discrete power control which is the primary objective of this paper. We first note that, by simply discretizing, the previously proposed continuous power adaptation techniques will not suffice. This is because a simple discretization does not guarantee convergence and uniqueness. We propose two probabilistic power adaptation algorithms and analyze their theoretical properties along with the numerical behavior. The distributed discrete power control problem is formulated as an N-person, nonzero sum game. In this game, each user evaluates a power strategy by computing a utility value. This evaluation is performed using a stochastic iterative procedures. We approximate the discrete power control iterations by an equivalent ordinary differential equation to prove that the proposed stochastic learning power control algorithm converges to a stable Nash equilibrium. Conditions when more than one stable Nash equilibrium or even only mixed equilibrium may exist are also studied. Experimental results are presented for several cases and compared with the continuous power level adaptation solutions.

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

game theory
power control
stochastic learning


A Novel Faster-Than-at-Speed Transition-Delay Test Method Considering IR-Drop Effects Interconnect defects such as weak resistive opens, shorts, and bridges increase the path delay affected by a pattern during manufacturing test but are not significant enough to cause a failure at functional frequency. In this paper, a new faster-than-at-speed method is presented for delay test pattern application to screen small delay defects. Given a test pattern set, the technique groups the patterns into multiple subsets with close path delay distribution and determines an optimal test frequency considering both positive slack and performance degradation due to IR-drop effects. Since, the technique does not increase the test frequency to an extent that any paths exercised at the rated functional frequency may fail, it avoids any scan flip-flop masking. As most semiconductor companies currently deploy compression technologies to reduce test costs, scan-cell masking is highly undesirable for pattern modification as it would imply pattern count increase and might result in pattern regeneration. Therefore, our solution is more practical as the test engineer can run the same pattern set without any changes to the test flow other than the at-speed test frequency.

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


A fuzzy MCDM approach for evaluating banking performance based on Balanced Scorecard The paper proposed a Fuzzy Multiple Criteria Decision Making (FMCDM) approach for banking performance evaluation. Drawing on the four perspectives of a Balanced Scorecard (BSC), this research first summarized the evaluation indexes synthesized from the literature relating to banking performance. Then, for screening these indexes, 23 indexes fit for banking performance evaluation were selected through expert questionnaires. Furthermore, the relative weights of the chosen evaluation indexes were calculated by Fuzzy Analytic Hierarchy Process (FAHP). And the three MCDM analytical tools of SAW, TOPSIS, and VIKOR were respectively adopted to rank the banking performance and improve the gaps with three banks as an empirical example. The analysis results highlight the critical aspects of evaluation criteria as well as the gaps to improve banking performance for achieving aspired/desired level. It shows that the proposed FMCDM evaluation model of banking performance using the BSC framework can be a useful and effective assessment tool.

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

balance scorecard (bsc)
fuzzy analytic hierarchy process (fahp)


Geographical information systems and location science Since the 1970s the field of Geographical Information Systems (GIS) has evolved into a mature research and application area involving a number of academic fields including Geography, Civil Engineering, Computer Science, Land Use Planning, and Environmental Science. GIS can support a wide range of spatial queries that can be used to support location studies. GIS will play a significant role in future location model development and application. We review existing work that forms the interface between GIS and Location Science and discuss some of the potential research areas involving both GIS and Location Science. During the past 30 years there have been many developments in spatial data analysis, spatial data storage and retrieval, and mapping. Many of these developments have occurred in the field of Geographical Information Science. Geographical Information Systems software now supports many elementary and advanced spatial analytic approaches including the production of high quality maps. GIS will have a major impact on the field of Location Science in terms of model application and model development. The purpose of this paper is to explore the interface between the field of Location Science and GIS.

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

geographical information systems (gis)
facility location
site selection


Introduction of r(m(rank))(2) metric incorporating rank-order predictions as an additional tool for validation of QSAR/QSPR models In silica techniques involving the development of quantitative regression models have been extensively used for prediction of activity, property and toxicity of new chemicals. The acceptability and subsequent applicability of the models for predictions is determined based on several internal and external validation statistics. Among different validation metrics, Q(2) and R-pred(2) represent the classical metrics for internal validation and external validation respectively. Additionally, the r(m)(2) metrics introduced by Roy and coworkers have been widely used by several groups of authors to ensure the close agreement of the predicted response data with the observed ones. However, none of the currently available and commonly used validation metrics provides any information regarding the rank-order predictions for the test set. Thus, to incorporate the concept of ranking order predictions while calculating the common validation metrics originally using the Pearson's correlation coefficient-based algorithm, the new r(m(rank))(2) metric has been introduced in this work as a new variant of the r(m)(2) series of metrics. The ability of this new metric to perform the rank-order prediction is determined based on its application in judging the quality of predictions of regression - based quantitative structure-activity/property relationship (QSAR/QSPR) models for four different data sets. The different validation metrics calculated in each case were compared for their ability to reflect the rank-order predictions based on their correlation with the conventional Spearman's rank correlation coefficient. Based on the results of the sum of ranking differences analysis performed using the Spearman's rank correlation coefficient as the reference, it was observed that the (2)(m(rank)) metric exhibited the least difference in ranking from that of the reference metric. Thus, the close correlation of the (2)(m(rank)) metric with the Spearman's rank correlation coefficient inferred that the new metric could aptly perform the rank-order prediction for the test data set and can be utilized as an additional validation tool, besides the conventional metrics, for assessing the acceptability and predictive ability of a QSAR/QSPR model. (C) 2012 Elsevier B.V. All rights reserved.

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

qsar
qspr
qstr
pearson's correlation coefficient
spearman's rank correlation coefficient


Designing ubiquitous information systems for a community of homeless young people: precaution and a way forward Drawing upon and distinguishing themselves from domestic, public, work, and natural settings, homeless communities offer new cultural frontiers into which ubiquitous computing could diffuse. We report on one such frontier, a community of homeless young people, located in Seattle, WA, seeking both to foresee the consequences of pervasive access to digital media and communications and to prepare for its seemingly inevitable uptake. The community consists of hundreds of young people living without stable housing, often in the public, and an alliance of nine service agencies that seek to stabilize youth and equip them to escape homelessness. We examine the opportunities for ubiquitous computing in this community by, in part, developing a precautionary stance on intervention. This stance is then used to critically examine a scenario in which information about the service agencies is made public. From this scenario, and a description of the social and material constraints of this community, we argue that precaution offers productive counsel on decisions on whether and how to intervene with ubiquitous computing. A precautionary point of view is especially important as ubiquitous computing diffuses into communities that, by their social and material conditions, are vulnerable. In such communities, the active avoidance of harms and plans for their mitigation is particularly important.

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

poverty
community informatics
non-profit service agencies
precautionary principle
designer value
value sensitive design
value scenario
envisioning


On the equivalence of two optimization methods for fuzzy linear programming problems The paper analyses the linear programming problem with fuzzy coefficients in the objective function. The set of nondominated (ND) solutions with respect to an assumed fuzzy preference relation, according to Orlovsky's concept, is supposed to be the solution of the problem. Special attention is paid to unfuzzy nondominated (UND) solutions (the solutions which are nondominated to the degree one). The main results of the paper are sufficient conditions on a fuzzy preference relation allowing to reduce the problem of determining UND solutions to that of determining the optimal solutions of a classical linear programming problem. These solutions can thus be determined by means of classical linear programming methods.

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

fuzzy programming
fuzzy relation
nondominated solution


Identifying failure causes in Java programs: An application of change impact analysis During program maintenance, a programmer may make changes that enhance program functionality or fix bugs in code. Then, the programmer usually will run unit/regression tests to prevent invalidation of previously tested functionality. If a test fails unexpectedly, the programmer needs to explore the edit to find the failure-inducing changes for that test. Crisp uses results from Chianti, a tool that performs semantic change impact analysis [ 1], to allow the programmer to examine those parts of the edit that affect the failing test. Crisp then builds a compilable intermediate version of the program by adding a programmer-selected partial edit to the original code, augmenting the selection as necessary to ensure compilation. The programmer can reexecute the test on the intermediate version in order to locate the exact reasons for the failure by concentrating on the specific changes that were applied. In nine initial case studies on pairs of versions from two real Java programs, Daikon [ 2] and Eclipse jdt compiler [ 3], we were able to use Crisp to identify the failure-inducing changes for all but 1 of 68 failing tests. On average, 33 changes were found to affect each failing test ( of the 67), but only 1-4 of these changes were found to be actually failure-inducing.

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

fault localization
edit change dependence
regression testing
intermediate versions of programs


Dexterous workspace optimization of an asymmetric six-degree of freedom Stewart-Gough platform type manipulator In this paper, an asymmetric Generalized Stewart-Gough Platform (GSP) type parallel manipulator is designed by considering the type synthesis approach. The asymmetric six-Degree Of Freedom (DOE) manipulator optimized in this paper is selected among the GSPs classified under the name of 6D. The dexterous workspace optimization of Asymmetric parallel Manipulator with tEn Different Linear Actuator Lengths (AMEDIAL) subject to kinematics and geometric constraints is performed by using the Particle Swarm Optimization (PSO). The condition number and Minimum Singular Value (MSV) of homogenized Jacobian matrix are employed to obtain the dexterous workspace of AMEDLAL. Finally, the six-DOF AMEDLAL is also compared with the optimized Traditional Stewart-Gough Platform Manipulator (TSPM) considering the volume of the dexterous workspace in order to demonstrate its kinematic performance. Comparisons show that the manipulator proposed in this study illustrates better kinematic performance than TSPM. (C) 2013 Elsevier B.V. All rights reserved.

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


SOLVING SYSTEMS OF TWO-SIDED (MAX, MIN)-LINEAR EQUATIONS A finite iteration method for solving systems of (max, min)-linear equations is presented. The systems have variables on both sides of the equations. The algorithm has polynomial complexity and may be extended to wider classes of equations with a similar structure.

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

(max, min)-linear equations
two-sided system


Fuzzy association degree with delayed time in temporal data model This paper presents an expression of the semantic proximity. Based on the temporal data model, a method of the temporal approximation is given. Using these concepts, this paper provides an evaluated method of fuzzy and dynamic association degree with delayed time and a superposition method of association degrees. Particularly, by means of the fuzzy and dynamic association degree, the connection between the weather data of two regions can be discovered.

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

temporal data model
fuzzy association degree
delayed time


On-line prediction of micro-turning multi-response variables by machine vision system using adaptive neuro-fuzzy inference system (ANFIS) In this paper, a new attempt has been made in the area of tool-based micromachining for automated, non-contact, and flexible prediction of quality responses such as average surface roughness (R (a)), tool wear ratio (TWR) and metal removal rate (MRR) of micro-turned miniaturized parts through a machine vision system (MVS) which is integrated with an adaptive neuro-fuzzy inference system (ANFIS). The images of machined surface grabbed by the MVS could be extracted using the algorithm developed in this work, to get the features of image texture [average gray level (G (a))]. This work presents an area-based surface characterization technique which applies the basic light scattering principles used in other optimal optical measurement systems. These principles are applied in a novel fashion which is especially suitable for in-process prediction and control. The main objective of this study is to design an ANFIS for estimation of R (a), TWR, and MRR in micro-turning process. Cutting speed (S), feed rate (F), depth of cut (D), G (a) were taken as input parameters and R (a), TWR, MRR as the output parameters. The results obtained from the ANFIS model were compared with experimental values. It is found that the predicted values of the responses are in good agreement with the experimental values.

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

machine vision
anfis
surface roughness
twr
mrr


Gallium arsenide passivation method for the employment of High Electron Mobility Transistors in liquid environment We report on effective prevention of GaAs corrosion in a cell culture liquid environment by means of polymerized (3-mercaptopropyl)-trimethoxysilane thin film coatings. Aging in physiological solution kept at 37C revealed no significant oxidation after 2weeks, which is the typical period of incubation of a neuron cells culture. The method was also applied to High Electron Mobility Transistors (HEMT) arrays with unmetallized gate regions, in view of their application as neural signal transducers. Significant reduction of the degradation of the HEMT behavior was obtained, as compared to uncoated HEMTs, with good channel modulation efficiency still after 30days aging.

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


using shape distributions to compare solid models Our recent work has described how to use feature and topology in-formation to compare 3-D solid models. In this work we describe a new method to compare solid models based on shape distributions. Shape distribution functions are common in the computer graphics and computer vision communities. The typical use of shape dis-tributions is to compare 2-D objects, such as those obtained from imaging devices (cameras and other computer vision equipment). Recent work has applied shape distribution metrics for compari-son of approximate models found in the graphics community, such as polygonal meshes, faceted representation, and Virtual Reality Modeling Language (VRML) models. This paper examines how to adapt these techniques to comparison of 3-D solid models, such as those produced by commercial CAD systems. We provide a brief review of shape matching with distribution functions and present an approach to matching solid models. First, we show how to ex-tend basic distribution-based techniques to handle CAD data that has been exported to VRML format. These extensions address specific geometries that occur in mechanical CAD data. Second, we describe how to use shape distributions to directly interrogate solid models. Lastly, we show how these techniques can be put together to provide a "query by example" interface to a large, het-erogeneous, CAD database: The National Design Repository. One significant contribution of our work is the systematic technique for performing consistent, engineering content-based comparisons of CAD models produced by different CAD systems.

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

use
communities
design
imaging
graphics
virtual reality
paper
shape
representation
computer vision
comparisons
review
method
systems
matching
data
feature
database

mesh
solid model databases
3d search
engine
modelling language
approximation
metrication
addressing
object
topologies
camera
interfaces
extensibility
model
shape matching
computer graphics
shape recognition
contention
query-by-example
solid modeling
device
consistency
distributed
repositories


Navigation-based self-optimization handover mechanism for mobile relay stations in WiMAX networks Organic Computing has similar characteristics of organism which can be self-adjustment for a variety of conditions. Moreover, during the wireless communication technological evolution progress, WiMAX (Worldwide Interoperability for Microwave Access) offers ability of high capacity and far distance transmission. WiMAX provides high-speed access and a coverage range across several kilometers, but the actual coverage range was merely a few kilometers due to the shelter of buildings or terrain. IEEE 802.16 working group designed 802.16j-based RS (Relay Station) to overcome above problem. In this paper, we present a mechanism called Self-Optimization Handover Mechanism. This mechanism is using GPS (Global Positioning System) navigation system to gather the related information for the position and combine the mobility characteristics of Mobile Relay Station. Especially, the concept of Self-Optimization of Organic Computing has been integrated into this mechanism. There are some advantages for this new mechanism, including: (1)The base station can provide advance plan and select the path. (2)The mechanism can reduce the number of possible handover and hop. (3)The mechanism can reduce the time of channel scan.

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

handover
mobile relay station
organic computing


Evolutionary computation approaches for real offshore wind farm layout: A case study in northern Europe This paper presents new evolutionary computation algorithms for a problem of wind farm design. The algorithms tackle two different problems of offshore wind farm layout. Experiments in a real offshore wind farm layout case are shown and discussed.

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

offshore wind farm design
optimal layouts
real case study


Scalability comparison of Peer-to-Peer similarity search structures Due to the increasing complexity of current digital data, similarity search has become a fundamental computational task in many applications. Unfortunately, its costs are still high and grow linearly on single server structures, which prevents them from efficient application on large data volumes. In this paper, we shortly describe four recent scalable distributed techniques for similarity search and study their performance in executing queries on three different datasets. Though all the methods employ parallelism to speed up query execution, different advantages for different objectives have been identified by experiments. The reported results would be helpful for choosing the best implementations for specific applications. They can also be used for designing new and better indexing structures in the future.

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

metric space
distributed index structures
peer-to-peer networks


Estimation of power quality indices in distributed generation systems during power islanding conditions This paper presents a new, fast Modified Recursive GaussNewton (MRGN) method for the estimation of power quality indices in distributed generating systems during both islanding and non-islanding conditions. A forgetting factor weighted error cost function is minimized by the well known GaussNewton algorithm and the resulting Hessian matrix is approximated by ignoring the off-diagonal terms. This simplification produces a decoupled algorithm, for the fundamental and harmonic components and results in a large reduction of computational effort, when the power signal contains a large number of harmonics. Numerical experiments have shown that the proposed approach results in higher speed of convergence, accurate tracking of power signal parameters in the presence noise, waveform distortion, etc., which are suitable for the estimation of power quality indices. In the case of a distribution network, power islands occur when power supply from the main utility is interrupted due to faults or otherwise and the distributed generation system (DG) keeps supplying power into the network. Further, due to unbalanced load conditions the DG is subject to unbalanced voltages at its terminals and suffers from increased total harmonic distortion (THD). Thus, the power quality indices estimation, along with the power system frequency estimation will play a vital role in detecting power islands in distributed generating systems. Extensive studies, both on simulated and real, benchmark hybrid distribution networks, involving distributed generation systems reveal the effectiveness of the proposed approach to calculate the power quality indices accurately.

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

power quality indices
total harmonic distortion
distributed generation

sequence voltages and currents
power measurements
islanding condition


The Bud Scar-Based Screening System for Hunting Human Genes Extending Life Span We developed a high-throughput screening system that allows identification of genes prolonging life span in the budding yeast Saccharomyces cerevisiae. The method is based on isolating yeast mother cells with an extended number of cell divisions as indicated by the increased number of bud scars on their surface. Fluorescently labeled wheat germ agglutinin (WGA) was used for specific staining of bud scars. Screening of a human HepG2 cDNA expression library in yeast resulted in the isolation of several yeast transformants with a potentially prolonged life span. The budding yeast S. cerevisiae, one of the favorite models used to study aging, has been studied extensively for the better understanding of the mechanisms of human aging. Because human disease genes often have yeast counterparts, they can be studied efficiently in this organism. One interesting example is the WRN gene, the human DNA helicase, which participates in the DNA repair pathway. The mutation of the WRN gene causes Werner syndrome showing premature-aging phenotype. Budding yeast contains WRN homologue, SGS1, and its mutation results in shortening yeast life span. The knowledge gained from the studies of budding yeast will benefit studies in humans for better understanding of aging and aging-related disease.

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


Matching office firms types and location characteristics: An exploratory analysis using Bayesian classifier networks While most models of location decisions of firms are based on the principle of utility maximizing behavior, the present study assumes that location decisions are just part of business cycle models, in which location is considered along other business decisions. The business model results in a series of location requirements and these are matched against location characteristics. Given this theoretical perspective, the modeling challenge then becomes how to find the match between firm types and the set of location characteristics using observations of the spatial distribution of firms. In this paper, several Bayesian classifier networks are compared in terms of their performance, using a large data set collected for the Netherlands. Results demonstrate that by taking relationships between predictor variables into account the Bayesian classifiers can improve prediction accuracy compared to commonly used decision tree. From a substantive point of view, our results indicate that different sets of urban characteristics and accessibility requirements are relevant to different office types as reflected in the spatial distribution of these office firms.

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

luti (land use-transport interaction) models


mental models of recursive computations vs. recursive analysis in the problem domain The work outlined here was inspired by [1, 3], where the authors analyze the mental models of recursion by looking at how students trace simple recursive computations. Besides trying to understand if their results generalize to a different context, I was interested to see the correlations between the mental models of the computation process and the ability to establish recursive relationships in the problem domain. My investigation essentially lends further support to the findings of [3]. However, a consistent mental model of recursive computations, although implied by the ability to use recursion in problem-solving, does not seem to be sufficient for the achievement of this higher-level skill.

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


Scaling up multi-touch selection and querying: Interfaces and applications for combining mobile multi-touch input with large-scale visualization displays We present a mobile multi-touch interface for selecting, querying, and visually exploring data visualized on large, high-resolution displays. Although emerging large (e.g., ?10m wide), high-resolution displays provide great potential for visualizing dense, complex datasets, their utility is often limited by a fundamental interaction problem the need to interact with data from multiple positions around a large room. Our solution is a selection and querying interface that combines a hand-held multi-touch device with 6 degree-of-freedom tracking in the physical space that surrounds the large display. The interface leverages context from both the user's physical position in the room and the current data being visualized in order to interpret multi-touch gestures. It also utilizes progressive refinement, favoring several quick approximate gestures as opposed to a single complex input in order to most effectively map the small mobile multi-touch input space to the large display wall. The approach is evaluated through two interdisciplinary visualization applications: a multi-variate data visualization for social scientists, and a visual database querying tool for biochemistry. The interface was effective in both scenarios, leading to new domain-specific insights and suggesting valuable guidance for future developers.

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 B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-touch
3d user interface
mobile device
3d tracking
ray casting


Knowledge-based linguistic equations for defect detection through functional testing of printed circuit boards Increasing globalization of the economy is imposing tough challenges to manufacturing companies. The ability to produce highly customized products, in order to satisfy market niches, requires the introduction of new features in automation systems. Flexible manufacturing processes must be able to handle unforeseen events, but their complexity makes the supervision and maintenance task difficult to perform by human operators. This paper describes how linguistic equations (LE), an intelligent method derived from Fuzzy Algorithms, has been used in a decision-helping tool for electronic manufacturing. In our case the company involved in the project is mainly producing control cards for the automotive industry. In their business, nearly 70% of the cost of a product is material cost. Detecting defects and repairing the printed circuit boards is therefore a necessity. With an ever increasing complexity of the products, defects are very likely to occur, no matter how much attention is put into their prevention. Therefore, the system described in this paper comes into use only during the final testing of the product and is purely oriented towards the detection and localization of defects. Final control is based on functional testing. Using linguistic equations and expert knowledge, the system is able to analyze that data and successfully detect and trace a defect in a small area of the printed circuit board. If sufficient amount of data is provided, self-tuning and self-learning methods can be used. Diagnosis effectiveness can therefore be improved from detection of a functional area towards component level analysis.

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

linguistic equations
defect detection
diagnosis
knowledge


Dynamic neural network approach for tool cutting force modelling of end milling operations This paper uses the artificial neural networks (ANNs) approach to evolve an efficient model for estimation of cutting forces, based on a set of input cutting conditions. Neural network (NN) algorithms are developed for use as a direct modelling method, to predict forces for ball-end milling operations. Prediction of cutting forces in ball-end milling is often needed in order to establish automation or optimization of the machining processes. Supervised NNs are used to successfully estimate the cutting forces developed during end milling processes. The training of the networks is preformed with experimental machining data. The predictive capability of using analytical and NN approaches is compared. NN predictions for three cutting force components were predicted with 4% error by comparing with the experimental measurements. Exhaustive experimentation is conduced to develop the model and to validate it. By means of the developed method, it is possible to forecast the development of events that will take place during the milling process without executing the tests. The force model can be used for simulation purposes and for defining threshold values in cutting tool condition monitoring system. It can be used also in the combination for monitoring and optimizing of the machining process-cutting parameters.

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

machining
cutting forces
neural network
experimental measurements
milling


Contexts built and found: a pilot study on the process of archival meaning-making Over the last 20years, humanities and archival scholars have theorized the ways in which archives imbue records with meaning. However, archival scholars have not sufficiently examined how users understand the meaning of the records they find. Building on the premise that how users come to make meaning from records is greatly in need of examination, this paper reports on a pilot study of four book history students and their processes of archival meaning-making. We focus in particular on behaviors of an interpretive rather than forensic nature. This article includes a discussion of the theoretical concepts and scholarly literature that shaped our goals for this paper. It then discusses the methodology and our interpretations of the research findings, before turning to a discussion of the findings implications and directions for future work.

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


Localizing web videos using social images While inferring the geo-locations of web images has been widely studied, there is limited work engaging in geo-location inference of web videos due to inadequate labeled samples available for training. However, such a geographical localization functionality is of great importance to help existing video sharing websites provide location-aware services, such as location-based video browsing, video geo-tag recommendation, and location sensitive video search on mobile devices. In this paper, we address the problem of localizing web videos through transferring large-scale web images with geographic tags to web videos, where near-duplicate detection between images and video frames is conducted to link the visually relevant web images and videos. To perform our approach, we choose the trustworthy web images by evaluating the consistency between the visual features and associated metadata of the collected images, therefore eliminating the noisy images. In doing so, a novel transfer learning algorithm is proposed to align the landmark prototypes across both domains of images and video frames, leading to a reliable prediction of the geo-locations of web videos. A group of experiments are carried out on two datasets which collect Flickr images and YouTube videos crawled from the Web. The experimental results demonstrate the effectiveness of our video geo-location inference approach which outperforms several competing approaches using the traditional frame-level video geo-location inference.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 video analysis
cross-domain
social media
landmark recognition
classification


biXid: A bidirectional transformation language for XML Often, independent organizations de. ne and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such formats. Existing XML transformation languages, such as XSLT and XDuce, are unsatisfactory for this purpose since we would have to write, e. g., two programs for the forward and the backward transformations in case of two formats, incur high developing and maintenance costs. This paper proposes the bidirectional XML transformation language biXid, allowing us to write only one program for both directions of conversion. Our language adopts a common paradigm programming-by-relation, where a program defines a relation over documents and transforms a document to another in a way satisfying this relation. Our contributions here are specific language features for facilitating realistic conversions whose target formats are loosely in parallel but have many discrepancies in details. Concretely, we ( 1) adopt XDuce-style regular expression patterns for describing and analyzing XML structures, ( 2) fully permit ambiguity for treating formats that do not have equivalent expressivenesses, and ( 3) allow non-linear pattern variables for expressing non-trivial transformations that cannot be written only with linear patterns, such as conversion between unordered and ordered data. We further develop an efficient evaluation algorithm for biXid, consisting of the "parsing" phase that transforms the input document to an intermediate "parse tree" structure and the "unparsing" phase that transforms it to an output document. Both phases use a variant of finite tree automata for performing a one-pass scan on the input or the parse tree by using a standard technique that "maintains the set of all transitable states." However, the construction of the "unparsing" phase is challenging since ambiguity causes different ways of consuming the parse tree and thus results in multiple possible outputs that may have different structures. We have implemented a prototype system of biXid and confirmed that it has enough expressiveness and a linear-time performance from experiments with several realistic bidirectional transformations including one between vCard-XML and ContactXML.

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


real time self-maintenable data warehouse Data warehousing is an approach to data integration wherein integrated information is stored in a data warehouse for direct querying and analysis. To provide fast access, a data warehouse stores materialized views of the sources of its data. As a result, a data warehouse needs to be maintained to keep its contents consistent with the contents of its data sources. Incremental maintenance is generally regarded as a more efficient way to maintain materialized views in a data warehouse. In this paper a strategy for the maintenance of data warehouse is presented. It has the following characteristics: it is self-maintainable (weak), incremental, non-blocking (the analysts transactions and the maintenance transaction are executed concurrently) and is performed in real time. The proposed algorithm is implemented for view definition SPJ (Select Project Join) queries and it calculates the aggregate functions: sum, avg, count, min and max. Aggregate functions are calculated like algebraic functions (the new result of the function can be computed using some small, constant size storage that accompanies the existing value of the aggregate). We have named this improved algorithm ?VNLTR (unlimited ?V (versions), NL (non-blocking), TR (in real time)).

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


content-based tag generation to enable a tag-based collaborative tv-recommendation system. With the application of the Web 2.0 philosophy to more and more online services and platforms, tagging has become a well established collaboration method. It is often used to simplify organization, navigation and discovery of information and resources in huge archives. In parallel, due to recent developments in digital television, audiences are confronted with a rising amount of available content and demand for better ways to discover programs of interest. In this paper, we propose a tagging-based solution to this problem. Using a content-based filtering approach, we present an individualized and flexible tag generation process. User specific as well as collaborative tag generation is enabled. Based on generated and user added tags, program recommendations are derived in a collaborative filtering step.

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

tag generation
collaborative filtering
tags

metadata-based filtering
folksonomy
bayesian classifier
tv recommender
recommendation system
epg


The M/M/1 queue with inventory, lost sale, and general lead times We consider an M/M/1 queueing system with inventory under the \((r,Q)\) policy and with lost sales, in which demands occur according to a Poisson process and service times are exponentially distributed. All arriving customers during stockout are lost. We derive the stationary distributions of the joint queue length (number of customers in the system) and on-hand inventory when lead times are random variables and can take various distributions. The derived stationary distributions are used to formulate long-run average performance measures and cost functions in some numerical examples.

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


Dynamic data rectification using particle filters The basis of dynamic data rectification is a dynamic process model. The successful application of the model requires the fulfilling of a number of objectives that are as wide-ranging as the estimation of the process states, process signal denoising and outlier detection and removal. Current approaches to dynamic data rectification include the conjunction of the Extended Kalman Filter (EKF) and the expectation-maximization algorithm. However, this approach is limited due to the EKF being less applicable where the state and measurement functions are highly non-linear or where the posterior distribution of the states is non-Gaussian. This paper proposes an alternative approach whereby particle filters, based on the sequential Monte Carlo method, are utilized for dynamic data rectification. By formulating the rectification problem within a probabilistic framework, the particle filters generate Monte Carlo samples from the posterior distribution of the system states, and thus provide the basis for rectifying the process measurements. Furthermore, the proposed technique is capable of detecting changes in process operation and thus complements the task of process fault diagnosis. The appropriateness of particle filters for dynamic data rectification is demonstrated through their application to an illustrative non-linear dynamic system, and a benchmark pH neutralization process. (C) 2007 Elsevier Ltd. All rights reserved.

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

dynamic data rectification
particle filters
sequential monte carlo


Neighbor sensor networks: Increasing lifetime and eliminating partitioning through cooperation In this paper we consider neighbor sensor networks which are defined as multiple wireless sensor networks under the administration of different authorities but located physically on the same area or close to each other. We construct a Linear Programming framework to characterize the cooperation of neighbor sensor networks in comparison to non-cooperating networks. We show that if neighbor sensor networks cooperate with each other for relaying data packets then this cooperation brings two advantages as compared to no cooperation case. First, lifetime of both networks is prolonged the results of our analysis show that cooperation between neighbor sensor networks can significantly extend the overall network lifetime. Second, cooperation reduces the probability of disjoint partitions arising due to the limited transmission ranges of sensor nodes. When neighbor sensor networks cooperate, eliminating disjoint partitions is possible with sensors having shorter transmission ranges as demonstrated and quantified by our analysis.

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

wireless sensor networks
linear programming
network lifetime
cooperation


IMAGE ERROR CONCEALMENT BASED ON QIM DATA HIDING IN DUAL-TREE COMPLEX WAVELETS Transmission of block-coded images through error-prone radio mobile channel often results in lost blocks. Error concealment (EC) techniques exploit inherent redundancy and reduce visual artifacts through post-processing at the decoder side. In this paper, we propose an efficient quantization index modulation (QIM)-based data hiding scheme using dual-tree complex wavelet transform (DTCWT) for the application of image error concealment. The goal is achieved by embedding important information (image digest) as watermark signal that is extracted from the original image itself and is used to introduce sufficient redundancy in the transmitted image. At the decoder side, the extracted image digest is used to correct the damaged regions. DTCWT offers three-fold advantages viz. (1) high embedding capacity due to inherent redundancy that leads to the better reconstruction of high volume missing data, (2) better imperceptibly after data embedding since it most closely captures human visual system (HVS) characteristics than conventional DWT and (3) better watermark decoding reliability. Simulation results duly support the claims and relative performance improvement with respect to the existing results.

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

error concealment
data hiding
dtcwt
qim
image digest


Visualizing "typical" and "exotic" Internet traffic data The threat of cyber attacks motivates the need to monitor Internet traffic data for potentially abnormal behavior. Due to the enormous volumes of such data, statistical process monitoring tools, such as those traditionally used on data in the product manufacturing arena, are inadequate. "Exotic" data may indicate a potential attack; detecting such data requires a characterization of "typical" data. We devise some new graphical displays, including a "skyline plot," that permit ready visual identification of unusual Internet traffic patterns in "streaming" data, and use appropriate statistical measures to help identify potential cyberattacks. These methods are illustrated on a moderate-sized data set (135,605 records) collected at George Mason University. (C) 2005 Elsevier B.V. All rights reserved.

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

logarithmic transformation
computational methods
recursive computation
exploratory data analysis


scheduling and student performance We present data showing strong correlation between students' time management and a successful outcome on programming assignments. Students who spread their work over more time will produce a better result without additional expenditure of total effort. We examined performance of students who sometimes did well and sometimes did poorly, and found that their good performance occurred on the projects where they displayed better time management. While these results will not surprise most instructors, hard data is more compelling than intuition when trying to train students to use good time management.

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

time management
student performance
scheduling


Access control and key management for mobile agents Security is a fundamental precondition for the acceptance of mobile agent systems. In this paper we present a mobile agent structure which supports authentication, security management and access control for mobile agents.

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

mobile agent security
agent authentication
access groups agent confidentiality


Empirical distribution of k-word matches in biological sequences This study focuses on an alignment-free sequence comparison method: the number of words of length k shared between two sequences, also known as the D2 D 2 statistic. The advantages of the use of this statistic over alignment-based methods are firstly that it does not assume that homologous segments are contiguous, and secondly that the algorithm is computationally extremely fast, the runtime being proportional to the size of the sequence under scrutiny. Existing applications of the D2 D 2 statistic include the clustering of related sequences in large EST databases such as the STACK database. Such applications have typically relied on heuristics without any statistical basis. Rigorous statistical characterisations of the distribution of D2 D 2 have subsequently been undertaken, but have focussed on the distribution's asymptotic behaviour, leaving the distribution of D2 D 2 uncharacterised for most practical cases. The work presented here bridges these two worlds to give usable approximations of the distribution of D2 D 2 for ranges of parameters most frequently encountered in the study of biological sequences.

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

alignment-free sequence comparison
genomic data


replications types in experimental disciplines Experiment replication is a key component of the scientific paradigm. The purpose of replication is to verify previously observed findings. Although some Software Engineering (SE) experiments have been replicated, yet, there is still disagreement about how replications should be run in our field. With the aim of gaining a better understanding of how replications are carried out, this paper examines different replication types in other scientific disciplines. We believe that by analysing the replication types proposed in other disciplines it is possible to clarify some of the question marks still hanging over experimental SE replication.

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

experimental paradigm
classifications of replications
types of replications
experimental replication


Optimization models to characterize the broadcast capacity of vehicular ad hoc networks Broadcast capacity of the entire network is one of the fundamental properties of vehicular ad hoc networks (VANETs). It measures how efficiently the information can be transmitted in the network and usually it is limited by the interference between the concurrent transmissions in the physical layer of the network. This study defines the broadcast capacity of vehicular ad hoc network as the maximum successful concurrent transmissions. In other words, we measure the maximum number of packets which can be transmitted in a VANET simultaneously, which characterizes how fast a new message such as a traffic incident can be transmitted in a VANET. Integer programming (IP) models are first developed to explore the maximum number of successful receiving nodes as well as the maximum number of transmitting nodes in a VANET. The models embed an traffic flow model in the optimization problem. Since IP model cannot be efficiently solved as the network size increases, this study develops a statistical model to predict the network capacity based on the significant parameters in the transportation and communication networks. MITSIMLab is used to generate the necessary traffic flow data. Response surface method and linear regression technologies are applied to build the statistical models. Thus, this paper brings together an array of tools to solve the broadcast capacity problem in VANETs. The proposed methodology provides an efficient approach to estimate the performance of a VANET in real-time, which will impact the efficacy of travel decision making.

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

vehicular ad hoc networks
broadcast capacity
optimization


Improving hierarchical cluster analysis: A new method with outlier detection and automatic clustering Techniques based on agglomerative hierarchical clustering constitute one of the most frequent approaches in unsupervised clustering. Some are based on the single linkage methodology, which has been shown to produce good results with sets of clusters of various sizes and shapes. However, the application of this type of algorithms in a wide variety of fields has posed a number of problems, such as the sensitivity to outliers and fluctuations in the density of data points. Additionally, these algorithms do not usually allow for automatic clustering. In this work we propose a method to improve single linkage hierarchical cluster analysis (HCA), so as to circumvent most of these problems and attain the performance of most sophisticated new approaches. This completely automated method is based on a self-consistent outlier reduction approach, followed by the building-up of a descriptive function. This, in turn, allows to define natural clusters. Finally, the discarded objects may be optionally assigned to these clusters. The validation of the method is carried out by employing widely used data sets available from literature and others for specific purposes created by the authors. Our method is shown to be very efficient in a large variety of situations. (c) 2007 Elsevier B.V. All rights reserved.

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

clustering
hierarchical cluster analysis
single linkage

unsupervised pattern recognition
outlier removal


The sensitivity of the inventory model with partial backorders This paper uses the rigorous methods of mathematics to explore the analysis of the sensitivity of Park [Int. J. Syst. Sci. 13 (1982) 1313]. However, Park discusses the analysis of the sensitivity by numerical examples. The results obtained by this paper show that the sensitivity of Park is not always true sometimes. Therefore, the researchers may be very careful to use the conclusions of the analysis of the sensitivity made by numerical examples in general.

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

inventory model
partial backorders
sensitivity


Performance Evaluation of an Advanced DWDM RoFSO System for Transmitting Multiple RF Signals With the increase of communication demand and the emergence of new services. various innovative wireless technologies have been deployed recently. Free Space Optics (FSO) links combined with Radio over Fiber (RoF) technology can realize a cost-effective heterogeneous wireless access system for both urban and rural areas. In this paper, we introduce a newly developed advanced DWDM Radio-on-FSO (RoFSO) system capable of simultaneously transmitting multiple Radio Frequency (RF) signals carrying various wireless services including W-CDMA, WLAN IEEE802.1 lg and ISDB-T signals over FSO link. We present an experimental performance evaluation of transmitting RF signals using the RoFSO system over a I kin link under different deployment environment conditions, This, work represents a pioneering attempt, based on a realistic operational scenario, aiming at demonstrating the RoFSO system can be conveniently used as a reliable alternative broadband wireless technology for complementing optical fiber networks in areas where the deployment of optical fiber is not feasible.

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

radio on free space optics (rofso)
radio over fiber (rof)
w-cdma
isdb-t


Sonar based mobile robot localization by using fuzzy triangulation The objective of this paper is to identify the robot's location in a global map from solely sonar based information. This is achieved by using fuzzy sets to model sonar data and by using fuzzy triangulation to identify robot's position and orientation. As a result we obtain a fuzzy position region where each point in the region has a degree of certainty of being the actual position of the robot. (C) 2000 Elsevier Science B.V. All rights reserved.

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


fuzzy representation for classification of basic bruise colours An application of the Fuzzy Inference System (FIS) for bruise colour recognition is suggested in the paper. Input information to the system will be taken from the images, which includes a bruise and surrounding healthy skin. There are formulated six basic colour groups for the bruise images - red, blue, yellow, brown, green and purple. The input variables of the FIS are connected with the information from the pixels of the images in some colour models (RGB, HSV or Lab). The output variables are the classes - the basic colour groups. Matlab environment was used for representation of the membership 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

bruise age determination
bruise age
colours and image analysis
bruises


Silicon template fabrication for imprint process with good demolding characteristics Demolding force for thermal imprint process to polymethylmethacrylate (PMMA) film is examined by use of Si templates with various side wall profiles. Patterns with tapered side wall profile can be fabricated by control of etching conditions. Side wall profile can be smoothened by anisotropic etching by use of mixed solution of potassium hydroxide (KOH) solution and isopropyl-alcohol. It is confirmed that demolding force can be reduced when mold with tapered side wall pattern is used. Demolding force can be greatly reduced by KOH treatment. Especially, when the template with taper and smooth side wall patterns is used, demolding force is below our measurement system limit of 0.1kgf. It is confirmed that the KOH treatment is very effective in order to reduce demolding force.

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

imprint template
silicon deep etching
bosch process
scalloping


By all these lovely tokens... Merging conflicting tokenizations Given the contemporary trend to modular NLP architectures and multiple annotation frameworks, the existence of concurrent tokenizations of the same text represents a pervasive problem in everydays NLP practice and poses a non-trivial theoretical problem to the integration of linguistic annotations and their interpretability in general. This paper describes a solution for integrating different tokenizations using a standoff XML format, and discusses the consequences from a corpus-linguistic perspective.

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

linguistic annotation
multi-layer annotation
tokenization alignment
corpus linguistics


An application of quantum finite automata to interactive proof systems Quantum finite automata have been studied intensively since their introduction in late 1990s as a natural model of a quantum computer working with finite-dimensional quantum memory space. This paper seeks their direct application to interactive proof systems in which a mighty quantum prover communicates with a quantum-automaton verifier through a common communication cell. Our quantum interactive proof systems are juxtaposed to Dwork-Stockmeyer's classical interactive proof systems whose verifiers are two-way probabilistic finite automata. We demonstrate strengths and weaknesses of our systems by studying how various restrictions on the behaviors of quantum-automaton verifiers affect the power of quantum interactive proof systems. (C) 2008 Published by Elsevier Inc.

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

quantum finite automaton
quantum interactive proof system
quantum measurement
quantum circuit


An accurate radio channel model for wireless sensor networks simulation Simulations are currently an essential tool to develop and test wireless sensor networks (WSNs) protocols and to analyze future WSNs applications performance. Researchers often simulate their proposals rather than deploying high-cost test-beds or develop complex mathematical analysis. However, simulation results rely on physical layer assumptions, which are not usually accurate enough to capture the real behavior of a WSN. Such an issue can lead to mistaken or questionable results. Besides, most of the envisioned applications for WSNs consider the nodes to be at the ground level. However, there is a lack of radio propagation characterization and validation by measurements with nodes at ground level for actual sensor hardware. In this paper, we propose to use a low-computational cost, two slope, log-normal path-loss near ground outdoor channel model at 868 MHz in WSN simulations. The model is validated by extensive real hardware measurements obtained in different scenarios. In addition, accurate model parameters are provided. This model is compared with the well-known one slope path-loss model. We demonstrate that the two slope log-normal model provides more accurate WSN simulations at almost the same computational cost as the single slope one. It is also shown that the radio propagation characterization heavily depends on the adjusted model parameters for a target deployment scenario: The model parameters have a considerable impact on the average number of neighbors and on the network connectivity.

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

channel modeling
near ground propagation


Personalized text snippet extraction using statistical language models In knowledge discovery in a text database, extracting and returning a subset of information highly relevant to a user's query is a critical task. In a broader sense, this is essentially identification of certain personalized patterns that drives such applications as Web search engine construction, customized text summarization and automated question answering. A related problem of text snippet extraction has been previously studied in information retrieval. In these studies, common strategies for extracting and presenting text snippets to meet user needs either process document fragments that have been delimitated a priori or use a sliding window of a fixed size to highlight the results. In this work, we argue that text snippet extraction can be generalized if the user's intention is better utilized. It overcomes the rigidness of existing approaches by dynamically returning more flexible startend positions of text snippets, which are also semantically more coherent. This is achieved by constructing and using statistical language models which effectively capture the commonalities between a document and the user intention. Experiments indicate that our proposed solutions provide effective personalized information extraction services.

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

text snippet extraction
information retrieval

personalization
language model
natural language processing
pattern discovery
hidden markov model


Upper and lower bounds on the makespan of schedules for tree dags on linear arrays We find, in polynomial time, a schedule for a complete binary tree directed acyclic graph (dag) with n unit execution time tasks on a linear array whose makespan is optimal within a factor of 1 + o(1). Further, given a binary tree dag T with n tasks and height h, we find, in polynomial time, a schedule for T on a linear array whose makespan is optimal within a factor of 5 + o(1). On the other hand, we prove that explicit lower and upper bounds on the makespan of optimal schedules of binary tree dags on linear arrays differ at least by a factor of 1 + root 2/2. We also find, in polynomial time, schedules for bounded tree dags with n unit execution time tasks, degree d, and height h is an element of o(n(1/2)) boolean OR omega(n(1/2)) on a linear array which are optimal within a factor of 1 + o(1), this time under the assumption of links with unlimited bandwidth. Finally, we compute an improved upper bound on the makespan of an optimal schedule for a tree dag on the architecture independent model of Papadimitriou and Yannakakis [14], provided that its height is not too large.

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

multiprocessing
parallel computation
parallel architectures
communication delay
scheduling
mesh array
tree decomposition


Domain Adaptation for Face Recognition: Targetize Source Domain Bridged by Common Subspace In many applications, a face recognition model learned on a source domain but applied to a novel target domain degenerates even significantly due to the mismatch between the two domains. Aiming at learning a better face recognition model for the target domain, this paper proposes a simple but effective domain adaptation approach that transfers the supervision knowledge from a labeled source domain to the unlabeled target domain. Our basic idea is to convert the source domain images to target domain (termed as targetize the source domain hereinafter), and at the same time keep its supervision information. For this purpose, each source domain image is simply represented as a linear combination of sparse target domain neighbors in the image space, with the combination coefficients however learnt in a common subspace. The principle behind this strategy is that, the common knowledge is only favorable for accurate cross-domain reconstruction, but for the classification in the target domain, the specific knowledge of the target domain is also essential and thus should be mostly preserved (through targetization in the image space in this work). To discover the common knowledge, specifically, a common subspace is learnt, in which the structures of both domains are preserved and meanwhile the disparity of source and target domains is reduced. The proposed method is extensively evaluated under three face recognition scenarios, i.e., domain adaptation across view angle, domain adaptation across ethnicity and domain adaptation across imaging condition. The experimental results illustrate the superiority of our method over those competitive ones.

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

common subspace learning
targetize the sourece domain


threat analysis of online health information system Electronic health records are increasingly used to enhance availability, recovery, and transfer of health records. Newly developed online health systems such as Google-Health create new security and privacy risks. In this paper, we elucidate a clear threat model for online health information systems. We distinguish between privacy and security threats. In response to these risks, we propose a traitor-tracing solution, which embeds proof to trace an attacker who leaks data from a repository. We argue that the application of traitor-tracing techniques to online health systems can align incentives and decrease risks.

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

traitor-tracing schemes
information health systems
legal aspects


Models and Mechanisms for Artificial Morphogenesis Embryological development provides an inspiring example of the creation of complex hierarchical structures by self-organization. Likewise, biological metamorphosis shows how these complex systems can radically restructure themselves. Our research investigates these principles and their application to artificial systems in order to create intricately structured systems that are ordered from the nanoscale up to the macroscale. However these processes depend on mutually interdependent unfoldings of an information process and of the "body" in which it is occurring. Such embodied computation provides challenges as well as opportunities, and in order to fulfill its promise, we need both formal and informal models for conceptualizing, designing, and reasoning about embodied computation. This paper presents a preliminary design for one such model especially oriented toward artificial morphogenesis.

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

embodied computation
embryological development
metamorphosis
morphogenesis

algorithmic assembly
embodiment
nanotechnology
post-moore's law computing
reconfigurable systems
self-assembly
self-organization


ICP registration using invariant features This paper investigates the use of Euclidean invariant features in a generalization of iterative closest point registration of range images. Pointwise correspondences are chosen as the closest point with respect to a weighted linear combination of positional and feature distances. It is shown that under ideal noise-free conditions, correspondences formed using this distance function are correct more often than correspondences formed using the positional distance alone. In addition, monotonic convergence to at least a local minimum is shown to hold for this method. When noise is present, a method that automatically sets the optimal relative contribution of features and positions is described. This method trades off error in feature values due to noise against error in positions due to misalignment, Experimental results suggest that using invariant features decreases the probability of being trapped in a local minimum and may be an effective solution for difficult range image registration problems where the scene is very small compared to the model.

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


Where were you? Development of a time-geographic approach for activity destination re-construction With the use of individual-level travel survey datasets describing the detailed activities of households, it is possible to analyze human movements with a high degree of precision. However, travel survey data are not without quality issues. Potential exists for origins and destinations of reported trips not to be geo-referenced, perhaps due to misreported information or inconsistencies in spatial address databases, which can limit the usefulness of the survey data. From an analytical standpoint, this is a serious problem because a single unreferenced stop in a trip record in effect renders that individuals data useless, especially in cases where analyzing chains of activity locations is of interest. This paper presents a framework and basic computational approach for exploring unlocatable activity locations inherent to travel surveys. Derived from recent work in developing a network-based, probabilistic time geography, the proposed methods are able to estimate the likely locations of missing trip origins and destinations. The methods generate probabilistic potential path trees which are used to visualize and quantify potential locations for the unreferenced destinations. The methods are demonstrated with simulated survey data from a smaller metropolitan area.

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

spatial behavior
geocoding
visualization
probability
error
networks


New primal-dual algorithms for Steiner tree problems We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree problem (DST), and the set cover problem (SC) which is a subcase of DST. All our problems are NP-hard; so we are interested in their approximation algorithms. First, we give an algorithm for DST which is based on the traditional approach of designing primal-dual approximation algorithms. We show that the approximation factor of the algorithm is k, where k is the number of terminals. in the case when the problem is restricted to quasi-bipartite graphs. We also give pathologically bad examples for the algorithm performance. To overcome the problems exposed by the bad examples, we design a new framework for primal-dual algorithms which can be applied to all of our problems. The main feature of the new approach is that, unlike the traditional primal-dual algorithms, it keeps the dual solution in the interior of the dual feasible region. The new approach allows us to avoid including too many arcs in the solution, and thus achieves a smaller-cost solution. Our computational results show that the interior-point version of the primal-dual most of the time performs better than the original primal-dual method. (c) 2005 Published by Elsevier Ltd.

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

integer programming
approximation algorithm
primal-dual algorithm


An expert trajectory design for control of nuclear research reactors In this study, an expert trajectory was proposed for control of nuclear research reactors. The trajectory being followed by the reactor power is composed of three parts. In order to calculate periods at the midpoint of each part of the trajectory, a period generator was designed based on artificial neural networks. The contribution of the expert trajectory to the reactor control system was investigated. Furthermore, the behavior of the controller with the expert trajectory was tested for various initial and desired power levels, as well as under disturbance. It was seen that the controller could control the system successfully under all conditions within the acceptable error tolerance.

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

nuclear reactor control
trajectory planning


Facebook or Renren? A comparative study of social networking site use and social capital among Chinese international students in the United States Facebook and Renren use are positively associated with bridging social capital. Facebooks relationship with bridging social capital is stronger than Renren. Renren use is positively associated with maintaining home country social capital.

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

facebook
renren
social capital
chinese international students


Detection of phishing attacks in Iranian e-banking using a fuzzyrough hybrid system Identifying outstanding phishing features that best fit the Iranian bank websites. Extracting a reduct of influential indicators in phishing detection for Iranian e-banking system using rough sets theory. Determining critical phishing detection rules and forming a flexible rule base for phishing detection. Building a fuzzyrough hybrid system as a core processing unit of phishing detection applications or web browser add-ons and extensions concentrated on Iranian e-banking. Applying the proposed system on Iranian phishing sites and achieving an efficiency of 88%.

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

e-banking
fraud detection
fuzzy expert system


Play-it-by-eye! Collect movies and improvise perspectives with tangible video objects We present an alternative video-making framework for children with tools that integrate video capture with movie production. We propose different forms of interaction with physical artifacts to capture storytelling. Play interactions as input to video editing systems assuage the interface complexities of film construction in commercial software. We aim to motivate young users in telling their stories, extracting meaning from their experiences by capturing supporting video to accompany their stories, and driving reflection on the outcomes of their movies. We report on our design process over the course of four research projects that span from a graphical user interface to a physical instantiation of video. We interface the digital and physical realms using tangible metaphors for digital data, providing a spontaneous and collaborative approach to video composition. We evaluate our systems during observations with 4- to 14-year-old users and analyze their different approaches to capturing, collecting, editing, and performing visual and sound clips.

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

interaction design
tangible user interfaces


Exploring association between perceived importance of travel/traffic information and travel behaviour in natural disasters: A case study of the 2011 Brisbane floods Using the 2011 Brisbane flood as a case study. Respondents perceptions of the importance of travel/traffic information were modelled. The hysteresis phenomenon in respondents perceived information importance. Socio-demographic features have a significant impact on such perceptions. No evidence of the influence of travel/traffic information on respondents travel mode.

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

travel information
traffic information
adverse weather
natural disaster
random-effects ordered logit