ppxscal/embedding_network huggingface dataset:
A Comparative Study of Set Associative Memory Mapping Algorithms and Their Use for Cache and Main Memory
Authors: A. J. Smith
Venue: IEEE Transactions on Software Engineering (1978)

Set associative page mapping algorithms have become widespread for the operation of cache memories for reasons of cost and efficiency. We show how to calculate analytically the effectiveness of standard bit-selection set associative page mapping or random mapping relative to fully associative (unconstrained mapping) paging. For two miss ratio models, Saltzer's linear model and a mixed geometric model, we are able to obtain simple, closed-form expressions for the relative LRU fault rates. We also experiment with two (infeasible to implement) dynamic mapping algorithms, in which pages are assigned to sets either in an LRU or FIFO manner at fault times, and find that they often yield significantly lower miss ratios than static algorithms such as bit selection. Trace driven simulations are used to generate experimental results and to verify the accuracy of our calculations. We suggest that as electronically accessed third-level memories composed of electron-beam tubes, magnetic bubbles, or charge-coupled devices become available, algorithms currently used only for cache paging will be applied to main memory, for the same reasons of efficiency, implementation ease, and cost.
From XML view updates to relational view updates: old solutions to a new problem
Authors: Vanessa P. Braganholo, Susan B. Davidson, Carlos A. Heuser
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

This paper addresses the question of updating relational databases through XML views. Using query trees to capture the notions of selection, projection, nesting, grouping, and heterogeneous sets found throughout most XML query languages, we show how XML views expressed using query trees can be mapped to a set of corresponding relational views. We then show how updates on the XML view are mapped to updates on the corresponding relational views. Existing work on updating relational views can then be leveraged to determine whether or not the relational views are updatable with respect to the relational updates, and if so, to translate the updates to the underlying relational database.
Automatic Generation of Ontology from the Deep Web
Authors: Yoo Jung An, James Geller, Yi-Ta Wu, Soon Ae Chun
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The term "Deep Web" refers to Web pages that are not accessible to search engines, e.g., because those Web pages are dynamically generated in response to queries through Web forms or Web services. The existing automated Web crawlers cannot index these pages, thus they are hidden from the Web search engines. Our goal is to properly annotate such Deep Web services (i.e. content generation interfaces of hidden Web sources) with semantic indexing by constructing domain-specific ontologies to represent the contents of the Deep Web sources. The fully automatic derivation of ontologies from Web sources without human review is to date a challenging research issue. We present a novel approach to automatically building a large, yet domain-specific, ontology by interweaving sub-taxonomies of WordNet with domainspecific information extracted from Deep Web service pages. Our algorithms extract domain concepts from Deep Web sources which are augmented with concepts and relationships from WordNet to construct ontology fragments. Structurally, these are Directed Acyclic Graphs (DAGs). An iterative process of extracting WordNet concepts and relationships and bridging concept gaps is used to tie together disparate domain concepts and ontology fragments into one ontology. Using eight domains (airfares, jobs, etc.) from a well-known test-bed, our algorithms constructed an ontology of 1692 concepts from Deep Web sources and 4434 concepts from WordNet. This ontology is expressed in the OWL format to support semantic Web searches.
A Comprehensive Evaluation of Workspace Awareness in Software Configuration Management Systems
Authors: Anita Sarma, Andre van der Hoek, David F. Redmiles
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Workspace awareness has emerged as a new coordination paradigm in configuration management, enabling early detection of potential conflicts by providing developers with information of relevant, parallel activities. The focus of our work is on detecting and mitigating direct and indirect conflicts by sharing information about ongoing code changes. In this paper, we discuss the results of user experiments designed as a broad and formative evaluation of workspace awareness, specifically focusing on whether users detect conflicts as they arise and act to mitigate potential problems. Our results confirm that workspace awareness promotes active self-coordination among users and can lead to an improved end-product in terms of the number of unresolved conflicts remaining in the code.
On the Definition and Policies of Confidentiality
Authors: Johs Hansen Hammer, Gerardo Schneider
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

In this paper we propose a more general definition of confidentiality, as an aspect of information security including information flow control. We discuss central aspects of confidentiality and their relation with norms and policies, and we introduce a language, with a deontic flavor, to express such norms and policies. Our language may be regarded as a first step towards a formal specification of security policies for confidentiality. We provide a number of examples of useful norms on confidentiality, and we discuss confidentiality policies from real scenarios.
A bit stream scalable speech/audio coder combining enhanced regular pulse excitation and parametric coding
Authors: Felip Riera-Palou, Albertus C. den Brinker
Venue: EURASIP Journal on Advances in Signal Processing (2007)

