Minimum-distance bounds by graph analysis The parity-check matrix of a linear code is used to define a bipartite code constraint (Tanner) graph in which bit nodes are connected to parity-check nodes. The connectivity properties of this graph are analyzed using both local connectivity and the eigenvalues of the associated adjacency matrix, A simple lower bound on the minimum distance of the code is expressed in terms of the two largest eigenvalues, For a more powerful bound, local properties of the subgraph corresponding to a minimum-weight word in the code are used to create an optimization problem whose solution is a lower bound on the code's minimum distance, Linear programming gives one bound. The technique is illustrated by applying it to sparse block codes with parameters [7, 3, 4] and [42, 23, 6].

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

code graph
error-correcting codes
minimum distance bound


proving the correctness of a flight-director program for an airborne minicomputer Over the past five years, our research efforts have been devoted in large part to developing techniques for proving the correctness of assembly-language and machine-language programs running on actual computers. In this paper, we report upon an effort to put this work into practice by proving the correctness of a program written for the Litton C4000 airborne computer. This includes overflow analysis, non-self-modification analysis, round-off and truncation analysis, fixed-point scaling considerations, and analysis of the sub-routine parameter and return-address conventions used in the given program. The basic method we use is the inductive assertion method of (Floyd, 1967), suitably modified and extended for application to a machine-language situation.

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

program research use method analysis correctness paper

situated applications scale language computation addressing assemblers fixed-points inductance practical assert


Bandwidth guaranteed call admission in TDMA/CDMA ad hoc wireless networks This paper first studied the timeslot assignment problem in time division multiple access/code division multiple access (TDMA/CDMA) wireless ad hoc networks. Given a path P, we prove that a timeslot assignment providing one unit of bandwidth on P can be found in O(?P?) time if such an assignment exists. The results have been extended to the case that P can provide two units of bandwidth. Based on the timeslot assignment for the special cases, an efficient slot assignment algorithm with O(?P?2k) is proposed for general cases, where k is the number of slots in a TDMA frame. Then, the timeslot assignment algorithm is integrated into a quality of service (QoS) call admission scheme for QoS call requests. Extensive simulations are conducted and the results have demonstrated the superior performance of our method.

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

bandwidth reservation
qos routing
tdma/cdma


A time-scale decomposition approach to measurement-based admission control We propose a time-scale decomposition approach to measurement-based admission control (MBAC). We identify a critical time scale (T) over tilde (h) such that: 1) aggregate traffic fluctuation slower than (T) over tilde (h) can be tracked by the admission controller and compensated for by flow admissions and departures; and 2) fluctuations faster than (T) over tilde (h) have to be absorbed by reserving spare bandwidth on the link. The critical time scale is shown to scale as T-h / rootn, where T-h is the average flow duration and n is the size of the link in terms of number of flows it can carry. An MBAC design is presented which filters aggregate measurements into low- and high-frequency components separated at the cutoff frequency 1/(T) over tilde (h), using the low-frequency component to track slow time-scale traffic fluctuations and the high-frequency component to estimate the spare bandwidth needed. Our analysis shows that the scheme achieves high utilization and is robust to traffic heterogeneity, multiple time-scale fluctuations and measurement errors. The scheme uses only measurements of aggregate bandwidth and does not need to keep track of per-flow information.

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


research based methods for using powerpoint, animation, and video for instruction This paper is a literature review on practical techniques and guidelines using PowerPoint, animation, and video effectively for instruction. The motivation to collect research based guidelines for the creation and use of instructional media comes from Giordano and Trufant's observation that one of the common barriers that prevent faculty from successfully integrating technology into their teaching is a "lack of familiarity with best practices, knowledge, and research on the appropriate uses of technology in the classroom" [1]. This paper would be of interest to faculty and instructional technology staff who support faculty in the development of instructional media.

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

powerpoint
video
animation
literature review

pedagogy
multi-media authoring
faculty training


Multi-scale extension of PLS algorithm for advanced on-line process monitoring Typical process measurements are usually correlated with each other and compounded with various phenomena occurring at different time and frequency domains. To take into account this multivariate and multi-scale nature of process dynamics, a multi-scale PLS (MSPLS) algorithm combining PLs and wavelet analysis is proposed. The MSPLS first decomposes the process measurements into separated multi-scale components using on-line wavelet transform, and then the resultant multi-scale data blocks are modeled in the framework of multi-block PLS algorithm which can describe the global relationships across the entire scale blocks as well as the localized features within each sub-block at detailed resolutions. To demonstrate the feasibility of the MSPLS method, its process monitoring abilities were tested not only for the simulated data sets containing several fault scenarios but also for a real industrial data set, and compared with the monitoring abilities of the standard PLS method on the quantitative basis. The results clearly showed that the MSPL5 was superior to the standard PLS for all cases especially in that it could provide additional scale-level information about the fault characteristics as well as more sensitive fault detection ability. (c) 2009 Elsevier B.V. All rights reserved.

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


Modeling and augmenting game entertainment through challenge and curiosity This paper presents quantitative measurements/metrics of qualitative entertainment features within computer game environments and proposes artificial intelligence (AI) techniques for optimizing entertainment in such interactive systems. A human-verified metric of interest (i.e. player entertainment in real-time) for predator/prey games and a neuro-evolution on-line learning (i. e. during play) approach have already been reported in the literature to serve this purpose. In this paper, an alternative quantitative approach to entertainment modeling based on psychological studies in the field of computer games is introduced and a comparative study of the two approaches is presented. Feedforward neural networks (NNs) and fuzzy-NNs are used to model player satisfaction (interest) in real-time and investigate quantitatively how the qualitative factors of challenge and curiosity contribute to human entertainment. We demonstrate that appropriate non-extreme levels of challenge and curiosity generate high values of entertainment and we project the extensibility of the approach to other genres of digital entertainment (e.g. mixed-reality interactive playgrounds).

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

mixed-reality games
artificial neural networks


A robust absorbing layer method for anisotropic seismic wave modeling When applied to wave propagation modeling in anisotropic media, Perfectly Matched Layers (PML) exhibit instabilities. Incoming waves are amplified instead of being absorbed. Overcoming this difficulty is crucial as in many seismic imaging applications, accounting accurately for the subsurface anisotropy is mandatory. In this study, we present the SMART layer method as an alternative to PML approach. This method is based on the decomposition of the wavefield into components propagating inward and outward the domain of interest. Only outgoing components are damped. We show that for elastic and acoustic wave propagation in Transverse Isotropic media, the SMART layer is unconditionally dissipative: no amplification of the wavefield is possible. The SMART layers are not perfectly matched, therefore less accurate than conventional PML. However, a reasonable increase of the layer size yields an accuracy similar to PML. Finally, we illustrate that the selective damping strategy on which is based the SMART method can prevent the generation of spurious S-waves by embedding the source in a small zone where only S-waves are damped.

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

seismic wave modeling
perfectly matched layers
anisotropy


The lower bounds on the second order nonlinearity of three classes of Boolean functions with high nonlinearity The rth order nonlinearity of Boolean functions is an important cryptographic criterion associated with some attacks on stream and block ciphers. It is also very useful in coding theory, since it is related to the covering radii of Reed-Muller codes. This paper tightens the lower bounds of the second order nonlinearity of three classes of Boolean functions in the form f(x) = tr(x(d)) in n variables, where (1) d = 2(m+1) + 3 and n = 2m, or (2) d = 2m + 2m+1/2 +1, n =2m and m is odd. or (3) d = 2(2r) + 2(r+1) + 1 and n = 4r. (c) 2008 Elsevier Inc, All rights reserved.

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

