Genetically optimized fuzzy polynomial neural networks In this paper, we introduce a new topology of fuzzy polynomial neural networks (FPNNs) that is based on a genetically optimized multilayer perceptron with fuzzy polynomial neurons (FPNs). The study offers a comprehensive design methodology involving mechanisms of genetic optimization, especially those exploiting genetic algorithms (GAs). Let us recall that the design of the "conventional" FPNNs uses an extended group method of data handling (GMDH) and uses a fixed scheme of fuzzy inference (such as simplified, linear, and regression polynomial fuzzy inference) in each FPN of the network. It also considers a fixed number of input nodes (as being selected in advance by a network designer) at FPNs (or nodes) located in each layer. However such design process does not guarantee that the resulting FPNs will always result in an optimal networks architecture. Here, the development of the FPNN gives rise to a structurally optimized topology and comes with a substantial level of flexibility which becomes apparent when contrasted with the one we encounter in the conventional FPNNs. The design of each layer of the FPNN deals with its structural optimization involving a selection of preferred nodes (or FPNs) with specific local characteristics (such as the number of input variables, the order of the polynomial forming a consequent part of fuzzy rules and a collection of the specific subset of input variables) and addresses detailed aspects of parametric optimization. Along this line, two general optimization mechanisms are explored. The structural optimization is realized via GAs. In case of the parametric optimization we proceed with a standard least square method-based learning. Through the consecutive process of such structural and parametric optimization, an optimized and flexible fuzzy neural network becomes generated in a dynamic fashion. To evaluate the performance of the genetically optimized FPNN (gFPNN), we experimented with two time series data (gas furnace and chaotic time series) as well as some synthetic data. A comparative analysis reveals that the proposed FPNN exhibits higher accuracy and superb predictive capability in comparison to some previous models available in the literature.

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

genetically optimized fuzzy polynomial neural networks (gfpnn)


A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem The 2-interval pattern problem over its various models and restrictions was proposed by Vialette (2004) for the application of RNA secondary structure prediction. We present an O(n(3) log n)-time 2-approximation algorithm for the problem of finding a largest {<, }-structured subset of 2-intervals given an input 2-interval set of size n. This greatly improves the previous best approximation ratio of 6 by Crochemore et al. (2005).

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


High-pressure phase transition and thermoelastic properties of europium chalcogenides The pressure-induced crystal properties of Eu chalcogenides were investigated using two different models: a modified charge-transfer potential model consisting of Coulomb screening due to the delocalization of the f electron of the rare earth atom, and modified by covalency and zero-point energy effects along with attractive and repulsive interactions; and a charge-transfer model that excluded the covalency and zero-point energy effects in the previous model. Both models were used to visualize the effect of covalency on the mechanism of interaction of the constituent atoms. Eu chalcogenides transform from the to the phase under the influence of sufficient pressure (P (T) = 39.52, 21.01, 14.31, and 10.58 GPa), and their equations of state indicated decreases in volume during this phase transition of 6.38, 12.32, 12.76, and 11.15%, respectively, for EuO, EuS, EuSe, and EuTe. The results obtained from the models were in good agreement with corresponding experimental data. The elastic constants and Debye temperatures were also computed at normal and high pressures. Both of the models were found to be capable of successfully explaining these properties.

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

eu chalcogenides
phase transition
elastic constants

structural properties
equation of state
debye temperature


caching multidimensional queries using chunks Caching has been proposed (and implemented) by OLAP systems in order to reduce response times for multidimensional queries. Previous work on such caching has considered table level caching and query level caching. Table level caching is more suitable for static schemes. On the other hand, query level caching can be used in dynamic schemes, but is too coarse for large query results. Query level caching has the further drawback for small query results in that it is only effective when a new query is subsumed by a previously cached query. In this paper, we propose caching small regions of the multidimensional space called chunks . Chunk-based caching allows fine granularity caching, and allows queries to partially reuse the results of previous queries with which they overlap. To facilitate the computation of chunks required by a query but missing from the cache, we propose a new organization for relational tables, which we call a chunked file. Our experiments show that for workloads that exhibit query locality, chunked caching combined with the chunked file organization performs better than query level caching. An unexpected benefit of the chunked file organization is that, due to its multidimensional clustering properties, it can significantly improve the performance of queries that miss the cache entirely as compared to traditional file organizations.

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

organization cache reuse order systems space dynamic performance computation tables queries paper locality query

file organization
region
response time
experience
relation
caches
effect
scheme
cluster


Thin-walled member plastic bifurcation analysis using generalised beam theory This paper presents the formulation and illustrates the application of a non-linear Generalised Beam Theory (GBT), which makes it possible to calculate bifurcation load factors of thin-walled members made of non-linear elasticplastic materials and subjected to general loading conditions. This formulation is an extension of the non-linear GBT recently derived by the authors, which was valid for uniformly compressed members only. In order to illustrate the application of the proposed non-linear GBT, a beam finite element is formulated and some numerical results are presented and discussed. These results concern rectangular plates and thin-walled hat-section beams. The material instantaneous elastic moduli are determined on the basis of both the well known J2-flow and J2-deformation small strain plasticity theories.

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

generalized beam theory (gbt)
thin-walled members
non-linear elasticplastic members
plastic buckling
local-plate modes
distortional modes
global modes


Cite - A trainable image annotation system This paper explores techniques for building adaptive and trainable domain-specific image annotation systems. Learning and relaxation-based techniques are used to bind domain knowledge with data-driven sensing where both utilise hierarchical lattice-type data structures. (C) 1997 Elsevier Science B.V.

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


A Calculus Approach to Energy-Efficient Data Transmission With Quality-of-Service Constraints Transmission rate adaptation in wireless devices provides a unique opportunity to trade off data service rate with energy consumption. In this paper, we study optimal rate control to minimize transmission energy expenditure subject to strict deadline or other quality-of-service (QoS) constraints. Specifically, the system consists of a wireless transmitter with controllable transmission rate and with strict QoS constraints on data transmission. The goal is to obtain a rate-control policy that minimizes the total transmission energy expenditure while ensuring that the QoS constraints are met. Using a novel formulation based on cumulative curves methodology, we obtain the optimal transmission policy and show that it has a simple and appealing graphical visualization. Utilizing the optimal "offline" results, we then develop an online transmission policy for an arbitrary stream of packet arrivals and deadline constraints, and show, via simulations, that it is significantly more energy-efficient than a simple head-of-line drain policy. Finally, we generalize the optimal policy results to the case of time-varying power-rate functions.

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

delay
network calculus
quality of service (qos)


Low-power mixed-signal CVNS-based 64-bit adder for media signal processing In this paper, design of a mixed-signal 64-bit adder based on the continuous valued number system (CVNS) is presented. The 64-bit adder is generated by cascading four 16-bit radix-2 CVNS adders. Truncated summation of the CVNS digits reduced the number of required interconnections in the system, which in turn reduced design complexity and hardware costs. This adder can perform one 64-bit, two 32-bit, four 16-bit, or eight 8-bit additions on demand for media signal processing applications. The compact and low-power and low-noise design of the adder is suitable for this type of application. The 64-bit adder designed in TSMC CMOS 0.18-mu m technology, has a worst case delay of 1.5 ns, energy dissipation of about 14 pJ with the core area of 13 250 mu m(2).

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

