Computation of Japanese bonds and derivative securities In this paper, we use the Box numerical method to compute implied bond and option prices starting from the general CKLS interest rate model based on Japanese interbank data. In particular, we compute numerically implied prices from the CKLS, Vasicek, Cox-Ingersoll-Ross and Brennan-Schwartz models. We also compare the prices with those obtained from the exact analytical formulae of the Cox-Ingersoll-Ross model. We find that the implied bond and option prices vary across models for Japan. (C) 1998 IMACS/Elsevier Science B.V.

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

term structure
auctions
numerical methods


Fast and adaptive network of spiking neurons for multi-view visual pattern recognition In this paper, we describe and evaluate a new spiking neural network (SNN) architecture and its corresponding learning procedure to perform fast and adaptive multi-view visual pattern recognition. The network is composed of a simplified type of integrate-and-fire neurons arranged hierarchically in four layers of two-dimensional neuronal maps. Using a Hebbian-based training, the network adaptively changes its structure in order to respond optimally to different visual patterns. Neurons in the last layer accumulate information collected over multiple frames to reach a final decision. We tested the network with VidTimit dataset to recognize individuals using facial information from multiple frames. The experiments illustrate and evaluate the two main novelties of the network: structural adaptation and frame-by-frame accumulation of opinions.

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

spiking neural network
visual pattern recognition

face recognition
on-line classification
rank order coding


Arcs, blocking sets, and minihypers A (k, n)-arc in a finite projective plane IIq of order q is a set of k points with some n but no n + 1 collinear points where k > n and 2 less than or equal to n less than or equal to q. The maximum value of k for which a (k, n)-arc exists in PG(2, q) is denoted by m(n)(2, q). It is well known that if n is not a divisor of q, then m(n)(2, q) less than or equal to (n - 1)q + n - 3. The purpose of this paper is to improve this upper bound on m(n) (2, q) using the nonexistence of some minihypers in PG(2, q) and to characterize some minihypers in PG(t, q) where t greater than or equal to 3. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

linear codes
griesmer bound
finite projective geometries


use of images in instructional technology for children with attentional difficulties Students with attentional problems have difficulty in learning mathematics due to their inability to maintain attention on task. The current study proposed that using images during mathematics instruction would provide stimulation for students with characteristics of an attentional problem (ADHD-I and ADHD-C) and thereby enhance their attention and/or time on task. 2 nd to 4 th grade elementary schools students with and without attentional difficulties participated in the study. The study assumed that those students who use a computer to learn geometry would perform better with: (1) a combination images with Low-level Visual Cues ( Images-LVC ) and images with Additional Visual Cues ( Images-AVC ) than no images and (2) Images-AVC than Images-LVC . Different conditions were compared against the control group with no images presented during the instruction.

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


Nitric oxide signaling in the brain: translation of dynamics into respiration control and neurovascular coupling The understanding of the unorthodox actions of neuronal-derived nitric oxide (NO) in the brain has been constrained by uncertainties regarding its quantitative profile of change in time and space. As a diffusible intercellular messenger, conveying information associated with its concentration dynamics, both the synthesis via glutamate stimulus and inactivation pathways determine the profile of NO concentration change. In vivo studies, encompassing the real-time measurement of NO concentration dynamics have allowed us to gain quantitative insights into the mechanisms inherent to NO-mediated signaling pathways. It has been of particular interest to study the diffusion properties and half-life, the interplay between NO and O2 and the ensuing functional consequences for regulation of O2 consumption, the role of vasculature in shaping NO signals in vivo, and the mechanisms that are responsible for NO to achieve the coupling between glutamatergic neuronal activation and local microcirculation.

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


Chinese Wall Security Model for Workflow Management Systems with Dynamic Security Policy Secure workflow management systems (WfMSs) are required to support major security features such as authentication, confidentiality, data integrity, and nonrepudiation. The Chinese wall security model (CWSM) was designed to provide access controls that mitigate conflict of interest in commercial organizations, and is especially important for large-scale interenterprise workflow applications. This paper describes how to implement the CWSM in a WfMS. We first demonstrate situations in which an access control model is not sufficient for this if the WfMS does not keep the run-time history of data accesses and company information is mutable, and we then propose an application programming interface (API) to solve this problem, also providing support for the intrinsic dynamic access control mechanism defined in the CWSM (i.e., the dynamic binding of subjects and elements in the company data set). This API can also specify several requirements of the dynamic security policy that arise when applying the CWSM in WfMSs. Finally we discuss how to implement a run-time system to implement CWSM policies specified by this API in a WfMS.

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

computer-supported cooperative work (cscw)


Performance analysis of multimedia based web traffic with QoS constraints During the recent years, there has been a tremendous growth in the development and deployment of multimedia based networked applications such as video streaming, IP telephony, interactive games, among others. These applications, in contrast to elastic applications such as email and data sharing, are delay and delay jitter sensitive but can tolerate certain level of packet loss. A vital element of end-to-end delay and delay jitter is the random queueing delays in network switches and routers. Analysis of robust mechanisms for buffer management at network routers needs to be carried out in order to reduce end-to-end delay for traffic generated by multimedia applications. In this context, a threshold based buffer management scheme for accommodating multiple class multimedia traffic in network routers has been analysed. This technique effectively controls the allocation of buffer to various traffic classes according to their delay constraints. The forms of the joint state probabilities, as well as basic performance measures such as blocking probabilities are analytically established at equilibrium. Typical numerical experiments are included to illustrate the credibility of the proposed mechanism in the context of different quality of service (QoS) grades for various network traffic classes. This model, therefore, can be used as a powerful tool to provide a required grade of service to a particular class of multimedia based web traffic in any heterogeneous network. (c) 2007 Elsevier Inc. All rights reserved.

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

multimedia applications
performance analysis


An analytical formula for pricing m-th to default swaps The computational effort of pricing an m-th to default swap depends highly on the size n of the underlying basket. Usually, n different default times are modeled, but in fact the valuation only depends on the m-th smallest default time of this tuple. In this paper we attain an analytical formula for the distribution of this m-th default time. With the help of this distribution we simplify the valuation problem from an n-dimensional quadrature to a one-dimensional quadrature and break the curse of dimensionality. Applications of this modification are efficient pricing of m-th to default swaps, estimation of sensitivities and pricing of European max/min options.

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


Data-driven multimodal synthesis This paper is a report on current efforts at the Department of Speech, Music and Hearing, KTH, on data-driven multimodal synthesis including both visual speech synthesis and acoustic modeling. In the research we try to combine both corpus based methods with knowledge based models and to explore the best of the two approaches. In the paper an attempt to build formant-synthesis systems based on both rule-generated and database driven methods is presented. A pilot experiment is also reported showing that this approach can be a very interesting path to explore further. Two studies on visual speech synthesis are reported, one on data acquisition using a combination of motion capture techniques and one concerned with coarticulation, comparing different models.

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