boolean function
cryptography
derivation
walsh coefficient
reed-muller code


A-contrario Detectability of Spots in Textured Backgrounds Using the a-contrario framework recently introduced in the modeling of human visual perception, we build a statistical model to predict the detectability of a spot on a textured background. Contrary to classical formalisms (ideal observer and its extensions), which assume a known probability distribution for the signal to be detected, the a-contrario observer we build only relies on gestalt-driven measurements and on an approximate representation of the background texture. It extends the scope of previous a-contrario detectors by using a non-i.i.d. naive model and a notion of local context. The models we propose are first validated theoretically in the case of powerlaw textures, which are, in particular, classical models for mammograms. Then, going to more general microtextures (colored noise processes), we compute the relationship between the size of a spot and the minimum contrast required to reach a given detectability threshold according to the a-contrario observer. Three main types of microtextures pop out from this characterization, and in particular low-frequency textures for which curiously enough, the contrast being given, the most salient spots are the smallest ones. Last, we illustrate the interest of the a-contrario observer for two real applications: the detectability of opacities in mammograms and the perception of stains on pieces of clothing.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-contrario
detection
colored noise process
fractional brownian motion
mammography


JPEG2000-Based Scalable Interactive Video (JSIV) We propose a novel paradigm for interactive video streaming and we coin the term JPEG2000-based scalable interactive video (JSIV) for it. JSIV utilizes JPEG2000 to independently compress the original video sequence frames and provide for quality and spatial resolution scalability. To exploit interframe redundancy, JSIV utilizes prediction and conditional replenishment of code-blocks aided by a server policy that optimally selects the number of quality layer for each code-block transmitted and a client policy that makes most of the received (distorted) frames. It is also possible for JSIV to employ motion compensation; however, we leave this topic to future work. To optimally solve the server transmission problem, a Lagrangian-style rate-distortion optimization procedure is employed. In JSIV, a wide variety of frame prediction arrangements can be employed including hierarchical B-frames of the scalable video coding (SVC) extension of the H.264/AVC standard. JSIV provides considerably better interactivity compared to existing schemes and can adapt immediately to interactive changes in client interests, such as forward or backward playback and zooming into individual frames. Experimental results for surveillance footage, which does not suffer from the absence of motion compensation, show that JSIV's performance is comparable to that of SVC in some usage scenarios while JSIV performs better in others.

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

image coding
image communication
teleconferencing
video signal processing
weighted acyclic directed graphs


Online behavior change detection in computer games We apply a change detection algorithm to the games domain. Three extensions are proposed to the algorithm. Results suggest the improvement provided by the extensions. Results show our approach surpasses other change detection algorithms.

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

online player modeling
data stream mining


Design and evaluation of an ontology based information extraction system for radiological reports This paper describes an information extraction system that extracts and converts the available information in free text Turkish radiology reports into a structured information model using manually created extraction rules and domain ontology. The ontology provides flexibility in the design of extraction rules, and determines the information model for the extracted semantic information. Although our information extraction system mainly concentrates on abdominal radiology reports, the system can be used in another field of medicine by adapting its ontology and extraction rule set. We achieved very high precision and recall results during the evaluation of the developed system with unseen radiology reports.

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

information extraction
ontology
turkish radiology reports

natural language processing
medical language processing


The role of the kinetic parameter in the stability of two-relaxation-time advection-diffusion lattice Boltzmann schemes In general, explicit numerical schemes are only conditionally stable. A particularity of lattice Boltzmann multiple-relaxation-time (MRT) schemes is the presence of free ("kinetic") relaxation parameters. They do not appear in the transport coefficients of the modelled second-order (macroscopic) equations but they have an impact on the effective accuracy and stability of the algorithm. The simplest uniform choice (the well known BGK/SRT model) is often inadequate, and therefore a compromise in the complexity of the model is sought. For this purpose, the von Neumann stability analysis is performed for the d1Q3 two-relaxation-time (TRT) advection-diffusion model. The extended optimal (EOTRT) model, which relates the two collision times such that the most stable scheme is set by a suitable choice of the equilibrium parameters, equal for any Peclet number, is then developed. This extends the very recently derived optimal subclass (OTRT) to larger combinations of "physical" and "kinetic" collision rates. Next, we provide the necessary and/or sufficient stability limits on the EOTRT subclass for a wide range of velocity sets, with and without numerical diffusion, and delineate the interesting choices of free equilibrium weights for the d2Q9 and d3Q15 models. The BGK/SRT model is without advanced advection properties; we prove (for minimal stencil schemes d1Q3, d2Q5 and d3Q7) that the non-negativity of the equilibrium distribution is necessary for its stability in the advection-dominated limit. Beyond the EOTRT and BGK/SRT subclasses of the TRT model, blind choices of the "ghost" collision number may result in quite unstable schemes, even for positive equilibrium. However, we find that the d1Q3 stability curves govern the advection properties of the multi-dimensional models and a fuller picture of the TRT stability properties begins to emerge. (C) 2010 Elsevier Ltd. All rights reserved.

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

lattice boltzmann schemes
von neumann stability analysis
numerical diffusion
trt


A project scheduling approach to production and material requirement planning in Manufacturing-to-Order environments Long- and medium-term production planning are tools to match production orders with resource capacity and that can also be used as a baseline for material procurement. The lack of a detailed schedule for the manufacturing operations, however, may cause difficulties in providing a proper material requirements planning and may affect the feasibility of the production plan itself. This paper proposes an approach, based on production process knowledge, to extract scheduling information from an aggregate production plan in order to support material procurement. The proposed approach is applied to an industrial case involving machining center production.

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

production planning
material requirement planning


Process languages and nets A new formulation for elementary net processes and their sequential composition (concatenation) is given. Algebra of subsets of the monoid of processes, that is, process languages, is developed. Analysis and synthesis problems for this algebra are stated and served. A type of concurrency represented in the processes is discussed, as well as relation between string languages and process languages or branching processes. (C) 2000 Elsevier Science B.V. All rights reserved.

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

elementary net
process
analysis and synthesis
concurrency


Optimization of p-xylene oxidation reaction process based on self-adaptive multi-objective differential evolution Purified terephthalic acid (PTA) is used for producing a variety of polyesters. In the production of PTA, p-xylene (PX) is first transformed into terephthalic acid (TA) by oxidation process and then TA is refined. As a key step, the oxidation of PX to TA is a significant chemical process of PTA production. To improve qualified product yield with low energy consumption, in this paper, multi-objective optimization of various conflicting objectives (namely minimization of combustion loss, maximization of TA yield) is conducted using self-adaptive multi-objective differential evolution algorithm (SADE). The main characteristic of it is that DE's trial vector generation strategies and the corresponding control parameters are gradually self-adjusted adaptively based on the knowledge learnt from the previous searches in generating improved solutions. Furthermore, to handle constraints in multi-objective problems, the pseudo feasible concept is proposed to effectively utilize the critical information carried by some infeasible solutions. Optimization results of PX oxidation reaction process indicate that application of SADE can greatly improve the yield of TA with low combustion loss without degenerating TA quality. Furthermore, SADE can provide a set of Pareto optimal solutions and then suitable multi-criterion decision-making techniques can be employed to select one or a small set of the optimal solution(s) of design parameter(s) based on preference. (C) 2013 Elsevier B.V. All rights reserved.

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

