ppxscal/embedding_network huggingface dataset:
Satellite image processing and air pollution detection
Authors: A. Prochazka
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Environmental sensing is closely related to digital processing of observed signals and images. The paper is devoted to the analysis of mathematical methods allowing for detection of concentration of aerosol particles observed at ground measuring stations and by satellites. The first part of the contribution presents basic methods of two-dimensional interpolation allowing for the estimation of the observed variables over the whole region of interest. The whole paper is focused on satellite images and their processing. Owing to simultaneous observations at different frequencies, it is possible to detect image differences and to compare them to surface measurements. The paper is devoted to the design and verification of algorithms of image denoising including wavelet use and their correlation. General methods studied in the paper allow further image segmentation, feature extraction, classification, detection of the most important sources of pollution, prediction and control of pollution sources.
Wideband speech and audio coding using gammatone filter banks
Authors: E. Ambikairajah
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Considerable research attention has been directed towards speech and audio coding algorithms capable of producing high quality coded speech and audio, however few of these use signal representations which account for temporal as well as spectral detail. This paper presents a new technique for 16 kHz wideband speech and audio coding, whereby analysis and synthesis are performed using a linear phase gammatone filter bank. The outputs of these critical band filters are processed to obtain a series of pulse trains that represent neural firing. Auditory masking is then applied to reduce the number of pulses, producing a more compact time-frequency parameterization. The critical band gains and pulse amplitudes and positions are then coded using a combination of non-uniform quantization, arithmetic coding and vector quantization. This coding paradigm produces high quality coded speech and audio, is based upon well-known models of the auditory system, is highly scalable, and has moderate complexity.
Using Web-based technologies to support learning needs in a high-growth, knowledge-based industry
Authors: V. P. Kochikar
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

A landmark development of the late 20/sup th/ century has been the increasing realization on the part of knowledge based industries (and in particular the IT software services industry) of the need to nurture their intellectual assets. Given the demanding nature of work, global delivery models, high volumes, compressed cycle times, virtual teamwork, quick response times, and diversity of technological areas, the industry has been pushed relentlessly to reinvent its attitudes to, and modes of learning. The paper details the efforts of Infosys (INFY), in the use of Web technology to augment traditional modes as a solution to the highly demanding learning needs of its 4500 software professionals. We trace the historical evolution, the initial resistance of the experimentation phase and how it was overcome, and chronicle how the use of learning technologies has succeeded in meeting some of the learning imperatives mentioned above. We also briefly touch upon the integration of learning into the knowledge management paradigm, and sketch the role of Infosys's proprietary KMM (Knowledge Management Maturity) model in raising the maturity of its learning process.
Wireless MPEG-4 video on Texas Instruments DSP chips
Authors: M. Budagavi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Technology has advanced in recent years to the point where multimedia communicators are beginning to emerge. These communicators are low-power, portable devices that can transmit and receive multimedia data through the wireless network. Due to the high computational complexity involved and the low-power constraint in wireless applications, these devices require the use of processors that are powerful and are at the same time very power-efficient. In order to facilitate interoperability, it is important that these devices use standardized compression and communication algorithms. As a first step in implementing multimedia terminals, Texas Instruments (TI) has demonstrated real-time MPEG-4 video decoding (simple profile) on TMS320C54x, TI's low power, high performance DSP chip. In addition, TI has outlined a system-level solution to transmitting video across wireless networks, including channel coding and communication protocols.
Analyzing the performance of optical multistage interconnection networks with limited crosstalk
Authors: Ajay K. Katangur, Somasheker Akkaladevi, Yi Pan
Venue: Cluster Computing (2007)

