Medical image diagnosis of liver cancer by hybrid feedback GMDH-type neural network using principal component-regression analysis The hybrid feedback group method of data handling (GMDH)-type neural network is proposed and applied to the medical image diagnosis of liver cancer. In this algorithm, the principal component-regression analysis is used for the learning calculation of the neural network, and the accurate and stable predicted values are obtained. Furthermore, this neural network has the feedback loop and the complexity of neural network architecture is increased using the feedback loop calculations. The neural network architecture is automatically organized so as to fit the complexity of the nonlinear system using the prediction error criterion defined as Akaikes information criterion (AIC) or prediction sum of squares (PSS). The recognition results show that the hybrid feedback GMDH-type neural network algorithm is useful for the medical image diagnosis of liver cancer since the optimum neural network architecture is automatically organized.

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


The influence of k-dependence on the complexity of planning A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is of interest because k is a constant for all but a few of the current benchmark domains in planning, and is known to have implications for tractability. In this paper, we present an algorithm for solving planning problems in P(k), the class of k-dependent planning problems with binary variables and polytree causal graphs. We prove that our algorithm runs in polynomial time when k is a fixed constant. If, in addition, the causal graph has bounded depth, we show that plan generation is linear in the size of the input. Although these contributions are theoretical due to the limited scope of the class P(k), suitable reductions from more complex planning problems to P(k) could potentially give rise to fast domain-independent heuristics. (C) 2011 Elsevier B.V. All rights reserved.

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

tractable planning
computational complexity


towards generic refactoring We define a challenging and meaningful benchmark for genericity in language processing, namely the notion of generic program refactoring . We provide the first implementation of the benchmark based on functional strategic programming in Haskell. We use the basic refactoring of abstraction extraction as the running example. Our implementation comes as a functional programming framework with hot spots for the language-specific ingredients for refactoring, e.g., means for abstraction construction and destruction, and recognisers for name analysis. The language-parametric framework can be instantiated for various, rather different languages, e.g., Java, Prolog, Haskell, or XML schema.

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

program
language
haskell
use
abstraction
benchmark
prolog
analysis
implementation
refactoring
schema
functional programming
generic

reuse
examples
strafunski
parametric
frameworks
process
generic programming
program transformation


A Randomized Homotopy for the Hermitian Eigenpair Problem We describe and analyze a randomized homotopy algorithm for the Hermitian eigenvalue problem. Given an \(n\times n\) Hermitian matrix \(A\), the algorithm returns, almost surely, a pair \((\lambda ,v)\) which approximates, in a very strong sense, an eigenpair of \(A\). We prove that the expected cost of this algorithm, where the expectation is both over the random choices of the algorithm and a probability distribution on the input matrix \(A\), is \(\mathcal{{O}}(n^6)\), that is, cubic on the input size. Our result relies on a cost assumption for some pseudorandom number generators whose rationale is argued by us.

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

eigenpair computation
homotopy methods
complexity analysis
65f15


the storyspinner sculptural reader This demo is of a hypertext reading system called StorySpinner. It follows the sculptural hypertext methodology and has been used as a test bed for experimenting with the authoring of narrative flow in automatically generated stories. Readers are able to select and read one of two available stories. Reading a story involves selecting tarot cards which are mapped to chunks of story text based on possible interpretations of the cards and information concerning current story state.

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


Alphabet indexing for approximating features of symbols We consider two maximization problems to find a mapping from a large alphabet forming given two sets of strings to a set of a very few symbols specifying a symbol wise transformation of strings. First we show that the problem to find a mapping that transforms the most of the strings as to form disjoint sets cannot be approximated within a ratio n(1/16) in polynomial time, unless P = NP. Next we consider a mapping that retains the difference of the maximum number of pairs of strings over the given sets. We present a polynomial-time approximation algorithm that guarantees a ratio k/(k - 1) for mappings to k symbols, as well as proving that the problem is hard to approximate within an arbitrary small ratio in polynomial time. Furthermore, we extend this algorithm as to deal with not only pairs but also tuples of strings and show that it achieves a constant approximation ratio. (C) 1999-Elsevier Science B.V. All rights reserved.

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

polynomial-time approximation
nonapproximability
knowledge acquisition
data compression


Increasing deadline-constrained throughput in multi-channel ALOHA networks via non-stationary multiple-power-level transmission policies Multi-channel Slotted ALOHA is currently used primarily in satellite-based networks for transaction processing (e.g., credit card payments at cash registers). For these applications, maximization of attainable throughput while adhering to a maximum-delay constraint with a required probability reflects both the user's requirements, the network owner's desires, and the non-deterministic nature of ALOHA. This paper explores the judicious use of multiple power levels as a priority mechanism; e.g., the last transmission attempt uses higher power. It focuses on the practical and relevant range of three transmission attempts, up to three power levels, and maximum values of the permissible probability of missing the deadline (P-e) in the range 10(-5)<P-e<10(-2). Our scheme increases the attainable delay-constrained throughput by 84-355% (two power levels) and 140-762% (three levels) over classical slotted ALOHA. An optimized combination of multiple copies and two power levels outperforms classical slotted ALOHA by 144-1240%. The smaller P-e the greater the improvement. The benefit of our schemes is thus dramatic, and far exceeds the contribution of power capture to (unconstrained) capacity of ALOHA.

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

multi-channel aloha
delay-constrained throughput
multiple-access schemes
quality of service


On the design of emergent systems: an investigation of integration and interoperability issues Many useful manmade systems in this world are extremely complex; a typical example is a large infrastructure. No design team ever invents these artifacts because they are too complex. These artifacts are made by combining existing elements (legacy) and by building new subsystems without explicit and comprehensive up-front coordination. To a large extent, these complex systems emerge and evolve. Experience shows that designers frequently fail to develop artifacts that, when combined, facilitate the emergence of effective and efficient systems. This paper formally elaborates the mechanism behind this phenomenon, and proposes principles for the design of components for emergent systems. The above insights were gained during the development of research prototypes for multi-agent manufacturing control; manufacturing systems are notorious for experiencing integration and interoperability problems as described above. Consequently, the design principles are discussed and illustrated on the design of multi-agent manufacturing control systems but also on work by others. Finally, although this paper mainly discusses the above in a generic fashion, and although the generic statements hold in an application-independent manner, it is important to appreciate that the applicability of the above insights and principles has significant limitations, which are discussed in the paper.

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

emergent systems
coordination
design principles
integration

constraints
intelligent manufacturing systems
multi-agent systems


Wave transmission by partial porous structures in two-layer fluid The present study deals with oblique surface gravity wave scattering and trapping by bottom-standing and surface-piercing porous structures of finite width in two-layer fluid. The problems are analyzed based on the linearized water wave theory in water of uniform depth. Both the cases of interface piercing and non-piercing structures are considered to analyze the effect of porosity in attenuating waves in surface and internal modes. Eigenfunction expansion method is used to deal with wave past porous structures in two-layer fluid assuming that the associated eigenvalues are distinct. Further, the problems are analyzed using boundary element method and results are compared with the analytic solution derived based on the eigenfunction expansion method. Efficiency of the structures of various configuration and geometry on scattering and trapping of surface waves are studied by analyzing the reflection and transmission coefficients for waves in surface and internal modes, free surface and interface elevations, wave loads on the structure and rigid wall. The present study will be of significant importance in the design of various types of coastal structures used in the marine environment for reflection and dissipation of wave energy at continental shelves dominated by stratified fluid which is modeled here as a two-layer fluid.

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

