ppxscal/embedding_network huggingface dataset:
Simple, social, ethical and beautiful: requirements for UIs in the home
Authors: Andrew F. Monk
Venue: Proceedings of the ninth conference on Australasian user interface - Volume 76 (2008)

The paper sets out some requirements for the user interfaces of technologies that are to be used in the home. Each theme is illustrated with some of the current research being carried out at CUHTec. Interfaces for domestic technologies should be: Simple - we are willing to expend only slight cognitive resources in many domestic contexts (this theme is illustrated by the extreme example of assistive technology for people with dementia); Social - much of what we do in the home is purely for social enjoyment (illustrated by our work to develop quantitative measures of fun based on the behaviour of groups sharing photographs); Ethical - domestic caring technologies pose serious issues of privacy and informed consent (illustrated by our work on social dependability in the design of telecare), and Beautiful - the objects in our homes speak to our tastes and values (illustrated by our work with Jayne Wallace, a digital jeweller).
Energy recovery strategy for low power CMOS circuits design
Authors: Anand Paul, A. Ebenezer Jeyakumar, P. N. Neelakantan, K. John Pratheep
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

In view of changing the type of energy conversion in CMOS circuits, this paper investigates low power CMOS circuit design which adopts gradually changing power clock. First, we discuss the algebraic expressions and the corresponding properties of clocked power signals, then a clocked CMOS gate structure is presented. The PSPICE simulations demonstrate the low power characteristic of clocked CMOS circuits using trapezoidal power-clock. Finally, this paper also explores the design of sequential circuit, which adopts flip-flop with clocked power.
Interview with Mark Bernstein
Authors: Claus Atzenbeck
Venue: ACM SIGWEB Newsletter (2008)

Mark Bernstein is chief scientist at Eastgate Systems, Inc. A graduate of Swarthmore College, he received his Ph.D. (in physical chemistry) from Harvard University. After helping to organize Eastgate in 1982, he joined the research staff at the Artificial Intelligence group at E. I. duPont de Nemours & Co., where here remained until returning to Eastgate in 1987. At Eastgate, he has overseen Eastgate's influential hypertext publishing program, which includes many of the most respected fiction and nonfiction hypertexts that have appeared to date. He has managed development of the Storyspace hypertext writing environment and designed Tinderbox, a content assistant for making, analyzing, and sharing notes. A part of nearly every ACM Hypertext Conference program committee since 1989, he has twice been its program co-chair, and was its keynote speaker in 1999. He is currently program chair of WikiSym '08, the 4th ACM Symposium on Wikis. His book, The Tinderbox Way, was published by Eastgate in 2006.
Distributed Traffic Simulation and the Reduction of Inter-process Communication Using Traffic Flow Characteristics Transfer
Authors: Tomas Potuzak
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

In this paper, an adaptation of the Java Urban Traffic Simulator (JUTS) for distributed computing environment is described. Because one of the main bottlenecks of any distributed application is the communication among its particular processes, the reduction of inter-process communication is introduced. The performance of the resulting communication protocol was intensively tested. The results of the tests are also part of this paper.
Multi-dimensional composition by objective in aspect-oriented requirements analysis
Authors: André Gonçalves Marques, Ana Moreira, João Araújo
Venue: Proceedings of the 13th international workshop on Early Aspects (2008)

This paper focuses on composition of requirements artefacts in Aspect-Oriented Requirements Engineering (AORE). Our goal is to equip the Aspect-Oriented Requirements Analysis (AORA) approach [1, 2] with an enhanced composition mechanism. The AORA approach consists in the identification, modularization and composition of crosscutting concerns. But the AORA composition [3] operates at a coarser granularity level and its reduced number of operators results in limited composition expressiveness. The core of the work presented in this paper is the description of a composition language and approach that enables a multi-dimensional composition of artefacts based on Objectives, therefore stating the purpose or the goal of the composition. This approach provides a composition process with a well-defined syntax and semantics, as well as a tool support integrated to the AORA original tool [3, 4].
Fable: A Language for Enforcing User-defined Security Policies
Authors: Nikhil Swamy, Brian J. Corcoran, Michael Hicks
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

