ppxscal/embedding_network huggingface dataset:
Multicore Resource Management
Authors: Kyle J. Nesbit, Miquel Moreto, Francisco J. Cazorla, Alex Ramirez, Mateo Valero, James E. Smith
Venue: IEEE Micro (2008)

Current resource management mechanisms and policies are inadequate for future multicore systems. Instead, a hardware/software interface based on the virtual private machine abstraction would allow software policies to explicitly manage microarchitecture resources. VPM policies, implemented primarily in software, translate application and system objectives into VPM resource assignments. Then, VPM mechanisms securely multiplex, arbitrate, or distribute hardware resources to satisfy the VPM assignments.
Formulation of Fuzzy c-Means Clustering Using Calculus of Variations
Authors: Sadaaki Miyamoto
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

A membership matrix of fuzzy c-mans clustering is associated with the corresponding fuzzy classification rules as membership functions defined on the whole space. In this paper such functions in fuzzy c-means and possibilistic clustering are directly derived using the calculus of variations. Consequently, the present formulation generalizes the ordinary fuzzy c-means and moreover related methods can be discussed within this framework.
A library for light-weight information-flow security in haskell
Authors: Alejandro Russo, Koen Claessen, John Hughes
Venue: Proceedings of the first ACM SIGPLAN symposium on Haskell (2008)

Protecting confidentiality of data has become increasingly important for computing systems. Information-flow techniques have been developed over the years to achieve that purpose, leading to special-purpose languages that guarantee information-flow security in programs. However, rather than producing a new language from scratch, information-flow security can also be provided as a library. This has been done previously in Haskell using the arrow framework. In this paper, we show that arrows are not necessary to design such libraries and that a less general notion, namely monads, is sufficient to achieve the same goals. We present a monadic library to provide information-flow security for Haskell programs. The library introduces mechanisms to protect confidentiality of data for pure computations, that we then easily, and modularly, extend to include dealing with side-effects. We also present combinators to dynamically enforce different declassification policies when release of information is required in a controlled manner. It is possible to enforce policies related to what, by whom, and when information is released or a combination of them. The well-known concept of monads together with the light-weight characteristic of our approach makes the library suitable to build applications where confidentiality of data is an issue.
Intensional Question Answering Using ILP: What Does an Answer Mean?
Authors: Philipp Cimiano, Helena Hartfiel, Sebastian Rudolph
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

We present an approach for computing intensional answers given a set of extensional answers returned as a result of a user query to an information system. Intensional answers are considered as descriptions of the actual answers in terms of properties they share and which can enhance a user's understanding of the answer itself but also of the underlying knowledge base. In our approach, an intensional answer is represented by a clause and computed based on Inductive Logic Programming (ILP) techniques, in particular bottom-up clause generalization. The approach is evaluated in terms of usefulness and time performance, and its potential for helping to detect flaws in the knowledge base is discussed. While the approach is used in the context of a natural language question answering system in our setting, it clearly has applications beyond.
Tractable Reasoning with Bayesian Description Logics
Authors: Claudia D'Amato, Nicola Fanizzi, Thomas Lukasiewicz
Venue: Proceedings of the 2nd international conference on Scalable Uncertainty Management (2008)

The DL-Lite family of tractable description logics lies between the semantic web languages RDFS and OWL Lite. In this paper, we present a probabilistic generalization of the DL-Lite description logics, which is based on Bayesian networks. As an important feature, the new probabilistic description logics allow for flexibly combining terminological and assertional pieces of probabilistic knowledge. We show that the new probabilistic description logics are rich enough to properly extend both the DL-Lite description logics as well as Bayesian networks. We also show that satisfiability checking and query processing in the new probabilistic description logics is reducible to satisfiability checking and query processing in the DL-Lite family. Furthermore, we show that satisfiability checking and answering unions of conjunctive queries in the new logics can be done in LogSpace in the data complexity. For this reason, the new probabilistic description logics are very promising formalisms for data-intensive applications in the Semantic Web involving probabilistic uncertainty.
Integrating Audio Visual Data for Human Action Detection
Authors: Lili Nurliyana Abdullah, Shahrul Azman Mohd Noah
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

