A Robust Detection in the Presence of Clutter and Jammer Signals with Unknown Powers This work extends the constant false alarm rate (CFAR) detection methodology to detection in the presence of two independent interference sources with unknown powers. The proposed detector is analyzed on the assumption that clutter and jammer covariance structures are known and have relatively low rank properties. The limited-dimensional subspace-based approach leads to a robust false alarm rate (AFAR) detector. The RFAR detection algorithm is developed by an adaptation and extension of Hotelling's principal-component method. The detector performance loss and false alarm stability loss to unknown clutter and jammer powers have been evaluated for example scenario.

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

cfar detector
clutter and jammer subspaces


UICC-Based Service Security Framework for Pervasive Fixed Mobile Convergence Nowadays, the Fixed Mobile Convergence (FMC) is a worldwide trend in the form of fixed and mobile telephony convergence. In this pervasive environment, security should be considered to be an important factor because the security threats of heterogeneous infrastructures can happen simultaneously. Thus, the security infrastructure of the mobile terminals should be mandatory since a single terminal can be used among different kinds of pervasive infrastructures. UICC has been deemed to be the only solution due to its inherent security features and brilliant advances in technologies. In this paper, we propose a novel UICC-based service security framework (USF), which implements the essential security functionalities used for FMC services, to provide the integrated security infrastructure and secure FMC services. The USF can be utilized to authenticate users, preserve privacy, and protect network infrastructures and business models of telephony companies.

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


limitations of cache prefetching on a bus-based multiprocessor Compiler-directed cache prefetching has the potential to hide much of the high memory latency seen by current and future high-performance processors. However, prefetching is not without costs, particularly on a multiprocessor. Prefetching can negatively affect bus utilization, overall cache miss rates, memory latencies and data sharing. We simulated the effects of a particular compiler-directed prefetching algorithm, running on a bus-based multiprocesssor. We showed that, despite a high memory latency, this architecture is not very well-suited for prefetching. For several variations on the architecture, speedups for five parallel programs were no greater than 39\%, and degradations were as high as 7\%, when prefetching was added to the workload. We examined the sources of cache misses, in light of several different prefetching strategies, and pinpointed the causes of the performance changes. Invalidation misses pose a particular problem for current compiler-directed prefetchers. We applied two techniques that reduced their impact: a special prefetching heuristic tailored to write-shared data, and restructuring shared data to reduce false sharing, thus allowing traditional prefetching algorithms to work well.

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

prefetching affect performance sharing cache strategies latency workload architecture data algorithm future multiprocessor

speedup
simulation
high-performance
direct
writing
lighting
change
processor
data sharing
variation
parallel programming
memorialized
compilation
heuristics
effect


algorithms for symbolic/numeric control of affine dynamical systems We consider a general linear dynamical system and want to control its behavior. The goal is to reach a given target by minimizing a cost function. We provide a new generic algorithm with together exact, symbolic and numerical modules. In particular new efficient methods computing a block Kalman canonical exact decomposition and the optimal solutions are presented. We also propose a new numerical algorithm under-approximating the controllable domain in view of its analytical resolution in the context of singular sub-arcs.

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

controllability
affine optimal control problems
canonical transformation


The trading on the mutual funds by gene expression programming with Sortino ratio The aim of this paper is to combine several techniques together to provide one systematic method for guiding the investment in mutual funds. Many researches focus on the prediction of a single asset time series, or focus on portfolio management to diversify the investment risk, but they do not generate explicit trading rules. Only a few researches combine these two concepts together, but they adjust trading rules manually. Our method combines the techniques for generating observable and profitable trading rules, managing portfolio and allocating capital. First, the buying timing and selling timing are decided by the trading rules generated by gene expression programming. The trading rules are suitable for the constantly changing market. Second, the funds with higher Sortino ratios are selected into the portfolio. Third, there are two models for capital allocation, one allocates the capital equally (EQ) and the other allocates the capital with the mean variance (MV) model. Also, we perform superior predictive ability test to ensure that our method can earn positive returns without data snooping. To evaluate the return performance of our method, we simulate the investment on mutual funds from January 1999 to September 2012. The training duration is from 1999/1/1 to 2003/12/31, while the testing duration is from 2004/1/1 to 2012/9/11. The best annualized return of our method with EQ and MV capital allocation models are 12.08% and 12.85%, respectively. The latter also lowers the investment risk. To compare with the method proposed by Tsai et al., we also perform testing from January 2004 to December 2008. The experimental results show that our method can earn annualized return 9.07% and 11.27%, which are better than the annualized return 6.89% of Tsai et al. (C) 2013 Elsevier B.V. All rights reserved.

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

gene expression programming
sortino ratio
superior predictive ability test


Stability analysis of buffer priority scheduling policies using Petri nets A Petri net approach to determining the conditions for stability of a re-entrant system with buffer priority scheduling policy is described in this paper. The concept of buffer boundedness based on the dynamic behavior of the markings in the system model is emphasized. The method is used to demonstrate the stability of the first buffer first served (FBFS) and the last buffer first served (LBFS) scheduling policies. Finally a sufficient condition for instability of systems with a positive feedback loop (PFL) is established, and an example is given.

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

stability
buffer boundedness
priority scheduling
positive feedback
petri net


Discrete Tomography with Unknown Intensity Levels Using Higher-Order Statistics Discrete tomography focuses on the reconstruction of images containing only a limited number of different intensity values. Most of the methods assume that the intensities are a priori known. In practice, however, this information is usually not available. Therefore, the problem of the estimation of the intensity levels has been recently addressed by many researchers. In this paper, we present a novel approach for the tomographic reconstruction of binary images, when the two gray-levels are unknown. The problem is traced back to the minimization of an appropriate objective functional, in which a higher-order statistics-based discretization term enforces binary solutions. Instead of the gray-levels, the only parameter of this term is their mid-level value, which is iteratively approximated during the optimization process. Experiments on synthetic phantom images as well as on real data show that the proposed graduated optimization scheme can efficiently minimize the objective functional and the method provides accurate reconstructions. Compared to some of the state-of-the-art algorithms, the proposed method provides competitive results, while it requires less parameter settings, thus it can be considered as a valid alternative.

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

binary tomography
higher-order statistics
kurtosis


Walking pedestrian tracking among several pedestrians by dynamic camera In tracking a walking pedestrian among multiple walking pedestrians by movable camera, the pedestrian-target determination is sometimes mistaken, and it needs real-time image processing. This paper proposes an approach for tracking a walking pedestrian among multiple walking pedestrians with dynamic camera mounted on a pan platform. The objective of this approach is to correctly select the target, and maintain target within field of view. The approach has three processes, consisting of motion extraction, target prediction and camera movement respectively. The motion extraction with background compensation is performed to determine the groups of moving edges. In the target prediction, target position is predicted by using appropriate size window to identify target among several target candidates and to increase the accuracy. The final calculated distance, and direction against target and error are cooperated to determine the predicted target position. At the final process, the camera is moved in order to locate the center of the view at the target center. The experiments were demonstrated by tracking a walking pedestrians at 1 m/s speed and five meters distance from camera. Each experiment roughly consumed 480 ms/frame processing time at 8.5 rev./s motor speed. The results showed that the system error was 5-8 % for five walking patterns of a walking pedestrian situation. In the situation of multiple walking pedestrians, the demonstration were performed by tracking a pedestrian among two and three pedestrians, the results revealed that the system succeeded in maintaining the target within the field of view excepting the cases that the movement was suddenly changed in term of direction and speed.

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

