A class of one-step time integration schemes for second-order hyperbolic differential equations We present a class of extended one-step time integration schemes for the integration of second-order nonlinear hyperbolic equations u(tt) = c(2)u(xx) + p(x, t, u), subject to initial conditions and boundary conditions of Dirichlet type or of Neumann type. We obtain one-step time integration schemes of orders two, three, and four; the schemes are unconditionally stable. For nonlinear problems, the second- and the third-order schemes have tridiagonal Jacobians, and the fourth-order schemes have pentadiagonal Jacobians. The accuracy and stability of the obtained schemes is illustrated computationally by considering numerical examples, including the sine-Gordon equation. (C) 2001 Elsevier Science Ltd. All rights reserved.

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


An optimal hardware-algorithm for sorting using a fixed-size parallel sorting device We present a hardware-algorithm for sorting N elements using either a p-sorter or a sorting network of fixed I/O size p while strictly enforcing conflict-free memory accesses. To the best of our knowledge, this is the first realistic design that achieves optimal time performance, running in Theta (N log N/p log p) time for all ranges of N. Our result completely resolves the problem of designing an implementable, time-optimal algorithm for sorting N elements using a p-sorter. More importantly, however, our result shows that, in order to achieve optimal time performance, ail that is needed is a sorting network of depth O(log(2) p) such as, for example, Batcher's classic bitonic sorting network.

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

special-purpose architectures
hardware-algorithms
sorting networks
columnsort
vlsi


Joint distribution of distances to the first and the second nearest facilities This paper derives the joint distribution of the distances to the first and the second nearest points for regular and random patterns. Distance is measured as the Euclidean and the rectilinear distances on a continuous plane. The joint distribution extends the kth nearest distance distribution of previous works. The kth nearest distance distribution only shows how the distance to the kth nearest point is distributed, whereas the joint distribution provides the relationship between the distances. An application of the joint distribution can be found in a facility location problem with non-closest facility service where the distance to the second nearest facility is also important. The joint distribution that allows us to examine the first and the second nearest distances simultaneously is useful for evaluating the reliability of facility location when some of the existing facilities are closed. The joint distribution of the road network distances is also obtained to confirm that the model on a continuous plane can be applied to actual road networks.

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


Applying dynamic traffic assignment in modeling permit-restricted parking utilizing microscopic traffic simulation Many universities are evaluating ways to improve mobility while dealing with increased demand for parking within the campus. Different types of parking strategies are considered as potential tools for improving campus mobility and meeting increased parking demand. Limited information is available on how removing on-street parking from the center of a university campus, relocating motorists to park on the periphery of campus, will impact the neighboring transportation system. Although dynamic traffic assignment (DTA) is a valuable tool for evaluating such impacts, most previous studies have used DTA with mesoscopic models. Thus, there is also limited guidance on the application of DTA within microscopic simulation models. The purpose of this study was to test a novel methodology for evaluating the mobility impact of relocating parking. The authors developed a method of utilizing DTA within a microscopic traffic simulation model. This model was applied to a case study capturing the changes in traffic patterns and volumes as a result of university parking changes. The authors found the methodology efficient and repeatable, and identified several simulator challenges with this new application. The case study findings suggest that, due to the significant number of motorists searching for the high-demand parking in the core of campus, relocating this parking to periphery lots will reduce the average travel time, even when accounting for the increased walking time.

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

dynamic traffic assignment
parking
university campus


Inverse analysis for identification of rheological and friction models in metal forming The paper deals with application of the inverse analysis to the identification of friction and rheological models in metal forming. The direct model based on the finite element approach and the inverse algorithm are described. The method is validated by performing the inverse computations for different plastometric tests: uniaxial compression, ring compression, cube compression, plane strain compression and channel test. The analysis concerns both hot tests and room temperature tests. It is shown in the paper that, in general, when inverse analysis is applied the results of identification are insensitive to the type of the test, sample dimensions etc. This observation is not valid for the channel test, in which constrain of spread fosters initiation of micro-shear bands and leads to a decrease of the flow stress. Parameter sensitivity analysis is the objective of the second part of the paper. Two aspects of sensitivity are considered. The first is evaluation of the sensitivity of the output (measured) parameters of the tests with respect to rheological and friction parameters. This analysis shows that the loads are most sensitive to the rheological parameters in the uniaxial compression and the shape of the sample is the most sensitive to friction in the ring compression. The second aspect of the analysis focused on evaluation of sensitivity of the results of the inverse analysis with respect to the coefficients, which are assumed in the calculations. It is observed that the plane strain compression test is the least sensitive to the errors in evaluation of the friction coefficient. On the other hand, when friction coefficient is identified, the ring compression is almost not sensitive to the evaluation of the flow stress of the material. Various optimization techniques were used in the analysis and efficiency of the methods is compared. It is emphasized that drawing the general conclusion regarding the best optimization strategy for the inverse analysis is difficult. Nevertheless, some recommendations are given in the paper. Application of the multicriterion optimization is one of the possible efficient approaches.

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

plastometric tests
inverse analysis
parameter sensitivity
optimization strategy


dynamic code evolution for java Dynamic code evolution is a technique to update a program while it is running. In an object-oriented language such as Java, this can be seen as replacing a set of classes by new versions. We modified an existing high-performance virtual machine to allow arbitrary changes to the definition of loaded classes. Besides adding and deleting fields and methods, we also allow any kind of changes to the class and interface hierarchy. Our approach focuses on increasing developer productivity during debugging. Changes can be applied at any point a Java program can be suspended. The evaluation section shows that our modifications to the virtual machine have no negative performance impact on normal program execution. The fast in-place instance update algorithm ensures that the performance characteristics of a change are comparable with performing a full garbage collection run. Standard Java development environments are capable of using the code evolution features of our modified virtual machine, so no additional tools are required.

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

java
virtual machine
garbage collection
evolution

class hierarchy
runtime evolution
dynamic software updating


An Actor Placement Algorithm for Wireless Sensor and Actor Network with Different Transmission Ranges Wireless sensor and actor network (WSAN) refers to a group of sensors and actors, which gather information in detection area and perform appropriate actions upon the event area, respectively. To take these actions collaboratively in the whole monitored area, maximal actor coverage along with inter-actor connectivity is desirable. In this paper, we propose an actor placement algorithm for WSAN with different transmission ranges. The algorithm utilizes the minimum connected dominating set (MCDS) construction of sensor network in order to determine the number of actors and their locations. The actors are then positioned to the location of the MCDS in order to maximize coverage and reduce data latency. The paper describes the centralized algorithm and the distributed version in detail respectively. The simulation experiments are conducted with different network density and transmission ranges, and the results show that the proposed algorithm can achieve the smaller connected dominating set (CDS) and the higher actors' coverage performance compare with existing algorithms.

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


Passive packet loss measurement employing the IP packet feature extraction technique Performance measurements are indispensable for managing the Internet. Among the performance measurement techniques known, passive measurement is attractive because of its accuracy; user traffic is observed without inserting additional test traffic. However, the technique is handicapped by its large storage and bandwidth costs. This paper proposes a passive packet loss measurement technique that effectively avoids the difficulty of the conventional passive measurement approaches. Its key advance is utilizing the packet feature computed by a hash function. Since the feature can identify a packet with a short length of data, it becomes possible to greatly decrease the storage and bandwidth costs of passive measurements. The paper details the measurement procedure and assesses the design parameters used in the method. In addition, the validity of the proposed method is confirmed through experiments. The experiments also show the advantage of the method over the conventional active measurement.

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