This paper introduces a new audio and speech broadband coding technique based on the combination of a pulse excitation coder and a standardized parametric coder, namely, MPEG-4 high-quality parametric coder. After presenting a series of enhancements to regular pulse excitation (RPE) to make it suitable for the modeling of broadband signals, it is shown how pulse and parametric codings complement each other and how they can be merged to yield a layered bit stream scalable coder able to operate at different points in the quality bit rate plane. The performance of the proposed coder is evaluated in a listening test. The major result is that the extra functionality of the bit stream scalability does not come at the price of a reduced performance since the coder is competitive with standardized coders (MP3, AAC, SSC).
Velocity-Aligned Discrete Oriented Polytopes for Dynamic Collision Detection
Authors: Daniel S. Coming, Oliver G. Staadt
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

We propose an acceleration scheme for manybody dynamic collision detection at interactive rates. We use the VADOP, a tight bounding volume representation that offers fast update rates and which is particularly suitable for applications with many fast-moving objects. The axes selection that determines the shape of our bounding volumes is based on spherical coverings. We demonstrate that we can robustly detect collisions that are missed by pseudo-dynamic collision detection schemes, with even greater performance due to substantial collision pruning by our bounding volumes.
Visibility map for global illumination in point clouds
Authors: Rhushabh Goradia, Anil Kanakanti, Sharat Chandran, Amitava Datta
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

Point-sampled geometry has gained significant interest due to their simplicity. The lack of connectivity touted as a plus, however, creates difficulties in many operations like generating global illumination effects. This becomes especially true when we have a complex scene consisting of several models. The data is often hard to segment as individual models and hence not suitable for surface reconstruction. Inter-reflections in such complex scenes requires knowledge of visibility between point pairs. Computing visibility for point models is all the more difficult (than for polygonal models), since we do not have any surface or object information. We present in this paper a novel, hierarchical, fast and memory efficient algorithm to compute a description of mutual visibility in the form of a visibility map. Ray shooting and visibility queries can be answered in sub-linear time using this data structure. We evaluate our scheme analytically, qualitatively, and quantitatively and conclude that these maps are desirable.
Pervasive 2D Barcodes for Camera Phone Applications
Authors: Hiroko Kato, Keng T. Tan
Venue: IEEE Pervasive Computing (2007)

Although 2D barcode technology offers exciting applications, it's still in its infancy, partly because no global standard for 2D barcodes in camera phone applications exists. This article discusses the reliability and suitability of 2D barcodes as candidates for a global standard and identifies key factors for improving 2D-barcode reading's robustness.
A comparison of academics' attitudes towards the rights protection of their research and teaching materials
Authors: Elizabeth Gadd, Steve Loddington, Charles Oppenheim
Venue: Journal of Information Science (2007)

This paper compares two JISC-funded surveys. The first was undertaken by the Rights MEtadata for Open Archiving (RoMEO) project and focused on the rights protection required by academic authors sharing their research outputs in an open-access environment. The second was carried out by the Rights and Rewards project and focused on the rights protection required by authors sharing their teaching materials in the same way. The data are compared. The study reports confusion amongst both researchers and teachers as to copyright ownership in the materials they produced. Researchers were more restrictive about the permissions they would allow, but were liberal about terms and conditions. Teachers would allow many permissions, but under stricter terms and conditions. The study concludes that a single rights solution could not be used for both research and teaching materials.
Indexing of fictional video content for event detection and summarisation
Authors: Bart Lehane, Noel E. O'Connor, Hyowon Lee, Alan F. Smeaton
Venue: Journal on Image and Video Processing (2007)

This paper presents an approach to movie video indexing that utilises audiovisual analysis to detect important and meaningful temporal video segments, that we term events. We consider three event classes, corresponding to dialogues, action sequences, and montages, where the latter also includes musical sequences. These three event classes are intuitive for a viewer to understand and recognise whilst accounting for over 90% of the content of most movies. To detect events we leverage traditional filmmaking principles and map these to a set of computable low-level audiovisual features. Finite state machines (FSMs) are used to detect when temporal sequences of specific features occur. A set of heuristics, again inspired by filmmaking conventions, are then applied to the output of multiple FSMs to detect the required events. A movie search system, named MovieBrowser, built upon this approach is also described. The overall approach is evaluated against a ground truth of over twenty-three hours of movie content drawn from various genres and consistently obtains high precision and recall for all event classes. A user experiment designed to evaluate the usefulness of an event-based structure for both searching and browsing movie archives is also described and the results indicate the usefulness of the proposed approach.
Robust Children and Adults Speech Classification
Authors: Yumin Zeng, Yi Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

