bayesian localization in wireless networks using angle of arrival Using existing wireless communication networks as a localization infrastructure promises enormous cost and deployment savings over specific localization infrastructures. In this work we investigate a Bayesian network approach that uses a combination of radio signal strength (RSS) to distance estimation along with angle-of-arrival (AoA) information. We characterize the resulting localization accuracy using data collected outdoors using different radios, indoor data, and simulated data. We show how the localization performance degrades in indoor environments and analyze the different sources of errors that cause this performance degradation as compared to outdoor settings. We found our network is quite sensitive to variations in the distance to signal strength, and the additional angle information had only a small impact on localization accuracy.

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

bayesian statistics
wireless local area networks


A control system testbed to validate critical infrastructure protection concepts This paper describes the Mississippi State University SCADA Security Laboratory and Power and Energy Research laboratory. This laboratory combines model control systems from multiple critical infrastructure industries to create a testbed with functional physical processes controlled by commercial hardware and software over common industrial control system routable and non-routable networks. Laboratory exercises, functional demonstrations, and lecture material from the testbed have been integrated into a newly developed industrial control system cybersecurity course, into multiple other engineering and computer science courses, and into a series of short courses targeted to industry. Integration into the classroom allows the testbed to provide a workforce development function, prepares graduate students for research activities, and raises the profile of this research area with students. The testbed enables a research process in which cybersecurity vulnerabilities are discovered, exploits are used to understand the implications of the vulnerability on controlled physical processes, identified problems are classified by criticality and similarities in type and effect, and finally cybersecurity mitigations are developed and validated against within the testbed. Overviews of research enabled by the testbed are provided, including descriptions of software and network vulnerability research, a description of forensic data logger capability developed using the testbed to retrofit existing serial port MODBUS and DNP3 devices, and a description of intrusion detection research which leverages unique characteristics of industrial control systems.

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

testbed
industrial control system
scada
cybersecurity


Structural properties of reflected Levy processes This paper considers a number of structural properties of reflected Levy processes, where both one-sided reflection (at 0) and two-sided reflection (at both 0 and K > 0) are examined. With V(t) being the position of the reflected process at time t, we focus on the analysis of zeta(t) := EV(t) and xi(t) := Var V(t). We prove that for the one- and two-sided reflection, zeta(t) is increasing and concave, whereas for the one-sided reflection, xi(t) is increasing. In most proofs we first establish the claim for the discrete-time counterpart (that is, a reflected random walk), and then use a limiting argument. A key step in our proofs for the two-sided reflection is a new representation of the position of the reflected process in terms of the driving Levy process.

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

complete monotonicity
one/two-sided reflection
mean function
variance function
stationary increments
concordance


Analytical modeling and experimental verification of vibration-based piezoelectric bimorph beam with a tip-mass for power harvesting Power harvesting techniques that convert vibration energy into electrical energy through piezoelectric transducers show strong potential for powering smart wireless sensor devices in applications of structural health monitoring. This paper presents an analytical model of the dynamic behavior of an electromechanical piezoelectric bimorph cantilever harvester connected with an ACDC circuit based on the EulerBernoulli beam theory and Hamiltonian theorem. A new cantilevered piezoelectric bimorph structure is proposed in which the plug-type connection between support layer and tip-mass ensures that the gravity center of the tip-mass is collinear with the gravity center of the beam so that the brittle fracture of piezoelectric layers can also be avoided while vibrating with large amplitude. The tip-mass is equated by the inertial force and inertial moment acting at the end of the piezoelectric bimorph beam based on D'Alembert's principle. An ACDC converting circuit soldered with the piezoelectric elements is also taken into account. A completely new analytic expression of the global behavior of the electromechanical piezoelectric bimorph harvesting system with ACDC circuit under input base transverse excitation is derived. Moreover, an experimental energy harvester is fabricated and the theoretical analysis and experimental results of the piezoelectric harvester under the input base transverse displacement excitation are validated by using measurements of the absolute tip displacement, electric voltage response, electric current response and electric power harvesting.

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

electromechanical piezoelectric harvesting hamiltonian acdc


Logic of subtyping We introduce new modal logical calculi that describe subtyping properties of Cartesian product and disjoint union type constructors as well as mutually recursive types defined using those type constructors. Basic logic of subtyping S extends classical propositional logic by two new binary modalities x and +. An interpretation of S is a function that maps standard connectives into set-theoretical operations (intersection, union, and complement) and modalities into Cartesian product and disjoint union type constructors. This allows S to capture many subtyping properties of the above type constructors. We also consider logics S(rho) and S(rho)(omega) that incorporate into S mutually recursive types over arbitrary and well-founded universes correspondingly. The main results are completeness of the above three logics with respect to appropriate type universes. In addition, we prove Cut elimination theorem for S and establish decidability of S and S(rho)(omega). (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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O

subtype
curry-howard isomorphism
proposition-as-type
non-standard logic


An analysis of XML database solutions for the management of MPEG-7 media descriptions MPEG-7 constitutes a promising standard for the description of multimedia content. It can be expected that a lot of applications based on MPEG-7 media descriptions will be set up in the near future. Therefore, means for the adequate management of large amounts of MPEG-7-compliant media descriptions are certainly desirable. Essentially, MPEG-7 media descriptions are XML documents following media description schemes defined with a variant of XML Schema. Thus, it is reasonable to investigate current database solutions for XML documents regarding their suitability for the management of these descriptions. In this paper, we motivate and present critical requirements for the management of MPEG-7 media descriptions and the resulting consequences for XML database solutions. Along these requirements, we discuss current state-of-the-art database solutions for XML documents. The analysis and comparison unveil the limitations of current database solutions with respect to the management of MPEG-7 media descriptions and point the way to the need for a new generation of XML database solutions.

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

languages
measurement
standardization
mpeg-7
multimedia databases
xml database systems


Caspase 7 Is a Positional Candidate Gene for IDDM 17 in a Bedouin Arab Family The IDDM 17 locus was mapped to an 8-cM interval at chromosome 10q25.1 based on linkage in a large Bedouin Arab family with 19 affected relatives. Caspase 7 (CASP7), an apoptosis-related cysteine protease, is one of the few known genes in this region. CASP7 is involved in the activation cascade of caspases responsible for apoptosis execution. Only 1 of the 18 SNPs in CASP7 (SNP144692) differed significantly in frequency in the haplotypes found in affected individuals compared to control Bedouin haplotypes. This same SNP showed evidence of association with diabetes in a subset of patients (DR3/DR4*0302) from HBDI families.

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


A nonscan design-for-testability method for register-transfer-level circuits to guarantee linear-depth time expansion models This paper presents a nonscan design-for-testability (DFT) method for register-transfer-level (RTL) circuits. We first introduce the tau(k) notation to analyze the test generation complexity, as well as two classes of sequential circuits, namely: 1) the combinationally testable class and 2) the acyclically testable class. Then, we introduce a new class of linear-depth time-bounded circuits as one of the acyclically testable classes. The linear-depth time-bounded testability guarantees that the number of time frames required for any testable fault is bounded by a linear function of the number of flip-flops in the circuit during the test generation process. As one of the linear-depth time-bounded classes, we introduce a new class of RTL circuits, called the cycle-unrollable RTL circuits, which is shown to be linear depth time bounded. We propose a DFT method to make RTL circuits cycle unrollable and a test generation method for cycle-unrollable RTL circuits. Experimental results show that we can drastically reduce hardware overhead and test application time compared to the full-scan method and the method proposed by Ohtake et al. Moreover, our proposed method can achieve 100% fault efficiency for gate-level single stuck-at faults in practical test generation time and allow at-speed testing.

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

