ppxscal/embedding_network huggingface dataset:
Evolutionary performance-oriented development of parallel programs by composition of components
Authors: Nasim Mahmood, Yusheng Feng, James C. Browne
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

This paper describes a method for evolutionary component-based development of families of parallel programs to attain performance goals on multiple execution environments for multiple family instances and an implementation of the method. It is based upon combining component-oriented development with integration of parallel/distributed execution and parallel/distributed simulation. Each component may have multiple representations at multiple levels of realization from analytical timing models to production code. Each component is encapsulated with an associative interface specifying its properties and behaviors which enables distinguishing among different implementations (or abstractions) of the same functional behavior which may have different performance behavior. Evolutionary development evolves a program from an abstract performance model to a complete program and may continue evolution during runtime. Performance can be estimated at any stage of realization. The implementation is a compiler which composes parallel/distributed programs from components encapsulated with associative interfaces and a runtime system which supports integrated execution/simulation of parallel programs composed from components at different levels of abstraction and program evolution at runtime by component replacement. Case studies in the application of the evolutionary development method including performance results are given.
Estimating sentence types in computer related new product bulletins using a decision tree
Authors: Tokunaga Hidekazu, Atlam El-Sayed, Fuketa Masao, Morita Kazuhiro, Tsuda Kazuhiko, Jun-ichi Aoe
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

Numerous articles concerning computer related to new product news are present on the Internet. Information extraction and automatic text summarization are necessary for the effective use of these articles. The present paper reveals that the estimation of four sentence types (HATSUBAI [sales], SHIYO [specifications], KOZO [structure], KINO [function]) is an effective as preprocessing for information extraction and automatic text summarization. Moreover, this paper introduces a technique for estimating these sentence types using a decision tree. This decision tree does not involve proper nouns or technical terms but rather verbal nouns and numeratives at the end of sentences, as well as other general words, as attributes. Since sub-setting attribute values is important for creating the decision tree, the sub-setting of the representative decision tree algorithm C4.5 was revised. The gain ratio criterion was changed, and the hill climbing method was replaced with a genetic algorithm. A decision tree was created from 1539 sentences for learning data, and 299 sentences were estimated by the decision tree as test data. The number of incorrectly estimated sentences was 81 when C4.5 used without revision but these number decreased to 70 after revising the sub-setting.
Authentication and Its Privacy Effects
Authors: Lynette I. Millett, Stephen H. Holden
Venue: IEEE Internet Computing (2003)

From e-commerce to electronic tax filing to securing office building entry, the need to verify identity and authorize physical access has driven the development of increasingly advanced authentication systems. Almost all these systems use personal information (in many cases, personally identifiable information), which raises numerous privacy concerns. In early 2003, the National Academy of Sciences' Committee on Authentication Technologies and Their Privacy Implications issued a report addressing this broad set of issues. This article summarizes some of the key insights from that report.
Specifying modules to satisfy interfaces: a state transition system approach
Authors: Simon S. Lam, A. Udaya Shankar
Venue: Distributed Computing (1992)

We define interface, module and the meaning of M offers I, where M denotes a module and I an interface. For a module M and disjoint interfaces U and L, the meaning of M using L offers U is also defined. For a linear hierarchy of modules and interfaces, M1, I1, M2, I2, ..., Mn, In, we present the following composition theorem: If M1 offers I1 and, for i=2,..., n, Mi using Ii-1 offers Ii, then the hierarchy of modules offers Ii.Our theory is applied to solve a problem posed by Leslie Lamport at the 1987 Lake Arrowhead Workshop. We first present a formal specification of a serializable database interface. We then provide specifications of two modules, one based upon two-phase locking and the other multi-version timestamps; the two-phase locking module uses an interface offered by a physical database. We prove that each module offers the serializable interface.
Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
Authors: Robert Saxon Milnikel
Venue: Annals of Mathematics and Artificial Intelligence (2005)