oblique wave scattering
wave trapping
two-layer fluid
bottom-standing porous structure
surface-piercing porous structure


The impact of estimation error on the dynamic order admission policy in B2B MTO environments When swarming demands cause stringent capacity situations, order promising becomes a challenging job. However, a dynamic order admission policy by utilizing the concept of revenue management may find a good way to solve the problem. Unfortunately, the expected profit under different dynamic order admission policies is sensitive to the estimation error of order forecasts. In this paper, the impact of estimation error is investigated under various order structures. The post analysis is performed and shows significant statistical difference among the optimal unbiased DSKP policy, biased DSKP policy, and FCFS policy. The results reveal the robustness and superiority of DSKP policy in most scenarios.

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


Visual cluster validity for prototype generator clustering models Conventional cluster validity techniques usually represent all the validity information available about a particular clustering by a single number. The display method introduced here uses images generated from the results of any prototype generator clustering algorithm to do cluster validation.

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

cluster validity
prototype generator clustering

data visualization
dissimilarity data
visual cluster validity


Service level agreement as a complementary currency in peer-to-peer markets Service level agreements (SLAs) have demonstrated to be efficacious tools for managing resources. They provide a valuable basis for establishing contractually binding interactions within peer-to-peer systems. Such SLAs are particularly useful when considering interactions in environments with limited trust between participants. In recent research, we observe a move from the use of SLAs as simple documents handled manually to the use of automated mechanisms for handling SLAs, appropriate for different business profiles. Complementary currencies, on the other hand, have proven to be useful for facilitating exchange among selfish peers. We identify how an SLA can itself be used as a complementary currency to encourage resource sharing between peers. Our work demonstrates how an SLA can be used as a medium of exchange and used to establish a market for computational resources. The value of an SLA can vary based on the demand for particular types of resource. By simulating a process of trade, we investigate several economic indicators. We demonstrate how the economic benefit (in terms of profit and loss) evolves based on varying levels of demand. We describe how a variation in value of an SLA can influence the overall welfare within a peer-to-peer system, and how such welfare is dependent on the overall demand for services and the redemption time associated with the SLA.

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

complementary currency
service level agreements

electronic markets
p2p market simulation


Adaptive indexing for content-based search in P2P systems One of the major challenges in Peer-to-Peer (P2P) file sharing systems is to support content-based search. Although there have been some proposals to address this challenge, they share the same weakness of using either servers or super-peers to keep global knowledge, which is required to identify importance of terms to avoid popular terms in query processing. As a result, they are not scalable and are prone to the bottleneck problem, which is caused by the high visiting load at the global knowledge maintainers. To that end, in this paper, we propose a novel adaptive indexing approach for content-based search in P2P systems, which can identify importance of terms without keeping global knowledge. Our method is based on an adaptive indexing structure that combines a Chord ring and a balanced tree. The tree is used to aggregate and classify terms adaptively, while the Chord ring is used to index terms of nodes in the tree. Specifically, at each node of the tree, the system classifies terms as either important or unimportant. Important terms, which can distinguish the node from its neighbor nodes, are indexed in the Chord ring. On the other hand, unimportant terms, which are either popular or rare terms, are aggregated to higher level nodes. Such classification enables the system to process queries on the fly without the need for global knowledge. Besides, compared to the methods that index terms separately, term aggregation reduces the indexing cost significantly. Taking advantage of the tree structure, we also develop an efficient search algorithm to tackle the bottleneck problem near the root. Finally, our extensive experiments on both benchmark and Wikipedia datasets validated the effectiveness and efficiency of the proposed method.

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

peer-to-peer computing
term aggregation and classification
information retrieval
content-based search


R-LABS: An RFID-based indoor localisation system using antenna beam scanning In this paper, we propose an indoor localisation system using radio frequency identification (RFID) technology. Locations of passive RFID tags are determined by scanning multiple RFID reader antennas' radiation beams. During each scan, the horizontal and elevation angles of the reader antenna are recorded when the transition of a tag entering or leaving the antenna beam's coverage area occurs, and this angle information is used in the developed algorithm to calculate the tag's location. The proposed system requires a minimum of two reader antennas, without the need for reference tags. In order to mitigate the multipath impact on the localisation accuracy and system coverage, an improved algorithm is also developed. Simulations are performed for a typical small indoor environment and validated by experiments using ultra-high frequency (UHF) RFID devices. The results demonstrate that for effective operations of the proposed system, directive antennas are necessary, and systems using antennas with narrower beam widths provide a higher localisation accuracy.

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

indoor localisation
antenna beam scanning


Damage and fracture evolution in brittle materials by shape optimization methods This paper is devoted to a numerical implementation of the FrancfortMarigo model of damage evolution in brittle materials. This quasi-static model is based, at each time step, on the minimization of a total energy which is the sum of an elastic energy and a Griffith-type dissipated energy. Such a minimization is carried over all geometric mixtures of the two, healthy and damaged, elastic phases, respecting an irreversibility constraint. Numerically, we consider a situation where two well-separated phases coexist, and model their interface by a level set function that is transported according to the shape derivative of the minimized total energy. In the context of interface variations (Hadamard method) and using a steepest descent algorithm, we compute local minimizers of this quasi-static damage model. Initially, the damaged zone is nucleated by using the so-called topological derivative. We show that, when the damaged phase is very weak, our numerical method is able to predict crack propagation, including kinking and branching. Several numerical examples in 2d and 3d are discussed.

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

level set
shape optimization
damage
fracture


Inhibitory inputs increase a neurons's firing rate Neurons are typically thought of as receiving information primarily through excitatory inputs, with inhibitory inputs playing a gating or regulating role. In this paper we demonstrate that increasing the strength of inhibitory inputs to the HodgkinHuxley and FitzHughNagumo models can induce them to fire faster. This result is counter-intuitive and important in neural network modelling where inhibitory inputs are often neglected.

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

inhibitory input
the hodgkinhuxley model
the fitzhughnagumo model
ibf
the integrate-and-fire model
the if-fhn model


Toward the effective use of educational program animations: The roles of student's engagement and topic complexity Programming is one of the most complex subjects in computer science degrees. Program visualization is one of the approaches adopted to make programming concepts more accessible to students. In this work we study the educational impact of an active and highly engaging approach, namely the construction of program animations by students. We systematically compared this approach with two instructional scenarios, based on viewing animations and on the traditional instruction without systematic use of animations. A general conclusion of this work is that animations actually improve learning in terms of some educational aspects: short-term and long-term knowledge acquisition, and drop-out rates. Shortterm improvements depend on the complexity level of the topic: while there is no impact for simple topics, there is a learning improvement in complex topics using the viewing and constructing approaches, and there is a learning improvement for highly complex topics using the viewing approach. In the long-term, drop-out rates were significantly decreased for students involved in the two most engaging approaches. In addition, both animation viewing and animation construction improved students' passing-rate in the term exam. Nevertheless, we were unable to prove in the long term that students involved in construction tasks yielded higher grades than those involved in viewing tasks. (C) 2013 Elsevier Ltd. All rights reserved.

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

evaluation of cal systems
interactive learning environments
multimedia/hypermedia systems
programming and programming languages
simulations