Morphological scale spaces and associative morphological memories: Results on robustness and practical applications Associative Morphological Memories are the analogous construct to Linear Associative Memories defined on the lattice algebra (R, +, boolean OR, boolean AND). They have excellent recall properties for noiseless patterns. However they suffer from the sensitivity to specific noise models, that can be characterized as erosive and dilative noise. To improve their robustness to general noise we propose a construction method that is based on the extrema point preservation of the Erosion/Dilation Morphological Scale Spaces. Here we report on their application to the tasks of face localization in grayscale images and appearance based visual self-localization of a mobile robot.

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

face localization
morphological scale spaces


Study and implementation of the virtual view in unix The security of information systems is important. protecting them from the viewpoint of methodology has become the critical task of their planners and implementers,This article proposes a nem idea about the virtual view based upon unix stemming from the usual view concept, analyzes the characteristics of the virtual view, and finally gives the way of realization of the virtual view.

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

information security
virtual view
access control


Multiple ligand-binding modes in bacterial R67 dihydrofolate reductase R67 dihydrofolate reductase (DHFR), a bacterial plasmid-encoded enzyme associated with resistance to the drug trimethoprim, shows neither sequence nor structural homology with the chromosomal DHFR. It presents a highly symmetrical toroidal structure, where four identical monomers contribute to the unique central active-site pore. Two reactants (dihydrofolate, DHF), two cofactors (NADPH) or one of each (R67.DHF.NADPH) can be found simultaneously within the active site, the last one being the reactive ternary complex. As the positioning of the ligands has proven elusive to empirical determination, we addressed the problem from a theoretical perspective. Several potential structures of the ternary complex were generated using the docking programs AutoDock and FlexX. The variability among the final poses, many of which conformed to experimental data, prompted us to perform a comparative scoring analysis and molecular dynamics simulations to,assess the stability of the complexes. Analysis of ligand-ligand and ligand-protein interactions along the 4 ns trajectories of eight different structures allowed us to identify important inter-ligand contacts and key protein residues. Our results, combined with published empirical data, clearly suggest that multiple binding modes of the ligands are possible within R67 DHFR. While the pterin ring of DHF and the nicotinamide ring of NADPH assume a stacked endo-conformation at the centre of the pore, probably assisted by V66, Q67 and 168, the tails of the molecules extend towards opposite ends of the cavity, adopting multiple configurations in a solvent rich-environment where hydrogen-bond interactions with K32 and Y69 may play important roles.

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

autodock
docking
flexx
molecular dynamics

consensus scoring
gromacs
interligand cooperativity
ligand mobility
reactive complex


The basic feasible functionals in computable analysis We give a correspondence between two notions of complexity for real functions: poly-time computability according to Ko and a notion that arises naturally when one considers the application of Mehlhorn's class of the basic feasible functionals to computable analysis. We show that both notions define the same set of polynomial-time computable real functions. (C) 2006 Elsevier Inc. All rights reserved.

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


Modelling angelic and demonic nondeterminism with multirelations This paper presents an introduction to a calculus of binary multirelations, which can model both angelic and demonic kinds of non-determinism. The isomorphism between up-closed multirelations and monotonic predicate transformers allows a different view of program transformation, and program transformation calculations using multirelations are easier to perform in some circumstances. multirelations are illustrated by modelling both kinds of nondeterministic behaviour in games and resource-sharing protocols. (c) 2006 Elsevier B.V. All rights reserved.

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

multirelation
predicate transformer
agent
strongest postcondition
angelic nondeterminism
resource sharing


IMPOSSIBILITY OF SUCCINCT QUANTUM PROOFS FOR COLLISION-FREENESS We show that any quantum algorithm to decide whether a function f : [n] -> [n] is a permutation or far from a permutation must make Omega (n(1/3)/w) queries to f, even if the algorithm is given a w-qubit quantum witness in support of f being a permutation. This implies that there exists an oracle A such that SZK(A) not subset of QMA(A), answering an eight-year-old open question of the author. Indeed, we show that relative to some oracle, SZK is not in the counting class A(0)PP defined by Vyalyi. The proof is a fairly simple extension of the quantum lower bound for the collision problem.

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


High-order parabolic beam approximation for aero-optics The parabolic beam equations are solved using high-order compact differences for the Laplacians and RungeKutta integration along the beam path. The solution method is verified by comparison to analytical solutions for apertured beams and both constant and complex index of refraction. An adaptive 4th-order RungeKutta using an embedded 2nd-order method is presented that has demonstrated itself to be very robust. For apertured beams, the results show that the method fails to capture near aperture effects due to a violation of the paraxial approximation in that region. Initial results indicate that the problem appears to be correctable by successive approximations. A preliminary assessment of the effect of turbulent scales is undertaken using high-order Lagrangian interpolation. The results show that while high fidelity methods are necessary to accurately capture the large scale flow structure, the method may not require the same level of fidelity in sampling the density for the index of refraction. The solution is used to calculate a phase difference that is directly compared with that commonly calculated via the optical path difference. Propagation through a supersonic boundary layer shows that for longer wavelengths, the traditional method to calculate the optical path is less accurate than for shorter wavelengths. While unlikely to supplant more traditional methods for most aero-optics applications, the current method can be used to give a quantitative assessment of the other methods as well as being amenable to the addition of more physics.

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

compact difference scheme
aero-optics
parabolic beam equation
opd
computational error
les


An effective cache replacement algorithm in transcoding-enabled proxies In this paper, we address the problem of cache replacement for transcoding proxy caching. Transcoding proxy is a proxy that has the functionality of transcoding a multimedia object into an appropriate format or resolution for each client. We first propose an effective cache replacement algorithm for transcoding proxy. In general, when a new object is to be cached, cache replacement algorithms evict some of the cached objects with the least profit to accommodate the new object. Our algorithm takes into account of the inter-relationships among different versions of the same multimedia object, and selects the versions to replace according to their aggregate profit which usually differs from simple summation of their individual profits as assumed in the existing algorithms. It also considers cache consistency, which is not considered in the existing algorithms. We then present a complexity analysis to show the efficiency of our algorithm. Finally, we give extensive simulation results to compare the performance of our algorithm with some existing algorithms. The results show that our algorithm outperforms others in terms of various performance metrics.

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

transcoding
proxy caching
cache replacement
multimedia


Emotion-based music recommendation by affinity discovery from film music With the growth of digital music, the development of music recommendation is helpful for users to pick desirable music pieces from a huge repository of music. The existing music recommendation approaches are based on a user's preference on music. However, sometimes, it might better meet users' requirement to recommend music pieces according to emotions. In this paper, we propose a novel framework for emotion-based music recommendation. The core of the recommendation framework is the construction of the music emotion model by affinity discovery from film music, which plays an important role in conveying emotions in film. We investigate the music feature extraction and propose the Music Affinity Graph and Music Affinity Graph-Plus algorithms for the construction of music emotion model. Experimental result shows the proposed emotion-based music recommendation achieves 85% accuracy in average. (C) 2008 Elsevier Ltd. All rights reserved.

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


