ppxscal/embedding_network huggingface dataset:
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Venue: International Conference on Knowledge Discovery and Data Mining (2002)

The KDD 2002 conference, held from 23rd to 26th July 2002, was the eighth in the series. It represented a return to the country in which the series was launched: the first was held in Montreal, Canada, and this, the eighth, was held in Edmonton, Canada. In the years between the first conference in the series and this present one, data mining has be, come a well-established discipline. It has continued to strengthen its links to other data analytic disciplines, including statistics, machine learning, pattern recognition, visualization, and database technology, but has now clearly carved out a niche of its own. Over the period in which this series has been running, hardware technology has continued to advance in great leaps, with the result that large databases have continued to grow in both number and size. The implication is that the challenge of data mining is even more important, that the problems requiring data mining solutions are ever more ubiquitous, and that new tools and methods for tackling are even more necessary.KDD 2002 received a record number of submitted papers - 307 in total, 37 of which were considered for the industral/applicafion track. Among the 270 research submissions, 32 were selected (12%) for full papers; and among the 37 industrial/application submissions, 12 (32%) were selected for full papers. An additional 44 submissions were chosen to be presented as posters, a vast majority of which were research submissions. This low rate of acceptance reflects a conscious effort to maintain the very high standards of quality and relevance, which have been achieved by previous conferences in the series. It means that the papers and posters in the proceedings represent the cutting edge of data mining problemsl solutions, and technology. On the other hand, this policy inevitably meant that many excellent contributions did not make it to the final program. The choice had to be informed by balance as well as quality - KDD 2002 had to showcase research in data mining across the entire frontier of the discipline. This breadth was reflected in the choice of invited speakers, both well known in the data mining; community, but from different backgrounds: Daryl Pregibon and Geoff Hinton. The program also includes 6 workshops in such diverse areas as 'Data Mining in Bioinformatics', 'Web Mining', 'Multimedia Data Mining', 'Multi-Relational Data Mining', 'Temporal Data Mining', and 'Fractals in Data Mining' as well as 6 tutorials on 'Text Mining for Bioinformatics', 'Querying and Mining Data Streams', 'Link Analysis', 'Multivariate Density Estimation', 'Common Reasons Data Mining Projects Fail', and 'Visual Data Mining'.
A retrospective view of ATM
Authors: Charles Kalmanek
Venue: ACM SIGCOMM Computer Communication Review (2002)

ATM was the focus of active research and significant investment in the early to mid 1990's. This paper discusses several visions for ATM prevalent at the time, and analyzes how ATM evolved during this period. The paper also considers the implications of this history for current connection-oriented technologies, such as optical transport networks and MPLS.
Automatic Thematic Extractor
Authors: Colin Meek, William P. Birmingham
Venue: Journal of Intelligent Information Systems (2003)

We have created a system that identifies musical "keywords" or themes. The system searches for all patterns composed of melodic (intervallic for our purposes) repetition in a piece. This process generally uncovers a large number of patterns, many of which are either uninteresting or only superficially important. Filters reduce the number or prevalence, or both, of such patterns. Patterns are then rated according to perceptually significant characteristics. The top-ranked patterns correspond to important thematic or motivic musical content, as has been verified by comparisons with published musical thematic catalogs. The system operates robustly across a broad range of styles, and relies on no meta-data on its input, allowing it to independently and efficiently catalog multimedia data.
High-performance implementation and analysis of the linkmap program
Authors: Kulin Kothari, Noe Lopez-Benitez, S. E. Poduslo
Venue: Computers and Biomedical Research (2001)

Linkage analysis uses information from family pedigrees to map genes and locate disease genes on particular chromosomes. A recombination fraction denoted as θ is estimated as a measure of crossing over between two loci. Genetic linkage calculations are very time-consuming particularly for large family pedigrees, a large number of θ values, and an increased number of markers. This paper reports the implementation of a dynamic master-slave scheme for the parallelization of the Link-map program on a high-performance cluster such as the Origin 2000 (O2K) consisting of 56 R12000 processors. The Linkmap program is one of four programs in the LINKAGE/FASTLINK legacy package widely used by the medical research community. Implementations issues are addressed and results are compared with previous results on a cluster of DEC Alphas, and with the sequential execution on the O2K machine.
Reflections on the user centered design (UCD) perspective in research on wireless applications
Authors: Michele Visciola
Venue: Ubiquity (2003)

In order to play an influential role in research and practice, UCD communities should implement new methods and tools into current practices and advance the boundaries of the field.
Computational selection of distinct class- and subclass-specific gene expression signatures
Authors: Pierre R. Bushel, Hisham K. Hamadeh, Lee Bennett, James Green, Alan Ableson, Stephen Misener, Cynthia A. Afshari, Richard S. Paules
Venue: Journal of Biomedical Informatics (2002)

