Application of evolutionary programming to optimal operational strategy cogeneration system under time-of-use rates This paper presents the application of Evolutionary Programming (EP) to optimal operational strategy of cogeneration systems under Time-of-Use (TOU) rate. The fuel consumption and steam generation will first be measured and the InputOutput (I/O) curve derived using the regression method. The operational model developed also considers the connection of the cogeneration system with the utility company in terms of TOU rate and various fuel consumptions. EP was adopted to decide the optimal fuel dispatch, steam output of boiler, and generation output subjective to satisfying all the operation constraints. The NewtonRaphson based method has been implemented to show that EP does have the tendency of getting the global optimum. The proposed methodology could provide a practical model for both the utility company and the cogeneration industry to follow.

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

cogeneration system
evolutionary programming


A volume-of-fluid interfacial flow solver with advected normals We presented a new approach to calculating normal vectors to fluid interfaces in [JCP, 2007;226:774-97], by advecting unit normals along with an interface. In this paper, we introduce an implementation of the method in an interfacial flow solver. The advected normals are used to compute the interface curvature for calculating the surface tension force, and for reconstructing the interface in a volume-conserving volume-of-fluid (VOF) method. To improve the performance of the method in under-resolved regions of the flow, where normals vary sharply, a curvature-based criterion is used to detect and correct poorly defined normals. We present two-dimensional results of advection as well as actual flow problems and demonstrate that the new method is well suited for problems that involve large interface deformation and breakup (i.e. problems that involve substantial interface movement). (C) 2010 Elsevier Ltd. All rights reserved.

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

curvature
surface tension
interfacial flow

two-phase flow
spurious currents
volume-of-fluid
level set
advecting normals


A subspace matching color filter design methodology for a multispectral imaging system In this paper, we present a methodology to design filters for an imaging system to improve the accuracy of the spectral measurements for families of reflective surfaces. We derive the necessary and sufficient conditions that the sensor space of the system must obey in order to measure the spectral reflectance of the surfaces accurately. Through simulations, we show how these conditions can be applied to design filters using a set of sample spectral data acquired from extracted teeth. For this set of data, we also compare our results to those of Wolski's method [1], a conventional filter design method which produces filters that recover tristimulus values of surfaces accurately under several illuminants. We show that our method produces filters that capture the spectral reflectance better given the same number of measurements. The errors in predicting the color of the sample data are much lower under every test illuminant when the filters designed with our method are used.

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

color
filter design
multispectral
subspace


Toward advanced subgrid models for Lattice-Boltzmann-based Large-eddy simulation: Theoretical formulations This paper addresses the issue of developing advanced subgrid model for large-eddy simulations (LES) of turbulent flows based on Lattice Boltzmann methods (LBM). Most of already existing subgrid closures used in LES-LBM are straightforward extensions of the most crude model developed within the NavierStokes equations, namely the Smagorinsky eddy-viscosity model. In a first part, it is shown how to obtain an improved eddy-viscosity subgrid model for LBM. The original implementation of the Inertial-Range Consistent Smagorinsky model proposed by Dong and Sagaut for the D3Q19 scheme is used as an illustration. In a second step, an original extension of the Approximate Deconvolution Method proposed by Adams and Stolz for NavierStokes simulation is proposed. This new LBM-LES approach does not rely on the eddy-viscosity concept and is written directly within the LBM framework. It is shown that it can be implemented thanks to a trivial modification of the existing LBM solvers for Direct Numerical Simulation.

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

large-eddy simulations
turbulence
fluid mechanics
lattice boltzmann method


Fast multipole boundary element method using the binary tree structure with tight bounds: application to a calculation of an electrostatic force for the manipulation of a metal micro particle? ? Boundary element method is one of the most powerful tools to solve partial differential equations. However, it takes a lot of computational time when applied to an actual problem with a large number of unknowns. In this research, the binary tree structure with tight bounds and the downward pass for this structure are adopted for the fast multipole method to reduce the number of M2L translations, thereby further reducing the computational time. Furthermore, the recurrence formulae to calculate the multipole moments of a triangular element are derived. The fast multipole boundary element method using the binary tree structure with tight bounds is developed and the analyses of an electrostatic force acting on a metal micro particle above a complex structure are performed to confirm the effectiveness of this method.

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

boundary element method
fast multipole method
tree structure
electrostatic force

multipole moment
micro manipulation
micro machine


The dynamic behaviour of aerated continuous flow stirred tank bioreactor The dynamics of continuous stirred tank bioreactors (CSTB), in which microbial growth is subjected to gaseous substrate limitation, is analysed. The growth process is supposed to obey the classical model proposed by Monod for substrate limitation, or the hump exponential model, which considers the occurrence of both substrate limitation and inhibition. The yield coefficient is supposed to be a linear function of substrate concentration. the influence of mass transfer on the system behaviour is considered. The developments produced here are shown to include the particular case of a nongaseous limiting substrate, identified in a previous study [1]. Besides the purely analytical results, numerical bifurcation diagrams and phase portraits are given to show the influence of the system parameters on the bioreactor behaviour. (C) 2004 Elsevier Ltd. All rights reserved.

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

aerobic processes
dynamic simulation
fermentation
substrate inhibition


A simple architecture for computing moments and orientation of an image In this paper, a new methodology for computing orientation of a gray-tone image by the method of moments is described. Orientation is an essential feature needed in many image processing and pattern recognition tasks. Computation of moments is accomplished by a new projection method that leads to a fast algorithm of determining orientation. Using a simple architecture, the proposed algorithm can be implemented as a special purpose VLSI chip. The hardware cost of the proposed design is significantly lower compared to that of the existing architecture.

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


Promoting green ICT in China: A framework based on innovation system approaches Green ICT is a key enabler of a green economy. To aid policy makers in promoting green ICT at the national level, this paper proposes a comprehensive understanding of green ICT from the perspective of green innovation and develops an analytical framework based on innovation system approaches. Following the framework, policy makers can identify the critical system failures of a green ICT innovation system by assessing the key structural components of the system and, hence, formulate policies to solve them. The framework is used to analyze the green ICT innovation system in China. The findings indicate several critical system failures that hamper the development and diffusion of green ICT in China. Accordingly, policies are suggested to address the failures. This paper aids in the understanding of green ICT and contributes to the development of systematic approaches to formulating green ICT strategies. The Chinese experiences provide practical implications, which can be considered by other countries for reference.

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

green ict
innovation system
green innovation

environmental sustainability
system failure


On the second greedy weight for linear codes of dimension at least 4 The maximum of g(2) - d(2) for linear [n, k, d; q] codes C is studied. Here d(2) is the smallest size of the support of a two-dimensional subcode of C and g(2) is the smallest size of the support of a two-dimensional subcode of C which contains a codeword of weight d. For codes of dimension 4 or more, upper and lower bounds on the maximum of g(2) - d(2) are given.

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