Sequent calculi for skeptical consequence in predicate default logic, predicate stable model logic programming, and infinite autoepistemic theories are presented and proved sound and complete. While skeptical consequence is decidable in the finite propositional case of all three formalisms, the move to predicate or infinite theories increases the complexity of skeptical reasoning to being ¿11-complete. This implies the need for sequent rules with countably many premises, and such rules are employed.
C0 Interior Penalty Methods for Fourth Order Elliptic Boundary Value Problems on Polygonal Domains
Authors: Susanne C. Brenner, Li-Yeng Sung
Venue: Journal of Scientific Computing (2005)

C0 interior penalty methods for fourth order elliptic boundary value problems on polygonal domains are analyzed in this paper. A post-processing procedure that can generate C1 approximate solutions from the C0 approximate solutions is presented. New C0 interior penalty methods based on the techniques involved in the post-processing procedure are introduced. These new methods are applicable to rough right-hand sides.
<u>Correction</u> to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"
Authors: Peter E. Hart, Nils J. Nilsson, Bertram Raphael
Venue: Issue 37 (December 1972) (1972)

Our paper on the use of heuristic information in graph searching defined a path-finding algorithm, A*, and proved that it had two important properties. In the notation of the paper, we proved that if the heuristic function &ntilde; (n) is a lower bound on the true minimal cost from node n to a goal node, then A* is <u>admissible;</u> i.e., it would find a minimal cost path if any path to a goal node existed. Further, we proved that if the heuristic function also satisfied something called the <u>consistency assumption,</u> then A* was <u>optimal;</u> i.e., it expanded no more nodes than any other admissible algorithm A no more informed than A*. These results were summarized in a book by one of us.
Modern floorplanning based on fast simulated annealing
Authors: Tung-Chieh Chen, Yao-Wen Chang
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

Unlike classical floorplanning that usually handles only block packing to minimize silicon area, modern VLSI floorplanning typically needs to pack blocks within a fixed die (outline) and additionally considers the packing with block positions and interconnect constraints. Floorplanning with bus planning is one of the most challenging modern floorplanning problems because it needs to consider the constraints with interconnect and block positions simultaneously. We study in this paper two types of modern floorplanning problems: (1) fixed-outline floorplanning and (2) bus-driven floorplanning. Our floorplanner uses the B*-tree floorplan representation and is based on a fast three-stage simulated annealing scheme, called Fast-SA. For fixed-outline floorplanning, we present an adaptive Fast-SA that can dynamically change the weights in the cost function to optimize wirelength under the outline constraint. Experimental results show that our floorplanner can achieve almost 100% success rates efficiently for fixed-outline floorplanning with various aspect ratios, compared to 10%--90% success rates obtained by the most recent works. For the bus-driven floorplanning, we explore the feasibility conditions of the B*-tree with the bus constraints and develop a bus-driven floorplanning algorithm based on the conditions and Fast-SA. Experimental results show that our floorplanner on the average reduces 20% (55%) dead space for the floorplanning with hard (soft) macro blocks, compared with the most recent work. In particular, our floorplanner is more efficient than the previous works.
User acceptance of Intelligence and Security Informatics technology: A study of COPLINK: Research Articles
Authors: Paul Jen-Hwa Hu, Chienting Lin, Hsinchun Chen
Venue: Journal of the American Society for Information Science and Technology (2005)

The importance of Intelligence and Security Informatics (ISI) has significantly increased with the rapid and large-scale migration of local&sol;national security information from physical media to electronic platforms, including the Internet and information systems. Motivated by the significance of ISI in law enforcement (particularly in the digital government context) and the limited investigations of officers' technology-acceptance decision-making, we developed and empirically tested a factor model for explaining law-enforcement officers' technology acceptance. Specifically, our empirical examination targeted the COPLINK technology and involved more than 280 police officers. Overall, our model shows a good fit to the data collected and exhibits satisfactory power for explaining law-enforcement officers' technology acceptance decisions. Our findings have several implications for research and technology management practices in law enforcement, which are also discussed. &copy; 2005 Wiley Periodicals, Inc.
Using Pantomime in Teaching OOA&OOD with UML
Authors: Vladimir L. Pavlov, Anton Yatsenko
Venue: Proceedings of the 18th Conference on Software Engineering Education & Training (2005)