walking pedestrian tracking
target prediction


simulation and performance evaulation of amr-wb with adaptive rate control for voip on wireless ad hoc networks The main purpose of this paper is to present a simulation model for the performance evaluation of Adaptive Rate Control for VoIP on Wireless Ad Hoc Networks. We use OPNET simulation to capture the characteristics of wireless channel and implement the speech coding standard AMR-WB. The basic idea of our rate control scheme is to adapt the voice coding bit rate to the available network bandwidth in order to maximize the quality of voice. The MOS value is evaluated by PESQ for the adaptive rate control. We designed the ad hoc and adaptive control model to simulate our scheme. The simulation results have confirmed the effectiveness of this scheme.

O O O O O O O O O O O B O O B I I O O O O O O O O O O O O O O O O O O O O O B O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 dynamically reconfigurable NRTI switched-capacitor-based hybrid DCDC converter suitable for embedded applications In this paper, a dynamically reconfigurable, Non-overlap Rotational Time Interleaved (NRTI) switched capacitor (S-C) DCDC converter is presented. Its S-C module is reconfigurable to generate three different fractions (viz., 1/3, 1/2 and 2/3) of its input supply (Vdd). This maintains good power efficiency while its output voltage gets adjusted over a large range. In addition, a load-current-sensing circuit is integrated within it to dynamically reconfigure the S-C module based on the required driving capability. This feature enables to extend load current range to higher limit and at the same time improves the power efficiency in low load current regime. The S-C module is integrated with a current control loop for load and line regulation. The proposed architecture is simulated in a 0.18?m CMOS process using dual oxide transistors to demonstrate the efficacy of the proposed topology. The input supply voltage is 3.3V and the regulated output range is 0.81.6V. Total flying capacitance is 330pF and the load capacitor value is 50pF. For an output of 1.35V, its power efficiency is maintained above 50% over a load current range of 417.6mA with a peak of 66% at 9mA. Throughout this current range the output voltage ripple remains within 12mV.

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

dynamically reconfigurable dcdc converter

non-overlapped rotational time interleaved (nrti) clocking


Takagi-Sugeno fuzzy fault-tolerant control of an induction motor This paper demonstrates the application of a new fault-tolerant control scheme for a rail vehicle traction system using digital signal processing hardware and a representative induction motor testrig. This approach presented takes into account the stability and design of non-linear fuzzy inference systems based on Takagi-Sugeno (T-S) fuzzy models. The paper derives the necessary conditions for the assignability of eigenvalues to a region in the s-plane and the necessary conditions to guarantee the stability of adaptive fuzzy models. The problem is solved via the Linear Matrix Inequalities (LMI) method.

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

fault-tolerant control
fuzzy logic
induction motor control
parameter estimation


Voice anthropomorphism, interlocutor modelling and alignment effects on syntactic choices in human?computer dialogue ? Paper investigates syntactic alignment in spoken human?computer dialogue. The role of partner modelling through partner type and voice is also explored. Humans align similarly with human and computer partners, irrespective of voice. Priming is an important mechanism to consider in explaining our HCD choices. Syntactic alignment can affect strong default preferences and could be used to improve spoken dialogue technology.

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

syntactic alignment
interlocutor modelling

human?computer dialogue
speech interaction
user behaviour
psycholinguistics


semantically enabled exploratory video search With the exponential growth of video data on the World Wide Web comes the challenge of efficient methods in video content management, content-based video search, filtering and browsing. But, video data often lacks sufficient meta-data to open up the video content and to enable pinpoint content-based search. With the advent of the 'web of data' as an extension of the current WWW new data sources can be exploited by semantically interconnecting video meta-data with the web of data. Thus, enabling better access to video repositories by deploying semantic search technologies and improving the user's search experience by supporting exploratory search strategies. We have developed the prototype semantic video search engine 'yovisto' that demonstrates the advantages of semantically enhanced exploratory video search and enables investigative navigation and browsing in large video repositories.

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

exploratory search
semantic video search
video search
semantic search


Remarks on Thatte's transformation of term rewriting systems We carry out a detailed analysis of Thatte's transformation of term rewriting systems. We refute an earlier claim that this transformation preserves confluence for weakly persistent systems. We prove the preservation of weak normalization, and of confluence in weakly normalizing systems and in nonoverlapping systems with linear subtemplates. We conclude by proving that weak persistence is an undecidable property of term rewriting systems. (C) 2004 Elsevier Inc. All rights reserved.

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

thatte's transformation
constructor-based system


ADAPTIVE FUZZY TRACKING CONTROL FOR A CLASS OF PERTURBED NONLINEAR TIME-VARYING DELAYS SYSTEMS WITH UNKNOWN CONTROL DIRECTION An adaptive fuzzy control scheme with only one adjusted parameter is developed for a class of nonlinear time-varying delays systems. Three kinds of uncertainties: time-varying delays, control directions, and nonlinear functions are all assumed to be completely unknown, which is different from the previous work. During the controller design procedure, appropriate Lyapunov-Krasovskii functionals are used to compensate the unknown time-varying delays terms and the Nussbaum-type function is used to detect the unknown control direction. It is proved that the proposed controller guarantees that all the signals in the closed-loop system are bounded and the tracking errors converge to a small neighborhood around zero. The two main advantages of the developed scheme are that (i) by combining the appropriate Lyapunov-Krasovskii functionals with the Nussbaum-gain technique, the control scheme is proposed for a class of nonlinear time-varying delays systems with unknown control directions, (ii) only one parameter needs to be adjusted online in controller design procedure, which reduces the computational burden greatly. Finally, two examples are used to show the effectiveness of the proposed approach.

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

time-varying delays
lyapunov-krasovskii functionals
nussbaum-type function


The Assignment of CDMA Spreading Codes Constructed from Hadamard Matrices and Almost Bent Functions Almost bent functions and Hadamard matrices can be used to construct spreading codes for code-division multiple-access (CDMA) systems. Four specific Hadamard matrices can be constructed and each one can be divided into eight octants in such a way that spreading codewords from certain pairs of octants have zero correlation. It is possible to assign these octants to a regular tessellation of hexagonal cells in such a way that there is zero correlation between adjacent cells, small correlation between non-adjacent cells and a large codeword re-use distance. If synchronous CDMA is used in a satellite system, interference is reduced in comparison with the use of a single Hadamard matrix. In this case the regular hexagonal tessellation is usually a good model of the areas covered by satellite spot beams. The same approach can be advantageous when the Hadamard matrices are used to construct loosely synchronized codes for a terrestrial system. The tessellation of cells is unlikely to be a regular hexagonal tessellation and the question arises of whether an assignment to an irregular tessellation with these properties can be found. In this paper a positive answer is given to this question, confirming that the approach is applicable to a terrestrial system.

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

code-division multiple-access
code assignment


Stable Roommates Spanner We introduce a new geometric spanner whose construction is based on a generalization of the known Stable Roommates problem. The Stable Roommates Spanner combines the most desirable properties of geometric spanners: a natural definition, small degree, linear number of edges, strong (1+?) ( 1 + ? ) -spanner for every ?>0 ? > 0 , and an efficient construction algorithm. It is an improvement over the well-known Yao graph and ? -graph and their variants. We show how to construct such a spanner for a set of points in the plane in O ( n log 10 n ) expected time. We introduce a variant of the Stable Roommates Spanner called the Stable Roommates ? -Spanner which we can generalize to higher dimensions and construct more efficiently in O ( n log d n ) time. This variant possesses all the properties of the Stable Roommates Spanner except that it is no longer a strong spanner.

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

