ppxscal/embedding_network huggingface dataset:
Query responsive awareness software: inventory control case study
Authors: Brian J. d'Auriol, Pramod Chikkappaiah, Weiwei Yuan, Sungyoung Lee, Young-Koo Lee
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Query Responsive Awareness Software (QRAS) is proposed in this paper as a run-time software representable model that incorporates semantic attributes into the software. Specifically QRAS: (a) provides for the representation of properties of the software and its application environment, (b) is compatible for distributed systems and in particular, smart collaborative object systems, and (c) provides human and/or automated query and query-responsiveness. QRAS is based on the Geometric Representation of Programs (GRP) model. A case study based on a simplified inventory control system together with a simulation of various queries concludes a feasibility study of the proposed approach.
Constrained inventory allocation
Authors: Phillip G. Bradford, Michael N. Katehakis
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

This paper shows how to allocate a limited supply of inventory in a centralized distribution system with multiple retailers subject to minimal supply commitments and maximum delivery limits for each retailer. The objective is to maximize the number of units sold by all retailers in one time period. The analysis is done by building on a classical result of Derman. The demand at each retailer is described by a probability density function and unsold portions of the supply lose their value at the end of the period.
Parallel computable higher type functionals
Authors: P. Clote
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

The primary aim of this paper is to introduce higher type analogues of some familiar parallel complexity classes, and to show that these higher type classes can be characterised in significantly different ways. Recursion-theoretic, proof-theoretic and machine-theoretic characterisations are given for various classes, providing evidence of their naturalness.
Hardware-Enhanced Association Rule Mining with Hashing and Pipelining
Authors: Ying-Hsiang Wen, Jen-Wei Huang, Ming-Syan Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

Generally speaking, to implement Apriori-based association rule mining in hardware, one has to load candidate itemsets and a database into the hardware. Too many candidate itemsets and a large database would create a performance bottleneck. In this paper, we propose a HAsh-based and PiPelIned architecture (abbreviated as HAPPI) for hardware-enhanced association rule mining. We apply the pipeline methodology in the HAPPI architecture to compare itemsets with the database and collect useful information for reducing the number of candidate itemsets and items in the database simultaneously. When the database is fed into the hardware, candidate itemsets are compared with the items in the database to find frequent itemsets. At the same time, trimming information is collected from each transaction. Therefore, we can effectively reduce the frequency of loading the database into the hardware. As such, HAPPI solves the bottleneck problem in Apriori-based hardware schemes. We also derive some properties to investigate the performance of this hardware implementation. As shown by the experiment results, HAPPI significantly outperforms the previous hardware approach in terms of execution cycles.
Identifying important and difficult concepts in introductory computing courses using a delphi process
Authors: Ken Goldman, Paul Gross, Cinda Heeren, Geoffrey Herman, Lisa Kaczmarczyk, Michael C. Loui, Craig Zilles
Venue: ACM SIGCSE Bulletin (2008)

A Delphi process is a structured multi-step process that uses a group of experts to achieve a consensus opinion. We present the results of three Delphi processes to identify topics that are important and difficult in each of three introductory computing subjects: discrete math, programming fundamentals, and logic design. The topic rankings can be used to guide both the coverage of standardized tests of student learning (i.e., concept inventories) and can be used by instructors to identify what topics merit emphasis.
Pouring liquids: A study in commonsense physical reasoning
Authors: Ernest Davis
Venue: Artificial Intelligence (2008)

This paper presents a theory that supports commonsense, qualitative reasoning about the flow of liquid around slowly moving solid objects; specifically, inferring that liquid can be poured from one container to another, given only qualitative information about the shapes and motions of the containers. It shows how the theory and the problem specification can be expressed in a first-order language; and demonstrates that this inference and other similar inferences can be justified as deductive conclusions from the theory and the problem specification.
Validating for Liveness in Hidden Adversary Systems
Authors: Saikat Mukherjee, Srinath Srinivasa, Satish Chandra D
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Multi-stream interactive systems can be seen as ''hidden adversary'' systems (HAS), where the observable behaviour on any interaction channel is affected by interactions happening on other channels. One way of modelling HAS is in the form of a multi-process I/O automata, where each interacting process appears as a token in a shared state space. Constraints in the state space specify how the dynamics of one process affects other processes. We define the ''liveness criterion'' of each process as the end objective to be achieved by the process. The problem now for each process is to achieve this objective in the face of unforeseen interferences from other processes. In an earlier paper, it was proposed that this uncertainty can be mitigated by collaboration among the disparate processes. Two types of collaboration philosophies were also suggested: altruistic collaboration and pragmatic collaboration. This paper addresses the HAS validation problem where processes collaborate altruistically.
The Craft of Programming
Authors: Neville Holmes
Venue: Computer (2008)

