ppxscal/embedding_network huggingface dataset:
Multi-strategy learning for topic detection and tracking: a joint report of CMU approaches to multilingual TDT
Authors: Yiming Yang, Jaime Carbonell, Ralf Brown, John Lafferty, Thomas Pierce, Thomas Ault
Venue: Topic detection and tracking: event-based information organization (2002)

This chapter reports on CMU's work in all the five TDT-1999 tasks, including segmentation (story boundary identification), topic tracking, topic detection, first story detection, and story-link detection. We have addressed these tasks as supervised or unsupervised classification problems, and applied a variety of statistical learning algorithms to each problem for comparison. For segmentation we used exponential language models and decision trees; for topic tracking we used primarily k-nearest-neighbors classification (also language models, decision trees and a variant of the Rocchio approach); for topic detection we used a combination of incremental clustering and agglomerative hierarchical clustering, and for first story detection and story link detection we used a cosine-similarity based measure. We also studied the effect of combining the output of alternative methods for producing joint classification decisions in topic tracking. We found that a combined use of multiple methods typically improved the classification of new topics when compared to using any single method. We examined our approaches with multi-lingual corpora, including stories in English, Mandarin and Spanish, and multi-media corpora consisting of newswire texts and the results of automated speech recognition for broadcast news sources. The methods worked reasonably well under all of the above conditions.
A Customizable Simulator for Workstation Networks
Authors: Mustafa Uysal, Anurag Acharya, Robert Bennett, Joel H. Saltz
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

We present a customizable simulator called netsim for high-performance point-to-point workstation networks that is accurate enough to be used for application-level performance analysis yet is easy enough to customize for multiple architectures and software configurations. Customization is accomplished without using any proprietary information, using only publicly available hardware specifications and information that can be readily determined using a suite of test programs. We customized netsim for two platforms: a 16-node IBM SP-2 with a multistage network and a 10-node DEC Alpha Farm with an ATM switch. We show that netsim successfully models these two architectures with a 2-6% error on the SP-2 and less than 10% error on the Alpha Farm for most test cases. It achieves this accuracy at the cost of a 7-36 fold simulation slowdown with respect to the SP-2 and a 3-8 fold slowdown with respect to the Alpha Farm.
Trusted Software's Holy Grail
Authors: Jeffrey Voas
Venue: Software Quality Control (2003)

In this paper, I discuss what I believe is the grand challenge facing the software quality research community: the ability to accurately determine, in the very earliest stages of development, the techniques that will be needed to achieve desired levels of non-functional attributes such as: reliability, availability, fault tolerance, testability, maintainability, performance, software safety, and software security. I will further consider the associated technical and economic tradeoffs that must be made in order to: (1) achieve these desired qualities, and (2) to certify that these qualities will be exhibited when the software is deployed. And I will also take into account the fact that satisfying a particular level of each attribute requires specific expenditures, some of these attributes conflict with each other, and when the environment or usage profile of the software is modified, all guarantees or claims of quality should be viewed suspiciously until additional evidence is provided.
BIST design for detecting multiple stuck-open faults in CMOS circuits using transition count
Authors: Hafizur Rahaman, Debesh K. Das, Bhargab B. Bhattacharya
Venue: Journal of Computer Science and Technology (2002)

This paper presents a built-in self-test (BIST) scheme for detecting all robustly testable multiple stuck-open faults confined to any single complex cell of a CMOS circuit. The test pattern generator (TPG) generates all n . 2n single-input-change (SIC) ordered test pairs for an n-input circuit-under-test (CUT) contained in a sequence of length 2n.2n. The proposed design is universal, i.e., independent of the structure and functionality of the CUT. A counter that counts the number of alternate transitions at the output of the CUT, is used as a signature analyzer (SA). The design of TPG and SA is simple and no special design- or synthesis-fortestability techniques and/or additional control lines are needed.
Programming with Objects: A Comparative Presentation of Object-Oriented Programming with C++ and Java
Authors: Avinash C. Kak
Venue:  (2003)