internet
performance
passive measurement
packet loss


Applying fuzzy method to vision-based lane detection and departure warning system As the high growth of population of vehicles, the traffic accidents are becoming more and more serious in recent years. Most occurrences of the car accidents results from the distraction, inattention and driving fatigue of the driver. Hence, in order to avoid the driver being in danger as much as possible. In the lane detection, in order to enhance lane boundary information and to suitable for various light conditions all day, we combine the self-clustering algorithm (SCA), fuzzy C-mean and fuzzy rules to process the spatial information and Canny algorithms to get good edge detection. In the lane departure warning, the system uses instantaneous information from the lane detection to calculate angle relations of the boundaries. The system sends a suitable warning signal to drivers, according to degree different of the departure. These experiments have been successfully evaluated on the PC platform of 3.2-GHz CPU and the average frame rate is up to 14fps.

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

self-clustering algorithm
fuzzy c-mean
lane departure warning system


An integration of fuzzy association rules and WordNet for document clustering With the rapid growth of text documents, document clustering technique is emerging for efficient document retrieval and better document browsing. Recently, some methods had been proposed to resolve the problems of high dimensionality, scalability, accuracy, and meaningful cluster labels by using frequent itemsets derived from association rule mining for clustering documents. In order to improve the quality of document clustering results, we propose an effective Fuzzy Frequent Itemset-based Document Clustering ((FIDC)-I-2) approach that combines fuzzy association rule mining with the background knowledge embedded in WordNet. A term hierarchy generated from WordNet is applied to discover generalized frequent itemsets as candidate cluster labels for grouping documents. We have conducted experiments to evaluate our approach on Classic4, Re0, R8, and WebKB datasets. Our experimental results show that our proposed approach indeed provide more accurate clustering results than prior influential clustering methods presented in recent literature.

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

fuzzy association rule mining
document clustering
frequent itemsets
wordnet


Robust and efficient map-to-image registration with line segments This work investigates map-to-image registration for planar scenes in the context of robust parameter estimation. Registration is posed as the problem of estimating a projective transformation which optimally aligns transformed model line segments from a map with data line segments extracted from an image. Matching and parameter estimation is solved simultaneously by optimizing an objective function which is based on M-estimators, and depends on overlap and the weighted orthogonal distance between transformed model segments and data segments. An extensive series of registration experiments was conducted to test the performance of the proposed parameter estimation algorithm. More than 200 000 registration experiments were run with different objective functions for 12 aerial images and randomly corrupted maps distorted by randomly selected projective transformations.

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

line segments
robust parameter estimation

image registration
map registration
robustness study


Enumerating floorplans with n rooms A plane drawing of a graph is called a floorplan if every face (including the outer face) is a rectangle. A based floorplan is a floorplan with a designated base line segment on the outer face. In this paper we give a simple algorithm to generate all based floorplans with at most n faces. The algorithm uses O(n) space and generates such floorplans in O(1) time per floorplan without duplications. The algorithm does not output entire floorplans but the difference from the previous floorplan. By modifying the algorithm we can generate without duplications all based floorplans having exactly n faces in O(1) time per floorplan. Also we can generate without duplications all (non-based) floorplans having exactly n faces in O(n) time per floorplan.

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

graph's algorithms
plane graphs
plane trees
enumeration
listing


The news is American but our memories are Chinese? Are our memories of the world well described by the international news coverage in our country? If so, sources central to international news may also be central to international recall patterns; in particular, they may reflect an American-centric focus, given the previously proposed central U.S. position in the news marketplace. We asked people of four different nationalities (China, Israel, Switzerland, and the United States) to list all the countries they could name. We also constructed a network representation of the world for each nation based on the co-occurrence pattern of countries in the news. To compare news and memories, we developed a computational model that predicts the recall order of countries based on the news networks. Consistent with previous reports, the U.S. news was central to the news networks overall. However, although national recall patterns reflected their corresponding national news sources, the Chinese news was substantially better than other national news sources at predicting both individual and aggregate memories across nations. Our results suggest that news and memories are related but may also reflect biases in the way information is transferred to long-term memory, potentially biased against the transient coverage of more free presses. We discuss possible explanations for this Chinese news effect in relation to prominent cognitive and communications theories.

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


Automated detection and segmentation of cylindrical fragments from calibrated C-arm images for long bone fracture reduction Long bone fracture belongs to one of the most common injuries encountered in clinical routine trauma surgery. Automated identification, pose and size estimation, and contour extraction of diaphyseal bone fragments can greatly improve the usability of a computer-assisted, fluoroscopy-based navigation system for long bone fracture reduction. In this paper, a two-step solution is proposed. In the first step, the pose and size of a diaphyseal fragment are estimated through a three-dimensional (3D) morphable object-based fitting process using a parametric cylinder model. This fitting process is optimally solved by a hybrid optimization technique coupling a random sample consensus (RANSAC) paradigm and an iterative closest point (ICP) matching procedure. Monte Carlo simulation was used to determine the parameters for the RANSAC paradigm. The results of the fragment detection step are then fed to the second step, where a region information based active contour model is used to extract the fragment contours. We designed and conducted experiments to quantify the accuracy and robustness of the proposed approach. Our experimental results conducted on images of a plastic bone as well as on those of patients demonstrate a promising accuracy and robustness of the proposed approach.

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

long bone fracture reduction
detection
segmentation


Mechanisms of reduction in hole concentration in Al-doped 4H-SiC by electron irradiation From the temperature dependence of the hole concentration in unirradiated lightly Al-doped 4H-SiC epilayers, an Al acceptor with EV+0.2eV, which is an Al atom (AlSi) at a Si sublattice site, and an unknown deep acceptor with EV+0.35eV are found, where EV is the top of the valence band. Both the densities are similar. With irradiation of 0.2MeV electrons the Al acceptor density is reduced, while the unknown deep acceptor density is increased. Judging from the minimum electron energy required to displace a substitutional C atom (Cs) or the AlSi, the bond between the AlSi and its nearest neighbor Cs is broken due to the displacement of the Cs by this irradiation. Moreover, the displacement of the Cs results in the creation of a complex (AlSiVC) of AlSi and a carbon vacancy (VC), indicating that the possible origin of the deep acceptor with EV+0.35eV is AlSiVC.

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

electron irradiation
deep acceptor
reduction in hole concentration


BBN-based software project risk management This paper presents a scheme to incorporate BBNs (Bayesian belief networks) in software project risk management. A theoretical model is defined to provide insights into risk management. Based on these insights, we have developed a BBN-based procedure using a feedback loop to predict potential risks, identify sources of risks, and advise dynamic resource adjustment. This approach facilitates the visibility and repeatability of the decision-making process of risk management. Both analytical and simulated cases are reported.

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

uncertainty
bbn (bayesian belief network)
risk profile