Building programs should be made enjoyable for more people.
Multi-summation in difference fields (abstract only)
Authors: Carsten Schneider
Venue: ACM Communications in Computer Algebra (2008)

In this talk we present recent symbolic summation tools based on difference field theory. The algorithmic ideas are illustrated by concrete examples that arise in the evaluation of Feynman integrals in perturbative quantum field theory.
On-the-fly XMM-Newton spacecraft data reduction on the Grid
Authors: A. Ibarra, D. Tapiador, E. Huedo, R. S. Montero, C. Gabriel, C. Arviset, I. M. Llorente
Venue: Scientific Programming (2006)

We present the results of the first prototype of a XMM-Newton pipeline processing task, parallelized at a CCD level, which can be run in a Grid system. By using the Grid Way application and the XMM-Newton Science Archive system, the processing of the XMM-Newton data is distributed across the Virtual Organization (VO) constituted by three different research centres: ESAC (European Space Astronomy Centre), ESTEC (the European Space research and TEchnology Centre) and UCM (Complutense University of Madrid). The proposed application workflow adjusts well to the Grid environment, making use of the massive parallel resources in a flexible and adaptive fashion.
Auditory self-motion illusions ("circular vection") can be facilitated by vibrations and the potential for actual motion
Authors: Bernhard E. Riecke, Daniel Feuereissen, John J. Rieser
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

It has long been known that sound fields rotating around a stationary, blindfolded observer can elicit self-motion illusions ("circular vection") in 20--60% of participants. Here, we investigated whether auditory circular vection might depend on whether participants sense and know that actual motion is possible or impossible. Although participants in auditory vection studies are often seated on moveable seats to suspend the disbelief of self-motion, it has never been investigated whether this does, in fact, facilitate vection. To this end, participants were seated on a hammock chair with their feet either on solid ground ("movement impossible" condition) or suspended ("movement possible" condition) while listening to individualized binaural recordings of two sound sources rotating synchronously at 60&deg;/s. In addition, hardly noticeable vibrations were applied in half of the trials. Auditory circular vection was elicited in 8/16 participants. For those, adding vibrations enhanced vection in all dependent measures. Not touching solid ground increased the intensity of self-motion and the feeling of actually rotating in the physical room. Vection onset latency and the percentage of trials where vection was elicited were only marginally significantly (p<.10) affected, though. Together, this suggests that auditory self-motion illusions can be stronger when one senses and knows that physical motion might, in fact, be possible (even though participants always remained stationary). Furthermore, there was a benefit both of adding vibrations and having one's feet suspended. These results have important implications both for our theoretical understanding of self-motion perception and for the applied field of self-motion simulations, where both vibrations and the cognitive/perceptual framework that actual motion is possible can typically be provided at minimal cost and effort.
Computing the global optimum of a multivariate polynomial over the reals
Authors: Mohab Safey El Din
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

Let f be a polynomial in Q[X1, ..., Xn] of degree D. We provide an efficient algorithm in practice to compute the global supremum supx∈ Rn f(x) of f (or its infimum inf{x∈ Rn}f(x)). The complexity of our method is bounded by DO(n)}. In a probabilistic model, a more precise result yields a complexity bounded by O(n7D4n) arithmetic operations in Q. Our implementation is more efficient by several orders of magnitude than previous ones based on quantifier elimination. Sometimes, it can tackle problems that numerical techniques do not reach. Our algorithm is based on the computation of generalized critical values of the mapping x-> f(x), i.e. the set of points {c∈ C mid exists (xll)ll∈ N}⊂ Cn ;f(xll)-> c, ;||xll||||dxll f||-> 0 { when }ll-> ∞}. We prove that the global optimum of f lies in its set of generalized critical values and provide an efficient way of deciding which value is the global optimum.
Design of high performance pattern matching engine through compact deterministic finite automata
Authors: Piti Piyachon, Yan Luo
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Pattern matching relies on deterministic finite automata (DFA) to search for predefined patterns. While a bit-DFA method is recently proposed to exploit the parallelism in pattern matching, we identify its limitations and present two schemes, Label Translation Table (LTT) and CAM-based Lookup Table (CLT), to reduce the DFA memory size by 85%, and simplify the design by requiring only four processing elements of bit-DFA instead of thousands.
Identification and sizing of the entirely visible rocks from a 3D surface data segmentation of laboratory rock piles
Authors: Matthew J. Thurley, Kim C. Ng
Venue: Computer Vision and Image Understanding (2008)

