fast arithmetics in artin-schreier towers over finite fields An Artin-Schreier tower over the finite field F p is a tower of field extensions generated by polynomials of the form X p - X -?. Following Cantor and Couveignes, we give algorithms with quasi-linear time complexity for arithmetic operations in such towers. As an application, we present an implementation of Couveignes' algorithm for computing isogenies between elliptic curves using the p -torsion.

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


A database-centric and web-automatic hypertext application design method With the evolution of World Wide Web from the simple delivery mechanism to a platform for complex business applications, Web-based business computing is already seen as a new competitive business weapon. The potential commercial payoff of WWW application attracts more and more organizations to build their own web sites and develop business-to-business or business-to-consumer applications on the Internet. Designing Web applications has become a critical corporate strategic issue. However, current methods of modeling and designing hypertext applications are in chaotic and ad-hoc nature. These approaches lack the stringent and rigorous system analysis and design principles. Special efforts are needed to develop a formal method to support the modeling and design of hypertext applications. This research aims to tackle this important issue and propose an effective and efficient design alternative. We build a toolkit prototype that implements the design method we present. This toolkit is easy to use and to integrate with SQL compliant database systems. We develop a Web hypertext design method called the database-centric Web hypertext design method (DWHDM) to approach Web page requirements analysis, Web hypertext navigation design, Web page template generation, and hypertext information system maintenance. We adopt UML class diagram, state diagram, and sequence diagram to capture user requirements and application characteristics. We use a relational or object-relational database system to serve as the integrating design repository.

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

object-oriented analysis and design method


A generalized polynomial chaos based ensemble Kalman filter with high accuracy ? As one of the most adopted sequential data assimilation methods in many areas, especially those involving complex nonlinear dynamics, the ensemble Kalman filter (EnKF) has been under extensive investigation regarding its properties and efficiency. Compared to other variants of the Kalman filter (KF), EnKF is straightforward to implement, as it employs random ensembles to represent solution states. This, however, introduces sampling errors that affect the accuracy of EnKF in a negative manner. Though sampling errors can be easily reduced by using a large number of samples, in practice this is undesirable as each ensemble member is a solution of the system of state equations and can be time consuming to compute for large-scale problems. In this paper we present an efficient EnKF implementation via generalized polynomial chaos (gPC) expansion. The key ingredients of the proposed approach involve (1) solving the system of stochastic state equations via the gPC methodology to gain efficiency; and (2) sampling the gPC approximation of the stochastic solution with an arbitrarily large number of samples, at virtually no additional computational cost, to drastically reduce the sampling errors. The resulting algorithm thus achieves a high accuracy at reduced computational cost, compared to the classical implementations of EnKF. Numerical examples are provided to verify the convergence property and accuracy improvement of the new algorithm. We also prove that for linear systems with Gaussian noise, the first-order gPC Kalman filter method is equivalent to the exact Kalman filter.

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

kalman filter
data assimilation
polynomial chaos


PEEC method: circuit models for electromagnetic field problems Purpose - The paper aims to give the reader a consolidated state of art in the full-wave modeling of passive interconnection systems using equivalent circuits and presents several advantageous techniques developed by the authors. Design/methodology/approach - The paper presents the theory of generalized partial element equivalent circuit (PEEC) modeling in the frequency domain (FD) and time domain (TD) developed by the authors. The widely spread simplified approaches are derived from this general formulation and the most important issues (e.g. stability in the TD) are considered. The theoretical part is completed by a simulation example, which shows the efficiency of studied methods. Findings - Novel approaches for co-simulation of passive interconnections in their circuit environment. Practical implications - The PEEC method is widely used in the practice of computational electromagnetics, e.g. by the authors in the practical electromagnetic compatibility simulation. Originality/value - The paper is based on the original work of authors carried through over many years.

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


optimal design in collaborative design network We consider a multiagent system whose task is to aid component-centered design by collaborative designers in a supply chain. In the earlier work, collaborative design networks are proposed as a decision-theoretic framework for such a system. In this work, we analyzes how choice of agent interface affects the computational complexity of collaborative design. Based on the analysis, we proposes a set of algorithms that allow agents to produce an overall optimal design by autonomous local evaluation of local designs. We show that these algorithms reduce the complexity exponentially from that of an exhaustive centralized design.

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

collaborative design
supply chain
optimal design


SDIoT: a software defined based internet of things framework The internet of things (IoT) represent the current and future state of the Internet. The large number of things (objects), which are connected to the Internet, produce a huge amount of data that needs a lot of effort and processing operations to transfer it to useful information. Moreover, the organization and control of this large volume of data requires novel ideas in the design and management of the IoT network to accelerate and enhance its performance. The software defined systems is a new paradigm that appeared recently to hide all complexity in traditional system architecture by abstracting all the controls and management operations from the underling devices (things in the IoT) and setting them inside a middleware layer, a software layer. In this work, a comprehensive software defined based framework model is proposed to simplify the IoT management process and provide a vital solution for the challenges in the traditional IoT architecture to forward, store, and secure the produced data from the IoT objects by integrating the software defined network, software defined storage, and software defined security into one software defined based control 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

internet of things (iot)
software defined network (sdn)
software defined systems (sdsys)
software defined storage (sdstore)
software defined security (sdsec)


GPU-accelerated Direct Sampling method for multiple-point statistical simulation A GPU-based Direct Sampling algorithm is proposed for multiple point simulation. Implementation adopts several parallel algorithms for data-parallel speedup. Experimental results show its superiorities in terms of simulation time. The concept of the search ellipsoid is combined with the DS algorithm.

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

compute unified device architecture (cuda)


Model uncertainty and energy technology policy: The example of induced technical change ? Model uncertainty is a major issue in energy and integrated assessment models (IAM). An economic analysis of CO2 abatement with technical change uncertainty is important. A non-Bayesian decision rule is applied in a well-known IAM for robustness analysis. Computational results explore the robust solution and compare it to other solutions. The analysis demonstrates the robust method's power in the CO2 abatement problem.

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

energy and climate policy
minmax regret
robust analysis


greening your computing technology, the near and far perspectives "Green" computing has become a popular and trendy topic. Many companies are exploring methods and policies to use green technologies. Most policies merely scratch the surface, however, of greening computing technology, often seen as a necessary energy evil. At Colorado State University, we have gone beyond the surface polish and explored some practical solutions to energy efficiency, consumption reduction, and environmental stewardship. Sensitive to the current economic climate, we will discuss how going green can have a significant positive impact on your budget as well. We will present a cafeteria-style plan that campus IT administrators can use to reduce energy use and to reduce or more efficiently use consumables. Projects range from server room (re)design and rethinking computing infrastructure, to energy-wise purchasing decisions and software performance controls. Thin client technology, facility planning, vendor collaboration, client base buy-in, virtualization, energy audits, and using software to balance performance and efficiency will all be on the menu. Wait until you hear how we incorporate the power of the bicycle into computing technology support!

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


Properties of ZnO/Cu/ZnO multilayer films deposited by simultaneous RF and DC magnetron sputtering at different substrate temperatures ZnO/Cu/ZnO transparent conductive multilayer films are prepared by simultaneous RF sputtering of ZnO and DC sputtering of Cu. The properties of the multilayer films are studied at different substrate temperatures. Sheet resistance of the multilayer film decreased initially with increase of substrate temperature and increased further with increase of substrate temperature beyond 100C. However, transmittance of the multilayer film increased with increase of substrate temperature. Good transparent conductive film of sheet resistance 9.3?/sq and transmittance of 85% was found at a substrate temperature of 100C. The performance of the multilayer film was evaluated using a figure of merit. The observed property of the multilayer film is suitable for the application of transparent conductive electrodes.

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


