ppxscal/embedding_network huggingface dataset:
Fritzing: a tool for advancing electronic prototyping for designers
Authors: André Knörig, Reto Wettach, Jonathan Cohen
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Today a growing community of DIY-practitioners, artists and designers are using microcontroller-based toolkits to express their concepts for digital artifacts by building them. However, as these prototypes are generally constructed using solder-free technologies, they are often fragile and unreliable. This means a huge burden of care and upkeep for these inventions when they are either exhibited or sold. We present a software application called Fritzing which allows artists, designers and DIY-tinkerers to prepare their hardware inventions for production. Through an interface metaphor based on the typical workflow of the target group, Fritzing has proven its ability to provide useful support in the steps following the invention of an interactive artifact. Fritzing serves also as a tool for documenting these interactive artifacts. As sharing of knowledge has been a driving force within this new DIY-movement, there is a need for a consistent and readable form of documentation which Fritzing can provide. Fritzing has also proven to be a useful tool in teaching electronics to people without an engineering background.
A nonparametric predictive alternative to the Imprecise Dirichlet Model: The case of a known number of categories
Authors: F. P. A. Coolen, T. Augustin
Venue: International Journal of Approximate Reasoning (2009)

Nonparametric predictive inference (NPI) is a general methodology to learn from data in the absence of prior knowledge and without adding unjustified assumptions. This paper develops NPI for multinomial data when the total number of possible categories for the data is known. We present the upper and lower probabilities for events involving the next observation and several of their properties. We also comment on differences between this NPI approach and corresponding inferences based on Walley's Imprecise Dirichlet Model.
An adaptive wideband antenna array receiver of low complexity
Authors: Ning Xie, Yuanping Zhou
Venue: Wireless Communications Mobile Computing (2009)

A low complexity wideband antenna array receiver is proposed for wideband wireless communication systems. With the proposed algorithm, the array beampattern remains almost the same within a wide frequency range of interest. In comparison to the conventional algorithm, the new algorithm offers a faster convergence rate with a lower computational complexity. Simulation results are presented to demonstrate the proposed algorithm. Copyright &copy; 2008 John Wiley & Sons, Ltd.
To Game or Not to Game?
Authors: Christiane Gresse von Wangenheim, Forrest Shull
Venue: IEEE Software (2009)

Effective teaching of software engineering is a challenging endeavor, and some researchers have suggested alternative teaching methods to help. This column looks at the empirical evidence for one such method, game-based learning, and reports on a literature review that looked at what games are available as well as the degree to which their efficacy has been studied. The 21 studies that were reviewed contained mixed results about the games' pedagogic effectiveness, but in general, results showed that games can provide effective learning, mainly to reinforce knowledge. More detailed results were also reviewed concerning the games' results on other metrics, as well as conclusions about how such games could be best designed.
SiteLens: situated visualization techniques for urban site visits
Authors: Sean White, Steven Feiner
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Urban designers and urban planners often conduct site visits prior to a design activity to search for patterns or better understand existing conditions. We introduce SiteLens, an experimental system and set of techniques for supporting site visits by visualizing relevant virtual data directly in the context of the physical site, which we call situated visualization. We address alternative visualization representations and techniques for data collection, curation, discovery, comparison, manipulation, and provenance. A real use scenario is presented and two iterations of evaluation with faculty and students from the Columbia University Graduate School of Architecture, Planning and Preservation provide directions and insight for further investigation.
Integrated cognitive architectures: a survey
Authors: Hui-Qing Chong, Ah-Hwee Tan, Gee-Wah Ng
Venue: Artificial Intelligence Review (2007)

This article aims to present an account of the state of the art research in the field of integrated cognitive architectures by providing a review of six cognitive architectures, namely Soar, ACT-R, ICARUS, BDI, the subsumption architecture and CLARION. We conduct a detailed functional comparison by looking at a wide range of cognitive components, including perception, memory, goal representation, planning, problem solving, reasoning, learning, and relevance to neurobiology. In addition, we study the range of benchmarks and applications that these architectures have been applied to. Although no single cognitive architecture has provided a full solution with the level of human intelligence, important design principles have emerged, pointing to promising directions towards generic and scalable architectures with close analogy to human brains.
Adding nesting structure to words
Authors: Rajeev Alur, P. Madhusudan
Venue: Journal of the ACM (JACM) (2009)