Cross-task portability of a broadcast news speech recognition system This paper reports on experiments of porting the ITC-irst Italian broadcast news recognition system to two spontaneous dialogue domains. Porting was investigated by applying state-of-the-art adaptation methods on acoustic and language models, and by evaluating the trade-off between performance and required amount of task specific annotated data. The use of different levels of supervision for acoustic model adaptation was also studied. By employing 2 It of manually annotated speech, word error rates of 26.0% and 28.4% were achieved by the adapted systems. These results are to be compared with the performance of two domain specific baseline systems, 22.6% and 21.2%, respectively, which were developed on much more training data. Finally, a robust method is presented that allows to tune the insertion of spontaneous speech phenomena by the speech decoder. (C) 2001 Elsevier Science B.V. All rights reserved.

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

acoustic model adaptation
spontaneous speech phenomena


Source Coding With a Side Information "Vending Machine" We study source coding in the presence of side information, when the system can take actions that affect the availability, quality, or nature of the side information. We begin by extending the Wyner-Ziv problem of source coding with decoder side information to the case where the decoder is allowed to choose actions affecting the side information. We then consider the setting where actions are taken by the encoder, based on its observation of the source. Actions may have costs that are commensurate with the quality of the side information they yield, and an overall per-symbol cost constraint may be imposed. We characterize the achievable tradeoffs between rate, distortion, and cost in some of these problem settings. Among our findings is the fact that even in the absence of a cost constraint, greedily choosing the action associated with the "best" side information is, in general, suboptimal. A few examples are worked out.

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

actions
rate distortion
side information
source coding
vending machine


Axial force reduction of a homopolar machine Purpose - The purpose of this paper is to describe the optimization process of a homopolar machine. The work has been focused on a reduction of axial forces acting on the rotor. Design/methodology/approach - A novel machine design has been proposed and a detailed FEM analysis has been performed. Findings - The source of the axial force in the homopolar machine has been indicated and a new method of axial force reduction has been presented. Originality/value - A detailed comparison shows that the applied changes lead to a significant axial force reduction and allow the usage of cheaper and less prone to axial forces bearings.

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

force measurement
stress (materials)
optimization techniques
finite element method


Adaptive multi-bit quantization for hashing We propose an adaptive multi-bit quantization for hashing by fully considering the data distribution. Our method incorporates bit allocation, incomplete binary encoding and clustering-based quantization into a joint framework. Experiments on real datasets demonstrate that our AMBQ method outperforms most of the state-of-art methods.

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

image retrieval
multi-bit quantization
incomplete coding
k-means clustering


Random Walks on Graphs for Salient Object Detection in Images We formulate the problem of salient object detection in images as an automatic labeling problem on the vertices of a weighted graph. The seed (labeled) nodes are first detected using Markov random walks performed on two different graphs that represent the image. While the global properties of the image are computed from the random walk on a complete graph, the local properties are computed from a sparse k-regular graph. The most salient node is selected as the one which is globally most isolated but falls on a locally compact object. A few background nodes and salient nodes are further identified based upon the random walk based hitting time to the most salient node. The salient nodes and the background nodes will constitute the labeled nodes. A new graph representation of the image that represents the saliency between nodes more accurately, the "pop-out graph" model, is computed further based upon the knowledge of the labeled salient and background nodes. A semisupervised learning technique is used to determine the labels of the unlabeled nodes by optimizing a smoothness objective label function on the newly created "pop-out graph" model along with some weighted soft constraints on the labeled nodes.

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


VDMOSFET model parameter extraction based on electrical and optical measurements Lateral device parameters for VDMOSFET (Vertical Double Diffused Metal Oxide Semiconductor Field Effect Transistor) with hexagonal cells are extracted using an original method based on electrical and optical measurements. Using microscopic observation of the ship of the device and CV characterization, the lateral device structure parameters could be extracted. Values of the extracted parameters are in good agreement with the values given by the manufacturer. The advantage of this method is the high precision of results for a low cost. Perhaps the most important point of this method is that it can replace the other techniques usually employed, wherein devices are destroyed to obtain the cross section of the structure. The proposed technique can be very useful for analyzing any complex geometrical structure of VDMOS transistors (hexagonal, triangular, square etc).

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

vertical double diffused metal oxide semiconductor field effect transistor


RNS architectures for the implementation of the 'diagonal function' The 'diagonal function' is a new tool for performing non-modular operations in the Residue Number System (RNS). It is defined from the RNS to the integers and exploits the geometrical disposal in multi-dimensional discrete spaces of integers in residue representations. This paper presents a new class of RNS architectures for the effective implementation of the 'diagonal function'. The architectures are general, since they do not impose constraints on the set of moduli, and flexible, since they can be best suited depending on specific system requirements. The superiority of the new architectures with respect to traditional approaches is shown in terms of waste of hardware and time delay. (C) 2000 Elsevier Science 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 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

computer architecture
parallel processing


An immunological approach to mobile robot reactive navigation In this paper, a reactive immune network (RIN) is proposed and employed for mobile robot navigation within unknown environments. Rather than building a detailed mathematical model of artificial immune systems, this study tries to explore the principle in an immune network focusing on its self-organization, adaptive learning capability, and immune feedback. In addition, an adaptive virtual target method is integrated to solve the local minima problem in navigation. Several trapping situations designed by the early researchers are adopted to evaluate the performance of the proposed architecture. Simulation results show that the mobile robot is capable of avoiding obstacles, escaping traps, and reaching the goal efficiently and effectively.

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

mobile robot navigation
reactive immune network
adaptive virtual target method
local minima problem


Classification of human motion based on affective state descriptors Human body movements and postures carry emotion-specific information. On the basis of this motivation, the objective of this study is to analyze this information in the spatial and temporal structure of the motion capture data and extract features that are indicative of certain emotions in terms of affective state descriptors. Our contribution comprises identifying the directly or indirectly related descriptors to emotion classification in human motion and conducting a comprehensive analysis of these descriptors (features) that fall into three different categories: posture descriptors, dynamic descriptors, and frequency-based descriptors in order to measure their performance with respect to predicting the affective state of an input motion. The classification results demonstrate that no single category is sufficient by itself; the best prediction performance is achieved when all categories are combined. Copyright (c) 2013 John Wiley & Sons, Ltd.

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


A novel software key container in on-line media services Due to the explosive growth of the Internet and the pervasion of multimedia, protection of IP rights of digital content in transactions induces peoples concerns. For fee-based media services, data encryption may be the best solution for protection of the media. The encryption (decryption) keys placement may be a trivial but crucial issue for users. It is a significant issue that how to practically protect users key with the password-based cryptographic scheme and at different security levels. Nowadays, key container storing users key can be implemented by hardware or software-only. Unfortunately, the hardware key containers require expensive infrastructure; On the other hand, the software-only key containers are either insecure or impractical. Moreover, both of the hardware and software just store users key with the single security level. To solve these problems, we propose a novel software key container in on-line media services that can provide an adaptively secure and practical solution to protect users key. We use a human-trapdoor distortion function and symmetric cipher to protect users key in our key container so that it is computationally infeasible to break the system by using machine attack alone. The idea is to ensure that people must participate to verify each guessed password in the attack. User can adjust the security level of container according to the security requirement. Therefore, the attacker cannot succeed to extract users key within a reasonable time and budget.

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


