ppxscal/embedding_network huggingface dataset:
Cimbiosys: a platform for content-based partial replication
Authors: Venugopalan Ramasubramanian, Thomas L. Rodeheffer, Douglas B. Terry, Meg Walraed-Sullivan, Ted Wobber, Catherine C. Marshall, Amin Vahdat
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

Increasingly people manage and share information across a wide variety of computing devices from cell phones to Internet services. Selective replication of content is essential because devices, especially portable ones, have limited resources for storage and communication. Cimbiosys is a novel replication platform that permits each device to define its own content-based filtering criteria and to share updates directly with other devices. In the face of fluid network connectivity, redefinable content filters, and changing content, Cimbiosys ensures two properties not achieved by previous systems. First, every device eventually stores exactly those items whose latest version matches its filter. Second, every device represents its replication-specific metadata in a compact form, with state proportional to the number of devices rather than the number of items. Such compact representation results in low data synchronization overhead, which permits ad hoc replication between newly encountered devices and frequent replication between established partners, even over low bandwidth wireless networks.
Combining Techniques to Reduce State Space and Prove Strong Properties
Authors: Dilia E. Rodríguez
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

An on-the-fly symmetry reduction technique that exploits the lexicographic order on metarepresentations of Maude terms, and a technique that uses auxiliary data to verify strong properties that are not directly expressible in propositional temporal logic are presented. Both are implemented by simple transformations of rewrite theories. They are applied in the verification of a strong-consistency property of a client-server protocol, a simplification of the Chain-Replication protocol.
Proposed nanotechnology park in South Wales, industrial and organizational challenges
Authors: Ahmet Karakas
Venue: Proceedings of the 8th WSEAS international conference on Microelectronics, nanoelectronics, optoelectronics (2009)

This study aims to clarify the establishment of the Nanotechnology Park in South Wales. The feasibility is observed through a survey. As the idea is a unique concept, the survey outcome is analyzed together with recent research and it is aimed to fill the gap in the field. Due to the nature of nanotechnology organizations, the challenges of the industry as well as the researchers are observed. The outline and proposed issues to be considered are addressed for a nanotechnology park. Further research recommendations are pointed out through finalizing this study.
Some First-Order Algorithms for Total Variation Based Image Restoration
Authors: Jean-François Aujol
Venue: Journal of Mathematical Imaging and Vision (2009)

This paper deals with first-order numerical schemes for image restoration. These schemes rely on a duality-based algorithm proposed in 1979 by Bermùdez and Moreno. This is an old and forgotten algorithm that is revealed wider than recent schemes (such as the Chambolle projection algorithm) and able to improve contemporary schemes. Total variation regularization and smoothed total variation regularization are investigated. Algorithms are presented for such regularizations in image restoration. We prove the convergence of all the proposed schemes. We illustrate our study with numerous numerical examples. We make some comparisons with a class of efficient algorithms (proved to be optimal among first-order numerical schemes) recently introduced by Y. Nesterov.
Effectiveness of web-based animated pedagogical agents: facilitating critical thinking of nursing students
Authors: Charlotte Redden
Venue:  (2008)

Although critical thinking is described as an essential skill in nursing, not all new registered nurses meet these expectations. A primary responsibility for instructional designers is to provide instruction that creates optimal learning situations. One approach is to have the student use critical thinking skills to solve a problem by providing conditions of instruction to trigger higher order thinking. Pedagogical agents provide a possible affordance for facilitating critical thinking by asking questions and engaging the learner. This mixed method experimental study addressed the effectiveness of a web-based pedagogical agent in facilitating critical thinking in students in the final semester of their associate degree nursing program. The treatment group participated in a series of three nursing case studies with a pedagogical agent while the control group completed the series without the pedagogical agent. The results of the ANCOVA demonstrated no significance difference between the groups on the Critical Thinking Process Test. The pre-think-aloud and post-think-aloud were coded and analyzed by faculty using a rating tool and rubric for the presence of eight cognitive processes, level of critical thinking, and for accuracy of nursing diagnosis, conclusions, and evaluation. No significant difference appeared on the chi-square analysis between pre-think-aloud and post-think-aloud for the attainment of advanced beginner/competent level, appropriate diagnosis, correct conclusion, or appropriate evaluations by group. However, 79% of the treatment group improved on their level of critical thinking compared to 57% of the control group. 67% of the treatment group improved on the accuracy of their conclusions and evaluation compared to 33.3% of the control group. A chi-square analysis for each group revealed a significant difference for improvement of the critical thinking level and correct conclusions from pre-think-aloud to post-think-aloud. In contrast, a significant difference in the chi-square analysis was found only in the treatment group when examining the improvement of appropriate evaluations from pre-think-aloud to post-think-aloud. Although this study provided mixed results, there appears to be some support for the use of a pedagogical agent to facilitate critical thinking in nursing.
Planar graphs without 4-cycles are acyclically 6-choosable
Authors: Weifan Wang, Min Chen
Venue: Journal of Graph Theory (2009)