constructions
generalized hamming weight


Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI Consider a planar grid of size wn w n . The vertices of the grid are called terminals and pairwise disjoint sets of terminals are called nets. We aim at routing all nets in a cubic grid (above the original grid holding the terminals) in a vertex-disjoint way. However, to ensure solvability, it is allowed to extend the length and the width of the original grid to w?=sw w ? = sw and n?=sn n ? = sn by introducing s-1 s - 1 pieces of empty rows and columns between every two consecutive rows and columns containing the terminals. Hence the routing is to be realized in a cubic grid of size (sn)(sw)h ( s n ) ( s w ) h . The objective is to minimize the height h . It is easy to show that the required height can be as large as h=?(max(n,w)) h = ? ( max ( n , w ) ) in the worst case. In this paper we show that if s?2 s ? 2 then a routing with height h = 6 max ( n , w ) can always be found in polynomial time. Furthermore, the constant factor 6 can be improved either by increasing the value of s or by limiting the number of terminals in a net. Possible trade-offs between s and h are discussed and the various constructions presented are compared by measuring the volumes of the routings obtained.

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


Electronic and optical properties of the Covalent Triazine-based Framework-1: First-principles calculations Electronic and optical properties of the Covalent Triazine-based Framework-1 (CTF-N) are determined using density functional theory implemented in the Quantum ESPRESSO program. In the present work, CTF-N was modified by replacing all N atoms with either P, As or Sb atoms, symbolized as CTF-P, CTF-As, and CTF-Sb, respectively. The energy gaps of the corresponding systems were evaluated. Our results revealed that the energy gap trend decreased as atomic radius was increased. These values were 2.02, 0.69, 0.22, and 0eV for CTF-N, CTF-P, CTF-As and CTF-Sb, respectively. By changing the concentration of either P or As in CTF-N, a non-linear relationship between energy gap and concentrations of P and As was found.

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

covalent triazine-based framework-1
optical band gap


Extracting degenerate modes and frequencies from time-domain simulations with filter-diagonalization ? A variant of the filter-diagonalization method, using targeted excitation to filter out unwanted modes, can extract exactly or nearly degenerate eigenmodes and frequencies from time-domain simulations. Excitation provides a particularly simple way to produce filtered states with already-existing time-domain simulations, while requiring minimal storage space. Moreover, using broader excitations that cover the entire range of desired frequencies requires just one-fifth as much computation as using narrow excitations. With this method, almost any time-domain code can be easily turned into an efficient eigenmode solver with little or no change to the code. To distinguish M degenerate modes requires running at least M different simulations, so the computational effort is proportional to the size of the degeneracy, no matter how closely-spaced the modes; however, from those M simulations many other non-degenerate modes can also be extracted with high accuracy, without much extra effort. This method allows relatively simple FDTD algorithms to compete with frequency-domain solvers, offering advantages of simplicity, flexibility and ease of implementation; also, it scales to very large problems and massively parallel computation, and it can be used to extract high-frequency modes without first having to identify lower-frequency modes. The accuracy of this method is demonstrated by finding eigenmodes and frequencies of an electromagnetic resonant cavity.

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

fdm
filter-diagonalization eigenmode
degenerate mode
normal mode analysis
harmonic inversion
simulation
time-domain


Practical experience of eliciting classes from use case descriptions In moving from requirements analysis to design, use cases are often recommended as the starting point for the derivation of classes. However, exactly how classes are to be found within the use case is not entirely obvious. Typical approaches suggest a simple noun/verb search or brainstorming. Recent work is moving towards an interrogation of the use case diagram as a means of validation and of the description (and scenario) to elicit objects in the problem domain. This paper presents a set of Elicitation Questions that enables the interrogation of descriptions from the perspectives of specification, software architecture and design. This qualitative interrogation teases out design issues. The Elicitation Questions were trialled through application to a real industrial project at a financial services company. Feedback from practitioners shows that the Elicitation Questions are important in raising design and testing issues from the use case descriptions but the organisational culture in how software is developed would impact its uptake.

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

use case descriptions
classes
elicitation


Comparison of 2D and 3D time-reverse imagingA numerical case study Time-reverse imaging has become an efficient tool to detect the origin of passively acquired seismic tremor signals. Practical experience has mainly been developed for 2D applications. Three component signals are reduced to two components and reverse propagated on the plane vertically below a station line. The data used for time-reverse imaging are the vertical and the horizontal particle displacement parallel to the line. Dropping the horizontal component perpendicular to the line causes partial loss of information on particle motion and directivity of the recorded waves. We present a comparison of 2D and 3D time-reverse imaging for a specific site with small cross-line gradients and investigate how closely 2D imaging approximates 3D imaging. Our large-scale synthetic survey with different S/N-ratios demonstrates how a subsurface source of tremor-like signals is imaged in different vertical planes. An imaging condition based on the energy density gives best results. We observe higher sensitivity to noise and stronger out-of-plane focusing for 2D than for 3D imaging. We suggest normalized visualization of multiple planes from 2D imaging in one 3D display as an approach to reliably locate sources. Comparison with examples of full 3D time-reverse imaging shows that normalized visualization of multiple 2D planes with a proper imaging condition can adequately approximate the result from full 3D imaging for the particular model considered in this study.

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

time-reverse imaging
wave propagation
source localization
finite-difference


Computing a T-transitive lower approximation or opening of a proximity relation Since transitivity is quite often violated even by decision makers that accept transitivity in their preferences as a condition for consistency, a standard approach to deal with intransitive preference elicitations is the search for a close enough transitive preference relation, assuming that such a violation is mainly due to decision maker estimation errors. In some way, the more number of elicitations, the more probable inconsistency is. This is mostly the case within a fuzzy framework, even when the number of alternatives or object to be classified is relatively small. In this paper we propose a fast method to compute a T-indistinguishability from a reflexive and symmetric fuzzy relation, being T any left-continuous t-norm. The computed approximation we propose will take O(n(3)) time complexity, where it is the number of elements under consideration, and is expected to produce a T-transitive opening. To the authors' knowledge, there are no other proposed algorithm that computes T-transitive lower approximations or openings while preserving the reflexivity and symmetry properties. (C) 2009 Elsevier B.V. All rights reserved.

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

fuzzy proximity relation
t-transitive relation
fuzzy similarity
t-indistinguishability
t-transitive lower approximation
t-transitive opening


Fusion of color and infrared video for moving human detection We approach the task of human silhouette extraction from color and thermal image sequences using automatic image registration. Image registration between color and thermal images is a challenging problem due to the difficulties associated with finding correspondence. However, the moving people in a static scene provide cues to address this problem. In this paper, we propose a hierarchical scheme to automatically find the correspondence between the preliminary human silhouettes extracted from synchronous color and thermal image sequences for image registration. Next, we discuss strategies for probabilistically combining cues from registered color and thermal images for improved human silhouette detection. It is shown that the proposed approach achieves good results for image registration and human silhouette extraction. Experimental results also show a comparison of various sensor fusion strategies and demonstrate the improvement in performance over non-fused cases for human silhouette extraction.

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

sensor fusion
image registration
human silhouette extraction

color image sequence
thermal image sequence
genetic algorithm


An industrial example using one-way analysis of circular-linear data An industrial example from the automotive industry is examined using the methodology of fitting C-linear curves to circular-linear data to determine the effect of factors from a factorial experiment. The goal of the analysis is to gain understanding about the inter-relationship between a directional component, the angle of imbalance from a brake rotor, and a corresponding linear measurement, the magnitude of correction needed to balance the part at that location on the rotor. A variety of inputs create eight different groups, each with a potentially different relationship between the angular and linear components. The two strategies considered are simplifying the relationship across the existing groups, and reducing the number of groups while preserving the general form of the relationship.

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

directional data
cylindrical data
stepwise regression
c-linear curve
factorial design
bivariate response
analysis of variance