:Your essential comparative approach to learning C++ and JavaProgramming with Objects: A Comparative Presentation of Object-Oriented Programming with C++ and Java, a comparative presentation of object-oriented programming with two of the most popular programming languages of today, teaches vital skills and techniques for the Internet age. Based on highly successful courses taught by the author, this book answers the need for a comprehensive educational program on the subject of object-oriented programming. In a clear and accessible format, the author compares and contrasts both languages, from basic language constructs to how both languages are used in application-level programming, such as graphics programming, network programming, and database programming.Since both C++ and Java were born out of the same language, C, learning these two languages together has several distinct advantages:Because they have much in common at the level of basic language structures, learning C++ and Java together saves time and facilitates the mastery of eachLearning by contrast and comparison can be more efficient and enjoyable, allowing readers access to the strengths and weaknesses of both languagesLearning to write a program in one language that corresponds to a given program in the other language enables students to tackle more difficult projects in either languageComparing similar concepts in the two languages leads to a deeper understanding of the concepts in bothRoughly the first half of the text is devoted to basic language issues. More advanced topics are detailed in the second half, including programming of graphical user interfaces, multithreading, network programming, and database programming.Designed as a text for educational programs in advanced programming and as a reference for professionals implementing Web- and Internet-based applications, Programming with Objects: A Comparative Presentation of Object-Oriented Programming with C++ and Java is also recommended for programmers familiar with either language who wish to expand their programming skills.
A High Girth Graph Construction
Authors: L. Sunil Chandran
Venue: SIAM Journal on Discrete Mathematics (2003)

We give a deterministic algorithm that constructs a graph of girth logk(n) + O(1) and minimum degree k-1, taking number of nodes n and number of edges $e = {\left \lfloor nk / 2 \right \rfloor }$ (where $k < \frac {n}{3}$) as input. The degree of each node is guaranteed to be k-1, k, or k+1, where k is the average degree. Although constructions that achieve higher values of girth---up to $\frac {4}{3} \log_{k-1}{(n)}$---with the same number of edges are known, the proof of our construction uses only very simple counting arguments in comparison. Our method is very simple and perhaps the most intuitive: We start with an initially empty graph and keep introducing edges one by one, connecting vertices which are at large distances in the current graph. In comparison with the Erdös--Sachs proof, ours is slightly simpler while the value it achieves is slightly lower. Also, our algorithm works for all values of n and $k < \frac {n}{3}$, unlike most of the earlier constructions.
Dealing with Time in Social Inquiry: A Tension Between Method and Lived Experience
Authors: Michel Avital
Venue: Organization Science (2000)

In a series of interviews, organizational researchers acknowledged the key role of time in social inquiry, and their tendency to exclude it in practice. The discrepancy between what researchers think about the incorporation of temporal factors in their research and what they actually do was explained by various pragmatic, methodological, and normative grounds, but they were not aware of other epistemological and ontological barriers related to their choice. The interviews also drew attention to a paradox that stemmed from an experience of ongoing tension between the methodologically prescribed sense of time and the experientially lived impression of time. Further analysis suggests that incorporation of time factors may significantly improve social process research. The study demonstrates that temporal elements do not merely change one's perception of a situation, but also provide a space for a richer and more meaningful interpretation by enabling an improved association of a particular event with one's personal frame of reference and lived experience. In addition, the study suggests that an awareness of the various approaches to time and the application of a consistent ontological framework to the analysis of social phenomena are likely to increase the coherence and congruity of the analysis. No particular perception of time is prescribed here. The emphasis is on self-awareness of the implications of temporalities on social phenomena and on ontological consistency in our research.
Neurocomputing based Canadian weather analysis
Authors: Imran Maqsood, Muhammad Riaz Khan, Ajith Abraham
Venue: Second international workshop on Intelligent systems design and application (2002)

This paper investigates the development of a reliable and efficient neuro-computing technique to forecast the peak weather in Vancouver, British Columbia, Canada. For developing the models, we used one year's data comprising of daily maximum temperature, wind-speed and visibility. This paper briefly explains how neural network models could be formulated using different learning methods and then investigates whether they can provide the required level of performance, which are sufficiently good and robust to provide a reliable model for practical peak weather forecasting. Experiment results demonstrate that neuro-forecast models show a very good prediction performance and the approach is effective and reliable.
Non-standard approaches to integer programming
Authors: Karen Aardal, Robert Weismantel, Laurence A. Wolsey
Venue: Discrete Applied Mathematics (2002)

In this survey we address three of the principal algebraic approaches to integer programming. After introducing lattices and basis reduction, we first survey their use in integer programming, presenting among others Lenstra's algorithm that is polynomial in fixed dimension, and the solution of diophanine equations using basis reduction. The second topic concerns augmentation algorithms and test sets, including the role played by Hilbert and Gröbner bases in the development of a primal approach to solve a family of problems for all right-hand sides. Thirdly we survey the group approach of Gomory, showing the importance of subadditivity in integer programming and the generation of valid inequalities, as well the relation to the parametric problem cited above of solving for all right-hand sides.
Belief functions induced by randomized communication channels
Authors: Ivan Kramosil
Venue: Technologies for constructing intelligent systems: tools (2002)