A new symbiotic evolution-based fuzzy-neural approach to fault diagnosis of marine propulsion systems This paper presents a symbiotic evolution-based fuzzy-neural diagnostic system (SE-FNDS) for fault diagnosis of propellershaft marine propulsion systems. The SE-FNDS combination of fuzzy modeling, back-propagation training and symbiotic evolution function auto-generates its own optimal fuzzy-neural architecture, a significant advantage over previous time-consuming manual parameter determination. Four hundred samples from a test propellershaft system are taken over a range of 100500rpm, during normal and experimentally induced faulty operation. This database is applied as input/output rule generation and training data for the fuzzy-neural network. Comparison of system construction time and diagnostic accuracy is made by applying the same database to SE-FNDS and four traditional systems. Compared to traditional methods, diagnostic decisions from SE-FNDS show 94.17% agreement with real conditions and less CPU time for system construction. Two nonlinear function approximations are also used to demonstrate the proposed system. The presented design is useful as a core module for more advanced computer-assisted diagnostic systems and for direct application in marine propulsion systems.

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

symbiotic evolution
fuzzy modeling
marine propulsion

backpropagation neural network
power spectrum density


Robotic harvesting of Gerbera Jamesonii based on detection and three-dimensional modeling of cut flower pedicels Within the present study, a system for the automated harvest of Gerbera jamesonii pedicels with the help of image analytic methods was developed. The study can be divided mainly into two parts: the development of algorithms for the identification of pedicels in digital images and the development of procedures for harvesting these pedicels with a robot. Images of plants were taken with a stereo camera system, which consisted of two high-resolution CCD-cameras with near-infrared filters. The plant was positioned on a rotatable working desk and images of eight different positions were shot. The developed image processing algorithm segmented the potential pedicel regions in the images, removed noise, differentiated overlapping pedicels by using different algorithms and combined the remaining regions to pedicel objects. From the data of both images and eight plant positions three-dimensional models of the pedicels were created by triangulation. The remaining parts of the plants were modeled in a simple fashion. The evaluated 3D model is used to calculate spatial coordinates for the applied robot control. For harvesting the pedicels, an industrial robot with six axes (plus an additional linear axis) was used. A pneumatic harvest grabber was developed, which harvested the pedicels by cutting them off. In order to guarantee the collision free path of the robot, a path planning module was integrated, which includes the three-dimensional model of the plant and the test facility. With the applied techniques it was possible to correctly detect all pedicels on about 72% of the images. Regarding the whole image series of the respective plant, all pedicels could be detected in at least one photographing position in 97% of all cases. In the harvest experiments 80% of all pedicels could be harvested. The harvest rates decreased with increasing numbers of pedicels on a plant. Therefore, 98% of the pedicels could be harvested of plants with one or two pedicels, but only 51% were harvested of plants with five or more pedicels. In horticultural practice, an identification system for evaluating the stage of maturity should be included. An implementation for harvesting pedicels of different species with similar basic characteristics is imaginable.

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

automated harvest
image processing
gerbera


Design, Analysis and Verification of Real-Time Systems Based on Time Petri Net Refinement A type of refinement operations of time Petri nets is presented for design, analysis and verification of complex real-time systems. First, the behavior preservation is studied under time constraints in a refinement operation, and a sufficient condition for behavior preservation is obtained. Then, the property preservation is considered, and the results indicate that if the refinement operation of time Petri nets satisfies behavior preservation, it can also preserve properties such as boundedness and liveness. Finally, based on the behavior preservation, a reachability decidability algorithm of a refined time Petri net is designed using the reachability trees of its original net and subnet. The research results are illustrated by an example of designing, analyzing and verifying a real-time manufacturing system.

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

design verification refinement reachability

theory
real-time
automated manufacturing system


Audio steganalysis of spread spectrum information hiding based on statistical moment and distance metric Audio information hiding has attracted more attentions recently. Spread spectrum (SS) technique has developed rapidly in this area due to the advantages of good robustness and immunity to noise attack. Accordingly detecting the SS hiding effectively and verifying the presence of the secrete message are important issues. In this paper we present two steganalysis algorithms for SS hiding. Both the two methods are based on machine learning theory and discrete wavelet transform (DWT). In the algorithm I, we introduce Gaussian mixture model (GMM) and generalize Gaussian distribution (GGD) to character the probability distribution of wavelet sub-band. Then the absolute probability distribution function (PDF) moment is extracted as feature vectors. In the algorithm II, we propose distance metric between GMM and GGD of wavelet sub-band to distinguish cover and stego audio. Four distance metrics (Kullback-Leibler Distance, Bhattacharyya Distance, Earth Movers Distance, L2 Distance) are calculated as feature vectors. The support vector machine (SVM) classifier is utilized for classification. The experiment results of both two proposed algorithms can achieve better detecting performance. Even when embedding strength gets 0.0005, the correct detection rate can reach up to 90%. Its simplicity and extensibility indicate further application in other audio steganalysis.

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


Neighborhood outlier detection KNN (k nearest neighbor) is widely discussed and applied in pattern recognition and data mining, however, as a similar outlier detection method using local information for mining a new outlier, neighborhood outlier detection, few literatures are reported on. In this paper, we introduce neighborhood model as a uniform framework to understand and implement neighborhood outlier detection. Furthermore, a neighborhood-based outlier detection algorithm is also given. This algorithm integrates rough set granular technique with outlier detecting. We propose a neighborhood-based metric on outlier detection, and compare neighborhood outlier detection with DIS, KNN and RNN. The experimental results show that neighborhood-based metric is able to measure the local information for outlier detection. The detected accuracies based on neighborhood outlier detection are superior to DIS, KNN for mixed dataset, and a litter better than RNN for discrete dataset. (C) 2010 Elsevier Ltd. All rights reserved.

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


Statistical properties of factor oracles Factor and suffix oracles have been introduced in Allauzen et al. (1999) [1] in order to provide an economic and efficient solution for storing all the factors and suffixes respectively of a given text. Whereas good estimations exist for the size of the factor/suffix oracle in the worst case, no average-case analysis has been done until now. In this paper, we give an estimation of the average size for the factor/suffix oracle of an n-length text when the alphabet size is 2 and under a Bernoulli distribution model with parameter 1/2. To reach this goal, a new oracle is defined, which shares many of the properties of a factor/suffix oracle but is easier to study and provides an upper bound of the average size we are interested in. Our study introduces tools that could be further used in other average-case analysis on factor/suffix oracles, for instance when the alphabet size is arbitrary.

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

indexing structure
average-case analysis
factor recognition
suffix recognition


Applying query structuring in cross-language retrieval We will explore various ways to apply query structuring in cross-language information retrieval. In the first test, English queries were translated into Finnish using an electronic dictionary, and were run in a Finnish newspaper database of 55,000 articles. Queries were structured by combining the Finnish translation equivalents of the same English query key using the syn-operator of the InQuery retrieval system. Structured queries performed markedly better than unstructured queries. Second, the effects of compound-based structuring using a proximity operator for the translation equivalents of query language compound components were tested. The method was not useful in syn-based queries but resulted in decrease in retrieval effectiveness. Proper names are often non-identical spelling variants in different languages. This allows n-gram based translation of names not included in a dictionary. In the third test, a query structuring method where the Boolean and-operator was used to assign more weight to keys translated through n-gram matching gave good results.

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

compound word processing
cross-language information retrieval
n-gram matching
proper name searching


