ppxscal/embedding_network huggingface dataset:
Scheduling Analysis Integration for Heterogeneous Multiprocessor SoC
Authors: Kai Richter, Razvan Racu, Rolf Ernst
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

Today, only very few techniques out of the host of work on formalperformance and timing analysis have been adopted in MpSoC(multiprocessor system-on-chip) design. One of the key reasons isa mismatch between the scheduling models assumed in most formalapproaches and the heterogenous world of MpSoC schedulingtechniques and communication patterns. This heterogeneity resultsfrom IP reuse and a plug-and-play design style, required to effectivelyreach the necessary design productivity. A second problem isthe model complexity. While complex, specialized models can findtheir way into industry niches, their broad acceptance is extremelydoubtful. In this paper, we review the existing scheduling analysistechniques with respect to these key requirements and derive a goodcompromise between model simplicity on the one hand, and applicabilityto MpSoC design on the other hand. The approach representssystem-level scheduling analysis as a flow-analysis problemfor event streams that can be configured to reuse the existing localscheduling analysis techniques. We define transformations betweenfew key event stream models to meet the interfacing requirements ofthe compositional design style. An example demonstrates the applicationof the approach, as well as the worthiness of the results.
Concentration of Measure for Products of Markov Kernels and Graph Products via Functional Inequalities
Authors: C. Houdré, P. Tetali
Venue: Combinatorics, Probability and Computing (2001)

We present versions of concentration inequalities for products of Markov kernels and graph products. We also present discussions of a variety of consequences such as sharp upper bounds, in terms of the diameter of the state space, on the spectral gap.
Price competition between an internet firm and a bricks and mortar firm
Authors: Evan Porteus
Venue:  (2003)

This dissertation uses a vertically differentiated products model to examine price competition between two firms, one Internet and one bricks and mortar, who sell the same physical product. Demand is deterministic and is based on consumers' reservation price curves, which are taken to be linear. Consumers are assumed to have different reservation prices for the two channels, even when buying the same physical product, because of the differences in how individuals value the &ldquo;total product,&rdquo; the utility of the product itself plus perceived and actual costs and benefits such as driving time, waiting time for products shipped, search time, and the shopping experience itself. Customers will choose to purchase from the firm that provides them the most economic surplus. Additionally, only a fraction of the population is assumed to both have access to the Internet and be willing to purchase on-line. As a result, there are effectively two market segments: those who will purchase on-line and those who will purchase only at a bricks and mortar store. We solve for each firm's optimal price in both Nash (simultaneous) and Stackelberg (sequential) games. Using the degree of innovation, a concept developed by Schmidt and Porteus (2000b), the resulting market structures are interpreted and the importance of innovation in service execution, cost control, and marketing is discussed. For a fixed degree of innovation and reservation price curve structure in the Nash game, it is demonstrated that as the fraction of consumers willing to purchase on-line increases, the resulting market structure may change. Moreover, at odds with one's expectations, as more people become willing to shop on-line, the Internet firm may actually be worse off, all else equal. The increase in the fraction of on-line shoppers alone is not enough to improve the Internet firm's market position. The leader-follower game is also developed, allowing the comparison of the two Stackelberg equilibria and the simultaneous Nash game equilibrium. A firm is found to be at least weakly better off in the Stackelberg equilibria, assuming s/he gets to choose his/her most preferred role.
The book review column
Authors: William Gasarch
Venue: ACM SIGACT News (2003)

In this column we review the books listed below. In addition there is a comment by Oded Goldreich on the review of his book Foundations of Cryptography.
Medical errors as a result of specialization
Authors: Ahmad Hashem, Michelene T. H. Chi, Charles P. Friedman
Venue: Journal of Biomedical Informatics (2003)

Errors in medicine result in over 44,000 preventable deaths annually. Some of these errors are made by specialized physicians at the time of diagnosis. Building on error frameworks proposed in the literature, we tested the experimental hypothesis that physicians within a given specialty have a bias in diagnosing cases outside their own domain as being within that domain. Thirty-two board-certified physicians from four internal medicine subspecialties worked four patient cases each. Verbal protocol analysis and general linear modeling of the numerical data seem to confirm the experimental hypothesis, indicating that specialists try to "pull" cases toward their specialty. Specialists generate more diagnostic hypotheses within their domain than outside, and assign higher probabilities to diagnoses within that domain.
Designing appliances for mobile commerce and retailtainment
Authors: George Roussos, Panos Kourouthanasis, Theano Moussouri
Venue: Personal and Ubiquitous Computing (2003)

