2D and 3D photoresist line roughness characterization Lithographic scaling is approaching 16nm feature dimensions. Besides the manufacturing challenges, metrology is also suffering with feature scaling: Scanning microscopy is struggling to capture the roughness of the new photoresist platforms for ArF and extreme-UV lithography, thinner and more sensitive to electron bombardment. Moreover, standard figure of merit such as feature dimensions and line roughness should be integrated with fractal analysis and frequency evaluation, both needed to understand the root-causes of resist roughness. For this purpose, 3D sidewall information are likely to be required in order to choose the best process settings to reduce the roughness after exposure and during pattern transfer. In this paper, line width/edge roughness characterization is reported by means of power spectral density and fractal analysis. These results are compared with 3D atomic force microscopy and thickness measurements. A synthetic 3D surface reconstruction model is then extrapolated from the power spectral densities. The full method is tested on a plasma-based smoothing technique, where the patterned resist is exposed to plasma-UV light in order to reduce the roughness before the etch steps. Between 15% and 50% edge roughness reduction is obtained, at the cost of resist thickness loss and line shape deterioration.

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


Collection and Analysis of a Parkinson Speech Dataset With Multiple Types of Sound Recordings There has been an increased interest in speech pattern analysis applications of Parkinsonism for building predictive telediagnosis and telemonitoring models. For this purpose, we have collected a wide variety of voice samples, including sustained vowels, words, and sentences compiled from a set of speaking exercises for people with Parkinson's disease. There are two main issues in learning from such a dataset that consists of multiple speech recordings per subject: 1) How predictive these various types, e. g., sustained vowels versus words, of voice samples are in Parkinson's disease (PD) diagnosis? 2) How well the central tendency and dispersion metrics serve as representatives of all sample recordings of a subject? In this paper, investigating our Parkinson dataset using well-known machine learning tools, as reported in the literature, sustained vowels are found to carry more PD-discriminative information. We have also found that rather than using each voice recording of each subject as an independent data sample, representing the samples of a subject with central tendency and dispersion metrics improves generalization of the predictive model.

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

cross validation
multiple sound types
speech impairments
telediagnosis of parkinson's disease


The Performance of Technical Information Transfer in New Product Development The performance of new product development (NPD) is greatly affected by communication strategy and the information technology tools used to support the strategy. A number of users of NPD processes claim that an adequate communication strategy decreases their product cycle time and cost. However, the problem with evaluating the impact of information transfer is that no one has ever specifically measured how performant communication strategies are, or how effective information transfer tools are. For this purpose, a model was developed to evaluate communication strategies, and a set of communication measurement tools was identified to gauge the efficiency of information transfer. This study examines communication within NPD processes at three companies and measures how well information was transmitted, stored, and retrieved. The results indicate that a shorter, more efficient communication process reduces time and effort, and that a shift toward formal methods and passive information tools (computer-based systems) results in more effective and easier coordination as well as better integration.

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

information transfer
communication strategy
information technology
new product development


MAC protocols over wireless mesh networks: problems and perspective The wireless mesh network (WMN) has been an emerging technology in recent years. Because the transmission medium used in networking backhaul access points (APs) is radio, the wireless mesh network is not only easy and cost effective in deployment, but also has good scalability in coverage area and capacity. This paper provides an overview of distributed medium access control (MAC) protocols, discusses their features and suitability for WMNs and identifies potential challenges and open research issues. Specifically, we overview the technical medium access control of the new standard for WMNs, the mesh deployments of the IEEE 802.16 MAC and we focus on the coordinated distributed scheduling (CDS) scheme of this. Moreover, we assess the fitness of the IEEE 802.11 over wireless mesh networks. Through the study of existing solutions, we analyze the previous work and sketch the contours of the directions to achieve the throughput and the latency that must be guaranteed in WMNs. In this context we suggest future enhancements to the standard that could increase throughput, while also increase the robustness, without complexity increases and propose and evaluate a new distributed scheduling scheme (DSS). We compared the CDS and the DSS and simulations studies document and confirm the positive characteristics of the proposed scheme. Furthermore, we proposed an analytical model to assess a lower bound in terms of delay.

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

wireless mesh networks (wmns)
ieee 802.11
ieee 802.16
tdma


A hybrid scheme for handprinted numeral recognition based on a self-organizing network and MLP classifiers This paper proposes a novel approach to automatic recognition of handprinted Bangla (an Indian script) numerals. A modified Topology Adaptive Self-Organizing Neural Network is proposed to extract a vector skeleton from a binary numeral image. Simple heuristics axe considered to prune artifacts, if any, in such a skeletal shape. Certain topological and structural features like loops, junctions, positions of terminal nodes, etc. are used along with a hierarchical tree classifier to classify handwritten numerals into smaller subgroups. Multilayer perceptron (MLP) networks are then employed to uniquely classify the numerals belonging to each subgroup. The system is trained using a sample data set of 1800 numerals and we have obtained 93.26% correct recognition rate and 1.71% rejection on a separate test set of another 7760 samples. In addition, a validation set consisting of 1440 samples has been used to determine the termination of the training algorithm of the MLP networks. The proposed scheme is sufficiently robust with respect to considerable object noise.

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

handprinted numeral recognition
mlp
topological and structural features
tree classifier
vector skeleton


Robust Multi-image Processing with Optimal Sparse Regularization Sparse modeling can be used to characterize outlier type noise. Thanks to sparse recovery theory, it was shown that 1-norm super-resolution is robust to outliers if enough images are captured. Moreover, sparse modeling of signals is a way to overcome ill-posedness of under-determined problems. This naturally leads to this question: does an added sparsity assumption on the signal improve the robustness to outliers of the 1-norm super-resolution, and if yes, how strong should this assumption be? In this article, we review and extend results of the literature to the robustness to outliers of overdetermined signal recovery problems under sparse regularization, with a convex variational formulation. We then apply them to general random matrices, and show how the regularization parameter acts on the robustness to outliers. Finally, we show that in the case of multi-image processing, the structure of the support of signal and noise must be studied precisely. We show that the sparsity assumption improves robustness if outliers do not overlap with signal jumps, and determine how the regularization parameter can be chosen.

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

multi-image processing
super-resolution
sparse signal


A quality of service (QoS)-aware execution plan selection approach for a service composition process The quality of service (QoS)-aware service composition (QSC) problem is to find an execution plan of a service composition process which can ensure that the quality of service meets given user requirements. This paper proposes a branch and bound for execution plan selection (BB4EPS) algorithm to solve the QSC problem. In the proposed BB4EPS algorithm, a universal QoS model is used to evaluate the QoS parameters for service composition, and the QSC problem is modeled as an extended flexible constraint satisfaction framework, in which the utility function is applied to build the objective function. Numerical simulation results show that the proposed algorithm is feasible and effective.

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

qos
service composition
flexible constraint


