ppxscal/embedding_network huggingface dataset:
Interacting with audio streams for entertainment and communication
Authors: Mat C. Hans, Mark T. Smith
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We present a new model of interactive audio for entertainment and communication. A new device called the DJammer and its associated technologies are described. The DJammer introduces the idea of provisioning mobile users to interact cooperatively with digital audio streams. Users can augment the audio in real time and communicate the result in several ways resulting in a new form of multimedia communication across diverse devices and multiple networks. This paper describes the technologies incorporated into the DJammer, and discusses the actual implementation of the prototype DJammer. Future enhancements are also described.
An Approach for Optimizing Binding Lifetime with Mobile IPv6
Authors: Z. D. Wu
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

In this paper an analytical model is presented in orderto provide useful insight into the performance behaviourof Mobile IPv6 in the context of a binding lifetime setting.By using this model, the optimal binding lifetime can beestimated in terms of a user mobility, traffic workload,and network structure. An algorithm for dynamicallysetting the binding lifetime in Mobile IPv6 networks isproposed based on the analytical model. The numericalresults of the system simulation are also demonstrated.
Optimal broadcast on parallel locality models
Authors: Ben Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping
Venue: Journal of Discrete Algorithms (2003)

In this paper matching upper and lower bounds for broadcast on general purpose parallel computation models that exploit network locality are proven. These models try to capture both the general purpose properties of models like the PRAM or BSP on the one hand, and to exploit network locality of special purpose models like meshes, hypercubes, etc., on the other hand. They do so by charging a cost l (|i - j|) for a communication between processors i and j, where l is a suitably chosen latency function.An upper bound T (p) = Σi=0loglog p 2i ċ l(p1/2i) on the runtime of a broadcast on a p processor H-PRAM is given, for an arbitrary latency function l(k).The main contribution of the paper is a matching lower bound, holding for all latency functions in the range from l (k) = Ω (log k/log log k) to l (k) = O (log2 k). This is not a severe restriction since for latency functions l(k) = O(logk/log1+ε log(k)) with arbitrary ε > 0, the runtime of the algorithm matches the trivial lower bound Ω(log p) and for l(k) = Θ (log 1+ε k) or l(k) = Θ(kε), the runtime matches the other trivial lower bound Ω(l(p)). Both upper and lower bounds apply for other parallel locality models like Y-PRAM, D-BSP and E-BSP, too.
Thinking Outside the Box: Extending 802.1x Authentication to Remote "Splitter" Ports by Combining Physical and Data Link Layer Techniques
Authors: Arun Saha, Mart Molle
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

We present a novel switched full-duplex LAN architecturewhich can greatly simplify the cabling requirements inareas that must support high port densities and/or are subjectto frequent changes. Instead of providing a separate cableto connect each host to a dedicated port on a monolithicswitch behind the wall, we emulate the shared bus topologyfrom the early days of Ethernet by daisy-chaining a series ofsmall network-powered "slave" bridge modules called EthernetSplitters from a single port on the "master" switch.Our partitioned switch architecture enforces network privacythroughout the entire splitter chain, so no host can viewany traffic belonging to another host. The splitters also authenticatethe point of origin for every frame, independent ofthe value contained in its source address field thus providingthe same level of security as a monolithic switch under the802.1x Port Based Access Control protocol.
Locus Solum: From the rules of logic to the logic of rules
Authors: Jean-Yves Girard
Venue: Mathematical Structures in Computer Science (2001)

Go back to An-fang, the Peace Square at An-Fang, the Beginning Place at An-Fang, where all things start (&hellip;) An-Fang was near a city, the only living city with a pre-atomic name (&hellip;) The headquarters of the People Programmer was at An-Fang, and there the mistake happened: A ruby trembled. Two tourmaline nets failed to rectify the laser beam. A diamond noted the error. Both the error and the correction went into the general computer. Cordwainer Smith The Dead Lady of Clown Town, 1964.
Tridirectional typechecking
Authors: Joshua Dunfield, Frank Pfenning
Venue: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2004)

In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantified dependent types. This system was shown sound with respect to a call-by-value operational semantics with effects, yet is inherently undecidable.In this paper we provide a decidable formulation for this system based on bidirectional checking, combining type synthesis and analysis following logical principles. The presence of unions and existential quantification requires the additional ability to visit subterms in evaluation position before the context in which they occur, leading to a tridirectional type system. While soundness with respect to the type assignment system is immediate, completeness requires the novel concept of contextual type annotations, introducing a notion from the study of principal typings into the source program.
Lifetime packet discard for efficient real-time transport over cellular links
Authors: Andrei Gurtov, Reiner Ludwig
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