An efficient resource discovery framework for pure unstructured peer-to-peer systems In this paper, we propose an efficient resource discovery framework allowing pure unstructured peer-to-peer systems to respond to requests at run time with a high success rate while preserving the local autonomy of member machines. There are five units in the proposed framework that respectively gather information about the status of resources, make decisions, detect the states of member machines, discover resources to respond to requests in normal and dynamic conditions, and balance the load of local machines. Efficient resource discovery is achieved by the deployment of a newly introduced mechanism that is placed on every machine allowing it to figure out its states before and after accepting other machines requests for its resources using a state model and deciding whether to accept or reject those requests. This state model accurately estimates the machines state based on the resources and processes of the machine before and after accepting the request. We have experimentally compared the proposed mechanism with random, learning-based, and state-based search mechanisms with regard to the number of missed requests, network bandwidth due to transferred messages, number of associated machines in a discovery operation, time required to process information in discovery operation, processing time in machines, and the number of faults per request. The results show significant improvement of some of these parameters, specially network bandwidth and the number of missed requests in a dynamic condition, under our framework.

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

pure unstructured peer-to-peer systems
learning
state-based search


New implementation scheme for the restoration of voiced speech signals Recently iterative procedure for the restoration of speech signals when prosodic elements: stress and accent, of comparatively long duration are missing was developed. Alternatively, it could be cast in a signal generation framework. Basing on that view the paper presents the efficient implementation scheme for the restoration of voiced speech signals. It enjoys parallel order of multirate processing utilizing interpolation and decimation filters parameterized by specific to problem coefficients. Presented simulation results confirm the feasibility of developed implementation.

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

speech signal processing
digital signal processing
multirate signal processing
polynomial approximation


Distributed, multi-sensor tracking of multiple participants within immersive environments using a 2-cohort camera setup Vision-based human motion tracking has gained significant interest in recent years, as the need for more intuitive human-computer interaction paradigms are sought after. Immersive environments, such as large-scale displays and virtual reality systems are particularly suitable for such interaction mechanisms, as they provide a controlled basis for experimentation and evaluation. However, despite the growing interest, human-motion tracking within immersive environments is still in its infancy. The lack of visible light and the presence of multiple people within such environments pose several challenges to the problem. In this research a robust framework for real-time, multi-camera human-motion tracking within an immersive environment is presented. The static nature of the environment is exploited to utilise a novel 2-cohort camera layout. This layout proves to be highly useful for tracking, providing several benefits over existing techniques, which treat all cameras as the same.

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

computer vision
multi-person tracking
multiple cameras


Nonlinear regularization techniques for seismic tomography The effects of several nonlinear regularization techniques are discussed in the framework of 3D seismic tomography. Traditional, linear, ?2 ? 2 penalties are compared to so-called sparsity promoting ?1 ? 1 and ?0 ? 0 penalties, and a total variation penalty. Which of these algorithms is judged optimal depends on the specific requirements of the scientific experiment. If the correct reproduction of model amplitudes is important, classical damping towards a smooth model using an ?2 ? 2 norm works almost as well as minimizing the total variation but is much more efficient. If gradients (edges of anomalies) should be resolved with a minimum of distortion, we prefer ?1 ? 1 damping of Daubechies-4 wavelet coefficients. It has the additional advantage of yielding a noiseless reconstruction, contrary to simple ?2 ? 2 minimization (Tikhonov regularization) which should be avoided. In some of our examples, the ?0 ? 0 method produced notable artifacts. In addition we show how nonlinear ?1 ? 1 methods for finding sparse models can be competitive in speed with the widely used ?2 ? 2 methods, certainly under noisy conditions, so that there is no need to shun ?1 ? 1 penalizations.

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


Novel weighting in single hidden layer feedforward neural networks for data classification We propose a binary classifier based on the single hidden layer feedforward neural network (SLFN) using radial basis functions (RBFs) and sigmoid functions in the hidden layer. We use a modified attribute-class correlation measure to determine the weights of attributes in the networks. Moreover, we propose new weights called as influence weights to utilize in the weights connecting the input layer and the hidden layer nodes (hidden weights) of the network with sigmoid hidden nodes. These weights are calculated as the sum of conditional probabilities of attribute values given class labels. Our learning procedure of the networks is based on the extreme learning machines; in which the parameters of the hidden nodes are first calculated and then the weights connecting the hidden nodes and output nodes (output weights) are found. The results of the networks with the proposed weights on some benchmark data sets show improvements over those of the conventional networks.

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

extreme learning machines
influence weights

binary classification
radial basis function network
attribute weighting


User evaluation of ontology as query construction tool This study examines the use of an ontology as a search tool. Sixteen subjects created queries using Concept-based Information Retrieval Interface (CIRI) and a regular baseline IR interface. The simulated work task method was used to make the searching situations realistic. Subjects' search experiences, queries and search results were examined. The numbers of search concepts and keys, as well as their overlap in the queries were investigated. The effectiveness of the CIRI and baseline queries was compared. An Ontology Index (OI) was calculated for all search tasks and the correlation between the OI and the overlap of search concepts and keys in queries was investigated. The number of search keys and concepts was higher in CIRI queries than in baseline interface queries. Also the overlap of search keys was higher among CIRI users than among baseline users. These both findings are due to CIRI's expansion feature. There was no clear correlation between OI and overlap of search concepts and keys. The search results were evaluated with generalised precision and recall, and relevance scores based on individual relevance assessments. The baseline interface queries performed better in all comparisons, but the difference was statistically significant only in relevance scores based on individual relevance assessments.

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

ontologies
interactive information retrieval


Regular-texture image retrieval based on texture-primitive extraction In this study, we propose a new regular-texture image retrieval approach by which users can retrieve regular-texture images from a database which are most similar to a sample query. In this approach, texture primitives and their displacement vectors are extracted from the query and each regular-texture image in the database. These components describe periodic properties of a regular-texture image. Five features are computed from co-occurrence matrices (CMs) of the texture primitive to characterize statistical properties of the corresponding image. Each regular-texture image in the database is then represented as the five CM-features, which are insensitive to translation and rotation of the regular-texture image. Hence, query comparison or matching can be done using the corresponding CM-features. Experimental results show that the proposed approach is indeed effective. The time required to process a query is moderate.

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

regular-texture image retrieval
displacement vector
co-occurrence matrix


A C++ program for the Cramer-von Mises two-sample test As larger sets of high-throughput data in genomics and proteomics become more readily available, there is a growing need for fast algorithms designed to compute exact p values of distribution-free statistical tests. We present a program for computing the exact distribution of the two-sample Cramer-von Mises test statistic under the null hypothesis that the two samples are drawn from the same continuous distribution. The program makes it possible to handle substantially larger sample sizes than earlier proposed computational tools. The C++ source code for the program is published with this paper, and an R package is under development.

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

cramer-von mises test
distribution-free tests


Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with small absorption We study the positive stationary solutions of a standard finite-difference discretization of the semilinear heat equation with nonlinear Neumann boundary conditions. We prove that, if the absorption is small enough, compared with the flux in the boundary, there exists a unique solution of such a discretization, which approximates the unique positive stationary solution of the "continuous" equation. Furthermore, we exhibit an algorithm computing an epsilon-approximation of such a solution by means of a homotopy continuation method. The cost of our algorithm is linear in the number of nodes involved in the discretization and the logarithm of the number of digits of approximation required. (C) 2013 Elsevier Inc. All rights reserved.

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