acyclic testability
at-speed testing
design for testability
register transfer level (rtl)


A Variational Framework for Structure from Motion in Omnidirectional Image Sequences We address the problem of depth and ego-motion estimation from omnidirectional images. We propose a correspondence-free structure-from-motion problem for sequences of images mapped on the 2-sphere. A novel graph-based variational framework is first proposed for depth estimation between pairs of images. The estimation is cast as a TV-L1 optimization problem that is solved by a fast graph-based algorithm. The ego-motion is then estimated directly from the depth information without explicit computation of the optical flow. Both problems are finally addressed together in an iterative algorithm that alternates between depth and ego-motion estimation for fast computation of 3D information from motion in image sequences. Experimental results demonstrate the effective performance of the proposed algorithm for 3D reconstruction from synthetic and natural omnidirectional images.

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

structure from motion
depth estimation
omnidirectional
variational


Ergonomics of abrasive blasting: A comparison of high pressure water and steel shot Abrasive blasting with silica sand has long been associated with silicosis. Alternatives to sand are being used increasingly. While NIOSH has done extensive investigations of the respiratory effects of the substitutes for sand, the ergonomic effects of the substitutes have not been examined. Too often, hazards are shifted, and technologies that might save workers lungs could do so at the expense of their musculoskeletal systems. Hence, the objective of this study was to examine the ergonomic effects of alternatives to sand. Multiple methods, both qualitative and quantitative, were used to yield numerous kinds of data for the analysis of exposures to abrasive blasters. PATH, a method for quantifying ergonomic exposure in non-routine work, was combined with interviews with workers, biomechanical modeling and noise level readings to assess the ergonomics of two abrasive blasting operations: high-pressure water and steel shot. Advantages and disadvantages of each medium are discussed. High-pressure water was slightly less ergonomically stressful, environmentally cleaner, much quieter and less dusty that steel shot, and it was reported to be slower on those tasks where both media could be used.

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


A two-stage mechanism for registration and classification of ECG using Gaussian mixture model An automatic classifier for electrocardiogram (ECG) based cardiac abnormality detection using Gaussian mixture model (GMM) is presented here. In first stage, pre-processing that includes re-sampling, QRS detection, linear prediction (LP) model estimation, residual error signal computation and principal component analysis (PCA) has been used for registration of linearly independent ECG features. GMM is here used for classification based on the registered features in a two-class pattern classification problem using 730 ECG segments from MIT-BIH Arrhythmia and European ST-T Ischemia datasets. A set of 12 features explaining 99.7% of the data variability is obtained using PCA from residual error signals for GMM based classification. Sixty percent of the data is used for training the classifier and 40% for validating. It is observed that the overall accuracy of the proposed strategy is 94.29%. As an advantage, it is also verified that Chernoff bound and Bhattacharya bounds lead to minimum error for GMM based classifier. In addition, a comparative study is done with the standard classification techniques with respect to its overall accuracy.

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

ecg
linear prediction
pca
gmm
chernoff bound

pan tompkins algorithm
bhattacharya bound


A Dynamic Longest Prefix Matching Content Addressable Memory for IP Routing An internet protocol (IP) router determines the next hop for a packet by finding the longest prefix match. This lookup often occurs in ternary content addressable memory (TCAM), which allows bit masking of the IP address. In this paper, an internet protocol content addressable memory (IPCAM) circuit that directly determines the longest prefix match to the stored address is described. The proposed IPCAM produces an encoded prefix match length that is limited by the prefix mask. Entries need not be sorted in order. One of the proposed IPCAM entries replaces on average 22 TCAM entries. Consequently the longest prefix matching CAM is less than 1/10 the size of the equivalent TCAM and dissipates 93.5% less dynamic power. The encoded outputs drive a priority encoder to determine the longest prefix match in the IPCAM arrays. A priority encoder circuit architecture appropriate to the unsorted IPCAM entries is also presented.

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

ternary content addressable memory (tcam)


Exploiting eye-hand coordination to detect grasping movements Human beings are very skillful at reaching for and grasping objects under multiple conditions, even when faced with an object's wide variety of positions, locations, structures and orientations. This natural ability, controlled by the human brain, is called eye-hand coordination. To understand this behavior it is necessary to study both eye and hand movements simultaneously. This paper proposes a novel approach to detect grasping movements by means of computer vision techniques. This solution fuses two viewpoints, one viewpoint which is obtained from an eye-tracker capturing the user's perspective and a second viewpoint which is captured by a wearable camera attached to a user's wrist. Utilizing information from these two viewpoints it is possible to characterize multiple hand movements in conjunction with eye-gaze movements through a Hidden-Markov Model framework. This paper shows that combining these two sources makes it possible to detect hand gestures using only the objects contained in the scene even without markers on the surface of the objects. In addition, it is possible to detect which is the desired object before the user can actually grasp said object. (C) 2012 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

visual system
motion analysis
hand posture
hand gesture
object recognition


The implementation and evaluation of a mobile self- and peer-assessment system Recently, more and more researchers have been exploring uses of mobile technology that support new instructional strategies. Based on research findings related to peer and self assessment, this study developed a Mobile Assessment Participation System (MAPS) using Personal Digital Assistants (PDAs) as the platform In addition. the study proposes an implementation model of the MAPS that should facilitate the effectiveness of self- and peer-assessment in classrooms The researcher argues that teachers and students can benefit from MAPS in various regards including more flexible assessment arrangement, more efficient use of time, and more opportunities for student reflection on learning and assessment. Thirty-seven students taking teacher-education courses with the researcher participated in this study, and these students employed the MAPS to conduct two-round assessment activities that would help these students assess both their own and one another's final projects Both the students' valid responses in a survey herein and scores obtained from the assessment activities confirmed the benefits of the MAPS and its implementation model Yet, the students voiced such concerns as the objectivity of peer-assessment and the difficulty of providing constructive feedback, and the correlation analysis indicated a lack of consistency between teacher-grading and student-grading (C) 2010 Elsevier Ltd. All rights reserved.

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

evaluation of cal systems
improving classroom teaching
teaching/learning strategies


Magnetoresistance in a GaAsAlGaAs two-dimensional electron gas with one-dimensional periodic potential fabricated by AFM local anodization We report the application of the local anodization technique by using an atomic force microscope to GaAsAlGaAs two-dimensional electron system. We have measured the magnetoresistance in samples with a one-dimensional periodic potential induced by this method, to investigate the properties of the introduced potential. The observed Weiss oscillations and the negative magnetoresistance are analyzed in samples with different 1D potential strength controlled by the anodization conditions. The electron localization observed in the samples may be attributed to the inhomogeneity of the potential induced by the local anodization.

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

afm lithography
weiss oscillation
ballistic electron transport