purified terephthalic acid
differential evolution

p-xylene oxidation
operation condition optimization
multi-objective optimization


adaptive sampling based on fuzzy inference Monte Carlo is the only choice for a physically correct method to do global illumination in the field of realistic image rendering. Adaptive sampling is an appealing means to reduce noise, which is resulted from the general Monte Carlo global illumination algorithms. In this paper, we take advantage of fuzzy rule-based reasoning to achieve different refinement thresholds for different pixels in the synthesized image. The developed technique can do adaptive sampling elaborately and effectively. Extensive implementation results indicate that our novel method can achieve significantly better than classic ones. To our knowledge, this is the first application of the fuzzy inference to global illumination.

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


A Fuzzy Approach for Robust Reference-Tracking-Control Design of Nonlinear Distributed Parameter Time-Delayed Systems and Its Application This paper addresses the robust reference-tracking-control problem for nonlinear distributed parameter systems (NDPSs) with time delays, external disturbances, and measurement noises. The NDPS is measured at several sensor locations for output-feedback tracking control. A fuzzy-spatial state-space model derived via finite-difference approach is introduced to represent the nonlinear distributed parameter time-delayed system. Thus, we use a fuzzy interpolation method with several local linear systems to approximate the nonlinear system and employ the finite-difference method to approximate the partial differential operators in fuzzy-spatial state-space model. Based on this model, a robust fuzzy-observer-based reference-tracking controller is proposed to control the NDPS to track a desired reference trajectory. First, a 2-D H-infinity tracking performance in a spatiotemporal domain is proposed for robust tracking design of nonlinear distributed parameter time-delayed systems. Then, an equivalent 1-D H-infinity reference-tracking design is developed to simplify the design procedure, and the linear-matrix-inequality (LMI) technique is applied to solve the control gains and observer gains for the robust H-infinity tracking-design problem via a systematic control-design procedure. Finally, a tracking-control-design example for the nervous system is given to confirm the proposed reference-tracking-control scheme of nonlinear distributed parameter time-delayed systems.

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

nonlinear distributed parameter systems (ndpss)


Optimistic MILP modeling of non-linear optimization problems We present a new piecewise linear approximation of non-linear optimization problems. It is a variant of classical triangulations that leaves more degrees of freedom. We show theoretical properties of the approximating functions. We provide computational evidence of the impact within MILP models.

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


Active contours driven by local image fitting energy A new region-based active contour model that embeds the image local information is proposed in this paper. By introducing the local image fitting (LIF) energy to extract the local image information, our model is able to segment images with intensity inhomogeneities. Moreover, a novel method based on Gaussian filtering for variational level set is proposed to regularize the level set function. It can not only ensure the smoothness of the level set function, but also eliminate the requirement of re-initialization, which is very computationally expensive. Experiments show that the proposed method achieves similar results to the LBF (local binary fitting) energy model but it is much more computationally efficient. In addition, our approach maintains the sub-pixel accuracy and boundary regularization properties.

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

image segmentation
chanvese (cv) model
active contour models
lbf model


A cross-cultural analysis of the end-user computing satisfaction instrument: A multi-group invariance analysis IT managers in global firms often rely on user evaluations to guide their decision-making in adopting, implementing, and monitoring the effectiveness of enterprise systems across national cultures. In these decisions, managers need instruments that provide valid comparisons across cultures. Using samples representing five nations/world regions including the US, Western Europe, Saudi Arabia, India, and Taiwan, we used multi-group invariance analysis to evaluate whether the end-user computing satisfaction (EUCS) instrument (12-item summed scale and five factors) provided equivalent measurement across cultures. The results provided evidence that the EUCS instrument's 12-item scale and the five factors were equivalent across the cultures we examined. The implications of this for the global management of technology are discussed. Knowledge of the equivalence of MIS instruments across national cultures can enhance the MIS cross-cultural research agenda.

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

end-user computing satisfaction (eucs)
user satisfaction
enterprise wide applications
cross-cultural
technologies adoption


queueing models and stability of message flows in distributed simulators of open queueing networks In this paper we study message flow processes in distributed simulators of open queueing networks. We develop and study queueing models for distributed simulators with maximum lookahead sequencing. We characterize the "external'' arrival process, and the message feedback process in the simulator of a simple queueing network with feedback. We show that a certain "natural'' modelling construct for the arrival process is exactly correct, whereas an ``obvious'' model for the feedback process is wrong; we then show how to develop the correct model. Our analysis throws light on the stability of distributed simulators of queueing networks with feedback. We show how the stability of such simulators depends on the parameters of the queueing network.

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

queueing networks
stability
maximum lookahead

discrete event simulation
distributed simulation


Cellulases of Mesophilic Microorganisms The cellulolytic activity of mesophilic bacteria and fungi is described, with special emphasis on the large extracellular enzyme complex called the cellulosome. The cellulosome is composed of a scaffolding protein, which is attached to various cellulolytic and hemicellulolytic enzymes, and this complex allows the organisms to degrade plant cell walls very efficently. The enzymes include a variety of cellulases, hemicellulases, and pectinases that work synergistically to degrade complex cell-wall molecules.

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


Toward the reusability for iterative linear algebra software in distributed environment ? LAKe (Linear Algebra Kernel) is a linear algebra class library developed using an object oriented approach in order to enable a good reuse code for sequential or parallel linear algebra applications. An application implemented using LAKe can be run either in sequential or in parallel mode using the same code. This paper proposes an extension to the LAKe library, which enables an implemented method to run in sequential and parallel mode simultaneously. This extension of LAKe allows a concurrent reuse of sequential and parallel components inside the same linear algebra application. To take advantage of such concurrent reusability, the sequential and parallel components have to be able to collaborate with each other. The hybrid methods need such properties to run. These methods are defined by a combination of several numerical techniques, or several copies of the same method parameterized differently in order to accelerate the convergence and/or to improve the accuracy of the solution of a given large linear algebra problem. In order to validate our approach, we present some numerical experiments, making use of a hybrid method with the proposed extension of LAKe.

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

parallel and sequential code reuse
genericity
explicit restarting
krylov subspace methods
asynchronous communication


Pseudopin assignment with crosstalk noise control This paper presents a new pseudopin assignment (PPA) algorithm with crosstalk noise control in multilayer gridless general-area routing, We propose a two-step approach that considers obstacles and minimizes the weighted sum of total mire length and the estimated number of vias under crosstalk noise constraints. We test our algorithms on a set of MCM examples and a set of standard-cell examples. Without crosstalk noise control in PPA, the average noise in the MCM test cases after detailed routing is 0.13-0.22 V-DD with up to 11% of nets larger than 0.3 V-DD. However, if the noise constraint of each net is set to 0.3 V-DD in PPA, the average noise in each case reduces to 0.11-0.15 V-DD (15%31% reduction) with no crosstalk noise violations, Most of the nets in our standard-cell test cases do not have noise problems. Our PPA algorithms still give better noise distributions and have 1%-10% noise reduction on the global nets in these standard-cell test cases. Even without ripup and reroute, the detailed routing completion rate is 93%-99% and the average vias per net is only 0.7-1.4 for our MCM test cases and 1.0-1.7 for our standard-cell test cases.

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

