ppxscal/embedding_network huggingface dataset:
The Assimilation of Knowledge Platforms in Organizations: An Empirical Investigation
Authors: Russell L. Purvis, V. Sambamurthy, Robert W. Zmud
Venue: Organization Science (2001)

The ability to integrate dispersed pockets of expertise and institute an organizational repository of knowledge is considered to be vital for sustained effectiveness in contemporary business environments. Information technologies provide cost-effective functionalities for building knowledge platforms through systematic acquisition, storage, and dissemination of organizational knowledge. However, in order to gain the value-adding potential of organizational knowledge, it is not sufficient to simply adopt and deploy IT-enabled knowledge platforms. These platforms must be assimilated into the ongoing work processes in organizations. Yet, theories of technology innovation and use suggest that a variety of institutional, social, and political factors blend together in influencing the extent to which complex information technologies are actually assimilated into organizational practice. Therefore, this research addresses a significant question: What forces influence the assimilation of knowledge platforms in organization? Given the significant gap between the adoption and actual assimilation of complex technologies into organizations, this is an important question. Empirical evidence is generated by examining the forces influencing the assimilation of CASE technologies in systems development projects in organizations. CASE is considered to be one of the most mature knowledge platforms in contemporary organizations. The empirical evidence sheds light on the role of institutional forces that influence the rate of assimilation of the technology. The findings have significant implications for further research and practice.
QoS of internet access with GPRS
Authors: Dirk Staehle, Kenji Leibnitz, Konstantin Tsipotis
Venue: Wireless Networks (2003)

In this paper we examine the effects of Internet traffic on the Quality of Service (QoS) in GPRS wireless networks. With a stochastic source traffic model describing the user behavior, we will derive subjective and objective Quality of Service measures in terms of WWW downloading time and the transmission bandwidths on TCP and TBF level. Comparing the obtained values with wireline network modems and ISDN yields a slowdown factor which indicates the subjective degradation that the wireless user experiences.
Distributed Visual Information Management in Astronomy
Authors: Fionn Murtagh, Jean-Luc Starck, Mireille Louys
Venue: Computing in Science and Engineering (2002)

Among the many interesting computational problems that observational astronomy poses, broad aspects of visual information management are crucial. In this regard, observational astronomy "collaboratories" provide important testbeds for other fields serving less well?defined communities-telemedicine, Earth observation, and graphic art and design come to mind. The authors review issues related to large-image visualization in astronomy and a recently developed toolset for this purpose. Resolution scale is central, offering one way to address the long?term data storage problem, and the authors review recent developments in this area. Also, to support image database querying, they define multiple-resolution information and entropy. They show how these are closely related to the compression rate and discuss using these concepts in image database querying.
Inverse problem for interior spectral data of the Dirac operator on a finite interval
Authors: Kiyoshi Mochizuki, Igor Trooshin
Venue: Publications of the Research Institute for Mathematical Sciences (2002)

In this paper the inverse problems for the Dirac operator on a finite interval are studied. A set of values of eigenfunctions in some internal point and spectrum are taken as a data. Uniqueness theorems are obtained. The approach that was used in the investigation of inverse problems for interior spectral data of the Sturm-Liouville operator is employed.
Optimal Pricing of Priority Services
Authors: S. Rao, E. R. Petersen
Venue: Operations Research (1998)

We consider the problem of a service facility that offers m different priority classes to its n customers, and sets a tariff (price-schedule) to maximize profit. Each customer must use the service facility and will select an output rate and the priority classes used to maximize profit. The problem is formulated as a noncooperative game. We show that equilibrium output rates and assignments to priority classes can be determined by solving the integrated system problem (ISP) that maximizes the joint prof it of all agents. The service facility can be represented by a network, and ISP is a traffic assignment problem. A tariff schedule that induces each customer to select the integrated system output rate and assignment is said to be vertically efficient. We show that the server can select vertically efficient tariffs that result in an equilibrium. Optimal pricing for the special case where the service facility is modeled as a priority queue is discussed. Examples are included to illustrate the results.
Metropolis: An Integrated Electronic System Design Environment
Authors: Felice Balarin, Yosinori Watanabe, Harry Hsieh, Luciano Lavagno, Claudio Passerone, Alberto Sangiovanni-Vincentelli
Venue: Computer (2003)

Today, the design chain lacks adequate support, with most system-level designers using a collection of unlinked tools. The implementation then proceeds with informal techniques involving numerous human-language interactions that create unnecessary and unwanted iterations among groups of designers in different companies or different divisions.The move toward programmable platforms shifts the design implementation task toward embedded software design. When embedded software reaches the complexity typical of today's designs, the risk that the software will not function correctly increases exponentially. The Metropolis project seeks to develop a unified framework that can cope with this challenge.
An Identification Algorithm for Dynamic Systems with a Functional in the Frequency Domain
Authors: O. N. Korsun
Venue: Automation and Remote Control (2003)

