Efficient string matching in Huffman compressed texts We present an efficient algorithm for scanning Huffman compressed texts. The algorithm parses the compressed text in O (n (log2sigma)/(b)) time, where n is the size of the compressed text in bytes, a is the size of the alphabet, and b is a user specified parameter. The method uses a variable size super-alphabet, with an average size of O((b)/(Hlog2sigma)) characters, where H is the entropy of the text. Each super-character is processed in O(1) time. The algorithm uses O(2(b)) space and O(b2(b)) preprocessing time. The method can be easily augmented by auxiliary functions, which can e.g. decompress the text or perform pattern matching in the compressed text. We give three example functions: decoding the text in average time O(n(log2sigma)/(Hw)), where w is the number of bits in a machine word; an Aho-Corasick dictionary matching algorithm, which works in time O(n(log2sigma)/(b) + t), where t is the number of occurrences reported; and a shift-or string matching algorithm that works in time O(n(log2sigma)/(b)[(m + s - 1)/w]+t), where m is the length of the pattern and s depends on the encoding. The Aho-Corasick algorithm uses an automaton with variable length moves, i.e. it processes variable number of states at each step. The shift-or algorithm makes variable length shifts, effectively also processing variable number of states at each step. The number of states processed in O(1) time is O((b)/(Hlog2sigma)). The method can be applied to several other algorithms as well. Finally, we apply the methods to natural language taking the words (vocabulary) as the alphabet. This improves the compression ratio and allows more complex search problems to be solved efficiently. We conclude with some experimental results.

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


Learning high-dimensional networks with nonlinear interactions by a novel tree-embedded graphical model ? We propose a novel network learning method that can detect network structure with both linear and nonlinear interactions. Most existing network learning methods focus on linear interactions. Integration of generalized linear model, sparse learning, and decision tree learning. Interesting clinical associations are discovered from a real-world application using the proposed method.

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

high-dimensional network learning
sparse regression
decision tree model


Effect of gait on formation of thermal environment inside footwear The relation between the gait conditions and foot temperature distributions inside footwear was studied. The metabolic heat generation was found to have a basic impact on the temperature profile. High-temperature-elevation regions coincided with high-contact-load regions. The relation between the temperature elevation and contact load was clarified. The key aspects of a thermally comfortable design concept and applications were described.

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

skin temperature
foot contact
heat transfer


Gene selection from microarray gene expression data for classification of cancer subgroups employing PSO and adaptive K-nearest neighborhood technique A PSOadaptive KNN based gene selection method is proposed to select useful genes. A heuristic for selecting the optimal values of K efficiently is also proposed. The proposed technique is applied on SRBCT, ALL_AML and MLL microarray datasets. The usefulness of the identified genes is reconfirmed using SVM classifier. The method finds 6, 3 and 4 genes for SRBCT, ALL_AML, and MLL with high 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

microarray data
srbct data
all_aml data
mll data
particle swarm optimization (pso)
adaptive k-nearest neighborhood (knn)
support vector machine (svm)


A zonal RANS-LES method for compressible flows A zonal Reynolds-averaged Navier-Stokes (RANS) - large-eddy simulation (LES) method for compressible flow problems is presented and applied to generic flow problems. The quality of the method is shown by comparing zonal RANS-LES results, pure LES, pure RANS, and direct numerical simulation (DNS) data. For the transition from the RANS to the LES regime the zonal RANS-LES approach uses a synthetic eddy method combined with control planes downstream of the embedded LES interface. This combined approach reduces the RANS-to-LES transition length to less than three boundary-layer thicknesses. At the embedded LES outflow interface a reconstruction of the turbulent eddy viscosity ensures a smooth LES-to-RANS transition. The numerical scheme of the zonal RANS-LES method is validated for compressible zero-pressure gradient boundary-layer flow and then applied to the fundamental problem of a shock-wave turbulent boundary-layer interaction (SWBLI). For both problems, a smooth transition of mean flow quantities from the RANS to the LES regime was achieved and the low frequency pressure signals were transferred without spurious disturbances from the LES to the RANS domain. For the SWBLI case the time- and spanwise averaged pressure, wall-shear stress, and Reynolds-stress distributions agree well with the pure LES and DNS reference data. This zonal method can be directly extended to more intricate flow problems. (C) 2012 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

zonal rans-les method
shock-wave/boundary-layer interaction
compressible turbulence


an evolutionary approach for standard-cell library reduction Typically, commercially available standard-cell libraries consist of a large set of items, including cells optimized with respect to speed, area or power consumption. A large number of cells makes the synthesis process and the library maintenance quite demanding. By using a reduced set of properly-selected cells, such efforts can be reduced, without critically affecting performance. This paper introduces an innovative library-reduction strategy, based on a evolutionary algorithm, which allows for selecting an arbitrarily small subset of cells. Library compaction is strictly related to the features of the actual synthesis tool, and is tuned by means of a large set of benchmark circuits, so that it produces results suitable for general-purpose circuit design. Different technologies were accounted for, analyzing dependence of the area, time and power figures on the library cell count. Performance, with respect to full-size library synthesis, do not appreciably degrades, and in several cases actually improves. Synthesis time decreases and library maintenance and characterization tasks can thus be significantly reduced.

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

mutation algorithm
standard-cell
digital design
compact library


Pseudo-power scale signatures: frequency domain approach In an earlier work, we introduced a new form of signal representation called the pseudo-power signature (PPS) that was essentially independent of the duration of the signal. The signatures were obtained based on the continuous wavelet transform, and were shown to be reliable and discriminating for classification purposes. In this paper, we take a fresh look at the problem of obtaining PPS by carrying out our analysis in the frequency domain. The main advantages of this approach over our earlier one are that it is more versatile, permits the development of efficient computational algorithms, offers a solution to some unresolved uniqueness problems in our original formulation, and allows the study of the effect of the choice of analyzing wavelet to better aid the classification process.

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


Improved TakagiSugeno fuzzy model-based control of flexible joint robot via Hybrid-Taguchi genetic algorithm TakagiSugeno fuzzy modeling for Flexible joint robot. Using Hybrid-Taguchi genetic algorithm for feedback controller designing. Proving stability of system and implementation on FJR.

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

flexible joint robots
hybrid-taguchi-genetic-algorithm
parallel distributed compensation
linear matrix inequalities


Resolving crises through automated bilateral negotiations We describe the development of an automated agent that can negotiate efficiently with people in crises. The environment is characterized by two negotiators, time constraints, deadlines, full information, and the possibility of opting out. The agent can play either role, with communications via a pre-defined language. The model used in constructing the agent is based on a formal analysis of the crises scenario using game-theoretic methods and heuristics for bargaining. The agent receives messages sent by its opponent, analyzes them and responds. It also initiates discussion on one or more parameters of an agreement. Experimental results of simulations of a fishing dispute between Canada and Spain indicate that the agent played at least as well as, and in the case of Spain, significantly better than a human player. (c) 2007 Elsevier B.V. All rights reserved.

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

bilateral negotiation
bounded rationality