Using Data Contention in Dual-ported Memories for Security Applications Field Programmable Gate Arrays (FPGA) provide the invaluable feature of dynamic hardware reconfiguration by loading configuration bit files. However, this flexibility also opens up the threat of theft of Intellectual Property (IP) since these configuration files can be easily extracted and cloned. In this context, the ability to bind an application configuration to a specific device is an important step to prevent product counterfeiting. Furthermore, such a technology can also enable advanced business models such as device-specific feature activation. In this work, we present a new technique to generate entropy on FPGA devicebased on data contention in the hardware circuitry. For this entropy, we use the output of intentionally generated write collisions in synchronous dual-ported block RAMs (BRAM). We show that the parts of this output generated by such write collisions can be either probabilistic but also deterministic and device-specific. The characteristics of such an entropy source can be used for a large variety of security applications, such as chip identification and device authentication. In addition to that, we also propose a solution to efficiently create cryptographic keys on-chip at runtime. As a last contribution, we eventually present a strategy how to transform this entropy source into a circuit for True Random Number Generation (TRNG).

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

write collisions
security applications
random number generation
data contention

field-programmable gate arrays
device identification
metastability
dual-ported block ram


stgenreg: A Stata Package for General Parametric Survival Analysis In this paper we present the Stata package stgenreg for the parametric analysis of survival data. Any user-defined hazard function can be specified, with the model estimated using maximum likelihood utilising numerical quadrature. Models that can be fitted range from the Weibull proportional hazards model to the generalized gamma model, mixture models, cure rate models, accelerated failure time models and relative survival models. We illustrate the features of stgenreg through application to a cohort of women diagnosed with breast cancer with outcome all-cause death.

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

survival analysis
numerical quadrature
maximum likelihood
stata


A tight bound for frameproof codes viewed in terms of separating hash families Frameproof codes have been introduced for use in digital fingerprinting that prevent a coalition of \(w\) or fewer legitimate users from constructing a fingerprint of another user not in the coalition. It turns out that \(w\)-frameproof codes are equivalent to separating hash families of type \(\{1,w\}\). In this paper we prove a tight bound for frameproof codes in terms of separating hash families.

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

frameproof code
separating hash family
68r05


Real solution isolation using interval arithmetic We propose a complete algorithm for real solution isolation for semialgebraic systems by using interval arithmetic. The algorithm is implemented as a Maple program Nrealzero and its performance on several examples is reported. (c) 2006 Elsevier Ltd. All rights reserved.

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

real solution isolation
interval arithmetic
semialgebraic systems
maple


production of pace as collaborative activity In this paper we investigate the concept of pace development and management among groups of people. We explore and compare groups visiting museums, and groups virtually co-located in a mixed reality system for a museum. In considering pace, and how to design to support it, we have to consider more than the speed or location of information display. We have to also take into consideration the social formation of pace through features such as the visitors' awareness of each other's location and attention. By considering aspects of collaboratively produced pace such as presenting engagement and disengagement, we offer suggestions as to how social handling of pace might be better supported by technology.

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

location awareness
cscw
visitor studies
mixed reality environments


speculative optimization using hardware-monitored guarded regions for java virtual machines Aggressive dynamic optimization in high-performance Java Virtual Machines can be hampered by language features like Java's exception model, which requires precise detection and handling of program-generated exceptions. Furthermore, the compile-time overhead of guaranteeing correctness of code transformations precludes many effective optimizations from consideration. This paper describes a novel approach for circumventing the optimization-crippling effects of exception semantics and streamlining the implementation of aggressive optimizations at run time. Under a hardware-software hybrid model, the runtime system delineates guarded regions of code and specifies a contract--in the simplest case, one that requires exception-free execution--that must be adhered to in order to ensure that the aggressively optimized code within that region will behave as the programmer expects. The contracted runtime condition is assumed to be true, and code within a guarded region is aggressively optimized based on this assumption. Hardware monitors for exceptions throughout the region execution, and undoes the effects of the guarded region if an exception occurs, re-executing the region with a conventionally optimized version. Since exceptions are very rare, code can be optimized as if optimization-crippling conditions did not exist, leading to compile time reduction, code quality improvement, and potential performance improvement up to 67.7\% and averaging 15.9\% in our limit study of a set of Java benchmarks.

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

transactional memory
speculative processors
precise exceptions


GLP: A cryptographic approach for group location privacy Recently, location privacy during the use of location-based services (LBSs) has raised considerable concerns. There is a wide literature on location privacy from the individual point of view; however, there exist only a few works to support location privacy for a group of users. In this paper, we consider location privacy issues for a group of users who may ask an LBS for a meeting place that minimizes their aggregate distance. The proposed solution, which we call the Group Location Privacy (GLP) protocol, is based on the Anonymous Veto network (AV-net) and homomorphic encryption. It preserves the location privacy of all users even in the case of collusion. Our solution also tries to minimize the LBS overhead for nearest neighbor (NN) queries and communication, i.e., to decrease the number of NN queries sent to an LBS and the number of points of interest (POIs) it returns. Furthermore, GLP greatly decreases the bandwidth usage to a high extent and protects the LBS provider from excessive disclosure of POIs. We discuss the performance and security analysis of the GLP protocol and show that the proposed protocol is secure against partial collusion in a malicious model. (c) 2012 Elsevier B.V. All rights reserved.

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

group nearest neighbor query
secure multiparty computation
location-based service


CASL - The common algebraic specification language: Semantics and proof theory CASL is an expressive specification language that has been designed to supersede. many, existing algebraic specification languages and provide a standard. CASL consists of several layers, including basic (unstructured) specifications, structured specifications and architectural specifications (the latter are used to prescribe the structure of implementations). We describe an simplified version of the CASL syntax, semantics and proof calculus at each of these three layers and state the corresponding soundness and completeness theorems. The layers are orthogonal in the sense that the semantics of a given layer uses that of the previous layer as a "black box", and similarly for the proof calculi. In particular, this means that CASL can easily be adapted to other logical systems.

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

formal software development
logic
institutions


Graphs for Mining-Based Defect Localization in Multithreaded Programs Trends in modern multicore architecture design requires software developers to develop and debug multithreaded programs. Consequently, software developers must face new challenges because of bug patterns occurring at runtime and due to the non-deterministic behavior of multi-threaded program executions. This calls for new defect-localization techniques. There has been much work in the field of defect localization for sequential programs on the one side and on the localization of specific multithreading bugs on the other side, but we are not aware of any general technique for multithreaded programs. This paper proposes such an approach. It generalizes data mining-based defect-localization techniques for sequential programs. The techniques work by analyzing call graphs. More specifically, we propose new graph representations of multithreaded program executions as well as two mining-based localization approaches based on these representations. Our evaluation shows that our technique yields good results and is able to find defects that other approaches cannot localize.

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

software-defect localization
applied data mining
graph mining


GENERIC FIBRATIONAL INDUCTION This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our results are semantic in nature and are inspired by Hermida and Jacobs' elegant algebraic formulation of induction for polynomial data types. Our contribution is to derive, under slightly different assumptions, a sound induction rule that is generic over all inductive types, polynomial or not. Our induction rule is generic over the kinds of properties to be proved as well: like Hermida and Jacobs, we work in a general fibrational setting and so can accommodate very general notions of properties on inductive types rather than just those of a particular syntactic form. We establish the soundness of our generic induction rule by reducing induction to iteration. We then show how our generic induction rule can be instantiated to give induction rules for the data types of rose trees, finite hereditary sets, and hyperfunctions. The first of these lies outside the scope of Hermida and Jacobs' work because it is not polynomial, and as far as we are aware, no induction rules have been known to exist for the second and third in a general fibrational framework. Our instantiation for hyperfunctions underscores the value of working in the general fibrational setting since this data type cannot be interpreted as a set.

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