stationary solution
homotopy continuation

two-point boundary-value problem
finite differences
condition number
complexity


Failure sensitivity analysis of engineering structures The present paper suggests a method to consider uncertainties in engineering structures in a computational scheme. Latin hypercube sampling is used to prepare input data of probabilistic parameters for subsequent deterministic simulations where the mechanical response is evaluated. The approach is applied on a pallet rack system where damaged columns and connector stiffnesses are considered as probabilistic parameters. The mechanical simulations are performed with the finite element method, and full advantage is taken of existing commercial code.

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

finite element method
sensitivity analysis
uncertainties
probabilistic parameters
latin hypercube sampling
pallet rack


Conceptions of the Internet in everyday life information seeking Based on the interviews of 18 people in Finland in 2001-2, conceptions of the Internet as an information source were explored. In general, the conceptions reflect the acceptability, accessibility and usability of Internet sources. Most conceptions appeared to be quite impressionistic, reflecting the basic difficulty of describing the constantly changing nature of the Internet. Two major kinds of Internet conceptions were identified. First, in metaphorical conceptions, the Internet was primarily conceived in terms of space or place, for example, a library or a bazaar. Second, conceptions based on actual use experiences of the Internet significantly drew on quality judgments of the networked services. Since a growing number of information sources of various types are competing for people's attention, general level conceptions of sources and channels will gain importance as a criterion by which sources will be accepted or rejected. This seems to be a particular characteristic of networked information environments.

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

world wide web
information seeking behaviour
user expectations
user satisfaction
perceptions
mental models
selection


Prediction of acute hypotensive episodes by means of neural network multi-models This work proposes the application of neural network multi-models to the prediction of adverse acute hypotensive episodes (AHE) occurring in intensive care units (ICU). A generic methodology consisting of two phases is considered. In the first phase, a correlation analysis between the current blood pressure time signal and a collection of historical blood pressure templates is carried out. From this procedure the most similar signals are determined and the respective prediction neural models, previously trained, selected. Then, in a second phase, the multi-model structure is employed to predict the future evolution of current blood pressure signal, enabling to detect the occurrence of an AHE. The effectiveness of the methodology was validated in the context of the 10th PhysioNet/Computers in Cardiology ChallengePredicting Acute Hypotensive Episodes, applied to a specific set of blood pressure signals, available in MIMIC-II database. A correct prediction of 10 out of 10 AHE for event 1 and of 37 out of 40 AHE for event 2 was achieved, corresponding to the best results of all entries in the two events of the challenge. The generalization capabilities of the strategy was confirmed by applying it to an extended dataset of blood pressure signals, also collected from the MIMIC-II database. A total of 2344 examples, selected from 311 blood pressure signals were tested, enabling to obtain a global sensitivity of 82.8% and a global specificity of 78.4%.

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

hypotension episodes
blood pressure prediction
neural network multi-models
mimic-ii database


A Detector Generating Algorithm Based on Interval Partition Based on the functions and some relevant theories of the biological immune system, an artificial immune system is established to solve the practical problems for computing systems. At present, the artificial immune system includes two major categories: the mechanism of non-self recognition and immune network, the most important of which is negative selection algorithm. The negative selection algorithm is proposed to simulate the formation and running mechanism of T cells for the immune system in 1994. In this algorithm, one of the key steps is the detector generation. Unfortunately, the current detector generating algorithms have detector generation inefficiencies, holes area, and redundant detector problems to some degree. In this paper, from the perspective of one dimension, a novel detector generating algorithm that is based on interval partition is proposed. At the beginning of this algorithm, we make the maximal interval be the initial detector; second, this detector should experience the training of self-tolerance. According to the matching rule, we let this detector match the given collection of selves; then we remove the points from the interval detector which matches the selves. At the same time, we divide the interval into two parts at this point and have the candidate detectors optimized by the corresponding interval collations and amalgamations. That is to say, the initial detector interval is divided recursively according to the spatial locations of selves. At last, we can get a set of excellent mature detectors, which can be used to protect the system security. To illustrate the advantage of this algorithm, we have given an example. From this example, we can declare that the algorithm improves the current detector generations and matching rules greatly. It also helps to remove the holes area and redundant detectors. Therefore, both the detector generation efficiency and the detecting efficiency are well improved. By the theoretical analysis and comparison, the system can detect a large number of non-self antigens only using a small quantity of detectors. Obviously, the algorithm achieves the high non-self identification system.

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

negative selection algorithm
detector generating algorithm
matching rule


the mylifebits lifetime store Storage trends have brought us to the point where it is affordable to keep a complete digital record of one's life, and capture methods are multiplying. To experiment with a lifetime store, we are digitizing everything possible from Gordon Bell's life. The MyLifeBits system is designed to store and manage a lifetime's worth of data. MyLifeBits enables the capture of web pages, telephone, radio and television. This demonstration highlights the application of typed links and database features to make a lifetime store something that is truly useful.

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

lifetime point database television storage data links

digitize
applications
multimedia
method
systems
memex
web page
hypermedia
annotation
demonstrate
experience
feature
management
completeness
records


Design of MIMO integral variable structure controllers The MIMO integral variable structure control (MIMOIVSC) scheme is proposed for a class of linear MIMO dynamic systems with nonlinear matched perturbations. This scheme is composed of two types of controllers. One is variable structure controller, which gives robust stability for system in the presence of parameter variations, uncertainties, and/or disturbances. The other is integral controller, which can eliminate steady-state error for step tracking. When the system is in the sliding mode, the dynamic equations of the closed-loop system can be reduced to a linear form and its eigenvalues can be arbitrarily assigned. In addition, an observer can be employed for state estimation, so that the state variables need not be measured. The fulfillment of sliding condition, including the case when estimated states are used, is verified. Two numerical examples are given to demonstrate the applicability of the proposed control scheme.

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

variable structure control
sliding mode
observer
integral controller


Explorations in design space: Unconventional electronics design through artificial evolution Three hypotheses are formulated. First, in the "design space" of possible electronic circuits, conventional design methods work within constrained regions, never considering most of the whole. Second, evolutionary algorithms. can explore some of the regions beyond the scope of conventional methods, raising the possibility that better designs can be found. Third, evolutionary algorithms can in practice produce designs that are beyond the scope of conventional methods, and that are in some sense better. A reconfigurable hardware controller for a robot is evolved, using a conventional architecture with and without orthodox design constraints. In the unconstrained case, evolution exploited the enhanced capabilities of the hardware. A tone discriminator circuit is evolved on an FPGA without constraints, resulting in a structure and dynamics that are foreign to conventional design and analysis, The first two hypotheses are true. Evolution can explore the forms and processes that are natural to the electronic medium, and nonbehavioral requirements can be integrated into this design process, such as fault tolerance. ri strategy to evolve circuit robustness tailored to the task, the circuit, and the medium, is presented. Hardware and software tools enabling research progress are discussed. The third hypothesis is a good working one: practically useful but radically unconventional evolved circuits are in sight.

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

electronics design
evolutionary algorithms
fault tolerance


The process of model building and simulation of ill-defined systems: Application to wastewater treatment In recent years, there has been a growing awareness of the ill-defined nature of environmental processes. To provide a frame of reference for discussions regarding ill-defined systems, a taxonomy and terminology of the modelling and simulation of systems is presented. Due to the complexity of ill-defined systems, it is not only necessary to describe the nature of models, but also to describe modelling procedures. This enables the modeller to obtain the model which best fits his goals (optimal model). For meaningful description of models, different model formalisms will be presented. Furthermore, modelling procedures will be described at a generic level and different model formalisms will be presented. Throughout this paper, Waste-Water Treatment Plants and processes occurring within these plants will illustrate the definitions given.

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

