ppxscal/embedding_network huggingface dataset:
Characterizing Aging Phenomena of the Java Virtual Machine
Authors: Domenico Cotroneo, Salvatore Orlando, Stefano Russo
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

In this work we investigate software aging phenom- ena inside the Java Virtual Machine (JVM). Starting from an experimental campaign on real world testbeds, this work isolates the contribution of the JVM to the overall aging trend, and identifies, through statistical methods, which workload parameters are more relevant to aging dynamics. Experimental results show that the Sun Hotpost JVM experiences software aging phe- nomena. A consistent memory depletion trend (up to 50 KB/min) has been observed during periods of low garbage collector activity; the Just-In-Time compiler is also responsible for a lighter, but not negligible, mem- ory depletion trend; finally, a consistent throughput loss (up to 2.4 KB/min) has been observed.
Spatial Diversity in Signal Strength based WLAN Location Determination Systems
Authors: Anil Ramachandran, S. Jagannathan
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Literature indicates that spatial diversity can be utilized to compensate channel uncertainties such as multipath fading. Therefore, in this paper, spatial diversity is exploited for locating stationary and mobile objects in the indoor environment. First, space diversity technique is introduced for small scale motion and temporal variation compensation of received signal strength and it is demonstrated analytically that it enhances location accuracy. Small scale motion refers to movements of the transmitter and/or the receiver of the order of sub-wavelengths while temporal effects refer to environmental variations with time. A novel metric is introduced for selection combining in order to improve location accuracy through the addition of spatial diversity upon two available location determination schemes. The results are evaluated experimentally against single antenna system for reception by using low cost wireless RF devices such as motes. Alternatively, the impact of the number of location determination devices in a probabilistic WLAN network based on pre-profiling of signal strength is analyzed and it is demonstrated analytically that location accuracy improves with the number of receivers used. Spatial diversity in terms of the antenna spacing of 2\lambda is evaluated and shown to provide a reduction in location determination error between 30 and 40% when compared to a single antenna system.
Optimal Curve Fitting With Piecewise Linear Functions
Authors: A. Cantoni
Venue: IEEE Transactions on Computers (1971)

A method is described for determining an optimal straight-line segment approximation to specified functions for constrained and unconstrained endpoints.
Generating cross-cultural training data for THE UNIVERSITY GAME
Authors: Rebecca L. Damron, Gene B. Halleck
Venue: Simulation and Gaming (2007)

This article describes the process of creating training data for a game developed to promote cross-cultural competence among students studying in a culture di ferent from their own. The process of creating game cards (known as culture assimilators) begins with the collection of reports of intercultural misunderstandings. This phase of data generation is followed by the elicitation of possible explanations for the reported misunderstandings. The final phase in this process involves the development of evaluative feedback for the plausible explanations proposed by students.
Matrix Transformations for N-Tuple Analysis of Binary Patterns
Authors: H. C. Ratz
Venue: IEEE Transactions on Computers (1976)

The frequency of occurrence of logic functions of binary N-tuples can be observed from sequences of binary patterns. The logic functions considered here are AND, NOR, NAND, OR, and an odd-even parity check; and the frequency parameters are expressed as real matrix transformations on the probabilities of the patterns. Some properties, inverses, and interrelationships among the parameter sets are given, along with fast algorithms to facilitate computational processes. The results permit the outputs of convenient hardware logic operations to be converted into other parameters for smoothing, detection, or inference purposes, or to estimate the pattern probabilities by inversion. A measure of association among binary patterns is given as one characteristic feature which can be derived from the observed parameters.
A Theoretical Security Model for Access Control and Security Assurance
Authors: Bo-Chao Cheng, Huan Chen, Ryh-Yuh Tseng
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Advanced hacker techniques make the effective defense at the network security perimeters impossible. Many security solutions are proposed by researchers and practitioners in recent years, most of them focus on how to enhance the functionality and capability of security modules, but few of them emphasize on the assurance assessments of security modules. Security assurance intends to provide a degree of confidence instead of a true measure of how secure the system is. Security assurance should be measured and controlled in the process of security management life cycle. In this paper, we propose a security model, Object Association Binding (OAB), to unify the access control policies and to provide an objective assessment for the confidence level of network security assurance. Based on the design principles of OAB, its prototype called Network Security Policy Assistant (NSPA) is implemented.
Self-organization for search in peer-to-peer networks: the exploitation-exploration dilemma
Authors: Elke Michlmayr
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

