ppxscal/embedding_network huggingface dataset:
Linking FrameNet to the Suggested Upper Merged Ontology
Authors: Jan Scheffczyk, Adam Pease, Michael Ellsworth
Venue: Proceeding of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006) (2006)

Deductive reasoning with natural language requires combining lexical resources with the world knowledge provided by ontologies. In this paper we describe the connection of FrameNet --a lexicon for English --to the Suggested Upper Merged Ontology (SUMO). We align FrameNet Semantic Types (ST) with SUMO classes, which we express in SUO-KIF, the language of SUMO. Based on this general-domain alignment, we have developed a semi-automatic, domain-specific approach for linking FrameNet Frame Elements (FE) to SUMO classes that is based on typical fillers of FEs in a particular domain. We thus provide restricted, ontology-based types on the fillers of FEs. We are confident that our basic work can improve semantic parsing and ontology lexicalization.
Distributed Source Coding: Theory, Algorithms and Applications
Authors: Pier Luigi Dragotti, Michael Gastpar
Venue:  (2009)

The advent of wireless sensor technology and ad-hoc networks has made DSC a major field of interest. Edited and written by the leading players in the field, this book presents the latest theory, algorithms and applications, making it the definitive reference on DSC for systems designers and implementers, researchers, and graduate students.This book gives a clear understanding of the performance limits of distributed source coders for specific classes of sources and presents the design and application of practical algorithms for realistic scenarios. Material covered includes the use of standard channel codes, such as LDPC and Turbo codes, to DSC, and discussion of the suitability of compressed sensing for distributed compression of sparse signals. Extensive applications are presented and include distributed video coding, microphone arrays and securing biometric data.This book is a great resource covering the breadth and depth of distributed source coding that's appropriate for everyone from theoreticians to practitioners. - Richard Baraniuk, Rice UniversityPier Luigi Dragotti is currently a Senior Lecturer in the Electrical and Electronic Engineering Department at Imperial College, London. He has worked as a researcher at Bell Labs and EPFL and is a member of the IEEE Image and MultiDimensional Signal Processing (IMDSP) Technical Committee.Michael Gastpar is currently an Assistant Professor at the University of California, Berkeley. His research interests are in network information theory and related coding and signal processing techniques, with applications to sensor networks and neuroscience. He won the 2002 EPFL Best Thesis Award, an NSF CAREER award in 2004, and an Okawa Foundation Research Grant in 2008. *Clear explanation of the principles of distributed source coding (DSC), a technology that has applications in sensor networks, ad-hoc networks, and distributed wireless video systems for surveillance*Edited and written by the leading players in the field, providing a complete and authoritative reference*Contains all the latest theory, practical algorithms for DSC design and the most recently developed applications
Efficient algorithms for querying large-scale data in relational, xml, and graph-structured data repositories
Authors: Rada Chirkova
Venue:  (2008)

We live in an information age, and data are ubiquitous today. Various applications, ranging from scientific computing, medical research, and bioinformatics to administrative management, commercial sales, and financial marketing, generate and utilize data every day. Many of these applications are data intensive, with the amount of data involved potentially reaching hundreds of thousands of gigabytes. Further, different applications store data using different data models. For example, applications could store and manage structured data using a flat (relational) model, semi-structured data using a hierarchical (XML) model, and less-structured data using a more general and flexible graph model. In this thesis, I report my research results on efficiently querying large-scale data in relational, XML, and graph-structured data repositories. Specifically, this thesis covers three research projects, which I have been invited to present in the ACM SIGMOD conference in 2006, 2007, and 2008, respectively. The first project concerns efficient querying of relational data using materialized views and introduces our efficient view-based query-optimization algorithms that support a large and practically important subset of SQL queries. The second project focuses on efficiently querying XML data and presents efficient algorithms for evaluating XPath queries over XML streams, which are the first ones that achieve the O(|D||Q|) time performance, where |D| is the XML data size and | Q| is the XPath query size. Meanwhile, our algorithm EQ also achieves optimal space performance. The third project addresses efficient querying of graph-structured data, by introducing efficient algorithms for retrieving top-ranked tree-pattern matches from large graphs. While a tree-pattern query could have an extremely large, potentially exponential, number of answer matches in a graph, our algorithms exhibit time and space performance that is linear or sub-linear in the size of the input data. Our algorithms are the first ones that have this excellent performance property.
Proceedings of the 1st workshop on Automated control for datacenters and clouds
Venue: International Conference on Autonomic Computing (2009)