Speech enhancement using hidden Markov models in Mel-frequency domain Hidden Markov model (HMM)-based minimum mean square error speech enhancement method in Mel-frequency domain is focused on and a parallel cepstral and spectral (PCS) modeling is proposed. Both Mel-frequency spectral (MFS) and Mel-frequency cepstral (MFC) features are studied and experimented for speech enhancement. To estimate clean speech waveform from a noisy signal, an inversion from the Mel-frequency domain to the spectral domain is required which introduces distortion artifacts in the spectrum estimation and the filtering. To reduce the corrupting effects of the inversion, the PCS modeling is proposed. This method performs concurrent modeling in both cepstral and magnitude spectral domains. In addition to the spectrum estimator, magnitude spectrum, log-magnitude spectrum and power spectrum estimators are also studied and evaluated in the HMM-based speech enhancement framework. The performances of the proposed methods are evaluated in the presence of five noise types with different SNR levels and the results are compared with several established speech enhancement methods especially auto-regressive HMM-based speech enhancement. The experimental results for both subjective and objective tests confirm the superiority of the proposed methods in the Mel-frequency domain over the reference methods, particularly for non-stationary noises.

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

hmm-based speech enhancement
mel-frequency
parallel cepstral and spectral (pcs)


GTeCA versatile MATLAB tool for a detailed computation of the terrain correction and Bouguer gravity anomalies A versatile MATLAB code for gravity terrain correction is presented. It goes beyond the limits of other available programs for terrain correction. Absolute or free air data at land/sea surface are accepted using more nested DEMs. It exploits a formula modeling a tessellated network formed by triangular polyhedra. Accurate terrain correction is allowed in presence of steep topographic gradients.

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

gravity anomaly
bouguer anomaly
bullard corrections
curvature correction
free air correction


Central points and approximation in residuated lattices We present results on approximation in residuated lattices given that closeness is assessed by means of biresiduum. We define basic notions as central points of subsets of residuated lattices and closed balls. We describe central points, optimal central points, and unique central points and examine several of their properties. We present algorithms for two problems regarding optimal approximation.

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

residuated lattice
central point
tolerance


An iterated local search heuristic for the split delivery vehicle routing problem This paper concerns the Split Delivery Vehicle Routing Problem (SDVRP). This problem is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) since the customers? demands are allowed to be split. We deal with the cases where the fleet is unlimited (SDVRP-UF) and limited (SDVRP-LF). In order to solve them, we implemented a multi-start Iterated Local Search (ILS) based heuristic that includes a novel perturbation mechanism. Extensive computational experiments were carried out on benchmark instances available in the literature. The results obtained are highly competitive, more precisely, 55 best known solutions were equaled and new improved solutions were found for 243 out of 324 instances, with an average and maximum improvement of 1.15% and 2.81%, respectively.

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


occlusion-aware multi-uav surveillance We present an agent-based coordination and planning method for autonomous aerial surveillance of multiple urban areas using a group of fixed-wing unmanned aerial vehicles (UAVs). The goal of the surveillance is to observe a set of ground points of interest within the target areas as often as possible. The method differs from the existing work by explicit consideration of sensor occlusions that can occur due to high buildings and/or other obstacles in the target area. The solution employs a decomposition of the problem in two subproblems: the problem of single-area surveillance and the problem of allocating UAVs to multiple areas. The overall method is evaluated empirically on a realistic simulation of aerial surveillance built using the AgentFly framework.

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


Electronic books: a survey of users in the UK Purpose - This study provides insights into the early market for e-books in the UK through survey research with members of a large online panel. Design/methodology/approach - Data were collected from an online panel established by a leading commercial internet research company. Members of the panel are signalled each week to take part in web surveys. Respondents completed an online questionnaire posted on the company's web site. Questions explored awareness, trialling, purchase and borrowing of e-books, examining the frequency of such behaviour and types of publications accessed and/or obtained. Findings - A significant proportion of respondents (85 per cent) were aware of e-books. Among these respondents, around half (49 per cent) had made trial use of them, nearly four in ten (38 per cent) had bought at least one e-book, and one in seven (13 per cent) had borrowed an e-book from a library. Technical books and non-fiction publications related to hobbies and interests were among those most popularly used and bought. The main perceived advantages of e-books are that they can be obtained more conveniently than going via a bookstore and they are often cheaper than hard copy versions. Research limitations/implications - This online survey was dependent on respondent self-selection. This meant that there was no central control over the return sample profile. Originality/value - This survey provided an early look at the e-book market in the UK. Findings indicated the market potential of e-books given that the equipment needed to read them is regarded neither as too expensive nor too difficult to use. It is clear, however, that early e-book users regard electronic reading as something to use primarily for reference work than for more extended reading for leisure and entertainment. Most e-book users (56 per cent) still preferred not to read extended passages of text from a screen. Nonetheless, for dipping in and out of reference works e-books have the advantage of being easier to search and easier to annotate.

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

electronic publishing
united kingdom
user studies


Construction of explicit and implicit dynamic finite difference schemes and application to the large-eddy simulation of the TaylorGreen vortex A general class of explicit and implicit dynamic finite difference schemes for large-eddy simulation is constructed, by combining Taylor series expansions on two different grid resolutions. After calibration for Re?? Re ? ? , the dynamic finite difference schemes allow to minimize the dispersion errors during the calculation through the real-time adaption of a dynamic coefficient. In case of DNS resolution, these dynamic schemes reduce to Taylor-based finite difference schemes with formal asymptotic order of accuracy, whereas for LES resolution, the schemes adapt to Dispersion-Relation Preserving schemes. Both the explicit and implicit dynamic finite difference schemes are tested for the large-eddy simulation of the TaylorGreen vortex flow and numerical errors are investigated as well as their interaction with the dynamic Smagorinsky model and the multiscale Smagorinsky model. Very good results are obtained.

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

dynamic finite difference schemes
taylorgreen vortex

dispersion-relation preserving schemes
large-eddy simulation
richardson extrapolation


Amplify-forward relaying for multiple-antenna multiple relay networks under individual power constraint at each relay This article considers the design of an optimal beamforming weight matrix of multiple-antenna multiple-relay networks. It is assumed that each relay utilizes the amplify and forward strategy, i.e., it multiplies the received signal vector by a matrix, dubbed the relay weight matrix, and forwards the resulting vector to the destination. Furthermore, we assume that the source and the destination have the same number of antennas and that each transmit antenna is virtually paired to a different destination antenna. The relay weight matrices are concurrently designed to optimize the mean square error (MSE) criterion at the destination, assuming each relay node is subject to a power constraint. Accordingly, it is demonstrated that this problem can be cast as a convex optimization problem in which the individual power constraints are tackled by employing the method of Lagrange multipliers in two stages. First, the relay gain matrix is computed analytically in terms of Lagrange dual variables, thereby converting the original problem into a scalar optimization problem. Then, these scalar variables are computed numerically. The proposed scheme is evaluated through simulation with various numbers of relays and antennas to obtain MSE and bit error rate (BER) metrics and it is shown that the resulting MSE and BER achieved through using the proposed method outperforms that of MMSE-MMSE method introduced by Oyman et.al., which is regarded as the best known method for the underlying problem.

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


The Hybrid Method for On-line Harmonic Analysis The novel hybrid method of the Discrete Fourier Transform (DFT) and the Enhanced Phase-Locked Loop (EPLL) has been presented. The original well-known methods and the Hybrid method have been analysed and tested in several simulations and experiments. The methods are implemented on the Digital Signal Processor and compared in a real time power quality application. Although it requires a bit higher computational effort, the Hybrid method compared to original methods shows advantages for on-line harmonic analysis.

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