The most often used combinatorial definition of belief function over a finite basic space S can be obtained through a binary compatibility relation ρ between the states s (elements of S) and some empirical data (observations) x from an observational space E, when x is taken as the value of a random variable X. We shall investigate a generalized version of this model supposing that the values ρ(s,x) defined by the compatibility relation in question are observed through a random binary communication channel so that the values ρ(s,x) are subjected to random changes (deformations) before reaching the subject and being accepted. The resulting randomized basic probability assignments and belief functions will be analyzed in more detail, namely, we shall prove under which conditions and in which sense and degree they can approximate the corresponding original numerical characteristics of uncertainty.
Towards team-automata-driven object-oriented collaborative work
Authors: Gregor Engels, Luuk Groenewegen
Venue: Formal and natural computing (2002)

The paper studies and compares two different approaches to model communication and cooperation. The approaches are team automata, a well-defined variant of communicating automata, and state-charts, heavily used in object-oriented modelling methods. The comparison yields interesting insights for modelling communication and cooperation. In particular, the differences between action-based, synchronous and state-based, asynchronous communication are elucidated.
Network pointers
Authors: Christian Tschudin, Richard Gold
Venue: ACM SIGCOMM Computer Communication Review (2003)

The Internet architecture can be characterized as having a rather coarse grained and imperative style of network packet handling: confronted with an IP packet and its source and destination addresses, the infrastructure almost blindly and unalterably executes hundreds of resolution, routing and forwarding decisions. There are numerous attempts that try to "extend" the Internet in order to either reduce the immediate impact an arbitrary packet can have (e.g., NAT), or to insert diversions from the normal processing paths in order to better use the existing resources (e.g., content delivery). In this paper we argue that we need a more fine grained control, in the hands of end nodes, over how packets are handled. The basic abstraction presented here is that of networking pointers, which we show to relate to low level concepts like ARP caches, but also high level routing decisions for terminal mobility, content delivery networks, or peer-to-peer overlay forming. We report on first implementation experiences of an "underlay" networking approach which uses pointer tricks underneath IP in order to provide new network layer services.
Market, Hierarchy, and Trust: The Knowledge Economy and the Future of Capitalism
Authors: Paul S. Adler
Venue: Organization Science (2001)

Recent conceptualizations of trends in the structure of U.S. industry have focused on the relative importance of markets, hierarchies, and hybrid intermediate forms. This paper advances the discussion by distinguishing three ideal-typical forms of organization and their corresponding coordination mechanisms: market/price, hierarchy/authority, and community/trust. Different institutions combine the three forms/mechanisms in different proportions. Economic and organizational theory have shown that, compared to trust, price and authority are relatively ineffective means of dealing with knowledge-based assets. Therefore, as knowledge becomes increasingly important in our economy, we should expect high-trust institutional forms to proliferate.A review of trends in employment relations, interdivisional relations, and interfirm relations finds evidence suggesting that the effect of growing knowledge-intensity may indeed be a trend toward greater reliance on trust. There is also reason to believe that the form of trust most effective in this context is a distinctively modern kind--"reflective trust"--as opposed to traditionalistic, "blind" trust. Such a trend to reflective trust appears to threaten the privileges of currently dominant social actors, and these actors' resistance, in combination with the complex interdependencies between price, authority, and trust mechanisms, imparts a halting character to the trend. But the momentum of this trend nevertheless appears to be self-reinforcing, which suggests that it may ultimately challenge the foundations of our capitalist form of society while simultaneously creating the foundations of a new, postcapitalist form.
Bringing resources to innovation
Authors: Ubiquity staff
Venue: Ubiquity (2002)

A ten-year study follows the venture capital business from relative obscurity to boom to retrenchment
Efficient mixed-domain analysis of electrostatic MEMS
Authors: Gang Li, N. R. Aluru
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

We present efficient computational methods for scattered point and meshless analysis of electrostatic microelectromechanical systems (MEMS). Electrostatic MEMS are governed by coupled mechanical and electrostatic energy domains. A self-consistent analysis of electrostatic MEMS is implemented by combining a finite cloud method based interior mechanical analysis with a boundary cloud method based exterior electrostatic analysis. Lagrangian descriptions are used for both mechanical and electrostatic analyses. Meshless finite cloud and boundary cloud methods combined with fast algorithms and Lagrangian descriptions are flexible, efficient and attractive alternatives compared to conventional finite element/boundary element methods for self-consistent electromechanical analysis. Numerical results are presented for an electrostatic comb drive device.
Three-dimensional motion and structure estimation using inertial sensors and computer vision for augmented reality
Authors: Lin Chai, William A. Hoff, Tyrone Vincent
Venue: Presence: Teleoperators and Virtual Environments (2002)