In this investigation we used statistical methods to select genes with expression profiles that partition classes and subclasses of biological samples. Gene expression data corresponding to liver samples from rats treated for 24 h with an enzyme inducer (phenobarbital) or a peroxisome proliferator (clofibrate, gemfibrozil or Wyeth 14,643) were subjected to a modified Z-score test to identify gene outliers and a binomial distribution to reduce the probability of detecting genes as differentially expressed by chance. Hierarchical clustering of 238 statistically valid differentially expressed genes partitioned class-specific gene expression signatures into groups that clustered samples exposed to the enzyme inducer or to peroxisome proliferators. Using analysis of variance (ANOVA) and linear discriminant analysis methods we identified single genes as well as coupled gene expression profiles that separated the phenobarbital from the peroxisome proliferator treated samples and discerned the fibrate (gemfibrozil and clofibrate) subclass of peroxisome proliferators. A comparison of genes ranked by ANOVA with genes assessed as significant by mixed linear models analysis [J. Comput. Biol. 8 (2001) 625] or ranked by information gain revealed good congruence with the top 10 genes from each statistical method in the contrast between phenobarbital and peroxisome proliferators expression profiles. We propose building upon a classification regimen comprised of analysis of replicate data, outlier diagnostics and gene selection procedures to utilize cDNA microarray data to categorize subclasses of samples exposed to pharmacologic agents.
Cellular automata and intermediate degrees
Authors: K. Sutner
Venue: Theoretical Computer Science (2003)

We study a classification of cellular automata based on the Turing degree of the orbits of the automaton. The difficulty of determining the membership of a cellular automaton in any one of these classes is characterized in the arithmetical hierarchy.
Stabilizing Batch-Processing Networks
Authors: J. G. Dai, Caiwei Li
Venue: Operations Research (2003)

In a batch-processing network, multiple jobs can be formed into a batch to be processed in a single service operation. The network is multiclass in that several job classes may be processed at a server. Jobs in different classes cannot be mixed into a single batch. A batch policy specifies which class of jobs is to be served next. Throughput of a batch-processing network depends on the batch policy used. When the maximum batch sizes are equal to one, the corresponding network is called a standard-processing network, and the corresponding service policy is called a dispatch policy. There are many dispatch policies that have been proven to maximize the throughput in standard networks. This paper shows that anynormal dispatch policy can be converted into a batch policy that preserves key stability properties. Examples of normal policies are given. These include static buffer priority (SBP), first-in-first-out (FIFO), and generalized round robin (GRR) policies.
Processor architectures for multimedia applications
Authors: P. Pirsch, A. Freimann, C. Klar, J. P. Wittenburg
Venue: Embedded processor design challenges: systems, architectures, modeling, and simulation-SAMOS (2002)

An overview on processor architectures for multimedia applications is presented. Emphasis is on architectural strategies to achieve the required processing power of real-time applications. Architectural approaches for exploitation of the inherent parallelization resources of signal processing schemes are first discussed. The impact of algorithm on the appropriate architectures is displayed for three representative multimedia applications. The discussed applications are block-based video coding as used in MPEG-2, multiplexing for video broadcasing based on OFDM and object oriented video coding according to MPEG-4. Characteristic processor architectures adapted to the needs of these applications are introduced. Architectural structures of the AxPe-DSP, the HiPAR-DSP and a MPEG-4 system are presented as examples. Advances in multimedia processing require processors with high flexibilty on parallel processing and dynamic adaptation capabilties. As promising architectural concepts for advanced multimedia applications reconfigurable computing, simultaneous multithreading, and associative controlling are discussed.
On the equational definition of the least prefixed point
Authors: Luigi Santocanale
Venue: Theoretical Computer Science (2003)

We propose a method to axiomatize by equations the least prefixed point of an order preserving function. We discuss its domain of application and show that the Boolean modal µ-calculus has a complete equational axiomatization. The method relies on the existence of a "closed structure" and its relationship to the equational axiomatization of Action Logic is made explicit. The implication operation of a closed structure is not monotonic in one of its variables; we show that the existence of such a term that does not preserve the order is an essential condition for defining by equations the least prefixed point. We stress the interplay between closed Structures and fixed point operators by showing that the theory of Boolean modal µ-algebras is not a conservative extension of the theory of modal µ-algebras. The latter is shown to lack the finite model property.
Parallelizing while loops for multiprocessor systems
Authors: Lawrence Rauchwerger, David A. Padua
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Current parallelizing compilers treat while loops and do loops with conditional exits as sequential constructs because their iteration space is unknown. Because these types of loops arise frequently in practice, we have developed techniques that can automatically transform them for parallel execution. We succeed in parallelizing loops involving linked lists traversals-something that has not been done before. This is an important problem since linked list traversals arise frequently in loops with irregular access patterns, such as sparse matrix computations. The methods can even be applied to loops whose data dependence relations cannot be analyzed at compile-time. Experimental results on loops from the PERFECT Benchmarks and sparse matrix packages show that these techniques can yield significant speedups.
Fast Heuristics for the Maximum Feasible Subsystem Problem
Authors: John W. Chinneck
Venue: INFORMS Journal on Computing (2001)

