Recovering the long-range links in augmented graphs The augmented graph model, as introduced in Kleinberg, STOC (2000) [23], is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair (H, phi), where H is a graph in which inter-node distances are supposed to be easy to compute or at least easy to estimate. This graph is "augmented" by links, called long-range links, that are selected according to the probability distribution phi. The augmented graph model enables the analysis of greedy routing in augmented graphs G is an element of (H, phi). In greedy routing, each intermediate node handling a message for a target t selects among all its neighbors in G the one that is the closest to t in H and forwards the message to it. This paper addresses the problem of checking whether a given graph G is an augmented graph. It answers part of the questions raised by Kleinberg in his Problem 9 (Int. Congress of Math. 2006). More precisely. given G is an element of (H, phi), we aim at extracting the base graph H and the long-range links R out of G. We prove that if H has a high clustering coefficient and H has bounded doubling dimension, then a simple local maximum likelihood algorithm enables us to partition the edges of G into two sets H' and R' such that E(H) subset of H' and the edges in H' \ E(H) are of small stretch, i.e., the map H is not perturbed too greatly by undetected long-range links remaining in H. The perturbation is actually so small that we can prove that the expected performances of greedy routing in G using the distances in H' are close to the expected performances of greedy routing using the distances in H. Although this latter result may appear intuitively straightforward, since H' superset of E(H), it is not, as we also show that routing with a map more precise than H may actually damage greedy routing significantly. Finally, we show that in the absence of a hypothesis regarding the high clustering coefficient, any local maximum likelihood algorithm extracting the long-range links can miss the detection of Omega(n(5 epsilon)/log n) long-range links of stretch Omega(n(1/5-epsilon)) for any 0 < epsilon < 1/5, and thus the map H cannot be recovered with good accuracy. (C) 2010 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


A stochastic inventory system with postponed demands This article considers a continuous review perishable (s,S) ( s , S ) inventory system in which the demands arrive according to a Markovian arrival process ( MAP ) . The life time of each item in the stock and the lead time of orders are assumed to be independently distributed as exponential. We assume that the demands that occur during stock-out periods either enter a pool of infinite capacity or are lost. The demands in the pool are selected one by one according to FCFS rule when the stock after replenishment is above a prefixed level, say N ( 1 ? N ? s ) . The interval time between any two successive selections is assumed to be distributed as exponential. In addition to the regular demands, a second flow of negative demands following another MAP is also considered. The negative demand will remove one of the demands waiting in the pool. The joint probability distribution of the number of customers in the pool and the inventory level is obtained in the steady-state case. The measures of system performance in the steady state are calculated and the total expected cost is also considered. The results are illustrated numerically.

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

continuous review
markovian arrival process
postponed demands
negative demands

(s
s) ( s
s ) policy (s
s ) (s
s ) ( s
s )


EMOTAG: AN APPROACH TO AUTOMATED MARKUP OF EMOTIONS IN TEXTS This paper presents an approach to the automated markup of texts with emotional labels. The approach considers two possible representations of emotions in parallel: emotional categories (emotional tags used to refer to emotions) and emotional dimensions (measures that try to model the essential aspects of emotions numerically). For each representation, a corpus of example texts previously annotated by human evaluators is mined for an initial assignment of emotional features to words. This results in a list of emotional words (LEW) which becomes a useful resource for later automated markup. The algorithm proposed for the automated markup of text closely mirrors the steps taken during feature extraction, employing a combination of the LEW resource and the ANEW word list for the actual assignment of emotional features, and WordNet for knowledge-based expansion of words not occurring in either and an ontology of emotional categories. The algorithm for automated markup is tested and the results are discussed with respect to three main issues: the relative adequacy of each of the representations used, correctness and coverage of the proposed algorithm, and additional techniques and solutions that may be employed to improve the results. The average percentage of success obtained by our approach when it marks up with emotional dimensions is around 80% and when it marks up with emotional categories is around 50%. The main contribution of the approach presented in this paper is that it allows dimensions and categories at different levels of abstraction to operate simultaneously during markup.

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

emotional dimensions
emotional categories


exploring the design of accessible goal crossing desktop widgets Prior work has shown that goal crossing may be a more accessible interaction technique than conventional pointing-and-clicking for motor-impaired users. Although goal crossing with pen-based input devices has been studied, pen-based designs have limited applicability on the desktop because the pen can "fly in," cross, and "fly out," whereas a persistent mouse cursor cannot. We therefore explore possible designs for accessible mouse-based goal crossing widgets that avoid triggering unwanted goals by using secondary goals, gestures, and corners and edges. We identify four design principles for accessible desktop goal crossing widgets: ease of use for motor-impaired users, safety from false selections, efficiency, and scalability.

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

motor impairments
crossing-based interfaces
desktop accessibility
human performance
computer access


Scene point constraints in camera auto-calibration: an implementational perspective We present a scheme for incorporating scene constraints into the auto-calibration process for the structure and motion recovery problem. The steps covered by the scheme include projective factorization of the joint image measurement matrix, recovery of the absolute dual quadric, the upgrade from projective structure to its Euclidean counterpart, and incorporation of constraints from orthogonal scene planes into bundle adjustment. The focus of the paper is on the implementation details of all these steps and discussion of the various issues that arose. We have tested the scheme on both synthetic and real image data and found that it is more advantageous to incorporate into camera auto-calibration and bundle adjustment as many scene constraints as are available rather than performing auto-calibration and bundle adjustment alone.

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

bundle adjustment
scene constraints
projective factorization


Detection and analysis of hair We develop computational models for measuring hair appearance for comparing different people. The models and methods developed have applications to person recognition and image indexing. An automatic hair detection algorithm is described and results reported. A multidimensional representation of hair appearance is presented and computational algorithms are described. Results on a data set of 524 subjects are reported. Identification of people using hair attributes is compared to eigenface-based recognition along with a joint, eigenface-hair-based identification.

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

human identification
face recognition
eigenfaces


AIOLOS: Middleware for improving mobile application performance through cyber foraging As the popularity of smartphones and tablets increases, the mobile platform is becoming a very important target for application developers. Despite recent advances in mobile hardware, most mobile devices fail to execute complex multimedia applications (such as image processing) with an acceptable level of user experience. Cyber foraging is a well-known computing technique to enhance the capabilities of mobile devices, where the mobile device offloads parts of the application to a nearby discovered server in the network. Although first introduced in 2001, cyber foraging is still not widely adopted in current smartphone platforms or applications. In this respect, two major challenges are to be tackled. First, a suitable adaptive decision engine is needed to determine the optimal offloading decision, that takes into account the potentially high and variable latency between the device and the server. Second, an integrated cyber foraging platform with sufficient support for application developers is not publicly available on popular mobile platforms such as Android. In this paper, we present AIOLOS, a mobile middleware framework for cyber foraging on the Android platform. AIOLOS uses an estimation model that takes into account server resources and network state to decide at runtime whether or not a method call should be offloaded. We also introduce developer tools to integrate the AIOLOS framework in the Android platform, enabling easy development of cyber foraging enabled applications. A prototype implementation is presented and evaluated in detail by means of both a chess application and a newly developed photo editor application.