This paper presents the design and evaluation of an ant-based approach to query routing in peer-to-peer networks. After pointing out how to employ the ant metaphor in peer-to-peer networks, we conduct a thorough evaluation of the impact of different settings for the configurable parameters present in ant algorithms on the performance values. In particular, the focus is on the effects of setting the ratio between (1) ants exploiting the option currently known as the best one and (2) ants exploring the search space with the aim of finding improved options. We show that the exploitation-exploration dilemma can be avoided by an adequate design of the exploring option.
VHDL Motivation
Authors: Allen Dewey, Anthony Gadient
Venue: IEEE Design Test (1986)

The goals of the very high speed integrated circuit (or VHSIC) program are to reduce IC design time and effectively insertVHSIC technology into military systems. These goals, indicating the need for a standard means of communication to stream-lineadvanced digital design and documentation, motivated the development of a hardware description language. Requirements wereanalyzed during 1981; program organization was formulated during 1982; and the VHSIC hardware description language (or VHDL)program was launched in August, 1983. Acting as a standard design automation interface, VHDL will simplify complex digitalsystem design. Acting as design documentation agent, it will facilitate design insertion into electronic systems. Organizationof the VHDL program is detailed elsewhere.1 We will discuss elements motivating hardware description language use (VHDL inparticular) and examine its impact on governmental, industrial, and academic participation in electronic research, business,and education.
Improving data transmission with helping nodes for geographical ad hoc routing
Authors: Kuo-Feng Ssu, Chih-Hsun Chou, Wei-Tong Wang, Shin-Hung Chung
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

Many routing protocols for mobile ad hoc networks assume that the node density of the network is sufficiently high that network partitions do not occur. However, in practice, this assumption is invalid since the mobility and random deployment of the nodes can easily cause partitions to take place. Therefore, this paper develops an approach for identifying suitable helping nodes to carry data packets from one partition to another during geographic routing. Unlike the assisting nodes proposed in previous schemes, the helping nodes are chosen from a group of regular mobile nodes that can move freely throughout the network. In addition, handoff procedures which may be required during the routing trip are implemented. Two mechanisms based on the approach were evaluated using network simulator 2. The evaluation results demonstrate that the algorithm successfully improves successful delivery ratio without needing special assisting nodes and only induces a little more routing overhead and energy consumption to the system.
PixelStreams-based implementation of videodetector
Authors: Marek Gorgon, Piotr Pawlik, Miroslaw Jablonski, Jaromir Przybylo
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

In the present paper the background generation and motion detection algorithms, which are of key importance for the implementation of videodetection, have been presented. A modification of the background generation algorithm, essential for proper algorithm functioning at medium and high road-traffic conditions, has been proposed. Algorithm adaptation for the implementation in reprogrammable device has been also presented. PixelStream-based implementation has been successfully performed. Real-time verification on reconfigurable platform has been done.
Component Based Approach to Handle Synonym and Polysemy in Folksonomy
Authors: Sun-Sook Lee, Hwan-Seung Yong
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Collaborative tagging describes the process by which many users add metadata in the form of keywords to shared content. In this paper, we first discuss current limitations of tagging services, second, we give an overview of existing approaches. We then describe the system on component architecture that we have implemented to minimize ambiguity due to no synonym and polysemy control in folksonomy. Finally, we give experimental results.
Parallel Particle Swarm Optimization for Attribute Reduction
Authors: Lei Xu, Fengming Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Attribute reduction is a key problem in rough set theory. A novel algorithm of attribute reduction based on parallel particle swarm optimization is proposed, which can significantly reduce execution time for complex large-scale data sets. This algorithm constructs heuristic information from the viewpoint of information theory, combines genetic idea and tabu operators with particle swarm optimization (PSO), redefines the updating process of particle swarm, and introduces the parallel strategy based on master-slave model with coarse grain in constructing the parallel PSO architecture. It maintains diversity of particles, which avoids the premature problem and restrains the degeneration phenomenon, and enhances the efficiency of attribute reduction. The simulation results show that this algorithm is more feasible and efficient compared with current approaches.
Eager Reclamation
Authors: Ching-Chy Wang, Mary Lou Soffa
Venue: IEEE Transactions on Software Engineering (1985)

