An Adaptive Structure Neural Networks with Application to EEG Automatic Seizure Detection This paper introduces a new algorithm for adaptively adjusting the structure of a multi-layer back-propagation network. The proposed algorithm belongs to the class of neuron generating strategies as opposed to the class of neuron pruning strategies. Initially a small multi-layer perceptron network is selected. The stabilized error is used as an index to determine whether the network needs to generate a new neuron or not. If after a period of learning the error is stabilized, but the error is larger than a desired value, then new neuron(s) is (are) generated. The new neurons are placed at locations that contribute most to the network error behavior through the fluctuation in their input weight vectors. Among the features of the new architecture are its improved performance and generalization capabilities compared to a standard fixed-structure back-propagation network. Application to an electroencephalogram (EEG) automatic epileptic seizure detection is presented to illustrate advantages and capabilities of the proposed algorithm. Using an actual data from five patients it is shown that the proposed approach correctly identifies all true seizures that are also identified by an expert physician. The new algorithm provides a reduction of 6070% in the training epochs as compared to a back-propagation algorithm. Furthermore, it is shown that by utilizing a new training algorithm it is possible to reduce the false seizure detections to zero while resulting in a 5.1% error in identifying the true seizures. Copyright 1996 Elsevier Science Ltd

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

adaptive structure networks neuron generation back propagation training speed pattern recognition


Turbulent mixing in spherical implosions We discuss the application of the numerical code TURMOIL to turbulent mixing in a simple spherical implosion, a much simplified version of an inertial confinement fusion implosion. Some form of Monotone integrated large eddy simulation is required to eliminate non-physical oscillations, as shocks and contact discontinuities are present. The dissipation in the TURMOIL scheme is analysed. It is argued that this is relatively low and that the 'sub-grid' dissipation can be precisely quantified. (C) British Crown Copyright 2007/MOD. Reproduced with permission. Published by John Wiley & Sons, Ltd.

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


Real-time adaptive filtering for projection reconstruction MR fluoroscopy Magnetic resonance (MR) imaging has faced a dramatic increase in real-time capabilities over the last years. However, the application of fast pulse sequences still suffers from low signal-to-noise ratios (SNRs), which can be the limiting factor for the actual acquisition speed. In MR fluoroscopy, filtering along the time and/or spatial domain can be applied to increase the image quality. In this paper, a projection-based noise filter is presented that significantly enhances the SNR in projection reconstruction (PR) fluoroscopy without apparent loss of resolution in the reconstructed images. In contrast to an imaged-based approach, this method allows a very efficient computational implementation. The filter algorithm was implemented on a digital signal processor and was applied to real-time processing during PR fluoroscopy. A quantitative analysis of the improvement in SNR and results for different fluoroscopic MR applications are given. Apart from MR fluoroscopy, the proposed technique has the potential to be applied to low dose computed tomography fluoroscopy.

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

adaptive filters
digital signal processors
magnetic resonance imaging
x-ray tomography


FEM modeling of roadways driven in a fractured rock mass under a longwall influence In order to design a new roadways support system in a mine, convergence measurements were taken. Analysis of the results showed that the rock mass discontinuities were very important to the final convergence (with and without longwall influence). From these measurements two FEM models were calibrated to study the interaction between rock mass and support. In the first model the materials were continuum and in the other one discontinuities were simulated. Both of them represent very accurately the real phenomenon under mine conditions: closely jointed rock mass and high stresses.

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

discontinuities
rock mass
roadways
longwall
fem models


Dynamic positioning simulation, thrust optimization design and control of a drill ship under disturbances and faulty thruster The dynamic positioning simulation of an actual drill ship under a normal and faulty condition is proposed using MATLAB (TM) and Simulink (TM) software. The proposed simulation model provides a means to control a non-linear and coupled OD21 drill ship under different external perturbations, such as wind, wave, current and thruster failure during the design stage. A proportional-integral-derivative (PID) controller for the dynamic positioning ship system was designed and validated with experimental results from a sea trial. Through simulation, the proposed PID control and thrust allocation method are able to maintain the desired heading angle under various test conditions, such as drilling, standby and thruster failure.

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


Robust estimation for survival partially linear single-index models The partially linear single-index model is an interesting semiparametric model extended by the partially linear model and the single-index model, which supply a good balance between flexibility and parsimony. A robust estimation is proposed to fit the partially linear single-index model in case outliers may occur in the right censored response. This method provides a flexible way for modeling survival data. It is a profile M-estimation version and the estimation procedure involves transforming the censored data into synthetic data at first, then it results in fitting the common partially linear single-index models by a robust loss function. Asymptotic properties for the estimators of the linear and single-index coefficients and the optimal rate of convergence for the estimator of the nonparametric function are established. The finite sample performance of the proposed method is assessed by Monte Carlo simulation studies, and demonstrated by the analyses of PBC data and NCCTG lung cancer data.

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

local linear regression
m-estimation
right censoring
semiparametric models


A Survey on Various Coherent and Non-coherent IR-UWB Receivers The recent developments in radio technologies, paves its way to impulse radio (IR) ultra-wideband (UWB) communication, which is used for low power, short range and high bandwidth communication, thereby exploiting a large portion of radio spectrum. In this paper, a brief review of the work done by various researchers on coherent and non-coherent IR-UWB receivers has been analysed, based on their bit error rate (BER) performances, as well as pros and cons of using these receivers. An in depth study on the receivers concludes that, non-coherent IR-UWB receiver is preferred over its counterpart coherent IR-UWB receiver even though it comes at the expense of poor BER performance. The simulation results prove that, though the performances are same, the low complexity of energy detector (ED) receivers gives an edge over the autocorrelation receivers. Further, ED receiver suffers from noise, which paves way to using weighted ED (WED) receiver. The superiority of WED receivers over all the other non-coherent UWB receivers is further confirmed by the simulation performed in AWGN and IEEE 802.15.4a UWB channels. It can also be concluded from the review that, some special receivers such as generalized likelihood ratio test, multi-symbol differential detector and decision feedback differential transmitted reference, when clubbed with UWB systems, lead to further improvement in BER performance.

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

impulse radio (ir)
coherent ir-uwb receivers
non-coherent ir-uwb receivers
weighted energy detector (wed)
autocorrelation (ac) receivers
energy detector (ed)
bit error rate (ber)


Fast global and partial reflective symmetry analyses using boundary surfaces of mechanical components ? An approach to global and local reflective symmetry analyses for B-Rep CAD models. Use of a divide-and-conquer principle over the B-Rep faces as atomic entities. The symmetry accuracy obtained is of the order of the CAD kernel modeling accuracy. The process time is very low, and compatible with users interactions.

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

local symmetry
b-rep cad model
cad/cam
divide-and-conquer


Wavelet-based 3D compression scheme for interactive visualization of very large volume data Interactive visualization of very large volume data has been recognized as a task requiring great effort in a variety of science and engineering fields. In particular, such data usually places considerable demands on run-time memory space. In this paper, we present an effective 3D compression scheme for interactive visualization of very large volume data, that exploits the power of wavelet theory. In designing our method, we have compromised between two important factors: high compression ratio and fast run-time random access ability. Our experimental results on the Visual Human data sets show that our method achieves fairly good compression ratios. In addition, it minimizes the over head caused during run-time reconstruction of voxel values. This 3D compression scheme will be useful in developing many interactive visualization systems for huge volume data, especially when they ale based on personal computers or workstations with limited memory.

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

very large volume data
3d compression
interactive visualization