deep submicrometer
gridless routing
noise analysis


bounding stationary results of tandem networks with map input and ph service time distributions In this paper, we propose a new approach to compute bounds on stationary measures of queueing systems with an input process described by a Markovian Arrival Process (MAP) and a sequence of stations with Phase Type (PH) service time distributions. Such queueing systems cannot be solved exactly since they have an infinite state space in several natural dimensions. Based on earlier work on the computation of bounds for specific classes of infinite Markov chains, the paper presents a new approach specifically tailored to the analysis of the mentioned class of queueing networks. By increasing the size of the state space of the aggregated Markov chain to be solved for bound computation, bounds can be made arbitrarily tight, but practical limits come up due to the computational complexity. However, we show by means of several examples that tight bounds can be derived with low effort for a large set of queueing systems in the mentioned class.

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


a gir architecture with semantic-flavored query reformulation Most geographic queries include references to entities (geographic and non-geographic). Grounding such entities is essential to properly understand the user's information need. As statistical-based query reformulation strategies work at term level, not entity level, they don't use the semantic information given by such entities, which is considerably relevant for the types of queries that should be handled by GIR systems. We motivate the need of a semantic-flavored query reformulation approach for geographic information retrieval systems and describe a GIR architecture where query reformulation focuses on i) grounding entities in the query, ii) selecting a reasoning strategy according to the user information need, and iii) generating a reformulated query containing answers and related entities for a more focused retrieval step. Reformulated queries obtain the answers by accessing a knowledge base.

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

geographic ontology
geographical information retrieval
evaluation
information management


Semantics of Query-Driven Communication of Exact Values We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet efficiently. We extend the established concept of lazy communication using streams of approximants by introducing explicit queries. We formalise this approach using protocols of a query-answer nature. Such protocols enable processes to provide valid approximations with certain accuracy and focusing on certain locality as demanded by the receiving processes through queries. A lattice-theoretic denotational semantics of channel and process behaviour is developed. The query space is modelled as a continuous lattice in which the top element denotes the query demanding all the information, whereas other elements denote queries demanding partial and/or local information. Answers are interpreted as elements of lattices constructed over suitable domains of approximations to the exact objects. An unanswered query is treated as an error and denoted using the top element. The major novel characteristic of our semantic model is that it reflects the dependency of answers on queries. This enables the definition and analysis of an appropriate concept of convergence rate, by assigning an effort indicator to each query and a measure of information content to each answer. Thus we capture not only what function a process computes, but also how a process transforms the convergence rates from its inputs to its outputs. In future work these indicators can be used to capture further computational complexity measures. A robust prototype implementation of our model is available.

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

exact real computation
distributed computation
dataflow networks
domain theory


On the analysis of "simple" 2D stochastic cellular automata Cellular automata are usually associated with synchronous deterministic dynamics, and their asynchronous or stochastic versions have been far less studied although significant for modeling purposes. This paper analyzes the dynamics of a two-dimensional cellular automaton, 2D Minority, for the Moore neighborhood (eight closest neighbors of each cell) under fully asynchronous dynamics (where one single random cell updates at each time step). 2D Minority may appear as a simple rule, but It is known from the experience of Ising models and Hopfield nets that 2D models with negative feedback are hard to study. This automaton actually presents a rich variety of behaviors, even more complex that what has been observed and analyzed in a previous work on 2D Minority for the von Neumann neighborhood (four neighbors to each cell) (2007) This paper confirms the relevance of the later approach (definition of energy functions and identification of competing regions) Switching to the Moot e neighborhood however strongly complicates the description of intermediate configurations. New phenomena appear (particles, wider range of stable configurations) Nevertheless our methods allow to analyze different stages of the dynamics It suggests that predicting the behavior of this automaton although difficult is possible, opening the way to the analysis of the whole class of totalistic automata

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


faster top-k document retrieval using block-max indexes Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization techniques called early termination achieves faster query processing by avoiding the scoring of documents that are unlikely to be in the top results. We study new algorithms for early termination that outperform previous methods. In particular, we focus on safe techniques for disjunctive queries, which return the same result as an exhaustive evaluation over the disjunction of the query terms. The current state-of-the-art methods for this case, the WAND algorithm by Broder et al. [11] and the approach of Strohman and Croft [30], achieve great benefits but still leave a large performance gap between disjunctive and (even non-early terminated) conjunctive queries. We propose a new set of algorithms by introducing a simple augmented inverted index structure called a block-max index. Essentially, this is a structure that stores the maximum impact score for each block of a compressed inverted list in uncompressed form, thus enabling us to skip large parts of the lists. We show how to integrate this structure into the WAND approach, leading to considerable performance gains. We then describe extensions to a layered index organization, and to indexes with reassigned document IDs, that achieve additional gains that narrow the gap between disjunctive and conjunctive top-k query processing.

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

top-k query processing
block-max index
ir query processing


Auxiliary model-based RELS and MI-ELS algorithm for Hammerstein OEMA systems ? This paper considers the identification problem for Hammerstein output error moving average (OEMA) systems. An auxiliary model-based recursive extended least-squares (RELS) algorithm and an auxiliary model-based multi-innovation extended least-squares (MI-ELS) algorithm are presented using the multi-innovation identification theory. The basic idea is to express the system output as a linear combination of the parameters by using the key-term separation principle and auxiliary model method. The proposed algorithms can give highly accurate parameter estimates. The simulation results show the effectiveness of the proposed algorithms.

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

hammerstein models
key-term separation principle
auxiliary models
nonlinear systems
recursive identification
parameter estimation
multi-innovation identification


Resilience as an Attribute of the Developmental System When conceptualized within a developmental systems theoretical framework, resilience involves mutually beneficial, reciprocally influential relations between a person and his or her context. The key features of developmental systems theory, which stress the plasticity of these relations, lead to an optimistic view of the possibility of promoting positive human development (PHD) across the life span. The results of recent longitudinal research about adolescent development allow this period to serve as a sample case of how positive development is associated with the alignment of the strengths of individuals with ecological resources for healthy growth

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

developmental systems theory
plasticity
positive development


A low-order mixed finite element method for a class of quasi-Newtonian Stokes flows. Part II: a posteriori error analysis This is the second part of a work dealing with a low-order mixed finite element method for a class of nonlinear Stokes models arising in quasi-Newtonian fluids. In the first part we showed that the resulting variational formulation is given by a twofold saddle point operator equation, and that the corresponding Galerkin scheme becomes well posed with piecewise constant functions and RaviartThomas spaces of lowest order as the associated finite element subspaces. In this paper we develop a BankWeiser type a posteriori error analysis yielding a reliable estimate and propose the corresponding adaptive algorithm to compute the mixed finite element solutions. Several numerical results illustrating the efficiency of the method are also provided.

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