Measuring and adapting behavior during product interaction to influence affect Sometimes, the way in which we interact with products implicitly communicates how we feel. Based on previous studies on how emotions can be detected and communicated via product interaction, we discuss how an interactive product could influence affect by responding and changing behaviors expressing affect. We discuss the proposal of the affective feedback loop in product interaction by its implementation in the prototype of a pen that senses two implicit behaviors related to restlessness, rock and roll. Furthermore, the pen provides inherent feedback, focusing on the perceptual motor skills, as a means to reflect on these behaviors. The pen was evaluated in an experiment, by which we explored whether this type of feedback would influence the emotional experience. Two participant groups were compared, and participants that used the pen with feedback showed a lower heart rate throughout the whole experiment. Because these participants were not aware that the pen provided any feedback, we propose the concept of unaware interaction and discuss what its implications are for design.

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

emotional experience
product interaction
inherent feedback


The automorphism groups of BCH codes and of some affine-invariant codes over extension fields Affine-invariant codes are extended cyclic codes of length p(m) invariant under the affine-group acting on F-p(m). This class of codes includes codes of great interest such as extended narrow-sense BCH codes. In recent papers, we classified the automorphism groups of affine-invariant codes [2], [5]. We derive here new results, especially when the alphabet field is an extension field, by expanding our previous tools. In particular we complete our results on BCH codes, giving the automorphism groups of extended narrow-sense BCH codes defined over any extension field.

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

cyclic code
extended cyclic code
affine-invariant codes
grm codes
permutation group
automorphism group


Multiway spatial joins Due to the evolution of Geographical Information Systems, large collections of spatial data having various thematic contents are currently available. As a result, the interest of users is not limited to simple spatial selections and joins, but complex query types that implicate numerous spatial inputs become more common. Although several algorithms have been proposed for computing the result of pairwise spatial joins, limited work exists on processing and optimization of multiway spatial joins. In this article, we review pairwise spatial join algorithms and show how they can be combined for multiple inputs. In addition, we explore the application of synchronous traversal (ST), a methodology that processes synchronously all inputs without producing intermediate results. Then, we integrate the two approaches in an engine that includes ST and pairwise algorithms, using dynamic programming to determine the optimal execution plan. The results show that, in most cases, multiway spatial joins are best processed by combining ST with pairwise methods. Finally, we study the optimization of very large queries by employing randomized search algorithms.

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


Stratus: Energy-Efficient Mobile Communication using Cloud Support Cellular radio communication is a significant contributor to battery energy drain on smartphones, in some cases inflating the energy cost by a factor of 5 or more compared to the energy cost of the base device. Stratus is a system to reduce this energy consumption by leveraging cloud resources to make data communication on smartphones more efficient. Using a cloud-based proxy, Stratus employs optimizations that adapt an application's incoming and outgoing traffic to better match the energy characteristics of the radio interface. The optimizations include (a) aggregation to bunch up sporadic transmissions, (b) asymmetric dictionary-based compression to reduce the number of bits transmitted over the air, and (c) opportunistic scheduling to avoid communication during periods of poor signal reception. These optimizations can be used individually, or in combination, subject to an application's delay tolerance. For example, using our Stratus prototype, the aggregation and compression optimizations together achieve up to 50% energy savings for web browsing, while the aggregation and scheduling optimizations together achieve up to 35% energy savings for a media streaming application.

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

algorithms
measurement
performance
smartphone
cloud proxy


primal-dual algorithms for deterministic inventory problems We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. These inventory models have been studied extensively, and play a fundamental role in broader planning issues, such as the management of supply chains. We shall give a novel primal-dual framework for designing algorithms for these models that significantly improve known results in several ways: the performance guarantees for the quality of the solutions improve on or match previously known results; the performance guarantees hold under much more general assumptions about the structure of the costs, and the algorithms and their analysis are significantly simpler than previous known results. Finally, our primal-dual framework departs from the structure of previously studied primal-dual approximation algorithms in significant ways, and we believe that our approach may find application in other settings.We provide 2-approximation algorithms for the joint replenishment problem and for the assembly problem, and solve the single-item lot-sizing problem to optimality. The results for the joint replenishment and the lot-sizing problems also hold for their generalizations with back orders allowed. As a byproduct of our work, we prove known and new upper bounds on the integrality gap of the LP relaxations for these problems.

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

inventory problems
approximation algorithms


Chemical supply chain network optimization Chemical supply chain networks provide large opportunities for cost reductions through the redesign of the flow of material from producer to customer. In this paper we present a mixed-integer linear program (MILP) capable of optimizing a multi-product supply chain network made up of production sites. an arbitrary number of echelons of distribution centers, and customer sites. The emphasis of our approach is on the redesign of existing supply chain networks. The model does not lump customer demand into zones. but rather deals with individual customer demand to directly address customer preferred mode of transport at each location. Historical records can be used to fix decision variables in the model so that a base case can be computed to validate the model and contrast it against the optimized network. The details inherent in this approach allow the optimization results to be partitioned and prioritized for implementation. The model results are processed to assign cost components to individual customer records. A simple case study is presented to illustrate the method and actual industrial results are reviewed. (c) 2007 Elsevier Ltd. All rights reserved.

O B I O B O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O 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 monitoring and diagnosis of manufacturing processes using an integrated approach of KBANN and GA In many manufacturing processes, some key process parameters (i.e., system inputs) have very strong relationship with the categories (e.g., normal or various faulty products) of finished products (i.e., system outputs). The abnormal changes of these process parameters could result in various categories of faulty products. In this paper, a hybrid learning-based model is developed for on-line intelligent monitoring and diagnosis of the manufacturing processes. In the proposed model, a knowledge-based artificial neural network (KBANN) is developed for monitoring the manufacturing process and recognizing faulty quality categories of the products being produced. In addition, a genetic algorithm (GA)-based rule extraction approach named GARule is developed to discover the causal relationship between manufacturing parameters and product quality. These extracted rules are applied for diagnosis of the manufacturing process, provide guidelines on improving the product quality, and are used to construct KBANN. Therefore, the seamless integration of GARule and KBANN provides abnormal warnings, reveals assignable cause(s), and helps operators optimally set the process parameters. The proposed model is successfully applied to a japing-line, which improves the product quality and saves manufacturing cost. (c) 2007 Elsevier B.V. All rights reserved.

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

intelligent monitoring
genetic algorithm


Hybrid adaptive fuzzy controllers with application to robotic systems This paper presents a hybrid adaptive fuzzy control (HAFC) design methodology, where the nonlinear system is controlled by a state feedback controller and an adaptive fuzzy controller. In the adaptive fuzzy controller, an adaptive law is developed to tune a robust gain of the sliding-mode controller (SMC) so as to cope with the uncertainties and model errors. The proposed design method is applied to investigate the position and tracking control of a two-link robot. A comparison between the proportional-derivative control, SMC, adaptive control and the proposed HAFC for a two-link robot is made. The simulation results demonstrate that, by using the HAFC, the system performances is improved and the system also exhibits stability and robustness. (C) 2002 Elsevier B.V. All rights reserved.

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

fuzzy control
adaptive law
robotic systems