wavelets
fast random access
visible kuman data


Modeling attitude to risk in human decision processes: An application of fuzzy measures Several models of the human decision process have been proposed, classical examples of which are utility theory and prospect theory. In recent times, the theory of fuzzy measures and integrals has emerged as an alternative meriting further investigation. Specifically, one is interested in the degrees of disjunction and conjunction and the veto and favor indices that represent the tolerance measure of the decision maker. Though several theoretical expositions have appeared in contemporary literature, empirical studies applying these concepts to the real world are scarce. This paper reports two studies based on a model of strategic telecommunication investment decisions from a research work involving a survey of executives. The first study involves building fuzzy models corresponding to each individual decision maker with the results grouped based on the decision makers' propensity to risk as determined by their degrees of disjunction. The Shapley indices and the interaction effects are determined for each pooled data set corresponding to each group. To contrast this approach with those of conventional nomothetic comparisons of decision policies, the decision makers are grouped based on a clustering analysis of the individual linear regression models. The data for each cluster are pooled and the fuzzy measures learned from the data set are analyzed for comparison purposes. The results not only serve as a demonstration of fuzzy measure analysis as a viable approach to studying qualitative decision making, but also provide useful methodological insights into applying fuzzy measures to strategic investment decisions under risk. (c) 2006 Elsevier B.V. All rights reserved.

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

choquet integral
risk propensity
degree of disjunction
multicriteria decision making
decision analysis


A fuzzy real-time temporal logic High-level descriptions of real-time systems often use fuzzy notions of time that are left open to domain specific interpretations. In order to verify that a given implementation conforms to such loosely defined specifications, the typical approach is to verify the implementation to be correct within well defined limits of time tolerance. This approach determines whether the real-time requirements are met, but does not reflect how well it is met. Our goal in this paper is to prescribe the development of timed specifications using fuzzy notions of time, and to present a methodology for computing the quality of satisfaction of the specification on a given implementation using domain specific fuzzy membership functions. With this objective, we combine the notions of real-time interval temporal logic (like Metric Interval Temporal Logic) and fuzzy logic to derive FRTL, a fuzzy realtime temporal logic. The novelty of the proposed logic is in introducing the notion of fuzzy time intervals into the core fabric of conventional metric temporal logic. We present a method for evaluating the fuzzy truth of FRTL properties on finite traces. We discuss the motivation of computing the fuzzy truth towards evaluating the quality of control in time critical embedded control system applications. We also show that two important related problems from the domain of mixed-signal design verification, are subsumed by the proposed framework of analysis. (C) 2013 Elsevier Inc. All rights reserved.

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


Explicit ?-bases for conic sections and planar rational cubic curves We provide explicit formulas for the ?-bases of conic sections and planar rational cubic curves. We derive explicit formulas for the implicit equations and double points of planar rational cubic curves from the ?-bases of planar rational cubic curves. We also give explicit formulas for the ?-bases of rational curves of degree n in n-dimensions.

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

conic section
rational cubic curve
?-basis
implicit equation
double point


Security invariants in discrete transition systems The Shadow semantics is a qualitative model for noninterference security for sequential programs. In this paper, we first extend the Shadow semantics to Event-B, to reason about discrete transition systems with noninterference security properties. In particular, we investigate how these security properties can be specified and proved as machine invariants. Next we highlight the role of security invariants during refinement and identify some common patterns in specifying them. Finally, we propose a practical extension to the supporting Rodin platform of Event-B, with the possibility of having some properties to be invariants-by-construction.

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

the shadow semantics
noninterference security
refinement
invariants


k-anonymous association rule hiding In the paper we point out that the released dataset of an association rule hiding method may have severe privacy problem since they all achieve to minimize the side effects on the original dataset. We show that an attacker can discover the hidden sensitive association rules with high confidence when there is not enough "blindage". We give a detailed analysis of the attack and propose a novel association rule hiding metric, K -anonymous. Based on the K -anonymous metric, we present a framework to hide a group of sensitive association rules while it is guaranteed that the hidden rules are mixed with at least other K -1 rules in the specific region. Several heuristic algorithms are proposed to achieve the hiding process. Experiment results are reported to show the effectiveness and efficiency of the proposed approaches.

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


A priori molecular descriptors in QSAR: a case of HIV-1 protease inhibitors ?: I. The chemometric approach A quantitative structureactivity relationship (QSAR) study on 48 peptidic HIV-1 protease inhibitors was performed. Fourteen a priori molecular descriptors were used to build QSAR models. Hierarchical cluster analysis (HCA), principal component analysis (PCA) and partial least squares (PLS) regression were employed. PLS models with 32/16 (model I) and 48/0 (model II) molecules in the training/external validation set were constructed. The a priori molecular descriptors were related to two energetic variables using PLS. HCA and PCA on data from model II classified the inhibitors as slightly, moderately and highly active; three principal components, the chemical nature of which has been highlighted, are enough to describe the enzymeinhibitor binding. Model I (r2=0.91, q2=0.84) is comparable to literature models obtained by various QSAR softwares, which justified the use of a priori descriptors.

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


A new encoding technique for peptide classification Research on peptide classification problems has focused mainly on the study of different encodings and the application of several classification algorithms to achieve improved prediction accuracies. The main drawback of the literature is the lack of an extensive comparison among the available encoding methods on a wide range of classification problems. This paper addresses the fundamental issue of which peptide encoding promises the best results for machine learning classifiers. Two novel encoding methods based on physicochemical properties of the amino acids are proposed and an extensive comparison with several standard encoding methods is performed on three different classification problems (HIV-protease, recognition of T-cell epitopes and prediction of peptides that bind human leukocyte antigens). The experimental results demonstrate the effectiveness of the new encodings and show that the frequently used orthonormal encoding is inferior compared to other methods.

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

peptide classification
physicochemical properties
machine learning

amino acid encoding
hiv-protease
human immune system


Does therapist guidance improve uptake, adherence and outcome from a CD-ROM based cognitive-behavioral intervention for the treatment of bulimia nervosa? We recently demonstrated the efficacy and feasibility of a novel CD-ROM based cognitive-behavioral multi-media self-help intervention for the treatment of bulimia nervosa. What is not known in CD-ROM treatments is how to best to deliver and support such packages in clinical practice. In particular, it is of great importance to identify to what extent such packages can be offered stand alone, and to what extent additional support from a practitioner is required. The aim of the present study was to examine whether the addition of therapist support to the CD-ROM intervention would improve treatment uptake, adherence and outcome. Two cohorts of patients with full or partial bulimia nervosa referred to a catchment area based eating disorder service were offered an eight session CD-ROM-based cognitive-behavioral self-help treatment (Overcoming Bulimia). The first cohort received minimal guidance only and the second cohort were offered three brief focused support sessions with a therapist. The two cohorts were compared on treatment uptake, adherence and outcome. Patients in both groups improved significantly. There were no significant differences between the two groups in terms of treatment uptake, adherence or outcome, except that the therapist guidance group more often achieved remission from excessive exercise at follow-up. These findings provide further support for the acceptability and efficacy of the CD-ROM intervention for bulimia nervosa. Brief focused therapist guidance did not confer any significant additional benefits. This result has important implications for the widespread adoption of such approaches.

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

bulimia nervosa
eating disorder
treatment

cd-rom
self-help
computerised cognitive-behavior therapy