Persistence temperament associated with children playing math games between touch panel and embodied interaction The different designs of various interactive gaming controllers affect posture and muscle loading of the body. It is assumed that prolonged exposure to the interactive gaming controllers can affect the effectiveness in using the game for the purposes of learning. This study explores the differences in behavioural responses among students with different temperaments regarding mathematic gameplay by comparing the touch-based and gesture-based interactive devices. The experiment was designed for 119 5-year-old kindergarten children, and valid data from 99 individuals were analysed for this study. The results indicated that participants in the touch-based interaction (TBI) groups performed better than the participants in the gesture-based interaction (GBI) groups with respect to numerical counting in both games. The results also showed that among all dimensions of temperaments, only persistence had a positive correlation to TBI. This implied that TBI was preferred over GBI for kindergarten children. Accordingly, e-learning designers should place more emphasis on TBI.

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

gesture-based interaction
learning behaviour


Good recognition is non-metric A thorough and critical review of the most recent literature in metric learning and related fields. A new general definition of recognition that is not restricted to pair matching. An extensive meta-analysis of metric learning on Caltech 101 and Labeled Faces in the Wild. An experimental evaluation of top performing metric and non-metric algorithms. A series of useful recommendations, based on our results, for recognition algorithm designs.

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

machine learning
computer vision
face recognition
object recognition


High-Precision Real-Time Premature Ventricular Contraction (PVC) Detection System Based on Wavelet Transform This study presents a high-precision real-time detection system to detect arrhythmia of premature ventricular contraction (PVC). This system detects the peak of the R-wave based on wavelet transform (WT) and then uses a new algorithm to detect PVC. The proposed PVC detection algorithm combines the sum of trough and sum of R_peak with minimum to detect PVC. A crucial function of morbid warning is implemented in this system so that users receive an alert signal when PVC is detected. The proposed system is simulated and verified using the MIT-BIH Arrhythmia Database (mitdb). The system is also implemented by FPGA to illustrate its high precision and real-time performance.

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


Radio resource management of self-organizing OFDMA wireless mesh networks Mesh networks with universal frequency reuse is expected to play an important role for future wireless system architecture, to provide ultra high throughput and seamless access via cooperative base stations (BSs), relays, and users. Different from traditional networks with central control, BSs should operate in a self-organizing way (i) to support stable high-throughput green communications (ii) to avoid inter/intra cell interference, and (iii) to implement in an ease and backward compatible way; and resource management is thus a critical step to satisfy (i), (ii), and (iii). We first systematically present radio resource management based on extensive literature survey. To optimize system performance, we develop the cognitive resource management for wireless mesh networks with self-organizing BSs to utilize entire available spectrum, while BSs collect channel state information of each user by spectrum sensing. From numerical results, our resource management can significantly improve network throughput over the benchmark system, which suggests good potential for many wireless systems such as LTE-A and WiMAX 2 that are adopting mesh network architecture, to achieve universal frequency reuse. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

frequency reuse
mesh
ofdma
radio resource management


Job submission to grid computing environments The problem of enabling scientist users to submit jobs to grid computing environments will eventually limit the usability of grids. The eMinerals project has tackled this problem by developing the 'my-condor-submit' (MCS) tool, which provides a simple scriptable interface to Globus, a flexible interaction with the storage resource broker, metascheduling with load balancing within a grid environment, and automatic metadata harvesting. This paper provides an overview of MCS together with a use case. We also describe the use of MCS within parameter-sweep studies. Copyright (c) 2008 John Wiley & Sons, Ltd.

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


Scenery image recognition and interpretation using fuzzy inference neural networks In this paper, we propose a new image recognition and interpretation system. The proposed system is composed of three processes: (1) regional segmentation process; (2) image recognition process; and (3) image interpretation process. As a pre-processing in the regional segmentation process, an input image is divided into some proper regions using techniques based on K-means algorithm. In both the image recognition and the interpretation processes, fuzzy inference neural networks (FINNs) working in parallel are employed to achieve a high level of recognition and interpretation. Scenery images are used and it is confirmed that the system has an average of 71.9% accuracy rate in the recognition process and good results in the interpretation process without heuristic knowledge. In addition, it is also confirmed that the proposed system has an ability to extract proper rules for the image recognition and interpretation.

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

fuzzy inference
scenery image
image recognition


The structure of argument patterns on a social Q&A site This study investigates the argument patterns in Yahoo! Answers, a major question and answer (Q&A) site. Mainly drawing on the ideas of Toulmin (2003), argument pattern is conceptualized as a set of 5 major elements: claim, counterclaim, rebuttal, support, and grounds. The combinations of these elements result in diverse argument patterns. Failed opening consists of an initial claim only, whereas nonoppositional argument pattern also includes indications of support. Oppositional argument pattern contains the elements of counterclaim and rebuttal. Mixed argument pattern entails all 5 elements. The empirical data were gathered by downloading from Yahoo! Answers 100 discussion threads discussing global warminga controversial topic providing a fertile ground for arguments for and against. Of the argument patterns, failed openings were most frequent, followed by oppositional, nonoppositional, and mixed patterns. In most cases, the participants grounded their arguments by drawing on personal beliefs and facts. The findings suggest that oppositional and mixed argument patterns provide more opportunities for the assessment of the quality and credibility of answers, as compared to failed openings and nonoppositional argument patterns.

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


Functional tolerancing: Virtual material condition on complex junctions In industry, functional tolerancing of mechanisms is today more and more based on ISO GPS (Geometrical Product Specification) and ASME standards. In this context, the CLIC method (French acronym for "Cotation en Localisation avec Influence des Contacts") has been developed in our laboratory since 1998. The method describes the complete process involved in functional tolerancing. The three dimensional calculation of the result of tolerance chain is formulated functions of tolerances and offsets of surfaces, based on transfer by tolerance zone or by virtual boundary. However, the current standards are incomplete to specify complex junctions, for example to respect a minimum clearance. The paper outlines that the independence principle does not permit to limit the orientation inside location zone in particular case with floating datum reference frame. Then, two main contributions are developed, the extension of material conditions on complex surfaces and the definition of a new association criterion in order to specify hybrid prismatic surfaces with a surface contact zone and a zone with clearance. In this aim, the paper advises six propositions as possible extension of standards of tolerancing. (C) 2011 Elsevier B.V. All rights reserved.

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

functional dimensioning and tolerancing
tolerance analysis
gps standards
complex links


Finite element analysis of the effects of radial expansion of corroded reinforcement A finite element (FE) model of the effects of corroding reinforcement on the surrounding concrete was validated against the results of simulated corrosion tests in which internal pressure was applied to holes cast in concrete. The model was then used to explore the effects of bar radial expansion, due to the formation of corrosion products, on the cracking of cover concrete. The predictions were compared with test results from reinforced concrete accelerated corrosion specimens. The aim of the analytical investigation was to reveal the mechanism for the development of concrete cracking due to the corrosion of reinforcement. The three-dimensional physical specimens were idealised as two-dimensional analytical models under a plane strain assumption. Corrosion of reinforcement was modelled as either an internal pressure or a radial expansion to analyse the results of simulated and accelerated corrosion specimens, respectively. The FE analytical results indicate that the radial expansion of corroded reinforcement causes concrete cover to crack in four different stages: internal cracking, external cracking, penetration cracking and ultimate-cracking. It was also found that the FE analytical results could be used to explain qualitatively the experimentally determined relationship between amount of corrosion for concrete cracking and ratio of concrete cover to bar diameter, as well as that between reinforcement bond strength and amount of corrosion.

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

corrosion of reinforcement
radial expansion
concrete cracking


