ppxscal/embedding_network huggingface dataset:
Microsystems Minimal Storage Sorting and Searching Techniques for RAM Applications: a Tutorial
Authors: K. A. Schember
Venue: Computer (1977)

A large number of sorting and searching techniques, covering a variety of applications, are dealt with in computer science literature. The classical problem associated with these methods has been determining which set of algorithms is most appropriate for a given application. With the recent advances in LSI technology and the assured proliferation of microprocessors and RAM memory, yet another application has evolved. Memory address widths associated with microprocessor systems are limited, in many cases, to a maximum of 16 bits, severely restricting maximum memory size. Minimal storage implementation techniques, characterized by the optimal use of the data space associated with an algorithm, therefore, are most appropriate for these restricted address space environments common to microprocessor systems.
NEBULA: A P2P Based Cooperative Spatial Database Prototype
Authors: Bin Chen, Zhou Huang, Xiujun Ma, Chenyu Li, Yong Gao, Yu Fang
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

In order to integrate heterogeneous spatial data sources to enhance spatial data share and interoperation, the P2P computing technologies were introduced to implement a prototype system of cooperative spatial database named NEBULA. By dynamic and self-cooperative features derived from P2P computing, this cooperative spatial database prototype made individual spatial databases united to achieve users' global spatial queries. Many P2P middleware technologies such as global resource directory, global query decomposing and sub-queries execution management were introduced to achieve the P2P spatial database system. Benefited from the P2P cooperative system, users can submit spatial queries in a global view regardless of where the spatial data store and how the spatial processing occurs. Lastly, a sample was also provided to show the entire workflow of the P2P spatial database prototype.
Dynamicity in distributed applications: issues, problems and the ASSIST approach
Authors: M. Vanneschi, L. Veraldi
Venue: Parallel Computing (2007)

Dynamic reconfiguration refers to the ability of changing properties and structure of a distributed system, while it is running. It is essential when designing applications that need to adapt to unpredictable events, run on non-dedicated environments; for which configuration cannot be statically determined, or may change at runtime. Grid computing also gave new emphasis to the topic, being based on dynamic environments by definition. The first part of this work tries to give a definite organization to known literature and existing experiments, providing a general overview of the problem. Then we describe our approach to dynamicity in the context of the ASSIST programming environment and show how it is able to provide users with many of the required abstractions to develop adaptive, high-performance, distributed applications.
Picture Recognition and Scene Analysis
Authors: A. Rosenfeld
Venue: Computer (1976)

The development of techniques for the computer analysis of pictures and scenes began over 20 years ago. Most of the work in this field has been application-oriented; some of the major applications areas are automation (robot vision), cytology, radiology, high-energy physics, remote sensing, and document processing (character recognition). However, many of the techniques and algorithms, even if developed for a particular application, are also applicable in other areas.
Mitigating Attacks Against Measurement-Based Adaptation Mechanisms in Unstructured Multicast Overlay Networks
Authors: AAron Walters, David Zage, Cristina Nita-Rotaru
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

Many multicast overlay networks maintain application-specific performance goals such as bandwidth, latency, jitter and lossrate by dynamically changing the overlay structure using measurement-based adaptation mechanisms. This results in an unstructuredoverlay where no neighbor selection constraints are imposed. Although such networks provide resilience to benign failures,they are susceptible to attacks conducted by adversaries that compromise overlay nodes. Previous defense solutions proposedto address attacks against overlay networks rely on strong organizational constraints and are not effective for unstructuredoverlays. In this work, we identify, demonstrate and mitigate insider attacks against measurement-based adaptation mechanismsin unstructured multicast overlay networks. The attacks target the overlay network construction, maintenance, and availabilityand allow malicious nodes to control significant traffic in the network, facilitating selective forwarding, traffic analysis,and overlay partitioning. We propose techniques to decrease the number of incorrect or unnecessary adaptations by using outlierdetection. We demonstrate the attacks and mitigation techniques in the context of a mature, operationally deployed overlaymulticast system, ESM, through real-life deployments and emulations conducted on the PlanetLab and DETER testbeds, respectively.
Innovative Mobile Phone Services Based on Next Generation Infrastructure in Japan A Survey
Authors: Akira Sasaki, Kazuaki Yamauchi, Wenxi Chen, Michael Cohen, Daming Wei, Zixue Cheng
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In this survey, we review current mobile phone technology and market in Japan in various fields. We also consider next-generation mobile phone infrastructure and innovative services, describing how future mobile infrastructure works by introducing some cutting-edge technology differing from the current mobile infrastructure. We explain why new services such as CGM (Communication Generated Market) content and media type content will become available in the future mobile network. New services are based upon the advanced infrastructure built-into next generation mobile phones. Because of advancement of hardware specifications and new technology, features of mobile phone terminals will evolve drastically from 2007 through 2010, and our daily lives will also be altered accordingly.
TopX: efficient and versatile top-k query processing for semistructured data
Authors: Martin Theobald, Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Gerhard Weikum
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2008)

