ppxscal/embedding_network huggingface dataset:
Identity SA 1.6: an artistic software that produces a deformed audiovisual reflection based on a visually interactive swarm
Authors: Tatsuo Unemi, Yoshiaki Matsui, Daniel Bisig
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Identity SA is an interactive and generative installation that combines a swarm-based simulation with real time camera based interaction. The agents' distributions are transformed into painterly images by employing a variety of different visualization techniques and styles. Camera based interaction is based on a simple motion detection algorithm that affects the agents' movements as well as their coloring. Identity SA acts as a visual and acoustic mirror, which distorts the continuity of the visitor's physical existence into ephemeral patterns and flowing motions. The new version 1.6 adds the capability to select musical tracks depending on the agents' movements. This system has been employed both as an experimental installation in an exhibition and as interactive video projection for a contemporary dance performance.
The Complexity of Minimum Convex Coloring
Authors: Frank Kammer, Torsten Tholey
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

A coloring of the vertices of a graph is called convex if each subgraph induced by all vertices of the same color is connected. We consider three variants of recoloring a colored graph with minimal cost such that the resulting coloring is convex. Two variants of the problem are shown to be ${\mathcal{NP}}$-hard on trees even if in the initial coloring each color is used to color only a bounded number of vertices. For graphs of bounded treewidth, we present a polynomial-time (2 + &epsilon;)-approximation algorithm for these two variants and a polynomial-time algorithm for the third variant. Our results also show that, unless ${\mathcal{NP}} \subseteq DTIME(n^{O(\log \log n)})$, there is no polynomial-time approximation algorithm with a ratio of size (1 - o(1))ln ln n for the following problem: Given pairs of vertices in an undirected graph of bounded treewidth, determine the minimal possible number l for which all except l pairs can be connected by disjoint paths.
BTP Prediction Model Based on ANN and Regression Analysis
Authors: Bin Wang, Yan Fang, Jinfang Sheng, Weihua Gui, Ying Sun
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In this paper, data mining technology is adopted to find correlations from massive production data to predict Burning Through Point (BTP) of sintering process. A hybrid BTP prediction model is presented which is based on artificial neural network and multi-linear regression error compensation algorithm. In this model, the final prediction result is calculated based on both the prediction value from ANN model and the compensation value from linear regression model. Compared with the pure ANN model, the maximal prediction error is reduced from 3.85 meter to 1.3 meter and the prediction errors are kept in the range of 1 meter with the probability of 98.89%. Finally, the prediction values and correlated variables are sent back to L1 system through BTP control model to realize a closed-loop control system.
Proof of the local REM conjecture for number partitioning. I: Constant energy scales
Authors: Christian Borgs, Jennifer Chayes, Stephan Mertens, Chandra Nair
Venue: Random Structures Algorithms (2009)

In this article we consider the number partitioning problem (NPP) in the following probabilistic version: Given n numbers X1,&hellip;,Xn drawn i.i.d. from some distribution, one is asked to find the partition into two subsets such that the sum of the numbers in one subset is as close as possible to the sum of the numbers in the other set. In this probabilistic version, the NPP is equivalent to a mean-field antiferromagnetic Ising spin glass, with spin configurations corresponding to partitions, and the energy of a spin configuration corresponding to the weight difference. Although the energy levels of this model are a priori highly correlated, a surprising recent conjecture of Bauke, Franz, and Mertens asserts that the energy spectrum of number partitioning is locally that of a random energy model (REM): the spacings between nearby energy levels are uncorrelated. More precisely, it was conjectured that the properly scaled energies converge to a Poisson process, and that the spin configurations corresponding to nearby energies are asymptotically uncorrelated. In this article, we prove these two claims, collectively known as the local REM conjecture. &copy; 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2009 This work was done while C.N. was a student at Stanford University and a post-doc at Microsoft Research.
Importance sampling for Bayesian sensitivity analysis
Authors: B. O'Neill
Venue: International Journal of Approximate Reasoning (2009)

We examine the use of sensitivity analysis with a particular focus on calculating the bounds of imprecise previsions in Bayesian statistics. We explain the use of importance sampling in approximating the range of these imprecise previsions and we develop an approximation function for the imprecise posterior prevision based on generating a finite number of random variables. We develop a convergence theorem that shows that this approximation converges almost surely to the posterior prevision as we generate more and more random variables. We also develop a useful accuracy bound for the approximation for a large finite number of generated random variables. We test the efficiency of this approximation using a simple example involving the imprecise Dirichlet model.
DIALOGUE: providing total terminal independence
Authors: David Vaskevitch
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