Minsum Location Extended to Gauges and to Convex Sets One of the oldest and richest problems from continuous location science is the famous FermatTorricelli problem, asking for the unique point in Euclidean space that has minimal distance sum to \(n\) given (non-collinear) points. Many natural and interesting generalizations of this problem were investigated, e.g., by extending it to non-Euclidean spaces and modifying the used distance functions, or by generalizing the configuration of participating geometric objects. In the present paper, we extend the FermatTorricelli problem in a twofold way: more general than for normed spaces, the unit balls of our spaces are compact convex sets having the origin as an interior point (but without symmetry condition), and the \(n\) given objects can be general convex sets (instead of points). We combine these two viewpoints, and the presented sequence of new theorems follows in a comparing sense that of corresponding theorems known for normed spaces. It turns out that some of these results holding for normed spaces carry over to our more general setting, and others do not. In addition, we present analogous results for related questions, like, e.g., for Herons problem. And finally, we derive a collection of additional results holding particularly for the Euclidean norm.

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


On admission control and scheduling of multimedia burst data for CDMA systems In order to support transmissions of multimedia data (high data rate and burst) with performance guarantees in a wideband CDMA system, it is crucial to design a judicious algorithm for burst data admission control and scheduling. However, in the current literature there are only simple techniques (such as first-come-first-served and equal sharing) suggested for tackling the problem. Indeed, these existing schemes are not designed for optimizing the precious bandwidth resources while providing performance guarantees (e.g., a user admitted with a certain data rate can enjoy the assigned rate without interruption). In this paper, we first present our novel integer programming formulation of the burst data admission control and scheduling problem. The objective of the optimization can be maximizing the utilization of the bandwidth resources or minimizing the delays of the user transmissions. Taking into account all the important factors such as mobility, power control, and soft handoff, our formulation induces an algorithm for generating an optimal admission control solution which consists of: (1) the burst data rate (in terms of the number of channels); (2) the burst duration; and (3) the burst start time. For practical implementation, we also suggest a near-optimal version of the algorithm, which is evaluated via static and dynamic simulations, and comparisons with two existing schemes.

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

cdma
burst data
admission control
integer programming


A criticism of the ACW algorithm ? Data compression via the Huffman algorithm, which is a data compression technique, is the most efficient technique between single symbol data compression techniques. This algorithm is counted among statistical data compression techniques. Many efforts have been made for optimizing this technique and some algorithms have been presented, too. One of these algorithms is the ACW algorithm which is presented by Hussein Al-Bahadili etal. At first, they used the Huffman algorithm and then used the results of the Huffman algorithm as the input of their algorithm to calculate the optimum character wordlength. So, they decreased the stored characters via increasing the character wordlength for doing the compression. In this paper, we examined and criticized the ACW algorithm and presented some of its weaknesses via suitable counterexamples. At the end, it was concluded that the optimum character wordlength can never be calculated by extant techniques.

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

data compression
huffman algorithm
acw algorithm


Robust reliable H? H ? control for fuzzy systems with random delays and linear fractional uncertainties This article studies the reliable robust stabilization problem for a class of uncertain TakagiSugeno (TS) fuzzy systems with time-varying delays. The delay factor is assumed to be random delay which belongs to a given interval and parameter uncertainties are considered with linear fractional transformation form. By implementing a proper novel Lyapunov functional together with linear matrix inequality (LMI) approach, a new set of delay-dependent sufficient conditions is derived to guarantee the asymptotic stability of TS fuzzy system with a prescribed H? H ? performance index. Further, a reliable robust H? H ? control design with an appropriate gain matrix has been derived to achieve the robust asymptotic stability for uncertain TS fuzzy system. Further, Schur complement and Jensen's integral inequality are used to simplify the derivation in the main results. The set of sufficient conditions is established using the relationship among the random time-varying delay and its lower and upper bounds, which can be easily solved by MATLAB LMI toolbox. Finally, an illustrative example based on the truck-trailer model is provided to show the effectiveness of the proposed new design technique.

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

random time-varying delay
actuators fault
reliability
h? h ? control h? h ? h? h ? h ?


Rate avalanche: Effects on the performance of multi-rate 802.11 wireless networks Originally designed to deal with the hidden node problem, the Request-to-Send/Clear-to-Send (RTS/CTS) exchange is often turned off in most infrastructure-based 802.11 networks with the belief that the benefit it brings might not even be able to pay off its transmission overhead. While this is often true for networks using fixed transmission rate, our investigation leads to the opposite conclusion when multiple transmission rates are exploited in WLANs. Through extensive simulations using realistic channel propagation and reception models, we found out that in a heavily loaded multi-rate WLAN, a situation that we call rate avalanche often happens if RTS/CTS is turned off: high collision rates not only lead to retransmissions but also drive the nodes to switch to lower date rates; the retransmissions and the longer channel occupation caused by lower rates will further deteriorate the channel contention, which yields more collisions. This vicious circle could significantly degrade the network performance even no hidden node presents. Our investigation also reveals that, in the absence of effective and practical loss differentiation mechanisms, simply turning on the RTS/CTS could effectively suppress the rate avalanche effect. Various scenarios/conditions are extensively examined to study the impact of RTS/CTS on the network performance. Our study provides some important insights about using the RTS/CTS exchange in multi-rate 802.11 WLANs.

wireless local area networks
rate adaptation
media access control


towards a fully computational model of web-navigation In this paper, we make the first steps towards developing a fully automatic tool for supporting users for navigation on the web. We developed a prototype that takes a user-goal and a website URL as input and predicts the correct hyperlink to click on each web page starting from the home page, and uses that as support for users. We evaluated our system's usefulness with actual data from real users. It was found that users took significantly less time and less clicks; were significantly less disoriented and more accurate with systemgenerated support; and perceived the support positively. Projected extensions to this system are discussed.

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


Automatic component protocol adaptation with the CoConut/J tool suite ? While industrial middleware platforms such as CORBA, EJB, or .NET facilitate the development of distributed applications by providing certain infra-structural services required in many distributed systems (such as name services, remote method calls, parameter marshalling, etc.), these industrial platforms fail to support the development of distributed systems with independent components. In particular, their component models do not provide sufficient information for component interoperability checks or automated component adaptation. Especially when considering the personal and institutional separation between component developer and component vendor as one of the prerequisites of an independent component market, finding automatically as many component interoperability errors as possible is crucial. Hence, it is of practical concern that component interfaces not only model the correct way of calling the single methods but also the valid sequences of method calls. Likewise, practice clearly shows that component reuse usually requires component adaptation. This directly shows that only detecting incompatibilities is of limited use, but advocates for techniques of automated component adaptation. In this paper we describe algorithms and tools for specifying and analysing component interfaces in order to check interoperability and to generate adapted component interfaces automatically. Therefore, we introduce the concept of parameterised contracts and a new component interface model.

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

component protocol specification
automatic protocol adaptation
distributed middleware platforms


language-based security on android In this paper, we initiate a formal study of security on Android: Google's new open-source platform for mobile devices. Specifically, we present a core typed language to describe Android applications, and to reason about their data-flow security properties. Our operational semantics and type system provide some necessary foundations to help both users and developers of Android applications deal with their security concerns.

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

hybrid type system
data-flow security
certified compilation
mobile code