algebraic semantics of data types
fibrations
category theory


Non-Monte Carlo formulations and computational techniques for the stochastic non-linear Schrdinger equation ? Stochastic ordinary and partial differential equations (SOPDEs) in various forms arise and are successfully utilized in the modeling of a variety of physical and engineered systems such as telecommunication systems, electronic circuits, cosmological systems, financial systems, meteorological and climate systems. While the theory of stochastic partial and especially ordinary differential equations is more or less well understood, there has been much less work on practical formulations and computational approaches to solving these equations. In this paper, we concentrate on the stochastic non-linear Schrdinger equation (SNLSE) that arises in the analysis of wave propagation phenomena, mainly motivated by its predominant role as a modeling tool in the design of optically amplified long distance fiber telecommunication systems. We present novel formulations and computational methods for the stochastic characterization of the solution of the SNLSE. Our formulations and techniques are not aimed at computing individual realizations, i.e., sample paths, for the solution of the SNLSE la Monte Carlo. Instead, starting with the SNLSE, we derive new systems of differential equations and develop associated computational techniques. The numerical solutions of these new equations directly produce the ensemble-averaged stochastic characterization desired for the solution of the SNLSE, in a non-Monte Carlo manner without having to compute many realizations needed for ensemble-averaging.

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

stochastic partial differential equations

stochastic non-linear schrdinger equation


Multiple empirical kernel learning based on local information The traditional multiple kernel learning (MKL) is usually based on implicit kernel mapping and adopts a certain combination of kernels instead of a single kernel. MKL has been demonstrated to have a significant advantage to the single-kernel learning. Although MKL sets different weights to different kernels, the weights are not changed over the whole input space. This weight setting might not been fit for those data with some underlying local distributions. In order to solve this problem, Gnen and Alpayd?n (2008) introduced a localizing gating model into the traditional MKL framework so as to assign different weights to a kernel in different regions of the input space. In this paper, we also integrate the localizing gating model into our previous work named MultiK-MHKS that is an effective multiple empirical kernel learning. In doing so, we can get multiple localized empirical kernel learning named MLEKL. Our contribution is that we first establish a localized formulation in the empirical kernel learning framework. The experimental results on benchmark data sets validate the effectiveness of the proposed MLEKL.

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

multiple kernel learning
implicit kernel mapping
local information
gating model

empirical kernel mapping
pattern classification


compiling real-time programs into schedulable code We present a programming language with first-class timing constructs, whose semantics is based on time-constrained relationships between observable events. Since a system specification postulates timing relationships between events, realizing the specification in a program becomes a more straightforward process. Using these constraints, as well as those imposed by data and control flow properties, our objective is to transform the code so that its worst-case execution time is consistent with its real-time requirements. To accomplish this goal we first translate an event-based source program into intermediate code, in which the timing constraints are imposed on the code itself, and then use a compilation technique which synthesizes feasible code from the original source program.

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

requirements
program
use
relationships
code
data
process
compilation
control flow
timing
programming language

translation
observability
systems
semantic
worst-case execution time
event
time constraint
object
consistency
constraint
real-time
transformation
class


Testing a decision-theoretic approach to the evaluation of information retrieval systems With information overload a real problem, especially on the Internet, there has been much interest in developing effective and efficient information retrieval (IR) systems. The various information retrieval approaches will require accurate evaluation to justify the requisite substantial development and implementation investment. Recently, a comprehensive and integrated evaluation model has been proposed and illustrated. By analyzing the evaluation measures using the analytic hierarchy process (AHP), the model transforms IR evaluation into a multi-criteria decision making (MCDM) problem, which assesses both the IR outcome and the interactive IR process. This paper extends that research by refining the evaluation model and by testing the research question through mathematical testing and simulation. The tests confirm the need to include both process and outcome criteria in any IR evaluation and prove the superiority of the proposed decision-theoretic approach over the traditional evaluation methodologies that focus on the IR outcome alone.

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

evaluation
decision making
analytic hierarchy process

information retrieval system
information search process
multi-criteria model


Graphics processing unit (GPU) programming strategies and trends in GPU computing Over the last decade, there has been a growing interest in the use of graphics processing units (GPUs) for non-graphics applications. From early academic proof-of-concept papers around the year 2000, the use of GPUs has now matured to a point where there are countless industrial applications. Together with the expanding use of GPUs, we have also seen a tremendous development in the programming languages and tools, and getting started programming GPUs has never been easier. However, whilst getting started with GPU programming can be simple, being able to fully utilize GPU hardware is an art that can take months or years to master. The aim of this article is to simplify this process, by giving an overview of current GPU programming strategies, profile-driven development, and an outlook to future trends.

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

heterogeneous computing
profiling
optimization
debugging


A2EPG: A new software for the analysis of electrical penetration graphs to study plant probing behaviour of hemipteran insects We built an application for automatic processing of EPG records. The application incorporates search engines for five EPG waveforms. The application indicates the time spans of each recognised waveform. We examined the effectiveness of the application in two aphid species. Different recognition efficacies depending on the analysed waveform were found.

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


Novel coarse-to-fine dual scale technique for tuberculosis cavity detection in chest radiographs Although many lung disease diagnostic procedures can benefit from computer-aided detection (CAD), current CAD systems are mainly designed for lung nodule detection. In this article, we focus on tuberculosis (TB) cavity detection because of its highly infectious nature. Infectious TB, such as adult-type pulmonary TB (APTB) and HIV-related TB, continues to be a public health problem of global proportion, especially in the developing countries. Cavities in the upper lung zone provide a useful cue to radiologists for potential infectious TB. However, the superimposed anatomical structures in the lung field hinder effective identification of these cavities. In order to address the deficiency of existing computer-aided TB cavity detection methods, we propose an efficient coarse-to-fine dual scale technique for cavity detection in chest radiographs. Gaussian-based matching, local binary pattern, and gradient orientation features are applied at the coarse scale, while circularity, gradient inverse coefficient of variation and KullbackLeibler divergence measures are applied at the fine scale. Experimental results demonstrate that the proposed technique outperforms other existing techniques with respect to true cavity detection rate and segmentation accuracy.

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

classification
computer-aided detection (cad)
tuberculosis (tb)


Perspective framework on the fourth-generation mobile communication systems Emergence of the fourth generation mobile communication system (4G system) is now in its dawn. This article proposes a perspective framework on the 4G system, and discusses various kinds of system aspects and technological requirements in terms of novel service features, spectrum management, radio access technologies, wired access integration, core network, and mobile terminal. The focus of the article is to define the scope and features of the 4G system in an overall system/network viewpoint. From the foreseeable development trends, it is highly expected that whatever emerges in the 4G system will be some kind of constantly evolving and grand recursive concatenation of all the existing system/network developments.

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

fourth-generation
mobile communications
cdma
wireless multimedia


