ppxscal/embedding_network huggingface dataset:
Improving Semantic in the Decision Support System K-DSS
Authors: Sabine Bruaux, Inès Saad
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

In this paper, we propose a characterization of the main classes contained in the database of the system K-DSS and related to the domain of identification of the crucial knowledge for which a capitalizing operation is required. We exploit ontological categories existing in the literature to define the notions of Knowledge, Actor, Support and Criteria of knowledge vulnerability. The objective is to improve the process of the potentially crucial knowledge evaluation by providing to different decision makers a unified semantic of these entities. A such approach brings us a preliminary analysis for the construction of an application ontology that we aim to integrate as a new component of the decision support system K-DSS.
On molecular multiple-access, broadcast, and relay channels in nanonetworks
Authors: Baris Atakan, Ozgur B. Akan
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

Molecular communication is a novel paradigm that uses molecules as an information carrier to enable nanomachines to communicate with each other. Interconnections of the nanomachines with molecular communication is envisioned as a nanonetwork. Nanonetworks are expected to enable nanomechines to cooperatively share information such as odor, flavour, light, or any chemical state. In this paper, we develop and present models for the molecular multiple-access, broadcast, and relay channels in a nanonetwork and derive their capacity expressions. Numerical results reveal that the molecular multiple-access of nanomachines to a single nanomachine can be possible with the high molecular communication capacity by selecting the appropriate molecular communication parameters. Similarly, the molecular broadcast can also allow a single nanomachine to communicate with a number of nanomachines with high molecular communication capacity. As a combination of the molecular multiple-access and broadcast channel, we show that the molecular relay channel can improve the molecular communication capacity between two nanomachines using a relay nanomachine.
Detecting disagreements in large-scale multi-agent teams
Authors: Gal A. Kaminka
Venue: Autonomous Agents and Multi-Agent Systems (2009)

Intermittent sensory, actuation and communication failures may cause agents to fail in maintaining their commitments to others. Thus to collaborate robustly, agents must monitor others to detect coordination failures. Previous work on monitoring has focused mainly on small-scale systems, with only a limited number of agents. However, as the number of monitored agents is scaled up, two issues are raised that challenge previous work. First, agents become physically and logically disconnected from their peers, and thus their ability to monitor each other is reduced. Second, the number of possible coordination failures grows exponentially, with all potential interactions. Thus previous techniques that sift through all possible failure hypotheses cannot be used in large-scale teams. This paper tackles these challenges in the context of detecting disagreements among team-members, a monitoring task that is of particular importance to robust teamwork. First, we present new bounds on the number of agents that must be monitored in a team to guarantee disagreement detection. These bounds significantly reduce the connectivity requirements of the monitoring task in the distributed case. Second, we present YOYO, a highly scalable disagreement-detection algorithm which guarantees sound detection. YOYO's run-time scales linearly in the number of monitored agents, despite the exponential number of hypotheses. It compactly represents all valid hypotheses in single structure, while allowing for a complex hierarchical organizational structure to be considered in the monitoring. Both YOYO and the new bounds are explored analytically and empirically in monitoring problems involving thousands of agents.
Location-based photography as sense-making
Authors: Chris Baber, James Cross, Tariq Khaleel, Russell Beale
Venue: Proceedings of the 22nd British HCI Group Annual Conference on HCI 2008: People and Computers XXII: Culture, Creativity, Interaction - Volume 1 (2008)

In this paper we consider ways in which images collected in the field can be used as to support sense-making. Weick's concept of sense-making is applied to the capture of images. A study is reported in which visitors to an open-air museum were asked to take photographs of aspects of the site that they found interesting. Photographs were taken using a bespoke application in which a webcam and global positioning system device, attached to a small tablet computer, are used to capture tagged images. Tagging is supported by the use of a simple menu that allows users to classify the images.
A new architecture for performance-based policy management in heterogeneous wireless networks
Authors: Mayank Keshariya, Ray Hunt
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

The growth in the popularity of Internet services, increasing demands of mobile users together with a wide range of access technologies and mobile-networked devices, demands integration and inter-working of these heterogeneous access networks. Sometimes referred to as 4th generation (4G) networks, the overall objective is to provide a managed Always Best Connected (ABC) service over underlying heterogonous wireless and mobile platforms while maintaining negotiated security and Quality of Service (QoS) in an open and nonproprietary environment. This paper proposes a new model and its architecture which is based upon Policy-based Management (PBM) and provides a framework for the centralised management of networks based on business-level policies. However, it extends the basic PBM ideas to provide a "layered approach" which facilitates the negotiation of management services over interconnected heterogonous mobile platforms thus achieving an always best connected scenario. Finally this paper describes a proof-of-concept testbed which demonstrates the implementation of this model in practice.
Proceedings of the 4th ACM European conference on Computer systems
Venue: European Conference on Computer Systems (2009)