Blackman-type windows for sampling series The aim of this paper is to study the Blackman-type sampling series. In Signal Analysis the Blackman window has been used over 40 years [1], [4]. Main goal of this paper is to present a mathematical treatment of approximation problems by the Blackman-type sampling series. We considered cases when we have a very good order of approximation. In some cases we are able to compute exact values of those operator norms.

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

blackman window function
blackman kernel


Rectilinear paths with minimum segment lengths Given a set of n n open rectangles that represent obstacles in the Euclidean plane, we consider the problem of finding a shortest rectilinear path between two given points such that each segment of the path has a certain minimum length. A rectilinear path consists of horizontal and vertical segments only and may not intersect with an obstacle. We show how to solve the resulting shortest path problem with minimum segment lengths in polynomial time by constructing an extended Hanan grid of the instance first, and then run an adapted shortest path algorithm to find a respective solution. While the extended Hanan grid as basic underlying structure can be stored in O(n2) O ( n 2 ) space, the approach yields an O(n4logn) O ( n 4 log n ) time and O(n4) O ( n 4 ) space algorithm. The problem at hand typically arises in the area of VLSI design, where rectilinear paths are utilized to create wiring interconnects. There, the lithographic production process dictates certain minimum run lengths for the wires in order to avoid infeasible patterns. Another application arises in robot motion planning when acceleration and breaking distances need to be obeyed.

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


Self-developing fuzzy expert system: a novel learning approach, fitting for manufacturing domain The foremost challenge faced by expert systems, for their applicability to real world problems, is their inherent deficiency of dynamism. For an expert system to be more pragmatic and applicable, the whole structure of an expert system-including rule-base, fuzzy sets, and even user-interface-needs to be upgraded continuously. This continuous up gradation demands full-time, repetitive, and cumbersome involvement of knowledge engineers. Machine learning is an answer to this problem, but unfortunately, the solutions that have been provided are limited in scope. For example, most of the researchers put forward techniques of either generating just rules from data, or self-expanding and self-correcting knowledge-base only. The innovative approach presented in this paper is broader in scope. It enhances the efficacy and viability of expert systems to be more capable of coping with dynamic and ever-changing industrial environments. The objective is facilitated by rendering, concurrently, the self-learning, self-correcting, and self-expanding abilities to the expert system, without requiring knowledge engineering skills of the developers. This means that the user needs just to feed data in form of the values of input/output variables and the complete development of expert system is done automatically. The superiority of the proposed expert system, regarding its continuous self-development, has been explained with the help of three examples related to prediction and optimization of milling and welding processes.

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


Measurement-based admission control at edge routers It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality of service (QoS). In this paper, we develop a scalable architecture and an algorithm for admission control of real-time flows. Since individual management of each traffic flow on each transit router can cause a fundamental scalability problem in both data and control planes, we consider that each flow is classified at the ingress router and data traffic is aggregated according to the class inside the core network as in a DiffServ framework. In our approach, admission decision is made for each flow at the edge (ingress) routers, but it is scalable because per-flow states are not maintained and the admission algorithm is simple. In the proposed admission control scheme, an admissible bandwidth, which is defined as the maximum rate of a flow that can be accommodated additionally while satisfying the delay performance requirements for both existing and new flows, is calculated based on the available bandwidth measured by edge routers. The admissible bandwidth is a threshold for admission control, and thus : it is very important to accurately estimate the admissible bandwidth. The performance of the proposed algorithm is evaluated by taking a set of simulation experiments using bursty traffic flows.

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

admissible bandwidth
admission control
available bandwidth


Advanced optimal tolerance design of mechanical assemblies with interrelated dimension chains and process precision limits Tolerance design is an important step in product development. The topic has been under extensive research, which has resulted in several formulations and solution algorithms for systematic tolerance design considering various aspects. An optimal tolerance design problem involving alternative manufacturing processes for realization of a dimension can be referred to as the advanced tolerance design problem, where the optimal selection of a set of manufacturing processes is also considered in addition to the optimal set of tolerances. Such a nonlinear multivariate optimal tolerance design problem results in a non-convex combinatorial solution surface. Optimal solution of the advanced tolerance design problem is difficult with the traditional optimization techniques. The problem becomes more complex with the assemblies involving interrelated dimension chains, and manufacturing processes bracketed by precision bounds. The focus of this work is on the optimal solution of the aforementioned advanced tolerance design problem. Genetic algorithm, a non-traditional global optimization technique has been proposed as the solution methodology for its inherent advantages. Application of the methodology has been demonstrated with the help of suitable examples. Concept of the set up reduction constraints has also been introduced, wherein all the similar dimensions on a single part are manufactured on a single machine, resulting in a single value of design tolerance associated to all such dimensions. (C) 2004 Published by Elsevier B.V.

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


Polynomial models of gene dynamics Through microarray technology a large amount of gene expression data is available for analysis. Different approaches to modeling have been proposed. It has been observed that genetic regulatory networks share many characteristics with Boolean networks such as periodicity, self-organization, etc. Moreover, it is also a known fact that in these networks, most genes are governed by Canalizing Boolean functions. However, the actual gene expression level measurements are continuous valued. To combine discrete and continuous aspects, Zhegalkin Polynomials can be used as continuous representations of Boolean functions. The requirement for the Boolean function to be canalizing can be extended to continuous functions by demanding monotonicity with respect to at least the canalizing variable. In this paper it is proven that Canalizing Zhegalkin Polynomials observe this monotonicity property. Moreover, for correct handling of normalized data it is shown that the value of a Zhegalkin Polynomial also lies within the unit interval as long as the values of its input variables also do so.

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

genetic networks
forcing functions
canalizing functions


Derivative free algorithm for solving nonlinear equations In this work, we develop a simple yet practical algorithm for constructing derivative free iterative methods of higher convergence orders. The algorithm can be easily implemented in software packages for achieving desired convergence orders. Convergence analysis shows that the algorithm can develop methods of various convergence orders which is also supported through the numerical work. Computational results ascertain that the developed algorithm is efficient and demonstrate equal or better performance as compared with other well known methods.

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

iterative methods
convergence
algorithm
software
derivative free


An incremental algorithm for constructing shortest watchman routes (vol 3, pg 351, 1993) This corrigendum fixes an error that appears in the previously published papers concerning the watchman route problem. A modification to our incremental watchman route algorithm previously presented in this journal is made, which gives an O(n(4)) time solution to the watchman route problem.

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

algorithms
adjustments
dynamic programming


A multiresolution clinical decision support system based on fractal model design for classification of histological brain tumours Tissue texture is known to exhibit a heterogeneous or non-stationary nature; therefore using a single resolution approach for optimum classification might not suffice. A clinical decision support system that exploits the subbands textural fractal characteristics for best bases selection of meningioma brain histopathological image classification is proposed. Each subband is analysed using its fractal dimension instead of energy, which has the advantage of being less sensitive to image intensity and abrupt changes in tissue texture. The most significant subband that best identifies texture discontinuities will be chosen for further decomposition, and its fractal characteristics would represent the optimal feature vector for classification. The performance was tested using the support vector machine (SVM), Bayesian and k-nearest neighbour (kNN) classifiers and a leave-one-patient-out method was employed for validation. Our method outperformed the classical energy based selection approaches, achieving for SVM, Bayesian and kNN classifiers an overall classification accuracy of 94.12%, 92.50% and 79.70%, as compared to 86.31%, 83.19% and 51.63% for the co-occurrence matrix, and 76.01%, 73.50% and 50.69% for the energy texture signatures; respectively. These results indicate the potential usefulness as a decision support system that could complement radiologists diagnostic capability to discriminate higher order statistical textural information; for which it would be otherwise difficult via ordinary human vision.