Subjectively adapted high capacity lossless image data hiding based on prediction errors This article reports on a lossless data hiding scheme for digital images where the data hiding capacity is either determined by minimum acceptable subjective quality or by the demanded capacity. In the proposed method data is hidden within the image prediction errors, where the most well-known prediction algorithms such as the median edge detector (MED), gradient adjacent prediction (GAP) and Jiang prediction are tested for this purpose. In this method, first the histogram of the prediction errors of images are computed and then based on the required capacity or desired image quality, the prediction error values of frequencies larger than this capacity are shifted. The empty space created by such a shift is used for embedding the data. Experimental results show distinct superiority of the image prediction error histogram over the conventional image histogram itself, due to much narrower spectrum of the former over the latter. We have also devised an adaptive method for hiding data, where subjective quality is traded for data hiding capacity. Here the positive and negative error values are chosen such that the sum of their frequencies on the histogram is just above the given capacity or above a certain quality.

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

reversible data hiding
image watermarking


assessing the attractiveness of interactive systems Qualities beyond usefulness and traditional usability are increasingly being recognised as important in HCI. A common understanding of which factors affect the overall user experience and how they interrelate is still to be established. In a theory-led approach, users' perceptions of qualities that together contribute to the overall 'attractiveness' of a system are investigated. An empirical study with three live websites from Stanford University demonstrates a halo effect of aesthetics on perceptions of usability and content. However, the perception and impact of aesthetics are significantly affected by users' backgrounds and tasks.

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

user experience
attractiveness
aesthetics


Generalizing WDN simulation models to variable tank levels In water distribution network (WDN) steady-state modelling, tanks and reservoirs are modelled as nodes with known heads. As a result, the tank levels are upgraded after every steady-state simulation (snapshot) using external mass balance equations in extended period simulation (EPS). This approach can give rise to numerical instabilities, especially when tanks are in close proximity. In order to obtain a stable EPS model, an unsteady formulation of the WDN model has recently introduced. This work presents an extension of the steady-state WDN model, both for demand-driven and pressure-driven analyses, allowing the direct prediction of head variation of tank nodes with respect to an initial state. Head variations at those nodes are introduced as internal unknowns in the model, the variation of tank levels can be analyzed in the single steady-state simulation and EPS can be performed as a sequence of simulations without the need for external mass balances. The extension of mass balance at tank nodes allows the analysis of some technically relevant demand components. Furthermore, inlet and outlet head losses at tank nodes are introduced and large cross-sectional tank areas are allowed by the model and reservoirs become a special case of tanks. The solution algorithm is the generalized-global gradient algorithm (G-GGA), although the proposed WDN model generalization is universal.

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

extended period simulation
water distribution network

tank modelling
water network modelling
water network simulation


summarization scheme based on near-duplicate analysis This paper presents our approach to select relevant sequences from raw videos in order to generate summaries to Trecvid 2008 BBC Rush Task. Our system is composed of two major steps: First, the system detects "semantic" shot boundaries and keeps only non-redundant shots; then, the system estimates average motion for each shot, as a criterion of amount of information, to better share out the duration of the summary between remaining shots. The first step is based on a fast near-duplicate retrieval using Locality Sensitive Hashing (LSH) which provides results in few seconds (if we do not take into account decoding and encoding processes). The evaluation of Trecvid shows very promising results, since we ranked 17 th over 43 runs, regarding redundancy measure (RE), and 18 th for object and event inclusion (IN). These balanced results (most of best teams for the first criterion are among the latest for the second one) show that our method offers a quite good trade-off between false negatives (IN) and false positives (RE).

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


Fully developed mixed convection flow of a viscoelastic fluid between permeable parallel vertical plates This paper deals with the fully developed mixed convection flow of a viscoelastic fluid between permeable parallel vertical walls. The equations are modelled using the fully developed flow conditions. An exact solution is obtained for the fluid velocity and temperature distributions. The results are graphically displayed and the influence of the viscoelastic parameter K K , Reynolds number Re , Grashof number Gr G r , cross-flow parameter R R and Prandtl number Pr is discussed.

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

mixed convection
viscoelastic fluid
exact solution


A network model for blind source extraction in various ill-conditioned cases This paper discusses blind source extraction in various ill-conditioned cases based on a simple extraction network model. Extractability is first analyzed for the following ill-conditioned cases: the mixing matrix is square but singular, the number of sensors is smaller than that of sources, the number of sensors is larger than that of sources but the column rank of mixing matrix is deficient, and the number of sources is unknown and the column rank of mixing matrix is deficient. A necessary and sufficient condition for extractability is obtained. A cost function and an unsupervised learning algorithm for the extraction network model are developed. Simulation results are also presented to show the validity of the theoretical results and the performance and characteristics of the learning algorithm.

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

ill-conditioned cases
sequential blind extraction
adaptive algorithm


A systematic model-based analysis of a downer regenerator in fluid catalytic cracking processes Performance improvement of a catalyst regenerator for gasoline production in a fluid catalytic cracking (FCC) process is needed to achieve higher burning efficiency. This study performed a systematic model-based analysis of a downer-type regenerator to recover the activity of FCC catalyst by using a one-dimensional model of the regenerator coupled with its hydrodynamic characteristics and the kinetics of catalyst regeneration. The results of a sensitivity analysis showed that higher carbon content on spent catalyst causes a higher regeneration temperature. The ratio of the recycled-to-spent catalyst flow rate in range of 1.0-3.5 and temperatures of the spent catalyst in range of 703.15-803.15 K have insignificant effects on the overall performance of the regenerator. The suitable superficial gas velocity and the spent catalyst flow rate are in range of 4-7 m s(-1) and 20-40 kg m(-2) s(-1), respectively. (C) 2012 Elsevier Ltd. All rights reserved.

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

downer regenerator
fluid catalytic cracking

model-based analysis
performance analysis


A pattern recognition model for predicting a financial crisis in Turkey: Turkish Economic Stability Index Using the pattern recognition paradigm, we have designed a scalar composite leading indicator that predicts a financial crisis in Turkey about six months in advance. Logistic regression was employed to distinguish between near-crisis months and safe months from January 1998 through October 2000, which is the last month before the most recent crisis in Turkey. Thus trained and once validated, the Turkish Economy Stability Index (TESI) was then successfully tested using independent data from the 1994 crisis. One of the two dimensionless attributes that we integrated into TESI, the capital adequacy ratio of banks, a precursor of banking crises, was selected from among seven precursors of the 1997 Asian Financial Crisis. The other one, the ratio of international reserves to short term outstanding external debt, is itself a precursor of currency crises. Our method for designing TESI may easily be applied to other emerging markets provided that they have had at least one financial crisis in recent history.

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

pattern recognition
logistic regression
turkey
emerging markets
economic stability

financial crises
data mining
classification
south asia
advance warning
leading indicators