Mobile cellular users often experience significant delay jitter that undermines quality of real-time applications. Delay jitter can cause unnecessary delivery of stale packets with passed playback deadline and duplicate packets retransmitted by the end host after experiencing a timeout. With Lifetime Packet Discard (LPD) a flow adaptive link can tailor the trade-off between the maximum delay jitter and reliability if quality of service requirements of a flow are known. We propose using an IP option to communicate the flow requirements to the link layer. The packet lifetime is set to the minimum of the data lifetime determined by application and the retransmit timeout value determined by the transport protocol if selective reliability is supported. For congestion-responsive flows, the link transmits only headers of expired packets to prevent unnecessary triggering of end-to-end congestion control. Our simulations show that LPD is efficient in reducing stale data delivery and increases the number of packets delivered in time for real-time flows. For semi-reliable flows throughput and goodput are improved because duplicate packet delivery is prevented.
How to elaborate a use case
Authors: D. C. McDermid
Venue: Practicing software engineering in the 21st century (2003)

This paper challenges established wisdom with respect to use cases. Use cases are classically elaborated by directly identifying objects, methods and data. The research reported in this paper indicates that there are other better constructs for modeling use cases, at least initially, and that objects are not a particularly good medium for discussing requirements with users. This paper rehearses the arguments leading up to these conclusions and identifies some implications of these conclusions.
A comparison between the use of IT in business and education: applications of the internet to tertiary education
Authors: Stephen Burgess, Paul Darbyshire
Venue: Current issues in IT education (2003)

Since the mid-1990s, there have been many claims that the Web has become the new paradigm for teaching. However, most academics do not use the Web as a replacement for teaching, but to provide extra benefits for their students. There is a strong parallel between this use of the Internet for teaching, and the use of IT in business for providing added-value products or administrative efficiencies. In this chapter, the similarities between the use of IT in business and education are discussed, and the categorization of aspects of Web use in education using standard business categories relating to savings and quality are explored. The results are obtained from a survey of academics conducted internationally using the Web, and it surveys perceptions of benefits gained from supplementing teaching with Web-based services. The results revealed similar usage levels of Administrative and Educational Features to aid tertiary education on the Internet. The administrative uses showed slightly more benefits for the institution than for students and vice-versa for educational uses. In both types of uses, their adoption seemed to be based upon how difficult the feature was to set up as well as the added-value benefits it provided. An analysis of the correlation of the benefits identified for institution and students showed a correspondence between most of the uses, with a few interesting differences.
Some structural properties of two counter-examples to the Baker-Gammel-Wills conjecture
Authors: George A. Baker,  Jr.
Venue: Journal of Computational and Applied Mathematics (2003)

I improve the counter-example of Lubinsky, and show that the counter-example of Buslaev is also relevant to the original form of the Baker-Gammel-Wills conjecture. I notice that these counter-examples have only a single spurious pole and that a patchwork of just two subsequences of diagonal Padé approximants provides uniform convergence in compact subsets of |z| > 1. I find that both counter-examples can be characterized by the observation that they are associated with bounded J-matrices. I prove a number of resuks for the convergence of diagonal Padé approximants to functions which have bounded J-matrices.
Molecular structure and electric polarizability in sodium chloride clusters
Authors: N. Karatsis, G. Maroulis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

We report an investigation of the electric polarizability of sodium chloride clusters. Relying on conventional ab initio and density functional theory methods we find that the mean (per atom) dipole polarizability reduces strongly with cluster size.
Gossip and information flow in networks
Authors: Jon Kleinberg
Venue:  (2003)

