tight bounds for the partial-sums problem We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract group, we prove an ?(lg n ) lower bound on the number of algebraic operations that must be performed, matching a well-known upper bound. In the RAM model with b -bit memory registers, we consider the well-studied case when the elements of the array can be changed additively by ?-bit integers. We give a RAM algorithm that achieves a running time of ?(1 + lg n / lg( b / ?)) and prove a matching lower bound in the cell-probe model. Our lower bound is for the amortized complexity, and makes minimal assumptions about the relations between n , b , and ?. The best previous lower bound was ?(lg n = (lg lg n +lg b )), and the best previous upper bound matched only in the special case b = ?(lg n ) and ? = O (lg lg n ).

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

lower bound
matching
case
complexity
group
model
algorithm
online
minimal

probe
abstraction
arrays
operability
memorialized
timing
model of computation


A spectral approach to detecting subtle anomalies in graphs In this paper we investigate the problem of detecting small and subtle subgraphs embedded into a large graph with a common structure. We call the embedded small and subtle subgraphs as signals or anomalies and the large graph as background. Those small and subtle signals, which are structurally dissimilar to the background, are often hidden within graph communities and cannot be revealed in the graphs global structure. We explore the minor eigenvectors of the graphs adjacency matrix to detect subtle anomalies from a background graph. We demonstrate that when there are such subtle anomalies, there exist some minor eigenvectors with extreme values on some entries corresponding to the anomalies. Under the assumption of the ErdosRenyi random graph model, we derive the formula that show how eigenvector entries are changed and give detectability conditions. We then extend our theoretical study to the general case where multiple anomalies are embedded in a background graph with community structure. We develop an algorithm that uses the eigenvector kurtosis to filter out the eigenvectors that capture the signals. Our theoretical analysis and empirical evaluations on both synthetic data and real social networks show effectiveness of our approach to detecting subtle signals.

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

anomaly detection
spectral analysis
graph topology


Contributions to fuzzy analysis In some sense fuzzy analysis deviates highly from classical analysis needing its own specific notions. The main reason which causes this situation consists in the different algebraic and structure theoretic properties of the usual real numbers and fuzzy numbers. The paper, which is an extended version of [4], is devoted to this problem presenting some of these specific notions In particular, examples of proper fuzzy normed vector spaces and proper fuzzy normed algebras are given. (C) 1999 Elsevier Science B.V. All rights reserved.

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

fuzzy analogues of the euclidian space and the hilbert space l(2)


A novel online wavelength assignment algorithm in wavelength-convertible multi-granular optical networks As industrial technology gets more mature, a single fiber can offer more and more wavelengths. However, it also results in a large amount of switching ports at optical cross-connects (OXCs). Certainly, it is expected that higher and higher complexity is inevitable to control and manage such large OXCs. In this paper, we study the dynamic wavelength assignment problem in waveband switching (WBS) networks composed of multi-granular OXCs (MG-OXCs). Moreover, in order to relax the wavelength continuity constraint on lightpath establishments, each MG-OXC node is equipped with a certain number of converters. To efficiently minimize the extra port consumption and utilize wavelength converters, we proposed an online wavelength assignment algorithm named Least Weighted Configuration Cost (LWCC). For a new request, LWCC first adopts fixed routing and then exploits the layered-graph approach and a new cost function for edge weight assignment to determine adequate wavelength(s). The performance metrics of interest include both blocking performance and converter utilization. Numerical results show that LWCC is superior in waveband grouping and therefore results in significant performance gain in terms of blocking probability.

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

waveband switching (wbs)
optical cross-connect (oxc)
multi-granular oxc (mg-oxc)


A Framework to Assist Environmental Information Processing Scientists of the environmental domains (biology, geographical information, etc.) need to capitalize, distribute and validate their scientific experiments. A multi-function platform will be an adaptable candidate for meeting the challenges. We have designed and implemented the MDweb platform [3] which is nowadays used in various environmental projects. Our main objective is to integrate a workflow environment. In this paper, an introduction to a three-level workflow environment architecture (static, intermediate, dynamic) is presented. We focus on the "static" level, which concerns the first phase of constructing a business process chain, and discuss around the "intermediate" level, which covers both the instantiation of a business process chain and the validation, in terms of conformity, of the generated chain.

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

platform mdweb
meta description
scientific workflow
infrastructure
conformity checking


Regularity for nonlinear variational inequalities of hyperbolic type ? In this paper, we deal with the regularity for nonlinear variational inequalities of second order in Hilbert spaces with more general conditions on the nonlinear terms and without condition of the compactness of the principal operators. We also obtain the norm estimate of a solution of the given nonlinear equation on C([0,T];V)?C1((0,T];H)?C2((0,T];V?) C ( [ 0 , T ] ; V ) ? C 1 ( ( 0 , T ] ; H ) ? C 2 ( ( 0 , T ] ; V ? ) by using the results of its corresponding hyperbolic semilinear part.

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

hyperbolic type equation
nonlinear perturbation
wellposedness
analytic semigroup


Cross-entropy-based adaptive optimization of simulation parameters for Markovian-driven service systems Markov fluid models represent a general description of the process of service request arrivals to service systems. The solution of performance analysis problems incorporating them often calls for a simulation approach, for which a reference methodology is Importance Sampling. However, in this case the appropriate choice of the biasing conditions is a problem in itself. In this paper an iterative method based on the cross-entropy is proposed for this choice. The equations are given that allow to derive the biasing conditions from the simulation itself. The application of the proposed method to three different sample cases, referring to one transient scenario (finite time horizon and prescribed initial conditions) and two stationary cases, shows that the method is quite accurate and that during the path towards overflow the buffer fills mostly in the first phases.

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

cross-entropy
simulation techniques
rare event simulation


