ppxscal/embedding_network huggingface dataset:
TEXEMS: Texture Exemplars for Defect Detection on Random Textured Surfaces
Authors: Xianghua Xie, Majid Mirmehdi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We present an approach to detecting and localizing defects in random color textures which requires only a few defect free samples for unsupervised training. It is assumed that each image is generated by a superposition of various-size image patches with added variations at each pixel position. These image patches and their corresponding variances are referred to here as textural exemplars or texems. Mixture models are applied to obtain the texems using multiscale analysis to reduce the computational costs. Novelty detection on color texture surfaces is performed by examining the same-source similarity based on the data likelihood in multiscale, followed by logical processes to combine the defect candidates to localize defects. The proposed method is compared against a Gabor filter bank-based novelty detection method. Also, we compare different texem generalization schemes for defect detection in terms of accuracy and efficiency.
Curriculum development: an integrated approach
Authors: D. E. Beasley, S. B. Biggers, C. O. Huey, J. A. Liburdy
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Considerable attention is currently being paid to the development of innovative curricula that are responsive to today's demands on students, faculty, and resources, and are attentive to the needs of graduates. In engineering, these curricula are under several external constraints such as ABET standards, industrial advisory board recommendations, number of faculty, diversity of faculty effort, number of students, available resources, etc. The development of a modern curriculum requires the optimization of course offerings (and other elements of the curriculum) within the imposed constraints. A method, based on a scheme for innovation and continuous improvement, for the development of an engineering curriculum and an example case of its application (medical engineering) are described.
Strangers, enemies, terms and taxonomies
Authors: Raymond Lister
Venue: ACM SIGCSE Bulletin (2007)

It may be apocryphal, but I have been told that in some spoken languages the word for "stranger" is also the word for "enemy" -- to fail to make such a distinction must constrain one's behavior toward strangers. Likewise, our thinking on educational issues is constrained when we unaware of important distinctions. In the following paragraphs, I provide a potpourri of some my favorite terms and taxonomies that make important educational distinctions. I make no claim that these are the most useful distinctions. Instead, I merely seek to illustrate the importance of making distinctions.
On the Newton's Iterative Method for the Characteristic Equation of a Real Symmetric Matrix
Authors: Romulus Militaru
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

The present paper studies the numerical computation of the extreme eigenvalues of a n x n real symmetric matrix A by the means of the Newton's approximate method for the characteristic polynomial P_A (\lambda)An iterative algorithm is also presented,involving the computation of a trace of an appropriate matrix, instead of using the evaluation of P_A (\lambda) and its derivative. Numerical examples solved with this algorithm are to be found within as well.
Parallelization and scalability of a spectral element channel flow solver for incompressible Navier&ndash;Stokes equations: Research Articles
Authors: C. W. Hamman, R. M. Kirby, M. Berzins
Venue: Concurrency and Computation: Practice Experience (2007)

Direct numerical simulation (DNS) of turbulent flows is widely recognized to demand fine spatial meshes, small timesteps, and very long runtimes to properly resolve the flow field. To overcome these limitations, most DNS is performed on supercomputing machines. With the rapid development of terascale (and, eventually, petascale) computing on thousands of processors, it has become imperative to consider the development of DNS algorithms and parallelization methods that are capable of fully exploiting these massively parallel machines. A highly parallelizable algorithm for the simulation of turbulent channel flow that allows for efficient scaling on several thousand processors is presented. A model that accurately predicts the performance of the algorithm is developed and compared with experimental data. The results demonstrate that the proposed numerical algorithm is capable of scaling well on petascale computing machines and thus will allow for the development and analysis of high Reynolds number channel flows. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Speech synthesis using stochastic Markov graphs
Authors: M. Eichner
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Speech synthesis systems basing on concatenation of natural speech segments achieve a high quality in terms of naturalness and intelligibility. However, in many applications such systems are not easy to apply because of the huge demand for storage capacity. Speech synthesis systems based on HMMs could be an alternative to concatenative speech synthesis systems but do not yet achieve the quality needed for use in applications. In one of our research projects we investigate the possibility of combining speech synthesis and speech recognition to a unified system using the same databases and similar algorithms for synthesis and recognition. In this context we examine the suitability of stochastic Markov graphs instead of HMMs to improve the performance of such synthesis systems. The paper describes the training procedure we used to train the SMGs, explains the synthesis process and introduces an algorithm for state selection and state duration modeling. We focus particularly on issues which arise using SMGs instead of HMMs.
Identifying personal photo digital library features
Authors: Sally Jo Cunningham, Masood Masoodian
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

