ppxscal/embedding_network huggingface dataset:
Smart catalogs and virtual catalogs
Authors: Arthur M. Keller
Venue: Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1 (1995)

We present an architecture for electronic catalogs, called Smart Catalogs and Virtual Catalogs. Smart catalogs are searchable, annotated combinations of machine-readable and machine-sensible product data. Virtual catalogs dynamically retrieve information from multiple smart catalogs and present this product data in a unified manner with its own look and feel, not that of the source smart catalogs. These virtual catalogs do not store product data from smart catalogs directly (except when caching for performance); instead virtual catalogs obtain current product data from smart catalogs to satisfy specific customer queries. Customers interact with smart catalogs and virtual catalogs through WWW or other interfaces. Product data is disseminated through the architecture using ACL (Agent Communication Language). In particular, ACL is used to communicate queries and answers among smart catalogs and virtual catalogs.
Texas A&M University anarchistic Key authorization (AKA)
Authors: David Safford, David K. Hess, Douglas Lee Schales
Venue: Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6 (1996)

At the Fourth USENIX Security Conference, we presented a paper on SRA Telnet, which was a simple Diffie-Hellman based system to defeat standard password sniffing, without requiring externally validated keys. Since that time, several projects, such as Secure Telnet (stel), have worked to extend this simple Diffie-Hellman model to add data encryption, larger keys, and resistance to man-in-the-middle attack. Other projects, such as SSL and SSH use validated RSA keys for full authentication. This project uses standard PGP keys as the basis of unified authentication, authorization, and encryption, combining both perfect forward secrecy and strong RSA authentication.
The Camino Real
Authors: David Alan Grier
Venue: Computer (2007)

Teaching a computer science course to a group of Peruvian engineers provides valuable insights into the development of computing technology in Latin America.
(m,k) firm Scheduling of Real-Time Transactions with Concurrency Control
Authors: Leila Baccouche, Sami Limam
Venue: Proceedings of the Second International Conference on Systems (2007)

This paper presents a multi-class scheduling algorithm for real-time transactions combining scheduling and concurrency control. The proposed algorithm, DBP_CC (Distance Based Priority and Concurrency Control) offers service differentiation and QoS guarantees by specifying several (m,k) firm constraints giving the degree of missed deadlines that the system can tolerate for each class. When extracting a transaction, DBP_CC takes into account resource availability so that the execution of the concurrency control algorithm doesn't change the transactions schedule. Simulation results show that DBP_CC can achieve a significant performance even in overload situations.
Evaluation of root-normalised front-end (RN LFCC) for speech recognition in wireless GSM network environments
Authors: S. Dufour
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

With the emergence of mobile telephony, the conditions of use of speech recognisers have been completely reconsidered. Speech can be input from a wide range of environments, having to face several degradation causes principally induced by noise and/or channel distortions. The root-normalised front-end is evaluated on several databases. Special attention is given to the GSM environment where noise, channel and coder effects are analysed. Experimental results indicate that this analysis model, when compared to the more conventional mel-scale cepstral representation (MFCC), is proved to be more robust to several types of perturbations. This advantage is maintained when using explicit channel and noise compensation schemes such as NSS (non-linear spectral subtraction).
Eco-visualization: combining art and technology to reduce energy consumption
Authors: Tiffany Grace Holmes
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

Can creative visualizations of real time energy consumption patterns trigger more ecologically responsible behavior? Media art that displays the real time usage of key resources such as electricity offers new strategies to conserve energy in the home and workplace. This paper details the development of a public art project created for the National Center for Supercomputing Applications that measures electricity usage in real time for the purpose of education and curtailment of power usage. A version of this piece will be on view in the exhibition, Speculative Data and the Creative Imaginary, a component of the 2007 Creativity and Cognition conference.
Theoretical bounds on the estimation and prediction of multipath time-varying channels
Authors: S. Barbarossa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Starting from a parametric model of time-varying multipath channels with additive white Gaussian noise, we derive the theoretical bound on the channel parameters estimation as a function of number of samples, SNR and model mis-matching errors. We use this bound to derive an approximate closed form expression of the channel mean square prediction error, subsequently used to evaluate the maximum training period. Finally, we illustrate a simple and effective method for estimating the channel parameters (path delays, amplitudes, phases and frequencies), using chirp signals as training sequences.
Mobility-Aware Efficient Job Scheduling in Mobile Grids
Authors: Preetam Ghosh, Nirmalya Roy, Sajal K. Das
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