Given an infeasible set of linear constraints, finding the maximum cardinality feasible subsystem is known as themaximum feasible subsystem problem. This problem is known to be NP-hard, but has many practical applications. This paper presents improved heuristics for solving the maximum feasible subsystem problem that are significantly faster than the original, but still highly accurate.
Synchronization and handoff management schemes for wireless multimedia systems
Authors: Azzedine Boukerche, Sungbum Hong, Tom Jacob
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

This paper presents handoff management schemes for synchronization algorithms for wireless multimedia systems. The synchronization and handoff management schemes allow mobile hosts to receive time-dependant multimedia streams without delivery interruption while moving from one cell to another. They also maintain the correct ordering of the media components, through the execution of the wireless multimedia application by a means of timestamped messages passed among mobile hosts, base stations and servers. The timestamp values are used to compute the delay for each multimedia unit for each server. Furthermore, the proposed schemes always search for a quasi-receiver among the base stations with which the mobile hosts can communicate to synchronize multimedia units. We discuss the algorithms and present a set of simulation experiments that evaluate the performance of our schemes, using message complexity and buffer usage at each frame arrival time. Our results indicate that our schemes exhibit no underflow or overflow within the bounded delivery time.
Pulsatile flow of blood through a stenosed porous medium under periodic body acceleration
Authors: Moustafa El-Shahed
Venue: Applied Mathematics and Computation (2003)

Pulsatile flow of blood through a stenosed porous medium has been studied under the influence of body acceleration. With the help of Laplace and finite Hankel transform, analytical expressions for axial velocity, fluid acceleration, flow rate and shear stress have been obtained. The effect of various parameters entering into the problem is discussed wiht the help of graphs.
Adaptive Suboptimal Tracking for a First-Order Object under Lipschitz Uncertainty
Authors: V. F. Sokolov
Venue: Automation and Remote Control (2003)

Adaptive suboptimal tracking for a first-order discrete object under Lipschitz uncertainty and bounded external perturbations is studied. The new nonlinear control law due to L.L. Xie and L. Guo based on nonparametric estimation of the stationary uncertainty is applied to control the object with a known linear part. This control law admits uncertainty with the Lipschitz constant L < 3/2 + &radic;2. The upper estimate for the quality criterion, which is equal to the upper limit of the modulus of deviation of the output of the object from a given signal, is derived as a function of the Lipschitz constant and norm of the external perturbation. Unknown parameters in the closed-loop are estimated by the method of recurrent objective inequalities. The adaptive control is suboptimal due to the use of cone estimates for the vector of unknown parameters.
Affinity to infinity in peer-to-peer knowledge platforms
Authors: Amrit Tiwana
Venue: Communications of the ACM (2003)

Adapting the social paradigm of face-to-face human communication, they promote ad hoc knowledge exchange among peers, leveraging individual expertise at the periphery of the network.
Some Quality Improvement Principles Useful in the Or/Ms Research and Publication Process
Authors: Kaj Holmberg, Johan Hellstrand, Marvin D. Troutt
Venue: Operations Research (1998)

The OR/MS research and publication process provides a particularly effective setting in which to illustrate and emphasize the importance of several general quality improvement principles. From planning the scope and content to final manuscript production, numerous quality checks are beneficial. The academic writer never knows that the quality of an article is sufficient until it has actually been published. Even then, potential defects are possible and should be guarded against throughout the process. Beginning scholars may fail to publish successfully by disregarding some of these principles. This article discusses the connection of general quality principles to the scientific article writing process. Also, some specific techniques used by the author are described.
Developing object-oriented enterprise quality frameworks using proto-frameworks
Authors: Marcelo Campo, Andrés Díaz Pace, Mario Zito
Venue: Software&mdash;Practice Experience (2002)

In this article, we present an approach to architecture-driven design of object-oriented frameworks based on the notion of object-oriented materialization of architectural styles. This approach leads us to the development of the proto-framework concept, which is a new denomination for an object-oriented framework that provides the essential basis to build other frameworks that adopt an underlying architectural design derived from non-object-oriented styles. In this context, we describe the approach to framework design, the design of a particular proto-framework called Bubble, and a real example of its application to the design of an enterprise framework.
Optimal Component Assignment and Board Grouping Inprinted Circuit Board Manufacturing
Authors: Mark S. Hillier, Margaret L. Brandeau
Venue: Operations Research (1998)