Mathematical modelling of 2D electromagnetic scattering The singular integral equation method is used for solving the problem of diffraction by infinite nonhomogeneous cylinder. A numerical method is developed, and certain aspects of its practical application are considered. Some numerical results are described. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

minimum discrepancy method
fast fourier transform


a context-aware middleware for applications in mobile ad hoc environments Novel ubiquitous computing applications such as intelligent vehicles, smart buildings, and traffic management require special properties that traditional computing applications do not support, such as context-awareness, massive decentralisation, autonomous behaviour, adaptivity, proactivity, and innate collaboration. This paper presents a new computational model and middleware that reflect support for the required the properties. The sentient object model is proposed by the CORTEX 1 project to support the construction of ubiquitous applications. A flexible, run-time reconfigurable component-based middleware has been built to provide run-time support to engineer the sentient object programming paradigm. An application infrastructure using sentient objects to enable cooperation between autonomous and proactive vehicles has been implemented to demonstrate the appropriateness of the computational model and the validity of the middleware for pervasive mobile ad hoc computing.

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

components
ad hoc wireless network
context-awareness


low cost solution for location determination of mobile nodes in a wireless local area network In this research paper we undertook the problem of Location Determination of Mobile nodes in a Wireless Local area network, as finding out the location in a wireless environment is to-date not very easy, cheap and accurate using 802.11b technology. We used the classical method of Triangulation with a little alteration which is later on described in the paper. Another method we used is the methods of calibration by research to produce more accurate results and also to cross verify the results of the method of Triangulation. The work in this paper attempts to illustrate the different aspects of the problem of location determination in WiFi networks. We started with an investigation of the influence that network characteristics have on the ability of middleware location determination protocols to accurately estimate position of mobile nodes. We presented an implementation based study that demonstrated the strong relationship between the two of the location determination methods and their performance. The main objective of this paper is to provide method in which no dedication hardware is required. Only Wireless Lan card is required and can be placed in any suitable location. The significance of this result lies in allowing a network designer to make a suitable tradeoff between QoS of location determination and other application protocols while choosing a network topology. The combination of two methods reduced the error rate of locating a mobile node to a great extent. The results were being plotted on a given map using both the algorithms.

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

location estimation
signal attenuation
wi-fi


Computational implementation of stress integration in FE analysis of elasto-plastic large deformation problems In this paper, we compare different numerical implementation algorithms for the rate type constitutive equation and present an integration scheme based on the physical meaning of the stress. Numerical implementation of various schemes is investigated in conjunction with the return mapping algorithm and the conditions to maintain plastic consistency. Jaumann and Truesdell rates are taken as the objective stress rates in the constitutive equation. An alternative numerical treatment for rate of deformation tensor Dij is presented and is shown to maintain incremental objectivity. Numerical examples included a single element under rigid body rotation, a necking bifurcation of a bar in tension and a punch indentation process. It is shown that the use of Truesdell stress rate with specific numerical integration procedure gives more accurate results than other procedures presented.

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


overview of a high-performance programmable pipeline structure This paper aims at describing a high-performance programmable pipeline architecture consisting of a linear array of PCS processors. The PCS processor which is capable of performing 20 million floating-point operations per second (20 MFLOPS) has been built from off-the-shelf chips on a wire-wrapped board. The prototype processor is attached to a SUN-3 workstation. Efficient microcode is generated using the microcode compiler that has been designed and implemented. The microcode optimization includes microcode compaction and loop optimization using the software pipelining technique. Another loop optimization technique based on the unrolling is also outlined. Preliminary results obtained on vector benchmarks are given.

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

processor
structure
prototype
architecture
pipeline
software pipelining
paper

vectorization
compact
optimality
benchmark
high-performance
arrays
operability
compilation
floating point
programmer


A performance, semantic and service quality-enhanced distributed search engine for improving geospatial resource discovery Geospatial resource discovery is a critical step for developing geographic science applications. With the increasing number of geospatial resources available online, many Spatial Data Infrastructure (SDI) components (e.g. catalogues and portals) have been developed to help manage and discover geospatial resources. However, efficient and accurate geospatial resource discovery is still a big challenge because of the heterogeneity and complexity of decentralized network environments and interdisciplinary semantics. In this article, we report a search engine framework for efficient geospatial resource discovery, which reduces integration costs by leveraging existing Geospatial Cyberinfrastructure (GCI) components. Specifically, (1) the framework provides integration capability and flexibility by adopting the brokering approach, implementing a plug-in'-based framework for metadata processing and proposing a dynamically configurable search workflow; (2) the asynchronous messaging and batch processing-based metadata record retrieval mode enhances the search performance and user interactivity; (3) an embedded semantic support system improves the discovery recall level and precision by providing semantic-based search rule creation and result similarity evaluation functions and (4) the engine assists user decision-making by integrating a service quality monitoring and evaluation system, data/service visualization tools, multiple views and additional information. Experiments and a search example show that the proposed engine helps both scientists and general users search for more accurate results with enhanced performance and user experience through a user-friendly interface.

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

cybergis
spatial cloud computing
spatial web portal
data discovery
earthcube


An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion An ILS algorithm is proposed to solve the permutation flowshop sequencing problem with total flowtime criterion. The effects of different initial permutations and different perturbation strengths are studied. Comparisons are carried out with three constructive heuristics, three ant-colony algorithms and a particle swarm optimization algorithm. Experiments on benchmarks and a set of random instances show that the proposed algorithm is more effective. The presented ILS improves the best known permutations by a significant margin.

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

iterated local search
permutation flowshop
total flowtime


Design methods of radix converters using arithmetic decompositions In arithmetic circuits for digital signal processing, radixes other than two are often used to make circuits faster. In such cases, radix converters are necessary. However, in general, radix converters tend to be complex. This paper considers design methods for p-nary to binary converters. First, it considers Look-Up Table (LUT) cascade realizations. Then, it introduces a new design technique called arithmetic decomposition by using LUTs and adders. Finally, it compares the amount of hardware and performance of radix converters implemented by FPGAs. 12-digit ternary to binary converters on Cyclone II FPGAs designed by the proposed method are faster than ones by conventional methods.

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

radix converter
lut cascades
fpga
functional decomposition


a system for usable unification of interfaces of learning objects in m-learning This article proposes a system for unification of interfaces of learning objects in m-learning, and it explains the part which is currently being developed in a doctoral dissertation.

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


Effects of Data Scrubbing on Reliability in Storage Systems Silent data corruptions, which are induced by latent sector errors, phantom writes, DMA parity errors and so on, can be detected by explicitly issuing a read command to a disk controller and comparing the corresponding data with their checksums. Because some of the data stored in a storage system may not be accessed for a long time, there is a high chance of silent data corruption occurring undetected, resulting in data loss. Therefore, periodic checking of the entire data in a storage system, known as data scrubbing, is essential to detect such silent data corruptions in time. The errors detected by data scrubbing will be recovered by the replica or the redundant information maintained to protect against permanent data loss. The longer the period between data scrubbings, the higher the probability of a permanent data loss. This paper proposes a Markov failure and repair model to conservatively analyze the effect of data scrubbing on the reliability of a storage system. We show the relationship between the period of a data scrubbing operation and the number of data replicas to manage the reliability of a storage system by using the proposed model.

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


