ppxscal/embedding_network huggingface dataset:
Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
Authors: Colin Cooper, Alan Frieze, Bruce Reed
Venue: Combinatorics, Probability and Computing (2002)

Let Gr denote a graph chosen uniformly at random from the set of r-regular graphs with vertex set &lcub;1,2, &hellip;, n&rcub;, where 3 &les; r &les; c0n for some small constant c0. We prove that, with probability tending to 1 as n &rarr; &infin;, Gr is r-connected and Hamiltonian.
Countering terrorism through information technology
Authors: Robert Popp, Thomas Armour, Ted Senator, Kristen Numrych
Venue: Communications of the ACM (2004)

Developing the information-analysis tools for an effective multi-agency information-sharing effort.
Role-based access control for publish/subscribe middleware architectures
Authors: András Belokosztolszki, David M. Eyers, Peter R. Pietzuch, Jean Bacon, Ken Moody
Venue: Proceedings of the 2nd international workshop on Distributed event-based systems (2003)

Research into publish/subscribe messaging has so far done little to propose architectures for the support of access control, yet this will be an increasingly critical requirement as systems move to Internet-scale. This paper discusses the general requirements of publish/subscribe systems with access control. We then present our specific integration of OASIS role-based access control into the Hermes publish/subscribe middleware platform. Our system supports many advanced features, such as the ability to work within a network where nodes are attributed different levels of trust, and employs a variety of access restriction methods which balance expressiveness with the content-based routing optimisations available. We illustrate our achievements by discussing an application scenario in which our system will be of particular use.
Toolkit: Java is Jumpin'
Authors: Alexander Wolfe
Venue: Queue (2004)

There’s perception, and then there’s reality. Even though the frenzied hype over Java has died down since the Internet bubble burst, Java is becoming hugely popular in the wireless space. Several events highlight its emergence. Most recently, in December, Texas Instruments opened a research operation in France to focus on the integration of Java apps into the next generation of wireless devices.1
Nonparametric estimation of the location of a maximum in a response surface
Authors: Matthew R. Facer, Hans-Georg Müller
Venue: Journal of Multivariate Analysis (2003)

We explore a nonparametric version of response surface analysis. Estimates for the location where maximum response occurs are proposed and their asymptotic distribution is investigated. The proposed estimates are based on kernel and local least squares methods. We construct asymptotic confidence regions for the location and include comparisons with the quadratic response surface approach. The methods are illustrated for the two-dimensional case with AIDS incidence data, where the point of maximum incidence is of interest.
Network voltage profile correction by discrete shunt compensation
Authors: P. J. Lagacé
Venue: Mathematics and Computers in Simulation (2003)

Efficient methods are needed to evaluating discrete shunt control actions required for maintaining acceptable voltage levels following changes in loads and after network contingencies. Evaluating all possible shunt combinations would involve an excessive amount of computation. An algorithm has been developed to restrict the cases considered so that optimization is done on a subset of discrete shunt combinations. Results are presented for voltage control following changes in load level and after contingencies. A method is proposed to restrict the number of discrete shunt combinations to be considered after changes in load or following network contingencies. The emphasis in on real-time calculations. Optimization is done on a subset of discrete shunt combinations to minimize voltage deviations from desired values, the number of shunt switching events, and power system losses.
A bisimulation for dynamic sealing
Authors: Eijiro Sumii, Benjamin C. Pierce
Venue: ACM SIGPLAN Notices (2004)

We define λseal, an untyped call-by-value λ-calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with respect to contextual equivalence. This provides a formal basis for reasoning about data abstraction in open, dynamic settings where static techniques such as type abstraction and logical relations are not applicable.
A quadtree approach to domain decomposition for spatial interpolation in grid computing environments
Authors: Shaowen Wang, Marc P. Armstrong
Venue: Parallel Computing (2003)

Spatial interpolation is widely used in geographical information systems to create continuous surfaces from discrete data points. The creation of such surfaces, however, can involve considerable computation, especially when large problems are addressed, because of the need to search for neighbors on which to base interpolation calculations. Computational Grids provide the computing resources to tackle spatial interpolation in a timely way. The objective of this paper is to investigate the use of domain decomposition for a distributed inverse-distance-weighted spatial interpolation algorithm; the algorithm runs using the Globus Toolkit (GT) in a heterogeneous Grid computing environment. The interpolation algorithm is modified for implementation in the Grid by using a quadtree to spatially index and adaptively decompose the interpolation problem to balance processing loads. In addition, the GT allows the distributed algorithm to couple multiple machines, potentially of different architectures, to dynamically schedule the decomposed sub-problems through Globus services and protocols (e.g., resource management, data transfer). Experiments are conducted to test how well this distributed IDW interpolation algorithm scales to heterogeneous grid computing environments using irregularly distributed geographical data sets.
Digital Artifacts for Remembering and Storytelling: PostHistory and Social Network Fragments
Authors: Fernanda B. Viégas, Danah Boyd, David H. Nguyen, Jeffrey Potter, Judith Donath
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

