id int64 1 302k | paper_id stringlengths 2 9 | text_a stringlengths 385 9.83k | text_b stringlengths 385 9.94k |
|---|---|---|---|
137,483 | 199371812 | rules of encounter: designing conventions for automated negotiation among computers part 1 machines that make deals: the premise machine encounters social engineering for machines scenarios how does this differ from al? how does this differ from game theory? part 2 interaction mechanisms: the negotiation problem in dif... | a better-response strategy for self-interested planning agents when self-interested agents plan individually, interactions that prevent them from executing their actions as planned may arise. in these coordination problems, game-theoretic planning can be used to enhance the agents’ strategic behavior considering the in... |
193,251 | 46410382 | semiblind em-based iterative receivers for space–time-coded modulation and quasi-static frequency-selective fading channels this paper introduces two different iterative receivers for space-time-coded data transmitted through frequency-selective fading channels. both receivers perform maximum a posteriori data de... | two em-type channel estimation algorithms for ofdm with transmitter diversity combining orthogonal frequency division multiplexing (ofdm) with transmitter diversity can be used for capacity improvement in high-rate wireless data communication systems. for coherent detection in such systems, channel state information (c... |
7,819 | 55780937 | trust in personalized web search based on clustered query sessions personalized web search customizes the search according to the information need of the user on the web. in personalized web search, search is personalized using the search results of those users profile which have the information need similar to that of... | semantic query expansion using cluster based domain ontologies information on the web has been growing at a very rapid pace and has become quite voluminous over the past few years. the users search query on the web could not retrieve sufficient relevant documents and is responsible for low precision of search results. ... |
191,339 | 9233081 | back to the future: revisiting precise program verification using smt solvers this paper takes a fresh look at the problem of precise verification of heap-manipulating programs using first-order satisfiability-modulo-theories (smt) solvers. we augment the specification logic of such solvers by introducing the logic of ... | on an efficient decision procedure for imperative tree data structures we present a new decidable logic called trex for expressing constraints about imperative tree data structures. in particular, trex supports a transitive closure operator that can express reachability constraints, which often appear in data structure... |
278,864 | 215238685 | photo assessment based on computational visual attention model it is difficult to be satisfied for automatic photo assessment using only low level visual features such as brightness, lighting, hue, contrast, color distribution and so on. instead of using low level visual features, we present a novel computational visua... | classification of digital photos taken by photographers or home users in this paper, we address a specific image classification task, i.e. to group images according to whether they were taken by photographers or home users. firstly, a set of low-level features explicitly related to such high-level semantic concept are ... |
67,829 | 67440455 | energy-efficient and reliable routing protocol for wireless sensor networks in wsns routing of data consumes a lot of energy due to excessive flooding of packets. in the proposed eerp scheme routing is done on the basis of intensity of received signals. unlike reep, information packet is forwarded by only one source se... | dsearching: using floating mobility information for distributed node searching in dtns in delay tolerant networks (dtns), enabling a mobile node to search and find another interested mobile node is an important function in many applications. however, the movement of nodes in dtns makes the problem formidable. current n... |
54,325 | 962017 | multi-faceted recall of continuous active learning for technology-assisted review continuous active learning achieves high recall for technology-assisted review, not only for an overall information need, but also for various facets of that information need, whether explicit or implicit. through simulations using cormac... | document categorization in legal electronic discovery: computer classification vs. manual review in litigation in the us, the parties are obligated to produce to one another, when requested, those documents that are potentially relevant to issues and facts of the litigation (called “discovery”). as the volume of electr... |
144,430 | 10137997 | searching social updates for topic-centric entities with the growing popularity of social networking services, real time short messages, such as facebook news feeds and twitter tweets, are becoming increasingly important information sources. people use these services to search for and consume content about interesting ... | entity-based classification of twitter messages twitter is a popular micro-blogging service on theweb, where people can enter short messages, which then become visible to some other users of the service. while the topics of these messages varies, there are a lot of messages where the users express their opinions about ... |
300,066 | 46547485 | recent innovations in simio this paper briefly describes simio™ simulation software, a sim ulation modeling framework based on i ntelligent o bjects. it then describes a few of the many recent enhancements and innovations including smore charts that allow unprecedented insight into your simulation output, sophisticated... | introduction to simio this paper describes the simio™ modeling system that is designed to simplify model building by promoting a modeling paradigm shift from the process orientation to an object orientation. simio is a sim ulation modeling framework based on i ntelligent o bjects. the intelligent objects are built by m... |
2,415 | 112579 | finding popular categories for rfid tags as rfid tags are increasingly attached to everyday items, it quickly becomes impractical to collect data from every tag in order to extract useful information. in this paper, we consider the problem of identifying popular categories of rfid tags out of a large collection of tags... | efficient continuous scanning in rfid systems rfid is an emerging technology with many potential applications such as inventory management for supply chain. in practice, these applications often need a series of continuous scanning operations to accomplish a task. for example, if one wants to scan all the products with... |
195,856 | 211057634 | unsupervised domain adaptation for face anti-spoofing face anti-spoofing (a.k.a. presentation attack detection) has recently emerged as an active topic with great significance for both academia and industry due to the rapidly increasing demand in user authentication on mobile phones, pcs, tablets, and so on. recently, ... | person-specific face antispoofing with subject domain adaptation face antispoofing is important to practical face recognition systems. in previous works, a generic antispoofing classifier is trained to detect spoofing attacks on all subjects. however, due to the individual differences among subjects, the generic classi... |
31,700 | 6469548 | slicing real-time programs for enhanced schedulability in this article we present a compiler-based technique to help develop correct real-time systems. the domain we consider is that of multiprogrammed real-time applications, in which periodic tasks control physical systems via interacting with external sensors and act... | the program dependence graph in a software development environment the internal program representation chosen for a software development environment plays a critical role in the nature of that environment. a form should facilitate implementation and contribute to the responsiveness of the environment to the user. the p... |
141,984 | 9039751 | an extended relational database model for uncertain and imprecise information we propose an extended relational database model which can model both uncertainty and imprecision in data. this model is based on dempster-shafer theory which has become popular in ai as an uncertainty reasoning tool. the definitions of be1 a... | efficient query evaluation on probabilistic databases we describe a system that supports arbitrarily complex sql queries with ”uncertain” predicates. the query semantics is based on a probabilistic model and the results are ranked, much like in information retrieval. our main focus is query evaluation. we describe an o... |
141,858 | 49305965 | a concept-driven algorithm for clustering search results without search engines, the internet would be an enormous amount of disorganized information that would certainly be interesting but perhaps not very useful. search engines help us in all kinds of tasks and are constantly improving result relevance. the lingo alg... | grouper: a dynamic clustering interface to web search results abstract users of web search engines are often forced to sift through the long ordered list of document `snippets' returned by the engines. the ir community has explored document clustering as an alternative method of organizing retrieval results, but cluste... |
191,045 | 3384778 | sparse and redundant representations: from theory to applications in signal and image processing this textbook introduces sparse and redundant representations with a focus on applications in signal and image processing. the theoretical and numerical foundations are tackled before the applications are discussed. mathema... | compressive sensing for synthetic aperture radar in fast-time and slow-time domains compressive sensing (cs) is a new method to capture and represent compressible signals at a rate significantly below the nyquist rate. to reduce the high data redundancy among different echoes in synthetic aperture radar (sar), we apply... |
105,412 | 4800341 | towards a framework for security measurement this work aims to devise a framework for measuring system security. we can all agree that the ability to compare, to contrast, and to make quantifiable statements about system security is extremely valuable. it means that we will have a basis to determine where to put our li... | ideal based cyber security technical metrics for control systems much of the world's critical infrastructure is at risk from attack through electronic networks connected to control systems. security metrics are important because they provide the basis for management decisions that affect the protection of the infrastru... |
27,541 | 11182466 | searching for common sense: populating cyc from the web the cyc project is predicated on the idea that effective machine learning depends on having a core of knowledge that provides a context for novel learned information - what is known informally as "common sense." over the last twenty years, a sufficient core of com... | automatically refining the wikipedia infobox ontology the combined efforts of human volunteers have recently extracted numerous facts from wikipedia, storing them as machine-harvestable object-attribute-value triples in wikipedia infoboxes. machine learning systems, such as kylin, use these infoboxes as training data, ... |
220,818 | 26129834 | training second-order recurrent neural networks using hints we investigate a method for inserting rules into discrete-time second-order recurrent neural networks which are trained to recognize regular languages. the rules defining regular languages can be expressed in the form of transitions in the corresponding determ... | rule induction through integrated symbolic and subsymbolic processing we describe a neural network, called rulenet, that learns explicit, symbolic condition-action rules in a formal string manipulation domain. rulenet discovers functional categories over elements of the domain, and, at various points during learning, e... |
24,214 | 18656953 | don't match twice: redundancy-free similarity computation with mapreduce to improve the effectiveness of pair-wise similarity computation, state-of-the-art approaches assign objects to multiple overlapping clusters. this introduces redundant pair comparisons when similar objects share more than one cluster. we propose ... | using mahout for clustering wikipedia's latest articles: a comparison between k-means and fuzzy c-means in the cloud this paper compares k-means and fuzzy c-means for clustering a noisy realistic and big dataset. we made the comparison using a free cloud computing solution apache mahout/ hadoop and wikipedia's latest a... |
41,495 | 10436752 | a transformational product to improve self-control strength: the chocolate machine lack of self-control is at the heart of many undesirable behaviors, such as overeating, overspending, and even overworking. while the field of persuasive technologies searches for ways to change attitudes and behaviors, it often neglects... | self-evidence: applying somatic connoisseurship to experience design this design case study examines and illustrates the concept of self-evidence by applying somatic connoisseurship to experience design. it invites a re-thinking of the process of design for technology, one that includes design for the experience of the... |
126,060 | 53091212 | towards a language-independent approach for reverse-engineering of software product lines common industrial practices lead to the development of similar software products. these products are usually managed in an ad-hoc way which gradually results in a low product quality. to overcome this problem, it is essential to m... | feature location in a collection of software product variants using formal concept analysis formal concept analysis (fca) is a theoretical framework which structures a set of objects described by properties. in order to migrate software product variants which are considered similar into a product line, it is essential ... |
203,253 | 4784499 | traffic observatory: a system to detect and locate traffic events and conditions using twitter twitter has become one of the most popular platforms for sharing user-generated content, which varies from ordinary conversations to information about recent events. studies have already showed that the content of tweets has ... | road traffic congestion monitoring in social media with hinge-loss markov random fields real-time road traffic congestion monitoring is an important and challenging problem. most existing monitoring approaches require the deployment of infrastructure sensors or large-scale probe vehicles. their installation is often ex... |
224,335 | 9892513 | fault tolerance under unix the initial design for a distributed, fault-tolerant version of unix based on three-way atomic message transmission was presented in an earlier paper [3]. the implementation effort then moved from auragen systems 1 to nixdorf computer where it was completed. this paper describes the working s... | checkpoint/rollback in a distributed system using coarse-grained dataflow the common spaceborne multicomputer operating system (cosmos) is a spacecraft operating system for distributed memory multiprocessors, designed to meet the on-board computing requirements of long-life interplanetary missions. one of the main feat... |
287,981 | 1277763 | joint admission control and power allocation for cognitive radio networks in this paper, we study the problem of joint admission control and power allocation for cognitive radio networks. in such a scenario, the quality of service for primary and secondary users is needed to be guaranteed, which can be translated into ... | dynamic spectrum access with qos and interference temperature constraints spectrum is one of the most precious radio resources. with the increasing demand for wireless communication, efficiently using the spectrum resource has become an essential issue. with the federal communications commission's (fcc) spectrum policy... |
60,753 | 7746749 | relationships, paths and principal matching: a new approach to access control recent work on relationship-based access control has begun to show how it can be applied to general computing systems, as opposed to simply being employed for social networking applications. the use of relationships to determine authorization... | relationship-based access control for an open-source medical records system inspired by the access control models of social network systems, relationship-based access control (rebac) was recently proposed as a general-purpose access control paradigm for application domains in which authorization must take into account ... |
265,258 | 51936617 | learning to sketch with shortcut cycle consistency to see is to sketch -- free-hand sketching naturally builds ties between human and machine vision. in this paper, we present a novel approach for translating an object photo to a sketch, mimicking the human sketching process. this is an extremely challenging task becau... | context-based sketch classification we present a novel context-based sketch classification framework using relations extracted from scene images. most of existing methods perform sketch classification by considering individually sketched objects and often fail to identify their correct categories, due to the highly abs... |
259,323 | 5324795 | on making tcp more robust to packet reordering previous research indicates that packet reordering is not a rare event on some internet paths. reordering can cause performance problems for tcp's fast retransmission algorithm, which uses the arrival of duplicate acknowledgments to detect segment loss. duplicate acknowled... | improving the performance of tcp in the case of packet reordering numerous studies have shown that packet reordering is common, especially in networks where there is high degree of parallelism and different link speeds. reordering of packets decreases the tcp performance of a network, mainly because it leads to overest... |
192,368 | 51869447 | discovering localized attributes for fine-grained recognition attributes are visual concepts that can be detected by machines, understood by humans, and shared across categories. they are particularly useful for fine-grained domains where categories are closely related to one other (e.g. bird species recognition). in s... | fine-grained visual classification of aircraft this paper introduces fgvc-aircraft, a new dataset containing 10,000 images of aircraft spanning 100 aircraft models, organised in a three-level hierarchy. at the finer level, differences between models are often subtle but always visually measurable, making visual recogni... |
180,253 | 207574775 | distributed compression-estimation using wireless sensor networks this paper provides an overview of distributed estimation-compression problems encountered with wireless sensor networks (wsn). a general formulation of distributed compression-estimation under rate constraints was introduced, pertinent signal processing... | universal decentralized estimation in a bandwidth constrained sensor network consider a situation where a set of distributed sensors and a fusion center wish to cooperate to estimate an unknown parameter over a bounded interval [-u,u]. each sensor collects one noise-corrupted sample, performs a local estimation, and tr... |
205,849 | 2399617 | confidence-based policy learning from demonstration using gaussian mixture models we contribute an approach for interactive policy learning through expert demonstration that allows an agent to actively request and effectively represent demonstration examples. in order to address the inherent uncertainty of human demons... | trajectories and keyframes for kinesthetic teaching: a human-robot interaction perspective kinesthetic teaching is an approach to providing demonstrations to a robot in learning from demonstration whereby a human physically guides a robot to perform a skill. in the common usage of kinesthetic teaching, the robot's traj... |
55,746 | 12839259 | generating similarity-based playlists using traveling salesman algorithms when using a mobile music player en-route, usually only little attention can be paid to its handling. nonetheless it is desirable that all music stored in the device can be accessed quickly, and that tracks played in a sequence should match up. i... | “reinventing the wheel”: a novel approach to music player interfaces we present a novel interface to (portable) music players that benefit from intelligently structured collections of audio files. for structuring, we calculate similarities between every pair of songs and model a travelling salesman problem (tsp) that i... |
112,968 | 4747833 | graphiql: a graph intuitive query language for relational databases graph analytics is becoming increasingly popular, driving many important business applications from social network analysis to machine learning. since most graph data is collected in a relational database, it seems natural to attempt to perform graph a... | graph analytics using vertica relational database graph analytics is becoming increasingly popular, with a number of new applications and systems developed in the past few years. in this paper, we study vertica relational database as a platform for graph analytics. we show that vertex-centric graph analysis can be tran... |
50,435 | 7336078 | a data parallel approach to genetic programming using programmable graphics hardware in recent years the computing power of graphics cards has increased significantly. indeed, the growth in the computing power of these graphics cards is now several orders of magnitude greater than the growth in the power of computer pr... | a many threaded cuda interpreter for genetic programming a single instruction multiple thread cuda interpreter provides simd like parallel evaluation of the whole gp population of $\frac{1}{4}$ million reverse polish notation (rpn) expressions on graphics cards and nvidia tesla. using sub-machine code tree gp a sustain... |
132,184 | 52983081 | fuzzy orders-of-magnitude-based link analysis for qualitative alias detection alias detection has been the significant subject being extensively studied for several domain applications, especially intelligence data analysis. many preliminary methods rely on text-based measures, which are ineffective with false descript... | link-based approach for bibliometric journal ranking the isi impact factor is widely accepted as a possible measurement of academic journal quality. however, much debate has recently surrounded this use, and several complex alternative journal impact indicators have been reported. to avoid the bias which may be caused ... |
185,159 | 11157383 | data exchange: computing cores in polynomial time data exchange deals with inserting data from one database into another database having a different schema. we study and solve a central computational problem of data exchange, namely, computing the core of a universal solution to a data exchange problem. fagin, kolaitis... | approximate data exchange we introduce approximate data exchange, by relaxing classical data exchange problems such as consistency and typechecking to their approximate versions based on property testing. it provides a natural framework for consistency and safety questions, which first considers approximate solutions a... |
77,014 | 22320005 | an approach to encouraging and evaluating learner's knowledge contribution in web-based collaborative learning although previous research has demonstrated learning benefits for both instructors and students in the web-based collaborative learning environments, one of the major difficulties is the lack of a practical ap... | wiki-supported collaborative learning in primary education: how a dialogic space is created for thinking together this paper explores how wikis may be used to support primary education students’ collaborative interaction and how such an interaction process can be characterised. the overall aim of this study is to analy... |
107,861 | 15500039 | distributed ons and its impact on privacy the epc network is an industry proposal to build a global information architecture for objects carrying rfid tags with electronic product codes (epc). a so-called object naming service (ons) is used to locate information sources for these objects in the epc network. but ons is ... | supernode election algorithm in p2p network based upon district partition with the rapid development of p2p, there are some new applications such as p2psip and intercommunication of heterogeneous dhts (distributed hash tables). in those scenarios, there need some nodes acting as proxies and gateways. such nodes as prox... |
84,986 | 60440405 | a secure biometric-based user authentication scheme for heterogeneous wsn the advancement of research on the internet of things (iot) results in wsn to become an integral part of it, which results in, the users can access the sensor data from an insecure public communication channel. remote user authentication and mutu... | an effective key management scheme for heterogeneous sensor networks abstract security is critical for sensor networks used in military, homeland security and other hostile environments. previous research on sensor network security mainly considers homogeneous sensor networks. research has shown that homogeneous ad hoc... |
163,160 | 2722191 | declustering spatial databases on a multi-computer architecture we present a technique to decluster a spatial access method on a shared-nothing multi-computer architecture [dgs+90]. we propose a software architecture with the r-tree as the underlying spatial access method, with its non-leaf levels on the ‘master-server... | study of scalable declustering algorithms for parallel grid files the efficient storage and retrieval of large multidimensional datasets is an important concern for large-scale scientific computations, such as long-running time-dependent simulations which periodically generate snapshots of the state. the main challenge... |
266,272 | 11007853 | interactive pen-and-ink illustration we present an interactive system for creating pen-and-ink illustrations. the system uses stroke textures —collections of strokes arranged in different patterns—to generate texture and tone. the user “paints” with a desired stroke texture to achieve a desired tone, and the computer d... | real-time hatching drawing surfaces using hatching strokes simultaneously conveys material, tone, and form. we present a real-time system for non-photorealistic rendering of hatching strokes over arbitrary surfaces. during an automatic preprocess, we construct a sequence of mipmapped hatch images corresponding to diffe... |
144,808 | 497905 | a data-oriented (and beyond) network architecture the internet has evolved greatly from its original incarnation. for instance, the vast majority of current internet usage is data retrieval and service access, whereas the architecture was designed around host-to-host applications such as telnet and ftp. moreover, the o... | designing and realizing an information-centric internet information-centric networking has been attracting increasing attention within the networking community. technological solutions as well as entire architectures have been proposed with subtle but seemingly important differences. in this article, we define a set of... |
125,480 | 6310689 | default knowledge in logic programs with uncertainty many frameworks have been proposed to manage uncertain information in logic programming. essentially, they differ in the underlying notion of uncertainty and how these uncertainty values, associated to rules and facts, are managed. the goal of this paper is to allow ... | a top-down query answering procedure for normal logic programs under the any-world assumption the any-world assumption (awa) has been introduced for normal logic programs as a generalization of the well-known notions of closed world assumption (cwa) and the open world assumption (owa). the awa allows anyassignment (i.e... |
65,344 | 5583259 | a java toolkit for teaching distributed algorithms we present a toolkit for developing and visualizing distributed algorithms in java. this toolkit consists of a java class library with a simple programming interface that allows to develop distributed algorithms in a message passing model. the resulting programs may be... | virtual trees for the byzantine generals algorithm the byzantine generals algorithm for achieving reliability in the presence of faults is a classic topic in distributed computation and operating systems, not the least because of its colorful story. we describe a concept called virtual data structures, which are concre... |
248,261 | 17271107 | a modified editing k-nearest neighbor rule classification of objects is an important area in a variety of fields and applications. many different methods are available to make a decision in those cases. the k -nearest neighbor rule ( k-nn ) is a well-known nonparametric decision procedure. classification rules based on... | acquisition of hierarchy-structured probabilistic decision tables and rules from data : the paper is concerned with the creation of predictive models from data within the framework of the variable precision rough set model. it is focused on two aspects of the model derivation: computation of uncertain, in general, rule... |
271,943 | 52008698 | intrinsic rowhammer pufs: leveraging the rowhammer effect for improved security physically unclonable functions (pufs) have become an important and promising hardware primitive for device fingerprinting, device identification, or key storage. intrinsic pufs leverage components already found in existing devices, unlike ... | a self-authenticating chip architecture using an intrinsic fingerprint of embedded dram an architecture for enabling self-authenticating chips uses 4 kb electrically programmable fuses (efuse) to store bit strings representing encrypted intrinsic fingerprints obtained by offset-superimposing six out of one thousand 4 k... |
95,540 | 204961655 | ensembles of learning machines ensembles of learning machines constitute one of the main current directions in machine learning research, and have been applied to a wide range of real problems. despite of the absence of an unified theory on ensembles, there are many theoretical reasons for combining multiple learners, ... | combining pattern classifiers: methods and algorithms this book, which is wholly devoted to the subject of model combination, is divided into ten chapters. in addition to the first two introductory chapters, the book covers some of the following topics: multiple classifier systems; combination methods when the base cla... |
135,545 | 56895445 | near data processing: impact and optimization of 3d memory system architecture on the uncore a promising recent development that can provide continued scaling of performance is the ability to stack multiple dram layers on a multi-core processor die. this paper analyzes the interaction between the interconnection networ... | scheduling techniques for gpu architectures with processing-in-memory capabilities processing data in or near memory (pim), as opposed to in conventional computational units in a processor, can greatly alleviate the performance and energy penalties of data transfers from/to main memory. graphics processing unit (gpu) a... |
76,892 | 43405736 | interaction design for dyslexic children reading application: a guideline this paper outlines and explains the guideline needed to design an effective interaction design (ixd) for dyslexic children’s reading application. the guideline is developed based on theories that underly dyslexia and its effects towards reading,... | layout guidelines for web text and a web service to improve accessibility for dyslexics in this paper, we offer set of guidelines and a web service that presents web texts in a more more accessible way to people with dyslexia. the layout guidelines for developing this service are based on a user study with a group of t... |
286,927 | 14677403 | memory expansion technology (mxt): software support and performance a novel memory subsystem called memory expansion technology (mxt) has been built for fast hardware compression of main-memory content. this allows a memory expansion to present a "real" memory larger than the physically available memory. this paper pro... | profile-driven selective code compression in the embedded system design, memory is one of the most restricted resources. code compression has been proposed as a solution to reduce the code size of applications for embedded systems. data compression techniques are used to compress programs to reduce memory size. most pr... |
19,794 | 67154425 | heer - a delay-aware and energy-efficient routing protocol for wireless sensor networks minimizing energy consumption to maximize network lifetime is one of the crucial concerns in designing wireless sensor network routing protocols. cluster-based protocols have shown promising energy-efficiency performance, where sens... | design of a distributed energy-efficient clustering algorithm for heterogeneous wireless sensor networks the clustering algorithm is a kind of key technique used to reduce energy consumption. it can increase the scalability and lifetime of the network. energy-efficient clustering protocols should be designed for the ch... |
268,501 | 15235530 | differentially private histogram publishing through lossy compression differential privacy has emerged as one of the most promising privacy models for private data release. it can be used to release different types of data, and, in particular, histograms, which provide useful summaries of a dataset. several differentia... | differentially private summaries for sparse data differential privacy is fast becoming the method of choice for releasing data under strong privacy guarantees. a standard mechanism is to add noise to the counts in contingency tables derived from the dataset. however, when the dataset is sparse in its underlying domain,... |
134,489 | 7813934 | a broadcast strategy for the gaussian slowly fading channel we investigate a broadcast transmission strategy for the single-user slowly fading gaussian channel where the channel state is assumed to be known at the receiver end only. this strategy facilitates one to adapt the transmission rate to the actual channel cond... | a broadcast approach for a single user slowly fading mimo channel a broadcast transmission strategy for the slowly fading gaussian multiple-input multiple-output (mimo) channel is introduced. this broadcast strategy is an extension of the single-input single-output (siso) broadcast approach. perfect channel state infor... |
22,639 | 17225732 | interference mitigation in wireless mesh networks through stdma wormhole switching cognitive radio networks offer the promise of adaptively allocating resources on the fly. in this paper, we describe an interference mitigation technique that relies on intelligent resource allocation across a mesh network. in previous w... | on high spatial reuse link scheduling in stdma wireless ad hoc networks we consider the point-to-point link scheduling problem in spatial time division multiple access (stdma) wireless ad hoc networks, motivate the use of spatial reuse as performance metric and provide an explicit characterization of spatial reuse. we ... |
295,926 | 3249297 | nodemd: diagnosing node-level faults in remote wireless sensor systems software failures in wireless sensor systems are notoriously difficult to debug. resource constraints in wireless deployments substantially restrict visibility into the root causes of node-level system and application faults. at the same time, the h... | lightweight tracing for wireless sensor networks debugging wireless sensor networks (wsns) are being increasingly deployed in the real world to monitor the environment and large industrial infrastructures. the extreme resource constraints inherent to wsns, the in situ deployment in harsh environments and the lack of ru... |
150,836 | 210023477 | time-series clustering - a decade review clustering is a solution for classifying enormous data when there is not any early knowledge about classes. with emerging new concepts like cloud computing and big data and their vast applications in recent years, research works have been increased on unsupervised solutions like... | distance measures for effective clustering of arima time-series much environmental and socioeconomic time-series data can be adequately modeled using autoregressive integrated moving average (arima) models. we call such time series "arima time series". we propose the use of the linear predictive coding (lpc) cepstrum f... |
144,162 | 2369967 | immediate-head parsing for language models we present two language models based upon an "immediate-head" parser --- our name for a parser that conditions all events below a constituent c upon the head of c. while all of the most accurate statistical parsers are of the immediate-head variety, no previous grammatical lan... | accurate unlexicalized parsing we demonstrate that an unlexicalized pcfg can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down false independence assumptions latent in a vanilla treebank grammar. indeed, its performance of 86.36% (lp/lr f1... |
106,451 | 4559639 | generating text from structured data with application to the biography domain this paper introduces a neural model for concept-to-text generation that scales to large, rich domains. we experiment with a new dataset of biographies from wikipedia that is an order of magni- tude larger than existing resources with over 70... | generating natural language from linked data: unsupervised template extraction we propose an architecture for generating natural language from linked data that automatically learns sentence templates and statistical document planning from parallel rdf datasets and text. we have built a proof-of-concept system (lod-def)... |
173,000 | 12653224 | modular attribute grammars attribute grammars provide a formal declarative notation for describing the semantics and translation of programming languages. describing any real programming language is a significant software engineering challenge. from a software engineering viewpoint, current notations for attribute gram... | composable attribute grammars: support for modularity in translator design and implementation this paper introduces composable attribute grammars (cags), a formalism that extends classical attribute grammars to allow for the modular composition of translation specifications and of translators. cags bring to complex tra... |
67,089 | 2205807 | espda: energy-efficient and secure pattern-based data aggregation for wireless sensor networks secure data transmission and data aggregation are critical in designing cluster-based sensor networks. this paper presents an energy-efficient and secure pattern-based data aggregation protocol (espda) for wireless sensor net... | secure aggregation for wireless networks an emerging class of important applications uses ad hoc wireless networks of low-power sensor devices to monitor and send information about a possibly hostile environment to a powerful base station connected to a wired network. to conserve power, intermediate network nodes shoul... |
52,647 | 1769943 | semantic segmentation using regions and parts we address the problem of segmenting and recognizing objects in real world images, focusing on challenging articulated categories such as humans and other animals. for this purpose, we propose a novel design for region-based object detectors that integrates efficiently top-... | learning spatial context: using stuff to find things the sliding window approach of detecting rigid objects (such as cars) is predicated on the belief that the object can be identified from the appearance in a small region around the object. other types of objects of amorphous spatial extent (e.g., trees, sky), however... |
148,088 | 75136732 | deepsecure: scalable provably-secure deep learning this paper presents deepsecure, the an scalable and provably secure deep learning (dl) framework that is built upon automated design, efficient logic synthesis, and optimization methodologies. deepsecure targets scenarios in which neither of the involved parties includ... | oblivious neural network predictions via minionn transformations machine learning models hosted in a cloud service are increasingly popular but risk privacy: clients sending prediction requests to the service need to disclose potentially sensitive information. in this paper, we explore the problem of privacy-preserving... |
46,893 | 208267753 | a large scale ranker-based system for search query spelling correction this paper makes three significant extensions to a noisy channel speller designed for standard written text to target the challenging domain of search queries. first, the noisy channel model is subsumed by a more general ranker, which allows a varie... | spelling correction for search engine queries search engines have become the primary means of accessing information on the web. however, recent studies show misspelled words are very common in queries to these systems. when users misspell query, the results are incorrect or provide inconclusive information. in this wor... |
34,232 | 8380816 | long-lived adaptive collect with applications a distributed algorithm is adaptive if the worst case step complexity of its operations is bounded by a function of the number of processes that are concurrently active during the operation (rather than a function of n, the total number of processes, which is usually much l... | algorithms for scalable synchronization on shared-memory multiprocessors busy-wait techniques are heavily used for mutual exclusion andbarrier synchronization in shared-memory parallel programs.unfortunately, typical implementations of busy-waiting tend to producelarge amounts of memory and interconnect contention, int... |
292,871 | 10838109 | modeling churn in p2p networks the objective of this paper is to introduce a model to guide the analysis of the impact of churn in p2p networks. using this model, a variety of node membership scenarios is created. these scenarios are used to capture and analyze the performance trends of chord, a distributed hash table ... | schord: handling churn in chord by exploiting node session time peer-to-peer systems are distinguished from traditional distributed systems in that nodes join and leave the p2p system at high rates, called churn problem. schord, a p2p system, is illustrated in this paper, which is constructed on chord system and aims t... |
29,597 | 19473765 | ranking optimization for person re-identification via similarity and dissimilarity person re-identification is a key technique to match different persons observed in non-overlapping camera views.many researchers treat it as a special object retrieval problem, where ranking optimization plays an important role. existing... | ensemble diffusion for retrieval as a postprocessing procedure, diffusion process has demonstrated its ability of substantially improving the performance of various visual retrieval systems. whereas, great efforts are also devoted to similarity (or metric) fusion, seeing that only one individual type of similarity cann... |
277,384 | 9984104 | distributed query processing on the grid distributed query processing (dqp) has been widely used in data intensive applications where data of relevance to users is stored in multiple locations. this paper argues: (i) that dqp can be important in the grid, as a means of providing high-level, declarative languages for in... | service-based distributed querying on the grid service-based approaches (such as web services and the open grid services architecture) have gained considerable attention recently for supporting distributed application development in e-business and e-science. the emergence of a service-oriented view of hardware and soft... |
36,446 | 5176321 | counter machines: decidable properties and applications to verification problems we study various generalizations of reversal-bounded multicounter machines and show that they have decidable emptiness, infiniteness, disjointness, containment, and equivalence problems. the extensions include allowing the machines to perf... | proving safety properties of infinite state systems by compilation into presburger arithmetic we present in this paper a method combining path decomposition and bottom-up computation features for characterizing the reachability sets of petri nets within presburger arithmetic. an application of our method is the automat... |
277,399 | 119105505 | jali: an animator-centric viseme model for expressive lip synchronization the rich signals we extract from facial expressions imposes high expectations for the science and art of facial animation. while the advent of high-resolution performance capture has greatly improved realism, the utility of procedural animation w... | end-to-end learning for 3d facial animation from speech we present a deep learning framework for real-time speech-driven 3d facial animation from speech audio. our deep neural network directly maps an input sequence of speech spectrograms to a series of micro facial action unit intensities to drive a 3d blendshape face... |
297,138 | 2128104 | an evaluation of regular path expressions with qualifiers against xml streams we present spex, a streamed and progressive evaluation of regular path expressions with xpath-like qualifiers against xml streams. spex proceeds as follows. an expression is translated in linear time into a network of transducers, most of the... | navigation- vs. index-based xml multi-query processing xml path queries form the basis of complex filtering of xml data. most current xml path query processing techniques can be divided in two groups. navigation-based algorithms compute results by analyzing an input document one tag at a time. in contrast, index-based ... |
296,733 | 696751 | routing indices for peer-to-peer systems finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or flooding the network with queries. we introduce the concept of routing indices (ris), which allow nodes to forward queries to neighbors that are more likely to have a... | pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems this paper presents the design and evaluation of pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications. pastry performs application-level routing and object locatio... |
171,860 | 214743326 | generalized video deblurring for dynamic scenes several state-of-the-art video deblurring methods are based on a strong assumption that the captured scenes are static. these methods fail to deblur blurry videos in dynamic scenes. we propose a video deblurring method to deal with general blurs inherent in dynamic scenes... | single image deblurring and camera motion estimation with depth map camera shake during exposure is a major problem in hand-held photography, as it causes image blur that destroys details in the captured images.~in the real world, such blur is mainly caused by both the camera motion and the complex scene structure.~whi... |
107,897 | 16371089 | assigning function tags to parsed text it is generally recognized that the common nonterminal labels for syntactic constituents (np, vp, etc.) do not exhaust the syntactic and semantic information one would like about parts of a syntactic tree. for example, the penn tree-bank gives each constituent zero or more 'functi... | semantic role labeling via framenet, verbnet and propbank this article describes a robust semantic parser that uses a broad knowledge base created by interconnecting three major resources: framenet, verbnet and propbank. the framenet corpus contains the examples annotated with semantic roles whereas the verbnet lexicon... |
274,736 | 212747537 | image-to-image translation with conditional adversarial networks we investigate conditional adversarial networks as a general-purpose solution to image-to-image translation problems. these networks not only learn the mapping from input image to output image, but also learn a loss function to train this mapping. this ma... | instance-level facial attributes transfer with geometry-aware flow we address the problem of instance-level facial attribute transfer without paired training data, e.g., faithfully transferring the exact mustache from a source face to a target face. this is a more challenging task than the conventional semantic-level a... |
241,195 | 5958321 | relational cloud: a database service for the cloud this paper introduces a new transactional “database-as-a-service” (dbaas) called relational cloud. a dbaas promises to move much of the operational burden of provisioning, configuration, scaling, performance tuning, backup, privacy, and access control from the database... | elastras: an elastic transactional data store in the cloud over the last couple of years, "cloud computing" or "elastic computing" has emerged as a compelling and successful paradigm for internet scale computing. one of the major contributing factors to this success is the elasticity of resources. in spite of the elast... |
225,962 | 126819 | discriminative and consistent similarities in instance-level multiple instance learning in this paper we present a bottom-up method to instance-level multiple instance learning (mil) that learns to discover positive instances with globally constrained reasoning about local pairwise similarities. we discover positive in... | discovering states and transformations in image collections objects in visual scenes come in a rich variety of transformed states. a few classes of transformation have been heavily studied in computer vision: mostly simple, parametric changes in color and geometry. however, transformations in the physical world occur i... |
273,175 | 4461350 | a unified framework for multi-target tracking and collective activity recognition we present a coherent, discriminative framework for simultaneously tracking multiple people and estimating their collective activities. instead of treating the two problems separately, our model is grounded in the intuition that a strong ... | everybody needs somebody: modeling social and grouping behavior on a linear programming multiple people tracker multiple people tracking consists in detecting the subjects at each frame and matching these detections to obtain full trajectories. in semi-crowded environments, pedestrians often occlude each other, making ... |
189,528 | 14644747 | playing devil's advocate: inferring sensitive information from anonymized network traces encouraging the release of network data is central to promoting sound network research practices, though the publication of this data can leak sensitive information about the publishing organization. to address this dilemma, severa... | taming the devil: techniques for evaluating anonymized network data anonymization plays a key role in enabling the public release of network datasets, and yet there are few, if any, techniques for evaluating the efficacy of network data anonymization techniques with respect to the privacy they afford. in fact, recent w... |
135,142 | 16783881 | automated symbolic reachability analysis; with application to delta-notch signaling automata this paper describes the implementation of predicate abstraction techniques to automatically compute symbolic backward reachable sets of high dimensional piecewise affine hybrid automata, used to model delta-notch biological ce... | hybrid automata in systems biology: how far can we go? we consider the reachability problem on semi-algebraic hybrid automata. in particular, we deal with the effective cost that has to be afforded to solve reachability through first-order satisfiability. the analysis we perform with some existing tools shows that even... |
156,243 | 11887021 | core algorithms of the maui scheduler the maui scheduler has received wide acceptance in the hpc community as a highly configurable and effective batch scheduler. it is currently in use on hundreds of sp, o2k, and linux cluster systems throughout the world including a high percentage of the largest and most cutting edg... | selective reservation strategies for backfill job scheduling although there is wide agreement that backfilling produces significant benefits in scheduling of parallel jobs, there is no clear consensus on which backfilling strategy is preferable - should conservative backfilling be used or the more aggressive easy backf... |
90,031 | 45837784 | distributed power-law graph computing: theoretical and empirical analysis with the emergence of big graphs in a variety of real applications like social networks, machine learning based on distributed graph-computing (dgc) frameworks has attracted much attention from big data machine learning community. in dgc framewor... | powergraph: distributed graphparallel computation on natural graphs large-scale graph-structured computation is central to tasks ranging from targeted advertising to natural language processing and has led to the development of several graph-parallel abstractions including pregel and graphlab. however, the natural grap... |
106,293 | 10963487 | adapting web pages for small-screen devices we propose a page-adaptation technique that splits existing web pages into smaller, logically related units. to do this, we must first solve two technical problems: how to detect an existing web page's semantic structure, and how to split a web page into smaller blocks based ... | web page transformation when switching devices with network and small screen device improvements, such as wireless abilities, increased memory and cpu speeds, users are no longer limited by location when accessing on-line information. we are interested in studying the effect of users switching from a large screen devic... |
165,448 | 1351033 | determinacy in static analysis for jquery static analysis for javascript can potentially help programmers find errors early during development. although much progress has been made on analysis techniques, a major obstacle is the prevalence of libraries, in particular jquery, which apply programming patterns that have d... | modeling the html dom and browser api in static analysis of javascript web applications developers of javascript web applications have little tool support for catching errors early in development. in comparison, an abundance of tools exist for statically typed languages, including sophisticated integrated development e... |
4,483 | 204928360 | self-adaptive software: landscape and research challenges software systems dealing with distributed applications in changing environments normally require human supervision to continue operation in all conditions. these (re-)configuring, troubleshooting, and in general maintenance tasks lead to costly and time-consumin... | forms: unifying reference model for formal specification of distributed self-adaptive systems the challenges of pervasive and mobile computing environments, which are highly dynamic and unpredictable, have motivated the development of self-adaptive software systems. although noteworthy successes have been achieved on m... |
284,659 | 41412954 | fusion of multimodal visual cues for model-based object tracking while many robotic applications rely on visual tracking, conventional single-cue algorithms typically fail outside limited tracking conditions. fusion of multimodal visual cues with complementary failure modes allows tracking to continue despite losing in... | supervised segmentation and tracking of nonrigid objects using a "mixture of histograms" model segmentation and tracking of objects in video sequences is important for a number of applications. in the supervised variant, segmentation can be achieved by modelling the probability density of image observations taken from ... |
149,458 | 209324438 | decidenet: counting varying density crowds through attention guided detection and density estimation in real-world crowd counting applications, the crowd densities vary greatly in spatial and temporal domains. a detection based counting method will estimate crowds accurately in low density scenes, while its reliability... | crowd counting using scale-aware attention networks in this paper, we consider the problem of crowd counting in images. given an image of a crowded scene, our goal is to estimate the density map of this image, where each pixel value in the density map corresponds to the crowd density at the corresponding location in th... |
77,304 | 207685325 | rethinking virtual network embedding: substrate support for path splitting and migration network virtualization is a powerful way to run multiple architectures or experiments simultaneously on a shared infrastructure. however, making efficient use of the underlying resources requires effective techniques for virtual ne... | vroom: virtual routers on the move network management is the proverbial “elephant in the room”—the pressing problem we all know is plaguing the internet, yet seems intractable to solve. each new management challenge leads to a new point solution, such as a new configuration script, measurement tool, or protocol extensi... |
160,390 | 7383105 | pda: privacy-preserving data aggregation in wireless sensor networks providing efficient data aggregation while preserving data privacy is a challenging problem in wireless sensor networks research. in this paper, we present two privacy-preserving data aggregation schemes for additive aggregation functions. the first s... | privacy preservation for data cubes data privacy refers to the issue of how to preserve the confidential information in individual data cells while still being able to provide an accurate estimation of the original summation values for range queries. there are three major goals in data privacy:l)security - the data mus... |
223,917 | 69164 | automatic certification of heap consumption we present a program logic for verifying the heap consumption of low-level programs. the proof rules employ a uniform assertion format and have been derived from a general purpose program logic [1]. in a proof-carrying code scenario, the inference of invariants is delegated t... | a certified lightweight non-interference java bytecode verifier non-interference guarantees the absence of illicit information flow throughout program execution. it can be enforced by appropriate information flow type systems. much of the previous work on type systems for non-interference has focused on calculi or high... |
249,359 | 43365537 | correctness-preserving configuration of business process models reference process models capture recurrent business operations in a given domain such as procurement or logistics. these models are intended to be configured to fit the requirements of specific organizations or projects, leading to individualized process m... | an algebra of product families experience from recent years has shown that it is often advantageous not to build a single product but rather a family of similar products that share at least one common functionality while having well-identified variabilities. such product families are built from elementary features that... |
131,623 | 45612594 | a taxonomy of computer program security flaws, with examples abstract : an organized record of actual flaws can be useful to designers, implementors, and evaluators of computer systems. this paper provides a taxonomy for computer program security flaws together with an appendix that carefully documents 50 actual securi... | a taxonomy of network and computer attacks attacks over the years have become both increasingly numerous and sophisticated. this paper focuses on the provisioning of a method for the analysis and categorisation of both computer and network attacks, thus providing assistance in combating new attacks, improving computer ... |
297,640 | 71147828 | ibm memory expansion technology (mxt) several technologies are leveraged to establish an architecture for a low-cost, high-performance memory controller and memory system that more than double the effective size of the installed main memory without significant added cost. this architecture is the first of its kind to e... | buri: scaling big-memory computing with hardware-based memory expansion motivated by the challenges of scaling up memory capacity and fully exploiting the benefits of memory compression, we propose buri, a hardware-based memory compression scheme, which simultaneously achieves cost efficiency, high performance, and eas... |
42,182 | 7445864 | an efficient parallel heap compaction algorithm we propose a heap compaction algorithm appropriate for modern computing environments. our algorithm is targeted at smp platforms. it demonstrates high scalability when running in parallel but is also extremely efficient when running single-threaded on a uniprocessor. inst... | the compressor: concurrent, incremental, and parallel compaction the widely used mark-and-sweep garbage collector has a drawback in that it does not move objects during collection. as a result, large long-running realistic applications, such as web application servers, frequently face the fragmentation problem. to elim... |
187,596 | 213671504 | expediting analytical databases with columnar approach the approaches and discussions given in this paper offer applicable solutions for a number of scenarios taking place in the contemporary world that are dealing with performance issues in development and use of analytical databases for the support of both tactical a... | the implications of big data analytics on business intelligence: a qualitative study in china abstract social media has brought about a revolution and dictated a paradigm shift in the operational strategies of firms globally. it has resulted in collection of massive data from a variety of social media channels, necessi... |
62,679 | 12373062 | real-time human pose recognition in parts from single depth images we propose a new method to quickly and accurately predict 3d positions of body joints from a single depth image, using no temporal information. we take an object recognition approach, designing an intermediate body parts representation that maps the dif... | shape, albedo, and illumination from a single image of an unknown object we address the problem of recovering shape, albedo, and illumination from a single grayscale image of an object, using shading as our primary cue. because this problem is fundamentally underconstrained, we construct statistical models of albedo an... |
297,955 | 8021941 | these aren't the droids you're looking for: retrofitting android to protect data from imperious applications we examine two privacy controls for android smartphones that empower users to run permission-hungry applications while protecting private data from being exfiltrated: (1) covertly substituting shadow data in pla... | preventing location-based identity inference in anonymous spatial queries the increasing trend of embedding positioning capabilities (for example, gps) in mobile devices facilitates the widespread use of location-based services. for such applications to succeed, privacy and confidentiality are essential. existing priva... |
295,146 | 18492550 | semeval-2007 task 08: metonymy resolution at semeval-2007 we provide an overview of the metonymy resolution shared task organised within semeval-2007. we describe the problem, the data provided to participants, and the evaluation measures we used to assess performance. we also give an overview of the systems that have ... | graph based semi-supervised approach for information extraction classification techniques deploy supervised labeled instances to train classifiers for various classification problems. however labeled instances are limited, expensive, and time consuming to obtain, due to the need of experienced human annotators. meanwhi... |
214,772 | 11880964 | vacuum packing: extracting hardware-detected program phases for post-link optimization this paper presents vacuum packing, a new approach to profile-based program optimization. instead of using traditional aggregate or summarized execution profile weights, this approach uses a transparent hardware profiler to automatic... | detecting change in program behavior for adaptive optimization feedback information has proven useful in guiding optimizations in compilers and post-link optimizers. program performance behavior can change over time and may invalidate the feedback information. low overhead monitoring can be used to detect such changes,... |
243,272 | 31296069 | simplification and optimization of i-vector extraction this paper introduces some simplifications to the i-vector speaker recognition systems. i-vector extraction as well as training of the i-vector extractor can be an expensive task both in terms of memory and speed. under certain assumptions, the formulas for i-vecto... | factorized sub-space estimation for fast and memory effective i-vector extraction most of the state-of-the-art speaker recognition systems use a compact representation of spoken utterances referred to as i-vector. since the “standard” i-vector extraction procedure requires large memory structures and is relatively slow... |
163,756 | 212725163 | atlasnet: a papier-mâché approach to learning 3d surface generation we introduce a method for learning to generate the surface of 3d shapes. our approach represents a 3d shape as a collection of parametric surface elements and, in contrast to methods generating voxel grids or point clouds, naturally infers a surface re... | deformable shape completion with graph convolutional autoencoders the availability of affordable and portable depth sensors has made scanning objects and people simpler than ever. however, dealing with occlusions and missing parts is still a significant challenge. the problem of reconstructing a (possibly non-rigidly m... |
207,817 | 53995952 | multi-objective test prioritization in software product line testing: an industrial case study test prioritization is crucial for testing products in a product line considering limited budget in terms of available time and resources. in general, it is not practically feasible to execute all the possible test cases and ... | enhancing test case prioritization in an industrial setting with resource awareness and multi-objective search test case prioritization is an essential part of test execution systems for large organizations developing software systems in the context that their software versions are released very frequently. they must b... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.