geometric spanners
yao graph
stable roommates


A hybrid simulation framework for the evaluation of common radio resource management scenarios We present a hybrid modeling framework with interacting simulative and analytic submodels for the efficient evaluation of common radio resource management (CRRM). It enables a cost-benefit investigation of different CRRM algorithms and architectures. Centralized as well as decentralized scenarios can be clearly defined by five standard components, namely the radio access system, the environment, the user equipment, the CRRM information manager, and the CRRM decider. The costs and time consumption of CRRM operations are taken into account via chargeable messages. The clarity of the model enables an efficient investigation of CRRM algorithms based on optimization theory, game theory, physical models, and other methods. The resulting framework has been implemented as a hybrid simulation model using the discrete event simulation system OMNeT++. A convenient and straightforward integration of different wireless network technologies and user service demands is also supported; models for the universal mobile telecommunications system (UMTS) and the global system for mobile communications/enhanced general packet radio service (GSM/EGPRS) are already integrated. The scope of the proposed framework is demonstrated by the evaluation of realistic scenarios.

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

common radio resource management
hybrid simulation

multi standard radio resource management


Designing interactive narrative systems: is object-orientation useful? New technologies challenge our methods for system analysis and design. This article reports from an experimental evaluation of a typical object-oriented modeling method that was used to design an interactive narrative system that simulates a certain real world environment in order to train and assess the decision-making capabilities of persons operating in that specific setting. Based on this empirical study, we emphasize strengths and weaknesses of the object-oriented method. To complement this evaluation, the article also reports from a related empirical study of a process where general knowledge about storytelling and filmmaking was used as the methodological basis for designing a comparable system. From this second study, we elicit ideas for increasing the extent to which the object-oriented modeling method can support the design of a training and assessment system.

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

interactive narratives
design methodologies
object-oriented analysis and design


composable semantics for model-based notations We propose a unifying framework for model-based specification notations. Our framework captures the execution semantics that are common among model-based notations, and leaves the distinct elements to be defined by a set of parameters. The basic components of a specification are non-concurrent state-transition machines, which are combined by composition operators to form more complex, concurrent specifications. We define the step-semantics of these basic components in terms of an operational semantics template whose parameters specialize both the enabling of transitions and transitions' effects. We also provide the operational semantics of seven composition operators, defining each as the concurrent execution of components, with changes to their shared variables and events to reflect inter-component communication and synchronization; the definitions of these operators use the template parameters to preserve in composition notation-specific behaviour. By separating a notation's step-semantics from its composition and concurrency operators, we simplify the definitions of both. Our framework is sufficient to capture the semantics of basic transition systems, CSP, CCS, basic LOTOS, ESTELLE, a subset of SDL88, and a variety of statecharts notations. We believe that a description of a notation's semantics in our framework can be used as input to a tool that automatically generates formal analysis tools.

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

concurrency
communication
composition
operational semantics
formal analysis


delegate predicate encryption and its application to anonymous authentication Predicate encryption provides fine-grained control over encryption and decryption. In a predicate encryption scheme, message is encrypted with a set of attributes, and decryption key is incorporated with a predicate. Only when the predicate evaluates to true over these attributes, the message can be correctly decrypted. We propose an extension to predicate encryption named delegate predicate encryption. In our extension, a user generates a encryption capability of a set of attributes, then sends the capability to a encryption proxy. Using this capability, the proxy can encrypt arbitrary message with these attributes without knowing anything about these attributes. We give a concrete construction from a predicate encryption scheme which supports the widest range of predicate known to date. Then, using our extension, we are able to construct an anonymous authentication scheme. In our anonymous authentication scheme, authentication rules can be described in an very expressive way, while the anonymity of user is protected and the authentication rules are also hidden.

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

predicate encryption
anonymous authentication


Analysis of two restart algorithms Since the backpropagation algorithm used for neural network training suffers from a slow convergence and often sticking in local minima, the restart mechanism has been introduced, whose strategy is to cut off the training process and restart it with a fresh initialization when it seems unlikely to converge in a relatively short time. In this paper, we give detailed mathematical analysis on two versions of the restart algorithms. By deriving analytic expressions of the expected convergence time and the success rate, we illustrate why the restart algorithms work well and gain insights into the proper use of restarting. Numerical simulations are performed on the XOR problem, symmetry detection, parity problem and Arabic numeral recognition. We show the effectiveness of the restart algorithms, and compare them with simulated annealing. The analysis can also be applied to many other fields.

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

restart mechanism
neural network training
backpropagation algorithm


Multi-scale relation analysis of power law distribution and correlation in the Chinese stock market Purpose - The purpose of this paper is to reveal the multi-scale relation between power law distribution and correlation of stock returns and to figure out the determinants underlying capital markets. Design/methodology/approach - The multi-scale relation between power law distribution and correlation is investigated by comparing the original series with the special series. The eliminating intraday trend series approach developed by Liu et al. is utilized to analyze the effects of power law decay change on correlation properties, and shuffling series originated by Viswanathan at al. for the impacts of special type of correlation on power-law distribution. Findings - It is found that the accelerating decay of power law has an insignificant effect on con-elation properties of returns and the empirical results indicate that time scale may also be an important factor maintaining power law property of returns besides correlation. When time scale is under critical point, the effects of correlation are crucial, and the correlation of nonlinear long-range presents the strongest influence. However, for time scale beyond critical point, the impact of correlation begins to diminish or even finally disappear and then the power law property shows complete dependence on time scale. Research limitations/implications - The 5-mM high frequency data of the Shanghai market as the empirical benchmark is insufficient to depict the relation over the entire time scale in the Chinese stock market. Practical implications The paper identifies the determinants of market dynamics to apply them to risk management through analysis of multi-scale relations, and supports endeavors to introduce time parameter into further risk measures and control. Originality/value - The paper provides the empirical evidence that time scale is one of the key determinants of market dynamics by analyzing the multi-scale relation between power law distribution and correlation.

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

stock returns
capital markets
correlation
power law distribution
relation


Multilevel compact radial functions based computational schemes for some elliptic problems Compactly supported radial basis functions (CS-RBFs) have been recently introduced in the context of the dual reciprocity method as a possible cure of dense matrices and ill-conditioning problems when using the classical radial basis functions. However, the support scaling factor and slow convergence rate of the CS-RBFs have also raised issues on the effectiveness of the CS-RBFs. In this paper, two multilevel schemes have been proposed to alleviate these problems. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

compactly supported radial basis functions

the method of fundamental solutions
particular solutions
multilevel scheme
boundary element method


Maxmin fair survivable networks In this paper, we discuss applications of maxmin fairness (MMF) in survivable networks. We focus on two specific applications intended to face failure situations and provide several computational results for each of them. The first application, called simple robust routing, generalizes the multipath routing in order to achieve acceptable levels of traffic demand satisfaction in case of single link failures while avoiding classical rerouting procedures. Such a method can be seen as a special case of dedicated resource recovery schemes. The second application is concerned with two shared resource restoration strategies and the corresponding problems of computing the MMF minimum traffic demand satisfaction ratio vectors associated with the set of single link failures. We consider the local rerouting and end-to-end rerouting without stub-release strategies. Computational results for realistic network instances provide a comparison of different routing and rerouting strategies in terms of traffic satisfaction rate. The question of estimating the bandwidth overhead, which can be required by the simple robust routing scheme in comparison with the classical restoration schemes, is also studied and answers based on computational results are provided. This work is in continuation of our earlier works on MMF (Nace et al., IEEE Trans Netw 14:12721281, 2006; Nace et al., Comput Oper Res 35:557573, 2008).

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