Recent IR extensions to XML query languages such as Xpath 1.0 Full-Text or the NEXI query language of the INEX benchmark series reflect the emerging interest in IR-style ranked retrieval over semistructured data. TopX is a top-k retrieval engine for text and semistructured data. It terminates query execution as soon as it can safely determine the k top-ranked result elements according to a monotonic score aggregation function with respect to a multidimensional query. It efficiently supports vague search on both content- and structure-oriented query conditions for dynamic query relaxation with controllable influence on the result ranking. The main contributions of this paper unfold into four main points: (1) fully implemented models and algorithms for ranked XML retrieval with XPath Full-Text functionality, (2) efficient and effective top-k query processing for semistructured data, (3) support for integrating thesauri and ontologies with statistically quantified relationships among concepts, leveraged for word-sense disambiguation and query expansion, and (4) a comprehensive description of the TopX system, with performance experiments on large-scale corpora like TREC Terabyte and INEX Wikipedia.
A Designer/Verifier's Assistant
Authors: M. S. Moriconi
Venue: IEEE Transactions on Software Engineering (1979)

Since developing and maintaining formally verified programs is an incremental activity, one is not only faced with the problem of constructing specifications, programs, and proofs, but also with the complex problem of determining what previous work remains valid following incremental changes. A system that reasons about changes must build a detailed model of each development and be able to apply its knowledge, the same kind of knowledge an expert would have, to integrate new or changed information into an existing model.
Multidisciplinary research on the datapath of the computing disciplines
Authors: Antonio M. Lopez,  Jr., Frederick G. Lopez, Robert W. Lent, Madonna G. Constantine
Venue: Communications of the ACM (2007)

Social cognitive career theory helps determine why minorities and women are still so underrepresented in the computing disciplines in colleges and universities.
Extraction of logical rules to describe students' learning behavior
Authors: Félix Castro, Àngela Nebot, Francisco Mugica
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

E-learning offers a new context for education where large amounts of information describing the continuum of the teaching-learning interactions are endlessly generated and ubiquitously available. But raw information by itself may be of no help to any of the e-learning actors. The use of Data Mining methods to extract knowledge from this information can, therefore, be an adequate approach to follow in order to use the obtained knowledge to fit the educational proposal to the students' needs and requirements. In this brief study we use an extension of Fuzzy Inductive Reasoning methodology to extract comprehensible, actionable and reasonable set of rules describing the students' learning behavior. The obtained rules can be used to improve the system understanding and to provide valuable information to tutors about the course performance. The extraction rules model presented in this research is applied to a real virtual campus graduate course of the Center of Studies in Communication and Educational Technologies (CECTE, as Spanish acronym).
Optimal point removal in closed-2PM labeling
Authors: Farshad Rostamabadi, Iman Sadeghi, Mohammad Ghodsi, Ramtin Khosravi
Venue: Information Processing Letters (2008)

An optimal labeling where labels are disjoint axis-parallel equal-size squares is called 2PM labeling if the labels have maximum length each attached to its corresponding point on the middle of one of its horizontal edges. In a closed-2PM labeling, no two edges of labels containing points should intersect. Removing one point and its label, makes free room for its adjacent labels and may cause a global label expansion. In this paper, we construct several data structures in the preprocessing stage, so that any point removal event is handled efficiently. We present an algorithm which decides in O(lgn) amortized time whether a label removal leads to label expansion in which case a new optimal labeling for the remaining points is generated in O(n) amortized time.
Relaxed K-best MIMO signal detector design and VLSI implementation
Authors: Sizhong Chen, Tong Zhang, Yan Xin
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Signal detector is a key element in a multiple-input multiple-output (MIMO) wireless communication receiver. It has been well demonstrated that nonlinear tree search MIMO detectors can achieve near-optimum detection performance, nevertheless their efficient high-speed VLSI implementations are not trivial. For example, the hardware design of hard- or soft- output detectors for a 4 × 4 MIMO system with 64 quadrature amplitude modulation (QAM) still remains missing in the open literature. As an attempt to tackle this challenge, this paper presents an implementation-oriented breadth-first tree search MIMO detector design solution. The key is to appropriately modify the conventional breadth-first tree search detection algorithm in order to largely improve the suitability for efficient hardware implementation, while maintaining good detection performance. To demonstrate the effectiveness of the proposed design solution, using 0.13-µm CMOS standard cell and memory libraries, we designed a soft-output signal detector for 4 × 4 MIMO with 64-QAM. With the silicon area of about 31 mm2, the detector can achieve above 100 Mb/s and realize the performance very close to that of the sphere decoding algorithm.
Breakdown characteristics of nFETs in inversion with metal/HfO2 gate stacks
Authors: N. A. Chowdhury, G. Bersuker, C. Young, R. Choi, S. Krishnan, D. Misra
Venue: Microelectronic Engineering (2008)

