ppxscal/embedding_network huggingface dataset:
A Class of Derivative-Free Algorithms for Unconstrained Minimization
Authors: Ann Chien
Venue:  (1974)

NO SUPPLIED 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
The Iceberg Metaphor to Support the Knowledge Crystallization Cycle
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Information visualization is focused on abstract non-numerical data. To support any user to explore this information the knowledge crystallization cycle was defined. We have developed the iceberg metaphor, which can be used to support the user in every single step of this knowledge crystallization cycle. The iceberg can be filled with almost any kind of abstract information. Then the iceberg metaphor can be used to perform a classification as well as a filtering of the information. Using this metaphor for visualization is very simple but effective because the graphical presentation correspondents to the information-inherent structure. Additionally, with the developed iceberg browser all interactions concerning the knowledge crystallization are controllable. Thus, we have found a very simple but effective way to support the user in the formation of knowledge with one single metaphor. 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
Recognition of some perfectly orderable graph classes
Authors: Elaine M. Eschen, Julie L. Johnson, Jeremy P. Spinrad, R. Sritharan
Venue: Discrete Applied Mathematics (2003)

This paper presents new algorithms for recognizing several classes of perfectly orderable graphs. Bipolarizable and P4-simplicial graphs are recognized in O(n3.376) time, improving the previous bounds of O(n4) and O(n5), respectively. Brittle and semi-simplicial graphs are recognized in O(n3) time using a randomized algorithm, and O(n3 log2n) time if a deterministic algorithm is required. The best previous time bound for recognizing these classes of graphs is O(m2). Welsh-Powell opposition graphs are recognized in O(n3) time, improving the previous bound of O(n4). HHP-free graphs and maxibrittle graphs are recognized in O(mn) and O(n3.376) time, respectively.
The Competition Graphs of Interval Digraphs
Authors: Larry Langley, J. R Lundgren, Sarah K. Merz
Venue:  (1995)

Given a digraph D, we construct the competition graph of D, C(D), on the same vertex set as D with x and Y adjacent in C(D) if and only if there exists a vertex z such that x and y both have arcs to z in D. A digraph is an interval digraph if and only if two intervals S(x) and T(x) on the real line can be assigned to vertex x such that (x,y) \in A(D) if and only if S(x) \cap T(y) \neq 0. In this paper we show that the competition graph of an interval digraph is an interval graph and that every interval graph is in fact the competition graph of some digraph. These results are then related to previous work on competition graphs.
A fuzzy decision maker for source traffic control in high speed networks
Authors: V. Catania, G. Ficili, S. Palazzo, D. Panno
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

Most of the policing techniques proposed so far in high speed networks using the ATM technique are based on conventional approaches which use a crisp decision making logic. They don't meet the selectivity and responsiveness requirements needed to make a policing efficient. In this paper we propose a policing mechanism based on fuzzy logic. The main characteristics of the proposed fuzzy policer are simplicity and the capacity to combine a high degree of responsiveness with a selectivity close to that of an ideal policer. Moreover, it can easily be implemented in hardware, thus enhancing both cost and processing performance. The simulation results reported show that the performance of our fuzzy policer is much better than that of conventional policing mechanisms
UCP 500 + Eucp: ICC Uniform Customs and Practice for Documentary Credits and Supplement to UCP 500 for Electronic Presentation (Eucp), 2002 edition
Authors: Maria Livanos Cattaui
Venue:  (2002)

:UCP 500, ICC's universally accepted rules for documentary credits, now have an electronic supplement called eUCP that provides for the electronic presentation of documents. The 12 Articles of the eUCP work in tandem with UCP 500 where electronic or part-electronic presentation of documents takes place. They cover a range of issues common to electronic documents -- the relationship of eUCP to UCP, format, presentation, originals and copies and examination of electronic records. They also contain highly useful definitions of terms -- such as "appears on its face" or "place for presentation" -- that have different meanings in the paper and electronic worlds. ICC has established the world's rules for documentary credits for more than 60 years. This new electronic supplement takes account of important new developments in the field, and, like its counterpart for paper documents, will set worldwide standards for the electronic equivalent of paper credits.
On Individual and Aggregate TCP Performance
Authors: Lili Qiu, Yin Zhang, Srinivasan Keshav
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

