title
string | paper_id
int64 | abstract
string | authors
list | year
float64 | arxiv_id
string | acl_id
string | pmc_id
string | pubmed_id
string | doi
string | venue
string | journal
string | mag_id
string | outbound_citations
sequence | inbound_citations
sequence | has_outbound_citations
bool | has_inbound_citations
bool | has_pdf_parse
bool | s2_url
string | has_pdf_body_text
float64 | has_pdf_parsed_abstract
float64 | has_pdf_parsed_body_text
float64 | has_pdf_parsed_bib_entries
float64 | has_pdf_parsed_ref_entries
float64 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Relational queries in a domain based DBMS | 15,589,315 | This paper addresses the problem of relational queries processing in the domain based database machine DBMAC. A brief description of the storage organisation of the domain based DBMS is first given. Then the operating principles of the domain based data-model, called D-model, is described through some examples. The central part of the paper deals with the translation of relational queries into operations on objects of the D-model. Objects of the D-model and a set of operations on these objects are first defined : this set S of operations is shown to be complete in that any relational query can be translated into D-model operations belonging to S.Finally we give a method for processing relation queries using D-model operations.The basic advantages to be expected from a domain based physical organization of data are :1. fast equi-join execution,2. a compact representation of intermediate results.The latter should lead to efficient processing of complex queries, provided a powerful parallel physical architecture is chosen for implementation. | [
{
"first": "M.",
"middle": [],
"last": "Missikoff",
"suffix": ""
},
{
"first": "M.",
"middle": [],
"last": "Scholl",
"suffix": ""
}
] | 1,983 | 10.1145/582192.582227 | SIGMOD '83 | 1965659121 | [
"8599374",
"13260747",
"195703408",
"7529460",
"60073764"
] | [
"1314526",
"56414939",
"7709353",
"16318361"
] | true | true | true | https://api.semanticscholar.org/CorpusID:15589315 | 0 | 0 | 0 | 1 | 0 |
|||||
Gamification in Science: A Study of Requirements in the Context of Reproducible Research | 70,349,995 | The need for data preservation and reproducible research is widely recognized in the scientific community. Yet, researchers often struggle to find the motivation to contribute to data repositories and to use tools that foster reproducibility. In this paper, we explore possible uses of gamification to support reproducible practices in High Energy Physics. To understand how gamification can be effective in research tools, we participated in a workshop and performed interviews with data analysts. We then designed two interactive prototypes of a research preservation service that use contrasting gamification strategies. The evaluation of the prototypes showed that gamification needs to address core scientific challenges, in particular the fair reflection of quality and individual contribution. Through thematic analysis, we identified four themes which describe perceptions and requirements of gamification in research: Contribution, Metrics, Applications and Scientific practice. Based on these, we discuss design implications for gamification in science. | [
{
"first": "Sebastian",
"middle": [
"S."
],
"last": "Feger",
"suffix": ""
},
{
"first": "Sunje",
"middle": [],
"last": "Dallmeier-Tiessen",
"suffix": ""
},
{
"first": "Pawel",
"middle": [
"W."
],
"last": "Wo'zniak",
"suffix": ""
},
{
"first": "Albrecht",
"middle": [],
"last": "Schmidt",
"suffix": ""
}
] | 2,019 | 1903.02446 | 10.1145/3290605.3300690 | CHI '19 | 2924589649 | [
"16783450",
"4326966",
"16985339",
"60735970",
"2395878",
"108854744",
"33042719",
"3116148",
"114252783",
"154281410",
"31565437",
"12511378",
"202670688",
"8115805",
"12777403",
"4766260",
"34294933",
"205054510",
"12657531",
"5050428",
"5061633",
"3319179",
"42296152",
"201141079",
"18718751",
"6010318",
"107269344",
"202022924"
] | [
"211008587",
"211068840",
"204960852"
] | true | true | true | https://api.semanticscholar.org/CorpusID:70349995 | 1 | 1 | 1 | 1 | 1 |
||||
Time-dependent event hierarchy construction | 18,854,895 | In this paper, an algorithm called Time Driven Documents-partition (TDD) is proposed to construct an event hierarchy in a text corpus based on a given query. Specifically, assume that a query contains only one feature - Election. Election is directly related to the events such as 2006 US Midterm Elections Campaign, 2004 US Presidential Election Campaign and 2004 Taiwan Presidential Election Campaign, where these events may further be divided into several smaller events (e.g. the 2006 US Midterm Elections Campaign can be broken down into events such as campaign for vote, election results and the resignation of Donald H. Rumsfeld). As such, an event hierarchy is resulted. Our proposed algorithm, TDD, tackles the problem by three major steps: (1)Identify the features that are related to the query according to both the timestamps and the contents of the documents. The features identified are regarded as bursty features; (2) Extract the documents that are highly related to the bursty features based on time; (3) Partition the extracted documents to form events and organize them in a hierarchicalstructure. To the best of our knowledge, there is little works targeting for constructing a feature-based event hierarchy for a text corpus. Practically, event hierarchies can assist us to efficiently locate our target information in a text corpus easily. Again, assume that Election is used for a query. Without an event hierarchy, it is very difficult to identify what are the major events related to it, when do these events happened, as well as the features and the news articles that are related to each of these events. We have archived two-year news articles to evaluate the feasibility of TDD. The encouraging results indicated that TDD is practically sound and highly effective. | [
{
"first": "Gabriel",
"middle": [
"Pui",
"Cheong"
],
"last": "Fung",
"suffix": ""
},
{
"first": "Jeffrey",
"middle": [
"Xu"
],
"last": "Yu",
"suffix": ""
},
{
"first": "Huan",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Philip",
"middle": [
"S."
],
"last": "Yu",
"suffix": ""
}
] | 2,007 | 10.1145/1281192.1281227 | KDD '07 | 2054917960 | [
"262996",
"7079167",
"3420296",
"2570492",
"15539653",
"5347955",
"45699093",
"306293",
"56072705",
"16628689",
"2408239",
"7906469",
"207160148",
"31171792",
"16618926",
"14609310",
"1175919",
"7108307",
"17637032",
"3091",
"1432381",
"5637696",
"12808608",
"14262926",
"14371811",
"5833703",
"6206709",
"17503448",
"449999",
"6002635",
"2296433"
] | [
"15929395",
"1324416",
"18461262",
"15920630",
"27122022",
"18323089",
"14808195",
"32061222",
"9769074",
"7825553",
"2752492",
"1823590",
"17296180",
"1003702",
"54702182",
"32467928",
"204184444",
"17777363",
"8789683",
"16214211",
"2001252",
"6955925",
"18327466",
"42220",
"14809985",
"210930847",
"26414182",
"52848412",
"13118989",
"3435448",
"34705462",
"17015920",
"12517763",
"16658793",
"16658793",
"7139529",
"18222392",
"32738670",
"14850784",
"5620293",
"6691772",
"9347437",
"47373654",
"9712581",
"8003259",
"15663086",
"3236594"
] | true | true | true | https://api.semanticscholar.org/CorpusID:18854895 | 0 | 0 | 0 | 1 | 0 |
|||||
Sorting out sorting through concretization with robotics | 33,946,314 | We describe a novel approach to algorithms concretization that extends the current mode of software visualization from computer screens to the real world. The method combines hands-on robotics and traditional algorithm visualization techniques to help diverse learners comprehend the basic idea of the given algorithm. From this point of view the robots interpret an algorithm while their internal program and external appearance determine the role they have in it. This gives us the possibility to bring algorithms into the real physical world where students can even touch the data structures during the execution. In the first version, we have concentrated on a few sorting algorithms as a proof-of-concept. Moreover, we have carried out an evaluation with 13-to-15-year-old students who used the concretization for gaining insight into one sorting algorithm. The preliminary results indicate that the tool can enhance learning. Now, our aim is to build an environment that supports both visualizations and robotics based concretizations of algorithms at the same time. | [
{
"first": "Javier",
"middle": [],
"last": "Lopez",
"suffix": ""
},
{
"first": "Niko",
"middle": [],
"last": "Myller",
"suffix": ""
},
{
"first": "Erkki",
"middle": [],
"last": "Sutinen",
"suffix": ""
}
] | 2,004 | 10.1145/989863.989929 | AVI | 2077350270 | [] | [
"203561000",
"2094011",
"63470571",
"44345826",
"9056225",
"496182"
] | false | true | false | https://api.semanticscholar.org/CorpusID:33946314 | null | null | null | null | null |
|||||
Driver drowsiness in automated and manual driving: insights from a test track study | 212,114,212 | Driver drowsiness is a major cause of traffic accidents. Automated driving might counteract this problem, but in the lower automation levels, the driver is still responsible as a fallback. The impact of driver drowsiness on automated driving under realistic conditions is, however, currently unknown. This work contributes to risk and hazard assessment with a field study comparing manual to level-2 automated driving. The experiment was conducted on a test track using an instrumented vehicle. Results (N=30) show that in automated driving, driver drowsiness (self-rated with the Karolinska Sleepiness Scale) is significantly higher as compared to manual driving. Age group (20--25, 65--70 years) and driving time have a strong impact on the self-ratings. Additionally, to subjective measures, a correlation was also identified between drowsiness and heart rate data. The gained knowledge can be useful for the development of drowsiness detection systems and dynamic configuration of driver-vehicle interfaces based on user state. | [
{
"first": "Thomas",
"middle": [],
"last": "Kundinger",
"suffix": ""
},
{
"first": "Andreas",
"middle": [],
"last": "Riener",
"suffix": ""
},
{
"first": "Nikoletta",
"middle": [],
"last": "Sofra",
"suffix": ""
},
{
"first": "Klemens",
"middle": [],
"last": "Weigl",
"suffix": ""
}
] | 2,020 | 10.1145/3377325.3377506 | Proceedings of the 25th International Conference on Intelligent User Interfaces | 3009672000 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:212114212 | null | null | null | null | null |
|||||
Erratum to: Editorial | 7,483,378 | [
{
"first": "Hans",
"middle": [
"L."
],
"last": "Bodlaender",
"suffix": ""
},
{
"first": "Mohammad",
"middle": [
"Taghi"
],
"last": "Hajiaghayi",
"suffix": ""
},
{
"first": "Giuseppe",
"middle": [
"F."
],
"last": "Italiano",
"suffix": ""
}
] | 2,015 | 10.1007/s00453-015-0091-x | Algorithmica | Algorithmica | 2284433213 | [] | [] | false | false | true | https://api.semanticscholar.org/CorpusID:7483378 | 0 | 0 | 0 | 0 | 0 |
|||||
Inexact field learning: an approach to induce high quality rules from low quality data | 8,918,399 | To avoid low quality problems caused by low quality data, the paper introduces an inexact field learning approach which derives rules by working on the fields of attributes with respect to classes, rather than on individual point values of attributes. The experimental results show that field learning achieved a higher prediction accuracy rate on new unseen test cases which is particularly true when the learning is performed on large low quality data. | [
{
"first": "Honghua",
"middle": [],
"last": "Dai",
"suffix": ""
},
{
"first": "Xiaoshu",
"middle": [],
"last": "Hang",
"suffix": ""
},
{
"first": "Gang",
"middle": [],
"last": "Li",
"suffix": ""
}
] | 2,001 | 10.1109/ICDM.2001.989571 | Proceedings 2001 IEEE International Conference on Data Mining | Proceedings 2001 IEEE International Conference on Data Mining | 2140870161 | [
"57043060"
] | [
"15800281"
] | true | true | true | https://api.semanticscholar.org/CorpusID:8918399 | 0 | 0 | 0 | 1 | 0 |
||||
Searchable Objects: Search in Everyday Conversation | 32,660,425 | This paper examines mobile internet search, presenting search not as a process of information retrieval, but as part of conversation and talk. Through video extracts of mobile search we explore how mobile phones are interwoven into talk, and how searchers manage the participation of other conversationalists alongside the search itself. We introduce the notion of a 'searchable object' -- an object that arises in conversation that can be searched for online -- and document how such an object occasions a search. In turn we discuss the differing roles of the device 'driver' and 'passenger', and how participation is managed through questions and narration. Rather than search being solely about getting correct information, conversations around search may be just as important. We conclude by critiquing some of the pessimistic views of interaction around mobile phones and their use in ordinary life and talk. | [
{
"first": "Barry",
"middle": [],
"last": "Brown",
"suffix": ""
},
{
"first": "Moira",
"middle": [],
"last": "McGregor",
"suffix": ""
},
{
"first": "Donald",
"middle": [],
"last": "McMillan",
"suffix": ""
}
] | 2,015 | 10.1145/2675133.2675206 | CSCW '15 | 2157740698 | [
"11527287",
"6254574",
"14609980",
"15733611",
"20485651",
"147110983",
"146265283",
"17014959",
"2343006",
"143191838",
"9854331",
"21106614",
"145126859",
"145203012"
] | [
"49540329",
"47018870",
"63567064",
"24973803",
"53124106",
"10140753",
"2064033",
"24208612",
"26593868",
"14216676",
"33937167",
"53225176",
"19036589",
"3051155",
"5046689",
"5060947",
"32428664",
"10255246",
"148592319",
"18810611"
] | true | true | true | https://api.semanticscholar.org/CorpusID:32660425 | 0 | 0 | 0 | 1 | 0 |
|||||
Continuous Query Processing in Data Streams Using Duality of Data and Queries | 64,084,045 | In this paper, we deal with a method of efficiently processing continuous queries in a data stream environment. We classify previous query processing methods into two dual categories - data-initiative and query-initiative - depending on whether query processing is initiated by selecting a data element or a query. This classification stems from the fact that data and queries have been treated asymmetrically. For processing continuous queries, only data-initiative methods have traditionally been employed, and thus, the performance gain that could be obtained by query-initiative methods has been overlooked. To solve this problem, we focus on an observation that data and queries can be treated symmetrically. In this paper, we propose the duality model of data and queries and, based on this model, present a new viewpoint of transforming the continuous query processing problem to a multi-dimensional spatial join problem. We also present a continuous query processing algorithm based on spatial join, named Spatial Join CQ. Spatial Join CQ processes continuous queries by finding the pairs of overlapping regions from a set of data elements and a set of queries defined as regions in the multi-dimensional space. The algorithm achieves the effects of both of the two dual methods by using the spatial join, which is a symmetric operation. Experimental results show that the proposed algorithm outperforms earlier methods by up to 36 times for simple selection continuous queries and by up to 7 times for sliding window join continuous queries. | [
{
"first": "Lim",
"middle": [],
"last": "Hyo-Sang",
"suffix": ""
},
{
"first": "Lee",
"middle": [],
"last": "Jae-Gil",
"suffix": ""
},
{
"first": "Lee",
"middle": [],
"last": "Min-Jae",
"suffix": ""
},
{
"first": "Whang",
"middle": [],
"last": "Kyu-Young",
"suffix": ""
}
] | 2,006 | Journal of KIISE:Databases | 2397349972 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:64084045 | null | null | null | null | null |
||||||
Effects of Induced Affective States on Decisions under Risk with Mixed Domain Problems. | 203,619,597 | [
{
"first": "Rui",
"middle": [],
"last": "Gong",
"suffix": ""
},
{
"first": "James",
"middle": [
"E."
],
"last": "Corter",
"suffix": ""
}
] | 2,019 | CogSci | 2977438743 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:203619597 | null | null | null | null | null |
|||||||
Debugging user interface descriptions of knowledge-based recommender applications | 14,153,616 | The complexity of product assortments offered by e-Commerce platforms requires intelligent sales assistance systems alleviating the retrieval of solutions fitting to the wishes and needs of a customer. Knowledge-based recommender applications meet these requirements by allowing the calculation of personalized solutions based on an explicit representation of product, marketing and sales knowledge stored in an underlying recommender knowledge base. Unfortunately, in many cases faulty models of recommender user interfaces are defined by knowledge engineers and no automated support for debugging such process designs is available. This paper presents an approach to automated debugging of faulty process designs of knowledge-based recommenders which increases the productivity of user interface development and maintenance. The approach has been implemented for a knowledge-based recommender environment within the scope of the Koba4MS project. | [
{
"first": "Alexander",
"middle": [],
"last": "Felfernig",
"suffix": ""
},
{
"first": "Kostyantyn",
"middle": [],
"last": "Shchekotykhin",
"suffix": ""
}
] | 2,006 | 10.1145/1111449.1111499 | IUI '06 | 1978154443 | [
"52863289",
"19614653",
"2055607",
"1121171",
"61100057",
"917398",
"12919990",
"207731647",
"31901407",
"171162",
"9705527",
"2616594",
"1488582",
"17286440",
"214764334",
"11089320",
"17878769"
] | [
"8306797",
"15062352",
"798965",
"8561603",
"16555103",
"3165936",
"58945607",
"14248898",
"18781201",
"1216902",
"1216902",
"31544064",
"14875193",
"15206064",
"2521107",
"65293395",
"10837070",
"16344032",
"15412611"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14153616 | 0 | 0 | 0 | 1 | 0 |
|||||
Measuring Abstract Mindsets through Syntax: Improvements in Automating the Linguistic Category Model. | 31,832,284 | [
{
"first": "Kate",
"middle": [
"M."
],
"last": "Johnson",
"suffix": ""
},
{
"first": "Reihane",
"middle": [],
"last": "Boghrati",
"suffix": ""
},
{
"first": "Cheryl",
"middle": [
"J."
],
"last": "Wakslak",
"suffix": ""
},
{
"first": "Morteza",
"middle": [],
"last": "Dehghani",
"suffix": ""
}
] | 2,017 | CogSci | 2787693322 | [] | [] | false | false | true | https://api.semanticscholar.org/CorpusID:31832284 | 0 | 0 | 0 | 0 | 0 |
|||||||
Frame Rate vs Resolution: A Subjective Evaluation of Spatiotemporal Perceived Quality Under Varying Computational Budgets | 13,833,622 | Maximizing performance for rendered content requires making compromises on quality parameters depending on the computational resources available . Yet, it is currently unclear which parameters best maximize perceived quality. This work investigates perceived quality across computational budgets for the primary spatiotemporal parameters of resolution and frame rate. Three experiments are conducted. Experiment 1 (n = 26) shows that participants prefer fixed frame rates of 60 frames per second (fps) at lower resolutions over 30 fps at higher resolutions. Experiment 2 (n = 24) explores the relationship further with more budgets and quality settings and again finds 60 fps is generally preferred even when more resources are available. Experiment 3 (n = 25) permits the use of adaptive frame rates, and analyses the resource allocation across seven budgets. Results show that while participants allocate more resources to frame rate at lower budgets the situation reverses once higher budgets are available and a frame rate of around 40 fps is achieved. In the overall, the results demonstrate a complex relationship between frame rate and resolution's effects on perceived quality. This relationship can be harnessed, via the results and models presented, to obtain more cost-effective virtual experiences. | [
{
"first": "Kurt",
"middle": [],
"last": "Debattista",
"suffix": ""
},
{
"first": "Keith",
"middle": [],
"last": "Bugeja",
"suffix": ""
},
{
"first": "Sandro",
"middle": [],
"last": "Spina",
"suffix": ""
},
{
"first": "Thomas",
"middle": [],
"last": "Bashford-Rogers",
"suffix": ""
},
{
"first": "Vedad",
"middle": [],
"last": "Hulusic",
"suffix": ""
}
] | 2,018 | 10.1111/cgf.13302 | Comput. Graph. Forum | Comput. Graph. Forum | 2759001622 | [
"17701075",
"3715736",
"16257716",
"446874",
"6645457",
"8257618",
"6595992",
"14334142",
"17294223",
"17012396",
"27467754",
"14500525",
"53249586",
"60020253",
"5253259"
] | [
"59235347",
"199116619",
"69702720",
"49560204",
"57759752",
"25088232",
"53238757"
] | true | true | true | https://api.semanticscholar.org/CorpusID:13833622 | 1 | 1 | 1 | 1 | 1 |
||||
When a little knowledge isn't a dangerous thing | 16,784,797 | In this paper we compare two departments of a public administration body carrying out similar work. In one department two sections, telephony and processing, are collocated whereas in the other they are not. We demonstrate the costs of distribution, in particular how the strictly enforced division of labour and limited visibility onto the workflow of the other section causes problems when dealing with normal, natural exceptions. The setting is one of seemingly routine bureaucratic work rather than high-skilled cooperative work, thus the impact of distribution might be considered rather surprising. We argue that a key requirement for any solution is to enable practitioners on the 'shop floor' the freedom to find elegant solutions to problems. | [
{
"first": "Jacki",
"middle": [],
"last": "O'Neill",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Martin",
"suffix": ""
},
{
"first": "Tommaso",
"middle": [],
"last": "Colombino",
"suffix": ""
},
{
"first": "Antonietta",
"middle": [],
"last": "Grasso",
"suffix": ""
}
] | 2,011 | 10.1145/1978942.1979186 | CHI | 2072324196 | [
"1359859",
"5943805",
"13031678",
"54095607",
"167899880",
"11591286",
"30409716",
"18990624",
"41085274",
"62741630"
] | [
"20055290",
"17318502",
"15950195",
"15757537",
"16734020",
"5078284"
] | true | true | true | https://api.semanticscholar.org/CorpusID:16784797 | 0 | 0 | 0 | 1 | 0 |
|||||
Designers' models of the human-computer interface | 14,139,365 | An experiment investigated the organization of declarative knowledge about the human computer interface (HCI). Two groups of experts in user interface design (human factors experts and software experts), and a control group sorted HCI concepts into categories. The data were transformed into measures of dissimilarity and analyzed using (1) hierarchical cluster analysis and (2) Pathfinder, a program that generates network representations of the data. Both expert groups had greater numbers of clusters, more elaborate clusters, and better organized networks than did the controls. The two expert groups differed with respect to the clustering of concepts related to display coding and software. The Pathfinder networks for the two expert groups differed in organization, with human factors experts' networks consisting of highly interrelated subnetworks and software experts networks consisting of central nodes and fewer, less interconnected subnetworks. The networks also differed in the number of concepts linked with such concepts as graphics, natural language, function keys, and speech recognition. The discussion focuses on (1) specific differences in cognitive models between HCI experts and novices and between different types of experts, and (2) the role of cognitive models in HCI design and in communications within a multidisciplinary design team. | [
{
"first": "Douglas",
"middle": [
"J."
],
"last": "Gillan",
"suffix": ""
},
{
"first": "Sarah",
"middle": [
"D."
],
"last": "Breedin",
"suffix": ""
}
] | 1,990 | 10.1145/97243.97315 | CHI '90 | 1991300113 | [
"145590196",
"60686750",
"32735751",
"59078218",
"145787184",
"121455106",
"145836108"
] | [
"56591259",
"17800746",
"14223257"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14139365 | 1 | 1 | 1 | 1 | 1 |
|||||
Online Active Learning with Imbalanced Classes | 9,235,473 | This paper proposes an online algorithm for active learning that switches between different candidate instance selection strategies (ISS) for classification in imbalanced data sets. This is important for two reasons: 1) many real-world problems have imbalanced class distributions and 2) there is no ISS that always outperforms all the other techniques. We first empirically compare the performance of existing techniques on imbalanced data sets and show that different strategies work better on different data sets and some techniques even hurt compared to random selection. We then propose an unsupervised score to track and predict the performance of individual instance selection techniques, allowing us to select an effective technique without using a holdout set and wasting valuable labeled data. This score is used in a simple online learning approach that switches between different ISS at each iteration. The proposed approach performs better than the best individual strategy available to the online algorithm over data sets in this paper and provides a way to build practical and effective active learning system for imbalanced data sets. | [
{
"first": "Zahra",
"middle": [],
"last": "Ferdowsi",
"suffix": ""
},
{
"first": "Rayid",
"middle": [],
"last": "Ghani",
"suffix": ""
},
{
"first": "Raffaella",
"middle": [],
"last": "Settimi",
"suffix": ""
}
] | 2,013 | 10.1109/ICDM.2013.12 | 2013 IEEE 13th International Conference on Data Mining | 2013 IEEE 13th International Conference on Data Mining | 2086184281 | [
"942582",
"13209702",
"1732764",
"961425",
"1716833",
"6909306",
"11610993",
"3349382",
"14133176",
"1438975",
"324600",
"8197231"
] | [
"6061379",
"365903",
"208138954",
"10300709",
"10243990",
"57365050",
"7725087",
"50778133",
"211298716"
] | true | true | true | https://api.semanticscholar.org/CorpusID:9235473 | 0 | 0 | 0 | 1 | 0 |
||||
The Effects of Changing Projection Geometry on Perception of 3D Objects on and Around Tabletops | 1,669,116 | Displaying 3D objects on horizontal displays can cause problems in the way that the virtual scene is presented on the 2D surface; inappropriate choices in how 3D is represented can lead to distorted images and incorrect object interpretations. We present four experiments that test 3D perception. We varied projection geometry in three ways: type of projection (perspective/parallel), separation between the observer's point of view and the projection's center (discrepancy), and the presence of motion parallax (with/without parallax). Projection geometry had strong effects different for each task. Reducing discrepancy is desirable for orientation judgments, but not for object recognition or internal angle judgments. Using a fixed center of projection above the table reduces error and improves accuracy in most tasks. The results have far-reaching implications for the design of 3D views on tables, in particular, for multi-user applications where projections that appear correct for one person will not be perceived correctly by another. | [
{
"first": "Miguel",
"middle": [
"A."
],
"last": "Nacenta",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Hancock",
"suffix": ""
},
{
"first": "Carl",
"middle": [],
"last": "Gutwin",
"suffix": ""
},
{
"first": "Sheelagh",
"middle": [],
"last": "Carpendale",
"suffix": ""
}
] | 2,016 | 10.1145/2845081 | TCHI | 2396014525 | [] | [
"204812021",
"22437475"
] | false | true | false | https://api.semanticscholar.org/CorpusID:1669116 | null | null | null | null | null |
|||||
Making Sense out of Food | 14,407,989 | Making Sense out of Food Brent Kievit-Kylar ([email protected]) Cognitive Science Program, IU Bloomington, IN 47405 USA Yong-Yeol Ahn ([email protected]) School of Informatics and Computing, IU Bloomington, IN 47405 USA Peter M. Todd ([email protected]) Cognitive Science Program, IU Bloomington, IN 47405 USA information (e.g., so-called McRae features that people generate to describe objects—McRae 2005). Similarly, multi-modal information from objective measures of the visual, gustatory, and olfactory modalities along with subjective semantic and featural representations has been shown to have significant cross-modal predictive power (Kievit-Kylar & Jones 2012a,b): Information about an object in one sensory modality can provide significant information on what that object’s representation is in another modality. By combining information about an object across multiple modalities, the prediction of the unknown modality improves further. Unfortunately, collecting objective similarity measures based on physical features in various sensory domains is a difficult and expensive task, requiring specialized equipment for smell, taste, and touch information. Also, the resulting measures computed by collecting this information do not necessarily reflect the same sort of information available to and used by humans when they make their own similarity judgments (e.g., due to nonlinearities of senses as well as potential mismatch between the features that can be detected by humans versus machines). Here we use a novel technique based on a fluency and grouping task to collect subjective similarity information across multiple sensory domains. This data is used to test the hypothesis that, overall, different sensory modalities tend to conserve the same similarity relations among a set of objects, coding overlapping information. At the same time, the unique variance contained in the details of those sensory modalities is critical to understanding the relationships of these objects. To show this, we use cross-modal data we collected about different types of food. The category of food is useful for this exploration because foods are fundamental objects for humans, and people have rich multi-sensory conceptions of various foods in terms of modalities including visual, olfactory, taste, and tactile (we did not include aural). We then compare the subjective representations obtained from people between sensory domains as well as to existing objective data within domains (e.g., comparing how similar people judge the smell between two objects with how much their composition of volatile chemicals overlaps) to assess the extent of shared information across sensory domains for foods. Abstract In this paper we explore the application of a novel data collection scheme for multi-sensory information to the question of whether different sensory domains tend to show similar relations between objects (along with some unique variance). Our analyses—hierarchical clustering, MDS mapping, and other comparisons between sensory domains— support the existence of common representational schemes for food items in the olfactory, taste, visual, and tactile domains. We further show that the similarity within different sensory domains is a predictor for Rosch (1975) typicality measures. We also use the relative importance of sensory domains to predict the overall similarity between pairs of words, and compare subjective similarities to objective similarities based on physical sensory properties of the foods, showing a reasonable match. Keywords: Multi-sensory; data collection; typicality. Introduction While humans are primarily visual creatures (Barton 1998, 1995) we rely on all of our senses to function in the real world. If early humans judged whether food had gone bad only from sight without use of smell, they would have had a lower survival rate. The use of multisensory information is ingrained in our world representations so deeply that it is often encountered in pre-conscious tasks such as priming (Pecher 1998). But how much distinctive information do the different sensory domains provide about objects? Are exceptional objects in one sensory domain unexceptional in others, or do the different senses tend to provide largely overlapping information about objects? Addressing these questions and understanding the structure of multimodal sensory representations may provide critical insights for building better semantic space models, understanding language acquisition, and modeling memory phenomena including priming. Here we take an initial step by introducing a crowdsourcing framework for collecting multi-sensory object information, and ways of analyzing it. In previous work, Kievit-Kylar & Jones (2011) showed that carefully collected visual information could be used as a successful predictor for people’s judgments of overall similarity between objects, and that this predictor captured variance different from that supplied by semantic models based on text corpora analysis (e.g., Dumais et al, 1997, Jones et al 2006, Lund and Burgess 1996) and featural | [
{
"first": "Brent",
"middle": [],
"last": "Kievit-Kylar",
"suffix": ""
},
{
"first": "Peter",
"middle": [
"M."
],
"last": "Todd",
"suffix": ""
},
{
"first": "Yong-Yeol",
"middle": [],
"last": "Ahn",
"suffix": ""
}
] | 2,014 | CogSci | 2406070448 | [
"9339154",
"8611682",
"24747262",
"434036",
"143374968",
"14493135",
"36816025",
"61090106",
"80472271",
"1271370",
"152290485",
"144243674"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:14407989 | 0 | 0 | 0 | 1 | 0 |
||||||
MoodLight: Exploring Personal and Social Implications of Ambient Display of Biosensor Data | 17,314,942 | MoodLight is an interactive ambient lighting system that responds to biosensor input related to an individual's current level of arousal. Changes in levels of arousal correspond to fluctuations in the color of light provided by the system, altering the immediate environment in ways intimately related to the user's private internal state. We use this intervention to explore personal and social implications of the ambient display of biosensor data. A design probe study conducted with university students provided the opportunity to observe MoodLight being used by individuals and dyads. Discussion of findings highlights key tensions associated with the dialectics of technology-mediated self-awareness and automated disclosure of personal information, addressing issues of agency, skepticism and uncertainty. This study provides greater understanding of the ways in which the representations of personal informatics, with a focus on ambient feedback, influence our perceptions of ourselves and those around us. | [
{
"first": "Jaime",
"middle": [],
"last": "Snyder",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Matthews",
"suffix": ""
},
{
"first": "Jacqueline",
"middle": [],
"last": "Chien",
"suffix": ""
},
{
"first": "Pamara",
"middle": [
"F."
],
"last": "Chang",
"suffix": ""
},
{
"first": "Emily",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Saeed",
"middle": [],
"last": "Abdullah",
"suffix": ""
},
{
"first": "Geri",
"middle": [],
"last": "Gay",
"suffix": ""
}
] | 2,015 | PMC6173949 | 10.1145/2675133.2675191 | CSCW '15 | 2017540349 | [
"12955342",
"15551492",
"143844777",
"8518089",
"13026523",
"145753856",
"144245551",
"4251582",
"143073085",
"151477048",
"8531351",
"144081414",
"11836698",
"31741437",
"6511966",
"144488125",
"61679443",
"141681177",
"22249422",
"16075942",
"5916829",
"29723361",
"54069901",
"142738149",
"203471956",
"4238303",
"67753030",
"19805238",
"195603137"
] | [
"10333204",
"46967665",
"6302146",
"45916983",
"202799243",
"116058195",
"3341024",
"3429444",
"10671681",
"41011598",
"18408924",
"53234280",
"208032399",
"24730183",
"5041264",
"52296116",
"12622670",
"181593492",
"140295632",
"52981239",
"207906531",
"140224972",
"10195794",
"34998353",
"8132417",
"18848142",
"203162524",
"51874472",
"195410598",
"2965664"
] | true | true | true | https://api.semanticscholar.org/CorpusID:17314942 | 1 | 1 | 1 | 1 | 1 |
||||
Upvoting hurricane Sandy: event-based news production processes on a social news site | 2,734,929 | This paper uses the case of Hurricane Sandy and reddit's topical community (subreddit) /r/sandy to examine the production and curation of news content around events on a social news site. Through qualitative analysis, we provide a coded topology of produced content and describe how types of networked gatekeeping impact the framing of a crisis situation. This study also examines, through quantitative modeling, what kind of information becomes negotiated and voted as relevant. We suggest that highly scored content shared in a social news setting focused more on human-interest media and perspective-based citizen journalism than professional news reports. We conclude by discussing how the mechanisms of social news sites conflict with the social norms and culture of reddit to produce differing expectations around news. | [
{
"first": "Alex",
"middle": [],
"last": "Leavitt",
"suffix": ""
},
{
"first": "Joshua",
"middle": [
"A."
],
"last": "Clark",
"suffix": ""
}
] | 2,014 | 10.1145/2556288.2557140 | CHI '14 | 2013679213 | [
"207428476",
"61250567",
"45738531",
"131661065",
"416443",
"2237151",
"28550342",
"143445335",
"15592324",
"147432577",
"32911002",
"7426628",
"207548645",
"2603383",
"56197207",
"23321842",
"15775672",
"12040766",
"36539020",
"10289925",
"17702966",
"94753075",
"154849827",
"17390239",
"1234838"
] | [
"12253820",
"27019630",
"3871163",
"159022935",
"22682714",
"1722349",
"12792841",
"53224627",
"140224377",
"198621617",
"53234654",
"5064945",
"8483328",
"3997332",
"12137291",
"9897274",
"203617040",
"5050352",
"1143625",
"52160616",
"1586687",
"202677240",
"24605199",
"153314487",
"10432672",
"14443163",
"204913587",
"157574156",
"1260531",
"3535970",
"202159351"
] | true | true | true | https://api.semanticscholar.org/CorpusID:2734929 | 0 | 0 | 0 | 1 | 0 |
|||||
Accelerating XPath location steps | 207,706,114 | This work is a proposal for a database index structure that has been specifically designed to support the evaluation of XPath queries. As such, the index is capable to support all XPath axes (including ancestor, following, preceding-sibling, descendant-or-self, etc.). This feature lets the index stand out among related work on XML indexing structures which had a focus on regular path expressions (which correspond to the XPath axes children and descendant-or-self plus name tests). Its ability to start traversals from arbitrary context nodes in an XML document additionally enables the index to support the evaluation of path traversals embedded in XQuery expressions. Despite its flexibility, the new index can be implemented and queried using purely relational techniques, but it performs especially well if the underlying database host provides support for R-trees. A performance assessment which shows quite promising results completes this proposal. | [
{
"first": "Torsten",
"middle": [],
"last": "Grust",
"suffix": ""
}
] | 2,002 | 10.1145/564691.564705 | SIGMOD '02 | 2123645388 | [
"17077324",
"57418793",
"1901694",
"649388",
"16293892",
"1893253",
"36394045",
"1502787",
"16239640",
"930491",
"6512103",
"1747844",
"16526411",
"1621187"
] | [
"245388",
"7881494",
"17078599",
"1927293",
"22899153",
"145744",
"11052786",
"6802098",
"15721925",
"2986918",
"18307365",
"1424862",
"18953270",
"12476527",
"56354619",
"18702282",
"12624896",
"6835395",
"18848940",
"646545",
"7366844",
"15398666",
"17683646",
"18504668",
"980730",
"441166",
"54013185",
"9506060",
"18189006",
"11352988",
"3436602",
"53611506",
"369741",
"18760055",
"7462286",
"5730291",
"15060785",
"17670141",
"6278669",
"8109137",
"14359152",
"18887382",
"15041216",
"146806674",
"2346818",
"15504713",
"10237512",
"13257843",
"6495117",
"172967",
"15306025",
"61406873",
"10699797",
"5776543",
"7587900",
"9210456",
"24136568",
"17384649",
"3081822",
"6652272",
"16035211",
"7840325",
"210705107",
"1144777",
"18437019",
"205077",
"1880897",
"17427896",
"7902931",
"13631027",
"19001796",
"5168214",
"11006766",
"1887063",
"18250506",
"14532726",
"2117435",
"16624113",
"1042154",
"14097619",
"4668092",
"18002086",
"1332443",
"13612196",
"40658482",
"1008234",
"119740",
"10632198",
"654233",
"18085191",
"13978086",
"8032455",
"3537996",
"6238577",
"15370854",
"9257692",
"17994119",
"3051303",
"18176279",
"7882232",
"14441445",
"6594195",
"8102164",
"14775700",
"1204324",
"12610154",
"16481879",
"8387888",
"6159474",
"9095148",
"16541767",
"17631585",
"220470",
"10477292",
"6029798",
"11575455",
"15488178",
"18091544",
"8539088",
"18888877",
"502709",
"2661754",
"21602092",
"44855211",
"17377693",
"38257483",
"17141383",
"17141383",
"5956041",
"6253189",
"35211800",
"7583940",
"6914545",
"9395670",
"16544331",
"16873406",
"15787069",
"2462125",
"8514264",
"9113887",
"17902538",
"5611620",
"33837050",
"1224317",
"1648536",
"11672782",
"18540452",
"23921385",
"3430950",
"7601025",
"14531329",
"6825319",
"208055855",
"12044245",
"1094811",
"129842",
"5795962",
"16464800",
"15547388",
"7157133",
"10160649",
"5630296",
"16186382",
"4610643",
"8883098",
"18596240",
"17865391",
"3698821",
"17843142",
"18091722",
"14869444",
"8765782",
"10658903",
"17593841",
"10009823",
"8955218",
"13289924",
"11441904",
"8301882",
"7892015",
"129437",
"9574304",
"14305965",
"12470661",
"16324961",
"639454",
"29474798",
"14250856",
"9355586",
"14522410",
"7085480",
"1127340",
"6586245",
"13989326",
"8259115",
"13606764",
"17296439",
"7766082",
"16911263",
"9028048",
"5850034",
"11255706",
"8279345",
"1392835",
"6320768",
"3705310",
"17737636",
"2041193",
"11838486",
"10085183",
"17388851",
"9642720",
"1849624",
"14580284",
"8224756",
"10388256",
"17049509",
"56895477",
"2374977",
"15677695",
"10924210",
"12207804",
"17992569",
"2597928",
"17895338",
"14245732",
"41312606",
"12982081",
"6732588",
"10753487",
"7589969",
"15382899",
"195352455",
"14891968",
"16987646",
"14949824",
"3178654",
"18258880",
"12407409",
"10968634",
"3347855",
"7613109",
"515590",
"9127800",
"1023563",
"14920261",
"5599474",
"5621016",
"17366287",
"9259444",
"343434",
"7977929",
"13876064",
"16827702",
"16456267",
"12394516",
"17753339",
"2846401",
"11411776",
"16622979",
"11093926",
"5145157",
"18235569",
"9285826",
"5650965",
"9950813",
"15171280",
"3120395",
"644854",
"16476731",
"10938033",
"65090123",
"14044982",
"11975161",
"14699381"
] | true | true | true | https://api.semanticscholar.org/CorpusID:207706114 | 1 | 1 | 1 | 1 | 1 |
|||||
Level-Ups: Motorized Stilts that Simulate Stair Steps in Virtual Reality | 17,105,096 | We present "Level-Ups", computer-controlled stilts that allow virtual reality users to experience walking up and down steps. Each Level-Up unit is a self-contained device worn like a boot. Its main functional element is a vertical actuation mechanism mounted to the bottom of the boot that extends vertically. Unlike traditional solutions that are integrated with locomotion devices, Level-Ups allow users to walk around freely ("real-walking"). We present Level-Ups in a demo environment based on a head-mounted display, optical motion capture, and integrated with two different game engines. In a user study, participants rated the realism of stepping onto objects 6.0 out of 7.0 when wearing Level-Ups compared to 3.5 without. | [
{
"first": "Dominik",
"middle": [],
"last": "Schmidt",
"suffix": ""
},
{
"first": "Rob",
"middle": [],
"last": "Kovacs",
"suffix": ""
},
{
"first": "Vikram",
"middle": [],
"last": "Mehta",
"suffix": ""
},
{
"first": "Udayan",
"middle": [],
"last": "Umapathi",
"suffix": ""
},
{
"first": "Sven",
"middle": [],
"last": "Köhler",
"suffix": ""
},
{
"first": "Lung-Pan",
"middle": [],
"last": "Cheng",
"suffix": ""
},
{
"first": "Patrick",
"middle": [],
"last": "Baudisch",
"suffix": ""
}
] | 2,015 | 10.1145/2702123.2702253 | Proceedings of the 33rd Annual ACM Conference on Human Factors in Computing Systems | 2012607755 | [
"13900357",
"53245850",
"1694364",
"12087057",
"34616764",
"12487715",
"15582215",
"12779524",
"10942848",
"58153724",
"207650134",
"2652234"
] | [
"207245689",
"215413176",
"53718323",
"204811968",
"201814535",
"56174963",
"6575964",
"3903687",
"44154159",
"16298303",
"23199860",
"59063527"
] | true | true | true | https://api.semanticscholar.org/CorpusID:17105096 | 0 | 0 | 0 | 1 | 0 |
|||||
Modeling Cognition: How Fiction Relates to Fact | 18,036,720 | Modeling Cognition: How Fiction Relates to Fact Anna-Mari Rusanen ([email protected]) Philosophy of Science Group/ Department of Philosophy, History, Art and Culture Studies, PO BOX 24 00014 University of Helsinki, FINLAND Otto Lappi ([email protected]) Cognitive Science Institute of Behavioural Sciences, PO BOX 9 00014 University of Helsinki, FINLAND properties and their causal relations - gives rise to or produces the phenomenon. Constructing an explanatory mechanistic model involves mapping elements of a mechanistic model to the system of interest, so that the elements of the model correspond to identifiable constituent parts with the appropriate organization and causal powers to sustain that organization. The mechanistic account of explanation is a typical example of the realist interpretation of scientific models. According to realism, a model explains the behavior of a target system, if and only if it is a correct account of the target’s behavior underlying observed phenomena – i.e. the model must correspond to, depict or represent the target system in a sufficiently correct way. In addition, many current realist accounts require that the target systems are actual or real – i.e. have causal power to generate observable phenomena and data. However, models are always more or less abstract, simplified and idealized descriptions of their real world target systems. Target systems are just too complicated to be studied in a full fidelity, and thus all kinds of assumptions are made to reduce the complexity of a model. Thus most (if not all) models used in science are unrealistic. Often models are nevertheless considered useful, even if they are known to be false, and they are known to contain assumptions that are not even approximately true, but highly idealized. For this reason, it has been argued that this feature of modeling seriously undermines the realist interpretation of models. If all models involve unrealistic elements, how is it possible that they could correspond, depict or describe the real world target system in a correct or truthful way? If they do not, where does their explanatory force come from? Sometimes models involve assumptions about fictional entities and processes that are known not to exist in the real world. These fictional models describe systems that (i) do not exist in the real world or (ii) have elements that do not exist in the real world. Obvious examples of fictional models in cognitive science are for instance the models of Abstract The increasing use of computational modeling and simulation methods offers interesting epistemic and theoretical challenges for the philosophy of science. One of the main questions discussed in the philosophical literature relates to the explanatory role of false, unrealistic and sometimes even fictional models. In this paper we argue that (i) some fictional models can offer explanations known as structural model explanations, and (ii) at least some variants of realism, such as the information semantic account of scientific models, can consistently hold that this subset of fictional models are explanatory. Keywords: Models; information semantics fictional models; explanation; Introduction For a philosopher of science interested in the philosophical issues of modeling, cognitive science is a wonderful source of case studies. Cognitive science utilizes modeling in a unique way, both methodologically and theoretically. The increasing use of computational modeling and simulation methods offers interesting methodological challenges for scientists, but also philosophers of science find many things of interest in the theoretical and epistemic status of modeling methods. One of the main questions discussed in the philosophical literature relates to the explanatory role of models. A growing number of philosophers have proposed that explanation of the behavior and capacities of complex systems (such as those found in the cognitive, biological and neurosciences) does not typically involve natural laws, but specific models of particular mechanisms (Bechtel and Richardson, 1993; Craver, 2006, 2007; Machamer, Darden, and Craver, 2000). It has also been argued that this mechanistic account of explanation could be extended to cover explanations in cognitive science (Kaplan & Craver, 2011, Sun, 2008) and computer sciences, as well as computational neuroscience (for instance, Piccinini, 2007). According to this account, to explain a phenomenon is to construct a model of how a causal mechanism - a hierarchical system composed of component parts, their | [
{
"first": "Anna-Mari",
"middle": [],
"last": "Rusanen",
"suffix": ""
},
{
"first": "Otto",
"middle": [],
"last": "Lappi",
"suffix": ""
}
] | 2,012 | CogSci | 2398477756 | [
"191067575",
"18992243",
"144894837",
"18780655",
"4993499",
"146951615",
"1685834",
"144951347",
"1988692",
"54049002",
"12172712",
"59904721",
"120437558",
"153926163",
"125632448",
"17779773"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:18036720 | 0 | 0 | 0 | 1 | 0 |
||||||
Enhancing the Comprehension of Science Text through Visual Analogies | 13,911,262 | Enhancing the Comprehension of Science Text through Visual Analogies Bryan J. Matlen ([email protected]) Carnegie Mellon University, Department of Psychology 5000 Forbes Avenue, Pittsburgh, PA 15213 USA Stella Vosniadou ([email protected]) National and Kapodistrian University of Athens, Department of Philosophy and History of Science University Town, Athens 161 21, Greece Benjamin D. Jee ([email protected]) College of the Holy Cross, Department of Psychology 1 College Street, Worcester, MA 01610 USA Maria Ptouchkina ([email protected]) Northwestern University, Department of Psychology 2029 Sheridan Road, Evanston, IL 60208 USA Abstract Instructional analogies are commonly used in science and mathematics text, yet students may have difficulty understanding analogies in the absence of adequate instructional support. In spatially rich domains like geoscience, visual depictions of both the base and target concepts of text analogies (i.e. visual analogies) may provide crucial support for students. To test whether visual analogies would be beneficial for learning, 72 fourth- and fifth-grade students were provided a short analogy-enhanced instructional text on plate tectonics that included either pictures of both the base and target concepts (Visual Analogy condition) or the pictures of the target concept only (Target Picture condition). Results indicated that children in the Visual Analogy condition outperformed children in the Target Picture condition on both near and far transfer measures. These results are consistent with recent research suggesting that factors that promote comparison – such as side-by-side presentation of examples – facilitate learning from text. Keywords: Analogy. Instruction. Science Cognitive Development. Geoscience Education. Education. Introduction Analogies pervade thought, thus, they are often used as scaffolds for student learning. Many studies have documented the effectiveness of analogies in math and science learning (Braasch & Goldman, 2010; Clement, 1993; Glynn & Takahashi, 1998; Iding, 1997; McDaniel & Donnely, 1996; Thompson & Opfer, 2010; Vosniadou & Schommer, 1988) and a review on the topic concluded that 12 of 15 studies showed positive effects for analogies in science education (Dagher, 1995). However, while there is general consensus that analogies support learning, substantially fewer studies have addressed how to optimize learning from analogies. Without adequate instructional support – such as guidance during the mapping process (Richland, Holyoak, & Stigler, 2004) or indications of “where the analogy breaks down” (Glynn, 1991) – students may fail to benefit from analogical comparisons (Richland, Zur, & Holyoak, 2007). The present study addresses what design characteristics lead to optimal learning outcomes from analogies. In particular, we assess how visual representations may be used to enhance analogical learning in elementary science education. Analogical comparison involves aligning two or more representations on the basis of their common relational structure (Gentner, 1983, 2010). When one of the analogs is better understood than the other – as is often the case in analogies used for instruction – information from the familiar case (by convention, termed the base) can be projected to the unfamiliar case (by convention, termed the target). These analogical inferences provide a powerful way to acquire new knowledge from prior experience. Research on analogy has revealed that factors that promote analogical comparison also facilitate relational learning (Brown, Kane, & Long, 1989; Christie & Gentner, 2010; Gentner & Namy 1999; Gick & Holyoak, 1983; Kotovsky & Gentner, 1986). For example, Camtrambone & Holyoak (1989) found that when college undergrads were prompted to compare two semantically dissimilar problems that shared a common solution, students were more likely to transfer the solution to a distant analog than students who received the same base examples without prompts to compare them. Recent research has demonstrated that comparison is effective for promoting learning in topics as diverse as mathematics (Rittle-Johnson & Star, 2009), biology (Gadgil, Chi, & Nokes, submitted), architecture (Gentner, Levine, Dhillon, & Poltermann, 2009), and business negotiation (Gentner, Loewenstein, & Thompson, 2001), and that even relatively mild manipulations that promote comparison – such as side-by-side presentation of examples – can facilitate relational learning (Christie & Gentner, 2010; Gentner, Loewenstein, & Hung, 2007; Loewenstein & Gentner, 2002; Oakes & Ribar, 2005). Although comparison in general has been found to promote learning across a diverse range of topics, the quality of the comparison can be an important factor in | [
{
"first": "Bryan",
"middle": [
"J."
],
"last": "Matlen",
"suffix": ""
},
{
"first": "Stella",
"middle": [],
"last": "Vosniadou",
"suffix": ""
},
{
"first": "Benjamin",
"middle": [
"D."
],
"last": "Jee",
"suffix": ""
},
{
"first": "Maria",
"middle": [],
"last": "Ptouchkina",
"suffix": ""
}
] | 2,011 | CogSci | 2575301687 | [
"58095784",
"81065864",
"145262244",
"31784375",
"112019940",
"62157173",
"145130856",
"143750716",
"6378480",
"537958",
"12217510",
"13146329",
"121650044",
"15834560",
"37334395",
"145099999",
"73595951",
"59778952",
"59108461",
"15530299",
"143528092",
"212935337",
"145323960",
"34707744",
"1454498",
"6736937",
"30577719",
"122822326",
"145058758",
"59669356"
] | [
"12551010",
"15061045",
"85550120",
"202285318"
] | true | true | true | https://api.semanticscholar.org/CorpusID:13911262 | 0 | 0 | 0 | 1 | 0 |
||||||
Speedup Clustering with Hierarchical Ranking | 11,805,179 | Many clustering algorithms in particular hierarchical clustering algorithms do not scale-up well for large data-sets especially when using an expensive distance function. In this paper, we propose a novel approach to perform approximate clustering with high accuracy. We introduce the concept of a pairwise hierarchical ranking to efficiently determine close neighbors for every data object. Empirical results on synthetic and real-life data show a speedup of up to two orders of magnitude over OPTICS while maintaining a high accuracy and up to one order of magnitude over the previously proposed DATA BUBBLES method, which also tries to speedup OPTICS by trading accuracy for speed. | [
{
"first": "Jianjun",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "J.",
"middle": [],
"last": "Sander",
"suffix": ""
}
] | 2,006 | 10.1109/ICDM.2006.151 | Sixth International Conference on Data Mining (ICDM'06) | Sixth International Conference on Data Mining (ICDM'06) | 2097507414 | [
"449905",
"11436094",
"3201604",
"355163",
"57146809",
"207587242",
"12954921",
"3193117"
] | [
"7727384",
"12999197",
"32044530"
] | true | true | true | https://api.semanticscholar.org/CorpusID:11805179 | 0 | 0 | 0 | 1 | 0 |
||||
Ad hoc creature: Lost and added in translation from description to depiction. | 42,692,300 | [
{
"first": "Sachi",
"middle": [],
"last": "Yasuda",
"suffix": ""
},
{
"first": "Masashi",
"middle": [],
"last": "Okamoto",
"suffix": ""
},
{
"first": "Eiji",
"middle": [],
"last": "Aramaki",
"suffix": ""
}
] | 2,012 | CogSci | 2399763250 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:42692300 | null | null | null | null | null |
|||||||
Investigating the Visual/Analytic Shift in Students' Knowledge in Chemistry. | 30,619,784 | We argue that the acquisition of chemistry expertise requires considerable conceptual changes, which among other things involve a change from reliance on visual-spatial thinking to the employment of analytic strategies. We also argue that this shift in chemistry and specifically in knowledge about molecular structure is related to the acquisition of expertise and not to individual differences in visual-spatial thinking. In this presentation we will present an experiment designed to investigate the visual-analytic shift in knowledge about molecular structure in 132 11th graders. The results showed that the students, who were novices in chemistry, could solve the items requiring visual strategies but not those requiring analytic strategies, suggesting that they had not achieved the visual/analytic shift. Additional studies are needed to compare novices and experts in order to further test our hypothesis regarding the visual-analytic shift in chemistry. | [
{
"first": "Maria",
"middle": [],
"last": "Vlacholia",
"suffix": ""
},
{
"first": "Stella",
"middle": [],
"last": "Vosniadou",
"suffix": ""
},
{
"first": "Katerina",
"middle": [],
"last": "Salta",
"suffix": ""
},
{
"first": "Petros",
"middle": [],
"last": "Roussos",
"suffix": ""
},
{
"first": "Smaragda",
"middle": [],
"last": "Kazi",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"P."
],
"last": "Sigalas",
"suffix": ""
},
{
"first": "Chrysa",
"middle": [],
"last": "Tsougraki",
"suffix": ""
}
] | 2,015 | CogSci | 2402953659 | [] | [
"2949202"
] | false | true | true | https://api.semanticscholar.org/CorpusID:30619784 | 0 | 0 | 0 | 0 | 0 |
||||||
The integration of frequency and phonetic variation in the perception of accented speech | 45,298,518 | The interaction of lexical frequency and phonetic variation in the perception of accented speech Marie-Catherine de Marneffe ([email protected]) Department of Linguistics, Bldg. 460 Stanford University Stanford, CA 94305-2150 John Tomlinson, Jr. ([email protected]) School of Psychology, Cardiff University Cardiff, CF10 3AT Marisa Tice ([email protected]) Department of Linguistics, Bldg. 460, Stanford University Stanford, CA 94305-2150 Meghan Sumner ([email protected]) Department of Linguistics, Bldg. 460, Stanford University Stanford, CA 94305-2150 Abstract How listeners understand spoken words despite massive varia- tion in the speech signal is a central issue for linguistic theory. A recent focus on lexical frequency and specificity has proved fruitful in accounting for this phenomenon. Speech percep- tion, though, is a multi-faceted process and likely incorporates a number of mechanisms to map a variable signal to meaning. We examine a well-established language use factor — lexical frequency — and how this factor is integrated with phonetic variability during the perception of accented speech. We show that an integrated perspective highlights a low-level perceptual mechanism that accounts for the perception of accented speech absent native contrasts, while shedding light on the use of in- teractive language factors in the perception of spoken words. Keywords: speech perception, cross-accent perception, lexi- cal frequency, phonetic variation. Introduction A single word is produced differently each time it is ut- tered by one speaker. A single speaker naturally produces a wide array of sound tokens that differ greatly in any number of acoustic values — amplitude, F 0 , duration, for- mant transitions, and so on. Each of these acoustically distinct tokens must be understood sometimes as a single sound (within-category), and other times as different sounds (across-category). A central issue is how listeners, oftentimes with no prior experience with a speaker, learn to navigate through this variation to perceive two variants of a token as instances of the same word or two different words. This is particularly challenging considering that minimal differences between words are oftentimes meaningful. Theories of speech perception that are sensitive to vari- ation, both phonetic and phonological, have typically fo- cused on language use factors to explain how listeners ac- complish the task of mapping a variable signal onto mean- ing (Goldinger, 1996; Johnson, 1997; Newman, Clouse, & Burnham, 2001; Pierrehumbert, 2002). One factor that plays an important role in this mapping task is frequency, or how often a linguistic unit is produced (or experienced by a lis- tener). We know that frequently produced units come with perceptual benefits, e.g., in recognition time, (Dahan, Mag- nuson, & Tanenhaus, 2001; Forster, 1976; Fox, 1984; Gros- jean, 1980; McClelland & Rumelhart, 1981). For example, Fox (1984) found that listeners made more b responses to words in a bad–dad continuum than to syllables in a ba– da continuum when asked to identify the initial sound in the word. He attributed this to a categorization bias toward fre- quent lexical items, showing that we can get Ganong-like (lexical bias) effects with lexical frequency over and above categorical word/non-word effects. Similar effects have been shown for units smaller than a word (e.g., frequent phono- logical variants, Connine, 2004; Deelman & Connine, 2001) and units larger than a word (e.g., chunks of commonly co- occurring words, Arnon & Snider, 2010). Lexical frequency is also a factor shown to influence both the production and perception of spoken words. For example, Jurafsky, Bell, Gregory, and Raymond (2001) showed that frequent words are shorter in duration than infrequent words. Examining the perception of lexically-specific phonological variants, LoCasto and Connine (2002) found that frequent words that typically occur with a reduced vowel in the first syllable (e.g., police) are recognized faster and more accu- rately with a reduced vowel than with a full initial vowel. On the other hand an infrequent word, like obese, that is most often produced with a full vowel, is recognized faster and more accurately with a full vowel. Their study thus shows that listeners are sensitive to phonological variant frequency differences across words of a similar phonological shape. These behavioral patterns are the result of years of expe- rience and exposure with a native language (English). As listeners, we must also map variable speech with less famil- iar speech patterns, and these speech patterns oftentimes use contrasts that are novel to listeners. To circumvent this issue, a number of studies have examined the perception of regional | [
{
"first": "Marie-Catherine",
"middle": [
"de"
],
"last": "Marneffe",
"suffix": ""
},
{
"first": "John",
"middle": [
"M."
],
"last": "Tomlinson",
"suffix": ""
},
{
"first": "Marisa",
"middle": [],
"last": "Tice",
"suffix": ""
},
{
"first": "Meghan",
"middle": [],
"last": "Sumner",
"suffix": ""
}
] | 2,011 | CogSci | 2767135906,2575982315 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:45298518 | null | null | null | null | null |
||||||
Preface | 211,724,493 | [
{
"first": "Wolfgang E.",
"middle": [],
"last": "Nagel",
"suffix": ""
},
{
"first": "Matthias S.",
"middle": [],
"last": "Muller",
"suffix": ""
}
] | 2,010 | 10.1002/cpe.1678 | Concurr. Comput. Pract. Exp. | Concurr. Comput. Pract. Exp. | [] | [] | false | false | true | https://api.semanticscholar.org/CorpusID:211724493 | 0 | 0 | 0 | 0 | 0 |
||||||
From Margins to Seams: Imbrication, Inclusion, and Torque in the Aadhaar Identification Project | 2,333,607 | Problems of marginalization and inclusion are central to HCI scholarship and impact in the world, but are badly named in the binary models of access that currently dominate the field. Building on prior work in ICTD and infrastructure studies, this paper explores the problem of inclusion through historical and ethnographic study of Aadhaar, India's biometrics-based national identification project. We illustrate tensions between Aadhaar users' ability to register, authenticate and successfully deploy their registered identity to participate in the Public Distribution System (PDS), a government scheme that provides subsidized food grains to the Indian poor. We argue that rather than an all-or-nothing state, inclusion in ICTD infrastructures is an ongoing and fragile process, achieved (unevenly) at the seams of multiple interconnected systems. Finally, we show that questions of (effective) inclusion are determined not just at margins of a system (who is in and who is out) but also through the artful and often challenging negotiation of the seams that run through and connect complex distributed infrastructures. | [
{
"first": "Ranjit",
"middle": [],
"last": "Singh",
"suffix": ""
},
{
"first": "Steven",
"middle": [
"J."
],
"last": "Jackson",
"suffix": ""
}
] | 2,017 | 10.1145/3025453.3025910 | Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems | 2611173295 | [
"150067707",
"143037378",
"132379971",
"143184547",
"8378346",
"62716554",
"16850400",
"245248",
"145522033",
"3128663",
"141779360",
"146437987",
"42211288",
"856332",
"26141063",
"28741938",
"143017718",
"2509802",
"149840787",
"45579302",
"10520480",
"23067938",
"7274957",
"153623062",
"5766633"
] | [
"140223470",
"21751151",
"5050525",
"5039572"
] | true | true | true | https://api.semanticscholar.org/CorpusID:2333607 | 0 | 0 | 0 | 1 | 0 |
|||||
Wavelet encoding of BRDFs for real-time rendering | 2,537,105 | Acquired data often provides the best knowledge of a material's bidirectional reflectance distribution function (BRDF). Its integration into most real-time rendering systems requires both data compression and the implementation of the decompression and filtering stages on contemporary graphics processing units (GPUs). This paper improves the quality of real-time per-pixel lighting on GPUs using a wavelet decomposition of acquired BRDFs. Three-dimensional texture mapping with indexing allows us to efficiently compress the BRDF data by exploiting much of the coherency between hemispherical data. We apply built-in hardware filtering and pixel shader flexibility to perform filtering in the full 4D BRDF domain. Anti-aliasing of specular highlights is performed via a progressive level-of-detail technique built upon the multiresolution of the wavelet encoding. This technique increases rendering performance on distant surfaces while maintaining accurate appearance of close ones. | [
{
"first": "Luc",
"middle": [],
"last": "Claustres",
"suffix": ""
},
{
"first": "Loïc",
"middle": [],
"last": "Barthe",
"suffix": ""
},
{
"first": "Mathias",
"middle": [],
"last": "Paulin",
"suffix": ""
}
] | 2,007 | 10.1145/1268517.1268546 | GI '07 | 2004761635 | [
"5722686",
"18520447",
"12715675",
"2756815",
"11746551",
"622815",
"59893219",
"41157299",
"14150272",
"1288362",
"13082349",
"9226468",
"7260494",
"33867636",
"5154655",
"11513124",
"14224073",
"8354130",
"45656663",
"5676224",
"122523543",
"411225",
"14778691",
"15898339",
"43771772",
"5259909",
"2013842",
"6613882",
"14960529",
"14474041",
"5578278",
"324277",
"16460696",
"6409840",
"62197160",
"13347031"
] | [
"10394814",
"8503142",
"6532984",
"15955705",
"44900609",
"198440507",
"15065602"
] | true | true | true | https://api.semanticscholar.org/CorpusID:2537105 | 1 | 1 | 1 | 1 | 1 |
|||||
Query processing in main memory database management systems | 16,894,136 | Most previous work in the area of main memory database systems has focused on the problem of developing query processing techniques that work well with a very large buffer pool. In this paper, we address query processing issues for memory resident relational databases, an environment with a very different set of costs and priorities. We present an architecture for a main memory DBMS, discussing the ways in which a memory resident database differs from a disk-based database. We then address the problem of processing relational queries in this architecture, considering alternative algorithms for selection, projection, and join operations and studying their performance. We show that a new index structure, the T Tree, works well for selection and join processing in memory resident databases. We also show that hashing methods work well for processing projections and joins, and that an old join method, sort-merge, still has a place in main memory. | [
{
"first": "Tobin",
"middle": [
"J."
],
"last": "Lehman",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"J."
],
"last": "Carey",
"suffix": ""
}
] | 1,986 | 10.1145/16894.16878 | SIGMOD '86 | 2020646533 | [] | [
"14443161",
"14366529",
"11146047",
"18102617",
"10460800",
"33922968",
"13467472",
"10407225",
"905406",
"1314526",
"14652623",
"9408971",
"6329523",
"32530465",
"32289089",
"9369285",
"5368143",
"18915456",
"17933534",
"5625202",
"15235031",
"5790109",
"53394760",
"59519839",
"6544486",
"145028621",
"17000331",
"6077289",
"16848031",
"14674583",
"36171875",
"18798826",
"16318361",
"12874908",
"10840973",
"18748581",
"6530554",
"14983912",
"17423851",
"201016",
"44529058",
"3242121",
"17825706",
"29751159",
"2624253",
"35228070",
"5148284",
"57573738",
"15954437",
"1516738",
"18803731",
"205005661",
"9502408",
"17926321",
"14401394",
"1995310",
"2593477",
"17218209",
"121288"
] | false | true | true | https://api.semanticscholar.org/CorpusID:16894136 | 1 | 1 | 1 | 0 | 1 |
|||||
Dynamic Comics for Hierarchical Abstraction of 3D Animation Data | 1,150,202 | (b) (c) Figure 1: T hree comic sequences which are automatically generated based on the snapshot tree of Figure 2. They describe th e same locomotion animation in different perspectives. The left image describes the global traveling path of the subject. The middle comic sequence shows the transition of the locomotion style. The right comic sequence presents the detailed body poses and the number steps in both styles. Abstract I mage storyboards of films and videos are useful for quick browsing and automatic video processing. A common approach for producing image storyboards is to display a set of selected key-frames in temporal order, which has been widely used for 2D video data. However, such an approach cannot be applied for 3D animation data because different information is revealed by changing parameters such as the viewing angle and the duration of the animation. Also, the interests of the viewer may be different from person to person. As a result, it is difficult to draw a single image that perfectly abstracts the entire 3D animation data. In this paper, we propose a system that allows users to interactively browse an animation and produce a comic sequence out of it. Each snapshot in the comic optimally visualizes a duration of the original animation, taking into account the geometry and motion of the characters and objects in the scene. This is achieved by a novel algorithm that automatically produces a hierarchy of snapshots from the input animation. Our user interface allows users to arrange the snapshots according to the complexity of the movements by the characters and objects, the duration of the animation and the page area to visualize the comic sequence. Our system is useful for quickly browsing through a large amount of animation data and semi-automatically synthesizing a storyboard from a long sequence of animation. | [
{
"first": "Myung Geol",
"middle": [],
"last": "Choi",
"suffix": ""
},
{
"first": "Seung-Tak",
"middle": [],
"last": "Noh",
"suffix": ""
},
{
"first": "Taku",
"middle": [],
"last": "Komura",
"suffix": ""
},
{
"first": "Takeo",
"middle": [],
"last": "Igarashi",
"suffix": ""
}
] | 2,013 | 10.1111/cgf.12206 | Comput. Graph. Forum | Comput. Graph. Forum | 2143538992 | [
"305262",
"62206361",
"9756270",
"22079530",
"14178536",
"14629608",
"8566242",
"1305018",
"4882265",
"61882898",
"27329640",
"46182958",
"1664563",
"18019440",
"17424902",
"453175"
] | [
"4358187",
"18370857"
] | true | true | true | https://api.semanticscholar.org/CorpusID:1150202 | 1 | 1 | 1 | 1 | 1 |
||||
ORION: Online Regularized Multi-task Regression and Its Application to Ensemble Forecasting | 17,186,821 | Ensemble forecasting is a well-known numerical prediction technique for modeling the evolution of nonlinear dynamic systems. The ensemble member forecasts are generated from multiple runs of a computer model, where each run is obtained by perturbing the starting condition or using a different model representation of the dynamic system. The ensemble mean or median is typically chosen as the consensus point estimate of the aggregated forecasts for decision making purposes. These approaches are limited in that they assume each ensemble member is equally skill ful and do not consider their inherent correlations. In this paper, we cast the ensemble forecasting task as an online, multi-task regression problem and present a framework called ORION to estimate the optimal weights for combining the ensemble members. The weights are updated using a novel online learning with restart strategy as new observation data become available. Experimental results on seasonal soil moisture predictions from 12 major river basins in North America demonstrate the superiority of the proposed approach compared to the ensemble median and other baseline methods. | [
{
"first": "Jianpeng",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Pang-Ning",
"middle": [],
"last": "Tan",
"suffix": ""
},
{
"first": "Lifeng",
"middle": [],
"last": "Luo",
"suffix": ""
}
] | 2,014 | 10.1109/ICDM.2014.90 | 2014 IEEE International Conference on Data Mining | 2014 IEEE International Conference on Data Mining | 1994916152 | [
"1443517",
"5919882",
"15173686",
"14885511",
"140595565",
"7520138",
"6115126"
] | [
"52988525",
"44430082",
"7914426",
"11533640",
"9128102",
"12810386",
"201633401",
"17065576",
"196194049",
"15362652",
"52989100",
"14274020"
] | true | true | true | https://api.semanticscholar.org/CorpusID:17186821 | 0 | 0 | 0 | 1 | 0 |
||||
Shake'n'sense: reducing interference for overlapping structured light depth cameras | 11,854,367 | We present a novel yet simple technique that mitigates the interference caused when multiple structured light depth cameras point at the same part of a scene. The technique is particularly useful for Kinect, where the structured light source is not modulated. Our technique requires only mechanical augmentation of the Kinect, without any need to modify the internal electronics, firmware or associated host software. It is therefore simple to replicate. We show qualitative and quantitative results highlighting the improvements made to interfering Kinect depth signals. The camera frame rate is not compromised, which is a problem in approaches that modulate the structured light source. Our technique is non-destructive and does not impact depth values or geometry. We discuss uses for our technique, in particular within instrumented rooms that require simultaneous use of multiple overlapping fixed Kinect cameras to support whole room interactions. | [
{
"first": "D.",
"middle": [
"Alex"
],
"last": "Butler",
"suffix": ""
},
{
"first": "Shahram",
"middle": [],
"last": "Izadi",
"suffix": ""
},
{
"first": "Otmar",
"middle": [],
"last": "Hilliges",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Molyneaux",
"suffix": ""
},
{
"first": "Steve",
"middle": [],
"last": "Hodges",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Kim",
"suffix": ""
}
] | 2,012 | 10.1145/2207676.2208335 | CHI '12 | 2096521559 | [
"16682993",
"44793400",
"14224",
"14455032",
"18829490",
"18311193"
] | [
"52152173",
"35840098",
"26841078",
"2640813",
"16273471",
"13799424",
"16036204",
"36709869",
"44003152",
"16166611",
"15304778",
"2710739",
"208214336",
"3477972",
"64210112",
"40556873",
"56854958",
"16619984",
"14726293",
"43311460",
"42344491",
"16439106",
"12904596",
"13995956",
"32637647",
"16244792",
"16986281",
"208107225",
"56404502",
"12197738",
"1506412",
"28738120",
"1031304",
"88495767",
"9520745",
"16953740",
"195938427",
"14169662",
"29162055",
"7477240",
"2574714",
"623844",
"14888709",
"15969490",
"18722715",
"17239303",
"27724491",
"2602530",
"8651405",
"6069869",
"12821729",
"30362932",
"2589151",
"51996021",
"41645421",
"14067868",
"1210137",
"5168320",
"19869587",
"5736984",
"206548568",
"1728279",
"17529199",
"14131089",
"16192431",
"17760056",
"19254313",
"17476747",
"165130743",
"25282548",
"14685985",
"17894423",
"51774054",
"17135787",
"204840900",
"8203283",
"11309365",
"10700675",
"2259397",
"15354077",
"4350758",
"9452350",
"17460702",
"8658964",
"2056471",
"17959184"
] | true | true | true | https://api.semanticscholar.org/CorpusID:11854367 | 0 | 0 | 0 | 1 | 0 |
|||||
Selecting a comprehensive set of reviews | 14,247,919 | Online user reviews play a central role in the decision-making process of users for a variety of tasks, ranging from entertainment and shopping to medical services. As user-generated reviews proliferate, it becomes critical to have a mechanism for helping the users (information consumers) deal with the information overload, and presenting them with a small comprehensive set of reviews that satisfies their information need. This is particularly important for mobile phone users, who need to make decisions quickly, and have a device with limited screen real-estate for displaying the reviews. Previous approaches have addressed the problem by ranking reviews according to their (estimated) helpfulness. However, such approaches do not account for the fact that the top few high-quality reviews may be highly redundant, repeating the same information, or presenting the same positive (or negative) perspective. In this work, we focus on the problem of selecting a comprehensive set of few high-quality reviews that cover many different aspects of the reviewed item. We formulate the problem as a maximum coverage problem, and we present a generic formalism that can model the different variants of review-set selection. We describe algorithms for the different variants we consider, and, whenever possible, we provide approximation guarantees with respect to the optimal solution. We also perform an experimental evaluation on real data in order to understand the value of coverage for users. | [
{
"first": "Panayiotis",
"middle": [],
"last": "Tsaparas",
"suffix": ""
},
{
"first": "Alexandros",
"middle": [],
"last": "Ntoulas",
"suffix": ""
},
{
"first": "Evimaria",
"middle": [],
"last": "Terzi",
"suffix": ""
}
] | 2,011 | 10.1145/2020408.2020440 | KDD | 2104456647 | [
"17530455",
"12517557",
"6334682",
"8171921",
"1073971",
"13628315",
"9123062",
"14413406",
"8426169",
"207155218",
"59335458",
"15829121",
"16309413",
"18196068",
"12634449",
"18235238",
"54625217",
"6635766",
"15048422",
"9939741",
"10151424",
"207168261",
"10397964",
"9650587",
"7355319",
"3350868",
"14965153"
] | [
"11412738",
"10385088",
"18172691",
"15819981",
"6736790",
"69513063",
"51873851",
"14133883",
"41547034",
"54435316",
"1048684",
"10743221",
"52288719",
"5063238",
"202745433",
"209450600",
"424122",
"4310432",
"203694407",
"3422604",
"15528532",
"3240131",
"10116494",
"10040144",
"7566677",
"2564767",
"201634418",
"18094198",
"214716898",
"3436314",
"14806270",
"15381904",
"9709236",
"17788543",
"16754986",
"34622340",
"799986",
"1366917",
"15458732",
"18928284",
"11490153",
"11413169",
"39994618"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14247919 | 0 | 0 | 0 | 1 | 0 |
|||||
From information visualization to direct manipulation: extending a generic visualization framework for the interactive editing of large datasets | 14,732,879 | Today's generic data management applications such as accounting, CRM or logging and tracking software, rely on form and menu based interfaces. These applications take only marginal advantage of current graphical user interfaces. This is because the data they handle does not have intrinsic visual representations upon which direct manipulation principles can be used. This article presents how we have extended an Information Visualization framework with generic data manipulation functions. These new data editing capabilities are tuned to take advantage of the characteristics of each view. They enable us to generalize the direct manipulation mechanisms to address many abstract data manipulation needs. In this article we present five uses of the features we have implemented and deduce a general workflow applicable to a variety of contexts. The workflow comprises three steps and five editing actions. The steps are: adjust view, select, and edit. The editing actions are: edit a value or group of values, clone objects, remove objects, add attributes, and remove attributes. The workflow provides complete editing access to table and hierarchical data structures using particularly terse interaction methods. It defines a general data editing model that enables powerful data manipulation tasks without requiring end-user programming or scripting. | [
{
"first": "Thomas",
"middle": [],
"last": "Baudel",
"suffix": ""
}
] | 2,006 | 10.1145/1166253.1166265 | UIST | 1979145590 | [
"8045329",
"16261041",
"106672214",
"14700527",
"1065565",
"11450000",
"33390686",
"27382594",
"5870760",
"62665066",
"41039370"
] | [
"14375141",
"18987039",
"1746109",
"197675918",
"10173456",
"15900457",
"10882652",
"11451423",
"41828964",
"10120796",
"10253909",
"14575057",
"18437709",
"42271390",
"14801452",
"1099740",
"7109229",
"320593"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14732879 | 0 | 0 | 0 | 1 | 0 |
|||||
Linking Data to Action: Designing for Amateur Energy Management | 27,930,908 | Design of eco-feedback has primarily aimed at persuading individuals to change behaviours into more environmentally sustainable ones. However, it has been questioned how effective such feedback is in supporting long-term change. As an alternative focus for energy feedback, we present a case study of amateur energy management work in apartment buildings owned by housing cooperatives, and the design of an app that aims to stimulate and support cooperatives in taking energy actions that significantly reduce the cooperative's collective energy use. By linking energy data to energy actions, the users can see how actions taken in their own and other cooperatives affected the energy use, learn from each other's experiences and become motivated as energy amateurs. Based on our housing cooperative case, we reflect on design aspects to consider when designing for energy management in amateur settings. | [
{
"first": "Hanna",
"middle": [],
"last": "Hasselqvist",
"suffix": ""
},
{
"first": "Cristian",
"middle": [],
"last": "Bogdan",
"suffix": ""
},
{
"first": "Filip",
"middle": [],
"last": "Kis",
"suffix": ""
}
] | 2,016 | 10.1145/2901790.2901837 | DIS '16 | 2417704431 | [
"142718971",
"5979142",
"16976146",
"965905",
"2517835",
"9775667",
"11579846",
"1359859",
"9534400",
"2346397",
"154408461",
"18415560",
"14821967",
"106900837",
"16752359",
"109206932",
"145102446",
"552099",
"7124462",
"107883053",
"148068074",
"5471271",
"21298711"
] | [
"832813",
"195259464",
"135321654",
"53218580",
"5627001",
"52814932",
"8243090",
"52230128",
"53229444",
"115609154",
"10266265"
] | true | true | true | https://api.semanticscholar.org/CorpusID:27930908 | 1 | 1 | 1 | 1 | 1 |
|||||
Characteristics of shared health reflections in a local community | 14,420,542 | We performed a content analysis of the information shared in a locally and culturally focused health application, EatWell. In EatWell, information is shared via the creation of audio recordings. Our results highlight the reflective nature of these recordings, in particular, 1) the topics discussed in these reflections as well as their tone, 2) how these reflections were contextualized (locally and culturally) and 3) how system users addressed one another in their reflections. We compare our findings with the dominant technological approach to supporting health information exchange amongst lay people: online support groups. In particular, we reflect upon why, though many of the community-building features of online support groups did not translate into EatWell, our users felt a sense of community empowerment. Based on our results, we discuss implications for designing locally and culturally focused health applications that leverage reflection as a contribution method. | [
{
"first": "Andrea",
"middle": [],
"last": "Grimes",
"suffix": ""
},
{
"first": "Brian",
"middle": [
"M."
],
"last": "Landry",
"suffix": ""
},
{
"first": "Rebecca",
"middle": [
"E."
],
"last": "Grinter",
"suffix": ""
}
] | 2,010 | 10.1145/1718918.1718992 | CSCW '10 | 2120335942 | [
"21235003",
"6104687",
"207161240",
"10906236",
"9723819",
"206155933",
"1207985",
"8113305",
"5634678",
"20876869",
"143263774",
"167140751",
"28675715",
"17989311",
"21272447",
"35439589",
"29116459",
"11077516",
"1163341",
"107878326",
"7910065",
"38232860",
"10122246",
"25130161",
"108609379",
"6139300",
"144447228",
"240008",
"7465675",
"29214762",
"17837989"
] | [
"5984008",
"18671085",
"14092001",
"15436289",
"17830045",
"16916064",
"15031922",
"16188817",
"32253869",
"1453046",
"1380757",
"205288367",
"39952375",
"10720167",
"14497952",
"32250538",
"55475954",
"12434495",
"174799795",
"203162524"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14420542 | 0 | 0 | 0 | 1 | 0 |
|||||
TouchCounters: designing interactive electronic labels for physical containers | 53,244,751 | [
{
"first": "Paul",
"middle": [],
"last": "Yarin",
"suffix": ""
},
{
"first": "Hiroshi",
"middle": [],
"last": "Ishii",
"suffix": ""
}
] | 2,000 | 10.1145/633292.633305 | CHI Extended Abstracts | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:53244751 | null | null | null | null | null |
|||||||
BxDF material acquisition, representation, and rendering for VR and design | 207,997,917 | Photorealistic and physically-based rendering of real-world environments with high fidelity materials is important to a range of applications, including special effects, architectural modelling, cultural heritage, computer games, automotive design, and virtual reality (VR). Our perception of the world depends on lighting and surface material characteristics, which determine how the light is reflected, scattered, and absorbed. In order to reproduce appearance, we must therefore understand all the ways objects interact with light, and the acquisition and representation of materials has thus been an important part of computer graphics from early days. Nevertheless, no material model nor acquisition setup is without limitations in terms of the variety of materials represented, and different approaches vary widely in terms of compatibility and ease of use. In this course, we describe the state of the art in material appearance acquisition and modelling, ranging from mathematical BSDFs to data-driven capture and representation of anisotropic materials, and volumetric/thread models for patterned fabrics. We further address the problem of material appearance constancy across different rendering platforms. We present two case studies in architectural and interior design. The first study demonstrates Yulio, a new platform for the creation, delivery, and visualization of acquired material models and reverse engineered cloth models in immersive VR experiences. The second study shows an end-to-end process of capture and data-driven BSDF representation using the physically-based Radiance system for lighting simulation and rendering. | [
{
"first": "Giuseppe",
"middle": [
"Claudio"
],
"last": "Guarnera",
"suffix": ""
},
{
"first": "Dar'ya",
"middle": [],
"last": "Guarnera",
"suffix": ""
},
{
"first": "Gregory",
"middle": [
"John"
],
"last": "Ward",
"suffix": ""
},
{
"first": "Mashhuda",
"middle": [],
"last": "Glencross",
"suffix": ""
},
{
"first": "Ian",
"middle": [],
"last": "Hall",
"suffix": ""
}
] | 2,019 | 10.1145/3355047.3362092 | SA '19 | 2987827271 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:207997917 | null | null | null | null | null |
|||||
Benchmark Generator for Dynamic Overlapping Communities in Networks | 6,592,339 | We describe a dynamic graph generator with overlapping communities that is capable of simulating community scale events while at the same time maintaining crucial graph properties. Such a benchmark generator is useful to measure and compare the responsiveness and efficiency of dynamic community detection algorithms. Since the generator allows the user to tune multiple parameters, it can also be used to test the robustness of a community detection algorithm across a spectrum of inputs. In an experimental evaluation, we demonstrate the generator's performance and show that graph properties are indeed maintained over time. Further, we show that standard community detection algorithms are able to find the generated community structure. To the best of our knowledge, this is the first time that all of the above have been combined into one benchmark generator, and this work constitutes an important building block for the development of efficient and reliable dynamic, overlapping community detection algorithms. | [
{
"first": "Neha",
"middle": [],
"last": "Sengupta",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Hamann",
"suffix": ""
},
{
"first": "Dorothea",
"middle": [],
"last": "Wagner",
"suffix": ""
}
] | 2,017 | 10.1109/ICDM.2017.51 | 2017 IEEE International Conference on Data Mining (ICDM) | 2017 IEEE International Conference on Data Mining (ICDM) | 2771834142 | [
"6569343",
"17037293",
"16433318",
"8789379",
"10502286",
"15951417",
"14237034",
"7582221",
"26240833",
"18481617",
"10377272",
"4420074",
"53234634",
"7904289",
"121336571",
"14166869",
"6709880",
"19345123",
"14157870",
"6829589",
"4687946",
"509516",
"1654798",
"1129425",
"58116706",
"14064857",
"62597678"
] | [
"211106470",
"198953171"
] | true | true | true | https://api.semanticscholar.org/CorpusID:6592339 | 0 | 0 | 0 | 1 | 0 |
||||
BagMinHash - Minwise Hashing Algorithm for Weighted Sets | 3,614,073 | Minwise hashing has become a standard tool to calculate signatures which allow direct estimation of Jaccard similarities. While very efficient algorithms already exist for the unweighted case, the calculation of signatures for weighted sets is still a time consuming task. BagMinHash is a new algorithm that can be orders of magnitude faster than current state of the art without any particular restrictions or assumptions on weights or data dimensionality. Applied to the special case of unweighted sets, it represents the first efficient algorithm producing independent signature components. A series of tests finally verifies the new algorithm and also reveals limitations of other approaches published in the recent past. | [
{
"first": "Otmar",
"middle": [],
"last": "Ertl",
"suffix": ""
}
] | 2,018 | 1802.03914 | 10.1145/3219819.3220089 | Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining | 2785764160 | [
"14530227",
"11748509",
"4229473",
"15162058",
"2941443",
"256656",
"198189855",
"32011683",
"6222392",
"2951054",
"15041545",
"46689205",
"9970906",
"43845208",
"60593",
"1046344",
"15232666",
"2987139",
"13972412",
"9556095",
"16737179",
"1262273",
"357490",
"15611315",
"51729074",
"32707746",
"10355071",
"1531236",
"13452540",
"6191582",
"207652764",
"5013561",
"5005080",
"13286932"
] | [
"162168897",
"208613556",
"207873559",
"92087431",
"211010975"
] | true | true | true | https://api.semanticscholar.org/CorpusID:3614073 | 1 | 1 | 1 | 1 | 1 |
||||
Topic shift in efficient discourse production | 16,293,118 | Topic Shift in Efficient Discourse Production Ting Qian ([email protected]) T. Florian Jaeger ([email protected]) Department of Brain and Cognitive Sciences, University of Rochester Rochester, NY 14627 USA Abstract Speakers have been hypothesized to organize discourse con- tent so as to achieve communicative efficiency. Previous work has focused on indirect tests of the hypothesis that speakers aim to keep per-word entropy constant across discourses to achieve communicative efficiency (Genzel & Charniak, 2002). We present novel and more direct evidence by examining the role of topic shift in discourse planning. If speakers aim for constant per-word entropy, they should encode less uncondi- tional per-word entropy (as estimated based on only sentence- internal cues) following topic shifts, as there is less relevant context to condition on. Applying latent topic modeling to a large set of English texts, we find that speakers are indeed sen- sitive to the recent topic structure in the predicted way. Keywords: discourse production; topic shift; communicative efficiency Introduction Recent years have seen a surge in accounts motivated by in- formation theory that consider language production to be par- tially driven by a preference for communicative efficiency (Aylett & Turk, 2004; Ferrer i Cancho & D´iaz-Guilera, 2007; Genzel & Charniak, 2002; Jaeger, 2010; Levy & Jaeger, 2007). Here we focus on evidence from discourse produc- tion that speakers distribute information across sentence so as to hold the conditional entropy associated with a word constant, which would facilitate efficient information transfer (Genzel & Charniak, 2002). As language production unfolds over time, information needs to be computed with reference to conditional (contextualized) probabilities. This raises the question as to what cues are integrated into contextualized probabilities, and how they are integrated. This issue so far has received little to no attention. We investigate whether shifts in the latent topics of a discourse influence the amount of information encoded in each sentence. Previous research on efficiency in discourse production has revealed an interesting relation between the information con- tent of a sentence and its position in a discourse: on average, sentences that occur later in a discourse tend to contain more unconditional information per word than earlier ones (Genzel & Charniak, 2002, 2003; Keller, 2004; Piantadosi & Gib- son, 2008; Qian & Jaeger, 2009). Unconditional information refers to the information a word (or sentence) carries if only sentence-internal cues are considered (i.e. without consider- ation of preceding discourse context). Why would speakers distribute discourse information in such a way? Information theoretic considerations about efficient communication pro- vide a possible explanation. Shannon’s noisy channel theo- rem implies that an efficient communication system should transmit information at a constant rate close to the channel capacity (Shannon, 1948). The information of a sentence is defined as the negative log-probability of a sentence. The dif- ference between unconditional and conditional information relates to whether sentence information reflects the effect of discourse context. These considerations led Genzel and Char- niak (2002) to propose the Constant Entropy Rate hypothesis, according to which unconditional sentence information is ex- pected to increase over time if conditional sentence informa- tion stays more or less uniform (for more detail, see Qian and Jaeger (submitted)). Thus, the finding of a positive cor- relation between unconditional information and sentence po- sition can be taken as evidence for communicative efficiency of language. However, the observed positive correlation is a rather weak confirmation of communicative efficiency, primarily because it is only a necessary, but not sufficient, condition of the hy- pothesized uniform distribution of conditional information in discourses. One way of obtaining stronger results is to esti- mate the conditional information of sentences and then tests whether those estimates indeed form a uniform distribution. This would require one to obtain a discourse-sensitive lan- guage model, from which conditional information estimates can be derived. One can also work with unconditional in- formation estimates and try to identify variables that max- imally correlate with discourse context. The effect of sen- tence position on unconditional information is expected to be subsumed by such predictors, since they have essentially compensated for the lack of discourse context in the uncon- ditional estimates of information. Here we present a series of studies that apply both methods through the use of topic modeling. We derived two partially conditioned estimators of sentence information by estimating the topics in the pre- ceding discourse (a fully conditioned estimator would at least incorporate world knowledge that is relevant to the discourse, which is almost implausible). At the same time, topic mod- eling also allowed us to measure topic shifts in a discourse. When a discourse undergoes a large topic shift, the previously mentioned materials are less predictive of the upcoming ma- terials, leading to higher information in those sentences. This intuitively suggests that topic shift will be a good predictor of sentence information. We test this hypothesis in both studies. We begin with a review of previous work that motivates the approach taken here. Estimating Sentence Information Previous studies mostly used ngram to estimate how much in- formation a sentence contains independent of discourse con- text. Under those models, the probability of a word is con- ditioned on certain within-sentence elements (e.g. the n-1 | [
{
"first": "Ting",
"middle": [],
"last": "Qian",
"suffix": ""
},
{
"first": "T.",
"middle": [
"Florian"
],
"last": "Jaeger",
"suffix": ""
}
] | 2,011 | in The 33rd Annual Meeting of the Cognitive Science Society, CogSci11 | 2579087420 | [
"14252814",
"38372401",
"3177797",
"54318983",
"120680772",
"842881",
"11174139",
"42864300",
"1513924",
"63763511",
"117882390",
"18617801",
"466754"
] | [
"16445850",
"19216579",
"8762358",
"5960913",
"6143826",
"149727628",
"61808211",
"451348"
] | true | true | true | https://api.semanticscholar.org/CorpusID:16293118 | 0 | 0 | 0 | 1 | 0 |
||||||
Storage Technology: RAID and Beyond. | 209,398,291 | [
{
"first": "Garth",
"middle": [
"A."
],
"last": "Gibson",
"suffix": ""
}
] | 1,995 | SIGMOD 1995 | 137248555 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:209398291 | null | null | null | null | null |
|||||||
Arithmetic Sense Predicts Children's Mathematical Achievement Better Than Arithmetic Fluency. | 51,993,300 | [
{
"first": "Soo-hyun",
"middle": [],
"last": "Im",
"suffix": ""
},
{
"first": "Sashank",
"middle": [],
"last": "Varma",
"suffix": ""
}
] | 2,018 | CogSci | 2941041298 | [] | [] | false | false | true | https://api.semanticscholar.org/CorpusID:51993300 | 0 | 0 | 0 | 0 | 0 |
|||||||
Crowdsourcing effective educational interventions. | 203,620,008 | [
{
"first": "John",
"middle": [],
"last": "Priniski",
"suffix": ""
},
{
"first": "Zachary",
"middle": [],
"last": "Horne",
"suffix": ""
}
] | 2,019 | CogSci | 2977738970 | [
"88514385",
"2542711",
"5065176",
"28305391",
"2381114",
"18351694",
"12047654",
"4551282",
"53631207",
"142766363",
"8692296",
"149652068",
"7465318",
"8508954",
"291822",
"6096939",
"14480496",
"210155795",
"28462268",
"8577096",
"51901102"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:203620008 | 0 | 0 | 0 | 1 | 0 |
|||||||
Why do echo chambers form? The role of trust, population heterogeneity, and objective truth. | 203,620,116 | [
{
"first": "Amy",
"middle": [],
"last": "Perfors",
"suffix": ""
},
{
"first": "Danielle",
"middle": [
"J."
],
"last": "Navarro",
"suffix": ""
}
] | 2,019 | CogSci | 2977968798 | [
"3378313",
"30896359",
"8040991",
"8130429",
"14891327",
"149003083",
"52032740",
"158440795",
"51874784",
"3787650",
"2029964",
"52840919",
"12925819",
"4139953",
"170480428",
"17559451"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:203620116 | 0 | 0 | 0 | 1 | 0 |
|||||||
Social Learning and Decisional Constraints in Uncertain Environments. | 203,620,315 | [
{
"first": "Marius",
"middle": [
"C."
],
"last": "Vollberg",
"suffix": ""
},
{
"first": "Matthias",
"middle": [],
"last": "Hofer",
"suffix": ""
},
{
"first": "Mina",
"middle": [],
"last": "Cikara",
"suffix": ""
}
] | 2,019 | CogSci | 2977767916 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:203620315 | null | null | null | null | null |
|||||||
Investigating the Role of Future-orientated Feedback in Self-Monitoring Devices. | 203,620,328 | [
{
"first": "Milena",
"middle": [],
"last": "Nikolic",
"suffix": ""
},
{
"first": "Magda",
"middle": [],
"last": "Osman",
"suffix": ""
}
] | 2,019 | CogSci | 2978065445 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:203620328 | null | null | null | null | null |
|||||||
Word frequency affects binding probability not memory precision. | 203,620,570 | [
{
"first": "Vencislav",
"middle": [],
"last": "Popov",
"suffix": ""
},
{
"first": "Matt",
"middle": [],
"last": "So",
"suffix": ""
},
{
"first": "Lynne",
"middle": [
"M."
],
"last": "Reder",
"suffix": ""
}
] | 2,019 | 10.31234/osf.io/deyjm | CogSci | 2977851238 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:203620570 | null | null | null | null | null |
||||||
An Accurate Implicit Field Representation for Meshes and Its Adapted Triangulation Algorithms | 43,395,302 | [
{
"first": "Marc",
"middle": [],
"last": "Fournier",
"suffix": ""
},
{
"first": "Jean-Michel",
"middle": [],
"last": "Dischler",
"suffix": ""
},
{
"first": "Dominique",
"middle": [],
"last": "Bechmann",
"suffix": ""
}
] | 2,007 | 10.2312/egs.20071020 | Eurographics | 2286677879 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:43395302 | null | null | null | null | null |
||||||
3D Triangulations for Industrial Applications | 12,886,912 | This paper presents a methodology for creating 3D non-structured meshes for industrial applications, which honor all the boundaries of the domain. The input for the system is a multi-region 3D non-manifold model, possibly containing dangling faces, which poses a number of difficulties for standard 3D triangulation frameworks. The main contribution of this work consists of a detailed description of how these difficulties were overcome in a real implementation. | [
{
"first": "P.",
"middle": [
"R."
],
"last": "Cavalcanti",
"suffix": ""
},
{
"first": "Y.",
"middle": [
"P."
],
"last": "Atencio",
"suffix": ""
},
{
"first": "C.",
"middle": [],
"last": "Esperanca",
"suffix": ""
},
{
"first": "F.",
"middle": [
"P."
],
"last": "Nascimento",
"suffix": ""
}
] | 2,012 | 10.1109/SIBGRAPI.2012.23 | 2012 25th SIBGRAPI Conference on Graphics, Patterns and Images | 2012 25th SIBGRAPI Conference on Graphics, Patterns and Images | 1995199298 | [
"122809692",
"214764782",
"27550605",
"18148270",
"30884371",
"8491722",
"123670481",
"124964810",
"40159267",
"11980096",
"14346856",
"4460835",
"119587034",
"122192799",
"115630967",
"506653",
"14868880",
"36755892",
"14178775",
"117013982",
"15526046",
"5215240",
"16913205",
"119418148",
"8691914",
"5801177",
"17729912"
] | [
"22502906"
] | true | true | true | https://api.semanticscholar.org/CorpusID:12886912 | 0 | 0 | 0 | 1 | 0 |
||||
A thin stretchable interface for tangential force measurement | 15,009,346 | We have developed a simple skin-like user interface that can be easily attached to curved as well as flat surfaces and used to measure tangential force generated by pinching and dragging interactions. The interface consists of several photoreflectors that consist of an IR LED and a phototransistor and elastic fabric such as stocking and rubber membrane. The sensing method used is based on our observation that photoreflectors can be used to measure the ratio of expansion and contraction of a stocking using the changes in transmissivity of IR light passing through the stocking. Since a stocking is thin, stretchable, and nearly transparent, it can be easily attached to various types of objects such as mobile devices, robots, and different parts of the body as well as to various types of conventional pressure sensors without altering the original shape of the object. It can also present natural haptic feedback in accordance with the amount of force exerted. A system using several such sensors can determine the direction of a two-dimensional force. A variety of example applications illustrated the utility of this sensing system. | [
{
"first": "Yuta",
"middle": [],
"last": "Sugiura",
"suffix": ""
},
{
"first": "Masahiko",
"middle": [],
"last": "Inami",
"suffix": ""
},
{
"first": "Takeo",
"middle": [],
"last": "Igarashi",
"suffix": ""
}
] | 2,012 | 10.1145/2380116.2380182 | UIST '12 | 2133656144 | [
"13087513",
"592923",
"1351541",
"309014",
"17985236",
"34689582",
"19572547",
"15632042",
"15544755",
"2230698",
"5811503",
"13107364",
"885827",
"5659899",
"12952629",
"52827971",
"17474917",
"136056452"
] | [
"208016082",
"8810936",
"14225302",
"195259469",
"21834017",
"108395187",
"1781186",
"8603949",
"52295960",
"8766925",
"51881677",
"11606683",
"8870756",
"15167420",
"52982789",
"199772156",
"38408568",
"21958556"
] | true | true | true | https://api.semanticscholar.org/CorpusID:15009346 | 0 | 0 | 0 | 1 | 0 |
|||||
Performance and Ergonomics of Touch Surfaces: A Comparative Study using Biomechanical Simulation | 207,222,964 | Although different types of touch surfaces have gained extensive attention in HCI, this is the first work to directly compare them for two critical factors: performance and ergonomics. Our data come from a pointing task (N=40) carried out on five common touch surface types: public display (large, vertical, standing), tabletop (large, horizontal, seated), laptop (medium, adjustably tilted, seated), tablet (seated, in hand), and smartphone (single- and two-handed input). Ergonomics indices were calculated from biomechanical simulations of motion capture data combined with recordings of external forces. We provide an extensive dataset for researchers and report the first analyses of similarities and differences that are attributable to the different postures and movement ranges. | [
{
"first": "Myroslav",
"middle": [],
"last": "Bachynskyi",
"suffix": ""
},
{
"first": "Gregorio",
"middle": [],
"last": "Palmas",
"suffix": ""
},
{
"first": "Antti",
"middle": [],
"last": "Oulasvirta",
"suffix": ""
},
{
"first": "Jürgen",
"middle": [],
"last": "Steimle",
"suffix": ""
},
{
"first": "Tino",
"middle": [],
"last": "Weinkauf",
"suffix": ""
}
] | 2,015 | 10.1145/2702123.2702607 | Proceedings of the 33rd Annual ACM Conference on Human Factors in Computing Systems | 2121819635 | [
"13092757",
"5178168",
"41133733",
"147039057",
"39100363",
"535569",
"28289519",
"14543403",
"8312298",
"9873647",
"8695626",
"1450647",
"206588712",
"17212042",
"28323703",
"13334320",
"736685",
"108701372",
"6559383",
"110943625",
"2430120",
"12224119",
"14136397",
"18483144",
"6963900",
"32531851",
"63148422",
"44565467"
] | [
"15814231",
"17796268",
"53388850",
"9296605",
"67771446",
"5070917",
"187754491",
"52895710",
"16372387",
"21168859",
"17532945",
"4113500",
"44025819",
"57253664",
"52978127",
"17768354",
"5053139",
"1826417",
"47017334",
"3690364",
"5046373",
"3970827",
"199531448",
"14184359",
"47017381"
] | true | true | true | https://api.semanticscholar.org/CorpusID:207222964 | 0 | 0 | 0 | 1 | 0 |
|||||
Using Webcams for Product Presentations in HTML5 | 42,712,577 | [
{
"first": "Mathias",
"middle": [],
"last": "Borg",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Kraus",
"suffix": ""
}
] | 2,013 | 10.2312/conf/EG2013/posters/021-022 | Eurographics | 2209738982 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:42712577 | null | null | null | null | null |
||||||
Co-ordinating Conventions in Graphical Dialogue: Effects of Repetition and Interaction | 32,559,852 | In recent studies of graphical dialogue, the level of communicative interaction has been identified as an important influence on the form of graphical representations. Here, we report the results of a ‘Pictionary-like’ concept drawing experiment which compares the contribution of repetition and level of interaction to changes in the form of graphical representations. In one version of the task, participants repeatedly produce drawings of the same set of items. In the other participants produce drawings of different items. In both cases, when the level of communicative interaction between the participants varies, the form of the representation produced by the pair also varies. These results suggest that three different processes are contributing to changes in graphical form in these tasks: practise, reduction and mutual-modification. We propose that the last of these, mutual-modifiability is important for the evolution of new conventions. | [
{
"first": "Patrick",
"middle": [
"G.",
"T."
],
"last": "Healey",
"suffix": ""
},
{
"first": "James",
"middle": [],
"last": "King",
"suffix": ""
},
{
"first": "Nik",
"middle": [],
"last": "Swoboda",
"suffix": ""
}
] | 2,004 | 10.1007/978-3-540-25931-2_28 | Diagrams | 2133996690 | [] | [
"8030951",
"1986278"
] | false | true | false | https://api.semanticscholar.org/CorpusID:32559852 | null | null | null | null | null |
|||||
Semantic Processing in the Context of the PRP Paradigm: Structurally or Strategically Bottlenecked? | 20,029,519 | It is widely believed that semantic activation from print is not capacity limited (i.e., that it does not need attentional resources). Prior research has tested this assumption by examining the Stroop effect in the context of the psychological refractory period (PRP) paradigm. These studies yielded additivity of the Stroop effect and SOA on RT, consistent with the hypothesis that semantic activation is itself capacity limited (given demonstrations that prior processes are not capacity limited). There is, however, an alternative explanation for such additivity: performance optimization (Miller and colleagues, 2009). Given that participants in PRP experiments are told to respond as quickly as possible, they may opt to process serially to improve performance. We investigated whether additivity of the Stroop effect (standard and semantic) and SOA in the context of PRP is best explained in terms of a structural bottleneck or performance optimization. | [
{
"first": "Darcy",
"middle": [],
"last": "White",
"suffix": ""
},
{
"first": "Derek",
"middle": [],
"last": "Besner",
"suffix": ""
}
] | 2,015 | CogSci | 2396837051 | [] | [] | false | false | true | https://api.semanticscholar.org/CorpusID:20029519 | 0 | 0 | 0 | 0 | 0 |
||||||
Are User Interface Pattern Languages Usable? A Report from the Trenches | 18,492,603 | Patterns languages pattern languages for interaction design have been an active research field in the area of Human-Computer Interaction. However, only few researchers have explored the impact of pattern languages in real application domains. This work reports a field study on acceptance and adoption of pattern languages by development teams in industry. Our results show that pattern languages should take into account the idiosyncrasies of the application domain and results show that pattern languages can be a great leverage to improve usability culture in industry. | [
{
"first": "Regina",
"middle": [],
"last": "Bernhaupt",
"suffix": ""
},
{
"first": "Marco",
"middle": [],
"last": "Winckler",
"suffix": ""
},
{
"first": "Florence",
"middle": [],
"last": "Pontico",
"suffix": ""
}
] | 2,009 | 10.1007/978-3-642-03658-3_58 | INTERACT | 1551467195 | [
"45373983",
"172463340",
"45043333",
"743243"
] | [
"213764"
] | true | true | true | https://api.semanticscholar.org/CorpusID:18492603 | 1 | 1 | 1 | 1 | 1 |
|||||
Precision CrowdSourcing: Closing the Loop to Turn Information Consumers into Information Contributors | 14,605,132 | We introduce a theoretical framework called precision crowdsourcing whose goal is to help turn online information consumers into information contributors. The framework looks at the timing and nature of the requests made of users and the feedback provided to users with the goal of increasing long-term contribution and engagement in the site or system. We present the results of a field experiment in which almost 3000 users were asked to tag movies (plus a null control group) as we varied the selection of task (popular/obscure), timing of requests (immediate or varying delays), and relational rhetoric (neutral, system reciprocal, other users reciprocal) of the requests. We found that asking increases tags provided overall, though asking generally decreases the provision of unprompted tags. Users were more likely to comply with our request when we asked them to tag obscure movies and when we used reciprocal request rhetoric. | [
{
"first": "Qian",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Zihong",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "F.",
"middle": [
"Maxwell"
],
"last": "Harper",
"suffix": ""
},
{
"first": "Loren",
"middle": [],
"last": "Terveen",
"suffix": ""
},
{
"first": "Joseph",
"middle": [
"A."
],
"last": "Konstan",
"suffix": ""
}
] | 2,016 | 10.1145/2818048.2819957 | CSCW '16 | 2292412967 | [
"4564962",
"147320330",
"1473965",
"143498140",
"7568351",
"6261034",
"615205",
"12694148",
"153091358",
"1115614",
"13502369",
"3922949",
"43876594",
"12550617",
"16508961",
"466470",
"62148813",
"6668161",
"838533",
"338469",
"56312024",
"17167144"
] | [
"4109299"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14605132 | 1 | 1 | 1 | 1 | 1 |
|||||
Anonymizing transaction databases for publication | 2,860,130 | This paper considers the problem of publishing "transaction data" for research purposes. Each transaction is an arbitrary set of items chosen from a large universe. Detailed transaction data provides an electronic image of one's life. This has two implications. One, transaction data are excellent candidates for data mining research. Two, use of transaction data would raise serious concerns over individual privacy. Therefore, before transaction data is released for data mining, it must be made anonymous so that data subjects cannot be re-identified. The challenge is that transaction data has no structure and can be extremely high dimensional. Traditional anonymization methods lose too much information on such data. To date, there has been no satisfactory privacy notion and solution proposed for anonymizing transaction data. This paper proposes one way to address this issue. | [
{
"first": "Yabo",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Ke",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Ada",
"middle": [
"Wai-Chee"
],
"last": "Fu",
"suffix": ""
},
{
"first": "Philip",
"middle": [
"S."
],
"last": "Yu",
"suffix": ""
}
] | 2,008 | 10.1145/1401890.1401982 | KDD | 2000646855 | [
"7086189",
"1424892",
"578767",
"5577493",
"490415",
"11271251",
"14242069",
"4561201",
"3112082",
"480386",
"1815908",
"1257668",
"232928",
"51141"
] | [
"5544558",
"11348",
"14529482",
"14521941",
"34733686",
"201865434",
"5087018",
"2395067",
"73712507",
"18666153",
"5971928",
"14213841",
"6572465",
"2141525",
"49243629",
"1362962",
"220758",
"11047051",
"7398098",
"53320825",
"5735206",
"18911716",
"49541818",
"17710536",
"20390824",
"18301684",
"21703208",
"214751549",
"7763837",
"17206298",
"905026",
"73716700",
"14262867",
"12870470",
"15253254",
"15989242",
"10950351",
"15112148",
"14425339",
"18869008",
"53130545",
"1268307",
"15636095",
"23928327",
"17696713",
"8024952",
"16977782",
"3875428",
"9334893",
"56178452",
"7388663",
"14346000",
"16042571",
"5743779",
"17347330",
"1772206",
"1714256",
"15174739",
"828648",
"5116545",
"11329755",
"547210",
"14933965",
"301862",
"43927088",
"15840957",
"85505448",
"53138819",
"13991009",
"21708935",
"32571461",
"30930702",
"8338840",
"22901353",
"16328912",
"16714344",
"1315690",
"167222332",
"5840917",
"16143853",
"16042595",
"2489340",
"1861222",
"15021542",
"196176411",
"18749466",
"15848457",
"5678492",
"16155606",
"5971864",
"211241661",
"27494574",
"28732524",
"5959860",
"53346253",
"29234670",
"764668",
"12038915",
"1421874",
"28011307"
] | true | true | true | https://api.semanticscholar.org/CorpusID:2860130 | 1 | 1 | 1 | 1 | 1 |
|||||
A web-based annotation tool supporting e-learning | 18,597,714 | A typical user, when learning, annotates text, figures and other contents, so as to better highlight, memorize, and retrieve relevant information. A few annotation programs exist but either change the contents of the document, or do not support distance learning through the web. We report work-in-progress on a u ser- c entered a nnotation t ool (UCAT) which allows students to annotate, following their personal styles, (using different icons, colors and signed versions) any document belonging to authorware within a course. We have chosen Amaya as the working environment since, belonging to the World Wide Web Consortium (W3C), it complies with the semantic web specifications on document formats, like RDF. An example of the deployment of UCAT will be shown in the paper. | [
{
"first": "F.",
"middle": [],
"last": "Bonifazi",
"suffix": ""
},
{
"first": "S.",
"middle": [],
"last": "Levialdi",
"suffix": ""
},
{
"first": "P.",
"middle": [],
"last": "Rizzo",
"suffix": ""
},
{
"first": "R.",
"middle": [],
"last": "Trinchese",
"suffix": ""
}
] | 2,002 | 10.1145/1556262.1556281 | AVI '02 | 2032751077 | [
"109699823",
"60709701",
"54101736",
"19625439"
] | [
"10944321",
"64989974",
"876095",
"10892045",
"2664418",
"59602164",
"202300917",
"7857189"
] | true | true | true | https://api.semanticscholar.org/CorpusID:18597714 | 0 | 0 | 0 | 1 | 0 |
|||||
Skippy: a new snapshot indexing method for time travel in the storage manager | 14,963,881 | The storage manager of a general-purpose database system can retain consistent disk page level snapshots and run application programs "back-in-time" against long-lived past states, virtualized to look like the current state. This opens the possibility that functions, such as on-line trend analysis and audit, formerly available in specialized temporal databases, can become available to general applications in general-purpose databases. Up to now, in-place updating database systems had no satisfactory way to run programs on-line over long-lived, disk page level, copy-on-write snapshots, because there was no efficient indexing method for such snapshots. We describe Skippy, a new indexing approach that solves this problem. Using Skippy, database application code can run against an arbitrarily old snapshot, and iterate over snapshot ranges, as efficiently it can access recent snapshots, for all update workloads. Performance evaluation of Skippy, based on theoretical analysis and experimental measurements, indicates that the new approach provides efficient access to snapshots at low cost. | [
{
"first": "Ross",
"middle": [],
"last": "Shaull",
"suffix": ""
},
{
"first": "Liuba",
"middle": [],
"last": "Shrira",
"suffix": ""
},
{
"first": "Hao",
"middle": [],
"last": "Xu",
"suffix": ""
}
] | 2,008 | 10.1145/1376616.1376681 | SIGMOD Conference | 2107994169 | [
"5299699",
"5754088",
"214797870",
"5374830",
"34094638",
"11043793",
"12889233",
"14140377",
"15648389",
"207691558",
"397720",
"47277999",
"6260693",
"1872051",
"1140970",
"10833363",
"17355525"
] | [
"19839313",
"16238894",
"3669308",
"8525110",
"5556082",
"3803564",
"12944364",
"14023797",
"378653",
"14122735",
"8136268",
"3909601",
"10082226",
"8509340"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14963881 | 0 | 0 | 0 | 1 | 0 |
|||||
Can You Teach the Elephant to Dance? AKA: Culture Eats Data Science for Breakfast | 9,495,600 | In the past 20 years, the practical examples of KDD/data mining have become so ubiquitous that it's almost impossible to imagine a new venture that isn't based on data science. Uber, Facebook, 23andMe, Tesla -- they aren't just technology companies; they are data companies. And yet the reality is that these companies are still anomalies. Large, successful companies usually still treat KDD as either an afterthought or as an experiment. It's not core to how they run the business. As practitioners we compound this problem by concentrating our efforts on valuable business problems; but ones which are usually on the periphery of the business. We do this because changing the heart of how a company operates requires more than just process or technology changes. It requires cultural changes. And these cultural changes usually trigger corporate antibodies adverse to anything new. This talk will review some practical realities of instituting data-driven decisions in a very large multi-national company. | [
{
"first": "Jonathan",
"middle": [],
"last": "Becher",
"suffix": ""
}
] | 2,016 | 10.1145/2939672.2945364 | KDD '16 | 2518591564 | [] | [] | false | false | true | https://api.semanticscholar.org/CorpusID:9495600 | 0 | 0 | 0 | 0 | 0 |
|||||
MobileMiner: mining your frequent patterns on your phone | 16,090,982 | Smartphones can collect considerable context data about the user, ranging from apps used to places visited. Frequent user patterns discovered from longitudinal, multi-modal context data could help personalize and improve overall user experience. Our long term goal is to develop novel middleware and algorithms to efficiently mine user behavior patterns entirely on the phone by utilizing idle processor cycles. Mining patterns on the mobile device provides better privacy guarantees to users, and reduces dependency on cloud connectivity. As an important step in this direction, we develop a novel general-purpose service called MobileMiner that runs on the phone and discovers frequent co-occurrence patterns indicating which context events frequently occur together. Using longitudinal context data collected from 106 users over 1--3 months, we show that MobileMiner efficiently generates patterns using limited phone resources. Further, we find interesting behavior patterns for individual users and across users, ranging from calling patterns to place visitation patterns. Finally, we show how our co-occurrence patterns can be used by developers to improve the phone UI for launching apps or calling contacts. | [
{
"first": "Vijay",
"middle": [],
"last": "Srinivasan",
"suffix": ""
},
{
"first": "Saeed",
"middle": [],
"last": "Moghaddam",
"suffix": ""
},
{
"first": "Abhishek",
"middle": [],
"last": "Mukherji",
"suffix": ""
},
{
"first": "Kiran",
"middle": [
"K."
],
"last": "Rachuri",
"suffix": ""
},
{
"first": "Chenren",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Emmanuel",
"middle": [
"Munguia"
],
"last": "Tapia",
"suffix": ""
}
] | 2,014 | 10.1145/2632048.2632052 | Proceedings of the 2014 ACM International Joint Conference on Pervasive and Ubiquitous Computing | 2154298720 | [
"3131928",
"16415040",
"16729000",
"14146544",
"661576",
"57146809",
"15578284",
"3348287",
"2243455",
"207179838",
"2061615",
"7149255",
"5823629",
"945130",
"2619931",
"207197608",
"10366787",
"10678563",
"2762813",
"4989797"
] | [
"13703636",
"131763165",
"4315356",
"52152285",
"15374578",
"207713272",
"51967626",
"14223012",
"202117810",
"30559731",
"204942995",
"11338717",
"23663823",
"174818808",
"215305324",
"212734500",
"15015106",
"202785185",
"10435172",
"7329940",
"67772028",
"14269246",
"1073311",
"49564412",
"53954993",
"20562075",
"17151958",
"40459473",
"201087825",
"22279648",
"52930547",
"96425829",
"46970266",
"23873984",
"17644422",
"181632595",
"17461274",
"659961",
"182952575",
"15646868",
"2437581",
"3836121",
"7967128",
"202159041",
"88481447",
"128309106",
"53668844",
"4612763",
"52295935",
"53113440",
"13888110",
"14933220",
"4368514",
"1592558",
"67891212",
"15894468",
"174819391"
] | true | true | true | https://api.semanticscholar.org/CorpusID:16090982 | 0 | 0 | 0 | 1 | 0 |
|||||
Scalable Top-n Local Outlier Detection | 9,101,445 | Local Outlier Factor (LOF) method that labels all points with their respective LOF scores to indicate their status is known to be very effective for identifying outliers in datasets with a skewed distribution. Since outliers by definition are the absolute minority in a dataset, the concept of Top-N local outlier was proposed to discover the n points with the largest LOF scores. The detection of the Top-N local outliers is prohibitively expensive, since it requires huge number of high complexity k-nearest neighbor (kNN) searches. In this work, we present the first scalable Top-N local outlier detection approach called TOLF. The key innovation of TOLF is a multi-granularity pruning strategy that quickly prunes most points from the set of potential outlier candidates without computing their exact LOF scores or even without conducting any kNN search for them. Our customized density-aware indexing structure not only effectively supports the pruning strategy, but also accelerates the $k$NN search. Our extensive experimental evaluation on OpenStreetMap, SDSS, and TIGER datasets demonstrates the effectiveness of TOLF - up to 35 times faster than the state-of-the-art methods. | [
{
"first": "Yizhou",
"middle": [],
"last": "Yan",
"suffix": ""
},
{
"first": "Lei",
"middle": [],
"last": "Cao",
"suffix": ""
},
{
"first": "Elke",
"middle": [
"A."
],
"last": "Rundensteiner",
"suffix": ""
}
] | 2,017 | 10.1145/3097983.3098191 | KDD '17 | 2744680121 | [
"855865",
"15560886",
"6787631",
"2941443",
"14181733",
"26347179",
"36394045",
"16588111",
"9684298",
"15209254",
"15209254",
"2470919",
"8299100",
"3006293",
"1054496",
"14588615",
"2695243"
] | [
"32303147",
"50774582",
"214613402",
"208016559"
] | true | true | true | https://api.semanticscholar.org/CorpusID:9101445 | 0 | 0 | 0 | 1 | 0 |
|||||
Using an International Gaming Tournament to Study Individual Differences in MOBA Expertise and Cognitive Skills | 14,633,364 | In this study we evaluated a novel approach for examining the link between gaming expertise and cognitive skills, and the value of recruiting and running participants at a MOBA gaming tournament. Participants completed a set of cognitive tasks that measured spatial working and long term (location) memory, basic cognitive processing, and gaming experience. Comparable reliability on the working memory task and results in line with previous research on the location memory task indicated the data collected was valid and reliable. We observed a significant relation between gaming experience and response time on the location memory task. We discuss that conducting gaming research at a tournament is a valid way of collecting data for a gaming expertise study while providing a range of gaming expertise that may not be available when recruiting at college campuses. Furthermore, our results extend previous gaming research that suggests that individual differences in gaming experience are correlated with the speed of recalling spatial information from long term memory. | [
{
"first": "Justin",
"middle": [
"W."
],
"last": "Bonny",
"suffix": ""
},
{
"first": "Lisa",
"middle": [
"M."
],
"last": "Castaneda",
"suffix": ""
},
{
"first": "Tom",
"middle": [],
"last": "Swanson",
"suffix": ""
}
] | 2,016 | 10.1145/2858036.2858190 | Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems | 2400846192 | [
"8863171",
"154945796",
"11989085",
"2541450",
"13505510",
"145120001",
"20678334",
"17618385",
"9293149",
"17506441",
"10790763",
"668623",
"43154544",
"1521273",
"1339486",
"143617727",
"266965",
"62998992",
"62685560",
"15466338",
"17423749",
"17293192",
"62295710",
"15508874",
"6971015",
"2334343",
"14335968",
"15737083",
"15528180",
"21202606",
"145626480",
"4501127",
"206156123"
] | [
"210335135",
"209415872",
"53116232",
"2370985",
"40579942",
"203566600",
"215481052",
"20952624",
"30173730"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14633364 | 1 | 1 | 1 | 1 | 1 |
|||||
Image representations using Miranda laws | 3,410,728 | The applicative language Miranda is used to define various image representations. One particular feature of this language, an algebraic data type with laws, is shown to be very powerful in giving and automatically maintaining properties of these image structures. This enables simple definitions of graphical ideas such as the following: quadtrees which are always fully condensed, self-dividing line lists which produce fractal images, and primitives restricted to certain areas of the screen or to certain orientations. | [
{
"first": "M.",
"middle": [
"S."
],
"last": "Parsons",
"suffix": ""
}
] | 1,989 | 10.1111/j.1467-8659.1989.tb00462.x | Comput. Graph. Forum | Comput. Graph. Forum | 2045463613 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:3410728 | null | null | null | null | null |
||||
Structural Neighborhood Based Classification of Nodes in a Network | 8,976,798 | Classification of entities based on the underlying network structure is an important problem. Networks encountered in practice are sparse and have many missing and noisy links. Statistical learning techniques have been used in intra-network classification; however, they typically exploit only the local neighborhood, so may not perform well. In this paper, we propose a novel structural neighborhood-based classifier learning using a random walk. For classifying a node, we take a random walk from the node and make a decision based on how nodes in the respective k^th-level neighborhood are labeled. We observe that random walks of short length are helpful in classification. Emphasizing role of longer random walks may cause the underlying Markov chain to converge to a stationary distribution. Considering this, we take a lazy random walk based approach with variable termination probability for each node, based on the node's structural properties including its degree. Our experimental study on real world datasets demonstrates the superiority of the proposed approach over the existing state-of-the-art approaches. | [
{
"first": "Sharad",
"middle": [],
"last": "Nandanwar",
"suffix": ""
},
{
"first": "M.",
"middle": [
"N."
],
"last": "Murty",
"suffix": ""
}
] | 2,016 | 10.1145/2939672.2939782 | KDD '16 | 2380769351 | [
"7995562",
"2125158",
"207226010",
"3116168",
"3941626",
"9545845",
"5525836",
"61440772",
"2198423",
"67748275",
"1242274",
"53807573",
"18764978",
"1508503",
"3051291",
"56563878",
"7326173",
"207204065",
"8591001",
"8399404",
"207173395",
"355820",
"13319314",
"1008003",
"508435",
"116930672"
] | [
"3568986",
"3321601",
"86516175",
"19134617",
"3950312",
"211298368",
"47003315",
"67865968",
"52057923",
"211082663",
"210139068",
"53465910",
"211297276",
"4882109",
"207758034",
"26021416",
"4719004",
"67855539",
"204823772",
"14929382",
"58534731",
"204897602",
"4300240"
] | true | true | true | https://api.semanticscholar.org/CorpusID:8976798 | 0 | 0 | 0 | 1 | 0 |
|||||
Transparent 2-D markers on an LCD tabletop system | 15,175,360 | Tabletop systems are currently being focused on and many applications using these systems are being developed. In such tabletop systems, how to recognize real objects on the table is an essential and important issue. In existing tabletop systems, 2-D markers have been often used. However, their black-and-white pattern, which means nothing to humans, spoils the appearance of the object. We developed transparent markers on a liquid crystal display (LCD) tabletop system by using the polarization features of the LCD and optical lms. In particular, through experiments with various kinds of optical films, we found that two halfwave plates make the markers rotation invariant. By using the transparent markers, tangible transparent Magic Lenses(TM) applications were developed. | [
{
"first": "Hideki",
"middle": [],
"last": "Koike",
"suffix": ""
},
{
"first": "Wataru",
"middle": [],
"last": "Nishikawa",
"suffix": ""
},
{
"first": "Kentaro",
"middle": [],
"last": "Fukuchi",
"suffix": ""
}
] | 2,009 | 10.1145/1518701.1518728 | CHI | 1983438051 | [
"11347785",
"53114308",
"12566930",
"18908925",
"8827622",
"2712188",
"5212904",
"459304",
"8192877",
"16586329",
"13395820",
"18188221",
"7218170",
"2362147",
"8168389",
"3345253",
"15555343",
"3175733",
"26417722",
"965791",
"207162463",
"207174911",
"1008695"
] | [
"15028373",
"9702761",
"6684081",
"14758219",
"14930913",
"8374116",
"6450035",
"10177722",
"5829067",
"14170621",
"108772263",
"7963269",
"14371186",
"17242798",
"5056427",
"8767388",
"110063127",
"17636567",
"16067666"
] | true | true | true | https://api.semanticscholar.org/CorpusID:15175360 | 0 | 0 | 0 | 1 | 0 |
|||||
Selective Information Sampling and the In-Group Heterogeneity Effect. | 31,627,705 | [
{
"first": "Elizaveta",
"middle": [],
"last": "Konovalova",
"suffix": ""
},
{
"first": "Gaël",
"middle": [
"Le"
],
"last": "Mens",
"suffix": ""
}
] | 2,017 | CogSci | 2786447055 | [
"143212588",
"25294651",
"1146329",
"142217366",
"143435833",
"6012585",
"9703661",
"46493618",
"10791224",
"145373199",
"143521210",
"144248000",
"144475635",
"145587696",
"143908568",
"25114612",
"51228603",
"144625400",
"827868"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:31627705 | 0 | 0 | 0 | 1 | 0 |
|||||||
A Contrast Pattern Based Clustering Quality Index for Categorical Data | 3,119,894 | Since clustering is unsupervised and highly explorative, clustering validation (i.e. assessing the quality of clustering solutions) has been an important and long standing research problem. Existing validity measures have significant shortcomings. This paper proposes a novel Contrast Pattern based Clustering Quality index (CPCQ) for categorical data, by utilizing the quality and diversity of the contrast patterns (CPs) which contrast the clusters in clusterings. High quality CPs can characterize clusters and discriminate them against each other. Experiments show that the CPCQ index (1) can recognize that expert-determined classes are the best clusters for many datasets from the UCI repository; (2) does not give inappropriate preference to larger number of clusters; (3) does not require a user to provide a distance function. | [
{
"first": "Qingbao",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Guozhu",
"middle": [],
"last": "Dong",
"suffix": ""
}
] | 2,009 | 10.1109/ICDM.2009.105 | 2009 Ninth IEEE International Conference on Data Mining | 2009 Ninth IEEE International Conference on Data Mining | 2098421138 | [
"205011641",
"29535089",
"17100109",
"14940051",
"59849738",
"121246739",
"13254783",
"189900",
"1639559",
"4585440",
"7696779",
"8909737",
"15258045",
"9936426",
"11843605",
"9307010",
"122530182",
"6278891",
"5516747"
] | [
"475871",
"13264062",
"4698111",
"11094034",
"55000439",
"54589708",
"16351325"
] | true | true | true | https://api.semanticscholar.org/CorpusID:3119894 | 1 | 1 | 1 | 1 | 1 |
||||
A Multiscale Approach to Integrated Volume Segmentation and Rendering | 13,605,233 | A number of techniques have been proposed for rendering volumetric scalar data sets. Techniques have also been proposed for analyzing the three dimensional information contents of the underlying domain, but traditionally the data analysis part is left as a post-processing step which only involves the rendered two dimensional images. In this paper, we describe a visualization method for scalar volume data which integrates explicit knowledge of the underlying domain into the rendering process. The key of this approach lies in a hierarchical description of the discrete signal, which is decomposed into a sequence of multiscale representations. We describe a technique for the analysis of structures within the data. This allows for the segmentation and classification of the relevant features and can be used to improve their visual sensation. We also address the problem of accelerating the final rendering pass by integrating the extracted object space information into the ray traversal process. | [
{
"first": "Rudiger",
"middle": [],
"last": "Westermann",
"suffix": ""
},
{
"first": "Thomas",
"middle": [],
"last": "Ertl",
"suffix": ""
}
] | 1,998 | 10.1111/1467-8659.00148 | EUROGRAPHICS ’98 | 2166125750 | [
"60696902",
"13284142",
"195837832",
"53237055",
"8686867",
"67212748",
"117931880",
"118126006",
"9020157",
"61909179",
"58296097",
"2150419",
"2356353",
"2661011",
"5698299",
"13382351",
"58519139",
"22696165",
"1601299",
"14182461",
"17204357",
"197660524",
"16050603"
] | [
"40601928",
"1778803",
"18369463",
"62483158",
"1493142",
"16003062",
"9722542",
"10821761",
"25468717",
"13909597",
"54662479",
"18062164",
"39817490",
"9490188",
"15941690",
"2272634",
"3265202",
"6110838",
"13082349",
"15673304"
] | true | true | true | https://api.semanticscholar.org/CorpusID:13605233 | 0 | 0 | 0 | 1 | 0 |
|||||
Using Signposts for Navigation in Large Graphs | 26,597,658 | In this paper we present a new Focus & Context technique for the exploration of large, abstract graphs. Most Focus & Context techniques present context in a visual way. In contrast, our technique uses a symbolic representation: while the focus is a set of visible nodes, labelled signposts provide cues for the context — off-screen regions of the graph — and indicate the direction of the shortest path linking the visible nodes to these regions. We show how the regions are defined and how they are selected dynamically, depending on the visible nodes. To define the set of visible nodes we use an approach developed by van Ham and Perer that dynamically extracts a subgraph based on an initial focal node and a degree-of-interest function. This approach is extended to support multiple focal nodes. With the symbolic visualization, potentially interesting regions of a graph may be represented with a very small visual footprint. We conclude the paper with an initial user study to evaluate the effectiveness of the signposts for navigation tasks. © 2012 Wiley Periodicals, Inc. | [
{
"first": "Thorsten",
"middle": [],
"last": "May",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Steiger",
"suffix": ""
},
{
"first": "James",
"middle": [],
"last": "Davey",
"suffix": ""
},
{
"first": "Jörn",
"middle": [],
"last": "Kohlhammer",
"suffix": ""
}
] | 2,012 | 10.1111/j.1467-8659.2012.03091.x | Comput. Graph. Forum | Comput. Graph. Forum | 2168579301 | [] | [
"25418037",
"5962950",
"51949901",
"195426443",
"48356202",
"29704393",
"13978930",
"8922307",
"14555553",
"33741367",
"2307186",
"17468389",
"42748550",
"53583818",
"55713525",
"37697255",
"2458344",
"16058451",
"890102"
] | false | true | false | https://api.semanticscholar.org/CorpusID:26597658 | null | null | null | null | null |
||||
Designing Socially Acceptable Hand-to-Face Input | 52,978,786 | Wearable head-mounted displays combine rich graphical output with an impoverished input space. Hand-to-face gestures have been proposed as a way to add input expressivity while keeping control movements unobtrusive. To better understand how to design such techniques, we describe an elicitation study conducted in a busy public space in which pairs of users were asked to generate unobtrusive, socially acceptable hand-to-face input actions. Based on the results, we describe five design strategies: miniaturizing, obfuscating, screening, camouflaging and re-purposing. We instantiate these strategies in two hand-to-face input prototypes, one based on touches to the ear and the other based on touches of the thumbnail to the chin or cheek. Performance assessments characterize time and error rates with these devices. The paper closes with a validation study in which pairs of users experience the prototypes in a public setting and we gather data on the social acceptability of the designs and reflect on the effectiveness of the different strategies. | [
{
"first": "DoYoung",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Youryang",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Yonghwan",
"middle": [],
"last": "Shin",
"suffix": ""
},
{
"first": "Ian",
"middle": [],
"last": "Oakley",
"suffix": ""
}
] | 2,018 | 10.1145/3242587.3242642 | UIST '18 | 2896584177 | [
"249086",
"6581184",
"469744",
"1751334",
"9146605",
"3851449",
"29506244",
"8546357",
"877468",
"207242864",
"1632852",
"42452248",
"2639860",
"2234831",
"222643",
"207216099",
"189419828",
"205337228",
"32397360",
"578129",
"11269970",
"16269467",
"11350799",
"34578946",
"1000929",
"11606683",
"4843637",
"16118067",
"38432",
"6554107",
"205145443",
"1743453",
"111389498",
"15509837",
"18483144",
"34042989",
"17228014",
"1764576",
"11411340",
"1341945",
"15903523",
"35087842"
] | [
"212748174",
"211125725"
] | true | true | true | https://api.semanticscholar.org/CorpusID:52978786 | 0 | 0 | 0 | 1 | 0 |
|||||
Using inverse planning and theory of mind for social goal inference | 8,114,729 | Using Inverse Planning and Theory of Mind for Social Goal Inference Sean Tauber ([email protected]) Mark Steyvers ([email protected]) Department of Cognitive Sciences, University of California, Irvine Irvine, CA 92697 USA Abstract Previous research shows that people assign latent goals or intentions to simple animated agents based on the motion behavior of these agents. We propose that human observers can infer that an animated agent has a partial state of belief about its environment and that observers use this information – in combination with the agent's observable behavior – to infer its goals. We conducted an experiment that showed that observers used line-of-sight cues – an agent's orientation relative to various objects in the environment, and the presence or absence of visual obstructions – to determine the content of an agent's state of belief about the location of objects. Our results are consistent with the hypothesis that human observers use line-of-sight cues to assign belief states to agents and that these belief states can be used to interpret agent behavior. We found that observer models that incorporated inferences about agents’ beliefs outperformed an all-knowing observer model in describing human responses. Additionally, we found that human responses were most consistent with the behavior of a model that incorporates information about both orientation and line-of-sight obstructions. Keywords: Theory of Mind; ToM; belief states; states of belief; goal inference; social goal inference; inverse planning; perceived animacy. Introduction Imagine that you are standing across the street from a bank right before closing time. Suddenly, a car pulls up and four bank robbers get out of the car and charge into the bank. A minute later, another car pulls up and a man jumps out of the car and runs towards the bank entrance. What is he doing? Maybe he is trying to stop the robbery or help the hostages; or maybe he is rushing to cash a paycheck before the bank closes. As it stands, we are missing a key piece of information that would help us understand the man’s intentions – whether or not he knows that the robbers are in the bank. We are often able to make inferences about the intentions of others based on the context of the situation and their behavior but, as our example shows, sometimes we also need to know something about a person’s state of belief about the world in order to interpret their actions with any amount of certainty. Theory of Mind Much research on Theory of Mind (ToM) has focused on the ability (or inability) of animals and human children to represent others as having states of belief about the environment that are different from their own. The general assumption is that most human adults have this ability (Premack & Woodroof, 1978; Doherty, 2008). ToM can play an interesting role in our ability to engage in social interaction. For instance, we have to keep track of the information that individuals know or do not know and combine this with contextual information in order to understand the intentions of others. Others have argued that ToM is much too complex to understand in terms of simply having or lacking the ability to represent other's beliefs and that evidence about the limitations in adult's ToM abilities may provide insight about the cognitive process(es) involved in ToM (Samson & Apperly, 2010). These limitations in adults are only beginning to be explored and may lead us to a better understanding of the process or processes that underlie the phenomenon that has been referred to broadly as ToM. The perception of animacy Studying ToM and social goal inference in realistic social contexts is a difficult undertaking with many uncontrollable variables. It is therefore useful to develop controlled experiments that allow us to simulate social interactions that are tractable. Heider and Simmel (1944) were the first to demonstrate that humans perceived simple two-dimensional shapes that were animated on a screen as having latent motives, goals and intentions. The motion of these shapes was designed by an animator – the shapes were not real agents and did not have real latent intentions. Nevertheless, human observers perceive these shapes as agents with ―minds.‖ This phenomenon is sometimes referred to as the perception of animacy (for a technical description see Feldman and Tremoulet, 2008) Modern research that employed the perceived animacy phenomenon showed that not only did human observers perceive that the agents had goals; they also appeared to perceive that the agents made inferences about the goals of other agents (Baker, Goodman, & Tenenbaum, 2008; Baker, Saxe, & Tenenbaum, 2009; Ullman et al., 2010). These studies showed that not only can people perceive these shapes as agents with minds, but they can also perceive them as agents who can reason about the minds of other agents. Inverse planning Baker, et al. (2008, 2009) showed that a Bayesian inverse planning process provided inferences about the latent goals of animated agents that were more similar to human inferences than a simple cue-based model. In general, the idea of an inverse planning process is that humans have access to a generative process in which an agent's behaviors can be generated rationally based on the state of the | [
{
"first": "Sean",
"middle": [],
"last": "Tauber",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steyvers",
"suffix": ""
}
] | 2,011 | In Proceedings of the 33rd Annual Conference of the Cognitive Science Society | 2766081184,2572797343 | [
"15020953",
"1560164",
"6842263",
"14754443",
"143057281",
"8189318",
"141321709",
"4955246",
"6824910"
] | [
"15944198",
"5878846",
"17294696",
"18378588"
] | true | true | true | https://api.semanticscholar.org/CorpusID:8114729 | 0 | 0 | 0 | 1 | 0 |
||||||
Gaze-Assisted Typing for Smart Glasses | 204,812,041 | Text entry is expected to be a common task for smart glass users, which is generally performed using a touchpad on the temple or by a promising approach using eye tracking. However, each approach has its own limitations. For more efficient text entry, we present the concept of gaze-assisted typing (GAT), which uses both a touchpad and eye tracking. We initially examined GAT with a minimal eye input load, and demonstrated that the GAT technology was 51% faster than a two-step touch input typing method (i.e.,M-SwipeBoard: 5.85 words per minute (wpm) and GAT: 8.87 wpm). We also compared GAT methods with varying numbers of touch gestures. The results showed that a GAT requiring five different touch gestures was the most preferred, although all GAT techniques were equally efficient. Finally, we compared GAT with touch-only typing (SwipeZone) and eye-only typing (adjustable dwell) using an eye-trackable head-worn display. The results demonstrate that the most preferred technique, GAT, was 25.4% faster than the eye-only typing and 29.4% faster than the touch-only typing (GAT: 11.04 wpm, eye-only typing: 8.81 wpm, and touch-only typing: 8.53 wpm). | [
{
"first": "Sunggeun",
"middle": [],
"last": "Ahn",
"suffix": ""
},
{
"first": "Geehyuk",
"middle": [],
"last": "Lee",
"suffix": ""
}
] | 2,019 | 10.1145/3332165.3347883 | Proceedings of the 32nd Annual ACM Symposium on User Interface Software and Technology | 2980635391 | [
"33492659",
"14652068",
"10037547",
"12804653",
"15947682",
"6466767",
"670210",
"56401610",
"8821813",
"5052717",
"13568308",
"140220241",
"12899606",
"2639860",
"61347624",
"11296248",
"5038505",
"17121630",
"9285033",
"9988843",
"30289375",
"1192456",
"61081749",
"1026366",
"207210041",
"1385163",
"16795062",
"11870996",
"9453680",
"215053",
"9028711",
"16153888",
"46969428",
"16118067",
"11508358",
"12021978",
"11543708",
"32911998",
"15509837",
"189874",
"34844024",
"5867919",
"12536986",
"9287575",
"9349793",
"12202272",
"207247711"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:204812041 | 0 | 0 | 0 | 1 | 0 |
|||||
Investigating the Locus of the Word Frequency Effect in Spoken Word Recognition | 13,325,824 | Investigating the Locus of the Word Frequency Effect in Spoken Word Recognition Cynthia S. Q. Siew ([email protected]) Melvin J. Yap ([email protected]) Winston D. Goh ([email protected]) Department of Psychology, National University of Singapore, 9 Arts Link, Singapore 117570, Singapore word recognition. With overwhelming evidence supporting both sides of the debate, the question as to whether word frequency affects spoken word recognition at an early or late stage continues. The present study aims to isolate the locus of the frequency effect in spoken word recognition by making use of the additive factors logic to investigate this particular research question. The additive factors logic (Sternberg, 1969) is widely used by cognitive psychologists to interpret RT data in factorial experiments and study the stages of processing in a number of research topics (e.g., Stanovich & Pachella, 1977), as the logic can be easily applied in the study a wide array of research topics, including psycholinguistics (e.g., Yap & Balota, 2007). Abstract The present study aims to isolate the locus of the frequency effect within the spoken word recognition architecture. By applying the additive factors logic (Sternberg, 1969) to an auditory lexical decision task where both word frequency and stimulus quality were factorially manipulated, the reaction time data can be analyzed to study processing stages along the time course of spoken word recognition, and determine if frequency has an early or late locus. A significant underadditive interaction of frequency and stimulus quality was obtained. Surprisingly, the typically robust frequency effect was not reliable for words of low stimulus quality. This finding suggests that word frequency influences a relatively late stage in the spoken word recognition process. Implications for extant models of spoken word recognition are discussed. Additive Factors Logic Keywords: Spoken word recognition; word frequency effects; stimulus quality effects; additive factors logic; auditory lexical decision. According to the additive factors logic (Sternberg, 1969), when two factors affect theoretically determined independent stages in the information processing stream, it should result in additivity in mean RTs (i.e., two main effects for each factor, but no interaction). This is represented in the top part of Figure 1, where Factor A affects processing at only Stage 1 and Factor B affects processing at only Stage 2. On the other hand, if the two factors affect the same stage in the information processing stream, this results in a statistical interaction (more precisely, an overadditive interaction where the effect of one factor is larger on the “slower” level of the second factor). This is depicted in the bottom part of Figure 1, where both Factor A and Factor B affect processing at a common Stage X. How can the incorporation of an additional variable, stimulus quality within the auditory lexical decision task, allow us to isolate the locus of the word frequency effect? How can the additive factors logic be used to help us make specific hypotheses about the pattern of results for RT data? In contrast to the lack of consensus with regards to the locus of the frequency effect, few would question the notion that stimulus quality has an early locus of influence in the word recognition process. In fact, a major assumption of most SWR models (e.g., TRACE) involves a process which converts physical, acoustic input into phonemic information (McClelland & Elman, 1986). This necessarily implies that degraded input must be normalized at a relatively early point in the word recognition process. Hence, if we assume that stimulus quality affects an early stage in the word recognition process, then Factor A corresponds to stimulus quality and Factor B corresponds to Introduction Determining whether word frequency has an early or late locus has profound theoretical implications for models of spoken word recognition (SWR). While it is well established that frequently occurring words are recognized faster than less frequently occurring words (Goldinger, 1996), what is less obvious is where the locus of the frequency effect lies within the word recognition process. Specifically, does frequency influence word recognition at an early stage, as the speech signal begins to unfold, or does frequency influence word recognition at a later stage in the form of a bias? Models of SWR can easily account for the frequency effect, but they do not necessarily agree on the locus of the frequency effect due to varying assumptions and architectures. Hence one way to test the validity of these models is to isolate the locus of the frequency effect. Several researchers have investigated this issue by employing a variety of experimental techniques and methodologies. Generally, studies which used traditional behavioral experiments (e.g., lexical decision and word identification) have demonstrated that word frequency has a late locus that occurs after lexical processes are complete (Broadbent, 1967; Connine, Mullennix, Shernoff & Yelen, 1990); Luce & Pisoni, 1998). On the other hand, recent studies employing eyetracking technology (e.g., Dahan, Magnuson & Tanenhaus, 2001) and novel behavioral applications of the parallel refractory period paradigm (Cleland, Gaskell, Quinlan & Tamminen, 2006) concluded that word frequency exerts early and facilitatory effects on | [
{
"first": "Cynthia",
"middle": [],
"last": "Siew",
"suffix": ""
},
{
"first": "Ju-Min",
"middle": [
"Melvin"
],
"last": "Yap",
"suffix": ""
},
{
"first": "Winston",
"middle": [
"D."
],
"last": "Goh",
"suffix": ""
}
] | 2,012 | CogSci | 2402996294 | [
"7509636",
"35825497",
"144962216",
"42369802",
"29459622",
"46501127",
"5716055",
"10897968",
"120357626",
"35201383",
"15889942",
"22635397",
"4129907",
"7428866",
"19187163",
"713054",
"22835558",
"146389470",
"122894947",
"144784920",
"7928039",
"5141327"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:13325824 | 0 | 0 | 0 | 1 | 0 |
||||||
A heterogeneous field matching method for record linkage | 13,327,105 | Record linkage is the process of determining that two records refer to the same entity. A key subprocess is evaluating how well the individual fields, or attributes, of the records match each other. One approach to matching fields is to use hand-written domain-specific rules. This "expert systems" approach may result in good performance for specific applications, but it is not scalable. This paper describes a new machine learning approach that creates expert-like rules for field matching. In our approach, the relationship between two field values is described by a set of heterogeneous transformations. Previous machine learning methods used simple models to evaluate the distance between two fields. However, our approach enables more sophisticated relationships to be modeled, which better capture the complex domain specific, common-sense phenomena that humans use to judge similarity. We compare our approach to methods that rely on simpler homogeneous models in several domains. By modeling more complex relationships we produce more accurate results. | [
{
"first": "S.N.",
"middle": [],
"last": "Minton",
"suffix": ""
},
{
"first": "C.",
"middle": [],
"last": "Nanjo",
"suffix": ""
},
{
"first": "C.A.",
"middle": [],
"last": "Knoblock",
"suffix": ""
},
{
"first": "M.",
"middle": [],
"last": "Michalowski",
"suffix": ""
},
{
"first": "M.",
"middle": [],
"last": "Michelson",
"suffix": ""
}
] | 2,005 | 10.1109/ICDM.2005.7 | Fifth IEEE International Conference on Data Mining (ICDM'05) | Fifth IEEE International Conference on Data Mining (ICDM'05) | 2150546140 | [
"6745692",
"6029205",
"15335378",
"6997209",
"11747348",
"16071510",
"382328",
"15165174",
"16553919"
] | [
"6254075",
"35035509",
"16535573",
"17511514",
"20031923",
"212410348",
"13161375",
"14225383",
"5822131",
"34412375",
"6629823",
"19017816",
"14122195",
"1486560",
"202715336",
"198113157",
"16867686",
"19024066",
"11906599",
"1396175",
"659528",
"6199729",
"6126100",
"18727460",
"15240595",
"460248",
"1421199",
"15390592",
"14088183",
"15373900",
"11481194",
"12778293",
"196963",
"53867824",
"15590839",
"4883110",
"33358576",
"17146000",
"1186156"
] | true | true | true | https://api.semanticscholar.org/CorpusID:13327105 | 1 | 0 | 1 | 1 | 1 |
||||
SPC: Fast and Efficient Scalable Predictive Coding of Animated Meshes | 2,171,141 | Animated meshes are often represented by a sequence of static meshes with constant connectivity. Due to their frame-based representation they usually occupy a vast amount of bandwidth or disk space. We present a fast and efficient scalable predictive coding (SPC) scheme for frame-based representations of animated meshes. SPC decomposes animated meshes in spatial and temporal layers which are efficiently encoded in one pass through the animation. Coding is performed in a streamable and scalable fashion. Dependencies between neighbouring spatial and temporal layers are predictively exploited using the already encoded spatio-temporal neighbourhood. Prediction is performed in the space of rotation-invariant coordinates compensating local rigid motion. SPC supports spatial and temporal scalability, and it enables efficient compression as well as fast encoding and decoding. Parts of SPC were adopted in the MPEG-4 FAMC standard. However, SPC significantly outperforms the streaming mode of FAMC with coding gains of over 33%, while in comparison to the scalable FAMC, SPC achieves coding gains of up to 15%. SPC has the additional advantage over FAMC of achieving real-time encoding and decoding rates while having only low memory requirements. Compared to some other non-scalable state-of-the-art approaches, SPC shows superior compression performance with gains of over 16% in bit-rate. | [
{
"first": "Nikolče",
"middle": [],
"last": "Stefanoski",
"suffix": ""
},
{
"first": "Jörn",
"middle": [],
"last": "Ostermann",
"suffix": ""
}
] | 2,010 | 10.1111/j.1467-8659.2009.01547.x | Comput. Graph. Forum | Comput. Graph. Forum | 2121301003 | [] | [
"23117372",
"37404816",
"18485229",
"211730933",
"15172139",
"133350324",
"6679826",
"9142061",
"29130650",
"16175696",
"171096873",
"16534127",
"24908328",
"169037542",
"6774295",
"43983598",
"88486721",
"86864303",
"8061735",
"195738118"
] | false | true | false | https://api.semanticscholar.org/CorpusID:2171141 | null | null | null | null | null |
||||
Top-k generation of integrated schemas based on directed and weighted correspondences | 16,363,486 | Schema integration is the problem of creating a unified target schema based on a set of existing source schemas and based on a set of correspondences that are the result of matching the source schemas. Previous methods for schema integration rely on the exploration, implicit or explicit, of the multiple design choices that are possible for the integrated schema. Such exploration relies heavily on user interaction; thus, it is time consuming and labor intensive. Furthermore, previous methods have ignored the additional information that typically results from the schema matching process, that is, the weights and in some cases the directions that are associated with the correspondences. In this paper, we propose a more automatic approach to schema integration that is based on the use of directed and weighted correspondences between the concepts that appear in the source schemas. A key component of our approach is a novel top-k ranking algorithm for the automatic generation of the best candidate schemas. The algorithm gives more weight to schemas that combine the concepts with higher similarity or coverage. Thus, the algorithm makes certain decisions that otherwise would likely be taken by a human expert. We show that the algorithm runs in polynomial time and moreover has good performance in practice. | [
{
"first": "Ahmed",
"middle": [],
"last": "Radwan",
"suffix": ""
},
{
"first": "Lucian",
"middle": [],
"last": "Popa",
"suffix": ""
},
{
"first": "Ioana",
"middle": [
"R."
],
"last": "Stanoi",
"suffix": ""
},
{
"first": "Akmal",
"middle": [],
"last": "Younis",
"suffix": ""
}
] | 2,009 | 10.1145/1559845.1559913 | SIGMOD Conference | 1969411444 | [
"7026467",
"5352012",
"1274693",
"9982933",
"63492018",
"5894508",
"637841",
"120678970",
"8027136",
"1738470",
"59795249",
"14102033",
"15996572",
"209850742",
"1083763",
"7371269",
"6070443",
"15742995",
"18788946",
"10500613",
"1730165",
"8402367",
"473917"
] | [
"14079801",
"8585092",
"3513272",
"14993459",
"3542631",
"54446409",
"16002553",
"48902027",
"145818445",
"57366244",
"16621847",
"14915370",
"148572609",
"16068802",
"9815708",
"62784929",
"143427155",
"44114041",
"107366",
"9756445",
"214588544",
"10239105",
"17706848",
"14337820",
"15401671"
] | true | true | true | https://api.semanticscholar.org/CorpusID:16363486 | 1 | 1 | 1 | 1 | 1 |
|||||
Scalar Language is Shaped by the Statistical Properties of the Environment. | 117,731,897 | [
{
"first": "Dariusz",
"middle": [],
"last": "Kalocinski",
"suffix": ""
}
] | 2,018 | CogSci | 2941615470 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:117731897 | null | null | null | null | null |
|||||||
Lagrangian-Eulerian advection of noise and dye textures for unsteady flow visualization | 11,496,199 | A new hybrid scheme, called Lagrangian-Eulerian advection (LEA), that combines the advantages of the Eulerian and Lagrangian frameworks is applied to the visualization of dense representations of time-dependent vector fields. The algorithm encodes the particles into a texture that is then advected. By treating every particle equally, we can handle texture advection and dye advection within a single framework. High temporal and spatial correlation is achieved through the blending of successive frames. A combination of particle and dye advection enables the simultaneous visualization of streamlines, particle paths and streak-lines. We demonstrate various experimental techniques on several physical flow fields. The simplicity of both the resulting data structures and the implementation suggest that LEA could become a useful component of any scientific visualization toolkit concerned with the display of unsteady flows. | [
{
"first": "Bruno",
"middle": [],
"last": "Jobard",
"suffix": ""
},
{
"first": "Gordon",
"middle": [],
"last": "Erlebacher",
"suffix": ""
},
{
"first": "M.",
"middle": [
"Y."
],
"last": "Hussaini",
"suffix": ""
}
] | 2,002 | 10.1109/TVCG.2002.1021575 | IEEE Trans. Vis. Comput. Graph. | IEEE Trans. Vis. Comput. Graph. | 14473290,2131520349 | [
"5163371",
"2820629",
"8969897",
"1157473",
"5940469",
"14856537",
"18433112",
"16180613",
"18593276",
"12622800",
"119678828",
"602586",
"11340530",
"3142996",
"122375875",
"375088"
] | [
"18416968",
"14590844",
"207162080",
"3903176",
"2004785",
"39303169",
"14337097",
"122817554",
"7386308",
"7316066",
"19811124",
"3067651",
"14893955",
"14683257",
"52057934",
"6991405",
"9123484",
"14147935",
"904138",
"4516658",
"7023452",
"2552410",
"12260173",
"60863045",
"17585802",
"11376301",
"9601284",
"13270223",
"6227176",
"15677745",
"1815821",
"9459031",
"2597027",
"7737531",
"6002504",
"811356",
"8576694",
"1177841",
"8173442",
"60475540",
"2128238",
"19027306",
"206840427",
"17686004",
"9406248",
"21198002",
"1331787",
"1554311",
"23663216",
"53244385",
"17063438",
"110583981",
"1455969",
"16921165",
"2714812",
"18465634",
"4515362",
"13445337",
"14659849",
"126064008",
"14935756",
"1630606",
"14205048",
"17150220",
"4473579",
"2752028",
"4503324",
"4518018",
"11277770",
"11235441",
"1912948",
"1713997",
"2867612",
"3158695",
"15680534",
"15386757",
"17062664",
"14070294"
] | true | true | true | https://api.semanticscholar.org/CorpusID:11496199 | 1 | 1 | 1 | 1 | 1 |
||||
Invariance for Single Curved Manifold | 17,205,468 | Recently, it has been shown that, for Lambert illumination model, solely scenes composed by developable objects with a very particular albedo distribution produce an (2D) image with isolines that are (almost) invariant to light direction change. In this work, we provide and investigate a more general framework, and we show that, in general, the requirement for such in variances is quite strong, and is related to the differential geometry of the objects. More precisely, it is proved that single curved manifolds, i.e., manifolds such that at each point there is at most one principal curvature direction, produce invariant is surfaces for a certain relevant family of energy functions. In the three-dimensional case, the associated energy function corresponds to the classical Lambert illumination model with albedo. This result is also extended for finite-dimensional scenes composed by single curved objects. | [
{
"first": "P.",
"middle": [
"M.",
"M.",
"D."
],
"last": "Castro",
"suffix": ""
}
] | 2,012 | 10.1109/SIBGRAPI.2012.30 | 2012 25th SIBGRAPI Conference on Graphics, Patterns and Images | 2012 25th SIBGRAPI Conference on Graphics, Patterns and Images | 2108503269 | [
"121702431",
"18287181",
"15890621",
"832511",
"118880750",
"123055618",
"118695896",
"35089975",
"118294193",
"9160404",
"124937374",
"17736511",
"117429742",
"2657506",
"8238727",
"207059721",
"206421594"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:17205468 | 0 | 0 | 0 | 1 | 0 |
||||
Entity-relationship approach to the conceptual schema design | 18,067,775 | The purpose of this paper is to present a systematic approach to the conceptual schema design. The entity-relationship model is used as the conceptual schema model. The entity-relationship schema, a formal description of the model, is defined to explicitly state the dependency structures such as the functional dependencies, the transitive dependencies, and the hierarchical decompositions. Based upon the analysis of these structural properties, the schema is iteratively transformed into the refined form. The notion of the access weight matrix is also introduced as a measure to evaluate the schemas. | [
{
"first": "Hirotaka",
"middle": [],
"last": "Sakai",
"suffix": ""
}
] | 1,980 | 10.1145/582250.582252 | SIGMOD '80 | 2094439713 | [
"60803185",
"63999054",
"14955743"
] | [
"14416017",
"8387664",
"55693945",
"18065102",
"6282411"
] | true | true | true | https://api.semanticscholar.org/CorpusID:18067775 | 0 | 0 | 0 | 1 | 0 |
|||||
The Importance of Object-Based Seed Sampling for Superpixel Segmentation | 208,883,279 | Superpixel segmentation can be defined as an image partition into connected regions, such that image objects may be represented by the union of their superpixels. In this context, multiple iterations of superpixel segmentation from improved seed sets is a strategy exploited by several algorithms. The Iterative Spanning Forest (ISF) framework divides this strategy into three independent components: a seed sampling method, a superpixel delineation algorithm based on strength of connectedness between seeds and pixels, and a seed recomputation procedure. A recent work shows that object information can be added to each component of ISF such that the user can control the number of seeds inside the objects and so improve superpixel segmentation. However, it is uncertain how the added information impacts each component of the pipeline. Therefore, in this work, a study is conducted to evaluate such inclusion in the seed sampling procedure, partially elucidating its benefits. Additionally, we introduce a novel object-based sampling approach, named Object Saliency Map sampling by Ordered Extraction (OSMOX), and demonstrate the results for supervised and unsupervised object information. The experiments show considerable improvements in under-segmentation error, specially with a low number of superpixels. | [
{
"first": "Felipe",
"middle": [],
"last": "Belém",
"suffix": ""
},
{
"first": "Leonardo",
"middle": [],
"last": "Melo",
"suffix": ""
},
{
"first": "Silvio",
"middle": [],
"last": "Guimarães",
"suffix": ""
},
{
"first": "Alexandre",
"middle": [],
"last": "Falcão",
"suffix": ""
}
] | 2,019 | 10.1109/SIBGRAPI.2019.00023 | 2019 32nd SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI) | 2019 32nd SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI) | 2991955602 | [
"149453624",
"126057340",
"3803460",
"1806278",
"3422166",
"10623384",
"6436427",
"14848918",
"207663697",
"11863722",
"10939961",
"13836541",
"24314533",
"62605678",
"22402269",
"9201661",
"47434345",
"7045013",
"14833979",
"12849782",
"4190710"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:208883279 | 0 | 0 | 0 | 1 | 0 |
||||
The Role of Category Structure in Category Learning | 16,373,086 | The Role of Category Structure in Category Learning Hyungwook Yim ([email protected]) Department of Psychology, The Ohio State University 267 Psychology Building, 1835 Neil Avenue Columbus, OH 43210, USA Vladimir M. Sloutsky ([email protected]) Department of Psychology, The Ohio State University 239 Psychology Building, 1835 Neil Avenue Columbus, OH 43210, USA Abstract Two category-learning experiments were conducted to examine the role of category structure and learning regime in category learning. We particularly focused on effects of these factors on selective attention, which was measured by eye- tracking methods. Results show that even though supervision was weaker than in previous studies, attention optimization and cost of attention were observed during category learning (Experiment 1). Moreover, there were faster learning and stronger attention optimization when statistically denser categories were learned (Experiment 2). At the same time, there were weaker costs of selective attention when learning denser categories than when learning sparser categories. Results are discussed in relation to theories of category learning. Keywords: category learning, cost of selective attention, category structure, eye tracking Introduction Selective attention is one of the key components in category learning (Kruschke, 1992; Nosofsky, 1986; Shepard, Hovland, & Jenkins, 1961). The ability to selectively attend to category-relevant dimensions aids the learner to ignore category-irrelevant information and makes learning more efficient. For example, when learning how to distinguish Siberian Huskies from Alaskan Malamutes, which look very similar, the color of the eyes is one of the relevant features one should look for (most Huskies have blue eyes and Malamutes have brown eyes). Therefore, learning to focus on the color of the eyes while ignoring other irrelevant features (e.g. color of the fur or markings) would aid learning the two categories. Selective attention could be captured in category learning tasks that involve eye-tracking as attention optimization, where looking to category- relevant information increases and looking to irrelevant information decreases (Hoffman & Rehder, 2010). However, optimizing one’s attention to the current category-relevant dimension may result in learning to ignore the category-irrelevant dimension, which results in learned inattention to the irrelevant dimension (Kruschke & Blair, 2000). Therefore, if a new to-be-learned category has a category-relevant dimension that was previously irrelevant, learning may become more difficult, which represents a cost of selective attention. For example, when learning to distinguish meerkats from prairie dogs, which again look very similar, the shape of the ears is one of the good dimensions to look. However, if one has previously learned how to distinguish Huskies from Malamutes, where eyes were attended and ears were ignored, learning to attend to the once-ignored ears would be hindered. The close link between attention optimization and the cost of selective attention has been demonstrated in previous research (e.g., Hoffman & Rehder, 2010). In their study, participants were given either a supervised classification task (e.g. classifying a stimulus into category A or B) or a supervised inference task (e.g. inferring the missing feature of a stimulus that belongs to a certain category) and their eye movements were recorded. Since the classification task (e.g. focusing on the color of the eyes to classify Huskies and Malamutes) required attention optimization to the relevant dimension, results showed cost of selective attention when learning a new category. On the other hand, since the inference task (e.g. figuring out whether a Malamute has blue eyes or brown eyes) does not require attention optimization, the cost did not occur when learning the next category. Therefore, the study showed that (a) the characteristics of the task affect allocation of attention and (b) when attention optimization occurred, the cost of selective attention also followed. Although attention may be affected by the characteristics of the task (i.e., classification vs. inference) it can also be affected by category structure. Categories that have multiple correlated dimensions (or statistically dense categories) may be learned without selective attention, whereas categories that have few relevant dimensions (or statistically sparse categories) may require selective attention (Kloos & Sloutsky, 2008; Sloutsky, 2010). For example, when learning the category dog, many dimensions are relevant (e.g. nose, fur, four-legs, etc.) and therefore it is relatively easy to learn. However, when learning abstract concepts such as friction, very few dimensions are relevant among many irrelevant dimensions (e.g. a car trying to stop at the red light and a person trying to open a jar both shows friction). Therefore, to learn a sparse category one has to “selectively attend” to the relevant dimension among many other irrelevant dimensions. Finally, the deployment of selective attention may be also affected by learning regime. Since supervised learning provides information about the relevant dimension, it is more likely to recruit selective attention than unsupervised | [
{
"first": "Hyungwook",
"middle": [],
"last": "Yim",
"suffix": ""
},
{
"first": "Vladimir",
"middle": [
"M."
],
"last": "Sloutsky",
"suffix": ""
}
] | 2,013 | CogSci | 2394627132 | [
"15790660",
"18187593",
"8966458",
"144554653",
"1754411",
"13213127",
"411801",
"26166298",
"18269962",
"16909662",
"17955262",
"8869524",
"7087770",
"10730254",
"145608064",
"9383420",
"143465599",
"3104782"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:16373086 | 0 | 0 | 0 | 1 | 0 |
||||||
Automatic Generation of Multiresolution Boundary Representations | 35,307,595 | The paper focuses on automatic simplification algorithms for the generation of a multiresolution family of solid models from an initial boundary representation of a polyhedral solid. An algorithm for general polyhedra based on an intermediate octree representation is proposed. Simplified elements of the multiresolution family approximate the initial solid within increasing tolerances. A discussion among different octree-based simplification methods and the standard marching cubes algorithm is presented. | [
{
"first": "C.",
"middle": [],
"last": "Andujar",
"suffix": ""
},
{
"first": "D.",
"middle": [],
"last": "Ayala",
"suffix": ""
},
{
"first": "P.",
"middle": [],
"last": "Brunet",
"suffix": ""
},
{
"first": "R. Joan",
"middle": [],
"last": "Arinyo",
"suffix": ""
},
{
"first": "J.",
"middle": [],
"last": "Sole",
"suffix": ""
}
] | 1,996 | 10.1111/1467-8659.1530087 | Comput. Graph. Forum | Comput. Graph. Forum | 2067876135 | [] | [
"40601928",
"8651355",
"15420941",
"44049132",
"1455799",
"26642667",
"7188958",
"7498032",
"2281411",
"15669403",
"28131422",
"1243828",
"43300195"
] | false | true | false | https://api.semanticscholar.org/CorpusID:35307595 | null | null | null | null | null |
||||
The Messaging Kettle: Prototyping Connection over a Distance between Adult Children and Older Parents | 9,648,157 | A prototype "messaging kettle" is described. The connected kettle aims to foster communication and engagement with an older friend or relative who lives remotely, during the routine of boiling the kettle. We describe preliminary encounters and findings from demonstrating a working prototype in morning tea gatherings of people in their 50s-late 70s and from introducing it into the homes of two people in their 80s who live on another continent. Key findings are that: The concept of keeping in touch around a "habituated object" such as a kettle was well received; Simple and varied interaction modalities that allow asymmetric forms of communication are needed; Designing for use across different time zones requires attention; And, that even when augmenting a habituated object, the process of introduction, appropriation and habituation still needs significant attention and investigation. | [
{
"first": "Margot",
"middle": [],
"last": "Brereton",
"suffix": ""
},
{
"first": "Alessandro",
"middle": [],
"last": "Soro",
"suffix": ""
},
{
"first": "Kate",
"middle": [],
"last": "Vaisutis",
"suffix": ""
},
{
"first": "Paul",
"middle": [],
"last": "Roe",
"suffix": ""
}
] | 2,015 | 10.1145/2702123.2702462 | Proceedings of the 33rd Annual ACM Conference on Human Factors in Computing Systems | 1998107731 | [
"42933643",
"38028125",
"14666483",
"8133976",
"16741426",
"1356747",
"12487420",
"16307829",
"17667289",
"12751102",
"24261006",
"60142453",
"243177"
] | [
"1547536",
"18675348",
"3386537",
"23620085",
"3847022",
"5091306",
"210914372",
"7379640",
"59337585",
"3159602",
"204812107",
"4628277",
"17561767",
"28018091",
"195259276",
"210873003",
"53249496",
"2554309",
"5052179",
"13750508",
"25900541",
"30122804",
"198964532",
"210873560",
"195259316",
"3341635",
"30159514",
"2033320"
] | true | true | true | https://api.semanticscholar.org/CorpusID:9648157 | 0 | 0 | 0 | 1 | 0 |
|||||
Leveraging the asymmetric sensitivity of eye contact for videoconference | 14,030,461 | Eye contact is a natural and often essential element in the language of visual communication. Unfortunately, perceiving eye contact is difficult in most video-conferencing systems and hence limits their effectiveness. We conducted experiments to determine how accurately people perceive eye contact. We discovered that the sensitivity to eye contact is asymmetric, in that we are an order of magnitude less sensitive to eye contact when people look below our eyes than when they look to the left, right, or above our eyes. Additional experiments support a theory that people are prone to perceive eye contact, that is, we will think that someone is making eye contact with us unless we are certain that the person is not looking into our eyes. These experimental results suggest parameters for the design of videoconferencing systems. As a demonstration, we were able to construct from commodity components a simple dyadic videoconferencing prototype that supports eye contact | [
{
"first": "Milton",
"middle": [],
"last": "Chen",
"suffix": ""
}
] | 2,002 | 10.1145/503376.503386 | CHI '02 | 2156834844 | [
"10542057",
"150084732",
"143944812",
"64527462",
"29469180",
"10043010",
"149907362",
"234500",
"6001179",
"59869977",
"145410556",
"61563225",
"1426436",
"143656187"
] | [
"17293152",
"206276689",
"15043189",
"358590",
"16585290",
"15267702",
"13810215",
"9343690",
"16312394",
"9590941",
"1879227",
"20397054",
"3044914",
"5051993",
"6189285",
"15131164",
"5894129",
"168498",
"1782573",
"14544262",
"207163073",
"8756331",
"1623734",
"13712582",
"13933333",
"22584304",
"7709238",
"1196720",
"19337373",
"21731243",
"11247102",
"39920909",
"145885622",
"12230276",
"1031304",
"16681098",
"195750645",
"18905229",
"14578557",
"13235485",
"24074869",
"16104238",
"24912206",
"17423842",
"13026771",
"1654210",
"198988080",
"14170834",
"49348239",
"18833059",
"1930425",
"7408756",
"165011253",
"1548727",
"13920122",
"54774",
"10632797",
"638442",
"16568746",
"201068341",
"145033338",
"18365536",
"6474781",
"36659241",
"18468017",
"145042558",
"11433878",
"9069051",
"5865520",
"42625498",
"61857676",
"11065525",
"16198253",
"10677547",
"3113703",
"10664916",
"3023684"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14030461 | 0 | 0 | 0 | 1 | 0 |
|||||
Globally distributed system developers: their trust expectations and processes | 16,463,909 | Trust remains a challenge in globally distributed development teams. In order to investigate how trust plays out in this context, we conducted a qualitative study of 5 multi-national IT organizations. We interviewed 58 individuals across 10 countries and made two principal findings. First, study participants described trust in terms of their expectations of their colleagues. These expectations fell into one of three dimensions: that socially correct behavior will persist, that team members possess technical competency, and that individuals will demonstrate concern for others. Second, our study participants described trust as a dynamic process, with phases including formation, dissolution, adjustment and restoration. We provide new insights into these dimensions and phases of trust within distributed teams which extend existing literature. Our study also provides guidelines on effective practices within distributed teams in addition to providing implications for the extension of software engineering and collaboration tools. | [
{
"first": "Ban",
"middle": [],
"last": "Al-Ani",
"suffix": ""
},
{
"first": "Matthew",
"middle": [
"J."
],
"last": "Bietz",
"suffix": ""
},
{
"first": "Yi",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Erik",
"middle": [],
"last": "Trainer",
"suffix": ""
},
{
"first": "Benjamin",
"middle": [],
"last": "Koehne",
"suffix": ""
},
{
"first": "Sabrina",
"middle": [],
"last": "Marczak",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Redmiles",
"suffix": ""
},
{
"first": "Rafael",
"middle": [],
"last": "Prikladnicki",
"suffix": ""
}
] | 2,013 | 10.1145/2441776.2441840 | CSCW '13 | 2117967456 | [
"16878737",
"156627269",
"207694766",
"145307808",
"142754635",
"146230972",
"12280496",
"141218069",
"12405299",
"53066096",
"38581081",
"6866784",
"142978",
"10193799",
"5070905",
"2920191",
"43821577"
] | [
"17318502",
"13512697",
"53083655",
"7454139",
"13069995",
"195837789",
"4709385",
"102353080",
"2254220",
"155797322",
"10780987",
"196187404",
"1304813",
"4717969",
"44511502",
"209518880",
"4697709",
"5708169",
"15450802",
"9645026"
] | true | true | true | https://api.semanticscholar.org/CorpusID:16463909 | 0 | 0 | 0 | 1 | 0 |
|||||
Message in a Bottle: Stylized Rendering of Sand Movies | 195,707,958 | Stylized rendering, usually referred as non-photorealistic rendering, aims to reproduce artistic techniques in renderings, trying to express feelings and moods on the rendered scenes, as opposed to realistic rendering techniques, that aim to produce realistic renderings of artificial scenes. In this paper, we present a stylized rendering technique that aims to create synthetic sand-filled bottles, simulating a typical art craft from the northeastern region of Brazil, that usually depicts landscape images. A method for generating 2D procedural sand textures is presented, and two new techniques that mimic effects created by the artists using their tools are introduced. The technique is also used to generate stylized videos, something close to impossible in real life with this technique. The temporal coherence within these stylized videos can be enforced on individual objects with the aid of a video segmentation algorithm. The techniques were used on synthetic and real videos, and several snapshots from these videos are shown here. | [
{
"first": "L.S.B.",
"middle": [],
"last": "Neto",
"suffix": ""
},
{
"first": "B.",
"middle": [
"M."
],
"last": "Carvalho",
"suffix": ""
}
] | 2,007 | 10.1109/SIBGRAPI.2007.29 | 2106375779 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:195707958 | null | null | null | null | null |
||||||
Experimental study of discovering essential information from customer inquiry | 15,204,101 | This paper reports the result of our experimental study on a new method of applying an association rule miner to discover useful information from customer inquiry database in a call center of a company. It has been claimed that association rule mining is not suited for text mining. To overcome this problem, we propose (1) to generate sequential data set of words with dependency structure from the Japanese text database, and (2) to employ a new method for extracting meaningful association rules by applying a new rule selection criterion. Each inquiry in the sequential data was represented as a list of word pairs, each of which consists of a verb and its dependent noun. The association rules were induced regarding each pair of words as an item. The rule selection criterion comes from our principle that we put heavier weights to co-occurrence of multiple items more than single item occurrence. We regarded a rule important if the existence of the items in the rule body significantly affects the occurrence of the item in the rule head. The selected rules were then categorized to form meaningful information classes. With this method, we succeeded in extracting useful information classes from the text database, which were not acquired by only simple keyword retrieval. Also, inquiries with multiple aspects were properly classified into corresponding multiple categories. | [
{
"first": "Keiko",
"middle": [],
"last": "Shimazu",
"suffix": ""
},
{
"first": "Atsuhito",
"middle": [],
"last": "Momma",
"suffix": ""
},
{
"first": "Koichi",
"middle": [],
"last": "Furukawa",
"suffix": ""
}
] | 2,003 | 10.1145/956750.956850 | KDD '03 | 2054247401 | [
"2340683",
"11695195",
"5053470",
"16521007",
"62442868",
"16338450",
"19194063",
"18213830",
"41504576",
"7737850",
"11179826",
"1649653"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:15204101 | 0 | 0 | 0 | 1 | 0 |
|||||
Detecting abnormal patterns in call graphs based on the aggregation of relevant vertex measures | 12,709,557 | Graphs are a very important abstraction to model complex structures and respective interactions, with a broad range of applications including web analysis, telecommunications, chemical informatics and bioinformatics. In this work we are interested in the application of graph mining to identify abnormal behavior patterns from telecom Call Detail Records (CDRs). Such behaviors could also be used to model essential business tasks in telecom, for example churning, fraud, or marketing strategies, where the number of customers is typically quite large. Therefore, it is important to rank the most interesting patterns for further analysis. We propose a vertex relevant ranking score as a unified measure for focusing the search of abnormal patterns in weighted call graphs based on CDRs. Classical graph-vertex measures usually expose a quantitative perspective of vertices in telecom call graphs. We aggregate wellknown vertex measures for handling attribute-based information usually provided by CDRs. Experimental evaluation carried out with real data streams, from a local mobile telecom company, showed us the feasibility of the proposed strategy. | [
{
"first": "Ronnie",
"middle": [],
"last": "Alves",
"suffix": ""
},
{
"first": "Pedro",
"middle": [],
"last": "Ferreira",
"suffix": ""
},
{
"first": "Joel",
"middle": [],
"last": "Ribeiro",
"suffix": ""
},
{
"first": "Orlando",
"middle": [],
"last": "Belo",
"suffix": ""
}
] | 2,012 | 10.1007/978-3-642-31488-9_8 | ICDM | 2150844520 | [
"16146052",
"1877629",
"120856011",
"11185950",
"1508503",
"6455989",
"13356834"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:12709557 | 0 | 0 | 0 | 1 | 0 |
|||||
Joint optimization of bid and budget allocation in sponsored search | 156,941 | This paper is concerned with the joint allocation of bid price and campaign budget in sponsored search. In this application, an advertiser can create a number of campaigns and set a budget for each of them. In a campaign, he/she can further create several ad groups with bid keywords and bid prices. Data analysis shows that many advertisers are dealing with a very large number of campaigns, bid keywords, and bid prices at the same time, which poses a great challenge to the optimality of their campaign management. As a result, the budgets of some campaigns might be too low to achieve the desired performance goals while those of some other campaigns might be wasted; the bid prices for some keywords may be too low to win competitive auctions while those of some other keywords may be unnecessarily high. In this paper, we propose a novel algorithm to automatically address this issue. In particular, we model the problem as a constrained optimization problem, which maximizes the expected advertiser revenue subject to the constraints of the total budget of the advertiser and the ranges of bid price change. By solving this optimization problem, we can obtain an optimal budget allocation plan as well as an optimal bid price setting. Our simulation results based on the sponsored search log of a commercial search engine have shown that by employing the proposed method, we can effectively improve the performances of the advertisers while at the same time we also see an increase in the revenue of the search engine. In addition, the results indicate that this method is robust to the second-order effects caused by the bid fluctuations from other advertisers. | [
{
"first": "Weinan",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Ying",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Bin",
"middle": [],
"last": "Gao",
"suffix": ""
},
{
"first": "Yong",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Xiaojie",
"middle": [],
"last": "Yuan",
"suffix": ""
},
{
"first": "Tie-Yan",
"middle": [],
"last": "Liu",
"suffix": ""
}
] | 2,012 | 10.1145/2339530.2339716 | KDD | 2160085520 | [
"18031103",
"7016836",
"16879018",
"3229105",
"9312159",
"35853994",
"32597028",
"560357",
"6681717",
"10879313",
"14027320",
"14415078",
"38621627",
"207423647",
"7915878"
] | [
"49274800",
"3422851",
"166228664",
"660571",
"20810187",
"55970924",
"53967904",
"3351250",
"13623004",
"196184214",
"19147413",
"201059022",
"16862002",
"3395619",
"52986074",
"211209469",
"86628954",
"46894927",
"113406464",
"3757678",
"17382603",
"6725255",
"153126707",
"28312921",
"54811725"
] | true | true | true | https://api.semanticscholar.org/CorpusID:156941 | 0 | 0 | 0 | 1 | 0 |
|||||
Statistical entity-topic models | 3,142,925 | The primary purpose of news articles is to convey information about who, what, when and where. But learning and summarizing these relationships for collections of thousands to millions of articles is difficult. While statistical topic models have been highly successful at topically summarizing huge collections of text documents, they do not explicitly address the textual interactions between who/where, i.e. named entities (persons, organizations, locations) and what, i.e. the topics. We present new graphical models that directly learn the relationship between topics discussed in news articles and entities mentioned in each article. We show how these entity-topic models, through a better understanding of the entity-topic relationships, are better at making predictions about entities. | [
{
"first": "David",
"middle": [],
"last": "Newman",
"suffix": ""
},
{
"first": "Chaitanya",
"middle": [],
"last": "Chemudugunta",
"suffix": ""
},
{
"first": "Padhraic",
"middle": [],
"last": "Smyth",
"suffix": ""
}
] | 2,006 | 10.1145/1150402.1150487 | KDD '06 | 2098401485 | [
"207561477",
"5490327",
"3177797",
"209102532",
"8498449",
"7133953",
"15439655",
"11408454",
"3343116",
"11747348",
"1940239"
] | [
"211269437",
"4067872",
"1143723",
"3941091",
"17470270",
"5487856",
"5944796",
"14768825",
"18304343",
"7681634",
"1383274",
"7262932",
"7870575",
"2562333",
"57570672",
"10688959",
"14355130",
"12775559",
"153313904",
"13842340",
"1818457",
"15296625",
"127656045",
"3179842",
"29676627",
"10580390",
"15597922",
"14716504",
"12304328",
"14517167",
"9180147",
"3951198",
"36662453",
"262756",
"14851547",
"14223816",
"9735250",
"209320050",
"7915290",
"16428104",
"3593233",
"14414884",
"11117646",
"4302402",
"14517978",
"937165",
"26676256",
"7433103",
"16503949",
"11626880",
"37682036",
"2540713",
"553501",
"4989386",
"753304",
"2271313",
"18754866",
"481381",
"25718635",
"7119199",
"690207",
"9982061",
"2959429",
"4981807",
"8102632",
"3730945",
"12595486",
"12317957",
"12568595",
"131932499",
"3423910",
"124017",
"18906127",
"20936954",
"213230236",
"3390280",
"43708615",
"51879475",
"204840202",
"355821"
] | true | true | true | https://api.semanticscholar.org/CorpusID:3142925 | 1 | 1 | 1 | 1 | 1 |
|||||
Arches: a Framework for Modeling Complex Terrains | 14,937,864 | In this paper, we present a framework for representing complex terrains with such features as overhangs, arches and caves and including different materials such as sand and rocks. Our hybrid model combines a volumetric discrete data structure that stores the different materials and an implicit representation for sculpting and reconstructing the surface of the terrain. Complex scenes can be edited and sculpted interactively with high level tools. We also propose an original rock generation technique that enables us to automatically generate complex rocky sceneries with piles of rocks without any computationally demanding physically-based simulation. | [
{
"first": "Adrien",
"middle": [],
"last": "Peytavie",
"suffix": ""
},
{
"first": "Eric",
"middle": [],
"last": "Galin",
"suffix": ""
},
{
"first": "Jérôme",
"middle": [],
"last": "Grosjean",
"suffix": ""
},
{
"first": "Stéphane",
"middle": [],
"last": "Mérillou",
"suffix": ""
}
] | 2,009 | 10.1111/j.1467-8659.2009.01385.x | Comput. Graph. Forum | Comput. Graph. Forum | 2109385470 | [
"16278654",
"62533350",
"19397746",
"62695639",
"18543187",
"178381099",
"218492",
"14282835",
"17470420",
"15400017",
"6870738",
"1784578",
"29027868",
"11659921",
"11466154",
"2648073",
"13719278"
] | [
"8345747",
"14162095",
"16901108",
"109781849",
"16335455",
"203131631",
"17541290",
"29447326",
"119848",
"51909714",
"18635439",
"15717766",
"35920628",
"16989343",
"16158624",
"15166568",
"17499390",
"107155035",
"40332114",
"9981404",
"155696600",
"174766992",
"27820917",
"24634769",
"17471229",
"14348230",
"7896400",
"14423709",
"31724804",
"18899451",
"30262770",
"14725064",
"51799239",
"2937000",
"17834979",
"15707944",
"15032597",
"13992161",
"40473744",
"18922574",
"33814538",
"11619253",
"18578995",
"1736509",
"921414",
"52246067",
"2982835",
"12898242",
"2161432"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14937864 | 0 | 0 | 0 | 1 | 0 |
||||
Fast Sparse Coding Inference with Historical Information | 210,991,884 | Recently, time-unfolded recurrent neural network (RNN) based algorithms are successfully applied for fast sparse coding (SC) inference, such as LISTA and SLSTM. However, these methods do not properly exploit the historical information which is proved to speed up the convergence. In this paper, we propose a novel RNN-based SC inference framework with attention mechanism to efficiently incorporate the related historical information. The proposed framework consists of an attention network and a time-unfolded RNN, where the RNN generates the historical information and the attention network automatically determines the importance of these historical values for the current updating. The final sparse code is obtained by passing the context vectors generated from the attention network to a soft shrinkage function. Extensive experiments on convergence analysis and image classification tasks demonstrate that our network achieves impressive improvements on SC inference in terms of the quality of estimated sparse codes and the inference time. Moreover, the proposed network can be easily extended into a supervised version to further improve the classification accuracy. | [
{
"first": "Zhenchang",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Fei",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Ruimin",
"middle": [],
"last": "Shen",
"suffix": ""
}
] | 2,019 | 10.1109/ICDM.2019.00191 | 2019 IEEE International Conference on Data Mining (ICDM) | 2019 IEEE International Conference on Data Mining (ICDM) | 3003338975 | [
"36583436",
"11212020",
"3072879",
"110510",
"13333501",
"39846043",
"1915014",
"52964914",
"18268744",
"14542261",
"40222894",
"40027675",
"606761",
"62245742",
"2503790",
"21665902",
"19214947"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:210991884 | 0 | 0 | 0 | 1 | 0 |
||||
Learning Attentional Temporal Cues of Brainwaves with Spatial Embedding for Motion Intent Detection | 210,995,780 | As brain dynamics fluctuate considerably across different subjects, it is challenging to design effective handcrafted features based on prior knowledge. Regarding this gap, this paper proposes a Graph-based Convolutional Recurrent Attention Model (G-CRAM) to explore EEG features across different subjects for movement intention recognition. A graph structure is first developed to embed the positioning information of EEG nodes, and then a convolutional recurrent attention model learns EEG features from both spatial and temporal dimensions and adaptively emphasizes on the most distinguishable temporal periods. The proposed approach is validated on two public movement intention EEG datasets. The results show that the GCRAM achieves superior performance to state-of-the-art methods regarding recognition accuracy and ROC-AUC. Furthermore, model interpreting studies reveal the learning process of different neural network components and demonstrate that the proposed model can extract detailed features efficiently. | [
{
"first": "Dalin",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Kaixuan",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Debao",
"middle": [],
"last": "Jian",
"suffix": ""
},
{
"first": "Lina",
"middle": [],
"last": "Yao",
"suffix": ""
},
{
"first": "Sen",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Po",
"middle": [],
"last": "Li",
"suffix": ""
}
] | 2,019 | 10.1109/ICDM.2019.00189 | 2019 IEEE International Conference on Data Mining (ICDM) | 2019 IEEE International Conference on Data Mining (ICDM) | 3004288096 | [
"215284786",
"133606431",
"4870579",
"215029930",
"4713255",
"53242523",
"46830682",
"54562361",
"3849381",
"17267607",
"12529212",
"206608942",
"642375",
"16768813",
"14656324",
"215164211",
"437096",
"27811367"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:210995780 | 0 | 0 | 0 | 1 | 0 |
||||
Filtering Edges by Pixel Integration | 5,529,380 | An algorithm is presented which evaluates the area of the triangles formed by the intersection of a straight-line boundary with pixel elements, yet involves only tests and additions. | [
{
"first": "M.L.V.",
"middle": [],
"last": "Pitteway",
"suffix": ""
},
{
"first": "P.M.",
"middle": [],
"last": "Olive",
"suffix": ""
}
] | 1,985 | 10.1111/j.1467-8659.1985.tb00200.x | Comput. Graph. Forum | Comput. Graph. Forum | 2036235153 | [] | [
"11030434",
"12742376",
"15100708",
"3067591",
"62552271"
] | false | true | false | https://api.semanticscholar.org/CorpusID:5529380 | null | null | null | null | null |
Subsets and Splits