ppxscal/embedding_network huggingface dataset:
Information Security Risk Management
Authors: Daniel Minoli, Jake Kouns
Venue:  (2009)

* Discusses all types of corporate risks and practical means of defending against them. * Security is currently identified as a critical area of Information Technology management by a majority of government, commercial, and industrial organizations. * Offers an effective risk management program, which is the most critical function of an information security program.
A negotiation game for multichannel access in cognitive radio networks
Authors: Hua Liu, Longbo Huang, Bhaskar Krishnamachari, Qing Zhao
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

We consider the problem of efficient opportunistic spectrum access in cognitive radio networks where there are multiple secondary users trying to share access to multiple channels. In our formulation, each user has a potentially different valuation of each channel and wishes to pick a channel in such a way as to maximize its benefit without interfering with other users. There is a fundamental tradeoff in this problem -- while information about other secondary users is useful in making a good channel sensing/access decision, the communication cost of gathering this information must be taken into account. We formulate the problem as a multi-round negotiation game in which the users try to gather "just-enough-information" to make their decisions. The channel valuations are modeled as independently uniformly distributed random variables between 0 and 1. We propose a threshold-based channel sensing policy based on observations from a previous work. For a two-user two-channel setting, we calculate optimal thresholds, and obtain the corresponding performance for cases with no information exchange, partial information exchange, and full information exchange. We then show how the optimal amount of information exchange varies with the cost of negotiation.
Challenges of interorganizational collaboration for information technology adoption: Insights from a governmental financial decision-making process in Egypt
Authors: Inas Ezz, Anastasia Papazafeiropoulou, Alan Serrano
Venue: Information Technology for Development (2009)

This article demonstrates the importance of collaboration between government departments as a backbone for interorganizational integration between agencies. It argues that the challenges related to information technology adoption in developing countries can be partially attributed to the lack of standard collaboration practices between government agencies. A case of a foreign financing decision-making process in Egypt was used as an example of a government process in which there was close collaboration between government agencies. The study identified a number of organizational and interorganizational problems such as difficulties in tracking and documenting the decision-making process across different departments within and across government agencies. It also shows the significance of intercollaboration barriers and the need to be considered seriously in any e-government project. The study results can be used by practitioners looking for best practices in the area of e-government development. &copy; 2009 Wiley Periodicals, Inc. Syed Nasirin is the accepting Guest Editor for this article.
Generalized schema-mappings: from termination to tractability
Authors: Bruno Marnette
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

Data-Exchange is the problem of creating new databases according to a high-level specification called a schema-mapping while preserving the information encoded in a source database. This paper introduces a notion of generalized schema-mapping that enriches the standard schema-mappings (as defined by Fagin et al) with more expressive power. It then proposes a more general and arguably more intuitive notion of semantics that rely on three criteria: Soundness, Completeness and Laconicity (non-redundancy and minimal size). These semantics are shown to coincide precisely with the notion of cores of universal solutions in the framework of Fagin, Kolaitis and Popa. It is also well-defined and of interest for larger classes of schema-mappings and more expressive source databases (with null-values and equality constraints). After an investigation of the key properties of generalized schema-mappings and their semantics, a criterion called Termination of the Oblivious Chase (TOC) is identified that ensures polynomial data-complexity. This criterion strictly generalizes the previously known criterion of Weak-Acyclicity. To prove the tractability of TOC schema-mappings, a new polynomial time algorithm is provided that, unlike the algorithm of Gottlob and Nash from which it is inspired, does not rely on the syntactic property of Weak-Acyclicity. As the problem of deciding whether a Schema-mapping satisfies the TOC criterion is only recursively enumerable, a more restrictive criterion called Super-weak Acylicity (SwA) is identified that can be decided in Polynomial-time while generalizing substantially the notion of Weak-Acyclicity.
Active error correction for learning kinship terms
Authors: Lyle H. Ungar
Venue:  (2008)