Statistical deformable model-based segmentation of image motion We present a statistical method for the motion-based segmentation of deformable structures undergoing nonrigid movements. The proposed approach relies on vivo models describing the shape of interest, its variability, and its movement. The first model corresponds to a statistical deformable template that constrains the shape and its deformations. The second model is introduced to represent the optical flow field inside the deformable template. These two models are combined within a single probability distribution, which enables to derive shape and motion estimates using a maximum likelihood approach. The method requires no manual initialization and is demonstrated on synthetic data and on a medical X-ray image sequence.

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

deformable models
image sequence analysis
motion detection
motion estimation


Study on improving the selectivity of compounds that inhibit two PI3Ks (gamma and delta) A desirable characteristic of PI3K inhibitors is their selectivity. Up to now, there has been no report that describes the 3 D-structure differences between two PI3Ks (delta and gamma) and applies them to designing selective compounds. In the present study, we used an approach combining protein-structure modeling, GRID/PCA (Principal Component Analysis) and docking methods to investigate the detail interactions of the two PI3Ks with various chemical groups. At first, we constructed a 3 D-model of the PI3K delta catalytic subunit with the program Modeller7.0 based on the high resolution X-ray structure of the PI3K gamma catalytic subunit, and then employed GRID and PCA to reveal the most relevant structural and physicochemical differences between the two PI3Ks related to their selectivity. As a result, the analysis unveiled the most important regions on the two PI3Ks that should be taken into account for the design of selective inhibitors. Finally, based on activity data of 10 PI3K delta-selective compounds, a docking study validated the results of the GRID/PCA method, which suggested that the approach could provide clear guidelines for selective drug design.

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

selectivity
grid
pca
pi3k gamma
pi3k delta


supporting transparent model update in distributed case tool integration Model Driven Architecture (MDA) is a software development approach that focuses on models. In order to support MDA, a lot of CASE tools have emerged; each of them provides a different set of modeling services (operations for automating model manipulation). We have proposed an open environment called ModelBus, which enables the integration of heterogeneous and distributed CASE tools. ModelBus enables tools to invoke the modeling services provided by other tools. In this paper, we focus on supporting a particular kind of modeling services: services that update models (i.e. they have inout parameters). Our contribution is to enable a tool to update models owned by another tool. We propose a parameter passing mechanism that hides the complexity of model update from tools. First, it enables a tool to update models transparently to heterogeneous model representations. Second, it enables a tool to update models located in the memory of another remote tool transparently, as if the models were local. Third, it ensures the integrity between the updated models and the tool that owns the models.

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

interoperability
call-by-copy-restore
rpc
graph
middleware
data structure


A passive tree-based backbone construction scheme for MANETs Backbone-based broadcast schemes are effective in alleviating the broadcast storm problem in mobile ad hoc networks (MANETs). However, periodically hello packets used to maintain a backbone usually lead to extra control overhead. In this paper, passive tree-based backbone construction scheme (PTBCS) is proposed as a backbone construction scheme for MANETs. Different from other schemes, each node in PTBCS determines its role by intercepting packet transmissions in the air during a special waiting period. Hence, its most remarkable advantage is that there are no periodical packet transmissions specially for backbone construction. The property that the nodes selected by PTBCS make up a connected dominating set (CDS) of the network is proven with several ideal assumptions. Simulation results show that PTBCS is effective when compared with some other typical backbone construction schemes. (C) 2009 Elsevier B.V. All rights reserved.

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


Fractional Polynomial Bounds for the Fixed Charge Problem In this paper we seek to enhance the understanding of the structure of the fixed charge transportation problem (FCTP) and to demonstrate the relationship between fixed charge problems and fractional polynomial functions. We provide a new approach for approximating and solving the FCTP by developing novel fractional polynomial approximations for the objective function to obtain lower and upper bounds for the optimal solution. In addition, the lower bound proposed in the paper can be used to obtain superior initial or starting conditions for any established branch-and-bound or iterative algorithm to accelerate convergence to the optimal FCTP solution.

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


can recursive bisection alone produce routable placements? This work focuses on congestion-driven placement of standard cells into rows in the fixed-die context. We summarize the state-of-the-art after two decades of research in recursive bisection placement and implement a new placer, called Capo , to empirically study the achievable limits of the approach. From among recently proposed improvements to recursive bisection, Capo incorporates a leading-edge multilevel min-cut partitioner [7], techniques for partitioning with small tolerance [8], optimal min-cut partitioners and end-case min-wirelength placers [5], previously unpublished partitioning tolerance computations, and block splitting heuristics. On the other hand, our good enough implementation does not use overlapping [17], multi-way partitioners [17, 20], analytical placement, or congestion estimation [24, 35]. In order to run on recent industrial placement instances, Capo must take into account fixed macros, power stripes and rows with different allowed cell orientations. Capo reads industry-standard LEF/DEF, as well as formats of the GSRC bookshelf for VLSI CAD algorithms [6], to enable comparisons on available placement instances in the fixed-die regime. Capo clearly demonstrates that despite a potential mismatch of objectives, improved mincut bisection can still lead to improved placement wirelength and congestion. Our experiments on recent industrial benchmarks fail to give a clear answer to the question in the title of this paper. However, they validate a series of improvements to recursive bisection and point out a need for transparent congestion management techniques that do not worsen the wirelength of already routable placements. Our experimental flow, which validates fixed-die placement results by violation-free detailed auto-routability, provides a new norm for comparison of VLSI placement implementations.

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

point order use context account paper comparisons management research macros industrial implementation flow placement power heuristics congestion

estimates
recursion
benchmark
object
standardization
experience
case
art
partition
standard cell
experimentation
optimality
orientation
summarization
algorithm
blocking


Modelling and learning user preferences over sets Although there has been significant research on modelling and learning user preferences for various types of objects, there has been relatively little work on the problem of representing and learning preferences over sets of objects. We introduce a representation language, DD-PREF, that balances preferences for particular objects with preferences about the properties of the set. Specifically, we focus on the depth of objects (i.e. preferences for specific attribute values over others) and on the diversity of sets (i.e. preferences for broad vs. narrow distributions of attribute values). The DD-PREF framework is general and can incorporate additional object-and set-based preferences. We describe a greedy algorithm, DD-Select, for selecting satisfying sets from a collection of new objects, given a preference in this language. We show how preferences represented in DD-PREF can be learned from training data. Experimental results are given for three domains: a blocks world domain with several different task-based preferences, a real-world music playlist collection, and rover image data gathered in desert training exercises.

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

set-based preferences
preference learning