Calculation of simplicial depth estimators for polynomial regression with applications A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial regression model is derived. Additionally, an algorithm for calculating the parameter vectors with maximum simplicial depth within an affine subspace of the parameter space or a polyhedron is presented. Since the maximum simplicial depth estimator is not unique, l1 l 1 and l2 l 2 methods are used to make the estimator unique. This estimator is compared with other estimators in examples of linear and quadratic regression. Furthermore, it is shown how the maximum simplicial depth can be used to derive distribution-free asymptotic ? ? -level tests for testing hypotheses in polynomial regression models. The tests are applied on a problem of shape analysis where it is tested how the relative head length of the fish species Lepomis gibbosus depends on the size of these fishes. It is also tested whether the dependency can be described by the same polynomial regression function within different populations.

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

polynomial regression
simplicial depth
shape analysis

maximum depth estimator
distribution free tests
one-sample tests
two-sample tests


Thinned wafer multi-stack 3DI technology Wafer scale 3DI technology, so-called wafer-on-a-wafer (WOW), characterized by thinned-wafer stacking and Cu multi-level interconnects, has been developed, and revealed that seven-level multi-wafer stacking is possible. The WOW process differs from the chip-on-a-chip and chip-on-a-wafer processes and can be used for wafer-scale bulk processes, enabling manufacturing from transistor to 3D stacking using wafers. Wafers are thinned down to 20-?m and bonded to the base wafer following back-to-face stacking. Through-silicon-via (TSV) holes with a diameter of 30?m are formed and etched-off until the lower electrode of Au which is patterned on the underneath wafer. Titanium (Ti) and titanium-nitride (TiN) are formed on a TSV hole as a barrier metal and electrode for the electrochemically plated Cu (ECP-Cu). After ECP-Cu deposition, surface planarization is performed using Surface Planer. Those wafers are used as a base wafer and multi-stacking is carried out repeatedly. The vertical connection between Cu of TSV and Au is therefore connected with a self-aligned contact and without a bump electrode. The electrical properties of the 242-chain contacts within the wafer were measured and no open failure was found. Adopting the thinned substrates eliminates deep silicon etching, and TSV filling which take a long process time, and reduces the residual stress on the Cu plug. Wafers can be stacked as much as possible in accordance with the degree of integration, and this is expected to be a low-cost and high-integration technology for post-scaling.

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

wafer-on-a-wafer copper through-silicon-via post-scaling


High performance EEG signal classification using classifiability and the Twin SVM Use of the classifiability metric to select discriminative frequency bands. Use of the Twin SVM to learn unbalanced datasets with low error rates. Improvements of up to 20% over state-of-the-art.

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

brain computer interface
motor imagery
common spatial patterns
frequency band selection
libsvm


Distributed vector architectures Integrating processors and main memory is a promising approach to increase system performance. Such integration provides very high memory bandwidth that can be exploited efficiently by vector operations. However, traditional vector applications would easily overflow the limited memory of a single integrated node. To accommodate such workloads, we propose the Distributed Vector Architecture (DIVA), that uses multiple vector-capable processor/memory nodes in a distributed shared-memory configuration, while maintaining the simple vector programming model. The advantages of our approach are twofold: (i) we dynamically parallelize the execution of vector instructions across the nodes, (ii) we reduce external traffic, by mapping vector computation rather than data across the nodes. We propose run-time mechanisms to assign elements of the architectural vector registers on nodes, using the data layout across the nodes as a blueprint. We describe DIVA implementations with a traditional request-response memory model and a data-push model. Using traces of vector supercomputer programs, we demonstrate that DIVA generates considerably less external traffic compared to single or multiple-node alternatives that are based solely on caching or paging. With timing simulations we show that a DIVA system with 28 nodes is up to three times faster than a single node using its local memory as a large cache and can even outperform a hypothetical system where the application fits in local memory.

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

vector processing
processor-memory integration


Dynamic wavelet-based tool for gearbox diagnosis This paper proposes a novel wavelet-based technique for detecting and localizing gear tooth defects in a noisy environment. The proposed technique utilizes a dynamic windowing process while analyzing gearbox vibration signals in the wavelet domain. The gear vibration signal is processed through a dynamic Kaiser's window of varying parameters. The window size, shape, and sliding rate are modified towards increasing the similarity between the non-stationary vibration signal and the selected mother wavelet. The window parameters are continuously modified until they provide maximum wavelet coefficients localized at the defected tooth. The technique is applied on laboratory data corrupted with high noise level. The technique has shown accurate results in detecting and localizing gear tooth fracture with different damage severity.

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

machine diagnostics
gear tooth failure
wavelet multi-resolution


Simplified resist models for efficient simulation of contact holes and line ends Nowadays, users of optical lithography simulation tools have to determine more than 40 parameters before simulation can be started. Furthermore, the simulation of areas larger than 1?m2 is hardly possible by full models, as computation time increases dramatically with the accuracy which is requested. On the other hand, large area simulators, as used in OPC software, work fast, but use empirical models to take into account the impact of processing conditions on the resist performance. Users have no insight regarding the real physical and chemically processes. To fill the gap between the full resist models used in physically and chemically based simulators and the pure empirical models used in OPC simulation, 1D simplified resist models, such as ADDIT or DAIM were developed. In this paper, simplified resist models are extended for the first time to simulate 2D features and the models were calibrated to experimental data.

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

parameter calibration
large area simulation


Model based study of the first stage of biological nitrification (NH4+ oxidation to NO2-) Reaction mechanisms are generated for the first stage of biological nitrification (NH4+ double right arrowNO(2)(-)) by using graph theoretical methods and the chemical information for reaction intermediates. On this basis, a large number of kinetic models are obtained. As a result of model discrimination, a kinetic model is derived to describe the kinetics of the biological nitrification reaction appropriately. The kinetic constants of the model were estimated by implementation of a differential method for parameter estimation. The selection of a correct reaction mechanism and kinetic model is performed on the basis of the experimental data obtained using laboratory scale equipment. A kinetic model which appropriately describes the kinetics of ammonia oxidation into nitrite and its parameter estimates is obtained. It is in correspondence with the mechanism including the reaction step of formation and decomposition of an intermediate complex between ammonia, bacteria and oxygen. (C) 2003 Elsevier Ltd. All rights reserved.

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

nitrification
ammonia oxidation
kinetics


Coupled complex adjoint sensitivities for frequency-domain fluorescence tomography: theory and vectorized implementation We present a computationally efficient and accurate adjoint method for calculating coupled sensitivities of complex frequency-domain excitation and emission fluence to any underlying optical parameters in highly scattering media. The method is shown to be general and accurate. Novel vectorized implementations for finite element global matrix assembly and adjoint sensitivity calculations are shown to speed up calculations by orders of magnitude over traditional loop implementations, thereby making least-squares approaches to fluorescence tomography computationally practical.

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

adjoint sensitivities
fluorescence tomography

vectorization
coupled elliptic equations


schemata for teaching structured assembly language programming The paper advocates the use of structured programming techniques in designing and developing assembly language programs. It presents schemata for implementing the major constructs of structured programs in IBM 370 Assembly language. These include the extensive use of equates for defining labels and the use of indentation to illustrate logical dependencies in pseudocode comments.

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

teaching dependencies use paper language


A discrete multivariate mean value theorem with applications ? We establish a discrete multivariate mean value theorem for the class of positive maximum component sign preserving functions. A constructive and combinatorial proof is given based upon a simplicial algorithm and vector labeling. Moreover, we apply this theorem to a discrete nonlinear complementarity problem and an economic equilibrium problem with indivisibilities and show the existence of solutions in both problems under certain mild conditions.

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

