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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Learning implicit user interest hierarchy for context in personalization | 46,653,089 | To provide a more robust context for personalization, we desire to extract a continuum of general (long-term) to specific (short-term) interests of a user. Our proposed approach is to learn a user interest hierarchy (UIH) from a set of web pages visited by a user. We devise a divisive hierarchical clustering (DHC) algorithm to group words (topics) into a hierarchy where more general interests are represented by a larger set of words. Each web page can then be assigned to nodes in the hierarchy for further processing in learning and predicting interests. This approach is analogous to building a subject taxonomy for a library catalog system and assigning books to the taxonomy. Our approach does not need user involvement and learns the UIH "implicitly." Furthermore, it allows the original objects, web pages, to be assigned to multiple topics (nodes in the hierarchy). In this paper, we focus on learning the UIH from a set of visited pages. We propose a few similarity functions and dynamic threshold-finding methods, and evaluate the resulting hierarchies according to their meaningfulness and shape | [
{
"first": "Hyoung-rae",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "Philip",
"middle": [
"K."
],
"last": "Chan",
"suffix": ""
}
] | 2,003 | 10.1145/604045.604064 | IUI | 2133155002 | [] | [
"12192360",
"21743954",
"5357742",
"21156265",
"719900",
"3155734",
"606794",
"16939438",
"7180734",
"7180734",
"7261399",
"14385583",
"410113",
"12965831",
"1682149",
"17957941",
"16537155",
"30705667",
"14131757",
"15721539",
"12056825",
"2174685",
"1761832",
"19253210",
"14468416",
"64835435",
"166225040",
"15218355",
"7299043",
"16025172",
"16216344",
"15110518",
"6281246",
"3239398",
"16723997",
"15788290",
"15280400",
"2129304",
"1076360",
"3124220",
"248795",
"373516",
"11224462",
"12400860",
"13141954",
"8241212",
"18150758",
"12885932",
"16065493",
"16838788",
"21743151",
"15672809",
"34415185",
"10640240",
"6871253",
"11388800",
"14650487",
"33483859",
"16273387",
"212426901",
"12017434",
"1280682",
"7685901",
"14292977",
"14721878",
"18929225",
"13939804",
"2890612",
"17007190",
"214899858",
"15092866",
"56317013",
"67275757",
"17246794",
"15349913",
"13954825",
"11011770",
"9633734",
"195061409",
"503894",
"14092599",
"17264562",
"568028",
"24863784",
"3282654",
"26290600",
"162168680",
"15105271",
"17502053",
"14673162",
"32763481",
"884486",
"18387484",
"5245315",
"17940463",
"18394703",
"17413091",
"42272578",
"15020347",
"6999483",
"25939468",
"28503286",
"2291912",
"1184261",
"36608800",
"15366670",
"18028522",
"18858992",
"62405733",
"2997690",
"6679251",
"59617226",
"16304230",
"6825574",
"39003452",
"197462265",
"17711550",
"18958056",
"15886784",
"15604924",
"9539806",
"6088541",
"2853357",
"14080645",
"18527810",
"16769034",
"18164650",
"14381823",
"12340588",
"17977626",
"16582931",
"8391952",
"18618329",
"15937741",
"44242722",
"14671769",
"23826202",
"15905901",
"11637501",
"1852745",
"14894276",
"56224816",
"9080619",
"11072463",
"2494523",
"202741875"
] | false | true | false | https://api.semanticscholar.org/CorpusID:46653089 | null | null | null | null | null |
|||||
Find an Expert: Designing Expert Selection Interfaces for Formal Help-Giving | 14,326,469 | A critical aspect of formal help-giving tasks in the enterprise is finding the right expert. We built and evaluated a tool, Find an Expert, to examine what the most important expert selection criteria are for help-seekers and how to represent them in expert selection interfaces for formal help-giving tasks. We observed users' expert selection decisions and found that the diversity of topic expertise and the amount of related experience were significantly important in helping users decide which expert to contact. Through self-reported data from users, we found that in addition to expertise and experience, expert accessibility indicators, like online availability and language proficiency, were considered important criteria for selecting experts. Finally, publicly-displayed crowdsourced ratings of experts, while deemed useful indicators of expert quality by help-seekers, raised concerns for experts. We conclude with suggestions regarding the design of expert selection interfaces for formal help-giving tasks. | [
{
"first": "Sharoda",
"middle": [
"A."
],
"last": "Paul",
"suffix": ""
}
] | 2,016 | 10.1145/2858036.2858131 | Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems | 2405428281 | [
"8226656",
"524106",
"12463199",
"3083108",
"1161413",
"14368654",
"15748070",
"3133074",
"6178681",
"15025517",
"13969233",
"5689680",
"154219234",
"2490523",
"16466140",
"6907266",
"14814205",
"16100865",
"17140573",
"13076968",
"142754635",
"54609922",
"15736835",
"6839776"
] | [
"4980671"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14326469 | 0 | 0 | 0 | 1 | 0 |
|||||
Reward Prediction Error Signals are Metarepresentational | 98,109 | Reward Prediction Error Signals are Metarepresentational Nicholas Shea ([email protected]) Faculty of Philosophy, University of Oxford 10 Merton Street, Oxford, OX1 4JJ, UK metarepresentations than this. But this result does show that there is at least one variety of metarepresentation that is found very widely in the animal kingdom. Metarepresentations are representations whose content in part concerns the content of another representation. The sentence: ‘The main headline in the Post today is in huge letters’ is not metarepresentational. It concerns another representation, but not its content. The sentence: ‘The main headline in the Post today is about Gaza’ is metarepresentational. To assess whether reward prediction error signals are metarepresentational I examine the standard information- processing account of their role in generating behaviour and ask what content RPEs would have to have for that account to be vindicated. Abstract Although there has been considerable debate about the existence of metarepresentational capacities in non-human animals and their scope in humans, the well-confirmed temporal difference reinforcement learning models of reward- guided decision making have been largely overlooked. This paper argues that the reward prediction error signals which are postulated by temporal difference models and have been discovered empirically through single unit recording and neuroimaging do have metarepresentational contents. Keywords: metarepresentation; metacognition; reward- guided decision making; temporal difference learning Introduction It is often argued that the capacity for metarepresentation is a particularly sophisticated cognitive achievement (Carruthers, 2008). In the animal literature authors debate whether success on tasks that seem to require self- monitoring can be achieved without metarepresentation (Carruthers, 2009; Hampton, 2001; Smith, 2009). The same question is debated about tasks that seem to require keeping track of the mental states of others (Hare, Call, & Tomasello, 2001; Heyes, 1998). It is assumed that evidence that non-human animals are processing metarepresentations is a sign of considerable psychological sophistication, even consciousness (Cowey & Stoerig, 1995; Smith, Shields, & Washburn, 2003; Stoerig, Zontanou, & Cowey, 2002); although some have argued that some forms of metarepresentation can be achieved more easily (Shea & Heyes, 2010). In developmental psychology the capacity to have beliefs about others’ belief states is seen as a particularly important developmental transition (Leslie, 1987; Perner, Frith, Leslie, & Leekam, 1989; Wimmer & Perner, 1983), although here too there is increasing evidence that some forms of very early behaviour depend upon representing or keeping track of others’ representations (Apperly & Butterfill, 2009; Onishi & Baillargeon, 2005; Surian, Caldi, & Sperber, 2007). This paper argues that there is already strong evidence of metarepresentation in a different literature – one in which issues about metarepresentation have seldom been canvassed. Research on reward-guided decision making has produced an impressive body of converging evidence that midbrain dopamine neurons generate a reward prediction error signal (RPE) that is causally involved in choice behaviour (Rushworth, Mars, & Summerfield, 2009). I argue that such RPEs carry a metarepresentational content. The system is conserved across primates and rodents, and perhaps more widely (Claridge-Chang et al., 2009). Some animals doubtless make more sophisticated use of Reward Prediction Errors The prediction error signal postulated by temporal difference learning models of reward-guided decision making (Sutton & Barto, 1998) was discovered empirically through single unit recording in the awake behaving macaque (Schultz, Dayan, & Montague, 1997). The central idea is that the brain keeps track of the expected value of various possible actions. When the animal performs an action, it computes an expected value of the current behaviour. When feedback does not match that expected value a prediction error signal is generated. The signal is used to update the stored representation of the value associated with that behaviour, by an amount given by the learning rate. For example if an animal pulls a lever for the first time and obtains a reward, that will generate a prediction error signal. The actual reward will have exceeded any expectation of reward. (If the animal has some general expectation of there being some rewards in this environment, then it will have a mild general expectation of reward.) So the unexpected reward will generate a prediction error signal. Normative models of reinforcement learning attempt to capture the best way of calculating what to do given a history of rewarded and unrewarded actions (under various computational constraints). The popular temporal difference models suggest that reward prediction error signals will be used to update the expected value of the chosen action. As a result, on future occasions the animal will expect slightly more from pressing the lever. How much more depends upon the learning rate. After enough learning, the animal will come to expect reward when it presses the lever. If it presses the lever and receives no reward, that will again create a RPE, but in the opposite direction. The effect will be to reduce the animal’s | [
{
"first": "Nicholas",
"middle": [],
"last": "Shea",
"suffix": ""
}
] | 2,012 | PMC4215192 | 10.1111/j.1468-0068.2012.00863.x | Nous | Nous | 2577932847,1608544732 | [
"4997651",
"1500693",
"16432340",
"146679742",
"91953853",
"4269412",
"87480140",
"147035891",
"8352764",
"8999496",
"3402554",
"11335311",
"3754088",
"9266387",
"145402517",
"62804368",
"14455400",
"42312620",
"18811319",
"198988883",
"18635646",
"146715498",
"2635253",
"1684121",
"9138170",
"9166388",
"17014009"
] | [
"149088548",
"5219287",
"35597871",
"7222372",
"124024846",
"55341618",
"8613083",
"43573062",
"215606550"
] | true | true | true | https://api.semanticscholar.org/CorpusID:98109 | 1 | 1 | 1 | 1 | 0 |
|||
Bodies in critique: a technological intervention in the dance production process | 20,601 | The dance production process is strongly influenced within the physical rehearsal space by social context factors and dynamics, such as intimacy of bodies, gender distribution, and the hierarchy of choreographers and dancers. Introducing online tools for asynchronous collaboration can change the traditional dance production process and impact the social dynamics of the group. We developed and deployed the Choreographer's Notebook, a web-based, collaborative, multi-modal annotation tool used in the creative process of making dance. We collected usage logs and choreographer reflections on the use of this tool, along with conducting interviews and focus groups, from the interdisciplinary perspectives of both technologists and choreographers involved in the project. We describe the socio-technical impacts of the Choreographer's Notebook based on the results of its usage in three dance productions. We analyze these case studies through various contextual lenses and provide a visualization of how the choreographic correction process evolved. | [
{
"first": "Erin",
"middle": [
"A."
],
"last": "Carroll",
"suffix": ""
},
{
"first": "Danielle",
"middle": [],
"last": "Lottridge",
"suffix": ""
},
{
"first": "Celine",
"middle": [],
"last": "Latulipe",
"suffix": ""
},
{
"first": "Vikash",
"middle": [],
"last": "Singh",
"suffix": ""
},
{
"first": "Melissa",
"middle": [],
"last": "Word",
"suffix": ""
}
] | 2,012 | 10.1145/2145204.2145311 | CSCW '12 | 2023258830 | [
"2353141",
"38930564",
"9747127",
"2730566",
"145183659",
"15974527",
"39645711",
"8357208",
"107453579",
"16443358",
"62674917",
"10544501"
] | [
"6397313",
"207951784",
"207949691",
"2474609",
"37796304",
"17411614",
"13974623",
"2032267",
"30673215",
"17698751"
] | true | true | true | https://api.semanticscholar.org/CorpusID:20601 | 0 | 0 | 0 | 1 | 0 |
|||||
Optimizing Stepwise Animation in Dynamic Set Diagrams | 199,019,149 | [
{
"first": "Kazuyo",
"middle": [],
"last": "Mizuno",
"suffix": ""
},
{
"first": "Hsiang‐Yun",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Shigeo",
"middle": [],
"last": "Takahashi",
"suffix": ""
},
{
"first": "Takeo",
"middle": [],
"last": "Igarashi",
"suffix": ""
}
] | 2,019 | 10.1111/cgf.13668 | Comput. Graph. Forum | Comput. Graph. Forum | 2960741261 | [
"17284815",
"28611743",
"33757309",
"2491686",
"7811633",
"145451562",
"13493472",
"2359926",
"11902800",
"41197592",
"9378352",
"7837939",
"6449078",
"215572337",
"17474363",
"301071",
"3253982",
"2268763",
"12354590",
"28611743",
"10864493",
"43457225",
"14961237",
"8760698",
"7216245"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:199019149 | 0 | 0 | 0 | 1 | 0 |
|||||
Understanding motivations for facebook use: usage metrics, network structure, and privacy | 7,514,559 | This study explores the links between motives for using a social network service and numerical measures of that activity. Specifically, it identified motives for Facebook use by employing a Uses and Gratifications (U&G) approach and then investigated the extent to which these motives can be predicted through usage and network metrics collected automatically via the Facebook API. In total, 11 Facebook usage metrics and eight personal network metrics served as predictors. Results showed that all three variable types in this expanded U&G frame of analysis (covering social antecedents, usage metrics, and personal network metrics) effectively predicted motives and highlighted interesting behaviors. To further illustrate the power of this framework, the intricate nature of privacy in social media was explored and relationships drawn between privacy attitudes (and acts) and measures of use and network structure. | [
{
"first": "Tasos",
"middle": [],
"last": "Spiliotopoulos",
"suffix": ""
},
{
"first": "Ian",
"middle": [],
"last": "Oakley",
"suffix": ""
}
] | 2,013 | 10.1145/2470654.2466449 | CHI '13 | 2075752188 | [
"143743751",
"10287408",
"12734918",
"334423",
"143857532",
"42404358",
"157848202",
"8060040",
"206518667",
"38733717",
"3207591",
"6096102",
"62570024",
"2876585",
"15194115",
"9151733",
"14263420",
"145396730",
"2703906",
"15480968",
"9542059",
"208950408",
"7195352",
"143751492",
"18014011",
"19829007",
"40293906",
"8167627",
"10772760",
"30715205",
"12993348",
"4429113",
"9896608"
] | [
"209102096",
"45808178",
"202537336",
"11267899",
"17301851",
"55736275",
"17413500",
"10093465",
"16545697",
"148824267",
"15186422",
"195296875",
"52049143",
"14177489",
"19036589",
"13642791",
"13639294",
"14564706",
"16542753",
"14699919",
"21711027",
"114012336",
"12892876",
"19321816",
"148321362"
] | true | true | true | https://api.semanticscholar.org/CorpusID:7514559 | 0 | 0 | 0 | 1 | 0 |
|||||
Contextual conditional models for smartphone-based human mobility prediction | 7,517,172 | Human behavior is often complex and context-dependent. This paper presents a general technique to exploit this "multidimensional" contextual variable for human mobility prediction. We use an ensemble method, in which we extract different mobility patterns with multiple models and then combine these models under a probabilistic framework. The key idea lies in the assumption that human mobility can be explained by several mobility patterns that depend on a sub-set of the contextual variables and these can be learned by a simple model. We showed how this idea can be applied to two specific online prediction tasks: what is the next place a user will visit? and how long will he stay in the current place?. Using smartphone data collected from 153 users during 17 months, we show the potential of our method in predicting human mobility in real life. | [
{
"first": "Trinh",
"middle": [
"Minh",
"Tri"
],
"last": "Do",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Gatica-Perez",
"suffix": ""
}
] | 2,012 | 10.1145/2370216.2370242 | UbiComp '12 | 2099141754 | [
"40231239",
"17327075",
"18297892",
"1480192",
"6965704",
"4419468",
"11312042",
"1794214",
"1135001",
"7356506",
"1737809",
"2529718",
"125672439",
"15019801",
"17427999",
"15577108",
"578811",
"11059219",
"61625149",
"1313148",
"1838308",
"348197"
] | [
"2936217",
"475072",
"34326723",
"366670",
"55817055",
"52152285",
"117195359",
"19216274",
"51988280",
"1383249",
"572020",
"14157570",
"3462608",
"195491531",
"16169179",
"8083837",
"57378291",
"207109343",
"16602825",
"125354207",
"14548097",
"3499442",
"1699258",
"7782681",
"14122102",
"9742610",
"20630302",
"8575525",
"69749928",
"11437227",
"67870800",
"10691955",
"211041049",
"15289953",
"4563037",
"6170080",
"211038224",
"54457550",
"37386348",
"3416660",
"17173497",
"49537851",
"30453625",
"69408349",
"201066722",
"22887792",
"2747064",
"54626204",
"18909607",
"17386191",
"3330896",
"19951326",
"9615393",
"52915634",
"208202015",
"18615903",
"126634826",
"2749757",
"34781957",
"15799693",
"198930515",
"211521621",
"4894198",
"4556934"
] | true | true | true | https://api.semanticscholar.org/CorpusID:7517172 | 1 | 1 | 1 | 1 | 1 |
|||||
1 thumb, 4 buttons, 20 words per minute: design and evaluation of H4-writer | 16,452,441 | We present what we believe is the most efficient and quickest four-key text entry method available. H4-Writer uses Huffman coding to assign minimized key sequences to letters, with full access to error correction, punctuation, digits, modes, etc. The key sequences are learned quickly, and support eyes-free entry. With KSPC = 2.321, the effort to enter text is comparable to multitap on a mobile phone keypad; yet multitap requires nine keys. In a longitudinal study with six participants, an average text entry speed of 20.4 wpm was observed in the 10th session. Error rates were under 1%. To improve external validity, an extended session was included that required input of punctuation and other symbols. Entry speed dropped only by about 3 wpm, suggesting participants quickly leveraged their acquired skill with H4-Writer to access advanced features. | [
{
"first": "I.",
"middle": [
"Scott"
],
"last": "MacKenzie",
"suffix": ""
},
{
"first": "R.",
"middle": [
"William"
],
"last": "Soukoreff",
"suffix": ""
},
{
"first": "Joanna",
"middle": [],
"last": "Helga",
"suffix": ""
}
] | 2,011 | 10.1145/2047196.2047258 | UIST '11 | 2167854962 | [
"1343914",
"15441232",
"14075013",
"10202039",
"9301506",
"13025024",
"5293431",
"14910725",
"59010092",
"30289375",
"7001157",
"349188",
"13896547",
"18870413",
"16236198",
"30855924",
"5107366",
"59845310",
"2820058",
"8474622",
"16686389",
"10870237"
] | [
"14444901",
"21680761",
"5432027",
"9626619",
"8385573",
"16102190",
"203631166",
"543823",
"22408696",
"12202272",
"2602429",
"52171440",
"203579571",
"195845259",
"190231062",
"13568308",
"16718547",
"7923987",
"35439915",
"37000019",
"16083774",
"10035158",
"12955660",
"14372598",
"17175514",
"8387137"
] | true | true | true | https://api.semanticscholar.org/CorpusID:16452441 | 0 | 0 | 0 | 1 | 0 |
|||||
Group Modeling: A Unified Velocity-Based Approach | 31,585,623 | Crowd simulators are commonly used to populate movie or game scenes in the entertainment industry. Even though it is crucial to consider the presence of groups for the believability of a virtual crowd, most crowd simulations only take into account individual characters or a limited set of group behaviors. We introduce a unified solution that allows for simulations of crowds that have diverse group properties such as social groups, marches, tourists and guides, etc. We extend the Velocity Obstacle approach for agent based crowd simulations by introducing Velocity Connection; the set of velocities that keep agents moving together whilst avoiding collisions and achieving goals. We demonstrate our approach to be robust, controllable, and able to cover a large set of group behaviors. | [
{
"first": "Zhiguo",
"middle": [],
"last": "Ren",
"suffix": ""
},
{
"first": "Panayiotis",
"middle": [],
"last": "Charalambous",
"suffix": ""
},
{
"first": "Julien",
"middle": [],
"last": "Bruneau",
"suffix": ""
},
{
"first": "Qunsheng",
"middle": [],
"last": "Peng",
"suffix": ""
},
{
"first": "Julien",
"middle": [],
"last": "Pettré",
"suffix": ""
}
] | 2,017 | 10.1111/cgf.12993 | Comput. Graph. Forum | Comput. Graph. Forum | 2523534162 | [] | [
"54438724",
"198986250",
"59604952",
"53345209",
"52122947",
"203626717"
] | false | true | false | https://api.semanticscholar.org/CorpusID:31585623 | null | null | null | null | null |
||||
Improving audio conferencing: are two ears better than one? | 14,841,108 | In this paper, we describe a range of audio problems that impact the effectiveness of audio conferences and detail the solutions we have devised to address these problems. We conducted an audio quality assessment to determine how differences in quality impact audio clarity, a remote person's experience connecting to a conference room , and social presence. Based on the results of this assessment, we examine the costs and benefits of increasing audio fidelity with respect to the network resources needed to support high-fidelity audio conferencing. | [
{
"first": "Nicole",
"middle": [],
"last": "Yankelovich",
"suffix": ""
},
{
"first": "Jonathan",
"middle": [],
"last": "Kaplan",
"suffix": ""
},
{
"first": "Joe",
"middle": [],
"last": "Provino",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Wessler",
"suffix": ""
},
{
"first": "Joan",
"middle": [
"Morris"
],
"last": "DiMicco",
"suffix": ""
}
] | 2,006 | 10.1145/1180875.1180926 | CSCW '06 | 2041153019 | [
"47347785",
"1031788",
"18236971",
"33624128",
"62547815",
"54794300",
"9353702",
"119748989",
"4228276",
"56533089",
"122170834",
"143430507",
"44057414",
"5354099",
"144731157",
"6381882",
"15690742",
"13962361",
"14650227",
"16442370",
"15737324",
"8429419"
] | [
"17820729",
"6018662",
"12116818",
"36777528",
"28428056",
"209337074",
"5432852",
"11111487",
"2572192",
"52798570",
"17627442",
"32670229",
"17934325",
"112310138",
"16398687"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14841108 | 0 | 0 | 0 | 1 | 0 |
|||||
Chorus: a crowd-powered conversational assistant | 10,432,208 | Despite decades of research attempting to establish conversational interaction between humans and computers, the capabilities of automated conversational systems are still limited. In this paper, we introduce Chorus, a crowd-powered conversational assistant. When using Chorus, end users converse continuously with what appears to be a single conversational partner. Behind the scenes, Chorus leverages multiple crowd workers to propose and vote on responses. A shared memory space helps the dynamic crowd workforce maintain consistency, and a game-theoretic incentive mechanism helps to balance their efforts between proposing and voting. Studies with 12 end users and 100 crowd workers demonstrate that Chorus can provide accurate, topical responses, answering nearly 93% of user queries appropriately, and staying on-topic in over 95% of responses. We also observed that Chorus has advantages over pairing an end user with a single crowd worker and end users completing their own tasks in terms of speed, quality, and breadth of assistance. Chorus demonstrates a new future in which conversational assistants are made usable in the real world by combining human and machine intelligence, and may enable a useful new way of interacting with the crowds powering other systems. | [
{
"first": "Walter",
"middle": [
"S."
],
"last": "Lasecki",
"suffix": ""
},
{
"first": "Rachel",
"middle": [],
"last": "Wesley",
"suffix": ""
},
{
"first": "Jeffrey",
"middle": [],
"last": "Nichols",
"suffix": ""
},
{
"first": "Anand",
"middle": [],
"last": "Kulkarni",
"suffix": ""
},
{
"first": "James",
"middle": [
"F."
],
"last": "Allen",
"suffix": ""
},
{
"first": "Jeffrey",
"middle": [
"P."
],
"last": "Bigham",
"suffix": ""
}
] | 2,013 | 10.1145/2501988.2502057 | UIST '13 | 2163986367 | [
"7717376",
"14112040",
"6921166",
"14429309",
"53228157",
"15068889",
"207179082",
"7595450",
"4389135",
"32084196",
"18005229",
"2010029",
"1392457",
"444193",
"478154",
"571148",
"436695",
"5805936",
"5707841",
"12954798",
"27438899",
"338469",
"67300401",
"9522975"
] | [
"436695",
"157059771",
"53236606",
"5041635",
"51937592",
"707201",
"14449127",
"3681400",
"14625531",
"3637018",
"32346894",
"1298020",
"10476456",
"14035281",
"4728277",
"37489019",
"3428271",
"49416931",
"52264161",
"2904713",
"3062923",
"1901332",
"6794513",
"8149335",
"46003",
"8201109",
"3645507",
"52293295",
"53081319",
"5073752",
"10522533",
"3637700",
"4949375",
"2879474",
"10131409",
"17037053",
"3353484",
"10369543",
"1671288",
"150381981",
"207216527",
"1310556",
"3934714",
"42877084",
"24786392",
"18811722",
"26531161",
"3623482",
"1312027",
"1638836",
"210847912",
"2984397",
"15513496",
"16636296",
"196204042",
"6268539",
"9165030",
"202630047",
"212725080",
"13887284",
"29594630",
"54461677",
"6789610",
"202565849",
"53288508",
"5926545",
"207951778",
"207242814",
"7924117",
"23229330",
"14489774",
"17715975",
"5040917",
"637755",
"209168060",
"67773245"
] | true | true | true | https://api.semanticscholar.org/CorpusID:10432208 | 0 | 0 | 0 | 1 | 0 |
|||||
Peripheral Popout: The Influence of Visual Angle and Stimulus Intensity on Popout Effects | 10,432,386 | By exploiting visual popout effects, interface designers can rapidly draw a user's attention to salient information objects in a display. A variety of different visual stimuli can be used to achieve popout effects, including color, shape, size, motion, luminance, and flashing. However, there is a lack of understanding about how accurately different intensities of these effects support popout, particularly as targets move further from the center of the visual field. We therefore conducted a study to examine the accuracy of popout target identification using different visual variables, each at five different levels of intensity, and at a wide range of angles from the display center. Results show that motion is a strong popout stimulus, even at low intensities and wide angles. Identification accuracy decreases rapidly across visual angle with other popout stimuli, particularly with shape and color. The findings have relevance to a wide variety of applications, particularly as multi-display desktop environments increase in size and visual extent. | [
{
"first": "Carl",
"middle": [],
"last": "Gutwin",
"suffix": ""
},
{
"first": "Andy",
"middle": [],
"last": "Cockburn",
"suffix": ""
},
{
"first": "Ashley",
"middle": [],
"last": "Coveney",
"suffix": ""
}
] | 2,017 | 10.1145/3025453.3025984 | Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems | 2610192316 | [
"35528877",
"2947188",
"5610826",
"15379592",
"24649779",
"13366193",
"8056977",
"60586862",
"62541179",
"7081161",
"6143322",
"15201566",
"207187106",
"8047841",
"182197",
"18657147",
"14049677",
"2329233",
"140886812",
"207158977",
"60055000",
"4918697",
"16724789",
"10336776",
"32540523",
"207706126",
"31823831",
"43085553",
"13263693",
"14197500",
"57166078",
"36391827",
"195603137",
"14845765",
"16901865"
] | [
"195874362",
"199064646",
"212427787",
"83458674",
"5041528",
"52057144",
"140239801",
"140069669",
"198231159",
"22907893",
"58672787"
] | true | true | true | https://api.semanticscholar.org/CorpusID:10432386 | 0 | 0 | 0 | 1 | 0 |
|||||
An event language for building user interface frameworks | 18,206,205 | Languages based on the event model are widely regarded as expressive and flexible notations for the specification of interactive graphical user interfaces. However, until now, they have only been used to specify and implement the dialogue control component of user interfaces. This paper presents an extension of the event model. A computable notation, the event language, based on this is used to construct a complete user interface framework. The framework forms the runtime component of a UIMS. The event language allows the modular construction of complex event systems. This is supported by the addition of a tagged addressing mode. Furthermore, the control structure of event handlers is extended with exception management, permitting unspecified events and thereby facilitating the use of predefined building blocks. A general purpose run-time framework for user interfaces has been constructed using the event language. We present the architecture of the presentation component of this framework including the window manager and the I/O model. | [
{
"first": "N.",
"middle": [
"V."
],
"last": "Carlsen",
"suffix": ""
},
{
"first": "N.",
"middle": [
"J."
],
"last": "Christensen",
"suffix": ""
},
{
"first": "H.",
"middle": [
"A."
],
"last": "Tucker",
"suffix": ""
}
] | 1,989 | 10.1145/73660.73677 | UIST '89 | 2078129788 | [
"16845684",
"15763029",
"1841990",
"2658769",
"15081539",
"60062806",
"9932412",
"19590008"
] | [
"13651253",
"15163234",
"5209178"
] | true | true | true | https://api.semanticscholar.org/CorpusID:18206205 | 0 | 0 | 0 | 1 | 0 |
|||||
Boosting topic-based publish-subscribe systems with dynamic clustering | 6,551,917 | We consider in this paper a class of Publish-Subscribe (pub-sub) systems called topic-based systems, where users subscribe to topics and are notified on events that belong to those subscribed topics. With the recent flourishing of RSS news syndication, these systems are regaining popularity and are raising new challenging problems. In most of the modern topics-based systems, the events in each topic are delivered to the subscribers via a supporting, distributed, data structure (typically a multicast tree). Since peers in the network may come and go frequently, this supporting structure must be continuously maintained so that "holes" do not disrupt the events delivery. The dissemination of events in each topic thus incurs two main costs: (1) the actual transmission cost for the topic events,and (2) the maintenance cost for its supporting structure. This maintenance overhead becomes particularly dominating when a pub-sub system supports a large number of topics with moderate event frequency; a typical scenario in nowadays news syndication scene. The goal of this paper is to devise a method for reducing this maintenance overhead to the minimum. Our aim is not to invent yet another topic-based pub-sub system, but rather to develop a generic technique for better utilization of existing platforms. Our solution is based on a novel distributed clustering algorithm that utilizes correlations between user subscriptions to dynamically group topics together, into virtual topics (called topic-clusters), andt hereby unifies their supporting structures and reduces costs. Our technique continuously adapts the topic-clusters and the user subscriptions to the system state, and incurs only very minimal overhead. We have implemented our solution in the Tamara pub-sub system. Our experimental study shows this approach to be extremely effective, improving the performance by an order of magnitude. | [
{
"first": "Tova",
"middle": [],
"last": "Milo",
"suffix": ""
},
{
"first": "Tal",
"middle": [],
"last": "Zur",
"suffix": ""
},
{
"first": "Elad",
"middle": [],
"last": "Verbin",
"suffix": ""
}
] | 2,007 | 10.1145/1247480.1247563 | SIGMOD '07 | 2137218888 | [
"124078660",
"7666317",
"7171982",
"899542",
"7182462",
"2942785",
"2596226",
"5577730",
"16277747",
"10134633",
"12003435",
"347491",
"5877972",
"7572118",
"7072411",
"3756850",
"2200101",
"8457141",
"18878948",
"207787803",
"59837960",
"1762374",
"1378643"
] | [
"17612948",
"15303740",
"15333450",
"211259513",
"10234048",
"25414974",
"16565165",
"18632099",
"9702472",
"15282098",
"1137840",
"13263584",
"12259418",
"19856802",
"854303",
"1962735",
"7800882",
"14646860",
"55351787",
"18473756",
"14335321",
"13640199",
"207929980",
"15533071",
"46565934",
"31532066",
"218017",
"14084472"
] | true | true | true | https://api.semanticscholar.org/CorpusID:6551917 | 1 | 1 | 1 | 1 | 1 |
|||||
Subjective Knowledge Base Construction Powered By Crowdsourcing and Knowledge Base | 44,070,055 | Knowledge base construction (KBC) has become a hot and in-time topic recently with the increasing application need of large-scale knowledge bases (KBs), such as semantic search, QA systems, the Google Knowledge Graph and IBM Watson QA System. Existing KBs mainly focus on encoding the factual facts of the world, e.g., city area and company product, which are regarded as the objective knowledge, whereas the subjective knowledge, which is frequently mentioned in Web queries, has been neglected. The subjective knowledge has no documented ground truth, instead, the truth relies on people's dominant opinion, which can be solicited from online crowd workers. In our work, we propose a KBC framework for subjective knowledge base construction taking advantage of the knowledge from the crowd and existing KBs. We develop a two-staged framework for subjective KB construction which consists of core subjective KB construction and subjective KB enrichment. Firstly, we try to build a core subjective KB mined from existing KBs, where every instance has rich objective properties. Then, we populate the core subjective KB with instances extracted from existing KBs, in which the crowd is leverage to annotate the subjective property of the instances. In order to optimize the crowd annotation process, we formulate the problem of subjective KB enrichment procedure as a cost-aware instance annotation problem and propose two instance annotation algorithms, i.e., adaptive instance annotation and batch-mode instance annotation algorithms. We develop a two-stage system for subjective KB construction which consists of core subjective KB construction and subjective knowledge enrichment. We evaluate our framework on real knowledge bases and a real crowdsourcing platform, the experimental results show that we can derive high quality subjective knowledge facts from existing KBs and crowdsourcing techniques through our proposed framework. | [
{
"first": "Hao",
"middle": [],
"last": "Xin",
"suffix": ""
},
{
"first": "Rui",
"middle": [],
"last": "Meng",
"suffix": ""
},
{
"first": "Lei",
"middle": [],
"last": "Chen",
"suffix": ""
}
] | 2,018 | 10.1145/3183713.3183732 | SIGMOD '18 | 2799154098 | [
"594956",
"12820280",
"207167677",
"11974604",
"8005911",
"5280230",
"9912280",
"9271857",
"4282649",
"4557963",
"6755965",
"8264643",
"15979818",
"14481127",
"2165063",
"7145148",
"2701142",
"3628107",
"3690214",
"17162816",
"14019994",
"207846993",
"616658",
"15271865",
"49652937",
"1545689",
"2971375",
"17823957",
"11823620",
"14775471",
"814656",
"207223616"
] | [
"67855401",
"201070837",
"201839375"
] | true | true | true | https://api.semanticscholar.org/CorpusID:44070055 | 0 | 0 | 0 | 1 | 0 |
|||||
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates | 10,786,211 | In many domains such as computational geometry and database management, an object may be described by multiple instances (points). Then the distance (or similarity) between two objects is captured by the pair-wise distances among their instances. In the past, numerous nearest neighbor (NN) functions have been proposed to define the distance between objects with multiple instances and to identify the NN object. Nevertheless, considering that a user may not have a specific NN function in mind, it is desirable to provide her with a set of NN candidates. Ideally, the set of NN candidates must include every object that is NN for at least one of the NN functions and must exclude every non-promising object. However, no one has studied the problem of NN candidates computation from this perspective. Although some of the existing works aim at returning a set of candidate objects, they do not focus on the NN functions while computing the candidate objects. As a result, they either fail to include an NN object w.r.t. some NN functions or include a large number of unnecessary objects that have no potential to be the NN regardless of the NN functions. Motivated by this, we classify the existing NN functions for objects with multiple instances into three families by characterizing their key features. Then, we advocate three spatial dominance operators to compute NN candidates where each operator is optimal w.r.t. different coverage of NN functions. Efficient algorithms are proposed for the dominance check and corresponding NN candidates computation. Extensive empirical study on real and synthetic datasets shows that our proposed operators can significantly reduce the number of NN candidates. The comprehensive performance evaluation demonstrates the efficiency of our computation techniques. | [
{
"first": "Xiaoyang",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Ying",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Wenjie",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Xuemin",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Muhammad Aamir",
"middle": [],
"last": "Cheema",
"suffix": ""
}
] | 2,015 | 10.1145/2723372.2749442 | SIGMOD '15 | 1994987703 | [
"209855553",
"6856721",
"59915",
"45928111",
"16627611",
"5478392",
"5812098",
"6433885",
"791068",
"2941443",
"11339363",
"6033958",
"206927163",
"14764858",
"6337210",
"435530",
"207631857",
"10294067",
"9584156",
"16123538",
"3206747",
"14316748",
"10445840",
"1068371",
"13939244",
"904463",
"60563180",
"1431167",
"15037331",
"206782514",
"8463314",
"13822464",
"351737",
"14199865",
"10066890",
"3998056",
"34586206",
"6189335",
"1253492",
"14879365"
] | [
"43063069"
] | true | true | true | https://api.semanticscholar.org/CorpusID:10786211 | 0 | 0 | 0 | 1 | 0 |
|||||
Naranjo Question Answering using End-to-End Multi-task Learning Model | 196,186,712 | In the clinical domain, it is important to understand whether an adverse drug reaction (ADR) is caused by a particular medication. Clinical judgement studies help judge the causal relation between a medication and its ADRs. In this study, we present the first attempt to automatically infer the causality between a drug and an ADR from electronic health records (EHRs) by answering the Naranjo questionnaire, the validated clinical question answering set used by domain experts for ADR causality assessment. Using physicians' annotation as the gold standard, our proposed joint model, which uses multi-task learning to predict the answers of a subset of the Naranjo questionnaire, significantly outperforms the baseline pipeline model with a good margin, achieving a macro-weighted f-score between 0.3652-0.5271 and micro-weighted f-score between 0.9523-0.9918. | [
{
"first": "Bhanu",
"middle": [
"Pratap",
"Singh"
],
"last": "Rawat",
"suffix": ""
},
{
"first": "Fei",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Hong",
"middle": [],
"last": "Yu",
"suffix": ""
}
] | 2,019 | PMC6887102 | 10.1145/3292500.3330770 | Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining | 2952778987 | [
"12938495",
"9605730",
"207752942",
"71606758",
"7476189",
"1856462",
"15041736",
"43637778",
"13929880",
"1998416",
"7928230",
"13836259",
"9325955",
"8535316",
"15165928",
"12501880",
"207878852"
] | [
"203649055"
] | true | true | true | https://api.semanticscholar.org/CorpusID:196186712 | 1 | 1 | 1 | 1 | 1 |
||||
It's all in your head: Effects of expertise on real-time access to knowledge during written sentence processing. | 21,470,308 | [
{
"first": "Melissa",
"middle": [],
"last": "Troyer",
"suffix": ""
},
{
"first": "Marta",
"middle": [],
"last": "Kutas",
"suffix": ""
}
] | 2,017 | CogSci | 2785636481 | [
"17441057",
"18495655",
"14989852",
"6003843",
"16923492",
"1382152",
"4663616",
"51425",
"30291044",
"207654867",
"215572981",
"807660",
"14860777"
] | [
"195879877"
] | true | true | true | https://api.semanticscholar.org/CorpusID:21470308 | 0 | 0 | 0 | 1 | 0 |
|||||||
ADHD modulates link between event processing and recall. | 27,956,477 | [
{
"first": "Robbie",
"middle": [
"A."
],
"last": "Ross",
"suffix": ""
},
{
"first": "Leah",
"middle": [],
"last": "Child",
"suffix": ""
},
{
"first": "Dare",
"middle": [
"A."
],
"last": "Baldwin",
"suffix": ""
}
] | 2,016 | CogSci | 2786576514 | [] | [] | false | false | true | https://api.semanticscholar.org/CorpusID:27956477 | 0 | 0 | 0 | 0 | 0 |
|||||||
TSP: Mining top-k closed sequential patterns | 35,691,854 | Sequential pattern mining has been studied extensively in the data mining community. Most previous studies require the specification of a min_support threshold for mining a complete set of sequential patterns satisfying the threshold. However, in practice, it is difficult for users to provide an appropriate min_support threshold. To overcome this difficulty, we propose an alternative mining task: mining top-k frequent closed sequential patterns of length no less than min_ℓ, where k is the desired number of closed sequential patterns to be mined and min_ℓ is the minimal length of each pattern. We mine the set of closed patterns because it is a compact representation of the complete set of frequent patterns. An efficient algorithm, called TSP, is developed for mining such patterns without min_support. Starting at (absolute) min_support=1, the algorithm makes use of the length constraint and the properties of top-k closed sequential patterns to perform dynamic support raising and projected database pruning. Our extensive performance study shows that TSP has high performance. In most cases, it outperforms the efficient closed sequential pattern-mining algorithm, CloSpan, even when the latter is running with the best tuned min_support threshold. Thus, we conclude that, for sequential pattern mining, mining top-k frequent closed sequential patterns without min_support is more preferable than the traditional min_support-based mining. | [
{
"first": "Petre",
"middle": [],
"last": "Tzvetkov",
"suffix": ""
},
{
"first": "Xifeng",
"middle": [],
"last": "Yan",
"suffix": ""
},
{
"first": "Jiawei",
"middle": [],
"last": "Han",
"suffix": ""
}
] | 2,004 | 10.1007/s10115-004-0175-4 | Knowledge and Information Systems | Knowledge and Information Systems | 1556242451 | [
"2706742",
"12242182",
"59848750",
"62023742",
"8510933",
"206061455",
"40075957",
"6059661",
"2234603",
"10522882",
"10975598",
"10084934",
"206782042",
"59809925",
"14763104",
"5387869",
"15259097"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:35691854 | 0 | 0 | 0 | 1 | 0 |
||||
A multi-relational approach to spatial classification | 2,357,042 | Spatial classification is the task of learning models to predict class labels based on the features of entities as well as the spatial relationships to other entities and their features. Spatial data can be represented as multi-relational data, however it presents novel challenges not present in multi-relational problems. One such problem is that spatial relationships are embedded in space, unknown a priori, and it is part of the algorithm's task to determine which relationships are important and what properties to consider. In order to determine when two entities are spatially related in an adaptive and non-parametric way, we propose a Voronoi-based neighbourhood definition upon which spatial literals can be built. Properties of these neighbourhoods also need to be described and used for classification purposes. Non-spatial aggregation literals already exist within the multi-relational framework, but are not sufficient for comprehensive spatial classification. A formal set of additions to the multi-relational data mining framework is proposed, to be able to represent spatial aggregations as well as spatial features and literals. These additions allow for capturing more complex interactions and spatial occurrences such as spatial trends. In order to more efficiently perform the rule learning and exploit powerful multi-processor machines, a scalable parallelized method capable of reducing the runtime by several factors is presented. The method is compared against existing methods by experimental evaluation on a real world crime dataset which demonstrate the importance of the neighbourhood definition and the advantages of parallelization. | [
{
"first": "Richard",
"middle": [],
"last": "Frank",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Ester",
"suffix": ""
},
{
"first": "Arno",
"middle": [],
"last": "Knobbe",
"suffix": ""
}
] | 2,009 | 10.1145/1557019.1557058 | KDD | 2088340438 | [
"2559730",
"9350650",
"52008726",
"11644282",
"35360134",
"6426061",
"206635896",
"129804586",
"2604002",
"449500",
"8502859",
"19172678",
"119604258",
"16541530",
"16455032",
"41831157",
"17200694",
"3168358",
"13666676",
"137701665",
"1183403"
] | [
"15182525",
"158667508",
"7902458",
"17700540",
"17490373",
"14530150",
"15268972",
"157063339",
"16617849",
"189807263",
"14708437",
"212647488",
"13946943",
"6993409",
"52084049"
] | true | true | true | https://api.semanticscholar.org/CorpusID:2357042 | 1 | 1 | 1 | 1 | 1 |
|||||
On the shape of a set of points and lines in the plane | 5,557,689 | Detailed geometric models of the real world are in increasing demand. LiDAR data is appropriate to reconstruct urban models. In urban scenes, the individual surfaces can be reconstructed and connected to form the scene geometry. There are various methods for reconstructing the free-form shape of a point sample on a single surface. However, these methods do not take the context of the surface into account. We present the guided α-shape: an extension of the well known α-shape that uses lines (guides) to indicate preferred locations for the boundary of the shape. The guided α-shape uses (parts of) these lines as boundary where the points suggest that this is appropriate. We prove that the guided α-shape can be constructed in O((n + m) log (n + m)) time, from an input of n points and m guides. We apply guided α-shapes to urban reconstruction from LiDAR, where neighboring surfaces can be connected conveniently along their intersection lines into adjacent surfaces of a 3D model. We analyze guided α-shapes of both synthetic and real data and show they are consistently better than α-shapes for this application. | [
{
"first": "M.",
"middle": [
"van"
],
"last": "Kreveld",
"suffix": ""
},
{
"first": "T.",
"middle": [
"van"
],
"last": "Lankveld",
"suffix": ""
},
{
"first": "Remco",
"middle": [
"C."
],
"last": "Veltkamp",
"suffix": ""
}
] | 2,011 | 10.1111/j.1467-8659.2011.02029.x | Comput. Graph. Forum | Comput. Graph. Forum | 2080995373 | [
"577942",
"17063597",
"8401970",
"6983029",
"15433224",
"3770886",
"6579258",
"18795257",
"207714088",
"868871",
"10264176",
"2006488",
"7779419",
"12349413",
"11729271",
"38639583",
"14948443",
"12808318"
] | [
"207758598",
"52051952",
"2793595",
"211137642"
] | true | true | true | https://api.semanticscholar.org/CorpusID:5557689 | 1 | 1 | 1 | 1 | 1 |
||||
Generating a Texture Map from Object-Surface Texture Data | 34,790,933 | A number of 3D digitizing methods, including stereopsis, are capable of measuring not only an object's shape but also its surface texture. Measured shape data can be expressed as a polyhedron whose faces are triangular, and object-surface texture data can be represented in the form of color data for each of the vertices of the various triangles. The ability to apply object-surface texture data directly to the creation of computer graphics images has been severely limited by the extreme difficulty of expressing such texture data in the image from which conventional texture mapping proceeds commonly referred to as a texture map. Proposed here is a method that generates a texture map from object-surface texture data. First, the method reduces the number of triangles in the polyhedron while preserving essentially all the color data that it originally contained. Next, it arranges the triangles in the simplified triangle mesh onto a plane, and generates a texture map from this arrangement. This method preserves the full texture of an object, no matter how complex its shape, an advantage over the conventional cylindrical texture representation approach. Furthermore, since essentially all color data has been retained, the reduction in the number of triangles does not produce any significant reduction in the texture-realism of the object image produced. | [
{
"first": "Makoto",
"middle": [],
"last": "Maruya",
"suffix": ""
}
] | 1,995 | 10.1111/j.1467-8659.1995.cgf143_0397.x | Comput. Graph. Forum | Comput. Graph. Forum | 2142949488 | [] | [
"9999050",
"18692360",
"14607051",
"6641429",
"13331167",
"12991975",
"2352913",
"17808542",
"9134898",
"53062348",
"5575945",
"10894133",
"2800522",
"2928702",
"54015914",
"16492107",
"729237",
"5120030"
] | false | true | false | https://api.semanticscholar.org/CorpusID:34790933 | null | null | null | null | null |
||||
Interactive curating of user tags for audiovisual archives | 18,454,212 | With the rapidly increasing popularity of social sharing sites, the traditional manual indexing techniques are no longer feasible to cope with the growing amount of multimedia content. Emerging folksonomies of user tags through crowdsourcing provide a potential for the collaborative annotation of various types of online multimedia resources. However, the shortcomings of folksonomies still present researchers with challenges to effectively use the collected user tags in professional or public collections. Examples of such challenges are determining how to tackle the quality of tags, to understand tags' meaning and relevance to the resource material, and to define quality parameters of the final (targeted) annotations of multimedia resources. This work addresses such challenges in a concrete use case -- the crowdsourcing video annotation game called Waisda?. This game is used to collect user tags for videos from the Dutch National Audiovisual Archive 'Sound and Vision'. In this paper we explore the interactive aspects of a post-game crowdsourcing tool called 'Tag Gardening' for curating user tags. We tackle the challenges of bringing out quality and extracting meaning from the user tags in order to finally achieve satisfactory video annotations. | [
{
"first": "Yi-Ling",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Lora",
"middle": [],
"last": "Aroyo",
"suffix": ""
}
] | 2,012 | 10.1145/2254556.2254685 | AVI | 2073708492 | [
"3656020",
"15380734",
"14065988",
"14793254",
"108876451",
"302288",
"62594207",
"207167403",
"14002349",
"18664081"
] | [
"20268652",
"18023772",
"199441037",
"9767871"
] | true | true | true | https://api.semanticscholar.org/CorpusID:18454212 | 0 | 0 | 0 | 1 | 0 |
|||||
Metro Map Colour-Coding: Effect on Usability in Route Tracing | 4,540,350 | Does the choice of colour-coding scheme affect the usability of metro maps, as measured by the accuracy and speed of navigation? Using colour to differentiate lines or services in maps of metro rail networks has been a common practice around the world for many decades. Broadly speaking, there are two basic schemes: ‘route colouring’, in which each end-to-end route has a distinct colour, and ‘trunk colouring’, in which each major trunk has a distinct colour, and the individual routes inherit the colour of the main trunk that they run along. A third, intermediate scheme is ‘shaded colouring’, in which each trunk has a distinct colour, and each route has a distinct shade of that colour. In this study, 285 volunteers in the US were randomised to these three colour-coding schemes and performed seventeen navigational tasks. Each task involved tracing a route in the New York City subway map. Overall, we found that route colouring was significantly more accurate than the trunk- and shaded-colouring schemes. A planned subset analysis, however, revealed major differences between specific navigational hazards: route colouring performed better only against certain navigational hazards; trunk colouring performed best against one hazard; and other hazards showed no effect of colour coding. Route colouring was significantly faster only in one subset. | [
{
"first": "Peter B.",
"middle": [],
"last": "Lloyd",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Rodgers",
"suffix": ""
},
{
"first": "Maxwell J.",
"middle": [],
"last": "Roberts",
"suffix": ""
}
] | 2,018 | 10.1007/978-3-319-91376-6_38 | Diagrams | 2803666091 | [
"15627542",
"140563384",
"4382422",
"143549398",
"62586464",
"14270987",
"15654531",
"1502993",
"6774874",
"126254470",
"53927757",
"59673757",
"114240897",
"135182460",
"1397084",
"12194705"
] | [
"204823857",
"203629127",
"208012564",
"195882561"
] | true | true | true | https://api.semanticscholar.org/CorpusID:4540350 | 1 | 1 | 1 | 1 | 1 |
|||||
Robust Ensemble Clustering by Matrix Completion | 1,013,100 | Data clustering is an important task and has found applications in numerous real-world problems. Since no single clustering algorithm is able to identify all different types of cluster shapes and structures, ensemble clustering was proposed to combine different partitions of the same data generated by multiple clustering algorithms. The key idea of most ensemble clustering algorithms is to find a partition that is consistent with most of the available partitions of the input data. One problem with these algorithms is their inability to handle uncertain data pairs, i.e. data pairs for which about half of the partitions put them into the same cluster and the other half do the opposite. When the number of uncertain data pairs is large, they can mislead the ensemble clustering algorithm in generating the final partition. To overcome this limitation, we propose an ensemble clustering approach based on the technique of matrix completion. The proposed algorithm constructs a partially observed similarity matrix based on the data pairs whose cluster memberships are agreed upon by most of the clustering algorithms in the ensemble. It then deploys the matrix completion algorithm to complete the similarity matrix. The final data partition is computed by applying an efficient spectral clustering algorithm to the completed matrix. Our empirical studies with multiple real-world datasets show that the proposed algorithm performs significantly better than the state-of-the-art algorithms for ensemble clustering. | [
{
"first": "Jinfeng",
"middle": [],
"last": "Yi",
"suffix": ""
},
{
"first": "Tianbao",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Rong",
"middle": [],
"last": "Jin",
"suffix": ""
},
{
"first": "A.",
"middle": [
"K."
],
"last": "Jain",
"suffix": ""
},
{
"first": "M.",
"middle": [],
"last": "Mahdavi",
"suffix": ""
}
] | 2,012 | 10.1109/ICDM.2012.123 | 2012 IEEE 12th International Conference on Data Mining | 2012 IEEE 12th International Conference on Data Mining | 2037984690 | [
"16612326",
"30806637",
"5640476",
"1255437",
"6703419",
"15359596",
"2071045",
"13411696",
"13411696",
"59849738",
"10939614",
"10316033",
"2221217",
"8148915",
"3515181",
"29535089",
"62190121",
"2102392",
"3628209",
"59662201",
"122270210",
"11027141",
"16083144",
"832721",
"6658993",
"16524239",
"14932617",
"2205818",
"60163929",
"14848918",
"11439512",
"3068944",
"10027462",
"2061221",
"121115537",
"207327661",
"4643842",
"24599336",
"709842"
] | [
"51887749",
"1453272",
"41493431",
"207853334",
"14583593",
"56483387",
"17595283",
"53017120",
"4600560",
"88493489",
"7194903",
"59259067",
"44007411",
"55334970",
"2653455",
"13751712",
"1274632",
"52146485",
"33224501",
"8224140",
"14578774",
"7797035",
"5025120",
"67855861",
"49486634",
"12119242",
"8999678",
"53113765",
"14773083",
"2351689",
"63236128",
"29160575",
"59337136",
"3604371",
"49349708",
"11344208",
"4845255",
"9365072",
"209068299",
"29151709",
"3140051"
] | true | true | true | https://api.semanticscholar.org/CorpusID:1013100 | 1 | 1 | 1 | 1 | 1 |
||||
Meeting central: making distributed meetings more effective | 8,429,419 | The Meeting Central prototype is a suite of collaboration tools designed to support distributed meetings. The tools' minimalist design provides only those features that have the most impact on distributed meeting effectiveness. The collaboration suite is built on top of a distributed, extensible, and scalable framework. | [
{
"first": "Nicole",
"middle": [],
"last": "Yankelovich",
"suffix": ""
},
{
"first": "William",
"middle": [],
"last": "Walker",
"suffix": ""
},
{
"first": "Patricia",
"middle": [],
"last": "Roberts",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Wessler",
"suffix": ""
},
{
"first": "Jonathan",
"middle": [],
"last": "Kaplan",
"suffix": ""
},
{
"first": "Joe",
"middle": [],
"last": "Provino",
"suffix": ""
}
] | 2,004 | 10.1145/1031607.1031678 | CSCW '04 | 2027636661 | [
"47347785",
"62568580",
"17895848",
"911715",
"6689728",
"17593878",
"1302585",
"31760087",
"5943805",
"257943",
"12217921",
"26892929",
"63884367",
"5900571",
"12294277",
"2909871"
] | [
"1121330",
"5402766",
"18258072",
"36777528",
"15145364",
"12602411",
"16768590",
"31776862",
"15433014",
"14190486",
"53302656",
"6802966",
"2250142",
"14421988",
"3086545",
"16415194",
"61490260",
"5432852",
"205932967",
"17675990",
"53141863",
"1668609",
"55638495",
"21361498",
"9592674",
"13113970",
"10922806",
"51986777",
"2423287",
"15856539",
"15720609",
"14156250",
"14204223",
"16512515",
"17263027",
"107336312",
"14065459",
"15770113",
"14841108",
"2290691",
"15234389",
"30457168",
"17934325",
"59819015",
"5284028",
"15379223",
"16674338",
"12273801"
] | true | true | true | https://api.semanticscholar.org/CorpusID:8429419 | 0 | 0 | 0 | 1 | 0 |
|||||
"I need to try this"?: a statistical overview of pinterest | 207,203,793 | Over the past decade, social network sites have become ubiquitous places for people to maintain relationships, as well as loci of intense research interest. Recently, a new site has exploded into prominence: Pinterest became the fastest social network to reach 10M users, growing 4000% in 2011 alone. While many Pinterest articles have appeared in the popular press, there has been little scholarly work so far. In this paper, we use a quantitative approach to study three research questions about the site. What drives activity on Pinterest? What role does gender play in the site's social connections? And finally, what distinguishes Pinterest from existing networks, in particular Twitter? In short, we find that being female means more repins, but fewer followers, and that four verbs set Pinterest apart from Twitter: use, look, want and need. This work serves as an early snapshot of Pinterest that later work can leverage. | [
{
"first": "Eric",
"middle": [],
"last": "Gilbert",
"suffix": ""
},
{
"first": "Saeideh",
"middle": [],
"last": "Bakhshi",
"suffix": ""
},
{
"first": "Shuo",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Loren",
"middle": [],
"last": "Terveen",
"suffix": ""
}
] | 2,013 | 10.1145/2470654.2481336 | CHI '13 | 2094736127 | [
"6638329",
"7994142",
"8379923",
"137965",
"207178564",
"7398505",
"10579176",
"16323398",
"137538",
"16666702",
"11940919",
"42639",
"6096102",
"16395922",
"60884096",
"15730439",
"2798537",
"2603383",
"5556711",
"15186389",
"15613532",
"1234838",
"62693237",
"207158556",
"10867281"
] | [
"7202688",
"27196062",
"8719061",
"2272595",
"15405137",
"8380387",
"169554783",
"121195",
"2341249",
"9038117",
"2878679",
"15102663",
"3386085",
"3283539",
"60464857",
"17953105",
"207218627",
"7826197",
"8462008",
"2974557",
"12738143",
"4317015",
"55561087",
"204771788",
"9049841",
"111841946",
"39064576",
"16483834",
"17154332",
"207499665",
"1168101",
"199057251",
"17538636",
"11672524",
"7333274",
"26783439",
"207210812",
"146005985",
"16079323",
"84181565",
"837371",
"7417853",
"1825085",
"17689778",
"53522877",
"15536177",
"6728599",
"70345696",
"5910559",
"15572500",
"11346647",
"5008341",
"4300637",
"25689880",
"7873645",
"12756102",
"10743386"
] | true | true | true | https://api.semanticscholar.org/CorpusID:207203793 | 0 | 0 | 0 | 1 | 0 |
|||||
QuickInsights: Quick and Automatic Discovery of Insights from Multi-Dimensional Data | 189,048,448 | Discovering interesting data patterns is a common and important analytical need in data, with increasing user demand for automated discovery abilities. However, automatically discovering interesting patterns from multi-dimensional data remains challenging. Existing techniques focus on mining individual types of patterns. There is a lack of unified formulation for different pattern types, as well as general mining frameworks to derive them effectively and efficiently. We present a novel technique QuickInsights, which quickly and automatically discovers interesting patterns from multi-dimensional data. QuickInsights proposes a unified formulation of interesting patterns, called insights, and designs a systematic mining framework to discover high-quality insights efficiently. We demonstrate the effectiveness and efficiency of QuickInsights through our evaluation on 447 real datasets as well as user studies on both expert users and non-expert users. QuickInsights is released in Microsoft Power BI. | [
{
"first": "Rui",
"middle": [],
"last": "Ding",
"suffix": ""
},
{
"first": "Shi",
"middle": [],
"last": "Han",
"suffix": ""
},
{
"first": "Yong",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Haidong",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Dongmei",
"middle": [],
"last": "Zhang",
"suffix": ""
}
] | 2,019 | 10.1145/3299869.3314037 | SIGMOD '19 | 2946535156 | [
"57146809",
"1477188",
"46106838",
"14217178",
"7027713",
"12893670",
"18148335",
"2332771",
"214869953",
"117567978",
"688174",
"11430349",
"205314721",
"6417786",
"16887553",
"47504876",
"18848829",
"1890332",
"207247975",
"3620071",
"41039370",
"119972206",
"2362307",
"2582556",
"13457388",
"16716972",
"2366653",
"14999239",
"52071158",
"2804799",
"8568910",
"52012313",
"49575415",
"4198300"
] | [
"201093978"
] | true | true | true | https://api.semanticscholar.org/CorpusID:189048448 | 0 | 0 | 0 | 1 | 0 |
|||||
A specialized data management system for parallel execution of particle physics codes | 306,173 | The specialized data management system described in this paper was motivated by the need for much more efficient data management than a standard database management system could provide for particle physics codes in shared memory multiprocessor environments. The special characteristics of data and access patterns in particle physics codes need to be fully exploited in order to effect efficient data management. The data management system allows parameteric user control over system features not usually available to them, especially details of physical design and retrieval such as horizontal clustering, asynchronous I/O, and automatic distribution across processors. In the past, each physics code has constructed the equivalent of a primitive data management system from scratch. The system described in this paper is a generic system that can now be interfaced with a variety of physics codes. | [
{
"first": "Jean",
"middle": [
"L."
],
"last": "Bell",
"suffix": ""
}
] | 1,988 | 10.1145/50202.50236 | SIGMOD '88 | 2020105573 | [] | [
"13322360",
"64962555",
"9584464",
"16391298",
"18692554",
"15480840"
] | false | true | true | https://api.semanticscholar.org/CorpusID:306173 | 0 | 0 | 0 | 0 | 0 |
|||||
Metarule-Guided Mining of Multi-Dimensional Association Rules Using Data Cubes | 12,798,931 | In this paper, we employ a novel approach to metarule-guided, multi-dimensional association rule mining which explores a data cube structure. We propose algorithms for metarule-guided mining: given a metarule containing p predicates, we compare mining on an n-dimensional (n-D) cube structure (where p < n) with mining on smaller multiple p-dimensional cubes. In addition, we propose an efficient method for precomputing the cube, which takes into account the constraints imposed by the given metarule. | [
{
"first": "Micheline",
"middle": [],
"last": "Kamber",
"suffix": ""
},
{
"first": "Jiawei",
"middle": [],
"last": "Han",
"suffix": ""
},
{
"first": "Jenny",
"middle": [],
"last": "Chiang",
"suffix": ""
}
] | 1,997 | KDD | 2915015876,2100356657 | [
"10752174",
"2706742",
"8876000",
"36576",
"16995586",
"16408580",
"1898349"
] | [
"9272258",
"10020877",
"18448697",
"8190113",
"12122845",
"17792532",
"2839062",
"14721101",
"17080066",
"17233504",
"53557945",
"53557945",
"435966",
"8768960",
"16629054",
"39369999",
"21192",
"110849962",
"54598975",
"12552483",
"7355746",
"18836390",
"17127689",
"11060664",
"6447660",
"14853195",
"16033077",
"16785555",
"6210342",
"1146231",
"11907525",
"10476840",
"18919799",
"9522039",
"12631220",
"28571997",
"7020071",
"18767061",
"29633921",
"9758240",
"1655564",
"7669734",
"10114656",
"2723574",
"14945694",
"1549675",
"2123054",
"52052644",
"2660641",
"28335756",
"17499702",
"14396321",
"14369185",
"15271513",
"116204326",
"11007004",
"16459038",
"30930895",
"16344408",
"16761474",
"3264474",
"15207708",
"15868245",
"15980630",
"204230819",
"11410847",
"18167579",
"201137692",
"11067983",
"18558341",
"10580126",
"50768111",
"8760510",
"59158352",
"3742386",
"1319637",
"15403181",
"16263122",
"124870895",
"6248344",
"5170568",
"5451807",
"1188058",
"2529942",
"3406113",
"12595576",
"59409107",
"377499",
"7080668",
"207828086",
"62021518",
"7981933",
"55462698",
"1502985",
"62563928",
"14326372",
"6059661",
"13066157",
"3052899",
"209503284",
"2929098",
"16061344",
"17426269",
"16136834",
"55886366",
"8085527",
"5133160",
"2381120",
"18020813",
"15052856",
"14751794",
"20633744",
"12450272",
"335675",
"6604726"
] | true | true | true | https://api.semanticscholar.org/CorpusID:12798931 | 0 | 0 | 0 | 1 | 0 |
||||||
Latent Doodle Space | 33,554,733 | We propose the concept of a latent doodle space, a low-dimensional space derived from a set of input doodles, or simple line drawings. The latent space provides a foundation for generating new drawings that are similar, but not identical to, the input examples. The two key components of this technique are 1) a heuristic algorithm for finding stroke correspondences between the drawings, and 2) the use of latent variable methods to automatically extract a low-dimensional latent doodle space from the inputs. We present two practical applications that demonstrate the utility of this idea: first, a randomized stamp tool that creates a different image on every usage; and second, “personalized probabilistic fonts,” a handwriting synthesis technique that mimics the idiosyncrasies of one's own handwriting. ::: ::: ::: ::: Keywords: sketch, by-example, style learning, scattered data interpolation, principal component analysis, radial basis functions, Gaussian processes, digital in-betweening, handwriting synthesis | [
{
"first": "William",
"middle": [],
"last": "Baxter",
"suffix": ""
},
{
"first": "Ken-ichi",
"middle": [],
"last": "Anjyo",
"suffix": ""
}
] | 2,006 | 10.1111/j.1467-8659.2006.00967.x | Comput. Graph. Forum | Comput. Graph. Forum | 2143732929 | [] | [
"5949864",
"18383049",
"199019756",
"852015",
"8764038",
"46907251",
"14368895",
"46894333",
"17471504",
"31891901",
"26249743",
"12363717",
"1305216",
"11867988"
] | false | true | false | https://api.semanticscholar.org/CorpusID:33554733 | null | null | null | null | null |
||||
Noisy Image Segmentation by a Robust Clustering Algorithm Based on DC Programming and DCA | 6,044,547 | We present a fast and robust algorithm for image segmentation problems via Fuzzy C-Means (FCM) clustering model. Our approach is based on DC (Difference of Convex functions) programming and DCA (DC Algorithms) that have been successfully applied in a lot of various fields of Applied Sciences, including Machine Learning. In an elegant way, the FCM model is reformulated as a DC program for which a very simple DCA scheme is investigated. For accelerating the DCA, an alternative FCM-DCA procedure is developed. Moreover, in the case of noisy images, we propose a new model that incorporates spatial information into the membership function for clustering. Experimental results on noisy images have illustrated the effectiveness of the proposed algorithm and its superiority with respect to the standard FCM algorithm in both running-time and quality of solutions. | [
{
"first": "Le",
"middle": [
"Thi",
"Hoai"
],
"last": "An",
"suffix": ""
},
{
"first": "Le",
"middle": [
"Hoai"
],
"last": "Minh",
"suffix": ""
},
{
"first": "Nguyen",
"middle": [
"Trong"
],
"last": "Phuc",
"suffix": ""
},
{
"first": "Pham",
"middle": [
"Dinh"
],
"last": "Tao",
"suffix": ""
}
] | 2,008 | 10.1007/978-3-540-70720-2_6 | ICDM | 1597107881 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:6044547 | null | null | null | null | null |
|||||
Understanding the Rational Speech Act model. | 53,004,107 | [
{
"first": "Arianna",
"middle": [],
"last": "Yuan",
"suffix": ""
},
{
"first": "Will",
"middle": [
"S."
],
"last": "Monroe",
"suffix": ""
},
{
"first": "Yu",
"middle": [],
"last": "Bai",
"suffix": ""
},
{
"first": "Nate",
"middle": [],
"last": "Kushman",
"suffix": ""
}
] | 2,018 | CogSci | 2941753850 | [
"291100",
"337390",
"7880730",
"1452909",
"52826136",
"6557213",
"64515684",
"26797288",
"721358",
"3632786",
"2804004",
"6957154",
"24100971",
"13623227",
"14911774",
"1854889",
"50329347",
"11146669"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:53004107 | 0 | 0 | 0 | 1 | 0 |
|||||||
The Effect of Physical Load in Cognitive Process of Estimation | 14,691,012 | The Effect of Physical Load on the Cognitive Process of Estimation Keiga Abe ([email protected]) Department of Education, 1-1 Takakuwa-Nishi, Yanaizu-cho Gifu, Japan Abstract The purpose of this study was to examine the process of embodied cognition in distance estimation. According to recent cognitive science studies, our intelligent behavior that ranges from perception to inference is not accomplished in only a closed mental process, but is affected by body and action. However, previous studies do not clarify whether these effects were derived from physical load or subjective heaviness. In order to examine the question, two experiments were conducted using the “size-weight illusion’’. Performance on the distance estimation task was not affected by subjective heaviness but by physical load. Keywords: embodied distance estimation cognition; size-weight illusion; Introduction We examined the contribution of the physical body on higher-order cognitive processing. Recently, in cognitive science, studies have reported that a wide range of intellectual behavior, from perception to inference, is not only a closed mental process but is also subject to influences of the physical body and its actions/motions(Wilson, 2002; Gibbs, 2005; Proffitt, 2006). Since physical loading is known to exert effects on mental processes, Narukawa, et al. (2010) reported changes in gustatory sensation that accompany the degree of fatigue. Krishna & Morrin (2008) showed that the sense of hardness of the bottle affected the evaluation of mineral water. Bhalla & Profitt (1999) demonstrated experimentally that different estimates are made of the inclination of a sloped path under the conditions of carrying a load on the back versus being empty-handed. In addition, in the study by Ackerman, Nocera & Bargh (2010), the curriculum vitae of a fictitious person bound to two types of clipboards that differed in heaviness were handed to the subjects, who were asked to make evaluations of the person. The evaluations made by those of the group handed the heavier clipboard were higher than that of the group handed the lighter clipboard. The results of these prior studies suggest that mental processes are influenced by loading and fatigue of the physical body of the subject. However, it has not been clarified whether these effects were due to the amount of actual physical load or due to the amount of the subjective load. In this study, this issue was examined using a distance estimation task adopted from a prior study. If the effects were due to the amount of the physical load, then physical/non-overt processes, which are separate from the subjective view of the subject, are expected exert an effect on the inference. Conversely, if they are due to the amount of the subjective load, it may be considered that the subjective view of the subject and overt processes exert the effects on the inference. To examine these physical and subjective loads separately, the “size-weight illusion’’ (Charpentier, 1891) was used in this study. This illusion occurs when if the weights of two objects are the same, the larger object is sensed as being lighter. Utilizing this illusion, distance estimation tasks under conditions of being subject to different subjective loads while being subject to the same physical load (Experiment 1) and distance estimation tasks under conditions of being subject to different physical loads while being subject to the same subjective load (Experiment 2) were conducted to examine the effect of the physical and subjective amount of the physical load. Experiment 1 In Experiment 1, experimental manipulations were conducted to generate the subjective view that loads with different weights were being exerted while the same weight physically was exerted, and distance estimation tasks were conducted under conditions of a divergence between the amount of subjective and physical load. This was used to examine how the perceived load of the weight exerted on the body is processed. Method Subjects Ninety-two college students participated in the experiment. Of them, 24 were assigned to the 10 L group, in which the subject held a 5 kg tank with capacity of 10 L as the number of steps of a stairway was estimated; 33 were assigned to the 20 L group, in which the subject held a 5 kg tank with a capacity of 20 L as the estimation was made; and 35 were assigned to the control group, in which they made the estimation without holding any weight. A single- factor between-subjects design was used in this experiment. Task A revised form of the distance estimation task published by Bhalla & Profitt (1999) was employed. In the revised form, a picture of the up-bound steps of the Atago Shrine (Fig. 1) was presented for 5 s, and the subject was | [
{
"first": "Keiga",
"middle": [],
"last": "Abe",
"suffix": ""
}
] | 2,013 | CogSci | 2401525411 | [
"141864691",
"42118392",
"195054315",
"83601231",
"10991519",
"8908016",
"267562"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:14691012 | 0 | 0 | 0 | 1 | 0 |
||||||
Moves in the World Are Faster than Moves in the Head: Interactivity in the River Crossing Problem | 9,127,886 | Moves in the World Are Faster than Moves in the Head: Interactivity in the River Crossing Problem Frederic Vallee-Tourangeau, Lisa G. Guthrie and Gaelle Villejoubert Department of Psychology, Kingston University Kingston-upon-Thames UNITED KINGDOMKT1 2EE f.vallee-tourangeau/l.guthrie/[email protected] Abstract In solving a variety of problems people interact with their external environment, often using artefacts close at hand to supplement and augment their problem solving skills. The role of interactivity in problem solving was investigated using a river-crossing problem. All participants performed the task twice, once in a high interactivity condition and once in a low interactivity condition. Moves to completion were higher in the high interactivity condition but latency per move was much shorter with high than with low interactivity. Moves in the world were easier to implement than to simulate mentally and acted as epistemic actions to facilitate thinking. In addition, when participants experienced the low interactivity version of the task second, their performance reflected little learning. However, when the high interactivity version was completed second, latency to solution and latency per move were substantially reduced. These results underscore the importance of investigating problem solving behaviour from a distributed cognition perspective. Keywords: Problem solving, interactivity, epistemic actions, distributed cognition Introduction Scientists and lay people alike naturally create and build artefacts or recruit existing ones to help them solve problems. To be sure, artefacts such as calculators, data management software, computers can facilitate complex computations. But others, of more modest complexity, such as pen and paper, can help articulate and structure thinking. Space itself is a tool that can facilitate thinking, that is it can be structured, designed (and redesigned) such as to make thinking easier (Kirsh, 1995, 1996, 2010). Thus solving jigsaw puzzles involves physically juxtaposing different pieces to gauge their fit; in Scrabble, letter tiles are physically rearranged to facilitate word production; in Tetris, tetrominoes are physically rotated to determine their optimal place along a line. And beyond puzzles and games, experts structure an external environment to support thinking. Scientists use physical objects and their arrangement in space to formulate and test hypotheses: Watson (1968, pp. 123-125) describes how he cleared his desk, cut out shapes corresponding to the four nucleobases, and manipulated them until he saw which ones could be paired to hold the double helix together. Artefacts recruited in thinking are rich, varied and modifiable. Their recruitment is at times strategic, such that their users actively engage in their design and engineer their function, and at others, opportunistic, that is they are picked up from the environment in an ad hoc fashion to help solve a problem, capitalizing on a fortuitous interaction. From a distributed cognition perspective, thinking is the product of a cognitive system wherein internal and external resources are coupled to create a dynamic, fluid, and distributed problem representation (Villejoubert & Vallee-Tourangeau, 2011; Weller, Villejoubert, & Vallee- Tourangeau, 2011). The nature of the external resources recruited in thinking and their functional role are guided by principles of cognitive economy, effort and efficiency (Clark, 1989; Kirsh, 2010). Actions complement and augment thinking by providing new information, unveiling new affordances, and can sometimes serve to create a more cognitively congenial problem presentation (Kirsh, 1996). Through the creation, recruitment and manipulations of artefacts, new perspectives are gained, encouraging the development or retrieval of problem solving strategies, and improving the prospect of solving the problem (Magnani, 2007). As the environment shoulders some of the representational and computational burden, valuable cognitive resources such as working memory capacity and executive functions may be freed to draw on stored knowledge or develop new solutions (Magnani, 2007). For example, recent work on mental arithmetic indicates that people are more accurate, more efficient, and create more congenial interim totals when they can manipulate number tokens that configure the problem presentation, than when they perform the mental arithmetic without (Vallee-Tourangeau, in press). River Crossing Transformation problems have been the focus of research in cognitive psychology for the past 50 years. In these problems, a well-defined space connects an initial and a goal state. Legal moves are defined in terms of simple rules and enacted with simple operators. Participants must reach the goal state by transforming the initial state | [
{
"first": "Frédéric",
"middle": [],
"last": "Vallée-Tourangeau",
"suffix": ""
},
{
"first": "Lisa",
"middle": [
"G."
],
"last": "Guthrie",
"suffix": ""
},
{
"first": "Gaëlle",
"middle": [],
"last": "Villejoubert",
"suffix": ""
}
] | 2,013 | CogSci | 2406857357 | [
"171076366",
"144092410",
"54273689",
"14322098",
"143094968",
"34430061",
"1427729",
"14183240",
"120639723",
"54363678",
"32343770",
"5632387",
"120773499"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:9127886 | 0 | 0 | 0 | 1 | 0 |
||||||
Exclusive Row Biclustering for Gene Expression Using a Combinatorial Auction Approach | 18,744,436 | The availability of large microarray data has led to a growing interest in biclustering methods in the past decade. Several algorithms have been proposed to identify subsets of genes and conditions according to different similarity measures and under varying constraints. In this paper we focus on the exclusive row biclusteing problem (also known as projected clustering) for gene expression data sets, in which each row can only be a member of a single bicluster while columns can participate in multiple clusters. This type of biclustering may be adequate, for example, for clustering groups of cancer patients where each patient (row) is expected to be carrying only a single type of cancer, while each cancer type is associated with multiple (and possibly overlapping) genes (columns). In this paper we present a novel method to identify these exclusive row biclusters through a combination of existing biclustering algorithms and combinatorial auction techniques. We devise an approach for tuning the threshold for our algorithm based on comparison to a null model in the spirit of the Gap statistic approach. We demonstrate our approach on both synthetic and real-world gene expression data and show its power in identifying large span non-overlapping rows sub matrices, while considering their unique nature. The Gap statistic approach succeeds in identifying appropriate thresholds in all our examples. | [
{
"first": "A.",
"middle": [],
"last": "Painsky",
"suffix": ""
},
{
"first": "S.",
"middle": [],
"last": "Rosset",
"suffix": ""
}
] | 2,012 | 1809.05077 | 10.1109/ICDM.2012.25 | 2012 IEEE 12th International Conference on Data Mining | 2012 IEEE 12th International Conference on Data Mining | 2074790978,2890501655 | [
"206628783",
"17437497",
"6321522",
"9508773",
"1444469",
"17501627",
"18879780",
"61524385",
"18744436",
"22529915",
"7159780"
] | [
"3106815",
"2467070",
"18744436"
] | true | true | true | https://api.semanticscholar.org/CorpusID:18744436 | 1 | 1 | 1 | 1 | 1 |
|||
Visual Flexibility in Arithmetic Expressions. | 53,057,028 | [
{
"first": "Jingqi",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Landy",
"suffix": ""
},
{
"first": "Robert",
"middle": [
"L."
],
"last": "Goldstone",
"suffix": ""
}
] | 2,018 | CogSci | 2941039851 | [
"58340354",
"11617465",
"22032860",
"41170922",
"118044041",
"15753363",
"40262044",
"4491256",
"16493386",
"62770531",
"121106060",
"1707824",
"17079416",
"2226164",
"10803341",
"210313829",
"8107220",
"6736937",
"28713590",
"15913587",
"40822833",
"144214796"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:53057028 | 0 | 0 | 0 | 1 | 0 |
|||||||
Compression of Synthesized Textures | 1,100,781 | In spite of graphics hardware advancements, graphics memory is still a scarce resource for usual applications. Besides, for most raster-based applications, the available bandwidth is one important limiting factor for increasing performance in the system. Texture compression addresses both of these problems. We introduce a new technique for compression of textures synthesized from samples. The compressed texture stores the sample plus encoded data, gathered during synthesis, which enables real-time decompression of large textures. With this scheme we are able to achieve high compression rates. Our solution explores a spectrum of textures where general texture compression schemes achieve less than optimal compression rates. These are usually textures with repeating patterns, regular or near-regular ones, and stochastic ones, the exactly types of textures where texture synthesis algorithms perform well. We also present analytical formulae for our compression scheme that allows an exact computation of compression rates achieved. | [
{
"first": "F.",
"middle": [],
"last": "Brayner",
"suffix": ""
},
{
"first": "M.",
"middle": [],
"last": "Walter",
"suffix": ""
}
] | 2,010 | 10.1109/SIBGRAPI.2010.39 | 2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images | 2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images | 2123621103 | [
"11639122",
"2025411",
"17161937",
"15448589",
"9334387",
"57372862",
"18392630",
"33700281",
"30163599",
"1673424",
"13946933",
"6230688",
"8630946",
"14568927",
"16609963",
"16824601",
"121191507",
"19038308",
"7761989",
"15358489",
"54970",
"3131710",
"14375589",
"6175301",
"13948350",
"2201072",
"122898459",
"53224612",
"207211698"
] | [
"14229559"
] | true | true | true | https://api.semanticscholar.org/CorpusID:1100781 | 0 | 0 | 0 | 1 | 0 |
||||
Neural Smoke Stylization with Color Transfer | 209,405,190 | Artistically controlling fluid simulations requires a large amount of manual work by an artist. The recently presented transportbased neural style transfer approach simplifies workflows as it transfers the style of arbitrary input images onto 3D smoke simulations. However, the method only modifies the shape of the fluid but omits color information. In this work, we therefore extend the previous approach to obtain a complete pipeline for transferring shape and color information onto 2D and 3D smoke simulations with neural networks. Our results demonstrate that our method successfully transfers colored style features consistently in space and time to smoke data for different input textures. | [
{
"first": "Fabienne",
"middle": [],
"last": "Christen",
"suffix": ""
},
{
"first": "Byungsoo",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "Vinicius",
"middle": [
"C."
],
"last": "Azevedo",
"suffix": ""
},
{
"first": "Barbara",
"middle": [],
"last": "Solenthaler",
"suffix": ""
}
] | 2,019 | 1912.08757 | ArXiv | ArXiv | 2996271540 | [
"206593710",
"5641467",
"12992900",
"214431593",
"52839714",
"17868098",
"206596668",
"9181019",
"202896841",
"40298057",
"5022622",
"44110212",
"14124313",
"129235"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:209405190 | 1 | 1 | 1 | 1 | 1 |
||||
The context toolkit: aiding the development of context-enabled applications | 1,165,515 | Context-enabled applications are just emerging and promisericher interaction by taking environmental context into account.However, they are difficult to build due to their distributednature and the use of unconventional sensors. The concepts oftoolkits and widget libraries in graphical user interfaces has beentremendously successtil, allowing programmers to leverage offexisting building blocks to build interactive systems more easily.We introduce the concept of context widgets that mediate betweenthe environment and the application in the same way graphicalwidgets mediate between the user and the application. We illustratethe concept of context widgets with the beginnings of a widgetlibrary we have developed for sensing presence, identity andactivity of people and things. We assess the success of ourapproach with two example context-enabled applications we havebuilt and an existing application to which we have addedcontext-sensing capabilities. | [
{
"first": "Daniel",
"middle": [],
"last": "Salber",
"suffix": ""
},
{
"first": "Anind",
"middle": [
"K."
],
"last": "Dey",
"suffix": ""
},
{
"first": "Gregory",
"middle": [
"D."
],
"last": "Abowd",
"suffix": ""
}
] | 1,999 | 10.1145/302979.303126 | CHI '99 | 2131415946 | [
"7899491",
"5800733",
"2216507",
"145790159",
"15186183",
"59907423",
"25111719",
"399279",
"14940570"
] | [
"61353649",
"6158684",
"16179133",
"1250645",
"18926645",
"1629877",
"2311983",
"207218764",
"23054857",
"1982744",
"13998350",
"16795666",
"18183286",
"16039438",
"18712210",
"1826667",
"5310274",
"14949735",
"2368287",
"54444971",
"5976911",
"7952913",
"32823927",
"9759669",
"9910336",
"15838384",
"5916812",
"8691893",
"7600784",
"211239231",
"598329",
"1825201",
"11889527",
"465842",
"18616290",
"10231063",
"9267191",
"206927304",
"14200441",
"18353501",
"17216489",
"1113420",
"16817377",
"10140521",
"10546894",
"32471438",
"114482885",
"6020411",
"54942152",
"6080910",
"4694765",
"18874460",
"7023564",
"62170487",
"5972467",
"129879",
"820390",
"846446",
"19137756",
"39708106",
"36506716",
"8981884",
"12223101",
"11448531",
"18272955",
"2113133",
"54557816",
"17944846",
"6120252",
"15331806",
"9531116",
"7496760",
"15753817",
"16510683",
"15745154",
"17957941",
"18999477",
"11293734",
"13001335",
"10421141",
"8891385",
"31155680",
"6232990",
"18148471",
"14977844",
"1252141",
"215553374",
"15677481",
"32684832",
"15930081",
"18502617",
"492399",
"2835979",
"35593545",
"2635883",
"18954177",
"15417270",
"14155220",
"9386696",
"6108011",
"103249",
"18513631",
"14660045",
"14518185",
"17384807",
"106815097",
"5483920",
"2133927",
"907383",
"16903963",
"10277227",
"14659259",
"14636274",
"7445850",
"14238231",
"16536769",
"16947156",
"8822949",
"6018836",
"172134188",
"16347189",
"14463641",
"14281766",
"94763",
"13368115",
"52217716",
"18906874",
"13404119",
"60067598",
"195777533",
"11486134",
"13880146",
"16388388",
"1879723",
"46957896",
"17415027",
"18509017",
"16319712",
"2432690",
"3176648",
"206480322",
"17481252",
"18488198",
"308334",
"18616435",
"7125443",
"42235896",
"6106581",
"14727079",
"17599912",
"16317922",
"9680056",
"282147",
"18473222",
"9020388",
"9099728",
"16435908",
"10187026",
"8884835",
"9943740",
"13056980",
"13585907",
"13585907",
"54073690",
"6293929",
"53040995",
"14550358",
"9541296",
"17214780",
"147630",
"3939685",
"6244578",
"201761849",
"1406673",
"6127846",
"14461794",
"14550604",
"9151341",
"12429796",
"28235742",
"1659581",
"910765",
"14143877",
"15391675",
"1003443",
"16417081",
"18345773",
"14026051",
"14781586",
"18467398",
"18117420",
"1224710",
"16688950",
"19036319",
"16428995",
"11038645",
"16734048",
"1899478",
"17312480",
"14427477",
"2849403",
"15852643",
"14501876",
"60845030",
"15591701",
"707559",
"10639344",
"37163114",
"15246430",
"16623245",
"13630845",
"1634590",
"14233551",
"3223362",
"45490558",
"2898024",
"16919759",
"16248664",
"8726940",
"1386073",
"18028877",
"15582463",
"15761231",
"17210428",
"2058228",
"1625147",
"17122569",
"195801544",
"110597877",
"110597877",
"8869522",
"1915257",
"18181505",
"11804045",
"15576135",
"16370263",
"17235434",
"62917267",
"110848170",
"7833444",
"30614994",
"17200463",
"8920329",
"208278003",
"195814533",
"1070342",
"16039386",
"10650685",
"8220133",
"1383764",
"140317602",
"12237313",
"7787540",
"33169210",
"13108380",
"2259359",
"18757062",
"16789212",
"7268151",
"17642070",
"6300040",
"14972044",
"9092838",
"46939619",
"10892132",
"18666208",
"16874895",
"73353",
"6049573",
"1102837",
"11582010",
"6031939",
"14678650",
"7037198",
"15350797",
"13837760",
"8453017",
"9176907",
"15084495",
"1179315",
"61982107",
"17430750",
"5055762",
"26813905",
"15526074",
"6387154",
"15109395",
"17187879",
"10307177",
"890732",
"11169070",
"15552393",
"1083111",
"17685482",
"5837503",
"2392194",
"25339628",
"5645242",
"31478211",
"16686583",
"7057189",
"14428943",
"699822",
"36525805",
"3332717",
"18763660",
"195861056",
"9630930",
"12393399",
"5841563",
"42234066",
"15241495",
"394640",
"7761388",
"63497970",
"195256456",
"28669427",
"12179871",
"32509927",
"9542548",
"8395861",
"2781535",
"10255916",
"17518412",
"11293272",
"207983878",
"14206159",
"213204",
"10091635",
"15034874",
"1817625",
"15057931",
"14841757",
"18174981",
"15229724",
"14815493",
"40067261",
"1523198",
"15631674",
"16360108",
"16873877",
"19024264",
"37770265",
"9185081",
"16951730",
"15331506",
"13433322",
"17677404",
"19211973",
"13525969",
"16035303",
"17453164",
"11358208",
"12590619",
"15261152",
"16701174",
"6669425",
"52212425",
"195768593",
"9024737",
"17117725",
"273916",
"14670803",
"15312787",
"53610966",
"10787576",
"380100",
"30062130",
"390204",
"14820467",
"378115",
"13900269",
"6755397",
"16125432",
"14531700",
"6782586",
"18882642",
"8747214",
"5707069",
"17416554",
"13815515",
"18922091",
"1327160",
"10579332",
"14849336",
"12523592",
"35750995",
"17152237",
"18294692",
"17833614",
"27584926",
"14808805",
"1597208",
"17439836",
"21738890",
"1291346",
"12469785",
"10258044",
"17844059",
"12049583",
"63615581",
"14218873",
"6797870",
"14571741",
"1719241",
"15538093",
"14881164",
"2852653",
"2824795",
"4826072",
"7464679",
"16922819",
"26164149",
"59844134",
"18860083",
"11099867",
"777503",
"16801872",
"16300724",
"169040651",
"14558639",
"905869",
"17435742",
"9217766",
"8983739",
"2487546",
"18948692",
"14340872",
"35767648",
"17031952",
"37230185",
"14892576",
"2343346",
"15308711",
"5211283",
"17980195",
"11841399",
"14248293",
"185911",
"15745732",
"5936511",
"7533550",
"17914275",
"12629379",
"14745327",
"18462113",
"13965986",
"43772182",
"35633400",
"17476527",
"15226797",
"16763495",
"14664368",
"17118604",
"14214811",
"9941048",
"41171249",
"2342122",
"15592006",
"875373",
"9350664",
"3925517",
"18364887",
"11133897",
"7980201",
"565390",
"7755455",
"2601580",
"15244421",
"53092842",
"1153332",
"17086060",
"18714714",
"117383881",
"195780361",
"15220652",
"54914515",
"9661565",
"16729353",
"12007606",
"15605105",
"17724060",
"270628",
"10560719",
"26805352",
"46331295",
"16726447",
"15330913",
"2186925",
"18033393",
"14016027",
"14184004",
"5155486",
"42306873",
"10369089",
"13865941",
"13650705",
"7302800",
"1522974",
"17917554",
"6597495",
"155481",
"55671163",
"15750482",
"201054749",
"2379721",
"193718642",
"36150660",
"8971708",
"44165720",
"14697506",
"5313886",
"15458902",
"1020859",
"13892904",
"16644259",
"17023273",
"8486974",
"9104245",
"3209064",
"14334300",
"16594092",
"16143771",
"17386942",
"34588723",
"42623692",
"7892182",
"16105065",
"5229420",
"15384289",
"16131905",
"2016654",
"57048228",
"11459002",
"16215489",
"17648543",
"10242279",
"18966647",
"6561071",
"17343095",
"13215955",
"13071476",
"11923687",
"12811878",
"616657",
"14703724",
"14757415",
"18353503",
"15375702",
"16283875",
"15073892",
"17447467",
"7892728",
"15128544",
"6499052",
"16540575",
"16540575",
"6252962",
"34135468",
"12097244",
"11801925",
"16364823",
"6142578",
"3968391",
"1418917",
"14866192",
"15243383",
"17741874",
"10135723",
"51540",
"11527625",
"18076908",
"5689847",
"12354977",
"14429970",
"478504",
"16199532",
"5212617",
"14141102",
"14575647",
"6301034",
"17747574",
"37885294",
"125799",
"15417704",
"16798858",
"15770338",
"19350277",
"16339583",
"34911485",
"18806896",
"12341618",
"7139846",
"2607758",
"1129421",
"8561593",
"16773624",
"15990317",
"14204349",
"6830363",
"7853341",
"8798247",
"18077932",
"16883600",
"16288666",
"17386947",
"12613703",
"8158878",
"12094084",
"14931744",
"16597698",
"1365782",
"7991046",
"7601588",
"895210",
"54763253",
"38756842",
"15404171",
"1477",
"52926765",
"34502643",
"35526637",
"2880936",
"790490",
"18771371",
"67750327",
"67750327",
"32973536",
"14101584",
"6269303",
"55928781",
"18326192",
"11294152",
"14115457",
"33601053",
"8745896",
"1175334",
"12771111",
"4411076",
"115760250",
"157063416",
"14021707",
"11186626",
"60000582",
"23727107",
"2506416",
"6270922",
"7380814",
"11516366",
"15867522",
"18399027",
"86538038",
"14811981",
"18074567",
"17117046",
"15073994",
"45647334",
"69729135",
"13582688"
] | true | true | true | https://api.semanticscholar.org/CorpusID:1165515 | 0 | 0 | 0 | 1 | 0 |
|||||
Social, individual and technological issues for groupware calendar systems | 9,964,785 | Designing and deploying groupware is difficult. Groupwareevaluation and design are often approached from a singleperspective, with a technologically-, individually-, orsocially-centered focus. A study of Groupware Calendar Systems(GCSs) highlights the need for a synthesis of these multipleperspectives to fully understand the adoption challenges thesesystems face. First, GCSs often replace existing calendarartifacts, which can impact users calendaring habits and in turninfluence technology adoption decisions. Second, electroniccalendars have the potential to easily share contextualizedinformation publicly over the computer network, creatingopportunities for peer judgment about time allocation and raisingconcerns about privacy regulation. However, this situation may alsosupport coordination by allowing others to make useful inferencesabout ones schedule. Third, the technology and the socialenvironment are in a reciprocal, co-evolutionary relationship: theuse context is affected by the constraints and affordances of thetechnology, and the technology also co-adapts to the environment inimportant ways. Finally, GCSs, despite being below the horizon ofeveryday notice, can affect the nature of temporal coordinationbeyond the expected meeting scheduling practice. | [
{
"first": "Leysia",
"middle": [],
"last": "Palen",
"suffix": ""
}
] | 1,999 | 10.1145/302979.302982 | CHI '99 | 2104581822 | [
"14490062",
"14394653",
"2285992",
"1692016",
"60769819",
"209401691",
"6375800",
"15350756",
"145653991",
"40635609",
"144035335"
] | [
"12250069",
"6948350",
"8432521",
"2356083",
"3237804",
"30553821",
"39383144",
"1079401",
"59933324",
"30549023",
"2633485",
"67770086",
"962999",
"19344253",
"76648691",
"4696899",
"2469649",
"37928505",
"5293455",
"8046108",
"15300484",
"18205356",
"398510",
"17013106",
"17735968",
"18648231",
"14435201",
"51844160",
"17475897",
"11647910",
"5750587",
"20644995",
"14697163",
"43821577",
"142978",
"2858670",
"14029620",
"208032382",
"12405299",
"14115993",
"23551975",
"14108893",
"44066923",
"2431547",
"3835159",
"14098041",
"3017167",
"6110827",
"5400184",
"5855193",
"6006584",
"168875607",
"17182946",
"11944283",
"44095338",
"10572053",
"526932",
"330802",
"14372376",
"8689812",
"15953826",
"13572772",
"31649741",
"549733",
"25437202",
"7503694",
"63125237",
"1308428",
"9051706",
"5111320",
"633998",
"16857349",
"10595098",
"17369103",
"12993958",
"9542295",
"9224280",
"6606351",
"16187119",
"13718848",
"10975328",
"56267076",
"15340751",
"8173985",
"9229180",
"1171415",
"26524324",
"16144492",
"25906139",
"13592666",
"12038384",
"14040571",
"2700749",
"110620177",
"5313886",
"10031857",
"150947719",
"51682194",
"44170808",
"3783544",
"46957759",
"14555275",
"16623454",
"4653233",
"22696",
"324651",
"15684630",
"2254431",
"1941824",
"8790202",
"17289602",
"6351626",
"17184697",
"27059371",
"2430849",
"13302069",
"28998266",
"1218387",
"14979752",
"166350417",
"383917",
"36165224"
] | true | true | true | https://api.semanticscholar.org/CorpusID:9964785 | 0 | 0 | 0 | 1 | 0 |
|||||
Discovering Collective Narratives of Theme Parks from Large Collections of Visitors' Photo Streams | 15,790,653 | We present an approach for generating pictorial storylines from large collections of online photo streams shared by visitors to theme parks (e.g. Disneyland), along with publicly available information such as visitor's maps. The story graph visualizes various events and activities recurring across visitors' photo sets, in the form of hierarchically branching narrative structure associated with attractions and districts in theme parks. We first estimate story elements of each photo stream, including the detection of faces and supporting objects, and attraction-based localization. We then create spatio-temporal story graphs via an inference of sparse time-varying directed graphs. Through quantitative evaluation and crowdsourcing-based user studies via Amazon Mechanical Turk, we show that the story graphs serve as a more convenient mid-level data structure to perform photo-based recommendation tasks than other alternatives. We also present storybook-like demo examples regarding exploration, recommendation, and temporal analysis, which may be most beneficial uses of the story graphs to visitors. | [
{
"first": "Gunhee",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "Leonid",
"middle": [],
"last": "Sigal",
"suffix": ""
}
] | 2,015 | 10.1145/2783258.2788569 | KDD '15 | 2078889830 | [
"14851547",
"206590483",
"6093872",
"15329665",
"14418116",
"33004877",
"54626016",
"149163852",
"7520551",
"7625817",
"7627448",
"1496901",
"16416328",
"130535382",
"108304335",
"9210740",
"13284672",
"811620",
"2309962",
"207161022",
"18586006",
"1608696",
"7487588",
"206769604",
"1096165",
"3232175",
"6250415"
] | [
"86710796",
"44102223",
"25091001",
"206770640"
] | true | true | true | https://api.semanticscholar.org/CorpusID:15790653 | 0 | 0 | 0 | 1 | 0 |
|||||
Placing a value on aesthetics in online casual games | 15,795,983 | Game designers frequently invest in aesthetic improvements such as music, sound effects, and animations. However, their exact value for attracting and retaining players remains unclear. Seeking to estimate this value in two popular Flash games, we conducted a series of large-scale A/B tests in which we selectively removed aesthetic improvements and examined the effect of each component on play time, progress, and return rate. We found that music and sound effects had little or no effect on player retention in either game, while animations caused users to play more. We also found, counterintuitively, that optional rewards caused players to play less in both games. In one game, this gameplay modification affected play time three times as much as the largest aesthetic variation. Our methodology provides a way to determine where resources may be best spent during the game design and development process. | [
{
"first": "Erik",
"middle": [],
"last": "Andersen",
"suffix": ""
},
{
"first": "Yun-En",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Rich",
"middle": [],
"last": "Snider",
"suffix": ""
},
{
"first": "Roy",
"middle": [],
"last": "Szeto",
"suffix": ""
},
{
"first": "Zoran",
"middle": [],
"last": "Popović",
"suffix": ""
}
] | 2,011 | 10.1145/1978942.1979131 | CHI | 2155861457 | [
"205574514",
"207164737",
"10422256",
"19802939",
"12404692",
"18323570",
"207211621"
] | [
"25819437",
"52954353",
"15328153",
"11418749",
"11721407",
"5180428",
"1162105",
"55768508",
"14532656",
"57426714",
"113037405",
"14697497",
"211531766",
"58005757",
"4838838",
"6699430",
"9098467",
"6603739",
"34457136",
"198952500",
"63126802",
"11455277",
"2524148",
"190232398",
"2336320",
"767135",
"5051736",
"88508718",
"1259794",
"18861644",
"465150",
"204799207",
"214640640",
"22313631",
"86743385",
"14029159",
"131016"
] | true | true | true | https://api.semanticscholar.org/CorpusID:15795983 | 0 | 0 | 0 | 1 | 0 |
|||||
Introducing Internet Terminals to the Home: Interaction Between Social, Physical, and Technological Spaces | 107,816,504 | A field study was carried to examine the effects of introducing Internet terminals to the home. The results showed that the acceptance of an Internet terminal such as the WebTV set-top box is dependent on existing technologies, the availability and use of spaces in the home, the social structure and dynamics within the home, and the nature of information and communication needs within the home and with the community outside. The results are interpreted using Venkatesh & Mazumdar’s framework in which the home is conceptualised as three interrelated spaces: social, technological, and physical. Analysis of the findings showed how the new technology changes the dynamics and the relationships in and between these spaces and how the home in turn reconstructs itself as part of the process of appropriation. I conclude by drawing out design implications for Internet terminals in the context of the home. | [
{
"first": "Wai",
"middle": [
"On"
],
"last": "Lee",
"suffix": ""
}
] | 2,000 | 10.1007/978-1-4471-0515-2_9 | People and Computers XIV — Usability or Else! | People and Computers XIV — Usability or Else! | 112124935 | [] | [
"37277386",
"1675366"
] | false | true | false | https://api.semanticscholar.org/CorpusID:107816504 | null | null | null | null | null |