Minimum distance estimation of GARCH(1,1) models A distribution free approach to the estimation of GARCH(1, 1) models is presented. More specifically, the proposed method relies on a Minimum Distance Estimator (MDE) based on the autocovariance function of the squared observations. The asymptotic properties of the estimator are studied giving conditions for its consistency and asymptotic normality while its finite sample efficiency is assessed by means of a simulation study. Finally the proposed estimation method is applied to a time series of hourly returns on the FIFSE100 index futures. (c) 2005 Elsevier B.V. All rights reserved.

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

minimum distance estimation
autocovariance function

garch models
quasi maximum likelihood
high frequency


Parallel execution of a connected component labeling operation on a linear array architecture This work presents a novel parallel algorithm and architecture for finding connected components in an image. Simulation results indicate that the proposed algorithm has an execution time of N-2 +6N-4 cycles for an NxN image using an architecture containing 4 parallel processors. The proposed hardware can process a 128 x 128 image in 0.8574 ms and uses only 4 processors, compared to 0.85 ms and 128 processors for the work of Ranganathan et al. [14], and 94.6 ms and 16384 processors for the MPP [22]. Among the advantages of the novel architecture are modularity, expandability, regular data flow, and simple hardware. These properties are extremely desirable for VLSI implementations. Additionally, the execution time of the algorithm is independent of its image content; thus, it is quite flexible.

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

connected component labeling
parallel algorithm
linear array


Performance of a pneumatic force controlling servosystem: Influence of valves conductance The paper presents the study addressed to evaluate the performance of a pneumatic force controlling servosystem. In particular, the servoactuator operating range, whereby the desired force can be controlled in steady-state working condition with speed disturbance, is analyzed. The servosystem is described with continuity flow-rate and rod equilibrium equations for the cylinder and the equation of air mass flow-rate through the valves. The parameters considered during the study are the force exerted by the cylinder, the speed of the rod, the sizes of the cylinder and valves, the pressure values of the air inside the chambers of the actuator, the coefficient of the polytropic transformation of the air. The methodology of analysis considers a dimensionless parameter in order to obtain general results which could be applied to any specific actual case. Furthermore, an application of the servosystem with digital modulated valves is presented and its nonlinear model in Matlab/Simulink environment is described. In conclusion the servosystem performance as obtained through nonlinear simulation is investigated on the basis of the non-dimensional design diagrams.

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

servosystem design methodology
pneumatic servosystem
pneumatic valve conductance
force control
pnm/pwm modulation


The theory and design of a class of recombination nonuniform filter banks with linear phase filters This paper proposes a new theory and design method for a class of recombination nonuniform filter banks (RNFBs) with linear phase (LP) filters. In a uniform filter bank (FB), consecutive channels are merged by sets of transmultiplexers (TMUXs) to realize a nonuniform FB. RNFBs with LP analysis/synthesis filters are of great interest because the analysis filters for the partially reconstructed signals, through merging, are LP and hence less phase distortions are introduced to the desired signals. We analyze the spectrum supports of the analysis filters of these LP RNFBs. The conditions on the uniform FB and recombination TMUXs of an LP RNFB with good frequency characteristics are determined. These conditions are relatively simple to be satisfied and the uniform FB and recombination TMUXs can be designed separately without much degradation in performance. This allows dynamically recombination of different number of channels in the original uniform FB to give a flexible and time-varying frequency partitioning. Using these results, a method for designing a class of near-perfect-reconstruction (NPR) LP RNFBs with cosine roll-off transition band using the REMEZ algorithm is proposed. A design example is given to show that LP RNFBs with good frequency responses and reasonably low reconstruction errors can be achieved.

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

recombination nonuniform filter bank
transmultiplexer
near-perfect-reconstruction


Voting power in the European Union enlargement The ShapleyShubik power index in a voting situation depends on the number of orderings in which each player is pivotal. The Banzhaf power index depends on the number of ways in which each voter can effect a swing. If there are n players in a voting situation, then the function which measures the worst case running time for computing these indices is in O(n2n). We present a combinatorial method based in generating functions to compute these power indices efficiently in weighted double or triple majority games and we study the time complexity of the algorithms. Moreover, we calculate these power indices for the countries in the Council of Ministers of the European Union under the new decision rules prescribed by the Treaty of Nice.

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

generating function
computational complexity


An 8 bit current-mode CMOS A/D converter with three level folding amplifiers An 8 bit current-mode folding and interpolation analog to digital converter (ADC) with three-level folding amplifiers is proposed in this paper. A current-mode three-level folding amplifier is employed not only to reduce the number of reference current sources, but also to decrease a power dissipation within the ADC. The designed ADC fabricated by a 0.8 mu m n-well CMOS double metal/single poly process occupies the chip area of 2.2mm x 1.6mm. The experimental result shows the power dissipation of 33.6 mW with a power supply of 5 V.

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

three level folding amplifier
current-mode
a/d converter


Validation of Requirements for Hybrid Systems: a Formal Approach Flaws in requirements may have unacceptable consequences in the development of safety-critical applications. Formal approaches may help with a deep analysis that takes care of the precise semantics of the requirements. However, the proposed solutions often disregard the problem of integrating the formalization with the analysis, and the underlying logical framework lacks either expressive power, or automation. We propose a new, comprehensive approach for the validation of functional requirements of hybrid systems, where discrete components and continuous components are tightly intertwined. The proposed solution allows to tackle problems of conversion from informal to formal, traceability, automation, user acceptance, and scalability. We build on a new language, OTHELLO which is expressive enough to represent various domains of interest, yet allowing efficient procedures for checking the satisfiability. Around this, we propose a structured methodology where: informal requirements are fragmented and categorized according to their role; each fragment is formalized based on its category; specialized formal analysis techniques, optimized for requirements analysis, are finally applied. The approach was the basis of an industrial project aiming at the validation of the European Train Control System (ETCS) requirements specification. During the project a realistic subset of the ETCS specification was formalized and analyzed. The approach was positively assessed by domain experts.

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

methodology
european train control system

languages
verification
requirements validation
formal languages
safety-critical applications


The moderating effect of occupation on the perception of information services quality and success Service quality represents a continual concern for practitioners and academicians. While traditional applications of SERVQUAL and SERVPERF have provided fruitful results in service quality research, these instruments are not focused on the information service area, although a number of researchers suggest that service quality be included as an information success measure. In this study, we proposed a modified IS success model that includes service quality as one of the success factors and examine occupation as a moderator of that model. We examined digital information service quality delivered in army libraries and our results contribute to the literature in several areas. We evaluate information system service quality from the perspective of occupation (technical professionals versus administrators). We examined the effect of occupation on perceptions as measured by SERVPERF and validate SERVPERF's dimensions in this environment, In addition, we assessed the moderating effect of occupation on IS success factors. Our results validated the proposed model and provided insight into the moderating effect of occupation on service quality and IS success factors. The results of this investigation provide practical implications for IS service quality because they support the need to consider service delivery based on occupation. (C) 2009 Elsevier Ltd. All rights reserved.

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

information system success
information quality
system quality
satisfaction


Design of lossless block transforms and filter banks for image coding Lossless block transforms and filter banks that map integers to integers are important for unified lossless and lossy image coding systems. In this paper, we present simple yet effective methods for designing lossless versions of block transforms and FIR filter banks. First, an N-point lossless transform and a lossless interpolative prediction are introduced. Next, we demonstrate that filter banks can be decomposed into 2-point transforms or interpolative predictions. Lastly, lossless versions of block transforms and filter banks are obtained by replacing every constituent module by the corresponding lossless version. Lossless versions of 8-point discrete cosine transform (DCT), 8-point Walsh-Hadamard transform (WHT) and several filter banks are designed and their lossless compression performance is evaluated.

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