Kinship Analysis requires learning definitions of all kinship terms used in a target culture from data that is gathered incrementally through interviews with informants. We exploit a collection of previously learned kinship definitions from different cultures (logical &ldquo;domain theories&rdquo;) to minimize the cost of learning the definitions in a new domain theory. We use Transfer Learning and Inductive Logic Programming (ILP) to learn kinship definitions. We propose a novel method for identifying potential errors in the data by comparing our data with definitions in previously learned models of similar cultures. We actively ask informants to confirm or correct these potential errors. This Active Error Correction is enhanced by computing the similarity between the target domain theory and those of other cultures, and using these similarities to guide the search for definitions. Our similarity-guided Active Error Correction learns more than 90% of the kin terms, even when training examples are up to 19% incorrect. Suppressing error correction reduces learning accuracy by 29%. Because Active Error Correction correctly identifies almost all of the errors in the data for human correction, it reduces the need to collect further data by 20%. Furthermore, Similarity-Guided Search reduces repeat data requests of the User by 40%. The combination of Active Error Correction and Similarity-Guided Search can be used to reduce data requirements for ILP learning problems. As a side benefit, this work has produced a machine readable collection of 50 kinship domain theories that may provide broader benefits in anthropology, by surfacing interesting anthropological issues.
Center Fragments for Upscaling and Verification in Database Semantics
Authors: Roland Hausser
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

The notion of a fragment was coined by Montague 1974 to illustrate the formal handling of certain puzzles, such as de dicto/de re, in a truth-conditional semantics for natural language. The idea of a fragment is methodological: given the vastness of a natural language, one begins with a system which is of limited data coverage, but formally explicit and functionally complete relative to a certain goal or standard. Once a small fragment has been defined, there arises the task of upscaling, such as adding the treatment of another puzzle. Unfortunately, however, upscaling may turn out to be difficult or even impossible, depending on the assumptions of the initial fragment and the standard of functional completeness. For example, despite half a century of intensive research there is still no coherent formal account of a single natural language, verified computationally as nearly complete. This paper proposes a new kind of fragment, called center fragment, designed to ensure the longterm success of upscaling. Its functional standard is the model of natural language communication of agent-oriented Database Semantics (DBS), based on the algorithm of time-linear LA-grammar and the data structure of proplets. Its language data are selected to represent the primary semantic relations of natural language, namely (a) functor-argument structure and (b) coordination, in their most basic form. The approach is illustrated with applications to four languages with distinctively different word orders, namely English, German, Korean, and Russian.
Spinning online: a case study of internet broadcasting by DJs
Authors: David A. Shamma, Elizabeth F. Churchill, Nikhil Bobb, Matt Fukuda
Venue: Proceedings of the fourth international conference on Communities and technologies (2009)

Personal video streaming websites have become common on the Internet. They are increasingly used by broadcasters, bands, and entertainers as performance spaces and community gathering places for "fans". In order to understand how such live broadcasting sites fare as venues for gigs and for the maintenance of fan communities, we studied a video streaming site that is home to a vibrant DJ community. We spent time as audience members, analyzed site usage data, interviewed and charted the online presence of DJs who perform regularly on the, and talked with the site designers about their vision for the site. We found DJs use a number of tools to maintain close connections with three communities--their peers, with sources for new music and for related show content, and with their fans. When streaming live performances, DJs use visual interface cues to gauge audience reaction and tailor their sets accordingly. DJs talked about the broadcast channel as 'a place', and reported close social connection with invited and regular audience members. We conclude our paper with observations regarding the nature of community involvement on performance centered webcasting sites.
Detection of Dogs in Video Using Statistical Classifiers
Authors: Roman Juránek
Venue: Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers (2008)

A common approach to pattern recognition and object detection is to use a statistical classifier. Widely used method is AdaBoost or its modifications which yields outstanding results in certain tasks like face detection. The aim of this work was to build real-time system for detection of dogs for surveillance purposes. The author of this paper thus explored the possibility that the AdaBoost based classifiers could be used for this task.
A user-tracing architecture for modeling interaction with the world wide web
Authors: Peter Pirolli, Wai-Tat Fu, Robert Reeder, Stuart K. Card
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

We have developed a methodology for studying and analyzing the psychology of users performing ecologically valid WWW tasks. A user trace is a record of all significant states and events in the user-WWW interaction based on eye tracking data, application-level logs, and think-aloud protocols. A user-tracing architecture has been implemented for developing simulation models of user-WWW interaction and for comparing a simulation model (SNIF-ACT) against user-trace data. The user tracing architecture compares each action of the SNIF-ACT simulation directly against observed user actions. The model and architecture have been used to successfully match detailed user trace data from four users working on two tasks each.
Energy/area/delay tradeoffs in the physical design of on-chip segmented bus architecture
Authors: Jin Guo, Antonis Papanikolaou, Hao Zhang, Francky Catthoor
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