Energy-efficient resource allocation in multiuser relay-based OFDMA networks Although the demand for battery capacity on mobile devices has grown with the increase in high data rate applications, battery technology has not kept up with this demand. Therefore, the growth in energy demand coupled with global warming provide a new trend in wireless communication known as energy-efficient transmission. In this paper, the energy-efficient resource allocation for a two-hop uplink multiuser relay-based system is studied. We adopt the orthogonal frequency division multiplexing as the physical layer modulation technique. Assuming that the base station has all the channel state information, an energy efficiency optimization problem by joint subcarrier assignment, bit and power allocation is formulated. We first develop a near-optimal resource allocation scheme to maximize the overall energy efficiency; then, an efficient resource allocation algorithm is provided to solve the problem with relatively low computational complexity. Furthermore, fairness constraint among users is imposed on the system to guarantee each user's QoS. Our joint resource allocation algorithm is proved to achieve a considerable improvement in terms of energy-saving and simultaneously decreases outage probability by simulation results. Copyright (c) 2012 John Wiley & Sons, Ltd.

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

energy efficiency
resource allocation
multiuser


Augmented reality using personal projection and retroreflection The support of realistic and flexible training simulations for military, law enforcement, emergency response, and other domains has been an important motivator for the development of augmented reality technology. An important vision for achieving this goal has been the creation of a versatile stage for physical, emotional, and cognitive training that combines virtual characters and environments with real world elements, such as furniture and props. This paper presents REFLCT, a mixed reality projection framework that couples a near-axis personal projector design with tracking and novel retroreflective props and surfaces. REFLCT provides multiple users with personalized, perspective-correct imagery that is uniquely composited for each user directly into and onto a surrounding environment, without any optics positioned in front of the users eyes or face. These characteristics facilitate team training experiences which allow users to easily interact with their teammates while wearing their standard issue gear. REFLCT can present virtual humans who can make deictic gestures and establish eye contact without the geometric ambiguity of a typical projection display. It can also display perspective-correct scenes that require a realistic approach for detecting and communicating potential threats between multiple users in disparate locations. In addition to training applications, this display system appears to be well matched with other user interface and application domains, such as asymmetric collaborative workspaces and personal information guides.

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

head-mounted projection
retroreflective screens
pico-projector


Component-aware tensor-product trivariate splines of arbitrary topology The fundamental goal of this paper aims to bridge the large gap between the shape versatility of arbitrary topology and the geometric modeling limitation of conventional tensor-product splines for solid representations. Its contribution lies at a novel shape modeling methodology based on tensor-product trivariate splines for solids with arbitrary topology. Our framework advocates a divide-and-conquer strategy. The model is first decomposed into a set of components as basic building blocks. Each component is naturally modeled as tensor-product trivariate splines with cubic basis functions while supporting local refinement. The key novelty is our powerful merging strategy that can glue tensor-product spline solids together subject to C-2 continuity. As a result, this new spline representation has many attractive advantages. At the theoretical level, the integration of the top-down topological decomposition and the bottom-up spline construction enables an elegant modeling approach for arbitrary high-genus solids. Each building block is a regular tensor-product spline, which is CAD-ready and facilitates GPU computing. In addition, our new spline merging method enforces the features of semi-standardness (i.e., Sigma(i)w(i)B(i)(u,v,w) equivalent to 1 everywhere) and boundary restriction (i.e., all blending functions are confined exactly within parametric domains) in favor of downstream CAE applications. At the computational level, our component-aware spline scheme supports meshless fitting which completely avoids tedious volumetric mapping and remeshing. This divide-and-conquer strategy reduces the time and space complexity drastically. We conduct extensive experiments to demonstrate its shape flexibility and versatility towards solid modeling with complicated geometries and nontrivial genus. (C) 2012 Elsevier Ltd. All rights reserved.

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

tensor-product splines
solid models of arbitrary topology
semi-standardness


Frank Miller: Inventor of the One-Time Pad The invention of the one-time pad is generally credited to Gilbert S. Vernam and Joseph O. Mauborgne. We show that it was invented about 35 years earlier by a Sacramento banker named Frank Miller. We identify which Frank Miller it was, and speculate on what might have led him to his idea. We also discuss whether or not Mauborgne might have known of Miller's work, especially via his colleague Parker Hitt.

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

gilbert s. vernum
joseph o. mauborgne
one-time pad
parker hit
telegraph code


An Algorithm for Gradual Patch Acceptance Detection in Open Source Software Repository Mining Nowadays, software development societies have given more precedence to Open Source Software (OSS). There is much research aimed at understanding the OSS society to sustain the OSS product. To lead an OSS project to a successful conclusion, researchers study how developers change source codes called patches in project repositories. In existing studies, we found an argument in the conventional patch acceptance detection procedure. It was so simplified that it omitted important cases from the analysis, and would lead researchers to wrong conclusions. In this research, we propose an algorithm to overcome the problem. To prove out our algorithm, we constructed a framework and conducted two case studies. As a result, we came to a new and interesting understanding of patch activities.

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

oss repository mining
patch submission
oss evolution pattern


A soft-decision based two-layered scheduling approach for uncertain steelmaking-continuous casting process We model the SCC scheduling problem as an MIP model with interval variables. We propose the soft decision concept for uncertain SCC environments. We present a two-layered solution framework to solve the model. Experiments show the superiority of the method under uncertain situations.

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

steelmaking
continuous casting
uncertainty


establishment and traffic measurement of overlay multicast testbed in koren, thairen and tein2 Nowadays not only many of research works with various international networks are increasing more and more but also commercial works are increasing with different international networks. In this paper, we have constructed the overlay multicast testbed with KOREN and TEIN2 network, and then we also analyze and research many works with the data got from the testbed experiments, and research works for speed of transmission and transmission security when the data is forwarded to several various international network. We work out the process of problem based on several data of experiments. We analyze these problems and propose the research way to other researchers in overlay multicast area, and we also provide these useful results to other researchers in this area.

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

multicast tein2 measurement koren overlay


GeneShelf:

A

Web-based

Visual

Interface

for

Large

Gene

Expression

Time-Series

Data

Repositories

A

widespread

use

of

high-throughput

gene

expression

analysis

techniques

enabled

the

biomedical

research

community

to

share

a

huge

body

of

gene

expression

datasets

in

many

public

databases

on

the

web.

However,

current

gene

expression

data

repositories

provide

static

representations

of

the

data

and

support

limited

interactions.

This

hinders

biologists

from

effectively

exploring

shared

gene

expression

datasets.

Responding

to

the

growing

need

for

better

interfaces

to

improve

the

utility

of

the

public

datasets,

we

have

designed

and

developed

a

new

web-based

visual

interface

entitled

GeneShelf

It

builds

upon

a

zoomable

grid

display

to

represent

two

categorical

dimensions.

It

also

incorporates

an

augmented

timeline

with

expandable

time

points

that

better

shows

multiple

data

values

for

the

focused

time

point

by

embedding

bar

charts.

We

applied

GeneShelf

to

one

of

the

largest

microarray

datasets

generated

to

study

the

progression

and

recovery

process

of

injuries

at

the

spinal

cord

of

mice

and

rats.

We

present

a

case

study

and

a

preliminary

qualitative

user

study

with

biologists

to

show

the

utility

and

usability

of

GeneShelf.

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

bioinformatics visualization
animation
gene expression profiling