This paper presents Fable, a core formalism for a programming language in which programmers may specify security policies and reason that these policies are properly enforced. In Fable, security policies can be expressed by associating security labels with the data or actions they protect. Programmers define the semantics of labels in a separate part of the program called the enforcement policy. Fable prevents a policy from being circumvented by allowing labeled terms to be manipulated only within the enforcement policy; application code must treat labeled values abstractly. Together, these features facilitate straightforward proofs that programs implementing a particular policy achieve their high-level security goals. Fable is flexible enough to implement a wide variety of security policies, including access control, information flow, provenance, and security automata. We have implemented Fable as part of the Links web programming language; we call the resulting language SELinks. We report on our experience using SELinks to build two substantial applications, a wiki and an on-line store, equipped with a combination of access control and provenance policies. To our knowledge, no existing framework enables the enforcement of such a wide variety of security policies with an equally high level of assurance.
A decision support system to evaluate the competitiveness of nations
Authors: S. Önsel, F. Ülengin, G. Ulusoy, Ö. Kabak, Y. I. Topcu, E. Aktas
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

The measurement of competitiveness and strategy development is an important issue for policy makers. The aim of this paper is to explore methodological transparency as a viable solution to problems created by existing aggregated indices as well as to conduct a detailed analysis on the ongoing performance of nations' competitiveness. For this purpose, a methodology composed of three steps is used. To start, a combined clustering analysis methodology is used to assign countries to appropriate clusters. In current methods, country clustering is generally based on GDP. However, we suggest that GDP alone is insufficent to define the stage of competitiveness a country belongs. In the proposed methodology, 135 criteria are used for a proper classification of the countries. Relationships between the criteria and classification of the countries are determined using Artificial Neural Networks (ANNs). ANN provides an objective method for determining the attribute/criteria weights, which are, for the most part, subjectively specified in existing methods. Finally, in the third step, the countries of interest are ranked based on weights generated in the previous step. Beyond the ranking of countries, the proposed methodology can also be used to identify those attributes that a given country should focus on in order to improve its position relative to other countries, i.e., to transition from its current cluster to the next higher one. As a final analysis, the dynamic change of the rank of the countries over years has also been investigated.
Equations of motion of a closed system
Authors: Graciela Velasco-Herrera
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

In this work I present the equations of a closed system of n rigid bodies. This system has a set of n rigid bodies S1,S2,...Sn,. The bodies Sk and Sk-1 (1<k≤n) have a point in common Ok The system is united by a spherical joint. The Points O1 and On+1 of the bodies S1 and Sn+1 are fixed points.
Usability levels for sparse linear algebra components
Authors: M. Sosonkina, F. Liu, R. Bramley
Venue: Concurrency and Computation: Practice Experience (2008)

Sparse matrix computations are ubiquitous in high-performance computing applications and often are their most computationally intensive part. In particular, efficient solution of large-scale linear systems may drastically improve the overall application performance. Thus, the choice and implementation of the linear system solver are of paramount importance. It is difficult, however, to navigate through a multitude of available solver packages and to tune their performance to the problem at hand, mainly because of the plethora of interfaces, each requiring application adaptations to match the specifics of solver packages. For example, different ways of setting parameters and a variety of sparse matrix formats hinder smooth interactions of sparse matrix computations with user applications. In this paper, interfaces designed for components that encapsulate sparse matrix computations are discussed in the light of their matching with application usability requirements. Consequently, we distinguish three levels of interfaces, high, medium, and low, corresponding to the degree of user involvement in the linear system solution process and in sparse matrix manipulations. We demonstrate when each interface design choice is applicable and how it may be used to further users' scientific goals. Component computational overheads caused by various design choices are also examined, ranging from low level, for matrix manipulation components, to high level, in which a single component contains the entire linear system solver. Published in 2007 by John Wiley & Sons, Ltd. This article is a U.S. Government work and is in the public domain in the U.S.A.
An optimal lower bound on the number of variables for graph identification
Authors: J.-Y. Cai
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

It is shown that Omega (n) variables are needed for first-order logic with counting to identify graphs on n vertices. This settles a long-standing open problem. The lower bound remains true over a set of graphs of color class size 4. This contrasts sharply with the fact that three variables suffice to identify all graphs of color class size 3, and two variables suffice to identify almost all graphs. The lower bound is optimal up to multiplication by a constant because n variables obviously suffice to identify graphs on n vertices.
Institutions with a hierarchy of authorities in distributed dynamic environments
Authors: Guido Boella, Leendert van der Torre
Venue: Artificial Intelligence and Law (2008)