O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 improved EZ-GCD algorithm for multivariate polynomials The EZ-GCD algorithm often has the bad-zero problem, which has a remarkable influence oil polynomials with higher-degree terms. In this paper, by applying special ideals, the EZ-GCD algorithm for sparse polynomials is improved. This improved algorithm greatly reduces Computational complexity because of the sparseness of polynomials. The author expects that the use of these ideals will be useful as a resolution for obtaining a GCD of sparse multivariate polynomials with higher-degree terms. (C) 2008 Elsevier Ltd. All rights reserved.

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


Evaluating metaphor reification in tangible interfaces Metaphors are a powerful conceptual device to reason about human actions. As such, they have been heavily used in designing and describing human computer interaction. Since they can address scripted text, verbal expression, imaging, sound, and gestures, they can also be considered in the design and analysis of multimodal interfaces. In this paper we discuss the description and evaluation of the relations between metaphors and their implementation in human computer interaction with a focus on tangible user interfaces (TUIs), a form of multimodal interface. The objective of this paper is to define how metaphors appear in a tangible context in order to support their evaluation. Relying on matching entities and operations between the domain of interaction and the domain of the digital application, we propose a conceptual framework based on three components: a structured representation of the mappings holding between the metaphor source, the metaphor target, the interface and the digital system; a conceptual model for describing metaphorical TUIs; three relevant properties, coherence, coverage and compliance, which define at what extent the implementation of a metaphorical tangible interface matches the metaphor. The conceptual framework is then validated and applied on a tangible prototype in an educational application.

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

human computer interaction
metaphor
tangible interface


Black-box model identification for a continuously variable, electro-hydraulic semi-active damper This paper discusses the black-box identification of a continuously variable, electro-hydraulic semi-active damper for a passenger car. A neural network based output error (NNOE) model structure is selected to describe the complex nonlinear damper dynamics. This model structure is able to accurately and efficiently describe the dynamic damper behaviour, and is appropriate for full vehicle simulation. The identification procedure includes optimal experiment design, regression vector selection and model parameter estimation. The damper excitation signals are optimized multisines that yield uniform coverage of the achievable working range of the damper. A state of the art iterative procedure is used to concurrently estimate the model parameters and select an optimal set regression vector elements. Experimental validation of the proposed procedure shows that models identified from the data measured using the optimized excitations are considerably more accurate than those identified from data obtained using conventional random phase multisine excitations.

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

semi-active damper
vehicle suspension
nonlinear system
neural network model


Parallel multigrid algorithms based on generic approximate sparse inverses: an SMP approach New parallel computational techniques are introduced for the parallelization of Generic Approximate Sparse Inverse multigrid methods, based on Portable Operating System Interface for UniX (POSIX) threads, for multicore systems. Parallelization of the Generic Approximate Sparse Inverse Matrix (GenAspI) algorithm is achieved based on a new computational approach, namely strip, which utilizes the data independence of the rows assigned in each available processor. Additionally, new parallel computational techniques are proposed for the parallelization of a modified multigrid V-Cycle method, based on POSIX Threads, for multicore systems. The modified V-Cycle utilized a Parallel PGenAspI Preconditioned Bi-Conjugate Gradient STABilized (BiCGSTAB) as a coarse solver to ensure better parallel performance of the multigrid method. For parallelization purposes, a replication of the multigrid method function is executed on each processor with different index bands and with proper synchronization points to ensure less thread-creation overhead and to maximize parallel performance. Theoretical estimates on speedups and efficiency are also presented. Finally, numerical results for the performance of the PGenAspI algorithm and the PGenAspIMGV method for solving classical two-dimensional boundary value problems on multicore computer systems are presented. The implementation issues of the proposed method are also discussed using POSIX threads on multicore systems.

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

parallel generic sparse approximate inverse matrix algorithms


Multiresolution approximation scale and time-shift subspaces Multiresolution Approximation subspaces are L-2(R)-subspaces defined for each scale over all time shifts, i.e., "scale subspaces", while with respect to a given wavelet, the signal space L-2(R) not only admits orthogonal scale subspaces basis, but orthogonal "time shift subspaces" basis as well. It is therefore natural to expect both scale subspaces and time shift subspaces to play a role in Wavelet Theory and, in particular, in Multiresolution Approximation as well. This is what will be discussed in the paper.

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

wavelet
multiresolution approximation scale


Symbolization of generating functions; an application of the Mullin-Rota theory of binomial enumeration We have found that there are more than a dozen classical generating functions that could be suitably symbolized to yield various symbolic sum formulas by employing the Mullin-Rota theory of binomial enumeration. Various special formulas and identities involving well-known number sequences or polynomial sequences are presented as illustrative examples. The convergence of the symbolic summations is discussed. (c) 2007 Elsevier Ltd. All rights reserved.

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

generating function
symbolic sum formula
shift-invariant operator
delta operator
bell number
genocchi number
euler number
euler polynomial
eulerian fraction
bernoulli number
bernoulli polynomial


HISNs: Distributed gateways for application-level integration of heterogeneous wireless networks Integration of different kinds of wireless networks to provide people seamless and continuous network access services is a major issue in the B3G network. In this paper, we propose and implement a novel Heterogeneous network Integration Support Node design (HISN) and a distributed HISN network architecture for the integration of heterogeneous networks, under which the Session Mobility, Personal Mobility, and Terminal Mobility for mobile users can be maintained through the Session Management mechanism. Thus, the HISN node can serve as an agent for the user to access Internet services independent of underlying communication infrastructure. Our design is transparent to the bearer networks and the deployment of the HISN network does not need to involve the operators of the heterogeneous wireless networks.

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

heterogeneous networks
personal mobility
session mobility

heterogeneous network integration support node (hisn)


Surfactant Protein D Binds Genomic DNA and Apoptotic Cells, and Enhances Their Clearance, in Vivo Collectins, such as surfactant protein D (SP-D), bind apoptotic cells; however, the ligands that they recognize on these cells are unknown. We hypothesized that SP-D binds to the DNA present on these cells. We show that SP-D binds and aggregates mouse alveolar macrophage DNA effectively. Alveolar macrophages of SP-D(?/?) mice contained more nicked DNA than those of SP-A(?/?) and wild type mice. Our results also suggest that carbohydrate recognition domains of SP-D may recognize DNA present on the apoptotic cells. Therefore, cell-surface DNA could be a ligand for recognition of apoptotic cells by collectins.

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

surfactant protein d
alveolar macrophages


agents assisted software project management The market opportunities for the field of software engineering have been on the rise for the last three decades. This field of engineering is relatively new and the management of projects in this field, though experiencing greater degrees of assistance from tools, still requires improvements. We present here details of our experiments on how the multi-agent technology can be used to improve the productivity and quality of software project management (SPM) process. We have picked up the quality review management sub-process of SPM and described its modeling using GAIA and its implementation using the JADE framework. We also present a case study and the productivity and quality improvements observed.

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

productivity and quality improvements
software project management


