ppxscal/embedding_network huggingface dataset:
Closing keynote speech: reconfigured self as basis for humanistic intelligence
Authors: Steve Mann
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

John S. Quarterman asks the questions: "Will the U.S. continue to contain more than half of the Internet? Will one company make all the software?" [1]. One could also ask related questions like "Will one university or educational organization fabricate the future by manufacturing consensus of ideas and ideals?". That the U.S. government, together with a single company, might control the world's information flow and software, and thus indirectly, the world's thoughts, ideas, etc., is a troubling thought to many. One possible solution to this problem is in the tradition of science, and thus the notion of disclosure and open peer review, as a basis for allowing anyone the option of acquiring, and thus advancing the world's knowledge base. A further construct called "Humanistic Intelligence (HI)", motivated by the philosophy of science, is proposed. HI provides a new synergy between humans and machines that seeks to involve the human rather than having computers emulate human thought or replace humans. Particular goals of HI are human involvement at the individual level, and providing individuals with tools to challenge society's pre-conceived notions of human-computer relationships. An emphasis in this article is on computational frameworks surrounding "visual intelligence" devices, such as video cameras interfaced to computer systems.
A sinusoidal signal analysis technique for fast, accurate, and discriminating frequency determination
Authors: M. Y. Hong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

A sinusoidal signal analysis technique is extended to frequency determination. It improves upon previously reported maximum-likelihood methods by reducing computational order per iteration from N to 1, where N is the number of data points. Subject to a noise floor, there is no limit to achievable accuracy or discrimination. The proposed extension accommodates any window whose continuous-time Fourier transform is known. It is illustrated here with the Kaiser-Bessel window, a near-optimum window with full design parameterization. To achieve reduced computational order, an approach is proposed for the fast computation of discrete-time Fourier transforms when corresponding continuous-time Fourier transforms are known. Its computational order is generally superior to that of an FFT. Furthermore, it enables a closed form solution to the discrete-time Fourier transform of a Kaiser-Bessel window in computational order 1. The exceptional performance is demonstrated through A/D converter performance analysis. 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
Keyword Generation for Search Engine Advertising
Authors: Amruta Joshi, Rajeev Motwani
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Keyword3 generation for search engine advertising is an important problem for sponsored search or paidplacement advertising. A recent strategy in this area is bidding on nonobvious yet relevant words, which are economically more viable. Targeting many such nonobvious words lowers the advertising cost, while delivering the same click volume as expensive words. Generating the right nonobvious yet relevant keywords is a challenging task. The challenge lies in not only finding relevant words, but also in finding many such words. In this paper, we present TermsNet, a novel approach to this problem. This approach leverages search engines to determine relevance between terms and captures their semantic relationships as a directed graph. By observing the neighbors of a term in such a graph, we generate the common as well as the nonobvious keywords related to a term.
Letters: Stability analysis of a discrete Hopfield neural network with delay
Authors: Eric C. C. Tsang, S. S. Qiu, Daniel S. Yeung
Venue: Neurocomputing (2007)

This letter investigates convergence theorems of a DHNN with delay. We present one generalized updating rule for serial mode. The condition for convergence of a DHNN without delay can be relaxed from a symmetric matrix to a quasi-symmetric matrix. One application is presented to demonstrate the higher convergence speed of our algorithm.
TAM Design and Optimization for Transparency-Based SoC Test
Authors: Tomokazu Yoneda, Akiko Shuto, Hideyuki Ichihara, Tomoo Inoue, Hideo Fujiwara
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

We present a graph model and an ILP model for optimal TAM design for transparency-based SoC testing. The proposed method is an extension of [12] so that not only the system-level cost but also the core-level cost can be simultaneously taken into consideration during the optimization process. We also relax the constraints by considering test data flows and extend it to be able to handle the case where cores cannot be made transparent due to IP protection. The proposed ILP model can represent various problems including the same problem as [12] and produce better results. Experimental results show the effectiveness and flexibility of the proposed method compared to [12].
Towards Robust Layered Learning
Authors: Willi Richert, Bernd Kleinjohann
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