Analytical modeling techniques can be used to study the performance of optical multistage interconnection network (OMIN) effectively. MINs have assumed importance in recent times, because of their cost-effectiveness. An N×N MIN consists of a mapping from N processors to N memories, with log¿¿2 N stages of 2×2 switches with N/2 switches per stage. The interest is on the study of the performance of unbuffered optical multistage interconnection network using the banyan network. The uniform reference model approach is assumed for the purpose of analysis. In this paper the analytical modeling approach is applied to an N×N OMIN with limited crosstalk (conflicts between messages) up to (log¿¿2 N¿1). Messages with switch conflicts satisfying the constraint of (log¿¿2 N¿1) are allowed to pass in the same group, but in case of a link conflict, the message is routed in a different group. The analysis is performed by calculating the bandwidth and throughput of the network operating under a load l and allowing random traffic and using a greedy routing strategy. A number of equations are derived using the theory of probability and the performance curves are plotted. The results obtained show that the performance of the network improves by allowing limited crosstalk in the network.
Laplacian Operator-Based Edge Detectors
Authors: Xin Wang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Laplacian operator is a second derivative operator often used in edge detection. Compared with the first derivative-based edge detectors such as Sobel operator, the Laplacian operator may yield better results in edge localization. Unfortunately, the Laplacian operator is very sensitive to noise. In this paper, based on the Laplacian operator, a model is introduced for making some edge detectors. Also, the optimal threshold is introduced for obtaining a Maximum a Posteriori (MAP) estimate of edges.
Constraint Verification for Concurrent System Management Workflows Sharing Resources
Authors: Shinji Kikuchi, Satoshi Tsuchiya, Motomitsu Adachi, Tsuneo Katsuyama
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Workflow is an effective way to define and specify the behavior of autonomic systems which manage themselves. However, when a system is working following several workflows sharing resources, it is very difficult to analyze the behavior of the systems with mutual influences between workflows due to the shared resources, and to decide whether problems may be caused by such mutual influences, despite the need to do so in order to develop trustworthy autonomic systems. To solve this problem, we developed a verification framework to identify whether constraint violations could occur in a system working and following workflows sharing resources. In this paper, we initially define the system management workflows. Next, we show the procedure to translate these workflows into hybrid automata, with the mutual influences between workflows taken into consideration. Finally, we show how to detect possible constraint violations by adopting a model checking technique to the hybrid automata through a case study.
Parametric sensitivity analysis applied to a specific one-dimensional internal bone remodelling problem
Authors: S. Ramtani
Venue: Computers in Biology and Medicine (2007)

The relative importance of the various parameters in inducing bone mass loss and osteoclastic perforations is still controversial. Therefore, there is a significant motivation to better understand the parameters behind such dynamic response, and great interest to carry out a parametric sensitivity study as it can provide useful information. As an application, the widely-accepted bone remodelling equation [M.G. Mullender, R. Huiskes, H. Weinans, A physiological approach to the simulation of bone remodeling as self organizational control process, J. Biomech. 27 (1994) 1389.] is investigated using the ''n units'' model [M. Zidi, S. Ramtani, Bone remodeling theory applied to the study of n unit-elements model, J Biomech. 32 (1999) 743.]. This analysis pointed out that the power in the modulus density relationship p and the power to which density is raised in normalizing the energy stimulus q, known as strongly implicated in the stability condition of the remodelling process, were also stated as insensitive parameters in the bone loss area.
The Development of a Utility of Assessing the Performance Impact of Shared/Distributed File Systems and Database Interactions in High-Performance Simulations
Authors: Andrew Watkins, Richard Schumeyer
Venue: Proceedings of the HPCMP Users Group Conference (2006)

We present the development of a tool for analyzing the interactions between parallel/distributed file systems and databases in a Linux cluster environment. We begin with an overview of existing file system and database technology. We then discuss the actual design of the tool. A sample set of results on a small Linux cluster using NFS and Postgres are presented and analyzed by way of a demonstration and discussion of how this utility may be used for performance assessment.
Enhancements to the fast filesystem to support multi-terabyte storage systems
Authors: Marshall Kirk McKusick
Venue: Proceedings of the BSD Conference 2003 on BSD Conference (2003)