mathematical modeling
ill-defined systems


Regular journal sections - Contemporary systems and cybernetics Gives reports and surveys of selected current research and developments in systems and cybernetics. They include: Interdisciplinary initiatives; Artificial intelligence; Innovative research; Cybernetics and Robotics; Supergen programme.

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


Efficacy of Hydrocortisone in Preventing Posttraumatic Stress Disorder Following Critical Illness and Major Surgery Like other humans exposed to extreme trauma, patients who have been treated in an intensive care unit (ICU) often report traumatic memories. Extremely traumatic memories from the ICU in some of these patients are associated with the development of posttraumatic stress disorder (PTSD), which results in significant impairments in health-related quality of life (HRQL) outcomes of ICU therapy. Severely ill patients in the ICU often show insufficient endogenous glucocorticoid signaling, which has recently been termed critical illness-related corticosteroid insufficiency (CIRCI). We performed several controlled trials in ICU patients with suspected CIRCI from septic shock or cardiac surgery, which indicated that the administration of glucocorticoids (stress doses of hydrocortisone) during ICU treatment results in a significant reduction of PTSD symptoms in long-term survivors as well as improvements in HRQL outcomes. Stress doses of hydrocortisone could help to surmount impaired glucocorticoid signaling from CIRCI during critical illness resulting in a downregulation of the stress response as well as inhibition of traumatic memory retrieval and facilitated extinction of aversive information

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

ptsd
glucocorticoids
hydrocortisone
traumatic memory
stress
intensive care unit
septic shock


generating smooth 2-d monocolor line drawings on video displays One of the major drawbacks of video display systems for line drawing applications has been the poor image quality they usually producejaggy, staircased line edges, moire patterns in regions of closely spaced lines, even, with some systems, lines disappearing (falling in) between pixels. Correcting these effects, with appropriate area-sampling techniques, has generally been too computationally expensive to adopt. A new algorithm is presented which generates precise, smooth images of line drawings and solid polygonal-shaped objects on multi-grey-level pixel-mapped video systems. The method is based on an analysis of boundary conditions at each pixel affected by one or more lines. With this method a number of previously needed steps can be quickly eliminated. The commonality of boundary conditions between adjacent pixels and the coherence of such conditions in a raster-scan ordering of such pixels allows efficient generation of these boundary conditions. A recursive subdivision approach allows handling of arbitrarily complex cases by a simple boundary-analyzing technique. Compared with current line-drawing systems, a video system with this algorithm would also display an improved image with respect to certain common visual effectse.g., distance modulation of line intensity (which may be desirable), artificial small bright clusters of detail (which is undesirable). Since the software interface to the algorithm may be handled through already-standard graphical subroutines, adoption of the algorithm may be accomplished without burdening graphic system users or graphic system-utilizing software.

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

precise applications quality video generation drawing analysis subdivision coherence distance software method systems users image adopt smooth display algorithm

order efficiency recursion standardization object interfaces graphics imaging sampling scan pattern visualization region module complexity effect cluster


Topology vs generalized rough sets This paper investigates the relationship between topology and generalized rough sets induced by binary relations. Some known results regarding the relation based rough sets are reviewed, and some new results are given. Particularly, the relationship between different topologies corresponding to the same rough set model is examined. These generalized rough sets are induced by inverse serial relations, reflexive relations and pre-order relations, respectively. We point that inverse serial relations are weakest relations which can induce topological spaces, and that different relation based generalized rough set models will induce different topological spaces. We proved that two known topologies corresponding to reflexive relation based rough set model given recently are different, and gave a condition under which the both are the same topology. (C) 2010 Elsevier Inc. All rights reserved.

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

generalized rough set
relation based rough set
topology


A 3D image processing method for manufacturing process automation Three-dimensional (3D) image processing provides a useful tool for machine vision applications. Typically a 3D vision system is divided into data acquisition, low-level processing, object representation and matching. In this paper, a 3D object pose estimation method is developed for an automated manufacturing assembly process. The experimental results show that the 3D pose estimation method produces accurate geometrical information for an automated material handling application. (c) 2005 Elsevier B.V. All rights reserved.

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

range imaging
3d object recognition
pattern recognition
robot vision
manufacturing technology


An ensemble system for automatic sleep stage classification using single channel EEG signal The present work aims at automatic identification of various sleep stages like, sleep stages 1, 2, slow wave sleep (sleep stages 3 and 4), REM sleep and wakefulness from single channel EEG signal. Automatic scoring of sleep stages was performed with the help of pattern recognition technique which involves feature extraction, selection and finally classification. Total 39 numbers of features from time domain, frequency domain and from non-linear analysis were extracted. After extraction of features, SVM based recursive feature elimination (RFE) technique was used to find the optimum number of feature subset which can provide significant classification performance with reduced number of features for the five different sleep stages. Finally for classification, binary SVMs were combined with one-against-all (OAA) strategy. Careful extraction and selection of optimum feature subset helped to reduce the classification error to 8.9% for training dataset, validated by k-fold cross-validation (CV) technique and 10.61% in the case of independent testing dataset. Agreement of the estimated sleep stages with those obtained by expert scoring for all sleep stages of training dataset was 0.877 and for independent testing dataset it was 0.8572. The proposed ensemble SVM-based method could be used as an efficient and cost-effective method for sleep staging with the advantage of reducing stress and burden imposed on subjects.

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

eeg
recursive feature elimination
sleep staging


abstract continuations: a mathematical semantics for handling full jumps Continuation semantics is the traditional mathematical formalism for specifying the semantics of non-local control operations. Modern Lisp-style languages, however, contain advanced control structures like full functional jumps and control delimiters for which continuation semantics is insufficient. We solve this problem by introducing an abstract domain of rests of computations with appropriate operations. Beyond being useful for the problem at hand, these abstract continuations turn out to have applications in a much broader context, e.g. , the explication of parallelism, the modeling of control facilities in parallel languages, and the design of new control structures.

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

applications formalism parallel design functional context continuation control

lisp
abstraction
semantic
control structure
language
operability
model
locality


Real-coded adaptive range genetic algorithm applied to transonic wing optimization Real-coded adaptive range genetic algorithm (ARGA) has been applied to a practical three-dimensional shape optimization for aerodynamic design of an aircraft wing. The real-coded ARGA possesses both advantages of the binary-coded ARGA and the floating-point representation to overcome the problems of having a large search space that requires continuous sampling. The results confirm that the real-coded ARGA consistently finds better solutions than the conventional real-coded genetic algorithms do.

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

real-world application
wing design
dynamic coding
floating-point representation
parallelization
computational fluid dynamics


MulTFRC: Providing Weighted Fairness for Multimedia Applications (and others too!) When data transfers to or from a host happen in parallel, users do not always consider them to have the same importance. Ideally, a transport protocol should therefore allow its users to manipulate the fairness among flows in an almost arbitrary fashion. Since data transfers can also include real-time media streams which need to keep delay - and hence buffers - small, the protocol should also have a smooth sending rate. In an effort to satisfy the above requirements, we present MulTFRC, a congestion control mechanism which is based on the TCP-friendly Rate Control (TFRC) protocol. It emulates the behavior of a number of TFRC flows while maintaining a smooth sending rate. Our simulations and a real-life test demonstrate that MulTFRC performs significantly better than its competitors, potentially making it applicable in a broader range of settings than what TFRC is normally associated with.

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