O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O 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 overview of methods for dependence analysis of concurrent programs Program dependence analysis is an analysis technique to identify and determine various program dependencies in source codes, which has been widely used in program understanding, debugging, testing, reverse engineering, and maintenance. However, there are still many difficulties to be solved when carrying out dependence analysis for concurrent programs because the execution of statements is unpredictable. This survey describes methods and research directions for dependence analysis of concurrent programs, especially about how to obtain the dependencies between concurrently executed statements, the factors leading to intransitivity among dependencies, and how to deal with the intransitivity problem. By careful comparisons, users can select a proper algorithm for their requirements.

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

concurrency
concurrent program dependence graph
program slicing


An efficient computational method for simulations of reaction-diffusion processes Coupled systems of reaction-diffusion equations are usually solved using a unified time step determined by the most restrictive time scale in the system. We demonstrate in this paper that this time step could be excessively small in many situations, and discuss a more efficient time integration method that does not require linearization procedure and uses different time steps for different equations in a coupled system, depending on their respective time scales. The basic idea is to decouple the system of equations and then apply different time steps to different equations with various time scales. This will also eliminate the need for linearization. Numerical results from a test problem will be discussed to demonstrate significant improvement in computational efficiency. (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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

numerical solution of pdes
reaction-diffusion equations


An intelligent diagnosis system for diabetes on Linear Discriminant Analysis and Adaptive Network Based Fuzzy Inference System: LDA-ANFIS In this study, an intelligent diagnosis system for diabetes on Linear Discriminant Analysis (LDA) and Adaptive Network Based Fuzzy Inference System (ANFIS): LDA-ANFIS is presented. The structure of this LDA-ANFIS intelligent system for diagnosis of diabetes is composed by two phases: The Linear Discriminant Analysis (LDA) phase and classificiation by using ANFIS classifier phase. In first phase, Linear Discriminant Analysis (LDA) is used to separate features variables between healthy and patient (diabetes) data. In second phase, the healthy and patient (diabetes) features obtained in first phase are given to inputs of ANFIS classifier. The correct diagnosis performance of the LDA-ANFIS intelligent system is calculated by using sensitivity and specificity analysis, classification accuracy and confusion matrix respectively. The classification accuracy of this LDA-ANFIS intelligent system was obtained about 84.61%.

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

linear discriminant analysis
anfis
diabetes data
intelligent system
confusion matrix


Multiplexed Immunoassay for Detection of Rheumatoid Factors by FIDIS Technology Abstract: Our objective was to (i) compare FIDIS Rheuma, a new multiplexed immunoassay designed for simultaneous detection of IgM class rheumatoid factors (RF) directed against Fc determinants of IgG from humans and animals, with agglutination and ELISA (conventional methods) and (ii) evaluate the clinical sensitivity and specificity of biological markers for rheumatoid arthritis (RA). To do this, FIDIS technology was employed using the Luminex system. It consists of distinct color-coded microsphere sets, a flow cytometer, and digital signal processing hardware and software. Agglutination and ELISA tests were performed with commercial kits. The study included 134 samples from RA patients and 105 from healthy blood donors. For human specificity, we compared FIDIS with latex agglutination and ELISA. Relative sensitivities were 98.9% and 88.5% and specificities were 90.2% and 94.6%, respectively. For animal specificity, we compared FIDIS with Waaler-Rose and ELISA. The results were 84.9% and 71.9% for the sensitivities and 97.5% and 98.4% for the specificities, respectively. Detection of IgG anti-CCP by ELISA and IgG antikeratin by immunofluorescence was also determined in order to compare their clinical sensitivity and specificity with IgM-RF, according to the method used. The results were: IgG anti-CCP 72.3%, 97.2%; IgG antikeratin 36.6%, 100%; latex agglutination 66.4%, 97.2%; Waaler-Rose 55.9%, 96.3%; FIDIS human 73.9%, 92.1%; FIDIS animal 49.2%, 97.2%; ELISA human 93.2%, 95.5%; and ELISA animal 74.6%, 91.3%. The results showed the efficiency of FIDIS with analytical performance equivalent to the conventional methods, but having the advantage of giving quantitative results /IU/mL).

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

anti-cyclic citrullinated peptide antibodies


Lost in hyperspace: metrics and mental models Being disorientated or lost is one of the fundamental difficulties which users experience when trying to navigate within hypertext systems. In this paper, two new metrics of lostness are described and applied. The new metrics focus on the effects of link-type and the accuracy of user's mental models of system structure. In a series of studies, the new metrics were compared with the only other published metric of lostness, the optimal path deviation measure formulated by Smith [P.A. Smith, Towards a practical measure of hypertext usability, Interacting with Computers 4 (1996) 365-381], and with other measures including self-report estimates and task times. The results tentatively suggest that some types of hyperlink have a greater impact on lostness than others. The accuracy of the subjects' mental models did not correlate significantly with other measures of lostness, however this may have been due to task demands. Based on these findings, suggestions are made for the design of more effective hypertext systems that minimise lostness, and a new approach to designing such systems, based on the mental models of users, is put forward. (C) 2000 Elsevier Science B.V. All rights reserved.

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

hypertext
metrics
usability
lostness
mental models


Interface engineering for low power and uniform resistive switching in bi-layer structural filament type ReRAM Deposition condition was employed to investigate the effect of interfacial layer in the bi-layer structural ReRAM. The controlled ReRAM showed higher on/off raito and more stable switching under low current compliance. The results of mechanism analysis proved that origins of improved performance are reduction of neighboring defects.

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

rram
uniformity
low power operation
bi-layer structure


An acoustic correction method for extracting sound signals Sound waves are propagating pressure fluctuations and are typically several orders of magnitude smaller than the pressure variations in the flow field that account for flow acceleration. On the other hand, these fluctuations travel at the speed of sound in the medium, not as a transported fluid quantity. Due to the above two properties, the Reynolds averaged Navier-Stokes (RANS) equations do not resolve the acoustic fluctuations. Direct numerical simulation of turbulent flow is still a prohibitively expensive tool to perform noise analysis. This paper proposes the acoustic correction method, an alternative and affordable tool based on a modified defect correction concept, which leads to an efficient algorithm for computational aeroacoustics and noise analysis. (C) 2004 Elsevier Ltd. All rights reserved.

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

acoustic correction
defect correction
aeroacoustics


Development of a marketing information system for supporting sales in a Tea-beverage market In this paper, we propose a marketing information system for a Tea-beverage manufacturing firm for supporting sales management. The marketing information system aims at providing assistance in (1) performing efficient dissemination and management of information and sales documents, and (2) improving marketing and promotion processes. The framework is examined and explained in the context of a case study. The results show that it provides better support for managers as a result of improved communication and monitoring. (C) 2008 Elsevier Ltd. All rights reserved.

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

tea-beverage
sales information system
marketing strategies


multitouch and surface computing Natural user interfaces (NUI) such as multitouch and surface computing are positioned as the next major evolution in computing and user interfaces. Just graphical user interfaces (GUIs) brought unprecedented interaction capabilities to their command-line predecessors, we believe multitouch and surface computing will spawn novel ways to interact with media and improve social usage patterns. Since experimentation and deployment are currently limited, the exploration of applications and interfaces in this area is still at an early stage.

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


