ppxscal/embedding_network huggingface dataset:
Searching and exploring controlled vocabularies
Authors: Alasdair J. G. Gray, Norman Gray, Iadh Ounis
Venue: Proceedings of the WSDM '09 Workshop on Exploiting Semantic Annotations in Information Retrieval (2009)

Within most domains of discourse, there exists different terminology used by distinct sub-groups. Often the terms used can be, or have already been, organised into controlled vocabularies which can be encoded into SKOS, a W3C standard for representing vocabularies. This terminology can then be used to help users to search for and discover resources. This requires a search mechanism to go from a user-supplied string to a vocabulary concept. In this paper, we discuss the issues encountered in developing a web service for searching and exploring the concepts in SKOS encoded astronomical vocabularies. Our prototype service takes in a query and responds with the concepts which are the "best match". It then supports the user in exploring the concepts' formal definition and alternative forms, as well as their relationship to other concepts. When we add mappings between the concepts in different vocabularies (where available), these further enrich the explorations of vocabulary concepts.
An analysis of accuracy experiments carried out over of a multi-faceted model of trust
Authors: Karl Quinn, David Lewis, Declan O&#x2019;Sullivan, Vincent P. Wade
Venue: International Journal of Information Security (2009)

Trust models in internet environments today are single-faceted. A single-faceted approach to modelling trust can suit some, or many, individuals but we believe that such a single-faceted approach cannot capture the wide and varied range of subjective views of trust found across a large and broad population. In response, we have designed, developed and evaluated a rich, semantic, human-centric model of trust that can handle the myriad of terms and intertwined meanings of trust. This multi-faceted model of trust can be Personalised on a per user basis and specialized on per domain basis. In this paper we briefly present an overview of this model and explain how it can be Personalised and specialized. However, the primary focus of this paper is on the experimental evaluation that has been carried out to evaluate the accuracy of recommendations based on this multi-faceted, Personalised model of trust for internet environments.
A novel software key container in on-line media services
Authors: Neng-Wen Wang, Yueh-Min Huang
Venue: Computers and Electrical Engineering (2009)

Due to the explosive growth of the Internet and the pervasion of multimedia, protection of IP rights of digital content in transactions induces people's concerns. For fee-based media services, data encryption may be the best solution for protection of the media. The encryption (decryption) keys placement may be a trivial but crucial issue for users. It is a significant issue that how to practically protect user's key with the password-based cryptographic scheme and at different security levels. Nowadays, key container storing user's key can be implemented by hardware or software-only. Unfortunately, the hardware key containers require expensive infrastructure; On the other hand, the software-only key containers are either insecure or impractical. Moreover, both of the hardware and software just store user's key with the single security level. To solve these problems, we propose a novel software key container in on-line media services that can provide an adaptively secure and practical solution to protect user's key. We use a human-trapdoor distortion function and symmetric cipher to protect user's key in our key container so that it is computationally infeasible to break the system by using machine attack alone. The idea is to ensure that people must participate to verify each guessed password in the attack. User can adjust the security level of container according to the security requirement. Therefore, the attacker cannot succeed to extract user's key within a reasonable time and budget.
Self-adaptive and mobility-aware path selection in mobile ad-hoc networks
Authors: Ehssan Sakhaee, Kenji Leibnitz, Naoki Wakamiya, Masayuki Murata
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

