ppxscal/embedding_network huggingface dataset:
Exploring enterprise mobility: Lessons from the field
Authors: Carsten Sørensen, Adel Al-Taitoon, Jan Kietzmann, Daniele Pica, Gamel Wiredu, Silvia Elaluf-Calderwood, Kofi Boateng, Masao Kakihara, David Gibson
Venue: Information-Knowledge-Systems Management (2008)

The mobile phone has received global attention primarily as a personal consumer technology. However, we believe that mobile information technology in general will play a significant role in organisational efforts to innovate current practices and have significant economic impact. Enterprise mobility signals new ways of managing how people work together using mobile information technology and will form an integral part of the efforts to improve the efficiency and effectiveness of information work. This belief is, however, not reflected in the current selection of books and collections exploring the issue of enterprise mobility. The aim of this paper is to highlight some of the key challenges in the application of mobile information technology to improve organisational efficiency. This is accomplished through comparing and contrasting findings from a selection of 11 empirical studies of enterprise mobility with information technology conducted between 2001 and 2007. The paper argues that the debate so far has largely failed to embed glowing accounts for technological potential in a sound discussion of organisational realities. In particular, there has been a lack of balanced accounts of the implicit and explicit trade-offs involved in mobilising the interaction between members of the workforce.
A Service-Oriented Architectural Framework for the Integration of Information Systems in Clinical Research
Authors: Sebastian Wurst, Gregor Lamla, Jörg Schlundt, Randi Karlsen, Klaus Kuhn
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Integration of data from heterogeneous sources has been a problem in medicine over decades. In the post genomicera, new opportunities have emerged and created new challenges, e.g. when genotypes and phenotypes have to be associated. We have developed a concept for integrating data from systems in clinical and in research environments, with a specific focus on process support. Our solution is following a mediator based approach, realized in a service-oriented architecture using web services. In order to cope with complexity and changing requirements, and to make early user feedback possible, a tool-based agile software development process has been carried out for building a prototype. Open-source technology has been used for the implementation.
A scalable fast forwarding approach for IP networks
Authors: Ke Xiong, Zheng-Ding Qiu, Hong-Ke Zhang, Chung-Sheng Li, Han-Chieh Chao
Venue: International Journal of Internet Protocol Technology (2008)

In the internet era, how to optimise cost and performance of routers is the objective of traffic engineering especially for real time services. In this paper, we aim at excogitating a new approach to achieve fast switch, scalability, simplicity and enhancement of the IP Network QoS performances. The new forwarding approach To Next-hop Output Port Sequence Switch (TNPOSS), which can work on the existing routing protocols, achieve fast switch and execute like Explicit Route by setting up a connection-oriented Output-port Sequence Path (OSP). Our simulation results show that TNPOSS can provide shorter end-to-end delay and more throughputs than MPLS.
Self-organising Management Overlays for Future Internet Services
Authors: Lawrence Cheng, Alex Galis, Bertrand Mathieu, Kerry Jean, Roel Ocampo, Lefteris Mamatas, Javier Rubio-Loyola, Joan Serrat, Andreas Berl, Hermann Meer, Steven Davy, Zeinab Movahedi, Laurent Lefevre
Venue: Proceedings of the 3rd IEEE international workshop on Modelling Autonomic Communications Environments (2008)

Networks are becoming service-aware implying that all relevant business goals pertaining to a service are fulfilled, and also the network resources are used optimally. Future Internet Networks (FIN) have time varying topology (e.g. such networks are envisaged in Autonomic Internet [1], FIND program [2], GENI program [3], FIRE program [4], Ambient Networks [5], Ad-hoc networks [6]) and service availability and service context change as nodes join and leave the networks. In this paper we propose and evaluate a new self-organising service management system that manages such changes known as the Overlay Management Backbones (OMBs). The OMB is a self-organising solution to the problem space in which each OMB node is dynamically assigned a different service context task. The selection of OMB nodes is conducted automatically, without the need of relatively heavy-weighted dynamic negotiations. Our solution relies on the scalability and dynamicity advantages of Distributed Hash Tables (DHTs). This system is needed to select continuously, automatically, and dynamically a set of network nodes, to become responsible for collecting the availability information of service context in the changing network. This solution advances the state of the art avoiding dynamic negotiations between all network nodes reducing management complexity and cost for bandwidth-limited environments.
Dynamic composable computing
Authors: Roy Want, Trevor Pering, Shivani Sud, Barbara Rosario
Venue: Proceedings of the 9th workshop on Mobile computing systems and applications (2008)

