ppxscal/embedding_network huggingface dataset:
The evolution of Forth
Authors: Elizabeth D. Rather, Donald R. Colburn, Charles H. Moore
Venue: History of programming languages---II (1996)

Forth is unique among programming languages in that its development and proliferation has been a grass-roots effort unsupported by any major corporate or academic sponsors. Originally conceived and developed by a single individual, its later development has progressed under two significant influences: professional programmers who developed tools to solve application problems and then commercialized them, and the interests of hobbyists concerned with free distribution of Forth. These influences have produced a language markedly different from traditional programming languages.
Stochastic resonance of localized activity driven by common noise
Authors: Kosuke Hamaguchi, Masato Okada, Shigeru Kubota, Kazuyuki Aihara
Venue: Biological Cybernetics (2005)

We study the influence of spatially correlated noise on the transient dynamics of a recurrent network with Mexican-Hat-type connectivity. We derive the closed form of the order parameter functional in the thermodynamical limit of neuron number N. Our analysis shows that network dynamics is qualitatively changed by the presence of common noise. Network dynamics driven by common noise obtains the global level of fluctuation, which is not observed in a network driven by independent noise only. We show that the optimal level of global fluctuation enhances the transition from non-localized firing states to spatially localized firing states, and also enhances the rotation speed of localized activity.
A Study of Various Load Information Exchange Mechanisms for a Distributed Application using Dynamic Scheduling
Authors: Abdou Guermouche, Jean-Yves L'Excellent
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

We consider a distributed asynchronous system where processes can only communicate by message passing and need a coherent view of the load (e.g., workload, memory) of others to take dynamic decisions (scheduling). We present several mechanisms to obtain a distributed view of such information, based either on maintaining that view or demand-driven with a snapshot algorithm. We perform an experimental study in the context of a real application, an asynchronous parallel solver for large sparse systems of linear equations.
Would you believe structured Fortran?
Authors: T. E. Hull
Venue: ACM SIGNUM Newsletter (1973)

Structured programming [1] is a common topic of conversation these days. It appears to be an idea that has finally arrived, and it is "in" to teach about structured programming, even if we don't quite understand exactly what is meant by it.
MOCCA - Towards a Distributed CCA Framework for Metacomputing
Authors: Maciej Malawski, Dawid Kurzyniec, Vaidy Sunderam
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05 (2005)

We describe the design and implementation of MOCCA, a distributed CCA framework implemented using the H2O metacomputing system. Motivated by the quest for appropriate metasystem programming models for large scale scientific applications, MOCCA combines the advantages of component orientation with the flexible and reconfigurable H2O middleware. By exploiting unique capabilities in H2O, including client-provider separation, security, and negotiable transport protocols, enhancements to both functionality and performance could be attained. The design and implementation of MOCCA highlights the natural match between CCA components and H2O pluglets, both in structure and invocation methodology. An outline of how native CCA modules can be supported in the MOCCA framework describes the potential for future deployment of legacy codes on metacomputing systems. We also report on preliminary experiences with test applications and sample performance measurements that favorably compare MOCCA to alternative component frameworks for tightly- and loosely-coupled metacomputing systems.
Knowledge representation and natural language understanding
Authors: Daniel Coulon
Venue: Issue 80 (April 1982) (1982)

It is not necessary and it is even not advisable to translate the sentences into an internal representation [6]. It is preferable to keep them as they are, and to interpret them at variable depth. This concept consists of 3 aspects [4]: progressive description, multiplicity of inference strategies, and evaluation on demand of partial results.
Virtual web services: application of software agents to personalization of web services
Authors: Jarogniew Rykowski, Wojciech Cellary
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

In this paper we propose an application of software agents to provide Virtual Web Services. A Virtual Web Service VWS is a linked collection of several real and/or virtual Web Services, and public and private agents, accessed by the user in the same way as a single real Web Service. A Virtual Web Service allows unrestricted comparison, information merging, pipelining, etc., of data coming from different sources and in different forms. Web Services are accessed according to the standardized protocols and their individual APIs. Public agents are coded in Java and developed by trusted users. These agents are optimized for efficient execution. They are used as mass-usage wrappers, caching utilities, communicators, monitors, etc. Private agents are defined by the agent owners using a specialized, imperative, interpreted, XML-based language. Code of the private agents is optimized for safe execution and mobility. By linking different private and public agents accessing different Web Services, a user may develop individual Virtual Web Services, and thus personalize chosen Web Services to the maximum extend.
Language Systems Inc.: description of the DBG system as used for MUC-5
Authors: Christine A. Montgomery, Robert E. Stumberger, Bonnie Glover Stalls, Naicong Li, Robert S. Belvin, Susan Hirsh Litenatsky
Venue: Proceedings of the 5th conference on Message understanding (1993)