The increasing gap between design productivity and chip complexity and the emerging systems-on-chip (SoCs) architectural template have led to the wide utilization of reusable hard intellectual property (IP) cores. Macro block-based physical design implementation needs to find a well-balanced solution among chip area, on-chip communication energy, and critical communication path delay. We present in this paper an automated way to implement an energy optimal netlist interconnecting the hard macro blocks using a heavily segmented communication architecture. We explore the entire tradeoff curve among the network energy, chip area, and critical communication path delay at the floorplanning stage based on two real-life application drivers. Large energy gains with small area overheads are illustrated during the floorplanning stage. This tradeoff profile is a good guideline for the SOC designers to choose the optimal solution for their specific systems.
New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem
Authors: Thanh Thi Huynh Binh, Robert I. McKay, Nguyen Xuan Hoai, Nguyen Duc Nghia
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

In this paper, we propose a new heuristic, called Center-Based Recursive Clustering - CBRC, for solving the bounded diameter minimum spanning tree (BDMST) problem. Our proposed hybrid genetic algorithm [12] is also extended to include the new heuristic and a multi-parent crossover operator. We test the new heuristic and genetic algorithm on two sets of benchmark problem instances for the Euclidean and Non-Euclidean cases. Experimental results show the effectiveness of the proposed heuristic and genetic algorithm.
Hybrid storage for enabling fully-featured text search and fine-grained structural search over source code
Authors: Oleksandr Panchenko
Venue: Proceedings of the 2009 ICSE Workshop on Search-Driven Development-Users, Infrastructure, Tools and Evaluation (2009)

Searching is an important activity in software maintenance. Dedicated data structures have been used to support either textual or structural queries over source code. The goal of this ongoing research is to elaborate a hybrid data storage that enables simultaneous textual and structural search. The naive adjacency list method has been combined with the inverted index approach. The data model has been enhanced with the use of recent data compression approaches for column-oriented databases to allow no-loss albeit compact storage of fine-grained structural data. The graph indexing has enabled the proposed data model to expeditiously answer fine-grained structural queries. This paper describes the basics of the proposed approach and estimates its feasibility.
What's in a mashup? And why? Studying the perceptions of web-active end users
Authors: Nan Zang, Mary Beth Rosson
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

Mashups - web applications that integrate multiple data sources or APIs into one interface — have attracted considerable attention in recent years. The availability of web-based APIs and a growing array of XML data feeds has enabled this novel approach to web applications. However, due to the relatively advanced programming languages needed to integrate the web APIs and data feeds, mashup development still requires considerable programming expertise. In this paper we share the results of an exploratory study of active web users, their perceptions of what mashups could do for them and how they might be created. These users engage in many Internet-based activities but not web programming. Our results show that the technology initiative present in these users is a predictor of the value they see in mashups and the types of mashups they are interested in creating. While they may lack the programming skills, the users do see benefit in the use and creation of mashups as a tool for sharing and integrating information, as well as a means of effectively searching for information.
The Official CHFI Study Guide
Authors: Dave Kleiman, Craig Wright, Jesse James Varsalone, Timothy Clinton, Michael Gregg
Venue:  (2007)

This is the only official, EC-Council-endorsed CHFI (Computer Hacking Forensics Investigator) study guide. It was written for security professionals, systems administrators, IT consultants, legal professionals, IT managers, police and law enforcement personnel studying for the CHFI certification, and professionals needing the skills to identify an intruder's footprints and properly gather the necessary evidence to prosecute. Key features include: .The Only Official Study Guide for CHFI Provides 100% coverage of all exam objectives. .Full Web-based ExamModeled after the real exam, it also includes explanations of correct and incorrect answers..Exam ObjectivesEach is clearly explained at the beginning of the chapter..Notes and AlertsHighlight crucial points of the exam modules..Exam Objectives Fast TrackBulleted highlights emphasize the important points from the exam's perspective at the end of the chapter..Key TermsAll concepts are defined and explained as they appear. .Exam Objectives Frequently Asked QuestionsTest what you have learned by reading FAQs based on the material covered in the chapter. Log on to the Syngress Web site to access review questions based on the exam.
Integration and Innovation Orient to E-SocietyVolume 1: 7th IFIP International Conference on e-Business, e-Services, and e-Society (I3E2007), October 10-12, 1st edition
Authors: Weijun Wang, Weijun Wang, Yanhui Li, Zhao Duan, Li Yan, Hongxiu Li, Xiaoxi Yang
Venue:  (2007)