At present, little evidence is available about how people want to interact with their photos in a personal photo digital library. Analysis of a set of 22 user needs summaries and critiques of existing photo management systems provides insight into potentially useful features.
Using Distributed Multilevel Agent-based Monitoring Technique for Automated Network Modelling Approach
Authors: Katarzyna Nowak, Lukasz Bagrij
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

In last few years extraordinarily strong trend of rapid development of dedicated telecommunications networks, mostly specialized Information Systems, is observed. Still growing number of users as well as continuously rising needs and requirements regarding business services delivered by these systems, implies increasing complexity of solutions being build. Therefore unfortunately at the same time in these implementations a matter of "desired dependability level turns out to be extremely important. These problems bring necessity for introducing new methods and tools for managing such structures. Hence, it becomes urgent to develop innovative techniques of modelling and monitoring of networks. This paper describes the subject of using multilevel distributed agent-based architecture for monitoring purposes, thus making possible to efficiently gather data which may be useful for building comprehensive view of the whole network in automated way. Model created in this way because of its standardized form may find many applications in further stages of management process, which tends to increase system dependability, e.g. using it as one of an inputs of computer network simulator, etc.
Optimizing communication performance of web services using differential deserialization of soap messages
Authors: Michael J. Lewis
Venue:  (2007)

Web services have recently emerged as a de facto standard for building Grid and distributed computing infrastructures and applications. SOAP, a simple, interoperable, robust, and extensible protocol for the exchange of messages, is the most widely used communication protocol in the Web services model. SOAP's XML-based message format hinders its performance, thus making it unsuitable in many scientific applications. The deserialization of SOAP messages, which includes processing of XML data and conversion of strings to in-memory data types, is the major performance bottleneck in a SOAP message exchange.The contributions of this dissertation address SOAP's poor deserialization performance with the design and implementation of differential deserialization (DDS), an optimization technique that exploits similarities between incoming messages to reduce deserialization time. DDS is a fully SOAP compliant technique, and requires no changes to a SOAP client.A performance study demonstrates that DDS can result in performance improvements up to 226% for some Web services. When DDS is used with differential serialization (DS), its sender-side analog, the performance study demonstrates even more significant performance improvements.
Error Prevention, Detection and Diffusion Algorithms for Cryptographic Hardware
Authors: Maciej Nikodem
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

It is well known that hardware is susceptible to variety of different faults causing device malfunction, errors in the output or simply destroying the device. These threats refer to any type of hardware. However in case of cryptographic devices, such as smart cards or crypto-processors, errors may also leak some secret information hidden in the device (e.g. encryption keys). This was presented for almost all cryptographic protocols and algorithms allowing an adversary to perform a fault analysis. Therefore it is urgent to propose hardware implementation of cryptographic algorithms that will be immune to this type of attack. Some solutions to this problem have been already proposed for the RSA algorithm based on the Chinese Reminder Theorem and for symmetric algorithms. On the other hand there is a large number of algorithms that are susceptible to fault analysis but no solutions to increase immunity have been proposed so far.
COSMO: A conceptual framework for service modelling and refinement
Authors: Dick A. Quartel, Maarten W. Steen, Stanislav Pokraev, Marten J. Sinderen
Venue: Information Systems Frontiers (2007)

This paper presents a conceptual framework for service modelling and refinement, called the COSMO (COnceptual Service MOdelling) framework. This framework provides concepts to model and reason about services, and to support operations, such as composition and discovery, which are performed on them at design and run-time. In particular, the framework should facilitate the use of different service description languages tailored to different service aspects, such as the behaviour of a service and the information it manipulates, or design tasks, such as modelling, analysis and implementation. The idea is that models produced by these languages can be mapped onto the concepts of the framework, thereby facilitating one to relate these models, e.g., to verify consistency. Therefore, a requirement on the framework is to provide concepts that capture all elementary and generic service properties that are relevant during the service development process. We capture these properties by analysing existing service definitions and from earlier experience. Furthermore, we want the same concepts to be applicable throughout the service development process when modelling and refining services at successive abstraction levels. The framework distinguishes three generic abstraction levels, and describes an approach to assess the conformance between the service models produced at these abstraction levels.
Phase retrieval using the wavelet transform
Authors: A. E. Bell
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The 1-D phase retrieval problem is to reconstruct a signal given the modulus of its Fourier transform. Conventional solution techniques approximate the solution by discretizing this continuous problem. Our solution obviates this approximation by employing basis functions to better represent a continuous signal. In particular, we use wavelet bases because they provide a structure which permits the use of a fast algorithm and because they incorporate a priori knowledge of the signal. This paper develops our algorithm and illustrates its effectiveness with numerical examples.
Malicious Node Detection in Wireless Sensor Networks Using an Autoregression Technique
Authors: Daniel-Ioan Curiac, Ovidiu Banias, Florin Dragan, Constantin Volosencu, Octavian Dranga
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