We propose the model of nested words for representation of data with both a linear ordering and a hierarchically nested matching of items. Examples of data with such dual linear-hierarchical structure include executions of structured programs, annotated linguistic data, and HTML/XML documents. Nested words generalize both words and ordered trees, and allow both word and tree operations. We define nested word automata&mdash;finite-state acceptors for nested words, and show that the resulting class of regular languages of nested words has all the appealing theoretical properties that the classical regular word languages enjoys: deterministic nested word automata are as expressive as their nondeterministic counterparts; the class is closed under union, intersection, complementation, concatenation, Kleene-&ast;, prefixes, and language homomorphisms; membership, emptiness, language inclusion, and language equivalence are all decidable; and definability in monadic second order logic corresponds exactly to finite-state recognizability. We also consider regular languages of infinite nested words and show that the closure properties, MSO-characterization, and decidability of decision problems carry over. The linear encodings of nested words give the class of visibly pushdown languages of words, and this class lies between balanced languages and deterministic context-free languages. We argue that for algorithmic verification of structured programs, instead of viewing the program as a context-free language over words, one should view it as a regular language of nested words (or equivalently, a visibly pushdown language), and this would allow model checking of many properties (such as stack inspection, pre-post conditions) that are not expressible in existing specification logics. We also study the relationship between ordered trees and nested words, and the corresponding automata: while the analysis complexity of nested word automata is the same as that of classical tree automata, they combine both bottom-up and top-down traversals, and enjoy expressiveness and succinctness benefits over tree automata.
Engineering an Incremental ASP Solver
Authors: Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub, Sven Thiele
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Many real-world applications, like planning or model checking, comprise a parameter reflecting the size of a solution. In a propositional formalism like Answer Set Programming (ASP), such problems can only be dealt with in a bounded way, considering one problem instance after another by gradually increasing the bound on the solution size. We thus propose an incremental approach to both grounding and solving in ASP. Our goal is to avoid redundancy by gradually processing the extensions to a problem rather than repeatedly re-processing the entire (extended) problem. We start by furnishing a formal framework capturing our incremental approach in terms of module theory. In turn, we take advantage of this framework for guiding the successive treatment of program slices during grounding and solving. Finally, we describe the first integrated incremental ASP system, iclingo, and provide an experimental evaluation.
Foundation software: a significantly improved approach to the development of large application systems
Authors: Gary A. Curtis
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The American Management Systems (AMS) approach to the technical framework of large applications systems is based on a concept we call foundation software, an integrated environment of standard packages and custom modules that provides common services to the development and operation of applications software. This environment provides a standardized, structured, and simplified view of the outside world to applications software. Use of foundation software dramatically improves the economics of development, operation, and maintenance of large systems and reduces the risk of developing such systems. In this paper, the foundation software approach is defined and illustrated, with particular emphasis on the relationship of foundation software to the overall architecture of large-scale systems and the impact of foundation software on the application-system development life cycle.
MEGORE: Multimedia Enhanced Goal-Oriented Requirement Elicitation Experience in China
Authors: Yuhui Shan, Lin Liu, Fei Peng
Venue: Proceedings of the 2008 Third International Workshop on Multimedia and Enjoyable Requirements Engineering - Beyond Mere Descriptions and with More Fun and Games (2008)

Based on the survey results of Chinese requirements engineering practices, this paper reports a few general patterns of Chinese-culture-related ways of thinking and their influence to requirements elicitation activities. A multimedia enhanced goal oriented requirement elicitation method is proposed, in which media measures are used to help capture user requirements and preferences more easily. The method is applied in the design of an Electronic Marine Chart Navigation System. Some lessons are summarized. We argue that a media-enhanced approach can help improve the efficiency of requirement elicitation process. Keyword: Media-Goal integration, Multimedia enhanced goal oriented requirement elicitation, MEGORE
Enterprise Knowledge Agents: Agent-Based Discovery of Like-Minded Individuals
Authors: Joshua Church, Ruhollah Farchtchi
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Agent-based computing environments provide the capability to establish an enterprise of autonomous agents that collaborate and share information on common interests. Discovery of new data can alert users to changes in the information environment of importance to them. The goal of this research is to define an agent environment that models an organization's tacit knowledge. This document proposes a process to find named entities in the content of documents and to derive context from a user community. The EKA system ingests RSS feeds of data sources that are representative of separate users, extracts entities from the text, and provides context on each entity using related tags. Knowledge representations of the news feeds are created, managed, and reasoned over by a collection of agents. Agents will respond to pre-registered topics and provide notifications when those topics have been identified. The purpose here is to illustrate that an agent can serve as a broker of knowledge and assist users in identifying like-minded individuals through an analysis of the data the user is working with and initiate collaboration.
A Polynomial-Time Algorithm to Approximate the Mixed Volume within a Simply Exponential Factor
Authors: Leonid Gurvits
Venue: Discrete Computational Geometry (2009)