In this paper we propose a protocol that uses mobility information and attractor-selection to effectively and adaptively establish stable communication in mobile ad hoc networks (MANETs). The aim of this approach is to not only establish stable durable communication paths between mobile entities, but also to create a resilient network which can quickly recover from unexpected changes in the network topology. In the proposed protocol, links will have longer lifetimes and break less frequently (as a result of mobility) and the established network will be more stable and resilient to sudden changes in network topology.
Partial order method for timed simulation of system-level MPSoC designs
Authors: Eric Cheung, Harry Hsieh, Felice Balarin
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Current discrete event simulator requires heavy simulation overhead to switch between different components to simulate them in strictly chronological order. Therefore, timed simulation is significantly slower than un-timed simulation. By simply adding delays in the components and communication channels, our timed MPEG-2 decoder simulates more than 14 times slower than an un-timed simulation. In this paper, we propose a partial order method to speed up timed simulation by relaxing the order that the components are simulated. With partial order method, a component is not required to schedule a channel access if both behavioral and timing results of the access are known. The simulation switches less frequently hence the simulation overhead reduces. We show that partial order method can be used in complex system-level simulation such as MPSoC implementations of the MPEG-2 decoder. In our experiments, partial order method provides more than 10 times speedups over regular discrete event simulation for timed simulation.
Improved performance and yield with chip master planning design methodology
Authors: Ali Jahanian, Morteza Saheb Zamani
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Mis-prediction is a dominant problem in nano-scale design that may diminish the quality of physical design algorithms or may even result in failing the design cycle convergence. In this paper, a new planning methodology is presented in which a masterplan of the chip is constructed in early levels of physical design and the rest of succeeding physical design stags operate considering this masterplan. The proposed planning design flow is used to wire planning and buffer resource planning in order to compare with conventional contributions. Experimental results show the considerable improvements in terms of performance, timing yield and buffer usage.
Repair checking in inconsistent databases: algorithms and complexity
Authors: Foto N. Afrati, Phokion G. Kolaitis
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framework of database repairs, which has been the topic of an extensive investigation over the past several years. Intuitively, a repair of an inconsistent database is a consistent database that differs from the given inconsistent database in a minimal way. So far, most of the work in this area has addressed the problem of obtaining the consistent answers to a query posed on an inconsistent database. Repair checking is the following decision problem: given two databases r and r', is r' a repair of r? Although repair checking is a fundamental algorithmic problem about inconsistent databases, it has not received as much attention as consistent query answering. In this paper, we give a polynomial-time algorithm for subset-repair checking under integrity constraints that are the union of a weakly acyclic set of local-as-view (LAV) tuple-generating dependencies and a set of equality-generating dependencies. This result significantly generalizes earlier work for subset-repair checking when the integrity constraints are the union of an acyclic set of inclusion dependencies and a set of functional dependencies. We also give a polynomial-time algorithm for symmetric-difference repair checking, when the integrity constraints form a weakly acyclic set of LAV tgds. After this, we establish a number of complexity-theoretic results that delineate the boundary between tractability and intractability for the repair-checking problem. Specifically, we show that the aforementioned tractability results are optimal; in particular, subset-repair checking for arbitrary weakly acyclic sets of tuple-generating dependencies is a coNP-complete problem. We also study cardinality-based repairs and show that cardinality-repair checking is coNP-complete for various classes of integrity constraints encountered in database design and data exchange.
Analysis on quantum-based fixed priority scheduling of real-time tasks
Authors: Moonju Park, Hong Jin Yoo, Jinseok Chae
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Fixed priority schedulers are widely used for real-time systems, and there were efforts to improve the schedulability. Preemption threshold scheduling is one of such efforts with a dual priority scheme. It increases the schedulability by introducing priority inversion during task execution. In this paper, we analyze another scheduling model, quantum-based scheduling. When quantum-based scheduling is combined with priority-based scheduling, the quantum introduces a partially non-preemptive region. We show that the non-preemptiveness introduced by quantum-based scheduling can improve the schedulability of fixed priority tasks, and there is a task set which is not schedulable by preemption threshold scheduling but is schedulable by quantum-based scheduling. This paper presents a method to calculate the worst case response time of tasks in quantum-based scheduling. Based on the previous research results for preemptive and non-preemptive scheduling, we present a priority assignment method for quantum-based scheduling also.
Hopfield neural-network-based dynamic resource allocation scheme for non-real-time traffic in wireless networks
Authors: José F. Monserrat, Daniel Calabuig, Lorenzo Rubio, Narcís Cardona
Venue: International Journal of Communication Systems (2009)

Dynamic resource allocation (DRA) plays a fundamental role in current and future wireless networks, including 3G systems. In this paper, a scheduling DRA scheme for non-real-time (NRT) packet services in wireless system is proposed based on the use of Hopfield neural networks (HNN). The scheme exploits the fast response time of HNN for solving NP optimization problems and has been particularized for the downlink transmission in a UMTS system, although it could be easily extended to any other radio access technology. The new DRA scheme follows a delay-centric approach, since it maximizes the overall system resource utilization while minimizing the packet delay. Simulation results confirm that the proposed HNN-based DRA scheme is effective in supporting different types of NRT services, while achieving efficient utilization of radio resources. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Class dependent feature scaling method using naive Bayes classifier for text datamining
Authors: Eunseog Youn, Myong K. Jeong
Venue: Pattern Recognition Letters (2009)