Spatial multiplexing for high capacity transport Spatial multiplexing provides a solution for fiber capacity increase beyond the limits foreseen for enhanced bandwidth efficiency by higher order modulation and more channels by additional wavelength bands in long haul optical transmission. Its adoption also offers potential for a reduction of the cost and energy per transmitted bit. Two fiber types have been identified as candidates for transmission of multiple signals at the same wavelength inside a single cladding: fibers with multiple single mode cores and single core multi-mode fibers. Major challenges arise from the coupling of signals along the transmission path. Multiple input/multiple output signal processing may provide a solution for the separation of signals at the end of the link. Concepts such as tapers in case of multi-core fibers and field transformation in case of single core multi-mode fibers exist to provide the spatial multiplexing and demultiplexing functions. The potential of spatial multiplexing for cost and energy efficiency can only be realized, if optical amplifiers are found which are capable of processing all channels simultaneously. Concepts for such amplifiers were analyzed with promising results. Direct pumping of the cores leads to acceptable power requirements of lumped erbium-doped as well as distributed Raman amplifiers.

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

fiber optical communication
multi-core fiber
multi-mode fiber
optical amplification


refinement criteria for high fidelity interactive walkthroughs Physically based global illumination rendering at interactive frame rates would enable users to navigate within complex virtual environments, such as archaeological models. These algorithms, however, are computationally too demanding to allow interactive navigation on current PCs. A technique based on image subsampling and spatiotemporal coherence among successive frames is exploited, while resorting to progressive refinement whenever there is available computing power. A physically based ray tracer (Radiance) is used to compute reflected radiance at the model's triangles vertices. Progressive refinement is achieved increasing the sampling frequency by subdividing certain triangles and requesting shading information for the resulting vertices. This paper proposes and evaluates different criteria for selecting which triangles to subdivide. A random criterium and two criteria based on Normalized Luminance Differences are evaluated: one operating on image space, the other on object space. Results, obtained with a model of an old roman town, show that the object space criterium is able to locate and represent visual discontinuities, such as shadows, and does so requiring less triangle subdivisions than the other two.

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

ray tracing
asynchronous rendering
interactive walkthrough


Ab initio study of mechanism of forming a spiro-heterocyclic ring compound with Si and Ge between dimethylsilylene germylidene (Me2Si = Ge:) and acetone The mechanism of the cycloaddition reaction between singlet state dimethylsilylene germylidene (Me2Si = Ge:) and acetone has been investigated with CCSD(T)//B3LYP/6-31G* method. From the potential energy profile, it could be predicted that the reaction has one dominant reaction pathway. The reaction rules presented are that the two reactants first form a Si-heterocyclic four-membered ring germylene through the [2 + 2] cycloaddition reaction. Because of the 4p unoccupied orbital of Ge atom in the Si-heterocyclic four-membered ring germylene and the pi orbital of acetone forming a pi -> p donor-acceptor bond, the Si-heterocyclic four-membered ring germylene further combines with acetone to form an intermediate. Because the Ge atom in the intermediate happens sp(3) hybridization after transition state, then, the intermediate isomerizes to a spiro-heterocyclic ring compound with Si and Ge via a transition state.

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


On sum coloring and sum multi-coloring for restricted families of graphs We consider the sum coloring (chromatic sum) problem and the sum multi-coloring problem for restricted families of graphs. In particular, we consider the graph classes of proper intersection graphs of axis-parallel rectangles, proper interval graphs, and unit disk graphs. All the above-mentioned graph classes belong to a more general graph class of (k + 1)-clawfree graphs (respectively, for k = 4, 2, 5). We prove that sum coloring is NP-hard for penny graphs and unit square graphs which implies NP-hardness for unit disk graphs and proper intersection graphs of axis-parallel rectangles. We show a 2-approximation algorithm for unit square graphs, with the assumption that the geometric representation of the graph is given. For sum multi-coloring, we confirm that the greedy first-fit coloring, after ordering vertices by their demands, achieves a k-approximation for the preemptive version of sum multi-coloring on (k + 1)-clawfree graphs. Finally, we study priority algorithms as a model for greedy algorithms for the sum coloring problem and the sum multi-coloring problem. We show various inapproximation results under several natural input representations. (C) 2011 Elsevier B.V. All rights reserved.

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

sum coloring
greedy algorithms
unit disk graphs
interval graphs

sum multi-coloring
approximation algorithms
priority lower bound
graph algorithms
np-hardness
geometric intersection graphs
clawfree graphs


an object-oriented framework for interactive data graphics Ida is an object-oriented framework for interactive data graphics. It can be used for independent data examination or integrated into application user interfaces. Ida's model of graphics is composed of five basic elements: Presentations, Assemblies, Data Sources, Data Displays , and Scales . Presentations and assemblies address display layout. A sharp distinction is maintained between drawing and the management of already drawn images. Data sources are responsible for drawing while data displays are image managers. Data displays are complex structures consisting of multiple layers that may be larger than the visible regions they underlie. Scales represent coordinate transformations. An object-oriented architecture proves valuable in supporting taxonomic hierarchies with inheritance, part-whole structures for composition, message passing implementation of graphic operations and late attribute binding.

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

drawing layout graphics hierarchies model management inheritance architecture implementation data image binding display

coordination
present
applications
addressing
attributes
imaging
object-oriented
compositing
interaction
object-oriented framework
region
operability
user interface
layer
message-passing
assemblers
complexity
integrability


towards fine-grained and application-centric access control for wireless sensor networks The emerging reality of wireless sensor networks deployed as long-lived infrastructure required to serve multiple applications necessitates the development of fine-grained security support. Specifically, to allow sensor nodes to participate in multiple concurrent applications, access control is required on a per-application basis. This paper presents a policy-driven security architecture for wireless sensor networks that addresses the concern of fine-grained access control and secure deployment of security policies, while respecting the resource-constrained nature of wireless sensor networks. A prototype of this system has been realized and evaluated using the LooCI component model and the Sun SPOT sensor network platform.

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

component models
policy-based management


gestalt theory, engagement and interaction This paper presents a design exploration research project in which principles derived from Gestalt theory were applied as a framework for guiding human-computer interaction (HCI). The analysis contained within examines how a Gestalt approach to HCI can be used to enhance engagement and promote user interaction. The concepts discussed in this analysis are supported by a series of informal user observations.

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


Clustering data streams using grid-based synopsis Continually advancing technology has made it feasible to capture data online for onward transmission as a steady flow of newly generated data points, termed as data stream. Continuity and unboundedness of data streams make storage of data and multiple scans of data an impractical proposition for the purpose of knowledge discovery. Need to learn structures from data in streaming environment has been a driving force for making clustering a popular technique for knowledge discovery from data streams. Continuous nature of streaming data makes it infeasible to look for point membership among the clusters discovered so far, necessitating employment of a synopsis structure to consolidate incoming data points. This synopsis is exploited for building clustering scheme to meet subsequent user demands. The proposed Exclusive and Complete Clustering (ExCC) algorithm captures non-overlapping clusters in data streams with mixed attributes, such that each point either belongs to some cluster or is an outlier/noise. The algorithm is robust, adaptive to changes in data distribution and detects succinct outliers on-the-fly. It deploys a fixed granularity grid structure as synopsis and performs clustering by coalescing dense regions in grid. Speed-based pruning is applied to synopsis prior to clustering to ensure currency of discovered clusters. Extensive experimentation demonstrates that the algorithm is robust, identifies succinct outliers on-the-fly and is adaptive to change in the data distribution. ExCC algorithm is further evaluated for performance and compared with other contemporary algorithms.

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