This paper describes a new version of the fast filesystem, UFS2, designed to run on multi-terabyte storage systems. It gives the motivation behind coming up with a new on-disk format rather than trying to continue enhancing the existing fast-filesystem format. It describes the new features and capabilities in UFS2 including extended attributes, new and higher resolution time stamps, dynamically allocated inodes, and an expanded boot block area. It also describes the features and capabilities that were considered but rejected giving the reasons for their rejection. Next it covers changes that were made to the soft update code to support the new capabilities and to enable it to work more smoothly with existing filesystems. The paper covers enhancements made to support live dumps and changes made to filesystem snapshots needed to avoid deadlocks and to enable them to work efficiently with multi-terabyte filesystems. Similarly, it describes changes that needed to be made to the filesystem check program to work with large filesystems. The paper gives some comments about performance, and decribes areas for future work including an extent-based allocation mechanism and indexed directory structures. The paper concludes with current status and availability of UFS2.
Experimental Evaluation of Load Balancing Strategies for Ray Tracing on Parallel Processors
Authors: Tong-Yee Lee, C. S. Raghavendra, John B. Nicholas
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Ray tracing is one of the computer graphics techniques used to render high quality images. Unfortunately, ray tracing complex scenes can require large amounts of CPU time, making the technique impractical for everyday use. Parallel ray tracing algorithms could potentially be used to reduce the high computational cost. However, pixel computation times can vary significantly, and naive attempts at parallelization give poor speedups due to load imbalance between the processors. In this paper, we evaluate the performance of three load balancing schemes for ray tracing on parallel processors, and propose two new load balancing strategies. To evaluate the performance, we implement all these strategies on the 512 processor Intel Touchstone Delta at Caltech.
Professional accreditation toward outcome-driven curricula
Authors: A. Nafalski
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

In Australia, all professional engineering programs are subject to accreditation by the Institution of Engineers, Australia (IEAust). After a major review of engineering education by IEAust in 1996, new program assessment processes and guidelines were introduced. The revised guidelines had strong emphasis on the demonstration of outcome-driven curricula to inculcate generic attributes in graduates. This followed similar developments in the professional practice of several Washington Accord signatories. Examples of outcomes striven for by the "Ten IEAust Commandments", like its counterparts elsewhere are attributes varying from the ability to apply knowledge and to display in-depth confidence, to understanding of the social, cultural, global and environmental responsibilities of the professional engineer. The stated purposes of accreditation include a critical certification to governments, licensing bodies and the public of the competence of graduate engineers. IEAust accreditation constitutes an independent evaluation of the programs and the standing of the schools offering them in a national and international context. This paper discusses the philosophical and practical aspects of the accreditation process based on the authors' experiences with the most recent accreditation of the professional engineering programs in the School of Electrical and Information Engineering in July 2000.
TMBT: An Efficient Index Allocation Method for Multi-Channel Data Broadcast
Authors: Shuoi Wang, Hsing-Lung Chen
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Broadcast is an attractive data dissemination means over multiple wireless channels due to its scalability. Since mobile clients have limited battery power and broadcast data have different popularities, how these data are fast accessed becomes an important issue. Our solution consists of first allocating data among channels near-optimally, and adopting flat broadcast per channel. Then, a binary tree indexing structure is built for each channel and nodes of all index trees are multiplexed onto a well-known physical channel, named as TMBT (time-multiplexed multiple binary trees) Our method organizes data and index into a popularity hierarchy which results in a skewed transmission of data and index. Skewed transmission has been shown to reduce the average access time effectively. Simulation results show that the reduction of access time is on average about 48% over previous work with little tuning time overhead.
Performance and population state metrics for rule-based learning systems
Authors: T. Kovacs
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

We distinguish two types of metric for the evaluation of rule-based learning systems: performance metrics are derived from the feedback to the learning agent from its teacher or environment, while population state metrics are derived from inspection of the rule base used for decision making. We propose novel population state metrics for use with learning classifier systems, evaluate them using the XCS system, and demonstrate their superiority in some cases.
The /spl alpha/-EM algorithm and its applications
Authors: Y. Matsuyama
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The /spl alpha/-EM algorithm is a super-class of the traditional expectation-maximization (EM) algorithm. This algorithm is derived by computing the likelihood ratio of incomplete data through an extended logarithm; namely, the /spl alpha/-logarithm. The case of /spl alpha/=-1 corresponds to the logarithm. The number /spl alpha/ adjusts eigenvalues of update matrices by reflecting the optimization function's second-order properties with respect to the estimation parameter. This property shows merits on speedup of convergence. In the paper, a derivation of the algorithm is given first. Then, convergence and speedup properties are discussed. Finally, the applicability of the /spl alpha/-FM algorithm and examples are shown.
Combating Double-Spending Using Cooperative P2P Systems
Authors: Ivan Osipkov, Eugene Y. Vasserman, Nicholas Hopper, Yongdae Kim
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