Comparison of tightly and loosely coupled decision paradigms in multiagent expedition Frameworks for cooperative multiagent decision making may be divided into those where each agent is assigned a single variable (SVFs) and those where each agent carries an internal model, which can be further divided into loosely coupled frameworks (LCFs) and tightly coupled frameworks (TCFs). In TCFs, agent communication interfaces render their subuniverses conditionally independent. In LCFs, either agents do not communicate or their messages are semantically less restricted. SVFs do not address the privacy issue well. LCF agents cannot draw from collective knowledge as well as TCF agents can. However, disproportional effort has been dedicated to SVFs and LCFs, which can be attributed partially to unawareness of the computational advantages of TCFs over performance, efficiency and privacy. This work aims to provide empirical evidence of such advantages by comparing recursive modeling method from LCFs and collaborative design network from TCFs, both of which are decision-theoretic and the latter of which is based on graphical models. We apply both to a testbed, multiagent expedition, resolve technical issues encountered, and report our experimental evaluation. (C) 2010 Elsevier Inc. All rights reserved.

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

collaborative design network
recursive modeling method
multiagent expedition

multiagent reasoning
collaborative decision making


Two-way TCP traffic over rate controlled channels: Effects and analysis We study the performance of bidirectional TCP/IP connections over a network that uses rate-based dow and congestion control. An example of such a network is an asynchronous transfer mode (ATM) network using the available bit rate (ABR) service, The sharing of a common buffer by TCP packets and acknowledgment tacks) has been known to result in an effect called ack compression, where acks of a connection arrive at the source bunched together, resulting in unfairness and degraded throughput. It has been the expectation that maintaining a smooth flow of data using rate-based how control would mitigate, if not eliminate, the various forms of burstiness experienced with the TCP window flow control. However, we show that the problem of TCP ack compression appears even while operating over a rate-controlled channel, although the queues are primarily at the end systems now. The degradation in throughput due to bidirectional traffic can be significant. For example, even in the simple case of symmetrical connections with adequate window sizes, the throughput of each connection is only 66.67% of that under one-way traffic. By analyzing the periodic bursty behavior of the source LP queue, we derive estimates for the maximum queue size and arrive at a simple predictor for the degraded throughput, applicable for relatively general situations. We validate our analysis using simulation on an ATM network using the explicit rate option of the ABR service. We show that the analysis predicts the behavior of the queue and the throughput degradation not only in simple configurations, but also in more general situations, such as multiple synchronized connections between a pair of end systems, multiple end systems having different round-trip delays, and in configurations with significant amounts of cross-traffic.

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

rate control
tcp over atm
two-way traffic


An integrated production planning model with load-dependent lead-times and safety stocks The divergence over the years or research paradigms addressing the production planning problem has led to the development of an extensive set of techniques, each of which can address a particular aspect of the practical problem and none of which provides a complete Solution. In particular most approaches fail to. address the circular, non-linear dependency between resource utilization, lead-times and safety stocks. We present a non-linear programming formulation of the integrated problem using clearing functions that determines a work release schedule guaranteeing a specified service level in the face of stochastic demand We introduce an iterative heuristic solution procedure that solves a relaxed LP approximation of the original NLP at each iteration to determine the lead-time profile to set safety-stock levels Computational experiments suggest that our proposed iterative procedure performs well relative to conventional LP models that assume fixed. workload-independent lead-times. (C) 2009 Elsevier Ltd. All rights reserved.

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

capacity planning
clearing function
safety stock
load-dependent lead-times
linear programming


Multivariable nonlinear control of STATCOM for synchronous generator stabilization A static synchronous compensator (STATCOM) is a typical flexible ac transmission system device playing a vital role as a stability aid for small and large transient disturbances in an interconnected power system. This article deals with design and evaluation of a feedback linearizing nonlinear controller for STATCOM installed in a single-machine infinite-bus power system. In addition to the coordinated control of ac and dc bus voltages, the proposed controller also provides good damping to the electromechanical oscillation of the synchronous generator under transient disturbances. The efficiency of the control strategy is evaluated by computer simulation studies. The comparative study of these results with the conventional cascade control structure establishes the elegance of the proposed control scheme.

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

facts
feedback linearization
power system control


Frequency-response masking based FIR filter design with power-of-two coefficients and suboptimum PWR This paper presents a new method for designing sharp linear phase FIR filters with power-of-two coefficients. The method is based on a frequency-response masking technique. In this method, the power-of-two coefficients and continuous scaling parameters of the subfilters are taken to be decision variables, and minimizing peak weighted ripple (PWR) is taken to be the design objective. The resulting nonlinear mixed integer optimization problem for each subfilter is first reduced to an equivalent discrete optimization problem whose search region is then cropped for efficiency of computation, similar to the approach in Ref. 1, although a different cropping strategy is used here. The effectiveness of the method is demonstrated through a lowpass linear phase sharp FIR digital filter example.

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

frequency-response masking
finite-impulse response
power-of-two coefficients
simulated annealing


Is Web-based instruction popular in psychology? A national survey To date, there has been sparse research on the extent of use of online (Web-based) instructional approaches in academic Psychology. This survey reports the findings of a national survey (N=207) of Chairs of Psychology departments on the didactic use of online instruction. Although the respondents expressed positive views regarding Web-based pedagogy, the actual implementation by psychology faculty of online instruction was reported by Chairs as being somewhat negligible. Previous studies have found that that the major drawback to the use of online teaching is the lack of formal training in computer technology on the part of psychology instructors (e.g., Vodanovich, S. J., & Piotrowski, C. (2001). Journal of Instructional Psychology, 28, 253255). The implications of embracing Web-based didactic approaches for the field are discussed.

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


The Singular Value Filter: A General Filter Design Strategy for PCA-Based Signal Separation in Medical Ultrasound Imaging A general filtering method, called the singular value filter (SVF), is presented as a framework for principal component analysis (PCA) based filter design in medical ultrasound imaging. The SVF approach operates by projecting the original data onto a new set of bases determined from PCA using singular value decomposition (SVD). The shape of the SVF weighting function, which relates the singular value spectrum of the input data to the filtering coefficients assigned to each basis function, is designed in accordance with a signal model and statistical assumptions regarding the underlying source signals. In this paper, we applied SVF for the specific application of clutter artifact rejection in diagnostic ultrasound imaging. SVF was compared to a conventional PCA-based filtering technique, which we refer to as the blind source separation (BSS) method, as well as a simple frequency-based finite impulse response (FIR) filter used as a baseline for comparison. The performance of each filter was quantified in simulated lesion images as well as experimental cardiac ultrasound data. SVF was demonstrated in both simulation and experimental results, over a wide range of imaging conditions, to outperform the BSS and FIR filtering methods in terms of contrast-to-noise ratio (CNR) and motion tracking performance. In experimental mouse heart data, SVF provided excellent artifact suppression with an average CNR improvement of 1.8 dB (P < 0.05) with over 40% reduction (P < 0.05) in displacement tracking error. It was further demonstrated from simulation and experimental results that SVF provided superior clutter rejection, as reflected in larger CNR values, when filtering was achieved using complex pulse-echo received data and non-binary filter coefficients.

O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 separation
singular value decomposition

artifact reduction
cardiac imaging
principal component analysis (pca)