mean value theorem
algorithm
equilibrium
complementarity


Existence for unbounded positive solutions of Schrodinger equations in two-dimensional exterior domains In this paper, by using the fixed point theory, under quite general conditions on the nonlinear term we obtain a existence result of unbounded positive solutions of Schrodinger equations in two-dimensional exterior domains. (c) 2007 Elsevier Ltd. All rights reserved.

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


Dynamic maintenance of approximations in set-valued ordered decision systems under the attribute generalization Set-valued information systems are important type of data tables and generalized models of single-valued information systems. Approximations are the focal point of approaches to knowledge discovery based on rough set theory, which can be used to extract and represent the hidden knowledge in the form of decision rules. Attribute generalization refers to dynamic change of the attribute set in an information system with respect to the requirements of real-life applications. In this paper, we focus on maintaining approximations dynamically in set-valued ordered decision systems under the attribute generalization. Firstly, a matrix-based approach for computing approximations of upward and downward unions of decision classes is constructed by introducing the dominant and dominated matrices with respect to the dominance relation. Then, incremental approaches for updating approximations are proposed, which involves several modifications to relevant matrices without having to retrain from the start on all accumulated training data. Finally, comparative experiments on data sets from UCI as well as synthetic data sets show the proposed incremental updating methods are efficient and effective for dynamic attribute generalization.

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

set-valued ordered decision system
incremental learning


DiffServ-aware multicasting in a mobile IPv6 network In this paper we propose an algorithm to establish a DiffServ-Aware Multicast Tree (DAMT) in a mobile IPv6 network. We first use the modified Prims algorithm to construct the Maximum Available Bandwidth Map (MABM) in a mobile IPv6 network. Then, both the extended multicast routing table stored in each Edge Router (ER) and the Interface QoS Table (IQT) stored in each Core Router (CR) are created and used to construct a DAMT. Finally, the constructed MABM can be rearranged (R-MABM) in order to keep the same QoS as a Mobile Node (MN) had in the home network when the MN has moved to a new ER. The proposed algorithm solves the architectural conflicts for the integration of multicasting support in the Diffserv network as well as the problems of the Neglected Reservation Sub-tree (NRS) and receiver heterogeneity. It also solves a MNs QoS requirement when the MN moves from one network to another. Simulation results indicate that the proposed algorithm offers better performance than existing approaches in average delay, average packet loss rate, average throughput, the number of control overhead, the usage of bandwidth, the amount of saved link bandwidth, and the accumulated time to find a feasible path, especially in the case where the number of new join MN is large and traffic loads are heavy.

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


Optimal reconstruction of material properties in complex multiphysics phenomena We develop an optimization-based approach to the problem of reconstructing temperature-dependent material properties in complex thermo-fluid systems described by the equations for the conservation of mass, momentum and energy. Our goal is to estimate the temperature dependence of the viscosity coefficient in the momentum equation based on some noisy temperature measurements, where the temperature is governed by a separate energy equation. We show that an elegant and computationally efficient solution of this inverse problem is obtained by formulating it as a PDE-constrained optimization problem which can be solved with a gradient-based descent method. A key element of the proposed approach, the cost functional gradients are characterized by mathematical structure quite different than in typical problems of PDE-constrained optimization and are expressed in terms of integrals defined over the level sets of the temperature field. Advanced techniques of integration on manifolds are required to evaluate numerically such gradients, and we systematically compare three different methods. As a model system we consider a two-dimensional unsteady flow in a lid-driven cavity with heat transfer, and present a number of computational tests to validate our approach and illustrate its performance.

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

parameter estimation
adjoint analysis
integration on level sets


The role of long memory in hedging effectiveness A joint fractionally integrated, error-correction and multivariate GARCH (FIEC-BEKK) approach is applied to investigate hedging effectiveness using daily data 19952005. The findings reveal the proxied error-correction term has a long memory component that theoretically should affect hedging effectiveness. When the FIEC model empirical conditions are satisfied, the FIEC-BEKK hedging strategy outperforms the OLS benchmark out of sample in terms of both variance reduction and hedger utility. A bootstrap exercise indicates that the variance reduction is statistically significant.

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

fractional cointegration
fiec-bekk
commodities
optimal hedge ratio


Long-lived TCP connections via satellite: Cross-layer bandwidth allocation, pricing, and adaptive control The paper focuses on the assignment of a common bandwidth resource to TCP connections over a satellite channel. The connections are grouped according to their source-destination pairs, which correspond to the up- and down-link channels traversed, and each group may experience different fading conditions. By exploiting the tradeoff between bandwidth and channel redundancy (as determined by bit and coding rates) in the maximization of TCP goodput, an overall optimization problem is constructed, which can be solved by numerical techniques. Different relations between goodput maximization and fairness of the allocations are investigated, and a possible pricing scheme is proposed. The allocation strategies are tested and compared in a fading environment, first under static conditions, and then in a real dynamic scenario. The goodput-fairness optimization allows significant gains over bandwidth allocations only aimed at keeping the channel bit,error rate below a given threshold in all fading conditions.

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


Implementation of an Emergency Department Information System A Qualitative Study of Nurses' Attitudes and Experience This article explores the reactions of nurses toward the implementation of an emergency department information system. Semistructured interviews were conducted with 22 nurses, and data were analyzed using thematic analysis. The results suggest that despite some initial apprehensions nurses were positive in their attitudes and interactions with clinical information systems supportive of their practice, especially in respect of performance targets. Issues of digital work environment design, system availability, and peer support during preliminary interactions were also involved in the formation of their views. Implementation teams addressing these issues have greater chances of maintaining the attitudes that contribute to the successful use of these systems.

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

emergency department
information systems
qualitative study


Should telecoms liberalisation stop at call termination? In recent years concerns about the degree of competition in the provision of telecommunications call termination services have emerged. While the general consensus is that call origination is becoming more and more competitive, regulatory attention to call termination has widened in scope beyond the incumbent public telephone operators, leading to direct regulation of mobile termination charges in some countries and a debate on whether regulation should also be extended to non-dominant networks. This paper assesses whether these concerns are justified, extending the analysis to review the economic literature on reciprocal setting of termination charges between network operators. We conclude that while ex ante regulation of call termination simplifies the work of regulators it does not appear justifiable in all circumstances.

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


Networks of neuroinjury semantic predications to identify biomarkers for mild traumatic brain injury Mild traumatic brain injury (mTBI) has high prevalence in the military, among athletes, and in the general population worldwide (largely due to falls). Consequences can include a range of neuropsychological disorders. Unfortunately, such neural injury often goes undiagnosed due to the difficulty in identifying symptoms, so the discovery of an effective biomarker would greatly assist diagnosis; however, no single biomarker has been identified. We identify several body substances as potential components of a panel of biomarkers to support the diagnosis of mild traumatic brain injury.

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

semantic predications
traumatic brain injury

semantic networks
natural language processing
degree centrality


Paper-craft from 3D polygonal models using generalized cylinders We introduce an algorithm for approximating a 2-manifold 3D mesh by a set of developable surfaces. Each developable surface is a generalized cylinder represented as a strip of triangles not necessarily taken from the original mesh. Our algorithm is automatic, creates easy-to-assemble pieces, and provides L, global error bounds. The algorithm consists of three stages. In the first stage, the mesh is segmented into meaningful components. The second stage approximates each of the mesh components in 3D by a set of triangle strips with smooth (non-jagged) boundaries that guarantee a maximal user-defined error relative to the original mesh. Finally, these strips are unfolded to the plane, resulting in flat patterns, which may be cut and assembled from paper. The approximation quality is controlled by a user-supplied parameter specifying the allowed Hausdorff distance between the input mesh and its piecewise-developable approximation. The strips generated by our algorithm may be parameterized to conform with the parameterization of the original mesh, if given, to facilitate texture mapping. We demonstrate this by physically assembling paper-craft models from the strips generated by our algorithm when run on several polygonal 3D mesh data sets. Crown Copyright (c) 2008 Published by Elsevier B.V. All rights reserved.

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