In his landmark work introducing layered learning Stone presented a new way of handling complex application domains suitable especially for mobile robots. We extend his framework by introducing robust layered learning -- a framework that is able to handle system and environmental changes at every layer. We present first results of a lower level implementation of such a framework for mobile robots and discuss how all available sources of information regarding unforeseen changes can be integrated in such a framework in order to reach maximal robustness.
New hardware-efficient algorithm and architecture for the computation of 2-D DCT on a linear systolic array
Authors: Shen-Fu Hsiao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

A new recursive algorithm for fast computation of two-dimensional discrete cosine transforms (2-D DCT) is derived by converting the 2-D data matrices into 1-D vectors and then using different partition methods for the time and frequency indices. The algorithm first computes the 2-D complex DCT (2-D CCT) and then produces two 2-D DCT outputs simultaneously through a post-addition step. The decomposed form of the 2-D recursive algorithm looks very like a radix-4 FFT algorithm and is in particular suitable for VLSI implementation since the common entries in each row of the butterfly-like matrix are factored out in order to reduce the number of multipliers. A new linear systolic architecture is presented which leads to a hardware-efficient architectural design requiring only logN multipliers plus 3logN adders/subtractors for the computation of two N/spl times/N DCTs.
An Approach for Adaptive Intrusion Prevention Based on The Danger
Authors: Alexander Krizhanovsky, Alexander Marasanov
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Current approaches to intrusion detection are generally based on the observation of only one source of information such as network traffic, system calls, resource usage etc. However, we would get a more precise conclusion about the incident of intrusion if we used the entire available information. We are going to present an approach to an Intrusion Prevention System (IPS) which is inspired by the Danger Theory of immunology and tries to solve this problem by analyzing more sources of information. In this paper we will show how to link the entities which participate in the interactions described by this theory with components of the operating system for synthesizing of IPS. We'll also introduce a technique inspired by the clonal selection mechanism of the human immune system which links the anomaly behavior of system processes with received network traffic and can generate new signatures of network intrusions on the fly.
An Integrated Framework and a Dynamic Model of Customer Relationship System
Authors: Li Yuhui, Li Bo, Duan Wancun
Venue: Proceedings of the Second International Conference on Systems (2007)

Today's business managers is facing increased pressures to develop and retain economically valuable customers. They are attempting to find out what rules the development of customer relationship (CR) follows when their carrying out customer relationship management (CRM). Regarding CR as a system engineering, this paper develops a conceptual integrated framework of customer relationship system (CRS), the framework including five aspects of Market, Process, Behavior, Evaluation and Data, and describes each of the five aspects as a model. Based on the framework, this paper also proposes a dynamic model of CRS theoretically, and describes in detail these aspects of Market, Process and Evaluation. The dynamic model indicates the development of CR depends on current customer state, evaluation of value from customer and enterprise, as well as value-equipoise condition between customer and enterprise. The dynamic model of CRS expreses the basic dynamic characteristic of CR. Keyword:Customer relationship(CR), Customer relationship system(CRS), Customer relationship management (CRM), Customer relationship life cycle (CRLC), Dynamic model, Value-equipoise.
Selective error protection of ITU-T G.729 codec for digital cellular channels
Authors: K. Swaminathan, M. Austin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The recently adopted ITU-T G.729 8 kbps codec standard's performance is evaluated for digital cellular channels that are characterized by Rayleigh fading. Two forward error correction schemes (FEC) are studied. They are the convolutional code based FEC and the Nordstrom Robinson based FEC. The effects of interleaving depth are investigated for both FEC schemes. Both flat fading as well as co-channel interference limited models are used in our study.
New Malicious Agents and SK Virii
Authors: Constantinos Patsakis, Nikolaos Alexandris
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

In this paper possible trends in virus creation are described that might appear in the close future. Specialy, we show that a computer virus can be updated, just like Scipt-Kiddies do. The aim of this paper is mainly to state the problem of the evolution of computer virii, and the need to take precautional measures, if possible.
Alternation-free modal mu-calculus for data trees
Authors: Marcin Jurdzinski, Ranko Lazic
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