Reclamation policies are presented which permit the reuse of storage for procedure instances before the procedures terminate. These eager reclamation policies are applicable under certain conditions and can reduce the total amount of memory needed for the execution of a program. The policies essentially differ in the amount of run-time checks needed and the reclamation opportunities. This eager reclamation strategy would be particularly useful when instances are implemented using register banks or in a microprocessor environment.
A General Method of Segmentation-Recognition Collaboration Applied to Pairs of Touching and Overlapping Symbols
Authors: Christophe Renaudin
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper, we present a general method to segment and recognize pairs of touching and overlapping symbols. The method, whose purpose is to lead to a generic approach in future works, is based on the evaluation of several segmentation candidates produced by grouping elements of an over-segmentation. A pure general method would involve a high number of segmentation candidates. An adaptive introduction of heuristics, representing the knowledge dedicated to the applicative domain, allows to decrease this number. We have largely tested the method on pairs of touching and overlapping digits.
Towards Overcoming Deficiencies in Constraint Diagrams
Authors: Gem Stapleton, Aidan Delaney
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

The constraint diagram language was designed to be used in conjunction with the Unified Modelling Language (UML), primarily for placing formal constraints on software models. In particular, constraint diagrams play a similar role to the textual Object Constraint Language in that they can be used for specifying system invariants and operation contracts in the context of a UML model. Constraint diagrams can also be used independently of the UML. In this paper, we illustrate a range of counter-intuitive features of constraint diagrams and highlight some (potential) expressiveness limitations. We propose a generalized version of the constraint diagram language that overcomes the illustrated counter-intuitive features and limitations.
Logic Design Automation of Fan-In Limited NAND Networks
Authors: D. L. Dietmeyer, Yueh-Hsung Su
Venue: IEEE Transactions on Computers (1969)

Factoring techniques are incorporated in computer-oriented algorithms for the synthesis of fan-in limited NAND switching networks. Tree networks with reduced gate count or levels of logic are sought. While example FORTRAN programs emphasize computer execution of the algorithms, they are also efficient for hand execution.
Translating Higher-Order Clauses to First-Order Clauses
Authors: Jia Meng, Lawrence C. Paulson
Venue: Journal of Automated Reasoning (2008)

Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. To integrate interactive provers with automatic ones, one must translate higher-order formulas to first-order form. The translation should ideally be both sound and practical. We have investigated several methods of translating function applications, types, and ¿-abstractions. Omitting some type information improves the success rate but can be unsound, so the interactive prover must verify the proofs. This paper presents experimental data that compares the translations in respect of their success rates for three automatic provers.
Clip Art Rendering of Smooth Isosurfaces
Authors: Matei Stroila, Elmar Eisemann, John Hart
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Clip art is a simplified illustration form consisting of layered filled polygons or closed curves used to convey 3-D shape information in a 2-D vector graphics format. This paper focuses on the problem of direct conversion of smooth surfaces, ranging from the free-form shapes of art and design to the mathematical structures of geometry and topology, into a clip art form suitable for illustration use in books, papers and presentations.We show how to represent silhouette, shadow, gleam and other surface feature curves as the intersection of implicit surfaces, and derive equations for their efficient interrogation via particle chains. We further describe how to sort, orient, identify and fill the closed regions that overlay to form clip art. We demonstrate the results with numerous renderings used to illustrate the paper itself.
Exploiting functional dependencies in declarative problem specifications
Authors: Toni Mancini, Marco Cadoli
Venue: Artificial Intelligence (2007)

In this paper we tackle the issue of the automatic recognition of functional dependencies among guessed predicates in constraint problem specifications. Functional dependencies arise frequently in pure declarative specifications, because of the intermediate results that need to be computed in order to express some of the constraints, or due to precise modeling choices, e.g., to provide multiple viewpoints of the search space in order to increase constraint propagation. In either way, the recognition of dependencies greatly helps solvers, allowing them to avoid spending search on unfruitful branches, while maintaining the highest degree of declarativeness. By modeling constraint problem specifications as second-order formulae, we provide a characterization of functional dependencies in terms of semantic properties of first-order ones, and prove undecidability of the problem of their recognition. Despite such negative result, we advocate the (in many cases effective) possibility of using automated tools to mechanize this task. Additionally, we show how suitable search procedures can be automatically synthesized in order to exploit recognized dependencies. We present opl examples of various problems, taken from bio-informatics, planning and resource allocation, and show how in many cases opl greatly benefits from the addition of such search procedures. Moreover, we also give evidence that writing sophisticated ad-hoc search procedures that handle dependencies exploiting the peculiarities of the particular problem is a very difficult and error-prone task which in many cases does not seem to pay-off.
Strategies to Keep Your VoIP Network Secure
Authors: Wesley Chou
Venue: IT Professional (2007)