This paper presents the original pantomime-based training on Object Oriented Analysis/Objected Oriented Design (OOA/OOD) with Unified Modeling Language (UML). The essence of this training involves giving an assignment to create a high-level design for a software system to a team of students. They are required to use UML and are not allowed to use any other language (English, German, Russian, Ukrainian, etc), either spoken or written. Students are given 4-6 hours to complete the task. This assignment is always presented as an experiment - the students are to discover whether or not UML is "a real language" that can successfully serve as a communication tool within a team. The authors call this training "The Babel Experiment". This training allows students to work through typical problems of software development projects and to see how UML helps solve these problems. This training was developed by Vladimir L. Pavlov in 2001 and it has been successfully conducted at universities and software companies over ten times. In universities, this training has been used as a kind of capstone project for traditional OOA/OOD/UML courses; however, for software companies this training was mostly delivered as a stand-alone course.In all cases this training course has received very positive feedback from students and customers.
Analysis of multimedia workloads with implications for internet streaming
Authors: Lei Guo, Songqing Chen, Zhen Xiao, Xiaodong Zhang
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

In this paper, we study the media workload collected from a large number of commercial Web sites hosted by a major ISP and that collected from a large group of home users connected to the Internet via a well-known cable company. Some of our key findings are: (1) Surprisingly, the majority of media contents are still delivered via downloading from Web servers. (2) A substantial percentage of media downloading connections are aborted before completion due to the long waiting time. (3) A hybrid approach, pseudo streaming, is used by clients to imitate real streaming. (4) The mismatch between the downloading rate and the client playback speed in pseudo streaming is common, which either causes frequent playback delays to the clients, or unnecessary traffic to the Internet. (5) Compared with streaming, downloading and pseudo streaming are neither bandwidth efficient nor performance effective. To address this problem, we propose the design of AutoStream, an innovative system that can provide additional previewing and streaming services automatically for media objects hosted on standard Web sites in server farms at the client's will.
On the fault-tolerant diameter and wide diameter of &omega;-connected graphs
Authors: Jian-Hua Yin, Jiong-Sheng Li, Guo-Liang Chen, Cheng Zhong
Venue: Networks (2005)

The fault-tolerant diameter, Dk, and wide diameter, dk, are two important parameters for measuring the reliability and efficiency of interconnection networks. It is well known that for any &omega;-connected graph G and any integer k, 1 &le; k &le; &omega;, we have Dk &le; dk. However, what we are interested in is how large the difference between dk and Dk can be. For any 2-connected graph G with diameter d, Flandrin and Li proved that d2 &le; D2 &plus; 1 if d &equals; 2 and d2 &le; &lpar;d - 1&rpar;&lpar;D2 - 1&rpar; if d &ge; 3. In this article, we further prove that d2 &le; max&lcub;D2 &plus; 1, &lpar;d - 1&rpar;&lpar;D2 - d&rpar; &plus; 2&rcub; for d &le; &lceil;&lpar;D2 - 1&rpar;&sol;2&rceil; and d2 &le; max&lcub;D2 &plus; 1,&lfloor;&lpar;D2 - 1&rpar;2&sol;4&rfloor; &plus; 2&rcub; for d &ge; &lceil;&lpar;D2 - 1&rpar;&sol;2&rceil; &plus; 1, and we also show that this upper bound can be achieved. Moreover, for any &omega;&lpar;&ge; 3&rpar;-connected graph G, we prove that d&omega; &le; D&omega; &plus; 1 if D&omega; - 1 &equals; 2 and d&omega; &le; max&lcub;D&omega; &plus; 2,&lfloor;&lpar;D&omega;&rpar;2&sol;4&rfloor; &plus; 2&rcub; if D&omega; - 1 &equals; 2 and D&omega; - 1 &ge; 3. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45&lpar;2&rpar;, 88&ndash;94 2005
On the definition of "on-line" in job scheduling problems
Authors: Dror G. Feitelson, Ahuva W. Mu'alem
Venue: ACM SIGACT News (2005)