A new class of QoS routing strategies based on network graph reduction This paper discusses a new approach to QoS routing, introducing the notion of algorithm resilience (i.e., its capability to adapt to network and load modifications) as performance index of the algorithm itself. The new approach can be summarized as Network Graph Reduction, i.e., a modification of the graph describing the network before the routing path is computed, in order to exclude from the path selection over-congested portions of the network. This solution leads to a class of two-step routing algorithms, where both steps are simple, hence allowing efficient implementation. Simulation experiments, run on randomly-generated topologies and traffic patterns, show that these routing algorithms perform consistently better than both the standard Minimum Hop algorithm and those QoS-based algorithms based on the same metrics but not using the notion of Network Graph Reduction. (C) 2002 Elsevier Science B.V. All rights reserved.

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


A lower bound for multicast key distribution With the rapidly growing importance of multicast in the Internet, several schemes for scalable key distribution have been proposed. These schemes require the broadcast of ?(logn) encrypted messages to update the group key when the nth user joins or leaves the group. In this paper, we establish a matching lower bound (Independently, and concurrently, Richard Yang and Simon Lam discovered a similar bound with slightly different properties and proofs. An earlier version of our paper appeared in Infocom 2001 while their result appears in [R. Yang, S. Lam, A secure group key management communication lower bound, Technical Report TR-00-24, Department of Computer Sciences, UT Austin, July 2000, revised September 2000].), thus showing that ?(logn) encrypted messages are necessary for a general class of key distribution schemes and under different assumptions on user capabilities. While key distribution schemes can exercise some tradeoff between the costs of adding or deleting a user, our main result shows that for any scheme there is a sequence of 2n insertion and deletions whose total cost is ?(nlogn). Thus, any key distribution scheme has a worst-case cost of ?(logn) either for adding or for deleting a user.

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


Automatic software test data generation for spanning sets coverage using genetic algorithms Software testing takes a considerable amount of time and resources spent on producing software. Therefore, it would be useful to, have ways to reduce the cost of software testing. The new concepts of spanning sets of entities suggested by Marre and Bertolino are useful for reducing the cost of testing. In fact, to reduce the testing effort, the generation of test data can be targeted to cover the entities in the spanning set, rather than all the entities in the tested program. Marre and Bertolino presented an algorithm based on the subsumption relation between entities to find spanning sets for a family of control flow and data flow-based test coverage criteria. This paper presents a new general technique for the automatic test data generation for spanning sets coverage. The proposed technique applies to the algorithm proposed recently by Marre and Bertolino to automatically generate the spanning sets of program entities that satisfy a wide range of control flow and data flow-based test coverage criteria. Then, it uses a genetic algorithm to automatically generate sets of test data to cover these spanning sets. The proposed technique employed the concepts of spanning sets to limit the number of test cases, guide the test case selection, overcome the problem of the redundant test cases and automate the test path generation.

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

genetic algorithms
subsumption
spanning sets


PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in-flow constraints on vertices. Deciding whether this simple graph model can be manipulated in order to reverse the direction of a particular edge is shown to be PSPACE-complete by a reduction from Quantified Boolean Formulas. We prove this result in a variety of special cases including planar graphs and highly restricted vertex configurations, some of which correspond to a kind of passive constraint logic. Our framework is inspired by (and indeed a generalization of) the "Generalized Rush Hour Logic" developed by Flake and Baum [Theoret. Comput. Sci. 270(1-2) (2002) 895]. We illustrate the importance of our model of computation by giving simple reductions to show that several motion-planning problems are PSPACE-hard. Our main result along these lines is that classic unrestricted sliding-block puzzles are PSPACE-hard, even if the pieces are restricted to be all dominoes (I x 2 blocks) and the goal is simply to move a particular piece. No prior complexity results were known about these puzzles. This result can be seen as a strengthening of the existing result that the restricted Rush Hour (TM) puzzles are PSPACE-complete [Theoret. Comput, Sci. 270(1-2) (2002) 895], of which we also give a simpler proof. We also greatly strengthen the conditions for the PSPACE-hardness of the Warehouseman's Problem [Int. J. Robot. Res. 3(4) (1984) 76.], a classic motion-planning problem. Finally, we strengthen the existing result that the pushing-blocks puzzle Sokoban is PSPACE-complete [In: Proc. Internat. Conf. on Fun with Algorithms, Elba. Italy, June 1998, pp. 65-76.], by showing that it is PSPACE-complete even if no barriers are allowed. (c) 2005 Elsevier B.V. All rights reserved.

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

combinatorial puzzles
sliding blocks
computational complexity
hardness


Position-sensing technologies for movement analysis in stroke rehabilitation Research has focused on improvement of the quality of life of stroke patients. Gait detection, kinematics and kinetics analysis, home-based rehabilitation and telerehabilitation are the areas where there has been increasing research interest. The paper reviews position-sensing technologies and their application for human movement tracking and stroke rehabilitation. The review suggests that it is feasible to build a home-based telerehabilitation system for sensing and tracking the motion of stroke patients.

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

position sensing
motion tracking
inertial sensors


Preserving quality of service guarantees in spite of flow aggregation We investigate how quality of service may be guaranteed to a flow of packets in the presence of flow aggregation. For efficiency, multiple flows, known as the constituent flows, are merged together resulting in a single aggregate flow. After the network node where the aggregation occurs, packet schedulers are aware of the aggregate flow, but are unaware of its constituent flows. In spite of this, we show that quality of service may be guaranteed to the constituent flows, provided the aggregation is performed fairly. When the delay bound of a flow is de-coupled from the flow's reserved rate, flow aggregation preserves the delay bound. When the delay bound of a flow is coupled to the flow's reserved rate, flow aggregation preserves, and in some cases improves, the delay bound.

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


Computer-aided virtual reconstruction of Italian ancient clocks Italy has plenty of cultural heritages. The masterpieces are often placed in locations which are difficult to reach, moreover many artifacts, coming from man's creativity, have very complex functioning. The authors of this paper describe their experience in using the computer graphics capabilities in order to reproduce four ancient clocks functioning coming from different Italian regions. The study is based not only on the 3D-shapes reconstruction but also on the simulation of their complex mechanisms in order to mimic their functioning. The realism of the reconstruction allows to use the graphical products in exhibits, museums and also for maintenance: programs. The rendering techniques together with an accurate camera path, allow to get into the clock mechanisms and to appreciate all the features (and even secrets) that a simple glance cannot reveal. Copyright (c) 2006 John Wiley & Sons, Ltd.

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

ancient clock
cultural heritage
computer-aided simulation
virtual museum