A single global authority is not sufficient to regulate heterogenous agents in multiagent systems based on distributed architectures, due to idiosyncratic local situations and to the need to regulate new issues as soon as they arise. On the one hand institutions should be structured as normative systems with a hierarchy of authorities able to cope with the dynamics of local situations, but on the other hand higher authorities should be able to delimit the autonomy of lower authorities to issue valid norms. In this paper, we study the interplay of obligations and strong permissions in the context of hierarchies of authorities using input/output logic, because its explicit norm base facilitates reasoning about norm base maintenance, and it covers a variety of conditional obligations and permissions. We combine the logic with constraints, priorities and hierarchies of authorities. In this setting, we observe that Makinson and van der Torre's notion of prohibition immunity for permissions is no longer sufficient, and we introduce a new notion of permission as exception and a new distinction between static and dynamic norms. We show how strong permissions can dynamically change an institution by adding exceptions to obligations, provide an explicit representation of what is permitted to the subjects of the normative system and allow higher level authorities to limit the power of lower level authorities to change the normative system.
Understanding web documents: finding pagelets for transformation using structural patterns
Authors: Reza Ferrydiansyah, Bambang Parmanto
Venue: International Journal of Web Engineering and Technology (2008)

Understanding a web document and the sections inside the document is very important for web transformation and information retrieval from web pages. Detecting pagelets, which are small features located inside a web page, in order to understand a web document's structure is a difficult problem. Current work on pagelet detection focuses only on finding the location of the pagelet without regard to its functionality. We describe a method to detect both the location and functionality of pagelets using HTML element patterns. For each pagelet type, an HTML element pattern is created and matched to a web page. Sections of the web page that matches the patterns are marked as pagelet candidates. We test this technique on multiple popular web pages from the news and e-commerce genres. We find that this method adequately recalls various pagelets from the web page.
Influence of ionizing radiation in electronic and optoelectronic properties of III-V semiconductor compounds
Authors: P. H. Yannakopoulos, A. P. Skountzos, M. Vesely
Venue: Microelectronics Journal (2008)

The interaction between radiation and matter is very important in the study of materials used in the aerospace industry. The improvement of the resistance of various devices is crucial. In the present work we have produced simulation results of damages induced in electronic devices of III-V semiconductor compounds, using SRIM-TRIM, CASINO and GEANT4 programs. The energies used for @a^+ particles, SRIM-TRIM, were from 500keV to 4MeV for both FETs and HEMTs and the energies used for @b^- particles, CASINO, were from 1 to 500keV.
Adaptive Volterra/hybrid equalization of nonlinear ISI in a magneto-optic data storage channel
Authors: Sunil Gupta, B. Womack
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

This paper presents performance analysis of an adaptive Volterra/Hybrid equalizer in a nonlinear magneto-optic data storage channel. In a data storage system, nonlinear intersymbol interference (ISI) is one of the limiting factors for high storage density. Volterra and Hybrid (combination of linear and Volterra) equalizers are proposed and developed for compensation of nonlinear ISI. The use of Volterra/Hybrid equalizers provided an extra 1.3-1.5 dB SNR gain over linear equalizers. Performance and complexity of these equalizers are compared. Convergence issues are also investigated by examining the eigenvalue spread of the covariance matrix. The techniques proposed here are applicable to other communication systems (e.g. wireless, optical) exhibiting nonlinear ISI characteristics.
Design and Simulation of a Numerical Controlled Throwing Device
Authors: Heinz Frank
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In a research project we are working on the development of a new technology for the transportation of objects within production systems by throwing or shooting. At the current state of the work objects with masses up to 70 g are thrown with speeds up to 10 m/s over distances up to 3 m. Therefore a prototype of a mechanical throwing device with a spring was realized. At this device the characteristics for the acceleration of the objects can be modified only by mechanical settings. To improve this, in this paper the concept for a numerical controlled throwing device is presented. It includes a commercial available belt driven linear actuator. Since the elasticity of the belt has a significant influence to the dynamic characteristic of such an actuator the motion for throwing an object was simulated.
Making revisions hyper-visible
Authors: David A. Kolb
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