On some applications of generalized functionality for arithmetic discrete planes Naive discrete planes are well known to be functional on a coordinate plane. The aim of our paper is to extend the functionality concept to a larger family of arithmetic discrete planes, by introducing suitable projection directions (?1,?2,?3) satisfying ?1v1+?2v2+?3v3=w. Several applications are considered. We first study certain local configurations, that is, the (m,n)-cubes introduced in Ref. [J. Vittone, J.-M. Chassery, (n,m)-cubes and Farey Nets for Naive Planes Understanding, in: DGCI, 8th International Conference, Lecture Notes in Computer Science, vol. 1568, Springer-Verlag, 1999, pp. 7687.]. We compute their number for a given (m,n) and study their statistical behaviour. We then apply functionality to formulate an algorithm for generating arithmetic discrete planes, inspired by Debled-Renesson [I. Debled-Renesson, Reconnaissance des Droites et Plans Discrets, Thse de doctorat, Universit Louis Pasteur, Strasbourg, France, 1995.]. We also prove that an arithmetic discrete plane may be endowed with a combinatorial surface structure, in the spirit of Ref. [Y. Kenmochi, A. Imiyam Combinatorial topologies for discrete planes, in: DGCI, 11th International Conference, DGCI 2003, Lecture Notes in Computer Science, vol. 2886, Springer-Verlag, 2003, pp. 144153.].

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

digital planes
arithmetic planes
functionality of discrete planes


Impact of Traffic Influxes: Revealing Exponential Intercontact Time in Urban VANETs Intercontact time between moving vehicles is one of the key metrics in vehicular ad hoc networks (VANETs) and central to forwarding algorithms and the end-to-end delay. Due to prohibitive costs, little work has conducted experimental study on intercontact time in urban vehicular environments. In this paper, we carry out an extensive experiment involving thousands of operational taxies in Shanghai city. Studying the taxi trace data on the frequency and duration of transfer opportunities between taxies, we observe that the tail distribution of the intercontact time, that is, the time gap separating two contacts of the same pair of taxies, exhibits an exponential decay, over a large range of timescale. This observation is in sharp contrast to recent empirical data studies based on human mobility, in which the distribution of the intercontact time obeys a power law. By analyzing a simplified mobility model that captures the effect of hot areas in the city, we rigorously prove that common traffic influxes, where large volume of traffic converges, play a major role in generating the exponential tail of the intercontact time. Our results thus provide fundamental guidelines on design of new vehicular mobility models in urban scenarios, new data forwarding protocols and their performance analysis.

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

vehicular ad hoc networks
intercontact time
exponential tail
mobility model


Multivariate polynomial regression for identification of chaotic time series Multivariate polynomial regression was used to generate polynomial iterators for time series exhibiting autocorrelations. A stepwise technique was used to add and remove polynomial terms to ensure the model contained only those terms that produce a statistically significant contribution to the fit. An approach is described in which datasets are divided into three subsets for identification, estimation, and validation. This produces a parsimonious global model that is can greatly reduce the tendency towards undesirable behaviours such as over fitting or instability. The technique was found to be able to identify the nonlinear dynamic behaviour of simulated time series, as reflected in the geometry of the attractor and calculation of multiple Lyapunov exponents, even in noisy systems. The technique was applied to times series data obtained from simulations of the Lorenz and Mackey - Glass equations with and without measurement noise. The model was also used to determine the embedding dimension of the Mackey - Glass equation.

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

multivariate polynomial regression
identification

nonlinear modelling
lyapunov coeffcients
chaos


Elasto-plastic static stress analysis of 3D contact problems with friction by using the boundary element method In this paper, a boundary element method for three-dimensional elasto-plastic stress analysis of frictional contact problems in the framework of small strains and small displacements is presented. The contact conditions are used to unite the different system of equations for each body in contact. Several types of contact interface conditions are covered including infinite friction, frictionless and Coulomb friction. In order to include plastic deformation, the initial strain formulation and von Mises yield criterion are employed. The proposed algorithm is applied to the elasto-plastic analysis of the frictionless rigid punch, a large plate with a rigid, circular, cylindrical inclusion under the increasing load and the ceramic femoral head frictional contact problem.

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


Competitor and vendor influence on the adoption of innovative applications in electronic commerce The rapid growth of the Internet over the past 5 years has greatly increased interest in its potential use of the Internet for electronic commerce (EC), particularly as a vehicle for transactions between customers and suppliers. Today, Internet-based EC applications are in their infancy and investments in innovative information technology (IT) applications are risky and expensive. The managerial decision, to adopt these EC applications early or wait for the technology to become more established, is not trivial. Early adoption poses significant demand and technological risks, but the rewards could be great. We report on an empirical investigation of the influences on the adoption decision for one of the earliest EC applications, the automated teller machine (ATM) system, to determine whether marketing efforts by hardware and software vendors, imitation of competitors or a mixture of influences affected these decisions among bank managers. We develop a time series of cumulative ATM adoption estimates for 19711992 and use these data to fit three models from the diffusion of innovation literature, the external, internal and mixed influence models. The results suggest that imitation and communication among industry competitors was most important, but marketing efforts by the technology vendors were also important in the first few years after the introduction of the technology.

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

electronic commerce
automated teller machine
atm
diffusion of innovation

world wide web
information technology adoption
information systems


Chaospy: An open source tool for designing methods of uncertainty quantification Software for modeling uncertainty using Monte Carlo and polynomial chaos expansions. Used from Python with a programming syntax close to the mathematical theory. Can equip forward model with uncertainty quantication results from minimal code. Highly modular software structure, aimed to serve both experts and non-experts. Software compares favorably in functionality with competing packages.

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

uncertainty quantification
polynomial chaos expansions

monte carlo simulation
rosenblatt transformations
python package


Vertex and tree arboricities of graphs This paper studies the following variations of arboricity of graphs. The vertex ( respectively, tree) arboricity of a graph G is the minimum number va( G) ( respectively, ta( G)) of subsets into which the vertices of G can be partitioned so that each subset induces a forest ( respectively, tree). This paper studies the vertex and the tree arboricities on various classes of graphs for exact values, algorithms, bounds, hamiltonicity and NP-completeness. The graphs investigated in this paper include block-cactus graphs, series-parallel graphs, cographs and planar graphs.

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

acyclic
block-cactus graph
series-parallel graph
cograph
girth
planar graph
hamiltonian cycle


Towards optimal use of incomplete classification data Data for classification are often incomplete. The multiple-values construction method (MVCM) can be used to include data with missing values for classification. In this study, the MVCM is implemented by using fuzzy sets theory in the context of classification with discrete data. By using the fuzzy sets based MVCM, data with missing values can add values to classification, but can also introduce excessive uncertainty. Furthermore, the computational cost for the use of incomplete data could be prohibitive if the scale of missing values is large. This paper discusses the association between classification performance and the use of incomplete data. It proposes an algorithm of near-optimal use of incomplete classification data. An experiment with real-world data demonstrates the usefulness of the algorithm.

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

classification
incomplete data
missing values
fuzzy sets


A novel architecture for Web service composition Web services enable application-to-application interactions over networks. They have functional, behavioral, non-functional, and semantic characteristics. Web service composition is the mechanism for combining and reusing existing Web services to create new Web services. In this paper, we propose a novel architecture for Web service composition. The proposed architecture extends the standard Web services business model to explicitly support Web services composition. It also enables the description of Web services with all four of their characteristics (i.e. functional, behavioral, non-functional, and semantic characteristics). Furthermore, it uses formal methods (that take into account all of these characteristics) to enable the matching, selection, and assembling of the Web services that are needed in the composition process. The architecture is made up of three components: a business model, a composition framework, and a description framework. The business model introduces three new entities: a Web service composer, a Web service composition registry, and a third-party Web service provider. The Web service composer has the overall responsibility of the composition process and is realized by the composition framework. The composition framework uses matchmaking, categorization, and assembly techniques to carry out the actual composition, taking into account all of the characteristics. The description framework provides the languages required to describe the Web services in both the business model and the composition framework. It also integrates the languages in a common semantic domain of HOL (an expressive high-level logic). These languages are SAWSDL (a semantic and functional language), MSC (a formal behavioral language), and NFSL (an XML-based nonfunctional language). NFSL is a simple new language that we propose, while SAWSDL and MSC are existing languages. (C) 2011 Elsevier Ltd. All rights reserved.

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