Language Systems, Inc. (LSI) believes that the best system for producing a complete and accurate automated analysis of natural language text is an in-depth text understanding system that employs linguistic as well as other analytical techniques to interpret the text. Our DBG (Data Base Generation) natural language processing system performs full-scale linguistic analysis of text in order to produce a system-internal text-level representation of the content of the text. This representation is composed of a set of entity and event frame structures, interrelated to reflect the organization and content of the text. This representation of the text can then be mapped into any data structure required by a downstream application, such as the templates specified for the MUC-5/Tipster applications. DBG has been designed as a single core system for handling texts of different types in different domains for a variety of applications. Application types for which DBG has provided the input include information extraction and database generation tasks such as MUC-5, message fusion (the combination of information derived from various kinds of sources, including text; see [1]), and the translation of text into another language using spoken input and output ([2]).
Book review: Knowledge-Based Process Planning For Construction and Manufacturing by Carlos Zozaya-Gorostiza, Chris Hendrickson, and Daniel R. Rehak (Academic Press)
Venue: ACM SIGART Bulletin (1990)

Planning software has been mainly confined to single applications and academic studies. Fortunately, the authors of this volume are in a positions to overcome these strictures and make major contributions from the practical viewpoint as well as the academic by virtue of their positions within the Carnegie-Mellon AI Community and its various industrial connections. 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
Discriminative Density Propagation for 3D Human Motion Estimation
Authors: Cristian Sminchisescu, Atul Kanaujia, Zhiguo Li, Dimitris Metaxas
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We describe a mixture density propagation algorithm to estimate 3D human motion in monocular video sequences based on observations encoding the appearance of image silhouettes. Our approach is discriminative rather than generative, therefore it does not require the probabilistic inversion of a predictive observation model. Instead, it uses a large human motion capture data-base and a 3D computer graphics human model in order to synthesize training pairs of typical human configurations together with their realistically rendered 2D silhouettes. These are used to directly learn to predict the conditional state distributions required for 3D body pose tracking and thus avoid using the generative 3D model for inference (the learned discriminative predictors can also be used, complementary, as importance samplers in order to improve mixing or initialize generative inference algorithms). We aim for probabilistically motivated tracking algorithms and for models that can represent complex multivalued mappings common in inverse, uncertain perception inferences. Our paper has three contributions: (1) we establish the density propagation rules for discriminative inference in continuous, temporal chain models; (2) we propose flexible algorithms for learning multimodal state distributions based on compact, conditional Bayesian mixture of experts models; and (3) we demonstrate the algorithms empirically on real and motion capture-based test sequences and compare against nearest-neighbor and regression methods.
XHTML meta data profiles
Authors: Tantek Çelik, Eric A. Meyer, Matthew Mullenweg
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this paper, we describe XHTML Meta Data Profiles (XMDP) which use XHTML to define a simple profile format which is both human and machine readable. XMDP can be used to extend XHTML by defining new link relationships, meta data properties/values, and class name semantics. XMDP has already been used to extend semantic XHTML to represent social networks, document licensing, voting, and tagging.
Children and emerging wireless technologies: investigating the potential for spatial practice
Authors: Morris Williams, Owain Jones, Constance Fleuriot, Lucy Wood
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

In this paper, we describe design work with 36 children aged 9 and 10 in Bristol, United Kingdom. The design work was conducted using emerging mobile and wireless technology which has the potential to impact on the problematic issue of children's access to, use of, and safety within the wider urban environment. A series of workshops are described in which children were encouraged to think about their use of an outdoor space before their introduction to the technology. The children designed and created "soundscapes" in the outdoor environment. The future potential impact of the technology on children's spatial practice is discussed and the concept of children "tagging" environmental hazards is raised.
Financially informed requirements prioritization
Authors: Jane Cleland-Huang, Mark Denne
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This tutorial introduces a financially responsible approach to requirements prioritization that enhances the value creating potential of a software development project. The approach, known as the Incremental Funding Method (IFM), is described in the book "Software by Numbers: Low-risk, High-Return Development" [2,3]. Tutorial attendees will learn how to group requirements into "chunks" of revenue-generating functionality known as Minimal Marketable Features (MMFs), and how to carefully sequence those MMFs in order to maximize the overall value of the project, reduce initial funding investments, and manipulate other project metrics such as the time needed for a project to reach break-even status. A gentle introduction to financial analysis will also equip participants to analyze and understand the impact of other requirements prioritization decisions upon the financial returns of a project. This process is applicable within any iterative development approach.
Distributed computing with Triana on the Grid: Research Articles
Authors: Ian Taylor, Ian Wang, Matthew Shields, Shalil Majithia
Venue: Concurrency and Computation: Practice Experience (2005)