avoiding ballot stuffing in ebay-like reputation systems We present a preliminary study on the robustness of binary feedback reputation systems (e.g. eBay) to ballot stuffing and bad mouthing. In a feedback based reputation system, a seller can collude with other buyers to undertake fake transactions in order to enhance her reputation. This problem is referred to as ballot stuffing. A seller can also be targeted by a group of buyers to deliberately lower her reputation. This problem is referred to as bad mouthing. For the reputations to be meaningful, any practical reputation system needs to be resistant to these problems. We use a simplified model to give an explicit relation between the reputation premium and the transaction cost that needs to hold in order to avoid ballot stuffing. Thus we draw attention to the necessity of transaction costs for a well functioning reputation system. Our conclusions are confirmed by empirical experiments on eBay.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 fuzzy logic approach for detection of video shot boundaries Video temporal segmentation is normally the first and important step for content-based video applications. Many features including the pixel difference, colour histogram, motion, and edge information etc. have been widely used and reported in the literature to detect shot cuts inside videos. Although existing research on shot cut detection is active and extensive, it still remains a challenge to achieve accurate detection of all types of shot boundaries with one single algorithm. In this paper, we propose a fuzzy logic approach to integrate hybrid features for detecting shot boundaries inside general videos. The fuzzy logic approach contains two processing modes, where one is dedicated to detection of abrupt shot cuts including those short dissolved shots, and the other for detection of gradual shot cuts. These two modes are unified by a mode-selector to decide which mode the scheme should work on in order to achieve the best possible detection performances. By using the publicly available test data set from Carleton University, extensive experiments were carried out and the test results illustrate that the proposed algorithm outperforms the representative existing algorithms in terms of the precision and recall rates.

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

temporal video segmentation
shot-boundary detection
content-based video processing


Publication patterns in Russia and the West compared The institutional environment of science differs across countries. Its particularities have an impact on outcomes of scientific enterprise in terms of authorship patterns and patterns of citations. The paper analyzes scholarly papers produced by faculty and graduate students affiliated with six universities, two of them operate in the Russian institutional environment of science and four othersin the Western European and North American. The citation analysis of papers included in two major databases, eLibrary (Russian) and Web of Knowledge (international), shows that the lists of predictors for the number of references to a scholarly article significantly differ in the Western and Russian cases.

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

institutional environment of science
citation analysis
russia
elibrary


Buyer-carts for B2B EC: The b-cart approach To support the purchasing process in the B2B EC platform, we analyzed various architectures of buyer-carts. The desired features in buyer-carts are collection, recording, trashing, tracking, identification, ordering, payment, purchasing decision support, and transmission of records to e-procurement systems. A buyer-cart can be categorized as s-cart, i-cart, and b-cart depending upon its residing sites: seller, intermediary, and buyer. To design the architectures of B2B e-marketplaces considering the role of buyer-carts, we analyzed the feasible combinations of marketplace operators, pricing mechanisms, and types of buyer-carts. Seventeen elementary types of B2B EC architectures turned out meaningful in this regard, thus their pros and cons are evaluated. Based on this framework, we designed a composite architecture MyCart, which allows the buyer to use b-cart along with s-cart and i-cart. By using the b-cart, a buyer can visit multiple sites collecting information in his or her own cart. This will allow the tight integration of b-cart with the e-procurement system. We demonstrate that the b-cart approach can be an effective framework of integrating the e-marketplaces with e-procurement systems and ERP systems. The b-cart can be very effectively applied to the desktop purchasing environment which uses external e-marketplaces.

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

business-to-business
electronic
commerce (b2b ec)
electronic shopping cart (e-cart)
buyer-cart
b-cart
e-procurement system
enterprise application integration
xml
agent
acl


Modeling disordered quantum systems with dynamical networks It is the purpose of the present article to show that so-called network models, originally designed to describe static properties of disordered electronic systems, can be easily generalized to quantum-dynamical models, which then allow for an investigation of dynamical and spectral aspects. This concept is exemplified by the Chalker-Coddington model for the quantum Hall effect and a three-dimensional generalization of it. We simulate phase coherent diffusion of wave packets and consider spatial and spectral correlations of network eigenstates as well as the distribution of (quasi-)energy levels. Apart from that, it is demonstrated how network models can be used to determine two-point conductances. Our numerical calculations for the three-dimensional model at the Metal-Insulator transition point delivers, among others, an anomalous diffusion exponent of eta = 3 - D-2 = 1.7 +/- 0.1. The methods presented here in detail have been used partially in earlier work.

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

anderson localization
disordered systems
dynamical systems
multifractals
quantum diffusion
spectral statistics


A web-based decision support system to estimate extended withdrawal intervals All drugs approved for use in food-producing animals have a withdrawal interval to prevent residues in food of animal origin that are potentially harmful to consumers. These withdrawal times must be appropriately extended if the drug is used in an extralabel manner. This paper describes a web-based application that was developed to facilitate the calculation of extended withdrawal intervals based on information in the databases maintained by members of the Food Animal Residue Avoidance Databank (FARAD) and using the Extrapolated Withdrawal Interval Estimator (EWE) algorithm. The implementation of this application was illustrated using a group of antimicrobials that are used in cattle and swine. The use of this application has been limited to staff veterinarians working for FARAD since limitations in the available pharmacokinetic data require that results are interpreted by personnel with in-depth knowledge of the pharmacokinetics of drugs in food-producing animals.

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

extralabel drug use
drug residues
veterinary medicine


A revised framework for deriving preference values from pairwise comparison matrices In a recent study, Choo and Wedley proposed a framework to categorize and conduct simulations to compare methods for deriving preference values from pairwise comparison matrices. This study demonstrates that some pairs in the examined methods are identical and some methods can be solved in better ways. Additionally, the simulations of Choo and Wedley are somewhat idealized. Thus, this study provides additional simulations. The simulation results lead to different method ranking and conclusions from those of Choo and Wedley.

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

multiple criteria analysis
analytical hierarchy process
priority vector


spatial sound localization in an augmented reality environment Augmented Reality (AR), the overlay of virtual images onto the real world, is an increasingly popular technique for developing new human-computer interfaces. As human navigation and orientation in different environments depend on both visual and auditory information, sound plays a very important role in AR applications. In this paper we explore users' capability to localize a spatial sound (registered with a virtual object) in an AR environment, under different spatial configurations of the virtual scene. The results not only confirm several previous findings on sound localization, but also point out some important new visual-audio cues which should be taken into consideration for effective localization and orientation in AR environment. Finally, this paper provides tentative guidelines for adding spatial sound to AR environments.

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

localization
spatial sound
augmented reality


Numerical and experimental study on waverider with blunt leading edge Waverider is considered to be a good candidate for hypersonic flights, but due to the serious aero-heating and facture limitations, its infinite sharp leading edge should be blunted. In this paper, numerical method is used to study the flow characteristics of blunt waverider, including the mechanism of bluntness impact and the feasibility of nonuniform blunt method. An experiment has been done in FD-14A hypersonic shock wind tunnel to obtain the flow structure and heat flux distribution in the nose region of one waverider model. The results show that bluntness induces a detached bow shock around the nose region and spillage along the leading edge. As the blunt radius enlarges, the aerodynamic performance degrades remarkably. Fortunately, the severe aero-heating is limited in a small region around stagnation point for blunt waverider, and smaller blunt radius can be used for most of the leading edge. Owing to the improvement of aerodynamic performance and negligible influence on thermal protection system, the concept of "nonuniform blunt method" is proved to be feasible for hypersonic waverider design. (C) 2013 Elsevier Ltd. All rights reserved.

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

waverider
nonuniform blunt method
experiment