maxmin fairness
routing
survivable networks

recovery mechanisms
linear programming
path generation


Concurrent detection of erroneous responses in linear analog circuits This paper presents a novel methodology for concurrent error detection in linear analog circuits. The error-detection circuit monitors the input and some observable internal nodes of the examined circuit and generates an estimate of its output. The estimate coincides with the output in error-free operation, while in the presence of errors, it diverges. Thus, concurrent error detection is performed by comparing the two signals through an analog comparator. In essence, the error-detection circuit operates as a duplicate of the examined circuit, yet it is smaller, in general, and never exceeds the size of an actual duplicate. The proposed methodology is demonstrated on three analog filters.

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

concurrent error detection
linear analog circuits


Glitch-Free NAND-Based Digitally Controlled Delay-Lines The recently proposed NAND-based digitally controlled delay-lines (DCDL) present a glitching problem which may limit their employ in many applications. This paper presents a glitch-free NAND-based DCDL which overcame this limitation by opening the employ of NAND-based DCDLs in a wide range of applications. The proposed NAND-based DCDL maintains the same resolution and minimum delay of previously proposed NAND-based DCDL. The theoretical demonstration of the glitch-free operation of proposed DCDL is also derived in the paper. Following this analysis, three driving circuits for the delay control-bits are also proposed. Proposed DCDLs have been designed in a 90-nm CMOS technology and compared, in this technology, to the state-of-the-art. Simulation results show that novel circuits result in the lowest resolution, with a little worsening of the minimum delay with respect to the previously proposed DCDL with the lowest delay. Simulations also confirm the correctness of developed glitching model and sizing strategy. As example application, proposed DCDL is used to realize an All-digital spread-spectrum clock generator (SSCG). The employ of proposed DCDL in this circuit allows to reduce the peak-to-peak absolute output jitter of more than the 40% with respect to a SSCG using three-state inverter based DCDLs.

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

all-digital delay-locked loop (addll)
all-digital phase-locked loop (adpll)
delay-line
digitally controlled oscillator (dco)
flip-flops
sense amplifier
spread-spectrum clock generator (sscg)


Markov random field based fusion for supervised and semi-supervised multi-modal image classification In recent years, there has been a massive explosion of multimedia content on the web, multi-modal examples such as images associated with tags can be easily accessed from social website such as Flickr. In this paper, we consider two classification tasks: supervised and semi-supervised multi-modal image classification, to take advantage of the increasing multi-modal examples on the web. We first propose a Markov random field (MRF) based fusion method: discriminative probabilistic graphical fusion (DPGF) for the supervised multi-modal image classification, which can make use of the associated tags to enhance the classification performance. Based on DPGF, we then propose a three-step learning procedure: DPGF+RLS+SVM, for the semi-supervised multi-modal image classification, which uses both the labeled and unlabeled examples for training. Experimental results on two datasets: PASCAL VOC07 and MIR Flickr, show that our methods can well exploit the multi-modal data and unlabeled examples, and they also outperform previous state-of-the-art methods in both two multi-modal image classification. Finally we consider the weakly supervised condition where class labels are from image tags which are noisy. Our semi-supervised approach also improves the classification performance in this case.

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

image classification
markov random field

multi-modal classification
semi-supervised learning


tradeoff between energy savings and privacy protection in computation offloading Offloading can save energy on mobile systems for computation-intensive applications. The mobile systems send programs and data to grid-powered servers where computation is performed. Offloading, however, causes privacy concerns because sensitive data may be sent to servers. This paper investigates how to protect privacy in computation offloading. We use steganography to hide data before sending them to servers. This paper evaluates the tradeoff between energy savings and privacy protection for content-based image retrieval with different steganographic techniques. We implement these methods on a PDA and compare their energy consumption, performance, and effectiveness of protecting privacy.

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

privacy protection
steganography
image retrieval
computation offloading


OpenMP to GPGPU: A Compiler Framework for Automatic Translation and Optimization GPGPUs have recently emerged as powerful vehicles for general-purpose high-performance computing. Although a new Compute Unified Device Architecture (CUDA) programming model from NVIDIA offers improved programmability for general computing, programming GPGPUs is still complex and error-prone. This paper presents a compiler framework for automatic source-to-source translation of standard OpenMP applications into CUDA-based GPGPU applications. The goal of this translation is to further improve programmability and make existing OpenMP applications amenable to execution on GPGPUs. In this paper, we have identified several key transformation techniques, which enable efficient GPU global memory access, to achieve high performance. Experimental results from two important kernels (JACOBI and SPMUL) and two NAS OpenMP Parallel Benchmarks (EP and CG) show that the described translator and compile-time optimizations work well on both regular and irregular applications, leading to performance improvements of up to 50X over the unoptimized translation (up to 328X over serial on a CPU).

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

performance
openmp
gpu
cuda
automatic translation


On collaborative people detection and tracking in complex scenarios ? The main contributions of this paper covers two different aspects: people detection and tracking. A whole detection/tracking system that integrates appearance, motion and tracking information is presented. This system uses the information provided by each of the independent tasks to improve the final result of the system. The tracking information is integrated in the detection task improving the detection results and vice versa. The experimental results over an extensive and challenging video dataset point out the state of the art limitations in complex or realistic scenarios, and show that the proposed collaborative system significantly reduces these limitations and improves the results in this kind of scenarios.

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


Speeding Up Cycle Based Logic Simulation Using Graphics Processing Units Verification has grown to dominate the cost of electronic system design, consuming about 60% of design effort. Among several verification techniques, logic simulation remains the major verification technique. Speeding up logic simulation results in great savings and shorter time-to-market. We parallelize logic simulation using Graphics Processing Units (GPUs). In the past, GPUs were special-purpose application accelerators, suitable only for conventional graphics applications. The new generations of GPU architecture provide easier programmability and increased generality while maintaining the tremendous memory bandwidth and computational power of traditional GPUs. We develop a parallel cycle-based logic simulation algorithm that uses And Inverter Graphs (AIGs) as design representations. AIGs have proven to be an effective representation for various design automation applications, and we obtain similar benefits for speeding up logic simulation. We develop two clustering algorithms that partition the gates in the designs into independent blocks. Our algorithms exploit the massively parallel GPU architecture featuring thousands of concurrent threads, fast memory, and memory coalescing for optimizations. We demonstrate up-to 5x and 21x speedups on several benchmarks using our simulation system with the first and second clustering algorithms, respectively. Our work ultimately results in significant reduction in the overall design cycle.

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

graphics processing units (gpu)
parallel logic simulation
cycle based simulation
and inverter graph (aig)


Approximating the longest paths in grid graphs In this paper, we consider the problem of approximating the longest path in a grid graph that possesses a square-free 2-factor. By (1) analyzing several characteristics of four types of cross cells and (2) presenting three cycle-merging operations and one extension operation, we propose an algorithm that finds in an n-vertex grid graph C. a long path of length at least 5/6 n + 2. Our approximation algorithm runs in quadratic time. In addition to its theoretical value, our work has also an interesting application in image-guided maze generation. (C) 2011 Elsevier B.V. All rights reserved.

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