Cellular Prion Protein Signaling in Serotonergic Neuronal Cells The cellular prion protein PrPC is the normal counterpart of the scrapie prion protein PrPSc, the main component of the infectious agent of transmissible spongiform encephalopathies (TSEs). It is a ubiquitous cell-surface glycoprotein, abundantly expressed in neurons, which constitute the targets of TSE pathogenesis. Taking advantage of the 1C11 neuroectodermal cell line, endowed with the capacity to convert into 1C115-HT serotonergic or 1C11NE noradrenergic neuronal cells, allowed us to ascribe a signaling function to PrPC. Antibody-mediated ligation of PrPC recruits transduction pathways, which involve nicotinamide adenine dinucleotide phosphate (NADPH) oxidase-dependent reactive oxygen species production and target the extracellular-regulated kinases ERK1/2. In fully differentiated cells only, these effectors are under the control of a PrPC-caveolin-Fyn platform, located on neuritic extensions. In addition to its proper signaling activity, PrPC modulates the agonist-induced response of the three serotonergic G proteincoupled receptors present on the 1C115-HT differentiated cells. The impact of PrPC ligation on the receptor couplings depends on the receptor subtype and the pathway considered. The implementation of the PrPC-caveolin complex again is mandatory for PrPC to exert its action on 5-HT receptor signaling. Our current data argue that PrPC interferes with the intensities and/or dynamics of G protein activation by agonist-bound 5-HT receptors. By mobilizing transduction cascades controlling the cellular redox state and the ERK1/2 kinases and by altering 5-HT receptor-mediated intracellular response, PrPC takes part in the homeostasis of serotonergic neuronal cells. These findings may have implications for future research aiming at understanding the fate of serotonergic neurons in prion diseases

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


SIMULATION OF NEWTONIAN AND NON-NEWTONIAN AXISYMMETRIC FLOW WITH AN AXISYMMETRIC LATTICE BOLTZMANN MODEL Axisymmetric flow is of both fundamental interest and practical significance. A recently derived axisymmetric lattice Boltzmann model [J. G. Zhou, phys. Rev. E 78, 036701 (2008)] is adopted for studying several typical axisymmetric flows. First, the Hagen-Poiseuille flow in circular pipes is validated and the Poiseuille flow in annular cylinders is studied under different values of the radius ratio. Second, pulsatile flow in an axisymmetric pipe with a sinusoidal pressure gradient is conducted. Third, flows through pipes with various constrictions or expansions are discussed. Finally, we extend the axisymmetric lattice Boltzmann method for non-Newtonian flow. It is found that the obtained numerical results agree well with available analytical solutions. It is also observed that constriction or expansion in a pipe influences the velocity distribution of the flow significantly. In addition, the results demonstrate that the modified axisymmetric lattice Boltzmann model is capable of handling non-Newtonian flow.

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

lattice boltzmann model
axisymmetric flow
constriction
expansion


A fast approach to deformable surface 3D tracking Deformable surface 3D tracking is a severely under-constrained problem and great efforts have been made to solve it. A recent state-of-the-art approach solves this problem by formulating it as a second order cone programming (SOCP) problem. However, one drawback of this approach is that it is time-consuming. In this paper, we propose an effective method for 3D deformable surface tracking. First, we formulate the deformable surface tracking problem as a linear programming (LP) problem. Then, we solve the LP problem with an algorithm which converges superlinearly rather than bisection algorithm whose convergence speed is linear. Our experimental studies on synthetic and real data have demonstrated the proposed method can not only reliably recover 3D structures of surfaces but also run faster than the state-of-the-art method.

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

deformable surface 3d reconstruction
convex optimization


Discussion on symmetry of optimum topology design Recent study by Rozvany discussed an important topic in structural topology optimization: non-uniqueness and symmetry. This paper demonstrates that for the frame topology optimization with frequency objective or frequency constraints, the topology optimum is not symmetric even when the geometry, material distribution and ground structure are symmetric. Two benchmark examples with fundamental frequency constraints support our view. Nonlinear and non-convex constraints are contributors to non-symmetric optimum solution for the class of topology optimization problems considered here.

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


the implication and finite implication problems for typed template dependencies The class of typed template dependencies is a class of data dependencies that includes embedded multivalued and join dependencies. We show that the implication and the finite implication problems for this class are unsolvable. An immediate corollary is that this class has no formal system for finite implication. We also show how to construct a finite set of typed template dependencies whose implication and finite implication problems are unsolvable.The class of simple template dependencies is a proper subclass of the above class, and it generalizes slightly embedded join dependencies. It is shown that the implication and the finite implication problems for this class are also unsolvable. An immediate corollary is that this class has no formal system for either implication or finite implication.

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

systems
formalism
data dependence
embedding


a joint framework for collaborative and content filtering This paper proposes a novel, unified, and systematic approach to combine collaborative and content-based filtering for ranking and user preference prediction. The framework incorporates all available information by coupling together multiple learning problems and using a suitable kernel or similarity function between user-item pairs. We propose and evaluate an on-line algorithm (JRank)that generalizes perceptron learning using this framework and shows significant improvement over other approaches.

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

framework
user preference
similarity
learning
algorithm
paper
filtering
ranking

collaboration contention couples functional informal evaluation user predict