real-time scheduling of mixture-of-experts systems with limited resources Mixture-of-Experts (MoE) systems solve intricate problems by combining results generated independently by multiple computational models (the "experts"). Given an instance of a problem, the responsibility of an expert measures the degree to which the expert's output contributes to the final solution. Brain Machine Interfaces are examples of applications where an MoE system needs to run periodically and expert responsibilities can vary across execution cycles. When resources are insufficient to run all experts in every cycle, it becomes necessary to execute the most responsible experts within each cycle. The problem of adaptively scheduling experts with dynamic responsibilities can be formulated as a succession of optimization problems. Each of these problems can be solved by a known technique called "task compression" using explicit mappings described in this paper to relate expert responsibilities to task elasticities. A novel heuristic is proposed to enable real-time execution rate adaptation in MoE systems with insufficient resources. In any given cycle, the heuristic uses sensitivity analysis to test whether one of two pre-computed schedules is the optimal solution of the optimization problem to avoid re-optimization when the test result is positive. These two candidate schedules are the schedule used in the previous cycle and the schedule pre-computed by the heuristic during the previous cycle, using future responsibilities predicted by the heuristic's responsibility predictor. Our heuristic significantly reduces the scheduling delay in the execution of experts when re-execution of the task-compression algorithm is not needed from O(N2) time, where N denotes the number of experts, to O(N) time. Experimental evaluation of the heuristic on a test case in motor control shows that these time savings occur and scheduled experts' deadlines are met in up to 90\% of all cycles. For the test scenario considered in the paper, the average output error of a real-time MoE system due to the use of limited resources is less than 7\%.

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

ensemble computing
prediction
real-time scheduling
adaptive scheduling
mixture of experts


LEARNING BAYESIAN NETWORK PARAMETERS FROM SOFT DATA Bayesian networks have been known as a powerful knowledge representation model and a computational architecture for reasoning under uncertainty. However, there are still some obstacles in applying them for practical applications. Among them are learning parameters, or the conditional probability tables from data. Much work in the field focuses on handling incomplete data, i.e. data with missing values. In this paper, we propose an approach for learning parameters of Bayesian networks from soft data, the values of which may be imprecise or uncertain, given by beliefs or confidence scales. Theoretical justification of the approach is given, and experimental results demonstrated the effectiveness of our approach.

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

soft evidence
parameter learning
sufficient statistics


Verifying persistent security properties ? We study bisimulation-based information flow security properties which are persistent, in the sense that if a system is secure then all of its reachable states are secure too. We show that such properties can be characterized in terms of bisimulation-like equivalence relations, between the full system and the system prevented from performing confidential actions. Moreover, we provide a characterization of such properties in terms of unwinding conditions which demand properties of individual actions. These two different characterizations naturally lead to efficient methods for the verification and construction of secure systems. We also prove several compositionality results, that allow us to check the security of a system by only verifying the security of its subcomponents.

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


Comparison of learning strategies for adaptation of fuzzy controller parameters For tuning fuzzy controllers, several parameter identification techniques are available, ranging from more robust descent methods to sophisticated optimisation. However, from an application point of view, it is not always clear that numerical sophistication wins over more pragmatic approaches to tuning. Obviously, the data sets play crucial roles in efforts to reach successful tuning. Especially data sets generated from real processes often contain not only noisy data and conflicting subsets, but also the connected problem of non-covering input spaces. In this paper we will compare several parameter identification techniques w.r.t. different data sets. We focus on selections of learning rates and on defining training sequences related to subclasses of parameters. (C) 1999 Elsevier Science B.V. All rights reserved.

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


on-off keying modulation and tardos fingerprinting We consider a particular design of fingerprinting code for multimedia contents, carefully motivated by a detailed analysis. This design is based on a two-layer approach: a probabilistic fingerprinting code a la Tardos coupled with a zero-bit side informed watermarking technique. The detection of multiple watermark presences in content blocks give birth to extended accusation processes, whose performances, assessed experimentally, are excellent. This prevents the colluders from mixing different content blocks, a class of collusion which is not encompassed in the classical marking assumption. Therefore, the collusion must stick to the block exchange strategy which is fully tackled by the fingerprinting code.

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


Intelligent scheduling and control of rail-guided vehicles and load/unload operations in a flexible manufacturing system This paper presents a framework of intelligent manufacturing scheduling and control with specific applications to operations of rail-guided vehicle systems (RGVS). A RGVS control architecture is discussed with a focus on a simulated experiment in operations of the load/unload area of a real industrial flexible manufacturing system (FMS). In the operation stage of a material handling system (MHS), all shop floor data are subject to change as time goes. These data can be collected using a data acquisition device and stored in a dynamic database. The RGVS simulator used in this experimental study is designed to incorporate some possible situations representing existing material handling scenarios in order to evaluate alternative control policies. At the development stage of the controller, all possible combinations of most commonly encountered scenarios such as RGV failures, production schedule changes, machine breakdowns, and rush orders are to be simulated and corresponding results collected. The data are then structured into training data pairs to properly train an artificial neural network. The neural network, trained by using input/output data sets obtained from a number of simulation runs, will then provide control strategy recommendations. At the application stage, whenever an abnormal scenario occurs, a pre-processor will be activated to pre-screen and prepare an input vector for the trained neural network. If such an abnormal scenario falls outside the existing domain of data sets employed to train the neural network, as judged by the MHS supervisory controller, an off-line training module will be activated to eventually update the neural network. The recommended control strategies will be transmitted to the MHS control for real-time execution. If there is no further abnormal event detected, the dynamic data base (DDB) module simply continues to monitor the MHS activities. The proposed MHS control system combines the features of example based neural network technology and simulation modeling for true intelligent, on-line, pseudo real-time control. Not only will the system assure that feasible material handling control actions be taken, but also it will implement better control decisions through continuous learning from experiences captured as the operation time of the MHS accumulates.

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

flexible manufacturing systems control
neural networks
material handling systems
automated guided vehicles


progressive image mosaicking in wireless image sensor networks The prevailing image mosaicking algorithms are based on a collection of full images that are captured by camera sensors. However, these approaches cannot be directly applied to the emerging wireless image sensor networks (WISNs). Wireless channel insert noticeable delay before an entire image can be transmitted to the sink node in a WISN. In this paper, we propose a Progressive Image Mosaicking Algorithm (PIMA) based on the multi-scans feature of Progressive JPEG. PIMA's most distinguishing feature is that it accomplishes image mosaicking by using portions of images of a proper quality level to deliver an approximate view of the scene in a short time during the reception of the image data stream. Thereafter, it amends the image registration on the other two finer levels to gradually enhance the display quality. A variation of Sum of Absolute Difference (SAD) is used to improve the accuracy of image registration. Experimental results show that PIMA successfully decreases the delay for displaying the first scene, and preserves an equivalent performance to the existing patch-based image mosaicking algorithms.

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

progressive jpeg
image registration
wireless image sensor networks


CMOS EIGHT-TRANSISTOR MEMORY CELL FOR LOW-DYNAMIC-POWER HIGH-SPEED EMBEDDED SRAM Embedded SRAM design with high noise margin between read and write, low power, low supply voltages, and high speed become essential features in VLSI embedded applications. The complete embedded SRAM design of self-timing synchronization is proposed based on the CMOS eight-transistor (8T-Cell) memory cell circuit. The cell is based on the traditional six-transistor (6T-Cell) cross-coupled invertors with the addition of two NMOS transistors for separate read buffer circuit. The read buffer structure is based on pre-charging the read bit-line during the low value of read clock and evaluating the read bit-line during the high value of read clock, thereby maintaining one active line per column and eliminating the use of traditional sense amplifier with all its synchronization schemes. The simulation results show that the embedded SRAM of size 128-bit x 128-bit is operating at a maximum frequency of 200 MHz for Write and Read clock cycles with 1.62V power supply, and measures a total average power consumption of 22.60mW. All simulation results were conducted on 0.18 mu m TSMC single poly and three layers of metals measuring a cell area of 2.2 x 3.0 mu m(2). The circuit is not meant to replace the SRAM with 6T-Cell transistor structure; however, it is attractive for applications related to high density with automation road-map design, such as graphic and network processor chips. In these applications, memory sizes are introduced in many different irregular geometries and uses all over the chip with storage sizes less than 20 k-bit, in addition, it is susceptible to large substrate noise as well as large coupling wire routing.

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