Higher-order distributional properties in closed queueing networks In many real-life computer and networking applications, the distributions of service times, or times between arrivals of requests, or both, can deviate significantly from the memoryless negative exponential distribution that underpins the product-form solution for queueing networks. Frequently, the coefficient of variation of the distributions encountered is well in excess of one, which would be its value for the exponential. For closed queueing networks with non-exponential servers there is no known general exact solution, and most, if not all, approximation methods attempt to account for the general service time distributions through their first two moments. We consider two simple closed queueing networks which we solve exactly using semi-numerical methods. These networks depart from the structure leading to a product-form solution only to the extent that the service time at a single node is non-exponential. We show that not only the coefficients of variation but also higher-order distributional properties can have an important effect on such customary steady-state performance measures as the mean number of customers at a resource or the resource utilization level in a closed network. Additionally, we examine the state that a request finds upon its arrival at a server, which is directly tied to the resulting quality of service. Although the well-known Arrival Theorem holds exactly only for product-form networks of queues, some approximation methods assume that it can be applied to a reasonable degree also in other closed queueing networks. We investigate the validity of this assumption in the two closed queueing models considered. Our results show that, even in the case when there is a single non-exponential server in the network, the state found upon arrival may be highly sensitive to higher-order properties of the service time distribution, beyond its mean and coefficient of variation. This dependence of mean numbers of customers at a server on higher-order distributional properties is in stark contrast with the situation in the familiar open M/G/1 M / G / 1 queue. Thus, our results put into question virtually all traditional approximate solutions, which concentrate on the first two moments of service time distributions.

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

closed queueing networks
arrival theorem
approximation methods

non-exponential service time
high variability
higher-order moments


Short collusion-secure fingerprint codes against three pirates In this article, we propose a new construction of probabilistic collusion-secure fingerprint codes against up to three pirates and give a theoretical security evaluation. Our pirate tracing algorithm combines a scoring method analogous to Tardos codes (J ACM 55:1-24, 2008) with an extension of parent search techniques of some preceding 2-secure codes. Numerical examples show that our code lengths are significantly shorter than (about 30-40% of) the shortest known c-secure codes by Nuida et al. (Des Codes Cryptogr 52: 339-362, 2009) with c = 3.

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

collusion-secure code
fingerprint code
3-secure code
content protection


The computational complexity of distance functions of two-dimensional domains We study the computational complexity of the distance function associated with a polynomial-time computable two-dimensional domains, in the context of the Turing machine-based complexity theory of real functions. It is proved that the distance function is not necessarily computable even if a two-dimensional domain is polynomial-time recognizable. On the other hand, if both the domain and its complement are strongly polynomial-time recognizable, then the distance function is polynomial-time computable if and only if P = NP. (c) 2004 Elsevier B.V. All rights reserved.

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

computational complexity
distance function
np

polynomial-time computability
two-dimensional domain


Workshop on Internet Economics (WIE2011) Report The second Workshop on Internet Economics [2], hosted by CAIDA and Georgia Institute of Technology on December 1-2, 2011, brought together network technology and policy researchers with providers of commercial Internet facilities and services (network operators) to further explore the common objective of framing an agenda for the emerging but empirically stunted field of Internet infrastructure economics. This report describes the workshop discussions and presents relevant open research questions identified by its participants.

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

legal aspects
management
network management


An approach to intrusion tolerance for mission-critical services using adaptability and diverse replication In many mission-critical applications, important services should be maintained properly under any circumstances including the presence of compromised components incurred by outside intentional attacks. In the paper, a two-level approach for the intrusion tolerance is presented. At the node level, by means of dynamic resource reallocation within a computing node, the critical services previously selected are to survive even after the occurrence of an attack. If it becomes impossible to find enough resources for the critical services within the node in spite of the adaptive actions taken at the node level, it moves to the system level. The system level mechanism is to deliver the intended services transparently to the clients even when a node fails. An architecture adopting diverse redundant computing nodes is proposed for that purpose. Through the experiments on a test-bed, especially, for web services, the approach turned out very effective to cope with not only denial of service attacks but also confidentiality and integrity attacks. Although the measurement of the timing overhead incurred by the approach represents 50% loss in performance, it seem possible to decrease the cost by optimizing the implementation.

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


A dialogue-based web application enhances personalized access to healthcare professionals an intervention study In todays short stay hospital settings the contact time for patients is reduced. However, it seems to be more important for the patients that the healthcare professionals are easy to get in contact with during the whole course of treatment, and to have the opportunity to exchange information, as a basis for obtaining individualized information and support. Therefore, the aim was to explore the ability of a dialogue-based application to contribute to accessibility of the healthcare professionals and exchangeability of information.

health informatics
internet communication
prostate cancer
short stay patients
empowerment


Tiered bandwidth reservation scheme for multimedia wireless networks It is important to provide quality of service (QoS) guarantees if we want to support multimedia applications over wireless networks. In this paper, considering the features of tiering in sectored cellular networks, we propose a novel scheme for bandwidth reservation to approach QoS provisioning. By predicting the movement of each connection, the reserving of bandwidth is only required in needful neighboring cells instead of in all neighboring cells. In addition, an admission control mechanism incorporated with bandwidth borrowing assists in distributing scarce wireless bandwidth in more adaptive way. Through mathematical analysis, we proof the advantages of tier-based approach and the bound for the selection of tiered boundary. The simulation results also verify that our scheme can achieve superior performance than traditional schemes regarding no bandwidth reserving, fixed bandwidth reserving, and bandwidth borrowing in sectored cellular networks when performance metrics are measured in terms of the connection dropping probability (CDP), connection blocking probability (CBP), and bandwidth utilization (BU). Copyright (C) 2008 John Wiley & Sons, Ltd.

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

bandwidth reservation
bandwidth borrowing
sectored cellular networks
quality of service


Existence and Convergence of Pareto Minima In the context of vector optimization for functions with values in an ordered topological vector space, we give a result for the existence of global minima. Moreover, we find a set of conditions ensuring the convergence of minimal points and minimal values. More general assumptions are excluded by several counterexamples.

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


The NIST speaker recognition evaluation Overview, methodology, systems, results, perspective This paper, based on three presentations made in 1998 at the RLA2C Workshop in Avignon, discusses the evaluation of speaker recognition systems from several perspectives. A general discussion of the speaker recognition task and the challenges and issues involved in its evaluation is offered. The NIST evaluations in this area and specifically the 1998 evaluation, its objectives, protocols and test data, are described. The algorithms used by the systems that were developed for this evaluation are summarized, compared and contrasted. Overall performance results of this evaluation are presented by means of detection error trade-off (DET) curves. These show the performance trade-off of missed detections and false alarms for each system and the effects on performance of training condition, test segment duration, the speakers' sex and the match or mismatch of training and test handsets. Several factors that were found to have an impact on performance, including pitch frequency, handset type and noise, are discussed and DET curves showing their effects are presented. The paper concludes with some perspective on the history of this technology and where it may be going.

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

identification
verification
performance evaluation
detection error trade-off (det) curve


A neural network-based novelty detector for image sequence analysis This paper proposes a new model of "novelty detection" for image sequence analysis using neural networks. This model uses the concept of artificially generated negative data to form closed decision boundaries using a multilayer perceptron. The neural network output is novelty filtered by thresholding the output of multiple networks (one per known class) to which the sample is input and clustered for determining which clusters represent novel classes. After labeling these novel clusters, new networks are trained on this data. We perform experiments with video-based image sequence data containing a number of novel classes. The performance of the novelty filter is evaluated using two performance metrics and we compare our proposed model on the basis of these with five baseline novelty detectors. We also discuss the results of retraining each model after novelty detection. On the basis of Chi-square performance metric, we prove at 5 percent significance level that our optimized novelty detector performs at the same level as an ideal novelty detector that does not make any mistakes.

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