As part of a long-term investigation into visualizing email, we have created two visualizations of email archives. One highlights social networks while the other depicts the temporal rhythms of interactions with individuals. While interviewing users of these systems, it became clear that the applications triggered recall of many personal events. One of the most striking and notentirely expected outcomes was that the visualizations motivated retelling stories from the users' pasts to others. In this paper, we discuss the motivation and design of these projects and analyze their use as catalysts for personal narrative and recall.
Resource scheduling on grid: handling uncertainty
Authors: Rodrigo Real, Adenauer Yamin, Luciano da Silva, Gustavo Frainer, Iara Augustin, Jorge Barbosa, Cláudio Geyer
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

The heterogeneity and the highly dynamic behavior ofthe grid computing demands a new class of schedulingstrategies. These strategies must not only consider the instantaneousinformation provided by sensors, but also probabilitiesof the information received to keep its values in anear future.
Modified Booth Modulo 2^n-1 Multipliers
Authors: C. Efstathiou, H. T. Vergos, D. Nikolos
Venue: IEEE Transactions on Computers (2004)

Abstract--2^n-1 is one of the most commonly used moduli in Residue Number Systems. In this paper, we propose a new method for designing modified Booth modulo 2^n-1 multipliers, which, for even values of n, require one less partial product than the already known. CMOS implementations reveal that the proposed multipliers compared to earlier solutions offer savings up to 28.7 percent and up to 29.3 percent in the implementation area and execution delay, respectively.
A text recognition system based on graph embedding matching
Authors: Theo Pavlidis
Venue:  (2003)

This thesis presents a text recognition system whose major features include a time-efficient shape matching scheme that emphasizes the concept of matching graph embeddings for OCR, a method for touching character recognition that defines multiple criteria for the selection of break points, and the integration of various knowledge sources such as layout information, font information and contextual knowledge into the system. Matching graph embeddings for shape analysis has two advantages compared to previous methods. One is its time-efficiency achieved by matching the geometrical labels of the graphs followed by the topology of the graphs and thus avoiding combinatorial search. The other one is that multiple-to-one feature matching is included naturally in the matching process. For touching character recognition, multiple criteria are defined to over-segment the input unit on the basis of both image properties and feature characteristics. A dynamic programming algorithm is implemented to evaluate all possible segmentation alternatives for the whole input unit and output the best overall matching result. We stress the importance of utilizing various knowledge sources in an OCR system. Layout processing avoids the confusions across layout classes. Font recognition reduces the confusions across font families. Contextual processing detects and corrects recognition errors. Recognition results on printed text pages of various fonts have demonstrated the strength of the system.
Study on life-cycle design for the post mass production paradigm
Authors: Yasushi Umeda, Akira Nonomura, Tetsuo Tomiyama
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

Environmental issues require a new manufacturing paradigm because the current mass production and mass consumption paradigm inevitably cause them. We have already proposed a new manufacturing paradigm called the &ldquo;Post Mass Production Paradigm (PMPP)&rdquo; that advocates sustainable production by decoupling economic growth from material and energy consumption. To realize PMPP, appropriate planning of a product life cycle (design of life cycle) is indispensable in addition to the traditional environmental conscious design methodologies. For supporting the design of a life cycle, this paper proposes a life-cycle simulation system that consists of a life-cycle simulator, an optimizer, a model editor, and knowledge bases. The simulation system evaluates product life cycles from an integrated view of environmental consciousness and economic profitability and optimizes the life cycles. A case study with the simulation system illustrates that the environmental impacts can be reduced drastically without decreasing corporate profits by appropriately combining maintenance, reuse and recycling, and by taking into consideration that optimized modular structures differ according to life-cycle options.
Theorems on partitions from a page in Ramanujan's lost notebook
Authors: Bruce C. Berndt, Ae Ja Yee, Jinhee Yi
Venue: Journal of Computational and Applied Mathematics (2003)