A Pareto Corner Search Evolutionary Algorithm and Dimensionality Reduction in Many-Objective Optimization Problems Many-objective optimization refers to the optimization problems containing large number of objectives, typically more than four. Non-dominance is an inadequate strategy for convergence to the Pareto front for such problems, as almost all solutions in the population become non-dominated, resulting in loss of convergence pressure. However, for some problems, it may be possible to generate the Pareto front using only a few of the objectives, rendering the rest of the objectives redundant. Such problems may be reducible to a manageable number of relevant objectives, which can be optimized using conventional multiobjective evolutionary algorithms (MOEAs). For dimensionality reduction, most proposals in the paper rely on analysis of a representative set of solutions obtained by running a conventional MOEA for a large number of generations, which is computationally overbearing. A novel algorithm, Pareto corner search evolutionary algorithm (PCSEA), is introduced in this paper, which searches for the corners of the Pareto front instead of searching for the complete Pareto front. The solutions obtained using PCSEA are then used for dimensionality reduction to identify the relevant objectives. The potential of the proposed approach is demonstrated by studying its performance on a set of benchmark test problems and two engineering examples. While the preliminary results obtained using PCSEA are promising, there are a number of areas that need further investigation. This paper provides a number of useful insights into dimensionality reduction and, in particular, highlights some of the roadblocks that need to be cleared for future development of algorithms attempting to use few selected solutions for identifying relevant objectives.

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

dimensionality reduction
pareto corner search


Compact Brillouin bismuthgalliumaluminum co-doped erbium doped fiber laser A single-wavelength Brillouinerbium fiber laser (BEFL) is demonstrated using high germanium dopant concentration fiber and bismuthgalliumaluminum co-doped high concentration erbium doped fiber (EDF). A 20-m long high Ge-doped fiber is used to provide nonlinear gains to generate a stimulated Brillouin scattering (SBS), and a 4.3-m long BiGaAl EDF provides linear gains to amplify the SBS. The relationship between the fiber parameters (dopant concentration, effective area, length and so on) of both linear and nonlinear medium and the output performance was discussed. The BEFL power increases as the effective area of the high Ge-doped fiber decreases. There is an optimum length in the high Ge-doped fiber which is 20-m long in this paper. The BEFL output power also increases as the output power of the BiGaAl EDF increases. The output performance increases as the erbium doping concentration increases. It is necessary to get the effective area of the BiGaAl EDF large enough to decrease the fiber loss. The optimum length in the BiGaAl EDF is 4.3m. The BEFL operates at 1563.61nm, which is upshifted by 0.09nm from the Brillouin pump (BP). It has a peak power of ?3dBm and a side-mode suppression ratio of 26dB. The BP wavelength is tunable within a wavelength range from 1562.5 to 1564nm. The BEFL has a narrow linewidth. It is suitable for many potential applications, such as optical communication and sensors.

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

stimulated brillouin scattering
brillouinerbium fiber laser

bigaal co-doped high concentration edf
brillouin gain
stokes
frequency shift


Block matching motion estimation based on median cut quantization for MPEG video We propose a motion estimation algorithm using less gray level images, which are composed of bits pixels lower than 8 bits pixels. Threshold values for generating low bits pixels from 8 bits pixels are simply determined as median values of pixels in a macro block. The proposed algorithm reduces the computational complexity of motion estimation at less expense of video quality. Moreover, median cut quantisation can be applied to multilevel images and combined with a lot of fast algorithms to obtain more effective algorithms.

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

motion estimation
less gray level images
median cut quantization


A NOVEL WIDEBAND CMOS VCO USING SWITCH CAPACITORS ARRAY FOR RF APPLICATIONS This paper presents a novel low power consumption, low phase noise, and high tuning range CMOS cross-coupled voltage-controlled oscillator (VCO). Using common mode double-pseudo-resistance technique in the proposed circuit leads to low power dissipation without degrading the phase noise. Additionally, band-switching capacitor array is employed in order to increase the tuning range. The schematic circuit of the proposed VCO is simulated in 0.18 mu m 1P6M CMOS process and simulation results show high efficiency of the proposed circuit. The overall tuning frequency range is from 1.7 GHz to 3.18 GHz (59%) with tuning voltage variation range from 0V to 1.5 V. The proposed VCO circuit has phase noise of -102.6 and -124.3 dBc/Hz at 100 KHz and 1MHz offset frequency from the carrier, respectively, while consumes 1.98mW power at 1.5V supply voltage.

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

band-switching capacitors
common mode double-pseudo-resistance


Toward anticipating pest responses to fruit farms: Revealing factors influencing the population dynamics of the Oriental Fruit Fly via automatic field monitoring An automated tool was successfully engineered for monitoring pest populations. Observation data revealed important pest population dynamics. Revealed how endogenous and exogenous factors affect the pest population. 12days rhythm and 16days life cycle have been revealed via collected data.

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

information and communications technology


Optimal filter banks for multiple description coding: Analysis and synthesis Multiple description (MD) coding is a source coding technique for information transmission over unreliable networks. In MD coding, the coder generates several different descriptions of the same signal and the decoder can produce a useful reconstruction of the source with any received subset of these descriptions. In this paper, we study the problem of MD coding of stationary Gaussian sources with memory. First, we compute an approximate MD rate distortion region for these sources, which we prove to be asymptotically tight at high rates. This region generalizes the MD rate distortion region of El Gamal, Cover, and Ozarow for memoryless Gaussian sources. Then, we develop an algorithm for the design of optimal two-channel biorthogonal filter banks for MD coding of Gaussian sources. We show that optimal filters are obtained by allocating the redundancy over frequency with a reverse "water-filling" strategy. Finally, we present experimental results which show the effectiveness of our filter banks in the low complexity, low rate regime.

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

filter bank design
integer-to-integer transforms
multiple description (md) coding
rate distortion functions
robust source coding


user interface history User Interfaces have been around as long as computers have existed, even well before the field of Human-Computer Interaction was established. Over the years, some papers on the history of Human-Computer Interaction and User Interfaces have appeared, primarily focusing on the graphical interface era and early visionaries such as Bush, Engelbart and Kay. With the User Interface being a decisive factor in the proliferation of computers in society and since it has become a cultural phenomenon, it is time to paint a more comprehensive picture of its history. This SIG will investigate the possibilities of launching a concerted effort towards creating a History of User Interfaces.

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


Covariance structure regularization via entropy loss function The need to estimate structured covariance matrices arises in a variety of applications and the problem is widely studied in statistics. A new method is proposed for regularizing the covariance structure of a given covariance matrix whose underlying structure has been blurred by random noise, particularly when the dimension of the covariance matrix is high. The regularization is made by choosing an optimal structure from an available class of covariance structures in terms of minimizing the discrepancy, defined via the entropy loss function, between the given matrix and the class. A range of potential candidate structures comprising tridiagonal Toeplitz, compound symmetry, AR(1), and banded Toeplitz is considered. It is shown that for the first three structures local or global minimizers of the discrepancy can be computed by one-dimensional optimization, while for the fourth structure Newtons method enables efficient computation of the global minimizer. Simulation studies are conducted, showing that the proposed new approach provides a reliable way to regularize covariance structures. The approach is also applied to real data analysis, demonstrating the usefulness of the proposed approach in practice.

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

covariance structure
entropy loss function
regularization

covariance estimation
kullbackleibler divergence


Single-parameter characterizations of Schur stability property New equivalent characterizations are derived for Schur stability property of real polynomials. They involve a single scalar parameter, which call be regarded as a freedom incorporated in the given polynomials so long as the stability is concerned. Possible applications of the expressions are suggested to the latest results for stability robustness analysis in parameter space. Further, an extension of the characterizations is made to the matrix case, yielding one-parameter expressions of Schur matrices.

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

schur polynomial
schur matrix
free parameter