About Hahn-Banach extension theorems and applications to set-valued optimization In this paper we revise several generalizations of the algebraic Hanh-Banach extension theorem for set-valued maps and give new versions in terms of set-relations and selections. We apply our results by establishing optimality conditions for a set-valued constrained optimization problem considering several types of solutions. Finally, we give necessary conditions for the existence of affine selections via affinelike maps in the framework of linear spaces. (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

hahn-banach theorem
set-valued map
affine selection
set optimization
lagrange multiplier theorem
affinelike map


Dose-guided radiotherapy for lung tumors The transit in vivo dosimetry performed by an electronic portal imaging device (EPID) is a very practical method to check error sources in radiotherapy. Recently, the present authors have developed an in vivo dosimetry method based on correlation functions, F (w, L), defined as the ratio between the transit signal, S t (w, L), by the EPID and the mid-plane dose, D m (w, L), in a solid water phantom as a function of the phantom thickness, w, and of the field dimensions, L. In particular, generalized correlation functions F (w, L) for 6, 10 and 15MV X-ray beams supplied by a pilot Varian linac, are here used by other three linacs operating in two centers. This way the workload, due to measurements in solid water phantom, needed to implement the in vivo dosimetry method was avoided. This article reports a feasibility study on the potentiality of this procedure for the adaptive radiotherapy of lung tumors treated by 3D conformal radiotherapy techniques. In particular, the dose reconstruction at the isocenter point D iso in the lung tumor has been used as dose-guided radiotherapy (DGRT), to detect the inter-fraction tumor anatomy variations that can require new CT scans and an adaptive plan. When a difference greater than 6% between the predicted dose by the treatment planning system (TPS), D iso,TPS and the D iso was observed, the clinical action started to detect possible anatomical lung tumor changes. Twelve over twenty patients examined presented in vivo dose discrepancies due to the tumor morphological changes during treatments, and these results were successively confirmed by new CT scans. In this work, for a patient that showed for all beams, D iso values over the tolerance level, the new CT scan was used for an adaptive plan. The lung dose volume histogram for D iso,TPS=2Gy per fraction suggested the adaptive plan. In particular, the lung volume included in 2Gy increased from 350cm3 of the original plan to 550cm3 of the hybrid plan, while for the adaptive plan the lung volume included in 2Gy decreased to 15cm3. Moreover, the mean doses to the organs at risk were reduced to 70%. The results of this research show that the DGRT procedure by the D iso reconstruction, integrated with radiological imaging, was feasible for periodic investigation on morphological lung tumor changes. This feasibility study takes into account the accuracy of two algorithms based on the pencil beam and collapsed cone convolution models for dose calculations where large density inhomogeneities are present.

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 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 B I I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 the parameterized complexity of coloring graphs in the absence of a linear forest ? The k-Coloring problem is to decide whether a graph can be colored with at most k colors such that no two adjacent vertices receive the same color. The Listk-Coloring problem requires in addition that every vertex u must receive a color from some given set L(u)?{1,,k} L ( u ) ? { 1 , , k } . Let Pn P n denote the path on n vertices, and G+H G + H and rH the disjoint union of two graphs G and H and r copies of H, respectively. We show that Listk-Coloring is fixed-parameter tractable on graphs with no induced rP1+P2 r P 1 + P 2 when parameterized by k+r k + r , and that for any fixed integer r, the problem k-Coloring restricted to such graphs allows a polynomial kernel when parameterized by k. Finally, we show that Listk-Coloring is fixed-parameter tractable on graphs with no induced P1+P3 P 1 + P 3 when parameterized by k.

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

k-coloring coloring
listk-coloring list coloring
h-free
fixed-parameter tractable


A new algebraic tool for Automatic Theorem Provers - Multisemilattice: A structure to improve the efficiency of provers in temporal logics The concepts of implicates and implicants are widely used in several fields of "Automated Reasoning". Particularly, our research group has developed several techniques that allow us to reduce efficiently the size of the input, and therefore the complexity of the problem. These techniques are based on obtaining and using implicit information that is collected in terms of unitary implicates and implicants. Thus, we require efficient algorithms to calculate them. In classical propositional logic it is easy to obtain efficient algorithms to calculate the set of unitary implicants and implicates of a formula. In temporal logics, contrary to what we see in classical propositional logic, these sets may contain infinitely many members. Thus, in order to calculate them in an efficient way, we have to base the calculation on the theoretical study of how these sets behave. Such a study reveals the need to make a generalization of Lattice Theory, which is very important in "Computational Algebra". In this paper we introduce the multisemilattice structure as a generalization of the semilattice structure. Such a structure is proposed as a particular type of poset. Subsequently, we offer an equivalent algebraic characterization based on non-deterministic operators and with a weakly associative property. We also show that from the structure of multisemilattice we can obtain an algebraic characterization of the multilattice structure. This paper concludes by showing the relevance of the multisemilattice structure in the design of algorithms aimed at calculating unitary implicates and implicants in temporal logics. Concretely, we show that it is possible to design efficient algorithms to calculate the unitary implicants/implicates only if the unitary formulae set has the multisemilattice structure.

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

theorem provers
implicants
lattice theory
multisemilattice


Robot-assisted automatic insertion of steerable needles with closed-loop imaging feedback and intraoperative trajectory replanning This paper presents a robot-assisted approach for automatic steering of flexible beveled needles in percutaneous procedures. The method uses duty-cycled rotation of the needle to perform insertion with arcs of adjustable curvature, and combines closed-loop imaging feedback with an intraoperative motion replanning strategy to compensate for system uncertainties and disturbances. Differently from previous solutions, the closed-loop replanning strategy is suitable for dynamic scenes since it does not rely on prebuilt roadmaps. Indeed, simulations of a needle insertion under the presence of moving obstacles and target confirmed the advantage of the approach with final mean error of 0.34 mm to the desired goal. Also, our new path planner presented 143% higher success rate and was more than 377% faster than the previous developed algorithm. The proposed system was also physically implemented using a nitinol needle prototype attached to a robotic manipulator, and validated with in vitro tests performed in closed-loop with imaging feedback from a camera. In such tests, the needle tip should reach a desired target in a tissue phantom, while deviating from obstacles and compensating for modeling uncertainties such as tissue inhomogeneity and imprecise needle tip tracking. The successful obstacle avoidance and mean insertion precision of 1.34 mm during the experimental trials attested the viability of our method and presented the intraoperative replanning approach as a strong candidate for future use in automatic needle steering solutions. (C) 2013 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 B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B B O O O O O O O O


Efficient techniques for binary-to-multidigit multidimensional logarithmic number system conversion using range-addressable look-up tables The Multidimensional Logarithmic Number System (MDLNS), which has similar properties to the classical Logarithmic Number System (LNS), provides more degrees of freedom than the LNS by virtue of having two, or more, orthogonal bases and has the ability to use multiple MDLNS components, or digits. Unlike the LNS, there is no monotonic relationship between standard binary representations and MDLNS representations. Using look-up tables (LUTs) to perform the mapping function can be unrealistic for hardware implementations when large binary ranges or multiple digits are used. This paper proposes a novel range-addressable technique for using look-up tables that allows efficient conversion from binary-to-single or multidigit MDLNS with varying accuracies, depending on the selected implementation.

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


Defining supply chain management: a historical perspective and practical guidelines Interest in supply chain management has steadily increased since the 1980s when firms saw the benefits of collaborative relationships within and beyond their own organization. Firms are finding that they can no longer compete effectively in isolation of their suppliers or other entities in the supply chain. A number of definitions of supply chain management have been proposed in the literature and in practice. This paper defines the concept of supply chain management and discusses its historical evolution. The term does not replace supplier partnerships, nor is it a description of the logistics function. The competitive importance of linking a firm's supply chain strategy to its overall business strategy and some practical guidelines are offered for successful supply chain management.

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

competitiveness
operations
supply-chain management


On some generalizations of the Thue-Morse morphism In 1912, the Norwegian mathematician Axel Thue was the first to describe an overlap-free binary infinite word. This word was generated by a morphism which is called, since the works of Morse, the Thue-Morse morphism. Here, we present two generalizations of the Thue-Morse morphism in the case of alphabets with more than two letters. The extension of the characteristic properties of the word of Thue to the words generated by these morphisms is considered. One of these generalizations corresponds to the construction of Prouhet and a link with the Arshon words is given. In particular, we prove that if n is an even number then the n-letter Arshon word is generated by morphism. (C) 2002 Elsevier Science B.V. All rights reserved.

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

thue-morse
overlap-free words
overlap-free morphisms
prouhet words


High-Fat High-Energy Feeding Impairs Fasting Glucose and Increases Fasting Insulin Levels in the Gttingen Minipig High-fat diet and obesity are known to be of major importance for development of type 2 diabetes in humans. High-fat feeding can induce syndromes of glucose intolerance and/or insulin resistance in several species, and the Gttingen minipig might be a useful model for studying the effect of dietary high-fat intake and obesity on glucose homeostasis and the susceptibility to diabetes. The present study was designed as a pilot study to investigate the effects of obesity caused by high-fat high-energy feeding on oral and intravenous glucose tolerance. Male Gttingen minipigs were fed a control diet (CD) or a high-fat high-energy diet (HFD) for 3 months. Body weight (32.6 2.4 kg vs. 24.9 0.5 kg, p < 0.001) and total (13.2 3.2% vs. 6.1 0.5%, p= 0.002) and truncal (11.0 3.9% vs. 1.8 1.1%, p= 0.001) fat percent were increased significantly, whereas relative lean body mass was decreased (84.8 3.3% vs. 91.9 0.5%, p= 0.002) in the HFD group compared to CD. Fasting plasma glucose (4.3 0.4 mM vs. 3.6 0.3 mM, p= 0.023) and insulin (80 23 pM vs. 23 21 pM, p= 0.012) were increased in the HFD group compared to CD, but oral glucose tolerance was not significantly changed. Insulin responses to intravenous glucose were increased (6741 2538 vs. 3938 771 pM 3 min, p= 0.050), while glucose clearance was not changed by HFD vs. CD, thus indicating insulin resistance. In conclusion, changes in body weight and composition, resulting in minor abnormalities in glucose tolerance and insulin sensitivity, characterized by slight hyperglycemia and compensatory hyperinsulinemia, can be induced in the male Gttingen minipig by high-fat high-energy feeding for 3 months. This approach seems to be an interesting and promising method for establishment of a nonrodent model of insulin resistance or type 2 diabetes.

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

gttingen minipigs
obesity
glucose tolerance
insulin sensitivity
type 2 diabetes
male


Particle dynamics simulations of the Navier-Stokes flow with hard disks Flow simulation with a particle dynamics method is studied. The fluid is made of hard particles which obey the Newtonian equations of motion and the collisions between particles are elastic, that is, energy and momentum are conserved. The viscosity appears autonomously together with the local equilibrium state. When a particle collides with a nonslip boundary, a new velocity is given randomly from the thermal distribution if the wall is isothermal, or a random reflection angle is selected if the wall is adiabatic. Shear viscosity is estimated from simulations of plane Poiseuille flow together with the confirmation that the system obeys the Navier-Stokes equation. Flows past a cylinder are also simulated. Depending on the Reynolds number up to 106, flow patterns are properly reproduced, and Karman vortex shedding is observed. The estimated values of drag coefficient show quantitative agreement with experiments.

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

shear viscosity
karman vortex
drag coefficient


Analysis for the Integration Feasibility of OpenSPARC T1 and a Petri Nets Processor to Form a System with Hardware Synchronization Capability OpenSPARC T1 is the open source version of the UltraSPARC T1 processor developed by Sun Microsystems. XiIinx development kit with a Virtex-5 gives the chance to test and change it. We analyzed the performance of the parts of OpenSPARC and Petri processor. We have considered several possibilities of adding a Petri processor to improve performance of processes that require synchronization.

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


Use of a double Fourier series for three-dimensional shape representation The representation of three-dimensional star-shaped objects by the double Fourier series (DFS) coefficients of their boundary function is considered. An analogue of the convolution theorem for a DFS on a sphere is developed. It is then used to calculate the moments of an object directly from the DFS coefficients, without an intermediate reconstruction step. The complexity of computing the moments from the DFS coefficients is O(N (2) log N), where N is the maximum order of coefficients retained in the expansion, while the complexity of computing the moments from the spherical harmonic representation is O(N (2) log (2) N). It is shown that under sufficient conditions, the moments and surface area corresponding to the truncated DFS converge to the true moments and area of an object. A new kind of DFS-the double Fourier sine series-is proposed which has better convergence properties than the previously used kinds and spherical harmonics in the case of objects with a sharp point above the pole of the spherical domain.

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

fourier series on spheres
three-dimensional shape analysis
star-shaped objects


Use of constant, linear and quadratic boundary elements in 3D wave diffraction analysis The performance of the Boundary Element Method (BEM) depends on the size of the elements and the interpolation function used. However, improvements in accuracy and efficiency obtained with both expansion and grid refinement increases demand on the computational effort. This paper evaluates the performance of constant, linear and quadratic elements in the analysis of the three-dimensional scattering caused by a cylindrical cavity buried in an infinite homogeneous elastic medium subjected to a point load. A circular cylindrical cavity for which analytical solutions are known is used in the simulation analysis. First, the dominant BEM errors are identified in the frequency domain and related to the natural vibration modes of the inclusion. Comparisons of BEM errors are then made for different types of boundary elements, maintaining similar computational costs. Finally, the accuracy of the BEM solution is evaluated when the nodal points are moved inside linear and quadratic discontinuous elements.

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

boundary elements
constant
linear and quadratic elements


Knowledge networking to support medical new product development New product development (NPD) in the pharmaceutical industry is very knowledge intensive. Knowledge generated and used during medical NPD processes is fragmented and distributed across various phases and artifacts. Many challenges in medical NPD can be addressed by the integration of this fragmented knowledge. We propose the creation and use of knowledge networks to address these challenges. Based on a case study conducted in a leading pharmaceutical company, we have developed a knowledge framework that represents knowledge fragments that need to be integrated to support medical NPD. We have also developed a prototype system that supports knowledge integration using knowledge networks. We illustrate the capabilities of the system through scenarios drawn from the case study. Qualitative validation of our approach is also presented.

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

knowledge integration
knowledge networks
new product development

pharmaceutical knowledge management
healthcare


Natural coordinate descent algorithm for L1-penalised regression in generalised linear models The problem of finding the maximum likelihood estimates for the regression coefficients in generalised linear models with an ?1 ? 1 sparsity penalty is shown to be equivalent to minimising the unpenalised maximum log-likelihood function over a box with boundary defined by the ?1 ? 1 -penalty parameter. In one-parameter models or when a single coefficient is estimated at a time, this result implies a generic soft-thresholding mechanism which leads to a novel coordinate descent algorithm for generalised linear models that is entirely described in terms of the natural formulation of the model and is guaranteed to converge to the true optimum. A prototype implementation for logistic regression tested on two large-scale cancer gene expression datasets shows that this algorithm is efficient, particularly so when a solution is computed at set values of the ?1 ? 1 -penalty parameter as opposed to along a regularisation path. Source code and test data are available from http://tmichoel.github.io/glmnat/.

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

coordinate descent algorithm
logistic regression

penalised regression
generalised linear model


The complexity of satisfiability for fragments of hybrid logic-Part I The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this paper, we investigate the effect of restricting the propositional part of the language on decidability and on the complexity of the satisfiability problem over arbitrary, transitive, total frames, and frames based on equivalence relations. We also consider different sets of modal and hybrid operators. We trace the border of decidability and give the precise complexity of most fragments, in particular for all fragments including negation. For the monotone fragments, we are able to distinguish the easy from the hard cases, depending on the allowed set of operators. (C) 2010 Elsevier B.V. All rights reserved.

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


On the power spectral density of self-synchronizing scrambled sequences We derive a closed-form expression for the power spectral density of amplitude/phase-shift keyed bit sequences randomized through self-synchronizing scrambling when the source sequence is a stationary sequence of statistically independent bits, In addition to dependence on the symbol pulse shape, duration, and the signal space values with which symbols are represented,,ve show that the power spectral density is dependent only on the probability of logic ones in the source bit stream, the period of the impulse response of the scrambling shift register, and the number of logic ones in this period, Our results confirm that optimum randomization results with use of primitive scrambling polynomials and poorest randomization occurs with "two-tap" polynomials of the formx(D) + 1.

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

self-synchronizing scrambling
spectral analysis


Verified stochastic methods Markov chains provide quite attractive features for simulating a systems behavior under consideration of uncertainties. However, their use is somewhat limited because of their deterministic transition matrices. Vague probabilistic information and imprecision appear in the modeling of real-life systems, thus causing difficulties in the pure probabilistic model set-up. Moreover, their accuracy suffers due to implementations on computers with floating point arithmetics. Our goal is to address these problems by extending the Dempster-Shafer with Intervals toolbox for MATLAB with novel verified algorithms for modeling that work with Markov chains with imprecise transition matrices, known as Markov set-chains. Additionally, in order to provide a statistical estimation tool that can handle imprecision to set up Markov chain models, we develop a new verified algorithm for computing relations between the mean and the standard deviation of fuzzy sets.

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

interval arithmetic
imprecise probability
markov set-chains
dsi


Adaptive error-resilience transcoding using prioritized intra-refresh for video multicast over wireless networks In this paper, we propose a two-pass error-resilience transcoding scheme based on adaptive intra-refresh for inserting error-resilience features to a compressed video at the intermediate transcoder of a three-tier streaming system. The proposed transcoder adaptively adjusts the intra-refresh rate according to the video content and the channel's packet-loss rate to protect the most important macroblocks against packet loss. In this work, we consider the problem of multicast of video to multiple clients having disparate channel-loss profiles. We propose a MINMAX loss rate estimation scheme to determine a single intra-refresh rate for all the clients in a multicast group. For the scenario that a quality variation constraint is imposed on the users, we also propose a grouping method to partition a multicast group of heterogeneous users into a minimal number of subgroups to minimize the channel bandwidth consumption while meeting the quality variation constraint. Experimental results show that the proposed method can effectively mitigate the error propagation due to packet loss as well as achieve fairness among clients in a multicast.

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

video streaming
error-resilience coding
video transcoding
video adaptation


Estimating gas concentration using a microcantilever-based electronic nose This paper investigates the determination of the concentration of a chemical vapor as a function of several nonspecific microcantilever array sensors. The nerve agent dimethyl methyl phosphonate (DMMP) in parts-per-billion concentrations in binary and ternary mixtures is able to be resolved when present in a mixture containing parts-per-million concentrations of water and ethanol. The goal is to not only detect the presence of DMMP, but additionally to map the nonspecific output of the sensor array onto a concentration scale. We investigate both linear and nonlinear approaches the linear approach uses a separate least-squares model for each component, and a nonlinear approach which estimates the component concentrations in parallel. Application of both models to experimental data indicate that both models are able to produce bounded estimates of concentration, but that the outlier performance favors the linear model. The linear model is better suited to portable handheld analyzer, where processing and memory resources are constrained.

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


Stable and Flexible iBGP Routing oscillation is highly detrimental. It can decrease performance and lead to a high level of update churn placing unnecessary workload on router the problem is distributed between many providers. However, iBGP - the routing protocol used to distribute routes inside a single Autonomous System - has also been shown to oscillate. Despite the fact that iBGP is configured by a single provider according to apparently straight forward rules, more than eight years of research has not solved the problem of iBGP oscillation. Various solutions have been proposed but they all lack critical features: either they are complicated to implement, restrict routing flexibility, or lack guarantees of stability. In this paper we propose a very simple adaptation to the BGP decision process. Despite its simplicity and negligible cost we prove algebraically that it prevents iBGP oscillation. We extend the idea to provide routing flexibility, such as respecting the MED attribute, without sacrificing network stability.

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


Modelling energy storage systems using Fourier analysis: An application for smart grids optimal management We propose a new representation of the optimization dispatch variables. The handled variable are subject to zero-integral constraints in a given time interval. The basic idea comes from Fourier analysis. Fourier decomposition is used to design parametric courses showing zero integral. Advantages are for new optimization problems formulation with parametric functions.

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

integral constraints
electrical energy storage systems
optimal dispatch of resources
multi-objective evolutionary algorithms


Two-dimensional method of moments modelling of lossless overmoded transverse magnetic cavities We present a method of moment (MoM) analysis technique allowing to model overmoded transverse magnetic (TM) cavities in two dimensions. This technique uses the single series form of the Greens function of the empty cavity. The convergence behaviour of this series is analysed in detail.

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


Test Data Compression Using Selective Encoding of Scan Slices We present a selective a encoding method that reduces test data volume and test application time for scan testing of Intellectual Property (IP) cores. This method encodes the slices of test data that are fed to the scan chains in every clock cycle. To drive N scan chains, we use only c tester channels, where c = log(2) (N + 1)]+2. In the best case, we can achieve compression by a factor of N/c using only one tester clock cycle per slice. We derive a sufficient condition on the distribution of care bits that allows us to achieve the best-case compression. We also derive a probabilistic lower bound on the compression for a given care-bit density. Unlike popular compression methods such as Embedded Deterministic Test (EDT), the proposed approach is suitable for IP cores because it does not require structural information for fault simulation, dynamic compaction, or interleaved test generation. The on-chip decoder is small, independent of the circuit under test and the test set, and it can be shared between different circuits. We present compression results for a number of industrial circuits and compare our results to other recent compression methods targeted at IP cores.

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