We consider operation assignment problems arising from a printed circuit board assembly process. The research was inspired by an application at Hewlett Packard where hundreds of types of printed circuit boards require the insertion of a number of components. The components can be inserted manually or by semiautomated insertion machines. The machines are limited in terms of the number of different component types that they can hold. We investigate how to assign the boards and components to the machines and manual process so as to minimize cost. An optimal solution technique is developed for the single-machine case and for the multiple-machine case where boards are not allowed to be set up on more than one process. In addition, a heuristic is developed which gives near-optimal solutions (within 0.3%) with much less computational effort. Although the problem this paper specifically addresses is that of partially automated PC board assembly, the results apply to a more general set of problems. Other applications include completely automated PC board assembly, flexible manufacturing systems, and general operation assignment problems.
Application of Temporal Descriptors to Musical Instrument Sound Recognition
Authors: Alicja A. Wieczorkowska, Jakub Wróblewski, Piotr Synak, Dominik Ślȩzak
Venue: Journal of Intelligent Information Systems (2003)

An automatic content extraction from multimedia files is recently being extensively explored However, an automatic content description of musical sounds has not been broadly investigated and still needs an intensive research. In this paper, we investigate how to optimize sound representation in terms of musical instrument recognition purposes. We propose to trace trends in the evolution of values of MPEG-7 descriptors in time, as well as their combinations. Described process is a typical example of KDD application, consisting of data preparation, feature extraction and decision model construction. Discussion of efficiency of applied classifiers illustrates capabilities of possible progress in the optimization of sound representation. We believe that further research in this area would provide background for an automatic multimedia content description.
Research Commentary: Desperately Seeking the "IT" in IT Research--A Call to Theorizing the IT Artifact
Authors: Wanda J. Orlikowski, C. Suzanne Iacono
Venue: Information Systems Research (2001)

The field of information systems is premised on the centrality of information technology in everyday socio-economic life. Yet, drawing on a review of the full set of articles published inInformation Systems Research ( ISR) over the past ten years, we argue that the field has not deeply engaged its core subject matter--the information technology (IT) artifact. Instead, we find that IS researchers tend to give central theoretical significance to the context (within which some usually unspecified technology is seen to operate), the discrete processing capabilities of the artifact (as separable from its context or use), or the dependent variable (that which is posited to be affected or changed as technology is developed, implemented, and used). The IT artifact itself tends to disappear from view, be taken for granted, or is presumed to be unproblematic once it is built and installed. After discussing the implications of our findings, we propose a research direction for the IS field that begins to take technology as seriously as its effects, context, and capabilities. In particular, we propose that IS researchers begin to theorize specifically about IT artifacts, and then incorporate these theories explicitly into their studies. We believe that such a research direction is critical if IS research is to make a significant contribution to the understanding of a world increasingly suffused with ubiquitous, interdependent, and emergent information technologies.
Calculating the Distribution of a Linear Combination of Uniform Order Statistics
Authors: Morganna Carmem Diniz, Edmundo de Souza e Silva, H. Richard Gail
Venue: INFORMS Journal on Computing (2002)

The calculation of the distribution of a linear combination of order statistics from random variables that are uniformly distributed is considered. A simple recursion to compute this distribution is presented that, unlike previous methods, is numerically stable and efficient. As such, this should be the algorithm of choice when the linear combination distribution needs to be obtained.
Bluetooth based wireless Internet applications for indoor hot spots: experience of a successful experiment during CeBIT 2001
Authors: Rolf Kraemer, Peter Schwander
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

Wireless Internet access based on wireless LAN or Bluetooth networks will become popular within the next few years. New services will be offered using location and personal profiles to filter Internet access. Moreover, "Push" services will allow unsolicited event-based information transfer depending on user configurations. We have introduced such services as "The Mobile Fairguide" during CeBIT 2001 in a Bluetooth network that covered a full hall of 25,000 m2 with 130 base stations. We were able to show that Bluetooth is a usable technology for such applications, especially with PDAs as terminal devices. Moreover, we tested our architecture in a live scenario with respect to scalability and mobility.
Using the Small Business Innovation Research Program to Turn Your Ideas into Products
Authors: Joseph H. Discenza
Venue: Interfaces (2002)

The Small Business Innovation Research Program helps small businesses transform new ideas into commercial products. The program provides an ideal means for businesses and universities to obtaining funding for cooperative projects. Rules and information for the program are readily available, and I will give a few helpful hints to provide guidance.