The Architecture and Traffic Management of Wireless Collaborated Hybrid Data Center Network This paper introduces a novel wireless collaborated hybrid data center architecture called RF-HYBRID that could optimize the effect of wireless transmission while reduce the complexity of wired network. RF-HYBRID improves throughput and packet delivery latency through flexible wireless detours and shortcuts, with a comprehensive routing and congestion control method.

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


Employing web mining and data fusion to improve weak ad hoc retrieval When a user issues a reasonable query to a retrieval system and obtains no relevant documents, he or she is bound to feel frustrated. We call these weak queries and retrievals. Improving their effectiveness is an important issue for ad hoc retrieval and would be most rewarding for these users. We explain why data fusion of sufficiently dissimilar retrieval lists can improve weak query results and confirm this with experiments using short and medium size queries. To realize sufficiently dissimilar retrieval lists, we propose composing alternate queries through web search and mining, employ them for target retrieval, and combine with the original query retrieval list. Methods of forming web probes from longer queries, including salient term selection and query text window rotation, are investigated. When compared with normal ad hoc retrieval, web assistance and data fusion can more than double the original weak query effectiveness. Other queries can also improve along with weak ones.

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

weak query
salient term selection
web mining
alternate queries
data fusion


Interval-indexed formulation based heuristics for single machine total weighted tardiness problem In this paper, we solve the single machine total weighted tardiness problem by using integer programming and linear programming based heuristic algorithms. Interval-indexed formulation is used to formulate the problem. We discuss several methods to form the intervals and different post-processing methods. Then, we show how our algorithm can be used to improve a population of a genetic algorithm. We also provide some computational results that show the effectiveness of our algorithm. Many aspects of our heuristic algorithm are quite general and can be applied to other scheduling and combinatorial optimization problems.

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

single machine scheduling
interval-indexed formulation
mixed integer programming
linear programming based heuristics


an information perspective on evolutionary computation Information is the tennis ball of communication- this sentence concluded Keith Devlin's talk trying to answer the question: 'Does information Really Exist?'. Whether information exists or not, the discussion about information surely does. Even though the term information has a formal definition (i.e., Kolmogorov complexity, Shannon's information theory), in the EC community (and, as it seems, in many other fields), the term information is used, more often than not, in an informal way (e.g., the problem contains no information and hence it cannot be solved efficiently). This tutorial focuses on the connection between the two formal definitions of information (Shannnon's entropy and Kolmogorov's Complexity) to Optimisation problems and Black- Box algorithms. For example, we will discuss how informal observations of the kind, 'ONEMAX contains good information', 'NIAH does not contain any' connects with the formal definition. Moreover, we will show that the No Free Lunch Theorems are just a private case of a more general phenomenon. The tutorial covers the following major issues: Kolmogorov complexity (KC) and its relation to Shannon information theory, KC and problem hardness, the relation between KC and other (applicable) predictive measures to problem difficulty (e.g., auto-correlation, ruggedness), an information perspective on the no free- lunch theorems and (if time allows) philosophical aspects of information.

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


Possibilistic fuzzy co-clustering of large document collections In this paper we propose a new co-clustering algorithm called possibilistic fuzzy co-clustering (PFCC) for automatic categorization of large document collections. PFCC integrates a possibilistic document clustering technique and a combined formulation of fuzzy word ranking and partitioning into a fast iterative co-clustering procedure. This novel framework brings about simultaneously some benefits including robustness in the presence of document and word outliers, rich representations of co-clusters, highly descriptive document clusters, a good performance in a high-dimensional space, and a reduced sensitivity to the initialization in the possibilistic clustering. We present the detailed formulation of PFCC together with the explanations of the motivations behind. The advantages over other existing works and the algorithm's proof of convergence are provided. Experiments on several large document data sets demonstrate the effectiveness of PFCC.

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

possibilistic clustering
document clustering

co-clustering
fuzzy clustering
text mining
information retrieval


Performance of Electric Power Systems Under Physical Malicious Attacks This paper focuses on deliberate acts aimed at the disruption of the electric power infrastructure and their impact on its operational capability. Metrics derived from complex network theory and social network analysis are used to identify the important elements of the electric power transmission grid. Using the outcomes of this screening procedure as a guide, a number of physical attack scenarios have been fabricated and applied. The nature of these scenarios is either deterministic (targeted attacks) or stochastic (sets of elements are randomly attacked). We appraise the effect of these attacks on the serviceability of the electric power system by modeling of potential cascading events through calculation of transmission grid components' loading, a Monte Carlo simulation of hidden failures, and, finally, operator performance analysis based on a simple human reliability model. The effect of each attack scenario is quantified in terms of the blackout size (electric-power-not-served). To illustrate the application of the developed model to the security assessment of targeted physical attacks against the electric power infrastructure, the Swiss transmission grid is taken as the test system.

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

cascading failures
centrality metrics
complex systems
industrial power system vulnerability


The starfish diagram: Visualising data within the context of survey samples ? As astronomy becomes increasingly invested in large surveys the ample representation of an individual target becomes a significant challenge. Tabulations of basic properties can convey the message in an absolute sense but not within the context of the sample from which the individual is drawn. We present a novel but simple plot that simultaneously visualises the properties of the sample and the individual. Numbers and characters are kept at an absolute minimum to enable the stacking of such plots without introducing too much verbal information. Once the user becomes accustomed to their appearance, a set of starfish diagrams provides a direct representation of the individual within a sample, or between various samples. The utility and versatility of the plot is demonstrated through its application to astrophysical data (SAMI Galaxy Survey) and sports statistics. We provide a brief description of the concept and the source code, which is simple to adapt to any statistical dataset, be it descriptive of physics, demographics, finance, and more.

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

visualisation application domains: scientific visualisation

visualisation application domains: visual analytics

visualisation application domains: information visualisation

visualisation: visualisation design and evaluation methods


Modeling human behavior in user-adaptive systems: Recent advances using soft computing techniques Adaptive Hypermedia systems are becoming more important in our everyday activities and users are expecting more intelligent services from them. The key element of a generic adaptive hypermedia system is the user model. Traditional machine learning techniques used to create user models are usually too rigid to capture the inherent uncertainty of human behavior. In this context, soft computing techniques can be used to handle and process human uncertainty and to simulate human decision-making. This paper examines how soft computing techniques, including fuzzy logic, neural networks, genetic algorithms, fuzzy clustering and neuro-fuzzy systems, have been used, alone or in combination with other machine learning techniques, for user modeling from 1999 to 2004. For each technique, its main applications, limitations and future directions for user modeling are presented. The paper also presents guidelines that show which soft computing techniques should be used according to the task implemented by the application.

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

user modeling
adaptive hypermedia
soft computing
machine learning


On some entropy functionals derived from Rnyi information divergence We consider the maximum entropy problems associated with Rnyi Q-entropy, subject to two kinds of constraints on expected values. The constraints considered are a constraint on the standard expectation, and a constraint on the generalized expectation as encountered in nonextensive statistics. The optimum maximum entropy probability distributions, which can exhibit a power-law behaviour, are derived and characterized. The Rnyi entropy of the optimum distributions can be viewed as a function of the constraint. This defines two families of entropy functionals in the space of possible expected values. General properties of these functionals, including nonnegativity, minimum, convexity, are documented. Their relationships as well as numerical aspects are also discussed. Finally, we work out some specific cases for the reference measure Q(x) Q ( x ) and recover in a limit case some well-known entropies.

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

rnyi divergences
maximum entropy principle
nonextensivity
tsallis distributions