A software tool, called DIALOGUE, makes application programs completely terminal-independent so that they can be used from both formatted screens and character mode terminals. The independence is achieved by providing programmers with a high-level record definition language for describing the data. This language isolates the programmer from the details of terminal interaction so they can be automatically handled in the most appropriate fashion at execution time. To support various terminal types most effectively, DIALOGUE may generate a different interface for each brand of terminal. A unique aspect is its typewriter interface which supports character mode terminals so that they are indistinguishable (to the application) from formatted screen terminals. Devices such as light pens and OCR readers are also supported. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks
Authors: Michael J. Neely
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

We consider a one-hop wireless network with independent time varying ON/OFF channels and N users, such as a multi-user uplink or downlink. We first show that general classes of scheduling algorithms that do not consider queue backlog must incur average delay that grows at least linearly with N. We then construct a dynamic queue-length aware algorithm that maximizes throughput and achieves an average delay that is independent of N. This is the first order-optimal delay result for opportunistic scheduling with asymmetric links. The delay bounds are achieved via a technique of queue grouping together with Lyapunov drift and statistical multiplexing concepts.
Operating System Security, 1st edition
Authors: Trent Jaeger
Venue: Synthesis Lectures On Information Security, Privacy, And Trust (2008)

Operating systems provide the fundamental mechanisms for securing computer processing. Since the 1960s, operating systems designers have explored how to build "secure" operating systems - operating systems whose mechanisms protect the system against a motivated adversary. Recently, the importance of ensuring such security has become a mainstream issue for all operating systems. In this book, we examine past research that outlines the requirements for a secure operating system and research that implements example systems that aim for such requirements. For system designs that aimed to satisfy these requirements, we see that the complexity of software systems often results in implementation challenges that we are still exploring to this day. However, if a system design does not aim for achieving the secure operating system requirements, then its security features fail to protect the system in a myriad of ways. We also study systems that have been retrofit with secure operating system features after an initial deployment. In all cases, the conflict between function on one hand and security on the other leads to difficult choices and the potential for unwise compromises. From this book, we hope that systems designers and implementors will learn the requirements for operating systems that effectively enforce security and will better understand how to manage the balance between function and security.Table of Contents: Introduction / Access Control Fundamentals / Multics / Security in Ordinary Operating Systems / Verifiable Security Goals / Security Kernels / Securing Commercial Operating Systems / Case Study: Solaris Trusted Extensions / Case Study: Building a Secure Operating System for Linux / Secure Capability Systems / Secure Virtual Machine Systems / System Assurance
End-User Service Computing: Spreadsheets as a Service Composition Tool
Authors: Željko Obrenović, Dragan Gašević
Venue: IEEE Transactions on Services Computing (2008)

In this paper, we show how spreadsheets, an end-user development paradigm proven to be highly productive and simple to learn and use, can be used for complex service compositions. We identify the requirements for spreadsheet-based service composition, and present our framework that implements these requirements. Our framework enables spreadsheets to send requests and retrieve results from various local and remote services. We show how our tools support different composition patterns, and how the style of declarative dependencies of spreadsheets can facilitate service composition. We also discuss novel issues identified by using the framework in several projects and education.
The Hyper-Kautz Network: A New Scalable Product Network
Authors: Wenhong Wei, Wenjun Xiao, Yong Qin
Venue: International Journal of Distributed Sensor Networks (2009)

In this paper, we propose a new product network using a Cartesian product of hypercube and Kautz network, named as hyper-Kautz network. The proposed network possesses the properties of both hypercube and the Kautz network including logarithmic diameter, optimal connectivity, and simple routing algorithms.
Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces
Authors: Zhe Chen, Haiqiao Huang, Kequan Zhao
Venue: Computers Mathematics with Applications (2009)

In this paper, we consider a convex vector optimization problem of finding weak Pareto optimal solutions for an extended vector-valued map from a uniformly convex and uniformly smooth Banach space to a real Banach space, with respect to the partial order induced by a closed, convex and pointed cone with a nonempty interior. We propose an inexact vector-valued proximal-type point algorithm based on a Lyapunov functional when the iterates are computed approximately and prove the sequence generated by the algorithm weakly converges to a weak Pareto optimal solution of the vector optimization problem under some mild conditions. Our results improve and generalize some known results.
Naturally graded quasi-filiform Leibniz algebras
Authors: L. M. Camacho, J. R. Gómez, A. J. González, B. A. Omirov
Venue: Journal of Symbolic Computation (2009)