An alternation-free modal ì-calculus over data trees is introduced and studied. A data tree is an unranked ordered tree whose every node is labelled by a letter from a finite alphabet and an element ("datum") from an infinite set. For expressing data-sensitive properties, the calculus is equipped with freeze quantification. A freeze quantifier stores in a register the datum labelling the current tree node, which can then be accessed for equality comparisons deeper in the formula. The main results in the paper are that, for the fragment with forward modal operators and one register, satisfiability over finite data trees is decidable but not primitive recursive, and that for the subfragment consisting of safety formulae, satisfiability over countable data trees is decidable but not elementary. The proofs use alternating tree automata which have registers, and establish correspondences with nondeterministic tree automata which have faulty counters. Allowing backward modal operators or two registers causes undecidability. As consequences, decidability is obtained for two data-sensitive fragments of the XPath query language. The paper shows that, for reasoning about data trees, the forward fragment of the calculus with one register is a powerful alternative to a recently proposed first-order logic with two variables.
Adaptive temporal processing for equatorial spread Doppler clutter suppression
Authors: K. Harmanci
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The detection performance of skywave HF over-the-horizon radars is fundamentally limited by ionospheric motion which causes spreading of surface clutter returns in Doppler space. This work presents an adaptive temporal processing approach for suppressing range-azimuth coincident spread Doppler clutter (SDC). Our method exploits the spatial correlation of the ionospheric aberration, which causes clutter covariance matrix components averaged over directions aligned with the Earth's magnetic field to be a low rank. For radars looking north-south, this property in turn facilitates suppression of SDC in the target range bin by estimating the clutter covariance matrix from neighboring range bins. Because the sample support for covariance estimation along field-aligned directions is limited, an optimal constrained ML estimate of the covariance matrix was used for effective clutter suppression. Initial processing on experimental spread Doppler clutter data with injection of a simulated target illustrates that this approach can provide a target-to-clutter ratio improvement greater than 15 dB.
A tomographic framework for LIDAR imaging
Authors: P. J. Shargo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Detection and localization of underwater mines remains a challenging and important problem for safe operation of naval platforms. A number of new technologies exploit airborne LIDARs, which can penetrate the air-water interface and optically detect and localize underwater mines. Such systems process the received optical field generated by scattering within the water column, and have proven to be an effective technology for mine detection and localization. We consider the use of multiple looks at a single target to form a three-dimensional representation of the scatterers within the water column. To form such images, we account for the integration within the receive sensors, and formulate the problem in a tomographic framework. We present preliminary image formation results generated from data collected at sea with a state-of-the-art navy mine imaging system.
Nonlinear editing by Generative Video
Authors: R. S. Jasinschi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Nonlinear video editors manipulate video sequences by contents irrespective of frame order. These are computer based tools that contrast with analogue linear tape editing technologies. The latter are extremely taxing of videographers time and resources. Current computerized editing methods represent video in terms of individual images. This poses a formidable task to the manipulation task due to the large data volumes associated with them. We discuss a framework-Generative Video, which deals with this problem in an efficient way. Generative Video represents video sequences in terms of constructs-compact models. These are world images and generative operators. World images are augmented images, which contain the non-redundant information in the video sequence, and they describe video contents information. For each independently moving object we have a different world image. World images are stratified in layers according to occlusion information. The generative operators access video contents information, such as the shape and motion of objects moving in the sequence. Nonlinear video editing is realized by applying generative operators to world images. This approach to nonlinear editing facilitates the access, storage, and manipulation of video contents information. We describe the main properties of Generative Video and demonstrate nonlinear editing on a real video sequence.
Detection and Generation of Self-Timed Pipelines from High Level Specifications
Authors: Fu-Chiung Cheng, Shu-Ming Chang, Chi-Huam Shieh
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

System level design is becoming the major design methodology for System-on-a-chip (SOC) design with IP (Intellectual Property) reuse to solve the productivity gap problem. How to synthesis efficient hardware from high level specifications, such as Java, SystemC or C++, is becoming an important issue. This paper presents a novel methodology to extract pipeline stages from high level behavioral models to improve performance. A set of self-timed pipeline modules is designed and implemented for constructing these pipeline stages. The preliminary experimental result shows that, when the Summation/Modular Multiplication is partitioned into two pipelined stages, the pipelined Summation/Modular Multiplication is 1.94/1.61 times faster than the non-pipelined version with 15.8%/1.8% hardware overhead.
Semantic Map Based Web Search Result Visualization
Authors: Mohamed Salah Hamdi
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

