ppxscal/embedding_network huggingface dataset:
Tea table, come closer to me
Authors: Vikas Reddy Enti, Rajesh Arumugam, Krishnamoorthy Baskaran, Bingbing Liu, Foo Kong Foong, Appadorai Senthil Kumar, Dee Meng Kang, Xiaojun Wu, Wai Kit Goh
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

We present a new concept (named DA vinCi) of distributed agents, sensor networks and an intelligent server catered to the home environment. Instead of a single multi-tasking human-like robot, we propose a team of networked task-specific robotic agents that interface with each other and the environment through a spatial map built by the server. We also highlight how our server will be a proxy for all the human-robot interactions (HRI) in the system and discuss the challenges involved. The paper's title captures the jist of our system where even a tea table can be inexpensively mobilized and interacted with via the DA vinCi architecture.
Essential programming concepts: the redesign of the introductory programming course
Authors: Amardeep Kahlon, Larry Lee
Venue: Journal of Computing Sciences in Colleges (2009)

Enrollments in Computer Science programs have dropped sharply since 2001 at all levels of higher education throughout the nation. The presenters will discuss roadblocks to student success and interest in Computer Science. The discussion will include the innovative techniques and strategies they have employed at their respective colleges to succeed in the face of this challenging trend and demonstrate a tutorial developed to support this initiative."
Information Extraction, Search, Interaction and Collaboration on the Web in Mexico
Authors: J. Alfredo Sánchez, Edgar Chávez, Manuel Montes
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

Web research in Mexico has been addressing issues related mainly to search mechanisms, information extraction, and mediating user interaction and group collaboration. In this paper we provide an overview of representative projects in the area and present a sample of recent advances by research groups in Mexican institutions. These include initiatives aimed to exploring extraction techniques that regard the web as a corpus, indexing and categorizing multimedia web contents, and designing user interfaces for visualizing web-accessible collections as well as environments for synchronous and asynchronous web collaboration.
Red Rabbit
Authors: Egmont Mayer
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

A man lives alone in a small apartment. The limited contact he had with other people has dropped to zero since the rabbit appeared. Every attempt to get the rabbit out of his apartment has failed, and since he is not sure whether or not pets are allowed in the building, he does not let anybody enter his apartment.
Evaluation of properties in the transition of capability based agent organization
Authors: Eric T. Matson, Scott A. Deloach, Raj Bhatnagar
Venue: Web Intelligence and Agent Systems (2009)

It has been said that the only constant in life is change. This rule can also be directly applied to the lives of organizations. Any organization of non-trivial size, scope, life expectancy or function, is destined to change. An organization without the ability to transition is not robust, evolvable or adaptable within its environment. These basic preconditions to human organizations must also hold in viable agent organizations. To model an adaptable agent organization, the capability must be present to transition from one state to the next over the life of the organization. The organization model must include not only the structural objects, but also the ability to facilitate change. The ability to change empowers the organization to transition from one state to the next, over its useful life. To enable transition, we must formally capture and define what triggers an organization transition. In this paper, we will define the properties to formally model the ability of an adaptable organization to transition throughout its useful life. The properties will be instantiated, using an implemented system, allowing the evaluation of internal and external stimuli to cause transition to the organization. These transitions will be evaluated from several perspectives to determine their effectivity on basis of design and use.
Structural and magnetic study of hard-soft systems with ZnO barrier grown by pulsed laser deposition
Authors: H. Bieber, G. Versini, S. Barre, J. -L. Loison, G. Schmerber, C. Ulhaq-Bouillet, S. Colis, A. Dinia
Venue: Microelectronics Journal (2009)

Hard-soft systems with magnetic transition metal electrodes and ZnO barrier of variable thickness have been epitaxially grown by pulsed laser deposition on MgO(100) substrates. The structural reflection high-energy electron diffraction (RHEED) and X-ray diffraction (XRD) analysis have shown an epitaxial growth of the CoFe"2 bottom electrode, the permalloy top electrode and of the ZnO barrier. Magnetic measurements have shown a clear plateau with a separate reversal of both magnetizations of the top and bottom electrodes, which is promising for further tunnel magnetoresistance measurements. A ferromagnetic coupling between the magnetic electrodes through the barrier has been observed.
Modeling the effect of node synchronization times in ultra-wideband wireless networks
Authors: Christopher S. Taggart, Yannis Viniotis, Mihail L. Sichitiu
Venue: Performance Evaluation (2009)