Computer support of effective peer assessment in an undergraduate programming class Abstract Active learning is considered by many academics as an important and effective learning strategy. Assessment is integrated in learning as a tool for learning, but traditional assessment methods often encourage surface learning (passive learning) rather than deep learning (active learning). Peer assessment is a method of motivating students, involving students discussing, marking and providing feedback on other students' work, and is one of the successful approaches which can be used to enhance deep learning. Students are required to think critically about what they are learning during the peer assessment process. Tutors' marking is usually accepted as reliable, but student peers' marking in a peer assessment process is suspect. As part of a study investigating whether peer assessment can be an accurate assessment method in a computer programming course, a novel web-based peer assessment tool has been developed. In this paper, we describe the tool and report the results of evaluating the tool through experiments involving large programming classes. The results suggest that computer-mediated peer assessment is a valuable assessment approach which promotes active learning and is an accurate assessment method in a programming course.

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

assessment tool
deep learning
peer assessment

programming language
technology assessment
web-based education


Quality of service management for IPTV services support in VANETs: a performance evaluation study In order to deliver a qualitative Internet Protocol Television (IPTV) service over vehicular ad hoc networks (VANETs), a quality of service (QoS) mechanism is needed to manage the allocate of network resources to the diverse IPTV application traffic demands. Unlike other mobile network, VANETs have certain unique characteristic that presents several difficulties in providing an effective QoS. Similarly, IPTV requires a constant stream for QoS which at the moment is quite difficult due to the inherent VANET characteristics. To provide an effective QoS that will meet the IPTV application service demands, VANETs, must satisfy the compelling real-time traffic streaming QoS requirement (i.e., minimum bandwidth allocation, packet loss and jitter). In this report, we evaluate via simulation the feasibility of deploying quality IPTV services over VANETs, by characterizing the association between the IPTV streaming quality determining factors (i.e., throughput, delay, loss, jitter) and the IPTV quality degradation, with respect to node density and node velocity. Furthermore, we used an objective QoS metric (Media-Delivery-Index) to identify, locate and address the loss or out-of-order packet. We outline how, using these informations can support in shaping network parameters to optimize service flows. The implementation assures a priority for handling IPTV traffic, such that maximise the usage of VANETs resources, and opens the possibility that loss and delay can be minimised to a degree that could guarantee quality IPTV service delivery among vehicle in a vehicular network system.

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


Linguistic-based emotion analysis and recognition for measuring consumer satisfaction: an application of affective computing A growing body of research suggests that affective computing has many valuable applications in enterprise systems research and e-businesses. This paper explores affective computing techniques for a vital sub-area in enterprise systemsconsumer satisfaction measurement. We propose a linguistic-based emotion analysis and recognition method for measuring consumer satisfaction. Using an annotated emotion corpus (Ren-CECps), we first present a general evaluation of customer satisfaction by comparing the linguistic characteristics of emotional expressions of positive and negative attitudes. The associations in four negative emotions are further investigated. After that, we build a fine-grained emotion recognition system based on machine learning algorithms for measuring customer satisfaction; it can detect and recognize multiple emotions using customers words or comments. The results indicate that blended emotion recognition is able to gain rich feedback data from customers, which can provide more appropriate follow-up for customer relationship management.

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

affective computing
enterprise systems
customer satisfaction
customer relationship management

linguistic feature
marketing
information technology management


Robust adaptive fuzzy tracking control for a class of perturbed uncertain nonlinear systems with UVCGF In this paper, a robust adaptive fuzzy controller is presented for a wide class of perturbed uncertain nonlinear system with unknown virtual control gain function (UVCGF). The Mamdani fuzzy system is used to approximate unstructured uncertain functions in the system. The proposed algorithm, which incorporated Nussbaum-type gain into the decoupled backstepping approach, does not require a priori knowledge of the sign of UVCGF, and circumvents the controller-singularity problem gracefully in some existing literatures. It proved that the tracking error can be driven to a small residual set while keeping all signals in the closed-loop system semi-globally uniformly ultimately bounded (SGUUB). Simulation results are presented to validate the effectiveness of the proposed controller.

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

uncertain nonlinear systems
decoupled backstepping


The Role of Roles in Supporting Reconfigurability and Fault Localizations for Open Distributed and Embedded Systems One of the main characteristics of open distributed embedded systems is that the involved entities are often very dynamic-different individual entities may join or leave the systems frequently. Therefore, systems built of these dynamic entities must be runtime reconfigurable. In addition, large classes of open embedded systems often have high availability and dependability requirements. However, the openness makes these requirements more difficult to achieve and the system more vulnerable to attacks. This article presents a coordination model, the Actor, Role and Coordinator (ARC) model, that aims to support reconfigurability and fault localization for open distributed embedded software systems. In particular, the actor model is used to model concurrent embedded entities, while the system's reconfigurability and dependability requirements are encapsulated within coordination objects: roles and coordinators, and are achieved through coordination among the actors. Roles, as a key thrust in the ARC model not only represent an abstraction for a set of behaviors shared by a group of actors so that reconfiguration within the roles becomes transparent to entities outside the roles, but also assume coordination responsibilities among the member actors. The article also argues from both analytical and empirical perspectives that with the support of the role, faults can be localized within actors, and actor level reconfiguration becomes transparent to the system.

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

coordination
open distributed embedded systems
actors
roles
coordinators


The adaptive finite element method based on multi-scale discretizations for eigenvalue problems ? In this paper, adaptive finite element methods for differential operator eigenvalue problems are discussed. For multi-scale discretization schemes based on Rayleigh quotient iteration (see Scheme 3 in [Y. Yang, H. Bi, A two-grid discretization scheme based on shifted-inverse power method, SIAM J. Numer. Anal. 49 (2011) 16021624]), a reliable and efficient a posteriori error indicator is given, in addition, a new adaptive algorithm based on the multi-scale discretizations is proposed, and we apply the algorithm to the Schrdinger equation for hydrogen atoms. The algorithm is performed under the package of Chen, and satisfactory numerical results are obtained.

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

multi-scale discretizations
a posterior error
adaptive algorithms


Optimal tool orientation control for 5-axis CNC milling with ball-end cutters When a ball-end milling tool cuts a given path on a smooth surface, it is desirable to maintain a fixed angle between the tool axis a and the local surface normal n at each point, to ensure a constant speed of the tool cutting edge against the surface. This means that the tool axis a must lie on a cone of angle about the surface normal n at each point, but its azimuthal position on this cone remains indeterminate. To resolve this indeterminacy, while minimizing actuation of the rotary axes that orient the workpiece relative to the tool, the component of a in the surface tangent plane is specified through the parallel transport of a given initial state along the path. This amounts to the integration of coupled first-order differential equations that involve the Christoffel symbols for the given surface. Alternatively, the tangent plane component of the tool axis a is shown to be rotation-minimizing with respect to the surface normal n, and its orientation relative to the Darboux frame along the tool path can be determined by integrating the geodesic curvature along that path. The method is illustrated by closed-form solutions for simple analytic surfaces, and numerical integration using an object-oriented software implementation for free-form surfaces. The real-time implementation of such rotation-minimizing 5-axis tool motions for free-form surfaces is well within the scope of modern CNC systems. (C) 2012 Elsevier B.V. All rights reserved.

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

tool orientation
parallel transport
geodesic curvature

5-axis cnc machining
ball-end cutter
rotation-minimizing frame