It is our great pleasure to welcome you to the 4th ACM European Conference on Computer Systems -- EuroSys'09. Previous years have established a reputation for high quality, a broad and enthusiastic attendance, and a wide ranging remit. We're delighted that this year is no exception, with an excellent programme that is being presented in a historic city. The topics cover a wide variety of areas, ranging from storage systems to trusted computing; from scheduling to fault tolerance; and from modeling to measurement. In addition, the programme includes a poster session to encourage detailed technical interactions as well as a work in progress session where researchers can present initial results and directions. This year's call for papers attracted 224 expressions of interest, and 149 of these turned into submissions. They came from all over the world: Asia, Australia, Europe, North and South America, and the Middle East. Two papers were rejected for failing to meet the formatting guidelines, so we had 147 papers to choose from: 21 short papers, 126 long ones. The programme committee (PC) used a two-round reviewing process that winnowed the full set down to 64 papers for the second round, and then selected 25 papers (2 short, 23 long) for the final programme. All papers received at least 3 reviews in the first round; all but two second-round papers received 6 or 7 reviews. A total of 704 reviews were written, containing 320k words of content. All this in less than 2 months! The majority of the reviews were written by the PC members themselves; where we received help from external reviewers, the PC members were still responsible for providing the numeric scores. Our scoring system was designed to elicit more information than the usual 4-point up/down scale: each programme committee member was encouraged to use a scale from 0 to 100, and their scores were normalized so that their sum added up to 100N, where N was the number of papers they reviewed. A paper's overall score was the mean of the scores it received, and correlated well with the final outcome.
One laptop per child: vision vs. reality
Authors: Kenneth L. Kraemer, Jason Dedrick, Prakul Sharma
Venue: Communications of the ACM (2009)

The vision is being overwhelmed by the reality of business, politics, logistics, and competing interests worldwide.
Spreading the honey: a system for maintaining an online community
Authors: Rosta Farzan, Joan M. DiMicco, Beth Brownholtz
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

As online communities, such as social network sites, mature, they face challenges in sustaining user engagement. To address this, we designed and deployed a rating system to encourage a broad set of users to promote a diverse set of content on a social network site. By evaluating the impact of the promotions on the site's content and users over time, we found that the system successfully promotes more diverse content and encourages new social interactions between users.
Paper to Digital: Documents in the Information Age, 1 edition
Authors: Ziming Liu
Venue:  (2008)

Is the paperless society really possible? What is the future of paper in the Digital Age? Based on extensive statistics and six separate surveys, Paper to Digital explores the evolution and changing characteristics of documents in the Information Age. Resultant implications are studied through the examination of emerging issues in the digital environment. Examples include:BLtrends in transforming scholarly communications BLtrust in the preservation of digital information BLchanges in reading behavior in the digital environment BLperceptions of the credibility of scholarly information on the Web BLuser preferences for and use of print and electronic resources BLthe future of paper in the digital age. This timely book represents a useful and scholarly exploration of a major concern in our society.
College.Edu: Online Resources for the Cyber-Savvy Student (Collegeedu), 12th edition
Authors: Lisa Guernsey
Venue:  (2008)

"College.edu" leads users to the most reliable, useful, and up-to-date Internet sites on college financial aid and admission.
Structural similarity-based object tracking in multimodality surveillance videos
Authors: Artur &#x0141;oza, Lyudmila Mihaylova, David Bull, Nishan Canagarajah
Venue: Machine Vision and Applications (2009)

This paper addresses the problem of object tracking in video sequences for surveillance applications by using a recently proposed structural similarity-based image distance measure. Multimodality surveillance videos pose specific challenges to tracking algorithms, due to, for example, low or variable light conditions and the presence of spurious or camouflaged objects. These factors often cause undesired luminance and contrast variations in videos produced by infrared sensors (due to varying thermal conditions) and visible sensors (e.g., the object entering shadowy areas). Commonly used colour and edge histogram-based trackers often fail in such conditions. In contrast, the structural similarity measure reflects the distance between two video frames by jointly comparing their luminance, contrast and spatial characteristics and is sensitive to relative rather than absolute changes in the video frame. In this work, we show that the performance of a particle filter tracker is improved significantly when the structural similarity-based distance is applied instead of the conventional Bhattacharyya histogram-based distance. Extensive evaluation of the proposed algorithm is presented together with comparisons with colour, edge and mean-shift trackers using real-world surveillance video sequences from multimodal (infrared and visible) cameras.
A User Experience Model for Home Video Summarization
Authors: Wei-Ting Peng, Wei-Jia Huang, Wei-Ta Chu, Chien-Nan Chou, Wen-Yan Chang, Chia-Han Chang, Yi-Ping Hung
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