In the last 10 years, personal computing has evolved from being primarily a desktop activity to a highly mobile one: the laptop computer, despite its large size and significant weight, has been the most popular mobile platform to date. While smart phones and MIDs (Mobile Internet Devices) have made in-roads into general computing applications, their use is limited to a few key tasks (e.g., calendar, rolodex, mp3 player) that are suited to the small size of their keypad and screen. However, given ever increasing processing and storage capabilities, the potential of these devices far exceeds the computational needs of these applications, and a significant problem facing the mobile industry is how to give users access to a full personal computing experience [9] with the mobility afforded by a smart phone or MID.
An Introduction to the V-System
Authors: Eric Berglund
Venue: IEEE Micro (1986)

A distributed operating system runs on Sun and VAXstation-II workstations connected by an Ethernet. Its distributed kernel provides inexpensive processes and fast interprocess communication.
Generalized Adaptive A*
Authors: Xiaoxun Sun, Sven Koenig, William Yeoh
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

Agents often have to solve series of similar search problems. Adaptive A* is a recent incremental heuristic search algorithm that solves series of similar search problems faster than A* because it updates the h-values using information from previous searches. It basically transforms consistent h-values into more informed consistent h-values. This allows it to find shortest paths in state spaces where the action costs can increase over time since consistent h-values remain consistent after action cost increases. However, it is not guaranteed to find shortest paths in state spaces where the action costs can decrease over time because consistent h-values do not necessarily remain consistent after action cost decreases. Thus, the h-values need to get corrected after action cost decreases. In this paper, we show how to do that, resulting in Generalized Adaptive A* (GAA*) that finds shortest paths in state spaces where the action costs can increase or decrease over time. Our experiments demonstrate that Generalized Adaptive A* outperforms breadth-first search, A* and D* Lite for moving-target search, where D* Lite is an alternative state-of-the-art incremental heuristic search algorithm that finds shortest paths in state spaces where the action costs can increase or decrease over time.
Integrated Speaker Classification for Mobile Shopping Applications
Authors: Michael Feld, Gerrit Kahl
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

This paper presents an approach to how speaker classification can be used to enable new ways for recommender systems in a mobile shopping environment to bootstrap user models and avoid common problems such as the "early rater". In a concrete shopping scenario, we introduce the speech-controlled Mobile ShopAssist demonstrator that allows a new customer to more quickly find a product that fulfills his or her demographic group's specific requirements by exploiting features extracted from speech using the Agender speaker classification system. We propose a method for computing preference scores based on the user's profile and demonstrate how the application's GUI can be adapted to deliver the recommendations to the user.
Template Co-update in Multimodal Biometric Systems
Authors: Fabio Roli, Luca Didaci, Gian Luca Marcialis
Venue: Proceedings of the international conference on Advances in Biometrics (2007)

Performances of biometric recognition systems can degrade quickly when the input biometric traits exhibit substantial variations compared to the templates collected during the enrolment stage of users. This issue can be addressed using template update methods. In this paper, a novel template update method based on the concept of biometric co-training is presented. In multimodal biometric systems, this method allows co-updating the template galleries of different biometrics, realizing a co-training process of biometric experts which allows updating templates more quickly and effectively. Reported results provide a first experimental evidence of the effectiveness of the proposed template update method.
Round-Trip Engineering for Maintaining Conceptual-Relational Mappings
Authors: Yuan An, Xiaohua Hu, Il-Yeol Song
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

Conceptual-relational mappings between conceptual models and relational schemas have been used increasingly to achieve interoperability or overcome impedance mismatch in modern data-centric applications. However, both schemas and conceptual models evolve over time to accommodate new information needs. When the conceptual model (CM) or the schema associated with a mapping evolved, the mapping needs to be updated to reflect the new semantics in the CM/schema. In this paper, we propose a round-trip engineering solution which essentially synchronizes models by keeping them consistent for maintaining concep- tual-relational mappings. First, we define the consistency of a conceptual-relational mapping through "semantically compatible" instances. Next, we carefully analyze the knowledge encoded in the standard database design process and develop round-trip algorithms for maintaining the consistency of conceptual-relational mappings under evolution. Finally, we conduct a set of comprehensive experiments. The results show that our solution is efficient and provides significant benefits in comparison to the mapping reconstructing approach.
Scheduling and fairness in multi-hop wireless networks
Authors: Ion Stoica
Venue:  (2007)