Ultra-wideband wireless (UWB) can provide the physical layer for high-throughput personal area networks. When UWB is used for communication between many nodes, relatively long acquisition times are needed when dropping and re-establishing wireless links between the nodes. This paper describes the development and use of mathematical and simulation models to investigate the impact of dropping and reacquiring links between nodes on average packet delay; we also consider the performance of the alternative strategy of forwarding packets through intermediate nodes without breaking the established wireless links. The work presented here assumes that no specific MAC layer protocol, such as WiMedia UWB MAC, is in operation. The paper describes the models, explains the selection of modeling parameters used, compares the average packet delay for a network of three simple UWB nodes and for a ring of ten UWB nodes and explains the use of these results for network design engineers.
A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
Authors: Fan Chung
Venue: Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph (2009)

We give an improved local partitioning algorithm using heat kernel pagerank, a modified version of PageRank. For a subset S with Cheeger ratio (or conductance) h, we show that there are at least a quarter of the vertices in S that can serve as seeds for heat kernel pagerank which lead to local cuts with Cheeger ratio at most $O(\sqrt{h})$, improving the previously bound by a factor of $\sqrt{log|S|}$.
ARMO: Augmented Reality based Reconfigurable MOck-up
Authors: Yoon-suk Jin, Yang-wook Kim, Jun Park
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