synopsis
grid structure
complete clustering

stream clustering
micro-cluster
exclusive clustering


Level set based robust shape and topology optimization under random field uncertainties A robust shape and topology optimization (RSTO) approach with consideration of random field uncertainty in loading and material properties is developed in this work. The proposed approach integrates the state-of-the-art level set methods for shape and topology optimization and the latest research development in design under uncertainty. To characterize the high-dimensional random-field uncertainty with a reduced set of random variables, the Karhunen-Loeve expansion is employed. The univariate dimension-reduction (UDR) method combined with Gauss-type quadrature sampling is then employed for calculating statistical moments of the design response. The combination of the above techniques greatly reduces the computational cost in evaluating the statistical moments and enables a semi-analytical approach that evaluates the shape sensitivity of the statistical moments using shape sensitivity at each quadrature node. The applications of our approach to structure and compliant mechanism designs show that the proposed RSTO method can lead to designs with completely different topologies and superior robustness.

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

topology optimization
level set methods
uncertainty
random field

robust design
shape optimization
dimension reduction


Identifying genes of gene regulatory networks using formal concept analysis In order to understand the behavior of a gene regulatory network, it is essential to know the genes that belong to it. Identifying the correct members ( e. g., in order to build a model) is a difficult task even for small subnetworks. Usually only few members of a network are known and one needs to guess the missing members based on experience or informed speculation. It is beneficial if one can additionally rely on experimental data to support this guess. In this work we present a new method based on formal concept analysis to detect unknown members of a gene regulatory network from gene expression time series data. We show that formal concept analysis is able to find a list of candidate genes for inclusion into a partially known basic network. This list can then be reduced by a statistical analysis so that the resulting genes interact strongly with the basic network and therefore should be included when modeling the network. The method has been applied to the DNA repair system of Mycobacterium tuberculosis. In this application, our method produces comparable results to an already existing method of component selection while it is applicable to a broader range of problems.

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

component selection
formal concept analysis
gene regulatory networks
mycobacterium tuberculosis


A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming In this paper, ellipsoidal estimations are used to track the central path of linear programming. Ahigher-order interior-point algorithm is devised to search the optimizers along the ellipse. The algorithm is proved to be polynomial with the best complexity bound for all polynomial algorithms and better than the best known bound for higher-order algorithms.

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

arc-search
interior-point method
polynomial algorithm


Wave atoms based compression method for fingerprint images This paper proposes a new fingerprint image compression approach where the quality of the decoded image is perceptually controlled using wave atom transform. A comparative study of different transforms shows that wave atom transform is more appropriate than wavelets for fingerprint image compression. A new image quality metric based on the same transform is proposed to control the compression performance. Some properties of the human visual system are exploited in the design of the proposed image quality metric. Simulations show that this metric correlates well with the subjective human judgment. Based on these interesting results a compression method with a perceptual distortion control mechanism specific to fingerprint images is developed. Finally, the performance of the proposed compression scheme is evaluated in terms of fingerprint recognition rate. The experimental results clearly show that the proposed strategy offers better results than some traditional compression methods.

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

biometrics
fingerprint compression
image quality metric (iqm)
ridgelets
curvelets
wavelet scalar quantization (wsq)
human visual system (hvs)


Metrics for evaluating performance in document analysis: application to tables Is an algorithm with high precision and recall at identifying table-parts also good at locating tables? Several document analysis tasks require merging or splitting certain document elements to form others. The suitability of the commonly used precision and recall for such division/aggregation tasks is arguable, since their underlying assumption is that the granularity of the items at input is the same as at output. We propose a new pair of evaluation metrics that better suit document analysis' needs and show their application to several table tasks. In the process, we present a number of robust table location algorithms with which we draw a road-map for creating Hidden Markov Models for the task.

B O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 I O O O O O O O O O O O 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 assessment of intelligent distributed systems through software performance ontology engineering (SPOE) In the computer science community there is a growing interest in the field of Ambient Intelligent Systems. This systems surround their human users with computing and networking technology unobtrusively embedded in their environment. This technology is aimed to provide the users with useful information and to take action to make the environment more convenient for them. As the number of users increases the resources that make Ambient Intelligence possible can be easily saturated making the system unstable and projecting an image of poor QoS to the users. The main goal of this paper is to provide the means for the Ambient Intelligent Systems to monitor themselves and take corrective action automatically if performance starts to drop. Our approach uses a Performance Ontology that structures the knowledge about Software Performance Engineering, and a reasoning engine that acts like an expert system with the Performance Ontology as its foundation. The case study at the end shows the applicability of the developed techniques.

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

performance engineering
ontology engineering
distributed systems


Adaptive Scheduling of Real-Time Systems Cosupplied by Renewable and Nonrenewable Energy Sources Energy management is an important issue in today's real-time systems due to the high costs of energy supplying. Using renewable, like wave, wind, and solar energy sources seem promising methods to address this issue. However, because of the existing contrast between the critical nature of hard real-time systems and the unpredictable nature of renewable energies, some supplementary energy source like electricity grid or battery is needed. In this paper, we consider hard real-time systems with two renewable and nonrenewable energy sources. In order to reduce the costs, we present two dynamic voltage scaling controllers to minimize the energy attained from the latter source. In order to handle variations of the environmental energy and workload, the model predictive control approach is employed. One nonlinear approach beside one fast linear piecewise affine explicit controller are proposed. The efficacies of the proposed approaches have been investigated through extensive simulations. Comparisons to an ideal clairvoyant controller as a baseline show that, in the studied scenarios, the proposed controllers guarantee at least 78% of the baseline performance.

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

design
dynamic voltage scaling (dvs)
energy harvesting
model predictive control (mpc)
explicit mpc
real-time systems


VC-dimension analysis of object recognition tasks We analyze the amount of data needed to carry out various model-based recognition tasks in the context of a probabilistic data collection model. We focus on objects that may be described as semi-algebraic subsets of a Euclidean space. This is a very rich class that includes polynomially described bodies, as well as polygonal objects, as special cases. The class of object transformations considered is wide, and includes perspective and affine transformations of 2D objects, and perspective projections of 3D objects. We derive upper bounds on the number of data features (associated with non-zero spatial error) which provably suffice for drawing reliable conclusions. Our bounds are based on a quantitative analysis of the complexity of the hypotheses class that one has to choose from. Our central tool is the VC-dimension, which is a well-studied parameter measuring the combinatorial complexity of families of sets. It turns out that these bounds grow linearly with the task complexity, measured via the VC-dimension of the class of objects one deals with. We show that this VC-dimension is at most logarithmic in the algebraic complexity of the objects and in the cardinality of the model library. Our approach borrows from computational learning theory. Both learning and recognition use evidence to infer hypotheses but as far as we know, their similarity was not exploited previously. We draw close relations between recognition tasks and a certain learnability framework and then apply basic techniques of learnability theory to derive our sample size upper bounds. We believe that other relations between learning procedures and visual tasks exist and hope that this work will trigger further fruitful study along these lines.

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

pac
vapnik-chervonenkis dimension
localization
model-based recognition
computer vision