Automatic detection and analysis of discontinuity geometry of rock mass from digital images The inaccessibility of rock exposures is an inherent problem in geotechnical data acquisition that compromises effective geotechnical evaluation. The digital image processing method is a tool that permits a fast, complete, and accurate acquisition of information. Using digital images in photogrammetry, the present study analyzes the discontinuity geometry of rock mass exposures. The study has demonstrated that (a) the transformation function is appropriate for images without any perspective error; (b) the developed system is versatile and can detect both lines as well as curves in multilinear form; (c) the Hough transform algorithm can provide excellent results for rock mass with multiple joint sets having considerable amount of noise; and (d) the beamlets can be classified in an automated manner. The authors recommend the digital face mapping method to characterize rock masses, as it reduces the time spent in the field, thus preserving data integrity. Furthermore, this technique allows for systematic mapping and the building of a permanent and huge database for rock mass characterization. (c) 2007 Elsevier Ltd. All rights reserved.

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

digital image processing
discontinuity geometry


Limits and perspectives of effective OD matrix correction using traffic counts Correction of the OD matrix from traffic counts is a classical procedure usually adopted in transport engineering by practitioners for improving the overall reliability of transport models. Recently, Papola and Marzano [Papola, A., Marzano, V., 2006. How can we trust in the OD matrix correction procedure using traffic counts? In: Proceedings of the 2006 ETC Conference, Strasbourg] showed through laboratory experiments that this procedure is generally unable to provide for effective correction of the OD matrix. From a theoretical standpoint, this result can be justified by the lower number of (stochastic) equations (independent observed link flows) with respect to the unknowns (OD flows). This paper first confirms that this represents the main reason for the failure of this procedure, showing that satisfactory correction is generally obtained when the number of equations is greater than the number of unknowns. Then, since this circumstance does not occur in practice, where the number of OD pairs usually far exceeds the number of link counts, we explore alternative assumptions and contexts, allowing for a proper balance between unknowns and equations. This can be achieved by moving to within-day dynamic contexts, where a much larger number of equations are generally available. In order to bound the corresponding increase in the number of unknowns, specific reasonable hypotheses on OD flow variation across time slices must be introduced. In this respect, we analyze the effectiveness of the OD matrix correction procedure in the usually adopted linear hypothesis on the dynamic process evolution of OD flows and under the assumption of constant distribution shares. In the second case it is shown that satisfactory corrections can be performed using a small number of time slices of up to 3min in length, leading to a time horizon in which the hypothesis of constant distribution shares can be regarded as trustworthy and realistic.

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

gls estimator
within-day dynamic
underdetermined linear system


Unicyclic networks: Compatibility and enumeration Graphs obtained from a binary leaf labeled ("phylogenetic") tree by adding an edge so as to introduce a cycle provide a useful representation of hybrid evolution in molecular evolutionary biology. This class of graphs (which we call "unicyclic networks") also has some attractive combinatorial properties, which we present. We characterize when a set of binary phylogenetic trees is displayed by a unicyclic network in terms of tree rearrangement operations. This leads to a triple-wise compatibility theorem and a simple, fast algorithm to determine 1-cycle compatibility. We also use generating function techniques to provide closed-form expressions that enumerate unicyclic networks with specified or unspecified cycle length, and we provide an extension to enumerate a class of multicyclic networks.

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

phylogenetic tree
compatibility
generating function


A comparative study of uncertainty propagation methods for black-box-type problems A wide variety of uncertainty propagation methods exist in literature; however, there is a lack of good understanding of their relative merits. In this paper, a comparative study on the performances of several representative uncertainty propagation methods, including a few newly developed methods that have received growing attention, is performed. The full factorial numerical integration, the univariate dimension reduction method, and the polynomial chaos expansion method are implemented and applied to several test problems. They are tested under different settings of the performance nonlinearity, distribution types of input random variables, and the magnitude of input uncertainty. The performances of those methods are compared in moment estimation, tail probability calculation, and the probability density function construction, corresponding to a wide variety of scenarios of design under uncertainty, such as robust design, and reliability-based design optimization. The insights gained are expected to direct designers for choosing the most applicable uncertainty propagation technique in design under uncertainty.

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

uncertainty propagation
full factorial numerical integration
dimension reduction method
polynomial chaos expansion
comparative study
design under uncertainty


Robust Multilayer Control for Enhanced Wireless Telemedical Video Streaming M-health is an emerging area of research and one of the key challenges in future research in this area is medical video streaming over wireless channels. Contrasting requirements of almost lossless compression and low available bandwidth have to be tackled in medical quality video streaming in ultrasound and radiology applications. On one side, compression techniques need to be conservative, in order to avoid removing perceptively important information; on the other side, error resilience and correction should be provided, with the constraint of a limited bandwidth. A quality-driven, network-aware approach for joint source and channel coding based on a controller structure specifically designed for enhanced video streaming in a robotic teleultrasonography system is presented. The designed application based on robotic teleultrasonography is described and the proposed method is simulated in a wireless environment in two different scenarios; the video quality improvement achievable through the proposed scheme in such an application is remarkable, resulting in a peak signal-to-noise ratio (PSNR) improvement of more than 4 dB in both scenarios.

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

wireless telemedicine
m-health
cross-layer design
robotic ultrasonography


An overview of local capacity in wireless networks This article introduces a metric for performance evaluation of medium access schemes in wireless ad hoc networks known as local capacity. Although deriving the end-to-end capacity of wireless ad hoc networks is a difficult problem, the local capacity framework allows us to quantify the average information rate received by a receiver node randomly located in the network. In this article, the basic network model and analytical tools are first discussed and applied to a simple network to derive the local capacity of various medium access schemes. Our goal is to identify the most optimal scheme and also to see how does it compare with more practical medium access schemes. We analyzed grid pattern schemes where simultaneous transmitters are positioned in a regular grid pattern, ALOHA schemes where simultaneous transmitters are dispatched according to a uniform Poisson distribution and exclusion schemes where simultaneous transmitters are dispatched according to an exclusion rule such as node coloring and carrier sense schemes. Our analysis shows that local capacity is optimal when simultaneous transmitters are positioned in a grid pattern based on equilateral triangles and our results show that this optimal local capacity is at most double the local capacity of ALOHA based scheme. Our results also show that node coloring and carrier sense schemes approach the optimal local capacity by an almost negligible difference. At the end, we also discuss the shortcomings in our model as well as future research directions.

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

wireless networks
capacity
node coloring

throughput
local capacity
mac
slotted aloha
csma
tdma
grid pattern based mac scheme


Improved Ring Oscillator PUF: An FPGA-friendly Secure Primitive In this paper, we analyze ring oscillator (RO) based physical unclonable function (PUF) on FPGAs. We show that the systematic process variation adversely affects the ability of the RO-PUF to generate unique chip-signatures, and propose a compensation method to mitigate it. Moreover, a configurable ring oscillator (CRO) technique is proposed to reduce noise in PUF responses. Our compensation method could improve the uniqueness of the PUF by an amount as high as 18%. The CRO technique could produce nearly 100% error-free PUF outputs over varying environmental conditions without post-processing while consuming minimum area.

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

ring oscillator
physical unclonable function
systematic process variation
uniqueness

challenge-response
process variations (pv)
reliability