A parametric identification algorithm for dynamic systems is designed by the method maximum likelihood estimation in a time domain. Since the minimizing functional is formed in the frequency domain, the algorithm acquires new useful properties, mostly due to the suppression of disturbances through the choice of the working frequency ranges. The algorithm is modified such that time-shift disturbances of the recorded signal are suppressed. 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
Classification and feature gene selection using the normalized maximum likelihood model for discrete regression
Authors: Ioan Tabus, Jorma Rissanen, Jaakko Astola
Venue: Signal Processing (2003)

This paper studies the problem of class discrimination based on the normalized maximum likelihood (NML) model for a nonlinear regression, where the nonlinearly transformed class labels, each taking M possible values, are assumed to be drawn from a multinomial trial process. The strength of the MDL methods in statistical inference is to find the model structure which, in this particular classification problem, amounts to finding the best set of feature genes. We first show that the minimization of the codelength of the NML model for different sets of feature genes is a tractable problem. We then extend the model for selecting the feature genes to a completely defined classifier and check its classification error in a cross-validation experiment. Also the quantization process itself involved in getting the required entries in the model, can be evaluated with the NML description length. The new classification method is applied to leukemia class discrimination based on gene expression microarray data. We find classification errors as low as 0.03% with a quadruplet of binary qnantized genes, which was top ranked by the NML description length. Such a length of the class labels, obtained with various sets of feature genes in the nonlinear regression model, allows intuitive comparisons of nested feature sets.
UPPAAL: now, next, and future
Authors: Tobias Amnell, Gerd Behrmann, Johan Bengtsson, Pedro R. D'Argenio, Alexandre David, Ansgar Fehnker, Thomas Hune, Bertrand Jeannet, Kim G. Larsen, M. Oliver Möller, Paul Pettersson, Carsten Weise, Wang Yi
Venue: Modeling and verification of parallel processes (2001)

UPPAAL is a tool for modeling, simulation and verification of real-time systems, developed jointly by BRICS at Aalborg University and the Department of Computer Systems at Uppsala University. The tool is appropriate for systems that can be modeled as a collection of non-deterministic processes with finite control structure and real-valued clocks, communicating through channels or shared variables. Typical application areas include real-time controllers and communication protocols, in particular those where timing aspects are critical.This paper reports on the currently available version and summarizes developments during the last two years. We report on new directions that extends UPPAAL with cost-optimal exploration, parametric modeling, stop-watches, probablistic modeling, hierachical modeling, executable timed automata, and a hybrid automata animator. We also report on recent work to improve the efficiency of the tool. In particular, we outline Clock Difference Diagrams (CDDs), new compact representations of states, a distributed version of the tool, and application of dynamic partitioning.UPPAAL has been applied in a number of academic and industrial case studies. We describe a selection of the recent case studies.
Models for Design and Control of Single Server Polling Computer and Communication Systems
Authors: Nathalie Bostel, Pierre Dejax, Thomas (Yew Sing) Lee
Venue: Operations Research (1998)

The evolution of communication technology and the competitive software design environment dictates that performance characterization involves iterations between real-world design and its representation for modeling purposes. In this paper, models and analytical techniques are developed to evaluate the performance of single-server polling computer and communication systems, e.g., multiplexers or local area networks with a single token passing medium access protocol. We present a novel methodology for the design and control of such communication systems and computer systems. Our approach allows the handling of smooth, correlated, and bursty traffic, whereas traditional analytical approaches have depended on a Poisson traffic model. The methodology also provides a unified treatment of several existing methodologies for controlling single-server polling computer and communication systems.
A panoramic walkthrough system with occlusion culling
Authors: Lining Yang, Roger Crawfis
Venue: Proceedings of the workshop on Virtual environments 2003 (2003)

The interactive and high quality rendering of very complex scenes in a virtual environment is very difficult if not impossible to achieve. This research extends our previous EGVE paper that presents a panoramic walkthrough system, allowing the user to move inside the datasets on a pre-defined track and look around interactively in both the horizontal and vertical directions. The interactivity is achieved by using Image-Based Rendering ideas to pre-compute the partial renderings for the reference viewpoints chosen on the track and store them on the server so that the client can retrieve and reconstruct novel views using the appropriate information. In this paper, we present simple and efficient methods to partition the scene into depth layers to avoid occlusion and dis-occlusion problems. We also present a novel track-dependent occlusion cullion algorithm to efficiently cull away unnecessary information. The system is tested using several scenes and provides realtime walkthroughs on even the most challenging scenes.
Difference equations for the co-recursive rth associated orthogonal polynomials of theDq-Laguerre-Hahn class
Authors: M. Foupouagnigni, A. Ronveaux
Venue: Journal of Computational and Applied Mathematics (2003)