Study on resist performance of chemically amplified molecular resists based on cyclic oligomers We developed positive-tone chemically amplified molecular resist materials based on cyclic oligomers. We clarified that a small modification of noria resists can cause a significant change in sensitivity. Cyclic oligomers have the potential to offer exceptional resolution as EUV and EB resist materials.

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

chemically amplified resist
extreme ultraviolet
noria derivative
calixarene derivative


molecular communication for nanoscale communication networks Nanoscale networks represent the next step in future communications. They use molecules to encode and transmit the information instead of electromagnetic, optical or acoustic waves, opening up a wealth of new solutions for several applications in biomedical, industrial and military fields. Due to certain limitations, traditional communication technologies are not suitable for nanoscale networks. Hence, nanoscale networks require new solutions such as molecular protocols, molecular channel models, and molecular transceivers for their realization. In this paper, first the concepts of molecular and nanoscale communication are explored by comparing nanoscale networks to traditional networking technologies. Later, the molecular communication, its components, communication phases, and transport methods in a biological system are explained. Then, the process of engineering nanoscale communication networks using molecular communications is discussed along with some of their interesting applications. Moreover, the short and long-range communication scenarios for the nanoscale communication networks are presented and in the end, the current developmental work and open research issues in the area of nanoscale communication networks are highlighted.

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

molecular communication
nanoscale communication networks


Virtually documented environments: A new interface paradigm for task-oriented access to information We present a suitable virtually documented environment system providing the user with high level interaction possibilities. The system is dedicated to applications where the operator needs to have his hands free in order to access information, carry out measurements and/or operate on a device (e.g. maintenance, instruction). The system merges video images acquired through a head-mounted video camera with synthetic data (multimedia documents including CAD models and text) and presents these merged images to the operator. Registration techniques allow the operator to visualise information properly cc nelated to the real world: this is an essential aspect in order to achieve a feeling of presence in a real environment. We increase the sense of immersion through high level Human-Computer Interaction (HCI) allowing hands-free access to information through vocal commands as well as multimodal interaction associating speech and gesture. In this way, the user can access information and manipulate it in a very natural manner. We discuss the construction of the documentation system and the requested functionalities which led to the system architecture.

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

augmented reality
human-computer interaction
information retrieval
video see-through


A statistical method to detect chromosomal regions with DNA copy number alterations using SNP-array-based CGH data Single nucleotide polymorphism (SNP) arrays were used to detect chromosomal regions with DNA copy number alterations. Current statistical methods for microarray-based comparative genomic hybridization (array-CGH) analysis generally assume certain relationships among adjacent markers on the same chromosome, and these assumptions may be questionable. For an SNP-array-based CGH study, multiple normal reference SNP arrays were collected. In order to utilize these normal reference SNP arrays, we derived an empirical distribution of signal ratios for each SNP marker. With an assumed threshold value for the overall error rate control and the defined signal ratio ranges for chromosomal amplification and deletion, we proposed a procedure to identify chromosomal alteration regions based on several bootstrapped one-sample t-tests and the false discovery rate control. When we have multiple arrays for different individuals with the same disease, our method can also be used to detect SNP markers for chromosomal alteration regions that are common among these individuals. We applied our method to a published SNP array data set for breast carcinoma cell lines. For an individual with breast cancer, numerous chromosomal alteration regions were identified. Compared to results of previous studies, our method identified more chromosomal alteration regions, with some being implicated in the literature to harbor genes associated with breast cancer. For multiple cancer arrays, our results suggested the existence of common chromosomal alteration regions. However, a high proportion of false positives also indicated that genetic variations among different individuals with breast cancer can be present.

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

single nucleotide polymorphism (snp) array


INTEGRALITY RATIO FOR GROUP STEINER TREES AND DIRECTED STEINER TREES The natural relaxation for the group Steiner tree problem, as well as for its generalization, the directed Steiner tree problem, is a flow-based linear programming relaxation. We prove new lower bounds on the integrality ratio of this relaxation. For the group Steiner tree problem, we show that the integrality ratio is Omega(log(2) k), where k denotes the number of groups; this holds even for input graphs that are hierarchically well-separated trees, introduced by Bartal [in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 184-193], in which case this lower bound is tight. This also applies for the directed Steiner tree problem. In terms of the number n of vertices, our results for the directed Steiner problem imply an Omega(log(2) n/(log log n)(2)) integrality ratio. For both problems, these are the first lower bounds on the integrality ratio that are superlogarithmic in the input size. This exhibits, for the first time, a relaxation of a natural optimization problem whose integrality ratio is known to be superlogarithmic but subpolynomial. Our results and techniques have been used by Halperin and Krauthgamer [in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 585-594] to show comparable inapproximability results, assuming that NP has no quasi-polynomial Las Vegas algorithms. We also show algorithmically that the integrality ratio for the group Steiner tree problem is much better for certain families of instances, which helps pinpoint the types of instances (parametrized by optimal solutions to their flow-based relaxations) that appear to be most difficult to approximate.

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

group steiner tree
directed steiner tree
linear programming relaxation
integrality ratio

flow-based relaxation
approximation algorithms


The state of the art of application restrictions and sandboxes: A survey of application-oriented access controls and their shortfalls Under most widely-used security mechanisms the programs users run possess more authority than is strictly necessary, with each process typically capable of utilising all of the user's privileges. Consequently such security mechanisms often fail to protect against contemporary threats, such as previously unknown (zero-day) malware and software vulnerabilities, as processes can misuse a user's privileges to behave maliciously. Application restrictions and sandboxes can mitigate threats that traditional approaches to access control fail to prevent by limiting the authority granted to each process. This developing field has become an active area of research, and a variety of solutions have been proposed. However, despite the seriousness of the problem and the security advantages these schemes provide, practical obstacles have restricted their adoption. This paper describes the motivation for application restrictions and sandboxes, presenting an in-depth review of the literature covering existing systems. This is the most comprehensive review of the field to date. The paper outlines the broad categories of existing application-oriented access control schemes, such as isolation and rule-based schemes, and discusses their limitations. Adoption of these schemes has arguably been impeded by workflow, policy complexity, and usability issues. The paper concludes with a discussion on areas for future work, and points a way forward within this developing field of research with recommendations for usability and abstraction to be considered to a further extent when designing application-oriented access controls.

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

literature review
application-oriented access controls
sandboxing
virtualization
confinement


The sensitivity of the inventory model with partial backorders This paper uses the rigorous methods of mathematics to explore the analysis of the sensitivity of Park [Int. J. Syst. Sci. 13 (1982) 1313]. However, Park discusses the analysis of the sensitivity by numerical examples. The results obtained by this paper show that the sensitivity of Park is not always true sometimes. Therefore, the researchers may be very careful to use the conclusions of the analysis of the sensitivity made by numerical examples in general.

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

inventory model
partial backorders
sensitivity