A proper vertex coloring of a graph G=(V, E) is acyclic if G contains no bicolored cycle. A graph G is acyclically L-list colorable if for a given list assignment L=&lcub;L(v)|v&isin;V&rcub;, there exists a proper acyclic coloring &pi; of G such that &pi;(v)&isin;L(v) for all v&isin;V. If G is acyclically L-list colorable for any list assignment with |L(v)|&ge;k for all v&isin;V, then G is acyclically k-choosable. In this paper we prove that every planar graph G without 4-cycles is acyclically 6-choosable. &copy; 2009 Wiley Periodicals, Inc. J Graph Theory 61: 307&ndash;323, 2009
On stability and ambiguous representation of shock wave discontinuity: numerical analysis on the basis of model equation of state
Authors: A. V. Konyukhov, A. P. Likhachev, V. E. Fortov, A. M. Oparin
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

The problem of an ambiguous representation of shocks at S-like shaped Hugoniot fragment (in P-u plane) is considered. The behavior of the shock wave in the region of its ambiguous representation containing the Hugoniot segment with fulfilled condition of shock wave instability L>1+2M has been studied numerically on the basis of the Navier-Stokes equations in one- and twodimensional formulations. Multidimensional modeling of the behavior of the periodically disturbed shock wave has shown the formation of a cellular detonation-like front structure.
Improving robustness in consistency-based diagnosis using possible conflicts
Authors: Belarmino Pulido, Anibal Bregon, Carlos Alonso-González
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Behaviour simulation in Consistency-based Diagnosis requires knowing the initial value. This assumption is not easily fulfilled in real systems, even in the presence of measurements related to state variables due to noise and parameter uncertainties. This work proposes the integration of state observers to estimate initial states for simulation in consistency-based diagnosis with possible conflicts, using the BRIDGE framework, proposing an extension for a class of dynamic systems. Suitable state-observer structural models are obtained through same algorithms used to find possible conflicts --minimal subsystems with analytical redundancy--, without additional knowledge in the models.
Business process measurement model based on the fuzzy multi agent systems
Authors: Mahdi Pakseresht, Mir Ali Seyyedi, Mehran Mohsen Zade, Hamid Gardesh
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

The aim of this article is to introduce a new model for measuring Business process based on the Fuzzy Multi Agent Systems. Some of features providing by this model are: 1. Simplicity of use 2. Enterprise look vision 3. Accuracy of measurement result 4. Focus on quantitative criteria to measure the performance of business, first a composite model called BSC-GQM is issued and then the result of performance measurement is analyzed by multi agent fuzzy systems. The use of this model will increase noticeably the accuracy of performance measurement results done on business process.
On the price of mediation
Authors: Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson, Alan Roytman
Venue: Proceedings of the tenth ACM conference on Electronic commerce (2009)

We study the relationship between the social cost of correlated equilibria and the social cost of Nash equilibria. In contrast to previous work focusing on the possible benefits of a benevolent mediator, we define and bound the Price of Mediation (PoM): the ratio of the cost of the worst correlated equilibrium to the cost of the worst Nash. We observe that in practice, the heuristics used for mediation are frequently non-optimal, and from an economic perspective mediators may be inept or self-interested. Recent results on computation of equilibria also motivate our work. We consider the Price of Mediation for general games with small numbers of players and pure strategies. For games with two players each having two pure strategies we prove a tight bound of two on the PoM. For larger games (either more players, or more pure strategies per player, or both) we show that the PoM can be unbounded. Most of our results focus on symmetric congestion games (also known as load balancing games). We show that for general convex cost functions, the PoM can grow exponentially in the number of players. We prove that PoM is one for linear costs and at most a small constant (but can be larger than one) for concave costs. For polynomial cost functions, we prove bounds on the PoM which are exponential in the degree.
FM Model Based Fingerprint Reconstruction from Minutiae Template
Authors: Jianjiang Feng, Anil K. Jain
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Minutiae-based representation is the most widely adopted fingerprint representation scheme. The compactness of minutiae template has created an impression that the minutiae template does not contain sufficient information to allow the reconstruction of the original fingerprint image. This belief has now been shown to be false; several algorithms have been proposed that can reconstruct fingerprint images from minutiae templates. However, these reconstruction techniques have a common weak point: many spurious minutiae, not included in the original minutiae template, are generated in the reconstructed image. Moreover, some of these techniques can only reconstruct a partial fingerprint. In this paper, a novel fingerprint reconstruction algorithm is proposed, which not only reconstructs the whole fingerprint, but the reconstructed fingerprint contains very few spurious minutiae. A fingerprint image is modeled as a 2D Frequency Modulation (FM) signal whose phase consists of the continuous part and the spiral part (which corresponds to minutiae). An algorithm is proposed to reconstruct the continuous phase from minutiae. The proposed reconstruction algorithm has been evaluated with respect to the success rates of type-I attack (match the reconstructed fingerprint against the original fingerprint) and type-II attack (match the reconstructed fingerprint against the different impressions of the original fingerprint) using a commercial fingerprint recognition system. Both types of attacks were shown to be successful in deceiving the fingerprint system.
Using computer graphics to explore object oriented concepts using C
Authors: William Kreahling
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