web service composition
description framework
composition framework

web service business model
matchmaking technique


Comment on: The three-dimensional flow past a stretching sheet and the homotopy perturbation method, by P.D. Ariel, Computers and Mathematics with Applications 54 (2007) 920925 In his application of the homotopy perturbation (HP) method to the problem of the three-dimensional flow past a stretching sheet, P.D. Ariel [The three-dimensional flow past a stretching sheet and the homotopy perturbation method, Comput. Math. Appl. 54 (2007) 920925] encountered secular terms in the second order approximation, which he could not avoid. It is shown here that these secular terms can be removed by coordinate straining. Moreover, the form of an HP solution, which is free from secular terms at all levels of approximation, and which can be determined recursively, is indicated.

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

homotopy perturbation method
secular terms
coordinate straining


Both color and gray scale secret images hiding in a color image In the past, most image hiding techniques have been applied only to gray scale images. Now, many valuable images are color images. Thus, it has become important to be able to apply image-hiding techniques to hide color images. In this paper, our proposed scheme can not only be applied to "a color host image hiding a color secret image", but also to "a color host image hiding a gray scale secret image". Our scheme utilizes the rightmost 3, 2 and 3 bits of the R, G, B channels of every pixel in the host image to hide related information from the secret image. Meanwhile, we utilize the leftmost 5, 6, 5 bits of the R, G, B channels of every pixel in the host image and set the remaining bits as zero to generate a palette. We then use the palette to conduct color quantization on the secret image to convert its 24-bit pixels into pixels with 8-bit palette index values. DES encryption is then conducted on the index values before the secret image is embedded into the rightmost 3, 2, 3 bits of the R, G, B channels of every pixel in the host image. The experimental results show that even under the worst case scenario our scheme guarantees an average host image PSNR value of 39.184 and an average PSNR value of 27.3415 for the retrieved secret image. In addition to the guarantee of the quality of host images and retrieved secret images, our scheme further strengthens the protection of the secret image by conducting color quantization and DES encryption on the secret image in advance. Therefore, our scheme not only expands the application area of image hiding, but is also practical and secure.

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

color image hiding
cryptography technique


Category theoretic semantics for typed binding signatures with recursion We generalise Fiore et al's account of variable binding for untyped cartesian contexts to give an account of binding for either variables or names that may be typed. We do this in an enriched setting, allowing the incorporation of recursion into the analysis. Extending earlier work by us, we axiomatise the notion of context by defining and using the notion of an enriched pseudo-monad S on V-Cat, with leading examples of V given by Set and omega Cpo, the latter yielding an account of recursion. Fiore et al implicitly used the pseudo-monad T-fp on Cat for small categories with finite products. Given a set A of types, our extension to typed binders and enrichment involves generalising from Fiore et al's use of [F, Set] to [(SA)(op), V-A]. We define a substitution monoidal structure on [(SA)(op), V-A], allowing us to give a definition of binding signature at this level of generality, and extend initial algebra semantics to the typed, enriched axiomatic setting. This generalises and axiomatises previous work by Fiore et al and later authors in particular cases. In particular, it includes the Logic of Bunched Implications and variants, infinitary examples, and structures not previously considered such as those generated by finite limits.

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

pseudo-monad
pseudo-distributive law
binding signature


noc-aware cache design for chip multiprocessors The performance of chip multiprocessors (CMPs) is dependent on the data access latency, which is highly dependent on the design of the on-chip interconnect (NoC) and the organization of the memory caches. However, prior research attempts to optimize the performance of the NoC and cache mostly in isolation of each other. In this work we present a NoC-aware cache design that focuses on communication locality ; a property both the cache and NoC affect and can exploit.

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


Stop-band characterization of an isolated DGS for reducing mutual coupling between adjacent antenna elements and experimental verification for dielectric resonator antenna array A new technique to characterize an isolated defected ground structure (DGS) is explored. The technique is used to optimize the dimensions of a compact partial-ring DGS to suppress mutual coupling between two E-plane coupled cylindrical dielectric resonator antennas. The optimized design is verified experimentally using a set of fabricated prototypes operating in S-band. A suppression up to 67dB, showing good agreement with the predicted values, is experimentally demonstrated.

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

defected ground structure
dielectric resonator antenna
mutual coupling


Bond graph representations of hydraulic pipelines using normal modes with dissipative friction The one-dimensional (1-D) unsteady-pressure-flow equations of hydraulic pipeline can be approximated and solved numerically using a finite-mode approach. This paper deals with constructing bond graph representations for the hydraulic pipelines with laminar flow by using the previously established 1-D linear-friction bond graph structures and modal approximation techniques when 2-D frequency-dependent friction is taken into account. To model hydraulic pipelines as components in different systems using bond graphs, there are four possible input-output causalities: pressure inputs at both ends, flow rate input at both ends and the two cases of mixed inputs. In this paper, all four configurations are considered. The developed bond graph structures together with their corresponding modal parameters are presented. A comparison is made for three models, namely lossless, 1-D linear fluid friction and 2-D fluid friction. Simulation results show that the modified bond graph models studied in this work can give more satisfactory results.

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


Parameterized Analysis of Paging and List Update Algorithms It is well-established that input sequences for paging and list update have locality of reference. In this paper we analyze the performance of algorithms for these problems in terms of the amount of locality in the input sequence. We define a measure for locality that is based on Dennings working set model and express the performance of well known algorithms in terms of this parameter. This explicitly introduces parameterized-style analysis to online algorithms. The idea is that rather than normalizing the performance of an online algorithm by an (optimal) offline algorithm, we explicitly express the behavior of the algorithm in terms of two more natural parameters: the size of the cache and Dennings working set measure. This technique creates a performance hierarchy of paging algorithms which better reflects their experimentally observed relative strengths. It also reflects the intuition that a larger cache leads to a better performance. We also apply the parameterized analysis framework to list update and show that certain randomized algorithms which are superior to MTF in the classical model are not so in the parameterized case, which matches experimental results.

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

online algorithms
paging
list update
locality of reference


A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications We introduce a special new class of cellular automata(CA) whose inter-cell communication is restricted to 1-bit. Several design examples for 1-bit inter-cell communication cellular algorithms are given. It is shown that infinite non-regular sequences such as {2(n)/n = 1, 2, 3,..}, In {n(2)/n = 1, 2, 3,..} and Fibonacci sequences can be generated in real-time by cellular automata with 1-bit inter-cell communications. In addition, twice real-time prime generation algorithm is also given.

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


Path clustering in software timing analysis Verification of program running time is essential in system design with real-time constraints. Simulation with incomplete test patterns or simple instruction counting are not appropriate for complex architectures. Software running times of embedded systems are process state and input data dependent. Formal analysis of such dependencies leads to software running time intervals rather than single values. These intervals depend on program properties, execution paths, and states of processes, as well as on the target architecture. An approach to analysis of process behavior using running time intervals is presented. It improves our previous work by exploiting program segments with single paths and by taking the execution context into account. The example of an asynchronous transfer mode (ATM) cell handier demonstrates significant improvements in analysis precision. Experimental results show the superiority of the presented approach over well-established approaches.

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