GoS Evaluation for OFDMA Cellular Networks Analytical methods on grade of service (GoS, quantified by the blocking probability which is denoted as \(P_b\)) evaluation in orthogonal frequency division multiple access cellular networks for real-time traffic are important for cell-dimensioning. Existing works use simplified spectral efficiency (SE) models that lead to conservative outcomes. For computing cell-wide and cell-average \(P_b\) the exact but mathematically intractable Kaufman Roberts algorithm (KRA) is indispensable. The Erlang approximation (EA) tractably computes only cell-average \(P_b\) but ignores bandwidth allocation granularity leading to an error of around 25% in typical scenarios. In this work, by using an accurate SE model we show a significant reduction in projected base station (BS) density requirement for maintaining satisfactory cell-average \(P_b\). We show that cell-average \(P_b\) does not completely depict the GoS situation within a cell since there is significant variation of \(P_b\) inside it. Further, we enhance the EA in two ways. Firstly, we improve its accuracy to within 2% of KRA by accounting for bandwidth allocation granularity. Secondly, we extend it to compute cell-wide \(P_b\) like the KRA. The resulting method helps to explain properties such as the linearly increasing trend of region-wise \(P_b\) versus region-index in case of low bit-rate streaming calls. We also use the aforementioned linearly increasing trend to arrive at another alternative to KRA. The development of these two alternatives to KRA highlights certain interesting properties of region-wise and cell-average \(P_b\) as well as the EA. The error in estimated BS density requirement with these alternatives in case of 12.2kbps voice in the interference limited situation is negligibly small. We employ discrete event simulations to validate our models.

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

grade of service
blocking probability
ofdma cellular networks
erlang approximation
kaufman roberts algorithm


Multimedia Systems Research: The First Twenty Years and Lessons for the Next Twenty This retrospective article examines the past two decades of multimedia systems research through the lens of three research topics that were in vogue in the early days of the field and offers perspectives on the evolution of these research topics. We discuss the eventual impact of each line of research and offer lessons for future research in the field.

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


A spatially-factored fully implicit solution method for block structured meshes with irregular nodes The alternating direction multi-zone implicit (ADMZI) method for solving implicitly structured multizone domains by spatial factorization techniques is extended to block structured domains that include irregular nodes, i.e. nodes that have a different connectivity with the neighboring nodes. It is shown for fully implicit schemes that the presence of irregular nodes tin the two-dimensional case) imposes the use of a mixed stage in the ADI factorization, in addition to the two standard stages. In the mixed stage, there are parts where the equations of the first stage are solved, while in the other parts the first stage has been previously completed and the equations of the second stage are being solved. It is proven that the overall second-order temporal accuracy of the solution is preserved. Generalized ADMZI sweeps are defined to allow a consistent and unified approach to all the ADMZI factorization stages, including the mixed stage. This novel methodology can be employed for solving implicitly many existing solvers of systems of partial differential equations, such as the Navier-Stokes equations, using spatially factored techniques and block structured meshes with irregular nodes. The resulting scheme is efficient because the computational work is equivalent to a single iteration Of most other existing iterative solvers. (C) 1999 Elsevier Science Ltd. All rights reserved.

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

multi-zones
implicit methods
approximate-factorization


The "raven paradox" in the light of probability theory This paper deals with the well-known raven paradox, also named the paradox of black ravens, one of the most renowned paradoxes arising from the confirmation procedures for universal statements of empirical theories. Its aim is to show that the paradox owes its origin to a number of very drastic positions about the form in which such universal statements should be expressed, and the confirmation value the indirect observations (i.e., observations not explicitly carried out on ravens) should be deemed to have. More specifically, we suggest that the use of the formal language of calculus of predicates (and, correspondingly, of set theory) is uncorrect in the framework of empirical theories, and that, when using only statements about probabilities of events rather than about probabilities of truth of statements, and choosing a suitable confirmation procedure based on the law of large numbers, a comparison between the confirmation values of direct and indirect observations becomes clear and the paradox, at least as it has been described, disappears. (C) 2003 Elsevier Ltd. All rights reserved.

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

random variables
identification
stochastic models
uncertainty


RPU: A programmable Ray Processing Unit for realtime ray tracing Recursive ray tracing is a simple yet powerful and general approach for accurately computing global light transport and rendering high quality images. While recent algorithmic improvements and optimized parallel software implementations have increased ray tracing performance to realtime levels, no compact and programmable hardware solution has been available yet. This paper describes the architecture and a prototype implementation of a single chip, fully programmable Ray Processing Unit (RPU). It combines the flexibility of general purpose CPUs with the efficiency of current GPUs for data parallel computations. This design allows for realtime ray tracing of dynamic scenes with programmable material, geometry, and illumination shaders. Although, running at only 66 MHz the prototype FPGA implementation already renders images at up to 20 frames per second, which in many cases beats the performance of highly optimized software running on multi-GHz desktop CPUs. The performance and efficiency of the proposed architecture is analyzed using a variety of benchmark scenes.

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

hardware architecture
programmable shading


A Survey of Results on Stateless Multicounter Automata A stateless multicounter machine has m-counters operating on a one-way input delimited by left and right end markers. A move of the machine depends only on the symbol under the input head and the sign pattern of the counters. An input string is accepted if, when the input head is started on the left end marker with all counters zero, the machine eventually reaches the configuration where the input head is on the right end marker with all the counters again zero. We bring together a number of results on stateless multicounter automata of various different types: deterministic, nondeterministic, realtime (the input head moves right at every step), or non-realtime. We investigate realtime and non-realtime machines in both deterministic and nondeterministic cases with respect to the number of counters and reversals. In addition to hierarchy results, we also consider closure properties and the connections to stateless multihead automata.

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

realtime
hierarchy
stateless multihead automata
closure properties

stateless multicounter machines
reversal-bounded
non-realtime


Temperature control in three-network on chips using task migration Combination of three-dimensional (3D) IC technology and network on chip (NoC) is an effective solution to increase system scalability and also alleviate the interconnect problem in large-scale integrated circuits. However, because of the increased power density in 3D NoC systems and the destructive effect of high temperatures on chip reliability, applying thermal management solutions becomes crucial in such circuits. In this study, the authors propose a runtime distributed migration algorithm based on game theory to balance the heat dissipation among processing elements (PEs) in a 3D NoC chip multiprocessor. The objective of this algorithm is to minimise the 3D NoC system's peak temperature, as well as the overhead imposed on chip performance during migration. Owing to the high thermal correlation between adjacent PEs in the same stack in 3D NoCs, the authors model this multi-objective problem as a cooperative game. The simulation results indicate upto 23 and 27% decrease in peak temperature, for the benchmarks that have the highest communication rate and the largest number of tasks, respectively. This comes at the price of slight migration overhead in terms of power-delay product.

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

game theory
reliability
temperature control
task migration
3d ic technology
network on chip
interconnect problem
power density
thermal management
runtime distributed migration algorithm
heat dissipation
3d noc chip multiprocessor
thermal correlation
cooperative game

network-on-chip
thermal management (packaging)
three-dimensional ic technology
large-scale integrated circuit
power-delay product


Road Oriented Traffic Information System for Vehicular Ad hoc Networks Over the last few years, vehicular ad hoc networks (VANETs) have gained popularity for their interesting applications. To make efficient routing decisions, VANET routing protocols require road traffic density information for which they use density estimation schemes. This paper presents a distributed mechanism for road vehicular density estimation that considers multiple road factors, such as road length and junctions. Extensive simulations are carried out to analyze the effectiveness of the proposed technique. Simulation results suggested that, the proposed technique is more accurate compared to the existing technique. Moreover, it facilitate VANET routing protocols to increase packet delivery ratio and reduce end-to-end delay.

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