In this paper, we describe Triana, a distributed problem-solving environment that makes use of the Grid to enable a user to compose applications from a set of components, select resources on which the composed application can be distributed and then execute the application on those resources. We describe Triana's current pluggable architecture that can support many different modes of operation by the use of flexible writers for many popular Web service choreography languages. We further show, that the Triana architecture is middleware-independent through the use of the Grid Application Toolkit (GAT) API and demonstrate this through the use of a GAT binding to JXTA. We describe how other bindings being developed to Grid infrastructures, such as OGSA, can seamlessly be integrated within the current prototype by using the switching capability of the GAT. Finally, we outline an experiment we conducted using this prototype and discuss its current status. Copyright &copy; 2005 John Wiley & Sons, Ltd.
The OpenHaptics" Toolkit: A Library for Adding 3D Touch" Navigation and Haptics to Graphics Applications
Authors: Brandon Itkowitz, Josh Handley, Weihang Zhu
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The OpenHaptics¿ toolkit is a haptics library developed by SensAble Technologies, Inc®. It is patterned after the OpenGL® API, making it familiar to graphics programmers and facilitating integration with existing OpenGL applications. OpenHaptics is composed of two layers: Haptic Device API (HDAPI) and Haptic Library API (HLAPI). HDAPI provides low-level access to the haptic device. HLAPI provides advanced haptic rendering capability. HDAPI and HLAPI are built on top of the PHANTOM® Device Drivers (PDD), the device drivers for PHANTOM series of haptic devices.
Review of "Systems Engineering Models of Human-Machine Interaction by William B. Rouse", North Holland.
Authors: Kamesh Ramakrishna
Venue: Issue 76 (April 1981) (1981)

The author had three goals for the book: "to emphasize the current state of the art", "to provide a treatment of a highly mathematical topic while avoiding calculus, differential equations, Laplace and Fourier transforms, and so on", and, "to include basic tutorials on the modeling methodologies of interest and thus avoid requiring the reader to consult other basic sources." The book is based on the lecture notes of a graduate course in Industrial Engineering offerred at the University of Illinois to mostly engineering and psychology students. The author feels that the material in the book is "nicely complemented by having students pursue a series of small design projects in which they have to choose among the various available models, resolve measurement problems, and so on."
Recognizing article errors in the writing of Japanese learners of English
Authors: Ryo Nagata, Tatsuya Iguchi, Kenta Wakidera, Fumito Masui, Atsuo Kawai
Venue: Systems and Computers in Japan (2005)

In this paper, the authors propose a method to recognize article errors often seen in English text written by Japanese learners of English. In this method, article errors are recognized based on the statistic extracted from an electronic corpus such as English-language newspapers. The authors' method is different from earlier methods in that there is no need to create a dictionary or rules for article error recognition. The results of experiments confirm that the performance of the authors' method is equivalent or superior to earlier methods (F - measure = 0.76). In addition, the authors' method is shown to be superior to earlier methods insofar as (1) the effort to create a dictionary or rules is not needed; (2) there are no limits on the input text; and (3) the ratio of Recall to Precision can be adjusted. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(7): 54&ndash;63, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20153
Online Gaming Cheating and Security Issue
Authors: Ying-Chieh Chen, Jing-Jang Hwang, Ronggong Song, George Yee, Larry Korba
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Along with the development of multimedia, animation, and network bandwidth, online gaming has become a very successful and outstanding industry recently, especially in Asia Pacific. However, due to the lack of security consideration, legal regulation, management, auditingand related legislation, more and more players have violated the law or become the victims while they are indulging in the virtual world. Virtual properties are getting more and more valuable in the real-world marketplace, and trade or exchange of virtual properties between players have become prevalent. Unfortunately, using illegal fraudulent means or programs to grab others' UserID or password are increasing as well. This paper provides a detailed overview of the online cheating threat and the associated security flaws, examines its consequences for online businesses, and outlines technical solutions and implications.
Chordal co-gem-free and (P5,gem)-freegraphs have bounded clique-width
Authors: Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
Venue: Discrete Applied Mathematics (2005)