In this paper we propose a strategy based on past/present values provided by each sensor of a network for detecting their malicious activity. Basically, we will compare at each moment the sensor's output with its estimated value computed by an autoregressive predictor. In case the difference between the two values is higher then a chosen threshold, the sensor node becomes suspicious and a decision block is activated.
Effects of secondary path modeling errors on the Modified FX-LMS algorithm for active noise control
Authors: P. A. C. Lopes
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

The Modified FX-LMS (MFX-LMS) algorithm has been the subject of some research. It effectively removes the delay from the adaptation mechanism allowing faster convergence rates than the FX-LMS. It also allows the use of more sophisticated algorithms such as the RLS or the Kalman. Although this is true for perfect secondary path modeling, there is no extensive study of the influence of secondary path modeling errors in this algorithm. This paper tries to do just that. It shows that its maximum allowed step-size is in fact almost independent of the delay in the secondary path, even in the presence of modeling errors. It also shows that for very large delays the algorithm is stable for phase errors of /spl plusmn/60/spl deg/ and for an estimated amplitude of more than half of the correct one.
Grid infrastructure monitoring system based on Nagios
Authors: Emir Imamagic, Dobrisa Dobrenic
Venue: Proceedings of the 2007 workshop on Grid monitoring (2007)

Monitoring in distributed environment such as a grid is crucial for normal operation of all subsystems. Constant gathering of information enables efficient security auditing, failure detection, maintenance, job scheduling, accounting, resource performance tuning, debugging, etc. In this paper we focus on monitoring of resources in the grid with the purpose of failure detection, notifications and automatic recovery. We introduce our system based on open source monitoring framework Nagios that achieves these functionalities. We describe grid specific features we implemented in order to achieve efficient grid monitoring system, namely sensors for various grid services, advanced sensor hierarchy and certificate-based authorization on web interface. Finally, we give overview of the implementation of our system for monitoring EGEE grid infrastructure.
Uncertainty principles, extractors, and explicit embeddings of l2 into l1
Authors: Piotr Indyk
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We give an explicit construction of a constant distortion embedding F of l2n into l1m, with m=n1+o(1).As a bonus, our embedding also has good computational properties: for any input x, Fx can be computed in n1+o(1) time.The previously known mappings required Ω(n2) evaluation time.
Krylov deferred correction methods for differential equations with algebraic constraints
Authors: Jingfang Huang
Venue:  (2006)

In this dissertation, we introduce a new class of spectral time stepping methods for efficient and accurate solutions of ordinary differential equations (ODEs), differential algebraic equations (DAEs), and partial differential equations (PDEs). The methods are based on applying spectral deferred correction techniques as preconditioners to Picard integral collocation formulations, least squares based orthogonal polynomial approximations are computed using Gaussian type quadratures, and spectral integration is used instead of numerically unstable differentiation. For ODE problems, the resulting Krylov deferred correction (KDC) methods solve the preconditioned nonlinear system using Newton-Krylov schemes such as Newton-GMRES method. For PDE systems, method of lines transpose (MoLT) couples the KDC techniques with fast elliptic equation solvers based on integral equation formulations and fast algorithms. Preliminary numerical results show that the new methods are of arbitrary order of accuracy, extremely stable, and very competitive with existing techniques, particularly when high precision is desired.
Autonomous Hyperspectral Target Detection with Quasi-Stationarity Violation at Background Boundaries
Authors: A. Schaum
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

