ppxscal/embedding_network huggingface dataset:
A Mixture Model and EM-Based Algorithm for Class Discovery, Robust Classification, and Outlier Rejection in Mixed Labeled/Unlabeled Data Sets
Authors: David J. Miller, John Browning
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Several authors have shown that, when labeled data are scarce, improved classifiers can be built by augmenting the training set with a large set of unlabeled examples and then performing suitable learning. These works assume each unlabeled sample originates from one of the (known) classes. Here, we assume each unlabeled sample comes from either a known or from a heretofore undiscovered class. We propose a novel mixture model which treats as observed data not only the feature vector and the class label, but also the fact of label presence/absence for each sample. Two types of mixture components are posited. "Predefined" components generate data from known classes and assume class labels are missing at random. "Nonpredefined" components only generate unlabeled data¿i.e., they capture exclusively unlabeled subsets, consistent with an outlier distribution or new classes. The predefined/nonpredefined natures are data-driven, learned along with the other parameters via an extension of the EM algorithm. Our modeling framework addresses problems involving both the known and unknown classes: 1) robust classifier design, 2) classification with rejections, and 3) identification of the unlabeled samples (and their components) from unknown classes. Case 3 is a step toward new class discovery. Experiments are reported for each application, including topic discovery for the Reuters domain. Experiments also demonstrate the value of label presence/absence data in learning accurate mixtures.
Improving Customer Experience Using Web Services
Authors: T. Stevens, A. May
Venue: BT Technology Journal (2004)

This paper looks at some of the advances in open standards for interfacing and interoperability and how they can be utilised to improve the customer experience when contacting suppliers, in particular, the use of XML/HTTP Web Services to improve the quality of the interaction. It describes in depth a solution developed by the authors to use Web Services to interface both within the enterprise and across the Internet with partners to enhance the BT ADSL pre-registration scheme.
Can SAT be used to Improve Sequential ATPG Methods?
Authors: Mukul R. Prasad, Michael S. Hsiao, Jawahar Jain
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

In this work we investigate the integration of SAT methods intoa simulation-based sequential ATPG tool, STRATEGATE [11],with the aim of improving the state-of-the-art in sequential ATPG.We offer a detailed analysis of possible scenarios and algorithmsfor performing such an integration. Our preliminary investigationsshow that such hybrid approaches can be very promising.
An Interview with Stuart Russell: the future of artificial intelligence
Authors: Ubiquity staff
Venue: Ubiquity (2003)

AI may not take over the world but it will provide new and powerful tools. Smart microwave ovens? No big deal. Full-size humanoid robots that walk, climb stairs, open and close doors, and pick things up? Now that gets our attention.
Incorporating quality assurance processes into requirements analysis education
Authors: Daniel L. Moody, Guttorm Sindre
Venue: ACM SIGCSE Bulletin (2003)

The traditional thrust of software quality assurance has been to use "brute force" testing at the end of development. However quality assurance in the early phases of development is an order of magnitude more cost effective than testing done at the end of development. This paper describes the introduction of quality reviews as a learning activity into an undergraduate requirements analysis course, and evaluates the effectiveness of this in improving learning. In the absence of any standard instrument for evaluating learning effectiveness, we developed a survey instrument called the Learning Effectiveness Survey. Using this instrument, learning effectiveness is evaluated in the context of the learning goals of the course (short term learning), and in the context of the broader educational programme and future working life (long term learning). It also provides feedback on the learning intervention and how it can be improved. While the intervention was moderately successful in its first application, a great deal was learned about how it could be improved next time.
Improving telescope mechanical error estimates using pointing data
Authors: William Duff
Venue:  (2003)