8t-cell
6t-cell
0.18 mu m
low voltage power supply
self-timing
graphics hardware
low dynamic power


Fingerprint recognition by combining global structure and local cues As an important feature, orientation field describes the global structure of fingerprints. It provides robust discriminatory information other than traditional widely-used minutiae points. However, there are few works explicitly incorporating this information into fingerprint matching stage, partly due to the difficulty of saving the orientation field in the feature template. In this paper, we propose a novel representation for fingerprints which includes both minutiae and model-based orientation field. Then, fingerprint matching can be done by combining the decisions of the matchers based on the global structure (orientation field) and the local cue (minutiae). We have conducted a set of experiments on large-scale databases and made thorough comparisons with the state-of-the-arts. Extensive experimental results show that combining these local and global discriminative information can largely improve the performance. The proposed system is more robust and accurate than conventional minutiae-based methods, and also better than the previous works which implicitly incorporate the orientation information. In this system, the feature template takes less than 420 bytes, and the feature extraction and matching procedures can be done in about 0.30 s. We also show that the global orientation field is beneficial to the alignment of the fingerprints which are either incomplete or poor-qualitied.

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

fingerprint recognition
orientation field

classifier fusion
fingerprint representation


GSC: a generic source-based congestion control algorithm for reliable multicast This paper presents a simple, generic source-based end-to-end multicast congestion control (GSC) algorithm for reliable multicast transport (RMT) protocols. The algorithm is completely implemented at the source and leverages the reverse control information how in RMT protocols like PGM or RMTP. Specifically, it does not introduce any new control traffic or new fields in RMT protocol headers. It partially addresses the drop-to-zero problem by introducing a robust, adaptive time-filter based upon RTT (round trip time) estimates collected by observing NAK traffic. This solution allows it to scale far large multicast groups while being adaptive to congestion situation changes in any part of the tree. The algorithm is friendly to TCP in terms of competition for bandwidth shares. The scheme has minimal control traffic requirements and weak RTT estimation requirements. (C) 2001 Published by Elsevier Science B.V.

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


Methylglyoxal, Glyoxal, and Their Detoxification in Alzheimer's Disease Abstract: The accumulation of advanced glycation end products (AGEs) in brains with Alzheimer's disease (AD) has been implicated in the formation of insoluble deposits such as amyloid plaques and neurofibrillary tangles. AGEs are also known to activate glia, resulting in inflammation and neuronal dysfunction. As reactive intermediates of AGE formation, neurotoxic reactive dicarbonyl compounds such as glyoxal and methylglyoxal have been identified. One of the most effective detoxification systems for methylglyoxal and glyoxal is the glutathione-dependent glyoxalase system, consisting of glyoxalase I and glyoxalase II. In this study, we have determined the methylglyoxal and glyoxal levels in the cerebrospinal fluid of AD patients compared to healthy controls. Methylglyoxal levels in AD patients were twofold higher than in controls, but this difference was not significant due to the large intergroup variations and the small sample size. However, the concentrations of both compounds were five to seven times higher in CSF than in plasma. We also investigated the glyoxalase I level in AD and healthy control brains. The number of glyoxalase I- positive neurons were increased in AD brains compared to controls. Our findings suggest that glyoxalase I is upregulated in AD in a compensatory manner to maintain physiological methylglyoxal and glyoxal levels.

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

glyoxalase
advanced glycation end products
methylglyoxal
glyoxal


Enabling opportunistic and dynamic spectrum access through learning techniques The expected shortage in spectrum supply is well understood to be primarily due to the inefficient, static nature of current spectrum allocation policies. In order to address this problem, Federal Communications Commission promotes the so called opportunistic spectrum access (OSA) to be applied on cognitive radio networks (CRNs). In short, the idea behind OSA is allowing unlicensed users to use unused licensed spectra as long as they do not cause interference to licensed users. In this paper, we present and evaluate learning schemes that allow unlicensed users to locate and use spectrum opportunities effectively, thus improving efficiency of CRNs. We separately consider two models: single and multiple unlicensed user(s). For the latter model, we present two schemes: noncooperative and cooperative Q-learning. All proposed schemes do not require prior knowledge or prediction models of the environment's dynamics and behaviors, yet can still achieve high performance by learning from interaction with the environment. Using simulations, we show that the proposed schemes achieve good performances in terms of throughput and fairness. Copyright (C) 2011 John Wiley & Sons, Ltd.

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

dynamic spectrum access
learning schemes


Age of AquariusThe FDLP in the 21st century With the appointment of Bruce James as Public Printer of the United States in 2002 (confirmed by the Senate on November 20, 2002),1 the Government Printing Office (GPO) began to forecast and plan for its future in the age of the Internet. During the spring of 2005, the Depository Library Council (DLC), an advisory body to the Public Printer, concluded it was time for depository librarians to play a more active part in envisioning the future of government information. Toward that end, DLC wrote a discussion paper, Knowledge Will Forever Govern: A Vision Statement for Federal Depository Libraries in the 21st Century, 2 and with the GPO's support devoted the 2005 Fall Depository Library Council meeting to discussing and refining a vision for the future of the Federal Depository Library Program (FDLP).

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

federal depository library program
depository library council
librarians
government information


A Novel Prefix-Aggregation Based Distributed Management Scheme for PMIPv6 As a promising network-based mobility management protocol, Proxy Mobile IPv6 (PMIPv6) can provide the mobility support for the Mobile Node (MN) without any involvement of MN in mobility signaling. However, PMIPv6 supports the mobility management via centralized anchors, which leads to many obvious shortcomings, such as sub-optimal routing, scalability and single point of failure issue. Besides, it remains an open issue how to deal with the inter-domain handover for PMIPv6 while keeping optimal routing and low signaling costs as well as supporting multicast efficiently. In this paper, we propose a novel Prefix-Aggregation based Distributed Management Scheme for PMIPv6 (PA-DMSP), in which all the Local Mobility Anchors (LMAs) distributed in the extended home network are connected to each other via the global tunnel and announce their aggregated prefix to the Internet. By using the IP anycast routing, the signaling messages and data packets destined to any IP address that belongs to the aggregated prefix can be transmitted to the topologically closest LMA, which indicates that the optimized routing can always be achieved. Besides, the distributed LMA management scheme enables the inter-domain handover and eliminates the scalability and single point of failure issue. Moreover, PA-DMSP also proposes the multicast source mobility and receiver mobility support schemes. Our analysis verifies the better performance of PA-DMSP in terms of the signaling costs when compared with other baseline schemes. In addition, PA-DMSP can significantly improve the scalability in terms of reducing the number of LMA's routing entries.

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