On page 189 in his lost notebook, Ramanujan recorded five assertions about partitions. Two are famous identities of Ramanujan immediately yielding the congruences p(5n+4) ≡ 0 (mod 5) and p(7n+5) ≡ 0 (mod 7) for the partition function p(n). Two of the identities, also originally due to Ramanujan, were rediscovered by M. Newman, who used the theory of modular forms to prove them. The fifth claim is false, but Ramanujan corrected it in his unpublished manuscript on the partition and τ-functions. The purpose, of this paper is to give completely elementary proofs of all four claims. In particular, although Ramanujan's elementary proof for his identity implying the congruence p(7n + 5) ≡ 0 (mod 7) is sketched in his unpublished manuscript on the partition and τ-functions, it has never been given in detail. This proof depends on some elementary identities mostly found in his notebooks; new proofs of these identities are given here.
Extending the Information System Lifecycle through Enterprise Application Integration: A Case Study Experience
Authors: Marinos Themistocleous, Zahir Irani, Jasna Kuljis, Peter E. D. Love
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Enterprise Application Integration (EAI) technologies support a direct move away from disparate systems operating in parallel towards a more common shared architecture, where systems evolve and merge together. Such an emergence however, presents a paradigm shift in the way that Information System (IS) lifecycles are viewed. The integration of IS in-line with the needs of the business is altering IS identity and extending their lifecycle. This makes evaluating the full impact of the system difficult, as it has no definitive start and/or end. The authors demonstrate, through a case study of IS applications within an e-Government framework, that EAI can be used as a portfolio of technologies that improves infrastructure integration. However, in doing so, the authors create the need to re-think traditional IS-Lifecycle norms.
Errors in the UML metamodel?
Authors: José M. Fuentes, Víctor Quintana, Juan Llorens, Gonzalo Génova, Rubén Prieto-Díaz
Venue: ACM SIGSOFT Software Engineering Notes (2003)

The Unified Modeling Language (UML) is becoming a standard for software specification, verification, visualization and documentation. Using the rules provided by the standard, software engineers can create models that are concrete and unambiguous.UML creators Booch, Rumbaugh and Jacobson, have defined the standard using UML terminology: they use model elements to define the standard. This way of representing UML is called UML Metamodel, and it is publicly available along with the English definition of the standard.The UML metamodel is intended for software engineers to verify the correctness of their models. It should be assumed, therefore, that the UML metamodel is itself error free. A close study of the UML metamodel by the authors, however, has shown that this may not be the case.After checking the Metamodel with all the rules, constraints and well-formedness rules defined by the standard, the authors found 450 errors and classified them in three different groups:1. Non-accessible elements: represents the most important problem found in the metamodel, and involves some misunderstandings with the contents method.2. Empty names: some rules of the standard states that some elements could not have the same name. Nevertheless, the standard does not clarify whether there could exist two different elements without name, which could be considered as the same (empty) name.3. Miscellanea: this last group of problems deals with duplicated names and derived associations.This paper analyzes and explains the reason for the errors and presents some suggestions for correcting, what the authors believe, are some deficiencies in UML's current standard. The analysis presented should be valuable to practicing software engineers engaged in software modeling.
Design, implementation and use of the mirv experimental compiler for computer architecture research
Authors: David Anthony Greene
Venue:  (2003)

This dissertation introduces MIRV, an experimental compiler developed for computer architecture research. We discuss the design and implementation of the compiler and use it to conduct studies of various techniques to tolerate memory latency. On the instruction side, a thorough examination of hardware and software prefetching techniques is performed to evaluate their utility on several modern computer designs. Various points of ambiguity in the literature are identified and the consequences of their specification are studied. A framework for describing software instruction prefetching algorithms is developed and extensions to current techniques are analyzed. Previous research has shown that larger data register sets than are currently available in modern microprocessors are desirable. Various extensions to this research are explored to further increase the utility of the register file.
Text-translation alignment
Authors: Martin Kay, Martin Röscheisen
Venue: Computational Linguistics (1993)

We present an algorithm for aligning texts with their translations that is based only on internal evidence. The relaxation process rests on a notion of which word in one text corresponds to which word in the other text that is essentially based on the similarity of their distributions. It exploits a partial alignment of the word level to induce a maximum likelihood alignment of the sentence level, which is in turn used, in the next iteration, to refine the word level estimate. The algorithm appears to converge to the correct sentence alignment in only a few iterations.
A study into the feasibility of generic programming in Java
Authors: Santi Caballe, Fatos Xhafa
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

A high degree of abstraction and capacity for reuse can be obtained in software design through the use of generic programming(GP). For this to be possible, the programming must be implemented in a language that is able to adapt and correctly transmit this capacity. In this study we show that Java is feasible for generic software design and that it is predisposed to making this software reusable. To this end, we consider the design of a library of generic components based on the GP and we implement it with Java.
Identification Problem for Matrix-Integrating Systems
Authors: V. A. Stoyan
Venue: Cybernetics and Systems Analysis (2003)