automatic generation of application specific processors An application-specific instruction-set processor (ASIP) is ideally suited for embedded applications that have demanding performance, size, and power requirements that cannot be satisfied by a general purpose processor. ASIPs also have time-to-market and programmability advantages when compared to custom ASICs. The AutoTIE system simplifies the creation of ASIPs by automatically enhancing a base processor with application specific instruction set architecture (ISA) extensions, including instructions, operations, and register files. The new instructions, operations, and register files are automatically recognized and exploited by the entire software tool chain, including the C/C++ compiler. Thus, taking advantage of the generated ASIP does not require any changes to the application or any assembly language coding. AutoTIE uses the C/C++ compiler to analyze an application, and based on the analysis generates thousands, or even millions, of possible ISA extensions for the application. AutoTIE then uses performance and hardware estimation techniques to combine the ISA extensions into a large number of potential ASIPs, and for a range of hardware costs, chooses the ASIP that provides the maximum performance improvement. For example, for an application performing a radix-4 FFT, AutoTIE considers over 34,000 potential sets of ISA extensions. For hardware costs ranging from 7800 gates to 128,000 gates, AutoTIE combines these extensions to form 31 ASIPs, which provide performance improvements ranging from a factor of 1.12 to a factor of 11.3 compared to a general-purpose processor.

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

requirements applications generation analysis performance general processor factor asips language size architecture custom instruction power hardware

estimates
examples
market
software tools
extensibility
timing
change
automatic instruction-set generation
configurable processors
systems
extensible processors
code
operability
compilation
assemblers
register file
embedding
programmer


A comparison of centralized and distributed meta-scheduling architectures for computation and communication tasks in Grid networks The management of Grid resources requires scheduling of both computation and communication tasks at various levels. In this study, we consider the two constituent sub-problems of Grid scheduling, namely: (i) the scheduling of computation tasks to processing resources and (ii) the routing and scheduling of the data movement in a Grid network. Regarding computation tasks, we examine two typical online task scheduling algorithms that employ advance reservations and perform full network simulation experiments to measure their performance when implemented in a centralized or distributed manner. Similarly, for communication tasks, we compare two routing and data scheduling algorithms that are implemented in a centralized or a distributed manner. We examine the effect network propagation delay has on the performance of these algorithms. Our simulation results indicate that a distributed architecture with an exhaustive resource utilization update strategy yields better average end-to-end delay performance than a centralized architecture. (C) 2009 Elsevier B.V. All rights reserved.

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

grid networks
task scheduling
routing and data scheduling

centralized vs. distributed architecture


temporal index sharding for space-time efficiency in archive search Time-travel queries that couple temporal constraints with keyword queries are useful in searching large-scale archives of time-evolving content such as the web archives or wikis. Typical approaches for efficient evaluation of these queries involve slicing either the entire collection [20] or individual index lists [10] along the time-axis. Both these methods are not satisfactory since they sacrifice compactness of index for processing efficiency making them either too big or, otherwise, too slow. We present a novel index organization scheme that shards each index list with almost zero increase in index size but still minimizes the cost of reading index entries during query processing. Based on the optimal sharding thus btained, we develop a practically efficient sharding that takes into account the different costs of random and sequential accesses. Our algorithm merges shards from the optimal solution to allow for a few extra sequential accesses while gaining significantly by reducing the number of random accesses. We empirically establish the effectiveness of our sharding scheme with experiments over the revision history of the English Wikipedia between 2001-2005 (approx 700 GB) and an archive of U.K. governmental web sites (approx 400 GB). Our results demonstrate the feasibility of faster time-travel query processing with no space overhead.

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


Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints The second-order cone program (SOCP) is an optimization problem with second-order cone (SOC) constraints and has achieved notable developments in the last decade. The classical semi-infinite program (SIP) is represented with infinitely many inequality constraints, and has been studied extensively so far. In this paper, we consider the SIP with infinitely many SOC constraints, called the SISOCP for short. Compared with the standard SIP and SOCP, the studies on the SISOCP are scarce, even though it has important applications such as Chebychev approximation for vector-valued functions. For solving the SISOCP, we develop an algorithm that combines a local reduction method with an SQP-type method. In this method, we reduce the SISOCP to an SOCP with finitely many SOC constraints by means of implicit functions and apply an SQP-type method to the latter problem. We study the global and local convergence properties of the proposed algorithm. Finally, we observe the effectiveness of the algorithm through some numerical experiments.

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

semi-infinite programming
second-order cone constraints
sqp-type method


Decoding the Structure of the WWW: A Comparative Analysis of Web Crawls The understanding of the immense and intricate topological structure of the World Wide Web (WWW) is a major scientific and technological challenge. This has been recently tackled by characterizing the properties of its representative graphs, in which vertices and directed edges are identified with Web pages and hyperlinks, respectively. Data gathered in large-scale crawls have been analyzed by several groups resulting in a general picture of the WWW that encompasses many of the complex properties typical of rapidly evolving networks. In this article, we report a detailed statistical analysis of the topological properties of four different WWW graphs obtained with different crawlers. We find that, despite the very large size of the samples, the statistical measures characterizing these graphs differ quantitatively, and in some cases qualitatively, depending on the domain analyzed and the crawl used for gathering the data. This spurs the issue of the presence of sampling biases and structural differences of Web crawls that might induce properties not representative of the actual global underlying graph. In short, the stability of the widely accepted statistical description of the Web is called into question. In order to provide a more accurate characterization of the Web graph, we study statistical measures beyond the degree distribution, such as degree-degree correlation functions or the statistics of reciprocal connections. The latter appears to enclose the relevant correlations of the WWW graph and carry most of the topological information of the Web. The analysis of this quantity is also of major interest in relation to the navigability and searchability of the Web.

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

measurement
web graph structure
web measurement
crawler biases


The 2-path-bipanconnectivity of hypercubes In this paper, we introduce the concept of the k-path-(bi)panconnectivity of (bipartite) graphs. It is a generalization of the (bi)panconnectivity and of the paired many-to-many k-disjoint path cover. The 2-path-bipanconnectivity with only one exception of the n-cube Q(n) (n >= 4) is proved. Precisely, the following result is obtained: In an n-cube with n >= 4 given any four vertices u(1), v(1), u(2), v(2) such that two of them are in one partite set and the another two are in the another partite set. Let s = t = 5 if C = u(1)u(2)v(1)v(2) is a cycle of length 4, and s = d(u(1), v(1)) + 1 and t = d(u(2), v(2)) + 1 otherwise, where d(u, v) denotes the distance between two vertices u and v. And let i and j be any two integers such that both i - s >= 0 and j - t >= 0 are even with i + j <= 2(n). Then there exist two vertex-disjoint (u(1), v(1))-path P and (u(2), v(2))-path R with vertical bar V(P)vertical bar = i and vertical bar V(R)vertical bar = j. As consequences, many properties of hypercubes, such as bipanconnectivity, bipanpositionable bipanconnectivity [18], bipancycle-connectivity [12], two internally disjoint paths with two given lengths, and the 2-disjoint path cover with a path of a given length [21], follow from our result. (C) 2013 Elsevier Inc. All rights reserved.

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