Skyframe: a framework for skyline query processing in peer-to-peer systems This paper looks at the processing of skyline queries on peer-to-peer (P2P) networks. We propose Skyframe, a framework for efficient skyline query processing in P2P systems, which addresses the challenges of quick response time, low network communication cost and query load balancing among peers. Skyframe consists of two querying methods: one is optimized for network communication while the other focuses on query response time. These methods are different in the way in which the query search space is defined. In particular, the first method uses a high dominating point that has a large dominating region to prune the search space to achieve a low cost in network communication. On the other hand, the second method relaxes the search space in order to allow parallel query processing to speed up query response. Skyframe achieves query load balancing by both query load conscious data space splitting/merging during the join/departure of nodes and dynamic load migration. We further show how to apply Skyframe to both the P2P systems supporting multi-dimensional indexing and the P2P systems supporting single-dimensional indexing. Finally, we have conducted extensive experiments on both real and synthetic data sets over two existing P2P systems: CAN (Ratnasamy in A scalable content-addressable network. In: Proceedings of SIGCOMM Conference, pp. 161-172, 2001) and BATON (Jagadish et al. in A balanced tree structure for peer-to-peer networks. In: Proceedings of VLDB Conference, pp. 661-672, 2005) to evaluate the effectiveness and scalability of Skyframe.

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

framework
skyline query processing
load balancing


Detection and prediction of errors in EPCs of the SAP reference model Up to now there is neither data available on how many errors can be expected in process model collections, nor is it understood why errors are introduced. In this article, we provide empirical evidence for these questions based on the SAP reference model. This model collection contains about 600 process models expressed as Event-driven Process Chains (EPCs). We translated these EPCs into YAWL models, and analyzed them using the verification tool WofYAWL. We discovered that at least 34 of these EPCs contain errors. Moreover, we used logistic regression to show that complexity of EPCs has a significant impact on error probability.

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

business process management
event-driven process chains
error prediction


Negative charged excitons in double barrier diodes We have studied the effects of excitonic complexes formation, such as excitons and trions, on the optical and on transport properties of GaAsGaAlAs nin double barrier diodes, by measuring the currentvoltage characteristics and the photoluminescence emission, as function of bias. The observation of a pre-resonance shoulder in the I(V) curves, under high laser intensities, and a negative charged excitons in the photoluminescence spectra, under the same bias conditions, were associated to the dissociation of these complexes either by thermal excitation or by scattering with free carriers in the quantum well layer. A simple rate equation model allows us to explain the kinetics of the excitonic complexes in double barrier devices.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 dots
recombination energy
interfacial layer


Detecting, segmenting and tracking unknown objects using multi-label MRF inference ? We present a framework for detection, segmentation and tracking of multiple objects. The framework has minimal requirements on input for initialization. The choice of MRF inference method is less important, than how scenes are modeled. Proximities are more important than colors as cues for segmentation. For real-time application message passing is more feasible, than graph cuts.

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

figure-ground segmentation
active perception
multi-object tracking
object detection
gpu acceleration


a dual-band architecture for multi-gbps communication in 60 ghz multi-hop networks By utilizing abundant spectrum available at 60 GHz, millimeter wavelength (mmWave) radios can enable multi-gigabit per second (Gbps) link rates, but only over short distances. The limited range of mmWave radios can be extended to provide high throughput coverage to an entire home or office network using multi-hop communication. In this paper, we present a dual-band architecture that leverages the significant range advantage of low-cost commodity WiFi radios to control and coordinate scheduling/routing on a 60 GHz multi-hop network. The high pathloss and directionality of mmWave radio create significant opportunities for spatial reuse in these mmWave networks. By realizing these spatial reuse gains through effective scheduling/routing, this dual-band architecture can enable multi-Gbps end-to-end throughput in 60 GHz multi-hop networks.

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


Indoor navigation of a non-holonomic mobile robot using a visual memory When navigating in an unknown environment for the first time, a natural behavior consists on memorizing some key views along the performed path, in order to use these references as checkpoints for a future navigation mission. The navigation framework for wheeled mobile robots presented in this paper is based on this assumption. During a human-guided learning step, the robot performs paths which are sampled and stored as a set of ordered key images, acquired by an embedded camera. The set of these obtained visual paths is topologically organized and provides a visual memory of the environment. Given an image of one of the visual paths as a target, the robot navigation mission is defined as a concatenation of visual path subsets, called visual route. When running autonomously, the robot is controlled by a visual servoing law adapted to its nonholonomic constraint. Based on the regulation of successive homographies, this control guides the robot along the reference visual route without explicitly planning any trajectory. The proposed framework has been designed for the entire class of central catadioptric cameras (including conventional cameras). It has been validated onto two architectures. In the first one, algorithms have been implemented onto a dedicated hardware and the robot is equipped with a standard perspective camera. In the second one, they have been implemented on a standard PC and an omnidirectional camera is considered.

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

visual navigation
central camera
visual-based control


Retrieval of translated, rotated and scaled color textures A new method for color texture retrieval using color and edge features is proposed in this study. The proposed method unifies color and edge features rather than simply analyzing only color characteristics. First, the distributions of color and local edge patterns are used to derive a similarity measure for a pair of textures. Then, a retrieval method based on the similarity measure is proposed to retrieve texture images from a database of color textures. Finally, the similarity measure is extended to retrieve texture regions from a database of natural images. Since the proposed feature distributions can resist variations in translation, rotation and scale, our method has the ability to retrieve texture images or regions that change in translation, rotation and/or scale. The effectiveness and practicability of the proposed method have been demonstrated by various experiments. (C) 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

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

color texture retrieval
similarity measure
texture images

content-based retrieval
color texture segmentation
local edge pattern
texture region


Data Center TCP (DCTCP) Cloud data centers host diverse applications, mixing workloads that require small predictable latency with others requiring large sustained throughput. In this environment, today's state-of-the-art TCP protocol falls short. We present measurements of a 6000 server production cluster and reveal impairments that lead to high application latencies, rooted in TCP's demands on the limited buffer space available in data center switches. For example, bandwidth hungry "background" flows build up queues at the switches, and thus impact the performance of latency sensitive "foreground" traffic. To address these problems, we propose DCTCP, a TCP-like protocol for data center networks. DCTCP leverages Explicit Congestion Notification (ECN) in the network to provide multi-bit feedback to the end hosts. We evaluate DCTCP at 1 and 10Gbps speeds using commodity, shallow buffered switches. We find DCTCP delivers the same or better throughput than TCP, while using 90% less buffer space. Unlike TCP, DCTCP also provides high burst tolerance and low latency for short flows. In handling workloads derived from operational measurements, we found DCTCP enables the applications to handle 10X the current background traffic, without impacting foreground traffic. Further, a 10X increase in foreground traffic does not cause any timeouts, thus largely eliminating incast problems.

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


Dynasol: A visual quantum dynamics package This paper gives an introduction to a new computer program - Dynasol (DynaSolver), a package of quantum dynamics program with graphical user interface (GUI). Dynasol is built on modern computational methods in quantum reaction dynamics and is integrated with graphical interface and visualization tools for X-window environment. The basic structure and instruction of using Dynasol are presented with simple examples. The available applications of Dynasol and the instructions on how to download and install the program are also provided. (C) 2000 Elsevier Science B.V. All rights reserved.

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


An object-based approach for detecting small brain lesions: Application to Virchow-Robin spaces This paper is concerned with the detection of multiple small brain lesions from magnetic resonance imaging (MRI) data. A model based on the marked point process framework is designed to detect Virchow-Robin spaces (VRSs). These tubular shaped spaces are due to retraction of the brain parenchyma from its supplying arteries. VRS are described by simple geometrical objects that are introduced as small tubular structures. Their radiometric properties are embedded in a data term. A prior model includes interactions describing the clustering property of VRS. A Reversible Jump Markov Chain Monte Carlo algorithm (RJMCMC) optimizes the proposed model, obtained by multiplying the prior and the data model. Example results are shown on T(1)-weighted MRI datasets of elderly subjects.

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