adaptive filters
discrete fourier transforms
power electronics and power quality


Novel approach to sputtered tantalum film resistors with controlled pre-defined resistance A controlled magnetron sputtering method to obtain precision thin-film tantalum resistors with preset resistance values, is presented. These tantalum film resistors consist of layers of pure tantalum atoms and tantalum oxides. The proposed sputtering method is based on a previous mathematical modeling developed by the authors. With this modeling, one can predict the final product performance as a function of its technological deposition parameters. Feasibility tests to obtain tantalum and tantalum oxide film resistors with a controlled range of resistances, were done on a dedicated sputtering set-up. As a reactive agent in the experimental tests, only residual gases were used. Using the proposed model, precision film resistors with repeatable properties, were achieved in direct relations to the sputtering process parameters. It was found that only two major independent parameters are influencing the resistivity of the tantalum films: (a) the argon pressure in the vacuum chamber; and (b) the sputtering high voltage given to the target. A threshold level of tantalum phase transition from metal to dielectric, was found. Around this threshold level all types of pre-defined resistance may be achieved. The resistance stability of the obtained films, following an annealing Vacuum Photothermal Processing (VPP) was studied as well. It was shown that the electrical properties of the obtained resistors following a VPP treatment were improved with a better resistance stability.

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

sputtered tantalum film resistors
vacuum photothermal processing


Total colorings of planar graphs without intersecting 5-cycles ? A total k k -coloring of a graph G G is a coloring of V(G)?E(G) V ( G ) ? E ( G ) using k k colors such that no two adjacent or incident elements receive the same color. The total chromatic number of G G is the smallest integer k k such that G G has a total k k -coloring. In this paper, it is proved that if G G is a planar graph with maximum degree ??7 ? ? 7 and without intersecting 5 5 -cycles, that is, every vertex is incident with at most one cycle of length 5 5 , then the total chromatic number of G G is ?+1 ? + 1 .

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


Topology-Aware Evenly Spaced Streamline Placement This paper presents a new streamline placement algorithm that produces evenly spaced long streamlines while preserving topological features of a flow field. Singularities and separatrices are extracted to decompose the flow field into topological regions. In each region, a seeding path is selected from a set of streamlines integrated in the orthogonal flow field. The uniform sample points on this path are then used as seeds to generate streamlines in the original flow field. Additional seeds are placed where a large gap between adjacent streamlines occurs. The number of short streamlines is significantly reduced as evenly spaced long streamlines spawned along the seeding paths can fill the topological regions very well. Several metrics for evaluating streamline placement quality are discussed and applied to our method as well as some other approaches. Compared to previous work in uniform streamline placement, our method is more effective in creating evenly spaced long streamlines and preserving topological features. It has the potential to provide both intuitive perception of important flow characteristics and detail reconstruction across visually pleasing streamlines.

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

evenly spaced streamlines
flow topology
flow visualization
seeding strategy


Large margin classification for combating disguise attacks on spam filters This paper addresses the challenge of large margin classification for spam filtering in the presence of an adversary who disguises the spam mails to avoid being detected. In practice, the adversary may strategically add good words indicative of a legitimate message or remove bad words indicative of spam. We assume that the adversary could afford to modify a spam message only to a certain extent, without damaging its utility for the spammer. Under this assumption, we present a large margin approach for classification of spam messages that may be disguised. The proposed classifier is formulated as a second-order cone programming optimization. We performed a group of experiments using the TREC 2006 Spam Corpus. Results showed that the performance of the standard support vector machine (SVM) degrades rapidly when more words are injected or removed by the adversary, while the proposed approach is more stable under the disguise attack.

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

second-order cone programming (socp)
adversarial classification


Generalized

analytic

rule

extraction

for

feedforward

neural

networks

This

is

paper

suggests

the

"Input-Network-Training-Output-Extraction-Knowledge"

framework

to

classify

existing

rule

extraction

algorithms

for

feedforward

neural

networks.

Based

on

the

suggested

framework,

we

identify

the

major

practices

of

existing

algorithms

as

relying

on

the

technique

of

generate

and

test,

which

leads

to

exponential

complexity,

relying

on

specialized

network

structure

and

training

algorithms,

which

leads

to

limited

applications

and

reliance

on

the

interpretation

of

hidden

nodes,

which

leads

to

proliferation

of

classification

rules

and

their

incomprehensibility.

In

order

to

generalize

the

applicability

of

rule

extraction,

we

propose

the

rule

extraction

algorithm

Generalized

Analytic

Rule

Extraction

(GLARE),

and

demonstrate

its

efficacy

by

comparing

it

with

neural

networks

per

se

and

the

popular

rule

extraction

program

for

decision

trees,

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


Dynamic cluster formation using level set methods Density- based clustering has the advantages for 1) allowing arbitrary shape of cluster and 2) not requiring the number of clusters as input. However, when clusters touch each other, both the cluster centers and cluster boundaries ( as the peaks and valleys of the density distribution) become fuzzy and difficult to determine. We introduce the notion of cluster intensity function ( CIF) which captures the important characteristics of clusters. When clusters are well- separated, CIFs are similar to density functions. But, when clusters become closed to each other, CIFs still clearly reveal cluster centers, cluster boundaries, and degree of membership of each data point to the cluster that it belongs. Clustering through bump hunting and valley seeking based on these functions are more robust than that based on density functions obtained by kernel density estimation, which are often oscillatory or oversmoothed. These problems of kernel density estimation are resolved using Level Set Methods and related techniques. Comparisons with two existing density- based methods, valley seeking and DBSCAN, are presented which illustrate the advantages of our approach.

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

level set methods
kernel density estimation

dynamic clustering
cluster intensity functions
cluster contours
partial differential equations


Quantifying the Evolutionary Self-Structuring of Embodied Cognitive Networks We outline a possible theoretical framework for the quantitative modeling of networked embodied cognitive systems. We note that: (1) information self-structuring through sensory-motor coordination does not deterministically occur in R-n vector space, a generic multivariable space, but in SE(3), the group structure of the possible motions of a body in space; (2) it happens in a stochastic open-ended environment. These observations may simplify, at the price of a certain abstraction, the modeling and the design of self-organization processes based on the maximization of some informational measures, such as mutual information. Furthermore, by providing closed form or computationally lighter algorithms, it may significantly reduce the computational burden of their implementation. We propose a modeling framework that aims to give new tools for the design of networks of new artificial self-organizing, embodied, and intelligent agents and for the reverse engineering of natural networks. At this point, it represents largely a theoretical conjecture, and must still to be experimentally verified whether this model will be useful in practice.

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

self-organization
embodiment
stochasticity
lie groups
theoretical models


Shape-describing indices for agricultural field plots and their relationship to operational efficiency How to measure shape of agricultural field plots: eight shape describing indices proposed. The indices computed for the real field plots in southern Finland, see the variation. The classification of real field plots in southern Finland is presented and discussed. The shape indices are compared with the data of field operational efficiency. Multivariate regression model shows how to estimate operational efficiency.

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

coverage path planning
modelling
field operations