analog digits
continuous valued number system (cvns)
mixed signal adder
reconfigurable adder
64-bit adder


Optimal sensor deployment in a large-scale complex drinking water network: Comparisons between a rule-based decision support system and optimization models Many models or algorithms have been suggested for sensor placement in the drinking water distribution networks, such as genetic algorithms, multiobjective optimization models, and heuristic methods. Because these models or algorithms have high computational demands, however, the requirement of expensive technical computing software is unavoidable. This study presents a rule-based decision support system (RBDSS) to analyze and generate a set of sensor placement locations and compares the performance against 10 optimization models based on four indexes. Our findings show that the RBDSS demands relatively lower computational time and still exhibits outstanding performance in terms of all our indexes when dealing with a large-scale complex drinking water network. (C) 2012 Elsevier Ltd. All rights reserved.

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

rule-based decision support system
water distribution system
graph theory
systems analysis


An Automatic and Robust Algorithm of Reestablishment of Digital Dental Occlusion In the field of craniomaxillofacial (CMF) surgery, surgical planning can be performed on composite 3-D models that are generated by merging a computerized tomography scan with digital dental models. Digital dental models can be generated by scanning the surfaces of plaster dental models or dental impressions with a high-resolution laser scanner. During the planning process, one of the essential steps is to reestablish the dental occlusion. Unfortunately, this task is time-consuming and often inaccurate. This paper presents a new approach to automatically and efficiently reestablish dental occlusion. It includes two steps. The first step is to initially position the models based on dental curves and a point matching technique. The second step is to reposition the models to the final desired occlusion based on iterative surface-based minimum distance mapping with collision constraints. With linearization of rotation matrix, the alignment is modeled by solving quadratic programming. The simulation was completed on 12 sets of digital dental models. Two sets of dental models were partially edentulous, and another two sets have first premolar extractions for orthodontic treatment. Two validation methods were applied to the articulated models. The results show that using our method, the dental models can be successfully articulated with a small degree of deviations from the occlusion achieved with the gold-standard method.

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

centric occlusion
craniomaxillofacial (cmf) surgeries
dental alignment
digital dental articulation


Markov random field processing for color demosaicing In digital color imaging, color filter arrays (CFAs) are obtained from single-chip cameras in the form of sampled spectral components (red, green and blue) in an interleaved fashion. Color demosaicing is the process of interpolating these CFAs into dense pixel maps for each spectral component. There are different interpolation techniques for color demosaicing operations. These approaches have their limitations regarding the improvement of the quality of the images. Particularly, they perform poorly in recovering the edges of the images. In this work we have applied Markov random field (MRF) processing over these roughly interpolated images obtained by the existing techniques to improve the quality of the reconstruction. We have observed that the processing improves the image quality in many cases. Particularly the edges of the reconstructed images are significantly enhanced using MRF processing. (C) 2001 Elsevier Science B.V All rights reserved.

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

color interpolation
color filter array (cfa)
markov random field (mrf)
gibbs distribution
simulated annealing
stochastic relaxation


A new method for removal of powerline interference in ECG and EEG recordings ? A method based on radial basis function and Wiener filter system is proposed for filtering powerline in biomedical recordings. The proposed solution addresses both ECG and EEG recordings. Several simulations have demonstrated the enhancement of the proposed method in comparison to other techniques. The results suggest that clinical information can be maintained. This method provides the best approach for obtaining both more signal reduction and low distortion of the signal results.

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

electromagnetic interference
biomedical signals
radial basic function


Bertrand equilibrium with differentiated products considering fixed costs: Korean price regulation in the mobile telephone industry In some industries such as telecommunications and electricity, the fixed costs are so high that competition is not sustainable without considering the fixed cost in pricing. The sustainability of competition is as important as enhancing competition when an industry is in the transitional period from being a monopoly owned or managed by the government to a competitive market structure driven by the market. A price competition model with asymmetric firms and product differentiation is considered in which firms compete with a normal profit constraint. The constraint is related to the sustainability of competition and can be realized through price regulation. With this constraint, firms gain only normal profit in equilibrium despite the asymmetry, and consumer surplus is maximized. The equilibrium is meaningful in defining the industry performance intended through the regulation. Moreover, the price regulation of the Korean mobile telephone market is considered to discuss any implications of this equilibrium.

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

fixed cost
differentiation
asymmetry
price regulation


Convergences and topology via sequences of multifunctions In this paper we define different types of convergences for sequences of multifunctions and establish relationships among them. Using the convergence in fuzzy measure we obtain a topological structure on a space of multifunctions.

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