Most recent graphics courses are what we would call top-down courses. Courses that focus on using graphical packages to implement and teach graphics. The course discussed in this paper takes the opposite approach. We use a bottom-up approach to teach the basic concepts of graphics. In this class graphics is used as a learning tool, to delve into the underlying data structures and concepts that are needed to create photo-realistic images. The students build a program to create images from scratch using the C programming languages. While there have been other graphics courses to take a bottom-up approach, this paper builds the graphical projects using only the C programming language, no graphics APIs are used in the class. During the course of the semester object-oriented concepts and differences between object-oriented languages and procedural languages are highlighted and discussed in detail. The students not only learn the basic concepts of graphics, but become familiar with the C programming language (students at our university begin programming with Java). The course could be easily tailored for several different classes in a typical CS curriculum, from a beginning programming course, to a programming languages course. At the conclusion of the course a student survey was also conducted to gather student feedback about the course.
Fragility of the Robust Security Network: 802.11 Denial of Service
Authors: Martin Eian
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

The upcoming 802.11w amendment to the 802.11 standard eliminates the 802.11 deauthentication and disassociation Denial of Service (DoS) vulnerabilities. This paper presents two other DoS vulnerabilities: one vulnerability in draft 802.11w implementations discovered by IEEE 802.11 TGw, and one new vulnerability in 802.11, which is still present in the 802.11w amendment. Attacks exploiting the first vulnerability are significantly more efficient than any known 802.11 DoS attacks, while attacks exploiting the second vulnerability have efficiency and feasability equivalent to a disassociation attack. This paper provides an experimental verification of these attacks, demonstrating their feasability using freely available software and off the shelf hardware. Finally, the root cause of these vulnerabilities is discussed and a backwards compatible solution proposed.
An assessment of accountability policies for large-scale distributed computing systems
Authors: Wonjun Lee, Anna C. Squicciarini, Elisa Bertino
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

Grid computing systems offer resources to solve large-scale computational problems and are thus widely used in a large variety of domains, including computational sciences, energy management, and defense. Accountability in these application domains is an important requirement, in that it enables controlling activities of users and resource providers through the collection and analysis of accountability data. However, because it is not feasible to simply collect all the potentially useful data, we propose an accountability policy language to simplify administration tasks. In this paper, we show the efficiency of a system that we have developed to implement the language. We first present a short overview of the system, and then assess the proposed accountability policies based on the experiments.
Measuring file access patterns in UNIX
Authors: Irene Hu
Venue: ACM SIGMETRICS Performance Evaluation Review (1986)

UNIX is a disk-based operating system, where only the system kernel is always memory-resident. A combination of small block size, limited read-ahead and numerous seeks can severely limit the file system throughput. This paper presents a tool to study the file access patterns. Information derived from the data collected can be used to determine the optimal disk block size and also to improve the block placement strategy. The tool is a software monitor, installed at the device driver level, and triggered by every physical request to the disk handler. The design approach used to measure the average number of logical records accessed sequentially is described. An evaluation of the tool is also presented.
Microcode and the protection of intellectual effort
Authors: Y. N. Patt, J. K. Ahlstrom
Venue: Proceedings of the 18th annual workshop on Microprogramming (1985)

