ppxscal/embedding_network huggingface dataset:
Complexity of weak bisimilarity and regularity for BPA and BPP
Authors: Jiří Srba
Venue: Mathematical Structures in Computer Science (2003)

It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound for BPP were demonstrated by Stribrna. Mayr recently achieved a result, saying that weak bisimilarity for BPP is $\Pi_2^P$-hard. We improve this lower bound to PSPACE, and, moreover, prove this result for the restricted class of normed BPP. It is also not known whether weak regularity (finiteness) of BPA and BPP is decidable. In the case of BPP there is a $\Pi_2^P$-hardness result by Mayr, which we improve to PSPACE. No lower bound has previously been established for BPA. We demonstrate DP-hardness, which, in particular, implies both NP and co-NP-hardness. In each of the bisimulation&sol;regularity problems we also consider the classes of normed processes. Finally, we show how the technique for proving co-NP lower bound for weak bisimilarity of BPA can be applied to strong bisimilarity of BPP.
Using Means-End Chains to Build Mobile Brand Communities
Authors: Mark Heitmann, Catja Prykop, Peter Aschmoneit
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Brand communities are a traditional concept to enhance customer attraction, loyalty and retention (e.g. Tupperware, Apple Macintosh). Brand communities are supported through either companies or customers themselves. Companies that are able to encourage their customers to interact stimulated by the brand could position the brand value proposition of their product as a link between their customers and employ the developing brand communities for marketing purposes. To stimulate this kind of interaction companies have increasingly used Internet functionalities in the past years. Drawing on the overwhelming penetration rate of mobile devices of over 80 percent in Europe, we propose to employ the mobile channel to support this kind of brand community building process. We derive four constitutional elements of brand communities based on existing research and develop a structured and theoretically founded four step method to analyze the potential of mobile services for specific communitybuilding purposes and compare our findings to a mini case study.
A Large Deviation Inequality for Functions of Independent, Multi-Way Choices
Authors: D. A. Grable
Venue: Combinatorics, Probability and Computing (1998)

Often when analysing randomized algorithms, especially parallel or distributed algorithms, one is called upon to show that some function of many independent choices is tightly concentrated about its expected value. For example, the algorithm might colour the vertices of a given graph with two colours and one would wish to show that, with high probability, very nearly half of all edges are monochromatic.The classic result of Chernoff [3] gives such a large deviation result when the function is a sum of independent indicator random variables. The results of Hoeffding [5] and Azuma [2] give similar results for functions which can be expressed as martingales with a bounded difference property. Roughly speaking, this means that each individual choice has a bounded effect on the value of the function. McDiarmid [9] nicely summarized these results and gave a host of applications. Expressed a little differently, his main result is as follows.
Function-Based Dynamic Compaction and its Impact on Test Set Sizes
Authors: James Wingfield, Jennifer Dworak, M. Ray Mercer
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Due to the limited amount of available resources and time used for manufacture testing of integrated circuits, there is great interest in minimizing the number of test patterns applied while maintaining a large number of defect detections. Many methods have been developed to generate compact test pattern sets, and this paper extends the concepts of one such method(pattern-based dynamic compaction) into the functional realm. We will show that function-based dynamic compaction yields very compact test sets, and it retains compact performance for fault models of different difficulty.
A practical comparison between Java and Ada in implementing a real-time embedded system
Authors: Eric Potratz
Venue: ACM SIGAda Ada Letters (2004)

This paper presents a student's observations from an undergraduate research project that explored using Java to implement the software for a real-time embedded system that was originally implemented in a university-level real-time systems course using Ada 95. It briefly gives an overview of the project, the decision made concerning which Java virtual machine to use, and how that virtual machine performed in the real-time environment. It then goes into detail about the merits and drawbacks of using Java to implement real-time and embedded systems such as this one and how using Java to implement them compares with using Ada.
An agenda for research directions
Authors: R. D. Holt, J. Slonim
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

The purpose of this paper is to present a set of initial ideas about the IBM Toronto's Laboratory involvement in ongoing external research activities. This paper is meant to be a starting point for discussion, especially in the light of changes occurring within IBM today.
Computer music in New South Wales
Authors: Gordon Monro
Venue: Organised Sound (2001)