What should a revised edition of a hypertext be? How might revising a hypertext differ from reissuing a printed book? This essay suggests a revision process that is self-reflexive and explicitly made visible, taking advantage of the ability of hypertext to expand the "margins" of a document in new directions. Where the issues are complex enough, the process of revision should be part of what is presented, not just a machine rumbling in the background that issues in a separate product.
How to succeed in graduate school: a guide for students and advisors, part I of II
Authors: Marie des Jardins
Venue: Crossroads (2008)

This paper attempts to raise some issues that are important for graduate students to be successful and to get as much out of the process as possible, and for advisors who wish to help their students be successful. The intent is not to provide prescriptive advice-no formulas for finishing a thesis or twelve-step programs for becoming a better advisor are given-but to raise awareness on both sides of the advisor-student relationship as to what the expectations are and should be for this relationship, what a graduate student should expect to accomplish, common problems, and where to go if the advisor is not forthcoming.
Encoding for secure computations in distributed interactive real-time applications
Authors: Keiichi Endo, Minoru Kawahara, Yutaka Takahashi
Venue: Computer Communications (2008)

This paper deals with massively multiplayer online services that are used for user interaction in real time. Although it is possible to distribute the load on a server to the users' computers, the distributed services are more vulnerable to cheating such as data theft. We propose a method for concealing the data from a user who is authorized to manage the data. The method makes it possible to carry out various kinds of operations, keeping both data and program codes concealed. We show that the concealed information cannot be figured out with the knowledge of the original programs or encoding keys possessed by the other users.
An Adaptable Application Offloading Scheme Based on Application Behavior
Authors: Gonzalo Huerta-Canepa, Dongman Lee
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The advancement of personal devices such as PDAs and mobile phones become ubiquitous and their increasing computing capabilities allow users to perform tasks that used to be performed on workstations. However, we cannot expect to run all tasks on top of personal devices because of the limited resources. Application Offloading allow us to overcome this issue by porting part of an application to a nearby server or workstation with more capabilities. In this paper we present a new application offloading mechanism to perform offloading based on the execution history of applications, and adaptable to the current conditions of the environment and device. We record the consumed resources and the state of the device and surrogates, and we use that information to perform an adaptable offloading. We show that our scheme can prevent the overhead of profiling and also reduce the execution time of an application against pure runtime offloading.
Fast algorithm for multicast and data gathering in wireless networks
Authors: Michael Segal
Venue: Information Processing Letters (2008)

Given a wireless network G=(V,E), we consider a maximum critical energy problem [J. Park, S. Sahni, Maximum lifetime broadcasting in wireless networks, IEEE Transactions on Computers 54 (9) (2005) 1081-1090] that has an objective of increasing the chances of doing a sequence of broadcasts. We present an optimal generalized solution algorithm running in improved optimal O(|V|+|E|) time, where V stands for a set of nodes and E stands for a set of links in the network. Our approach is applicable in an omnidirectional antenna model and can be used to solve the problem of multicasting traffic so as to maximize the lifetime of the network [A. Orda, B.-A. Yassour, Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas, in: Proc. ACM MOBIHOC, 2005] and a data gathering problem [K. Kalpakis, K. Dasgupta, P. Namjoshi, Maximum lifetime data gathering and aggregation in wireless sensor networks, Computer Networks 42 (2003) 697-716; Y. Xue, Y. Cui, K. Nahrstedt, Maximizing lifetime for data aggregation in wireless sensor networks, ACM Moble Networks and Applications 10 (6) (2005) 853-864] with an improved running time.
Optical character recognition errors and their effects on natural language processing
Authors: Daniel Lopresti
Venue: Proceedings of the second workshop on Analytics for noisy unstructured text data (2008)

Errors are unavoidable in advanced computer vision applications such as optical character recognition, and the noise induced by these errors presents a serious challenge to down-stream processes that attempt to make use of such data. In this paper, we apply a new paradigm we have proposed for measuring the impact of recognition errors on the stages of a standard text analysis pipeline: sentence boundary detection, tokenization, and part-of-speech tagging. Our methodology formulates error classification as an optimization problem solvable using a hierarchical dynamic programming approach. Errors and their cascading effects are isolated and analyzed as they travel through the pipeline. We present experimental results based on a large collection of scanned pages to study the varying impact depending on the nature of the error and the character(s) involved. The problem of identifying tabular structures that should not be parsed as sentential text is also discussed.