ON PARIKH MATRICES, AMBIGUITY, AND PRINTS In the algebraic study of words and languages it is often convenient to analyze words as numerical quantities. One such now-famous example is the study of words by using their attached Parikh mapping (or vector). However, the Parikh vector abstracts away too much of the structure of the word. Parikh matrices were introduced as a means to obtain more than just the number of occurrences of single letters. When studying properties of words, an important property is that a word is uniquely determined by the number of occurrences of certain predetermined subwords. In the context of Parikh matrices, the problem is translated in finding which words are completely characterized by their associated Parikh matrix. This paper links this problem with that of the print of a word, i.e. the word obtained by considering consecutive occurrences of the same letter as only one letter. We obtain results regarding finiteness and context-freeness of such classes of words.

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

subword
scattered subword
context free languages
n-ambiguity


Piecewise Linear Curve Approximation Using Graph Theory and Geometrical Concepts In this paper, a new methodology for curve approximation is presented. The method is suitable for both self-intersected and non self-intersected curves, it combines elements from graph theory and from elementary geometry and it is fully automated. More specifically, graph theory tools are utilized in order: 1) to remove the details that are irrelevant to the general shape of the curve under study and 2) to decompose the curve into non self-intersecting smaller curves. Then, each such smaller curve is processed via geometrical tools in order to approximate it efficiently with linear segments. Experimental results show that the proposed method compares well with several other methods of the same purpose.

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

curve data approximation
minimum spanning tree (mst)


Improving the Reliability of MLC NAND Flash Memories Through Adaptive Data Refresh and Error Control Coding NAND Flash memory has become the most widely used non-volatile memory technology. We focus on multi-level cell (MLC) NAND Flash memories because they have high storage density. Unfortunately MLC NAND Flash memory also has reliability problems due to narrower threshold voltage gap between logical states. Errors in these memories can be classified into data retention (DR) errors and program interference (PI) errors. DR errors are dominant if the data storage time is longer than 1day and these errors can be reduced by refreshing the data. PI errors are dominant if the data storage time is less than 1day and these errors can be handled by error control coding (ECC). In this paper we propose a combination of data refresh policies and low cost ECC schemes that are cognizant of application characteristics to address the errors in MLC NAND Flash memories. First, we use Gray code based encoding to reduce the error rates in the four subpages (MSB-even, LSB-even, MSB-odd, LSB-odd) of a 2-bit MLC NAND Flash memory. Next, we apply data refresh techniques where the refresh interval is a function of the program/erase (P/E) frequency of the application. We show that an appropriate choice of refresh interval and BCH based ECC scheme can minimize memory energy while satisfying the reliability constraint.

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

data retention error
program interferences error


A New Grid Structure for Domain Extension We present an efficient grid structure that extends a uniform grid to create a significantly larger far-field grid by dynamically extending the cells surrounding a fine uniform grid while still maintaining fine resolution about the regions of interest. The far-field grid preserves almost every computational advantage of uniform grids including cache coherency, regular subdivisions for parallelization, simple data layout, the existence of efficient numerical discretizations and algorithms for solving partial differential equations, etc. This allows fluid simulations to cover large domains that are often infeasible to enclose with sufficient resolution using a uniform grid, while still effectively capturing fine scale details in regions of interest using dynamic adaptivity.

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


towards modelling and analysis of a coordination protocol for dynamic software adaptation Software systems are increasingly expected to continue operating at run-time with minimal human interaction. They should consequently be equipped with self-adaptation capabilities in order to adapt themselves in response to changes in their execution conditions. While most of the research in this area focuses on individual parts of an adaptive system, our work leverages on this research but tackles the problem where interdependent and distributed adaptations are concurrently performed. In this paper, we approach behavioural changes of component-based systems in two steps. First, we propose a process to individually adapt one component at a time. Second, we elaborate a coordination protocol to maintain globally consistent state when implementing distributed adaptations. Motivated by the potential benefits of using formalisms, we construct a formal model of our protocol using Coloured Petri Nets in order for an adaptive system to be trusted after adaptation. We verify key behavioural properties and conduct CTL model checking to assess the correctness of the model and thereby the correctness of the protocol.

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

analysis
coordination protocol
modelling

consistency preservation
self-adaptation
adaptation process


Comparison of a Deductive Database with a Semantic Web reasoning engine Knowledge engineering is a discipline concerned with constructing and maintaining knowledge bases to store knowledge of various domains and using the knowledge by automated reasoning techniques to solve problems in domains that ordinarily require human logical reasoning. Therefore, the two key issues in knowledge engineering are how to construct and maintain knowledge bases, and how to reason out new knowledge from known knowledge effectively and efficiently. The objective of this paper is the comparison and evaluation of a Deductive Database system (ConceptBase) with a Semantic Web reasoning engine (Racer). For each system a knowledge base is implemented in such a way that a fair comparison can be achieved. Issues such as documentation, feasibility, expressiveness, complexity, distribution, performance and scalability are investigated in order to explore the advantages and shortcomings of each system.

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

knowledge engineering
semantic web
conceptbase
racer


A metadata model and mapping approach for facilitating access to heterogeneous cultural heritage assets In the last decade, Europe has put a tremendous effort into making cultural, educational and scientific resources publicly available. Based on national or thematic aggregators, initiatives like Europeana nowadays provide a plethora of cultural resources for people worldwide. Although such massive amounts of rich cultural heritage content are available, the potential of its use for educational and scientific purposes still remains largely untapped. Much valuable content is only available in the so-called long tail, i.e. in niche resources such as specifically themed cultural heritage collections, and are difficult to access from the mainstream hubs like major search engines, social networks or online encyclopaedias. The vision of the EEXCESS project is to push high-quality content from the long tail to platforms and devices which are used every day. The realisation of such use cases requires as a basis (and in addition to the functional components) a common metadata representation and tools for mapping between the data sources specific data models and this common representation. In this paper, we propose a data model for such a system that combines federated search results from different cultural heritage data sources. We then propose an approach for metadata mapping, with a focus on easy configurability of mappings, whichonce properly configuredcan then be executed on the fly by an automatic service. We demonstrate the approach using a real-world example.

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

metadata enrichment
metadata crosswalk
ontology


Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers In completely symmetric systems that have homogeneous nodes (hosts, computers, or processors) with identical arrival processes, an optimal static load balancing scheme does not involve the forwarding of jobs among nodes. Using an appropriate analytic model of a distributed computer system, we examine the following three decision schemes for load balancing: completely distributed, intermediately distributed, and completely centralized, We show that there is no forwarding of jobs in the completely centralized and completely distributed schemes, but that in an intermediately distributed decision scheme, mutual forwarding of jobs among nodes is possible, leading to degradation in system performance for every decision maker. This result appears paradoxical, because by adding communication capacity to the system for the sharing of jobs between nodes, the overall system performance is degraded. We characterize conditions under which such paradoxical behavior occurs, and we give examples in which the degradation of performance may increase without bound. We show that the degradation reduces and finally disappears in the limit as the intermediately distributed decision scheme tends to a completely distributed one.

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

performance
distributed decision
load balancing

management
theory
braess paradox
homogeneous distributed system
nash equilibrium
noncooperative game
performance optimization
wardrop equilibrium