A robust classification system for children, adults male and adults female speech has been proposed. The proposed classifier is based on Gaussian Mixture Models, which apply the combined parameters of pitch, first three formants and 5-order relative spectral perceptual linear predictive coefficients (RASTA-PLPC) and Delta RASTA-PLPC, to model the characteristics of children speech, adult male and female speech. Its performances have been evaluated for several speech databases. The simulation results show that: for the speeches of adults and children in grades K to 5 (below the age of 11), the total accuracy of classification is above 97% in the condition of clean speech and still remains nearly 90% even if the SNR of speech is degraded to 5dB in the condition of different additive noises and channel distortion noises. Furthermore, the performance of this classifier is independent of languages.
A robust and effective fuzzy adaptive equalizer for powerline communication channels
Authors: Wai Kit Wong, Heng Siong Lim
Venue: Neurocomputing (2007)

Fuzzy adaptive equalizers (FAEs) are adaptive equalizers that apply the concepts of fuzzy logic. The main merit of applying FAEs in powerline channel equalization is that linguistic information (fuzzy IF-THEN rules) and numerical information (input-output pairs) can be combined into the equalizers. The adaptive algorithms adjust the parameters of the membership functions which characterize the fuzzy concepts in the IF-THEN rules, by minimizing some criterion function. In this paper, we propose a new FAE, using the extended Kalman filter (EKF) algorithm for powerline channel equalization. The simulation results show that the EKF-based FAE has lower steady state bit error rate (BER) and faster convergent speed compared to decision feedback recursive least-squares adaptive equalizer, recursive least squares (RLS) based FAE and least mean squares (LMS) based FAE. We also propose a robust improvement scheme for the new FAE. Simulation results show that the performance of the proposed robust FAE is improved in powerline channel equalization and outperforms all the equalizers considered above. The BER of the proposed scheme is very close to the optimum performance.
Model Checking RAISE Applicative Specifications
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Ensuring the correctness of a given software component has become a crucial aspect in software engineering and model checking provides an almost fully automated way to achieve this goal. In this paper we focus on the main issues for adding model checking functionality to the RAISE specification language and present the semantic foundations of our current approach for doing so. We also describe a way to use model checking to verify RAISE confidence conditions, ensuring the soundness and completeness (within certain finiteness constraints) of the results checked in this way. Finally, we present the most interesting details of the implementation of a tool that follows the described approach.
Computation of Binary Objects Sides Number using Discrete Geometry, Application to Automatic Pebbles Shape Analysis
Authors: Tristan Roussillon, Laure Tougne, Isabelle Sivignon
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

We are working in collaboration with geographers to study a set of pebbles digital images. Among the features geographers want to get automatically, pebble sides number is intuitively defined as shown in Fig 1. It is merely computed after a thick polygonalisation of pebble contour. We propose an incremental and linear algorithm, free of restrictive hypothesis, which relies on previous works of Debled et al. [3, 4, 5]. We give some results on synthetical and real images.
AFIS data compression: an example of how domain specific compression algorithms can produce very high compression ratios
Authors: Givon Zirkind
Venue: ACM SIGSOFT Software Engineering Notes (2007)

This article describes the development and implementation of a data compression algorithm designed specifically for fingerprints, referred to as GBP compression. The algorithm is herein discussed. Data Compression algorithms can be designed for general applications, meaning the input data is unknown. This is more commonly referred to as generic data. [LI01] Or, data compression algorithms can be designed for specific applications. e.g. AFIS [Automated Fingerprint Identification Systems] "When the input is known, higher compression ratios can be achieved with the knowledge of the input data stream." To-date, the highest compression ratio for an unknown input data stream, for all data compression algorithms, is JPEG with an average compression ratio range of 1:17 -- 1:23. [PEN03] The algorithm herein discussed, has a compression ratio range of 1:68 -- 1:92. There is a value, time and place for each design method - generic or specific - depending upon a variety of factors. Due to the nature of the use of AFIS for law enforcement and incrimination as well as criminal conviction, there are social issues that make data integrity of paramount concern. This factor influences algorithm selection and design. A lossless algorithm is a must! Also, the nature of AFIS is such that it operates across borders and between states, municipalities and jurisdictions. In addition to the usual issues and resistance to accepting new technology, including software [e.g. resistance to change, fear of system failure, etc.], there are the issues of changing engineering standards [hardware and software] which are governmentally determined as well as governmental policy decisions. Likewise, the portability required in implementing a new algorithm, will have to deal with a variety of hardware and software; as well as be designed to integrate into existing systems. This integration must include the ability to incorporate existing JPEG data files, from existing police databases. This requires a handshaking of standards and conversion programs that maintain data integrity. In addition, there is an in depth discussion of the limits of compression with a novel perspective.
A Deductive Method for Simulating Faults in Logic Circuits
Authors: D. B. Armstrong
Venue: IEEE Transactions on Computers (1972)