Robust depth-based object tracking from a moving binocular camera A Robust Depth-based Object Tracking Algorithm from a Moving Binocular Camera. The key idea is firstly to utilize a local patch-based appearance model to represent the target. Since the target is represented by a l local patch-based appearance model, the proposed tracking method can effectively handle the deformable targets. Then, to handle the partial occlusions, we use a simple yet effective scheme to detect and recovery occlusions using depth information obtained from a moving binocular camera, which is more robust than existing 2D image-based tracking methods. Experimental results on challenging video sequences demonstrate the robustness of the proposed 3D tracking method by comparing it with several state-of-the-art tracking methods.

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

3d object tracking
local patch-based appearance model


approximation algorithms and online mechanisms for item pricing We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller's revenue in an unlimited supply setting. Our first result is an O ( k )-approximation algorithm for pricing items to single-minded bidders who each want at most k items. This improves over recent independent work of Briest and Krysta [5] who achieve an O ( k 2 ) bound. For the case k = 2, where we obtain a 4-approximation, this can be viewed as the following graph vertex pricing problem: given a (multi) graph G with valuations w e on the edges, find prices p i ? 0 for the vertices to maximize ? ( p i + p j ). { e =( i , j ): w e ? p i + p j .We also improve the approximation of Guruswami et al. [11] from O (log m + log n ) to O (log n ), where m is the number of bidders and n is the number of items, for the "highway problem" in which all desired subsets are intervals on a line.Our approximation algorithms can be fed into the generic reduction of Balcan et al. [2] to yield an incentive-compatible auction with nearly the same performance guarantees so long as the number of bidders is sufficiently large. In addition, we show how our algorithms can be combined with results of Blum and Hartline [3], Blum et al. [4], and Kalai and Vempala [13] to achieve good performance in the online setting, where customers arrive one at a time and each must be presented a set of item prices based only on knowledge of the customers seen so far.

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

unlimited supply
approximation algorithms

single minded
online optimization
combinatorial auctions


On the capacity-achieving distribution of the discrete-time noncoherent and partially coherent AWGN channels We investigate the communication limits over rapid phase-varying channels and consider the capacity of a discrete-time noncoherent additive white Gaussian noise (NCAWGN) channel under the average power constraint. We obtain necessary and sufficient conditions for the capacity-achieving input distribution and show that this distribution is discrete and possesses an infinite number of mass points. Using this characterization of the capacity-achieving distribution we compute a tight lower bound on the capacity of the channel based on examining suboptimal input distributions. In addition, we provide some easily computable lower and upper bounds on the channel capacity. Finally, we extend some of these results to the partially coherent channel, where it is assumed that a phase-locked loop (PLL) is used to track the carrier phase at the receiver, and that an ideal interleaver and de-interleaver are employed-rendering the Tikhonov distributed residual phase errors statistically independent from one symbol interval to another.

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

capacity-achieving distribution
kuhn-tucker conditions (ktc)
noncoherent channel
partially-coherent channel


A self-adjusting rate adaptation scheme with good fairness and smoothness properties ? A novel feedback-based rate adaptation scheme is introduced and investigated in this paper. Its main innovative characteristic is the modulation of the rate increment by the distance between a flows present rate and an assumed targeted maximum rate as dictated by the associated application. The previous along with the shaping of the rate decrement by the reported flows losses are responsible for a dynamic and self-adjusting behavior that is shown to improve convergence to fairness, the oscillatory behavior of the rate and the induced packet losses when compared with the basic Additive Increase Multiplicative Decrease (AI/MD) scheme. Numerical results illustrate the good properties and intrinsic advantages of the proposed scheme both under the considered modeling assumptions, as well as under more real networking conditions by employing the ns-2 simulator. A brief comparison of the proposed scheme with the TCP-compatible schemes TFRC, IIAD and the non-AI/MD schemes AIPD, LIMPD, is included as well. Because of the aforementioned induced behavior and assumed flows characteristics (min and max rates), the proposed congestion control scheme seems to be appropriate for regulating the rate of streaming applications.

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

elastic flows
rate adaptation schemes
multimedia
ai/md


Cerebral Substrates of Musical Imagery Musical imagery refers to the experience of replaying music by imagining it inside the head. Whereas visual imagery has been extensively studied, few people have investigated imagery in the auditory domain. This article reviews a program of research that has tried to characterize auditory imagery for music using both behavioral and cognitive neuroscientific tools. I begin by describing some of my behavioral studies of the mental analogues of musical tempo, pitch, and temporal extent. I then describe four studies using three techniques that examine the correspondence of brain involvement in actually perceiving vs. imagining familiar music. These involve one lesion study with epilepsy surgery patients, two positron emission tomography (PET) studies, and one study using transcranial magnetic stimulation (TMS). The studies converge on the importance of the right temporal neocortex and other right-hemisphere structures in the processing of both perceived and imagined nonverbal music. Perceiving and imagining songs that have words also involve structures in the left hemisphere. The supplementary motor area (SMA) is activated during musical imagery; it may mediate rehearsal that involves motor programs, such as imagined humming. Future studies are suggested that would involve imagery of sounds that cannot be produced by the vocal tract to clarify the role of the SMA in auditory imagery.

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


correctness-preserving program transformations This paper extends the predicate calculus formalization of the partial correctness properties of programs (Ki, Go) to include the preservation of correctness under program transformations. The general notion of "program transformations which preserve properties" is fundamental to the theory of programming and programming languages. In the context of proofs of program correctness, transformations which preserve correctness can be used to improve less efficient, but easier to prove, programs. The basic argument in the use of correctness-preserving program transformations (hereafter CPTs) is:Assume that G is a program (with attached assertions) which has been proved correct with respect to some input-output relation Ain-Aout. Now suppose that S is some part of G, e.g. an expression, assertion, statement, etc., which is to be replaced by some other such part S' to produce the program G'. The goal is to prove that G' is also correct with respect to Ain-Aout and therefore the replacement preserves overall program correctness. Moreover, if the replacement has only a local effect, e.g. the body of a loop, then the proof of correctness-preservation should be restricted to that part of the program affected by the replacement.Section 2 reviews the current paradigm for proving program correctness. An example in section 3 illustrates CPTs in a sequence of improvements on a correct and simple, but inefficient, initial program. In section 4, the formalization of partial correctness properties of programs is recast as a semantic language definition using Knuth's semantic method (Kn1). This formalization is then used in section 5 to describe the mechanics of performing CPTs. In section 6, several questions about the formalization of sections 4 and 5 are discussed and a generalization is proposed. Finally, section 7 returns to a concrete example and suggests that the most effective use of CPTs is by identification of schematic forms. Related work is mentioned in section 8.

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

use definition context theory general paper argument program preservation method semantic language correctness identification relation effect sequence

efficiency
examples
input
express
program transformation
locality
review
formalism
assert
programming language


Discriminative and adaptive imitation in uni-manual and bi-manual tasks This paper addresses the problems of what to imitate and how to imitate in simple uni and bi-manual manipulatory tasks. To solve the what to imitate issue, we use a probabilistic method, based on Hidden Markov Models (HMM), to extract the relative importance of reproducing either the gesture or the specific hand path in a given task. This allows us to determine a metric of imitation performance. To solve the how to imitate issue, we compute the trajectory that optimizes the metric given the constraints of the robots body. We validate the methods using a series of experiments where a human demonstrator uses kinesthetics in order to teach a robot how to manipulate simple objects.

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

discriminative imitation
learning
humanoid robots
kinesthetic teaching
lagrange optimization


