ppxscal/embedding_network huggingface dataset:
Detection of foreign words and names in written text
Authors: Charles Tappert
Venue:  (2005)

Tremendous research effort has gone into the field of natural language processing and understanding during the last half of the 20th century, yet it remains as one of the most challenging problems. Nevertheless, many companies have commercialized language processing applications such as Text-to-Speech (TTS) systems, domain-specific Automatic Speech Recognition (ASR) systems, Machine Translation (MT) systems, and limited-domain, speaker-dependent Speech-to-Speech (STS) prototype systems. While the quality of all natural language processing applications has improved steadily, they remain far from being perfect. Due to globalization and the widespread use of the Internet, occurrences of foreign entities&mdash;foreign words, names, locations, and events&mdash;in written text are becoming commonplace. This further complicates the automatic processing of natural language text. Identification of such foreign entities is important for several reasons. For example, TTS systems will usually fail to pronounce such entities properly in their native language as they try to sound them using the lexicon of the base language. These foreign entities also cause problems for MT programs where translation is initially done word by word. This dissertation simplifies the Na&iuml;ve Bayesian, N-gram based text-classification algorithm by taking its logarithm, naming it the Cumulative Frequency Addition (CFA) algorithm, and applies it to three text processing tasks: language identification, name-to-nationality identification, and detection of foreign words and names. In the language identification task CFA yields 100% accuracy on string sizes greater than 150 characters. In the name-to-nationality task, it yields 86% accuracy on a 14 country database and 96% on a 7 country database within the top three choices. Identifying the nationality, or at least the language group, of a person from his/her name, can be important not only for proper pronunciation but also for purposes of forensics studies and national security. Finally, in the task of detecting foreign words we obtain 66.9% accuracy. This is the first study to apply natural language processing techniques to the latter two tasks.
Generating Policies for Defense in Depth
Authors: Paul Rubel, Michael Ihde, Steven Harp, Charles Charles Payne
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

Coordinating multiple overlapping defense mechanisms, at differing levels of abstraction, is fraught with the potential for misconfiguration, so there is strong motivation to generate policies for those mechanisms from a single specification in order to avoid that risk. This paper presents our experience and the lessons learned as we developed, validated and coordinated network communication security policies for a defensein- depth enabled system that withstood sustained red team attack. Network communication was mediated by host-based firewalls, process domain mechanisms and application-level security policies enforced by the Java Virtual Machine. We coordinated the policies across the layers using a variety of tools, but we discovered that, at least for defense-in-depth enabled systems, constructing a single specification from which to derive all policies is probably neither practical nor even desirable.
Compact Genetic Algorithm for Performance Improvement in Hierarchical Sensor Networks Management
Authors: Ming-Hui Jin, Win-Zing Li, D. Frank Hsu, Cheng-Yan Kao
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

This paper introduces a novel scheduling problem called the active interval scheduling problem in hierarchical wireless sensor networks for long-term periodical monitoring applications. To improve the report sensitivity of the hierarchical wireless sensor networks, an efficient scheduling algorithm is desired. Therefore, in this paper, we propose a compact genetic algorithm (CGA) to optimize the solution quality for sensor network maintenance. The experimental result shows that the proposed CGA brings better solutions in acceptable calculation time.
A 2D-3D integrated environment for cooperative work
Authors: Kousuke Nakashima, Takashi Machida, Kiyoshi Kiyokawa, Haruo Takemura
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

This paper proposes a novel tabletop display system for natural communication and flexible information sharing. The proposed system is specifically designed for integration of 2D and 3D user interfaces, using a multi-user stereoscopic display, IllusionHole. The proposed system takes awareness into consideration and provides both 2D and 3D information and user interfaces. On the display, a number of standard Windows desktop environments are provided as personal workspaces, as well as a shared workspace with a dedicated graphical user interface. In personal workspaces, users can simultaneously access existing applications and data, and exchange information between personal and shared workspaces. In this way, the proposed system can seamlessly integrate personal, shared, 2D and 3D workspaces with conventional user interfaces and effectively support communication and information sharing. To demonstrate capabilities of the proposed display system, a modeling application has been implemented. A preliminary experiment confirmed the effectiveness of the system.
Nonlinear programming: a historical view
Authors: Harold W. Kuhn
Venue: Issue 31 (June 1982) (1982)