In this paper, we propose a novel system for automatically summarizing home videos based on a user experience model. The user experience model takes account of user's spontaneous behaviors when viewing videos. Based on users' reaction when viewing videos, we can construct a systematic framework to automate video summarization. In this work, we analyze the variations of viewer's eye movement and facial expression when he or she watching the raw home video. We transform these behaviors into the clues of determining the important part of each video shot. With the aids of music analysis, the developed system automatically generates a music video (MV) style summarized home videos. Experiments show that this new type of editing mechanism can effectively generate home video summaries and can largely reduce the efforts of manual summarization.
The Simulation Algorithm Design of the Safety Margin for an Aircraft Accident
Authors: Zhao Wenzhi, Yang Weiwei
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

An aircraft accident decision is studied under the view of system safety, with the simulation for the overrun speed and time if it rejected takeoff (RTO), and the consequence would be slighter, saving many lives. It is believed in this paper that continuing to climb when catching fire is the worst decision with the heaviest lost in lives. The simulation algorithm is compiled to compute the overrun speed and time at the end of runway to evaluate the safety margin after RTO at high running speed. Its result also shows that the 90 second rule for evacuating is a key element to obey to make decision, having higher order constrain than V1. A few events are discussed to verify the safety margin.
Robust Optimization by ε-Ranking on High Dimensional Objective Spaces
Authors: Hernán Aguirre, Kiyoshi Tanaka
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

This work proposes a method to fine grain the ranking of solutions after they have been ranked by Pareto dominance, aiming to improve the performance of evolutionary algorithms on many objectives optimization problems. The re-ranking method uses a randomized sampling procedure to choose, from sets of equally ranked solutions, those solutions that will be given selective advantage. The sampling procedure favors a good distribution of the sampled solutions based on dominance regions wider than conventional Pareto dominance. We enhance NSGA-II with the proposed method and test its performance on MNK-Landscapes with up to M = 10 objectives. Experimental results show that convergence and diversity of the solutions found can improve remarkably on 3 ≤ M ≤ 10 objectives problems.
The citizen in the information polity: Exposing the limits of the e-government paradigm
Authors: J. A. Taylor, A. M. B. Lips
Venue: Information Polity (2008)

The rise of 'e-government', both as a recognized field of practice and an identifiable and legitimate field of study, has occurred extraordinarily rapidly throughout the world. The term 'e-government' has come to capture and de-limit in toto what might be termed the agenda for government in the age of the Internet. This article questions the value of the orthodox interpretation, the paradigm, that has so rapidly emerged around e-government, in particular the casual assumption that e-government is ipso facto 'citizen-centric'. In so-doing this article reveals a concern that different questions must be asked in order to understand 'e-government' and its implications fully and fundamentally. If we are to ask these different questions rather than those to which we are drawn under the orthodox e-government frame of reference then this field will become more theoretically informed, particularly in ways that aid our understanding of 'citizenship' in the 'e-ubiquitous' State.
Using Wikipedia for Co-clustering Based Cross-Domain Text Classification
Authors: Pu Wang, Carlotta Domeniconi, Jian Hu
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Traditional approaches to document classification requires labeled data in order to construct reliable and accurate classifiers. Unfortunately, labeled data are seldom available, and often too expensive to obtain. Given a learning task for which training data are not available, abundant labeled data may exist for a different but related domain. One would like to use the related labeled data as auxiliary information to accomplish the classification task in the target domain. Recently, the paradigm of transfer learning has been introduced to enable effective learning strategies when auxiliary data obey a different probability distribution. A co-clustering based classification algorithm has been previously proposed to tackle cross-domain text classification. In this work, we extend the idea underlying this approach by making the latent semantic relationship between the two domains explicit. This goal is achieved with the use of Wikipedia. As a result, the pathway that allows to propagate labels between the two domains not only captures common words, but also semantic concepts based on the content of documents. We empirically demonstrate the efficacy of our semantic-based approach to cross-domain classification using a variety of real data.
Urban Sketcher: Mixed Reality on Site for Urban Planning and Architecture
Authors: Markus Sareika, Dieter Schmalstieg
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