Application of a shock-fitted spectral collocation method for computing transient high-speed inviscid flows over a blunt nose Interaction of freestream disturbances with high-speed inviscid flow over a blunt nose is simulated utilizing a shock-fitted spectral collocation method. The unsteady flow computations are made through solving the 2D Euler equations by virtue of such a dissipation-free numerical algorithm for precise unsteady flow simulations. A shock-fitting technique is employed to accurately compute the unsteady shock motions and its interaction with monochromatic freestream disturbances of different conditions. A symmetry condition is proposed to accurately model the both steady and unsteady characters of the symmetry boundary, which allows the use of halved geometries and avoids the extra computational cost. The computational results for a cylinder at Mach 8.03 are presented and verified through comparisons with other numerical and promising analytical solutions. The stagnation line where the most energetic interactions take place is inspected carefully. The study shows the significant influence of the shock on its subsequent flow field in unsteady simulations and notable ability of the shock-fitted spectral collocation method implemented for the study of such problems.

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

shock/disturbance interaction
high-speed flows
spectral methods


Taking advantage of contextualized interactions while users watch TV While watching TV, viewers use the remote control to turn the TV set on and off, change channel and volume, to adjust the image and audio settings, etc. Worldwide, research institutes collect information about audience measurement, which can also be used to provide personalization and recommendation services, among others. The interactive digital TV offers viewers the opportunity to interact with interactive applications associated with the broadcast program. Interactive TV infrastructure supports the capture of the userTV interaction at fine-grained levels. In this paper we propose the capture of all the user interaction with a TV remote controlincluding short term and instant interactions: we argue that the corresponding captured information can be used to create content pervasively and automatically, and that this content can be used by a wide variety of services, such as audience measurement, personalization and recommendation services. The capture of fine grained data about instant and interval-based interactions also allows the underlying infrastructure to offer services at the same scale, such as annotation services and adaptative applications. We present the main modules of an infrastructure for TV-based services, along with a detailed example of a document used to record the userremote control interaction. Our approach is evaluated by means of a proof-of-concept prototype which uses the Brazilian Digital TV System, the Ginga-NCL middleware.

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

capture and access multimedia applications


digital video in education Digital Video is an exciting new medium with the potential to revolutionize the way organizations train their employees. However, there are questions that must be answered. How practical is video? What is the demand? What is the best use of video? In this paper, we compare the performance and quality of common digital formats, analyze 851,770 queries from an Excite database, and present the results of a study that explores the value of digital video in an educational environment.

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

education value video quality use performance queries paper practical database

digitize
training
organization
digital video
environments


making information flow explicit in histar HiStar is a new operating system designed to minimize the amount of code that must be trusted. HiStar provides strict information flow control, which allows users to specify precise data security policies without unduly limiting the structure of applications. HiStar's security features make it possible to implement a Unix-like environment with acceptable performance almost entirely in an untrusted user-level library. The system has no notion of superuser and no fully trusted code other than the kernel. HiStar's features permit several novel applications, including an entirely untrusted login process, separation of data between virtual private networks, and privacy-preserving, untrusted virus scanners.

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

precise
information flow
applications
structure
users
data security
code
performance
operating system
data
process
virus

network
policy
systems
environments
privacy preservation
secure
information-flow control
virtualization
libraries
feature
user
trust


braess's paradox for flows over time We study the properties of Braess's paradox in the context of the model of congestion games with flow over time introduced by Koch and Skutella. We compare them to the well known properties of Braess's paradox for Wardrop's model of games with static flows. We show that there are networks which do not admit Braess's paradox in Wardrop's model, but which admit it in the model with flow over time. Moreover, there is a topology that admits a much more severe Braess's ratio for this model. Further, despite its symmetry for games with static flow, we show that Braess's paradox is not symmetric for flows over time. We illustrate that there are network topologies which exhibit Braess's paradox, but for which the transpose does not. Finally, we conjecture a necessary and sufficient condition of existence of Braess's paradox in a network, and prove the condition of existence of the paradox either in the network or in its transpose.

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

braess's paradox
selfish routing
dynamic flows


Heisenberg's uncertainty principles for the 2-D nonseparable linear canonical transforms The uncertainty principles of the 1-D Fourier transform (FT), the 1-D fractional Fourier transform (FRFT), and the 1-D linear canonical transform (LCT) have already been derived. In this paper, we extend the previous works and derive the uncertainty principles for the two-dimensional nonseparable linear canonical transform (2-D NSLCT), including the complex input case, the real input case, and the case where det(B)=0 where B is a parameter subset of the 2-D NSLCT. Since the 2-D NSLCT is a generalization of many operations, with the derived uncertainty principles, the uncertain principles of many 2-D operations, such as the 2-D Fresnel transform, the 2-D FT, the 2-D FRFT, the 2-D LCT, and the 2-D gyrator transform, can also be found. Moreover, we find that the rotation, scaling, and chirp multiplication of the 2-D Gaussian function can minimize the product of the variances in the space and the transform domains.

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

fractional fourier transform
linear canonical transform


Classification-based melody transcription The melody of a musical piece-informally, the part you would hum along with-is a useful and compact summary of a full audio recording. The extraction of melodic content has practical applications ranging from content-based audio retrieval to the analysis of musical structure. Whereas previous systems generate transcriptions based on a model of the harmonic (or periodic) structure of musical pitches, we present a classification-based system for performing automatic melody transcription that makes no assumptions beyond what is learned from its training data. We evaluate the success of our algorithm by predicting the melody of the ADC 2004 Melody Competition evaluation set, and we show that a simple frame-level note classifier, temporally smoothed by post processing with a hidden Markov model, produces results comparable to state of the art model-based transcription systems.

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

melody transcription
audio
hidden markov model

music
support vector machine
imbalanced data sets
multiway classification


An Empirical Study of the "Prototype Walkthrough": A Studio-Based Activity for HCI Education For over a century, studio-based instruction has served as an effective pedagogical model in architecture and fine arts education. Because of its design orientation, human-computer interaction (HCI) education is an excellent venue for studio-based instruction. In an HCI course, we have been exploring a studio-based learning activity called the prototype walkthrough, in which a student project team simulates its evolving user interface prototype while a student audience member acts as a test user. The audience is encouraged to ask questions and provide feedback. We have observed that prototype walkthroughs create excellent conditions for learning about user interface design. In order to better understand the educational value of the activity, we performed a content analysis of a video corpus of 16 prototype walkthroughs held in two HCI courses. We found that the prototype walkthrough discussions were dominated by relevant design issues. Moreover, mirroring the justification behavior of the expert instructor, students justified over 80 percent of their design statements and critiques, with nearly one-quarter of those justifications having a theoretical or empirical basis. Our findings suggest that PWs provide valuable opportunities for students to actively learn HCI design by participating in authentic practice, and provide insight into how such opportunities can be best promoted.

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

prototype walkthrough
hci
user interface design

studio-based learning and instruction
design crit
video analysis


Differentiating between expanded and fault conditions using principal component analysis An adaptive non-parametric model (ANPM) has been developed for condition monitoring and applications within prognostics. The ANPM has the ability to monitor systems while adapting to expanded conditions. This ability is useful in uncertain systems where the range of the model could be exceeded by the system when under non-fault conditions. Differentiating between expanded and fault conditions is essential to the ANPM. A method for differentiating between expanded and a fault condition for use in an adaptive model is described. Statistical process monitoring methods using principal component analysis (PCA) have been extensively studied and heavily applied within the chemical industry. A thorough literature review is given on the past applications of such methods, highlighting the applications strengths and weaknesses. A comparison between traditional fault detection and monitoring techniques and the newly proposed expanded process differentiation technique is discussed. Adaptive modeling requirements in a dynamic environment are shown to extend beyond the traditional modeling requirements. The basic approach to PCA is described, with a detailed description of the differentiation method. The Hotelling's T (2) statistic and the squared prediction error, also known as the Q statistic, are used as indicators of the condition of the system. Dependence on the internal linear relationships of the data is discussed, and kernel principal component analysis is described as a solution to difficulties posed by nonlinear relationships. This multivariate differentiation technique is applied to a simulated data set and is shown to correctly differentiate between expanded operating conditions and faulted conditions in an adaptive environment.

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