Buffer Capacity Computation for Throughput-Constrained Modal Task Graphs Increasingly, stream-processing applications include complex control structures to better adapt to changing conditions in their environment. This adaptivity often results in task execution rates that are dependent on the processed stream. Current approaches to compute buffer capacities that are sufficient to satisfy a throughput constraint have limited applicability in case of data-dependent task execution rates. In this article, we present a dataflow model that allows tasks to have loops with an unbounded number of iterations. For instances of this dataflow model, we present efficient checks on their validity. Furthermore, we present an efficient algorithm to compute buffer capacities that are sufficient to satisfy a throughput constraint. This allows to guarantee satisfaction of a throughput constraint over different modes of a stream processing application, such as the synchronization and synchronized modes of a digital radio receiver.

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


Applying Professional Solutions within the Educational Environments by Means of Cloud Computing: Coaching for Teachers In a world where the most used sentences is: "I haven't got the time..." Information Technologies (IT) plays an important role in supporting our daily work, including in everyday educational settings. Such technologies can aid a complete educational system to function successfully so to help the whole school educational life. For this to prove, we present the "Coaching for Teacher" system, a personal technological conversational coach; it aims to provide solutions to overcome difficulties that teachers face during their teaching and learning process. In real time, a teacher can appeal and seek advice rapidly by comfortably talking to an agent. In this paper, we present the steps we followed to design and develop this agent-based application, and a case study conducted in an educational centre for proof that the concept works in an authentic educational environment.

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