Operational real time hyperspectral reconnaissance systems adaptively estimate multivariate background statistics. Parameter values derived from these estimates feed autonomous onboard detection systems. However, inadequate adaptation occurs whenever an airborne sensor encounters a physical boundary between spectrally distinct regions. The transition area generates excessive false alarms, because standard detection algorithms rely on quasistationary models of background statistics. Here we describe a two-mode stochastic mixture model aimed at solving the boundary problem. It exploits deployed signal processing modules to solve a generalized eigenvalue problem, making a threshold test for targets computationally feasible.
Mapping Cyberspace: The Image of the Internet
Authors: Tara Krueger
Venue: IEEE Annals of the History of Computing (2007)

Many have sought to chart the reaches of cyberspace. What happens when one makes a map of something that isn't really there at all?
Neutrality: a necessity for self-adaptation
Authors: M. Toussaint, C. Igel
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Self-adaptation is used in all main paradigms of evolutionary computation to increase efficiency. We claim that the basis of self-adaptation is the use of neutrality. In the absence of external control, neutrality allows a variation of the search distribution without the risk of fitness loss.
Pyrite: a framework for palmtop data interchange
Authors: Rob Tillotson
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

The Palm Computing platform was designed with tight desktop integration in mind. Pyrite is an Open Source toolkit which allows desktop applications to interact with Palm handhelds and their data. It is implemented in the Python programming language, and is deliberately quite different than the standard Palm Desktop software. It is designed for maximum flexibility; Python's loose, dynamic object structure is exploited to allow applications to easily extend Pyrite's capabilities. In this paper, I will explain the most significant aspects of Pyrite's design, and describe some of the issues encountered during implementation.
Locality-Aware Distributed Loop Scheduling for Chip Multiprocessors
Authors: L. Xue, M. Kandemir, G. Chen, F. Li, O. Ozturk, R. Ramanarayanan, B. Vaidyanathan
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Chip multiprocessors are becoming increasingly popular in embedded domain since they have important advantages over their single core counterparts from the parallelism, power efficiency, validation, and verification perspectives. However, extracting maximum performance from these multiprocessors requires compiler support in form of effective code parallelization. The goal of this paper is to present and experimentally evaluate a locality aware dynamic loop scheduling strategy that implements both locality aware loop iteration distribution across parallel processors and dynamic load balancing at runtime. This hybrid scheme has been implemented and tested along with four other previously-proposed loop scheduling schemes, including a locality aware one. Our experimental analysis reveals that the proposed approach generates better results than all other scheduling schemes (static or dynamic) tested. Our results also show that the improvements brought by the proposed scheduling scheme are consistent across experiments with different values of our major simulation parameters such as the number of processors and cache size per processor.
Peer-to-Peer Based Mobile Video On-Demand with Layered Video Distribution
Authors: Katsuhiko Sato, Koichi Yagishita, Michiaki Katsumoto, Tetsuya Miki
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

Peer-to-Peer Mobile Video On-Demand (P2MVOD) [20] showed one idea for the decentralized multimedia data distribution on the mobile environment. It allows a moving client to receive streaming data on demand from not only server but other moving clients in a peer-to- peer (P2P) manner, where video contents are divided into the same sized segment and aggregately sent and shared with as many receiving clients as possible. In this paper we discuss deploying P2MVOD under more real mobile environment, which has several delivery domains that have different amount of requests and several types of users that receive a video stream with different bandwidth. We employ the layered video cording and transmission schemes [24 - 27] for P2MVOD to efficiently provide its service under such environment. The segment is further divided into smaller sized unit referred to as "slice' and slicing and segmentation are carried out across the layered video streams. Mathematical analysis reveals this strategy reduces the traffic much better than simple use of P2MVOD.
Unsupervised Learning of Tree Alignment Models for Information Extraction
Authors: Philip Zigoris, Damian Eads, Yi Zhang
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table- a data structure that better lends itself to high-level data mining and information exploitation. Our algorithm effectively combines tree and string alignment algorithms, as well as domain-specific feature extraction to match semantically related data across search results. The applications of our approach are vast and include hidden web crawling, semantic tagging, and federated search. We build on earlier research on the use of tree alignment for information extraction. In contrast to previous approaches that rely on hand tuned parameters, our algorithm makes use of a variant of Support VectorMachines (SVMs) to learn a parameterized, site-independent tree alignment model. This model can then be used to deduce common structural and textual elements of a set of HTML parse trees. We report some preliminary results of our system's performance on data from websites with a variety of different layouts.