Networks are becoming increasingly prominent as a framework for understanding designed or natural phenomena, ranging from decentralized computer systems to social interaction patterns. They serve as a means to facilitate decentralized computation and the dissemination of information. Designing and analyzing their function therefore requires a theory of information flow in networks. The goal of such a theory is to help in developing algorithms for core questions, including: How to find a piece of information? How to spread information? How to perform shared computations? In this thesis, we explore several facets of these problems. We propose a graph-based model termed temporal networks, which captures in a precise way the information flow dynamics of a history of communications in a network. Building on this methodology, we analyze a simple random distribution called Spatial Gossip, which disseminates information fast both locally and globally. Building in turn on Spatial Gossip, we design and analyze simple protocols for several locality-based problems, including the Resource Location Problem, in which nodes are trying to locate the closest copy of some desirable resource in the network. In all of the above protocols, we wish to restrict the sizes of messages, as communication bandwidth is often a scarce resource. We study the impact of message size more thoroughly, by exhibiting connections between the random distributions that are used for gossip, and the problems that can be solved with small messages. In particular, we show that uniform gossip cannot solve any of the above locality-based problems fast and with small messages. We take the study of message sizes further by proposing and analyzing simple gossip-based protocols for computing sums, averages, random samples, quantiles, and other aggregate functions of data that is distributed over the nodes of a network. Finally, we look at decentralized communication as it occurs in the diffusion of information, or innovations, in social networks. We give a constant-factor approximation for the problem of using a given budget to maximize the expected spread of an innovation or product through a network, by choosing suitable target nodes or marketing actions.
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Authors: Adriano Veloso, Wagner Meira Jr., Srinivasan Parthasarathy
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of data in order to produce compact summaries or models of the database. These models are typically used to generate association rules, but recently they have also been used in far reaching domains like e-commerce and bio-informatics. Because databases are increasing in terms of both dimension (number of attributes) and size (number of records), one of the main issues in a frequent itemset mining algorithm is the ability to analyze very large databases. Sequential algorithms do not have this ability, especially in terms of run-time performance, for such verylarge databases. Therefore, we must rely on high performance parallel and distributed computing. We present new parallel algorithms for frequent itemset mining. Their efficiency is proven through a series of experiments on different parallel environments, that range from shared-memory multiprocessors machines to a set of SMP clusters connected together through a high speed network.We also briefly discuss an application of our algorithms to the analysis of large databases collected by a Brazilian web portal.
E-Business development issues in UK SMEs
Authors: Fiona Meikle, Dianne Willis
Venue: Managing IT in government business & communities (2003)

Using a case-study approach, this chapter aims to assess the development issues for e-business within small to medium enterprises (SMEs) in differing regions across the UK. The research documents the issues faced by three SMEs as they have embarked upon an e-business delivery. All of the case studies are SMEs that come from different industry sectors, but all have established an e-commerce service in the last 18 months. Our definition of e-commerce aligns with those principles set out by the Organisation for Economic Cooperation and Development (OECD) working party on Indicators for the Information Society WPIIS. The outcome is an evaluation and discussion of the underlying factors influencing each company's progress within a regional UK framework. Issues raised in the study include lack of training and awareness in SMEs, the need for government-funded initiatives, reliance on personal networks, and a lack of clarity about funding sources and schemes.
Nanoindentaion techniques for assessing mechanical reliability at the nanoscale
Authors: Alex A. Volinsky, William W. Gerberich
Venue: Microelectronic Engineering (2003)

Nanoindetation is a powerful technique for measuring mechanical properties of thin films. First applied over 20 years ago in the hard drive industry, it is now commonly used for other applications. This paper describes nanoindentation techniques for measuring thin films mechanical properties, including elastic modulus, hardness, adhesion and fracture toughness as applied for modern microelectronics reliability. Elastic, plastic and adhesion properties of Cu interconnects are discussed, including the influence of film microstructure, thickness and grain size. Elastic, fracture and adhesion properties of advanced low-K dielectrics also discussed along with the current challenges of nanoindentation data interpretation and analysis as applied for advanced electronic materials.
Event-driven behavioural simulation of analogue transfer functions
Authors: R. A. Cottrell
Venue: Proceedings of the conference on European design automation (1990)

A method is proposed for simulating analogue circuits, represented by their transfer functions, in an event-driven simulator. Analogue waveforms may be voltage or current, and are represented by a piecewise linear approximation. A novel timestep control technique is presented, whereby individual models maintain this approximation within tolerances, permitting different timesteps in different parts of the circuit. The method is demonstrated by the simulation of an FM receiver architecture.
Introducing lateral thinking in search engines with interactive evolutionary algorithms
Authors: Yann Landrin-Schweitzer, Pierre Collet, Evelyne Lutton, Thierry Prost
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Nowadays, large medical databases consist of a collection of smaller databases, each on possibly different fields and using different formats, making it increasingly difficult to retrieve valuable information among the thousands of documents retrieved by a simple query. A new Evolutionary Learning Interactive Search Engine (ELISE) feeds on previous user requests to retrieve "alternative" documents that may not be returned by more conventional search engines, in a way that may recall "lateral thinking." Tests on the "Cystic Fibrosis Database" benchmark [1] prove that, while suggesting original documents by adaptation of its internal rules to the context of the user, ELISE is able to improve its recall rate.
Hypergraph construction and its application to the static analysis of concurrent systems
Authors: Barbara König
Venue: Mathematical Structures in Computer Science (2002)