We are pleased to welcome you to the first Workshop on Automated Control for Datacenters and Clouds (ACDC'09) -- co-located with the 6th International Conference on Autonomic Computing. Over the past years, large server farms--from enterprise datacenters and giant-scale Internet services to utility and public cloud computing-have become a critical part of the execution platform for many of today's software programs. Interactive web services, business workflows, large-scale batch data processing, and many scientific computations all run on platforms built atop these large server farms. While these systems differ in many ways, they share many common challenges, such as the desire to maximize efficiency and performance while maintaining predictable behavior, power efficiency and fairness, and at the same time responding appropriately to environmental and system changes such as hardware failures and changes in workload. The goal of this workshop is to broadly explore the similarities and differences in current and future automated techniques for reasoning about and orchestrating the behaviors of these large scale systems. The program committee accepted 9 papers spanning a variety of topics, from the area of virtual machine usage in server farms, to techniques for improving power-efficiency and performance management. In addition, the program includes a keynote speech by John Wilkes entitled "Automating Trade-offs." We hope that the proceedings of this workshop provide a valuable reference for researchers in the area of automated control of datacenters, clouds, and other large server farm environments.
Teaching Chinese Handwriting by Automatic Feedback and Analysis for Incorrect Stroke Sequence and Stroke Production Errors
Authors: Kai-Tai Tang, Howard Leung
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

Writing Chinese character is not trivial and people often commit stroke sequence error and stroke production errors. In this paper, we propose a web-based education system which allows users to practice Chinese handwriting freely. An Automatic Feedback and Analysis (AFA) tool is introduced to the system which can automatically check both the stroke sequence errors and stroke production errors by analyzing the online data of the learner's input character. Feedback will be provided if the learner commits errors in the stroke sequence and/or during stroke production. Experimental results demonstrated that our method can check multiple handwriting errors with encouraging accuracy. User studies showed that the learning time is shorter if our proposed system is used.
Human behavior in mixed human-agent societies
Authors: Alicia Ruvinsky, Michael N. Huhns
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Agents are increasingly being implemented on the many processors embedded in our environment, resulting in more frequent interactions between agents and humans and the emergence of mixed human-agent societies. We are attempting to cultivate an interdisciplinary understanding of productive human-agent societies by investigating characteristics of human cooperation toward software agents. The contribution of this work is an exploration characterizing direct and indirect behavior of humans toward agents by way of experimentation on human subjects. Preliminary investigation into human-agent interactions reveals that in a context involving direct and indirect behavior, humans will exhibit prosocial behaviors toward agents on par with those they exhibit toward humans. These results seem to support Reeves and Nass's media equation describing human interactions with media entities as equivalent to human interactions with humans.
PCs: The Missing Manual, 2nd edition
Authors: Chris Grover
Venue:  (2007)

Everything you need to know about PCs, both inside and out, is right here. Want to burn DVDs or share photos? Set up a web cam, or a blog? Access TV and radio through the Internet? Maybe you just want your machine to work the way it's supposed to, without all the frustration. The new edition of PCs: The Missing Manual is loaded with advice on how to deal with increasingly complex PCs and their digital accessories -- including those new machines running Windows Vista. This complete PC manual has something for everyone, whether you're adventurous or timid. Novices will appreciate the straightforward tutorials for hooking up a monitor, keyboard, mouse, printer, and scanner. Families will enjoy sections on networking several computers to share an Internet connection, sharing one monitor between two PCs, connecting portable media players, and creating a home theater system. Power users will like the clear photos explaining how to take a PC apart and replace or upgrade any failing parts. PCs: The Missing Manual delivers simple, reliable advice on the kinds of things you confront every day, such as how to: Connect and configure today's must-have devices, including digital cameras, portable music players, digital camcorders, and keychain drives Burn CDs and DVDs, print documents, scan, fax, and more Choose the best Internet Service Provider and web browser for your needs Send email, search the Web, share photos online, set up a blog, hook up a webcam, access TV and radio, and shop safely online Keep your PC safe by installing firewalls, creating safe passwords, running antivirus software, removing spyware and adware, and backing up important files If you're an IT professional, this is the ideal book for coworkers who need solid, trusted information about using their PC. No matter who you are, or what brand of computer you have on your desk, PCs: The Missing Manual will make you a better user. 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
Nanocomputing: Computational Physics for Nanoscience and Nanotechnology
Authors: James Hsu
Venue:  (2009)

This book provides a comprehensive overview of the computational physics for nano science and nano technology. Based on MATLAB and the C++ distributed computing paradigm, this book gives instructive explanations of the underlying physics for mesoscopic systems with many listed programs that readily compute physical properties into nano scales. Many generated graphical pictures demonstrate not only the principles of physics, but also the methodology of computing. The book starts with a review on quantum physics, quantum chemistry and condensed matter physics, followed by a discussion on the computational and analytical tools and the numerical algorithms used. With these tools in hand, the nonlinear many-body problem, the molecular dynamics, the low dimensionality and nanostructures are then explored. Special topics covered have include the plasmon, the quantum Hall effect, chaos and stochasticity. The applications explored here include graphene, carbon nanotube, water dynamics and the molecular computer. Contents: Little Big Science; Tools for Analysis; Mesoscopic Systems; Analytical Chapter; Numerical Chapter; Nonlinear Many Body Physics and Transport; OOP, MPI and Parallel Computing; Low Dimensionality and Nanostructures; Special Topics; Applications.
Multiattribute call markets
Authors: Michael P. Wellman
Venue:  (2008)

Multiattribute auctions support automated negotiation in settings where buyers and sellers have valuations for alternate configurations of a good, as defined by configuration attributes . Bidders express offers to buy or sell alternate configurations by specifying configuration-dependent reserve prices, and the auction determines both the traded goods and transaction prices based on these offers. While multiattribute auctions have been deployed in single-buyer procurement settings, the development of double-sided multiattribute auctions&mdash;allowing the free participation of both buyers and sellers&mdash;has received little attention from academia or industry. In this work I develop a multiattribute call market, a specific type of double auction in which bids accumulate over an extended period of time, before the auction determines trades based on the aggregate collection of bids. Building on a polynomial-time clearing algorithm, I contribute an efficient algorithm for information feedback. Supporting the implementation of market-based algorithms, information feedback support extends the range of settings for which multiattribute call markets achieve efficiency. Multiattribute auctions are only one of many auction variants introduced in recent years. The rapidly growing space of alternative auctions and trading scenarios calls for both a standardized language with which to specify auctions, as well as a computational test environment in which to evaluate alternate designs. I present a novel auction description language and deployment environment that supports the specification of a broad class of auctions, improving on prior approaches through a scripting language that employs both static parameter settings and rule-based behavior invocation. The market game platform, AB3D, can execute these auction scripts to implement multi-auction and multi-agent trading scenarios. The efficiency of multiattribute call markets depends crucially on the underlying valuations of participants. I analyze the expected performance limitations of multiattribute call markets, using existing analytical results where applicable. Addressing a lack of theoretical guidance in many natural settings, I introduce a computational metric on bidder valuations, and show a correlation between this metric and the expected efficiency of multiattribute call markets. As further validation, I integrate multiattribute markets into an existing supply chain simulation, demonstrating efficiency gains over a more conventional negotiation procedure.
Blended learning for teaching operating systems with Windows
Authors: Seung-won Hwang
Venue: ACM SIGCSE Bulletin (2009)

Since the release of Windows teaching materials, many experience reports have been published on OS course offerings adopting Windows kernel for course projects. Such projects, inherently requiring active learning, are reported to have both positive and negative correlations for student learning performance and responses. In this paper, we study how to maximize the traditional benefits of active learning, such as promoting student motivation, while minimizing the negatives, such as students feeling lost and overwhelmed. More specifically, we propose to blend active learning projects with closed problem sets and report student responses and learning performances.
Individual Adaptation to IT-Induced Change: The Role of Social Networks
Authors: SebastiáN Bruque, José Moyano, Jacob Eisenberg
Venue: Journal of Management Information Systems (2008)

In order to better understand the sociopsychological factors involved in employees' adaptation to new technology in organizations, we examine the role that two types of social networks-supportive and informational-play in individual adaptation to IT-induced change in a large financial company. Using survey data from 371 employees working in 133 different branches of the organization, we find that several aspects of the social networks relate to quality of employees' adaptation to the new technology as assessed by the company's departmental directors. Specifically, the size of the support network as well as the strength and density of the information network significantly predict employees' adaptation to the new system. We conclude the paper by discussing theoretical implications for the relevance of social network research for members' adaptation to organizational changes as well as outlining specific implications for practice.
Localized matching using Earth Mover's Distance towards discovery of common patterns from small image samples
Authors: Hung-Khoon Tan, Chong-Wah Ngo
Venue: Image and Vision Computing (2009)

This paper proposes a new approach for the discovery of common patterns in a small set of images by region matching. The issues in feature robustness, matching robustness and noise artifact are addressed to delve into the potential of using regions as the basic matching unit. We novelly employ the many-to-many (M2M) matching strategy, specifically with the Earth Mover's Distance (EMD), to increase resilience towards the structural inconsistency from improper region segmentation. However, the matching pattern of M2M is dispersed and unregulated in nature, leading to the challenges of mining a common pattern while identifying the underlying transformation. To avoid analysis on unregulated matching, we propose localized matching for the collaborative mining of common patterns from multiple images. The patterns are refined iteratively using the expectation-maximization algorithm by taking advantage of the ''crowding'' phenomenon in the EMD flows. Experimental results show that our approach can handle images with significant image noise and background clutter. To pinpoint the potential of Common Pattern Discovery (CPD), we further use image retrieval as an example to show the application of CPD for pattern learning in relevance feedback.
CDIT-based constrained resource allocation for mobile WiMAX systems
Authors: Felix Brah, Jerome Louveaux, Luc Vandendorpe
Venue: EURASIP Journal on Wireless Communications and Networking (2009)

Adaptive resource allocation has been shown to provide substantial performance gain in OFDMA-based wireless systems, such as WiMAX, when full channel state information (CSI) is available at the transmitter. However, in some fading environments (e.g., fast fading), there may not be a feedback link sufficiently fast to convey the CSI to the transmitter. In this paper, we consider resource allocation strategies for downlink multiuser mobile WiMAX systems, where the transmitter has only the channel distribution information (CDI), but no knowledge of the instantaneous channel realization. We address the problem of subchannel assignment and power allocation, to maximize the ergodic weighted-sum rate under long-term fairness, minimum data rate requirement and power budget constraints. This problem is formulated as a nonlinear stochastic constrained optimization problem. We provide an analytical solution based on the Lagrange dual decomposition framework. The proposed method has a complexity of O(KM) for K users and M subchannels. Simulation results are provided to compare the performance of this method with other allocation schemes and to illustrate the tradeoff between maximized weighted-sum rate and the constraints.
PHP MySQL Web Programming Interview Questions, Answers, and Explanations: PHP MySQL FAQ
Authors: Jim Stewart
Venue:  (2007)

The Ultimate Reference & Learning Guide for PHP mySQL! 100 Interview Questions, Answers, and Explanations In order to stay competitive, today's web programmer must have a thorough understanding of PHP and MySQL. With MySQL Interview Questions, Answers, and Explanations, you will be sure to stay up to date on the newest developments. Using this guide to prepare for a job interview or to brush up on the newest trends in MySQL will aid any web programmer in acquiring new skills and knowledge. This guide will explain many common errors, standard database maintenance, performance tuning, and many other new features. More than just documentation, this guide explains PHP and MySQL from the practical perspective of the web programmer so that you can evaluate a programming candidate or land that PHP mySQL position with ease. Key topics include: . SQL as a multithreaded, multi-user Database Management System . Database interactions with Windows . Database design, performance tuning, audit and security . Database monitoring and maintenance . Troubleshooting in implementation with ANSI C
A Markov random field model-based approach to natural image matting
Authors: Sheng-You Lin, Jiao-Ying Shi
Venue: Journal of Computer Science and Technology (2007)

This paper proposes a Markov Random Field (MRF) model-based approach to natural image matting with complex scenes. After the trimap for matting is given manually, the unknown region is roughly segmented into several joint sub-regions. In each sub-region, we partition the colors of neighboring background or foreground pixels into several clusters in RGB color space and assign matting label to each unknown pixel. All the labels are modelled as an MRF and the matting problem is then formulated as a maximum a posteriori (MAP) estimation problem. Simulated annealing is used to find the optimal MAP estimation. The better results can be obtained under the same user-interactions when images are complex. Results of natural image matting experiments performed on complex images using this approach are shown and compared in this paper.
Privacy in location-aware systems
Authors: Johann-Christoph Freytag
Venue: SIGSPATIAL Special (2009)

As our world becomes more and more proliferated by sensors and mobile devices - often connected by wireless networks - there is the urging need to develop appropriate abstractions for application development and deployment. Those abstractions should shield applications from the physical properties of the devices thereby allowing applications to focus on information processing based on global conceptual views (of the world) in form of context models. This paper will briefly elaborate on the concern for privacy in location-aware systems by providing a few examples that should highlight the complexity of such concerns. We show that privacy needs well founded bases for handling user requirements appropriately. Additionally, we argue that privacy aspects in context model based systems should include and embed privacy protection and control mechanism as an integral part on all systems levels therefore increasing the usability of such systems from a user's point of view.