VoIP enterprise deployments need strategies to help provide a balance between security and ease of use.
Facial expression classification: An approach based on the fusion of facial deformations using the transferable belief model
Authors: Z. Hammal, L. Couvreur, A. Caplier, M. Rombaut
Venue: International Journal of Approximate Reasoning (2007)

A method for the classification of facial expressions from the analysis of facial deformations is presented. This classification process is based on the transferable belief model (TBM) framework. Facial expressions are related to the six universal emotions, namely Joy, Surprise, Disgust, Sadness, Anger, Fear, as well as Neutral. The proposed classifier relies on data coming from a contour segmentation technique, which extracts an expression skeleton of facial features (mouth, eyes and eyebrows) and derives simple distance coefficients from every face image of a video sequence. The characteristic distances are fed to a rule-based decision system that relies on the TBM and data fusion in order to assign a facial expression to every face image. In the proposed work, we first demonstrate the feasibility of facial expression classification with simple data (only five facial distances are considered). We also demonstrate the efficiency of TBM for the purpose of emotion classification. The TBM based classifier was compared with a Bayesian classifier working on the same data. Both classifiers were tested on three different databases.
Database Security
Authors: G. I. Davida
Venue: IEEE Transactions on Software Engineering (1978)

Databases may be compromised by asking a set of queries which return only statistical information and making inferences about a specific entry from the results of the set of queries. We present methods of constructing the set of queries to compromise a database where all the queries in the set return the maximum of a set of k elements, or all queries return the mean of a set of k elements. In the case of the mean query, all elements involved will be compromised. We also consider bounds on the number of queries required to compromise the database.
Assignment of tasks to competing nodes when task duration times are fuzzy
Authors: A. de Korvin, R. Kleyle, S. Hashemi, G. Quirchmayr
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

In this article, we introduce a formal scheduling algorithm that uses redirecting of tasks from a bottlenecked employee while minimizing the completion time for the scheduled jobs. The paper focuses on instances in which a number of employees are to perform several jobs that are divided into various tasks with fuzzy values for their estimated duration times. Generally, efficient job scheduling requires that task and job duration be real values. This allows for precise calculation of time interval and time delay parameters when determining a job's completion time. When the precise values of either one of these parameters is unknown, not only can the job's completion time not be minimized, but the scheduling of tasks, without regard to the possible bottlenecks, will be haphazard.
Special Feature: Memory Extension Techniques for Minicomputers
Authors: M. Poppendieck
Venue: Computer (1977)

There are many computer users these days who have bumped up against the end of their memories. Years ago, IBM 1800, 1130, and 7094 users discovered that 32K words of addressable memory simply was not enough. Today, minicomputer users are discovering the same thing. And so are minicomputer manufacturers. Some of the newest mini's can address 128K, 256K, 512K, or even 1024K (1M) bytes of main memory. The claim is that 16M byte addressing is right around the corner.
Performance Evaluation of Scale-Interpolated Hessian-Laplace and Haar Descriptors for Feature Matching
Authors: Akshay Bhatia, Robert Laganiere, Gerhard Roth
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper studies the performance of various scale-invariant detectors in the context of feature matching. In particular, we propose an implementation of the Hessian-Laplace operator that we called Scale- Interpolated Hessian-Laplace. This research also proposes to use Haar descriptors which are derived from the Haar wavelet transform. It offers the advantage of being computationally inexpensive and smaller in size when compared to other descriptors.
An FPGA implementation of pipelined multiplicative division with IEEE Rounding
Authors: Ronen Goldberg, Guy Even, Peter-M. Seidel
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

We report the results of an FPGA implementation of double precision floating-point division with IEEE rounding. We achieve a total latency (i.e., cycles times clock period) that is 2:6 times smaller than the latency of the fastest previous implementation on FPGAs. The amount of hardware, on the other hand, is comparable to commercial cores. The division circuit is based on Goldschmidt's algorithm. All IEEE rounding modes are supported and are implemented using dewpoint rounding. The precision of the initial approximation of the reciprocal is 14 bits. To save hardware and reduce the critical path, a half-sized 62x30 Booth radix-8 multiplier is used. This multiplier can receive both the multiplicand and the multiplier in carry-save representation. The division circuit is partitioned into four pipeline stages, has a latency of 11 cycles, and may restart a new double precision division operation after 8 cycles. Synthesis results of an implementation (not including the computation of the initial approximation of the reciprocal and the exponent path) guarantee a clock frequency of 131 MHz on an Altera Stratix II using 3592 ALMs. The implementation was successfully tested with over 10 million random vectors as well as over a million hard-to-round vectors.