We use some relations between the rth associated orthogonal polynomials of the Dq-Laguerre-Hahn class to derive the fourth-order q-difference equation satisfied by the co-recursive rth associated orthogonal polynomials of the Dq-Laguerre-Hahn class.When r = 1 and for q-semi-classical situations, this q-difference equation factorizes as product of two second-order q-difference equations. Finally, we study some classical situations, and give some examples relative to the co-recursive associated discrete q-Hermite II orthogonal polynomials.
Dynamic-Distributed Differentiated Service for Multimedia Applications
Authors: Dam Q. Hai, Son T. Vuong
Venue: Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8) (2000)

Differentiated Services (DiffServ) is a set of technologies by which network service providers can offer differing levels of network quality-of-service (QoS) to different customers and their traffic streams. In DiffServ, packets of the same QoS specification are grouped together and forwarded in the same manner, e.g. to a given subnet or set of subnets with some level of service provisioning. Thus, DiffServ scales better than the per-flow integrated service (IntServ). A major disadvantage of DiffServ in comparison with IntServ is that DiffServ does not provide a full guarantee to every application flow, especially for multimedia applications. In this paper, we propose the so-called Dynamic-Distributed DiffServ scheme that allows every DiffServ aggregate a fair chance of passing through the router in the same period of time, while guaranteeing an upper bound on the delay time and delay variations for multimedia data packets inside the DiffServ domain. The scheme is attractive in that it is simple and does not involve maintenance of complicated per-flow state information. The scheme works well for all DiffServ services, including the Premier service and the Assured Forwarding service.
Before this decade is out: a student project to place a telescope on the internet
Authors: Michael P. Rogers
Venue: Journal of Computing Sciences in Colleges (2001)

This paper describes a student project to place a telescope on the internet: such a telescope can be pointed via a web interface, and images from it displayed on a user's computer. We discuss recent developments in astronomy hardware and computer software that place this still challenging project within the realm of the possible.
Building adaptive structure formations with decentralised control and coordination
Authors: Jan Wessnitzer, Chris Melhuish
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

We investigate collective decentralised decision-making in simple mobile agents engaged in the task of structure formation where the radius of the formed structure is much larger than the communication radius of an individual agent. We are searching for minimal and local rules allowing adaptive behaviour in collectives of mobile agents. In previous experiments, we presented rules that govern the evolution of the inter-agent communication network toward some task-specific topologies that allow a decentralised collective of mobile agents to dynamically organise into simple geometric structures. In this paper, we study the problem of coordinating and controlling the global behaviour of the group of agents from their local interactions. The agents determine the successful termination of a structure formation and switch to another formation. In simulation we demonstrate global state changes and global state persistance in a decentralised collective of mobile agents.
A note on the completions of fuzzy metric spaces and fuzzy normed spaces
Authors: Jin-xuan Fang
Venue: Fuzzy Sets and Systems (2002)

In this paper, we point out that the completion theorem of fuzzy metric spaces given by Lee et al. (Fuzzy Sets and Systems 106 (1999) 469-473) is incorrect and prove a new completion theorem.
Research Report: Modifying Paradigms--Individual Differences, Creativity Techniques, and Exposure to Ideas in Group Idea Generation
Authors: Monica J. Garfield, Nolan J. Taylor, Alan R. Dennis, John W. Satzinger
Venue: Information Systems Research (2001)

In today's networked economy, ideas that challenge existing business models and paradigms are becoming more important. This study investigated how individual differences, groupware-based creativity techniques, and ideas from others influenced the type of ideas that individuals generated. While individual differences were important (in that some individuals were inherently more likely to generate ideas that followed the existing problem paradigm while others were more likely to generate paradigm-modifying ideas that attempted to change the problem paradigm), the exposure to paradigm-modifying ideas from others and the use of intuitive groupware-based creativity techniques rather than analytical groupware-based creativity techniques were found to increase the number of paradigm-modifying ideas produced.
Orthogonal rational functions and tridiagonal matrices
Authors: A. Bultheel, P. González-Vera, E. Hendriksen, O. Njåstad
Venue: Journal of Computational and Applied Mathematics (2003)