As the most widely used reliable transport in today's Internet, TCP has been extensively studied in the past. However, previous research usually only considers a small or medium number of concurrent TCP flows. The TCP behavior under many competing TCP flows has not been sufficiently explored.In this paper we use extensive simulations to investigate the individual and aggregate TCP performance for a large number of concurrent TCP flows. First, we develop a simple yet realistic network model to abstract an Internet connection. Based on the model, we study the performance of a single TCP flow with many competing TCP flows by evaluating the best-known analytical model proposed in the literature. Finally, we examine the aggregate TCP behavior and derive general conclusions about overall throughput, goodput, and loss probability.
Blind Channel Identification Based on Noisy Observation by Stochastic Approximation Method
Authors: Hai-Tao Fang, Han-Fu Chen
Venue: Journal of Global Optimization (2003)

A stochastic approximation algorithm for estimating multichannel coefficients is proposed, and the estimate is proved to converge to the true parameters a.s. up-to a constant scaling factor. The estimate is updated after receiving each new observation, so the output data need not be collected in advance. The input signal is allowed to be dependent and the observation is allowed to be corrupted by noise, but no noise statistics are used in the estimation algorithm.
What Do You Mean I've Been Practicing without a License? Certification and Licensing of Requirements Engineering Professionals
Authors: Annie I. Anton, Joanne M. Atlee
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

We would like the panel to address these questions: What are the goals we want to achieve? If software quality and reliability are the ultimate goals, is the licensing of software practitioners the best way to achieve them? Who should be licensed? In particular, should practitioners who work on requirements-related activities be licensed? Who should be the licenser? In North America, the professional engineering societies have taken the lead in licensing (or planning to license) software engineers. Should the ACM take a more active role? Are our best requirements practices sufficiently mature and stable to be called engineering activities? Can we agree on the requirements notations, processes and activities that belong in a core body of knowledge for software engineering?
Incremental mining of sequential patterns in large databases
Authors: Florent Masseglia, Pascal Poncelet, Maguelonne Teisseire
Venue: Data Knowledge Engineering (2003)

In this paper, we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the cost of finding new sequential patterns in the updated database. Our test shows that the algorithm performs significantly faster than the naive approach of mining the whole updated database from scratch. The difference is so pronounced that this algorithm could also be useful for mining sequential patterns, since in many cases it is faster to apply our algorithm than to mine sequential patterns using a standard algorithm, by breaking down the database into an original database plus an increment.
Comprehending a Complex, Distributed, Object-Oriented Software System a Report from the Field
Authors: Harry M. Sneed, Tomas Dombovari
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

Comprehending complex, distributed, object-oriented software systems is a difficult task which must be approached in a formal disciplined manner if it is to be solved at all. The authors of this paper have developed a formal tool supported approach using relational databases to model both the requirement specification and the system implementation of a very large commercial application system. The approach combines forward and reverse engineering techniques to link the implementation to the specification, thereby providing a basis for traceability between system artifacts and requirements. The result is a partial comprehension adequate for system maintenance.
An Object-Oriented Framework for the Integration of Interactive Animation Techniques
Authors: Robert C. Zeleznik, D. B Conner, Andries van Dam
Venue:  (1991)