Identification problems are solved, where input signal is presented by the integral transformation kernels of discrete and time-continuous vector functions and the output signal is a static vector based on a number of observations over the system. Algorithms of solving this problem are presented for the case where one of system inputs is informationally dependent on the others.
The skew elliptical distributions and their quadratic forms
Authors: B. Q. Fang
Venue: Journal of Multivariate Analysis (2003)

In this paper, a family of the skew elliptical distributions is defined and investigated. Some basic properties, such as stochastic representation, marginal and conditional distributions, distribution under linear transformations, moments and moment generating function are derived. The joint distribution of several quadratic forms is obtained. An example is given to show that the distributions of some statistics as the functions of the quadratic forms can be derived for various applications.
Features of the concurrent programming language Aldwych
Authors: Matthew Huntbach
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper describes a concurrent programming language, Aldwych. The language has a simple operational model where any variable has exactly one process that can write to it but any number that can read it. Once a variable has been written to its value cannot be changed, but a tuple value can be written to a variable, and variables within the tuple written to later. Processes consist of a set of rules which are triggered when variables are given values.We show how this underlying model can be extended using a number of derived forms so that Aldwych has features of imperative, object-oriented and functional programming.
On the Structure of Dense Triangle-Free Graphs
Authors: Stephan Brandt
Venue: Combinatorics, Probability and Computing (1999)

As a consequence of an early result of Pach we show that every maximal triangle-free graph is either homomorphic with a member of a specific infinite sequence of graphs or contains the Petersen graph minus one vertex as a subgraph. From this result and further structural observations we derive that, if a (not necessarily maximal) triangle-free graph of order n has minimum degree &delta;&ge;n&#x002F;3, then the graph is either homomorphic with a member of the indicated family or contains the Petersen graph with one edge contracted. As a corollary we get a recent result due to Chen, Jin and Koh. Finally, we show that every triangle-free graph with &delta;>n&#x002F;3 is either homomorphic with C5 or contains the M&ouml;bius ladder. A major tool is the observation that every triangle-free graph with &delta;&ge;n&#x002F;3 has a unique maximal triangle-free supergraph.
RR-TCP: A Reordering-Robust TCP with DSACK
Authors: Ming Zhang, Brad Karp, Sally Floyd, Larry Peterson
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

TCP performs poorly on paths that reorder packets significantly, where it misinterprets out-of-order delivery as packet loss. The sender responds with a fast retransmit though no actual loss has occurred. These repeated false fast retransmits keep the sender's windowsmall, and severely degrade the throughput it attains. Requiring nearly in-order delivery needlessly restricts and complicates Internet routing systems and routers. Such beneficial systems as multi-path routing and parallel packet switches are difficult to deploy in a way that preserves ordering. Toward a more reordering-tolerant Internet architecture, we present enhancements to TCP that improve the protocol's robustness to reordered and delayed packets. We extend the sender to detect and recover from false fast retransmits using DSACK information, and to avoid false fast retransmits proactively, by adaptively varying dupthresh. Our algorithm is the first that adaptively balances increasing dupthresh, to avoid false fast retransmits, and limiting the growth of dupthresh, to avoid unnecessary timeouts. Finally, we demonstrate that TCP's RTO estimator tolerates delayed packets poorly, and present enhancements to it that ensure it is sufficiently conservative, without using timestamps or additional TCP header bits. Our simulations show that these enhancements significantly improve TCP's performance over paths that reorder or delay packets.
Do the Web sites of higher rated scholars have significantly more online impact?
Authors: Mike Thelwall, Gareth Harries
Venue: Journal of the American Society for Information Science and Technology (2004)

The quality and impact of academic Web sites is ofinterest to many audiences, including the scholars who use them and Web educators who need to identify best practice. Several large-scale European Union research projects have been funded to build new indicators for online scientific activity, reflecting recognition of the importance of the Web for scholarly communication. In this paper we address the key question of whether higher rated scholars produce higher impact Web sites, using the United Kingdom as a case study and measuring scholars' quality in terms of university-wide average research ratings. Methodological issues concerning the measurement of the online impact are discussed, leading to the adoption of counts of links to a university's constituent single domain Web sites from an aggregated counting metric. The findings suggest that universities with higher rated scholars produce significantly more Web content but with a similar average online impact. Higher rated scholars therefore attract more total links from their peers, but only by being more prolific, refuting earlier suggestions. It can be surmised that general Web publications are very different from scholarly journal articles and conference papers, for which scholarly quality does associate with citation impact. This has important implications for the construction of new Web indicators, for example that online impact should not be used to assess the quality of small groups of scholars, even within a single discipline.