This paper presents a method which able to integrate audio and visual information for action scene analysis in any movie. The approach is top-down for determining and extract action scenes in video by analyzing both audio and video data. In this paper, we directly modelled the hierarchy and shared structures of human behaviours, and we present a framework of the Hidden Markov model based application for the problem of activity recognition. We proposed a framework for recognizing actions by measuring human action-based information from video with the following characteristics: the method deals with both visual and auditory information, and captures both spatial and temporal characteristics; and the extracted features are natural, in the sense that they are closely related to the human perceptual processing. Our effort was to implementing idea of action identification by extracting syntactic properties of a video such as edge feature extraction, colour distribution, audio and motion vectors. In this paper, we present a two layers hierarchical module for action recognition. The first one performs supervised learning to recognize individual actions of participants using low-level visual features. The second layer models actions, using the output of the first layer as observations, and fuse with the high level audio features. Both layers use Hidden Markov model-based approaches for action recognition and clustering, respectively. Our proposed technique characterizes the scenes by integration cues obtained from both the video and audio tracks. We are sure that using joint audio and visual information can significantly improve the accuracy for action detection over using audio or visual information only. This is because multimodal features can resolve ambiguities that are present in a single modality. Besides, we modelled them into multidimensional form.
A pilot study of comparative customer comprehension between extreme x-machine and uml models
Authors: Christopher Thomson, Mike Holcome, Tony Cowling, Tony Simons, George Michaelides
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Many design notations are used during software development to help the developers better understand the required system. However they are infrequently shown to clients, partly because developers believe that clients don't understand them. In this study we investigate the extent to which clients comprehend three types of diagram. Two popular UML diagrams (activity and use case) and Extreme X-Machines diagrams (a type of state diagram developed to support Extreme Programming) were shown to three clients for whom we had recently delivered the software that was represented. The clients were given some simple guidance on interpreting them and asked to evaluate how well they understood them. This pilot study found that all the diagrams studied seemed to be equally well understood, but further studies are required to evaluate their usefulness.
A Novel Approach for Designing Interpolation Filter Using Basis Functions
Authors: Qiang Yuan, Yuanling Huang, Jiangtao Yu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Based on the special basis functions, a piecewise function with adjustable parameters is used to construct the impulse response of the interpolation filter. These parameters are then calculated when this function approximates the desired impulse response according to some optimization criterion in time domain. This polynomial-based interpolation filter can be efficiently implemented using a modified Farrow structure. The design example shows that the number of multipliers and the designing burden is greatly reduced for this proposed approach compared with two other polynomial-based methods.
A Non-symmetrical Method of Image Local-Difference Comparison for Ancient Impressions Dating
Authors: Étienne Baudrier, Nathalie Girard, Jean-Marc Ogier
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

In this article, we focus on the dating of images (impressions, ornamental letters) printed starting from the same stamp. This difficult task needs a good observation of the differences between the compared images. We present a method, based on a local adaptation of the Hausdorff distance, that evaluates locally the image differences. It allows the user to visualize these differences. A description of the pertinent differences for the dating allows us to evaluate our method visualization ability. Then our method is successfully compared to the existing method. Finally, a framework for a future automatic dating method is presented.
A New Cell Phone Remote Control for People with Visual Impairment
Authors: Ryo Yoshida, Michiaki Yasumura
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

As visual interfaces become prevalent on home appliances such as LCDs used on remote controllers (RCs), people with visual impairment experienced increased difficulty. Previously, we developed two types of RCs for people with visual impairment, one with voice recognition and the other with numeric keys. We combined these two RCs into a cellphone RC application and evaluated three conditions. The combined condition(using both buttons and voice) took the least task time, and also received the highest score in the evaluative ratings provided by participants.
Topic 7: Peer-to-Peer Computing
Authors: Dick Epema, Márk Jelasity, Josep Jorba, Alberto Montresor
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

After a decade of intensive investigation, peer-to-peer computing has established itself as an accepted research field in the general area of distributed systems. peer-to-peer computing can be seen as the democratization of computing-overthrowing the old regime of hierarchies as in client-server systems-largely brought about by last-mile network improvements which have made individual PCs first-class citizens in the computer world. Initially, much of the focus in peer-to-peer systems was on best-effort file sharing. However, over the last few years, research has also been directed at trying to make peer-to-peer systems satisfy properties and have functionality as exhibited by more traditional forms of distributed systems. Examples of such properties and functionality, which in principle run counter to the disorganized nature of peer-to-peer systems, are certain levels of security and providing reliable distributed storage such as required by databases.
Agent-Supported Planning in Distributed Command and Control Environments
Authors: James H. Lawton
Venue: Proceedings of the 12th international workshop on Cooperative Information Agents XII (2008)