Let K=(K 1,&#x2026;,K n ) be an n-tuple of convex compact subsets in the Euclidean space R n , and let V(&#x22c5;) be the Euclidean volume in R n . The Minkowski polynomial V K is defined as V K (&#x03bb; 1,&#x2026;,&#x03bb; n )=V(&#x03bb; 1 K 1+&#x22c5;&#x22c5;&#x22c5;+&#x03bb; n K n ) and the mixed volume V(K 1,&#x2026;,K n ) as $$V(K_{1},\ldots,K_{n})=\frac{\partial^{n}}{\partial\lambda_{1}\cdots\partial \lambda_{n}}V_{\mathbf{K}}(\lambda_{1},\ldots,\lambda_{n}).$$ Our main result is a poly-time algorithm which approximates V(K 1,&#x2026;,K n ) with multiplicative error e n and with better rates if the affine dimensions of most of the sets K i are small. Our approach is based on a particular approximation of log&#x2009;(V(K 1,&#x2026;,K n )) by a solution of some convex minimization problem. We prove the mixed volume analogues of the Van der Waerden and Schrijver&#x2013;Valiant conjectures on the permanent. These results, interesting on their own, allow us to justify the abovementioned approximation by a convex minimization, which is solved using the ellipsoid method and a randomized poly-time time algorithm for the approximation of the volume of a convex set.
Learning-enhanced adaptive DSS: a Design Science perspective
Authors: Selwyn Piramuthu, Michael J. Shaw
Venue: Information Technology and Management (2009)

The process of acquiring, maintaining, updating, and using appropriate domain-specific knowledge has played an integral role in knowledge-based decision support systems. Although each of these stages is necessary and important, knowledge-based systems that operate in dynamic environments can become quickly stale when core knowledge embedded in these systems are not continually updated to reflect changes in the system over time. Clearly, stale knowledge could be faulty and cannot be relied upon for making decisions and a knowledge-based decision support system with stale knowledge may even be detrimental in the long run. We consider a generic adaptive DSS framework with learning capabilities that continually monitors itself for possible deficit in the knowledge-base, expired or stale knowledge already present in the knowledge-base, and availability of new knowledge from the environment. The knowledge-base is updated through incremental learning. We illustrate the generic knowledge-based adaptive DSS framework using examples from three different application areas. The framework is flexible in being able to be modified or extended to accommodate the idiosyncrasies of the application of interest. The framework considered is an example artifact that naturally satisfies the Design Science perspective.
Robust and Efficient Aggregation using Multi-nodes Cooperation in Wireless Sensor Networks
Authors: Zhendong Wu, Xiaojun Wang, Fang Zhu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In-network aggregation, an important scheme for wireless sensor network, could save energy and bandwidth of the networks. But the unreliability of wireless links will weaken the performance of in-network aggregation deeply. In this paper, a novel in-network aggregation strategy using multi-nodes cooperation is studied. The key idea of the proposed strategy is that multi nodes aggregate data simultaneously and relay data competitively. It is based on the observation that the broadcast nature of wireless sensor networks has its potential that allows all neighbors receive and process packets simultaneously. Theoretical and experimental analysis demonstrates that the new strategy can provide robust and efficient data-aggregation over unreliable links, and meanwhile it improves the performance of wireless sensor networks significantly.
On an Open Problem of C. C. Chen
Authors: Kunlun Zhang, Dong-Hai Li
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

This paper investigates the length of sublattice-lattice of finite distributive lattice. The following result is proved. For finite distributive lattices L and K$, then l_*(Sub(L\times K)) = l_*(Sub(L)) + l_*(Sub(K)). Therefore, we have solved the Problem 1 of C.C.Chen in [1].
IPC Control for Multiple Real-Time Threads on an In-Order SMT Processor
Authors: Jörg Mische, Sascha Uhrig, Florian Kluge, Theo Ungerer
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

This paper proposes an architecture for concurrent scheduling of hard, soft and non real-time threads in embedded systems. It is based on a superscalar in-order processor binary compatible to the Infineon TriCore. The architecture allows a tight static WCET analysis of hard real-time threads. To provide high performance anyway, the absence of speculative elements like branch prediction and out-of-order execution is compensated by multithreading, transforming the processor into an in-order SMT processor.The Priority Controller that manages the scheduling is able (1) to assign fixed portions of time to hard real-time threads, (2) to control the IPC of soft real-time threads and (3) to fairly distribute execution cycles to non real-time threads. It is located within a separate unit outside the pipeline to avoid prolonging the critical path.We evaluate the processor using the EEMBC automotive benchmarks and show that the overlapping of two soft real-time threads can be used to either reduce the clock rate by 23% or to grant each thread 65% of its single-threaded IPC. Even if a hard real-time thread is executed predominantly, the remaining resources can be used by concurrent soft real-time threads which reach a performance of 70% compared to their single-threaded execution.
An uncanny game of trust: social trustworthiness of robots inferred from subtle anthropomorphic facial cues
Authors: Maya B. Mathur, David B. Reichling
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Modern android robots have begun to penetrate the social realm of humans. This study quantitatively probed the impact of anthropomorphic robot appearance on human social interpretation of robot facial expression. The Uncanny Valley"theory describing the disturbing effect of imperfect human likenesses has been a dominant influence in discussions of human-robot social interaction, but measuring its effect on human social interactions with robots has been problematic. The present study addresses this issue by examining social responses of human participants to a series of digitally composed pictures of realistic robot faces that span a range from mechanical to human in appearance. Our first experiment provides evidence that an Uncanny Valley effect on social attractiveness is indeed a practical concern in the design of robots meant to interact socially with the lay public. In the second experiment, we employed game-theory research methods to measure the effect of subtle facial expressions in robots on human judgments of their trustworthiness as social counterparts. Our application of game-theory research methods to the study of human-robot interactions provides a model for such empirical measurement of human's social responses to android robots.
An Iterative Numerical Algorithm for a Strongly Coupled System of Singularly Perturbed Convection-Diffusion Problems
Authors: E. O'Riordan, J. Stynes, M. Stynes
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

An iterative numerical method is constructed for a coupled system of singularly perturbed convection-diffusion-reaction two-point boundary value problems. It combines a standard finite difference operator with a piecewise-uniform Shishkin mesh, and uses a Jacobi-type iteration to compute a solution. Under certain assumptions on the coefficients in the differential equations, a bound on the maximum-norm error in the computed solution is established; this bound is independent of the values of the singular perturbation parameter. Numerical results are presented to illustrate the performance of the numerical method.
Scheduling non-uniform data with expected-time constraint in wireless multi-channel environments
Authors: Yu-Chi Chung, Lanturn Lin, Chiang Lee
Venue: Journal of Parallel and Distributed Computing (2009)

This paper investigates the time-constrained data scheduling problem for broadcasting data of non-uniform length under multiple broadcast channel environments. We first define and analyze the problem of time-constrained services and then propose an effective scheduling algorithm that constructs a broadcast program to satisfy as many clients' requirements within the expected times as possible. The performance study reveals the superiority of the proposed method.
Query optimization using restructured views: Theory and experiments
Authors: Dongfeng Chen, Rada Chirkova, Fereidoon Sadri
Venue: Information Systems (2009)

We study optimization of relational queries using materialized views, where views may be regular or restructured. In a restructured view, some data from the base table(s) are represented as metadata-that is, schema information, such as table and attribute names-or vice versa. Using restructured views in query optimization opens up a new spectrum of views that were not previously available, and can result in significant additional savings in query-evaluation costs. These savings can be obtained due to a significantly larger set of views to choose from, and may involve reduced table sizes, elimination of self-joins, clustering produced by restructuring, and horizontal partitioning. In this paper we propose a general query-optimization framework that treats regular and restructured views in a uniform manner and is applicable to SQL select-project-join queries and views without or with aggregation. Within the framework we provide (1) algorithms to determine when a view (regular or restructured) is usable in answering a query and (2) algorithms to rewrite queries using usable views. Semantic information, such as knowledge of the key of a view, can be used to further optimize a rewritten query. Within our general query-optimization framework, we develop techniques for determining the key of a (regular or restructured) view, and show how this information can be used to further optimize a rewritten query. It is straightforward to integrate all our algorithms and techniques into standard query-optimization algorithms. Our extensive experimental results illustrate how using restructured views (in addition to regular views) in query optimization can result in a significant reduction in query-processing costs compared to a system that uses only regular views.