Multi-hop wireless networks have been a subject of research for many years now. But recently, availability of inexpensive hardware has spurred interest in a new class of applications called mesh networks where multi-hop wireless routing is used to avoid the cost of deploying a wired backbone. However, both simulations and deployments based on the current generation of hardware (based mostly on the 802.11 standard) show very poor fairness between competing flows. In fact, the imbalance in throughput can be so severe that some nodes are completely shut out from sending any data at all. Some of this unfairness can be attributed to the lack of flexibility in the 802.11 Medium Access Control (MAC) layer to provide control over resource allocation. Recent work also suggests that Carrier-Sense Multiple Access (CSMA) based MAC protocols suffer from a more fundamental limitation due to problems caused by hidden terminals and asymmetric links. In this work, we address this problem by making the following three contributions. Firstly, we build an Overlay MAC Layer (OML) that implements a time-slot based scheduler that works on top of inexpensive 802.11 based hardware without any changes to the standard. The overlay approach also provides a lot of flexibility and can easily be adapted to specific applications and networks through simple software modifications. Secondly, we have developed a distributed algorithm that can efficiently detect interference by using passive measurements. While we use the inferred interference pattern to improve scheduling under OML, our algorithm can also be used in a number of other applications such as channel assignment, resource allocation and admission control. Thirdly, we have designed a transport layer algorithm called End-to-end Fairness using Local Weights (EFLoW) for providing global Max-Min Fairness. EFLoW uses an iterative additive-increase multiplicative-decrease (AIMD) based approach using only state from within a given node's contention region in each iteration. It can automatically adapt to changes in traffic demands and network conditions. We have evaluated our system by conducting experiments in both ns-2 and a 30-node testbed built using commodity hardware. We show that our algorithms can improve fairness by over 90% with only a small cost (typically less than 10%) in efficiency for a wide variety of traffic patterns and network conditions.
Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$
Authors: Kevin L. Chang
Venue: Proceedings of the 18th international conference on Algorithmic Learning Theory (2007)

We present a multiple pass streaming algorithm for learning the density function of a mixture of k uniform distributions over rectangles (cells) in ${\mathbb R}^d$, for any d > 0. Our learning model is: samples drawn according to the mixture are placed in arbitrary order in a data stream that may only be accessed sequentially by an algorithm with a very limited random access memory space. Our algorithm makes 2¿ + 1 passes, for any ¿> 0, and requires memory at most $\tilde O(\epsilon^{-2/\ell}k^2d^4+(2k)^d)$. This exhibits a strong memory-space tradeoff: a few more passes significantly lowers its memory requirements, thus trading one of the two most important resources in streaming computation for the other. Chang and Kannan ? first considered this problem for [1] d = 1, 2.Our learning algorithm is especially appropriate for situations where massive data sets of samples are available, but practical computation with such large inputs requires very restricted models of computation. 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
The National Bureau of Standards eastern automatic computer
Authors: S. N. Alexander
Venue: Papers and discussions presented at the Dec. 10-12, 1951, joint AIEE-IRE computer conference: Review of electronic digital computers (1951)

Some of you undoubtedly recall hearing reports during 1949 on the progress of the Interim Computer at the Washington Laboratory of the National Bureau of Standards. The program to develop that computer was proposed and explored during the summer of 1948 as means for providing a "stop-gap" installation for the NBS Computation Laboratory during the interim period while full scale equipment from a commercial source was being completed for delivery. This point of view was retained up to the end of 1949, during which period the machine's system and circuitry were developed. Early in 1950, however, it became evident that this "stop-gap" equipment would be the only equipment that would be available for two, and possibly three years. In view of this, the ultimate objectives for the computer installation were raised to cope with what could no longer be considered "an interim situation." Furthermore, the name "Interim Computer" was no longer appropriate and was eventually replaced by "SEAC"---Standards' Eastern Automatic Computer.
Using Swarm-GAP for Distributed Task Allocation in Complex Scenarios
Authors: Paulo R. Ferreira,  Jr., Felipe S. Boffo, Ana L. Bazzan
Venue: Massively Multi-Agent Technology: AAMAS Workshops, MMAS 2006, LSMAS 2006, and CCMMS 2007 Hakodate, Japan, May 9, 2006 Honolulu, HI, USA, May 15, 2007 Selected and Revised Papers (2008)

This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. It is well known that DCOP, when used to model complex scenarios, generates problems with exponentially growing number of parameters. However, those scenarios are becoming ubiquitous in real-world applications. Therefore, approximate solutions are necessary. We propose and evaluate an algorithm for distributed task allocation. This algorithm, called Swarm-GAP, is based on theoretical models of division of labor in social insect colonies. It uses a probabilistic decision model. Swarm-GAP is experimented both in a scenario from RoboCup Rescue and an abstract simulation environment. We show that Swarm-GAP achieves similar results as other recent proposed algorithm with a reduction in communication and computation. Thus, our approach is highly scalable regarding both the number of agents and tasks.
Programming Experimental Procedures for Newtonian Kinematic Machines
Authors: E. J. Beggs, J. V. Tucker
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