A procedure was developed to make precise estimates of mechanical errors in telescopes using observed pointing error data. A kinematic model was used to relate pointing errors to mechanical errors and the parameters of the kinematic model were estimated with a statistical model fit using data from four large astronomical telescopes as well as simulated data containing known errors. Modified ordinary least squares regression provided a baseline solution that was found to yield mechanical error estimates with relatively large standard errors due to correlation among the terms. The baseline results were comparable to those typically obtained on large research telescopes. Bootstrapping, ridge regression, and Bayesian regression were each investigated as methods to improve the estimated parameter precision. Bootstrapping estimates of parameters associated with uncorrelated errors were more precise than the baseline model but the parameter estimates related to the correlated errors were not improved. Bootstrapping, however, allowed the form of the distribution of each mechanical error estimate to be studied in addition to allowing its parameters to be quantified. Ridge regression yielded more precise parameter estimates than the baseline model and the proper selection of the ridge parameter was found to have only a week dependence on the specific data. This is a useful property because it eliminates much of the judgement associated with employing ridge regression for telescope mount modeling. Bayesian regression produced the greatest improvement in precision over the baseline results. The Bayesian regression error estimates were precise enough to be of practical use in designing, operating and maintaining large telescopes and related equipment. The method provides a way to estimate geometric errors with greater precision than they can be measured using current approaches. The improvement in precision of the model parameters also lead to better telescope pointing. Predictions from the model showed that the Bayesian regression results will produce pointing errors on large telescopes that are approximately 15% less than typical errors using current techniques.
Artificial argument assistants for defeasible argumentation
Authors: Bart Verheij
Venue: Artificial Intelligence (2003)

The present paper discusses experimental argument assistance tools. In contrast with automated reasoning tools, the objective is not to replace reasoning, but to guide the user's production of arguments. Two systems are presented, ARGUE! and ARGUMED based on DEFLOG. The focus is on defeasible argumentation with an eye on the law. Argument assistants for defeasible argumentation naturally correspond to a view of the application of law as dialectical theory construction. The experiments provide insights into the design of argument assistants, and show the pros and cons of different ways of representing argumentative data. The development of the argumentation theories underlying the systems has culminated in the logical system DEFLOG that formalizes the interpretation of prima facie justified assumptions. DEFLOG introduces an innovative use of conditionals expressing support and attack. This allows the expression of warrants for support and attack, making it a transparent and flexible system of defeasible argumentation.
Overlearning in marginal distribution-based ICA: analysis and solutions
Authors: Jaakko Särel&auml, Ricardo Vigário
Venue: The Journal of Machine Learning Research (2003)

The present paper is written as a word of caution, with users of independent component analysis (ICA) in mind, to overlearning phenomena that are often observed.We consider two types of overlearning, typical to high-order statistics based ICA. These algorithms can be seen to maximise the negentropy of the source estimates. The first kind of overlearning results in the generation of spike-like signals, if there are not enough samples in the data or there is a considerable amount of noise present. It is argued that, if the data has power spectrum characterised by 1/f curve, we face a more severe problem, which cannot be solved inside the strict ICA model. This overlearning is better characterised by bumps instead of spikes. Both overlearning types are demonstrated in the case of artificial signals as well as magnetoencephalograms (MEG). Several methods are suggested to circumvent both types, either by making the estimation of the ICA model more robust or by including further modelling of the data.
Automated extraction of music snippets
Authors: Lie Lu, Hong-Jiang Zhang
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Similar to image and video thumbnail, music snippet is defined as the most representative or highlight excerpt of a music clip, and can be used efficiently for fast browsing large number of music files. Music snippet is usually a part of the repeated melody, main theme or chorus. In this paper, we present an approach to extracting music snippet automatically. In our approach, the most salient segment of the music is firstly detected based on its occurrence frequency and energy information. Meanwhile, the boundaries of musical phrases are also detected based on the estimated phrase length and phrase boundary confidence of each frame. These boundaries are used to ensure that an extracted snippet does not break musical phrases. Finally, the musical phrases including the most salient segment are extracted as music snippet. User study indicates that the proposed algorithm works very well on our music database.
Urban Tapestries: Wireless networking, public authoring and social knowledge
Authors: Giles Lane
Venue: Personal and Ubiquitous Computing (2003)

Urban Tapestries is an action research project combining social research interaction design and cultural production. The project is developing a prototype system for accessing and publishing location specific content wirelessly, and creating sound maps of environments and journeys that can be shared remotely.
Editorial
Authors: Daniel Leivant, Bob Constable
Venue: Journal of Functional Programming (2001)