principal component analysis
adaptive modeling


Characteristic time scales of electroencephalograms of narcoleptic patients and healthy controls Sleep electroencephalograms (EEGs) typically showed correlated fluctuations that became random-like oscillations beyond a characteristic time scale. To investigate this behavior quantitatively, the detrended fluctuation analysis (DFA) was applied to EEGs of 10 narcoleptic patients ( 22.0 4.0 yrs ; 6 males) and 8 healthy controls ( 24.0 2.0 yrs ; 5 males). The characteristic time scales of the narcoleptics and controls were estimated as 1.80.7 1.8 0.7 and 4.4 1.2 s , respectively (significance level, p<0.01 p < 0.01 ). We further performed DFA of the EEGs segmented into 30s epochs and found that the DFA scaling exponents increased in deep sleep stages. These results were verified with power spectrum and auto-correlation analysis, and reproduced by a mathematical model. We thus concluded that characteristics of EEGs of narcoleptic patients could be differentiated from those of healthy subjects, suggesting a potential application of DFA in diagnosing narcolepsy.

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

narcolepsy
detrended fluctuation analysis
characteristic time scale


Tree-Code modeling and addressing for non-ID physical objects in the Internet of Things The Internet of Things (IoT) is an emerging network paradigm, and realizes the interconnection among ubiquitous things, along with its corresponding applications and services in both Physical-world and Cyber-world. Some researches have been worked on IoT modeling and addressing, which are mainly based on objects with a unique identifier (ID). However, in practical scenarios, there are several objects without any available ID, namely non-ID (i.e., nID) physical objects, including the objects unattached any ID itself, and the objects attached unreadable or un-trusted ID. It turns out that the nID physical objects related issues become noteworthy. In this paper, we focus on the nID physical objects to present a modeling and addressing solution. Concretely, (1) nID physical objects are described along with the discussion of applying nID solution; (2) a tree-like code structure (i.e., Tree-Code) is introduced to establish a unified modeling scheme for the nID physical objects according to abstracted data elements, and also achieves the compatibility with the ID physical objects considering the ID based data elements; (3) Tree-Code based addressing scheme is presented with dynamic updating considerations. It indicates that the nID physical object modeling and addressing provide complements to the ID physical objects for ubiquitous interactions in the IoT.

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


Achieving e-Manufacturing: multihead control and web technology for the implementation of a manufacturing execution system Intelligent Manufacturing Systems requires advanced and efficient manufacturing technologies, management and procedures in order to achieve value creation in global markets. E-Manufacturing is the set of information technologies that allows companies to achieve on demand manufacturing through the integration of e-business applications. Cornerstone of this concept are Demand Flow Technology, Manufacturing Execution Systems (MES) and Digital Operational Method Sheets (OMS) which are vital to control shop floor operations where there is a need to balance manual and automated operations. Specially, Mexican companies face large diversity of products and multiple production lines, with high turnaround rotation of the workers. A low cost solution that integrates Demand Flow Technology, MES with Digital OMS is described, the system has been developed using LINUX servers, Multi-head control technology (multiple monitors to a single server) and a WEB based environment. This technological solution offers an affordable, stable, and high performance solution to transform the production into a more balanced system with shorter and faster cycles allowing a company to achieve e-Manufacturing.

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

demand flow technology
manufacturing execution systems
operational method sheets

e-manufacturing
web technologies
system integration
flow manufacturing


the impact of fault models on software robustness evaluations Following the design and in-lab testing of software, the evaluation of its resilience to actual operational perturbations in the field is a key validation need. Software-implemented fault injection (SWIFI) is a widely used approach for evaluating the robustness of software components. Recent research [24, 18] indicates that the selection of the applied fault model has considerable influence on the results of SWIFI-based evaluations, thereby raising the question how to select appropriate fault models (i.e. that provide justified robustness evidence). This paper proposes several metrics for comparatively evaluating fault models's abilities to reveal robustness vulnerabilities. It demonstrates their application in the context of OS device drivers by investigating the influence (and relative utility) of four commonly used fault models, i.e. bit flips (in function parameters and in binaries), data type dependent parameter corruptions, and parameter fuzzing. We assess the efficiency of these models at detecting robustness vulnerabilities during the SWIFI evaluation of a real embedded operating system kernel and discuss application guidelines for our metrics alongside.

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


Data summarization for network traffic monitoring Network traffic monitoring is a very difficult task, given the amount of network traffic generated even in small networks. One approach to facilitate this task is network traffic summarization. Data summarization is a key concept in data mining. However, no current measures exist in order to facilitate the evaluation of summaries. This paper presents four metrics which can be used to characterize data summarization results. Conciseness and Information Loss have already been defined, but we modified Information Loss, due to the fact that it was biased towards recurring attributes across individual summaries. We also propose two additional metrics, Interestingness and Intelligibility. Using the proposed metrics, we evaluated existing summarization techniques on well known network traffic datasets. We also proposed a summarization technique, based on an existing one but incorporating the proposed metrics as objective function. In order to further demonstrate the usability of the metrics, we performed classification on summarized datasets, showing that the metrics can be used to facilitate the selection of summaries for performing data mining. Using the summarized datasets with a reasonable conciseness, we were able to achieve similar results in terms of accuracy, but at a fraction of the running time, proportional to the conciseness of the summarized dataset.

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

network monitoring
clustering
frequent itemsets


A review of applications of genetic algorithms in lot sizing Lot sizing problems are production planning problems with the objective of determining the periods where production should take place and the quantities to be produced in order to satisfy demand while minimizing production, setup and inventory costs. Most lot sizing problems are combinatorial and hard to solve. In recent years, to deal with the complexity and find optimal or near-optimal results in reasonable computational time, a growing number of researchers have employed meta-heuristic approaches to lot sizing problems. One of the most popular meta-heuristics is genetic algorithms which have been applied to different optimization problems with good results. The focus of this paper is on the recent published literature employing genetic algorithms to solve lot sizing problems. The aim of the review is twofold. First it provides an overview of recent advances in the field in order to highlight the many ways GAs can be applied to various lot sizing models. Second, it presents ideas for future research by identifying gaps in the current literature. In reviewing the relevant literature the focus has been on the main features of the lot sizing problems and the specifications of genetic algorithms suggested in solving these problems.

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

production planning
lot sizing
genetic algorithms


Flaw detection of domed surfaces in LED packages by machine vision system Epoxy-packaging is widely used in light-emitting diode (LED) packages to protect LED chips and magnify the chip light. Surface flaws in LED packages affect not only the appearances of LEDs but also their functionality, efficiency and stability. Due to the high demand for productivity and quality, bare-eye-inspection approach becomes extremely inadequately. Therefore, this research proposes a machine-vision-based system for detecting tiny flaws occurred in the domed surfaces of LED epoxy-packing. We apply grey relational analysis to the frequency components in block discrete cosine transform domain, and significantly attenuate the large-magnitude frequency components that represent the background texture of the surface based on their corresponding grey relational grades. Then, by reconstructing the declined frequency components, we eliminate not only random texture but also uneven illumination patterns and retain anomalies in the restored image. This approach overcomes the difficulties of inspecting tiny flaws from uneven illumination backgrounds. Experimental results show that the proposed method can effectively inspect tiny flaws in LED domed surfaces.

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