It is well known that the clique-width of chordal gem-free graphs (also known as ptolemaic graphs), as a subclass of distancehereditary graphs, is at most 3. Hereby, the gem consists of a P4 plus a vertex being completely adjacent to the P4, and the co-gem is its complement graph. On the other hand, unit interval graphs being another important subclass of chordal graphs, have unbounded clique-width. In this note, we show that, based on certain tree structure and module properties, chordal co-gem-free graphs have clique-width at most eight. By a structure result for (P5, gem)-free graphs, this implies bounded clique-width for this class as well. Moreover, known results on unbounded clique-width of certain grids and of split graphs imply that the gem and the co-gem are the only one-vertex P4 extension H such that chordal H-free graphs have bounded clique-width.
Kode Vicious Battles On
Authors: George Neville-Neil
Venue: Queue (2005)

Dear KV, I'm maintaining some C code at work that is driving me right out of my mind. It seems I cannot go more than three lines in any file without coming across a chunk of code that is conditionally compiled (i.e., bracketed by #ifdef/#endif macros). All of these code blocks make reading the code difficult and debugging almost impossible, and the code has a lot of bugs. Have you come across this before? My temptation is just to rewrite the whole lot of it, but I don't have the time for that--I'm under a deadline, of course.
Breaking the glass firewall: opportunities for women leaders in information security and assurance
Authors: Martha Myers, Amy Woszczynski, Sherri Shade
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

The purpose of this research is to examine careers in Information Security and Assurance within the context of women in IT. Much prior research has examined the dearth of women and other groups in the IT industry. We are interested in exploring this relatively new career path to see if there are female-friendly opportunities that have not existed in previous IT career paths. In sum, we seek to determine whether or not women in security face the same challenges and opportunities as they do in other IT fields. Further, we will determine if the security area offers an even playing field for women and men. Finally, based on our findings, we will discuss implications for IT educators in terms of recruiting and retaining diverse groups of students to pursue security related careers.
Simultaneous Estimation of Segmentation and Shape
Authors: Jens Rittscher, Peter H. Tu, Nils Krahnstoever
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

The main focus of this work is the integration of feature grouping and model based segmentation into one consistent framework. The algorithm is based on partitioning a given set of image features using a likelihood function that is parameterized on the shape and location of potential individuals in the scene. Using a variant of the EM formulation, maximum likelihood estimates of both the model parameters and the grouping are obtained simultaneously. The resulting algorithm performs global optimization and generates accurate results even when decisions can not be made using local context alone. An important feature of the algorithm is that the number of people in the scene is not modeled explicitly. As a result no prior knowledge or assumed distributions are required. The approach is shown to be robust with respect to partial occlusion, shadows, clutter, and can operate over a large range of challenging view angles including those that are parallel to the ground plane. Comparisons with existing crowd segmentation systems are made and the utility of coupling crowd segmentation with a temporal tracking system is demonstrated.
Dynamic personal social networks: a new perspective for CSCW research and design
Authors: G. Henri ter Hofte, Ingrid Mulder
Venue: ACM SIGGROUP Bulletin (2003)

In this position paper, we motivate why the dynamic personal social network perspective is relevant for research and design of CSCW systems. Moreover, we identify opportunities for improvement of measuring the dynamics in personal social networks and we propose a classification of dynamic personal social network applications.
Localized Low-Power Topology Control Algorithms in IEEE 802.15.4-Based Sensor Networks
Authors: Jian Ma, Min Gao, Qian Zhang, Lionel M. Ni, Wenwu Zhu
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Sensor networks have emerged as a promising technology with various applications, and power consumption is one of the key issues. Since each full function device can act as a coordinator or a device in IEEE 802.15.4 standard, 802.15.4-based sensor networks have various possible network topologies. In this paper, we try to construct network topologies with small number of coordinators while still maintaining network connectivity. By reducing the number of coordinators, the average duty cycle is reduced and the battery life is prolonged. Three topology control algorithms are proposed in this paper. Self-pruning is the simplest one with O(1) running time. Ordinal pruning significantly improves self-pruning in terms of power saving with O(n) running time. Layered pruning is a tradeoff between the first two pruning algorithms with 0(\sqrt n) running time and a little higher power consumption than ordinal pruning. Furthermore, all three algorithms are independent of the physical radio propagation characteristics.