Time zero and time dependent dielectric breakdown (TZBD and TDDB) characteristics of atomic layer deposited (ALD) TiN/HfO"2 high-@k gate stacks are studied by applying ramped and constant voltage stress (RVS and CVS), respectively, on the n-channel MOS devices under inversion conditions. For the gate stacks with thin high-@k layers (=
Proceedings of the 2007 ACM workshop on Scalable trusted computing
Venue: Conference on Computer and Communications Security (2007)

It is our great pleasure to usher in the 2nd ACM Workshop on Scalable Trusted Computing -- STC'07, which is built on the success of ACM STC'06. The call for papers attracted 30 submissions from Asia, Australia, Europe, and the United States. The program committee accepted 4 full papers and 6 short papers, based on the overall quality, novelty, and clarity. In addition, the program includes two invited talks by two distinguished speakers: Leendert van Doorn of AMD ("Trusted Computing Challenges"), and Yair Amir of The Johns Hopkins University ("The Insider Threat in Scalable Distributed Systems: Algorithms, Metrics and Gaps"). We hope that these proceedings will serve as a valuable reference for researchers and developers in the field of scalable trusted computing
A Design Philosophy for Microcomputers
Authors: Edwin Klingman
Venue: IEEE Micro (1981)

These eight design rules lead to better utilization of VLSI power, as the implementation of one high-level architecture shows. 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
Application of Semantic Network in Recognition of Skin Symptom
Authors: Yue-li Hu, Jing Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

When building Skin Intelligent Diagnostic Support System, the knowledge representation for skin symptoms is a fundamental design question. Here we present a semantic network as such a representation, and a skin symptom fuzzy inferential system based on semantic network is proposed by introducing the fuzzy inference to recognition and classification of skin microscopic images.
Tutorial Series 12 Design of a Small Business Data Processing System
Authors: F. G. Soltis
Venue: Computer (1981)

Providing complex functions in systems that can be easily used by those with limited skills and training is the major challenge facing small business system designers. 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
Immune Multi-agent Network Intrusion Defense Model
Authors: Qiang Hu, JianChuan Qiu, Gang Song
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper analyzes the immune theory and multiagent systems, and proposes an immune multi-agent active defense model. The concept of immune agent is introduced. While the logical structure and running mechanism is established. The method which uses antibody concentration to quantitatively describe the degree of intrusion danger is presented. The proposed model implements a multi-layer and distributed active defense mechanism for network intrusion. The experiment results show that this model is a good solution to the network security defense.
Automatic Generation of User Interfaces from Domain and Use Case Models
Authors: Antonio Miguel Rosado da Cruz, Joao Pascoal de Faria
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

In this paper, we envision an approach for the automatic generation of a user interface (UI) prototype from a system domain model (or core model), that captures the main domain entities and transactions, and a system use case model, which captures the intended user tasks. This prototype allows the early validation of executable core system models, and can be used as a basis for subsequent developments. The envisioned solution uses OCL to add preciseness and semantic richness both to the domain and use case UML models. The generated UI provides some usability enhancements that are derived from the model's pre-conditions.
QQL: A DB&IR Query Language
Authors: Ingo Schmitt
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2008)

Traditional database query languages are based on set theory and crisp first order logic. However, many applications require retrieval-like queries which return result objects associated with a degree of being relevant to the query. Historically, retrieval systems estimate relevance by exploiting hidden object semantics whereas query processing in database systems relies on matching select-conditions with attribute values. Thus, different mechanisms were developed for database and information retrieval systems. In consequence, there is a lack of support for queries involving both retrieval and database search terms. In this work, we introduce the quantum query language (QQL). Its underlying unifying theory is based on the mathematical formalism of quantum mechanics and quantum logic. Van Rijsbergen already discussed the strong relation between the formalism of quantum mechanics and information retrieval. In this work, we interrelate concepts from database query processing to concepts from quantum mechanics and logic. As result, we obtain a common theory which allows us to incorporate seamlessly retrieval search into traditional database query processing.
Typology of the experiences
Authors: Marcos Buccini, Stephania Padovani
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