A historical survey of the origins of nonlinear programming is presented with emphasis placed on necessary conditions for optimality. The mathematical sources for the work of Karush, John, Kuhn, and Tucker are traced and compared. Their results are illustrated by duality theorems for nonlinear programs that antedate the modern development of the subject.
Requirements Engineering for Cross-organizational ERP Implementation: Undocumented Assumptions and Potential Mismatches
Authors: Maya Daneva, Roel Wieringa
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

A key issue in Requirements Engineering (RE) for Enterprise Resource Planning (ERP) in a crossorganizational context is how to find a match between the ERP application modules and requirements for business coordination. This paper proposes a conceptual framework for analyzing coordination requirements in inter-organizational ERP projects from a coordination theory perspective. It considers the undocumented assumptions for coordination that may have significant implications for ERP adopting organizations. In addition, we build a library of existing coordination mechanisms supported by modern ERP systems, and use it to make a proposal for how to improve the match between ERP implementations and supported business coordination processes. We discuss the implications of our framework for practicing requirements engineers. Our framework and library are based on a literature survey and the experience with ERP implementation of one of us (Daneva). In future empirical research we will further validate and refine our framework.
Peer architectures for knowledge sharing
Authors: Peter Mork
Venue:  (2005)

Large-scale sharing of biologic information requires developing new approaches for accessing large numbers of data sources. For example, consider an experiment that measures genome-wide expression levels. Analyzing these results requires annotating them with information culled from public repositories, which are stored in separate databases, maintained by various organizations, using dissimilar nomenclature. Given the cost of manually visiting each data source, an automated solution is required. One solution to this problem is data integration, in which the user is provided a logical view of the underlying sources. These systems provide syntactic and semantic mediation, but generating the mediated view requires consensus concerning the intended semantics. In biomedical research it is neither feasible nor desirable to establish wide-scale consensus. Thus, a new framework for information is required in which each participant can make its own semantic decisions. This dissertation demonstrates that data integration technology can be extended to meet the challenges of integrating biologic information. These extensions support knowledge sharing in a peer-based environment. Each participant gains the benefits of data integration without the burden of establishing consensus a priori. We begin by establishing a framework for peer-based integration in which software components can easily be extended. We validate this framework by implementing multiple systems within the framework. We then describe a novel query language that allows a query to constrain results based on data and metadata. This language blurs the traditional distinction between instances and schemata and serves as the public interface to a number of online genetic databases. In a peer-based system, schemata are coordinated using semantic mappings. Given a query posed against one schema, we provide a reformulation algorithm that generates equivalent rewritings based on mappings expressed as logical definitions. We experimentally validate that these mappings are more expressive than traditional declarative mappings using queries. Finally, we describe a set of rules for propagating changes to the underlying data, which are used to identify efficient strategies for maintaining data replicas. These contributions demonstrate that data integration technology can be extended to support peer-based knowledge integration, with which we are better able to meet the particular needs of biologic researchers.
A Response Time-Driven Server Selection Substrate for Application Replica Hosting Systems
Authors: Corina Ferdean, Mesaac Makpangou
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

This paper presents a server selection approach that relies on a response time estimator and a scalable monitoring infrastructure that provides the utilization measures for replica server hosts. The big challenge rises from the difficultyto capture, both accurately and efficiently, the dynamic state of the hosts and network resources in a large-scale replication context. The monitoring infrastructure can be tuned such as to minimize the network traffic while maintaining the estimation accuracy high.
Continuous simulation
Authors: Bosco Pak-cheung Kwok
Venue: ACM SIGSIM Simulation Digest (1979)