led package
flaw inspection
domed surface


performance modeling and automatic ghost zone optimization for iterative stencil loops on gpus Iterative stencil loops (ISLs) are used in many applications and tiling is a well-known technique to localize their computation. When ISLs are tiled across a parallel architecture, there are usually halo regions that need to be updated and exchanged among different processing elements (PEs). In addition, synchronization is often used to signal the completion of halo exchanges. Both communication and synchronization may incur significant overhead on parallel architectures with shared memory. This is especially true in the case of graphics processors (GPUs), which do not preserve the state of the per-core L1 storage across global synchronizations. To reduce these overheads, ghost zones can be created to replicate stencil operations, reducing communication and synchronization costs at the expense of redundantly computing some values on multiple PEs. However, the selection of the optimal ghost zone size depends on the characteristics of both the architecture and the application, and it has only been studied for message-passing systems in a grid environment. To automate this process on shared memory systems, we establish a performance model using NVIDIA's Tesla architecture as a case study and propose a framework that uses the performance model to automatically select the ghost zone size that performs best and generate appropriate code. The modeling is validated by four diverse ISL applications, for which the predicted ghost zone configurations are able to achieve a speedup no less than 98\% of the optimal speedup.

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

stencil computation
gpu
parallel computing


A DOMAIN-SPECIFIC LANGUAGE TO DESIGN ENTERPRISE APPLICATION INTEGRATION SOLUTIONS Enterprise Application Integration (EAI) solutions cope with two kinds of problems within software ecosystems, namely: keeping a number of application's data in synchrony or creating new functionality on top of them. Enterprise Service Bus (ESB) provides the technology required to implement a variety of EAI solutions at sensible costs, but they are still far from negligible. It is not surprising then that many authors are working on proposals to endow them with domain-specific tools to help software engineers reduce integration costs. In this article, we introduce a proposal called Guarana. Its key features are as follows: it provides explicit support to devise EAI solutions using enterprise integration patterns by means of a graphical model; its DSL enables software engineers to have not only the view of a process, but also a view of the whole set of processes of which an EAI solution is composed; both processes and tasks can have multiple inputs and multiple outputs; and, finally, its runtime system provides a task-based execution model that is usually more efficient than the process-based execution models in current use. We have also implemented a graphical editor for our DSL and a set of scripts to transform our models into Java code ready to be compiled and executed. To set up a solution from this code, a software engineer only needs to configure a number of adapters to communicate with the applications being integrated.

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


Decomposed fuzzy proportionalintegralderivative controllers In this paper, several types of decomposed proportionalintegralderivative fuzzy logic controllers (PID FLCs) are tested and compared. An important feature of decomposed PID FLCs are their simple structures. In its simplest version, the decomposed PID FLC uses three one-input one-output inferences with three separate rule bases. Behaviours of proportional, integral and derivative PID FLC parts are defined with simple rules in proportional rule base, integral rule base and derivative rule base. The proposed decomposed PID FLC has been compared with several PID FLCs structures. All PID FLCs have been realised by the same hardware and software tools and have been applied as a real-time controller to a simple magnetic suspension system.

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

fuzzy logic control
pid control
decomposed fuzzy system


reconstruction of feature volumes and feature suppression This paper describes a systematic algorithm for reconstructing the feature volume from a set of faces in a solid model. This algorithm serves a dual purpose. Firstly, the algorithm generates the feature volume by extending or contracting the neighboring faces of the set of faces. Secondly, the algorithm may also be used to remove (or suppress) the face-set from the model. The algorithm uses a divide-and-conquer strategy and geometric cues to identify the correct topology. It robustly handles a wide class of feature volumes with complex topology and geometry. A simplified version of the algorithm has also been presented to handle volumes resulting from 2.5D features.

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

delete faces
feature volume reconstruction


An application to transient current signal based induction motor fault diagnosis of FourierBessel expansion and simplified fuzzy ARTMAP Propose a novel data driven-based framework for induction motor fault diagnosis. Combine FourierBessel expansion with GDA and SFAM. Verify the proposed framework with experimental data. Present a comparative study of diagnosis results. Demonstrate the improvement classification accuracy.

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

fault diagnosis
transient current signal
induction motor
fourierbessel expansion
simplified fuzzy artmap


Agent-based simulation framework for virtual prototyping of advanced livestock precision feeding systems On-farm implementation of the concept of precision livestock farming requires the design and development of new, advanced and often complex equipment. This article proposes an agent-based simulation framework to meet the challenges of designing, testing and evaluating the performance of the new, automated precision feeding equipment for farms. In this context, an agent is a piece of software performing defined system functions such as exchanging information or requesting services to other agents via a high-level agent communication language. The proposed approach sees each main component of the actual precision feeding system represented by a virtual domain agent. The agents are then assembled within a multi-agent system that models the automatic precision feeding equipment as a whole. The operational capacity of the virtual prototype is achieved through communication and collaboration between the multiple agents that make up the system. The capacity for dynamic modification of parameters such as workload during the simulation process helps analyze the behavior, robustness and performance of the system prior to its actual use and thus providing a computer-aid tool helping in the design process. One case study shows that agent-based composable simulation can predict the behavior and performance of the system as a whole.

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

precision livestock farming
precision feeding
virtual prototyping
composable simulation


Hierarchical Salient Point Selection for image retrieval Salient point detection in images is very useful for image processing applications like image compression, object detection and object recognition. It is also frequently used to represent local properties of the image in content-based image retrieval (CBIR). Many research results focused on finding the most salient points in the image. However, the large number of salient points and continuous point sets are still the problems. Based on the saliency values from wavelet-based methods, this paper presents a hierarchical algorithm for selecting the most salient points such that they cannot only give a satisfying representation of an image, but also make the image retrieval systems more efficiently. Under a topdown approach from quadtree data structure, the algorithm keeps the most salient points in each quadrant according to the percentage of saliency values in the whole image. The performance of the proposed method was evaluated with the spreading measure and retrieval rate from a CBIR system. In this experiment, it shows that our method is robust and the extracted salient points provide efficient retrieval performance comparing with two wavelet-based point detectors.

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


use of flash movies for teaching gui programming This paper proposes the use of Flash movies when introducing students to the use of a complex Integrated Development Environment in the context of a GUI programming course.

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

graphical user interfaces
frameworks
ide
class libraries


Neural pattern recognition and multivariate data: water typology of the Paraiba do Sul River, Brazil Modelling environmental processes is a complicated task, for the number of variables involved is usually high. This paper considers the use of neural pattern recognition to analyze structures within large data sets related to the study of ecological phenomena. The purpose is to use the information obtained with the aid of an unsupervised clustering step in a pattern recognition algorithm to obtain insight into the processes occurring along the period of observation. Once the processes are identified, more reliable models can be derived. The method proved to be helpful to highlight the major fluctuations in river water chemistry, and to identify complementary characteristics relevant to understanding the processes involved in the transport of dissolved nutrients in the Paraiba do Sul River basin outlet. (c) 2004 Elsevier Ltd. All rights reserved.

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