We present an interactive modeling and animation system that facilitates the integration of a variety of simulation and animation paradigms. This system permits the modeling of diverse objects that change in shape, appearance, and behavior. Because all properties are functions of time, and because we integrate modeling and animation, we refer to our system as a ``4D modeler.'''' Changes in properties can be effected by various methods of control, including scripted, gestural, and behavioral specification. The system is an extensible testbed that supports research in the interaction of disparate control methods. The paper discusses some of the issues in modeling such interactions and mechanisms implemented to provide solutions. An object-oriented architecture uses delegation hierarchies to exploit multiple inheritance and to permit objects to change all of their attributes dynamically, including object type. Objects include displayable objects, controllers, cameras, lights, renderers, and user interfaces. Further, the delegation system permits network distribution of objects and their associated computation. Additional ways to obtain real-time update speeds include the use of data dependency networks, extensive caching to exploit inter- and intra-frame coherency, and lazy evaluation.
Robust indexing of lattices and permutation codes over binary symmetric channels
Authors: A. Vasilache, I. Tăbuş
Venue: Signal Processing (2003)

In this paper we develop two families of indexing methods for permutation codes and lattices, the lexicographical and binomial indexing families. The parameters of a method within a family can be optimized with respect to a given criterion in order to obtain a good indexing method on the considered set of vectors to be indexed. The proposed indexing methods can be straightforwardly applied for error resilient coding, but also to other applications as e.g. the magnetic recording which is based on (d,k) constrained codes. We have tested the performance of the proposed method at the optimization of the indexing method of a codebook with respect to the channel distortion for several types of lattices and other structured vector quantizers over binary symmetric channels.
ADAPT: Automated De-Coupled Adaptive Program Transformation
Authors: Michael J. Voss, Rudolf Eigenmann
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Dynamic program optimization offers performance improvements far beyond those possible with traditional compile-time optimization [1, 2, 3, 4]. These gains are due to the ability to exploit both architectural and input data set characteristics that are unknown prior to execution time. In this paper, we propose a novel framework for dynamic program optimization, ADAPT (Automated De-coupled Adaptive Program Transformation), that builds on the strengths of existing approaches. The key to our framework is the decoupling of the dynamic compilation of new code variants from the dynamic selection of these variants at their points of use. This allows code generation to occur concurrently with program execution, removing dynamic compilation overheads from the critical path. We present a compilation system, based on the Polaris optimizing compiler [5] that automatically applies this framework to general ¿plugged-in¿ optimization techniques. We evaluate our system on three programs from the SPEC floating point benchmark suite by dynamically applying loop distribution, loop unrolling, loop tiling and automatic parallelization. We show that our techniques can improve performance by as much as 70% over statically optimized code.
Performance Evaluation of Soft Real-Time Scheduling for Multicomputer Cluster
Authors: Weiping Zhu, Brett D. Fleisch
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

We consider scheduling soft real-time tasks for a cluster, which consists of multiple servers. Each server provides identical services where an incoming task can be assigned to one of the servers.The question we investigate is which assignment produces the best performance given two alternative approaches to queue the arriving tasks: a centralized approach or a distributed one. A missed deadline criterion is used to evaluated these approaches. The influence of dispatching policies on the performance of the distributed approach is also considered.
Gain Time Reclaiming in High Performance Real-Time Java Systems
Authors: Erik Yu-Shing Hu, Andy Wellings, Guillem Bernat
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

The run-time characteristics of Java, such as high frequency of method invocation, dynamic dispatching and dynamic loading, make Java more difficult than other object-oriented programming languages, such as C++, for conducting Worst-Case Execution Time (WCET) analysis. To offer a more flexible way to develop object-oriented real-time applications in the real-time Java environment without loss of predicability and performance, we propose a novel gain time reclaiming framework integrated with WCET analysis. This paper demonstrates how to improve the utilisation and performance of the whole system by reclaiming gain time at run-time. Our approach shows that integrating WCET with gain time reclaiming can not only provide a more flexible environment, but it also does not necessarily result in unsafe or unpredictable timing behaviour.
Hypermedia and the semantic web: A research agenda
Authors: J. R. Ossenbruggen, Lynda Hardman, L. W. Rutledge
Venue:  (2001)

Until recently, the Semantic Web was little more than a name for the next generation Web infrastructure as envisioned by its inventor, Tim Berners-Lee. Now, with the introduction of XML and RDF, and new developments such as RDF Schema and DAML+OIL, the Semantic Web is rapidly taking shape. In this paper, we first give an overview of the state-of-the-art in Semantic Web technology, the key relationships with traditional hypermedia research, and a comprehensive reference list to various sets of literature (Hypertext, Web and Semantic Web). The core of the paper presents a research agenda by describing the open research issues in the development of the Semantic Web from the perspective of hypermedia research.
A principled study of the design tradeoffs for autonomous trading agents
Authors: Ioannis A. Vetsikas, Bart Selman
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical solution is not possible. We decompose the problem into sub-problems and then use rigorous experimentation to determine the best partial strategies. In order to accomplish this we use a modular, adaptive and robust agent architecture combining principled methods and empirical knowledge. We applied this methodology when creating WhiteBear, the agent that achieved the highest score at the 2002 International Trading Agent Competition (TAC). TAC was designed as a realistic complex test-bed for designing agents trading in e-marketplaces. The agent faced several technical challenges. Deciding the optimal quantities to buy and sell, the desired prices and the time of bid placement was only part of its design. Other important issues that we resolved were balancing the aggressiveness of the agent's bids against the cost of obtaining increased flexibility and the integration of domain specific knowledge with general agent design techniques. We present our observations in dealing with these design tradeoffs and back up our conclusions with empirical results.
Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
Authors: Simon C. Borst, Onno J. Boxma, P. R. Jelenkovic
Venue:  (2000)

We analyze the queueing behavior of long-tailed traffic flows under the Generalized Processor Sharing (GPS) discipline. We show a sharp dichotomy in qualitative behavior, depending on the relative values of the weight parameters. For certain weight combinations, an individual flow with long-tailed traffic characteristics is effectively served at a constant rate. The effective service rate may be interpreted as the maximum average rate for the flow to be stable, which is only influenced by the traffic characteristics of the other flows through their average rates. In particular, the flow is essentially immune from excessive activity of flows with `heavier''-tailed traffic characteristics. In many situations, the effective service rate is simply the link rate reduced by the aggregate average rate of the other flows. This confirms that GPS-based scheduling algorithms provide a potential mechanism for extracting significant multiplexing gains, while isolating individual flows. For other weight combinations however, a flow may be strongly affected by the activity of `heavier''-tailed flows, and may inherit their traffic characteristics, causing induced burstiness. The stark contrast in qualitative behavior illustrates the crucial importance of the weight parameters.
Guide to Erroneous Executions in Ada 95
Authors: Franco Mazzanti
Venue:  (1997)

We present a detailed analysis of the possible ways in which the execution of an Ada 95 program might become totally unpredictable. In particular, we discuss those language aspects which allow a program execution to become erroneous or which have an undefined semantics. The Ada 95 language definition is assessed with respect to its completeness and clarity in presenting these aspects. The evolution of these aspects from Ada 83 to Ada 95 is summarised. TEL:: 050593447 EMAIL:: mazzanti@iei.pi.cnr.it
Skewaffine spaces in the language of distance spaces
Authors: Herbert Hotje
Venue: Discrete Mathematics (2003)

In the past Audré generalized the affine spaces under different aspects to the so-called noncommutative geometries. One of the most general definitions which was inspired by Pfalzgraf (J. Geom. 25 (1985) 147) is that of skewaffine spaces (Ann. Univ. Saraviensis. Ser. Math. 4 (1993) 93). Many interesting results are found but this subject is not much familiar to the geometry community. Maybe the reason for this lies in the language of the axioms used. Here, we will give descriptions of such spaces in the language of distance spaces as proposed by Benz (Geometrische Transformationen, BI-Wissenschaflsverlag, Mannheim, 1992). Moreover, we can find connections to other geometries like Ferrero geometries.
Online Roots: How to Discover Your Family's History and Heritage With the Power of the Internet, An NGS Guide
Authors: Pamela Boyer Porter, Amy Johnson Crow
Venue:  (2003)

:Researching family history is the second most popular topic on the Internet (after sex). In Online Roots, Pamela Boyer Porter, a Certified Genealogical Records Specialist, explains how to search effectively on the Internet, how to assess the value of what you find, and the best way to make full use of the resources of the Internet to trace your family's history and heritage.Topics covered include: Judging your sourcesChecking modern lists and resourcesFinding clues to primary sourcesResearching military recordsWhen an ancestor has a criminal recordLocating photographs on the webResearching on the Internet can be fun and challenging. Online Roots makes your search more effective and creative.
On Polynomial Invariants of Codes, Matroids and Finite Interaction Models
Authors: Barg Alexander
Venue:  (1999)

A linear code can be thought of as a vector matroid represented by the columns of code''s generator matrix; a well-known result in this context is Greene''s theorem on a connection of the weight polynomial of the code and the Tutte polynomial of the matroid. We examine this connection from the coding-theoretic viewpoint, building upon the rank polynomial of the code. This enables us to relate the weight polynomial of codes and the reliability polynomial of linear matroids and to prove bounds on the latter; to prove that the partition polynomial of the Potts model equals the weight polynomial of the cocycle code of the underlying graph, and to give a simple proof of Greene''s theorem and its generalization. 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
Towards an infinitary logic of domains: Abramsky logic for transition systems
Authors: Marcello M. Bonsangue, Joost N. Kok
Venue:  (1999)

We give a new characterization of sober spaces in terms of their completely distributive lattice of saturated sets. This characterization is used to extend Abramsky''s results about a domain logic for transition systems. The Lindenbaum algebra generated by the Abramsky finitary logic is a distributive lattice dual to an SFP-domain obtained as a solution of a recursive domain equation. We prove that the Lindenbaum algebra generated by the infinitary logic is a completely distributive lattice dual to the same SFP-domain. As a consequence soundness and completeness of the infinitary logic is obtained for a class of transition systems that is computational interesting.