This project provides a framework for continuous simulation in SIMULA. Most of the procedures in the CSSL (Continuous System Simulation Language) are made available in SIMULA to facilitate the continuous simulation. CSSL is a statement-oriented language used to simulate the dynamics of continuous systems describable by ordinary differential equations. It is hoped that further work on such project will make available the full capabilities of continuous simulation in SIMULA.
Distributed mining of maximal frequent itemsets from databases on a cluster of workstations
Authors: S. M. Chung, C. Luo
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

In this paper, we propose a new algorithm, named Distributed Max-Miner (DMM), for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. DMM requires very low communication and synchronization overhead in distributed computing systems. DMM has the local mining phase and the global mining phase. During the local mining phase, each node mines the local database to discover the local maximal frequent itemsets, then they form a set of maximal candidate itemsets for the top-down search in the subsequent global mining phase. A new prefix-tree data structure is developed to facilitate the storage and counting of the global candidate itemsets of different sizes. This global mining phase using the prefix-tree can work with any local mining algorithm. We implemented DMM on a cluster of workstations and evaluated its performance for various cases. DMM demonstrates better performance than other sequential and parallel algorithms, and its performance is quite scalable, even when there are large maximal frequent itemsets (i.e., long patterns) in databases.
Capturing Processor Architectures from Protocol Processing Applications: a Case Study
Authors: Seppo Virtanen, Jani Paakkulainen, Tero Nurmi
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

We present a case study in finding optimized processor architectures for a given protocol processing application. The process involves application analysis, hardware/ software partitioning and optimization, and evaluation of design quality through simulations, estimations and synthesis. The case study was targeted at processing key IPv6 routing functions at 200 MHz using 0.18
Performance Comparison of Vector-Calculations between Itanium2 and other Processors
Authors: Takeshi Nanri, Yoshitaka Watanabe, Hiroyuki Sato
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

This paper examines the performance similarity of the Intel Itanium2 processor and a vector processor. From the measurements of vector-calculations on latest scalar processors, Itanium2 shares similar strong points and weak points of performance with VPP5000. For multiplications of dense matrices, Itanium2 and VPP5000 show relatively high sustained-performance to the theoretical peak. For matrix-vector multiplications with sparse matrices, on the other hand, those two processors show poor performance.
Passing the Torch
Authors: M. Satyanarayanan
Venue: IEEE Pervasive Computing (2005)

This issue marks the end of Satya's second two-year term as editor in chief. He introduces his successor, Roy Want of Intel Research, and reviews the progress that has occurred in the last four years.
Thema: Byzantine-Fault-Tolerant Middleware forWeb-Service Applications
Authors: Michael G. Merideth, Arun Iyengar, Thomas Mikalsen, Stefan Tai, Isabelle Rouvellou, Priya Narasimhan
Venue: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (2005)

Distributed applications composed of collections of Web Services may call for diverse levels of reliability in different parts of the system. Byzantine fault tolerance (BFT) is a general strategy that has recently been shown to be practical for the development of certain classes of survivable, client-server, distributed applications; however, little research has been done on incorporating it into selective parts of multi-tier, distributed applications like Web Services that have heterogeneous reliability requirements. To understand the impacts of combining BFT and Web Services, we have created Thema, a new BFT middleware system that extends the BFT and Web Services technologies to provide a structured way to build Byzantine-fault-tolerant, survivable Web Services that application developers can use like other Web Services. From a reliability perspective, our enhancements are also novel in that they allow Byzantine-fault-tolerant services: (1) to support the multi-tiered requirements of Web Services, and (2) to provide standardized Web Services support for their own clients (through WSDL interfaces and SOAP communication). In this paper we study key architectural implications of combining BFT with Web services and provide a performance evaluation of Thema using the TPC-W benchmark.
Plugging a Scalable Authentication Framework into Shibboleth
Authors: N. Zhang, L. Yao, J. Chin, A. Nenadic, A. McNab, A. Rector, C. Goble, Q. Shi
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