An approach to collaborative learning and the serious game development This paper presents the overall learning process that evolved during the MASCA project (MAnaging System Change in AviationEU FP7 funded project (20102013), specifically focusing on the one of the key elements of the overall learning approach, the development of a serious game (SKYBOARD) and the role the game played in supporting the implementation of airport collaborative decision-making (A-CDM) in a major European airport. The underlying principles of the learning process was based on ongoing and collaborative learning in the workplace, with each phase of learning involving preparation and guidance, collaborative learning, consolidation of that learning and practically focused next steps that can be deployed to support overall change management. The aim of SKYBOARD was to aid communication and collaboration when introducing A-CDM, and thereby supporting the cultural change that comes with this introduction. The development of SKYBOARD was based upon an initial training needs analysis and an iterative development and implementation approach at a major European airport. The research demonstrated that we are at the beginning of a fundamental shift in the way both learning and working is happening in organisations. Therefore, the establishment of a collaborative learning process and integrated learning package needs to focus on supporting continuous performance improvement and learning (competency and capability at all levels) and to ensure this overall learning is fully aligned to the overall strategic blueprint of the organisation. The evaluation of SKYBOARD demonstrated that serious games can support collaborative learning and enhanced communication and that such games should be key resource in any learning environment and proved to be a highly effective support to the implementation of A-CDM in this case.

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

collaborative learning process
serious games
skyboard

airport collaborative decision-making (a-cdm)


Semantic context based refinement for news video annotation Automatic video annotation is to bridge the semantic gap and facilitate concept based video retrieval by detecting high level concepts from video data. Recently, utilizing context information has emerged as an important direction in such domain. In this paper, we present a novel video annotation refinement approach by utilizing extrinsic semantic context extracted from video subtitles and intrinsic context among candidate annotation concepts. The extrinsic semantic context is formed by identifying a set of key terms from video subtitles. The semantic similarity between those key terms and the candidate annotation concepts is then exploited to refine initial annotation results, while most existing approaches utilize textual information heuristically. Similarity measurements including Google distance and WordNet distance have been investigated for such a refinement purpose, which is different with approaches deriving semantic relationship among concepts from given training datasets. Visualness is also utilized to discriminate individual terms for further refinement. In addition, Random Walk with Restarts (RWR) technique is employed to perform final refinement of the annotation results by exploring the inter-relationship among annotation concepts. Comprehensive experiments on TRECVID 2005 dataset have been conducted to demonstrate the effectiveness of the proposed annotation approach and to investigate the impact of various factors.

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

video annotation
semantic context
semantic similarity
random walk


Inherent ambiguity of languages generated by spine grammars There have been many arguments that the underlying structure of natural languages is beyond the descriptive capacity of context-free languages. A well-known example is tree adjoining grammars; less common are spine grammars, linear indexed grammars, head grammars and combinatory categorial grammars. It is known that these models of grammars have the same generative power of string languages and fall into the class of mildly context-sensitive grammars. For an automaton, it is known that the class of languages accepted by transfer pushdown automata is exactly the class of linear indexed languages. In this paper, deterministic transfer pushdown automata is introduced. We will show that the language accepted by a deterministic transfer pushdown automaton is generated by an unambiguous spine grammar. Moreover, we will show that there exists an inherently ambiguous language.

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

spine grammars
transfer pushdown automata
tree adjoining grammars

mildly context-sensitive languages
inherently ambiguous languages


an analysis of multimedia searching on altavista Web searching is a significant activity for many people seeking multimedia information. Major Web search engines, such as Alta Vista, are essential tools in the quest to locate relevant online information. As such, it is important that we understand how searchers utilize these Web information systems. This paper presents research that examines characteristics of multimedia Web searching on Alta Vista. More specifically, the research questions driving this study are: (1) What are the characteristics of multimedia searching on Alta Vista? and (2) How does this multimedia searching compare to Web searching in general? The results of our research show that multimedia searching is complex relative to general Web searching and that searching specific multimedia collections does not necessarily reduce the searching complexity. We discuss the implications of the findings for the development of online multimedia retrieval systems.

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

search engines
research
systems
analysis
web
multimedia
general
complexity
paper
online
tools

activation
drive
multimedia information retrieval
developer
collect
web search engine
relevance
relation
information system
informal
multimedia searching
web searching


Propagation in CLG Bayesian networks based on semantic modeling In this paper, we propose a new algorithm based on semantic model for inference in CLG Bayesian networks which is strongly inspired by the architecture of Madsen (in, Int J Approx Reason 49:503-521, 2008). By performing semantic modeling before physical computation, the proposed algorithm takes advantage of the semantic knowledge induced by the structure of the graph and the evidence. Thus, iteration between semantic modeling and physical computation can be avoided. Also,the presented architecture can exploit some remaining independencies in the relevant potentials which were ignored by the previous architecture. The correctness of the proposed algorithm has been proved and the resulting benefits are illustrated by examples. The results indicate a significant potential in semantic knowledge.

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

clg bayesian networks
inference
semantic modeling


Social correlates of turn-taking style We consider the problem of using speech processing to characterize an aggregate of voice data, in contrast to inferences about individual voice cuts. We derive simple turn-taking models from speaker activity detection output on the Switchboard-1 corpus. These can be used to cluster speakers into turn-taking 'styles.' Demographic fields and turn-taking behavior prove to be statistically dependent. thus observed speaker activity improves estimates of the demographics of held-out data. Finally, we use turn-taking style to estimate speaker influence. (C) 2011 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

speech activity detection
turn-taking behavior


on the scalability of hierarchical cooperation for dense sensor networks In this paper we study the problem of information dissemination in dense multi-hop sensor networks characterized by highly correlated sample measurements. In particular, we investigate the benefits, and trade-offs, of exploiting correlations via cooperatively compressing the data as it hops around the network. First, we study two extreme cooperation strategies, namely no cooperation and network-wide cooperation. We show that network-wide cooperation achieves logarithmic growth rate for the transport traffic with the network size whereas the schedule length growth rate remains linear. Next, we analyze a two-phase cooperation strategy which localizes cooperation within regions of the network in an attempt to assess the performance of strategies bounded by the two aforementioned extremes. Finally, we extend two-phase cooperation to a multi-phase hierarchical cooperation strategy where the number of phases depends on the number of nodes and the size of the cooperation set. The rationale behind this strategy is to achieve logarithmic scaling laws at the expense of more complexity in coordinating nodes' cooperation. In addition, hierarchical cooperation opens room for optimizing the transport traffic and schedule length for a given network size.

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

sensor networks
transport traffic
scaling laws

data compression
spatial correlations
scheduling latency


extracting camera-control requirements and camera movement generation in a 3d virtual environment This paper proposes a new method to generate smooth camera movement that is collision-free in a three-dimensional virtual environment. It generates a set of cells based on cell decomposition using a loose octree in order not to intersect with polygons of the environment. The method defines a camera movement space (also known as Configuration Space) which is a set of cells in the virtual environment. In order to generate collision-free camera movement, the method holds a path as a graph structure which is based on the adjacency relationship of the cells, and makes the camera move on the graph. Furthermore, by using a potential function for finding out the force that aims the camera at the subject and a penalty function for finding out the force that restrains the camera on the graph when the camera moves on the graph, we generate smooth camera movement that captures the subject while avoiding obstacles. Several results in static and dynamic environments are presented and discussed.

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

interactive system
camera control
virtual reality
video game
path planning


Fuzzy decision method to improve the information exchange in a vehicle sensor tracking system Internet of Things is based on the identification of real-world objects in a unique way that interconnects them by means of communication interfaces. Such a simple idea allows the emergence of a huge number of new applications in almost any domain of knowledge. One of the most prominent areas of application is road vehicles, which currently have, on average, more than 50 sensors inside and which information can be accessed through a standard protocol. With this, vehicles have become real smart objects that can interact with other objects or any software system. To allow that, our previous work focused on proposing and developing the Vitruvius platform, where users with no programming knowledge can design and quickly generate Web applications based on the real-time data consumption from interconnected vehicles. The problem is that the sending of such information is out of control, being unable to filter out when the best time to send the information is and what information should be sent at any moment in order to minimize the resource consumption of the mobile device that acts as a bride between the vehicle and the database in which all the information is stored. Thus, in this work we propose a fuzzy algorithm that allows to optimize the resources that are used by real-time applications that constantly send data while maintaining data quality, contextualized in vehicle sensor tracking systems and the applications that can be built above them.

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

fuzzy logic
fuzzy decision making
resource management
bandwidth


conic display generator using multiplying digital-analog decoders The need has been recognized for a computer-driven generator which is capable of drawing complex curves without imposing a great burden on the central computer. It has been shown that analog and hybrid techniques offer promise of lifting some of this computational and storage load. Past approaches using these techniques have been limited in speed and in kinds of curves drawn. Roberts has proposed a hybrid analog-digital generator based on homogeneous coordinate mathematics. Such a generator has been designed and built using the wideband multiplying decoder as its basic component.

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

mathematics drawing hybrid storage analog component

digitize coordination generation complexity decode computation


A new linear method for camera self-calibration with planar motion We consider the self-calibration (affine and metric reconstruction) problem from images acquired with a camera with unchanging internal parameters undergoing planar motion. The general self-calibration methods (modulus constraint, Kruppa equations) are known to fail with this camera motion. In this paper we give two novel linear constraints on the coordinates of the plane at infinity in a projective reconstruction for any camera motion. In the planar case, we show that the two constraints are equivalent and easy to compute, giving us a linear version of the quartic modulus constraint. Using this fact, we present a new linear method to solve the self-calibration problem with planar motion of the camera from three or more images.

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


prototype mobility tools for visually impaired surfers In [1] we extended the notion of travel to include environment, feedback and the purpose of the current travel task. Specifically, we likened web use to travelling in a virtual space, compared it to travelling in a physical space, and introduced the idea of mobility - the ease of travel - as opposed to travel opportunity. This paper describes our continuing work in building a prototype mobility tool to address some of these issues.

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


tracking humans using novel optical flow algorithm for surveillance videos We propose an approach to track moving objects (humans) using optical flow in surveillance videos in this paper. We combine object segmentation output with optical flow algorithm while tracking object. That is, the proposed algorithm uses the object segmentation results while calculating optical flow and optical flow is only calculated in silhouette regions of motion using Two Way ANOVA. We track silhouettes (possible human torso), since these are more robust to variations in lighting conditions. The experimental results have demonstrated that our approach achieved good performance and the operating speed is relatively lower than some of the other standard optical flow techniques. We test our approach on several video surveillance sequences, both in indoor and outdoor.

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

two way anova
object segmentation
optical flow
video surveillance


A fast VQ codebook generation algorithm using codeword displacement In this paper, we present a fast codebook generation algorithm called CGAUCD (Codebook Generation Algorithm Using Codeword Displacement) by making use of the codeword displacement between successive partition processes. By implementing a fast search algorithm named MFAUPI (Modified Fast Algorithm Using Projection and Inequality) for VQ encoding in the partition step of CGAUCD, the codebook generation time can be further reduced significantly. Using MFAUPI, the computing time of CGAUCD can be reduced by a factor of 4.77.6. Compared to Generalized Lloyd Algorithm (GLA), our proposed method can reduce the codebook generation time by a factor of 35.9121.2. Compared to the best codebook generation algorithm to our knowledge, our approach can further reduce the corresponding computing time by 26.032.8%. It is noted that our proposed algorithm can generate the same codebook as that produced by the GLA. The superiority of our method is more remarkable when a larger codebook is generated.

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


Nearing the threshold: An economics approach to pressure on information systems professionals to separate from their employer Organizational approaches to managing information systems (IS) professionals have been making headlines as technology-intensive businesses search for ways to cope with an ever-changing economic landscape. Consequently, understanding and predicting employee quitting or separation behavior is crucial. We incorporate human capital theory from economics to form an alternative theoretical perspective for understanding IS professionals' separation and retention. This shift allows us to focus on precursors to observed separation, rather than attitudinal precursors of intentions. We introduce three new constructs: pressure to separate, retention frontiers, and separation thresholds. These constructs provide a basis for identifying when an employee is close to leaving the firm and for a new approach to analyze the potential effectiveness of action taken by a firm to change separation behavior: pre-implementation retention intervention assessment (PRI-assessment). We illustrate the application of the new approach using data on the observed separation behavior of 661 IS professionals at a large multidivision firm.

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

binomial logit model
economic analysis
information technology human capital
personnel separation
workforce retention


Lip image segmentation using fuzzy clustering incorporating an elliptic shape function Recently, lip image analysis has received much attention because its visual information is shown to provide improvement for speech recognition and speaker authentication. Lip image segmentation plays an important role in lip image analysis. In this paper, a new fuzzy clustering method for lip image segmentation is presented. This clustering method takes both the color information and the spatial distance into account while most of the current clustering methods only deal with the former. In this method, a new dissimilarity measure, which integrates the color dissimilarity and the spatial distance in terms of an elliptic shape function, is introduced. Because of the presence of the elliptic shape function, the new measure is able to differentiate the pixels having similar color information but located in different regions. A new iterative algorithm for the determination of the membership and centroid for each class is derived, which is shown to provide good differentiation between the lip region and the nonlip region. Experimental results show that the new algorithm yields better membership distribution and lip shape than the standard fuzzy c-means algorithm and four other methods investigated in the paper.

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


Fence methods for backcross experiments Model search strategies play an important role in finding simultaneous susceptibility genes that are associated with a trait. More particularly, model selection via the information criteria, such as the BIC with modifications, have received considerable attention in quantitative trait loci mapping. However, such modifications often depend upon several factors, such as sample size, prior distribution, and the type of experiment, for example, backcross, intercross. These changes make it difficult to generalize the methods to all cases. The fence method avoids such limitations with a unified approach, and hence can be used more broadly. In this article, this method is studied in the case of backcross experiments throughout a series of simulation studies. The results are compared with those of the modified BIC method as well as some of the most popular shrinkage methods for model selection.

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

high-dimensional variable selection
restricted fence


Lexicographic local search and the p-center problem We introduce a local search strategy that suits combinatorial optimization problems with a minmax (or maxmin) objective. According to this approach, solutions are compared lexicographically rather then by their worst coordinate. We apply this approach to the p-center problem.

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


High-speed IP meter HIM and its application in LAN/WAN environments As the number of Internet applications in critical situations increases, the quality assurance of the network infrastructure becomes more and more important. The operators of such networks have to maintain the network as reliable and available with sufficient performance. Measurement technology is the key to maintaining the network condition and provides the network as being the important infrastructure of the network society. To meet these requirements, a high-speed and accurate IP meter, HIM, has been developed. Specific hardware has been made to realize the necessary specifications that enable data capturing with 20-musecond order timing information from a gigabit class network. The experimental results with HIM show that: 1) software-based equipment cannot handle 100-musecond order timing information, 2) the current computer system can transmit a high-speed (30 Mpbs) multimedia stream in accurate timing (jitter less than 20 museconds) with UDP, 3) but TCP's retransmission mechanism makes the jitter worse (up to 264 mil seconds) and, 4) WAN's one-way traffic exhibits some strange behavior, which requires further investigation.

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