Urban Sketcher, a Mixed Reality application, is designed to encourage and improve communication on urban design among stakeholders. A mix of multimodal input devices enhances collaborative interaction in real-time, while visual feedback is given to all participants on a projected live video augmentation from Urban Sketcher. Sketching, modifying the scene on site, in the space of the video augmentation supports the exchange of information with interactive visual support. Urban Sketcher is instrumental for developing visions of future urban spaces by augmenting the real environment with sketches, facades, buildings, green spaces or skylines.
Telecommunications
Authors: Kenneth J. Thurber
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The telecommunications area contains three varied sessions. These sessions cover the entire spectrum of telecommunications from terminal interfaces to data management in a distributed environment. 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
Deciding on the architecture of the concept map based knowledge assessment system
Authors: Romans Lukashenko, Marks Vilkelis, Alla Anohina
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The paper is dedicated to the problem of the selection of an optimal client-server architecture for the implementation of the Web-based learning system. Constituent parts, advantages and disadvantages of nowadays prevalent client-server architectures, namely two-tier, three-tier and N-tier architectures, are described. Experience of the authors in the development of the concept map based knowledge assessment system using two- and three-tier client-server architectures is discussed as well.
A Problem Kernelization for Graph Packing
Authors: Hannes Moser
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

For a fixed connected graph H, we consider the NP-complete H-packing problem, where, given an undirected graph G and an integer k e 0, one has to decide whether there exist k vertex-disjoint copies of H in G. We give a problem kernel of O(k |V(H)| 1) vertices, that is, we provide a polynomial-time algorithm that reduces a given instance of H-packing to an equivalent instance with at most O(k |V(H)| 1) vertices. In particular, this result specialized to H being a triangle improves a problem kernel for Triangle Packing from O(k 3) vertices by Fellows et al. [WG 2004] to O(k 2) vertices.
A study of potential parallelism among traces in Java programs
Authors: Borys J. Bradel, Tarek S. Abdelrahman
Venue: Science of Computer Programming (2009)

The exploitation of parallelism among traces, i.e. hot paths of execution in programs, is a novel approach to the automatic parallelization of Java programs and it has many advantages. However, to date, the extent to which parallelism exists among traces in programs has not been made clear. The goal of this study is to measure the amount of trace-level parallelism in several Java programs. We extend the Jupiter Java Virtual Machine with a simulator that models an abstract parallel system. We use this simulator to measure trace-level parallelism. We further use it to examine the effects of the number of processors, trace window size, and communication type and cost on performance. We also analyze the dependence characteristics of the benchmarks and see how they relate to parallelism. The results indicate that enough trace-level parallelism exists for a modest number of processors. Thus, we conclude that trace-based parallelization is a potentially viable approach to improve the performance of Java programs.
Querying and Retrieving Pictorial Data Using Semantics Induced by Colour Quality and Arrangement
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

In this paper a novel approach is featured to querying painting databases on the basis of the semantics implied by the use artists make of colours. A symbolic query language, called ``colour description language'' has been designed to express high--level chromatic features of a painting, which cannot be obtained through a set of concrete examples. A visual extension of the language is then presented which introduces a feedback between the sentence composed and its pictorial meaning. The language has been used as the high-level query paradigm of a prototype automatic painting database. 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
A nine-context programmable optically reconfigurable gate array with semiconductor lasers
Authors: Shinya Kubota, Minoru Watanabe
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Recently, optically reconfigurable gate arrays (ORGAs), which consist of a gate array VLSI, a holographic memory, and a laser array, have been developed to achieve a huge virtual gate count that is much larger than those of currently available VLSIs. Consequently, ORGAs with more than tera-gate capacity will be realized by exploiting the storage capacity of a holographic memory. However, compared with current field programmable gate arrays (FPGAs), conventional ORGAs have an important shortcoming: they are not reprogrammable after fabrication because, to reprogram ORGAs, a holographic memory must be disassembled from its ORGA package, reprogrammed outside of the ORGA package using a holographic memory writer, and then implemented onto the ORGA package with high precision beyond the capability of manual assembly. To remove that daunting problem, this paper presents a nine-context programmable ORGA and its writer. Furthermore, this paper presents discussion of the availability of this architecture and future plans based on experimental results.