Once segmentation of 3D surface data of a rock pile has been performed, the next task is to determine the visibility of the surface rocks. A region boundary-following algorithm that accommodates irregularly spaced 3D coordinate data is presented for determining this visibility. We examine 3D surface segmentations of laboratory rock piles and determine which regions in the segmentation correspond to entirely visible rocks, and which correspond to overlapped or partially visible rocks. This is a significant distinction as it allows accurate size determination of entirely visible rocks, separate handling of partially visible rocks, and prevents erroneous bias resulting from mishandling partially visible rocks as smaller entirely visible rocks. Literature review indicates that other rock pile sizing techniques fail to make this distinction. The rock visibility results are quantified by comparison to manual surface classifications of the laboratory piles and the size results are quantified by comparison to the sieve size.
The Modern Algebra of Information Retrieval, 1 edition
Authors: Sndor Dominich
Venue: The Information Retrieval Series (2008)

This book takes a unique approach to information retrieval by laying down the foundations for a modern algebra of information retrieval based on lattice theory. All major retrieval methods developed so far are described in detail Boolean, Vector Space and probabilistic methods, but also Web retrieval algorithms like PageRank, HITS, and SALSA and the author shows that they all can be treated elegantly in a unified formal way, using lattice theory as the one basic concept. Further, he also demonstrates that the lattice-based approach to information retrieval allows us to formulate new retrieval methods. Sndor Dominichs presentation is characterized by an engineering-like approach, describing all methods and technologies with as much mathematics as needed for clarity and exactness. His readers in both computer science and mathematics will learn how one single concept can be used to understand the most important retrieval methods, to propose new ones, and also to gain new insights into retrieval modeling in general. Thus, his book is appropriate for researchers and graduate students, who will additionally benefit from the many exercises at the end of each chapter.
Hierarchical Soft Error Estimation Tool (HSEET)
Authors: K. Ramakrishnan, R. Rajaraman, N. Vijaykrishnan, Y. Xie, M. J. Irwin, K. Unlu
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Radiation induced soft errors have become an important reliability concern in the sub-nanometer regime. Therefore, it is imperative to devise methods to predict the Soft Error Rates (SER) quickly and accurately in combinational circuits. In this paper, we present a novel technique and a tool to compute the SERs of designs employing hierarchical architectures such as adders and multipliers. The technique uses pre-characterized blocks for current generation and propagation and probability theory to estimate the SER in hierarchical architectures. The analysis results of different hierarchical architectures, based on characterization of basic blocks such as muxes, counters and partial product generators using the new technique, are presented in this paper. The run time for most of the designs were in the order of few minutes and we obtain an average speedup of 14084X times over HSPICE and 12.25X times over a contemporary tool SEAT-LA. We have also demonstrated the scalability of our technique for various hierarchical circuits. Our technique can also be extended to any block based architecture.
A Java3D framework for inspecting and segmenting 3D models
Authors: Leila De Floriani, Laura Papaleo, Nicoló Carissimi
Venue: Proceedings of the 13th international symposium on 3D web technology (2008)

Models of 3D objects have become widely accessible in several disciplines within academia and industry, spanning from scientific visualization to entertainment. In the last few years, 3D models are often organized into digital libraries accessible over the network, and thus semantic annotation of such models becomes an important issue. A fundamental step in annotating a 3D model is to segment it into meaningful parts. In this work, we present a Java3D framework for inspecting and segmenting 3D objects represented in X3D format. In particular, we present a combination of segmentation and merging techniques for producing a feasible decomposition of the boundary of a 3D object. We represent such decomposition as a graph, that we call the segmentation graph which is the basis for semantic annotation. We describe also the interface we have developed to allow visualization and browsing of both the decomposition and the segmentation graph in order to understand the topological structure of the resulting decomposition.
Panel on role engineering
Authors: Vijay Atluri
Venue: Proceedings of the 13th ACM symposium on Access control models and technologies (2008)