Affine invariant extended cyclic codes over Galois rings Recently, Blackford and Ray-Chaudhuri used transform domain techniques to permutation groups of cyclic codes over Galois rings. They used the same technique to rind a set of necessary and sufficient conditions for extended cyclic codes of length 2(m) over any subring of GR (4, m) to be affine invariant. Here, we use the same technique to find a set of necessary and sufficient conditions for extended cyclic codes of length p(m) over any subring of GR (p', m) to be affine invariant, for e = 2 with arbitrary p and for p = 2 with arbitrary e. These are used to find two new classes of affine invariant Bose-Chaudhuri-Hocquenghem (BCH) and generalized Reed-Muller (GRM) codes over Z(2e) for arbitrary e and a class of affine invariant BCH codes over Z(p2) for arbitrary prime p.

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

affine invariant codes
automorphism group
permutation group


Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms We consider a micro/nano fluidic toolbit that consists of a set of identical testing units, each of which contains a microchannel that has an array of equally spaced nanopores opened along it. In each microchannel, same equally spaced chemical liquid plugs shift back and forth under pneumatic pressure. Below each nanopore is a testing tube that accepts appropriate nanoscale chemical droplets from the microchannel above to perform biochemical tests. Each tube may require several different chemicals in sequence to get proper results. Liquid chemicals required in different tubes may be dropped simultaneously in a round if the liquid plug sequence in the microchannel above matches the chemical requirements in these tubes. The sizes of testing problems in terms of the numbers of tubes, liquid chemicals required in each tube and liquid plugs in the microchannel are large, efficient testing procedure requires careful round scheduling in order to shorten the testing time span. In this research, we model the biochemical test scheduling as the fixed plug sequence problem (FPSP), where the liquid plug layout in the microchannel is given. We show that the FPSP is NP-hard in general, and then develop both exact and heuristic algorithms. The computational performances of the proposed algorithms are provided and contrasted.

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

micro/nano biochemical testing
mathematical programming models


Detecting holes and antiholes in graphs In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices and m edges, our algorithms run in O(n + m(2)) time and require O(n m) space; we thus provide a solution to the open problem posed by Hayward et al. asking for an O(n(4))-time algorithm for finding holes in arbitrary graphs. The key element of the algorithms is the use of the depth-first-search traversal on appropriate auxiliary graphs in which moving between any two adjacent vertices is equivalent to walking along a P-4 (i.e., a chordless path on four vertices) of the input graph or on its complement, respectively. The approach can be generalized so that for a fixed constant k >= 5 we obtain an O(n(k-1))-time algorithm for the detection of a hole (antihole resp.) on at least k vertices. Additionally, we describe a different approach which allows us to detect antiholes in graphs that do not contain chordless cycles on five vertices in O(n + m(2)) time requiring O(n + m) space. Again, for a fixed constant k >= 6, the approach can be extended to yield O(n(k-2))-time and O(n(2))-space algorithms for detecting holes (antiholes resp.) on at least k vertices in graphs which do not contain holes (antiholes resp.) on k - 1 vertices. Our algorithms are simple and can be easily used in practice. Finally, we also show how our detection algorithms can be augmented so that they return a hole or an antihole whenever such a structure is detected in the input graph; the augmentation takes O(n + m) time and space.

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


how some advice fails Video data for thirty-four cases of advice seeking, giving and following behavior at a graphical computer interface were analyzed in detail. The evidence indicated that clients followed prescriptive advice effectively and efficiently in slightly more than half the cases. For other cases, clients performed twice as many actions as needed in three times as much time and never reached prescribed states. A hypothesis that observed advice following difficulties were correlated with advice abstractness was not supported. Rather, it seems advice did not match well with clients' knowledge of the system in particular isolated details.

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

matching interfaces timing graphics systems abstraction action computation


Neural Encoding in the Orbitofrontal Cortex Related to Goal-Directed Behavior Research using laboratory animals, alongside clinical studies of human patients, support a role for the orbitofrontal cortex (OFC) in adaptive decision-making and goal-directed behavior. The functions of OFC neurons within this domain have been studied extensively in both rats and primates. Electrophysiological recordings during performance of relevant behavioral tasks provide a coherent portrait of OFC encoding that is reward related. OFC neurons represent associative relationships between events, encoding information that is predictive of outcome value. That encoding can be understood as a neural basis for deficits seen after OFC damage in the use of outcome expectancy to guide performance. There is less agreement, however, on whether OFC itself plays a role in translating information on outcome expectancy into the actual guidance of overt behavioral responding. New findings indicate that rat OFC neurons prominently encode additional task-related information and events related to goal-directed action. This encoding can occur in populations of OFC neurons that are independent of the OFC neurons representing reward value. The significance of this emerging evidence may require studies that address the larger scale network through which OFC integrates expected outcome information with behavioral control

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


A comparative study of optimal linear controllers for vibration suppression The performance enhancement of dynamic systems is accomplished by the application of active control components. Control strategies are derived to accomplish the task. Among the various control strategies, those that are designed to minimize a specified cost function while satisfying the necessary system constraints are referred to as optimal controllers. An important constraint is the amount of power and energy consumed by the control device. In this paper, the effect of optimal control strategies on the power and energy requirement of control devices is investigated.

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

feedback control
vibration control
optimization
vehicle suspension control


Cubic Pythagorean hodograph spline curves and applications to sweep surface modeling This article is devoted to cubic Pythagorean hodograph (PH) curves which enjoy a number of remarkable properties, such as polynomial arc-length function and existence of associated rational frames. First we derive a construction of such curves via interpolation of G1 Hermite boundary data with Pythagorean hodograph cubics. Based on a thorough discussion of the existence of solutions we formulate an algorithm for approximately converting arbitrary space curves into cubic PH splines, with any desired accuracy. In the second part of the article we discuss applications to sweep surface modeling. With the help of the associated rational frames of PH cubics we construct rational representations of sweeping surfaces. We present sufficient criteria ensuring G1 continuity of the sweeping surfaces. This article concludes with some remarks on offset surfaces and rotation minimizing frames.

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

pythagorean hodograph
spline
offset surfaces

hermite interpolation
approximation
sweeps


Fuzzy optimal solution of fully fuzzy linear programming problems using ranking function In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear programming (FFLP) problems with mixed constraints. By using the proposed method the fuzzy optimal solution of FFLP problems with mixed constraints occurring in real life situations can be easily obtained. To illustrate the proposed method a numerical example is solved. The proposed method can be easily applied to find the fuzzy optimal solution of FFLP problems occurring in real life situations.

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

fully fuzzy linear programming problems
ranking function


Extending the information delivery manual approach to identify information requirements for performance analysis of HVAC systems Heating, Ventilation and Air-Conditioning (HVAC) systems account for more than 15% of the total energy consumption in the US. In order to improve the energy efficiency of HVAC systems, researchers have developed hundreds of algorithms to automatically analyze their performance. However, the complex information, such as configurations of HVAC systems, layouts and materials of building elements and dynamic data from the control systems, required by these algorithms inhibits the process of deploying them in real-world facilities. To address this challenge, we envision a framework that automatically integrates the required information items and provides them to the performance analysis algorithms for HVAC systems. This paper presents an approach to identify and document the information requirements from the publications that describe these algorithms. We extend the Information Delivery Manual (IDM) approach so that the identified information requirements can be mapped to multiple information sources that use various formats and schemas. This paper presents the extensions to the IDM approach and the results of using it to identify information requirements for performance analysis algorithms of HVAC systems.

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

information delivery manual
hvac systems
performance analysis algorithms


Cellular disco: resource management using virtual clusters on shared-memory multiprocessors Despite the fact that large-scale shared-memory multiprocessors have been commercially available for several years, system software that fully utilizes all their features is still not available, mostly due to the complexity and cost of making the required changes to the operating system. A recently proposed approach, called Disco, substantially reduces this development cost by using a virtual machine monitor that leverages the existing operating system technology. In this paper we present a system called Cellular Disco that extends the Disco work to provide all the advantages of the hardware partitioning and scalable operating system approaches. We argue that Cellular Disco can achieve these benefits at only a small fraction of the development cost of modifying the operating system. Cellular Disco effectively turns a large-scale shared-memory multiprocessor into a virtual cluster that supports fault containment and heterogeneity, while avoiding operating system scalability bottlenecks. Yet at the same time, Cellular Disco preserves the benefits of a shared-memory multiprocessor by implementing dynamic, fine-grained resource sharing, and by allowing users to overcommit resources such as processors and memory. This hybrid approach requires a scalable resource manager that makes local decisions with limited information while still providing good global performance and fault containment. In this paper we describe our experience with a Cellular Disco prototype on a 32-processor SGI Origin 2000 system. We show that the execution time penalty for this approach is low, typically within 10% of the best available commercial operating system for most workloads, and that it can manage the CPU and memory resources of the machine significantly better than the hardware partitioning approach.

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

management
performance
fault containment

reliability
resource management
virtual machines
scalable multiprocessors


Variable-Density Parallel Imaging With Partially Localized Coil Sensitivities Partially parallel imaging with localized sensitivities is a fast parallel image reconstruction method for both Cartesian and non-Cartesian trajectories, but suffers from aliasing artifacts when there are deviations from the assumption of perfect localization. Such reconstructions would normally crop the individual coil images to remove the artifacts prior to combination. However, the sampling densities in variable-density k-space trajectories support different field-of-views for separate regions in k-space. In fact, the higher sampling density of low frequencies can be used to reconstruct a bigger field-of-view without introducing aliasing artifacts and the resulting image signal-to-noise ratio (SNR) can be improved. A novel, fast variable-density parallel imaging method is presented, which reconstructs different field-of-views from separate frequencies according to the local sampling density in k-space. Aliasing-suppressed images can be produced with high SNR-efficiency without the need for accurate estimation of coil sensitivities and complex or iterative computations.

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

aliasing artifact
self calibration
variable density


dynamic test input generation for web applications Web applications routinely handle sensitive data, and many people rely on them to support various daily activities, so errors can have severe and broad-reaching consequences. Unlike most desktop applications, many web applications are written in scripting languages, such as PHP. The dynamic features commonly supported by these languages significantly inhibit static analysis and existing static analysis of these languages can fail to produce meaningful results on realworld web applications. Automated test input generation using the concolic testing framework has proven useful for finding bugs and improving test coverage on C and Java programs, which generally emphasize numeric values and pointer-based data structures. However, scripting languages, such as PHP, promote a style of programming for developing web applications that emphasizes string values, objects, and arrays. In this paper, we propose an automated input test generation algorithm that uses runtime values to analyze dynamic code, models the semantics of string operations, and handles operations whose argument and return values may not share a common type. As in the standard concolic testing framework, our algorithm gathers constraints during symbolic execution. Our algorithm resolves constraints over multiple types by considering each variable instance individually, so that it only needs to invert each operation. By recording constraints selectively, our implementation successfully finds bugs in real-world web applications which state-of-the-art static analysis tools fail to analyze.

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

directed random testing
automatic test generation


The non-standard finite difference scheme for linear fractional PDEs in fluid mechanics A non-standard finite difference scheme is developed to solve the linear partial differential equations with time- and space-fractional derivatives. The GrunwaldLetnikov method is used to approximate the fractional derivatives. Numerical illustrations that include the linear inhomogeneous time-fractional equation, linear space-fractional telegraph equation, linear inhomogeneous fractional Burgers equation and the fractional wave equation are investigated to show the pertinent features of the technique. Numerical results are presented graphically and reveal that the non-standard finite difference scheme is very effective and convenient for solving linear partial differential equations of fractional order.

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

telegraph equation
wave equation
burgers equation

non-standard finite difference schemes
fractional differential equations


Electronic trading and the process of globalization in traditonal futures exchanges: a temporal perspective This paper develops a temporal perspective to examine information and communication technologies (ICT) adoption and processes of globalization. The foundations of our theoretical approach explicitly draw upon three intersecting planes of temporality implicit in structuration; namely reversibility, irreversibility and institutionalization. We further develop our theoretical perspective by extending the scope of structuration to incorporate temporal features of Adam's social theory on 'global time'. We then use this temporal perspective to examine the emergence of electronic trading and the process of globalization across London and Chicago futures exchanges. Our analysis provides insights into the IT-enabled reconfiguration of these exchanges during processes of reproduction and change associated with globalization. We conclude with some key implications for e-trading strategy and consider changes in trader work life associated with the adoption of e-trading.

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

electronic trading
adoption
time
globalization
futures exchanges

information and communications technology


The use of radial basis function networks (RBFN) to predict critical water parameters in desalination plants The quality of seawater is very important in the design of the pre-treatment unit of any desalination plant. It is worth noting that the operational parameters (salinity and TDS) depend on the seasons (dry or hurricane) such that they are not constants along all year. Recently, new studies indicate that the RBFN is a good tool for prediction of parameters such that the aim of this paper is to apply a RBFN approach as predictive model focus in the context of the Seawater in the Caribbean. The model is obtained taking into account the behaviour of salinity and total dissolved solids content according to the season (dry or hurricane season). The methodology is based on redistributions of centres to locations where input training data possess significant effects can lead to more efficient RBFN. The proposed method herein is based on clustering of input space vectors and computing weights of Euclidian distances and histogram equalization within each cluster will determine the centre and width of each receptive field. The results of this paper indicate that the parameters can change up to 30% along year and the accurate of the prediction obtained can be around 96.7%.

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


A hybrid global optimization approach for solvent design This paper presents a hybrid global optimization approach for solving solvent design problems modeled by mixed integer nonlinear programming (MINLP). The strategy incorporates a variant of the outer approximation mathematical programming algorithm and a soft computing global optimization approach, namely simulated annealing. The suggested approach is not provably globally optimal. However, computational experience with benchmark examples and solvent design MINLP models indicate strongly that the approach gives near globally optimal solutions. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

global optimization
simulated annealing
minlp

computer aided molecular design (camd)
outer approximation (oa)


a contents recommendation scheme using user's affection and shopping motive This paper proposes a contents recommendation scheme using user's affection and shopping motive to improve the accuracy of recommendation. In this paper, joy, sadness, anger, happiness, and relaxation are considered as the user's affection. And the user's shopping motive is classified into four types: low-utility/low-pleasure, low-utility/high-pleasure, highutility/low-pleasure, and high-utility/high-pleasure. experimental results show that the proposed scheme improves the accuracy of contents recommendation compared to the ecommendation without considering user's affection and shopping motive.

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


The frustrated and compositional nature of chaos in small Hopfield networks Frustration in a network described by a set of ordinary differential equations induces chaos when the global structure is such that local connectivity patterns responsible for stable oscillatory behaviours are intertwined, leading to mutually competing attractors and unpredictable itinerancy among brief appearance of these attractors. Frustration destabilizes the network and provokes an erratic `wavering' among the periodic saddle orbits which characterize the same network when it is connected in a non-frustrated way. The characterization of chaos as some form of unpredictable `wavering' among repelling oscillators is rather classical but the originality here lies in the identification of these oscillators as the stable regimes of the `non-frustrated' network. In this paper, a simple and small 6-neuron Hopfield network is treated, observed and analyzed in its chaotic regime. Given a certain choice of the network parameters, chaos occurs when connecting the network in a specific way (said to be `frustrated') and gives place to oscillatory regimes by suppressing whatever connection between two neurons. The compositional nature of the chaotic attractor as a succession of brief appearances of orbits (or parts of orbits) associated with the non-frustrated networks is evidenced by relying on symbolic dynamics, through the computation of Lyapunov exponents, and by computing the autocorrelation coefficients and the spectrum.

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

hopfield network
frustration
chaos
symbolic dynamics

immune network
biological networks
connectivity matrix
chaotic itinerancy


pairwise weak geometric consistency for large scale image search State-of-the-art image search systems mostly build on bag-of-features (BOF) representation. As BOF ignores geometric relationships among local features, geometric consistency constraints have been proposed to improve search precision. However, exploiting full geometric constraints are too computational expensive. Weak geometric constraints have strong assumptions and can only deal with uniform transformations. To handle view point changes and nonrigid deformations, in this paper we present a novel pairwise weak geometric consistency constraint (P-WGC) method. It utilizes the local similarity characteristic of deformations, and measures the pairwise geometric similarity of matches between two sets of local features. Experiments performed on four famous datasets and a dataset of one million of images show a significant improvement due to P-WGC as well as its efficiency. Further improvement of search accuracy is obtained when it is combined with full geometric verification.

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

geometric consistency constraints
image search


toward a cooperative network of time-shared computers Incompatible machines represent an old problem in the computer field. Very often, because of computer incompatibility, programs developed at one installation are not available to users of other installations. The same program may therefore have to be rewritten dozens of times.

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

sharing cooperation timing install computation


A simulated annealing heuristic for the team orienteering problem with time windows This paper presents a simulated annealing based heuristic approach for the team orienteering problem with time windows (TOPTW). Given a set of known locations, each with a score, a service time, and a time window, the TOPTW finds a set of vehicle tours that maximizes the total collected scores. Each tour is limited in length and a visit to a location must start within the locations service time window. The proposed heuristic is applied to benchmark instances. Computational results indicate that the proposed heuristic is competitive with other solution approaches in the literature.

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

team orienteering problem
time window
simulated annealing


Real-time coherent stylization for augmented reality This paper presents a new stylized augmented reality (AR) framework which can generate line drawing and abstracted shading styles. In comparison with the state-of-art work, our framework can significantly improve both the visual immersion of a single frame and the temporal coherence of augmented video streams in real time. In our framework, we first render virtual objects over the input camera images and then uniformly process the combined contents with stylization techniques. For generating line drawing stylization, we first propose a specially designed shading method to render the virtual objects, and then use an adapted Flow-based anisotropic Difference-of-Gaussion (FDoG) filter to yield the high-quality line drawing effect. For generating the abstracted stylization, a focus-guided diffusion filter and a soft color quantization operator are sequentially applied to the augmented image, and then the processed result is combined with the detected edges to produce the final abstraction effect. The presented algorithms are all sympathetic to highly parallel processing, allowing a real-time performance on contemporary graphics hardware.

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

stylization
augmented reality
line drawing
abstraction
coherent


Generalized Bonferroni mean operators in multi-criteria aggregation In this paper we provide a systematic investigation of a family of composed aggregation functions which generalize the Bonferroni mean. Such extensions of the Bonferroni mean are capable of modeling the concepts of hard and soft partial conjunction and disjunction as well as that of k-tolerance and k-intolerance. There are several interesting special cases with quite an intuitive interpretation for application. (C) 2010 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

aggregation operators
owa
means
composed aggregation function
k-intolerance
hard/soft partial conjunction


Erratum to Improving the dynamic measurements of ADCs using the 2-ADC method [Computer standard and interfaces vol. 22 issue 4, 281286] Testing high-resolution analog-to-digital converters (?12 bit) at high input frequencies (>5 MHz) becomes more difficult, because the disturbances of the automatic test equipment (ATE) become more significant. Although a lot of improvements have been made to modern ATEs during recent years, they are not sufficient, given the components specifications, especially the signal-to-noise ratio parameter (SNR). This paper briefly describes the errors of the converters, which have to be tested, and those introduced by the equipment. From this description, a model has been built to simulate a new method, based on the simultaneous measurement of two converters and intended to give an accurate estimation of the SNR removing the correlated disturbances. The simulation results show the potential benefits of the method, and eventually, the experimental results, in an industrial environment, are given and discussed.

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

analog-to-digital converter (adc)
jitter
aperture uncertainty
signal-to-noise ratio (snr)


Depth map super-resolution using stereo-vision-assisted model In this paper, we propose a novel Stereo-Vision-Assisted (SVA) model for depth map super-resolution. Given a low-resolution depth map as input, we recover a high-resolution depth map using the registered high-resolution color stereo image pair. First, based on the mutual benefits between raw depth map and features of high resolution color image, we model the relationship with two constraint terms of local and non-local priors and sufficiently explore their complementary nature. Moreover, by considering reliable disparity pixels calculated from stereo matching algorithm, we formulate a stereo disparity regularization term to further reinforce the preservation of fine depth detail. Hence, our SVA objective function includes a non-local prior constraint, a local prior constraint and a stereo disparity prior constraint. In addition, we employ an efficient algorithm to optimize the objective function. Experimental results demonstrate that our approach can obtain superior performance in comparison with other methods.

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

super-resolution
stereo vision
non-local prior


A rule-based expert system for inferring functional annotation Functional annotation aims to predict the biological function of DNA sequences. Automatic functional annotation is faster but less accurate than the manual one. INFAES is a rule-based expert system for functional annotation. INFAES combines biological knowledge with Bioinformatics heuristics. INFAES outcome is comparable to the best ranked tools in the CAFA experiment.

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


A resource and context model for mobile middleware Mobile computing systems should be self-managed to simplify operation and maintenance plus meet users expectation with respect to Quality of Service (QoS). When architecting self-managed mobile computing systems, one must take a holistic view on both QoS management and the entities in the mobile environment. This paper presents a novel model that includes both resources and context elements. To illustrate the usefulness of the model, it is applied to a video streaming application by: (1) modelling context elements and resources in the environment, (2) specifying context dependencies and QoS characteristics of the application, and (3) designing weakly integrated resource and context managers. We describe a middleware that uses the developed managers when evaluating context dependencies and predict offered QoS of alternative implementations of the application. In order to select the one that can operate in the current environment and that best satisfies given user preferences.

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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 model
mobile middleware
qos management

resource model
context management
qos specifications


Automatic speaker age and gender recognition using acoustic and prosodic level information fusion The paper presents a novel automatic speaker age and gender identification approach which combines seven different methods at both acoustic and prosodic levels to improve the baseline performance. The three baseline subsystems are (1) Gaussian mixture model (GMM) based on mel-frequency cepstral coefficient (MFCC) features, (2) Support vector machine (SVM) based on GMM mean supervectors and (3) SVM based on 450-dimensional utterance level features including acoustic, prosodic and voice quality information. In addition, we propose four subsystems: (1) SVM based on UBM weight posterior probability supervectors using the Bhattacharyya probability product kernel, (2) Sparse representation based on UBM weight posterior probability supervectors, (3) SVM based on GMM maximum likelihood linear regression (MLLR) matrix supervectors and (4) SVM based on the polynomial expansion coefficients of the syllable level prosodic feature contours in voiced speech segments. Contours of pitch, time domain energy, frequency domain harmonic structure energy and formant for each syllable (segmented using energy information in the voiced speech segment) are considered for analysis in subsystem (4). The proposed four subsystems have been demonstrated to be effective and able to achieve competitive results in classifying different age and gender groups. To further improve the overall classification performance, weighted summation based fusion of these seven subsystems at the score level is demonstrated. Experiment results are reported on the development and test set of the 2010 Interspeech Paralinguistic Challenge aGender database. Compared to the SVM baseline system (3), which is the baseline system suggested by the challenge committee, the proposed fusion system achieves 5.6% absolute improvement in unweighted accuracy for the age task and 4.2% for the gender task on the development set. On the final test set, we obtain 3.1% and 3.8% absolute improvement. respectively. (C) 2012 Elsevier Ltd. All rights reserved.

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

ubm weight posterior probability supervectors

age recognition
prosodic features
score level fusion


reifying wildcards in java using the ego approach Providing runtime information about generic types---that is, reifying generics---is a challenging problem studied in several research papers in the last years. However, the quest for finding effective and efficient solutions specifically targeted to the Java programming language is still open. In particular, the new mechanism of wildcards introduced in Java 5.0 significantly complicates the overall semantics of generics: its reification aspects are currently unexplored and pose serious implementation issues. In this paper we analyse such issues and study how they have been supported in the context of the EGO compiler. EGO is an approach for efficiently supporting runtime generics at compile-time in Java: synthetic code is automatically added to the source code by the compiler, so as to create generic runtime type information on a by-need basis, store it into object instances, and retrieve it when necessary in type-dependent operations. We show how the design of EGO has been completely and successfully extended to represent wildcard types, and how we deal with subtle issues concerning subtyping, capture conversion and wildcards capture in method calls.

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

java wildcards
java generics
variant parametric types


Path planning for autonomous vehicle based on heuristic searching using online images In automatic navigation of mobile systems, a path network is required to enable robot/vehicle autonomous motions. Path planning is considered as a significantly important part in creating the path network and thus to be a necessary task for any autonomous vehicle system. This paper proposes a method that constructs the shortest path for vehicle auto-navigation in outdoor environments. The method using two layers of GIS information of online map images, which support to estimate not only the shape of road network but also the directed road. This is also the advantage as compared to methods, which use only aerial/satellite images. Accomplishing the estimation according to the use of this application requires several stages as follows. First, a raw road network is detected using the road map and the satellite image. Second, the road network is refined and represented by a direct graph. Third, the road network is converted into the global coordinate, which is much more convenient for performing online auto-navigation task than the other types of coordinate. Finally, the shortest path for motion is estimated by heuristic searching method based on a hybrid algorithm that is originated from Dijkstra algorithm in a combination with greedy breadth-first search algorithm. The experimental results demonstrate robustness and effectiveness of the proposed method for path network estimation under large scenes of outdoor environments.

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

road network detection
autonomous navigation
the shortest path estimation
utm/wg84 coordinate system


On the Complexity of Optimal Hotlink Assignment The concept of hotlink assignment aims at reducing the navigation effort for users of a web directory or similar structure by inserting a limited number of additional hyperlinks called hotlinks. Given an access probability distribution of the leaves of the tree representing the web site, the goal of hotlink assignment algorithms is to minimize the expected path length between the root and the leaves. We prove that this optimization problem is NP-hard, even if only one outgoing hotlink is allowed for each node. This answers a question that has been open since the first formulation of the problem in Bose et al. (Proceedings of 11th International Symposium on Algorithms and Computation (ISAAC), 2000) nine years ago. In this work we also investigate the model where hotlinks are only allowed to point at the leaves of the tree. We demonstrate that for this model optimal solutions can be computed in O(n (2)) time. Our algorithm L-OPT also operates in a more general setting, where the maximum number of outgoing hotlinks is specified individually for each node. The runtime is then O(n (3)). Experimental evaluation shows that L-OPT terminates within less than one second on problem instances having up to half a million nodes.

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

search tree
decision tree
graph augmentation
web graph


Cell and gene therapy strategies for the treatment of postmyocardial infarction ventricular arrhythmias Ventricular arrhythmias in the setting of a healed myocardial infarction represent a major cause of morbidity and mortality. The underlying mechanism is the presence of slow conduction tissue within the infarct border zone. In the current review we describe experimental gene and cell therapy approaches targeting the electrophysiologic substrate of the border zone, with the aim of preventing postinfarction ventricular arrhythmias. These include strategies that aim to prevent reentry by improving conduction velocity or by prolonging refractoriness. Attempts to augment conduction velocity include cardiomyocyte transplantation to regenerate the infarct, overexpression of unique sodium channels (to improve excitability), and methods to improve cell-to-cell coupling. Strategies to prolong refractoriness include gene therapy to prolong action potential duration or cell therapy using engineered cell grafts transfected ex vivo to express unique potassium channels. Finally, we will also discuss the potential advantages and drawbacks of these strategies as well as a road map for future clinical use.

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

myocardial infarction
cell therapy
gene therapy

ventricular tachycardia
human embryonic stem cells
ion channels


0-Hecke algebra actions on coinvariants and flags The 0-Hecke algebra H n (0) is a deformation of the group algebra of the symmetric group \(\mathfrak{S}_{n}\). We show that its coinvariant algebra naturally carries the regular representation of H n (0), giving an analogue of the well-known result for \(\mathfrak{S}_{n}\) by ChevalleyShephardTodd. By investigating the action of H n (0) on coinvariants and flag varieties, we interpret the generating functions counting the permutations with fixed inverse descent set by their inversion number and major index. We also study the action of H n (0) on the cohomology rings of the Springer fibers, and similarly interpret the (non-commutative) HallLittlewood symmetric functions indexed by hook shapes.

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

0-hecke algebra
demazure operator
descent monomial
flag variety
halllittlewood function
ribbon number
springer fiber


Hazard Evaluation Support System (HESS) for predicting repeated dose toxicity using toxicological categories Repeated dose toxicity (RDT) is one of the most important hazard endpoints in the risk assessment of chemicals. However, due to the complexity of the endpoints associated with whole body assessment, it is difficult to build up a mechanistically transparent structure-activity model. The category approach, based on mechanism information, is considered to be an effective approach for data gap filling for RDT by read-across. Therefore, a library of toxicological categories was developed using experimental RDT data for 500 chemicals and mechanistic knowledge of the effects of these chemicals on different organs. As a result, 33 categories were defined for 14 types of toxicity, such as hepatotoxicity, hemolytic anemia, etc. This category library was then incorporated in the Hazard Evaluation Support System (HESS) integrated computational platform to provide mechanistically reasonable predictions of RDT values for untested chemicals. This article describes the establishment of a category library and the associated HESS functions used to facilitate the mechanistically reasonable grouping of chemicals and their subsequent read-across.

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

repeated dose toxicity
category approach
hazard evaluation support system


A design methodology for PC-expansion card development The development of PC-expansion cards has been an on-going process for which there are no existing formal methodologies. As newer buses emerge, the complexity of the hardware and software design increases. This paper aims to provide an integrated understanding of the hardware and software aspects involved in the development of expansion cards. A design architecture has been designed to guide such developments by encapsulating all the pertinent design factors into a layered model, known as the Adapter Development Model. The focus is on mitigation of the process complications, which have proven its prowess in disabling the successful completion of such projects that are subjected to manpower and time constraints. Concentration is placed on the PCI platform and an applicability example based on MPEG2 PCI design is considered.

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


An explicit algebraic Reynolds stress model in turbulence A new algebraic Reynold stress model is constructed with recourse to the realizability constraints. Model coefficients are made a function of strain and vorticity invariants through calibration by reference to homogeneous shear flow data. The anisotropic production in near-wall regions is accounted for substantially by modifying the model constants G(1,2) and adding a secondary source term in the e equation. Hence, it reduces the kinetic energy and length scale magnitudes to improve prediction of adverse pressure gradient flows, involving flow separation and reattachment. To facilitate the evaluation of the turbulence model, some extensively used benchmark cases in the turbulence modelling are convoked. The comparisons demonstrate that the new model maintains qualitatively good agreement with the direct numerical simulation (DNS) and experimental data. Copyright (c) 2006 John Wiley & Sons, Ltd.

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

realizability
flow separation and reattachment

turbulence anisotropy
production to dissipation ratio


Closure Operators and Lattices Derived from Concurrency in Posets and Occurrence Nets Partially ordered sets (posets), and among them occurrence nets, are a natural formal tool for studying concurrent processes. In a poset, the concurrency relation between elements is explicit. Starting from this relation, and applying standard techniques of lattice theory, one can build a complete lattice whose elements are subsets of the given poset. We study structural properties of such closed subsets, and of the lattice they form. In particular, we show that, if a poset is N-dense, then the lattice of closed subsets is orthomodular. A characterization of K-density, valid for posets, is given on the basis of a relation between lines, or chains, and closed sets. In the case of occurrence nets, we give a characterization of the closed subsets, and define the related notion of "causally closed subset"; a constructive characterization of such subsets is given, which justifies their interpretation as causally closed subprocesses of the occurrence net. We show that, for K-dense occurrence nets, closed subsets and causally closed subsets coincide. By using causally closed subsets, we give another characterization of K-density, related to the algebraicity of the lattice of closed sets.

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

non-sequential processes
partial order semantics
orthomodularity


A very fast phase inversion approach for small baseline style interferogram stacks The recently developed interferometric time-series analysis techniques have shown great potential in ground surface deformation monitoring applications. Such techniques overcome the drawbacks of the traditional differential radar interferometry (DInSAR) and can achieve millimeter-level measurement accuracy. One of the most important operations in interferometric time-series analysis techniques referred to as phase inversion is to estimate relative deformation velocity and digital elevation model error from a double-differenced interferometric phase time-series. Unfortunately, current phase inversion methods generally exhibit a low computational efficiency due to their high non-linearity, especially in the case when the dimension of an interferogram stack is large. In this paper, a new approach is proposed to efficiently resolve phase inversion problems defined on stacks constructed by interferograms with small baselines. The approach separates an estimation procedure into two parts. First, preliminary estimates are obtained by weighted least squares. Then, the estimates are refined by optimizing the corresponding ensemble phase coherence function. The proposed approach was applied to simulated and real data. Experimental results demonstrate that it can accurately address the phase inversion problem with a very high computational performance.

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

interferometric synthetic aperture radar (insar)


Organizational factors to the effectiveness of implementing information security management Purpose - This paper aims to examine the influence of organization factors on the effectiveness of implementing BS7799, an information security management (ISM) standard. Design/methodology/approach - Based on literature review, a research model was formulated by extracting the antecedents of ISM, and an empirical study was conducted to show how the organizational factors influence organizations in carrying out BS7799. Findings - The study result revealed that there were significant impacts of organizational factors, including IT competence of business managers, environment uncertainty, industry type, and organization size, on the effectiveness of implementing ISM. Research limitations/implications - The sample is limited to the organizational factors m Taiwan. It is suggested to replicate this study in other countries to reconfirm the result before adopting its general implications. Owing to the highly intrusive nature of ISM surveys, a cautious approach with rapport and trust is a key success factor in conducting empirical studies on ISM. Practical implications - IT competence is conducive to ISM implementation through subjective norms, leadership, belief, and behavior of ISM activities. Environmental uncertainty positively influences the need for greater innovation, which increases the dependence on IT, and therefore makes the effectiveness of ISM more desirable. Companies in an industry sensitive to security threats should pay more attentions to ISM practice. Corporate executives should also realize the size difference for adopting appropriate ISM strategies. Originality/value - A research model was proposed to study the impacts of organizational factors on ISM, after a broad survey on related researches. The validated model and its corresponding study results can be referenced by enterprise managers and decision makers to make favorable tactics for achieving their goals of ISM.

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

data security
information systems
information management
organizational effectiveness


Stochastic optimization models in forest planning: a progressive hedging solution approach We consider the important problem of medium term forest planning with an integrated approach considering both harvesting and road construction decisions in the presence of uncertainty modeled as a multi-stage problem. We give strengthening methods that enable the solution of problems with many more scenarios than previously reported in the literature. Furthermore, we demonstrate that a scenario-based decomposition method (Progressive Hedging) is competitive with direct solution of the extensive form, even on a serial computer. Computational results based on a real-world example are presented.

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

forestry
forest harvest planning
stochastic programming


Perspectives on children's navigation of the World Wide Web: does the type of search task make a difference? Reports the key findings of a three-part research project that examined the information seeking behaviour and success of 22 seventh grade science students in using the Web. Children used the Yahooligans! search engine/directory to locate information for three different types of search tasks: one assigned fact-finding task, one assigned research-oriented task, and one fully self-generated task. Children's information-seeking behaviour was studied from the cognitive, affective, and physical perspectives. Both quantitative and qualitative inquiry methods were employed to collect the data. Children's behaviour and success were compared on the three tasks. Children were more successful on the fully self-generated task than the fact-based and the research-oriented tasks. Children experienced difficulty in using Yahooligans! Their inadequate knowledge of how to use the engine, their poor level of research skills, as well as the poor structure of Yahooligans! keyword searching all surfaced as problems, Implications for Web training and system design improvements are provided.

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


Performance comparisons of restoration techniques in optical burst switching networks This paper describes restoration techniques for OBS networks. First, we introduce the design issues to be essentially considered, when restoration techniques will be built into OBS networks. Second, considering the design issues, we propose a novel restoration model named "Recover-Then-Reserve," which can enhance the restoration performance. Third, we develop a simulator using the NS-2 platform to verify the performance of the restoration techniques (path, link, and sub-path) designed by each restoration model (GMPLS-based OBS restoration and our proposal). Performance is evaluated on the following metrics: restoration success rate, restoration time, connection availability, and burst loss probability. The effects of the failure frequency and the number of the restoration attempts on the restoration performance are also investigated. Our experiments show that the proposal can reduce the restoration time by about 25 ms compared to the GMPLS-based OBS restoration model. Also, path restoration technique has better performance than link and sub-path restoration techniques because it has the highest restoration success rate, allowing similar restoration time. Our experiments also show that the more the restoration attempts made and the less the failure frequency becomes, the better the restoration performance obtained.

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

optical burst switching
restoration
connection availability
burst loss probability

restoration success rate
restoration time


Multivariate statistical monitoring of continuous wastewater treatment plants In this paper, different multivariate statistical approaches for analysing wastewater treatment process data are presented and compared. For this purpose, all the methods have been tested using one-year operational data in a simulation model benchmark. The general monitoring strategy adopted includes a screening stage to improve data quality, an adaptive model to detect and diagnose abnormal events, and two complementary tools for helping in the diagnosis of the faults. The first one is based on the development of a local model that captures the most recent process behaviour and the second one on the application of fuzzy c-means clustering to the scores of the monitoring model. The results have shown that simple scaling parameters adaptation is sufficient to obtain a model useful for monitoring the process during the whole period. Monitoring the deviations from the average daily behaviour showed clear detections of the disturbances in the Hotelling's T2-statistic and this feature was useful to determine different operational states (disturbances) in the process by clustering the PCA scores. On the other hand, the proposed procedure for isolation based on a local model improved the diagnosis results in terms of the responsible variables identified and the indication of the beginning of the fault.

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

benchmark
clustering
monitoring
wastewater treatment


Modeling spiral-wound membrane modules with applications for gas/vapor permeation Gas/vapor permeation has become a common method for VOC (volatile organic compound) recovery and CO2 capture. The spiral-wound membrane module, which has high packing density, has been commonly used in gas/vapor permeation. In this study, the model that suits the spiral-wound PDMS (polydimethylsiloxane) membrane is obtained by using an integral transform from an N-S equation (Navier-Stokes) and a mass transfer differential equation. The predicted results indicate that the concentration polarization and spiral-wound membrane structure influence can be neglected. The mass transfer based on the MS-UNIQUAC (MS-U) model is also proposed and compared to that based on the Fick-Henry (F-H) model. The comparison results show that the mass transfer based on the F-H model can only be used in a gas mixture without condensable gas; the MS-U model should be used for a gas mixture that includes condensable gas. The influence of permeate flux and feed-side composition in the spiral-wound membrane at different operation conditions is also investigated using the MS-U model. (C) 2012 Elsevier Ltd. All rights reserved.

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


MOVING P2P LIVE STREAMING TO MOBILE AND UBIQUITOUS ENVIRONMENT Media streams distribution over a wired network to static hosts can be realized by Client/Server mode or Peer-to-Peer overlay networks. However, if the end hosts are mobile over heterogeneous wireless access networks, one needs to consider many operational issues such as network detection, handoff, join and leave latency, and desired level of quality of service, as well as Caching. In the latest researches, one popular P2P live streaming system, called AnySee, over the wired network, has been deployed and widely used. Based on the AnySee system, this paper proposed and implemented one hybrid live streaming system, AnySee-Mobile, under wired and wireless environment. In the system, one wireless peer will be selected to act as an agent. One agent has two main functions, to request media, from P2P overlay network as a, normal peer, and to multicast media, to WLAN as a multicast Source. In this paper we study, how to elect One multicast agent in WLAN. Several experimentations have been made and proved that the system has good user experiences and performances.

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


Transform domain analysis of DES The Data Encryption Standard (DES) can be regarded as a nonlinear feedback shift register (NLFSR) with input. From this point of view, the tools for pseudo-random sequence analysis are applied to the S-boxes in DES. The! properties of the S-boxes of DES under Fourier transform, Hadamard transform, extended Hadamard transform, and Avalanche transform are investigated. Two important results about the S-boxes of DES are found. The first result is that nearly two-thirds of the total 32 functions from GF (2(6)) to GF (2) which are associated with the eight S-boles of DES have the maximal linear span 63, and the other one-third have linear span greater than or equal to 57. The second result is that for all S-boxes, the distances of the S-boxes approximated by monomial functions has the same! distribution as for the S-boxes approximated by linear functions. Some new criteria for the design of permutation functions for use in block cipher algorithms are discussed.

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

block cipher
des
nonlinear feedback shift register
transform domain analysis


Near-infrared hyperspectral reflectance imaging for detection of bruises on pickling cucumbers Mechanical injury often causes hidden internal damage to pickling cucumbers, which lowers the quality of pickled products and can incur economic losses to the processor. A near-infrared hyperspectral imaging system was developed to capture hyperspectral images from pickling cucumbers in the spectral region of 9001700nm. The system consisted of an imaging spectrograph attached to an InGaAs camera with line-light fiber bundles as an illumination source. Hyperspectral images were taken from the pickling cucumbers at 03, and 6 days after they were subjected to dropping or rolling under load which simulated damage caused by mechanical harvesting and handling systems. Principal component analysis (PCA), band ratio, and band difference were applied in the image processing to segregate bruised cucumbers from normal cucumbers. Bruised tissue had consistently lower reflectance than normal tissue and the former increased over time. Best detection accuracies from the PCA were achieved when a bandwidth of 8.8nm and the spectral region of 9501350nm were selected. The detection accuracies from the PCA decreased from 95 to 75% over the period of 6 days after bruising, which was attributed to the self-healing of the bruised tissue after mechanical injury. The best band ratio of 988 and 1085nm had detection accuracies between 93 and 82%, whereas the best band difference of 1346 and 1425nm had accuracies between 89 and 84%. The general classification performance analysis suggested that the band ratio and difference methods had similar performance, but they were better than the PCA.

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


SenSpire OS: A Predictable, Flexible, and Efficient Operating System for Wireless Sensor Networks The development of a modern sensor network is difficult because of the long-term unattended operation mode, diverse application requirements, and stringent resource constraints. To address these issues, we present SenSpire OS, a predictable, flexible, and efficient operating system for wireless sensor networks. We improve system predictability by two-phase interrupt servicing and predictable thread synchronization; we achieve system flexibility by providing a hybrid model for both event-driven programming and multithreaded programming; we retain system efficiency by employing stack sharing and modular design. Moreover, we have designed a three-layer networking stack and an object-oriented programming language (CSpire) to enhance system usability and programming convenience. Having implemented SenSpire OS on three most commonly used sensor node platforms, we evaluate its performance extensively. Results show that SenSpire OS ensures predictable system performance, provides a flexible hybrid model for application programming, and is efficient in resource utilization.

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


Chest diseases diagnosis using artificial neural networks Chronic obstructive pulmonary, pneumonia, asthma, tuberculosis, lung cancer diseases are the most important chest diseases. These chest diseases are important health problems in the world. In this study, a comparative chest diseases diagnosis was realized by using multilayer, probabilistic, learning vector quantization, and generalized regression neural networks. The chest diseases dataset were prepared by using patients epicrisis reports from a chest diseases hospitals database.

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

learning vector quantization neural network


Modeling telecommunication infrastructures integrating wideband wireless and wired networks Future telecommunication systems will integrate wireline and wireless networks in a single, advanced infrastructure. It is expected that such systems, in the wireless part, will exploit microcellular architectures in order to guarantee wideband multimedia services and to sustain the continuous growth of subscribers. In such a context, asynchronous transfer mode and Internet protocol are the basic technologies being considered by several studies and field implementations. In both cases, particular care has been devoted to cope with a large number of handoffs. This article considers some aspects of this integrated telecommunication infrastructure, proposing an improvement, for the wired part, of the virtual connection tree and shadow cluster concepts, whereas for the wireless part, a new model for the analysis of a dynamic channel allocation scheme is presented. The obtained analytical results, confirmed by simulation in a wide range of load conditions and user mobility, allow one to evaluate the main system performance parameters in terms of blocking probability of new calls, handoff-blocking probability, and forced termination probability.

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

wireless asynchronous transfer mode (atm)


hypertext applications The discussion about the future of hypertext made me wonder whether I could find another reason to consider a text to be 'hyper'. The answer I found may not be that interesting itself, but the discussions about it gave me some ideas which I want to present in the context of my project. The object of this project is to come to a better understanding of applications of information technology. In the context of my work applications often not only seem less than optimal but even contra productive. A different view may help to find better applications.

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


Fuzzy tuning systems: the mathematics of musicians We present some mathematical properties which determine tuning methods. We introduce the concept of fuzzy tuning systems and we analyze four of the systems coexisting within the current orchestras: Pythagorean, Just Intonation, Holder's and Equal Temperament systems. We show that the theoretical and practical tuning methods are the same. We introduce the idea of compatibility between tuning systems and we give some sufficient conditions to determine an appropriate number of notes into which the octave must be divided. (C) 2004 Elsevier B.V. All rights reserved.

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

fuzzy sets
fuzzy numbers
continued fractions


On the construction of low-density parity-check codes with girth 10 In this letter, construction of a class of (3,k) ( 3 , k ) LDPC codes is presented. The proposed codes are constructed in 2-D lattices; by selection of slope-sets in the lattices, general triangles and quadrangles are removed, which leads to the corresponding codes to have girth no less than 10. By column and row permutation, the check matrix could be introduced to quasi-cyclic structure, which leads to encoding efficient, and the experiment shows that the codes have large minimum distance, and the bit error rate performance over AWGN channels is excellent.

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


Estimating the depth of anesthesia using fuzzy soft computation applied to EEG features Estimating the depth of anesthesia (DOA) is still a challenging area in anesthesia research. The objective of this study was to design a fuzzy rule based system which integrates electroencephalogram (EEG) features to quantitatively estimate the DOA. The proposed method is based on the analysis of single-channel EEG using frequency and time domain methods. A clinical study was conducted on 22 patients to construct subsets of reference data corresponding to four well-defined anesthetic states: awake, moderate anesthesia, surgical anesthesia and isoelectric. Statistical analysis of features was used to design input membership functions (MFs). The input space was partitioned with respect to the derived MFs and the training data was used to label the partitions and extract efficient fuzzy if-then rules. Consequently, the fuzzy rule-base index (FRI) is derived between 0 (isoelectric) to 100 (fully awake) using fuzzy inference engine and designed output MFs. We also applied the same features to an adaptive network-based fuzzy inference system (ANFIS) derived without any prior knowledge. The results show that FRI correlates more with the clinically accepted DOA index, CSITM (CSM, Danmeter, Denmark). In addition to this achievement the main idea behind this study is to simplify the mutual knowledge exchange between the human expert and the machine, leading to enhance both interpretability of the results and performance of the system.

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

electroencephalogram (eeg)
fuzzy logic
spectral analysis
linguistic rules


Handling forecasting problems based on high-order fuzzy logical relationships People usually use many methods to predict the weather, the temperature, the stock index, the enrollments, the earthquake, the economy, etc. Based on these forecasting results, people can prevent damages to occur or get benefits from the forecasting activities. In this paper, we present a new method to forecast the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX), the enrollments of the University of Alabama and the inventory demand based on high-order fuzzy logical relationships. First, the proposed method fuzzifies the historical data into fuzzy sets to form high-order fuzzy logical relationships. Then, it calculates the value of the variable between the subscripts of adjacent fuzzy sets appearing in the antecedents of high-order fuzzy logical relationships. Then, it lets the high-order fuzzy logical relationships with the same variable value form a high-order fuzzy logical relationship group. Finally, it chooses a high-order fuzzy logical relationship group to forecast the TAIEX. The proposed method gets a higher average forecasting accuracy rate to forecast the TAIEX, the enrollments of the University of Alabama and the inventory demand than the existing methods. (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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fuzzy time series
fuzzy forecasting
high-order fuzzy time series
high-order fuzzy logical relationships


internet video search In this tutorial, we focus on the challenges in internet video search, present methods how to achieve state-of-the-art performance while maintaining efficient execution, and indicate how to obtain improvements in the near future. Moreover, we give an overview of the latest developments and future trends in the field on the basis of the TRECVID competition - the leading competition for video search engines run by NIST - where we have achieved consistent top performance over the past years, including the 2008, 2009 and 2010 editions.

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

video retrieval
visual categorization
information visualization


PG-TRUST: A SELF-ADAPTIVE AND SCALABLE TRUST COMPUTING MODEL FOR LARGE-SCALE PEER-TO-PEER GRID COMPUTING Peer-to-peer Grid ( PG) is a new, promising approach for distributed computation that takes advantage of the huge amount of resources in grid computing. The purpose of PG is to support cooperative work between large-scale grid domains. In order to protect each domain's privilege and security, an efficient trust management mechanism is essential. Focusing on the requirement of large-scale PG computing, PG-Trust, a novel trust model is proposed based on trust relationships across domains. Firstly, a self-adaptive overall trust quantified framework is proposed based on the historical interaction records between participants, which not only can improve system efficiency, but also can solve trust computing problem when the direct evidence is sparse. Furthermore, the direct trust computing method based on attenuation function and the feedback trust mechanism based on direct trust tree (DTT) are introduced, which makes our model have a higher self-adaptability and a better scalability than previous studies. Through performance analyzing, the proposed model exhibits a strong self-adaptability in handling various dynamic behaviors of peers, and has a remarkable enhancement in the accuracy of trust evaluation.

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

p2p grid computing
dynamic trust model
self-adaptability
information entropy


A BiCMOS current conveyor based four-quadrant analog multiplier A novel circuit for an analog multiplier in BiCMOS technology is described. It is based on a two-current conveyor cell associated with a four MOSFET transconductor. This differential multiplier achieves a bandwidth of 10 MHz because of the use of high-frequency current-conveyor.

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


Experiencing death: an insider's perspective For millennia, human beings have wondered what happens after death. What is the first-person experience of dying and being brought back to life? Technological advances in resuscitation science have now added an intriguing new chapter to the literature of out-of-body or near-death experiences by eliciting detailed and vivid accounts of those who have approached the threshold of death. Steve Paulson, executive producer and host of To the Best of Our Knowledge, moderated a discussion that included neurologist Kevin Nelson, neuropsychiatrist Peter Fenwick, emergency medicine expert Sam Parnia, and orthopedic surgeon and drowning survivor Mary Neal; they share some remarkable stories and discuss how they analyze such experiences in light of their own backgrounds and training. The following is an edited transcript of the discussion from December 11, 2013, 7:008:30 PM, at the New York Academy of Sciences in New York City.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 body experiences
near-death experiences
clinical death
self


Continuous curvature path generation based on beta-spline curves for parking manoeuvres This paper focuses attention on continuous curvature path generation for parallel parking manoeuvres of autonomous conventional vehicles. The method is based on beta-spline curves generation from a collision-free path previously calculated. Several constraints have been considered in order to ensure the existence of collision-free and admissible Curves. The efficiency of the proposed method is demonstrated using the nonholonomic autonomous vehicles ROMEO-3R and ROMEO-4R designed and built at the University of Seville. (c) 2007 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

mobile robots
autonomous parking
nonholonomic systems
path planning


Restricting backtracking in connection calculi Connection calculi benefit from a goal-oriented proof search, but are in general not proof confluent. A substantial amount of backtracking is required, which significantly affects the time complexity of the proof search. This paper presents a simple strategy for effectively restricting backtracking in connection calculi. In combination with a few basic techniques it provides the basis for a refined connection calculus. The paper also describes how this calculus can be implemented directly by a few lines of Prolog code. This very compact program is the core of an enhanced version of the automated theorem prover leanCoP. The performance of leanCoP is compared with other lean theorem provers, connection provers, and state-of-the-art theorem provers. The results show that restricted backtracking is a successful technique when performing proof search in connection calculi.

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

connection calculus
restricted backtracking
leancop