A deductive method of fault simulation is described, which "deduces" the faults defected by a test at the same time that it simulates explicitly only the good behavior of logic circuit. For large logic circuits (at least several thousand gates) it is expected to be faster than "parallel" fault simulators, but uses much more computer memory than do parallel simulators.
The Synchronization and Associative Memory of Spiking Neuronal Networks with Randomly Distributed Time Delays
Authors: J. H. Peng, H. J. Yu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Synchronization and associative memory in spike neural network composed of the widely discussed Hodgkin-Huxley neurons is investigated in this paper. Based on the reality of the microscopic biological structure in the neural system, the couplings among those neurons are accompanied with randomly distributed time delays which models the times needed for pulses propagating on the axons from the presynaptic neurons to the postsynaptic neurons. The memory is represented in the spatiotemporal firing pattern of the neurons, and the memory retrieval is accomplished with the fluctuations of the noise in the system.
A Correction and Some Comments Concerning Graph Isomorphism by Finite Automata
Authors: Chao-Chin Yang
Venue: IEEE Transactions on Computers (1978)

For the given directed graphs, a method based on Moore sequential machines (MSM) for solving the graph isomorphism problem was recently proposed. However, that method provides only a necessary (but not a sufficient) condition. This correspondence corrects this error by developing a necessary and sufficient condition. It will be shown that this type of problem can be also solved by using deterministic state machines (DSM). But there are tradeoffs to be considered in using either DSM's or MSM's. In addition, the effectiveness of the method based on MSM's depends very much on the output definition.
New media and open and distance learning: new challenges for education in a knowledge society
Authors: Bernard Cornu
Venue: Informatics in education (2007)

The "digital society" provides not only with new technology, but also with new concepts. Information plays a central role and becomes a valuable good, but knowledge cannot be reduced to information, and one aim for educators is to contribute in a "knowledge society", not only an "information society". A knowledge society is structured in networks, enriching the traditional hierarchies; a knowledge society promotes a kind of "collective intelligence". In such a society, open and distance learning has new dimensions and faces new challenges: collaboration and individualization, dealing with time and space, dealing with presence and distance, and contributing to lifelong learning. The Stellenbosch Declaration gives the main trends for ICT in education in a knowledge society, according to six major issues: digital solidarity, learners and lifelong learning, decision-making strategies, networking, research, teachers.
Dynamic Resource Allocation for Beyond 3G Cellular Networks
Authors: Dinh Thuy Huy, Jonathan Rodriguez, Atílio Gameiro, Rahim Tafazolli
Venue: Wireless Personal Communications: An International Journal (2007)

The Multicarrier CDMA Transmission Techniques for Integrated Broadband Cellular Systems (MATRICE) project addresses a candidate solution for a Beyond 3G (B3G) air-interface based on Multi-Carrier Code Division Multiple Access (MC-CDMA). It investigates dynamic resource allocation strategies at the Medium Access Control (MAC) layer to support the transport of Internet Protocol (IP) packets over the air-interface in a cost effective manner and maximise the cell capacity with a target QoS. A candidate Dynamic Resource Allocation (DRA) protocol architecture is proposed that is based on cross-layer signalling to provide reactive resource allocation according to the fast channel and traffic variations. In-line with B3G expectations, the proposed DRA handles a very large number of users with inherent flexibility and granularity necessary to support heterogeneous traffic, and still with limited complexity. Thanks to the modular architecture of the DRA, various scheduling policies are investigated and compared in terms of capacity and reactivity to the system environment. Simulation results have shown that the MATRICE system has the potential to deliver broadband heterogenous services in a cost-effective manner, and emerge as a propespective candidate air-interface for B3G cellular networks.
Comments on "A Fast Digital Computer Method for Recursive Estimation of the Mean"
Authors: J. C. Majithia
Venue: IEEE Transactions on Computers (1972)

Several algorithms for the computation of the mean value of a random variable have been analyzed. Results have shown that the two previously published techniques and a modified version of one of these, give unbiased estimates of the mean value. Furthermore, although the confidence intervals have been found to be increased in all cases, the actual increase is insignificant, while the possible speed improvements in computation can be considerable.
Clustering Genetic Algorithm
Authors: Petra Kudova
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper we present and study a clustering technique based on genetic algorithms -- Clustering Genetic Algorithm. Performance of the algorithm is demonstrated on experiments. We have shown that it outperforms the k-means algorithm on some tasks. In addition, it is capable of optimising the number of clusters for tasks with well formed and separated clusters.