features extraction
marked point processes
reversible jump mcmc
virchow robin spaces


Matchings in higher-order Gabriel graphs ? Given a set P of n points in the plane, the order-k Gabriel graph on P , denoted by k-GG k - GG , has an edge between two points p and q if and only if the closed disk with diameter pq contains at most k points of P, excluding p and q . We study matching problems in k-GG k - GG graphs. We show that a Euclidean bottleneck matching of P is contained in 10-GG 10 - GG , but 8-GG 8 - GG may not have any Euclidean bottleneck matching. In addition we show that 0-GG 0 - GG has a matching of size at least n ? 1 4 and this bound is tight. We also prove that 1-GG 1 - GG has a matching of size at least 2 ( n ? 1 ) 5 and 2-GG 2 - GG has a perfect matching. Finally we consider the problem of blocking the edges of k-GG k - GG .

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


First-principles study of energetic complexes (II): (5-cyanotetrazolato-N-2) pentaammine cobalt (III) perchlorate (CP) and Ni, Fe and Zn analogues First-principles methods using the TPSS density functional level of theory with the basis set 6-31G** were applied to study (5-cyanotetrazolato-N-2) pentaammine cobalt (III) perchlorate (CP) and Ni, Fe and Zn analogues in the gas phase. The optimized lowest-energy geometry of CP was calculated from reported experimental structural data using the TPSS method. The calculated values are in good agreement with those measured by X-ray diffraction. Ni, Fe and Zn analogues were constructed and calculated on the same basis. NBO results showed that the metal-ligand interactions have covalent character. Donor-acceptor analyses predicted that the delocalization energy E-2 decreases from Co to Zn, so the covalent nature of the complexes increases in the order Co > Fe > Ni > Zn. In addition, HOMO-LUMO composition was investigated to determine the stability of the title compounds.

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

(5-cyanotetrazolato-n-2) pentaammine cobalt (iii) perchlorate (cp)


Sensitivity and power modeling of CMOS mems single axis convective accelerometers In this paper, we present 3D finite element modeling and simulation of a CMOS MEMS single axis convective accelerometer. We describe the sensor architecture and present a sensor geometry model to be used in 3D FEM simulations. Differences between 3D and previously published 2D simulations are discussed. This work investigates 3D effects which give the opportunity to better predict not only sensor sensitivity but also power dissipation. Experimental sensitivity values and 3D FEM ones are compared for two different sensor geometries and two different heater temperatures. For a prototype having a heater-cavity border distance of 340m and a heater length of 230m, maximum sensitivity point is obtained for detectors localized at a distance of 125m from heater center. This distance should be moved to 90m if a 50m heater length is used. So, detectors should be placed closer to the heater than the usually used mid distance. Moreover, optimal detectors location shifts closer to the heater as heater length shrinks. We also show that if heater length is reduced by 80% (from 230 to 50m), then both electrical power and sensitivity decrease by 63% and 55%, respectively. So, best efficiency is obtained for shorter heaters. In addition, detector's length decrease is found to have a significant effect on sensitivity, with an increase of 58% and 87% using heater lengths of 230m and 50m, respectively. Here, detector's length decreased from the total side bridge length to a fraction of this length equals to 2.5%. Optimal length is obtained when detectors are implemented on the same side bridge fraction as that used to implement the heater on the central bridge.

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


AODV-RIP: improved security in mobile ad hoc networks through route investigation procedure Most routing protocols in mobile ad hoc networks (MANETs) place an emphasis on finding paths in dynamic networks without considering security. As a result, there are a number of attacks that can be used to manipulate the routing in MANET. A malicious node that sends a modified control message to an intermediate node can disturb the network using a control message. To solve this problem, we introduce AODV protocol with route investigation procedure (AODV-RIP). It uses two additional control messages to defeat security attacks that can occur in AODV routing protocol. When an intermediate node that is on the path between the source node and the destination node receives a control message, it sends a Rroute Investigation Request (IREQ) message to the destination node in order to check the reliability of the control message. According to the existence of Route Investigation Reply (IREP), the intermediate node decides whether it transmits the control message to the source node or not. Consequently, the intermediate node that receives the control message confirms that it is using two additive control messages: IREQ and IREP. Through this investigation procedure, the source node can obtain a reliable path for transmitting data packets to an intentional destination node. The simulation results show an improvement in the packet delivery ratio and end-to-end delay at the expense of a moderate increase of the control message overhead compared with the current routing protocols. Copyright (C) 2009 John Wiley & Sons, Ltd.

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


The perceptions of information systems designers from the United States, Japan, and Korea on success and failure factors This study examined the views of information systems (IS) designers from the United States, Japan and Korea on the importance of IS development factors in terms of how they contribute to both the success and failure of IS projects. IS designers from the US viewed Communication of the Project Goals and Characteristics of the IS Designers as more important than did the IS designers from Japan and Korea, but rated Characteristics of the Project Leader as less important. The results also indicated that the IS designers did not view the relative importance of the IS development factors, the same in terms of contributing to the success and failure of IS projects. Results obtained from the US sample were consistent with a self-serving bias, while the results obtained from IS designers from Japan were consistent with a self-effacing bias. No significant differences between the success and failure factors were observed for the Korean sample. It was noted that a self-serving bias may prevent IS designers from learning based on past experiences with IS failure.

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

is success and failure factors
attribution theory
is designers perceptions


workshop on tagging, mining and retrieval of human related activity information Inexpensive and user friendly cameras, microphones, and other devices such as digital pens are making it increasingly easy to capture, store and process large amounts of data over a variety of media. Even though the barriers for data acquisition have been lowered, making use of these data remains challenging. The focus of the present workshop is on issues related to theory, methods and techniques for facilitating the organization, retrieval and reuse of multimodal information. The emphasis is on organization and retrieval of information related to human activity, i.e. that is generated and consumed by individuals and groups as they go about their work, learning and leisure.

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


On the conjugate product of complex polynomial matrices In this paper, we propose a new operator of conjugate product for complex polynomial matrices. Elementary transformations are first investigated for the conjugate product. It is shown that an arbitrary complex polynomial matrix can be converted into the so-called Smith normal form by elementary transformations in the framework of conjugate product. Then the concepts of greatest common divisors and coprimeness are proposed and investigated, and some necessary and sufficient conditions for the coprimeness are established. Finally, it is revealed that two complex matrices A and B are consimilar if and only if (sI - A) and (sI - B) are conequivalent. Such a fact implies that the Jordan form of a complex matrix A under consimilarity may be obtained by analyzing the Smith normal form of (sI - A). (C) 2010 Elsevier Ltd. All rights reserved.

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

conjugate product
coprimeness
consimilarity

unimodular matrices
invertible matrices
conequivalence


On the Processing of Decimated Signals The aim of the given paper is development of a recursive approach for calculating the statistics of decimated realizations of a basic discrete-time signal, obtained by sampling a continuous-time one. The statistics values are calculated without storing decimated realizations in the memory of a computer. In such a case, only all samples of the basic discrete-time signal are required. The summing calculation amount has been significantly reduced here by applying recursive expressions that use, in the current operation, the respective statistic obtained by processing the samples of a previous decimated realization. We prove the corollaries referring to recursive statistics calculation and present here an example. The results of calculation of the total quantity of computer operations for a different amount of decimated signals are also given and compared to that, determined by using the ordinary formulas.

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