By experimental computation we mean the idea of computing a function by experimenting with some physical equipment. To analyse the functions computable by experiment, we are developing a methodology that chooses a precise specification of a physical theory T and derives precise descriptions of the procedures and equipment the theory allows. As a case study, we choose a fragment T of Newtonian kinematics and describe a language EP(T), and some of its extensions, for expressing experimental procedures allowed by T. The languages for experimental procedures are similar to imperative programming languages that express algorithmic procedures. We show that EP(T) can define all functions on the rational numbers that are definable by algorithms.
Ultra-Mobile Echo Network in Health Care System
Authors: Yoshifumi Saijo, Takahiro Iwamoto, Kazuto Kobayashi, Satoshi Yamaguchi, Hiroshi Tsunoda, Hidehisa Nakayama, Nei Kato, Yoshiaki Nemoto
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

For the management of early stage atherosclerosis, the concept of metabolic syndrome is important. An inexpensive, ultra-mobile ultrasound imaging device is proposed for the accurate diagnosis of the atherosclerosis. A linear probe capable of transmitting and receiving 64 ultrasound beams with the central frequency of 7.5 MHz is made. Echo images are displayed on a 5.7 inch LCD screen. The dimension of the device is 270x184x62 mm and the total weight including the probe is 1.9kg. For the popularization of the echo images for the patients' education and motivation, ultrasound movie client systems were proposed using a mobile phone or PlayStation Portable. The entire procedure proposed in the paper consists of the development of electronic devices and configuration of this system including to the training of community health nurses to use this device.
Extended probabilistic HAL with close temporal association for psychiatric query document retrieval
Authors: Jui-Feng Yeh, Chung-Hsien Wu, Liang-Chih Yu, Yu-Sheng Lai
Venue: ACM Transactions on Information Systems (TOIS) (2008)

Psychiatric query document retrieval can assist individuals to locate query documents relevant to their depression-related problems efficiently and effectively. By referring to relevant documents, individuals can understand how to alleviate their depression-related symptoms according to recommendations from health professionals. This work presents an extended probabilistic Hyperspace Analog to Language (epHAL) model to achieve this aim. The epHAL incorporates the close temporal associations between words in query documents to represent word cooccurrence relationships in a high-dimensional context space. The information flow mechanism further combines the query words in the epHAL space to infer related words for effective information retrieval. The language model perplexity is considered as the criterion for model optimization. Finally, the epHAL is adopted for psychiatric query document retrieval, and indicates its superiority in information retrieval over traditional approaches.
Digital "Evidence" and Reasonable Doubt
Authors: Michael A. Caloyannides
Venue: IEEE Security and Privacy (2003)

Unlike conventional analog data, such as a witness's subjective recollection, digital data seems, to the average person, to be endowed with intrinsic and unassailable truth. (Perhaps this is because it takes only one of two unambiguous values.) The truth, in fact, is quite the opposite. Using the right equipment, experts can generally detect tampering with conventional analog data and evidence. Digital data, on the other hand, can be manipulated at will, and depending on the manipulator's sophistication, the alteration can be undetectable, regardless of digital forensics experts' competence and equipment.
Functional translation of a calculus of capabilities
Authors: Arthur Charguéraud, François Pottier
Venue: ACM SIGPLAN Notices (2008)

Reasoning about imperative programs requires the ability to track aliasing and ownership properties. We present a type system that provides this ability, by using regions, capabilities, and singleton types. It is designed for a high-level calculus with higher-order functions, algebraic data structures, and references (mutable memory cells). The type system has polymorphism, yet does not require a value restriction, because capabilities act as explicit store typings. We exhibit a type-directed, type-preserving, and meaning-preserving translation of this imperative calculus into a pure calculus. Like the monadic translation, this is a store-passing translation. Here, however, the store is partitioned into multiple fragments, which are threaded through a computation only if they are relevant to it. Furthermore, the decomposition of the store into fragments can evolve dynamically to reflect ownership transfers. The translation offers deep insight about the inner workings and soundness of the type system. If coupled with a semantic model of its target calculus, it leads to a semantic model of its imperative source calculus. Furthermore, it provides a foundation for our long-term objective of designing a system for specifying and certifying imperative programs with dynamic memory allocation.