educational environments
cloud computing
coaching

information and communication technologies


An analysis of simplex shape measures for anisotropic meshes This paper analyses and generalises several simplex shape measures documented in the literature and currently used for mesh adaptation and mesh optimisation. It first summarises important properties of simplices and their degeneration in Euclidean space. Different simplex shape measures are then defined and validated according to a validity criterion. The shape measures are generalised to Riemannian spaces in order to extend their use to anisotropic meshes. They are then analysed and compared using complementary approaches: a visualisation method helping to show their regularity, some theoretical relations establishing their equivalence, and a discussion on the evaluation of the global quality of a mesh. Conclusions are drawn on the choice of a simplex shape measure to guide mesh optimisation.

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

triangle
tetrahedron
unstructured meshes
riemannian metric
anisotropy


GRAS: An Effective and Efficient Stemming Algorithm for Information Retrieval A novel graph-based language-independent stemming algorithm suitable for information retrieval is proposed in this article. The main features of the algorithm are retrieval effectiveness, generality, and computational efficiency. We test our approach on seven languages (using collections from the TREC, CLEF, and FIRE evaluation platforms) of varying morphological complexity. Significant performance improvement over plain word-based retrieval, three other language-independent morphological normalizers, as well as rule-based stemmers is demonstrated.

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

algorithms experimentation corpus suffix


an algorithm to compute the convex hull in the plane from the distance matrix There exist a variety of algorithms for the convex hull problem in the plane. The input to all of these is the set of points in terms of their coordinates. In this short note, a convex hull algorithm is presented in which the points are specified not through their coordinates but in terms of the distances between pairs of them in the form of a distance matrix. Some applications where this is the case are mentioned, and the algorithm's performance is analyzed and shown to be O(n 2 ) in the worst case.

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

computational geometry
design of algorithms