High-performance and low-power conditional discharge flip-flop In this paper, high-performance flip-flops are analyzed and classified into two categories: the conditional precharge and the conditional capture technologies. This classification is based on how to prevent or reduce the redundant internal switching activities. A new flip-flop is introduced: the conditional discharge flip-flop (CDFF). It is based on a new technology, known as the conditional discharge technology. This CDFF not only reduces the internal switching activities, but also generates less glitches at the output, while maintaining the negative setup time and small D-to-Q delay characteristics. With a data-switching activity of 37.5%, the proposed flip-flop can save up to 39% of the energy with the same speed as that for the fastest pulsed flip-flops.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 cnios
flip-flop
low power
very large scale integration (vlsi)


Comparison between transient and quasi-stationary calculations of eddy current field problems with moving conductors For the calculation of time varying non-linear eddy current field problems with moving conductors time-stepping methods ave necessary. in some cases quasi-stationary methods ran be used alternatively in order to reduce the high calculation effort of transient calculations and to avoid complications of moving meshes. The paper compares quasi-stationary and transient finite element methods for the computation of eddy current brakes and induction machines with respect to the transient parameters, the accuracy of the solution and the computation time.

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


Model modification in structural equation modeling by imposing constraints Two approaches for model modification, or specification search, in structural equation modeling are: releasing constraints (e.g., adding free parameters) and imposing constraints (e.g., deleting free parameters). These two approaches can be considered as "forward search" and "backward search", respectively. The forward search approach, which starts with a more limited model to find a more general model by adding free parameters, is very frequently utilized in practice. However, the success rate of the forward approach in obtaining the correct model is usually low. The forward search also has been found to depend very highly on the initial model selected in the modification process. The farther the initial model differs from the true model, the less likely is the proper modification to occur. This study illustrates the backward search approach, which starts with a more general model and improves the model by imposing constraints, using the z and Wald (W) tests. Assuming a correct measurement model, this study focuses on the model modification of structural relationships among factors. The results showed that with correct specification of the causal order of latent factors the correct model may be located with higher than 60% accuracy, using the incremental univariate Wald test, or the z test. With,more cautious, or restricted, search, the success rates are even higher. (C) 2002 Elsevier Science B.V. All rights reserved.

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