The conventional model of on-line scheduling postulates that jobs have non-trivial release dates, and are not known in advance. However, it fails to impose any stability constraints, leading to algorithms and analyses that must deal with unrealistic load conditions arising from trivial release dates as a special case. In an effort to make the model more realistic, we show how stability can be expressed as a simple constraint on release times and processing times. We then give empirical and theoretical justifications that such a constraint can close the gap between the theory and practice. As it turns out, this constraint seems to trivialize the scheduling problem.
The rotating compass: a novel interaction technique for mobile navigation
Authors: Enrico Rukzio, Albrecht Schmidt, Antonio Krüger
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In current mobile navigation systems users receive the navigational instructions on a visual display or by descriptive audio. The mapping between the provided navigation information and the surrounding world has still to be performed by the users. In our approach that aims at public spaces, we combine a public display that shows directions with a synchronized output on a personal device. We describe a system where on the public display a compass with a rotating needle is shown. When the compass needle points in the desired direction, the mobile device of the user vibrates. This unobtrusive cue, allows the user to navigate without listening to or looking at the mobile device. In this paper we introduce the concept of synchronized information displays for navigation. We describe our prototype of such a system and report on a user study, that shows the feasibility of the approach.
The role of image size in the recognition of conversational facial expressions: Research Articles
Authors: Douglas W. Cunningham, Manfred Nusseck, Christian Wallraven, Heinrich H. Bülthoff
Venue: Computer Animation and Virtual Worlds (2004)

Facial expressions can be used to direct the flow of a conversation as well as to improve the clarity of communication. The critical physical differences between expressions can, however, be small and subtle. Clear presentation of facial expressions in applied settings, then, would seem to require a large conversational agent. Given that visual displays are generally limited in size, the usage of a large conversational agent would reduce the amount of space available for the display of other information. Here, we examine the role of image size in the recognition of facial expressions. The results show that conversational facial expressions can be easily recognized at surprisingly small image sizes. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Review of 'Einstein's Dreams': Book by Alan Lightman, Pantheon Books, Random House, NYC, NY, 1994
Venue: Ubiquity (2005)

John Stuckey reviews the book 'Einstein's Dreams,' by Alan Lightman: Warner Books Edition, Pantheon Books, Random House, NYC, NY, 1994.
Aggregating inconsistent information: ranking and clustering
Authors: Nir Ailon, Moses Charikar, Alantha Newman
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We address optimization problems in which we are given contradictory pieces of input information and the goal is to find a globally consistent solution that minimizes the number of disagreements with the respective inputs. Specifically, the problems we address are rank aggregation, the feedback arc set problem on tournaments, and correlation and consensus clustering. We show that for all these problems (and various weighted versions of them), we can obtain improved approximation factors using essentially the same remarkably simple algorithm. Additionally, we almost settle a long-standing conjecture of Bang-Jensen and Thomassen and show that unless NP⊆BPP, there is no polynomial time algorithm for the problem of minimum feedback arc set in tournaments.
Effects of oxidant additives for exact selectivity control of W- and Ti-CMP process
Authors: Yong-Jin Seo, Woo-Sun Lee
Venue: Microelectronic Engineering (2005)