video analysis
object classification
feature extraction and selection


A FourierLDA approach for image recognition Fourier transform and linear discrimination analysis (LDA) are two commonly used techniques of image processing and recognition. Based on them, we propose a FourierLDA approach (FLA) for image recognition. It selects appropriate Fourier frequency bands with favorable linear separability by using a two-dimensional separability judgment. Then it extracts two-dimensional linear discriminative features to perform the classification. Our experimental results on different image data prove that FLA obtains better classification performance than other linear discrimination methods.

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

linear discrimination analysis (lda)
two-dimensional separability judgment
frequency-band selection
fourierlda approach (fla)


Machine learning for medical diagnosis: history, state of the art and perspective The paper provides an overview of the development of intelligent data analysis in medicine from a machine learning perspective: a historical view, a state-of-the-art view, and a view on some future trends in this subfield of applied artificial intelligence. The paper is not intended to provide a comprehensive overview but rather describes some subareas and directions which from my personal point of view seem to be important for applying machine learning in medical diagnosis. In the historical overview, I emphasize the naive Bayesian classifier, neural networks and decision trees. I present a comparison of some state-of-the-art systems, representatives from each branch of machine learning, when applied to several medical diagnostic tasks. The future trends are illustrated by two case studies. The first describes a recently developed method for dealing with reliability of decisions of classifiers, which seems to be promising for intelligent data analysis in medicine. The second describes an approach to using machine learning in order to verify some unexplained phenomena from complementary medicine, which is not (yet) approved by the orthodox medical community but could in the future play an important role in overall medical diagnosis and treatment.

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

reliability of prediction
kirlian camera


A study on the fire performance and heat transfer of the HPC column with fiber-cocktail in ISO fire under loading condition In this study, experiment and numerical analysis were conducted to identify the heat transfer characteristics and behavior of high-strength concrete upon a fire. The numerical analysis was employed to forecast the characteristics and properties of the high-strength concrete upon a fire, which can not be accomplished through a fire test due to the specific conditions and restrictions associated with the test. The result of the numerical analysis was compared with that of the test to verify the reliability of the analysis. In the numerical analysis of the heat transfer characteristics and behavior of 80 and 100 MPa high-strength concrete upon a fire, the commercial software of ABAQUS(V.6.8) was used. It was observed from the experiment that the contraction of the concrete with fiber-cocktail was mitigated by 25 similar to 55 % compared with that without fiber-cocktail because the fiber controlled the heat transfer of the concrete and thus improved the fire-resistance performance of the column.

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

high strength concrete
fiber-cocktail
spalling


Sticky-free and overhang-free DNA languages An essential step of any DNA computation is encoding the input data on single or double DNA strands. Due to the biochemical properties of DNA, complementary single strands can bind to one another forming double-stranded DNA. Consequently, data-encoding DNA strands can sometimes interact in undesirable ways when used in computations. It is crucial thus to analyze properties that guard against such phenomena and study sets of sequences that ensure that no unwanted bindings occur during any computation. This paper formalizes and investigates properties of DNA languages that guarantee their robusteness during computations. After defining and investigating several types of DNA languages possessing good encoding properties, such as sticky-free and overhang-free languages, we give algorithms for deciding whether regular DNA languages are invariant under bio-operations. We also give a method for constructing DNA languages that, in addition to being invariant and sticky-free, possess error-detecting properties. Finally, we present the results of running tests that check whether several known gene languages (the set of genes of a given organism) as well as the input DNA languages used in Adleman's DNA computing experiment, have the defined properties.

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

theoretical dna computing
dna encodings
codes
formal languages


High-Performance Mixed-Precision Linear Solver for FPGAs Compared to higher precision data formats, lower precision data formats result in higher performance for computationally intensive applications on FPGAs because of their lower resource cost, reduced memory bandwidth requirements, and higher circuit frequency. On the other hand, scientific computations usually demand highly accurate solutions. This paper seeks to utilize lower precision data formats whenever possible for higher performance without losing the accuracy of higher precision data formats by using mixed-precision algorithms and architectures. First, we analyze the floating-point performance of different data formats on FPGAs. Second, we introduce mixed-precision iterative refinement algorithms for linear solvers and give an error analysis. Finally, we propose an innovative architecture for a mixed-precision direct solver for reconfigurable computing. Our results show that our mixed-precision algorithm and architecture significantly improve the performance of linear solvers on FPGAs.

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

reconfigurable computing
data formats
iterative refinement


An Analytical Solution to Single Scattering in Homogeneous Participating Media Despite their numerous applications, efficiently rendering participating media remains a challenging task due to the intricacy of the radiative transport equation. As they provide a generic means of solving a wide variety of problems, numerical methods are most often used to solve the air-light integral even under simplifying assumptions. In this paper, we present a novel analytical approach to single scattering from isotropic point light sources in homogeneous media. We derive the first closed-form solution to the air-light integral in isotropic media and extend this formulation to anisotropic phase functions. The technique relies neither on pre-computation nor on storage, and we provide a practical implementation allowing for an explicit control on the accuracy of the solutions. Finally, we demonstrate its quantitative and qualitative benefits over both previous numerical and analytical approaches.

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

i.3.7 [computer graphics]: three-dimensional graphics and realism


Optimising drainage from sugar cane fields using a one-dimensional flow routing model: a case study from Ripple Creek, North Queensland Inundation of sugar cane fields in the Ripple Creek catchment is perceived by some cane farmers to be a major contributor to loss of production. To alleviate this inundation, drainage systems have been designed which are capable of removing surface water very rapidly. However, when the Herbert River is in flood this water may have nowhere to go. This combination of an efficient drainage system, the lack of an outlet for the water, and the growing of cane on land which may be unsuitable, has led to some farms facing extended periods of inundation. For this reason, proposals have been made to the Ripple Creek Drainage Board to modify the drainage system to produce a more equitable distribution of inundation. In this paper, we examined the application of the Mike-11 modelling system to the Ripple Creek catchment. We found that the modelled predictions of depth, discharge and velocity matched observational data collected as part of an intensive CSIRO monitoring program. The model developed was then used to examine the hydrologic impact of opening a new channel to divert flow into the Seymour River. We found that opening this channel had some impact on indundation in parts of the catchment, but that the impact depended on whether or not the Herbert River was in flood at the time.

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


sinr analysis for v-blast with ordered mmse-sic detection A new way to determine the exact layer-wise SINR distribution for V-BLAST with successive interference cancellation at the receiver is presented. In contrast to previous publications, we do not restrict to zero-forcing, but also consider minimum mean square error interference suppression. It is shown analytically that an optimized detection order has an even larger impact in this case. Numerical examples provide deeper insights into the underlying effects.

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


Construction of quaternary sequences of length pq with low autocorrelation In this paper, a new quaternary sequences over Z pq of length pq is constructed by using inverse Gray mapping and generalized cyclotomic sequences over Z p and Z q . The maximum nontrivial autocorrelation of the constructed sequences are shown to be p???q?+?3 or \(\max\{q-p-1, \sqrt{5}\}\).

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