An electronic cash system allows users to withdraw coins, represented as bit strings, from a bank or broker, and spend those coins anonymously at participating mer- chants, so that the broker cannot link spent coins to the user who withdraws them. A variety of schemes with var- ious security properties have been proposed for this pur- pose, but because strings of bits are inherently copyable, they must all deal with the problem of double-spending. In this paper, we present an electronic cash scheme that in- troduces a new peer-to-peer system architecture to prevent double-spending without requiring an on-line trusted party or tamper-resistant software or hardware. The scheme is easy to implement, computationally efficient, and prov- ably secure. To demonstrate this, we report on a proof-of- concept implementation for Internet vendors along with a detailed complexity analysis and selected security proofs.
Spatio-temporal constraints for matching view-based descriptions of 3D objects
Authors: E. Delponte, N. Noceti, F. Odone, A. Verri
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

We propose a 3D object recognition method based on first extracting a compact description of image sequences, and then matching these descriptions with a two-steps strategy. The compactness of the description, made of a set of time-invariant local features, allows us to use a simple nearest neighbour matching to obtain an initial set of recognition hypothesis; spatio-temporal constraints help us to con- firm or to reject these hypotheses. We carried out an extensive experimental analysis to assess our method against changes in illumination, abrupt scale changes, occlusions, clutter, view-point variations. Since our approach is based on the use of image sequences we also tested it with different camera motions. Our description strategy may be also applied to relatively simple poor-textured objects, since few stable features are enough for recognition.
Eigenfunctions of the canonical transform and the self-imaging problems in optical system
Authors: Soo-Chang Pei
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The affine Fourier transform (AFT) also called as the canonical transform. It generalizes the fractional Fourier transform (FRFT), Fresnel transform, scaling operation, etc., and is a very useful tool for signal processing. We derive the eigenfunctions of the AFT. The eigenfunctions seems hard to be derived, but since the AFT can be represented by the time-frequency matrix (TF matrix), we can use the matrix operations to derive its eigenfunctions. Then, because many optical systems can be represented as a special case of the AFT, the eigenfunctions of the AFT are just the light distributions that will cause the self-imaging phenomena for some optical systems. We use the eigenfunctions we derive to discuss the self-imaging phenomena.
Web content personalization and task complexity in e-commerce decision making
Authors: Keng Siau, Fiona Nah
Venue:  (2006)

Personalization is an increasingly important ingredient of Web applications. Personalization techniques and mechanisms can be used to tailor information services to personal needs of users. Increasing user performance is the goal of personalization. It is motivated by the recognition that a user has needs, and meeting these needs successfully is likely to lead to a satisfying relationship and re-use of the Web services offered. In e-commerce, Web personalization aims to identify and understand customers online, predict their buying patterns, identify what they want or need, and deliver appropriate products/services in personalized formats directly to them. Thus, personalization can create an important source of competitive advantage by providing relevant information to simplify customers' decision processes. Beyond the common goal, however, there is a large degree of variety and diversity in how personalization can be achieved. In this research, we carried out an experimental study to examine how task complexity and levels of Web content personalization influence user's decision quality, decision satisfaction, and decision switching.
The RTX real-time subsystem for windows NT
Authors: Bill Carpenter, Mark Roman, Nick Vasilatos, Myron Zimmerman
Venue: Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997 (1997)

This paper describes a subsystem for the Windows NT 4.0 Operating System which implements a kernel-mode execution environment for Win32 compatible tasks and threads that have hard real-time performance characteristics (deterministic interrupt response and dispatch latencies). This subsystem is a proper OS extension which requires no modifications to the standard OS kernel and limited modifications to the NT Hardware Abstraction Layer (HAL). This gives the motivation for the approach, describes the design and evaluates the success of the implementation in the context of other strategies for extending general purpose OS kernels.