In this paper, we present a node mobility prediction framework based on a generic mobile grid architecture. We show how this framework can be used to formulate a cost effective job scheduling scheme based on a predetermined pricing strategy at the wireless access point. The proposed scheme is for distributing grid computing jobs to the mobile nodes and considers the bandwidth constraints along with any internal job (e.g., call processing) arrival rate at the nodes. The simulation results point to the efficacy of our algorithm.
The BSD packet filter: a new architecture for user-level packet capture
Authors: Steven McCanne, Van Jacobson
Venue: Proceedings of the USENIX Winter 1993 Conference Proceedings on USENIX Winter 1993 Conference Proceedings (1993)

Many versions of Unix provide facilities for user-level packet capture, making possible the use of general purpose workstations for network monitoring. Because network monitors run as user-level processes, packets must be copied across the kernel/user-space protection boundary. This copying can be minimized by deploying a kernel agent called a packet filter, which discards unwanted packets as early as possible. The original Unix packet filter was designed around a stack-based filter evaluator that performs sub-optimally on current RISC CPUs. The BSD Packet Filter (BPF) uses a new, register-based filter evaluator that is up to 20 times faster than the original design. BPF alson uses a straighforward buffering strategy that makes its overall performance up to 100 times faster than Sun's NIT running on the same hardware.
Support vector classifier with hyperbolic tangent penalty function
Authors: F. Perez-Cruz
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

The support vector classifier is a new tool to solve classification problems, giving the classification boundary as a linear combination of the training samples. In non-separable problems with highly overlapped classes, the achieved classifiers are oversized. In this paper, we proposed to change the support vector classifier penalty function by an hyperbolic tangent one, obtaining as a result of the training phase a reduced support vector classifier with the same performance as the original one.
Wavelet-based deconvolution for ill-conditioned systems
Authors: R. Neelamani
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

In this paper, we propose a new approach to wavelet-based deconvolution. Roughly speaking, the algorithm comprises Fourier-domain system inversion followed by wavelet-domain noise suppression. Our approach subsumes a number of other wavelet-based deconvolution methods. In contrast to other wavelet-based approaches, however, we employ a regularized inverse filter, which allows the algorithm to operate even when the inverse system is ill-conditioned or non-invertible. Using a mean-square-error metric, we strike an optimal balance between Fourier-domain and wavelet-domain regularization. The result is a fast deconvolution algorithm ideally suited to signals and images with edges and other singularities. In simulations with real data, the algorithm outperforms the LTI Wiener filter and other wavelet-based deconvolution algorithms in terms of both visual quality and MSE performance.
Practice! YUBIMOJI AIUEO: An Edutainment System of Japanese Hand Alphabets for Elementary School Children
Authors: Miki Namatame, Fusako Kusunoki, Shigenori Inagaki, Takao Terano
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Practice! YUBIMOJI AIUEO (PYA) is an edutainment system to promote basic expressions of Kana characters (AIUEO) of Japanese hand alphabets (YUBIMOJI) to ordinary children at elementary school age. In this paper, we report how PYA is good in edutainment objectives based on the series of experiments at classrooms of Sumiyoshi Elementary School, in Kobe, Japan. The results have suggested that 1) even if the users do not like personal computers, they can use PYA and keep their interests, 2) PYA users keep the understanding about the hand alphabets longer, 3) they love the puppy hints and they are affective, and 4) they can memorize the character shapes. In one sentence: to use PYA is definitive.
The motion transform: a new motion compensation technique
Authors: R. M. Armitano
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

Motion estimation plays an important role in video coding schemes by removing temporal redundancies that exist in image sequences. Motion information that is required in motion compensated prediction is transmitted as side information, as in forward motion estimation, or can be computed at the receiver in backward motion estimation. The former method has the advantage of more accurate prediction but, suffers in that the motion information is transmitted as side information. We introduce the motion transform (MT), a new motion estimation and compensation technique that does not require the transmission of motion vectors yet, performs well under a variety of conditions. In the proposed method, motion information is obtained in a bottom-up hierarchical fashion using a two-dimensional wavelet-like decomposition. By using a nonlinear non-expansive filter bank a hierarchical decomposition of the image allows coarse-to-fine motion compensation at the decoder without motion vector transmission.
Solaris service management facility: modern system startup and administration
Authors: Jonathan Adams, David Bustos, Stephen Hahn, David Powell, Liane Praza
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