Modeling and characterization of deep trench isolation structures In this paper, we present a simple equivalent electrical circuit model and sidewall interface characterization results for a deep trench isolation structure. The trench structures used in the study consisted of n-silicon/undoped trench/n-silicon. The trenches were filled with undoped polycrystalline silicon and the trench sidewall was lined with thermal oxide and a deposited silicon nitride. The capacitancevoltage characteristics across the trench were measured and compared against the model predictions. The circuit model includes the effect of the space-charge region and recombinationgeneration currents in the undoped polycrystalline silicon trench fill material. The Terman method was used to extract the silicon/oxide sidewall interface density and the mid gap value was found to be less than 10?10#/cm2-eV.

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

high voltage isolation
trench modeling
trench sidewall interface


An optimal hostage rescue problem This paper proposes the following mathematical models for an optimal rescue problem concerning hostages. Suppose that persons are taken hostage at a given point in time. A decision to attempt either rescue or no rescue has to be made. In the paper we mainly consider two different objectives: Minimization of the expected number of hostages being killed and maximization of the probability of no hostage being killed. Several properties of an optimal rescuing rule are revealed.

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

dynamic programming
stochastic processes


An empirical study of XML/EDI Electronic data interchange (EDI) plays an important role in contemporary electronic commerce. It is believed that Extensible Markup Language (XML)/EDI will be the next generation of EDI. In this paper, we thoroughly study and analyze the XML/EDI framework proposed by the XML/EDI Group, and design as well as implement an XML/EDI prototype for Taiwan's flower distribution channels. In accordance with the experiences obtained from the prototype development, we provide in depth analysis of the technology for XML developers and our observations of possible research opportunities in the applications of XML in electronic commerce. Also this paper proposes a general implementation procedure for the industries that are interested in the application of XML/EDI. (C) 2001 Elsevier Science Inc. All rights reserved.

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


Risk profile and consumer shopping behavior in electronic and traditional channels This paper develops an economic model that captures consumer shopping channel choices based on shopping channel characteristics and consumer risk profilesrisk-neutral or risk-averse. Analyses of results show that after making purchases through one channel, electronic or traditional, risk-averse consumers tend to be more loyal customers than risk-neutral consumers. Further, the two types of consumers may exhibit split channel behaviorrisk-neutral consumers prefer one channel and risk-averse consumers prefer the other. However, risk-neutral consumers are not always more likely to prefer electronic channel than risk-averse consumers. Implications for retailer pricing strategies are discussed.

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

e-commerce
retail channel switching
consumer risk profile
online shopping behavior


Multiple goals and ownership structure: Effects on the performance of Spanish savings banks Spanish savings banks (SBs) are financial institutions with a wide mission that includes different stakeholders goals. Profit maximization is only one among several goals, and the widespread use of cost or profit efficiency as the only comparative performance measure may prove to be insufficient in this context. To overcome this problem, we build an aggregate performance index for organizations with multiple goals. Furthermore, we show how the ownership structure of SBs influences their economic behavior in two basic ways: (1) the performance level and (2) their goal priorities. In particular, we distinguish two types of ownership structures in our application, namely, organizations controlled by Public Administrations and those controlled by insiders (i.e. managers and workers). Our results indicate that each type has different priorities and differ in their performance indexes. More specifically, the empirical analysis shows that insider-controlled SBs favor goals related to profit maximization and the universal access to financial services and, furthermore, they perform better. In contrast, contributing to regional development becomes the most favored goal when Public Administrations have a majority in the bank.

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

data envelopment analysis (dea)
dea weights
or in banking
productivity and competitiveness


Skinning mesh animations We extend approaches for skinning characters to the general setting of skinning deformable mesh animations. We provide an automatic algorithm for generating progressive skinning approximations, that is particularly efficient for pseudo-articulated motions. Our contributions include the use of nonparametric mean shift clustering of high-dimensional mesh rotation sequences to automatically identify statistically relevant bones, and robust least squares methods to determine bone transformations, bone-vertex influence sets, and vertex weight values. We use a low-rank data reduction model defined in the undeformed mesh configuration to provide progressive convergence with a fixed number of bones. We show that the resulting skinned animations enable efficient hardware rendering, rest pose editing, and deformable collision detection. Finally, we present numerous examples where skins were automatically generated using a single set of parameter values.

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


Effects of Organizational Learning and Knowledge Transfer on Investment Decisions Under Uncertainty Because uncertainties around innovative technologies resolve over time, investments in such technologies are often made in stages so that organizations can use the knowledge gained from earlier stages to decide the next step. Previous studies usually assume that once some uncertainty is resolved, it becomes common knowledge within the investing organization. We develop a game-theoretical model to study how different parties within an organization gain and transfer knowledge about new technologies while investing in these technologies, and how the learning process may affect the investment decisions. We show that managers with incentives misaligned with the organization may transfer their knowledge untruthfully and distort the learning process of decision makers. Such behavior may lead to inefficient investment decisions. We also study the effect of uncertainty on the misreporting problem and the investment decisions. Mechanisms to mitigate or prevent untruthful knowledge transfer are also proposed. In particular., powerful incentive schemes may alleviate, but not prevent. the misreporting problem;, punishing managers who are caught mis-reporting may deter the misreporting behavior, but in practice such mechanisms are difficult to implement.

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

knowledge transfer
organizational learning

economic analysis
game theory
investment under uncertainty
signal jamming


Multi-response Problem with Adaptive Weight Consideration by Using Weight Aggregator and ANNs This study proposes a procedure incorporating artificial neural networks technique with adaptive weight consideration to address parameter optimization of a multiple responses problem. No matter what type of the experimental designs being employed, the proposed approach can be directly employed. Besides, the consistency and difference among several evaluations among those multiple responses can also be studied via the designed aggregation weight values in our proposed procedure. An illustrative example owing to the lead frame manufacturer in Taiwan is also employed to demonstrate the feasibility and rationality of the proposed procedure.

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

parameter optimization
lead frame
weight aggregator

multi-response problem
back-propagation neural network (bpnn)


On the use of random limited-scan to improve at-speed random pattern testing of scan circuits A method is proposed for improving the fault coverage that can be achieved by random patterns for circuits with scan. Under the test application scheme considered, primary input sequences are applied at-speed between scan operations. The proposed method uses limited scan operations to improve the fault coverage. Under a limited scan operation, the circuit state is shifted by a number of positions which may be smaller than the number of state variables. Limited scan operations are inserted randomly to ensure that the complete test set can be generated by a random pattern generator. Experimental results show that complete fault coverage is achieved by the proposed method, i.e., the proposed method detects all the detectable circuit faults, for all the benchmark circuits considered.

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

at-speed test application
built-in test generation
random test generation


Pixel-Wise Noise Level Estimation for Images The purpose of this study is to estimate the noise level of every pixel in a single noisy image, that is superimposed independent and non-identically distributed random variables with normal distribution. The method makes a set of similar pixels in the local region to the interest pixel using the approximate function of noise variance, and estimates with regard to the noise level. As the results show, the proposed method is effective in estimation of noise level of every pixel for any images.

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