Optimal and pessimal orderings of Steiner triple systems in disk arrays Steiner triple systems are well studied combinatorial designs that have been shown to possess properties desirable for the construction of multiple erasure codes in RAID architectures. The ordering of the columns in the parity check matrices of these codes affects system performance. Combinatorial problems involved in the generation of good and bad column orderings are defined, and examined for small numbers of accesses to consecutive data blocks in the disk array. (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 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 I O O O O O O O O

steiner triple system
erasure code
design configuration


A numerical method for pricing spread options on LIBOR rates with a PDE model In this paper we present a new numerical method for solving a Black-Scholes type of model for pricing a class of interest rate derivatives: spread options on LIBOR rates. The interest rates are assumed to follow the recently introduced LIBOR Market Model. The Feynman-Kac theorem provides a PDE model for the spread option pricing problem which is initially posed in an unbounded domain. After a localization procedure and the consideration of appropriate boundary conditions in a bounded domain, we propose a Crank-Nicholson characteristic time discretization scheme combined with a Lagrange piecewise quadratic finite element for the spatial discretization. In order to illustrate the performance of the PDE model and the numerical methods, we present a real example of spread option pricing. (C) 2010 Elsevier Ltd. All rights reserved.

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

black-scholes pde
crank-nicholson-characteristics
finite elements
monte carlo simulation


Generalized coverage: New developments in covering location models The goal of the paper is to provide an overview of the following classes of models: Gradual cover models: These models seek to relax the all or nothing assumption by replacing it with a general coverage function which represents the proportion of demand covered at a certain distance from the facility. The cooperative cover model: This recently developed generalization is designed to replace the individual coverage assumption with a mechanism where all facilities contribute to the coverage of each demand point. This is accomplished by viewing coverage as the transmission of a signal by the facilities. The signal transmitted by each facility dissipates with distance. However, the signal received by each demand point is the aggregation of the transmissions from all the facilities. If the signal strength at the demand point exceeds a certain threshold, the point is covered, otherwise it is not. Variable radius model: This model is primarily designed to relax the fixed coverage radius assumption, making the coverage radius an endogenously determined function of the facility cost. Thus, instead of having to locate a certain pre-determined number of facilities, the decision-maker has a certain budget that can be used to construct facilities of different types, with the more expensive facilities having larger coverage radius.

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

location
gradual cover
cooperative cover
variable radius


An outcome-oriented approach to multicriteria decision analysis with intuitionistic fuzzy optimistic/pessimistic operators The concept of Atanassovs intuitionistic fuzzy sets is a generalization of ordinary fuzzy sets. Under the intuitionistic fuzzy decision environment, this paper develops optimistic and pessimistic point operators to draw the influences of optimism and pessimism on multiple criteria decision analysis. We propose the optimistic and pessimistic score functions based on point operators to measure evaluations of the alternative with respect to each criterion. The suitability function can then be established to determine the degree to which the alternative satisfies the decision makers requirement. An optimization model with suitability functions is propounded on account of ill-known membership grades to generate optimal weights for criteria. Finally, an outcome-oriented approach is adopted to validate the proposed methods. Several multiattribute evaluation cases in consumer decision making reality are addressed to examine the feasibility and applicability of the current method. From the empirical results of effectiveness examination, the proposed intuitionistic fuzzy multicriteria decision making method with optimistic/pessimistic score functions performed significantly better than the method without consideration of optimism/pessimism. Therefore, we can conclude that the proposed methods by using intuitionistic fuzzy optimistic/pessimistic point operators have desirable potentials in practice.

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

optimism
pessimism
multiple criteria decision analysis
optimization model

intuitionistic fuzzy set
point operator
score function


High-Speed Architectures for Multiplication Using Reordered Normal Basis Normal basis has been widely used for the representation of binary field elements mainly due to its low-cost squaring operation. Optimal normal basis type II is a special class of normal basis exhibiting very low multiplication complexity and is considered as a safe choice for hardware implementation of cryptographic applications. In this paper, high-speed architectures for binary field multiplication using reordered normal basis are proposed, where reordered normal basis is referred to as a certain permutation of optimal normal basis type II. Complexity comparison shows that the proposed architectures are faster compared to previously presented architectures in the open literature using either an optimal normal basis type II or a reordered normal basis. One advantage of the new word-level architectures is that the critical path delay is a constant (not a function of word size). This enables the multipliers to operate at very high clock rates regardless of the field size or the number of words. Hardware implementation of some practical size multipliers for elliptic curve cryptography is also included.

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

binary field
optimal normal basis type ii
reordered normal basis
hardware

finite field
multiplication algorithm
multiplier


Extracting order from chaos Purpose - The purpose of this paper is to advance research that portrays chaos in number theory. Classical and quantum physics, and lately pure mathematics and system that exhibit deductive inference produced randomness and unpredictability over time. Design/methodology/approach - This paper discusses the fact that in raising numbers to higher powers, it is noticed that the scale of intensities of order and tidiness is very poor and chaos occurs mainly when numbers are raised to even powers. When numbers are raised to odd powers, the chaos is obtained still, but was able to extract order from this chaos strangely enough. Findings - Linear relationships if left to themselves long enough will eventually produce disorderly chaotic and inconsistent results. Chaos are being found where the order was thought to be found. But then, looking more closely, unexplained order is being found in what looked like chaos. Practical implications - The results of this research may be applied to develop algorithms for random number generation and also for developing encryption algorithms for routers security and privacy. Originality/value - The paper tackles one of the most unexplained phenomena where scientists are findings chaos where they thought they would find order.

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


SoftAir: A software defined networking architecture for 5G wireless systems One of the main building blocks and major challenges for 5G cellular systems is the design of flexible network architectures which can be realized by the software defined networking paradigm. Existing commercial cellular systems rely on closed and inflexible hardware-based architectures both at the radio frontend and in the core network. These problems significantly delay the adoption and deployment of new standards, impose significant challenges in implementing and innovation of new techniques to maximize the network capacity and accordingly the coverage, and prevent provisioning of truly- differentiated services which are able to adapt to growing and uneven and highly variable traffic patterns. In this paper, a new software-defined architecture, called SoftAir, for next generation (5G) wireless systems, is introduced. Specifically, the novel ideas of network function cloudification and network virtualization are exploited to provide a scalable, flexible and resilient network architecture. Moreover, the essential enabling technologies to support and manage the proposed architecture are discussed in details, including fine-grained base station decomposition, seamless incorporation of Openflow, mobility- aware control traffic balancing, resource-efficient network virtualization, and distributed and collaborative traffic classification. Furthermore, the major benefits of SoftAir architecture with its enabling technologies are showcased by introducing software- defined traffic engineering solutions. The challenging issues for realizing SoftAir are also discussed in details.

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

network function cloudification
network virtualization

software-defined networking
5g wireless system
wireless software-defined networks
software-defined traffic engineering


FMM-Yukawa: An adaptive fast multipole method for screened Coulomb interactions A Fortran program package is introduced for the rapid evaluation of the screened Coulomb interactions of N particles in three dimensions. The method utilizes an adaptive oct-tree structure, and is based on the new version of fast multipole method in which the exponential expansions are used to diagonalize the multipole-to-local translations. The program and its full description, as well as several closely related packages are also available at http://www.fastmultipole.org/. This paper is a brief review of the program and its performance.

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

screened coulomb potential
yukawa potential
diagonal translation
exponential sums


Optimal antithetic weights for lognormal time series forecasting The theory for estimating optimal weights for combining antithetic fitted values which contain antithetic (negatively correlated) errors, produced from lognormal historical time series, is presented. The functions which determine the optimal weights used to combine the lognormal and linear projection of the antithetic fitted values, are derived. The method reduces mean square fitted error, when tested on simulated lognormal and non-lognormal autoregressive series of varying order. Antithetic forecasting yields reductions in forecast mse (which otherwise increases with forecast horizon), up to about 50% in large-scale empirical validation tests applied to 111 time series. (C) 1998 Elsevier Science 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

time-series forecasting
antithetic combining
stochastic processes
power transformation
optimization


multiple class memory constrained queueing networks Most computer systems have a memory constraint: a limit on the number of requests that can actively compete for processing resources, imposed by finite memory resources. This characteristic violates the conditions required for queueing network performance models to be separable, i.e., amenable to efficient analysis by standard algorithms. Useful algorithms for analyzing models of memory constrained systems have been devised only for models with a single customer class. In this paper we consider the multiple class case. We introduce and evaluate an algorithm for analyzing multiple class queueing networks in which the classes have independent memory constraints. We extend this algorithm to situations in which several classes share a memory constraint. We sketch a generalization to situations in which a subsystem within an overall system model has a population constraint. Our algorithm is compatible with the extremely time- and space-efficient iterative approximate solution techniques for separable queueing networks. This level of efficiency is mandatory for modelling large systems.

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

computer system performance evaluation
approximate solution technique
queueing network model


Finite-element analysis of frictionless contact problem for a laminated medium A finite-element method is developed to study interlaminar stress effects for the multilayered isotropic medium subjected to in-plane loads. Unilateral boundary value problem formulation is presented. Variational finite difference equations obtained from the finite-element discretization are derived for boundary as well as transmission conditions. This permits to analyze interlaminar normal and tangential stress distributions. An influence of geometrical and physical parameters of the multilaered media lo the interlaminar stresses is discussed. (C) 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.

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

laminated medium
interlaminar stress
transmission conditions


Modal parameter estimation by combining stochastic and deterministic frequency-domain approaches The poly-reference Least squares Complex Frequency-domain (pLSCF) estimatorcommercially known as the LMS PolyMAX estimatoris used intensively in modal analysis applications nowadays. pLSCF is non-iterative (deterministic) and relatively accurate modal parameter estimation algorithm. This algorithm has several advantages: it is polyreference, fast, numerically stable for large-bandwidth with high-model order analysis, and yields very clear stabilization diagrams even with highly noisy FRFs measurements. One drawback of the pLSCF-estimator is that it yields a poor damping estimates especially for highly damped and weakly excited modes when the FRFs are very noisy. In this contribution, an approach will be proposed to improve the accuracy of pLSCF estimator and in particular, the damping estimates in case of high noise level. The new proposed approach is a combined stochastic-deterministic frequency-domain algorithm. In this approach, a 2-step procedure is introduced to improve the damping estimates while maintaining the very clear stabilization diagrams. In the first step, a parametric Maximum Likelihood smoothing approach, which is the stochastic part, is used to remove the noise from the data and in the second step, the pLSCF estimator, which is the deterministic part, is applied to the smoothed data resulting in improved (damping) estimates. The presented algorithm is able to maintain the benefits of pLSCF and at the same time leads to an improvement of the damping estimates in highly damped and very noisy cases. In addition, the new procedure properly deals with uncertainty on the measurements where the data variance due to measurement noise is taken into account. The procedure is illustrated and tested by using simulated as well as experimental data. The presented procedure to process a highly damped noisy vibration data leads to very accurate estimates in comparison to the traditional pLSCF estimator.

B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-domain
stochastic approach
deterministic approach


CMOS zero-temperature-coefficient point voltage reference with variable-output-voltage level A CMOS voltage reference circuit based on a voltage at the zero-temperature-coefficient point of drain current is proposed. The output voltage of the proposed circuit is variable by a substrate bias. The proposed circuit is simulated with a standard 0.8-mum CMOS technology. The output voltage keeps 800 mV, and its fractional temperature coefficient is 9.94ppm/degreesC over the temperature range from -100degreesC to 150degreesC at a zero-bias. The PSRR of the output voltage is -42.55 dB at 100 Hz. The minimum power-supply voltage is 2.1 V. The output voltage can be shifted down to 670 mV while maintaining its temperature-insensitivity.

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

zero-temperature-coefficient point
variable-reference-voltage level


An effective GML documents compressor As GML is becoming the de facto standard for geographic data storage, transmission and exchange, more and more geographic data exists in GML format. In applications, GML documents are usually very large in size because they contain a large number of verbose markup tags and a large amount of spatial coordinate data. In order to speedup data transmission and reduce network cost, it is essential to develop effective and efficient GML compression tools. Although GML is a special case of XML, current XML compressors are not effective if directly applied to GML, because these compressors have been designed for general XML data. In this paper, we propose GPress, a compressor for effectively compressing GML documents. To the best of our knowledge, GPress is the first compressor specifically for GML documents compression. GPress exploits the unique characteristics of GML documents to achieve good performance. Extensive experiments over real-world GML documents show that GPress evidently outperforms XMill (one of the best existing XML compressors) in compression ratio, while its compression efficiency is comparable to the existing XML compressors.

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

web-based gis
geospatial data
algorithm
performance evaluation


A seven-parameter spectral/hp finite element formulation for isotropic, laminated composite and functionally graded shell structures In this paper we apply high-polynomial order spectral/hp basis functions in the numerical implementation of a novel 7-parameter continuum shell finite element formulation using general quadrilateral finite elements. The implementation is applicable to the analysis of isotropic, functionally graded and laminated composite shells undergoing fully geometrically nonlinear mechanical response. The shell finite element formulation is constructed in a purely displacement-based setting such that no mixed variational procedures are employed and full numerical integration of all quantities appearing in the virtual work statement is performed using high-order GaussLegendre quadrature rules. An efficient procedure for numerically integrating the discrete weak formulation through the shell thickness is implemented; hence no thin- or shallow-shell type restrictions are imposed on the element. For the case of laminated composites, we introduce a discrete tangent vector field, defined on the approximate shell mid-surface, that permits the use of skewed and/or arbitrarily curved elements in the numerical simulation of complex shell structures. To reduce computer memory requirements in the numerical implementation we adopt element-level static condensation, wherein, the interior degrees of freedom of each element are implicitly eliminated prior to assembly of the global sparse finite element coefficient matrix; an approach that results in storage requirements that are on par with traditional low-order finite element implementations. The accuracy and overall robustness of the developed shell element are illustrated through the solution of several nontrivial benchmark problems taken from the literature. These numerical studies provide evidence that the proposed shell element may be used to obtain accurate locking-free results and that large load increments can be employed (in the numerical simulation of shell structures undergoing very large deformations).

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

shell finite element model
seven-parameter shell formulation
functionally graded material
spectral/hp approximations
composite structures
nonlinear analysis


A multi-agent approach for provisioning of e-services in u-commerce environments Purpose - Taking into account the importance of e-commerce and the current applications of AT techniques in this area, this research aims to adequate the design of a multi-agent system for the provisioning of e-services in u-commerce environments. This proposal is centred on the methods of evaluation in a u-e-commerce environment. Design/methodology/approach - The multi-agent systems (MAS) approach is based on an MAS model developed for AmI that has been redesigned to support u-commerce. The use of a recommendation system, previously developed by the research group, is suggested for this MAS. The methodological proposal centres on the evaluation of this type of system., Findings - The evaluation of this type of system is the principal problem of current research. Therefore, this is the main contribution of the paper. Research limitations/implications - The different evaluation methods that are proposed, whether qualitative or quantitative, offer the possibility of measuring the added value that the context can give to the use of e-services in different domains of application. Qualitative evaluation should consider the customer as a central piece in the system. In addition, quantitative methods should objectively evaluate the contribution of context to the application. Practical implications - At present, there is no single method for evaluating the benefits of different u-commerce systems, so a new method needs to be found based on these techniques. Originality/value - The research proposes an MAS designed for u-commerce domains, analyzes the capacity of trust management techniques in this environment, and proposes several evaluation methods to show the benefits of context information in the use of e-services. Several real developments are described to show the different applications of MAS in u-commerce and how evaluation is carried out.

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


towards an ultra-low-power architecture using single-electron tunneling transistors Minimizing power consumption is vitally important in embedded system design; power consumption determines battery lifespan. Ultra-low-power designs may even permit embedded systems to operate without batteries, e.g., by scavenging energy from the environment. Moreover, managing power dissipation is now a key factor in integrated circuit packaging and cooling. As a result, embedded system price, size, weight, and reliability are all strongly dependent on power dissipation. Recent developments in nanoscale devices open new alternatives for low-power embedded system design. Among these, single-electron tunneling transistors (SETs) hold the promise of achieving the lowest power consumption. However, SETs impose unique design constraints that strongly influence architectural and circuit-level decisions. Unfortunately, most analysis of SETs has focused on single devices instead of architectures, making it difficult to determine whether they are appropriate for low-power embedded systems. This article presents possible uses of SETs in high-performance and battery-powered embedded system design. The resulting fault-tolerant, hybrid SET/CMOS, reconfigurable architecture can be tailored to specific requirements and allows trade-offs among power consumption, performance, operation temperature, fabrication cost, and reliability. This work is a first step in evaluating the system-level potential of reducing power consumption by using 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 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


Numerical simulation of the installation process of full displacement piles Numerical simulations of the installation process of full displacement piles are presented. A Coupled EulerianLagrangian approach is used to simulate the installation process. The influence of different ratios between the rotational and the penetration velocity are analyzed. A hypoplastic constitutive model is used to match the soils behavior realistically. The reaction forces of the drilling tool are determined. Furthermore, the influence of the surrounding soil is investigated. The displacements nearby the drilling tool are analyzed as well as changes of the stress state and the bulk density. The numerical results are used to explain the effects in the soil, that were observed during in situ measurements.

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

full displacement pile
pile installation
cel
coupled eulerianlagrangian-method
hypoplasticity


A viscosity method with no spectral radius requirements for the split common fixed point problem A new algorithm is proposed for solving the split common fixed point problem. A strong convergence theorem is established for quasi-nonexpansive mappings. Our result does not require the knowledge of some spectral radius. An application is given relatively to the split feasibility problem. Numerical experiments are performed relative to an inverse heat problem.

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

split inverse problem
fixed point method
projected subgradient method
variational inequality
volterra integral equation


Active sound quality control of engine induced cavity noise Active control solutions appear to be a feasible approach to cope with the steadily increasing requirements for noise reduction in the transportation industry. Active controllers tend to be designed with a target on the sound pressure level reduction. However, the perceived control efficiency for the occupants can be more accurately assessed if psychoacoustic metrics can be taken into account. Therefore, this paper aims to evaluate, numerically and experimentally, the effect of a feedback controller on the sound quality of a vehicle mockup excited with engine noise. The proposed simulation scheme is described and experimentally validated. The engine excitation is provided by a sound quality equivalent engine simulator, running on a real-time platform that delivers harmonic excitation in function of the driving condition. The controller performance is evaluated in terms of specific loudness and roughness. It is shown that the use of a quite simple control strategy, such as a velocity feedback, can result in satisfactory loudness reduction with slightly spread roughness, improving the overall perception of the engine sound.

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

sound quality
active control
engine noise


A response to Webb and Ting's On the application of ROC analysis to predict classification performance under varying class distributions In an article in this issue, Webb and Ting criticize ROC analysis for its inability to handle certain changes in class distributions. They imply that the ability of ROC graphs to depict performance in the face of changing class distributions has been overstated. In this editorial response, we describe two general types of domains and argue that Webb and Ting's concerns apply primarily to only one of them. Furthermore, we show that there are interesting real-world domains of the second type, in which ROC analysis may be expected to hold in the face of changing class distributions.

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


creating the perfect video stream Users continue to have ubiquitous access to internet powered video content - giving them many choices for the media they choose to watch. However, even with the availability of millions of hours of internet video, consumers spend a significant amount of time on traditional TV - that too, despite lack of personalization and fixed set of mainstream content. Perhaps the reason for success of linear TV is its simplicity - you just turn it on if you want to spend an hour watching something with your friends or family and content just streams to you. In contrast, on the internet, we have a vast amount of diverse & unique video content, successful social networks for sharing this content, and fundamental technologies that personalize your experiences. Furthermore, with continued emergence of internet-connected TVs and devices that make IP delivered video easily accessible in your living room, the emerging problem is one of generating the perfect, personalized video stream - "Your Channel" in contrast to "A channel". How do we organize and build such a video stream that is relevant and interesting? In this talk, we will discuss experiments and solutions to creating this perfect video stream - how do we balance consistency with interestingness? How do we mesh social influence versus meta-data relevance? How we can leverage and learn from human curation? The talk concludes with a summary of challenges and opportunities for researchers working in the related areas of multimedia, search and social networks.

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

personalization
video stream
video
linear tv


Trees with maximum p p -reinforcement number ? Let G=(V,E) G = ( V , E ) be a graph and p p a positive integer. The p p -domination number ?p(G) ? p ( G ) is the minimum cardinality of a set D?V D ? V with |NG(x)?D|?p | N G ( x ) ? D | ? p for all x?V?D x ? V ? D . The p p -reinforcement number rp(G) r p ( G ) is the smallest number of edges whose addition to G G results in a graph G? G ? with ?p(G?)<?p(G) ? p ( G ? ) < ? p ( G ) . It is showed by Lu etal. (2013) that rp(T)?p+1 r p ( T ) ? p + 1 for any tree T T and p?2 p ? 2 . This paper characterizes all trees attaining this upper bound when p?3 p ? 3 .

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

p p -domination p p p p p
p p -reinforcement number p p p p p


Quantifying the determinants of outbreak detection performance through simulation and machine learning We developed a model for quantifying determinants of outbreak detection performance. We used Bayesian networks to model relations between outbreak and algorithm characteristics and detection performance. We used the model to predict detection performance for different outbreak scenarios. The model can provide a quantitative evaluation of new methods and data in biosurveillance systems.

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

disease outbreak detection
surveillance
predicting performance
public health informatics
outbreak simulation


A classification and regression technique to handle heterogeneous and imperfect information Imperfect information inevitably appears in real situations for a variety of reasons. Although efforts have been made to incorporate imperfect data into learning and inference methods, there are many limitations as to the type of data, uncertainty and imprecision that can be handled. In this paper, we propose a classification and regression technique to handle imperfect information. We incorporate the handling of imperfect information into both the learning phase, by building the model that represents the situation under examination, and the inference phase, by using such a model. The model obtained is global and is described by a Gaussian mixture. To show the efficiency of the proposed technique, we perform a comparative study with a broad baseline of techniques available in literature tested with several data 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 O

inductive learning
inductive inference
handling imperfect observations
gaussian mixture models
evidence theory
dempstershafer theory


Uncovering excellence in academic rankings: a closer look at the Shanghai ranking In this paper, we examine whether the quality of academic research can be accurately captured by a single aggregated measure such as a ranking. With Shanghai Universitys Academic Ranking of World Universities as the basis for our study, we use robust principal component analysis to uncover the underlying factors measured by this ranking. Based on a sample containing the top 150 ranked universities, we find evidence that, for the majority of these institutions, the Shanghai rankings reflect not one but in fact two different and uncorrelated aspects of academic research: overall research output and top-notch researchers. Consequently, the relative weight placed upon these two factors determines to a large extent the final ranking.

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


Dynamic Load Balancing and Pricing in Grid Computing with Communication Delay Due to the emergence of Grid computing over the Internet, there is presently a need for dynamic load balancing algorithms which take into account the characteristics of Grid computing environments. In this paper, we consider a Grid architecture where computers belong to dispersed administrative domains or groups which are connected with heterogeneous communication bandwidths. We address the problem of determining which group an arriving job should be allocated to and how its load can be distributed among computers in the group to optimize the performance. We propose algorithms which guarantee finding a load distribution over computers in a group that leads to the minimum response time or computational cost. We then study the effect of pricing on load distribution by considering a simple pricing function. We develop three fully distributed algorithms to decide which group the load should be allocated to, taking into account the communication cost among groups. These algorithms use different information exchange methods and a resource estimation technique to improve the accuracy of load balancing. We conducted extensive simulations to evaluate the performance of the proposed algorithms and strategies.

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

grid computing
load balancing
pricing
response time
communication delay


A FORTRAN program to produce minimum relative entropy distributions Relative entropy minimization is a general approach of inferring a probability density function (pdf) from constraints which do not uniquely determine that density. In this paper, a general purpose computer program written in FORTRAN is provided that produces a univariate pdf from a series of constraints and a prior probability. Some guidelines for the selection of the prior are presented. The FORTRAN code is based on an algorithm that utilize, a Newton-Raphson approach. In addition, we use Gauss-Legendre quadrature for the determination of the integrals, Gauss elimination for matrix solution and a line search for the most optimal Newton step. We present examples of relative entropy minimization involving functions that are geometric moments of a variable x. With a uniform prior p(x), classic solutions of statistics are obtained. We also varied the nature of the prior for illustrative purposes. For the case where the constraints resemble powers of x and logarithmic transformations, minimum relative entropy produces the Gamma distribution. (C) 2003 Elsevier Ltd. All rights reserved.

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


A domain-independent statistical methodology for dialog management in spoken dialog systems ? Dialog systems (DS) allow intuitive interaction through natural language. Dialog managers are usually implemented ad hoc and difficult to adapt to new domains. A statistical methodology is proposed to reduce the effort required to develop and adapt dialog managers. User simulation is also proposed to facilitate the acquisition of the required dialog corpus. A complete implementation of our proposal for different dialog systems and its evaluation are also detailed.

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

statistical methodologies
user modeling
dialog simulation
systems evaluation


Learning semantically-annotated routes for context-aware recommendations on map navigation systems Modern technology has brought many changes to our everyday lives. Our need to be in constant touch with others has been met with the cellphone, which has become our companion and the convergence point of many technological advances. The combination of capabilities such as browsing the Internet and GPS reception has multiplied the services and applications based on the current location of the user. However, providing the user with these services has certain drawbacks. Although map navigation systems are the most meaningful way of displaying this information, the user still has to manually set up the filter in order to obtain a non-bloated visualization of the map and the available services. To tackle this problem, we present here a semantic multicriteria ant colony algorithm capable of learning the user's routes, including associated context information, and then predicting the most likely route a user is following, given his current location and context data. This knowledge could then be used as the basis for offering services related to his current (or most likely future) context data close to the path he is following. Our experimental results show that our algorithm is capable of obtaining consistent solutions sets even when multiple objective ontological terms are included in the process.

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

semantic search
context-awareness
ant colony optimization
ontologies


A Recursive Construction of the Set of Binary Entropy Vectors and Related Algorithmic Inner Bounds for the Entropy Region A method for checking membership in the region of entropic vectors generated from bits is presented. A general technique for utilizing this method to create inner bounds for regions of entropic vectors as a function of outer bounds is then presented. These two algorithms are then used to provide new insights regarding relationships among well known bounds for the region of entropic vectors.

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

binary entropic vectors
information inequalities
network coding capacity region


Does stock repurchase declaration affect stock price? Differences between. the electrics industry and other industries This study is to discuss the impact of stock repurchase declaration and purpose of repurchase on the stock price in the backdrop of listed companies on Taiwan's stock market. Event Study Method is employed to discuss stock price fluctuations while GARCH (Generalized Autoregressive Conditional Heteroscedasticity) is applied to estimate the Market Model regressive coefficients. The samples consisted of companies declaring first stock repurchase are selected from August 9, 2000 to December 31, 2005 with a precondition that all the companies shall be listed ones 150 days prior to declaration. The study results reveal that companies from other industries have considerably bigger average CAR than companies of the electrics industry before and after the declaration of stock repurchase. Companies with application purpose of "maintain stockholders' equities and corporate credit" have considerably bigger average CAR than companies with application purpose of "transferring stocks to employees". In industries other than electrics, companies with application purpose of "maintain stockholders' equities and corporate credit" have bigger accumulated abnormal return response than companies with application purpose of "transferring stocks to employees". In case of "maintain stockholders' equities and corporate credit" as the application purpose of stock repurchase. companies from industries other than electrics have relatively higher average CAR response. The empirical study results can serve as a reference for the listed company management and to related academic studies. Crown Copyright (C) 2009 Published by Elsevier Ltd. All rights reserved.

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

stock repurchase
event study method
market model
average car


A class of linear codes with good parameters A construction of linear codes with good parameters is given. Based on Brouwer's table [1], more than 100 new codes are obtained from our construction.

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


Specification and analysis of n-way key recovery system by Extended Cryptographic Timed Petri Net When a receiver of a ciphertext message cannot decrypt the message due to the fact that he has lost his private-key, the private-key of the receiver and session-key of the message need to be recovered. In this paper, we design a new n-way Key Recovery System (n-KRS) that is characterized by key encapsulation approach, n-way key recovery, secret designation of key recovery agents, fork and join of session-key with random keys, recovery request by a new key pair, certificate attaching scheme, component-based software engineering, and conformance to international standards. n-KRS is specified and analyzed by Extended Cryptographic Timed Petri Net (ECTPN) model that is a new formal and graphical specification model for cryptographic protocols. Recoverability, performance characteristics of n-KRS are evaluated by means of reachability graph of ECTPN. A prototype of n-KRS is developed and evaluated by means of CC 2.0 based information security system evaluation scheme.

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

key recovery system
key encapsulation
security


Hallucinogen persisting perception disorder in neuronal networks with adaptation We study the spatiotemporal dynamics of neuronal networks with spike frequency adaptation. In particular, we compare the effects of adaptation being either a linear or nonlinear function of neural activity. We find that altering parameters controlling the strength of synaptic connections in the network can lead to spatially structured activity suggestive of symptoms of hallucinogen persisting perception disorder (HPPD). First, we study how both networks track spatially homogeneous flickering stimuli, and find input is encoded as continuous at lower flicker frequencies when the networks synapses exhibit more net excitation. Mainly, we study instabilities of stimulus-driven traveling pulse solutions, representative of visual trailing phenomena common to HPPD patients. Visual trails are reported as discrete afterimages in the wake of a moving input. Thus, we analyze several solutions arising in response to moving inputs in both networks: an ON state, stimulus-locked pulses, and traveling breathers. We find traveling breathers can arise in both networks when an input moves beyond a critical speed. These possible neural substrates of visual trails occur at slower speeds when the modulation of synaptic connectivity is increased.

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

neuronal networks
spike frequency adaptation
breathers


The Making of KECCAK The sponge function KECCAK is the versatile successor of SHA-1 and the SHA-2 series of hash functions. Its structure and components are quite different from its predecessors, and at first sight it seems like a complete break with the past. In this article, researchers show that KECCAK is the endpoint of a long learning process involving many intermediate designs, mostly gradual changes, but also some drastic changes of direction. Researchers take off from their attempts at fixing PANAMA [26], resulting in RADIOGATuN [4], and their insights on trail backtracking applied to generalizations of PANAMA and RADIOGATuN, known as alternating-input and belt-and-mill structures. They explain how they originally proposed the sponge construction to compactly express security claims for their designs and how they finally decided to use it in an actual design which would become KECCAK. Then, they explain the design choices made in KECCAK and how some of its building blocks can be traced back to its predecessor, RADIOGATuN, and even earlier.

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


Standard input data for FEM-MBS coupling: importing alternative model reduction methods into SIMPACK Various research areas in the field of vehicle modelling, structural mechanics, engine dynamics, microelectromechanical systems (MEMS), etc. require the utilization of both multibody system formalism (MBS) and finite element method (FEM) in order to sufficiently capture the model's dynamics. The FEM-MBS coupling is accomplished by reducing the dimension of the FE-modelled part and then importing it into an MBS-code for further simulation. When using commercial FEM (Nastran, ANSYS, etc.) as well as MBS (SIMPACK) software packages the necessary standard input data (SID) file is needed for the coupling procedure (FEMBS interface). A problem arises by the restriction that both commercial FEM and MBS codes support only two condensation methods (Guyan reduction and component mode synthesis (CMS)), thus disabling the direct application of any other reduction approach (e. g. from the field of control theory) that actually could be better. In this article, the theoretical background of an implemented FEM-MBS interface (MORPACK) is presented allowing the application of any kind of reduction method for FE-modelled structures and furthermore their import (Ritz approximation) into SIMPACK via the SID file generation. A benchmark problem (UIC60-rail) is used in order to capture in SIMPACK the discrepancy between the standardized CMS and the Krylov subspace method (KSM), as one of the alternatives offered by the interface.

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

ritz approximation
sid
cms
krylov subspace method
simpack

fem-mbs
model order reduction
morpack interface


Enabling through life product-instance management: Solutions and challenges Developments in the area of radio frequency identification (RFID) and sensor network technologies have created new possibilities for product lifecycle management (PLM). These technologies are enabling building blocks upon which various business applications for product management can be built. A significant aspect in the through-life management of products is the gathering and management of data related to the product during the various phases of its lifecycle. Both RFID and wireless sensor technologies have created novel levels of product status visibility and automatic identification with granularity to the level of individual components. We consider three approaches that leverage automatic identification technologies and miniaturised wireless sensors to support PLM strategies at the product instance level based on a product centric computing paradigm. The paper draws upon a number of case studies focusing on the various phases of a products lifecycle: Beginning of Life, Middle of Life and End of Life. We used the case studies to extract technical, capability and information requirements needed to support PLM strategies. We compared the ability and suitability of existing architectural approaches to meet the key requirements we identified. Furthermore we assessed them to evaluate their level of support for managing product instances at different lifecycle phases. Finally, we present an extension to significantly improve the ability of the most promising architecture for supporting PLM strategies.

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

global information systems
object-centric information management
object centric paradigm


Building educational activities for understanding: An elaboration on the embodied-design framework and its epistemic grounds ? Design researchers should inform the commercial production of educational technology by explicating their tacit design practice in workable structures and language. Two activity genres for grounding mathematical concepts are explained: perception-based design builds on learners early mental capacity to draw logical inferences from perceptual judgment of intensive quantities in source phenomena, such as displays of color densities; action-based design builds on learners perceptuomotor capacity to develop new kinesthetic routines for strategic embodied interaction, such as moving the hands at different speeds to keep a screen green. In a primary problem, learners apply or develop non-symbolic perceptuomotor schemas to engage the task effectively; In a secondary problem, learners devise means of appropriating newly interpolated mathematical forms as enactive, semiotic, or epistemic means of enhancing, explaining, and evaluating their primary response. In so doing, learners heuristically determine either inferential parity (perception-based design) or functional parity (action-based design) as epistemic grounds for reconciling nave and scientific perspectives. Ultimately embodied-learning activities may interleave and synthesize the genres elements. This taxonomy opens design practice into richer dialog with the learning sciences. An appendix lays out the embodied-design framework in a how to form amenable for replication both within the domain of mathematics and beyond.

O 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

design-based research
design framework
embodied cognition
mathematics education


Online matching on a line Given a set S C R of points on the line, we consider the task of matching a sequence (r1, r2, ...) Of requests in R to points in S. It has been conjectured [Online Algorithms: The State of the Art, Lecture Notes in Computer Science, Vol. 1442, Springer, Berlin, 1998, pp. 268-280] that there exists a 9-competitive online algorithm for this problem, similar to the so-called "cow path" problem [Inform. and Comput. 106 (1993) 234-252]. We disprove this conjecture and show that no online algorithm can achieve a competitive ratio strictly less than 9.001. Our argument is based on a new proof for the optimality of the competitive ratio 9 for the "cow path" problem. (c) 2004 Elsevier B.V. All rights reserved.

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


type design patterns for computer mathematics Proof assistants such as the Coq system have traditionally been a laboratory for exotic type features such as dependent and computable types, and first-class type classes. Although these features have been introduced independently, it turns out they can be com-bined in novel and nontrivial ways to solve some of the more challenging problems posed by the formalization of advanced mathematics. Many of these patterns could also be useful for general programming.

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

reflection
theorem proving
user notation
type inference


Nonindependent randomized rounding and an application to digital halftoning We investigate the problem of rounding a given [0,1]-valued matrix to a 0, 1 matrix such that the rounding error with respect to 2 x 2 boxes is small. Such roundings yield good solutions for the digital halftoning problem, as shown by Asano et al. [Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 2002, SIAM, Philadelphia, 2002, pp. 896 904]. We present a randomized algorithm computing roundings with expected error at most 0.5463 per box, improving the 0.75 nonconstructive bound of Asano et al. Our algorithm is the first to solve this problem fast enough for practical application, namely, in linear time. Of broader interest might be our rounding scheme, which is a modi. cation of randomized rounding. Instead of independently rounding the variables, we impose a number of suitable dependencies. Thus, by equipping the rounding process with some of the problem information, we reduce the rounding error significantly compared to independent randomized rounding, which leads to an expected error of 0.82944 per box. Finally, we give a characterization of realizable dependencies.

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


Knowledge-based interaction protocols for intelligent interactive environments Intelligent interactive environments are systems whose main features are related to intelligence, interactivity and location. Intelligent interactive environments are implemented in a variety of platforms, such as distributed sensors, actuators and processors for ambient intelligence; distributed and mobile reasoning entities in virtual worlds and augmented reality; and distributed, multiuser information systems such as social networks and service-oriented systems directed to the dissemination of public services and retailing. In the present article, we introduce JamSession, a tool to specify and execute workflow choreographies, as well as to monitor and control heterogeneous resources, which can be specially useful for the specification and implementation of the coordination of real-time, multimodal and multimedia activities. JamSession is used to specify and execute knowledge-based interaction protocols, which are formally grounded and can be formally analysed and verified using a straightforward and user-friendly graphical language. A knowledge-based interaction protocol determines how disparate resources can work cooperatively to build complex behaviour in intelligent interactive environments.

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

intelligent interactive systems
distributed problem solving
knowledge coordination


QSPRs for the prediction of photodegradation half-life of PCBs in n-hexane By partial least squares (PLS) regression analysis, a quantitative structure-property relationship (QSPR) model was developed for photodegradation half-life (t(1/2)) of polychlorinated biphenyls (PCBs) in n-hexane solution under UV irradiation. Quantum chemical descriptors computed by PM3 Hamiltonian were used as predictor variables. The cross-validated Q(cum)(2) value for the optimal QSPR model was 0.589, indicating good predictive capability for log t(1/2) values of PCBs in n-hexane. The QSPR results show that standard heat of formation (Delta Hf), total energy (TE), and molecular weight (M-w) have dominant effect on t(1/2) values of PCBs in n-hexane. Increasing Delta Hf and TE values or decreasing Mw values of the PCBs leads to decrease of log t(1/2) values. In addition, increasing the largest negative atomic charge on a carbon atom and dipole moment of the PCBs leads to decrease of log t(1/2) values.

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

photodegradation
partial least squares
polychlorinated biphenyls
quantum chemical descriptors


A multi-moment finite volume formulation for shallow water equations on unstructured mesh A novel and accurate finite volume method has been presented to solve the shallow water equations on unstructured grid in plane geometry. In addition to the volume integrated average (VIA moment) for each mesh cell, the point values (PV moment) defined on cell boundary are also treated as the model variables. The volume integrated average is updated via a finite volume formulation, and thus is numerically conserved, while the point value is computed by a point-wise Riemann solver. The cell-wise local interpolation reconstruction is built based on both the VIA and the PV moments, which results in a scheme of almost third order accuracy. Efforts have also been made to formulate the source term of the bottom topography in a way to balance the numerical flux function to satisfy the so-called C-property. The proposed numerical model is validated by numerical tests in comparison with other methods reported in the literature.

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

finite volume method
unstructured grid
shallow water equations

high order scheme
multi-moment
hydraulic simulation


random sampling key revocation scheme for distributed sensor networks Distributed key or node revocation facilitates the removal of compromised keys or nodes from a network without requiring a central authority. We propose a new revocation scheme, the random neighbourhood sampling node revocation , for distributed sensor networks. Our protocol is based on simple random sampling, a statistical method to estimate the property of the population through randomly sampling a minimal subset of the population. We exploit one of the inherent features of sensor networks: the sensor nodes are densely deployed, and there is a large overlap of the (wireless) coverage areas of any two neighbouring nodes. The revocation decision is made collectively by the neighbours of a suspicious node. However, instead of collecting the opinions of all neighbours of a suspicious node our scheme samples random subsets of the set of all its neighbours and of the node, which issued the warning. Our protocol is fully decentralized, incurs low communication cost, enables fast reaction to a detected intrusion, is false-detection tolerant and can be implemented with any pairwise key distribution scheme.

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

security
privacy
key management
sensor nets


Adaptive non-uniform sampling of sparse signals for Green Cognitive Radio ? We have proposed a new smart sampler scheme to reduce the power consumption of the Analog to Digital Converter by reducing its average sampling frequency. Its more efficient, in terms of sampling rate, than classical sampler (uniform or multi-coset) when the false detection of bands localisation is low.

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

non-uniform sub-nyquist sampling
software radio
non-uniform spectrum sensing


dynamic noc-based architecture for mpsoc security implementation MPSoCs have been proposed as a promising architecture choice to overcome the challenging embedded electronics requirements, characterized by tights development times and fast evolution of applications. The MPSoC flexibility, also represents a system vulnerability. As security requirements vary dramatically for different applications, the challenge is to provide MPSoC security that allows a trustworthy system that meets all the security requirements of such applications. NoC has become an attractive alternative to support the MPSoC communication requirements. Our work proposes the implementation of dynamic security architecture to overcome present MPSoC vulnerabilities. We integrate agile and dynamic security firewalls into the NoC in order to detect attacks based on different security rules. We evaluate the effectiveness of our approach over several MPSoCs scenarios and estimate their impact on the overall performance. We show that our architecture can perform a fast detection of a wide range of attacks and a fast configuration of the different security policies for several MPSoC applications.

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


Parallel machine scheduling with release time and machine eligibility restrictions We present an algorithm for the problem of minimizing maximum lateness in a parallel machine environment with release dates and machine eligibility restrictions (Pm\r(j),M-j\L-max) for the special case where due dates are equal to release dates plus a constant. No preemption of jobs is allowed. The algorithm has been evaluated using real data from an operational environment of a semiconductor manufacturing firm. Comparison is also made with the actual scheduling system being used by the organization. (C) 1997 Elsevier Science Ltd.

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

machine eligibility
lateness
semiconductor manufacturing
parallel machine scheduling


Regularisation and the inverse problem In this paper the task of solving the inverse photon diffusion problem in human tissue will be discussed. In such problems the optical properties of the tissue are to be determined from a knowledge of measured values of the boundary output fluxes. Measurements are, of course, normally corrupted by noise. By using a finite element model of the diffusion process and simulated noise, it is shown that the estimates obtained by minimising the sum of squares of errors in the output fluxes are biased. Alternative objective functions are discussed that overcome this difficulty and are incidentally easier to minimise. A simple upper bound is given for the amount of noise that can be permitted if reliable estimates are to be obtained.

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

diffusion problem
inverse problem
regularisation


Estimation of 3D structure and motion from image corners This paper deals with motion estimation from image corner correspondences in two cases: the orthogonal corner and the general corner with known space angles. The contribution of the paper is in three folds: First, the three-dimensional structure of a corner is recovered easily from its image by introducing a new coordinate system; second, it is shown that the one corner and two points correspondences over two views are sufficient to uniquely determine the motion, i.e., the rotation and translation; third, experiments using both simulated data and real images are conducted, which present good results.

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


Making the most of TV on the move: My newschannel ? The increasing success of mobile-TV (m-TV) is changing the habits and customs in TV consumption which now extends to parts of the day when viewers are not at home and, mainly, within short intervals between other daily activities. Since much m-TV consumption will be in spare time, offering the users contents they are interested in becomes extremely important to provide an attractive service which does not discourage potential users. Using DVB-H as transport infrastructure, in this paper we introduce a personalization architecture which perfectly fits in with the value chain of m-TV. By applying semantic models and techniques, personalized virtual channels are dynamically constructed by adequately combining several kinds of contents according to the users interests. While the personalization architecture is particularized, in this paper, to provide news channels, it could be easily generalized to other fields.

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


Osteoclasts and Integrins The osteoclast is the unique bone resorptive cell that accomplishes its mission by forming an isolated acidified microenvironment between itself and the bone surface. Creation of this compartment is the first step in bone degradation and establishes that an intimate physical relationship must exist between the osteoclast and bone. Thus, identification of the mechanisms by which the osteoclast attaches to bone is essential to understanding how the cell degrades skeletal tissue. Our studies have investigated whether absence of the ?v?3 integrin modifies the ability of c-Fms to induce Rho GTPases, and the implications for formation of the osteoclast cytoskeleton

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

bone mass
bone resorption
rho gtpase
rac
vav


VIDEO CONFERENCING HUMAN-MACHINE INTERFACE - A FIELD-STUDY In a field study of an established video conferencing system (VCS), ten months of usage data were collected and analyzed with the hope of determining the interaction between three user interface dimensions: user profile, task domain, and technology. A validated survey instrument was used to collect user demographics and measures of certain user perceptions of the system. The degree of usage and measured perceptions provide a measure of the effectiveness of the VCS interface. Specific attention was placed on the differences in system usage and perceptions between three task groups: operational, tactical, and strategic. This indicates that the effectiveness of a VCS interface may be task dependent. Several significant interactions were found and are reported, including the effect of number of remote groups, group size, optional equipment, and training.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 conferencing systems
teleconferencing
groupware
group decision support systems
computer supported cooperative work
electronic meeting systems
human-machine interface
man-machine interface


Adding memory processing behaviors to the fuzzy behaviorist approach (FBA): Resolving limit cycle problems in autonomous mobile robot navigation Most fuzzy logic-based reasoning schemes developed for robot control are fully reflexive, i.e., the reasoning modules consist of fuzzy rule bases mat represent direct mappings from the stimuli provided by the perception systems to the responses implemented by the motion controllers. Due to their totally reflexive nature, such reasoning systems can encounter problems such as infinite loops and limit cycles. In this paper. we propose an approach to remedy these problems by adding a memory and memory-related behaviors to basic reflexive systems. Three major types of memory behaviors are addressed: memory feeding, memory management, and memory utilization. The concepts underlying these major classes of behaviors are first presented. An example of their implementation is then described for the recognition of limit cycles during the sensor-based navigation of mobile robots. Results of sample cases involving an autonomous robot navigating in a priori unknown environments are presented and discussed to illustrate me efficiency of the approach.

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

autonomous robot
fuzzy behaviorist approach
memory processing

fuzzy control
sensor-based navigation
limit cycle avoidance