Due to its exibility, ease of administration and intuitiveness, role-based access control (RBAC) is now part of most operating systems and application software. As a result of its commercial success, it has become a standard to implementing access control in many of today's organizations. However, deploying RBAC requires one to first identify an accurate and complete set of roles, and assign users to roles and permissions to roles. This process, known as role engineering [3], has been identified as one of the costliest components in realizing RBAC [7]. Although the problem of role engineering has been studied since early nineties, a recent surge in interest can be seen equally from academic and industry communities. The primary focus of this panel is to have an in-depth discussion of this problem along several dimensions. The panelists, drawn from both academia and industry, include Gail Ahn (University of North Carolina, Charlotte), Vijay Atluri (Rutgers University), Edward Coyne (Science Applications International Corporation), William Horne (Hewlett-Packard), Axel Kern (Beta Systems), Sylvia Osborn (University of Western Ontario) and Andreas Schaad (SAP Labs), who are experts in role engineering. The first dimension of discussions will be on the different means of approaching the role engineering problem, which basically include top-down and bottom-up approaches. Under the top-down approach, roles are defined by carefully analyzing and decomposing business processes into smaller units in a functionally independent manner. These functional units are then associated with permissions on information systems. Coyne [3] is the first to describe the role engineering problem, and to present the concepts of the top-down approach. Later, several top-down approaches have been proposed [6, 1, 12, 14, 15, 11, 5, 8, 2]. In contrast, the bottom-up approach utilizes the existing permission assignments to formulate roles. Recently, several solutions have been proposed in this direction [9, 13, 18, 16, 17, 4, 10]. It may also be advantageous to use a hybrid approach, which is a mixture of the top-down and the bottom-up approaches. The focus of the discussion will be on the pragmatics of applying these classes of solutions in real world situations. Another dimension of discussion will be on the past experiences and current practices employed by organizations in dealing with the role engineering problem, as well as on the opinions of the panelists on the expected practices in future. Yet another dimension is to tackle this problem from a formal perspective and examine the different variants of the problem. These include devising a minimal but complete and good set of roles, minimal number of user-to-role and role-permission assignments, weaker notions of devising minimal roles [16], and the like. The discussions include formal versus practical solutions, their limitations and issues needing further investigation.
Conjugate Points in the Euler Elastic Problem
Authors: Yu. L. Sachkov
Venue: Journal of Dynamical and Control Systems (2008)

For the classical Euler elastic problem, conjugate points are described. Inflexional elasticas admit the first conjugate point between the first and third inflexion points. All other elasticas do not have conjugate points. As a result, the problem of stability of Euler elasticas is solved.
Designing Systolic Algorithms Using Sequential Machines
Authors: O. H. Ibarra
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

We offer a methodology for simplifying the design and analysis of systolic systems. Specifically, we give characterization of systolic arrays in terms of (single processor) sequential machines which are easier to analyze and to program. We give several examples to illustrate the design methodology. In particular, we show how systolic arrays can be easily designed to implement priority queues, integer bitwise multiplication, dynamic programming, etc. Because the designs are based on the sequential machine, the constructions we obtain are much simpler then those that have appeared in the literature. We also give some results concerning the properties and computational power (e.g., speed-up, hierarchy, etc.) of systolic arrays.
On the Network Coding Advantage for Wireless Multicast in Euclidean Space
Authors: Ashish Goel, Sanjeev Khanna
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Multicast is a fundamental communication operation in wireless sensor networks whereby a source sensor transmits its information to a relevant subset of sensors in the network. Motivated by this, we study the advantage of network coding for minimizing the total power needed for multicast in wireless networks. We show that there is an absolute constant, depending only on the power gradient and the dimension of the underlying Euclidean space, that bounds the maximum advantage of network coding. An interesting aspect of our result is that it shows that the advantage of coding remains bounded by a constant even when compared to a multicast scheme without coding that is restricted to do only point-to-point transmissions.
On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators
Authors: Lu-Chuan Ceng, Jen-Chih Yao
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper we introduce general iterative methods for finding zeros of a maximal monotone operator in a Hilbert space which unify two previously studied iterative methods: relaxed proximal point algorithm [H.K. Xu, Iterative algorithms for nonlinear operators, J. London Math Soc. 66 (2002) 240-256] and inexact hybrid extragradient proximal point algorithm [R.S. Burachik, S. Scheimberg, B.F. Svaiter, Robustness of the hybrid extragradient proximal-point algorithm, J. Optim. Theory Appl. 111 (2001) 117-136]. The paper establishes both weak convergence and strong convergence of the methods under suitable assumptions on the algorithm parameters.
Supporting conceptual design in architecture by linguistic model
Authors: Adam Borkowski, Ewa Grabska, Agnieszka Ozimek, Paweł Ozimek, Krzysztof Papiernik
Venue: Machine Graphics Vision International Journal (2007)

It is shown that linguistic approach can be very useful when developing software supporting conceptual design in architecture. Treating primitives, like rooms, as letters of a certain language and capturing the knowledge about the architecture in a grammar allows us to implement automatic reasoning. It turns out that grammars describing hierarchical graphs are best suited for this purpose. The formalism underlying this approach is presented together with a prototype software that allows the user to convert functional requirements into layouts of the designed building, to visualise the resulting alternative solutions and to select the best one for the detailed design. The usage of this software is demonstrated on two examples.
Greenfoot: a highly graphical ide for learning object-oriented programming
Authors: Michael Kölling
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

Greenfoot is an educational IDE that makes it easy to write interactive graphical applications. It helps to solve several problems in the teaching and learning of object-oriented programming: It provides educational tools that aid in understanding fundamental object-oriented concepts, and it is highly motivational through instant graphical feedback.