International Federation for Information Processing The IFIP series publishes state-of-the-art results in the sciences and technologies of information and communication. The scope of the series includes: foundations of computer science; software theory and practice; education; computer applications in technology; communication systems; systems modeling and optimization; information systems; computers and society; computer systems technology; security and protection in information processing systems; artificial intelligence; and human-computer interaction. Proceedings and post-proceedings of referred international conferences in computer science and interdisciplinary fields are featured. These results often precede journal publication and represent the most current research. The principal aim of the IFIP series is to encourage education and the dissemination and exchange of information about all aspects of computing. For more information about the 300 other books in the IFIP series, please visit springer.com.
Sign Language Spotting with a Threshold Model Based on Conditional Random Fields
Authors: Hee-Deok Yang, Stan Sclaroff, Seong-Whan Lee
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

Sign language spotting is the task of detecting and recognizing signs in a signed utterance, in a set vocabulary. The difficulty of sign language spotting is that instances of signs vary in both motion and appearance. Moreover, signs appear within a continuous gesture stream, interspersed with transitional movements between signs in a vocabulary and nonsign patterns (which include out-of-vocabulary signs, epentheses, and other movements that do not correspond to signs). In this paper, a novel method for designing threshold models in a conditional random field (CRF) model is proposed which performs an adaptive threshold for distinguishing between signs in a vocabulary and nonsign patterns. A short-sign detector, a hand appearance-based sign verification method, and a subsign reasoning method are included to further improve sign language spotting accuracy. Experiments demonstrate that our system can spot signs from continuous data with an 87.0 percent spotting rate and can recognize signs from isolated data with a 93.5 percent recognition rate versus 73.5 percent and 85.4 percent, respectively, for CRFs without a threshold model, short-sign detection, subsign reasoning, and hand appearance-based sign verification. Our system can also achieve a 15.0 percent sign error rate (SER) from continuous data and a 6.4 percent SER from isolated data versus 76.2 percent and 14.5 percent, respectively, for conventional CRFs.
SLA Design and Service Provisioning for Outsourced Services
Authors: Filipe T. Marques, Jacques P. Sauvé, J. Antão Moura
Venue: Journal of Network and Systems Management (2009)

In this work, a business-driven approach to designing Service Level Agreements in an e-commerce environment is proposed. In contrast to conventional SLA design approaches, the one proposed better captures the relationship between service provider and service client by considering the negative business impact (business loss) originated from IT infrastructure failures and performance degradation and introduces such knowledge into the SLA itself. A complete example scenario shows the value of the proposed approach. A main conclusion is that the SLA established using the business-driven perspective is superior to the one based on a conventional approach since both service provider and client can simultaneously obtain higher profit.
On the Existence of Answer Sets in Normal Extended Logic Programs
Authors: Martin Caminada, Chiaki Sakama
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

One of the serious problems in answer set programming is that relatively small pieces of information can cause a total absence of answer sets. To cope with this problem, this paper introduces a class of normal extended logic programs which are extended logic programs, whose defeasible rules are comparable to normal defaults in default logic. Under suitable program transformations, we show that every normal extended logic program always yields at least one answer set.
A Robust Non-Line-Of-Sight Error Mitigation Method in Mobile Position Location
Authors: Sumei Chen, Ju Liu, Lin Xue
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

A novel non-line-of-sight (NLOS) error identification and range measurement reconstruction algorithm is proposed. First, a NLOS error identification technique is exploited to decide whether there is a NLOS path from the base station (BS) to the mobile station (MS); Second, a biased Kalman filter (KF) is used to mitigate NLOS error in the raw measurements; and then, two measuring points which have maximum residual (so-called the upper dead point and the lower dead point) are investigated to suppress the NLOS error as well as measurement noise. Under the assumption that the NLOS range measurements have been identified, we propose an orthogonal polynomial to smooth the range measurements estimated by KF and a range measurement reconstruction model to suppress NLOS error. Simulations verify its effectiveness to true range reconstruction as well as location tracking in NLOS environment.
Recommender systems for mobile content: Current challenges and ways forward
Authors: Giridhar D. Mandyam, Mark Boyns
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Cellular data services have benefited recently from enhancements in access speed, delay, and other parameters generally associated with quality-of-service (QoS). However, end users still often have trouble discovering appropriate content due to fractured and non-intuitive approaches to content discovery. One possible means of addressing this problem is the use of recommender systems to personalize content for cellular data users. Recommender systems have an established role in internet content discovery, but their applications in wireless are not straightforward. This paper discusses the critical challenges in implementing recommender systems for content in cellular systems, and also proposes methods for deployment of such systems so as to improve content discovery.