Application uptime is critical to every administrator. The factors which cause system downtime are often handled by the operating system, but causes for application faults (e.g., software bugs, hardware faults, or human errors) are not addressed by standard system software. Recovery is left to humans, who may often compound the problem due to misdiagnosis or simple error. While availability issues have traditionally been addressed by expensive high-availability clustering solutions, the increasing complexity of software stacks requires a solution for all systems. In addition to the challenges of managing availability of higher level software, the modern operating system itself is composed of many interdependent software entities. A failure in any one of these components often cascades, causing failures in other components. A complex software model with many interdependent elements makes diagnosing failures very challenging for system administrators. The traditional init.d script mechanisms for UNIX are only a weak reflection of the intricate dependency relationships which exist on every system. We introduce the Service Management Facility (SMF) as a comprehensive way to describe, execute, and manage software services. SMF promotes the service to a first-class operating system entity, without requiring modification of application binaries or changes to the UNIX process model. It relieves the administrator from duties of application failure detection and restart, and provides sophisticated diagnosis tools when automatic repair is impossible.
A path to the Arrow&#x2013;Debreu competitive market equilibrium
Authors: Yinyu Ye
Venue: Mathematical Programming: Series A and B (2007)

We present polynomial-time interior-point algorithms for solving the Fisher and Arrow&#x2013;Debreu competitive market equilibrium problems with linear utilities and n players. Both of them have the arithmetic operation complexity bound of $${O(n^{4}log(1/\epsilon}$$)) for computing an $${\epsilon}$$ -equilibrium solution. If the problem data are rational numbers and their bit-length is L, then the bound to generate an exact solution is O(n4L) which is in line with the best complexity bound for linear programming of the same dimension and size. This is a significant improvement over the previously best bound $$O(n^{8}log(1/\epsilon$$)) for approximating the two problems using other methods. The key ingredient to derive these results is to show that these problems admit convex optimization formulations, efficient barrier functions and fast rounding techniques. We also present a continuous path leading to the set of the Arrow&#x2013;Debreu equilibrium, similar to the central path developed for linear programming interior-point methods. This path is derived from the weighted logarithmic utility and barrier functions and the Brouwer fixed-point theorem. The defining equations are bilinear and possess some primal-dual structure for the application of the Newton-based path-following method.
Modeling of neurotransmitter effects in olfactory bulb
Authors: Iren Valova, Oxana Lapteva, Natacha Gueorguieva
Venue: Neural Computing and Applications (2007)

The sense of smell, called olfaction, involves the detection and perception of different odors, and allows identifying food, mates, predators, danger etc. For both humans and animals, it is one of the important means by which they communicate with the environment. This odor-detecting system is called olfactory bulb and is located in the limbic region of the brain. Its functionality is based on neurons, primarily mitral and granule cells, and communication among them. This process is very complex and involves different types of neurotransmitters. The basic function of neurotransmitters is the realization of communication processes between neurons. Additionally, they are responsible for the efficient and accurate processing of the information, as well as for the generation of cellular changes, which corresponds to the memory functionality. In our work, we simulate the main types of chemicals of the olfactory bulb using spiking neuron model: gamma-aminobutyric acid (GABA), N-methyl-d-aspartate (NMDA) and alpha-amino-3-hydroxi-5-methylisoxasole-propionionate (AMPA). In this relatively unexplored area of research (from computing prospective), we design an architecture and experimentally analyze simulation results referring to available biological research and established biophysiological data. We provide the description of different neurotransmitters and their dynamics. The main focus of our work is to analyze the neurotransmitter effects based on the computational simulations corresponding to the biological environment in the olfactory bulb. The results of our work agree with the biological description of the simulated neurotransmitters as well as with experimental results in the biophysiological area.
Minitrack: Collaboration support for Joint Modeling and Simulation
Authors: Jaco H. Appelman, Vlatka Hlupic, Alan Serrano
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This minitrack aims to share knowledge on the support of and actual development of complex modeling activities. The domain is the design of information systems or other organizationally related systems that allow organizations to function and collaborate more effectively. The track looks at processes that support collaboration activities and the tools and techniques employed. Modeling, including simulation, is specifically included and approached from two angles. Firstly, how does (joint) modeling as an activity support design? Secondly, how can we support modelers and their modeling activities so that they can be integrated in complex collaboration processes? Here tools or technology as such can figure prominently.
Faculty collaboration and course coordination in geographically dispersed campuses
Authors: D. Sathianathan
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