The problem of feature selection is to find a subset of features for optimal classification. A critical part of feature selection is to rank features according to their importance for classification. The naive Bayes classifier has been extensively used in text categorization. We have developed a new feature scaling method, called class-dependent-feature-weighting (CDFW) using naive Bayes (NB) classifier. A new feature scaling method, CDFW-NB-RFE, combines CDFW and recursive feature elimination (RFE). Our experimental results showed that CDFW-NB-RFE outperformed other popular feature ranking schemes used on text datasets.
JCSAT satellite, present and future
Authors: Yutaka Nagai, Naoakira Kamiya, Yuichi Hayasaka
Venue: Space Communications (1997)

JSAT is presently operating four satellites. JCSAT-2, JCSAT-3, JCSAT-4 and JCSAT-5 at orbital slots 154, 128, 124 and 150 deg East, respectively. JCSAT-2 and 5 provide domestic and international service with Ku-band transponders. JCSAT-3 and 4 also provide similar service using Ku and C-band transponders with various interconnect capabilities. In addition to the existing four satellites, JCSAT-6 is under construction at Hughes which will be launched in July this year. With this fleet of satellites, JSAT plans to frame the information infrastructure in the digital communication era for domestic and international usage in the Asia Pacific Region.
Effective planning for and justification of the extension of data processing in hospitals
Authors: Richard B. Freibrux
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Starting with the basic premise that: There is a significant role for data processing as a viable tool to assist in patient care and administrative management of hospitals, then we can dispense with the assumption that it should no longer be necessary to convince administrators of the need for computerization in hospitals. This premise seems to be substantiated by the significant increase in the application of computer technology over the last several years as documented by a 1972 American Hospital Association Survey that indicated that of 552 hospitals sampled, 81 percent had one or more in-house computers and an additional 5 percent used out-of-house computer services. 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
Automatic Composition of Melodic and Harmonic Music by Answer Set Programming
Authors: Georg Boenn, Martin Brain, Marina Vos, John Ffitch
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

The composition of most styles of music is governed by rules. The natural statement of these rules is declarative ("The highest and lowest notes in a piece must be separated by a consonant interval") and non deterministic ("The base note of a key can be followed by any note in the key"). We show that by approaching the automation and analysis of composition as a knowledge representation task and formalising these rules in a suitable logical language, powerful and expressive intelligent composition tools can easily be built. This paper describes the use of answer set programming to construct an automated system that can compose both melodic and harmonic music, diagnose errors in human compositions and serve as a computer-aided composition tool. The use of a fully declarative language and an "off-the-shelf" reasoning engine allows the creation of tools which are significantly simpler, smaller and more flexible than those produced by existing approaches. It also combines harmonic and melodic composition in a single framework, which is a new feature in the growing area of algorithmic composition.
Selective regenerated particle swarm optimization for multimodal function
Authors: Chi-Yang Tsai, I-Wei Kao
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

This article proposes an improved particle swarm optimization (PSO) with suggested parameter setting "Selective Particle Regeneration". To evaluate its reliability and efficiency, this approach is applied to multimodal function optimizing tasks. 12 benchmark functions were tested, and results are compared with those of PSO and GA-PSO. It shows the proposed method is both robust and suitable for multimodal function optimization.
Hardware / software design considerations for high speed / low cost interactive graphic communication systems
Authors: Thomas L. Boardman,  Jr.
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Graphics has been among the most exciting areas of the computer business since its dramatic appearance in the early 1960's (Sketchpad). There have been many significant applications throughout NASA and the aerospace industries, some large companies, and even some sponsored university projects. These have, however, utilized high cost graphic equipment, connected directly to large scale (CDC 6000 or IBM 360/50+) mainframes often on a dedicated basis. The terminal and mainframe costs precluded general use in small companies or universities.
Morphing polyhedra with parallel faces: Counterexamples
Authors: Therese Biedl, Anna Lubiw, Michael J. Spriggs
Venue: Computational Geometry: Theory and Applications (2009)