Tungsten is widely used as a plug for the multi-level interconnection structures. However, due to the poor adhesive properties of tungsten (W) on SiO"2 layer, the Ti/TiN barrier layer is usually deposited onto a SiO"2 layer in order to increase the adhesion ability with the tungsten film. Generally, for the tungsten chemical mechanical polishing (W-CMP) process, the passivation layer on the tungsten surface during CMP plays an important role. In this paper, the effects of oxidants controlling the polishing selectivity of the W/Ti/TiN layer were investigated. The alumina (Al"2O"3)-based slurry with H"2O"2 oxidizer was used for CMP applications. As an experimental result, for the case of 5% oxidizer added, the removal rates were improved and a polishing selectivity of 1.4:1 was obtained. Therefore we conclude that the W and Ti metal CMP characteristics are strongly dependent on the amounts of H"2O"2 oxidizer additive.
Approximation techniques for utilitarian mechanism design
Authors: Patrick Briest, Piotr Krysta, Berthold Vöcking
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

This paper deals with the design of efficiently computable incentive compatible, or truthful, mechanisms for combinatorial optimization problems with multi-parameter agents. We focus on approximation algorithms for NP-hard mechanism design problems. These algorithms need to satisfy certain monotonicity properties to ensure truthfulness. Since most of the known approximation techniques do not fulfill these properties, we study alternative techniques.Our first contribution is a quite general method to transform a pseudopolynomial algorithm into a monotone FPTAS. This can be applied to various problems like, e.g., knapsack, constrained shortest path, or job scheduling with deadlines. For example, the monotone FPTAS for the knapsack problem gives a very efficient, truthful mechanism for single-minded multi-unit auctions. The best previous result for such auctions was a 2-approximation. In addition, we present a monotone PTAS for the generalized assignment problem with any bounded number of parameters per agent.The most efficient way to solve packing integer programs (PIPs) is LP-based randomized rounding, which also is in general not monotone. We show that primal-dual greedy algorithms achieve almost the same approximation ratios for PIPs as randomized rounding. The advantage is that these algorithms are inherently monotone. This way, we can significantly improve the approximation ratios of truthful mechanisms for various fundamental mechanism design problems like single-minded combinatorial auctions (CAs), unsplittable flow routing and multicast routing. Our approximation algorithms can also be used for the winner determination in CAs with general bidders specifying their bids through an oracle.
ITP: description of the Interpretext system as used for MUC-3
Authors: Kathleen Dahlgren, Carol Lord, Hajime Wada, Joyce McDowell, Edward P. Stabler
Venue: Proceedings of the 3rd conference on Message understanding (1991)

The ITP System for MUC3 is diagrammed in Figure 1. The three major modules handle different units of processing: the Message Handler processes a message unit; the ITP NLU Module processes a sentence and builds a Cognitive Model of the message; and the MUC3 Template Reasoning Module processes a segment of discourse.
An integrated and collaborative framework for business design: a knowledge engineering approach
Authors: Satwik Seshasai, Amar Gupta, Ashwani Kumar
Venue: Data Knowledge Engineering (2005)

Many large-scale endeavors, especially the ones that need to be performed on an occasional basis, are performed on a de novo basis. Whether one is designing a spacecraft or a dam, or launching a sales campaign, each endeavor tends to have a life of its own. Very little knowledge, if any, is transferred from one business or engineering design endeavor to a successive one. This paper describes an approach that involves the acquisition of raw information from the keystrokes entered by the user while performing the primary activity. Such information is distilled to produce knowledge for future use, without imposing additional burden on human users involved in the first endeavor or the succeeding endeavors. The paper also describes a complementary approach that significantly reduces the time and effort spent by human beings in articulating their requirements, and specifically, in terms of delineating the indifference points among a set of feasible alternatives. Both these approaches have been validated in a complex multi-organizational situation related to spacecrafts. The approaches can be applied, either singly or jointly, to a broad class of business and engineering scenarios. They incorporate the notion of automated knowledge acquisition, discovery, management, and dissemination. The proposed approach is discussed in the context of supporting workteams that are distributed both on geographic and temporal basis, thereby creating a "24-Hour Knowledge Factory" environment.