Formulation of the static frame problem This report describes a static framework validation challenge problem used in the SANDIA Validation Challenge Workshop, May 2123, 2006. The challenge problem has clear engineering character, is simple to state and allows many different approaches to solve it. The regulatory assessment problem is to estimate the probability of a given vertical displacement to exceed a prescribed threshold.

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

model validation
uncertainty quantification
failure probability


Iterative methods for solving a system of variational inclusions involving H-eta-monotone operators in Banach spaces In this paper, we introduce and study a new system of variational inclusions involving H-eta-monotone operators in Banach space. Using the resolvent operator associated with H-eta-monotone operators, we prove the existence and uniqueness of solutions for this new system of variational inclusions. We also construct a new algorithm for approximating the solution of this system and discuss the convergence of the sequence of iterates generated by the algorithm. (C) 2007 Elsevier Ltd. All rights reserved.

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

q-uniformly smooth space
h-eta-monotone operator
resolvent operator technique
system of variational inclusion
iterative algorithm


Application of GaborWigner transform to inspect high-impedance fault-generated signals The method facilitates the inspection of high-impedance fault-generated signals. A GaborWigner transform is used to explore the signals generated by high-impedance faults. This approach is useful to detect non-stationary signals.

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


Mitigating transient loops through interface-specific forwarding Under link-state routing protocols such as OSPF and ISIS, when there is a change in the topology, propagation of link-state advertisements, path recomputation, and updating of forwarding tables (FIBs) will all incur some delay before traffic forwarding can resume on alternate paths. During this convergence period, routers may have inconsistent views of the network, resulting in transient forwarding loops. Previous remedies proposed to address this issue enforce a certain order among the nodes in which they update their FIBs. While such approaches succeed in avoiding transient loops, they incur additional message overhead and/or increased convergence delay. We explore an alternative approach, loopless interface-specific forwarding (LISF), that mitigates transient loops by forwarding a packet based on both its incoming interface and destination address. LISF needs to compute and update interface-specific instead of interface-independent forwarding tables. But it requires neither the synchronization of FIB updates at different nodes nor the modification of the existing link-state routing mechanisms. LISF is easily deployable with current routers if they already maintain a FIB at each interface for lookup efficiency. This paper presents the LISF approach, illustrates its strengths and limitations, discusses four alternative implementations of it and evaluates their performance.

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

link state routing
interface-specific forwarding


Construction of solutions for the shallow water equations by the decomposition method This paper deals with the implementation of Adomian's decomposition method for the variable-depth shallow water equations with source term. Using this method, the solutions were calculated in the form of a convergent power series with easily computable components. The convergence of the method is illustrated numerically. (C) 2004 IMACS. Published by Elsevier B.V. All rights reserved.

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

the adomian decomposition method
shallow watere quations
soliton solutions
conservation laws


Learning curves for processes generating defects requiring reworks The earliest learning curve; i.e., of Wright [J. Aeronaut. Sci. 3 (1936) 122], representation is a geometric progression that expresses the decreasing time required to accomplish a repetitive operation. The theory in its most popular form states that as the total quantity of units produced doubles, the time per unit declines by some constant percentage. Wright's model assumes that all units produced are of acceptable quality. However, in many practical situations, there is a possibility that the process goes out-of-control, thus, producing defective items that need to be reworked. Then, the rework time per unit must be accounted for when measuring the learning curve. This paper does so, and a modification of Wright's learning curve is presented for processes that generate defects that can be reworked. However, it worth mentioning that the work presented herein has two limitations. Firstly, this paper does not apply to cases when defects are discarded. Secondly, this paper assumes the rate of generating defects is constant, which means that the production process does not benefit from any changes for eliminating the defects. Analytical results show that the learning curve, under some conditions, could be of a convex form. Furthermore, this paper provides a plausible explanation to the plateauing phenomenon that intrigued several researchers.

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

wright's learning curve
process and product quality