signals
processing
realization
statistics
computer operations


Gaming at work: A learning environment for synchronized manufacturing This work addresses the challenges raised by the new work organizations to their personnel and points out the learning opportunities which the Internet media can bring to the process of continual development of people at work. We show how concepts of synchronized manufacturing could be achieved through a computerized game-based activity. The Dice Game is a synchronous simulation game which illustrates our discussion, (C) 2000 John Wiley & Sons, Inc.

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

learning in the workplace
game-based design


Multifacility ordered median problems on networks: A further analysis In this paper, we address the ordered p-median problem, which includes as special cases most of the classical multifacility location problems discussed in the literature. Finite dominating sets (FDS) are known for particular instances of this problem: p-median, p-center, and p-centdian. We find an FDS for the ordered p-methdian problem. This set allows us to gain a better insight into the general FDS structure of network location problems. This FDS is later used to present the first polynomial time algorithm for p-facility ordered median problems on tree networks. This result is combined with some approximation algorithms to give an O(log M log log M) approximate solution of these problems on general networks, where M is the number of vertices. (C) 2002 Wiley Periodicals, 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 B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Conformal mapping for the efficient MFS solution of Dirichlet boundary value problems In this work, we use conformal mapping to transform harmonic Dirichlet problems of Laplace's equation which are defined in simply-connected domains into harmonic Dirichlet problems that are defined in the unit disk. We then solve the resulting harmonic Dirichlet problems efficiently using the method of fundamental solutions (MFS) in conjunction with fast fourier transforms (FFTs). This technique is extended to harmonic Dirichlet problems in doubly-connected domains which are now mapped onto annular domains. The solution of the resulting harmonic Dirichlet problems can be carried out equally efficiently using the MFS with FFTs. Several numerical examples are presented.

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

method of fundamental solutions
conformal mapping


prime subprogram parsing of a program A parsing method based on the triconnected decomposition of a biconnected graph is presented. The parsing algorithm runs in linear time and handles a large class of flow graphs. The applications of this algorithm to flow analysis and to the automatic structuring of programs are discussed.

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

decomposition program flow graph applications method algorithm class parsing


Research opportunities and challenges in 2005 Objectives. Biomedical informatics practice and research have become so brood that I will comment on only three areas. These are the electronic health record; prospective population studies, and interactive publications. Methods. Review of the literature, Internet resources and material and reports generated by internal and external research projects. Results: Development of an electronic health record continues to be problematic in the U.S. A number of large-scale prospective cohort studies of normal populations are now actively occurring or in planning stages in a number of countries; these present special research opportunities in biomedical informatics. Although there are engineering challenges to the implementation of interactive publications, they have the potential to enhance understanding, learning, and memory of scientific and health concepts. Conclusions: Three areas of bio-medical informatics challenge us and offer interesting and worthy research opportunities. These include the electronic health record, prospective cohort studies, and interactive publications.

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

literature review
medical informatics
computerized patient record
population surveillance


Ion transport and barrier function are disturbed in microscopic colitis In this paper, we identify mechanisms of watery diarrhea in microscopic colitis (MC). Biopsies from the sigmoid colon of patients with collagenous colitis and treated lymphocytic colitis were analyzed in miniaturized Ussing chambers for electrogenic sodium transport and barrier function with one-path impedance spectroscopy. Cytometric bead arrays (CBA) served to analyze cytokine profiles. In active MC, electrogenic sodium transport was diminished and epithelial resistance decreased. CBA revealed a Th1 cytokine profile featuring increased IFN-?, TNF-?, and IL-1? levels. After four weeks of steroid treatment with budesonide, electrogenic sodium transport recovered while epithelial barrier defects remained. Diarrhea in MC results at least in part from a combination of impaired electrogenic sodium transport and barrier defects. From a therapeutic perspective it can be postulated that the functional importance of loss of ions may be higher than that caused by barrier impairment.

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

microscopic colitis
epithelial barrier
ion transport
th1 cytokine profile


An Algorithm for the Estimation of the Initial Text Skew The paper presents a methodology for the estimation of the initial skew rate of text lines. Firstly, it splits text into groups according to the bounding boxes. Linked bounding boxes establish the bigger objects called connected components. After applying mathematical morphology operations, the enlarged group of the connected components is formed. The longest connected component is extracted by the longest common subsequence method. Inside the longest connected component, the gravity centers are determined for each bounding box. They represent the reference points, which are used for the calculation of the initial skew rate. Calculation is made by the moment based method. The comparative analysis of the origin and estimated skew rate is used to evaluate the algorithm. Hence, the proposed algorithm is examined with different printed text samples. It showed robustness for the skew estimation in the wide range of resolutions.

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

document image processing
initial text skew
moments


Reliability bounds on HNBUE life distributions with known first two moments In this paper, we study upper and lower bounds for the reliability function in harmonic new better than used in expectation (HNBUE) life distribution class with known first two moments. Here we say a life distribution has HNBUE property if the integral harmonic mean value of the residual life in any interval [0,t] is no more than its mean. By a constructive proof, we determine the lower and upper reliability bounds analytically and show that these bounds are all sharp.

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

lower and upper bounds for the reliability function


Credit-based fair queueing (CBFQ): A simple service-scheduling algorithm for packet-switched networks This paper proposes a simple rate-based scheduling algorithm for packet-switched networks. Using a set of counters to keep track of the credits accumulated by each traffic flow, the bandwidth share allocated to each flow, and the size of the head-of-line (HOL) packets of the different flows, the algorithm decides which flow to serve next. Our proposed algorithm requires on average a smaller complexity than the most interesting alternative ones while guaranteeing comparable fairness, delay, and delay jitter bounds. To further reduce the complexity, a simplified version (CBFQ-F) of the general algorithm is also proposed for networks with fixed packet lengths, such as ATM, by relaxing the fairness bound by a negligibly small amount.

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

packet scheduling
quality of service
traffic control


A new electronic traveler's check scheme based on one-way hash function Nowadays, electronic commerce is booming on the Internet and becoming more popular. Many kinds of electronic services have been developed. The most successful are the electronic payment systems such as the electronic cash/check and wallet. Most electronic payment systems are based on an elaborate discrete logarithm that raises an important issue regarding efficiency. Therefore, Hsien et al. proposed an electronic traveler's check system in 2001 using a discrete logarithm. In this paper, we propose a new electronic traveler's check system based on one-way hash function to improve efficiency and cost. Furthermore, our proposed scheme supports an on-line and off-line electronic traveler's check system of practical flexibility for use in the real world. (c) 2007 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 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

electronic check
one-way hash function
on-line
off-line


Employing topographical height map in colonic polyp measurement and false positive reduction CT colonography (CTC) is an emerging minimally invasive technique for screening and diagnosing colon cancers. Computer aided detection (CAD) techniques can increase sensitivity and reduce false positives. Inspired by the way radiologists detect polyps via 3D virtual fly-through in CTC, we borrowed the idea from geographic information systems to employ topographical height map in colonic polyp measurement and false positive reduction. After a curvature based filtering and a 3D CT feature classifier, a height map is computed for each detection using a ray-casting algorithm. We design a concentric index to characterize the concentric pattern in polyp height map based on the fact that polyps are protrusions from the colon wall and round in shape. The height map is optimized through a multi-scale spiral spherical search to maximize the concentric index. We derive several topographic features from the map and compute texture features based on wavelet decomposition. We then send the features to a committee of support vector machines for classification. We have trained our method on 394 patients (71 polyps) and tested it on 792 patients (226 polyps). Results showed that we can achieve 95% sensitivity at 2.4 false positives per patient and the height map features can reduce false positives by more than 50%. We compute the polyp height and width measurements and correlate them with manual measurements. The Pearson correlations are 0.74 (p=0.11) and 0.75 (p=0.17) for height and width, respectively.

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