To be able to meet the future challenge of employing forces anywhere in the world in support of national security objectives, modern military forces require highly synchronized, distributed planning and re-planning capabilities that are sufficiently flexible to adapt to any level of conflict. This talk will present a research program underway at the USAF Research Laboratory's Information Directorate known as DEEP (Distributed Episodic Exploratory Planning). DEEP is an agent-based distributed planning system that has been designed to support future military command and control (C2) operations. The talk will discuss the motivation for moving from a centralized planning model to a distributed mixed-initiative approach, along with the DEEP architecture and the key research challenges for achieving this vision. The distributed agent-supported planning capabilities, which utilize past experience to solve current problems, will be emphasized.
Object Oriented Model
Authors: John Barnes
Venue: Ada 2005 Rationale: The Language, The Standard Libraries (2008)

This chapter describes various important improvements to the object oriented model for Ada 2005.First an alternative more traditional prefixed notation for calling operations has been introduced. A major improvement is that Java-like interfaces are introduced thereby permitting simple multiple inheritance; null procedures have also been introduced as a category of operation. Greater general flexibility is provided by allowing type extension at a more nested level than that of the parent.There are also explicit features for overcoming nasty bugs which arise from confusion between overloading and overriding. 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 Characterisation of NL Using Membrane Systems without Charges and Dissolution
Authors: Niall Murphy, Damien Woods
Venue: Proceedings of the 7th international conference on Unconventional Computing (2008)

We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like circuits, membrane systems are defined as uniform families. To date, polynomial time uniformity has been the accepted uniformity notion for membrane systems. Here, we introduce the idea of using AC 0 and L-uniformities and investigate the computational power of membrane systems under these tighter conditions. It turns out that the computational power of some systems is lowered from P to NL, so it seems that our tighter uniformities are more reasonable for these systems. Interestingly, other systems that are known to be lower bounded by P are shown to retain their computational power under the new uniformity conditions. Similarly, a number of membrane systems that are lower bounded by PSPACE retain their power under the new uniformity conditions.
Securing ajax applications, First edition
Authors: Christopher Wells
Venue:  (2007)

Ajax applications should be open yet secure. Far too often security is added as an afterthought. Potential flaws need to be identified and addressed right away. This book explores Ajax and web application security with an eye for dangerous gaps and offers ways that you can plug them before they become a problem. By making security part of the process from the start, you will learn how to build secure Ajax applications and discover how to respond quickly when attacks occur. Securing Ajax Applications succinctly explains that the same back-and-forth communications that make Ajax so responsive also gives invaders new opportunities to gather data, make creative new requests of your server, and interfere with the communications between you and your customers. This book presents basic security techniques and examines vulnerabilities with JavaScript, XML, JSON, Flash, and other technologies -- vital information that will ultimately save you time and money. Topics include: An overview of the evolving web platform, including APIs, feeds, web services and asynchronous messagingWeb security basics, including common vulnerabilities, common cures, state management and session managementHow to secure web technologies, such as Ajax, JavaScript, Java applets, Active X controls, plug-ins, Flash and FlexHow to protect your server, including front-line defense, dealing with application servers, PHP and scriptingVulnerabilities among web standards such as HTTP, XML, JSON, RSS, ATOM, REST, and XDOSHow to secure web services, build secure APIs, and make open mashups secure Securing Ajax Applications takes on the challenges created by this new generation of web development, and demonstrates why web security isn't just for administrators and back-end programmers any more. It's also for web developers who accept the responsibility that comes with using the new wonders of the Web.
Clinicians' perceptions of usability of an electronic medical record over time
Authors: Mary Etta Mills
Venue:  (2008)