Fast automatic medical image segmentation based on spatial kernel fuzzy c-means on level set method Fast two-cycle (FTC) model is an efficient and the fastest Level set image segmentation. But, its performance is highly dependent on appropriate manual initialization. This paper proposes a new algorithm by combining a spatially constrained kernel-based fuzzy c-means (SKFCM) algorithm and an FTC model to overcome the mentioned problem. The approach consists of two successive stages. First, the SKFCM makes a rough segmentation to select the initial contour automatically. Then, a fuzzy membership matrix of the region of interest, which is generated by the SKFCM, is used in the next stage to produce an initial contour. Eventually, the FTC scheme segments the image by a curve evolution based on the level set. Moreover, the fuzzy membership degree from the SKFCM is incorporated into the fidelity term of the ChanVese model to improve the robustness and accuracy, and it is utilized for the data-dependent speed term of the FTC. A performance evaluation of the proposed algorithm is carried out on the synthetic and real images. The experimental results show that the proposed algorithm has advantages in accuracy, computational time and robustness against noise in comparison with the KFCM, the SKFCM, the hybrid model of the KFCM and the FTC, and five different level set methods on medical image segmentation.

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

medical image segmentation
level set method
chanvese

fast two cycle
spatial kernel fuzzy c-means


call-cost directed register allocation Choosing the right kind of register for a live range plays a major role in eliminating the register-allocation overhead when the compiled function is frequently executed or function tails are on the most frequently executed paths. Picking the wrong kind of register for a live range incurs a high penalty that may dominate the total overhead of register allocation. In this paper, we present three improvements, storage-class analysis, benefit-driven simplification, and preference decision that are effective in selecting the right kind of register for a live range. Then we compare an enhanced Chaitin-style register allocator (with these three improvements) with priority-based and optimistic coloring.

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

role
live
simplification
register allocation
analysis
paper
preference

select color functional storage direct effect cost priorities class allocation


usably secure, low-cost authentication for mobile banking This paper explores user authentication schemes for banking systems implemented over mobile phone networks in the developing world. We analyze an authentication scheme currently deployed by an Indian mobile banking service provider which uses a combination of PINs and printed codebooks for authenticating users. As a first step, we report security weaknesses in that scheme and show that it is susceptible to easy and efficient PIN recovery attacks. We then propose a new scheme which offers better secrecy of PINs, while still maintaining the simplicity and scalability advantages of the original scheme. Finally, we investigate the usability of the two schemes with a sample of 34 current and potential customers of the banking system. Our findings suggest that the new scheme is more efficient, less susceptible to human error and better preferred by the target consumers.

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

authentication security usability paper mobile pin banking


Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization This paper deals with the preconditioning of truncated Newton methods for the solution of large scale nonlinear unconstrained optimization problems. We focus on preconditioners which can be naturally embedded in the framework of truncated Newton methods, i.e . which can be built without storing the Hessian matrix of the function to be minimized, but only based upon information on the Hessian obtained by the product of the Hessian matrix times a vector. In particular we propose a diagonal preconditioning which enjoys this feature and which enables us to examine the effect of diagonal scaling on truncated Newton methods. In fact, this new preconditioner carries out a scaling strategy and it is based on the concept of equilibration of the data in linear systems of equations. An extensive numerical testing has been performed showing that the diagonal preconditioning strategy proposed is very effective. In fact, on most problems considered, the resulting diagonal preconditioned truncated Newton method performs better than both the unpreconditioned method and the one using an automatic preconditioner based on limited memory quasi-Newton updating (PREQN) recently proposed by Morales and Nocedal [Morales, J.L. and Nocedal, J., 2000, Automatic preconditioning by limited memory quasi-Newton updating. SIAM Journal on Optimization , 10, 1079-1096].

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

conjugate gradient (cg) method
row-column scaling
equilibrated matrix


Modeling of extremal fuzzy dynamic systems. Part VI. Problems of states estimation (filtration) of extremal fuzzy process A fuzzy-integral model of an extremal fuzzy process (EFP) is considered. The model describes the evolution of one class of weakly structurable fuzzy dynamic systems (Klir 1985), i.e. of the so-called extremal fuzzy dynamic systems, which have been constructed in Part III of this work. In the present paper, problems of an optimal filtering of continuous as well as of discrete EFP are solved by means of "past" evaluating information. Sufficient conditions are established for the existence of an optimal estimating fuzzy process. Using only one "past" evaluating fuzzy state of the considered system, variants of fuzzy observers (representations of an optimal estimating EFP) are constructed in terms of approximation of piecewise-constant and extremally measurable filtration functions for continuous and discrete extremal fuzzy dynamic systems. The results obtained are illustrated by a numerical example.

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

composition extremal extended fuzzy measures and sugeno integral