We believe that the intellectual efforts of persons should be protected, but that the needs of society must be protected, too. Substantial interest in this issue, as it pertains to the protection of microcode, has prompted the preparation of this paper as a position statement to initiate discussion at the 18th International Microprogramming Workshop. We describe the relevant protection mechanisms and some of the nuances regarding them. We describe the important characteristics of microcode. Finally, we assume an advocacy position.
Logic programming semantics using a compact data structure
Authors: M Fitting
Venue: Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems (1986)

A fixpoint semantics is given for logic programming using domain theory, with undefined as one truth value, allowing negation, and arbitrary data structures. This generalizes the conventional semantics, and agrees with it on 'successes' for Horn clause programs. Consequences of requiring the data structure to be a compact topological space and the given relations to be continuous are investigated, extending results in the last chapter of Lloyd's book.
Towards fully-computerized database maintenance for non-traditional appliances
Authors: C. T. Wu
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

Database management systems are widely used in business data processing to automate many low-level tasks. However, they are not powerful enough to be used as database managers for advanced applications such as tactical weapons systems, industrial manufacturing systems, and integrated corporate information systems. This paper addresses the issues related to developing database systems capable of providing full data management support for advanced application areas. Specifically, the paper will list the requirements of an advanced database manager and present our effort in designing a database management system for computer integrated manufacturing.
Security without identification: transaction systems to make big brother obsolete
Authors: David Chaum
Venue: Communications of the ACM (1985)

The large-scale automated transaction systems of the near future can be designed to protect the privacy and maintain the security of both individuals and organizations.
Searching for information in a hypertext medical handbook
Authors: Mark, E. Frisse
Venue: Communications of the ACM (1988)

Medicine is an ideal domain for hypertext applications and research. Implementing a popular medical handbook in hypertext underscores the need to study hypertext in the context of full-text document retrieval, machine learning, and user interface issues.
A Fault-Tolerant Modular Architecture for Binary Trees
Authors: A. S. Mahmudul Hassan, Vinod K. Agarwal
Venue: IEEE Transactions on Computers (1986)

A new modular, fault-tolerant scheme is proposed for the binary tree architecture. The approach uses redundant modular fault- tolerant building blocks to construct the complete binary tree. The restructuring operation is local to each faulty module. The proposed scheme is shown to be more reliable and easier to implement than the existing fault-tolerant schemes.
Three-Dimensional Vision Structure for Robot Applications
Authors: David Nitzan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

Focuses on the structure of robot sensing systems and the techniques for measuring and preprocessing 3-D data. To get the information required for controlling a given robot function, the sensing of 3-D objects is divided into four basic steps: transduction of relevant object properties (primarily geometric and photometric) into a signal; preprocessing the signal to improve it; extracting 3-D object features; and interpreting them. Each of these steps usually may be executed by several alternative techniques (tools). Tools for the transduction of 3-D data and data preprocessing are surveyed. The performance of each tool depends on the specific vision task and its environmental conditions, both of which are variable. Such a system includes so-called tool-boxes, one box for each sensing step, and a supervisor, which controls iterative sensing feedback loops and consists of a rule-based program generator and a program execution controller. Sensing step sequences and tools are illustrated for two 3-D vision applications at SRI International Company: visually guided robot arc welding and locating identical parts in a bin.
Boxer: a reconstructible computational medium
Authors: A. A diSessa, H. Abelson
Venue: Communications of the ACM (1986)

Programming is most often viewed as a way for experts to get computers to perform complex tasks efficiently and reliably. Boxer presents an alternative image&mdash;programming as a way for nonexperts to control a reconstructible medium, much like written language, but with dramatically extended interactive capabilities.
Regular Ternary Logic Functions Ternary Logic Functions Suitable for Treating Ambiguity
Authors: M Mukaidono
Venue: IEEE Transactions on Computers (1986)

A special group of ternary functions, called regular ternary logic functions, are defined. These functions are useful in switching theory, programming languages, algorithm theory, and many other fields if we are concerned with the indefinite state in such fields. This correspondence describes the fundamental properties and representations of the regular ternary logic functions.
A simple virtual machine
Authors: James P Kelsh, John C Hansen
Venue: ACM SIGSMALL/PC Notes (1987)

Many computer science classes begin with a discussion of how a computer performs certain actions. In an introductory survey of computers, this frequently involves demonstrating some application program. A first course for majors in computer science is likely to discuss high-level programming languages and compare them to the assembly language of some mainframe. A course in system programming is likely to provide examples of assembly language code and relocatable object code before introducing assemblers, linkers, and loaders. The authors have observed certain drawbacks in some of the familiar approaches.