In the emerging world of the new consumer and the `anytime, anywhere' mobile commerce, appliances are located at the collision point of the retailer and consumer agendas. The consequence of this is twofold: on the one hand appliances that were previously considered plain and utilitarian become entertainment devices and on the other, for the effective design of consumer appliances it becomes paramount to employ multidisciplinary expertise. In this paper, we discuss consumer perceptions of a retailtainment commerce system developed in collaboration between interactivity designers, information systems engineers, hardware and application developers, marketing strategists, product development teams, social scientists and retail professionals. We discuss the approached employed for the design of the consumer experience and its implications for appliance design.
EDITORIAL
Authors: Anonymous
Venue: Organised Sound (2001)

The collection of papers in this issue of Organised Sound results from a call for material focused on the theme of music technology in Australasia (New Zealand, Australia and neighbouring Islands of the South Pacific) and South East Asia (Brunei, Burma, Indonesia, Cambodia, Laos, Malaysia, the Philippines, Thailand and Vietnam).
A unified approach to analyze multiple access protocols for buffered finite users
Authors: Asrar Sheikh, Tao Wan, Zaki Alakhdar
Venue: Journal of Network and Computer Applications (2004)

In this paper, a new approach is proposed to analyze the performance of buffered random multiple access protocols called tagged user analysis (TUA). In TUA, each user is modeled as an independent queueing system, which operates at its own equilibrium probability. As a result, the classical queueing theory can be employed to analyze the queueing behavior of each user. On the basis of the behavior of the tagged user, the performance of the whole system is analyzed. TUA is a unified method of analyzing most of random access methods including the heterogeneous random multiple access techniques that are difficult to analyze otherwise. Furthermore, TUA can also handle those systems where user terminals may have arbitrary packet size (in slots) distribution, arbitrary arrival processes such as batch packet arrivals in Bernoulli, arbitrary service principle such as priority queueing, last came first served, and random service. In this paper, in addition to analyzing for the distributions of several performance indices, their mean values are obtained.
Electronic journalism in Peru
Authors: Antonio Díaz, Martín Santana
Venue: Information management: support systems & multimedia technology (2003)

This chapter introduces electronic journalism as a new trend in the news services that have recently been boosted by Internet diffusion. It makes a presentation of electronic media pioneers in the world and the challenges they faced to deliver news to their traditional and Internet-based customers. Mainly, the chapter focuses on the description of the beginnings, evolution, strategies, and current state of Peruvian information media, focusing on Web-based journalism. Finally, the authors offer some conclusions about the approaches to develop Web news services adopted by traditional and virtual media, and suggest the need for future research in different countries in order to compare results and define the media trends in the Internet era.
Stretching and jamming of automata
Authors: Noud De Beijer, Bruce W. Watson, Derrick G. Kourie
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

In this paper we present two transformations on automata, called stretching and jamming. These transformations will, under certain conditions, reduce the size of the transition table, and under other conditions reduce the string recognition time. Given a deterministic finite automaton, we can stretch it by transforming each single transition into two or more sequential transitions, thereby introducing additional intermediate states. Jamming is the opposite transformation, in which two or more successive transitions are transformed into a single transition, thereby removing redundant intermediate states.We will present formal definitions of stretching and jamming. We will give algorithms for stretching and jamming and we will calculate theoretical bounds, when stretching/jamming is effective in terms of memory consumption and string recognition time.
Framing online art
Authors: Carl Goodman
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

Online and offline exhibition spaces are an important mechanism by which online artworks are experienced by and contextualized for audiences. Critical attention needs to be paid to the aesthetics and pragmatics underlying these 'frames' for online art.There is a range of approaches to presentations of online art. Some seek to duplicate either the structure or the look of physical exhibits in galleries and museums. Others mimic online and offline presentational forms such as search engines or magazines. Taking into account the relativity of content and context online, some of the most adventurous exhibition spaces are effectively inseparable from the works they present, and can be considered artworks themselves.While online exhibits initially sought to duplicate the form of the physical exhibition space, today we are beginning to see the reverse. The fluid and flexible aesthetic of the online exhibit is beginning to creep into the design of physical exhibits. One such example, <Alt>DigitalMedia, is a physical gallery space of digital art at the American Museum of the Moving Image.The broad debate about whether online works are to be displayed at all in physical spaces does not take into account the inherent variability of software-based art, the sheer diversity of works and genres in existence, and the notion that distinguishing online from offline experience, physical from virtual, is becoming increasingly immaterial. More relevant are discussions around how online work can be implemented in a physical context, and how the artwork itself might have both a physical and virtual embodiment. Such discussions are most productive when each work is taken on its own terms. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Design of Slepian-Wolf Codes by Channel Code Partitioning
Authors: Vladimir Stankovic, Angelos D. Liveris, Zixiang Xiong, Costas N. Georghiades
Venue: Proceedings of the Conference on Data Compression (2004)

A Slepian-Wolf coding scheme that can achieve arbitrary rate allocation amongtwo encoders was outlined in the work of Pradhan and Ramchandran. Inspired by thiswork, we start with a detailed solution for general (asymmetric or symmetric) Slepian-Wolfcoding based on partitioning a single systematic channel code, and continuewith practical code designs using advanced channel codes. By using systematic IRAand turbo codes, we devise a powerful scheme that is capable of approaching any pointon the Slepian-Wolf bound. We further study an extension of the technique to multiplesources, and show that for a particular correlation model among the sources, a singlepractical channel code can be designed for coding all the sources in symmetric andasymmetric scenarios. If the code approaches the capacity of the channel that modelsthe correlation between the sources, then the system will approach the Slepian-Wolflimit. Using systematic IRA and punctured turbo codes for coding two binary sources,each being independent identically distributed, with correlation modeled by a binarysymmetric channel, we obtain results which are 0.04 bits away from the theoreticallimit in both symmetric and asymmetric Slepian-Wolf settings.
Software Codons for Fast Program Reassembly from Components
Authors: Yonatan Myers, Iaakov Exman
Venue: Proceedings of the IEEE International Conference on Software-Science, Technology & Engineering (2003)

Software Codons - like their biological counterparts -carry compact information to allow rebuilding programsfrom software components available in the surroundings.Software Codons, proposed in this work, contain -besides the usual component interface - outstandingvalues and IO-signatures computed from sets of input-outputpairs.This paper discusses requirements for fast programreassembly. Software Codon generation should be doneoffline. Candidate components are selected by on-lineautomatic Software Codon matching.
On Precision and Recall of Multi-Attribute Data Extraction from Semistructured Sources
Authors: Guizhen Yang, Saikat Mukherjee, I. V. Ramakrishnan
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Machine learning techniques for data extraction fromsemistructured sources exhibit different precision and recallcharacteristics. However to date the formal relationship betweenlearning algorithms and their impact on these twometrics remains unexplored. This paper proposes a formalizationof precision and recall of extraction and investigatesthe complexity-theoretic aspects of learning algorithms formulti-attribute data extraction based on this formalism. Weshow that there is a tradeoff between precision/recall of extractionand computational efficiency and present experimentalresults to demonstrate the practical utility of theseconcepts in designing scalable data extraction algorithmsfor improving recall without compromising on precision.
Design of optimal shift-invariant orthonormal wavelet filter banks via genetic algorithm
Authors: Lik-Kwan Shark, Chunyang Yu
Venue: Signal Processing (2003)

Although the orthonormal discrete wavelet transform offers the advantage of computation efficiency, it is generally not shift-invariant thereby yielding different transform coefficient values when applied to the same signal with different time shifts. Proposed in this paper is a new design method based on the genetic algorithm for the construction of orthonormal wavelet filter banks with an optimal shift-invariant property. In particular, the paper presents transformation of the multi-objective filter bank design problem to a single-objective constrained optimisation problem, chromosome representation of filter coefficients, the shift-invariant objective function for chromosome fitness evaluation, as well as a special constraint to discard infeasible solutions thereby confining the search for the optimum, based on the natural evolution mechanisms, within the wavelet sub-space. Furthermore, using denoising as an example, the performance of the wavelet filter bank constructed is compared with the classical wavelet filter banks to demonstrate its optimality.
Interconnect Modeling for Copper/Low-k Technologies
Authors: Nagaraj NS, Tom Bonifield, Abha Singh, Roger Griesmer, Poras Balsara
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Interconnect parasitics are significant and complexcomponents of circuit performance, signal integrity andreliability in IC design. Copper/low-k process effects arebecoming increasingly important to accurately modelinterconnect parasitics. In this tutorial, four key aspects ofcopper/low-k interconnect process are discussed: Non-linearresistance, Selective Process Bias (SPB), dummy (fill) metaland process variations. Even if the interconnect processprofile is accurately represented, approximations in parasiticextraction could cause large errors. Techniques used inparasitic extraction to model the copper/low-k effects arediscussed in detail. Techniques to measure resistance andcapacitance in silicon and correlating them to parasiticextraction tools are presented to demonstrate systematicvalidation interconnect parasitics.
Objective measurement of efficiency: applying single price model to rank hospital activities
Authors: Enrique Ballestero, José A. Maldonado
Venue: Computers and Operations Research (2004)

Single price model is a recent approach to measurement of efficiency from assumptions and developments which widely differ from data envelopment analysis. Its purpose is to rank the activities objectively with independence of the decision-maker's opinions and preferences as subjective factors of ranking. In this paper, the previous version of the model is reformed in critical aspects, extended and applied to a case of 27 hospital units with real world information on two inputs and four outputs. In this revised version, the axiomatic basis is reduced to a single assumption, and new general formal proofs are provided. As objectively implemented, the complete ranking leads to the most efficient activity and the most productive scale size in multiple output/input problems.
On the Use of Conceptual Reconstruction for Mining Massively Incomplete Data Sets
Authors: Srinivasan Parthasarathy, Charu C. Aggarwal
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

Incomplete data sets have become almost ubiquitous in a wide variety of application domains. Common examples can be found in climate and image data sets, sensor data sets, and medical data sets. The incompleteness in these data sets may arise from a number of factors: In some cases, it may simply be a reflection of certain measurements not being available at the time, in others, the information may be lost due to partial system failure, or it may simply be a result of users being unwilling to specify attributes due to privacy concerns. When a significant fraction of the entries are missing in all of the attributes, it becomes very difficult to perform any kind of reasonable extrapolation on the original data. For such cases, we introduce the novel idea of conceptual reconstruction in which we create effective conceptual representations on which the data mining algorithms can be directly applied. The attraction behind the idea of conceptual reconstruction is to use the correlation structure of the data in order to express it in terms of concepts rather than the original dimensions. As a result, the reconstruction procedure estimates only those conceptual aspects of the data which can be mined from the incomplete data set, rather than force errors created by extrapolation. We demonstrate the effectiveness of the approach on a variety of real data sets.
Evaluating the factors affecting decision support system usage by strategic decision makers in Egypt: using a structural equation modelling approach
Authors: Ibrahim Elbeltagi
Venue: Managing globally with information technology (2003)

This chapter draws on a survey of CEO and IT managers in local authorities in Egypt to explain the key factors affecting their use of DSS in making strategic decisions. This chapter proposes and tests a Structural Equation Model (SEM) that extends the generally accepted Technology Acceptance Model to assess relationships between an extensive range of constructs and their relation with DSS usage via Perceived Ease of Use and Perceived Usefulness. The SEM approach has enabled the development of a framework that will support a sustainable approach towards the adoption and use of DSS in developing Middle Eastern countries.
Reversal of Markov Chains and the Forget Time
Authors: László Lovász, Peter Winkler
Venue: Combinatorics, Probability and Computing (1998)

We study three quantities that can each be viewed as the time needed for a finite irreducible Markov chain to &lsquo;forget&rsquo; where it started. One of these is the mixing time, the minimum mean length of a stopping rule that yields the stationary distribution from the worst starting state. A second is the forget time, the minimum mean length of any stopping rule that yields the same distribution from any starting state. The third is the reset time, the minimum expected time between independent samples from the stationary distribution.Our main results state that the mixing time of a chain is equal to the mixing time of the time-reversed chain, while the forget time of a chain is equal to the reset time of the reverse chain. In particular, the forget time and the reset time of a time-reversible chain are equal. Moreover, the mixing time lies between absolute constant multiples of the sum of the forget time and the reset time.We also derive an explicit formula for the forget time, in terms of the 'access times' introduced in [11]. This enables us to relate the forget and reset times to other mixing measures of the chain.
Affective Computing in Tele-Home Health
Authors: Christine Lisetti, Cynthia LeRouge
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

This study exemplifies the integration of IS behavioral science in the area of technology adoption and diffusion into the design science process. We first identify the computer-mediated paradox, as it exists in the tele-home health care setting. Specifically, weaddress the challenges of providing quality patient inclusive of affective assessment. From the design science perspective, we then introduce an intelligent interface (MOUE) aimed at discerning emotional state from processing sensory modalities (or modes) input via various media and building (or encoding) a model of the user's emotions. We contextualize MOUE within the tele-home health care setting to provide the health care provider with an easy-to-use and useful assessment of the patient's emotional state in order to facilitate patient care. We then use an IS adoption model developed and tested in the general telemedicinecontext in a qualitative exploratory manner as a means to inform design science regarding adapting affective state output in consideration of tele-home health adoption and diffusion issues. Based upon this integrative exploration, we propose to expand the application of "Wizard of Oz" type studies [1] to computer-mediated communication (CMC) environments to investigate how emotional state assessments influence responses from health care professionals and how MOUE can be accepted into the health care environment.