quaternary sequences
inverse gray mapping


CROS: A Contingency Response multi-agent system for Oil Spills situations This paper presents CROS, a Contingency Response multi-agent system for Oil Spill situations. The system uses the Case-Based Reasoning methodology to generate predictions to determine the probability of finding oil slicks in certain areas of the ocean. CBR uses past information to generate new solutions to the current problem. The system employs a SOA-based multi-agent architecture so that the main components of the system can be remotely accessed. Therefore, all functionalities (applications and services) can communicate in a distributed way, even from mobile devices. The core of the system is a group of deliberative agents acting as controllers and administrators for all applications and services. CROS manages information such as sea salinity, sea temperature, wind speed, ocean currents and atmosphere pressure, obtained from several sources, including satellite images. The system has been trained using historical data obtained after the Prestige accident on the Galician west coast of Spain. Results have demonstrated that the system can accurately predict the presence of oil slicks in determined zones after an oil spill. The use of a distributed multi-agent architecture has been shown to enhance the overall performance of the system.

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

multi-agent systems
case-based reasoning
service oriented architectures


Quantile dispersion graphs for evaluating and comparing designs for logistic regression models Designs for fitting a generalized linear model depend on the unknown parameters of the model. The use of any design optimality criterion would therefore require some prior knowledge of the parameters. In this article, a graphical technique is proposed for comparing and evaluating designs for a logistic regression model. Quantiles of the scaled mean-squared error of prediction are obtained on concentric surfaces inside a region of interest, R. For a given design, these quantiles depend on the model's parameters. Plots of the maxima and minima of the quantiles, over a subset of the parameter space, produce the so-called quantile dispersion graphs (QDGs). The plots provide a comprehensive assessment of the overall prediction capability of the design within the region R. They also depict the dependence of the design on the model's parameters. The QDGs can therefore be conveniently used to compare several candidate designs. Two examples are presented to illustrate the proposed methodology.

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

binary response
design dependence on unknown parameters
generalized linear models
prediction bias
response surface methodology
scaled mean-squared error of prediction


(Virtual) Agents for running electricity markets This paper describes a multi-agent based simulation (MABS) framework to construct an artificial electric power market populated with learning agents. The artificial market, named TEMMAS (The Electricity Market Multi-Agent Simulator), explores the integration of two design constructs: (i) the specification of the environmental physical market properties and (ii) the specification of the decision-making (deliberative) and reactive agents. TEMMAS is materialized in an experimental setup involving distinct power generator companies that operate in the market and search for the trading strategies that best exploit their generating units resources. The experimental results show a coherent market behavior that emerges from the overall simulated environment.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-agent based simulation
electricity market modeling
sequential decision process
adaptation and learning


ScolioMedIS: Web-oriented information system for idiopathic scoliosis visualization and monitoring Adolescent idiopathic scoliosis is the most common type of abnormal curvature observed in spine and it progresses rapidly during the puberty period. The most followed clinical way of assessing the spinal deformity is subjective by measuring the characteristic angles of spinal curve from a set of radiographic images. This paper presents a web-based information system (called ScolioMedIS) based on parameterized 3D anatomical models of the spine to quantitatively assess the deformity and to minimize the amount of radiation exposure by reducing the number of radiographs required. The main components of the system are 3D parametric solid model of spine, back surfaces, relevant clinical information and scoliosis ontology. The patient-specific spine model is regenerated from the parametric model and surface data using anatomical information extracted from radiographic images. The system is designed to take inherent advantage of Web for facilitating multi-center data collection and collaborative clinical decisions. The preliminary analysis of patient data showed promising results, which involve improved documentation standard, clinical decision knowledge base record, facilitated exchange and retrieval of medical data between institutions in multi-center clinical studies, 3D visualization of spinal deformity, and permanent monitoring of treatments.

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

web based information system
parametric 3d spine
e-record
medical simulation and visualization


Development and evaluation of multimedia whiteboard system for improving mathematical problem solving This study developed a web-based multimedia whiteboard system to help students learning with mathematical problem solving. The purpose is to promote a new online mathematical learning model that students not only use electronic whiteboard to write down their mathematical problem solving solutions but also use voice recording tool to give oral explanations about their thinking behind the solutions. To cultivate students' critical thinking capability and encourage collaborative peer learning, the new learning model also requests students to criticize others' solutions and reply to others' arguments. With the multimedia supporting tools, students can communicate easily with each other about what they think and how they solve mathematical problems. We have conducted an experiment with sixth grade primary school students for evaluation. After the experiment, a questionnaire about students' attitude toward the multimedia whiteboard system for math learning was then held. The results show that students were satisfied with the use of the multimedia whiteboard system for helping them with learning fractional division. Most students were interested in studying mathematics with the multimedia whiteboard system and thought this tool is particularly useful for doing collaborative learning. After analyzing the recorded solving processes and discussions content of students, we found that the performance of female students was superior to male students in communications and mathematical problem solving. Additionally, students with higher final exam grades had better mathematical abilities for doing critiques, arguments and communications. (c) 2004 Published by Elsevier Ltd.

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

mathematical problem solving
multimedia whiteboard
fractional division


Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach We examine the existing constructions of the smallest known vertex-transitive graphs of a given degree and girth 6. It turns out that most of these graphs can be described in terms of regular lifts of suitable quotient graphs. A further outcome of our analysis is a precise identification of which of these graphs are Cayley. We also investigate higher level of transitivity of the smallest known vertex-transitive graphs of a given degree and girth 6 and relate their constructions to near-difference sets. 2010 Wiley Periodicals, Inc. J Graph Theory 68:265-284, 2011

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


aggregated cross-media news visualization and personalization There is an increasing need for online news aggregation and visualization. Commercial systems, such as Google News and Ask.com, have successfully launched a portal aiming at providing an aggregated view of the top news events at a given time. However, these systems, as well as previous research projects, lack the ability to personalize events according to the user's need. Furthermore, users increasingly prefer to see multiple types of media to be presented when they follow a particular event of interest. In this paper, we describe a novel framework to allow the aggregation of online sources for text articles, images, videos and TV news into news stories, while the visualization enables the users to browse and select the news events based on semantic information. The experimental results have indicated some promising results

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

cross-media documents aggregation
news application
semantic filtering


A versatile paradigm for scan chain diagnosis of complex faults using signal processing techniques Scan chains are popularly used as the channels for silicon testing and debugging. However, they have also been identified as one of the culprits of silicon failure more recently. To cope with this problem, several scan chain diagnosis approaches have been proposed in the past. The existing methods, however, suffer from one common drawback-that is, they rely on fault models and matching heuristics to locate the faults. Such a paradigm may. run into difficulty when the fault under diagnosis does not match the fault model exactly, for example, when there is a bridging between a flip-flop and a logic cell, or the fault is temporal and only manifests itself intermittently. In light of this, we propose in this article a more versatile model-free paradigm for locating the faulty flip-flops in a scan chain, incorporating a number of signal processing techniques, such as filtering and edge detection. These techniques performed on the test responses of the failing chip under diagnosis directly can effectively reveal the fault location(s) in a scan chain. As compared to the previous works, our approach is better capable of handling intermittent faults and bridging faults, even under nonideal conditions, for example, when the core logic is also faulty. Experimental results on several real designs indicate that this approach can indeed catch some nasty faults that previous methods could not catch.

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