Rapid prototyping allows for evaluation of design product in a short period of time. Designers or CEOs may perceive the size and appearance of the product by touching the automatically constructed physical objects produced through rapid prototyping. In this paper, we introduce `Augmented Reality based Reconfigurable Mock-up', which enables interactive changes of shapes of products as well as colors, textures, and user interfaces. The shapes of the physical objects are reconfigurable by assembling different parts to the main body of the mock-up. Augmented Reality technologies were used to alter the appearance of the mock-up by rendering the 3D models, colors, and interfaces accordingly. Developed AR-based reconfigurable mock-up is expected to be used for realistic design evaluation and CEO presentations.
Multi-traffic capable DSLAM design
Authors: Gabriel Stoian, Mircea Preda
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

The multiple revenue possibilities provided by the IP based networks stimulate the Internet Service Providers and Telecom Providers to move to ADSL Transport Networks that are entirely IP based. Ethernet/PPP traffic is also attractive because it provides authentication, security and accounting features. These types of traffic can become a common presence in ADSL networks by devising DSLAMs that are able to extract the IP and Ethernet traffic inside the DSLAM itself. The paper propose a DSLAM architecture that can accomodate a large range of deployments and uses advanced learning techniques to optimize its performances. A prototype of this architecture was implemented on a platform based on Intel IXP 2350 network processor and the obtained test results shows that the architecture is ready for a production implementation.
Mixed-Signal Approximate Computation: A Neural Predictor Case Study
Authors: Renée St. Amant, Daniel A. Jiménez, Doug Burger
Venue: IEEE Micro (2009)

As transistors shrink and processors trend toward low power, maintaining precise digital behavior grows more expensive. Replacing digital units with analog equivalents sometimes allows similar computation to be performed at higher speed using less power. As a case study in mixed-signal approximate computation, the authors describe an enhanced neural prediction algorithm and its efficient analog implementation.
Adjust ELF Format for Multi-core Architecture
Authors: Wei Hu, Tianzhou Chen, Nan Zhang, Jijun Ma
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

There are two problems emerged while multi-core platform become popular in daily life, no matter for high end or low end. The first is how to fully utilize computing resource of these cores without requirement of large modifications of current software design model. The second is about dividing a piece of serial program into parallel program. However, the latter is the responsibility of compiler, which involves complex analysis of logical relationship and data dependency hidden in source code. Assuming a powerful compiler, we propose a new ELF format with multiple text sections each of which corresponds to a piece of logically separated code that could be loaded into a single thread. Similar research has been done on this, but they need a compiler with multiple thread library support which may lead to an overstaffed compiler. We assign this work to program loader and thus reduce design complexity of compiler.
Money Policy in Dynamic Stochastic General Equilibrium Models
Authors: Yang Liu, Li Li
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Abstract: By using the quarterly data of 1996-2005 in China, we use a dynamic stochastic general equilibrium modeling framework to compare the different design of monetary policy: an interest rate feedback rule and a money growth rule. Drawing on our econometric analysis, we argue that model, closed with interest rate feedback rule comes closer to the data. The paper also suggests to incorporate the sticky price property and fiscal policy to explain the economy better.
Automatically Determining the Number of Clusters in Unlabeled Data Sets
Authors: Liang Wang, Christopher Leckie, Kotagiri Ramamohanarao, James Bezdek
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

Clustering is a popular tool for exploratory data analysis. One of the major problems in cluster analysis is the determination of the number of clusters in unlabeled data, which is a basic input for most clustering algorithms. In this paper we investigate a new method called DBE (Dark Block Extraction) for automatically estimating the number of clusters in unlabeled data sets, which is based on an existing algorithm for Visual Assessment of cluster Tendency (VAT) of a data set, using several common image and signal processing techniques. Basic steps include: 1) Generating a VAT image of an input dissimilarity matrix; 2) Performing image segmentation on the VAT image to obtain a binary image, followed by directional morphological filtering; 3) Applying a distance transform to the filtered binary image and projecting the pixel values onto the main diagonal axis of the image to form a projection signal; 4) Smoothing the projection signal, computing its first-order derivative, and then detecting major peaks and valleys in the resulting signal to decide the number of clusters. Our new DBE method is nearly "automatic", depending on just one easy-to-set parameter. Several numerical and real-world examples are presented to illustrate the effectiveness of DBE.
A Tableau Decision Procedure for ALC With Monotonic Modal Operators and Constant Domains
Authors: İnanç Seylan, Rıza Cenk Erdur
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Modal description logics provide a more expressive framework than their propositional counterparts by allowing one to define the individuals and concepts of a particular application domain. In the literature, tableau decision algorithms have been given for various normal modal and temporal description logics. There is however a trend towards the use of coalition logics in the intelligent agents community. Coalition logics are extensions of the basic monotonic modal logic M which is a non-normal modal logic. This paper presents a tableau decision procedure for the formula satisfiability problem of the constant domain variant of M"A"L"C, i.e., ALC extended with modal operators from M that can be applied both to formulas and concepts. The presented algorithm can be used as the basis of a tableau decision procedure for coalition description logic.
Noncommutative algebra, multiple harmonic sums and applications in discrete probability
Authors: Christian Costermans, Hoang Ngoc Minh
Venue: Journal of Symbolic Computation (2009)

After having recalled some important results about combinatorics on words, like the existence of a basis for the shuffle algebras, we apply them to some special functions, the polylogarithmsLi"s(z) and to special numbers, the multiple harmonic sumsH"s(N). In the ''good'' cases, both objects converge (respectively, as z->1 and as N->+~) to the same limit, the polyzeta@z(s). For the divergent cases, using the technologies of noncommutative generating series, we establish, by techniques ''a la Hopf'', a theorem ''a l'Abel'', involving the generating series of polyzetas. This theorem enables one to give an explicit form to generalized Euler constants associated with the divergent harmonic sums, and therefore, to get a very efficient algorithm to compute the asymptotic expansion of any H"s(N) as N->+~. Finally, we explore some applications of harmonic sums throughout the domain of discrete probabilities, for which our approach gives rise to exact computations, which can be then easily asymptotically evaluated.
Convergent improvement of SSOR multisplitting method for an H-matrix
Authors: Li-Tao Zhang, Ting-Zhu Huang, Tong-Xiang Gu, Xin-Lan Guo, Jiang-Hua Yue
Venue: Journal of Computational and Applied Mathematics (2009)

Recently, Yun [Jae Heon Yun, Convergence of SSOR multisplitting method for an H-matrix, J. Comput. Appl. Math. 217 (2008) 252-258] studied the convergence of the relaxed multisplitting method associated with SSOR multisplitting for solving a linear system whose coefficient matrix is an H-matrix. In this paper, we improve the main results of Yun's. Moreover, theoretical analysis and numerical examples clearly show that our new convergent domain is wider.
Non-malleable Obfuscation
Authors: Ran Canetti, Mayank Varia
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfuscated) program that is related to the original one in some way.We formulate two natural flavors of non-malleability requirements for program obfuscation, and show that they are incomparable in general. We also construct non-malleable obfuscators of both flavors for some program families of interest. Some of our constructions are in the Random Oracle model, whereas another one is in the common reference string model. We also define the notion of verifiable obfuscation which is of independent interest.
An Effort to Develop a Tagged Lexical Resource for Sanskrit
Authors: S. Varakhedi, V. Jaddipal, V. Sheeba
Venue: Sanskrit Computational Linguistics: First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers (2009)

In this paper we present our efforts to design and develop a structured electronic lexical resource by tagging a Traditional Sanskrit dictionary. We narrate how the whole unstructured raw text of V¿caspatyam an encyclopedic type of Sanskrit Dictionary has been tagged to form a user friendly e-lexicon with structured and segregated information through corpus designing methods.
DX-compactor: distributed X-compaction for SoCs
Authors: Reshma C. Jumani, Niraj Bharatkumar Jain, Virendra Singh, Kewal K. Saluja
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

The emergence of System-on-Chip (SoC) devices has led to a complex on-chip interconnect structure that consumes significant area. Distributed compaction is a test response compaction scheme for an SoC that aims at reducing the area occupied for the purpose of testing the chip. This technique involves the design of compactors for individual cores on the chip. These are interconnected suitably to achieve the required functionality while reducing the area overhead by decreasing the length and the number of interconnects that are routed from scan chain outputs to the output pins. The distributed compaction technique matches the performance of an X-Compactor in terms of error detection and X-masking.
Some Contributions of Homotopic Deviation to the Theory of Matrix Pencils
Authors: Françoise Chatelin, Morad Ahmadnasab
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

Let be two given matrices, where rankE&thinsp;=&thinsp;r&thinsp;&le;&thinsp;n. The matrix E is written in the form (derived from SVD) E&thinsp;=&thinsp;UV H where have rank r&thinsp;&le;&thinsp;n. For 0&thinsp;< #8201;r&thinsp;< #8201;n, 0 is an eigenvalue of E with algebraic (resp. geometric) multiplicity m (g&thinsp;=&thinsp;n&thinsp;&minus;&thinsp;r&thinsp;&le;&thinsp;m). We consider the pencil P z (t)&thinsp;=&thinsp;(A&thinsp;&minus;&thinsp;zI)&thinsp;+&thinsp;t E, defined for which depends on the complex parameter . We analyze how its structure evolves as the parameter z varies, by means of conceptual tools borrowed from Homotopic Deviation theory [1,8]. The new feature is that, because t varies in , we can look at what happens in the limit when |t| &rarr;&thinsp;&infin;. This enables us to propose a remarkable connection between the algebraic theory of Weierstrass and the Cauchy analytic theory in as |t| &rarr;&thinsp;&infin;.
A new scalable distributed authentication for P2P network and its performance evaluation
Authors: Atushi Takeda, Debasish Chakraborty, Gen Kitagata, Kazuo Hashimoto, Norio Shiratori
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Recently P2P networks become more and more popular. Though they have many advantages, P2P networks suffer from authentication of nodes. To overcome this problem, a new authentication method called Hash-based Distributed Authentication Method (HDAM) is proposed. HDAM realizes a decentralized efficient mutual authentication mechanism for each pair of nodes in the P2P network. It performs a distributed management of public keys by using Web of Trust and Distributed Hash Table. Our proposed scheme significantly reduces both the memory size requirement and the overhead of communication data sent by the nodes. Additionally, the results also show that required resource size of HDAM is O(logN) and HDAM is more scalable than the conventional method.
Supporting content and process common ground in computer-supported teamwork
Authors: Gregorio Convertino, Helena M. Mentis, Mary Beth Rosson, Aleksandra Slavkovic, John M. Carroll
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We build on our prior work with computer-supported teams performing a complex decision-making task on maps, where the distinction between content and process common ground is proposed. In this paper we describe a distributed geo-collaboration software prototype. The system design rationale was gleaned from fieldwork, literature on team cognition, and an earlier lab study introducing a reference task with face-to-face teams. We report on a controlled experiment that evaluates this design rationale. Distinct sets of measures show that that the prototype supported both content and process common ground, offsetting the costs imposed by the distributed setting. We interpret the results in relation to prior work on common ground and draw implications for moving beyond current models of sharing and coordination.
Experimentally Testable State-Independent Violation of Bell-Type Inequalities for Quantum Contextuality
Authors: Adán Cabello
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

There are experimentally testable correlation Bell inequalities which are satisfied by any noncontextual theory but are violated by any quantum state. We discuss how to test one of them. 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
Adjacent channel interference in a macrocell-microcell WCDMA system
Authors: Wen-Tzu Chen
Venue: Wireless Communications Mobile Computing (2009)

This paper studies the impacts of adjacent channel interference (ACI) on uplink capacity in a multi-macrocell-multi-microcell wideband code-division multiple access (WCDMA) system. A method is presented for computing ACI and deriving capacity limitation. This method is based on an interference analysis that accounts for shadow fading, and random distribution of mobile users. The results indicate that both the base station (BS) separation and adjacent channel interference power ratio (ACIR) strongly affect system capacity reduction. The proposed method in this paper is useful for measuring the impacts of ACI on uplink capacity. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Related-key rectangle attack on 36 rounds of the XTEA block cipher
Authors: Jiqiang Lu
Venue: International Journal of Information Security (2009)

XTEA is a 64-round block cipher with a 64-bit block size and a 128-bit user key, which was designed as a short C program that would run safely on most computers. In this paper, we present a related-key rectangle attack on a series of inner 36 rounds of XTEA without making a weak key assumption, and a related-key rectangle attack on the first 36 rounds of XTEA under certain weak key assumptions. These are better than any previously published cryptanalytic results on XTEA in terms of the numbers of attacked rounds.