Using High Performance Fortran to parallelise a multi-layer atmospheric transport model An atmospheric transport model, FRAME (Fine Resolution AMmonia Exchange), has been used to model the spatial pattern of ammonia concentrations and deposition over the British Isles. The model uses a multi-layer approach with diffusion through 33 layers to describe vertical concentration profiles in the atmosphere explicitly. Together with the necessary description of atmospheric reactions with sulphur and oxidised nitrogen, this imposes a major computational requirement, with the model having a run-time of 8.5 days on a mid-range workstation. Improvement in the model run-time was sought by developing a parallel implementation coded in a data-parallel approach using High Performance Fortran. Running the code on a Cray T3E with 128 processors provided a speedup by a factor of 120. The codes portability, scalability and performance on different parallel platforms are discussed.

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


Formal languages for integer programming modeling of shift scheduling problems This paper approaches the problem of modeling optimization problems containing substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with Mixed Integer Programming (MIP). We suggest an approach inspired by global constraints used in Constraint Programming (CP) to exploit formal languages for the modeling of such substructures with MIP. More precisely, we first suggest a way to use automata, as the CP regular constraint does, to express allowed patterns for the values taken by the constrained sequence of variables. Secondly, we present how context-free grammars can contribute to formulate constraints on sequences of variables in a MIP model. Experimental results on both approaches show that they facilitate the modeling, but also give models easier to solve by MIP solvers compared to compact assignment MIP formulations.

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

constraint programming
integer programming
formal languages


Tube methods for BV regularization In this paper tube methods for reconstructing discontinuous data from noisy and blurred observation data are considered. It is shown that discrete bounded variation (BV)-regularization ( commonly used in inverse problems and image processing) and the taut-string algorithm ( commonly used in statistics) select reconstructions in a tube. A version of the taut-string algorithm applicable for higher dimensional data is proposed. This formulation results in a bilateral contact problem which can be solved very efficiently using an active set strategy. As a by-product it is shown that the Lagrange multiplier of the active set strategy is an efficient parameter for edge detection.

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

filtering
segmentation
taut-string algorithm


Combined Affine Geometric Transformations and Spatially Dependent Radiometric Deformations: A Decoupled Linear Estimation Framework This paper considers the problem of registering two observations of the same object, where the observations differ due to a combined effect of an affine geometric transformation and nonuniform illumination changes. The problem of deriving new representations of the observations that are both invariant to geometric transformations and linear in the illumination model is analyzed. In this framework, we present a novel method for linear estimation of illumination changes in an affine invariant manner, thus, decoupling the original problem into two simpler ones. The computational complexity of the method is low as it requires no more than solving a linear set of equations. The prior step of illumination estimation is shown to improve the accuracy of state-of-the-art registration techniques by a factor of two.

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

affine invariance
affine invariant features
geometric distortion
illumination invariance
object tracking
pose estimation


SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES Given a set S of points in the plane, a geometric network for S is a graph G with vertex set S and straight edges. We consider a broadcasting situation, where one point r is an element of S is a designated source. Given a dilation factor delta, we ask for a geometric network G such that for every point v is an element of S there is a path from r to v in G of length at most delta vertical bar rv vertical bar, and such that the total edge length is minimized. We show that finding such a network of minimum total edge length is NP-hard, and give an approximation algorithm.

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

spanner
minimum spanning tree
single source


Optimal transport and integer partitions We link the theory of optimal transportation to the theory of integer partitions. Let P(n) P ( n ) denote the set of integer partitions of n?N n ? N and write partitions ??P(n) ? ? P ( n ) as (n1,,nk(?)) ( n 1 , , n k ( ? ) ) . Using terminology from optimal transport, we characterize certain classes of partitions like symmetric partitions and those in Eulers identity

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


Topology optimization of structures using modified binary differential evolution Differential evolution (DE) is an efficient population based algorithm used to solve real-valued optimization problems. It has the advantage of incorporating relatively simple and efficient mutation and crossover operators. However, the DE operator is based on floating-point representation only, and is difficult to use when solving combinatorial optimization problems. In this paper, a modified binary differential evolution (MBDE) based on a binary bit-string framework with a simple and new binary mutation mechanism is proposed. Two test functions are applied to verify the MBDE framework with the new binary mutation mechanism, and four structural topology optimization problems are used to study the performance of the proposed MBDE algorithm. The experimental studies show that the proposed MBDE algorithm is not only suitable for structural topology optimization, but also has high viability in terms of solving numerical optimization problems.

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

modified binary differential evolution
numerical optimization
structural topology optimization


Generic two-degree-of-freedom linear and fuzzy controllers for integral processes This paper presents a new framework for the design of generic two-degree-of-freedom (2-DOF), linear and fuzzy, controllers dedicated to a class of integral processes specific to servo systems. The first part of the paper presents four 2-DOF linear PI controller structures that are designed using the Extended Symmetrical Optimum method to ensure the desired overshoot and settling time. The second part of the paper presents an original design method for 2-DOF TakagiSugeno PI-fuzzy controllers based on the stability analysis theorem. Experimental results for the speed control of a servo system with variable load illustrate the performance of the new generic control structures.

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

fuzzy control
pi and pid control
tracking
tuning


A logic-based agent that plans for extended reachability goals Planning to reach a goal is an essential capability for rational agents. In general, a goal specifies a condition to be achieved at the end of the plan execution. In this article, we introduce nondeterministic planning for extended reachability goals (i.e., goals that also specify a condition to be preserved during the plan execution). We show that, when this kind of goal is considered, the temporal logic CTL turns out to be inadequate to formalize plan synthesis and plan validation algorithms. This is mainly due to the fact that the CTL's semantics cannot discern among the various actions that produce state transitions. To overcome this limitation, we propose a new temporal logic called alpha-CTL. Then, based on this new logic, we implement a planner capable of synthesizing reliable plans for extended reachability goals, as a side effect of model checking.

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


Incremental Evolution of Fuzzy Grammar Fragments to Enhance Instance Matching and Text Mining In many applications, it is useful to extract structured data from sections of unstructured text. A common approach is to use pattern matching (e.g., regular expressions) or more general grammar-based techniques. In cases where exact templates or grammar fragments are not known, it is possible to use machine learning approaches, based on words or n-grams, to identify the structured data. This is generally a two-stage (train/use) process that cannot easily cope with incremental extensions of the training set. In this paper, we combine a fuzzy grammar-based approach with incremental learning. This enables a set of grammar fragments to evolve incrementally, each time a new example is given, while guaranteeing that it can parse previously seen examples. We propose a novel measure of overlap between fuzzy grammar. fragments that can also be used to determine the degree to which a string is parsed by a grammar fragment. This measure of overlap allows us to compare the range of two fuzzy grammar fragments (i.e., to estimate and compare the sets of strings that fuzzily conform to each grammar) without explicitly parsing any strings. A simple application shows the method's validity.

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

grammar fragments
incremental learning
instance matching
text mining

entity extraction
evolving system
extensible markup language (xml)
fuzzy sets
tagging