Two simple polyhedra P and Q (not necessarily convex) are parallel if they share the same edge graph G and each face of P has the same outward-facing unit normal as the corresponding face in Q. Parallel polyhedra P and Q admit a parallel morph if the vertices can be moved in a continuous manner taking us from P to Q such that at all times the intermediate polyhedron determined by the vertex configuration and graph G is both simple and parallel with P (and Q). In this note, we show that even for very restrictive classes of orthogonal polyhedra, there exist parallel polyhedra that do not admit a parallel morph.
Tape-Less Video Technologies: Issues in Workflow Transitions
Authors: Farshid Arman
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This paper provides an overview of the issues in migrating from tape-based video systems to complete tape-less systems. The main focus is on workflow and how each system sub-component may effect the workflow. Workflow is discussed in detail due to it overwhelming effects on any organization that decides to undertake and implement change. Sub-systems discussed are storage, networking, media asset management, and databases.
User certification of workplace software: assessing both artefact and usage
Authors: Åke Walldius, Yngve Sundblad, Lars Bengtsson, Bengt Sandblad, Jan Gulliksen
Venue: Behaviour & Information Technology (2009)

This article summarises activities and results from the quality assessment project 'Quality Assurance of IT Support at Work' (ITQ) which has been performed by Swedish researchers in close cooperation with trade unions 1999-2005. The ITQ project is part of a network, UsersAward, which works for the goal to develop and implement a strategy for good software products on the work floor. A main result of the ITQ project is the first version of a software certification programme, User Certified 2002, which is described in some detail. The underlying theoretical arguments for its design and the performed pilot projects which have informed its implementation are also presented. The outcome of performed certifications is discussed in terms of stakeholder response; in terms of whether to certify artefact, processes, or both; and in terms of the relationship between software certification, standardisation, and public procurement agreements. One conclusion from the project is that a viable software certification programme has to cover the software's built-in features, its deployment process, and its actual situated usage. A second conclusion is that the buying organisation has to implement integrative processes in which its organisational development and its implementation of IT systems are coordinated. Conclusions are also drawn with respect to the set of organisational patterns underlying the UsersAward initiative - certifications, user panels, user surveys, user conferences and a yearly IT Prize contest. Finally, implications and plans for the future, especially international research and union cooperation activities, and further development of the certification process are described.
Constant Data Length Retrieval for Video Servers with Variable Bit Rate Streams
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

We define a novel retrieval algorithm for variable bit rate video streams called GCDL that reads the video data from the disk as constant size data blocks. We formulate for GCDL a deterministic admission control criterion and evaluate its performance. Compared to existing retrieval algorithms, GCDL decreases the buffer requirement and start-up latency while admitting the same number of clients.
Optimization of CHR Propagation Rules
Authors: Peter Weert
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Constraint Handling Rules (CHR) is an elegant, high-level programming language based on multi-headed, forward chaining rules. To ensure CHR propagation rules are applied at most once with the same combination of constraints, CHR implementations maintain a so-called propagation history. The performance impact of this history can be significant. We introduce several optimizations that, for the majority of CHR rules, eliminate this overhead. We formally prove their correctness, and evaluate their implementation in two state-of-the-art CHR systems.
The knowledge-gradient stopping rule for ranking and selection
Authors: Peter Frazier, Warren B. Powell
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We consider the ranking and selection of normal means in a fully sequential Bayesian context. By considering the sampling and stopping problems jointly rather than separately, we derive a new composite stopping/sampling rule. The sampling component of the derived composite rule is the same as the previously introduced LL1 sampling rule, but the stopping rule is new. This new stopping rule significantly improves the performance of LL1 as compared to its performance under the best other generally known adaptive stopping rule, EOC Bonf, outperforming it in every case tested.
Designing for e-science: Requirements gathering for collaboration in CiteSeer
Authors: Umer Farooq, Craig H. Ganoe, John M. Carroll, C. Lee Giles
Venue: International Journal of Human-Computer Studies (2009)

It is unclear if and how collaboratories have enhanced distributed scientific collaboration. Furthermore, little is known in the way of design strategies to support such collaboration. This paper presents findings from an investigation into requirements for collaboration in e-science in the context of CiteSeer, a search engine and digital library of research literature in the computer and information science disciplines. Based on a survey and follow-up interviews with CiteSeer users, we present four novel implications for designing the CiteSeer collaboratory. First, visualize query-based social networks to identify scholarly communities of interest. Second, provide online collaborative tool support for upstream stages of scientific collaboration. Third, support activity awareness for staying cognizant of online scientific activities. Fourth, use notification systems to convey scientific activity awareness. We discuss how these implications can broadly enhance e-science usability for collaboratory infrastructures based on digital libraries.