vanets road traffic estimation
infrastructure-free traffic estimation
traffic estimation for vanets routing
vanets cell density packet
vehicular ad hoc network


building tcl-tk guis for hrt-hood systems This work explores Tcl-Tk 8.0 as a building tool for script-based GUIs in Ada95 real-time systems. Tcl-Tk 8.0 is a library that makes graphic programming easier, but it suffers from being non-thread-safe. An application architecture is proposed, the deferred server, which provides transparent use of Tcl-Tk to multithreaded Ada95 applications via TASH, a thick binding that allows Ada95 single-threaded code to use Tcl-Tk. We find that only a minimal extension to Tcl-Tk 8.0 and TASH is required to support it, while a successful prototype has been implemented based on these ideas. Likewise, the early integration of Tcl-Tk graphic user interfaces in HRT-HOOD designs is examined; unfortunately, in this respect, we conclude that this is not feasible. However, a HRT-HOOD conform distributed configuration is outlined in wich the user interface becomes a multithreaded remote service based on the deferred server architecture.

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


Uniform Convergence of Discrete Curvatures from Nets of Curvature Lines We study discrete curvatures computed from nets of curvature lines on a given smooth surface and prove their uniform convergence to smooth principal curvatures. We provide explicit error bounds, with constants depending only on properties of the smooth limit surface and the shape regularity of the discrete net.

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


Acoustic model adaptation using in-domain background models for dysarthric speech recognition ? Speech production errors characteristic of dysarthria are chiefly responsible for the low accuracy of automatic speech recognition (ASR) when used by people diagnosed with it. A person with dysarthria produces speech in a rather reduced acoustic working space, causing typical measures of speech acoustics to have values in ranges very different from those characterizing unimpaired speech. It is unlikely then that models trained on unimpaired speech will be able to adjust to this mismatch when acted on by one of the currently well-studied adaptation algorithms (which make no attempt to address this extent of mismatch in population characteristics). In this work, we propose an interpolation-based technique for obtaining a prior acoustic model from one trained on unimpaired speech, before adapting it to the dysarthric talker. The method computes a background model of the dysarthric talker's general speech characteristics and uses it to obtain a more suitable prior model for adaptation (compared to the speaker-independent model trained on unimpaired speech). The approach is tested with a corpus of dysarthric speech acquired by our research group, on speech of sixteen talkers with varying levels of dysarthria severity (as quantified by their intelligibility). This interpolation technique is tested in conjunction with the well-known maximum a posteriori (MAP) adaptation algorithm, and yields improvements of up to 8% absolute and up to 40% relative, over the standard MAP adapted baseline.

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

dysarthria
acoustic model
adaptation
map


towards design tools for protocol development Interaction protocols enable agents to communicate with each other effectively. Whereas several approaches exist to specify interaction protocols, none of them has design tools that can help protocol designers catch semantical protocol errors at design time. As research in networking protocols has shown, flawed specifications of protocols can have disastrous consequences. Hence, it is crucial to systematically analyze protocols in time to ensure correct specification. This paper studies and formalizes important generic properties of commitment protocols that can ease their correct development significantly. Since these properties are formal, they can easily be incorporated in a software tool to (semi-)automate the design and specification of commitment protocols. Where appropriate we provide algorithms that can directly be used to check these properties in such a design tool.

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


Optimal row and column ordering to improve table interpretation using estimation of distribution algorithms A common information representation task in research as well as educational and statistical practice is to comprehensively and intuitively express data in two-dimensional tables. Examples include tables in scientific papers, as well as reports and the popular press. Data is often simple enough for users to reorder. In many other cases though, there are complex data patterns that make finding the best re-arrangement of rows and columns for optimum readability a tough problem. We propose that row and column ordering should be regarded as a combinatorial optimization problem and solved using evolutionary computation techniques. The use of genetic algorithms has already been proposed in the literature. This paper proposes for the first time the use of estimation of distribution algorithms for table ordering. We also propose alternative ways of representing the problem in order to reduce its dimensionality. By learning a selective naive Bayes classifier, we can find out how to jointly combine the parameters of these algorithms to get good table orderings. Experimental examples in this paper are on 2D tables.

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

estimation of distribution algorithms
selective naive bayes

bertin matrices
ordering of tables
conciseness
parametrization


Paged absolute addressing mode optimizations for embedded digital signal processors using post-pass data-flow analysis We address the problem of code generation for embedded DSP systems. In such systems, it is typical for one or more digital signal processors (DSPs), program memory, and custom circuitry to be integrated onto a single IC. Consequently, the amount of silicon area that is dedicated to program memory is limited, so the embedded software must be sufficiently dense. Additionally, this software must be written so as to meet various high-performance constraints, which may include hard real-time constraints. Unfortunately, existing compiler technology is unable to generate dense, high-performance code for DSPs since it does not provide adequate support for the specialized architectural features of DSPs. These specialized features not only allow for the fast execution of common DSP operations, but they also allow for the generation of dense assembly code that specifies these operations. Thus, system designers often hand-program the embedded software in assembly, which is a very time-consuming task. In this paper, we focus on providing compiler support for one particular specialized architectural feature, namely the paged absolute addressing mode - this feature is found in two commercial DSPs, the Texas Instruments' TMS320C25 and TMS320C50 fixed-point DSPs; however, it may also be featured in application-specific processors (ASIPs). We present some machine-dependent code optimizations that improve code density by exploiting this architectural feature. Experimental results demonstrate that for a set of typical DSP benchmarks, some of our optimizations reduce overall code size and data memory consumption by an average of 5.0% and 16.0%, respectively. Our experimental vehicle throughout this research is the TMS320C25.(1)

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

basic block
control-flow graph
data-flow analysis


PD and fuzzy logic control for earthquake resilient structures This research was conducted within the framework of a National Science Foundation sponsored summer Research Experience for Undergraduate (REU) students. This research considers small-scale and mathematical models of simple one-story structures that are subjected to free and base-motion excitations and installed with and without passive damping devices to gain an understanding of their dynamic behavior while reviewing active and semi-active damping means being applied and researched today. Using computer programming and numerical methods, the goal is to understand and counteract catastrophic disasters to structures caused by earthquakes. The research is broken down into a number of MATLAB simulations and experiments in order to understand basic dynamic and control features required to design earthquake resilient buildings. These experiments include free vibration experiments to test for the stiffness of columns for different heights and to test for the natural frequency and damping ratio of a one-story structure under different mass loads. Active PD control was then applied to an experimental system experiencing accelerations attributed to the Northridge 1994, Kobe 1995, El Centro 1940, and Mendocino 1992 earthquakes. Robustness comparisons were made between (1) P control; (2) D control; and (3) PD control for the above earthquake inputs to the shaker. A fuzzy logic controller was developed to effectively control transient vibrations. The uniqueness of this control concept is that the fuzzy control continuously varies the damping characteristics of a semi-active tuned mass damper (TMD). It was concluded that a fuzzy logic based TMD was more effective than a regular passive TMD, by providing half the settling times. 2012 Wiley Periodicals, Inc. Comput Appl Eng Educ 22: 142152, 2014

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

earthquake resilient structures
fuzzy logic control

seismic response
tuned mass dampers
active control
passive control