With a growing emphasis on vertical and horizontal integration of engineering curricula, there is a growing need for strong coordination among engineering courses. This paper outlines a coordination and collaboration model that has been developed as part of the NSF funded ECSEL initiative. This effort is currently implemented at the Pennsylvania State University, USA. The model has been implemented on a first-year design course taught at 19 campuses in the Penn State system. The model involves developing a competency-based course structure, identifying coordination team, identifying coordination mechanisms using appropriate technology, faculty development and incentives to sustain long-term coordination. At the core of the coordination and collaboration efforts are student driven activities, and it is these activities that will sustain this effort in the long-term. A large part of the student activities involves archival of student design work as electronic portfolios. These portfolios are shared with the feeder campuses which is a significant part of student-student, faculty-student and industry-student collaboration. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
On formalisation of the goal concept in law
Authors: Vytautas yras
Venue: Engineering Applications of Artificial Intelligence (2007)

The paper raises a problem of formalising several key concepts in legal theory, namely, goal, function and value. The law is viewed from a perspective of computer science in law. I intend to apply requirements engineering methods in law. The Berman and Hafner's [1993. Representing teleological structure in case based legal reasoning: the missing link. In: Proceedings of the Fourth International Conference on AI and Law. ACM Press, New York, pp. 50-59] challenge to model case-based reasoning in legal domain and the more systematic research, which is collected in Artificial Intelligence and Law journal in 2002, are considered as possible approaches to solutions. The term ''goal'' covers purposes, policies, interests, values, etc. I find a formalisation to have different levels depending on a distinct meaning of the term ''law''. E.g., legal drafting is closer to engineering than to legal reasoning. European Union law and implementation of EU directives provide us with court decisions based on the teleological method. National implementation measures could employ goal-driven systems engineering techniques. Conclusions: (1) the formalisation is a challenging problem, (2) experts from other domains will gain from explicit representation of aims behind the law, (3) analysis of the structure of law is not enough; the studies of the content of law are required, too.
A Fast Lossless Codec of Continuous-Tone Images for Thin Client Computing
Authors: Chun Yang, Yan Niu, Yubin Xia, Xu Cheng
Venue: Proceedings of the 2007 Data Compression Conference (2007)

We propose a fast and efficient lossless codec of continuous-tone images, SPEDIC (Simple Predictor and Edge Detector based Image Codec), which is uniquely suitable for coding screen updates generated by multimedia applications in thin client computing systems. A codec for thin client computing should take account of the tradeoff between compression ratio and coding complexity, because screen update images in thin client computing should be sent from server to client in a timely fashion. We argue that by combining similar but simpler building blocks of the state-of-the-art methods, a little inferior compression ratio of JPEG-LS (the standard for lossless image compression today) can be attained with much lower coding complexity.
An efficient VLC decompression scheme for user-defined coding tables
Authors: Bai-Jue Shie
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

With the increase of information and data types, a high-throughput and flexible memory-based (variable length code) VLC decoder is required for user-defined coding tables to achieve a higher compression ratio. We present a memory-based VLC decoder which is quite suitable for the applications with user-defined tables. By parallel loading data into memories, the coding tables can be changed with much less time. The codeword-boundary prediction algorithm breaks the recursive dependency of the decoding procedures. As a result, the VLC decoder can be realized on a multiprocessor architecture and hence the decoding throughput is enhanced significantly. Additionally, the index-offset symbols that can recover all data with a pure VLC codeword and a smaller table size are presented. Simulation results show that the combination of the proposed VLC decoder and user-defined table can achieve a high decompression rate. As a result, it is quite suitable for high data rate applications with user-defined coding tables, such as MPEG-4.