This article is a brief survey of academic computer music activities in New South Wales.
Observation based vs. model based admission control for interactive multimedia sessions
Authors: Silvia Hollfelder, Peter Fankhauser, Erich J. Neuhold
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Interactive multimedia sessions cause high variations in workload due to presenting different media streams at different points in time. As users interact, the workload variations can not be predicted precisely. But admission control mechanisms need to at least estimate the workload in order to provide Quality of Service. In this paper, we investigate two approaches to estimate workloads and on this basis introduce admission control mechanisms that give stochastic QoS guarantees for such sessions. The observation based approach uses bookkept workload data for the prediction. The model based approach employs knowledge about usage patterns and media streams. For both approaches we introduce a uniform stochastic admission control criterion. Furthermore, we illustrate the relative benefits of these approaches for various session scenarios by means of simulations.
Exploring the Novel Characteristics of Fully Depleted Dual-Material Gate (DMG) SOI MOSFET using Two-Dimensional Numerical Simulation Studies
Authors: Anurag Chaudhry, M. Jagadesh Kumar
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

The novel features of a fully depleted (FD) dual-materialgate (DMG) SOI MOSFET are explored theoretically andcompared with those of a compatible SOI MOSFET. Thetwo-dimensional (2-D) numerical simulation studiesdemonstrate the novel features as threshold voltage roll-upand simultaneous transconductance enhancement andsuppression of short-channel effects (SCE's) offered bythe DMG SOI MOSFET. Moreover, these unique featurescan be controlled by engineering the workfunction andlength of the gate material. This work illustrates thebenefits of high performance DMG SOI MOS devicesover their single material gate (SMG) counterparts andprovides an incentive for their experimental exploration.
The evolution of the corporate IT function and the role of the CIO at Texaco: how do perceptions of IT's performance get formed?
Authors: Rudy Hirschheim, Jaana Porra, Michael S. Parks
Venue: ACM SIGMIS Database (2003)

While senior management's confidence in the IT function and the CIO appears to be at an all time low, the field's understanding of why this condition exists is still confused. This paper suggests that the problem lies in how perceptions about IT are formed. To this end, the paper briefly looks at the growth and evolution of the corporate IT department at the oil giant Texaco, Inc. The analysis paints a somewhat disturbing picture of a top performing IT organization, intimately responsible for the success of the corporation, yet being perceived by much of senior management as an overhead that was costly and ineffective. The paper suggests some reasons as to why such perceptions might have come about, and what lessons the field can learn from what happened at Texaco. It is our belief that through such historical analyses, like the one performed at Texaco, a richer and broader understanding of the nature of organizational IT units is possible. These analyses shed light on the root causes for why IT is often perceived negatively. We suggest that IT organizations might change these perceptions by partnering with business units to share the credit for successful implementations and managing the perceptions about IT's contribution.
Isochronets: an architecture for high-speed networks
Authors: Danilo Florissi, Yechiam Yemini
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

This paper surveys a novel switching architecture for high-speed networks: Isochronets. Isochronets use the new Route Division Multiple Access (RDMA) switching technique that divides network bandwidth among routing trees. Frame motions need not be delayed at intermediate switches for processing, allowing Isochronets to scale over a large spectrum of transmission speeds and support all-optical implementations. The network functions as a media-access layer that can support multiple framing protocols simultaneously, handled by higher layers at the periphery. Isochronets can provide flexible quality of service control and multicasting through allocation of bands to routing trees.
A top-down approach to teaching introductory computer graphics
Authors: Kelvin Sung, Peter Shirley
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

There are two common strategies for teaching introductory computer graphics (CG) programming. The first and most traditional covers the CG field in a bottom-up manner starting from foundational algorithms such as triangle rasterization. The second is top-down and analyzes the functional modules of applications. This paper argues that the top-down approach is well-suited for mature adult students. A course that has successfully implemented a top-down approach is then described.
Preface to Special Issue: Coalgebraic methods in computer science
Authors: Andrea Corradini, Marina Lenisa, Ugo Montanari
Venue: Mathematical Structures in Computer Science (2003)

During the last few years it has become increasingly clear that a very wide variety of state-based dynamical systems, such as transition systems, automata, process calculi and class-based systems can be captured uniformly as coalgebras. Moreover, the theory and applications of coalgebras is developing into a field of interest in its own right, presenting a deep mathematical foundation, a growing range of applications and interactions with various other areas, such as reactive and interactive system theory, object-oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, and so on.
Computability and totality in domains
Authors: Ulrich Berger
Venue: Mathematical Structures in Computer Science (2002)

We survey the main results on computability and totality in Scott&ndash;Er&scaron;ov-domains as well as their applications to the theory of functionals of higher types and the semantics of functional programming languages. A new density theorem is proved and applied to show the equivalence of the hereditarily computable total continuous functionals with the hereditarily effective operations over a large class of base types.
KDLAB v3
Authors: Dean Di Simone, Joseph Kosinski
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

KDLAB is an interdisciplinary firm intent on exploring the blurred boundaries between architecture, graphics, and film.Committed to ongoing research in applied computer graphics technologies and the fostering of experimentation, collaboration and media synthesis, KDLAB's projects have ranged from interactive multimedia design, to the development of digital cinematic trailers for gaming and film. The lab is also focused on photorealistc simulation, immersive VR technologies, broadcast design, information architecture and branding. KDLAB works closely with DCC software developers, aiding in the testing of emerging tools and technology.This project is the latest in an ongoing effort to document the work by KDLAB. The goal of the project was to leverage mainstream digital technologies to employ a transparent inhabitation of various projects in various mediums.
Efficient Web Log Mining for Product Development
Authors: Yew-Kwong Woon, Wee-Keong Ng, Xiang Li, Wen-Feng Lu
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

With the new global economy, manufacturing companiesare focusing their efforts on the product developmentprocess which is fast emerging as a new competitiveweapon. Several product development solutions allow engineers,suppliers, business partners and even customersto collaborate throughout the entire product lifecycle viathe Internet. To gain an additional edge over competitors,it is vital that companies utilize web logs to discoverhidden knowledge about trends and patterns in such a cyberworld.However, existing web log mining techniques arenot designed for web logs generated by product data managementprocesses. In this paper, we propose a methodtermed Product Development Miner (PDMiner) to minesuch web logs efficiently and effectively using a trie structureand sequential mining techniques. Experiments involvingreal web logs show that PDMiner is both fast andpractical.
Modeling and Analysis of Congestion in the Design of Facility Layouts
Authors: Saifallah Benjaafar
Venue: Management Science (2002)

Reducing manufacturing lead times and minimizing work-in-process (WIP) inventories are the cornerstones of popular manufacturing strategies such as Lean, Quick Response, and Just-in-Time Manufacturing. In this paper, we present a model that captures the relationshipbetween facility layout and congestion-related measures of performance. We use the model to introduce a formulation of the facility layout design problem where the objective is to minimize work-in-process (WIP). In contrast to some recent research, we show that layouts obtained using a WIP-based formulation can be very different from those obtained using the conventional quadratic assignment problem (QAP) formulation. For example, we show that aQAP-optimal layout can be WIP-infeasible. Similarly, we show that two QAP-optimal layouts can have vastly different WIP values. In general, we show that WIP is not monotonic in material-handling travel distances. This leads to a number of surprising results. For instance, we show that it is possible to reduce overall distances between departments but increase WIP. Furthermore, we find that the relative desirability of a layout can be affected by changes in material-handling capacity even when travel distances remain the same. We examine the effect of various system parameters on the difference in WIP between QAP- and WIP-optimal layouts. We find that although there are conditions under which the difference in WIP is significant, there are those under which both layouts are WIP-equivalent.
Automatic translation into French Grade 2 Braille
Authors: Monique Truquet
Venue: Issue 15 (March 1975) (1975)

I would like to speak on the following subjects. How to translate texts into Braille with only a typist who doesn't know Braille rules.Difficulties encountered: codes of letters with accents and Braille signs. They have been studied when we worked for Braille Grade I.To obtain Braille Grade 2 we use a syntactical analyser, a "hashing" table and a "contraction" program.It seems that this last program can be used for other languages and it is this one that we shall study.
Name space models for locating services
Authors: Nigel Hinds, C. V. Ravishankar
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

Much of recent work on computer systems has focused on providing transparent resource-sharing in a distributed computing environment. Many of these systems use the server-client model to provide access to data and services. As more distributed services are offered and the demand for sharing increases in these environments, efficient management and accessing schemes become crucial. Locating services makes name service a critical part of access management.This report describes some of the work in progress as part of the Universal Name Semantics (UNS) project at the University of Michigan. UNS was intended to explore issues involved in providing client programs with seamless naming of objects across heterogeneous name spaces. UNS is distinguished from other heterogeneous naming systems in its attempt to partially automate the translation process by exploiting abstract similarity between name spaces.
Microconverter Aided Time Constant Measurement
Authors: Jaidilson Jó da Silva, Felix Rodrigues Neto, Manoel Alves Filho, Alfranque A. da Silva, Orlei de Oliveira Barbosa, Miguel Gonçalves Wanzeller, José Sérgio da Rocha Neto
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

Single time constant (STC) is that circuit composedof, or can be reduced to, one reactive component andone resistance. A STC circuit formed of a capacitanceC and a resistance R has a time constant \tau = RC.Although STC circuit is quite simple it plays asignificant role in the project and analysis of linearand digital circuits. In this paper a charge time of acapacitance has been evaluated using amicroconverter ADuC812. A time measurement isobtained employing 12 bits converter ADC0 input,DAC0 and DAC1 outputs included in themicroconverter. Several time constants were usedand results obtained were excellent.
Bounds on the throughput of congestion controllers in the presence of feedback delay
Authors: Sanjay Shakkottai, R. Srikant, Sean P. Meyn
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

We consider decentralized congestion control algorithms for low-loss operation of the Internet using the ECN bit. There has been much analysis of such algorithms, but with a few exceptions, these typically ignore the effect of feedback delays in the network on stability. We study a single node with many flows passing through it, with each flow (possibly) having a different round-trip delay. Using a fluid model for the flows, we show that even with delays, the total data rate at the router is bounded; and this bound shows that the (peak) total rate grows linearly with increase in system size, i.e., the fraction of overprovisioning required is constant with respect to N, the number of flows in the system. Further, for typical user data rates and delays seen in the Internet today, the bound is very close to the data rate at the router without delays. Earlier results by Johari and Tan have given conditions for a linearized model of the network to be (locally) stable. We show that even when the linearized model is not stable, the nonlinear model is upper bounded, i.e., the total rate at the bottleneck link is upper bounded, and the upper bound is close to the equilibrium rate for TCP.
Fusion in relational structures and the verification of monadic second-order properties
Authors: B. Courcelle, J. A. Makowsky
Venue: Mathematical Structures in Computer Science (2002)

Relational structures offer a common framework for handling graphs and hypergraphs of various kinds. Operations like disjoint union, the creation of new relations by means of quantifier-free formulas, and relabellings of relations make it possible to denote them using algebraic expressions. It is known that every monadic second-order property of a structure is verifiable in time proportional to the size of such an algebraic expression defining it. We prove here that this result remains true if we also use in these algebraic expressions a fusion operation that fuses all elements of the domain satisfying some unary predicate. The value mapping from these algebraic expressions to the structures they denote is a monadic second-order definable transduction, which means that the structure is definable inside the tree representing the algebraic expression by monadic second-order formulas. It follows (by using results of other articles) that, with this fusion operation, we cannot generate more graph families, but we can generate them with less unary auxiliary predicates. We also obtain clear-cut characterizations of Vertex Replacement and Hyperedge Replacement context-free graph grammars in terms of four types of operations, amongst which is the fusion of vertices satisfying a specified predicate.
Specification approaches express different world hypotheses
Authors: David A. Marca, Clement L. McGowan
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

This paper presents four world views for developing system specifications. Each is described by first revealing its root metaphor, that is, the most primitive starting point for understanding a system. As each world view and its metaphor are described, we show how particular major current approaches to systems analysis and design fall within the view. We discuss how the root metaphor simultaneously provides useful system concepts while limiting their utility. The paper concludes by suggesting how practicing analysts can use world views to guard against missing important system aspects, avoid specification complexity, and ensure greater coverage and completeness.
Specifying groupware requirements from direct experience
Authors: David A. Marca
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

The trend to understand how to develop software that supports the work of groups is beginning to replace the tradition of developing software that just supports the work of individuals. Software that supports group work is currently being called "Groupware", and the technical field is being called "Computer-Supported Cooperative Work" (CSCW). This paper suggests a way to enhance traditional systems analysis practices to address the specification issues surrounding groupware. The enhancements extend traditional practice by incorporating direct work experiences into the software specification process. These new practices enable a systems analyst to focus on the user's work so that a software solution can address the social aspects of that work. These practices can then be used to develop a software specification that includes both functional requirements and usability requirements.