The human being does not separate emotion from cognition, even when using or buying a product. This is one of the reasons why product and interface designers started to consider the emotions and pleasures that a product can bring to the user as part of their creating process. So, words as feelings, emotions, experience, pleasure and beauty have become more relevant in usability and marketing research. Research in this field, however, is scarce and the efforts concentrate in the area of product design, with only a few studies in the field of graphic and digital design. The purpose of this paper is to contribute to fulfill this gap by identifying the different categories of experiences that design can provide.
Resource sharing in continuous sliding-window aggregates
Authors: Arvind Arasu, Jennifer Widom
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We consider the problem of resource sharing when processing large numbers of continuous queries. We specifically address sliding-window aggregates over data streams, an important class of continuous operators for which sharing has not been addressed. We present a suite of sharing techniques that cover a wide range of possible scenarios: different classes of aggregation functions (algebraic, distributive, holistic), different window types (time-based, tuple-based, suffix, historical), and different input models (single stream, multiple substreams). We provide precise theoretical performance guarantees for our techniques, and show their practical effectiveness through experimental study.
Mosaicing-by-recognition for video-based text recognition
Authors: Seiichi Uchida, Hiromitsu Miyazaki, Hiroaki Sakoe
Venue: Pattern Recognition (2008)

Text recognition captured in multiple frames by a hand-held video camera is a challenging task because it is possible to capture and recognize a longer line of text while improving the quality of the text image by utilizing the redundancy of the overlapping areas between the frames. For this task, the video frames should be registered, i.e., mosaiced, after compensating for their distortions due to camera shakes. In this paper, a mosaicing-by-recognition technique is proposed where the problems of video mosaicing and text recognition are formulated as a unified optimization problem and solved by a dynamic programming-based optimization algorithm simultaneously and collaboratively. Experimental results indicate that, even if the frames undergo various distortions such as rotation, scaling, translation, and nonlinear speed fluctuation of camera movement, the proposed technique provides fine mosaic image by accurate distortion estimation (around 90% of perfect estimation) and character recognition accuracy (over 95%).
A Fully-Settled Linear Behavior Plus Noise Model for Evaluating the Digital Stimuli of the Design-for-Digital-Testability Σ-Δ Modulators
Authors: Hao-Chiao Hong
Venue: Journal of Electronic Testing: Theory and Applications (2007)

Evaluating the digital stimuli used in the design-for-digital-testability (DfDT) Σ-Δ modulator is a time-consuming task due to its oversampling and non-linear nature. Although behavioral simulations can substantially improve the simulation speed, conventional behavioral models fail to provide accurate enough signal-to-noise ratio (SNR) predictions for this particular application. In this paper, a fully-settled linear behavior plus noise (FSLB+N) model for the DfDT Σ-Δ modulator is presented to improve both the accuracy and the speed of the behavioral simulations. The model includes the following parameters: the finite open-loop gains, the offsets, the finite output swings, the flicker noise of the operational amplifiers (OPAMPs), as well as the thermal noises of the switched capacitors, the OPAMPs, and the reference supplies. With the proposed model, the behavioral simulation results demonstrate a high correlation with the measurement data. On average, the SNR difference between the simulation and the measurement is ---1.1 dB with a maximum of 0.05 dB and a minimum of ---2.2 dB. Comparing with the circuit-level simulation using HSPICE, the behavioral simulation with the FSLB+N model is 1,190,000 times faster. The proposed model not only can be used for evaluating the digital stimulus candidates, but also can be applied to system-level simulations of the mixed-signal design with an embedded DfDT Σ-Δ modulator.
Study on Distributed and Parallel Search Strategy of Shortest Path in Urban Road Network
Authors: Hao Yue, Chunfu Shao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper mainly focuses on distributed and parallel search strategy of shortest path in urban road network, which is motivated by the fact that in the shortest path search in complicated urban road network, the search time consumed will increase sharply with the increase of the number of road network nodes. In the algorithm presented in the paper, the whole search road network is first cut into local sub-search road networks, and connections among each local sub-search road network are established through virtual auxiliary nodes; then searches of the shortest paths in local sub-search road networks are conducted in a parallel manner. Finally, the shortest path search of the whole network is completed on the basis of local and parallel search by the virtual auxiliary nodes. The shortest path problem from single-origin to single-destination is studied and analyzed. The correctness of the algorithm is proved.