Works Published in 2015
Displaying works 61 - 80 of 299 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2015 chapter
Understanding Co-run Degradations on Integrated Heterogeneous Processors
In Languages and Compilers for Parallel Computing (pp. 82–97).
author keywords: Heterogeneous architecture; Performance analysis; CPU and memory contention; Optimization; GPGPU
TL;DR:
Co-runs of independent applications on systems with heterogeneous processors are common and limited understanding on the influence of co-runners on such systems is limited.
(via Semantic Scholar)
Source: Crossref
Added: September 4, 2020
2015 journal article
Special Issue: Selected Papers from the Sixth International IEEE Conference on Advanced Networks and Telecommunication Systems (IEEE ANTS 2012)
Optical Switching and Networking, 18, 151–152.
Sources: Crossref, NC State University Libraries
Added: September 4, 2020
2015 conference paper
Augmenting introductory Computer Science Classes with GameMaker and Mobile Apps
Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 709–709.
TL;DR:
This workshop introduces free software and curricula to enable novice high school and college students in a first computing course to learn basic game and mobile phone development and discusses how these activities facilitate teaching highSchool and non-major (CS0) course topics, but they can also be used to illustrate more advanced topics.
(via Semantic Scholar)
Source: ORCID
Added: May 6, 2020
2015 conference paper
BOTS: Selecting Next-Steps from Player Traces in a Puzzle Game.
EDM (Workshops), 1446. http://www.scopus.com/inward/record.url?eid=2-s2.0-84944339515&partnerID=MN8TOARS
Contributors: D. Hicks, Y. Dong, R. Zhi, V. Cateté & T. Barnes
Source: ORCID
Added: May 6, 2020
2015 journal article
Keep Your Promise: Mechanism Design Against Free-Riding and False-Reporting in Crowdsourcing
IEEE Internet of Things Journal.
author keywords: Crowdsourcing; false-reporting; free-riding; game theory; incentive mechanisms
TL;DR:
This paper designs and proves that DFF is semi-truthful, which discourages dishonest behavior such as free-riding and false-reporting when the rest of the individuals are honest, while guaranteeing transaction-wise budget-balance and computational efficiency.
(via Semantic Scholar)
Source: ORCID
Added: March 29, 2020
2015 conference paper
Truthful incentive mechanisms for crowdsourcing
2015 IEEE Conference on Computer Communications (INFOCOM).
TL;DR:
This work designs an incentive mechanism for each of the three models of crowdsourcing, and proves that these incentive mechanisms are individually rational, budget-balanced, computationally efficient, and truthful.
(via Semantic Scholar)
Source: ORCID
Added: March 29, 2020
2015 magazine article
Network function virtualization in the multi-tenant cloud
(2015, May). IEEE Network.
TL;DR:
Opportunities and challenges that network function virtualization brings to the multi-tenant cloud are discussed and a cloud architecture that exploits virtual network functions is proposed that exploitsvirtual network functions.
(via Semantic Scholar)
Source: ORCID
Added: March 29, 2020
2015 conference paper
Towards Min-Cost Virtual Infrastructure Embedding
2015 IEEE Global Communications Conference (GLOBECOM).
author keywords: Cloud resource allocation; data center virtualization; virtual infrastructure embedding
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(OpenAlex)
Source: ORCID
Added: March 29, 2020
2015 conference paper
TSA: A framework of truthful spectrum auctions under the physical interference model
2015 IEEE International Conference on Communications (ICC).
TL;DR:
A framework of truthful double auctions, named TSA, is designed for spectrum sharing in cognitive radio networks and it is proved that TSA guarantees all the desired economic properties: individual rationality, budget-balance, computational efficiency, and truthfulness.
(via Semantic Scholar)
Source: ORCID
Added: March 29, 2020
2015 conference paper
A Sybil-Proof and Time-Sensitive Incentive Tree Mechanism for Crowdsourcing
2015 IEEE Global Communications Conference (GLOBECOM).
author keywords: Crowdsourcing; Submodular Contribution; Time-sensitivity; Sybil-proofness
Source: ORCID
Added: March 29, 2020
2015 chapter
Round-Optimal Black-Box Two-Party Computation
In Lecture Notes in Computer Science (pp. 339–358).
TL;DR:
Katz and Ostrovsky prove that 5 rounds are necessary for secure two-party protocols (4-round are sufficient if only one party receives the output) and provide a protocol that matches such lower bound.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: Crossref
Added: February 24, 2020
2015 chapter
Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
In Theory of Cryptography (pp. 345–374).
TL;DR:
In their work it is shown that resettably-sound ZK arguments require nonblack- box simulation techniques, and the first construction based on the breakthrough simulation technique of Barak is provided.
(via Semantic Scholar)
link.springer.com (publisher PDF)
Source: Crossref
Added: February 24, 2020
2015 journal article
Fixing, preventing, and recovering from concurrency bugs
Science China Information Sciences, 58(5), 1–18.
author keywords: concurrency bugs; bug detection; production run; performance counters
TL;DR:
Recent progresses on fixing, preventing, and recovering from concurrency bugs are discussed.
(via Semantic Scholar)
Source: Crossref
Added: February 24, 2020
2015 journal article
Reduced-Item Food Audits Based on the Nutrition Environment Measures Surveys
American Journal of Preventive Medicine, 49(4), e23–e33.
MeSH headings : California; Cities / statistics & numerical data; Environment; Food / statistics & numerical data; Food Supply / statistics & numerical data; Machine Learning; Nutrition Surveys; Residence Characteristics / statistics & numerical data; Restaurants / statistics & numerical data; Washington; West Virginia
TL;DR:
Reduced-item audit tools can reduce the burden and complexity of large-scale or repeated assessments of the retail food environment without compromising measurement quality.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
2. Zero Hunger
(OpenAlex)
Sources: Crossref, NC State University Libraries
Added: February 24, 2020
2015 journal article
Guest editorial: special multi-issue on selected topics in automated software engineering
Automated Software Engineering, 22(4), 437–438.
Sources: Crossref, NC State University Libraries
Added: February 24, 2020
2015 chapter
Detecting Opinion Spammer Groups Through Community Discovery and Sentiment Analysis
In Data and Applications Security and Privacy XXIX (pp. 170–187).
author keywords: Opinion spammer groups; Sentiment analysis; Community discovery
TL;DR:
The results show that the approach is comparable to the existing state-of-art content-based classifier, meaning that this approach can identify spammer groups reliably even if spammers alter their contents.
(via Semantic Scholar)
Source: Crossref
Added: February 24, 2020
2015 chapter
Response-Guided Community Detection: Application to Climate Index Discovery
In Machine Learning and Knowledge Discovery in Databases (pp. 736–751).
author keywords: Community detection; Spatiotemporal data; Climate index discovery; Seasonal rainfall prediction
TL;DR:
This work proposes a general strategy for response-guided community detection that explicitly incorporates information of the response variable during the community detection process, and introduces a graph representation of spatiotemporal data that leverages information from multiple variables.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
13. Climate Action
(OpenAlex)
Source: Crossref
Added: February 24, 2020
2015 chapter
Revisiting Computational Models of Creative Storytelling Based on Imaginative Recall
In Interactive Storytelling (Vol. 9445, pp. 170–178).
Contributors: S. Harmon * & A. Jhala*
author keywords: Case-based reasoning; Computational creativity; Story generation
TL;DR:
The connection between knowledge structures and story predictability is revisited, and Minstrel’s use of knowledge structures versus the use of Story Intention Graphs (SIGs) as the underlying case frames are compared.
(via Semantic Scholar)
Sources: Crossref, ORCID, NC State University Libraries
Added: February 24, 2020
2015 chapter
Remember That Time? Telling Interesting Stories from Past Interactions
In Interactive Storytelling (Vol. 9445, pp. 93–104).
Contributors: M. Behrooz*, R. Swanson* & A. Jhala*
author keywords: Social interaction; Storytelling; Story generation; Human-robot interaction; Narrative content selection
TL;DR:
The design, development and preliminary evaluation of a generic computational architecture for finding and retelling interesting event sequences in a corpus of prior interactions are proposed and initial evaluation of interactions selected for retelling are encouraging.
(via Semantic Scholar)
Sources: Crossref, ORCID, NC State University Libraries
Added: February 24, 2020
2015 journal article
An entropy-based persistence barcode
Pattern Recognition, 48(2), 391–401.
author keywords: Persistent homology; Persistence barcodes; Hasse diagram; Simplicial complexes; Entropy; Filtration; Filter
TL;DR:
The notion of "minimal" barcodes in terms of entropy is defined, by way of computation, and subsequent modification, of maximum matchings on subgraphs of the Hasse diagram associated to K.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science)
Source: Crossref
Added: February 24, 2020
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