algorithms
design for testability
profiling


An object oriented system for damage tolerance design of stiffened panels This paper describes an interactive, integrated system for damage tolerance design of aircraft stiffened panels. The tasks supported by the system range from the initial definition of the stiffened panel configuration to the elaboration of the residual strength and crack growth diagrams, including the mesh design and the incremental crack extension analysis. The structural configuration is represented in an object oriented fashion, using a high level of abstraction and in terms of object components well-known to the designer, such as stiffeners, cracks and boundaries. Input data is performed interactively, through a user-friendly windows-based interface and the boundary element meshes are automatically designed using a rule-based strategy. Crack propagation analysis is performed with the dual boundary element method which allows for the solution of problems involving single or multiple cracks under mixed mode conditions.

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

boundary element method
aircraft stiffened panels

knowledge based systems
fracture mechanics


query generation in an instructional database management system The objectives and the general structure of a database management system designed for instructional use are described in this paper. Two high level interfaces which can be used to assist a student in query formulation are discussed. First of these interfaces is graphical and uses Macintosh microcomputer as a user's workstation. The other interface guides a student through the process of query formulation using a menu-driven approach. Preliminary experiences with these interfaces have shown that they can facilitate teaching of query formulation and help students to understand better the syntax and semantics of non-procedural query languages.

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

help
generation
structure
use
query languages
teaching
process
interfaces
general
paper
microcomputer
query
student

semantic
procedure
database management systems
instruction
object
experience
graphics
user


Multidimensional extended spatial evolutionary games Introducing time-varying payoff matrices in mean-field games. New possibilities for more accurate and complex game theoretic simulation. Spatial lattice with simulation of interaction between cells and environment. Heterogeneity of individuals (poly-phenotypic players) in spatial games (MSEG). More precisely biological phenomena, especially for cancer cell populations.

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

biomathematical modeling
cellular automata
sensitivity
polymorphism


Interestingness measures for association rules based on statistical validity Assessing rules with interestingness measures is the pillar of successful application of association rules discovery. However, association rules discovered are normally large in number, some of which are not considered as interesting or significant for the application at hand. In this paper, we present a systematic approach to ascertain the discovered rules, and provide a precise statistical approach supporting this framework. The proposed strategy combines data mining and statistical measurement techniques, including redundancy analysis, sampling and multivariate statistical analysis, to discard the non- significant rules. Moreover, we consider real world datasets which are characterized by the uniform and non-uniform data/items distribution with a mixture of measurement levels throughout the data/items. The proposed unified framework is applied on these datasets to demonstrate its effectiveness in discarding many of the redundant or non-significant rules, while still preserving the high accuracy of the rule set as a whole.

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

structured data
interesting rules
redundant rules
interestingness measure


incremental tracking of multiple quantiles for network monitoring in cellular networks Network monitoring in cellular networks requires the tracking of quantiles for data distributions of many evolving network measurements (e.g. number of high signaling subscribers per minute). Most quantile estimation algorithms are based on a summary of the empirical data distribution, using either a representative sample or a global approximation of the entire distribution. In contrast, by viewing data as a quantity from a random distribution, the stochastic approximation (SA) for quantile estimation does not keep a global approximation, but rather local approximations at the quantiles of interest, and therefore uses negligible memory even for estimating tail quantiles. However, the current stochastic approximation algorithm for quantile estimation tracks each quantile separately, and this may lead to a violation of the monotone property of quantiles. In this paper, we propose a stochastic approximation technique that enables the simultaneous tracking of multiple quantiles. Our technique maintains the monotone property of different quantiles, and is adaptive to changes in the data distribution. We evaluate its performance using real cellular provider datasets. Our results show that the technique is very efficient.

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

stochastic approximation
cellular networks
quantile estimation


A set theoretic approach to dynamic robot localization and mapping This paper addresses the localization and mapping problem for a robot moving through a (possibly) unknown environment where indistinguishable landmarks can be detected. A set theoretic approach to the problem is presented. Computationally efficient algorithms for measurement-to-feature matching, estimation of landmark positions, estimation of robot location and heading are derived, in terms of uncertainty regions, under the hypothesis that errors affecting all sensors measurements are unknown-but-bounded. The proposed technique is validated in both simulation and experimental setups.

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


Component-based development and sensitivity analyses of an air pollutant dry deposition model The Urban Forest Effects-Deposition model (UFORE-D) was developed with a component-based modeling approach. Functions of the model were separated into components that are responsible for user interface, data input/output, and core model functions. Taking advantage of the component-based approach, three UFORE-D applications were developed: a base application to estimate dry deposition at an hourly time step, and two sensitivity analyses based on Monte Carlo simulations with a Latin hypercube sampling (LHS-MC) and a Morris one-at-a-time (MOAT) sensitivity test. With the base application, dry deposition of CO, NO2, O3, PM10, and SO2 in the city of Baltimore was estimated for 2005. The sensitivity applications were performed to examine UFORE-D model parameter sensitivity. In general, dry deposition velocity was sensitive to temperature and leaf area index (LAI). Temperature had a non-linear effect on all pollutants, while LAI was important to NO2 deposition with a nearly linear effect. PAR and wind speed had limited effects on dry deposition of all pollutants; dry deposition was affected by PAR and wind speed only up to their threshold values. The component-based approach allows for seamless integration of new model elements, and provides model developers with a platform to easily interchange model components.

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

component-based model
ufore
sensitivity analysis


Multiple extreme learning machines for a two-class imbalance corporate life cycle prediction Pre-warning of whether a corporate will fall into a decline stage in the near future is an emerging issue in financial management. Improper decision-making by firms incurs a higher possibility to cause financial crisis (distress) and deteriorates the soundness of financial markets. The aim of this study is to establish a novel prediction mechanism based on combining the sampling technique (synthetic minority over-sampling technique; SMOTE), feature selection ensemble (original, intersection, and union), extreme learning machine (ELM) ensemble and decision tree (DT). The proposed model namely, the multiple extreme learning machines (MELMs) shows promising performance under numerous assessing criteria, but one critical defect of the ensemble classifier is that it lacks comprehensibility. Thus, we perform a DT as the knowledge generator to extract the inherent information from the ensemble mechanism. This knowledge visualized process can assist decision makers in efficiently allocating limited financial resources and to help firms survive in an extremely competitive environment.

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

extreme learning machine
corporate life cycle

ensemble learning
imbalanced dataset
knowledge generation


DICE: An Effective Query Result Cache for Distributed Storage Systems Due to the proliferation of Internet and Intranet, the distributed storage systems have received a lot of attention. These systems span a large number of machines and store huge amount of data for a lot of users. In the distributed storage systems, a row can be directly accessed using a row key. We concentrate on a problem of efficient processing of queries whose predicate is on a column but not a row key. In this paper, we present a cache management technique, called DICE which maintains query results of range queries to support the next range queries. To accelerate the search time of the cached query results, we use modified Interval Ski Lists. In addition, we devise a novel cache replacement policy since DICE maintains an interval rather than a data item. Since our cache replacement policy considers the properties of intervals, our proposed technique is more efficient than traditional buffer replacement algorithms. Our experimental result demonstrates the efficiency of our proposed technique.

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

distributed system
range query
query caching
interval skip list