True-colour images and iterated function systems Over recent years some mathematicians and computer scientists have used fractal geometry to generate, study and analyze complex images. Fractal techniques offer a rich source for exploitation by expert users and artists generally to `dirty up' images to eliminate the computer graphics feel and look of a sterile environment. There are several models for fractal shapes and each has certain benefits and drawbacks. All of them provide a basis for object generation but the rendering process is far from reaching the performance levels needed for interactivity. Linear fractal models such as the Iterated Function Systems seem to offer more in that matter. IFSs can serve as elegant test beds for research into interactive modeling of complex natural and artificial phenomena. This article discusses the IFS model with encoded RGB colour transformations. The method surpasses classical stochastic approaches and promises real-time generation of a wider variety of complex objects.

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

computer graphics
iterated function systems
colour


Ranking BPEL Processes for Service Discovery Finding useful services is a challenging and important task in several applications. Current approaches for services retrieval are mostly limited to the matching of their inputs/outputs. In this paper, we argue that in several applications (services having multiple and dependent operations and scientific workflows), the service discovery should be based on the specification of service behavior. The idea behind is to develop matching techniques that operate on behavior models and allow delivery of approximate matches and evaluation of semantic distance between these matches and the user requirements. To do so, we reduce the problem of behavioral matching to a graph matching problem and adapt existing algorithms for this purpose. To validate our approach, we developed a BPEL ranking platform that allows to find in a service repository, a set of service candidates satisfying user requirements, and then, to rank these candidates using a behavioral-based similarity measure.

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


Document Retrieval Using SIFT Image Features This paper describes a new approach to document classification based on visual features alone. Text-based retrieval systems perform poorly on noisy text. We have conducted series of experiments using cosine distance as our similarity measure, selecting varying numbers local interest points per page, and varying numbers of nearest neighbour points in the similarity calculations. We have found that a distance-based measure of similarity outperforms a rank-based measure except when there are few interest points. We show that using visual features substantially outperforms text-based approaches for noisy text, giving average precision in the range 0.4-0.43 in several experiments retrieving scientific papers.

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


Collision detection between point clouds using an efficient k-d tree implementation Context: An important task in civil engineering is the detection of collisions of a 3D model with an environment representation. Existing methods using the structure gauge provide an insufficient measure because the model either rotates or because the trajectory makes tight turns through narrow passages. This is the case in either automotive assembly lines or in narrow train tunnels. Objective: Given two point clouds, one of the environment and one of a model and a trajectory with six degrees of freedom along which the model moves through the environment, find all colliding points of the environment with the model within a certain clearance radius. Method: This paper presents two collision detection (CD) methods called kd-CD and kd-CD-simple and two penetration depth (PD) calculation methods called kd-PD and kd-PD-fast. All four methods are based on searches in a k-d tree representation of the environment. The creation of the k-d tree, its search methods and other features will be explained in the scope of their use to detect collisions and calculate depths of penetration. Results: The algorithms are benchmarked by moving the point cloud of a train wagon with 2.5 million points along the point cloud of a 1144m long train track through a narrow tunnel with overall 18.92 million points. Points where the wagon collides with the tunnel wall are visually highlighted with their penetration depth. With a safety margin of 5cm kd-PD-simple finds all colliding points on its trajectory which is sampled into 19,392 positions in 77s on a standard desktop machine of 1.6GHz. Conclusion: The presented methods for collision detection and penetration depth calculation are shown to solve problems for which the structure gauge is an insufficient measure. The underlying k-d tree is shown to be an effective data structure for the required look-up operations.

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

interference detection
k-d tree
kinematic laser scanning
3d point clouds


A transformation sequencing approach to pseudorandom number generation This paper presents a new approach to designing pseudorandom number generators based on cellular automata. Current cellular automata designs either focus on (i) ensuring desirable sequence properties such as maximum length period, balanced distribution of bits and uniform distribution of n-bit tuples, etc. or (ii) ensuring the generated sequences pass stringent randomness tests. In this work, important design patterns are first identified from the latter approach and then incorporated into cellular automata such that the desirable sequence properties are preserved like in the former approach. Preliminary experiment results show that the new cellular automata designed have potential in passing all DIEHARD tests.

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

cellular automata
pseudorandom number generation
maximum length period
randomness tests


A step forward in studying the compact Genetic Algorithm The compact Genetic Algorithm (cGA) is an Estimation of Distribution Algorithm that generates offspring population according to the estimated probabilistic model of the parent population instead of using traditional recombination and mutation operators. The cGA only needs a small amount of memory; therefore, it may be quite useful in memory-constrained applications. This paper introduces a theoretical framework for studying the cGA from the convergence point of view in which, we model the cGA by a Markov process and approximate its behavior using an Ordinary Differential Equation (ODE). Then, we prove that the corresponding ODE converges to local optima and stays there. Consequently, we conclude that the cGA will converge to the local optima of the function to be optimized.

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

compact genetic algorithm
markov process
ordinary differential equation

weak convergence
stationary configuration
stability


Simultaneous presentation of soft tissue and bone tissue in computed tomography with combined window Objectives: To examine whether in computed tomography (CT) soft tissue and bone tissue can be simultaneously presented with a combined window without loss of diagnostic information compared to the separate presentations with soft tissue and bone tissue windows. Materials and methods: Forty-seven CT examinations from different patients with pathological changes at the soft tissue or bone tissue after an accident or due to malignant tumour were evaluated. The CT data were transformed into grey level data with three different windows: (1) soft tissue window; (2) bone tissue window to show spongiosa and bone cortex; and (3) special window to show ethmoidal sinus and mastoidal cells. The images were then weighted with a weighting factor of 2, 3 and 1, respectively, resulting in one image with combined window. This image was compared with the conventional soft tissue and bone tissue images. Results: All diagnostic information could be obtained and anatomical details be recognized on the image with combined window. In some cases soft tissue structures could be delineated from each other or from adjacent bone better on this image than on the soft tissue image. Conclusions: Combined window could enable a reduction of film consumption or digital storage because soft tissue and bone tissue are presented on the same image and not separately. The risk for overlooking important pathological changes might be reduced as both tissues are always presented.

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


An interpretative structural modeling based network reconfiguration strategy for power systems A line importance evaluation method is proposed based on the contraction concept. ISM is employed to analyze the relationship among different factors. The generator to be restored is selected by maximizing the restoration benefit. The start-up sequence of generators and restoration paths are optimized together.

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

network reconfiguration
line importance evaluation
interpretative structural modeling


Extracting multilayered Communities of Interest from semantic user profiles: Application to group modeling and hybrid recommendations A Community of Interest is a specific type of Community of Practice. It is formed by a group of individuals who share a common interest or passion. These people exchange ideas and thoughts about the given passion. However, they are often not aware of their membership to the community, and they may know or care little about each other outside of this clique. This paper describes a proposal to automatically identify Communities of Interest from the tastes and preferences expressed by users in personal ontology-based profiles. The proposed strategy clusters those semantic profile components shared by the users, and according to the clusters found, several layers of interest networks are built. The social relations of these networks might then be used for different purposes. Specifically, we outline here how they can be used to model group profiles and make semantic content-based collaborative recommendations.

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

communities of practice
ontology
user profile
content-based collaborative filtering


Integration of RPG use and ELC foundation to examine students learning for practice This study examined the effectiveness of the role-playing game. This study revealed the existence of an experiential learning cycle in the RPG. This study provided some findings and its implications for RPG issue.

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

role-playing game
experiential learning theory
learning performance
practice-based learning


Dynamic carrier allocation strategies for mobile cellular networks Dynamic carrier allocation (DCA) refers to the paradigm of dynamically allocating carriers to cells in cellular networks. Many strategies have been proposed. In most of the strategies. each carrier is assigned a priority. Depending on how priorities are assigned, DCA strategies are classified into three categories: static-priority, dynamic-priority, and hybrid-priority strategies. In this paper, we investigate the concept of optimal reuse pattern, propose a model for resource planning, and propose three guidelines for priority assignment in static-and hybrid-priority DCA strategies. These theoretical results shed light on the strength and weakness of existing DCA strategies and lead us to develop more efficient strategies. Specifically, we propose three DCA strategies: column-wise static-priority, column-wise hybrid-priority and two-step dynamic-priority. We study their performances by simulation under both uniform and nonuniform traffic distributions. (C) 2001 Academic Press.

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

cellular network
handoff
mobile host
base station


Embedded wavelet packet object-based image coding based on context classification and quadtree ordering In this paper, an object-based embedded image coding algorithm based on context classification and quadtree ordering in wavelet packet domain (OB-CCAQO) is proposed. To match up well with the quadtree-based embedded coder, a new cost function for the best basis selection is adopted in SA-DWPT (shape adaptive discrete wavelet packet transform). The significance probability of wavelet coefficient is estimated by convoluting a 99 9 9 FIR filter matrix kernel with the significance states of neighboring coefficients, and then a context classifier based on LloydMax algorithm is used to categorize the wavelet coefficients with the same or similar significance probability into several contexts. The significance state of wavelet coefficient with respect to a given threshold is encoded using adaptive arithmetic coder based on the classified context. In addition, combined with the structure of the best wavelet packet basis, a complete quadtree representation of wavelet packet coefficients is established to explore the ordering procedure of embedded object-based image coding. Experimental results show that the proposed object-based embedded image coder offers coding performance superior to the popular object-based coders and is also comparable to or better than the state-of-art embedded image coder when applied in the framed-based image coding.

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

embedded image coding
best wavelet packet basis
context classification
quadtree ordering

object-based coding
significance probability estimation


Individual creativity in teams: The importance of communication media mix We use compensatory adaptation and dual coding theories to explore the effects of communication media use on creativity. Our field study results show that high levels of self-esteem and information-based demographic differences positively influence creativity. Social category differences negatively influence creativity. Communication media mix is an important moderator, improving the relationship of self-esteem and social category demographic differences with creativity when individuals have proportionally more mediated communication. The relationship between information-based demographic differences and creativity is attenuated when individuals use proportionally more mediated communication. The results have implications for managers encouraging creativity among a diverse workforce using multiple communication media.

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

communication media
creativity
demographic differences


Quality and effectiveness in Web-based customer support systems The quality of a Web-based customer support system involves the information it supplies, the service it provides, and characteristics of the system itself; its effectiveness is reflected by the satisfaction of its users. This paper presents the results of a study of quality and effectiveness in Web-based customer support systems. Data from a survey of 726 Internet users were used to test theoretically expected relationships. The results of this study indicate that information and system quality determine effectiveness while service quality has no impact. Practical implications for managers and designers are offered.

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

customer support
system quality
service quality

web-based systems
information quality
user satisfaction


High Throughput Disk Scheduling with Fair Bandwidth Distribution Mainstream applications-such as file copy/transfer, Web, DBMS, or video streaming-typically issue synchronous disk requests. As shown in this paper, this fact may cause work-conserving schedulers to fail both to enforce guarantees and provide a high disk throughput. A high throughput can be, however, recovered by just idling the disk for a short time interval after the completion of each request. In contrast, guarantees may still be violated by existing time-stamp-based schedulers because of the rules they use to tag requests. Budget Fair Queuing (BFQ), the new disk scheduler presented in this paper, is an example of how disk idling, combined with proper back-shifting of request time stamps, may allow a time-stamp-based disk scheduler to preserve both guarantees and a high throughput. Under BFQ, each application is always guaranteed-over any time interval and independently of whether it issues synchronous requests-a bounded lag with respect to its reserved fraction of the total number of bytes transferred by the disk device. We show the single-disk performance of our implementation of BFQ in the Linux kernel through experiments with real and emulated mainstream applications.

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


performance driven reliable link design for networks on chips With decreasing feature size of transistors, the interconnect wire delay is becoming a major bottleneck in current Systems on Chips (SoCs) . Another effect of shrinking feature size is that the wires are becoming unreliable as they are increasingly susceptible to various noise sources such as cross-talk, coupling noise, soft errors etc. Increasing importance of wire delay and reliability has lead to a communication centric design approach, Networks on Chip (NoC) , for building complex SoCs. Current NoC communication design methodologies are based on conservative design approaches and consider worst case operating conditions for link design, resulting in large latency penalty for data transmission. In order to sub-stantially decrease the link delay and thereby increase system performance an aggressive design approach is needed. In this work we present Terror, timing error tolerant communication system, for aggressively designing the links of NoCs. In our methodology, instead of avoiding timing errors by a worst-case design, we do aggressive design by tolerating timing errors. Simulation results show large latency savings (up to 35\%) for the Terror based system compared to traditional design methodology.

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

aggressive design
reliability
link
networks on chips
performance


Standby supply voltage minimization for deep sub-micron SRAM Suppressing the leakage current in memories is critical in low-power design. By reducing the standby supply voltage (VDD) to its limit, which is the data retention voltage (DRV), leakage power can be substantially reduced. This paper models the DRV of a standard low leakage SRAM module as a function of process and design parameters, and analyzes the SRAM cell stability when VDD approaches DRV. The DRV model is verified using simulations as well as measurements from a 4KB SRAM chip in a 0.13?m technology. Due to a large on-chip variation, DRV of the 4KB SRAM module ranges between 60 and 390mV. Measurements taken at 100mV above the worst-case DRV show that reducing the SRAM standby VDD to a safe level of 490mV saves 85% leakage power. Further savings can be achieved by applying DRV-aware SRAM optimization techniques, which are discussed at the end of this paper.

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


Guaranteed cost control analysis and iterative design for constrained Takagi-Sugeno systems This paper presents a novel control design technique in order to obtain a guaranteed cost fuzzy controller subject to constraints on the input channel This guaranteed cost control law is obtained via multi-parametric quadratic programming The result is a piecewise fuzzy control law where the state partition is defined by fuzzy inequalities The parameters of the Lyapunov function can be obtained previously using Linear Matrix Inequalities optimization (C) 2010 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

takagi-sugeno fuzzy control
lmi
quadratic stability
parallel distributed compensation
piecewise control
multi parametric quadratic programming
constrained control


Practical protocol for Yao's millionaires problem enables secure multi-party computation of metrics and efficient privacy-preserving k-NN for large data sets Finding the nearest k objects to a query object is a fundamental operation for many data mining algorithms. With the recent interest in privacy, it is not surprising that there is strong interest in k-NN queries to enable clustering, classification and outlier-detection tasks. However, previous approaches to privacy-preserving k-NN have been costly and can only be realistically applied to small data sets. In this paper, we provide efficient solutions for k-NN queries for vertically partitioned data. We provide the first solution for the L (a) (or Chessboard) metric as well as detailed privacy-preserving computation of all other Minkowski metrics. We enable privacy-preserving L (a) by providing a practical approach to the Yao's millionaires problem with more than two parties. This is based on a pragmatic and implementable solution to Yao's millionaires problem with shares. We also provide privacy-preserving algorithms for combinations of local metrics into a global metric that handles the large dimensionality and diversity of attributes common in vertically partitioned data. To manage very large data sets, we provide a privacy-preserving SASH (a very successful data structure for associative queries in high dimensions). Besides providing a theoretical analysis, we illustrate the efficiency of our approach with an empirical evaluation.

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

privacy-preserving data mining
secure multi-party computation
nearest-neighbour classification
yao's millionaires problem


a computational model of the music of stevie ray vaughan Every musician who improvises has a unique musical vocabulary, which may be perceived in his or her compositions. In this paper, we explain our design of a computational model that predicts the creative decisions made by the blues musician, Stevie Ray Vaughan for various input scenarios. Our design brings into effect the fact that creative works involve the use of pre-existing structures stored in the creator's mind or knowledge base, retrieved and reconstructed on the basis of appropriate rules, which are triggered by the nature of specific input. The model was partially implemented as a limited production system using a probabilistic method. It was tested with three different input scenarios. The model predicted the musician's decisions with a limited degree of accuracy. The tests provided valuable insight on ways to improve the current performance and suggested revising the definition of a musical pattern to include specific limits on its duration.

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

creativity modeling
musical creativity
schemas
computational modeling


An algorithm for production planning in a flexible production system In this paper, we consider the problem of determining the production rate, production batch size, and production sequence when production rate, setup cost, and unit processing cost are sequence-dependent. Using a standard lot sizing model with backorder, a tabu search algorithm for solving this problem is proposed. The algorithm is tested on some random test problems and its performance is compared with random sequencing. Computational results show that the proposed algorithm is very efficient. (c) 2004 Elsevier Ltd. All rights reserved.

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

production
batch size
tabu search
sequencing


Modeling and solving constrained two-sided assembly line balancing problem via bee algorithms Designing and operating two-sided assembly lines are crucial for manufacturing companies which assemble large-sized products such as trucks, buses and industrial refrigerators. This type of assembly line structure has several advantages over one-sided assembly lines such as shortened line length and reduced throughput time. The research area has recently focused on balancing two-sided assembly lines owing to these advantages. However, due to the complex structure of this problem, some practical constraints have been disregarded or have not been fully incorporated. In order to overcome these deficiencies, a fully constrained two-sided assembly line balancing problem is addressed in this research paper. Initially, a mathematical programming model is presented in order to describe the problem formally. Due to the problem complexity, two different swarm intelligence based search algorithms are implemented to solve large-sized instances. Bees algorithm and artificial bee colony algorithm have been applied to the fully constrained two-sided assembly line balancing problem so as to minimize the number of workstations and to obtain a balanced line. An extensive computational study has also been performed and the comparative results have been evaluated.

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

bees algorithm
artificial bee colony algorithm
swarm intelligence

two-sided assembly line balancing
integer programming


Inhomogeneous Distribution Strategy Based on Mobile Sink Nodes in Wireless Sensor Networks Energy consumption equilibrium is of great significance for the wireless sensor networks . For a circular sensor network, nonuniform node distribution strategy can be used to avoid the energy hole around the sink. However, it will potentially result in unbalanced coverage because the only central sink node will cause more nodes deployed in the inner region than the outer. Based on mobile sink nodes, an inhomogeneous distribution strategy is proposed to improve coverage quality. To deploy the nodes, the whole network is divided into multiple adjacent coronas as unit interval. Obviously, the number of corona is equal to the radius of network. The number of nodes in the network ascends from the second corona to the outermost corona with geometric proportion, while the ratio is kept constant between different coronas. With mobile sink node deployed on the edge of network, a calculation model of node sensing and coverage is adopted to evaluate the coverage quality. Furthermore, energy consumption model is used to improve energy efficiency. Experimental results show that our algorithm can achieve suboptimal energy efficiency and make 99.5% coverage rate of the whole network, which outperforms the traditional nonuniform node distribution algorithm to a great degree.

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

wireless sensor networks
inhomogeneous distribution
mobile sink node
coverage quality


Situational variables in online versus offline channel choice Since the advent and rapid diffusion of the Internet, the subject of consumer channel choice has attracted a large amount of research, mainly focused on the influence of channel, consumer and product category characteristics as its drivers. The interaction between channel choice and the purchase situation has been largely ignored, however. This paper is an attempt to fill this gap by identifying the key purchase situation variables and conducting an experiment to assess their impact on the choice between the traditional retail outlet and the online store. The results show that the key determinants of channel choice relate to time and distance. Distance-to-store and time pressures are among the factors affecting the probability of online purchase. Using a conceptual framework to explore differences in the impact of situational variables across product categories (high/low involvement, search/experience good), we show that distance-to-store has more influence on the likelihood of online purchase in situations involving search goods, while social variables are found to play a role only in the context of high-involvement goods. (C) 2013 Elsevier B.V. All rights reserved.

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

channel choice
internet
situational variables


Complex network analysis of teaching practices The application of functional analysis to infer networks in large datasets is potentially helpful to experimenters in various fields. In this paper, we develop a technique to construct networks of statistically significant transitions between variable pairs from a high-dimensional and multiscale dataset of teaching practices observed in Grade 5 and Grade 9 Mathematics classes obtained by the National Institute of Education in Singapore. From the Minimum Spanning Trees (MST) and Planar Maximally Filtered Graphs (PMFG) of the transition networks, we establish that teaching knowledge as truth and teacher-dominated talking serve as hubs for teaching practices in Singapore. These practices reflect a transmissionist model of teaching and learning. We also identify complex teacher-student-teacher-student interaction sequences of teaching practices that are over-represented in the data.

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


Class-specific soft voting based multiple extreme learning machines ensemble Compared with conventional weighted voting methods, class-specific soft voting (CSSV) system has several advantages. On one hand, it not only deals with the soft class probability outputs but also refines the weights from classifiers to classes. On the other hand, the class-specific weights can be used to improve the combinative performance without increasing much computational load. This paper proposes two weight optimization based ensemble methods (CSSV-ELM and SpaCSSV-ELM) under the framework of CSSV scheme for multiple extreme learning machines (ELMs). The designed two models are in terms of accuracy and sparsity aspects, respectively. Firstly, CSSV-ELM takes advantage of the condition number of matrix, which reveals the stability of linear equation, to determine the weights of base ELM classifiers. This model can reduce the unreliability induced by randomly input parameters of a single ELM, and solve the ill-conditioned problem caused by linear system structure of ELM simultaneously. Secondly, sparse ensemble methods can lower memory requirement and speed up the classification process, but only for classifier-specific weight level. Therefore, a SpaCSSV-ELM method is proposed by transforming the weight optimization problem to a sparse coding problem, which uses the sparse representation technique for maintaining classification performance with less nonzero weight coefficients. Experiments are carried out on twenty UCI data sets and Finance event series data and the experimental results show the superior performance of the CSSV based ELM algorithms by comparing with the state-of-the-art algorithms.

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

soft voting
condition number
sparse ensemble


A work-efficient distributed algorithm for reachability analysis This work presents a novel distributed symbolic algorithm for reachability analysis that can effectively exploit, as needed, a large number of machines working in parallel. The novelty of the algorithm is in its dynamic allocation and reallocation of processes to tasks and in its mechanism for recovery from local state explosion. As a result, the algorithm is work-efficient: it utilizes only those resources that are actually needed. In addition, its high adaptability makes it suitable for exploiting the resources of very large and heterogeneous distributed, nondedicated environments. Thus, it suitable for verifying very large systems. We implemented our algorithm in a tool called Division. Our experimental results show that the algorithm is indeed work-efficient. Although the goal of this research is to check larger models, the results also indicate that the algorithm can obtain high speedups, because communication overhead is very small.

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

distributed reachability
symbolic model checking
distributed bdds


The effect of precision of molecular orbital descriptors on toxicity modeling of selected pyridines The response-surface approach to QSARs attempts to model toxic potency of diverse groups of chemicals while avoiding problems associated with the identification of the mechanism of toxic action or specific chemical class often associated with other approaches. However, while hydrophobicity-dependent, simple regression QSARs derived for congeneric series of organic compounds typically have coefficients of determination greater than 0.90, more heterogeneous multiple regression QSARs exhibit typically 10-15% more unexplained variability. One difference between these approaches is the use of a quantum chemical (QC) descriptor, particularly molecular orbital (MO) energy values such as the energy of the lowest unoccupied molecular orbital (E-LUMO). The reduced statistical fit exhibited by QSAR models, which include these QC-MO descriptors, could be a result of the variability inherent in the calculation of these descriptors. The present investigation with a structurally and mechanistically diverse set of pyridines revealed that variability is associated with the calculation of the MO descriptor E-LUMO both between selected Hamiltonians and selected software packages. However, this variability in no way affects the statistical significance of QSARs for toxicity using these values. Specifically, the ELUMO values calculated with the PM3 and AM I Hamiltonians in the two software packages were highly related. There was no relationship between molecular complexity or chemical reactivity and increased differences in individual ELUMO values as described by the standard errors of the mean. Although nine appeared to be the number of calculations, which best minimizes the standard error in energy values relative to computational costs; this minimization did not alter the statistics of the QSARs derived with single vs. mean E-LUMO values. While the energy of the highest occupied molecular orbital (E-HOMO) values were not used in the modeling of toxicity, a comparison of these values revealed greater variability between the Hamiltonians and software packages than observed for ELUMO values. Examination of the magnitudes of standard error of the E-HOMO values in connection to structural features or reactivity likewise revealed no trends.

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

molecular orbital descriptors
qsar
pyridines


Mirror, mirror on the wall, squishy and soggy, 2 Nanos Tall: Strategies, methods and tools for searching homogeneous catalysts An EPO perspective (Part 1. Introduction and patents) ? This paper provides an overview of various search strategies, methods and tools for searching catalysts comprising hydrides, coordination complexes or organic compounds. These are also commonly referred to as homogeneous catalysts, in contradistinction to true heterogeneous metal or metal oxide catalysts, typically on an inorganic support. The characteristic material and search aspects are illustrated by way of exemplary patent applications for catalysts/systems that find use in industrially important reactions such as hydroformylation, hydrocyanation, (asymmetric) hydrogenation, olefin metathesis, cross-coupling or come from emerging fields (e.g. CH activation, green chemistry). EPO internal, commercial, as well as some freeware tools are explained, including an evaluation of strengths and weaknesses. Emphasis is placed on how these catalysts are searched at the European Patent Office, i.e. patentability searches of patent applications. Nevertheless, the information and evaluations provided herein should enable the reader to set up a strategy for any specific search problem in this field, including high precision (quick) and high recall clearance or validity searches. Additionally, much insight is provided on search methods at the EPO, databases etc, which can be of wider interest than catalyst searches alone. The paper is divided into two parts. This part (part 1) deals with terminology and the basics of patent searching, whereas part 2 in the next issue of this journal will deal with non-patent literature searching and the overall conclusions. See also the introduction for the distribution of content between the individual parts.

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

catalysts
hydrogenation
olefin metathesis
ch activation
green chemistry

ecla
ipc
uspc
f-term
ico codes
chemical abstracts
scirus
google scholar
google crossref
encompasslit
encompasspat
beilstein x-fire
metal complexes
ionic liquids
metal-organic frameworks


Online traveling salesman problem with deadline and advanced information We consider the online version of the traveling salesman problem, where instances are not known in advance. Requests are released over time regardless whether the server is en route or not. This problem has been described as online TSP. Current literature about online TSP assumes that each request becomes known at its release time and will always remain active. We model the customers' waiting psychology and service preparation time into the online TSP with the objective to serve as many requests as possible. More specifically, each request has a disclosure time before accepting service at its release time, and a deadline, which is no bigger than its release time plus the travel time from origin to its position. We give lower bounds for the competitive ratios, online algorithms, and quantify the influence of advanced information on competitive ratios. (C) 2012 Elsevier Ltd. All rights reserved.

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

online routing problems
deadlines
competitive ratio


Fitting a finite element tidal model to sparse data: application to the Straits of Dover The major difficulty faced by numerical models of tidal dynamics in the limited-area shelf basins concerns the treatment of open boundaries. We show that effective control of the open boundary conditions in a depth-averaged numerical model can be achieved by assimilation of data from coastal tide gauges in the interior of the basin, distant from its open boundaries. We use variational assimilation of sea level data at a number of coastal locations into a quasi-linearized finite element tidal model, and a weak formulation of the dynamical constraints. The effectiveness of the procedure is verified on a test problem involving tidal wave propagation in a zonally oriented, narrow, rotating channel with two open boundaries. The assimilation technique was then successfully applied to the reconstruction of the M2 tide in the Dover Straits using coastal tidal measurements in the ports. A rigorous error analysis is performed using the explicit inversion of the Hessian matrix, associated with the assimilation scheme. As a result, an error chart for the amplitude of the optimized sea surface elevation is obtained.

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

variational assimilation
tidal measurements
dover straits


Planning of WDM ring networks The rapid introduction of wavelength division multiplexing (WDM) technology to cope with the increased bandwidth requirements of transmission networks has intensified the need for recovery mechanisms at the optical layer. A first step towards survivable optical networking will be seen through the introduction of optical rings. This paper presents different types of optical rings (dedicated and shared protection WDM rings) and the planning issues associated with these WDM rings. In particular, we give mathematical models as well as solution methods for the ring loading and wavelength assignment problem. We compare the wavelength requirement of dedicated and shared protection rings under scenarios with different demand patterns. We also discuss the influence of the WDM equipment cost, and present a mathematical model for the optimization of hybrid networks with both dedicated and shared protection rings.

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

wdm
optical rings
planning
wavelength assignment


Finding a suitable system scale to optimize program performance on software DSM systems Recently, software distributed shared memory systems have successfully provided an easy user interface to parallel user applications on distributed systems. In order to prompt program performance, most of DSM systems usually were greedy to utilize all of available processors in a computer network to execute user programs. However, using more processors to execute programs cannot necessarily guarantee to obtain better program performance. The overhead of paralleling programs is increased by the addition in the number of processors used for program execution. If the performance gain from program parallel cannot compensate for the overhead, increasing the number of execution processors will result in performance degradation and resource waste. In this paper, we proposed a mechanism to dynamically find a suitable system scale to optimize performance for DSM applications according to run-time information. The experimental results show that the proposed mechanism can precisely predict the processor number that will result in the best performance and then effectively optimize the performance of the test applications by adapting system scale according to the predicted result.

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

distributed shared memory
system scale
program performance