The classification of naturally graded quasi-filiform Lie algebras is known; they have the characteristic sequence (n-2,1,1) where n is the dimension of the algebra. In the present paper we deal with naturally graded quasi-filiform non-Lie-Leibniz algebras which are described by the characteristic sequence or . The first case has been studied in [Camacho, L.M., Gómez, J.R., González, A.J., Omirov, B.A., 2006. Naturally graded 2-filiform Leibniz Algebra and its applications, preprint, MA1-04-XI06] and now, we complete the classification of naturally graded quasi-filiform Leibniz algebras. For this purpose we use the software Mathematica (the program used is explained in the last section).
Personal computer aided design tool for developing TTC communication equipments with cheap components from the electronic consumers market
Authors: Keving Kyeon-il Choi, Jean-Claude Llorens, Gérard Maral
Venue: Space Communications (1998)

As a means to embark scientific or experimental payloads in space, small satellites are of interest because of their low cost and short development time. In particular, the Telemetry, Tracking and Command (TTC) communication equipment can be designed so as to reuse cheap components from the electronic consumers market. However the selected components should prove reliable enough to offer the proper grade of service for space operation although they are not space qualified. This paper discusses a methodology for selecting the appropriate candidate components, presents a personal computer (PC) tool, developed for that purpose, and illustrates the methodology through examples.
NCSec: a national cyber security referential for the development of a code of practice in national cyber security management
Authors: Mohamed Dafir Ech-cherif el Kettani, Taieb Debbagh
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Governments worldwide have faced computer security challenges. These challenges are serious in a context where there is an absence of appropriate organizational and institutional structures to deal with incidents. But more important which agency or agencies should be given the responsibility for computer security, is the point that some national leadership should be designated to ensure that computer security will receive government-wide attention. Therefore, sectors and lead agencies should assess the reliability, vulnerability, and threat environments of the infrastructures and employ appropriate protective measures and responses to safeguard them. The ITU has already proposed a whole process for developing and implementing a national Cyber security plan [1]. This process requires a comprehensive strategy that includes an initial broad review of the adequacy of current national practices, and consideration of the role of all stakeholders. This paper proposes a global framework answering the former needs expressed by the ITU. It is intended to present &laquo; ncsec &raquo;, the &laquo; National Cyber security Referential &raquo;, which is a guide for the development of &laquo; National Cyber security standards and effective Cyber security Management &raquo; for the creation of National Organizational Structures and Policies on Cybercrime at the national level, in order to help building regional and international cooperation for watch, warning, and incident response. We can notice a great relationship between our proposal and ISO27002 standard.
How to make biological systems compute: simply observe them
Authors: Peter Leupold
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

We survey work on the paradigm called computing by observing. This is a formal model of the way many biochemical experiments are conducted, where an external observer protocols the evolution of a system in a test tube or some other limited environment. So this observer, which is not acting on the input, produces the output. In this the paradigm contrasts strongly to many formal models of bio-computation that follow the classical input/output paradigm from computer science. In the presentation we put a special focus on the identification of key features that make systems especially suitable for serving as the basis of a computer in the computing by observing architecture. It turns out that context-sensitivity can be simulated well by simpler mechanisms, while unboundedly reusable workspace plays a key role.
Social Engineering: Hacking the Wetware!
Authors: Scott D. Applegate,  Major
Venue: Information Security Journal: A Global Perspective (2009)

Social engineering is a methodology that allows an attacker to bypass technical controls by attacking the human element in an organization. There are many techniques commonly used in social engineering including but not limited to Trojan and phishing email messages, impersonation, persuasion, bribery, shoulder surfing, and dumpster diving. Hackers rely on social engineering attacks to bypass technical controls by focusing on the human factors. Social engineers often exploit the natural tendency people have toward trusting others who seem likeable or credible, deferring to authority or need to acquiesce to social conformity. Mitigation of social engineering begins with good policy and awareness training, but there are a number of other approaches an organization can take to defend against this type of an attack. Social engineering attacks are likely to increase, and it is becoming increasingly important for organizations to address this issue.
Proving of the Non-recursive Algorithm for 4-Peg Hanoi Tower
Authors: Jun Wang, Hong-fa Wang, Guo-ying Yue, Nan Xie, Sukui Lu
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