This issue of the Journal of Functional Programming is dedicated to work presented at the Workshop on Implicit Computational Complexity in Programming Languages, affiliated with the 1998 meeting of the International Conference on Functional Programming in Baltimore.Several machine-independent approaches to computational complexity have been developed in recent years; they establish a correspondence linking computational complexity to conceptual and structural measures of complexity of declarative programs and of formulas, proofs and models of formal theories. Examples include descriptive complexity of finite models, restrictions on induction in arithmetic and related first order theories, complexity of set-existence principles in higher order logic, and specifications in linear logic. We refer to these approaches collectively as Implicit Computational Complexity. This line of research provides a framework for a streamlined incorporation of computational complexity into areas such as formal methods in software development, programming language theory, and database theory.A fruitful thread in implicit computational complexity is based on exploring the computational complexity consequences of introducing various syntactic control mechanisms in functional programming, including restrictions (akin to static typing) on scoping, data re-use (via linear modalities), and iteration (via ramification of data). These forms of control, separately and in combination, can certify bounds on the time and space resources used by programs. In fact, all results in this area establish that each restriction considered yields precisely a major computational complexity class. The complexity classes thus obtained range from very restricted ones, such as NC and Alternating logarithmic time, through the central classes Poly-Time and Poly-Space, to broad classes such as the Elementary and the Primitive Recursive functions.Considerable effort has been invested in recent years to relax as much as possible the structural restrictions considered, allowing for more exible programming and proof styles, while still guaranteeing the same resource bounds. Notably, more exible control forms have been developed for certifying that functional programs execute in Poly-Time.The 1998 workshop covered both the theoretical foundations of the field and steps toward using its results in various implemented systems, for example in controlling the computational complexity of programs extracted from constructive proofs. The five papers included in this issue nicely represent this dual concern of theory and practice. As they are going to print, we should note that the field of Implicit Computational Complexity continues to thrive: successful workshops dedicated to it were affiliated with both the LICS'99 and LICS'00 conferences. Special issues, of Information and Computation dedicated to the former, and of Theoretical Computer Science to the latter, are in preparation.
Derived access control specification for XML
Authors: Siddhartha K. Goel, Chris Clifton, Arnon Rosenthal
Venue: Proceedings of the 2003 ACM workshop on XML security (2003)

The growth in interchange of business and other sensitive data has led to increasing interest in access control. While broad-based access control may be adequate for library-style document bases, new applications demand different access rights on different documents, or different parts of a document. Methods have been developed that enforce fine-grained access control in XML, but the administrative complexity of hard-coding rules is still a challenge. We present an XQuery-based approach for deriving access control rules from schemalevel rules, document or database content, or rules on other documents. This approach provides a novel capability to exploit non-structural information in broadly-applicable rules, making it feasible to specify data- and context-dependent rules for large document sets.
Java Games Technologies
Authors: Doug Twilleager
Venue: Computers in Entertainment (CIE) (2003)

Sun Microsystems has formed a new Games Technologies Group. Playing on Sun's strengths in network and high performance computing, the Games Technologies Group is working with industry leaders to provide an end-to-end architecture and set of solutions for developing and deploying networked games. More information on the Java technology that you can use now to develop games is available at http://community.java.net/games/ We will have an in depth article detailing the work of this new group.
Modular reasoning about open systems: a case study of distributed commit
Authors: R. Das, A. Fekete
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

We show how to reason about distributed database management systems, in which a commit protocol is used to coordinate activity of several resource managers. This is an interesting case study of an open system, in which each component is developed independently to operate with many possible environments. We give specifications for each resource manager, and a specification for the commit protocol, and show that the whole system is correct as long as each component has the properties required of it. We then show how to prove that specific examples have these properties.
Service overlay networks: SLAs, QoS, and bandwidth provisioning
Authors: Zhenhai Duan, Zhi-Li Zhang, Yiwei Thomas Hou
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

We advocate the notion of service overlay network (SON) as an effective means to address some of the issues, in particular, end-to-end quality of service (QoS), plaguing the current Internet, and to facilitate the creation and deployment of value-added Internet services such as VoIP, Video-on-Demand, and other emerging QoS-sensitive services. The SON purchases bandwidth with certain QoS guarantees from the individual network domains via bilateral service level agreement (SLA) to build a logical end-to-end service delivery infrastructure on top of the existing data transport networks. Via a service contract, users directly pay the SON for using the value-added services provided by the SON.In this paper, we study the bandwidth provisioning problem for an SON which buys bandwidth from the underlying network domains to provide end-to-end value-added QoS sensitive services such as VoIP and Video-on-Demand. A key problem in the SON deployment is the problem of bandwidth provisioning, which is critical to cost recovery in deploying and operating the value-added services over the SON. The paper is devoted to the study of this problem. We formulate the bandwidth provisioning problem mathematically, taking various factors such as SLA, service QoS, traffic demand distributions, and bandwidth costs. Analytical models and approximate solutions are developed for both static and dynamic bandwidth provisioning. Numerical studies are also performed to illustrate the properties of the proposed solutions and demonstrate the effect of traffic demand distributions and bandwidth costs on SON bandwidth provisioning.
Two approaches for measuring the performance of time-sharing systems
Authors: Arnold D. Karush
Venue: Proceedings of the second symposium on Operating systems principles (1969)