Construction of n-ary F-polygroups By an n-ary F-hyperoperation on a non-empty set A we mean a function from A?A A ? A to the set of all non-zero fuzzy subsets of A, where A appears n times. Using this concept we introduce the notion of n-ary F-polygroups which is a generalization of ideas presented by Zahedi, Hasankhani and Davvaz et al. Some basic results are obtained.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 set
n-ary hyperoperation
n-ary hypergroup
n-ary polygroup
f-hyperoperation
n-ary f-polygroup


Constrained multiobjective games in general topological space In this paper, we introduce and study a new class of constrained multiobjective games in general noncompact topological space. By employing an existence theorem of quasi-equilibrium problems due to this author, several existence theorems of weighted Nash equilibria and Pareto equilibria for the constrained multiobjective games are established in noncompact topological spaces. These theorems improve, unify, and generalize the corresponding results of the multiobjective games in recent literature. (C) 2000 Elsevier Science Ltd. 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 B I O O O O O O O O O O O O O O O O B I I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

weighted nash equilibria
pareto equilibria
topological space

constrained multiobjective game
quasi-equilibrium problem


Switching regression analysis by fuzzy adaptive network A nonparametric switching regression approach is proposed based on the Sugeno fuzzy inference system and a fuzzy adaptive network. The present approach possesses both the ability of handling linguistic terms and the easiness in developing learning algorithms. Two numerical examples are used to illustrate the approach and the convergence behavior is compared with the results in the literature.

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

regression analysis
switching regression
fuzzy inference system
fuzzy adaptive network


Cyclic Reduction Tridiagonal Solvers on GPUs Applied to Mixed-Precision Multigrid We have previously suggested mixed precision iterative solvers specifically tailored to the iterative solution of sparse linear equation systems as they typically arise in the finite element discretization of partial differential equations. These schemes have been evaluated for a number of hardware platforms, in particular, single-precision GPUs as accelerators to the general purpose CPU. This paper reevaluates the situation with new mixed precision solvers that run entirely on the GPU: We demonstrate that mixed precision schemes constitute a significant performance gain over native double precision. Moreover, we present a new implementation of cyclic reduction for the parallel solution of tridiagonal systems and employ this scheme as a line relaxation smoother in our GPU-based multigrid solver. With an alternating direction implicit variant of this advanced smoother, we can extend the applicability of the GPU multigrid solvers to very ill-conditioned systems arising from the discretization on anisotropic meshes, that previously had to be solved on the CPU. The resulting mixed-precision schemes are always faster than double precision alone, and outperform tuned CPU solvers consistently by almost an order of magnitude.

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

multigrid
tridiagonal solvers
cyclic reduction

gpu computing
mixed-precision iterative refinement
finite elements
nvidia cuda


Moving people tracking with detection by latent semantic analysis for visual surveillance applications The latent semantic analysis (LSA) has been widely used in the fields of computer vision and pattern recognition. Most of the existing works based on LSA focus on behavior recognition and motion classification. In the applications of visual surveillance, accurate tracking of the moving people in surveillance scenes, is regarded as one of the preliminary requirement for other tasks such as object recognition or segmentation. However, accurate tracking is extremely hard under challenging surveillance scenes where similarity among multiple objects or occlusion among multiple objects occurs. Usual temporal Markov chain based tracking algorithms suffer from the tracking error accumulation problem. The accumulated errors can finally make the tracking to drift from the target. To handle the problem of tracking drift, some authors have proposed the idea of using detection along with tracking as an effective solution. However, many of the critical issues still remain unsettled in these detection based tracking algorithms. In this paper, we propose a novel moving people tracking with detection based on (probabilistic) LSA. By employing a novel twin-pipeline training framework to find the latent semantic topics of moving people, the proposed detection can effectively detect the interest points on moving people in different indoor and outdoor environments with camera motion. Since the detected interest points on different body parts can be used to locate the position of moving people more accurately, by combining the detection with incremental subspace learning based tracking, the proposed algorithms resolves the problem of tracking drift during each target appearance update process. In addition, due to the time independent processing mechanism of detection, the proposed method is also able to handle the error accumulation problem. The detection can calibrate the tracking errors during updating of each state of the tracking algorithm. Extensive, experiments on various surveillance environments using different benchmark datasets have proved the accuracy and robustness of the proposed tracking algorithm. Further, the experimental comparison results clearly show that the proposed tracking algorithm outperforms the well known tracking algorithms such as ISL, AMS and WSL algorithms. Furthermore, the speed performance of the proposed method is also satisfactory for realistic surveillance applications.

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

tracking
latent semantic analysis
detection
visual surveillance


Automatic calibration of a rapid flood spreading model using multiobjective optimisations In order to successfully calibrate a numerical model, multiple criteria should be considered. Multi-objective differential evolution (MODE) and multi-objective particle swarm optimisation (MOPSO) have proved effective in numerous such applications, where most of the techniques relying on the condition of Pareto efficiency to compare different solutions. We describe the performance of two population based search algorithms [nondominated sorting particle swarm optimisation (NSPSO), and nondominated sorting differential evolution (NSDE)] when applied to calibration of a rapid flood spreading model (RFSM). Formulation of an automatic calibration strategy for the RFSM is outline. The simulations show that the both methods possess the ability to find the optimal Pareto front.

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

automatic calibration
rapid flood spreading model

parameter estimation
multi-objective optimisation


Analysis of Computational Time of Simple Estimation of Distribution Algorithms Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work has been done on analyzing the computation time of EDAs in relation to the problem size. It is still unclear how well EDAs (with a finite population size larger than two) will scale up when the dimension of the optimization problem (problem size) goes up. This paper studies the computational time complexity of a simple EDA, i.e., the univariate marginal distribution algorithm (UMDA), in order to gain more insight into EDAs complexity. First, we discuss how to measure the computational time complexity of EDAs. A classification of problem hardness based on our discussions is then given. Second, we prove a theorem related to problem hardness and the probability conditions of EDAs. Third, we propose a novel approach to analyzing the computational time complexity of UMDA using discrete dynamic systems and Chernoff bounds. Following this approach, we are able to derive a number of results on the first hitting time of UMDA on a well-known unimodal pseudo-boolean function, i.e., the LeadingOnes problem, and another problem derived from LeadingOnes, named BVLeadingOnes. Although both problems are unimodal, our analysis shows that LeadingOnes is easy for the UMDA, while BVLeadingOnes is hard for the UMDA. Finally, in order to address the key issue of what problem characteristics make a problem hard for UMDA, we discuss in depth the idea of "margins" (or relaxation). We prove theoretically that the UMDA with margins can solve the BVLeadingOnes problem efficiently.

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

computational time complexity
estimation of distribution algorithms
first hitting time

univariate marginal distribution algorithms


On the MHD flow of a second grade fluid in a porous channel The steady flow of a second grade fluid in a porous channel is considered. The constitutive equations are those used for a second grade fluid. The fluid is electrically conducting in the presence of a uniform magnetic field applied in the transverse direction to the flow. It is shown that an analytical solution is possible by employing a homotopy analysis method (HAM). The convergence of the obtained solution is also taken into account. Assessment for the influence of various parameters of interest on the velocity is undertaken.

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