We define a construction operation on hypergraphs based on a colimit and show that its expressiveness is equal to the graph expressions of Bauderon and Courcelle. We also demonstrate that by closing a set of rewrite rules under graph construction we obtain a notion of rewriting equivalent to the double-pushout approach of Ehrig. The usefulness of our approach for the compositional modelling of concurrent systems is then demonstrated by giving a semantics of process graphs (corresponding to a process calculus with mobility) and of Petri nets. We introduce on the basis if a hypergraph construction, a method for the static analysis of process graphs, related to type systems.
Decidability of the binary infinite post correspondence problem
Authors: Vesa Halava, Tero Harju, Juhani Karhumäki
Venue: Discrete Applied Mathematics (2003)

We shall show that it is decidable for binary instances of the Post Correspondence Problem whether the instance has an infinite solution. In this context, a binary instance (h,g) consists of two morphisms h and g with a common two element domain alphabet. An infinite solution ω is an infinite word ω = a1a2... such that h(ω)=g(ω). This problem is known to be undecidable for the unrestricted instances of the Post Correspondence Problem.
Survey of life-cycle measures and metrics for concurrent product and process design
Authors: Biren Prasad
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

Concurrent Engineering needs a series of measures (or measurement criteria) that are distinct to each process, and a set of metrics to check (and validate) the outcome when two or more of the life-cycle processes are overlapped or required to be executed in parallel. Because product realization involves concurrent processes that occur across multiple disciplines and organizations, appropriate measures and the methods of qualifying metrics are essential. Inevitably, such concurrent processes generate design conflicts among multiple life-cycle concerns. Individual assurances of satisfying life-cycle design criterion (one at a time) do not capture the most important aspect of Concurrent Engineering&mdash;the system perspective&mdash;meaning achieving a well-balanced trade-off among the different life-cycle design measures. While satisfying life-cycle design measures in a serial manner only those, which are not in conflict, are occasionally met. The paper first describes a set of life-cycle measures and metrics and explains how those could be used for gaining operational excellence. Second, this paper provides an insight into the mechanisms (such as knowledge-based systems, rule-based simulation, and rule-based optimization) to ensure an effective trade-off across different life-cycle measures, customer requirements, and their inclusion into a product design, development, and delivery (PD3) process.
A density based aapproach to classification
Authors: Hui Wang, David Bell, Ivo Düntsch
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper presents a novel method for classification, which is density based and makes use of the models built by the lattice machine (LM) [5, 7]. Density is a natural concept to use in clustering and the LM is a relatively new method for supervised learning developed in recent years. The LM approximates data resulting in, as a model of data, a set of hyper tuples that are equilabelled, supported and maximal. The method presented in this paper uses the LM model of data to classify new data with a view to maximising the density of the model. In order for the method to have wide applicability a measure of density is introduced for hyper tuples and relations.Experiments were carried out with both public and proprietary data. Experimental results show that our method outperforms the classification method in the LM literature and it is comparable to the C5.0 classification algorithm. It is also shown that our method works quite well in an application-stock market data mining.
Scenario Architecture - A Methodology to Build a Global View of OO Software System
Authors: Yiausyu Earl Tsai, Hewijin Christine Jiau, Kuo-Feng Ssu
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

OO software engineering (OOSE) has been a popularmethodology for years; however, there are still someissues remaining unsolved: a generic mechanism forchecking consistency of designs is still lacking; softwarehas some problems resulting from process issue;and imperative engineer have a huge gap to adoptOOSE. These three issues intersect in the early analysisphase, therefore we represent a new methodologythat provides a complete global view of OO softwaresystem that solve issues we identified, and uses requirementsdocument and some analysis documents asfoundation. Rules and a case study are also presentedto exemplify the result of applying our methodology onboth OOSE and imperative software engineering.
The influence of many body and electron nonparabolicity effects in the intersubband optical spectra of III-V quantum wells
Authors: M. F. Pereira,  Jr., H. Wenzel
Venue: Microelectronic Engineering (2003)

In this paper, effective masses adjusted to the non parabolic electron subbands obtained from the solutions of an 8 × 8 KP Hamiltonian are used as input for a many particle optical susceptibility solver capable of consistently taking into account exchange and depolarisation effects through numerical inversion of the Keldysh Green's functions equations for the optical polarisation. Numerical results are presented for III-V quantum wells.