There are two significantly different approaches that can be used for measuring the performance of time-sharing systems. The "stimulus" approach which conceptualizes the system as a "black box" containing a limited number of known functions, involves applying a controlled set of stimuli to the black box in order to activate its functions, and then observing the results. In the "analytic" approach, probes are inserted into the system to allow the recording of any level of the system's behavior. Both approaches are being developed for, and have been used to measure, System Development Corporation's ADEPT time-sharing system.
Performance evaluation of Bluetooth polling schemes: an analytical approach
Authors: Daniele Miorandi, Andrea Zanella, Gianfranco Pierobon
Venue: Mobile Networks and Applications (2004)

In the recent years, many polling schemes for Bluetooth networks have been proposed and evaluated. To the authors knowledge, however, analysis has been carried out mainly through computer simulations and, up to now, no mathematical treatment of this topic has been presented. In this paper, we propose an analytical framework for performance evaluation of polling algorithms in Bluetooth piconets. The analysis is carried out by resorting to an effective and simple mathematical method, called Equilibrium Point Analysis. The system is modelled as a multidimensional finite Markov chain and performance metrics are evaluated at the equilibrium state. The analysis is focused on three classical polling schemes, namely Pure Round Robin, Gated Round Robin and Exhaustive Round Robin, which are compared in terms of packet delay, channel utilization, and fairness among users. Both analytical and simulation results are presented for three relevant scenarios, in order to validate the accuracy of the analysis proposed.
Bayesian Event Classification for Intrusion Detection
Authors: Christopher Kruegel, Darren Mutz, William Robertson, Fredrik Valeur
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

Intrusion detection systems (IDSs) attempt to identify attacksby comparing collected data to predefined signaturesknown to be malicious (misuse-based IDSs) or to a modelof legal behavior (anomaly-based IDSs). Anomaly-basedapproaches have the advantage of being able to detect previouslyunknown attacks, but they suffer from the difficultyof building robust models of acceptable behavior which mayresult in a large number of false alarms. Almost all currentanomaly-based intrusion detection systems classify an inputevent as normal or anomalous by analyzing its features,utilizing a number of different models. A decision for an inputevent is made by aggregating the results of all employedmodels.We have identified two reasons for the large number offalse alarms, caused by incorrect classification of events incurrent systems. One is the simplistic aggregation of modeloutputs in the decision phase. Often, only the sum of themodel results is calculated and compared to a threshold.The other reason is the lack of integration of additionalinformation into the decision process. This additional informationcan be related to the models, such as the confidencein a model's output, or can be extracted from externalsources. To mitigate these shortcomings, we proposean event classification scheme that is based on Bayesiannetworks. Bayesian networks improve the aggregation ofdifferent model outputs and allow one to seamlessly incorporateadditional information. Experimental results showthat the accuracy of the event classification process is significantlyimproved using our proposed approach.
Precise Specification to Compound Patterns with ExLePUS
Authors: Jeffrey K. H. Mak, Clifford S. T. Choy, Daniel P. K. Lun
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Prior research suggested modeling languages forprecise specification of design pattern structures andbehaviors. However, seldom has put effort on theirintegrations as well as their specifications. To provide afirst class CASE support to the recognition, verificationand application of design patterns as well as theircompounds, a precise specification to their leitmotifs iscritical. In this paper, we present the essentials of patternintegration and propose an extended version, we name itexLePUS, to a pattern specification language (LePUS) inorder to support the specification of these essentials andthus compound patterns. A case study has illustrated howit is used a well-known compound pattern.
Leakage Current: Moore's Law Meets Static Power
Authors: Nam Sung Kim, Todd Austin, David Blaauw, Trevor Mudge, Krisztián Flautner, Jie S. Hu, Mary Jane Irwin, Mahmut Kandemir, Vijaykrishnan Narayanan
Venue: Computer (2003)

Off-state leakage is static power, current that leaks through transistors even when they are turned off. The other source of power dissipation in today's microprocessors, dynamic power, arises from the repeated capacitance charge and discharge on the output of the hundreds of millions of gates in today'schips.Until recently, only dynamic power has been a significant source of power consumption, and Moore's law helped control it. However, power consumption has now become a primary microprocessor design constraint one that researchers in both industry and academia will struggle to overcome in the next few years.