Computer-aided design of a factor Xa inhibitor by using MCSS functionality maps and a CAVEAT linker search We have investigated a new approach to efficiently find a novel inhibitor against a serine protease (i.e. an activated coagulation factor X, FXa) by using de novo design programs and the X-ray crystal structure of the target enzyme. FXa is a coagulant enzyme that generates thrombin (a serine protease) and participates in both intrinsic and extrinsic coagulation pathways. We adopted multiple copy simultaneous search (MCSS) and CAVEAT linker search techniques, which disclosed a novel FXa inhibitor (T01312) consisting of two binding moieties (the benzamidinyl and adamantyl groups) and a linker unit (the carboxybenzylamine group). The inhibitory activity of T01312 against FXa was determined to be a small Ki-value of 48nM, which is two orders of magnitude smaller than that against thrombin. An X-ray crystal analysis of T01312 complexed with trypsin (an analogue of FXa) and docking studies of T01312 with trypsin and FXa showed that: (i) the benzamidinyl group is a predominant binding moiety in the anionic pocket (S1 site) with an asparatic acid residue; (ii) a hydrophobic pocket (S4 site) is the binding site of the adamantyl group; (iii) the carboxylate group of the linker contributes to the selectivity for FXa against thrombin. Thus, the combination of the knowledge of the X-ray crystal structure of the target molecule with MCSS and CAVEAT linker search techniques proved to be an effective hit-finding method that does not require the screening of huge compound libraries.

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

structure-based design
molecular modeling


Test data compression and test resource partitioning for system-on-a-chip using frequency-directed run-length (FDR) codes Test data compression and test resource partitioning (TRIP) are necessary to reduce the volume of test data for system-on-a-chip designs. We present a new class of variable-to-variable-length compression codes that are designed using distributions of the runs of Os in typical test sequences. We refer to these as frequency-directed run-length (FDR) codes. We present experimental results for ISCAS 89 benchmark circuits and two IBM production circuits to show that FDR codes are extremely effective for test data compression and TRP. We derive upper and lower bounds on the compression expected for some generic parameters of the test sequences. These bounds are especially tight when the number of runs is small, thereby showing that FDR codes are robust, i.e., they are insensitive to variations in the input data stream. In order to highlight the inherent superiority of FDR codes, we present a probabilistic analysis of data compression for a memoryless data source. Finally, we derive entropy bounds for the benchmark test sets and show that the compression obtained using FDR codes is close to the entropy bounds.

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

automatic test equipment (ate)
decompression architecture
embedded core testing
precomputed test sets
test set encoding
system-on-a-chip test
variable-to-variable-length codes


Krylov implicit integration factor methods for spatial discretization on high dimensional unstructured meshes: Application to discontinuous Galerkin methods Integration factor methods are a class of exactly linear part time discretization methods. In [Q. Nie, Y.-T. Zhang, R. Zhao, Efficient semi-implicit schemes for stiff systems, Journal of Computational Physics, 214 (2006) 521537], a class of efficient implicit integration factor (IIF) methods were developed for solving systems with both stiff linear and nonlinear terms, arising from spatial discretization of time-dependent partial differential equations (PDEs) with linear high order terms and stiff lower order nonlinear terms. The tremendous challenge in applying IIF temporal discretization for PDEs on high spatial dimensions is how to evaluate the matrix exponential operator efficiently. For spatial discretization on unstructured meshes to solve PDEs on complex geometrical domains, how to efficiently apply the IIF temporal discretization was open. In this paper, we solve this problem by applying the Krylov subspace approximations to the matrix exponential operator. Then we apply this novel time discretization technique to discontinuous Galerkin (DG) methods on unstructured meshes for solving reactiondiffusion equations. Numerical examples are shown to demonstrate the accuracy, efficiency and robustness of the method in resolving the stiffness of the DG spatial operator for reactiondiffusion PDEs. Application of the method to a mathematical model in pattern formation during zebrafish embryo development shall be shown.

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

discontinuous galerkin finite element methods


On the Simplest Chemical Signal Diodes Constructed with an Excitable Medium We consider an excitable chemical medium as an information processing system with information coded in excitation pulses. A diode that transmits signals in one direction only is one of very basic signal processing devices and an important component of more complex information processing systems. We demonstrate that in the medium with controlled excitability the diode can be constructed using one or two non-excitable barriers only. The results or numerical Simulations based on the Oregonator model are confirmed in experiments with Ru-catalyzed Belousov-Zhabotinsky reaction.

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

signal diode
belousov-zhabotinsky reaction


Message latency in the 2-dimensional mesh with wormhole routing Analytical models of deterministic routing in hypercubes and tori with wormhole routing have been widely reported in the literature. Greenberg and Guan (in R. Greenberg, L. Guan, Modelling and comparison of wormhole routed mesh and torus networks, Proc. 9th IASTED Int. Conf. Parallel and Distributed Computing and Systems, October 1997) have recently described a model of deterministic routing in the 2-dimensional mesh, which has been one of the most popular multicomputer networks. Although there have been many adaptive routing algorithms proposed for this network, there has been hardly any study that proposes an analytical model for these algorithms. This paper proposes an approximate analytical model to compute message latency in the mesh with fully-adaptive routing. Results from simulation experiments are then presented to validate the model.

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

parallel architectures
multicomputers networks
performance modelling