The computational complexity of Tutte invariants for planar graphs For each pair of algebraic numbers (x, y), the complexity of computing the Tutte polynomial T(G; x, y) of a planar graph G is determined. This computation is found to be (#P) over bar -complete except when ( x - 1)( y - 1) = 1, 2 or when ( x, y) is one of (1, 1), (- 1,- 1), ( j, j(2)), or ( j(2), j), where j = e(2 pi i/ 3), in which case it is polynomial time computable. A corollary gives the computational complexity of various enumeration problems for planar graphs.

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

tutte polynomial
planar graphs
computational complexity
polynomial time
enumeration

knot polynomials
#p-complete
reliability
percolation
potts model


Corrigendum to Note on covering monotone orthogonal polygons [Inf. Process. Lett. 104(6) (2007) 220227] A minimum r-star coverage of monotone orthogonal polygons. An optimal linear-time and space-sensitive algorithm. This is a corrected version of our earlier algorithm (IPL 104(6) 220227).

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

computational geometry
covering polygons
orthogonal polygon


Genetic approach for dynamic OVSF code allocation in 3G wireless networks Orthogonal variable spreading factor (OVSF) codes provide variable data rate transmissions for different bandwidth requirements in 3G WCDMA networks. In order to effectively utilize limited OVSF resources, many works in the literature have focused on dynamic code assignment (DCA) schemes. This paper investigates genetic algorithm (GA) based approach for dynamic OVSF code assignment in WCDMA networks. Different from existing conventional code assignment (CCA) and dynamic code assignment schemes, population is adaptively constructed according to existing traffic density in the OVSF code-tree. In order to improve the ability of the GA, we employ so-called dominance & diploidy structure to adapt to changing traffic conditions. Performances of these two methods are evaluated in terms of blocking probability and spectral efficiency, and also compared with CCA and DCA. The simulation results show that the GA, especially with diploid structure, provides reduced code blocking probability and improved spectral efficiency in the system when compared to the CCA and DCA schemes. In addition to these, different GA operators are also tested under varying traffic loads to increase the overall system performance.

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

code allocation
genetic algorithm
ovsf
wcdma
3g wireless

dominance & diploidy
resource allocation


Javari: Adding reference immutability to Java This paper describes a type system that is capable of expressing and enforcing immutability constraints. The specific constraint expressed is that the abstract state of the object to which an immutable reference refers cannot be modified using that reference. The abstract state is (part of) the transitively reachable state: that is, the state of the object and all state reachable from it by following references. The type system permits explicitly excluding fields from the abstract state of an object. For a statically type-safe language, the type system guarantees reference immutability. If the language is extended with immutability downcasts, then run-time checks enforce the reference immutability constraints. This research builds upon previous research in language support for reference immutability. Improvements that are now in this paper include distinguishing the notions of assignability kind mutability; integration with Java 5's generic types and with multi-dimensional arrays; a mutability polymorphism approach to avoiding code duplication-, type-safe support for reflection and serialization; and formal type rules and type soundness proof for a core calculus. Furthermore, it retains the valuable features of the previous dialect, including usability by humans (as evidenced by experience with 160,000 lines of Javari code) and interoperability with Java and existing JVMs.

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

languages theory experimentation assignable mutable readonly verification


Semantic search for public opinions on urban affairs: A probabilistic topic modeling-based approach The explosion of online user-generated content (UGC) and the development of big data analysis provide a new opportunity and challenge to understand and respond to public opinions in the G2C e-government context. We proposed an approach based on the latent Dirichlet allocation (LDA) and designed a practical system to provide users with satisfying searching results and the longitudinal changing curves of related topics. Municipal administrators could better understand citizens online comments based on the proposed semantic search approach and could improve their decision-making process by considering public opinions.

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

public opinions
big data analysis
semantic search

probabilistic topic modeling
latent dirichlet allocation (lda)


A density functional theory study of phenyl formation initiated by ethynyl radical (C2H center dot) and ethyne (C2H2) An ab initio computational density functional theory (DFT) was used to study the formation of the first cyclic molecule (phenyl) initiated by the ethynyl radical (C2H center dot). The study covers a competition reaction between the addition reactions of C2H center dot with ethyne (C2H2) and some molecular re-arrangement schemes. The minimum energy paths of the preferred cyclic formation route were characterized. A thorough thermochemical analysis was performed by evaluating the differences in the energy of activation (Delta E), enthalpy (Delta H), and Gibb's free energy (Delta G) of the optimized stable and transition state (TS) molecules. The reaction temperatures were set to normal (T=298 K) and combustion (T=1,200 K) conditions.

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

density functional theory
ethyne
ethynyl radical
phenyl


Influence of the shape of intracellular potentials on the morphology of single-fiber extracellular potentials in human muscle fibers Attention of the investigators is usually pointed to the peak-to-peak characteristics of single-fiber action potentials (SFAPs) that are mainly determined by the depolarizing phase of the intracellular action potential (IAP). However, the final portion of the SFAP has often specific shape that has to be related to peculiarities of the repolarization phase of IAP and the duration of its spike. A novel piecewise SFAP model is proposed to achieve greater insight into the nature of declining portion of the negative phase and of the third phase of SFAP. It was found that the SFAP third phase is essentially determined by the specific profile of the transition of the IAP falling phase toward the resting voltage, whereas the SFAP declining negative phase is more dependent upon the width of the corresponding IAP spike. We tentatively suggest that the duration of the spike of human IAPs should be over approximately 0.75ms.

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

intracellular action potential
sfap third phase


A new method to determine the periodic orbit of a nonlinear dynamic system and its period Periodic motion is an important steady-state motion in the real world. In this paper, a new generalized shooting method for determining the periodic orbit of a nonlinear dynamic system and its period is presented by rebuilding the traditional shooting method. First, by changing the time scale, the period of the periodic orbit of a nonlinear system is drawn into the governing equation of this system explicitly. Then, the period is used as a parameter in the iteration procedure of the shooting method. The periodic orbit of the system and the period can be determined rapidly and precisely. The requirement of this method for the initial iteration conditions is not rigorous. This method can be used to analyze the forced nonlinear system and the parameter exciting system. As an example, the results of the Rssler equation for an eight-dimensional, nonlinear, flexible, rotor-bearing system are compared with those obtained by the Runge-Kutta integration algorithm. The validity of this method is verified by the numerical results obtained in the two examples.

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

shooting method
nonlinear dynamic system
periodic orbit


Combining volumetric dental CT and optical scan data for teeth modeling ? A novel teeth modeling framework by combining optical scan data and dental CT images is introduced. Co-segmentation between optical scan data and dental CT images is performed by the graph-cut method simultaneously. The proposed algorithm is automatic and time efficient, and shows high fidelity. Teeth data with defects such as metal artifacts can be completed successfully.

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

teeth segmentation
co-segmentation
graph-cut
advancing front method


text compression using prediction In the compression of the text files, the dependencies between the successive characters should be exploited to as great an extent as possible. There are two obvious possibilities: either to detect and encode often occurring character strings, or to encode successors of character blocks. This paper presents two methods based on the latter approach. In the first method we encode only the most probable successors of blocks, whereas in the second we encode them all, using the knowledge of their distribution. The second method uses recursion to store effectively the dependencies between the characters and this results in good compression gains in practical cases.

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

text character dependencies method knowledge paper recursion practical encode strings compression


There are no sparse NPW-hard sets In this paper we prove that, in the context of weak machines over R, there are no sparse NP-hard sets.

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

structural complexity
real number computations


Predicting the development of a homogenous population in an industrialized country The development of the Finnish population has been studied in order to predict its probable changes in the 21st century. More generally, the proposed iterative prediction procedure is useful for homogeneous populations in developed countries. The Finnish population is favorable for demographic studies because there exists accurate Finnish population data for a long historical period. Since several factors, for example natality, mortality, average female fertility and standard of living, have an impact on population, its modeling and prediction is an intricate matter. First, neural networks that are often efficient for nonlinear, complex systems were tried. However, it was found that there were far too many input parameters and a critical shortage of data to train and test neural networks. Instead, a straightforward, iterative procedure to predict the future development of the Finnish population was created, in particular giving its probable upper and lower limits.

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

population prediction
population renewal
reproduction rates
birth rates


Region- and Action-Aware Virtual World Clients We propose region- and action-aware virtual world clients. To develop such clients, we present a parameterized network traffic model, based on a large collection of Second Life traces gathered by us. Our methodology is also applicable to virtual worlds other than Second Life. With the traffic model, various optimization criteria can be adopted, including visual quality, response time, and energy consumption. We use energy consumption as the show case, and demonstrate via trace-driven simulations that, compared to two existing schemes, a mobile client can save up to 36% and 41% communication energy by selectively turning on its WiFi network interface.

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

performance
traffic measurement
traffic modeling


fluid aop join point models Aspect-oriented programming (AOP) allows programmers to modularize the implementation of crosscutting concerns. AspectJ and related languages achieve this with a linguistic approach, which enables different modules of the program to have a crosscutting structural relationship.In fluid AOP the development environment temporarily shifts a program to an alternative crosscutting module structure to enable specific editing or reasoning tasks. The program text can appear to have different crosscutting modularities simultaneously, as opposed to just having modules that crosscut each other.In this demonstration we show three possible fluid AOP designs, and compare their look and feel using common examples.

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

point
development environment
reasoning
structure
examples
implementation
module
text

crosscutting concern
fluid view
relationships
edit
language
design
demonstrate
model
linguistics
aspect-oriented programming
programmer


Finding patterns on protein surfaces: Algorithms and applications to protein classification A successful application of data mining to bioinformatics is protein classification. A number of techniques have been developed to classify proteins according to important features in their sequences, secondary structures, or three-dimensional structures. In this paper, we introduce a novel approach to protein classification based on significant patterns discovered on the surface of a protein. We define a notion called alpha-surface. We discuss the geometric properties of alpha-surface and present an algorithm that calculates the alpha-surface from a finite set of points in R-3. We apply the algorithm to extracting the alpha-surface of a protein and use a pattern discovery algorithm to discover frequently occurring patterns on the surfaces. The pattern discovery algorithm utilizes a new index structure called the Delta B+ tree. We use these patterns to classify the proteins. While most existing techniques focus on the binary classification problem, we apply our approach to classifying three families of proteins. Experimental results show the good performance of the proposed approach.

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

kdd
structural pattern discovery
biochemistry
medicine