A non-recursive algorithm for 4-Peg Hanoi Tower has been proposed in my previous paper without any logical and mathematical proof. So in this paper, the algorithm is verified in a rigorous and systematic way according to array theories mainly. That elements are arranged in an upper triangular array is proved to be scientific, iteration path based on the cross correlation is proved to be a shortcut to solve the problem, and the minimum iteration is proved to be on more than R(n) for a 4-peg problem with n disks. Therefore, the non-recursive algorithm has been proved to be more superior to traditional recursive algorithm theoretically.
E-learning with protensional agents: playing guitar
Authors: Emil M. Popa, Alexandru V. Georgescu, Boldur E. Barbat
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The target of easing the paradigm shift required by modern IT is split into four objectives: a) Showing that "computing with x" is unavoidable in modern artificial intelligence. b) Substantiating this claim in a relevant and uncontroversial domain: e-Learning. c) Illustrating it for "x = sounds", via a challenging agent-oriented application: interpreting protensity-based messages. d) Presenting the experimental model of a virtual guitar teacher. Focus is on paradigmatic changes as regards: time (from Newtonian time to "thick time"), logic (from determinism and bivalence to uncertainty and vagueness) and (e-)learning (from conventional pedagogy to maieutic andragogy, or even heutagogy). The paper stresses the unabated need of mathematics in the new paradigm (e.g., Dirac-like functions to model Husserlian time), the reasons to investigate protensity in relation to Computer-Aided Semiosis, and the new non-algorithmic features of virtual teaching (exemplified by playing guitar). Among the conclusions: the approach to and the implementation of the experimental model are relevant to agent-oriented software engineering non-numeric computing and to the urgency of paradigm shifting.
A view selection algorithm with performance guarantee
Authors: Nicolas Hanusse, Sofian Maabout, Radu Tofan
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually measured by three criteria: (1) the amount of memory to store the selected views, (2) the query response time and (3) the time complexity of this algorithm. The two first measurements deal with the output of the algorithm. No existing solutions give good trade-off between amount of memory and queries cost with a small time complexity. We propose in this paper an algorithm guaranteeing a constant approximation factor of queries response time with respect to the optimal solution. Moreover, the time complexity for a D-dimensional fact table is O (D * 2D) corresponding to the fastest known algorithm. We provide an experimental comparison with two other well known algorithms showing that our approach also gives good performance in terms of memory.
A Modified Color Appearance Model of CIELAB
Authors: Quan Zhang, Zhenyu Gu, Xinguo Ming
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

A new controllable color appearance model (CAM) called QLAB is presented based on CIELAB. QLAB is derived from the perceptually uniform CIELAB color model, and is provided with perceptual representation way extracted from HSB color model. The QLAB offers a regular form and perceptual uniformity color model to designers. The process and methods of constructing QLAB is described, and two application cases are discussed at last. The test results show that QLAB is more controllable and practical than general CAMs. A new controllable color appearance model (CAM) called QLAB is presented based on CIELAB. QLAB is derived from the perceptually uniform CIELAB color model, and is provided with perceptual representation way extracted from HSB color model. The QLAB offers a regular form and perceptual uniformity color model to designers. The process and methods of constructing QLAB is described, and two application cases are discussed at last. The test results show that QLAB is more controllable and practical than general CAMs.
Forbidden induced bipartite graphs
Authors: Peter Allen
Venue: Journal of Graph Theory (2009)

Given a fixed bipartite graph H, we study the asymptotic speed of growth of the number of bipartite graphs on n vertices which do not contain an induced copy of H. Whenever H contains either a cycle or the bipartite complement of a cycle, the speed of growth is ${{2}}^{\Omega({{n}}^{{{{6}}\over {{5}}}})}$. For every other bipartite graph except the path on seven vertices, we are able to find both upper and lower bounds of the form ${{n}}^{{{cn}}+{{o}}({{n}})}$. In many cases we are able to determine the correct value of c. &copy; 2008 Wiley Periodicals, Inc. J Graph Theory 60: 219&ndash;241, 2009
Random Fault Attack against Shrinking Generator
Authors: Marcin Gomułkiewicz, Mirosław Kutyłowski, Paweł Wlaź
Venue: Algorithmic Aspects of Wireless Sensor Networks: Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers (2008)

We concern security of shrinking generator against fault attacks. While this pseudorandom bitstream generator is cryptographically strong and well suited for hardware implementations, especially for cheap artefacts, we show that using it for the devices that are not fault resistant is risky. That is, even if a device concerned is tamper-proof, generating random faults and analyzing the results may reveal secret keys stored inside the device.For the attack we flip a random bit and observe propagation of errors. The attack uses peculiar properties of the shrinking generator and presents a new kind of threats for designs based on combining weaker generators. In particular, it indicates that potentially all designs based on combining LFSR generators might be practically weak due to slow propagation of errors in a single LFSR.