Time-series modeling of fishery landings using ARIMA models and Fuzzy Expected Intervals software Forecasting, using historic time-series data, has become an important tool for fisheries management. ARIMA modeling, Modeling for Optimal Forecasting techniques and Decision Support Systems based on fuzzy mathematics may be used to predict the general trend of a given fish landings time-series with increased reliability and accuracy. The present paper applies these three modeling methods to forecast anchovy fish catches landed in a given port (Thessaloniki, Greece) during 19792000 and hake and bonito total fish catches during 19822000. The paper attempts to assess the model's accuracy by comparing model results to the actual monthly fish catches of the year 2000. According to the measures of forecasting accuracy established, the best forecasting performance for anchovy was shown by the DSS model (MAPE=28.06%, RMSE=76.56, U-statistic=0.67 and R2=0.69). The optimal forecasting technique of genetic modeling improved significantly the forecasting values obtained by the selected ARIMA model. Similarly, the DSS model showed a noteworthy forecasting efficiency for the prediction of hake landings, during the year 2000 (MAPE=2.88%, RMSE=13.75, U-statistic=0.19 and R2=0.98), as compared to the other two modeling techniques. Optimal forecasting produced by combined modeling scored better than application of the simple ARIMA model. Overall, DSS results showed that the Fuzzy Expected Intervals methodology could be used as a very reliable tool for short-term predictions of fishery landings.

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

arima modeling
fish landings
decision support systems

fuzzy expected interval model
stochastic prediction models


A new procedure for determination of insulators contamination in electrical distribution networks This paper is presented a novel index for contamination identification. Current of a typical feeder in polluted area was used for this procedure. PWT is used for feature extraction and PCA for feature reduction.

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

power distribution faults
packet wavelet transform
principal component analysis


An investigation into heuristics for alternative worker selection in discrete event simulation In this paper, we analyse four different heuristics for qualified worker selection for machines in discrete event simulation. Conventional simulators simply select a capable worker randomly or from the top-of-the-stack (TOS) of candidates that are qualified to operate a machine, without considering the impact of removing that worker from the current available qualification pool (qPool). To investigate the efficacy of this approach, we compare these random and TOS approaches with two other worker selection rules: least number of qualifications (LENQ), and a heuristic that selects a worker with the lowest impact factor on the qualification pool (LIMP). LIMP ranks workers based on their contribution to the qPool and the constrainedness of each of their qualifications. We apply LENQ to a simulation model of a real company, and compared with the Random heuristic we observe a 44% reduction in the qualification resource constraint metric (RCMq) and a 2% reduction in the total lateness in sales-order satisfaction. For the LIMP heuristic, the RCMq reduction is 77%. However, LIMP yields no significant improvement in sales-order lateness over the simpler LENQ approach. The LENQ and LIMP heuristics also have the benefit of more closely modelling what happens in reality, as they are based on intuition that would be used in practice, rather than using a random or simple TOS approach followed in conventional simulation. Journal of Simulation (2013) 7, 61-67. doi:10.1057/jos.2012.14; published online 13 July 2012

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


Adaptive genetic algorithm for advanced planning in manufacturing supply chain A main function for supporting global objectives in a manufacturing supply chain is planning and scheduling. This is considered such an important function because it is involved in the assignment of factory resources to production tasks. In this paper, an advanced planning model that simultaneously decides process plans and schedules was proposed for the manufacturing supply chain (MSC). The model was formulated with mixed integer programming, which considered alternative resources and sequences, a sequence-dependent setup and transportation times. The objective of the model was to analyze alternative resources and sequences to determine the schedules and operation sequences that minimize makespan. A new adaptive genetic algorithm approach was developed to solve the model. Numerical experiments were carried out to demonstrate the efficiency of the developed approach.

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

advanced planning
manufacturing supply chain
scheduling
adaptive genetic algorithm


On Cellular Automata Modeling of Cardiac Pacemaker Motivated by modern physiology, cellular automata of Greenberg-Hastings type is considered. The basic cell of the system performs a cyclic 3-state intrinsic dynamics F -> R -> A -> F -> ... which is delimited by time intervals n(F), n(R), n(A) of steps spent by the cell in particular states. It is shown that proposed cellular automata can be thought as a reliable approximate model to the real cardiac pacemaker. The time intervals determine the period of the whole pacemaker beating. The relation between n(R) and n(F) works as a switch between two types of global dynamics: active dynamics where permanent mutual impacts between cells generate the most frequent impulses, and passive dynamics which is distinguished by the special self-organization of phases between the subsequent cells. The passive dynamics allows to propagate signals from the outside world while the active dynamics protects the system against external influence.

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

greenberg-hastings cellular automata
excitable media
sinus node


Laminar structure of ptolemaic graphs with applications ? Ptolemaic graphs are those satisfying the Ptolemaic inequality for any four vertices. The graph class coincides with the intersection of chordal graphs and distance hereditary graphs. It can also be seen as a natural generalization of block graphs (and hence trees). In this paper, we first state a laminar structure of cliques, which leads to its canonical tree representation. This result is a translation of ? ? -acyclicity which appears in the context of relational database schemes. The tree representation gives a simple intersection model of ptolemaic graphs, and it is constructed in linear time from a perfect elimination ordering obtained by the lexicographic breadth first search. Hence the recognition and the graph isomorphism for ptolemaic graphs can be solved in linear time. Using the tree representation, we also give an efficient algorithm for the Hamiltonian cycle problem.

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

hamiltonian cycle
intersection model
ptolemaic graphs

algorithmic graph theory
data structures
? ? -acyclicity ? ? ? ? ?


Planning and Design Considerations for Computer Supported Collaboration Spaces Architects have long been aware of the need to design for the behaviors a space is meant to support. However, neither the seminal works on architectural programming or collaborative engineering address the linkages between physical environment design and collaborative work practice. This paper posits that the design of collaboration environments should stand as a third pillar of collaboration engineering, suggests four ways in which physical environment design and collaboration engineering might mutually inform the other, and specifies several dimensions of physical environment affordance collaboration engineers might consider when developing requirements for collaboration space. Space

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

interior design
space planning
architecture
meeting space
group support systems


Mediating effects of active and distributed instruments on narrative activities This paper discusses the effects of introducing new distributed and active instruments on narrative activities in a school environment. We address the issue of how the Pogo instruments change children's activity when they invent stories. The results enable us to compare the way the activity is carried out, both in its conventional context and with the Pogo instruments, mainly along three main lines of investigation: the collective dimension, the use of space and the structure of the narrative. The results also show that using the instruments increase the collective or group dimension of the creative process, particularly the role diversification and participation of the children. These instruments support children's efforts to structure narratives and thereby produce richer stories. This research was carried out within the Pogo Project by a multidisciplinary team that included interactive design and user-centered approaches within the EC 13 programme on 'Exploring New Learning Futures for Children'. (C) 2003 Elsevier B.V. All rights reserved.

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

mediation
narrative activity
collective creation


Income, affordable and threshold effects on FMS in the developed and developing economies This paper studies the effects on fixed to mobile substitution (FMS) that has evolved into an essential industry trend. Based on data from 1997 through 2005, three kinds of effects, income, affordable and threshold, are derived from various FMS patterns in developed and developing economies. The income effect is the prerequisite for the two other effects. For the G7 and new industry economies (NIE) (Taiwan, Singapore, H.K and S. Korea), the 5% income effect threshold is crossed and the mobile penetration rate climbs up rapidly. However, for Association of Southeast Asian Nations (ASEAN) and Brazil, Russia, India and China (BRIC),1 most of these developing economies have experienced only the income effect. When mobile average revenue per user (ARPU) comes close to or drops lower than fixed line ARPU, the mobile penetration rate begins to increase and the affordable effect appears. As the mobile penetration rate begins to grow, it does not at first affect fixed line growth. The threshold effect happens only when the mobile penetration rate crosses a critical mass threshold; then the growth of fixed line penetration will decline or stop. Once mobile substitution occurs, the traditional paradigm of fixed line as the universal service obligation (USO) is no longer valid and the rules must be changed.

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

fms
fixed line
mobile
penetration
substitution
g7
nie
asean