The study evaluated clinicians' usability perceptions of an electronic medical record (EMR) over time in a large east coast research medical center. The descriptive retrospective longitudinal design used secondary data obtained from a performance measurement plan. Electronic survey data were collected at five different points in time over four years. The anonymous responses made matching of the 1148 individuals impossible so thirty cases were defined grouping clinicians by age category, gender, and role. Each response was considered to be a repetition of measurement of the case. The research questions explored the overall patterns of change in usability related to an EMR implementation, the short term and long term change in usability, and if the patterns of usability were influenced by frequency of use, gender, age, length of service (LOS), or role. The short term impact included evaluations at baseline, four months, and 16 months after the implementation of an EMR. The long term impact included evaluations before, four months, and 16 months following a system upgrade.Linear mixed model analysis was used to examine patterns of change over time including the contribution of frequency of use and user characteristics on the outcome variables. Each variable had curvilinear and linear patterns following the initial EMR implementation but not after the system upgrade. Usefulness, ease of use, supports clinical care, and supports research had significant linear and/or quadratic changes over the short term but no significant changes in long term except for ease of use. Frequency of use was a significant predictor for usefulness and supports clinical care but not for ease of use. Age, LOS, and role contributed significantly to usefulness, ease of use and supports clinical care but gender did not. Role and LOS combined were significant predictors for usefulness, supports clinical care, and ease of use over the short term. The findings indicate significant short term changes related to the initial EMR implementation but not the upgrade. This had implications for system development related to education, clinical practice and research.
A Comparative Study on Clustering Algorithms for Multispectral Remote Sensing Image Recognition
Authors: Lintao Wen, Xinyu Chen, Ping Guo
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Since little prior knowledge about remote sensing images can be obtained before performing recognition tasks, various unsupervised classification methods have been applied to solve such problem. Therefore, choosing an appropriate clustering method is very critical to achieve good results. However, there is no standard criterion on which clustering method is more suitable or more effective. In this paper, we conduct a comparative study on three clustering methods, including C-Means, Finite Mixture Model clustering, and Affinity Propagation. The advantages and disadvantages of each method are evaluated by experiments and classification results.
Integer Variable Χ---Based Ate Pairing
Authors: Yasuyuki Nogami, Masataka Akane, Yumi Sakemi, Hidehiro Kato, Yoshitaka Morikawa
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

In implementing an efficient pairing calculation, it is said that the lower bound of the number of iterations of Miller's algorithm is log2 r/&phi;(k), where &phi;(&middot;) is the Euler's function. Ate pairing reduced the number of the loops of Miller's algorithm of Tate pairing from $\lfloor\log_2r\rfloor$ to $\lfloor \log_2(t-1)\rfloor$. Recently, it is known to systematically prepare a pairing---friendly elliptic curve whose parameters are given by a polynomial of integer variable "&Chi;". For the curve, this paper gives integer variable &Chi; ---based Ate pairing that achieves the lower bound by reducing it to $\lfloor\log_2\chi\rfloor$.
Service Oriented Infrastructure Framework
Authors: Yan Zhao
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

The Service Oriented Infrastructure (SOI) is to apply Service Oriented Architecture (SOA) to IT Infrastructure. The role of IT is changing. IT infrastructure is not only associated with hardware, software, and network components any more, it is becoming more integrated with business operation strategies, and being operated as a business service as well. A Service Oriented Infrastructure Framework is introduced here, which consists of four categories of components: Service Planning, Service Systems, Service Management, and Service Stakeholders; while other SOI frameworks presented today mostly address the Service System category only. This SOI framework is helpful for SOI practice in establishing structure, life cycle, and governance.
Phase distribution of software development effort
Authors: Ye Yang, Mei He, Mingshu Li, Qing Wang, Barry Boehm
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Effort distribution by phase or activity is an important but often overlooked aspect compared to other steps in the cost estimation process. Poor effort allocation is among the major root causes of rework due to insufficiently resourced early activities. This paper provides results of an empirical study on phase effort distribution data of 75 industry projects, from the China Software Benchmarking Standard Group (CSBSG) database. The phase effort distribution patterns and variation sources are presented, and analysis results show some consistency in effects of software size and team size on code and test phase distribution variations, and some considerable deviations in requirements, design, and transition phases, compared with recommendations in the COCOMO model. Finally, this paper discusses the major findings and threats to validity and presents general guidelines in directing effort allocation. Empirical findings from this study are beneficial for stimulating discussions and debates to improve cost estimation and benchmarking practices.
Recounting the Rationals: Twice!
Authors: Roland Backhouse, João F. Ferreira
Venue: Proceedings of the 9th international conference on Mathematics of Program Construction (2008)

We derive an algorithm that enables the rationals to be efficiently enumerated in two different ways. One way is known and is credited to Moshe Newman; it corresponds to a deforestation of the so-called Calkin-Wilf tree of rationals. The second is new and corresponds to a deforestation of the Stern-Brocot tree of rationals. We show that both enumerations stem from the same simple algorithm. In this way, we construct a Stern-Brocot enumeration algorithm with the same time and space complexity as Newman's algorithm.