We study the recurrence relation for rational functions whose poles are in a prescribed sequence of numbers that are real or infinite and that are orthogonal with respect to an Hermitian positive linear functional. We especially discuss the interplay between finite and infinite poles. The recurrence relation will also be described in terms of a tridiagonal matrix which is a generalization of the Jacobi. matrix of the polynomial situation which corresponds to placing all the poles at infinity. This matrix not only describes the recurrence relation, but it can be used to give a determinant expression for the orthogonal rational functions and it also allows for the formulation of a generalized eigenvalue problem whose eigenvalues are the zeros of an orthogonal rational function. These nodes can be used in rational Gauss-type quadrature formulas and the corresponding weights can be obtained from the first components of the corresponding eigenvectors.
Structural analysis of audit evidence using belief functions
Authors: Rajendra P. Srivastava, Hai Lu
Venue: Fuzzy Sets and Systems (2002)

This article performs two types of analysis using Dempster-Shafer theory of belief functions for evidential reasoning. The first analysis deals with the impact of the structure of audit evidence on the overall belief at each variable in the network, variables being the account balance to be audited, the related transaction streams, and the associated audit objectives. The second analysis deals with the impact of the relationship (logical 'and' and 'algebraic relationship') among various variables in the network on the overall belief. For our first analysis, we change the evidential structure from a network to a tree and determine its impact.
Minimum Advertised-Price Policy Rules and Retailer Behavior: An Experiment by Hewlett-Packard
Authors: Gary Charness, Kay-Yut Chen
Venue: Interfaces (2002)

We tested the effects of various policy rules on retailer behavior in laboratory experiments conducted at Hewlett-Packard Laboratories. Our experimental design models the multifaceted contemporary market for consumer computer products and is quite complex, but we found that participants can make effective decisions and that their behavior is sensitive to variations in policies. Based on our results, Hewlett-Packard changed its policies; for example, it made the consequences for violations forward looking as well as backward looking. This line of research appears promising for complex industrial environments.
Handling pointers and unstructured statements in the forward computed dynamic slice algorithm
Authors: Csaba Faragó, Tamás Gergely
Venue: Acta Cybernetica (2002)

Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithrms can be classified as a static slicing or dynamic slicing type. In applications such as debugging the computation of dynamic slices is more preferable since it can produce more precise results. In a recent paper [5] a new so-called "forward computed dynamic slice" algorithm was introduced. It has the great advantage compared to other dynamic slice algorithms that the memory requirements of this algorithm are proportional to the number of different memory locations used by the program, which in most cases is much smaller than the size of the execution history. The execution time of the algorithm is linear in the size of the execution history. In this paper we introduce the handling of pointers and the jump statements (goto, break, continue) in the C language.
Membership Size, Communication Activity, and Sustainability: A Resource-Based Model of Online Social Structures
Authors: Brian S. Butler
Venue: Information Systems Research (2001)

As telecommunication networks become more common, there is an increasing interest in the factors underlying the development of online social structures. It has been proposed that these structures are new forms of organizing which are not subject to the same constraints as traditional social structures. However, from anecdotal evidence and case studies it is difficult to evaluate whether online social structures are subject to the same problems as traditional social structures. Drawing from prior studies of traditional social structures and empirical analyses of longitudinal data from a sample of Internet-based groups, this exploratory work considers the role of size and communication activity in sustainable online social structures.A resource-based theory of sustainable social structures is presented. Members contribute time, energy, and other resources, enabling a social structure to provide benefits for individuals. These benefits, which include information, influence, and social support, are the basis for a social structure's ability to attract and retain members. This model focuses on the system of opposing forces that link membership size as a component of resource availability and communication activity as an aspect of benefit provision to the sustainability of an online social structure. Analyses of data from a random sample of e-mail-based Internet social structures (listservs) indicate that communication activity and size have both positive and negative effects on a structure's sustainability. These results suggest that while the use of networked communication technologies may alter the form of communication, balancing the opposing impacts of membership size and communication activity in order to maintain resource availability and provide benefits for current members remains a fundamental problem underlying the development of sustainable online social structures.
Robotic wheelchair looking at all people
Authors: Yoshinori Kuno, Akio Nakamura
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Although several robotic/intelligent wheelchairs have been proposed recently,they consider friendliness only to their users. Machines like wheelchairs interact various people other than their users. They must consider friendliness to all these people. This paper presents a robotic wheelchair that cares for all relevant people: users, pedestrians, and caregivers, by looking at these people. It looks at the user's face, observing its direction. The user can turn it by looking in his/her desired direction. It looks at pedestrians and changes the way of avoidance against them depending on whether or not their noticing it. In addition, it looks at the caregiver when he/she is with it and keeps moving with him/her.