Labeling points with given rectangles In this paper, we consider the following problem: Given n pairs of a point and an axis-parallel rectangle in the plane, place each rectangle at each point in order that the point lies on the corner of the rectangle and the rectangles do not intersect. If the size of the rectangles may be enlarged or reduced at the same factor, maximize the factor. This paper generalizes the results of Formann and Wagner [Proc. 7th Annual ACM Symp. on Comput. Geometry (SoCG'91), 1991, pp. 281-288]. They considered the uniform squares case and showed that there is no polynomial time algorithm less than 2-approximation. We present a 2-approximation algorithm of the non-uniform rectangle case which runs in 0(n(2) log n) time and takes 0(n(2)) space. We also show that the decision problem can be solved in 0(n log n) time and space in the RAM model by transforming the problem to a simpler geometric problem. (C) 2003 Elsevier B.V. All rights reserved.

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

approximation algorithms
computational geometry
map labeling


a hybrid model for capturing implicit spatial knowledge This paper proposes a machine learning-based approach for capturing rules embedded in users' movement paths while navigating in Virtual Environments (VEs). It is argued that this methodology and the set of navigational rules which it provides should be regarded as a starting point for designing adaptive VEs able to provide navigation support. This is a major contribution of this work, given that the up-to-date adaptivity for navigable VEs has been primarily delivered through the manipulation of navigational cues with little reference to the user model of navigation.

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

connectionism
implicit knowledge elicitation
user modelling
virtual reality


local redundant polymorphism query elimination Dynamic polymorphism is a powerful yet costly feature of object-oriented programming languages. To improve performance, several techniques have been developed to simplify or remove polymorphism operations when they are not needed. However, these techniques have little effect on sites that are actively polymorphic. In this paper we present an alternate approach to the optimization of operations such as virtual dispatches and type tests. Rather than attempt to eliminate the polymorphism mechanism, we identify situations where resolved type and method information can be shared across multiple polymorphism operations. In short, we perform a partial redundancy elimination transform over the loads and tests that constitute polymorphism queries. We describe the realization of our technique in the Jikes RVM and present its effects on the DACAPO and SPECJVM98 benchmarks. Rigorous measurements show a mean improvement, including several statistically significant results, over a configuration with no dispatch optimization and over one that employs guarded inlining. We underscore the potential of our approach by demonstrating speedups of up to 14\% on a highly polymorphic benchmark. Our results show the approach is both successful and complementary to techniques that focus on degenerate polymorphism.

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


approximating center points with iterated radon points We describe a practical and provably good algorithm for approximating center points in any number of dimensions. Here c is a center point of a point set P in R d if every closed halfspace containing c contains at least P / d+1 points of P . Our algorithm has a small constant factor and is the first approximate center point algorithm whose complexity is subexponential in d . Moreover, it can be optimally parallelized to require O log 2 d log log n time. Our algorithm has been used in mesh partitioning methods, and has the potential to improve results in practice for constructing weak &egr;-nets and other geometric algorithms. We derive a variant of our algorithm with a time bound fully polynomial in d , and show how to combine our approach with previous techniques to compute high quality center points more quickly.

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

point complexity algorithm practical factor


rewriting of rules containing set terms in a logic data language ldl We propose compilation methods for supporting set terms in Horn clause programs, without using general-purpose set matching algorithms, which tend to run in times exponential in the size of the participating sets Instead, we take the approach of formulating specialized computation plans that, by taking advantage of information available in the given rules, limit the number of alternatives explored. Our strategy is to employ compile time rewriting techniques and to transform the problem into an ordinary Horn clause compilation problem, with minimal additional overhead. The execution cost of the rewritten rules is substantially lower than that of the original rules and the additional cost of compilation can thus be amortized over many executions

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

language size computation matching data compilation logic cost rules minimal

program rewrite strategies method general algorithm informal transformation


Groups of congruences and restriction matrices Let Omega be a domain of the Euclidean space R-m sent onto itself by a finite group G of congruences. In this paper we first define M elementary restriction matrices related to the group G and to a system of irreducible matrix representations of G. We then describe a general procedure to generate M restriction matrices for any finite-dimensional space V(Omega) of real functions defined on Omega, when V(Omega) is invariant with respect to G. The number M depends only on the group G. Restriction matrices for the space V(Omega) have a block structure and all blocks can be obtained as from an elementary restriction matrix. Restriction matrices related to V(Omega) define a decomposition of V(Omega) as the sum of M subspaces. Finally, owing to restriction matrices, we propose a result of decomposition for linear systems. Several examples are 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

elementary restriction matrix
matrix representations


A high-order WENO finite difference scheme for the equations of ideal magnetohydrodynamics We present a high-order accurate weighted essentially non-oscillatory (WENO) finite difference scheme for solving the equations of ideal magnetohydrodynamics (MHD). This scheme is a direct extension of a WENO scheme, which has been successfully applied to hydrodynamic problems. The WENO scheme follows the same idea of an essentially non-oscillatory (ENO) scheme with an advantage of achieving higher-order accuracy with fewer computations. Both ENO and WENO can be easily applied to two and three spatial dimensions by evaluating the fluxes dimension-by-dimension. Details of the WENO scheme as well as the construction of a suitable eigen-system, which can properly decompose various families of MHD waves and handle the degenerate situations, are presented. Numerical results are shown to perform well for the one-dimensional Brio-Wu Riemann problems, the two-dimensional Kelvin-Helmholtz instability problems, and the two-dimensional Orszag-Tang MHD vortex system. They also demonstrate the importance of maintaining the divergence free condition for the magnetic field in achieving numerical stability. The tests also show the advantages of using the higher-order scheme. The new 5th-order WENO MHD code can attain an accuracy comparable with that of the second-order schemes with many fewer grid points. (C) 1999 Academic Press.

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


analysis of real-time programs with simple time petri nets We present a first report on our PARTS toolset for the automated static analysis of real-time systems. The PARTS toolset is based upon a timed extension of Petri nets. Our simple time Petri nets or STP nets are specifically aimed at facilitating real-time analysis. Our analysis approach uses the state space of an STP net in order to answer queries about the concurrency and timing behavior of the corresponding system. An attractive feature of STP nets is that they support a variety of techniques for controlling the number of states that must be explicitly enumerated. These techniques were originally defined for the analysis of concurrency properties of untimed systems, and in this paper we discuss the extension of each to the timed domain. We also report on some preliminary experimental results that we obtained by running our toolset on examples of real-time systems.

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

order examples systems space analysis behavior concurrency support queries timing paper feature

program
experimentation
real-time system
static analysis
extensibility
real-time
automation
control


Formal Security Treatments for IBE-to-Signature Transformation: Relations among Security Notions In a seminal paper of identity based encryption (IBE), Boneh and Franklin [6] mentioned an interesting transform from an IBE scheme to a signature scheme, which was observed by Moni Naor. In this paper, we give formal security treatments for this transform and discover several implications and separations among security notions of IBE and transformed signature. For example, we show for such a successful transform, one-wayness of IBE is an essential condition. Additionally, we give a sufficient and necessary condition for converting a semantically Secure IBE scheme into ail existentially unforgeable signature scheme. Our results help establish strategies on design and automatic security proof of signature schemes from (possibly weak) IBE schemes. we also show some separation results which strongly support that one-wayness, rather than semantic security, of IBE captures an essential condition to achieve secure signature.

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

identity based encryption
security notions


the use of virtual interface for inter-technology handoffs and multihoming in proxy mobile ipv6 Proxy Mobile IPv6 has been standardized by the IETF recently. It is a network-based mobility management protocol based on Mobile IPv6. There is significant interest from various standards bodies for its adoption in 4G networks as the key mobility management protocol. It is being seen as the protocol for achieving a common mobile core network, accommodating various access technologies such as Wi-MAX, 3GPP and 3GPP2 radio networks. One of the key aspects of the protocol is the support for inter-technology handoffs. The Proxy Mobile IPv6 network allows the mobile node to perform handoff between different access technologies and the network will ensure the terminal obtains the same address configuration as before. However there is no study on the required software function on the host for performing inter-technology handoffs and with the goal of session survivability across handoffs. This paper analyses from the mobile node s perspective on the potential approaches for achieving this and without requiring any changes to the host. It explores the use of Virtual Interface support available in Linux as one of the approaches and demonstrates that it is a simple host configuration and does not require any host stack changes. It also provides the results from the handoff experiments.

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

proxy mobile ipv6
multihoming
virtual interface


Prototype optimization for nearest-neighbor classification A novel neuralnet-based method of constructing optimized prototypes for nearest-neighbor classifiers is proposed. Based on an effective classification oriented error function containing class classification and class separation components, the corresponding prototype and feature weight update rules are derived. The proposed method consists of several distinguished properties. First, not only prototypes but also feature weights are constructed during the optimization process. Second, several instead of one prototype not belonging to the genuine class of input sample x are updated when x is classified incorrectly. Third, it intrinsically distinguishes different learning contribution from training samples, which enables a large amount of learning from constructive samples, and limited learning from outliers. Experiments have shown the superiority of this method compared with LVQ2 and other previous works.

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

classification oriented error function neural networks


Multistability and Multiperiodicity for a Class of CohenGrossberg BAM Neural Networks with Discontinuous Activation Functions and Time Delays In this paper, a general class of CohenGrossberg bidirectional associative memory neural networks (CGBAMNNs) with time-varying delays, distributed delays and discontinuous activation functions is investigated. By partitioning the state space, employing analysis approach and Cauchy convergence principle, sufficient conditions are established for the existence and local exponential stability of multiple equilibrium points, which ensure that \(2n\)-dimensional CGBAMNNs with \(k\)-level discontinuous activation functions can have \(k^n\) equilibrium points. As an extension of multistability, sufficient conditions are obtained to ensure the existence of \(k^n\) locally exponentially stable periodic orbits of the system when time-varying delays and external inputs are periodic. Finally, three examples are given to illustrate the feasibility and application of the obtained results.

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

multistability
multiperiodicity
exponential stability

cohengrossberg bam neural network
discontinuous activation function


From situation calculus to fluent calculus: State update axioms as a solution to the inferential frame problem Successor state axioms provide a solution to the famous Frame Problem as far as the representational aspect is concerned. Solving in classical, monotonic logic the additional inferential Frame Problem, on the other hand, was the major motivation for the development of the Fluent Calculus a decade or so ago. Yet the expressiveness of the latter in comparison to the Situation Calculus remained a largely open question until today In this note, we derive a novel version of the Fluent Calculus by gradually applying the principle of reification to successor state axioms in order to address the inferential Frame Problem without losing the representational merits. Our approach results in a fully mechanic method for the generation of state update axioms from any collection of Situation Calculus-style effect axioms for deterministic actions, provided the actions do not have potentially infinitely many effects. The axiomatization thus obtained is proved essentially equivalent to the corresponding axiomatization which uses successor state axioms. (C) 1999 Elsevier Science B.V. All rights reserved.

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


Internet Economics: The Use of Shapley Value for ISP Settlement Within the current Internet, autonomous ISPs implement bilateral agreements, with each ISP establishing agreements that suit its own local objective to maximize its profit. Peering agreements based on local views and bilateral settlements, while expedient, encourage selfish routing strategies and discriminatory interconnections. From a more global perspective, such settlements reduce aggregate profits, limit the stability of routes, and discourage potentially useful peering/connectivity arrangements, thereby unnecessarily balkanizing the Internet. We show that if the distribution of profits is enforced at a global level, then there exist profit-sharing mechanisms derived from the coalition games concept of Shapley value and its extensions that will encourage these selfish ISPs who seek to maximize their own profits to converge to a Nash equilibrium. We show that these profit-sharing schemes exhibit several fairness properties that support the argument that this distribution of profits is desirable. In addition, at the Nash equilibrium point, the routing and connecting/peering strategies maximize aggregate network profits and encourage ISP connectivity so as to limit balkanization.

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

isp settlement
nash equilibrium
shapley value


A model for the evolution of concrete deterioration due to reinforcement corrosion One of the most crucial factors affecting the service life of reinforced concrete (RC) structures attacked by aggressive ions is reinforcement corrosion. As the steel corrosion progresses, crack propagation in concrete medium endangers the serviceability and the strength of RC structural members. In this study, a nonlinear mathematical model for determining the displacement and stress fields in RC structures subjected to reinforcement corrosion is introduced. For corrosion products, a nonlinear stress-strain relation which has been previously confirmed by experimental data is incorporated in the present analysis. In formulation of the governing equations for steel-rust-concrete composite, the rational behavior of corrosion products and penetration of rust into the microcracks are considered. An analytical approach as well as an innovative meshless method, gradient reproducing kernel particle method (GRKPM), are employed for solving the nonlinear boundary value problem. A reasonably good agreement between the results of the two methods is achieved. The performance of the proposed model is then investigated through various comparisons of predicted values with experimentally observed data, and again good agreement is obtained. Moreover, the effects of the crucial parameters associated with the mechanical behavior of rust and concrete on time to cover cracking and some measures of deterioration are studied for different values of rust penetration into the microcracks. (C) 2010 Elsevier Ltd. All rights reserved.

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

gradient reproducing kernel particle method (grkpm)


Testing the congruence of d-demensional point sets This paper presents an algorithm that tests the congruence of two sets of n points in 1 d-dimensional space in O(n([1/3d]) log n) time. This improves the previous best algorithm for dimensions d greater than or equal to 6.

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

computational geometry
shape matching
symmetry


Implementation of an intelligent control system using fuzzy ITI This paper proposes a new multi-strategy (hybrid) intelligent control technique whose concept is applicable to the control of a wide range of processes. The proposed technique uses Incremental Tree Induction (ITI) as the learning algorithm, and incorporates fuzzy logic to deal with uncertainties apparent in the process to be controlled. ITI operates solely on symbolic fuzzy knowledge, as both the input features (data obtained from the process to be controlled) and the output decisions of the intelligent controller are described by fuzzy linguistic variables. Fuzzy associative memories (FAMs) are employed to store and manage the fuzzy knowledge, and are simulated operationally by fuzzy binary decision trees which encode the input-output space. The main novelty of this approach is the automatic synthesis (both off-line and on-line) of multi-dimensional FAMs front inception, ill contrast to the manual implementation of traditional FAMs. A second important advantage is the self-explanatory nature of the FAMs (and their underlying control laws) generated by this approach. The new technique is demonstrated in its application to the intelligent navigation of a mobile robot.

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

adaptive fuzzy associative memories
decision tree fuzzy controller
hybrid fuzzy controller


A hybrid scatter search/electromagnetism meta-heuristic for project scheduling In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively small instances. In this paper, we present a new meta-heuristic for this problem, able to provide near-optimal heuristic solutions for relatively large instances. The procedure combines elements from scatter search, a generic population-based evolutionary search method, and from a recently introduced heuristic method for the optimisation of unconstrained continuous functions based on an analogy with electromagnetism theory. We present computational experiments on standard benchmark datasets, compare the results with current state-of-the-art heuristics, and show that the procedure is capable of producing consistently good results for challenging instances of the resource-constrained project scheduling problem. We also demonstrate that the algorithm outperforms state-of-the-art existing heuristics.

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

project scheduling
heuristics
scatter search
electromagnetism


Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring Chen et al., conjectured that for r?3, the only connected graphs with maximum degree at most r that are not equitably r-colorable are Kr, r (for odd r) and Kr + 1. If true, this would be a joint strengthening of the HajnalSzemerdi theorem and Brooks' theorem. Chen et al., proved that their conjecture holds for r = 3. In this article we study properties of the hypothetical minimum counter-examples to this conjecture and the structure of optimal colorings of such graphs. Using these properties and structure, we show that the ChenLihWu Conjecture holds for r?4. 2011 Wiley Periodicals, Inc. J Graph Theory 71:3148, 2012

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


Optimal linear estimators for systems with multiple random measurement delays and packet dropouts This article is concerned with the optimal linear estimation problem for linear discrete-time stochastic systems with possible multiple random measurement delays and packet dropouts, where the largest random delay is limited within a known bound and packet dropouts can be infinite. A new model is constructed to describe the phenomena of multiple random delays and packet dropouts by employing some random variables of Bernoulli distribution. By state augmentation, the system with random delays and packet dropouts is transferred to a system with random parameters. Based on the new model, the least mean square optimal linear estimators including filter, predictor and smoother are easily obtained via an innovation analysis approach. The estimators are recursively computed in terms of the solutions of a Riccati difference equation and a Lyapunov difference equation. A sufficient condition for the existence of the steady-state estimators is given. An example shows the effectiveness of the proposed algorithms.

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

optimal linear estimators
random measurement delays
packet dropouts
bernoulli distribution
innovation analysis approach


Cost of ownership model for the RFID logistics system applicable to u-city Currently, popular areas of radio frequency identification (RFID) application include the domain of ubiquitous city (u-city), which would require very high initial infrastructure cost. This study proposes a cost of ownership (COO) model for RFID logistics system applicable to u-city in order to support the decision making process of infrastructure construction. We apply the proposed model to a case of RFID logistics system by establishing potential scenarios. The expected profit from the construction of RFID logistics system is evaluated for each scenario. We also conduct a sensitivity analysis to consider the effect of various parameter settings. This study is expected to help companies in selecting the most beneficial and most profitable RFID logistics system.

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

ubiquitous city (u-city) logistics
radio frequency identification (rfid)
cost of ownership (coo)


Characterizations of ordered semigroups by the properties of their fuzzy ideals In this paper we characterize different classes of ordered semigroups by the properties of their ideals, quasi-ideals and bi-ideals. We also characterize these classes by the properties of their fuzzy ideals, fuzzy quasi-ideals and fuzzy bi-ideals.

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

intra-regular and right weakly regular ordered semigroups


New General Constructions of LCZ Sequence Sets Based on Interleaving Technique and Affine Transformations In this paper, we propose four new general constructions of LCZ/ZCZ sequence sets based on interleaving technique and affine transformations. A larger family of LCZ/ZCZ sequence sets with longer period are generated by these constructions, which are more flexible among the selection of the alphabet size, the period of the sequences and the length of LCZ/ZCZ, compared with those generated by the known constructions. Especially, two families of the newly constructed sequences can achieve or almost achieve the theoretic bound.

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

quasi-synchronous code-division multiple access (qs-cdma)


Approximation algorithms for submodular set cover with applications The main problem considered is submodular set cover, the problem of minimizing a linear function under a nondecreasing submodular constraint, which generalizes both well-known set cover and minimum matroid base problems. The problem is NP-hard, and two natural greedy heuristics are introduced along with analysis of their performance. As applications of these heuristics we consider various special cases of submodular set cover, including partial cover variants of set cover and vertex cover, and node-deletion problems for hereditary and matroidal properties. An approximation bound derived for each of them is either matching or generalizing the best existing bounds.

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

set cover
approximation algorithms
greedy heuristics


SiliconOMOsilicon superlattice The success of heterojunction quantum wells and quantum dots in IIIVs has not been extended to silicon because the ideal barrier, SiO2, is amorphous, preventing the formation of quantum structures with silicon. The possibility of a few monolayers of oxide inserted between adjacent silicon layers was proposed and realized with a superlattice (SL) structure consisting of SiSiOSiSiSi, having a monolayer of oxygen in each period introduced by adsorption onto the 21 reconstructed surface along the Si(100). Reduction of the period leads to a slight up-shift of the energy of the emitted light, indicating that the essential objective of boosting the optical transition by promoting direct transitions has not been realized. Annealing in H2+O2 results in significant improvement in PL and EL, showing that specific defects, e.g., SiO complexes may be responsible for the observed light emission. The role of SiO complex being the origin of emission is further supported by the observation that the emission of visible light from polycrystalline Si and SiO2 structure is similar to the epitaxial superlattice with oxygen. The computed strain in a new type of superlattices consisting of SiO2, and GeO2 is much lower than the SiO SL. The EL in SiO superlattice with the use of a Schottky barrier to provide electronhole accumulation allows double injection into states higher in energy than the bandgap of Si, a prerequisite for injection laser without the need to use a wide-band pn-junction.

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


Towards semantic-driven, flexible and scalable framework for peering and querying e-catalog communities Given that e-catalogs are often autonomous and heterogeneous, effectively integrating and querying them is a delicate and time-consuming task. More importantly, the number of e-catalogs to be integrated and queried may be large and continuously changing. Conventional approaches where the development of an integrated e-catalog requires the understanding of each of the underlying catalog are inappropriate. In this paper, we use the concept of e-catalog communities and peer relationships among them to facilitate the querying of a potentially large number of dynamic e-catalogs. E-catalog communities are essentially containers of related e-catalogs. We propose a flexible and user-centric query matching algorithm that exploits both community descriptions and peer relationships to find e-catalogs that best match a user query. The user query is formulated using a description of a given community. (c) 2005 Elsevier B.V. All rights reserved.

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

e-catalogs communities
p2p and networked data management
semantic web
query rewriting
description logics


Neural control of rhythmic arm movements In this paper we present an approach to robot arm control based on exploiting the dynamical properties of a simple neural network oscillator circuit coupled to the joints of an arm. The entrainment and input/output properties of the oscillators are used to perform a variety of tasks with the same architecture, without any modeling of the arm or its environment. The approach is implemented on two real robot arms, and has been used to tune into the resonant frequency of pendulums, perform multi-joint coordinated motion by turning cranks, and exploit the dynamics of a `Slinky' toy to coordinate the motion of two arms. By exploiting the coupling between the physical arm and the neural oscillator, a range of complex behaviors can be achieved with a very simple system.

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

oscillator
neural control
neural network


Remarks on the k-error linear complexity of p(n)-periodic sequences Recently the first author presented exact formulas for the number of 2(n)-periodic binary sequences with given 1-error linear complexity, and an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error linear complexity, k >= 2, of a random 2(n)-periodic binary sequence. A crucial role for the analysis played the Chan-Games algorithm. We use a more sophisticated generalization of the Chan-Games algorithm by Ding et al. to obtain exact formulas for the counting function and the expected value for the 1-error linear complexity for p(n)-periodic sequences over F-p,p prime. Additionally we discuss the calculation of lower and upper bounds on the k-error linear complexity of p(n)-periodic sequences over F-p.

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

k-error linear complexity
chan-games algorithm
periodic sequences
stream cipher


MatchIt: Nonparametric Preprocessing for Parametric Causal Inference MatchIt implements the suggestions of Ho, Imai, King, and Stuart (2007) for improving parametric statistical models by preprocessing data with nonparametric matching methods. MatchIt implements a wide range of sophisticated matching methods, making it possible to greatly reduce the dependence of causal inferences on hard-to-justify, but commonly made, statistical modeling assumptions. The software also easily fits into existing research practices since, after preprocessing data with MatchIt, researchers can use whatever parametric model they would have used without MatchIt, but produce inferences with substantially more robustness and less sensitivity to modeling assumptions. MatchIt is an R program, and also works seamlessly with Zelig.

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

matching methods
causal inference
preprocessing
r


On estimation of the Poisson parameter in zero-modified Poisson models For count data, typically, a Poisson model is assumed. However, it has been observed in various applications that this model does not fit, because of too few or too many zeros in the data. For the latter case the zero-inflated Poisson (regression) model has been proposed. In situations where, for certain reasons, no zeros at all can be observed, the zero-truncated Poisson (regression) model is appropriate. This paper provides an EM algorithm for ML estimation of the latter model by standard software for Poisson regression. It is shown, that this algorithm can be used also to estimate the Poisson parameters of zero-inflated, zero-deflated, and standard Poisson models, when the zero observations are ignored. If nothing is known about the kind of zero modification, the respective estimates are fully efficient. Situations are described, in which the loss of efficiency is small although knowledge of the kind of zero modification is available. In a second step, the respective estimates of the Poisson parameter can be used to analyze the kind of zero modification and to estimate the zero modification parameter.

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

zero-modified poisson model
zero-truncated poisson model
zero-inflated poisson model
zero-deflated poisson model


low-power current-mode transceiver for on-chip bidirectional buses This paper presents a current-mode signalling scheme for bidirectional long on-chip interconnects. The transceiver has been fabricated in 180nm CMOS process. Features of the proposed scheme are driver pre-emphasis and low impedance termination. While no extra repeater is needed for line lengths up to 8mm long the scheme improves the delay by 34\% for 2mm-8mm long lines, compared to bidirectional voltage-mode links. The scheme also improves the power performance for line lengths longer than 2mm, operating at data rates higher than 180Mbps. Measurement results show that delay and power-delay product improve by 18\% and 3.7x, respectively, compared to simulation results of the voltage-mode scheme.

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

current-mode signaling
driver pre-emphasis


a simulation based study of tlb performance This paper presents the results of a simulation-based study of various translation lookaside buffer (TLB) architectures, in the context of a modern VLSI RISC processor. The simulators used address traces, generated by instrumented versions of the SPEC marks and several other programs running on a DECstation 5000. The performance of two-level TLBs and fully-associative TLBs were investigated. The amount of memory mapped was found to be the dominant factor in TLB performance. Small first-level FIFO instruction TLBs can be effective in two level TLB configurations. For some applications, the cyles-per-instruction (CPI) loss due to TLB misses can be reduced from as much as 5CPI to negligible levels with typical TLB parameters through the use of variable-sized pages.

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

processor translation applications traces use simulation factor performance context instruction paper

variability program association architecture addressing configurability memorialized version buffers effect


by-passing the out-of-order execution pipeline to increase energy-efficiency Out-of-order execution significantly increases the performanceof superscalar processors. The out-of-order execution mechanismis, however, energy-inefficient, which inhibits scaling superscalar processorsto high issue widths and large instruction windows. In this paper, we build on the observation that between 19\% and 36\% of the instructions are immediately ready for execution, even before entering the issue queue. Yet, these instructions proceed to the energy-consuming steps ofinstruction wake-up and select and they needlessly occupy space in theissue queue. To save energy, we propose for these instructions to by-pass the out-of-order execution core. Instead, we execute them on an energy-efficient single-issue in-order by-pass pipeline.The by-pass pipeline executes a significant fraction of all instructions,allowing performance-energy trade-offs with respect to the issue width of the out-of-order pipeline and to the issue queue size.By making these trade-offs, we show energy reductions of 53\% for the issue queue, 33\% for the register file and 31\% in the write-back and wake-up logic. Performance remains almost unaffected.

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

out-of-order execution
instruction wake-up
energy-efficiency
instruction scheduling


Impact of dummy metal filling strategy dedicated to inductors integrated in advanced thick copper RF BEOL A complete strategy to manage dummy fills inside a large spectrum of integrated RF inductors realized in an advanced thick copper RF back end of line (BEOL) is presented here. The main motivation of this paper is first to evaluate through a design of experiment (DOE) modeling, the impact on RF inductor performances of dummy metal fills inserted inside the coils, and then determine the right metal fill density to insert in order to be compliant with Digital metal density rules without degrading their electrical performances.

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

cmos technology
chemicalmechanical polishing process
metal dummy fills
q-factor


Numerical integration in statistical decision-theoretic methods for robust design optimization The Bayes principle from statistical decision theory provides a conceptual framework for quantifying uncertainties that arise in robust design optimization. The difficulty with exploiting this framework is computational, as it leads to objective and constraint functions that must be evaluated by numerical integration. Using a prototypical robust design optimization problem, this study explores the computational cost of multidimensional integration (computing expectation) and its interplay with optimization algorithms. It concludes that straightforward application of standard off-the-shelf optimization software to robust design is prohibitively expensive, necessitating adaptive strategies and the use of surrogates.

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

bayes principle
robust design optimization
multidimensional integration


Increasing task consolidation efficiency by using more accurate resource estimations We proposed an algorithm that can balance two conflicting criteria. We described three prediction techniques and a scalable scheduling heuristic. We investigate the behavior of several eviction strategies. We described a simulation framework to test the effectiveness of our approach.

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

online scheduling
cloud computing
forecasting
resource provisioning
constraint programming


Cloud-based decision support systems and availability context: the probability of successful decision outcomes In an age of cloud computing, mobile users, and wireless networks, the availability of decision support related computing resources can no longer guarantee five-nines (99.999%) availability. Since the dependence on decision support systems is ever increasing, obtaining accurate deterministic advice from these systems will become critical. This study proposes a probabilistic model that maps decision resource availability to correct decision outcomes. Grounded in system reliability theory, the probability functions are given and developed. The model is evaluated with a simulated decision opportunity and the outcome of the experimentation is quantified using a goodness of fit measure and ANOVA testing.

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

context aware computing
availability awareness


Power-aware localized routing in wireless networks Recently, a cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortest-cost routing algorithms, assuming constant transmission power. Power-aware metrics, where transmission power depends on distance between nodes and corresponding shortest power algorithms were also recently proposed. We define a new power-cost metric based on the combination of both node's lifetime and distance-based power metrics. We investigate some properties of power adjusted transmissions and show that, if additional nodes can be placed at desired locations between two nodes at distance d, the transmission power can be made linear in d as opposed to d(alpha) dependence for alpha > 2. This provides basis for power, cost, and power-cost localized routing algorithms where nodes make routing decisions solely on the basis of location of their neighbors and destination. The power-aware routing algorithm attempts to minimize the total power needed to route a message between a source and a destination. The cost-aware routing algorithm is aimed at extending the battery's worst-case lifetime at each node. The combined power-cost localized routing algorithm attempts to minimize the total power needed and to avoid nodes with a short battery's remaining lifetime. We prove that the proposed localized (where each node makes routing decisions based solely on the location of itself, its neighbors, and destination) power, cost, and power-cost efficient routing algorithms are loop-free and show their efficiency by experiments.

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


On using a modified Legendre-spectral method for solving singular IVPs of Lane-Emden type In this paper, approximate solutions of singular initial value problems (IVPs) of the Lane-Emden type in second-order ordinary differential equations (ODEs) are obtained by an improved Legendre-spectral method. The Legendre-Gauss points are used as collocation nodes and Lagrange interpolation is employed in the Volterra term. The results reveal that the method is effective, simple and accurate. (C) 2010 Elsevier Ltd. All rights reserved.

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

lane-emden equation
legendre-spectral method


Identification of 26RFa from Frog Brain: A Novel Hypothalamic Neuropeptide with Orexigenic Activity in Mammals Abstract: In the present study, we report the identification, in the frog brain, of a novel neuropeptide, termed 26RFa, that belongs to the RFamide peptide family. The cDNAs encoding the precursors for 26RFa have been characterized in human and rats. In rats, prepro-26RFa mRNA is expressed exclusively in two hypothalamic nuclei involved in the control of feeding behavior. Intracerebroventricular injection of 26RFa in mice induced a dose-dependent increase in food consumption. Taken together, these data indicate that 26RFa is a novel neuropeptide that may have important biological functions in vertebrates.

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

neuropeptide
rfamide peptide
mammals
brain
feeding


An investigation into two bin packing problems with ordering and orientation implications This paper considers variants of the one-dimensional bin packing (and stock cutting) problem in which both the ordering and orientation of items in a container influences the validity and quality of a solution. Two new real-world problems of this type are introduced, the first that involves the creation of wooden trapezoidal-shaped trusses for use in the roofing industry, the second that requires the cutting and scoring of rectangular pieces of cardboard in the construction of boxes. To tackle these problems, two variants of a local search-based approximation algorithm are proposed, the first that attempts to determine item ordering and orientation via simple heuristics, the second that employs more accurate but costly branch-and-bound procedures. We investigate the inevitable trade-off between speed and accuracy that occurs with these variants and highlight the circumstances under which each scheme is advantageous.

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


Matrix games with interval data The conventional game theory is concerned with how rational individuals make decisions when they are faced with known payoffs. In the real world, sometimes the payoffs are not known and have to be estimated, and sometimes the payoffs are only approximately known. This paper develops a solution method for the two-person zero-sum game where the payoffs are imprecise and are represented by interval data. Since the payoffs are imprecise, the value of the game should be imprecise as well. A pair of two-level mathematical programs is formulated to obtain the upper bound and lower bound of the value of the game. Based on the duality theorem and by applying a variable substitution technique, the pair of two-level mathematical programs is transformed to a pair of ordinary one-level linear programs. Solving the pair of linear programs produces the interval of the value of the game. It is shown that the two players in the game have the same upper bound and lower bound for the value of the imprecise game. An example illustrates the whole idea and sheds some light on imprecise game. (C) 2008 Elsevier Ltd. All rights reserved.

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


Unified computational methods for regression analysis of zero-inflated and bound-inflated data Bounded data with excess observations at the boundary are common in many areas of application. Various individual cases of inflated mixture models have been studied in the literature for bound-inflated data, yet the computational methods have been developed separately for each type of model. In this article we use a common framework for computing these models, and expand the range of models for both discrete and semi-continuous data with point inflation at the lower boundary. The quasi-Newton and EM algorithms are adapted and compared for estimation of model parameters. The numerical Hessian and generalized Louis method are investigated as means for computing standard errors after optimization. Correlated data are included in this framework via generalized estimating equations. The estimation of parameters and effectiveness of standard errors are demonstrated through simulation and in the analysis of data from an ultrasound bioeffect study. The unified approach enables reliable computation for a wide class of inflated mixture models and comparison of competing models.

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

generalized estimating equation
mixture model
quasi-newton
tobit model
two-part model


A Multi-Performance Processor for Reducing the Energy Consumption of Real-Time Embedded Systems This paper proposes an energy efficient processor which can be used as a design alternative for the dynamic voltage scaling (DVS) processors in embedded system design The processor consists of multiple PE (processing element) cores and a selective set associative cache memory The PE cores have the same instruction set architecture but differ in their clock speeds and energy consumptions Only a single PE core is activated at a time and the other PE cores are deactivated using clock gating and signal gating techniques The major advantage over the DVS processors is a small overhead for changing its performance The gate level simulation demonstrates that our processor can change its performance within 1 5 microsecond and dissipates about 10 nano joule while conventional DVS processors need hundreds of microseconds and dissipate a few micro joule for the performance transition This makes it possible to apply our multi performance processor to many real time systems and to perform finer grained and more sophisticated dynamic voltage control

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


On causal and semicausal codes for joint information embedding and source coding A source of random message bits is to be embedded into a covertext modeled as a discrete memoryless source (DMS), resulting in a stegotext from which the embedded bits should be recoverable. A causal code for such a scenario consists of an encoder that generates the stegotext as a causal function of the message bits and the covertext, and a decoder that reproduces the message bits as a causal function of the stegotext. A semicausal code, on the other hand, has an encoder that is causal only with respect to the covertext, and not necessarily with respect to the message, and has a possibly noncausal decoder. We analyze the possible tradeoffs among: a) the distortion between the stegotext and the covertext, b) the compressibility of the stegotext, and c) the rate at which random bits are embedded, that are achievable with causal and semicausal codes, with and without attacks on the stegotext. We also study causal and semicausal codes for the private version of the above scenario in which the decoder has access to the covertext. Connections are made with the causal rate-distortion function of Neuhoff and Gilbert, as well as the problem of channel coding with causal side information at the transmitter analyzed by Shannon.

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

causal codes
compression
minimax games
steganography
watermarking


Go anywhere: user-verifiable authentication over distance-free channel for mobile devices Current mobile technology gives us ubiquitous services with personal mobile devices such as smart phones, tablet PCs, and laptops. With these mobile devices, the human users may wish to exchange sensitive data with others (e.g., their friends or their colleagues) over a secure channel. Public key cryptography is a good solution for establishing this secure channel. However, it is vulnerable to man-in-the-middle attack, if the entities have no shared information. A number of techniques based on human-assisted out-of-band channels have been proposed to solve this problem. Unfortunately, these works have a common shortcoming: The human users must be colocated in close proximity. In this paper, we focus on how to construct a distance-free channel, which is not location-limited for establishing a secure channel between two users (devices). The proposed distance-free channel provides identification and authentication of the devices at the different locations using taken pictures or pre-stored images. The human user participates in the authentication process by sending and verifying an image. We describe the prototype implementation operated on a smart phone and show the experimental results when actually two smart phones share a common key using DiffieHellman key agreement over the proposed distance-free channel.

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

device pairing
user-verifiable authentication
steganography
authenticated key exchange
mobile phone security


Design of low power UWB LNA based on common source topology with current-reused technique This paper presents two low power UWB LNAs with common source topology. The power reduction is achieved by the current-reused technique. The gain and noise enhancement of the proposed circuit is based on an output buffer which is used by a common source amplifier with shuntshunt feedback. Chip1 is an adopted T-match input network of 50? matching in the required band. Measurements show that the S11 and S22 are less than ?10dB, and the maximum amplifier gain S21 gives 9.7dB, and the noise figure is 4.2dB, the IIP3 is ?8.5dBm, and the power consumption is 11mW from 1.1V supply voltage. The input matching of chip2 is adopted from a LC high pass filter and source degenerated inductor. The output buffer with the RC-feedback topology can improve the gain, increase the IIP3, restrain the noise, improve the noise figure and decrease the DC power dissipation. Measurements show 13.2dB of power gain, 3.33dB of noise figure, and the IIP3 is ?3.3dBm. It consumes 9.3mW from 1.5V supply voltage. These two chips are implemented in a 0.18?m TSMC CMOS process.

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

low noise amplifier (lna)
rf
ultra wide band (uwb)
current-reused technique


Latent class models for mixed variables with applications in archaeometry Latent class models are used in social sciences for classifying individuals or objects into distinct groups/classes based on responses to a set of observed indicators. The latent class model for mixed binary and metric variables (Br. J. Math. Statist. Psych. 49 (1996) 313) is extended to accommodate any type of data (including ordinal and nominal) and its use in Archaeometry for classifying archaeological findings/objects into groups is discussed. The models proposed are estimated using a full maximum like-lihood with the EM algorithm. Two data sets from archaeological findings are used to illustrate the methodology. (C) 2004 Elsevier B.V. All rights reserved.

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

latent class models
nominal
ordinal
em algorithm
archaeometry


Balancing performance and flexibility with hardware support for network architectures The goals of performance and flexibility are often at odds in the design of network systems. The tension is common enough to justify an architectural solution, rather than a set of context-specific solutions. The Programmable Protocol Processing Pipeline (P4) design uses programmable hardware to selectively accelerate protocol processing functions. A set of field-programmable gate arrays (FPGAs) and an associated library of network processing modules implemented in hardware are augmented with software support for function selection and composition, and applied to processing-intensive portions of a user-programmable protocol stack. The system is sufficiently flexible to support protocol stacks that are dynamically altered in reaction to changing network conditions or user needs. The P4 can be transparently inserted into a conventional protocol architecture, such as that of TCP/IP. This experimental demonstration shows that the P4' s programmability can be used to significantly improve the performance of TCP/IP under operating conditions where the protocol would perform poorly without augmentation. Generalizing from these experiments, the P4 is shown to have many applications as an open platform for implementing adaptive and programmable networks, and has illustrated new security issues that arise in FPGA-based architectures. The P4 and closely-related systems, such as network processors, are attractive architectural solutions to balancing performance and flexibility.

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

design
p4
hardware
performance
flexibility
protocol processing
programmable networks

experimentation
fpga
programmable logic devices
computer networking


Design space exploration of on-chip ring interconnection for a CPU-GPU heterogeneous architecture Incorporating a CPU architecture into CMP, which is more efficient with certain types of applications, is a popular architecture trend in recent processors. This heterogeneous mix of architectures will use an on-chip interconnection to access shared resources such as last-level cache tiles and memory controllers. The configuration of this on-chip network will likely have a significant impact on resource distribution, fairness, and overall performance. The heterogeneity of this architecture inevitably exerts different pressures on the interconnection due to the differing characteristics and requirements of applications running on CPU and GPU cores. CPU applications are sensitive to latency, while GPGPU applications require massive bandwidth. This is due to the difference in the thread-level parallelism of the two architectures. GPUs use more threads to hide the effect of memory latency but require massive bandwidth to supply those threads. On the other hand, CPU cores typically running only one or two threads concurrently are very sensitive to latency. This study surveys the impact and behavior of the interconnection network when CPU and GPGPU applications run simultaneously. Among our findings, we observed that significant interference exists between CPU and GPU applications and resource partitioning, in particular virtual and physical channel partitioning, shows effectiveness to solve the interference problem. Also, heterogeneous link configurations show promising results by optimizing traffic hotspots in the network. Finally, we evaluated different placement policies and found that how to place different components in the network significantly affects the performance. Based on these findings, we suggest an optimal ring interconnect network. Our study will shed light on other architectural interconnection studies on CPU-GPU heterogeneous architectures. (C) 2013 Elsevier Inc. All rights reserved.

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

heterogeneous architecture
design space exploration


Differentiation in the arched surface of packaging: Its influence on the findability of logo typography displays Packaging plays a role of protecting the product, attracting consumers attention, and communicating the products contents. Logo typography is the most important written information of packaging. Among the packaging forms of commodities in the market, cylindrical packaging is in the majority. In the condition that the commodities are highly homogenous, packaging design has become an important factor in marking their difference. For example, changing the arched surface of cylindrical packaging is one of the feasible schemes. However, will different arched surface designs in cylindrical packaging with varied font features affect consumers findability of the commodity? We investigated performance of the seven font features of logo typography combined with seven types of arched surface by means of experiment. The results of this study are as follows: (a) Interaction occurs between arched surface with different proportions and varied font features. (b) When logo typography is on the arched surface of a cylinder that has a ratio of horizontal axis to vertical axis between [3:5] and [2:5], varied font features will make significant difference in findability. (c) When the arched surface is greater (i.e. the ratio will become smaller, e.g., [2:5]), the oblong typography is superior to square typography ([Balloon Bd BT (e.g., )]). (d) Optimum findability and discerning performance are achieved when the font feature used is a sans serif structure with equal strokes in thickness, according to the design principle of logo typography. If logo typography is put on the arched surface of an outstanding cylinder (when the visible arched surface is narrower), the fonts with strokes and structure like Script should be avoided as much as possible to keep off low findability.

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

cylindrical packaging
arched surface
logo typography
findability


Time-critical on-demand data broadcast: Algorithms, analysis, and performance evaluation On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and deal with dynamic user access patterns. With the rapid growth of time-critical information services in emerging applications, there is an increasing need for the system to support timely data dissemination. This paper investigates online scheduling algorithms for time-critical on-demand data broadcast. We propose a novel scheduling algorithm called SIN-a that takes the urgency and number of outstanding requests into consideration. An efficient implementation of SIN-alpha is presented. We also analyze the theoretical bound of request drop rate when the request arrival rate rises toward infinity. Trace-driven experiments show that SIN-alpha significantly outperforms existing algorithms over a wide range of workloads and approaches the analytical bound at high request rates.

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

mobile computing
on-demand data broadcast
content delivery
time constraint


SMaRT: A novel framework for addressing range queries over nonlinear trajectories SMART supports range queries over nonlinear trajectories. It is an ideal platform for comparing the performance of indexing methods. It proves that the geometric dual approach is an efficient method. All operations and statistics are available through a user-friendly web 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 B O O O O O O O O O O O O O O O O O O O O O O O

spatiotemporal databases
data structures


Model selection for a medical diagnostic decision support system: a breast cancer detection case There are a number of different quantitative models that can be used in a medical diagnostic decision support system (MDSS) including parametric methods (linear discriminant analysis or logistic regression), non-parametric models (K nearest neighbor, or kernel density) and several neural network models. The complexity of the diagnostic task is thought to be one of the prime determinants of model selection. Unfortunately, there is no theory available to guide model selection. Practitioners are left to either choose a favorite model or to test a small subset using cross validation methods. This paper illustrates the use of a self-organizing map (SOM) to guide model selection for a breast cancer MDSS. The topological ordering properties of the SOM are used to define targets for an ideal accuracy level similar to a Bayes optimal level. These targets can then be used in model selection, variable reduction, parameter determination, and to assess the adequacy of the clinical measurement system. These ideas are applied to a successful model selection for a real-world breast cancer database. Diagnostic accuracy results are reported for individual models, for ensembles of neural networks, and for stacked predictors.

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

model selection
decision support system
neural network

self-organizing map
stacked generalization


Sustaining technological innovation: The example of videoconferencing in English Schools The main factors associated with technology integration have been the subject of research for over a decade. However, the conditions which sustain technological developments have been less frequently investigated. This paper explores this issue in the context of the use of videoconferencing in schools in England. The research took a multiple case-study approach by returning to schools with a reputation for demonstrating innovative policy and practice in videoconferencing, which were the subject of an earlier investigation. Analysis of developments in the interim five-year period led to the construction of a five-level typology of change. Further analysis identified critical dimensions associated with the sustainability of videoconferencing. These included technical and structural factors, as well as policy frameworks and personnel status. The perceived usefulness and relevance of videoconferencing as a learning technology emerges as a central determinant of sustainability, with the conclusion that for policymakers and schools, videoconferencing has become an orphan technology.

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


Multiband segmentation based on a hierarchical Markov model We develop a new multiscale Markov segmentation model for multiband images. Using quadtree multiple resolution analysis of a multiband image, we use both inter- and intra-scale spatial Markov statistical dependencies. Bayesian inference is used to assess the appropriate number of segments. We exemplify the excellent results which can be obtained with this approach using synthetic images, and in two case studies involving multiband astronomical image sets.

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

multiband image
multiscale
quadtree
bayesian inference

multispectral image
multiresolution
markov random field
generalized gaussian distribution
bayes factor
bayes information criterion


Information, decision-making and deception in games Modeling deception in a real-world conflict situation is usually difficult. For a better understanding, we study deception through a fundamental relationship between information and decision-making. Under a probabilistic framework, we consider a zero-sum game with an asymmetrical structure, where player 1 receives additional information and player 2 has the potential to inject deception. We derive accuracy conditions on the information obtained by player 1, which can lead to a better decision. The feasibility of deception is further explored, which is conditioned on the quality of deceptive signals generated by player 2. We classify deception into passive and active deception.

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

decision-making
zero-sum game
nash equilibrium
mixed strategy


Software editions: An application of segmentation theory to the packaged software market Introducing multiple editions of the same software is a relatively recent innovation in the software market. The editions serve to differentiate among different user segments. Introduction of similar low- and high-end products in other markets has been analyzed using segmentation theory. However, the software market is fundamentally different from other product markets in two respects: (1) Software is characterized by negligible marginal production cost, and (2) the option of offering upgrades also exists. We analyze the problem of software introduction using segmentation theory. Our analysis shows that if cannibalization is low, the vendor should introduce the full software as one edition. This result differs from that obtained in prior research, which showed that the seller should introduce two distinct products in such cases. When cannibalization is high, introducing multiple editions simultaneously is optimal under a variety of conditions. The strategy of introducing a highend edition in the first period followed by the low-end edition in the second period is optimal only when the consumers are extremely impatient and the software is large. A significant result of our analysis is that offering upgrades is clearly superior to other strategies only in a very restricted range of parameters. Our analysis also suggests that the vendor's profit is higher when it announces the future strategy. Our theoretical results are supported by evidence from the software market.

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

economics of software
information goods
market segmentation
software marketing
software pricing


Towards transport-layer mobility: Evolution of SCTP multihoming Recently, growing availability of emerging wireless technologies has pushed the demand to integrate different wireless-network technologies such as: wireless local-area networks, cellular networks, and personal and short-range networks. The inter-working of heterogeneous radio access networks poses many technical challenges, with mobility management being one of the most important. In this paper we survey the existing proposals and show that transport-layer mobility is a viable candidate for implementing seamless handover in heterogeneous wireless access networks. Since the mobile Stream Control Transmission Protocol (mSCTP) is at the core of most relevant transport-layer mobility schemes being currently studied, we identify the key scenarios where the protocol can effectively leverage the multihoming feature to enhance handover support. Moreover, to provide the reader with a complete overview of the mSCTP's application area, we also survey the situations where the use of mSCTP-based schemes is not possible or has some limitations. Then, in one of the identified key scenarios, we investigate several challenging open issues related to path management and path-transition optimization by considering bandwidth-estimation schemes and link-layer support. Finally, we consider introducing concurrent multipath transfer (CMT) into mSCTP-based mobility schemes, as a future research direction. (C) 2008 Elsevier B.V. All rights reserved.

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

transport-layer mobility
handover management
bandwidth estimation


Multiscale Time Activity Data Exploration via Temporal Clustering Visualization Spreadsheet Time-varying data is usually explored by animation or arrays of static images. Neither is particularly effective for classifying data by different temporal activities. Important temporal trends can be missed due to the lack of ability to find them with current visualization methods. In this paper, we propose a method to explore data at different temporal resolutions to discover and highlight data based upon time-varying trends. Using the wavelet transform along the time axis, we transform data points into multiscale time series curve sets. The time curves are clustered so that data of similar activity are grouped together at different temporal resolutions. The data are displayed to the user in a global time view spreadsheet, where she is able to select temporal clusters of data points and filter and brush data across temporal scales. With our method, a user can interact with data based on time activities and create expressive visualizations.

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

wavelet
animation
clustering
visualization spreadsheet

time-varying
time histogram
filter banks
transfer function
k-means


even simple programs are hard to analyze It has long been known that most questions of interest about the behavior of programs are recursively undecidable. These questions include whether a program will halt, whether two programs are equivalent, whether one is an optimized form of another, and so on. On the other hand, it is possible to make some or all of these questions decidable by suitably restricting the computational ability of the programming language under consideration. The Loop language of Meyer and Ritchie [MR], for example, has a decidable halting problem, but undecidable equivalence. Restricting the computational ability still further, virtually all of these questions are decidable for finite automata and generalized sequential machines (except that Griffiths [Gri] has shown equivalence undecidable for nondeterministic gsms).A natural question to ask is how hard it is to solve these problems for programming languages for which they are decidable, and it is with this area that we are concerned in this paper. In particular we describe a programming language modeled on current higher-level languages which has exactly the computational power of deterministic finite state transducers with final states, and analyze the space and time required to decide various questions of programming interest about the language. We find that questions about halting, equivalence, and optimization are already intractable for this very simple language. We also study extensions to the language such as simple arithmetic capabilities, arrays, and recursive subroutines with both call-by-value and call-by-name parameter passing mechanisms, some of which extend the capabilities of the language and/or increase the complexity of its decidable problems. In one case, that of recursion with call-by-name, the previously decidable questions are seen to become undecidable.

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

program space language arrays power complexity

optimality
computation
data structures
extensibility
general
practical
class
programming language


Space Flight and Insulin-like Growth Factor-I Signaling in Rat Osteoblasts The primary culture of rat osteoblasts was treated with 1?,25 dihydroxyvitamin D3 and fixed with guanidine isothiocyanate solution during a space shuttle flight. The mRNA levels were analyzed by quantitative reverse transcription-polymerase chain reaction. Microgravity decreased the mRNA levels of insulin-like growth factor-I (IGF-I) and increased reciprocally the IGF-I receptor mRNA levels, as compared to the ground (1 g) control. Microgravity completely suppressed the mRNA expression of the insulin receptor substrate-1, the postreceptor signaling molecule of IGF-I. Microgravity might deteriorate the action and signaling of IGF-I in rat osteoblasts.

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


Minimizing weighted waiting time variance on a single processor This paper considers the problem of scheduling n non-preemptive jobs on a single processor. Each job may have different size and weight. The objective is to minimize the weighted waiting time variance (WWTV). It is shown that the proof of one previous established optimality property in the literature, called "agreeably weighted property", is wrong and the corrected proof is presented. Additional optimality properties are proved for the cases where job sizes are directly or inversely proportional to their weights, respectively. In addition, we show that the objective function of the problem can be expressed as a function of positional weights and processing times. With this new functional form, the proofs of several previously established optimality properties in the literature become rather straightforward. (C) 2011 Elsevier Ltd. All rights reserved.

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

weighted completion time variance
single processor scheduling


CHEERUP: A General Software-Environment for Building, Using and Administering Predictive Monitoring Portals The intended meaning of the term "predictive monitoring" used in the paper is the following. A population of subjects (living beings, machines, works of art, etc.) is monitored by a domain expert with regard to the possible occurrence of an undesired/desired event E. More precisely, an expert periodically (e.g. every two years, every week, etc. depending on the specific application) examines the single subjects and, for each of them, enters examination outcomes in a database where statistical data are automatically processed in order to produce probabilistic inferences about the occurrence in the future of E for the subject under examination (individualized prediction). This allows the expert to take suitable measures in advance in order to prevent/favour the occurrence of E for the subject. Such an approach to predictive monitoring requires that the expert who monitors subjects has at his/her disposal a suitable software system provided with database and algorithms for both properly managing monitoring-processes and producing probabilistic predictions. The paper presents CHEERUP : a prototype product, usable via Internet, that consists in a general software-environment for building, using and administering specific predictive monitoring software-systems (in the paper called portals).

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 applications
predictive models
learning systems
data processing


Quality-Driven Capacity-Aware Resources Optimization Design for Ubiquitous Wireless Networks In this paper, we propose a probability-statistical capacity-prediction scheme to provide probabilistic quality-of-service (QoS) guarantees under the high traffic load of IEEE 802.11 wireless multimedia Mesh networks. The proposed scheme perceives the state of wireless link based on the MAC retransmission statistics and calculates the statistical channel capacity especially under the saturated traffic load. Via a cross-layer design approach, the scheme allocates network resource and forwards data packets by taking the interference among flows and the channel capacity into consideration. Extensive experiments have been carried out on the basis of IEEE 802.11 protocols in order to demonstrate the superiority of the proposed scheme over the existing location-based QoS optimization delivery algorithm in terms of retransmission count, successful delivery rate, and end-to-end delay on the condition of time-varying multi-hop wireless links.

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

quality of service
capacity-aware
ieee 802.11 mac
cross-layer optimization