In a VO (virtual organisation) environment where services are provided and shared by dissimilar organisations from different administrative domains and are protected with dissimilar security policies and measures, there is a need for a flexible authentication framework that supports the use of various authentication tokens. The authentication strengths derived from these tokens should be fed into an access control decision making process. This paper reports our ongoing efforts in designing and implementing such a framework to facilitate multi-level and multi-factor authentication and authentication strength linked fine-grained access control in Shibboleth. The proof-of-concept prototype using a Java smart card is reported.
Body degree zero
Authors: Alan Dunning, Paul Woodrow, Morley Hollenberg
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The Einstein's Brain Project is a collaborative group of artists and scientists who have been working together for the past 9 years. A central aim of the group is the visualization of the biological state of the body through the fabrication of environments, simulations and installations. The Project has developed numerous installations using analog to digital interfaces to direct the output of the human body to virtual environments that are constantly being altered through feedback from a participant's biological body. The core of the Einstein's Brain Project is a discursive space that engages with ideas about the constructed body in the world and its digital cybernetic and post-human forms. This paper describes the form and context of the performance Body Degree Zero.
Stability of Feature Selection Algorithms
Authors: Alexandros Kalousis, Julien Prados, Melanie Hilario
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive work on the stability of learning algorithms, the stability of feature selection algorithms has been relatively neglected. This study is an attempt to fill that gap by quantifying the sensitivity of feature selection algorithms to variations in the training set. We assess the stability of feature selection algorithms based on the stability of the feature preferences that they express in the form of weights-scores, ranks, or a selected feature subset. We examine a number of measures to quantify the stability of feature preferences and propose an empirical way to estimate them. We perform a series of experiments with several feature selection algorithms on a set of proteomics datasets. The experiments allow us to explore the merits of each stability measure and create stability profiles of the feature selection algorithms. Finally we show how stability profiles can support the choice of a feature selection algorithm.
Exploiting self-adaptive posture-based focus estimation for lecture video editing
Authors: Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Head pose plays a special role in estimating a presenter's focuses and actions for lecture video editing. This paper presents an efficient and robust head pose estimation algorithm to cope with the new challenges arising in the content management of lecture videos. These challenges include speed requirement, low video quality, variant presenting styles and complex settings in modern classrooms. Our algorithm is based on a robust hierarchical representation of skin color clustering and a set of pose templates that are automatically trained. Contextual information is also considered to refine pose estimation. Most importantly, we propose an online learning approach to deal with different presenting styles, which has not been addressed before. We show that the proposed approach can significantly improve the performance of pose estimation. In addition, we also describe how posture is used in focus estimation for lecture video editing by integrating with gesture.
Some effects of considerate and inconsiderate systems
Authors: Ronald E. Anderson
Venue: ACM SIGSOC Bulletin (1981)

Concern for the human factors in computer systems continues to grow as computerization becomes more and more pervasive. In the early period of computing such concern was expressed in terms of "user orientation" and "user requirements." As interactive systems evolved it became more common to hear terms like "responsive systems," and "end-user requirements." In the early Seventies, when the computer profession experienced a wave of social responsibility, discussions emerged on "humanizing" systems [1]. More recent discussions on these issues describe ideal systems as people-oriented, convivial, or friendly [2]. Despite this attention to human factors there is relatively little systematic knowledge about what system features actually take human needs and desires into account, and, in this sense, are considerate.
AgentWeb Gateway - a middleware for dynamic integration of Multi Agent System and Web Services Framework
Authors: M. Omair Shafiq, Arshad Ali, H. Farooq Ahmad, Hiroki Suguri
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

Web Services Framework has been evolved in context of convergence of web and service oriented computing and then to Web Services Resource Framework acting as basis for Grid Computing. It provides a loose coupled and implementation neutral infrastructure for distributed applications. On the other hand, Multi Agent Systems have been evolved as distributed system in context of Autonomic computing having ultimate aim of self-managing systems to overcome their rapidly growing complexity and to enable their further growth. In this paper, we present our solution for dynamic and seamless integration of type the distributed systems. It would help in facilitating the requirements of next generation distributed applications requiring higher demands and complexity. The AgentWeb Gateway acts as middleware between both the technologies for dynamic integration and provides protocol transformations including Service Discovery, Service Description and Service Invocation.