A new method for registration in augmented reality (AR) was developed that simultaneously tracks the position, orientation, and motion of the user's head, as well as estimating the three-dimensional (3D) structure of the scene. The method fuses data from head-mounted cameras and head-mounted inertial sensors. Two extended Kalman filters (EKFs) are used: one estimates the motion of the user's head and the other estimates the 3D locations of points in the scene. A recursive loop is used between the two EKFs. The algorithm was tested using a combination of synthetic and real data, and in general was found to perform well. A further test showed that a system using two cameras performed much better than a system using a single camera, although improving the accuracy of the inertial sensors can partially compensate for the loss of one camera. The method is suitable for use in completely unstructured and unprepared environments. Unlike previous work in this area, this method requires no a priori knowledge about the scene, and can work in environments in which the objects of interest are close to the user.
Product Proliferation: An Empirical Analysis of Product Line Determinants and Market Outcomes
Authors: Barry L. Bayus, William P. Putsis,  Jr.
Venue: Marketing Science (1999)

Considering the number of new product introductions and available product varieties today, the practice of product proliferation is visibly evident in many diverse industries. Given its prevalence in practice, understanding the determinants and implications of firm proliferation strategies clearly has important managerial relevance. Previous theoretical research has identified three primary effects of a proliferation strategy: (1) a broad product line can increase the overall demand faced by the firm, (2) a broad product line can affect supply by increasing costs, and (3) broad product lines can have strategic consequences (e.g., long product lines can deter entry, thereby allowing an incumbent firm to raise prices). However, despite the theoretical interest in this common business practice, there has been very little empirical research on this topic. Moreover, no empirical study has simultaneously considered all three of the possible effects associated with a proliferation strategy. Consequently, in this paper we propose a three-equation simultaneous system that captures both the determinants and market outcomes of a firm's product line decisions. In particular, we specify market share, price, and product line length equations, which are estimated by three stage least squares. Using this structure, we empirically study the personal computer industry over the period 1981-1992. Our empirical results demonstrate that proliferation strategies do not have a unidimensional explanation. We find that product proliferation decisions have both demand (market share) and supply (price) implications. Our empirical results also suggest that the firm-level net market share impact of product proliferation in the personal computer industry is negative (i.e., the cost increases associated with a broader product line dominate any potential demand increases). Asexpected, we find that structural competitive factors play an important role in the determinants and market outcomes ofa firm's product line decisions. However, we do not find evidence of firms using proliferation strategies to deter entry in this industry. Finally, we also demonstrate that some of the empirical conclusions from previous research are reversed once product line length is specified as endogenous in the share and price specifications.
On a deconcatenation problem
Authors: Henry Ibstedt
Venue: Smarandache notions (2002)

In a recent study of the Primality of the Smarandache Symmetric Sequences Sabin and Tatiana Tabirca [1] observed a very high frequency of the prime factor 333667 in the factorization of the terms of the second order sequence. The question if this prime factor occurs peridically was raised. The odd behaviour of this and a few other primefactors of this sequence will be explained and details of the periodic occurence of this and of several other prime factors will be given.
The National Energy Modeling System: A Large-Scale Energy-Economic Equilibrium Model
Authors: Steven A. Gabriel, Andy S. Kydes, Peter Whitman
Venue: Operations Research (2001)

The National Energy Modeling System (NEMS) is a large-scale mathematical model that computes equilibrium fuel prices and quantities in the U.S. energy sector and is currently in use at the U.S. Department of Energy (DOE). At present, to generate these equilibrium values, NEMS iteratively solves a sequence of linear programs and nonlinear equations. This is a nonlinear Gauss-Seidel approach to arrive at estimates of market equilibrium fuel prices and quantities. In this paper, we present existence and uniqueness results for NEMS-type models based on a nonlinear complementarity/variational inequality problem format. Also, we document mathematically, for the first time, how the inputs and the outputs for each NEMS module link together.
Constructor-based conditional narrowing
Authors: Sergio Antoy
Venue: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming (2001)

We define a transformation from a left-linear constructor-based conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound and complete for the computations in the source system. Since there exists a sound and complete narrowing strategy for the target system, the combination of these results offers the first procedure for provably sound and complete narrowing computations for the whole class of the leftlinear constructor-based conditional rewrite systems. We address the differences between demand driven and lazy strategies and between narrowing strategies and narrowing calculi. In this context, we analyze the efficiency and practicality of using our transformation for the implementation of functional logic programming languages. The results of this paper complement, extend, and occasionally rectify, previously published results in this area.
On a problem concerning the Smarandache friendly prime pairs
Authors: Felice Russo
Venue: Smarandache Notions Journal (2002)

In this paper a question posed in [1] and concerning the Smarandache friendly prime pairs is analysed.