The problem of information overload has become more pressing with the emergence of the increasingly more popular Internet services. The main information retrieval mechanisms provided by the prevailing Internet Web software are based on either keyword search (e.g., Google and Yahoo) or hypertext browsing (e.g., Internet Explorer and Netscape). The research presented in this paper is aimed at providing an alternative concept-based categorization and search capability based on a combination of meta-search and self-organizing maps. Kohonen's self-organizing map is very well known as a clustering and dimension reduction tool. Clustering can be used for categorization of search results. Dimension reduction can be used for visualization and for reducing information in order to ease search.
Joint Reference Modeling: Collaboration Support through Version Management
Authors: Oliver Thomas
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The derivation of specific models from reference models corresponds with the creation of reference model variants. Research on the design of such variant constructions generally assumes an unchangeable stock of reference models. The potential inherent in the management of these variant constructions which reflect the changes in jointly designed reference models through time and, in doing so, their evolutionary development, has not yet been tapped into. The article at hand analyzes this problem and presents a concept for the version management of jointly designed reference models as a solution. The task to be mastered with the proposed approach will be concretized using data structures and a system architecture and then prototypically implemented.
Estimating positions of multiple adjacent speakers based on MUSIC spectra correlation using a microphone array
Authors: H. Tanaka
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We propose an improved method of estimating the positions of two speakers using a microphone array. A well-known method, MUSIC, can be used to estimate speaker positions with high precision. However, in the special case that the speakers are closely located, the conventional MUSIC-based method sometimes fails to identify the existence of certain speakers, because close peaks in the MUSIC spectrum cannot be resolved. To overcome this difficulty, we propose a new method utilizing a cross-correlation between space-spectra calculated by MUSIC. Experimental results in a real environment have shown that the proposed method is effective in resolving the approximate positions of adjacent speakers.
NPS: a non-interfering deployable web perfectching system
Authors: Ravi Kokku, Praveen Yalagandula, Arun Venkataramani, Mike Dahlin
Venue: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4 (2003)

We present NPS, a novel non-intrusive web prefetching system that (1) utilizes only spare resources to avoid interference between prefetch and demand requests at the server as well as in the network , and (2) is deployable without any modifications to servers, browsers, network or the HTTP protocol. NPS's self-tuning architecture eliminates the need for traditional "thresholds" or magic numbers typically used to limit interference caused by prefetching, thereby allowing applications to improve benefits and reduce the risk of aggressive prefetching. NPS avoids interference with demand requests by monitoring the responsiveness of the server and accordingly throttling the prefetch aggressiveness, and by using TCP-Nice, a congestion control protocol suitable for low priority transfers. NPS avoids the need to modify existing infrastructure by modifying HTML pages to include JavascriptTM code that issues prefetch requests and by wrapping the server infrastructure with several simple external modules that require no knowledge of or no modifications to the internals of existing servers. Our measurements of the prototype under a web trace indicate that NPS is both non-interfering and efficient under different network load and server load conditions. For example, in our experiments with a loaded server with little spare capacity, we observe that a threshold-based prefetching scheme causes response times to increase by a factor of 2 due to interference, whereas prefetching using NPS decreases response times by 25%.
Reduction of communication quantity for network based parallel GA
Authors: K. Kojima, H. Matsuo, M. Ishigame
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper introduces network based parallel genetic algorithm (NBPGA) we proposed before, and considers a reduction method of communication for NBPGA. NBPGA is implemented on ordinary single-processor computers, workstations or personal computers, by using client-server model. To evaluate NBPGA, we applied it to a few problems, and considered the reduction in communication quantity.
Design and application of genetic algorithms for the multiple traveling salesperson assignment problem
Authors: Cliff T. Ragsdale
Venue:  (2003)

The multiple traveling salesmen problem (MTSP) is an extension of the traveling salesman problem with many production and scheduling applications. The TSP has been well studied including methods of solving the problem with genetic algorithms. The MTSP has also been studied and solved with GAs in the form of the vehicle-scheduling problem. This work presents a new modeling methodology for setting up the MTSP to be solved using a GA. The advantages of the new model are compared to existing models both mathematically and experimentally. The model is also used to model and solve a multi line production problem in a spreadsheet environment. The new model proves itself to be an effective method to model the MTSP for solving with GAs. The concept of the MTSP is then used to model and solve with a GA the use of one salesman make many tours to visit all the cities instead of using one continuous trip to visit all the cities. While this problem uses only one salesman, it can be modeled as a MTSP and has many applications for people who must visit many cities on a number of short trips. The method used effectively creates a schedule while considering all required constraints.