Computing smooth solutions of DAEs for elastic multibody systems Multibody systems are considered which involve combinations of rigid and elastic bodies. Discretizations of the PDEs, describing the elastic members, lead to a semidiscrete system of ODEs or DAEs. Asymptotic methods are introduced which provide it theoretical basis of various known engineering results for the ODE case. These results are then extended to the DAE case by means of suitable local ODE representations. The recently developed MANPAK algorithms for computations on implicitly defined manifolds farm the basic tools for a computational method which provides consistent approximate solutions of the semidiscrete DAE that satisfy all constraints and are close to the smooth motion and an average solution. Several numerical examples indicate the effectiveness of this asymptotic method for elastic multibody systems. (C) 1999 Elsevier Science Ltd. All rights reserved.

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

differential-algebraic equations
stiff mechanical systems
smooth motion approximation
asymptotic techniques


automating database schema evolution in information system upgrades The complexity, cost, and down-time currently created by the database schema evolution process is the source of incessant problems in the life of information systems and a major stumbling block that prevent graceful upgrades. Furthermore, our studies shows that the serious problems encountered by traditional information systems are now further exacerbated in web information systems and cooperative scientific databases where the frequency of schema changes has increased while tolerance for downtimes has nearly disappeared. The PRISM project seeks to develop the methods and tools that turn this error-prone and time-consuming process into one that is controllable, predictable and avoids down-time. Toward this goal, we have assembled a large testbed of schema evolution histories, and developed a language of Schema Modification Operators (SMO) to express concisely these histories. Using this language, the database administrator can specify new schema changes, and then rely on PRISM to (i) predict the effect of these changes on current applications, (ii) translate old queries and updates to work on the new schema version, (iii) perform data migration, and (iv) generate full documentation of intervened changes. Furthermore, PRISM achieves good usability and scalability by incorporating recent advances on mapping composition and invertibility in the implementation of (ii). The progress in automating schema evolution so achieved provides the enabling technology for other advances, such as light-weight database design methodologies that embrace changes as the regular state of software. While these topics remain largely unexplored, and thus provide rich opportunities for future research, an important area which we have been investigated is that of archival information systems, where PRISM query mapping techniques were used to support flashback and historical queries for database archives under schema evolution.

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

database design methodologies
schema evolution


Model approximation for two-dimensional Markovian jump systems with state-delays and imperfect mode information This paper is concerned with the problem of \(\mathscr {H}_{\infty }\) model approximation for a class of two-dimensional (2-D) discrete-time Markovian jump linear systems with state-delays and imperfect mode information. The 2-D system is described by the well-known Fornasini-Marchesini local state-space model, and the imperfect mode information in the Markov chain simultaneously involves the exactly known, partially unknown and uncertain transition probabilities. By using the characteristics of the transition probability matrices, together with the convexification of uncertain domains, a new \(\mathscr {H}_{\infty }\) performance analysis criterion for the underlying system is firstly derived, and then two approaches, namely, the convex linearisation approach and iterative approach, to the \(\mathscr {H}_{\infty }\) model approximation synthesis are developed. The solutions to the problem are formulated in terms of strict linear matrix inequalities (LMIs) or a sequential minimization problem subject to LMI constraints. Finally, simulation studies are provided to illustrate the effectiveness of the proposed design methods.

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

markovian jump systems
model approximation
imperfect mode information


Adaptive computer control of anesthesia in humans This paper presents an efficient computer control technique for regulation of anesthesia in humans. The anesthetic used is propofol and the objective is to control the degree of hypnosis of the patient. The paper describes the basic hardware/software setup of the system and the closed-loop methodologies. The bispectral index (BIS) is considered as the feedback signal. The control methods proposed here are based in the use of proportional integral controllers with dead-time compensation to avoid undesirable oscillations in the BIS signal during the process. The compensation is based on the Smith predictor. To guarantee the applicability of the method to different patients, an adaptive module to tune the compensator is developed. Some real and simulated results are presented in this work to attest the efficiency of the methods used.

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

anesthesia control
proportional plus integral control
adaptive control


DECISIONAL GUIDANCE FOR COMPUTER-BASED DECISION SUPPORT In the course of interacting with a decision support system (DSS), decision makers may have numerous opportunities for exercising judgment. Some judgments pertain to what to do next; others require predictions or evaluations. Either deliberately or inadvertently, a DSS may guide its users in performing these judgments. This article lays a foundation and proposes an agenda for researching such "decisional guidance." Studying decisional guidance matters for two reasons. First, deliberately incorporating guidance in a system offers the potential of more supportive systems while raising a number of design questions. Second, understanding the consequences of guidance-deliberate or not-contributes to comprehending how DSSs affect decision-making behavior. This article examines three aspects of decisional guidance: (1) when and why system designers should provide decisional guidance, considering the opportunities, motives, and means for guiding; (2) how designers can provide guidance, introducing a three-dimensional typology for deliberate guidance; and (3) the consequences of decisional guidance-that is, its effects and effectiveness. This article provides a coherent approach to a set of behavioral questions just now beginning to be addressed by researchers in a fragmented, technologically oriented manner.

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

decision support systems
decision-making process
decision making
human judgment
meta-support
meta-choice


Inherited defects causing hemophagocytic lymphohistiocytic syndrome Hemophagocytic lymphohistiocytosis (HLH) manifests as the uncontrolled activation of T lymphocytes and macrophages infiltrating multiple organs. Molecular studies of individuals with HLH have demonstrated in most of these conditions a critical role of granule-dependent cytotoxic activity in the regulation of lymphocyte homeostasis, and have allowed the characterization of key effectors regulating cytotoxic granule release. The cytolytic process may now be considered a multistep process, including cell activation; the polarization of cytotoxic granules toward the conjugated target cell; the tethering, priming, and fusion of the cytotoxic granules with the plasma membrane; and the release of their contents (perforin and granzymes) into the intercellular cleft, leading to target cell death. Cytolytic cells have a second effector function involving the production of cytokines, principally ?-interferon, which is secreted independently of the exocytosis cytotoxic granule pathway. An analysis of the mechanisms underlying HLH has identified ?-interferon as a key cytokine inducing uncontrolled macrophage activation, and thus represents a potential therapeutic target.

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

cytotoxicity
apoptosis
?-interferon
immune regulation


performances of clustering policies in object bases In this paper, we address the problem of clustering graphs in object-oriented databases. Unlike previous studies which focused only on a workload consisting of a single operation, this study tackles the problem when the workload is a set of operations (method and queries) that occur with a certain probability. Thus, the goal is to minimize the expected cost of an operation in the workload, while maintaining a similarly low cost for each individual operation class. To this end, we present a new clustering policy based on the nearest-neighbor graph partitioning algorithm. We then demonstrate that this policy provides considerable gains when compared to a suite of well-known clustering policies proposed in the literature. Our results are based on two widely referenced object-oriented database benchmarks; namely, the Tektronix HyperModel and OO7.

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

performance analysis
storage techniques
object-oriented database systems