hypercube
hamiltonian path
panconnectivity
k-path-panconnectivity
k-disjoint path cover
interconnection network


reducing pressure in bounded dbt code caches Dynamic binary translators (DBT) have recently attracted much attention for embedded systems. The effective implementation of DBT in these systems is challenging due to tight constraints on memory and performance. A DBT uses a software-managed code cache to hold blocks of translated code. To minimize overhead, the code cache is usually large so blocks are translated once and never discarded. However, an embedded system may lack the resources for a large code cache. This constraint leads to significant slowdowns due to the retranslation of blocks prematurely discarded from a small code cache. This paper addresses the problem and shows how to impose a tight size bound on the code cache without performance loss. We show that about 70\% of the code cache is consumed by instructions that the DBT introduces for its own purposes. Based on this observation, we propose novel techniques that reduce the amount of space required by DBT-injected code, leaving more room for actual application code and improving the miss ratio. We experimentally demonstrate that a bounded code cache can have performance on-par with an unbounded one.

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

system-on-chip
footprint reduction
code generation
dynamic binary translation


The Simplicity and Power model for inductive inference With this paper we wish to present a simplicity (informally 'simple explanations are the best') formalism that is easily and directly applicable to modeling problems in cognitive science. While simplicity has been extensively advocated as a psychologically relevant principle, a general modeling formalism has been lacking. The Simplicity and Power model (SP) is a particular simplicity-based framework, that has been supported in machine learning (Wolff, Unifying computing and cognition: the SP theory and its applications, 2006). We propose its utility in cognitive modeling. For illustration, we provide SP demonstrations of the trade-off between encoding with whole exemplars versus parts of stimuli in learning and the effect of wide versus narrow distributions in categorization. In both cases, SP computations show how simplicity can account for these contrasts, in terms of how the frequency of individual exemplars in training compares to the frequency of their constituent parts.

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

simplicity
cognitive science
categorization
learning


hybrid real-coded mutation for genetic algorithms applied to graph layouts In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem. We introduce several forms of mutation, some of which being specific to this problem, and show that the choice of this operator can have a great impact on the performance of the algorithm.

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


Steady flow around and through a permeable circular cylinder The steady flow around and through a porous circular cylinder was studied numerically. The effects of the two important parameters, the Reynolds and Darcy numbers, on the flow were investigated in details. The recirculating wake existing downstream of the cylinder is found to either penetrate into or be completely detached from the cylinder. It is also found that, contrary to that of the solid cylinder, the recirculating wake develops downstream of or within the porous cylinder, but not from the surface of it. These new findings provide additional evidence to Leal's conclusion (Leal LG. Vorticity transport and wake structure for bluff bodies at finite Reynolds number. Phys Fluids A 1989;1:124) that the appearance of recirculating wakes at finite Reynolds number is due to vorticity accumulation, but not a result of the same physical phenomena associated with separation in boundary layers in adverse pressure gradients. Also presented in the current study are the variation of the critical Reynolds number for the onset of a recirculating wake as a function of Darcy number and the variation of a newly defined parameter, the penetration depth, as a function of the Reynolds number and Darcy number. (C) 2010 Published by Elsevier Ltd.

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

fluid-porous interface
permeable cylinder
detached recirculating wake


Minimax mixed integer symmetric duality for multiobjective variational problems A MondWeir type multiobjective variational mixed integer symmetric dual program over arbitrary cones is formulated. Applying the separability and generalized F-convexity on the functions involved, weak, strong and converse duality theorems are established. Self duality theorem is proved. A close relationship between these variational problems and static symmetric dual minimax mixed integer multiobjective programming problems is also presented.

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

multiobjective symmetric duality
variational problem
mixed integer programming
efficient solutions
generalized f-convexity


Speeding up PEEC partial inductance computations using a QR-based algorithm The partial element equivalent circuit (PEEC) approach has been used in different forms for the computation of equivalent circuit elements for quasi-static and full-wave electromagnetic models. In this paper, we focus on the topic of large scale inductance computations. For many problems as part of PEEC modeling, partial inductances need to be computed to model interactions between a large numbers of objects. These computations can be very time and memory consuming. To date, several techniques have been devised to reduce the memory and time required to compute the partial inductance entities, as well as-the time required to use them in a circuit analysis compute step. Some of the existing methods use hierarchical compression while some others are based on issues like properties of the inverse of the partial inductance matrix. However, because of inherent limitations, most of these methods are less suitable for PEEC applications. In this, paper, we present an approach which is based on the compression of the partial inductance matrix utilizing the QR decomposition of the far coefficients submatrices. The QR-de-composed form is represented as a compressed SPICE-compatible circuit. This yields an efficient and mathematically consistent approach for reducing the storage and time requirements.

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

partial element equivalent circuit (peec)


Statistical multiplexing of self-similar traffic with different QoS requirements We study the statistical multiplexing performance of selfsimilar traffic. We consider that input streams have different QoS (Quality of Service) requirements such as loss and delay jitter. By applying the FBM (fractal Brownian motion) model, we present methods of estimating the effective bandwidth of aggregated traffic. We performed simulations to evaluate the QoS performances and the bandwidths required to satisfy them. The comparison between the estimation and the simulation confirms that the estimation could give rough data of the effective bandwidth. Finally, we analyze the bandwidth gain with priority multiplexing against non-prioritized multiplexing and suggest how to get better performance with the fight configuration of QoS parameters.

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

statistical multiplexing
qos
delay jitter
effective bandwidth

self-similar traffic
long-range dependence


Transmission loss allocation based on optimal power flow and sensitivity analysis This paper presents a new approach to the transmission loss allocation problem in a deregulated system. This approach belongs to the set of incremental methods. It treats all the constraints of the network, i.e. control, state and functional constraints. The approach is based on the perturbation of optimum theorem. From a given optimal operating point obtained by the optimal power flow the loads are perturbed and a new optimal operating point that satisfies the constraints is determined by the sensibility analysis. This solution is used to obtain the allocation coefficients of the losses for the generators and loads of the network. Numerical results show the proposed approach in comparison to other methods obtained with well-known transmission networks, IEEE 14-bus. Other test emphasizes the importance of considering the operational constraints of the network. And finally the approach is applied to an actual Brazilian equivalent network composed of 787 buses, and it is compared with the technique used nowadays by the Brazilian Control Center.

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


The Research of QoS Approach in Web Servers Proportional Delay Guarantee has been widely used in the Web QoS service, and the most basic methods are the feedback of control theory and the predictive control of queuing theory. While the former belonging to passive control has a long setting time and imperfect real-time, the latter can not simulate the Web server queuing system well because of the model limitations. After the experimental verification and shortages analysis of the two methods, an improved approach is proposed in this paper. Based on the queuing feature of Web server and the HTTP 1.1 persistent connection, the improved approach predicts the delay by calculating the queue length and service rate and achieves the relative delay guarantee of different classes by adjusting their quota of worker threads. The experimental results demonstrate that the approach could maintain the relative delay guarantees well even in poor network environment and performs a much better superior compared with the traditional methods.

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

web server
proportional delay guarantee
predictive control