performance analysis
real-time systems
software timing estimation
system level design


The matricial relaxation of a linear matrix inequality Given linear matrix inequalities (LMIs) L-1 and L-2 it is natural to ask: (Q(1)) when does one dominate the other, that is, does L-1(X) >= 0 imply L-2(X) >= 0? (Q(2)) when are they mutually dominant, that is, when do they have the same solution set? The matrix cube problem of Ben-Tal and Nemirovski (SIAM J Optim 12:811-833, 2002) is an example of LMI domination. Hence such problems can be NP-hard. This paper describes a natural relaxation of an LMI, based on substituting matrices for the variables x(j). With this relaxation, the domination questions (Q(1)) and (Q(2)) have elegant answers, indeed reduce to constructible semidefinite programs. As an example, to test the strength of this relaxation we specialize it to the matrix cube problem and obtain essentially the relaxation given in Ben-Tal and Nemirovski (SIAM J Optim 12: 811-833, 2002). Thus our relaxation could be viewed as generalizing it. Assume there is an X such that L-1(X) and L-2(X) are both positive definite, and suppose the positivity domain of L-1 is bounded. For our "matrix variable" relaxation a positive answer to (Q(1)) is equivalent to the existence of matrices V-j such that L-2(x) = V-1* L-1 (x) V-1 + . . . + V-mu* L-1 (x) V mu. (A(1)) As for (Q(2)) we show that L-1 and L-2 are mutually dominant if and only if, up to certain redundancies described in the paper, L-1 and L-2 are unitarily equivalent. Algebraic certificates for positivity, such as (A(1)) for linear polynomials, are typically called Positivstellensatze. The paper goes on to derive a Putinar-type Positivstellensatz for polynomials with a cleaner and more powerful conclusion under the stronger hypothesis of positivity on an underlying bounded domain of the form {X vertical bar L(X) >= 0}. An observation at the core of the paper is that the relaxed LMI domination problem is equivalent to a classical problem. Namely, the problem of determining if a linear map tau from a subspace of matrices to a matrix algebra is "completely positive". Complete positivity is one of the main techniques of modern operator theory and the theory of operator algebras. On one hand it provides tools for studying LMIs and on the other hand, since completely positive maps are not so far from representations and generally are more tractable than their merely positive counterparts, the theory of completely positive maps provides perspective on the difficulties in solving LMI domination 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O

linear matrix inequality (lmi)
semidefinite programming
gleichstellensatz
archimedean quadratic module
real algebraic geometry
free positivity


Mixed-dimensional, symmetric coupling of FEM and BEM With the Symmetric Galerkin Boundary Element Method (SGBEM), FEM-like stiffness matrices can be produced which are suitable for coupling the Boundary Element Method (BEM) and the Finite Element Method (FEM). Here, we focus on the mixed-dimensional coupling in linear elasticity, i.e. three-dimensional BEM-domains will be coupled with two-dimensional finite shell elements. After briefly recalling the basics of the SGBEM, a direct kinematic coupling scheme will be presented, where the BE-domain is treated as a finite macro element. When assembling the stiffness matrix, the different kinematic degrees of freedom at the interface of both formulations require special attention. The accuracy of the method used is demonstrated by a numerical example.

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

boundary element method
finite element method
coupling
shell elements

symmetric-galerkin approximation
mixed-dimensional coupling
symmetric coupling


On the impact of software evolution on software clustering The evolution of a software project is a rich data source for analyzing and improving the software development process. Recently, several research groups have tried to cluster source code artifacts based on information about how the code of a software system evolves. The results of these evolutionary approaches seem promising, but a direct comparison to traditional software clustering approaches based on structural code dependencies is still missing. To fill this gap, we conducted several clustering experiments with an established software clustering tool comparing and combining the evolutionary and the structural approach. These experiments show that the evolutionary approach could produce meaningful clustering results. While the traditional approach provides better results because of a more reliable data density of the structural data, the combination of both approaches is able to improve the overall clustering quality. A review of related studies shows that this approach of combining dependency information is also successful in other software engineering applications.

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

software clustering
software evolution
code dependencies


dynamic updates for web and cloud applications The center of mass for newly-released applications is shifting from traditional, desktop or server programs, toward web and cloud computing applications. This shift is favorable to end-users, but puts additional burden on application developers and service providers. In particular, the newly emerging development methodologies, based on dynamic languages and multi-tier setups, complicate tasks such as verification and require end-to-end, rather than program-local guarantees. Moreover, service providers need to provide continuous service while accommodating the fast evolution pace characteristic of web and cloud applications. A promising approach for providing uninterrupted service while keeping applications up-to-date is to permit dynamic software updates, i.e., applying dynamic patches to running programs. In this paper we focus on safe dynamic updates for web and cloud applications; we point out difficulties associated with dynamic updates for these applications, present some of our preliminary results, and lay out directions for future work.

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

dynamic software updating
web applications
online updates
end-to-end properties
on-the-fly upgrades


Visual complexity of websites: Effects on users' experience, physiology, performance, and memory Visual complexity is an apparent feature in website design yet its effects on cognitive and emotional processing are not well understood. The current study examined website complexity within the framework of aesthetic theory and psychophysiological research on cognition and emotion. We hypothesized that increasing the complexity of websites would have a detrimental cognitive and emotional impact on users. In a passive viewing task (PVT) 36 website screenshots differing in their degree of complexity (operationalized by JPEG file size; correlation with complexity ratings in a preliminary study r = .80) were presented to 48 participants in randomized order. Additionally, a standardized visual search task (VST) assessing reaction times, and a one-week-delayed recognition task on these websites were conducted and participants rated all websites for arousal and valence. Psychophysiological responses were assessed during the PVT and VST. Visual complexity was related to increased experienced arousal, more negative valence appraisal, decreased heart rate, and increased facial muscle tension (musculus corrugator). Visual complexity resulted in increased reaction times in the VST and decreased recognition rates. Reaction times in the VST were related to increases in heart rate and electrodermal activity. These findings demonstrate that visual complexity of websites has multiple effects on human cognition and emotion, including experienced pleasure and arousal, facial expression, autonomic nervous system activation, task performance, and memory. It should thus be considered an important factor in website design. (C) 2009 Elsevier Ltd. All rights reserved.

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

affective computing
psychophysiology
website aesthetics
first impression
affect
attention
internet


String comparison in terms of statistical evaluation applied on biological sequences Protein sequences from all different organisms can be treated as texts written in a universal language where the alphabet consists of 20 distinct symbols, the amino-acids. The mapping of a protein sequence to its structure, functional dynamics and biological role then becomes analogous to the mapping of words to their semantic meaning in natural languages. This analogy can be exploited by applying statistical language modeling and text classification techniques for the advancement of biological sequences understanding. Here a new general strategy for measuring similarity between proteins is introduced. Our approach has its roots in computational linguistics and the related techniques for quantifying and comparing content in strings of characters. We experimented with different implementations having as ultimate goal the development of practical, computational efficient algorithms. The experimental analysis provides evidence for the usefulness and the potential of the new approach and motivates the further development of linguistics-related tools as a means to decipher the biological sequences.

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

n-grams
entropy
cross-entropy
protein similarity
exploratory data analysis