Generalizing the notion of confidence In this paper, we explore extending association analysis to non-traditional types of patterns and non-binary data by generalizing the notion of confidence. We begin by describing a general framework that measures the strength of the connection between two association patterns by the extent to which the strength of one association pattern provides information about the strength of another. Although this framework can serve as the basis for designing or analyzing measures of association, the focus in this paper is to use the framework as the basis for extending the traditional concept of confidence to error-tolerant itemsets (ETIs) and continuous data. To that end, we provide two examples. First, we (1) describe an approach to defining confidence for ETIs that preserves the interpretation of confidence as an estimate of a conditional probability, and (2) show how association rules based on ETIs can have better coverage (at an equivalent confidence level) than rules based on traditional itemsets. Next, we derive a confidence measure for continuous data that agrees with the standard confidence measure when applied to binary transaction data. Further analysis of this result exposes some of the important issues involved in constructing a confidence measure for continuous data.

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

support
error-tolerant itemsets
data mining


tangible user interfaces in context and theory Tangible User Interface (TUI) research has become increasingly widespread over the past 25 years. It is an essential component of Ubiquitous Computing and Augmented Reality research. It introduces many challenging problems in the theory and practice of interaction design. However much day-to-day research is concerned with the practicalities of making these systems work. In this workshop, we focus on the analytic and generative theories of TUI use, and the ways in which these can be applied to the design and evaluation of TUIs in real contexts.

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

tangible user interface
augmented reality
ubiquitous computing


contact-analog information representation in an automotive head-up display This contribution presents an approach for representing contact-analog information in an automotive Head-Up Display (HUD). Therefore, we will firstly introduce our approach for the calibration of the optical system consisting of the virtual image plane of the HUD and the drivers eyes. Afterward, we will present the used eyetracking system for adaptation of the HUD content at the current viewpoint/position of the driver. We will also present first prototypical concepts for the visualization of contact-analog HUD content and inital test results from a brief usability study.

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

eye tracking
contact-analog
head-up display


On self-drifting flame balls A three-dimensional (3D) reaction-diffusion model for premixed flames with radiative heat losses is studied numerically. In accordance with previous analytical predictions and two-dimensional (2D) numerical simulations, it is shown that cellular flames occurring in low Lewis number premixtures can propagate at heat-loss rates greater than the maximum that extinguishes the planar flame. At sufficiently high heat losses, the flame interface breaks up into separate self-drifting flame balls while a significant portion of the fuel remains unconsumed. (C) 2003 IMACS. Published by Elsevier B.V. All rights reserved.

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


Application of hierarchical matrices for computing the Karhunen-LoSve expansion Realistic mathematical models of physical processes contain uncertainties. These models are often described by stochastic differential equations (SDEs) or stochastic partial differential equations (SPDEs) with multiplicative noise. The uncertainties in the right-hand side or the coefficients are represented as random fields. To solve a given SPDE numerically one has to discretise the deterministic operator as well as the stochastic fields. The total dimension of the SPDE is the product of the dimensions of the deterministic part and the stochastic part. To approximate random fields with as few random variables as possible, but still retaining the essential information, the Karhunen-LoSve expansion (KLE) becomes important. The KLE of a random field requires the solution of a large eigenvalue problem. Usually it is solved by a Krylov subspace method with a sparse matrix approximation. We demonstrate the use of sparse hierarchical matrix techniques for this. A log-linear computational cost of the matrix-vector product and a log-linear storage requirement yield an efficient and fast discretisation of the random fields presented.

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

data-sparse approximation
karhunen-loeve expansion
uncertainty quantification
eigenvalue computation


A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis ? In this paper, we study a problem of designing a multi-hop wireless network for interconnecting sensors (hereafter called source nodes) to a Base Station (BS), by deploying a minimum number of relay nodes at a subset of given potential locations, while meeting a quality of service (QoS) objective specified as a hop count bound for paths from the sources to the BS. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard. For this problem, we propose a polynomial time approximation algorithm based on iteratively constructing shortest path trees and heuristically pruning away the relay nodes used until the hop count bound is violated. Results show that the algorithm performs efficiently in various randomly generated network scenarios; in over 90% of the tested scenarios, it gave solutions that were either optimal or were worse than optimal by just one relay. We then use random graph techniques to obtain, under a certain stochastic setting, an upper bound on the average case approximation ratio of a class of algorithms (including the proposed algorithm) for this problem as a function of the number of source nodes, and the hop count bound. To the best of our knowledge, the average case analysis is the first of its kind in the relay placement literature. Since the design is based on a light traffic model, we also provide simulation results (using models for the IEEE 802.15.4 physical layer and medium access control) to assess the traffic levels up to which the QoS objectives continue to be met.

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

qos based design of wireless sensor networks

relay placement for wireless sensor networks


Towards the estimation of feature-based semantic similarity using multiple ontologies A key application of ontologies is the estimation of the semantic similarity between terms. By means of this assessment, the comprehension and management of textual resources can be improved. However, most ontology-based similarity measures only support a single input ontology. If any of the compared terms do not belong to that ontology, their similarity cannot be assessed. To solve this problem, multiple ontologies can be considered. Even though there are methods that enable the multi-ontology similarity assessment by means of integrating concepts from different ontologies, most of them are based on simple terminological and/or partial matchings. This hampers similarity measures that exploit a broad set of taxonomic evidences of similarity, like feature-based ones. In this paper, we tackle this problem by proposing a method to identify all the suitable matchings between concepts of different ontologies that intervene in the similarity assessment. In addition to the obvious terminological matching, we exploit the ontological structure and the notion of concept subsumption to discover non-trivial equivalences between heterogeneous ontologies. Our final goal is to enable the accurate application of feature-based similarity measures in a multi-ontology setting. Our proposal is evaluated with regard human judgements of similarity for several benchmarks and ontologies. Results shows an improvement against related works, with similarity accuracies that even rival those obtained in an ideal mono-ontology setting.

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

feature-based semantic similarity
wordnet
mesh


The National Toxicology Program Rodent Bioassay The National Toxicology Program rodent cancer bioassay program design evolved from that of the National Cancer Institute in the 1970s. Groups of 50 or more mice are assigned to control or treatment groups. Test substances are given at three dose levels by intubation, dietary or drinking water consumption, or dermal or inhalation exposure. Dosing starts at age 56 weeks and lasts for 2 years, when surviving animals receive a complete histopathologic examination. Statistical approaches accommodate survival differences and no longer require differentiation between fatal and incidental tumors. Photocarcinogenicity studies, employing SKH-1 hairless mice, evaluate onset of skin papillomas and incidences at 1 year. Top doses are chosen to expose animals to a minimally toxic challenge and lower doses to operate within the linear range of kinetics. This dosing allows comparison of results across studies. Bioassay and ancillary studies successfully identify tumor-causing agents in rodents, provide information on dose-response, and characterize other chemical-related toxicities. NTP and Ramazzini Foundation bioassay designs differ in several aspects, but bioassays at both institutions provide chemical-specific information for predicting human carcinogens, thus providing for protection of public health. Bioassays constitute an essential information reference set for new assay development and further investigations into mechanisms of action. The scientific community and the public owe a huge debt of gratitude to Dr. Cesare Maltoni of the European Foundation of Oncology and Environmental Sciences and to Dr. David P. Rall of the National Institute of Environmental Health Sciences for their foresight and wisdom in creating and nurturing these bioassay programs.

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

national toxicology program
rodent
bioassays
photocarcinogenicity