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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Cosserat Rods with Projective Dynamics | 52,875,280 | [
{
"first": "Carlota",
"middle": [],
"last": "Soler",
"suffix": ""
},
{
"first": "Tobias",
"middle": [],
"last": "Martin",
"suffix": ""
},
{
"first": "Olga",
"middle": [],
"last": "Sorkine-Hornung",
"suffix": ""
}
] | 2,018 | 10.1111/cgf.13519 | Comput. Graph. Forum | Comput. Graph. Forum | 2891984837 | [
"7866801",
"34477102",
"26439104"
] | [
"197928309",
"186206814",
"201657674"
] | true | true | true | https://api.semanticscholar.org/CorpusID:52875280 | 0 | 0 | 0 | 1 | 0 |
|||||
Algorithms for estimating relative importance in networks | 406,311 | Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis---examples include social networks, Web graphs, telecommunication networks, and biological networks. In interactive analysis of such data a natural query is "which entities are most important in the network relative to a particular individual or set of individuals?" We investigate the problem of answering such queries in this paper, focusing in particular on defining and computing the importance of nodes in a graph relative to one or more root nodes. We define a general framework and a number of different algorithms, building on ideas from social networks, graph theory, Markov models, and Web graph analysis. We experimentally evaluate the different properties of these algorithms on toy graphs and demonstrate how our approach can be used to study relative importance in real-world networks including a network of interactions among September 11th terrorists, a network of collaborative research in biotechnology among companies and universities, and a network of co-authorship relationships among computer science researchers. | [
{
"first": "Scott",
"middle": [],
"last": "White",
"suffix": ""
},
{
"first": "Padhraic",
"middle": [],
"last": "Smyth",
"suffix": ""
}
] | 2,003 | 10.1145/956750.956782 | KDD '03 | 1978558026 | [
"911040",
"6249357",
"751590",
"129431",
"15173994",
"14297281",
"122876291",
"1868144",
"16168595",
"14621100",
"1508503",
"1428010",
"121017886"
] | [
"2976328",
"206552097",
"15639087",
"195583971",
"18477988",
"14387839",
"69664401",
"10622223",
"17040645",
"12742262",
"26957133",
"14839971",
"44114726",
"152888983",
"34462576",
"5647517",
"534623",
"9061641",
"10947939",
"14261802",
"18190314",
"55676366",
"1369208",
"511768",
"12267703",
"3055210",
"18172065",
"215606308",
"1940239",
"6613540",
"20747675",
"17638307",
"8452929",
"10122735",
"16019758",
"9836124",
"12265537",
"215599253",
"18758470",
"3129559",
"25301661",
"3459392",
"11631314",
"3112667",
"207237647",
"215636329",
"8668995",
"17317329",
"7163626",
"7301555",
"13718502",
"3187854",
"18453538",
"51887859",
"18133037",
"16212463",
"13836431",
"41988837",
"6124592",
"300666",
"5622773",
"204964662",
"14812222",
"3420426",
"3163367",
"3601917",
"7386383",
"14678030",
"30851298",
"24585847",
"52872173",
"17285346",
"2331271",
"2546561",
"17937294",
"16853287",
"7582162",
"208052475",
"2160298",
"34400912",
"14427372",
"1008702",
"5125072",
"59896174",
"18825715",
"2838031",
"14795703",
"109059676",
"14303914",
"214984193",
"451133",
"2289042",
"557456",
"17585448",
"12481775",
"805822",
"8592557",
"26387963",
"51973827",
"60619701",
"14883998",
"5689649",
"14350008",
"15295858",
"13243743",
"6819113",
"62522903",
"6251562",
"5449221",
"16178158",
"9783323",
"54775015",
"9170569",
"7780815",
"16902682",
"202003788",
"397687",
"1979577",
"6258117",
"4535756",
"3162827",
"15783886",
"1691266",
"28301046",
"3817811",
"11672378",
"1143485",
"7358665",
"8869192",
"14108528",
"10221637",
"16678007",
"29452748",
"6036909",
"11023321",
"25963234",
"9792113",
"8257884",
"4713948",
"26518441",
"656914",
"16668055",
"202893588",
"12477253",
"32957405",
"206338846",
"7626486",
"12997975",
"5665791",
"11601825",
"315388",
"7981830",
"12451527",
"3031906",
"32705475",
"196654332",
"38400038",
"14548229",
"13338718",
"22057679",
"11872916",
"9023161",
"9928033",
"14753753",
"6231851",
"18005523",
"53038026",
"14468247",
"55960246",
"3190649",
"16922262",
"8755220",
"16101291",
"18769037",
"18769037",
"18208427",
"196185067",
"17228800",
"215225697",
"17045424",
"3477368",
"10213463",
"17888454",
"7041987",
"53040854",
"4683860",
"56409069",
"9530325",
"11845594",
"12437798",
"6372942",
"16437647",
"31201405",
"40056936",
"210883322",
"33816986",
"18931682",
"13638733",
"6769875",
"16836173",
"14521669",
"6370267",
"7110349",
"14697062",
"8173128",
"11090245",
"21262526",
"17741742",
"9498491",
"21911871",
"40358328",
"9188485",
"21440824",
"53083244",
"215091414",
"15010667",
"8859404",
"10654092",
"202595608",
"17883594",
"11056770",
"25718635",
"52896173",
"10219299",
"1685044",
"5066274",
"12930144",
"30356809",
"3568927",
"14430816",
"8599063",
"214802424",
"1342603",
"15913766",
"15316508",
"16268684",
"14317902",
"16066502",
"197632933",
"12588151",
"58004965",
"443424",
"4807216",
"59234691",
"14323801",
"22040273",
"86563265",
"12577581",
"16379276",
"104292634",
"2488213",
"17754175",
"1433706",
"9131786",
"25221893",
"8796982",
"1668116",
"214592284",
"15862045",
"38616782",
"6396299",
"9610629",
"1290141",
"36017946",
"14263789",
"6492510",
"17545075",
"214586975",
"13154163",
"5960240"
] | true | true | true | https://api.semanticscholar.org/CorpusID:406311 | 1 | 1 | 1 | 1 | 1 |
|||||
iReduct: differential privacy with reduced relative errors | 8,468,654 | Prior work in differential privacy has produced techniques for answering aggregate queries over sensitive data in a privacy-preserving way. These techniques achieve privacy by adding noise to the query answers. Their objective is typically to minimize absolute errors while satisfying differential privacy. Thus, query answers are injected with noise whose scale is independent of whether the answers are large or small. The noisy results for queries whose true answers are small therefore tend to be dominated by noise, which leads to inferior data utility. This paper introduces iReduct, a differentially private algorithm for computing answers with reduced relative error. The basic idea of iReduct is to inject different amounts of noise to different query results, so that smaller (larger) values are more likely to be injected with less (more) noise. The algorithm is based on a novel resampling technique that employs correlated noise to improve data utility. Performance is evaluated on an instantiation of iReduct that generates marginals, i.e., projections of multi-dimensional histograms onto subsets of their attributes. Experiments on real data demonstrate the effectiveness of our solution. | [
{
"first": "Xiaokui",
"middle": [],
"last": "Xiao",
"suffix": ""
},
{
"first": "Gabriel",
"middle": [],
"last": "Bender",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Hay",
"suffix": ""
},
{
"first": "Johannes",
"middle": [],
"last": "Gehrke",
"suffix": ""
}
] | 2,011 | 10.1145/1989323.1989348 | SIGMOD '11 | 2132768130 | [
"2399445",
"47299798",
"207181152",
"53039307",
"1174565",
"17664588",
"2565493",
"2468323",
"1522154",
"15047191",
"207181133",
"2152170",
"47084940",
"10203160",
"6104125",
"586436",
"1935",
"5714334",
"579712",
"1169440",
"5812674",
"17809969",
"5642529",
"10187266",
"49242",
"3464063",
"35435339",
"226031",
"1783622"
] | [
"24440993",
"22228539",
"14314794",
"2135755",
"875906",
"15906134",
"1290188",
"14182563",
"2265170",
"6900175",
"1822344",
"38210145",
"51684822",
"14284842",
"201066232",
"52180320",
"765171",
"2714099",
"8379926",
"3419485",
"9466729",
"28844102",
"6451208",
"6914491",
"196405007",
"17577804",
"53551084",
"15939573",
"2174233",
"145870837",
"8989005",
"13967738",
"11784931",
"2122910",
"15474774",
"1359799",
"5000474",
"49658942",
"14527832",
"23448428",
"67789712",
"2858841",
"14838758",
"2645854",
"9307931",
"11853471",
"15836643",
"1151178",
"14793519",
"14520519",
"23928327",
"41849434",
"533547",
"7315289",
"58206276",
"10567310",
"106396519",
"3566229",
"214688204",
"196591306",
"195876621",
"5760159",
"15259024",
"14563871",
"54933411",
"9669091",
"3264646",
"2659631",
"54446694",
"3729936",
"14839834",
"54167783",
"17529557",
"215232452",
"9129772",
"51869463",
"21751636",
"970290",
"210920252",
"16781661",
"598438",
"14089606",
"3475412",
"15308856",
"116134914",
"38623124"
] | true | true | true | https://api.semanticscholar.org/CorpusID:8468654 | 0 | 0 | 0 | 1 | 0 |
|||||
Scheduling in variable-core collaborative systems | 14,854,565 | The performance of a collaborative system depends on how two mandatory collaborative tasks, processing and transmission of user commands, are scheduled. We have developed multiple policies for scheduling these tasks on computers that have (a) one processing element on the network interface card and (b) one or more processing cores on the CPU. To compare these policies, we have a developed a formal analytical model that predicts their performance. It shows that the optimal scheduling policy depends on several factors including the number of cores that is available. We have implemented a system that supports all of the policies and performed experiments to validate the formal model. This system is a component of a self-optimizing scheduler we have developed that improves response times by automatically choosing the scheduling policy based on number of cores and other factors. | [
{
"first": "Sasa",
"middle": [],
"last": "Junuzovic",
"suffix": ""
},
{
"first": "Prasun",
"middle": [],
"last": "Dewan",
"suffix": ""
}
] | 2,011 | 10.1145/1958824.1958908 | CSCW '11 | 2020830319 | [
"8908212",
"109812991",
"13597491",
"12391331",
"6686811",
"7835512",
"2253102",
"2312281",
"16691954",
"445900",
"11344093",
"128426"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:14854565 | 0 | 0 | 0 | 1 | 0 |
|||||
Real-time expectations based on context speech rate can cause words to appear or disappear | 988,866 | Real-time expectations based on context speech rate can cause words to appear or disappear Meredith Brown ([email protected]) Department of Brain & Cognitive Sciences, University of Rochester Meliora Hall, Box 270268, Rochester, NY 14627-0268 Laura C. Dilley ([email protected]) Department of Communicative Sciences & Disorders, Michigan State University 116 Oyer, East Lansing, MI 48824 Michael K. Tanenhaus ([email protected]) Department of Brain & Cognitive Sciences, University of Rochester Meliora Hall, Box 270268, Rochester, NY 14627-0268 Abstract To test predictions of a forward modeling framework for spo- ken language processing, we characterized effects of context speech rate on the real-time interpretation of indefinite noun phrases using the visual world paradigm. The speech rate of sentence material distal to the onset of the noun phrase was ma- nipulated such that the segments surrounding the determiner a in singular noun phrases had a faster speech rate than the sur- rounding context and the segments surrounding the onset of plural noun phrases had a relatively slow rate. These manipu- lations caused listeners to fail to perceive acoustically present determiners and to falsely perceive determiners not present in the signal. Crucially, fixations to singular and plural target pic- tures revealed effects of distal speech rate during the real-time processing of target expressions, strongly suggesting a locus in perceptual expectations. These results set the stage for quanti- tative tests of forward models of spoken language processing. Keywords: Speech rate; prosody; expectations; speech processing; visual world paradigm Introduction Expectation-based approaches in which perceptual input is evaluated with respect to internally generated forward mod- els provide compelling and increasingly influential explana- tions of phenomena in the perception and motor control liter- atures (e.g. Jordan & Rumelhart, 1992; Kawato, 1999). For example, DIVA, an influential model of speech production, incorporates a forward model component that predicts the auditory signal likely to result from a particular configura- tion of articulators within the vocal tract (Guenther & Micci Barreca, 1997). The forward model component accounts for the speed and efficiency with which the system can control speech movements, given the relatively slow mechanisms by which acoustic feedback influences speech production. Similar forward modeling approaches may also provide a promising explanatory framework for spoken language com- prehension. As in the domain of motor control, forward mod- eling of the perceptual attributes of upcoming speech pro- vides a compelling explanation for the remarkable speed and efficiency of speech perception and spoken word recognition in the face of considerable variability. This is a particularly attractive feature of expectation-based approaches to higher- level language comprehension as well, which propose a cen- tral role for expectations in processes such as syntactic com- prehension and lexical processing (e.g. Levy, 2008; Altmann & Kamide, 1999). We propose that comprehension also in- volves developing expectations about the acoustic realization of upcoming speech, conditioned on various contextual fac- tors such as prosodic phrasing, speech rate, discourse his- tory, and speaker-specific characteristics. Previous work sug- gests that these expectations are best characterized as prob- ability distributions, with listeners representing not only the expected form of a spoken word given the set of contextual conditioning factors, but also a measure of the variance or uncertainty of their estimate (Clayards et al., 2008; Levy et al., 2009). The degree of congruence between these percep- tual expectations and the incoming acoustic signal then con- tributes to the differential activation of competing lexical al- ternatives. Finally, when perceptual expectations are incon- gruent with the actual realization of a word, listeners should update their beliefs about the cues that condition their percep- tual expectations, resulting in adaptation that more closely aligns listeners’ expectations with the characteristics of the signal in context. Speech prosody generates acoustic regularities that are likely to foster expectations about the acoustic realization of upcoming speech sounds, including pitch and temporal char- acteristics that listeners perceive as patterning. This perceived patterning has been shown to influence real-time spoken lan- guage processing. For example, manipulations of pitch and duration early in an utterance influence the interpretation of cues to prosodic structure several syllables downstream (Dilley & McAuley, 2008; Dilley et al., 2010; Brown et al., 2011). The distal locus of these effects suggests that they are rooted in listeners’ expectations about the acoustic-phonetic realization of upcoming segments. Speech rate is particularly likely to systematically influ- ence listeners’ expectations about upcoming material. Speech sounds are interpreted relative to the global speech rate of an utterance, affecting perceived phoneme distinctions such as voicing contrasts (e.g. Miller, 1987; Reinisch et al., 2011). Therefore, listeners must evaluate the incoming signal with respect to a speaker’s estimated rate. Dilley and Pitt (2010) demonstrated that effects of context speech rate scale up to the perceived rate of articulation of larger constituents, in- | [
{
"first": "Meredith",
"middle": [],
"last": "Brown",
"suffix": ""
},
{
"first": "Laura",
"middle": [
"C."
],
"last": "Dilley",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"K."
],
"last": "Tanenhaus",
"suffix": ""
}
] | 2,012 | CogSci | 2401418683 | [
"1660615",
"18177177",
"1001325",
"16895507",
"18236372",
"14816458",
"18716103",
"12753641",
"144484551",
"118796178",
"27776155",
"1874331",
"878792",
"6211281",
"16502085",
"5808111",
"44491061",
"15384823",
"11604357",
"7241251",
"12156171"
] | [
"17280357",
"215435985",
"43705606",
"186871865",
"1567743",
"210974345",
"15868867",
"199147444",
"49302187",
"23277467",
"54144552"
] | true | true | true | https://api.semanticscholar.org/CorpusID:988866 | 0 | 0 | 0 | 1 | 0 |
||||||
The Flatter, the Better: Query Compilation Based on the Flattening Transformation | 15,380,324 | We demonstrate the insides and outs of a query compiler based on the flattening transformation, a translation technique designed by the programming language community to derive efficient data-parallel implementations from iterative programs. Flattening admits the straightforward formulation of intricate query logic including deeply nested loops over (possibly ordered) data or the construction of rich data structures. To demonstrate the level of expressiveness that can be achieved, we will bring a compiler frontend that accepts queries embedded into the Haskell programming language. Compilation via flattening takes places in a series of simple steps all of which will be made tangible by the demonstration. The final output is a program of lifted primitive operations which existing query engines can efficiently implement. We provide backends based on PostgreSQL and VectorWise to make this point however, most set-oriented or data-parallel engines could benefit from a flattening-based query compiler. | [
{
"first": "Alexander",
"middle": [],
"last": "Ulrich",
"suffix": ""
},
{
"first": "Torsten",
"middle": [],
"last": "Grust",
"suffix": ""
}
] | 2,015 | 10.1145/2723372.2735359 | SIGMOD '15 | 2007074710 | [
"12324203",
"15534112",
"16242093",
"15333197",
"10586063",
"85678",
"52805859",
"53788",
"7427367",
"9361663",
"2278174"
] | [
"59337386",
"8459181",
"146121265",
"49578916",
"53420528"
] | true | true | true | https://api.semanticscholar.org/CorpusID:15380324 | 0 | 0 | 0 | 1 | 0 |
|||||
AnimDiff: Comparing 3D Animations for Revision Control | 51,868,586 | The process of animating a complex 3D character can be a time consuming activity which may take several iterations and several artists working in collaboration, each iteration improving some elements of the animation but potentially introducing artifacts in others. At present there exists no formal process to collate these various revisions in a manner that allows for close examination of their differences, which would help speed up the creation of 3D animations. To address this we present a method for equivalence checking and displaying differences between differing versions of an animated 3D model. Implemented in a tool that allows selective blending of animations, this provides a first step towards a 3D animation revision control system. | [
{
"first": "George",
"middle": [],
"last": "Madges",
"suffix": ""
},
{
"first": "Idris",
"middle": [],
"last": "Miles",
"suffix": ""
},
{
"first": "Eike",
"middle": [
"Falk"
],
"last": "Anderson",
"suffix": ""
}
] | 2,017 | 10.2312/egsh.20171007 | Eurographics | 2650746337 | [
"17561179",
"16791519",
"5661874",
"216756",
"37209531",
"16583315",
"15176241",
"64613234"
] | [
"203600587",
"19579238",
"202774508"
] | true | true | true | https://api.semanticscholar.org/CorpusID:51868586 | 0 | 0 | 0 | 1 | 0 |
|||||
Designing for nomadic work | 12,864,466 | Nomadic work, an extreme form of mobile work, is becoming increasingly prevalent in organizations. Yet so far there has not been enough research attention on the particular challenges that nomadic workers face in order to design support for their work practices. We employed ethnographic interviews and observations to understand nomadic work practices. Drawing from strategies for survival of pastoralist nomads to guide our design investigation, we focus on an integrated perspective of nomadic work involving challenges related to assembling actants, seeking resources, and integrating with others in the organization. We discovered that nomadic workers need to continually seek out and compete for resources to maintain their mobile offices. They also face challenges in integrating into the organization to maintain visibility and to synchronize with others for meeting. We discuss the design recommendations that emerged from our investigation. | [
{
"first": "Norman",
"middle": [
"Makoto"
],
"last": "Su",
"suffix": ""
},
{
"first": "Gloria",
"middle": [],
"last": "Mark",
"suffix": ""
}
] | 2,008 | 10.1145/1394445.1394478 | DIS '08 | 2171806466 | [
"1094986",
"727943",
"188513839",
"60889234",
"207200039",
"63919",
"18903143",
"3056994",
"5910379",
"40939572",
"3356174",
"18062230",
"23001061",
"12364469",
"59528911",
"9191402",
"10193799",
"20346243",
"144723569",
"10520480",
"142754635",
"14145327"
] | [
"53249682",
"207953853",
"17987253",
"46986277",
"1272322",
"715494",
"20251952",
"13033716",
"5081490",
"69349500",
"12137006",
"51978267",
"31219084",
"14311137",
"207959298",
"39301652",
"16305919",
"204981167",
"28952826",
"16890686",
"952273",
"23744844",
"16894222",
"1952632",
"1401542",
"17900548"
] | true | true | true | https://api.semanticscholar.org/CorpusID:12864466 | 0 | 0 | 0 | 1 | 0 |
|||||
Decisions based on verbal probabilities: Decision bias or decision by belief sampling? | 21,110,446 | [
{
"first": "Hidehito",
"middle": [],
"last": "Honda",
"suffix": ""
},
{
"first": "Toshihiko",
"middle": [],
"last": "Matsuka",
"suffix": ""
},
{
"first": "Kazuhiro",
"middle": [],
"last": "Ueda",
"suffix": ""
}
] | 2,017 | CogSci | 2785435695 | [
"2517562",
"121247294",
"12709424",
"42440629",
"10283841",
"148088619",
"13338599",
"6575260",
"805275",
"143614331",
"22350011",
"144996562",
"16061354"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:21110446 | 0 | 0 | 0 | 1 | 0 |
|||||||
Toward a lagrangian vector field topology | 16,980,251 | In this paper we present an extended critical point concept which allows us to apply vector field topology in the case of unsteady flow. We propose a measure for unsteadiness which describes the rate of change of the velocities in a fluid element over time. This measure allows us to select particles for which topological properties remain intact inside a finite spatio-temporal neighborhood. One benefit of this approach is that the classification of critical points based on the eigenvalues of the Jacobian remains meaningful. In the steady case the proposed criterion reduces to the classical definition of critical points. As a first step we show that finding an optimal Galilean frame of reference can be obtained implicitly by analyzing the acceleration field. In a second step we show that this can be extended by switching to the Lagrangian frame of reference. This way the criterion can detect critical points moving along intricate trajectories. We analyze the behavior of the proposed criterion based on two analytical vector fields for which a correct solution is defined by their inherent symmetries and present results for numerical vector fields. | [
{
"first": "Raphael",
"middle": [],
"last": "Fuchs",
"suffix": ""
},
{
"first": "Jan",
"middle": [],
"last": "Kemmler",
"suffix": ""
},
{
"first": "Benjamin",
"middle": [],
"last": "Schindler",
"suffix": ""
},
{
"first": "Jürgen",
"middle": [],
"last": "Waser",
"suffix": ""
},
{
"first": "Filip",
"middle": [],
"last": "Sadlo",
"suffix": ""
},
{
"first": "Helwig",
"middle": [],
"last": "Hauser",
"suffix": ""
},
{
"first": "Ronald",
"middle": [],
"last": "Peikert",
"suffix": ""
}
] | 2,010 | 10.1111/j.1467-8659.2009.01686.x | Comput. Graph. Forum | Comput. Graph. Forum | 2052587161 | [
"116949230",
"5340418",
"121018048",
"2251541",
"6980973",
"16363960",
"16363960",
"12867087",
"35866269",
"759748",
"480499",
"115622380",
"121509215",
"122132406",
"6753626",
"14546090",
"1578095",
"17631025",
"14279205",
"2361131",
"4649578",
"116026681"
] | [
"16640070",
"1723292",
"197638721",
"214334447",
"7628135",
"54993505",
"15310795",
"14474665",
"15318709",
"173683",
"36016789",
"14866804",
"7425616",
"18876524",
"51987198",
"51987198"
] | true | true | true | https://api.semanticscholar.org/CorpusID:16980251 | 0 | 0 | 0 | 1 | 0 |
||||
Progressive high-quality response surfaces for visually guided sensitivity analysis | 18,508,788 | In this paper we present a technique which allows us to perform high quality and progressive response surface prediction from multidimensional input samples in an efficient manner. We utilize kriging interpolation to estimate a response surface which minimizes the expectation value and variance of the prediction error. High computational efficiency is achieved by employing parallel matrix and vector operations on the GPU. Our approach differs from previous kriging approaches in that it uses a novel progressive updating scheme for new samples based on blockwise matrix inversion. In this way we can handle very large sample sets to which new samples are continually added. Furthermore, we can monitor the incremental evolution of the surface, providing a means to early terminate the computation when no significant changes have occurred. When the generation of input samples is fast enough, our technique enables steering this generation process interactively to find relevant dependency relations. | [
{
"first": "Ismail",
"middle": [],
"last": "Demir",
"suffix": ""
},
{
"first": "Rüdiger",
"middle": [],
"last": "Westermann",
"suffix": ""
}
] | 2,013 | 10.1111/cgf.12089 | Comput. Graph. Forum | Comput. Graph. Forum | 2117156208 | [
"120192795",
"11339322",
"18463722",
"122445786",
"11863186",
"51818266",
"10914762",
"18152490",
"14786257",
"120134946",
"120611147",
"12320381",
"117319434",
"125181692",
"16922550",
"2605216",
"14944096",
"124371699"
] | [
"18225636",
"2392900",
"745262"
] | true | true | true | https://api.semanticscholar.org/CorpusID:18508788 | 0 | 0 | 0 | 1 | 0 |
||||
EvaPlanner: an evacuation planner with social-based flocking kinetics | 3,649,975 | This paper demonstrates a system that exploits graph mining, social network analysis, and agent-based crowd simulation techniques to investigate the evacuation dynamics during fire emergency. We create a novel evacuation planning system, EvaPlanner, to deal with three tasks. First, the system identifies the preferable locations to establish the exits to facilitate efficient evacuation from the dangerous areas. Second, it determines the most effective positions to place the emergency signs such that panic crowd can quickly find the exits. Third, it faithfully simulates the evacuation dynamics of crowd considering not only the individual movement kinetics but also the social connections between people. EvaPlanner provides a flexible experimental platform for investigating the evacuation dynamics under a variety of settings, and can further be utilized for animation and movie production. In addition, it can serve as a tool to assist architects address the safety concern during the planning phase. The demo system can be found in the link: http://mslab.csie.ntu.edu.tw/evaplanner/ | [
{
"first": "Cheng-Te",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Shou-De",
"middle": [],
"last": "Lin",
"suffix": ""
}
] | 2,012 | 10.1145/2339530.2339782 | KDD | 2054867921 | [
"1877629",
"7213419",
"310346",
"9132784",
"207732226",
"2341021",
"5905485",
"3926195"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:3649975 | 0 | 0 | 0 | 1 | 0 |
|||||
Innovation in user interface development: obstacles and opportunities | 16,701,171 | Case studies of two software development organizations suggest that common practices of these organizations pose obstacles to innovation. Although software development organizations have good reasons to be conservative and resist innovation, they recognize the importance of innovations to the competitiveness of their products. But organizations experienced at development of regularly scheduled releases are not well suited to development of innovations. In this research investigators worked with the user interface teams in two organizations while interviewing people throughout the organizations. Both organizations developed prototypes, but only small design changes were prototyped and tested early in development. Innovative changes were evaluated late, when resistance to iteration was great. User interface designs and prototypes were often not shown to users. Mechanisms for coordinating development were another conservative influence. Both organizations successfully overcame these obstacles by departing from established practices. | [
{
"first": "S.",
"middle": [
"E."
],
"last": "Poltrock",
"suffix": ""
}
] | 1,989 | 10.1145/67449.67488 | CHI '89 | 2206991795 | [
"155156454",
"5736766",
"13865423",
"52819461",
"1575360",
"14867486",
"166906753",
"166633296",
"15739597",
"195715685"
] | [
"6094392",
"15184527",
"16243876",
"10159097",
"1575360",
"43900107",
"56925237",
"5314847",
"18698898",
"13384140"
] | true | true | true | https://api.semanticscholar.org/CorpusID:16701171 | 0 | 0 | 0 | 1 | 0 |
|||||
Minimization of tree pattern queries | 15,012,046 | Tree patterns forms a natural basis to query tree-structured data such as XML and LDAP. Since the efficiency of tree pattern matching against a tree-structured database depends on the size of the pattern, it is essential to identify and eliminate redundant nodes in the pattern and do so as quickly as possible. In this paper, we study tree pattern minimization both in the absence and in the presence of integrity constraints (ICs) on the underlying tree-structured database. When no ICs are considered, we call the process of minimizing a tree pattern, constraint-independent minimization. We develop a polynomial time algorithm called CIM for this purpose. CIM's efficiency stems from two key properties: (i) a node cannot be redundant unless its children are, and (ii) the order of elimination of redundant nodes is immaterial. When ICs are considered for minimization, we refer to it as constraint-dependent minimization. For tree-structured databases, required child/descendant and type co-occurrence ICs are very natural. Under such ICs, we show that the minimal equivalent query is unique. We show the surprising result that the algorithm obtained by first augmenting the tree pattern using ICS, and then applying CIM, always finds the unique minimal equivalent query; we refer to this algorithm as ACIM. While ACIM is also polynomial time, it can be expensive in practice because of its inherent non-locality. We then present a fast algorithm, CDM, that identifies and eliminates local redundancies due to ICs, based on propagating “information labels” up the tree pattern. CDM can be applied prior to ACIM for improving the minimization efficiency. We complement our analytical results with an experimental study that shows the effectiveness of our tree pattern minimization techniques. | [
{
"first": "Sihem",
"middle": [],
"last": "Amer-Yahia",
"suffix": ""
},
{
"first": "SungRan",
"middle": [],
"last": "Cho",
"suffix": ""
},
{
"first": "Laks",
"middle": [
"V.",
"S."
],
"last": "Lakshmanan",
"suffix": ""
},
{
"first": "Divesh",
"middle": [],
"last": "Srivastava",
"suffix": ""
}
] | 2,001 | 10.1145/375663.375730 | SIGMOD '01 | 2124581454 | [] | [
"13923068",
"245388",
"13992308",
"364349",
"3411534",
"14859148",
"15399567",
"17057801",
"12476527",
"5905137",
"1475637",
"15646709",
"198923402",
"64000808",
"18881194",
"15152772",
"17858241",
"9866393",
"5830552",
"422219",
"17422523",
"15178370",
"27917308",
"2478865",
"6956032",
"6264741",
"6495117",
"52085432",
"16070081",
"57276",
"14909727",
"7433955",
"11813476",
"207157107",
"1190554",
"14141238",
"12168122",
"31276367",
"14816888",
"3535791",
"15142288",
"13884604",
"12482159",
"61565673",
"7168006",
"201391",
"7979603",
"17077898",
"6304803",
"15704053",
"14659095",
"6974542",
"117371920",
"209441559",
"15700034",
"6030329",
"6611882",
"13985043",
"17138495",
"8631695",
"16369780",
"1932947",
"18246724",
"2587595",
"3459657",
"62710921",
"15393683",
"16888824",
"2806729",
"5408377",
"139737",
"13067011",
"461602",
"1362728",
"1231139",
"2928185",
"1307852",
"7160266",
"6784651",
"16297333",
"3227960",
"13277388",
"12538567",
"9446133",
"15594687",
"18339326",
"12884517",
"19037197",
"7469497",
"9466888",
"15578233",
"18069649",
"283808",
"31687844",
"5083561",
"16744607",
"672990",
"1988420",
"15547388",
"7534720",
"10477055",
"3135043",
"34474460",
"10658903",
"8415665",
"17958728",
"17443297",
"2313351",
"5956394",
"10065661",
"11976020",
"15871289",
"2236228",
"1969391",
"15664663",
"5140575",
"10950599",
"8372123",
"18796444",
"47258390",
"1149308",
"2318527",
"1551124",
"17050539",
"6551437",
"14512821",
"1041369",
"18013791",
"14074563",
"2681296",
"14907294",
"5129888",
"1354251",
"15943035",
"47264909",
"3399945",
"17365300",
"14815487",
"17052968",
"16291461"
] | false | true | true | https://api.semanticscholar.org/CorpusID:15012046 | 0 | 0 | 0 | 0 | 0 |
|||||
Semi-supervised Feature Importance Evaluation with Ensemble Learning | 15,015,654 | We consider the problem of using a large amount of unlabeled data to improve the efficiency of feature selection in high dimensional datasets, when only a small set of labeled examples is available. We propose a new semi-supervised feature importance evaluation method (SSFI for short), that combines ideas from co-training and random forests with a new permutation-based out-of-bag feature importance measure. We provide empirical results on several benchmark datasets indicating that SSFI can lead to significant improvement over state-of-the-art semi-supervised and supervised algorithms. | [
{
"first": "Hasna",
"middle": [],
"last": "Barkia",
"suffix": ""
},
{
"first": "Haytham",
"middle": [],
"last": "Elghazel",
"suffix": ""
},
{
"first": "Alex",
"middle": [],
"last": "Aussem",
"suffix": ""
}
] | 2,011 | 10.1109/ICDM.2011.129 | 2011 IEEE 11th International Conference on Data Mining | 2011 IEEE 11th International Conference on Data Mining | 2022663808 | [
"379259",
"18364228",
"35777",
"16036489",
"10609338",
"536023",
"1338699",
"17457501",
"10149257",
"89141",
"1077768",
"406684",
"2758814",
"10160463",
"2704029",
"63053723",
"35896116",
"209099422",
"12929471",
"2914506",
"19226700",
"7553535"
] | [
"12446439",
"146019739",
"18653682",
"17045458",
"32617124",
"12250798",
"4413783"
] | true | true | true | https://api.semanticscholar.org/CorpusID:15015654 | 1 | 1 | 1 | 1 | 1 |
||||
Stabilized Annotations for Mobile Remote Assistance | 14,716,453 | Recent mobile technology has provided new opportunities for creating remote assistance systems. However, mobile support systems present a particular challenge: both the camera and display are held by the user, leading to shaky video. When pointing or drawing annotations, this means that the desired target often moves, causing the gesture to lose its intended meaning. To address this problem, we investigate annotation stabilization techniques, which allow annotations to stick to their intended location. We studied two annotation systems, using three different forms of annotations, with both tablets and head-mounted displays. Our analysis suggests that stabilized annotations and head-mounted displays are only beneficial in certain situations. However, the simplest approach of automatically freezing video while drawing annotations was surprisingly effective in facilitating the completion of remote assistance tasks. | [
{
"first": "Omid",
"middle": [],
"last": "Fakourfar",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Ta",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Tang",
"suffix": ""
},
{
"first": "Scott",
"middle": [],
"last": "Bateman",
"suffix": ""
},
{
"first": "Anthony",
"middle": [],
"last": "Tang",
"suffix": ""
}
] | 2,016 | 10.1145/2858036.2858171 | Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems | 2407635761 | [
"63352914",
"14845169",
"17906496",
"16502531",
"3379429",
"1071756",
"5149186",
"1156914",
"15583532",
"2058005",
"17507490",
"69225",
"10899975",
"15929314",
"14370661",
"62769362",
"1730143",
"14111888",
"5652703",
"1283983",
"35936145",
"39645711",
"18242002",
"16448329",
"17013982",
"602763",
"15896359",
"18760367",
"13197055",
"16650042",
"5919957",
"1987727"
] | [
"3355133",
"5043910",
"209168459",
"58669925",
"20232314",
"208016468",
"203694071",
"202159361",
"8184997",
"25111895",
"210693285",
"46593726",
"49345625",
"52979340",
"5046306",
"28849392",
"59337658",
"9061195",
"21673554",
"24443202",
"46955799"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14716453 | 1 | 1 | 1 | 1 | 1 |
|||||
Knowledge Discovery in Academic Drug Discovery Programs: Opportunities and Challenges | 44,250,353 | In United State several universities and research institutes including the national health institute (NIH) recently started programs aiming for drug discovery. With the initiatives, huge volumes of data have been collected and shared with public free of charge. Those initiatives provide an unprecedented opportunity for data miner and machine learner to study knowledge discovery problems associated with drug design. In this tutorial, the presenter will review the knowledge discovery and management needs in the drug discovery process. Latest methodology development, primarily those from data mining, machine learning, and statistical learning will be discussed. | [
{
"first": "Jun",
"middle": [],
"last": "Huan",
"suffix": ""
}
] | 2,010 | 10.1109/ICDM.2010.163 | 2010 IEEE International Conference on Data Mining | 2010 IEEE International Conference on Data Mining | 2062069816 | [] | [] | false | false | true | https://api.semanticscholar.org/CorpusID:44250353 | 0 | 0 | 0 | 0 | 0 |
||||
Large and Small Eddies Matter: Animating Trees in Wind Using Coarse Fluid Simulation and Synthetic Turbulence | 19,917,900 | Animating trees in wind has long been a problem in computer graphics. Progress on this problem is important for both visual effects in films and forestry biomechanics. More generally, progress on tree motion in wind may inform future work on two-way coupling between turbulent flows and deformable objects. Synthetic turbulence added to a coarse fluid simulation produces convincing animations of turbulent flows but two-way coupling between the enriched flow and objects embedded in the flow has not been investigated. Prior work on two-way coupling between fluid and deformable models lacks a subgrid resolution turbulence model. We produce realistic animations of tree motion by including motion due to both large and small eddies using synthetic subgrid turbulence and porous proxy geometry. Synthetic turbulence at the subgrid scale is modulated using turbulent kinetic energy (TKE). Adding noise after sampling the mean flow and TKE transfers energy from small eddies directly to the tree geometry. The resulting animations include both global sheltering effects and small scale leaf and branch motion. Viewers, on average, found animations, which included both coarse fluid simulation and TKE-modulated noise to be more accurate than animations generated using coarse fluid simulation or noise alone. | [
{
"first": "A.",
"middle": [],
"last": "Selino",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Jones",
"suffix": ""
}
] | 2,013 | 10.1111/j.1467-8659.2012.03232.x | Comput. Graph. Forum | Comput. Graph. Forum | 2093988661 | [] | [
"55943459",
"17643542",
"13253981",
"14709004",
"4315893",
"12537364",
"47021704",
"10407562",
"7651113",
"29278084",
"13667951",
"1224093",
"15251073",
"10578247"
] | false | true | false | https://api.semanticscholar.org/CorpusID:19917900 | null | null | null | null | null |
||||
USpan: an efficient algorithm for mining high utility sequential patterns | 207,196,234 | Sequential pattern mining plays an important role in many applications, such as bioinformatics and consumer behavior analysis. However, the classic frequency-based framework often leads to many patterns being identified, most of which are not informative enough for business decision-making. In frequent pattern mining, a recent effort has been to incorporate utility into the pattern selection framework, so that high utility (frequent or infrequent) patterns are mined which address typical business concerns such as dollar value associated with each pattern. In this paper, we incorporate utility into sequential pattern mining, and a generic framework for high utility sequence mining is defined. An efficient algorithm, USpan, is presented to mine for high utility sequential patterns. In USpan, we introduce the lexicographic quantitative sequence tree to extract the complete set of high utility sequences and design concatenation mechanisms for calculating the utility of a node and its children with two effective pruning strategies. Substantial experiments on both synthetic and real datasets show that USpan efficiently identifies high utility sequences from large scale data with very low minimum utility. | [
{
"first": "Junfu",
"middle": [],
"last": "Yin",
"suffix": ""
},
{
"first": "Zhigang",
"middle": [],
"last": "Zheng",
"suffix": ""
},
{
"first": "Longbing",
"middle": [],
"last": "Cao",
"suffix": ""
}
] | 2,012 | 10.1145/2339530.2339636 | KDD | 2144309138 | [
"12242182",
"18136074",
"6457609",
"56142380",
"3360925",
"15733312",
"15606900",
"15794927",
"207180619",
"206782042",
"1174595",
"740958",
"15878186",
"5387869"
] | [
"26793811",
"86470854",
"55333778",
"198190845",
"52247548",
"6685215",
"12286407",
"40692197",
"7657544",
"2831337",
"18770607",
"28212452",
"209500827",
"896719",
"210695046",
"17181081",
"211297798",
"208632050",
"209500697",
"552165",
"8878987",
"11192392",
"210694331",
"209501100",
"17373184",
"43263407",
"22939079",
"210692820",
"132055203",
"14283891",
"4560991",
"2823909",
"119119957",
"18927958",
"67855929",
"17206280",
"6470817",
"9119478",
"27916688",
"15380608",
"59027456",
"12828454",
"35790026",
"86530008",
"41804329",
"108321221",
"209899199",
"49875426",
"9784038",
"59524566",
"13825268",
"1320892",
"214691972",
"214692483",
"15131928",
"3513542",
"212648329",
"13474952",
"11764750",
"59235692",
"2505063",
"199435533",
"54574649",
"16823546",
"3675437",
"209460668",
"2829121",
"24272443",
"3268923",
"11990407",
"19033751",
"21691374",
"52260480",
"22360385",
"9412183",
"211298747",
"8378180",
"6839345",
"53722355",
"9671749",
"208633442",
"6441816",
"46931523",
"10975621",
"17684121",
"214692230",
"53079152",
"44090490",
"19492482",
"4981819",
"139106175",
"15573332",
"18550031",
"6563057",
"12892196",
"203655949",
"1278587",
"15344933",
"44105041",
"212667848",
"49415663",
"16743389",
"208617681"
] | true | true | true | https://api.semanticscholar.org/CorpusID:207196234 | 0 | 0 | 0 | 1 | 0 |
|||||
Phonological Generalization from Distributional Evidence | 13,493,080 | Phonological Generalization from Distributional Evidence Bo˙zena Paj ak ˛ & Roger Levy {bpajak, rlevy}@ucsd.edu Department of Linguistics, UC San Diego 9500 Gilman Drive #108, La Jolla, CA 92093 USA Abstract We propose a model of L2 phonological learning in which the acquisition of novel phonological category inventories pro- ceeds not by mapping L2 inputs onto existing category inven- tories available in L1 and other already known languages, but rather through general categorization processes in which L1 and other language knowledge serves as an inductive bias. This approach views linguistic knowledge as hierarchically orga- nized such that the outcome of acquisition of a language—L1 or otherwise—includes not only knowledge of the specific lan- guage in question, but also beliefs about how any language is likely to be structured. In this paper we test a set of predictions regarding how two key types of information can come together to drive L2 learning: distributional information within a single phonetic dimension and generalization bias derived from ex- isting knowledge of language. We tested these predictions by training adult monolingual English speakers in a distributional learning paradigm (Maye & Gerken, 2000; Maye, Werker, & Gerken, 2002) on a novel contrast, segmental length, and test- ing them on categorization of short and long segments for both trained and untrained items. Results show both learning and generalization from one class of segments (sonorants) to another class (obstruents), broadening the empirical range of phonetic contrasts for which distributional learning has been shown to be effective and providing evidence for our approach to L2 learning as one of inductive inference and generalization rather than of mapping. Keywords: L2 phonological acquisition; distributional learn- ing; speech perception; categorization; generalization. Introduction Language learning in adulthood has traditionally been re- garded as an inherently difficult process due to first language (L1) interference. One reason for this view is the common assumption that second language (L2) begins as parasitic on L1, and only gradually separates itself as an independent lan- guage in the course of learning (e.g., MacWhinney, 1987). We propose a model in which L2 learning (and, more specif- ically, phonological acquisition) is instead viewed as a pro- cess of inductive inference, where learners make implicit predictions about the possible underlying structures of the novel language by combining two sources of information: (1) the statistical properties of the L2 input, and (2) previous language knowledge (including both experience and any in- nate biases), which serves as an inductive bias guiding learn- ers in their inferences about novel phonological structures. The proposed model assumes that the structure of language knowledge is represented at multiple levels with one level for knowledge of specific languages, and a higher level represent- ing more abstract knowledge of the structure of languages in general. This model fits within the general approach to learn- ing as a process of rational hypothesis construction and test- ing, in which learners infer the underlying structure of their input by generalizing beyond the specific surface properties that they are exposed to (e.g., Tenenbaum & Griffiths, 2001; Xu & Tenenbaum, 2007; Gerken, 2010). At the same time, the proposed model is radically different from traditional views on L2 phonological acquisition, where perception and learn- ing of novel sounds have been assumed to rely on the pro- cess of mapping of L2 sounds onto L1 phonological cate- gories (Best, 1995; Flege, 1995; Hancin-Bhatt, 1994; Kuhl & Iverson, 1995). Under these views, L2 learners—instead of making implicit rational predictions about the L2 phonologi- cal categories—try to establish conceptual links between L2 sounds and their most similar L1 counterparts, so as to pro- cess the unfamiliar sounds directly through their L1 phono- logical system. We propose, in contrast, that learners do not directly filter the L2 speech input through their L1 phono- logical categories, but rather that they make the best possible guesses about how individual novel sounds are grouped into categories by relying on the same mechanisms that are used in general categorization processes for many types of perceptual stimuli. In order to define the details of the proposed model we fol- low the general categorization literature in that any percep- tual stimulus can be represented as a point in a multidimen- sional psychological space. People are able to categorize the stimuli by abstracting information about stimulus dimensions (e.g., color, shape, size, etc.) from single instances of the input (Posner & Keele, 1968; Kruschke, 1992). Within Kruschke’s model, learning categories occurs by computing and attach- ing weights (or attention strength) to each of the stimulus dimensions. The attention strength reflects the relevance of any given dimension for a particular categorization task. That is, high strength will be associated with dimensions hypoth- esized as the most informative in distinguishing between cat- egories. This way, people are able to perform categorization tasks by selectively attending to dimensions that are relevant, while at the same time ignoring other dimensions (Nosofsky, 1986). For instance, with stimuli varying along three dimen- sions such as color, shape, and size (Fig. 1a), people are good at categorizing by just one dimension, for example color. In this situation, the psychological space gets stretched along the color dimension—due to high attention strength assigned to this dimension (Kruschke, 1992)—and shrunk along the size and shape dimensions (Fig. 1b). This strategy is effective in categorization tasks because by attending selectively to the relevant dimension, people maximize within-category sim- ilarity and between-category discriminability, thus avoiding between-category confusion due to variation along irrelevant dimensions. We pursue a similar idea to account for phonological | [
{
"first": "Bozena",
"middle": [],
"last": "Pajak",
"suffix": ""
},
{
"first": "Roger",
"middle": [],
"last": "Levy",
"suffix": ""
}
] | 2,011 | CogSci | 2578534086 | [
"142915480",
"22746646",
"12045675",
"17439482",
"144732805",
"26166298",
"143278242",
"45721427",
"60530261",
"8822991",
"17047086",
"319422",
"27766265",
"16711157",
"8869524",
"732104",
"2252346",
"45036790",
"148233115",
"1300487",
"6723405",
"7907955"
] | [
"15580380",
"17084588",
"12963886",
"26365161",
"6681116",
"3858594"
] | true | true | true | https://api.semanticscholar.org/CorpusID:13493080 | 0 | 0 | 0 | 1 | 0 |
||||||
Meta-Graph Based Recommendation Fusion over Heterogeneous Information Networks | 3,335,889 | Heterogeneous Information Network (HIN) is a natural and general representation of data in modern large commercial recommender systems which involve heterogeneous types of data. HIN based recommenders face two problems: how to represent the high-level semantics of recommendations and how to fuse the heterogeneous information to make recommendations. In this paper, we solve the two problems by first introducing the concept of meta-graph to HIN-based recommendation, and then solving the information fusion problem with a "matrix factorization (MF) + factorization machine (FM)" approach. For the similarities generated by each meta-graph, we perform standard MF to generate latent features for both users and items. With different meta-graph based features, we propose to use FM with Group lasso (FMG) to automatically learn from the observed ratings to effectively select useful meta-graph based features. Experimental results on two real-world datasets, Amazon and Yelp, show the effectiveness of our approach compared to state-of-the-art FM and other HIN-based recommendation algorithms. | [
{
"first": "Huan",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Quanming",
"middle": [],
"last": "Yao",
"suffix": ""
},
{
"first": "Jianda",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Yangqiu",
"middle": [],
"last": "Song",
"suffix": ""
},
{
"first": "Dik Lun",
"middle": [],
"last": "Lee",
"suffix": ""
}
] | 2,017 | 10.1145/3097983.3098063 | KDD '17 | 2743159750 | [
"979119",
"6484210",
"4557963",
"15942241",
"771650",
"1964279",
"12963161",
"2155233",
"1472236",
"369806",
"3914935",
"207168823",
"126188224",
"10811631",
"2861705",
"207216684",
"7848601",
"6440341",
"467086",
"5499886",
"207177737",
"3488610",
"3499400",
"3473607",
"207204065",
"6693112",
"10082102",
"11881626",
"9120907",
"3893020",
"9975731",
"2806084",
"14914495",
"207209998",
"6162124",
"3359980"
] | [
"51779461",
"202540679",
"201666086",
"212704496",
"50772365",
"21694229",
"53062184",
"196199861",
"52228661",
"159042183",
"211548270",
"201703204",
"203579261",
"59317056",
"201304037",
"211126498",
"195699519",
"214596563",
"211677665",
"56480718",
"83458637",
"1190738",
"207809162",
"209404872",
"52840299",
"3766110",
"2409634",
"189761996",
"195345081",
"201142785",
"59523732",
"3742725",
"211056898",
"199543814",
"50774691",
"195791567",
"53036565",
"53086986",
"53079482",
"209320275",
"58981833",
"53285250",
"215721684",
"59232453",
"199012882",
"13674725",
"86631164",
"210693001",
"53811579",
"199572991",
"204788875",
"214638117",
"59291937",
"53035042",
"199668672",
"199668672",
"214743464",
"13686042",
"73729352",
"50771526",
"51608531",
"209415030",
"203904865",
"184483649",
"31982313",
"211688961",
"201660501",
"211211445",
"210969677",
"214701239",
"4826389",
"197679547",
"52137534",
"56171523",
"202577562",
"209405285"
] | true | true | true | https://api.semanticscholar.org/CorpusID:3335889 | 0 | 0 | 0 | 1 | 0 |
|||||
Touch scrolling transfer functions | 11,382,167 | Touch scrolling systems use a transfer function to transform gestures on a touch sensitive surface into scrolling output. The design of these transfer functions is complex as they must facilitate precise direct manipulation of the underlying content as well as rapid scrolling through large datasets. However, researchers' ability to refine them is impaired by: (1) limited understanding of how users express scrolling intentions through touch gestures; (2) lack of knowledge on proprietary transfer functions, causing researchers to evaluate techniques that may misrepresent the state of the art; and (3) a lack of tools for examining existing transfer functions. To address these limitations, we examine how users express scrolling intentions in a human factors experiment; we describe methods to reverse engineer existing `black box' transfer functions, including use of an accurate robotic arm; and we use the methods to expose the functions of Apple iOS and Google Android, releasing data tables and software to assist replication. We discuss how this new understanding can improve experimental rigour and assist iterative improvement of touch scrolling. | [
{
"first": "Philip",
"middle": [],
"last": "Quinn",
"suffix": ""
},
{
"first": "Sylvain",
"middle": [],
"last": "Malacria",
"suffix": ""
},
{
"first": "Andy",
"middle": [],
"last": "Cockburn",
"suffix": ""
}
] | 2,013 | 10.1145/2501988.2501995 | UIST '13 | 2166068477 | [
"2148085",
"7876951",
"5971520",
"95860",
"1991780",
"13116634",
"201878618",
"1096303",
"191800",
"8814893",
"299783",
"3947244",
"1378201"
] | [
"5078180",
"15664252",
"73716081",
"13673271",
"199531678",
"18177874",
"53659209",
"3874655",
"140242702",
"19862176",
"6394868",
"3503264",
"30819697",
"12420182",
"26852275",
"9206910",
"13146161",
"294056"
] | true | true | true | https://api.semanticscholar.org/CorpusID:11382167 | 0 | 0 | 0 | 1 | 0 |
|||||
Ambient displays: influencing movement patterns | 5,326,830 | Ambient displays are gradually augmenting the principal static elements of architecture, such as walls, transforming space into a dynamic and ever-changing environment. Does the addition of such digital elements influence people's perception and understanding of space around them? If so, do ambient displays lead to behavioral changes like people's movement in such environments? In this particular study, a series of experiments were conducted to investigate public interior spaces with embedded ambient displays. The findings are then presented showing how the presence of an ambient display through its visual depth affects and changes movement patterns. This study discusses the ability of an ambient display to refine navigation paths and suggests that its visual depth can enhance its effectiveness. © 2011 IFIP International Federation for Information Processing. | [
{
"first": "Tasos",
"middle": [],
"last": "Varoudis",
"suffix": ""
},
{
"first": "Sheep",
"middle": [],
"last": "Dalton",
"suffix": ""
},
{
"first": "Katerina",
"middle": [],
"last": "Alexiou",
"suffix": ""
},
{
"first": "Theodore",
"middle": [],
"last": "Zamenopoulos",
"suffix": ""
}
] | 2,011 | 10.1145/1979742.1979752 | CHI EA '11 | 2222859207,2050164874 | [] | [
"63172720"
] | false | true | false | https://api.semanticscholar.org/CorpusID:5326830 | null | null | null | null | null |
|||||
Selection-based Text Entry in Virtual Reality | 5,056,763 | In recent years, Virtual Reality (VR) and 3D User Interfaces (3DUI) have seen a drastic increase in popularity, especially in terms of consumer-ready hardware and software. While the technology for input as well as output devices is market ready, only a few solutions for text input exist, and empirical knowledge about performance and user preferences is lacking. In this paper, we study text entry in VR by selecting characters on a virtual keyboard. We discuss the design space for assessing selection-based text entry in VR. Then, we implement six methods that span different parts of the design space and evaluate their performance and user preferences. Our results show that pointing using tracked hand-held controllers outperforms all other methods. Other methods such as head pointing can be viable alternatives depending on available resources. We summarize our findings by formulating guidelines for choosing optimal virtual keyboard text entry methods in VR. | [
{
"first": "Marco",
"middle": [],
"last": "Speicher",
"suffix": ""
},
{
"first": "Anna",
"middle": [
"Maria"
],
"last": "Feit",
"suffix": ""
},
{
"first": "Pascal",
"middle": [],
"last": "Ziegler",
"suffix": ""
},
{
"first": "Antonio",
"middle": [],
"last": "Krüger",
"suffix": ""
}
] | 2,018 | 10.1145/3173574.3174221 | CHI '18 | 2795625669 | [
"35276304",
"58966523",
"18294381",
"2156890",
"15739981",
"12806863",
"39991163",
"15400675",
"42535853",
"18450529",
"59800128",
"207242864",
"6428749",
"15252590",
"207235326",
"6752831",
"108749274",
"62715400",
"12530345",
"14429485",
"586537",
"60827152",
"26372766",
"1473980",
"5293431",
"60515325",
"14306936",
"30760021",
"10035158",
"10192455",
"1645163",
"15826042",
"12637405",
"11508358",
"713734",
"23953651",
"18397179",
"1946723",
"63098434",
"3249108",
"20341184",
"17054046"
] | [
"211031511",
"209696035",
"198194351",
"195856362",
"209496089",
"208277544",
"140307552",
"140220241",
"140220241",
"73454880",
"174818515"
] | true | true | true | https://api.semanticscholar.org/CorpusID:5056763 | 1 | 1 | 1 | 1 | 1 |
|||||
Supporting Workplace Detachment and Reattachment with Conversational Intelligence | 5,058,047 | Research has shown that productivity is mediated by an individual's ability to detach from their work at the end of the day and reattach with it when they return the next day. In this paper we explore the extent to which structured dialogues, focused on individuals' work-related tasks or emotions, can help them with the detachment and reattachment processes. Our inquiry is driven with SwitchBot, a conversational bot which engages with workers at the start and end of their work day. After preliminarily validating the design of a detachment and reattachment dialogue frame-work with 108 crowdworkers, we study SwitchBot's use in-situ for 14 days with 34 information workers. We find that workers send fewer e-mails after work hours and spend a larger percentage of their first hour at work using productivity applications than they normally would when using SwitchBot. Further, we find that productivity gains were better sustained when conversations focused on work-related emotions. Our results suggest that conversational bots can be effective tools for aiding workplace detachment and reattachment and help people make successful use of their time on and off the job. | [
{
"first": "Alex",
"middle": [
"C."
],
"last": "Williams",
"suffix": ""
},
{
"first": "Harmanpreet",
"middle": [],
"last": "Kaur",
"suffix": ""
},
{
"first": "Gloria",
"middle": [],
"last": "Mark",
"suffix": ""
},
{
"first": "Anne",
"middle": [
"Loomis"
],
"last": "Thompson",
"suffix": ""
},
{
"first": "Shamsi",
"middle": [
"T."
],
"last": "Iqbal",
"suffix": ""
},
{
"first": "Jaime",
"middle": [],
"last": "Teevan",
"suffix": ""
}
] | 2,018 | 10.1145/3173574.3173662 | CHI '18 | 2793427265 | [
"3263112",
"144500962",
"36087894",
"23250471",
"13841524",
"21406930",
"3011910",
"13900123",
"117882390",
"40569986",
"1708710",
"151563545",
"22236755",
"648379",
"143709348",
"9581662",
"145684937",
"26019125",
"168298910",
"30702428",
"145779610",
"9420526",
"1442595",
"46189288",
"143881657",
"17534210",
"14919533",
"15438999",
"14049253",
"7067224",
"151955459",
"143223168",
"6491801",
"27448862",
"15885451",
"21750560",
"23516950",
"6479245",
"2101186",
"145336080",
"27152228",
"12725475",
"9976322",
"8622513",
"2251975",
"143196970",
"9278041",
"18439965",
"457954",
"145754803",
"7679194",
"1896290",
"23744206"
] | [
"209320822",
"140225289",
"117950543",
"207959225",
"201114841",
"211730782",
"52979334",
"211031876",
"204894270",
"166228583",
"52980092",
"202349538",
"210172308"
] | true | true | true | https://api.semanticscholar.org/CorpusID:5058047 | 0 | 0 | 0 | 1 | 0 |
|||||
GPU spectral viewer: analysing paintings from a colorimetric perspective | 38,883,472 | Over the last fifteen years, multipsectral imaging has gained in importance and interest, especially in the field of Cultural Heritage, art investigation and conservation. ::: ::: Extending the concept of scientific imagery such as colorimetric, infrared reflectography (IRR), ultraviolet (UV) and X-ray imaging applied to the study of paintings, multispectral imaging, coupled with high resolution and HDR (high dynamic range) has significantly improved the scope and accuracy of the non-invasive scientific analysis that is possible. ::: ::: In order to exploit and study such multispectral data, a special GPU-based application using a custom color management process has been developed. In this paper we will present its innovative capabilities in image processing and visualization which enhance the study of works of art. | [
{
"first": "Philippe",
"middle": [],
"last": "Colantoni",
"suffix": ""
},
{
"first": "Denis",
"middle": [],
"last": "Pitzalis",
"suffix": ""
},
{
"first": "Ruven",
"middle": [],
"last": "Pillay",
"suffix": ""
},
{
"first": "Genevieve",
"middle": [],
"last": "Aitken",
"suffix": ""
}
] | 2,007 | 10.2312/VAST/VAST07/125-132 | VAST | 1543901868 | [] | [
"1983946"
] | false | true | false | https://api.semanticscholar.org/CorpusID:38883472 | null | null | null | null | null |
|||||
Real Time Animation of Virtual Humans: A Trade-off Between Naturalness and Control | 29,933,550 | Virtual humans are employed in many interactive applications using 3D virtual environments, including (serious) games. The motion of such virtual humans should look realistic (or ‘natural’) and allow interaction with the surroundings and other (virtual) humans. Current animation techniques differ in the trade-off they offer between motion naturalness and the control that can be exerted over the motion. We show mechanisms to parametrize, combine (on different body parts) and concatenate motions generated by different animation techniques. We discuss several aspects of motion naturalness and show how it can be evaluated. We conclude by showing the promise of combinations of different animation paradigms to enhance both naturalness and control. | [
{
"first": "H.",
"middle": [],
"last": "Van Welbergen",
"suffix": ""
},
{
"first": "B. J. H.",
"middle": [],
"last": "Van Basten",
"suffix": ""
},
{
"first": "A.",
"middle": [],
"last": "Egges",
"suffix": ""
},
{
"first": "Zs. M.",
"middle": [],
"last": "Ruttkay",
"suffix": ""
},
{
"first": "M. H.",
"middle": [],
"last": "Overmars",
"suffix": ""
}
] | 2,010 | 10.1111/j.1467-8659.2010.01822.x | Comput. Graph. Forum | Comput. Graph. Forum | 2097278008 | [] | [
"28334776"
] | false | true | false | https://api.semanticscholar.org/CorpusID:29933550 | null | null | null | null | null |
||||
FoundationDB Record Layer: A Multi-Tenant Structured Datastore | 58,004,592 | The FoundationDB Record Layer is an open source library that provides a record-oriented data store with semantics similar to a relational database implemented on top of FoundationDB, an ordered, transactional key-value store. The Record Layer provides a lightweight, highly extensible way to store structured data. It offers schema management and a rich set of query and indexing facilities, some of which are not usually found in traditional relational databases, such as nested record types, indexes on commit versions, and indexes that span multiple record types. The Record Layer is stateless and built for massive multi-tenancy, encapsulating and isolating all of a tenant's state, including indexes, into a separate logical database. We demonstrate how the Record Layer is used by CloudKit, Apple's cloud backend service, to provide powerful abstractions to applications serving hundreds of millions of users. CloudKit uses the Record Layer to host billions of independent databases, many with a common schema. Features provided by the Record Layer enable CloudKit to provide richer APIs and stronger semantics with reduced maintenance overhead and improved scalability. | [
{
"first": "Christos",
"middle": [],
"last": "Chrysafis",
"suffix": ""
},
{
"first": "Ben",
"middle": [],
"last": "Collins",
"suffix": ""
},
{
"first": "Scott",
"middle": [],
"last": "Dugas",
"suffix": ""
},
{
"first": "Jay",
"middle": [],
"last": "Dunkelberger",
"suffix": ""
},
{
"first": "Moussa",
"middle": [],
"last": "Ehsan",
"suffix": ""
},
{
"first": "Scott",
"middle": [],
"last": "Gray",
"suffix": ""
},
{
"first": "Alec",
"middle": [],
"last": "Grieser",
"suffix": ""
},
{
"first": "Ori",
"middle": [],
"last": "Herrnstadt",
"suffix": ""
},
{
"first": "Kfir",
"middle": [],
"last": "Lev-Ari",
"suffix": ""
},
{
"first": "Tao",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "McMahon",
"suffix": ""
},
{
"first": "Nicholas",
"middle": [],
"last": "Schiefer",
"suffix": ""
},
{
"first": "Alexander",
"middle": [],
"last": "Shraer",
"suffix": ""
}
] | 2,019 | 1901.04452 | 10.1145/3299869.3314039 | SIGMOD '19 | 2909445821 | [
"3055672",
"8944272",
"15064661",
"214769387",
"11873459",
"2788893",
"10283401",
"15079915",
"2080290",
"35463256",
"6885180",
"16729136",
"58514466",
"237855",
"13504572",
"1210585",
"63682091",
"207194862",
"1304877",
"32188109"
] | [
"208291367"
] | true | true | true | https://api.semanticscholar.org/CorpusID:58004592 | 1 | 1 | 1 | 1 | 1 |
||||
New Extinction Values from Efficient Construction and Analysis of Extended Attribute Component Tree | 14,345,957 | A gray-level image can be interpreted as a topographical surface, and represented by a component tree, based on the inclusion relation of connected components obtained by threshold decomposition. Relations between plateaus, valleys or mountains of this relief are useful in computer vision systems. An important definition to characterize the topographical surface is the dynamics, introduced by Grimaud (1992), associated to each regional minimum. This concept has been extended, by Vachier and Meyer (1995), by the definition of extinction values associated to each extremum of the image. This paper proposes four new extinction values -- two based on the topology of the component tree: (i) number of descendants and (ii) sub-tree height; and two geometric: (iii) height and (iv) width of a level component bounding box. This paper describes efficient computation of these extinction values based on the incremental determination of attributes from the component tree construction in quasi-linear time, compares the computation time of the method and illustrates the usefulness of these new extinction values from real examples. | [
{
"first": "A.",
"middle": [
"Goncalves"
],
"last": "Silva",
"suffix": ""
},
{
"first": "R.",
"middle": [
"De",
"Alencar"
],
"last": "Lotufo",
"suffix": ""
}
] | 2,008 | 10.1109/SIBGRAPI.2008.8 | SIBGRAPI | 2131660458 | [
"1937149",
"2165384",
"7515286",
"2604859",
"19533828",
"35850614",
"25863966",
"11441379",
"922277",
"851251",
"11105749",
"12592713",
"122809946",
"1903760"
] | [
"25786794",
"6253312",
"9825609"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14345957 | 1 | 1 | 1 | 1 | 1 |
|||||
An Adaptive Signal Detection Model applied to Perceptual Learning. | 3,479,819 | [
{
"first": "Percy",
"middle": [
"K."
],
"last": "Mistry",
"suffix": ""
},
{
"first": "Joshua",
"middle": [
"C."
],
"last": "Skewes",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"D."
],
"last": "Lee",
"suffix": ""
}
] | 2,018 | CogSci | 2941037375 | [
"16165990",
"21265989",
"13078639",
"13991425",
"11284047",
"52245888",
"15472599",
"9732753",
"13189450",
"8575320",
"6181842"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:3479819 | 0 | 0 | 0 | 1 | 0 |
|||||||
Cross-Language Priming in Chinese-English Bilinguals with Different Second Language Proficiency Levels | 15,658,095 | Cross-Language Priming in Chinese-English Bilinguals with Different Second Language Proficiency Levels Xiaowei Zhao ([email protected]) Department of Psychology, Emmanuel College, 400 the Fenway, Boston, MA 01760 USA Ping Li ([email protected]) Department of Psychology, Pennsylvania State University University Park, PA 16802, USA Youyi Liu ([email protected]), Xiaoping Fang ([email protected]), Hua Shu([email protected]) State Key Laboratory of Cognitive Neuroscience and Learning, Beijing Normal University Beijing 100875, China effects across languages, and have observed a number of interesting patterns, for example: (1) facilitation for translation equivalents is usually larger than that for semantically related words (Basnight-Brown & Altarriba, 2007); and (2) priming effects in the L1-L2 direction (from first language primes to second language targets) are often found stronger than those in the L2-L1 direction, which is referred to as “priming asymmetry” (Jiang & Foster, 2001). Although it is widely accepted that cross-language priming effects are real, the exact nature of this phenomenon has not been studied extensively or systematically, in particular with regard to the bilingual’s L2 proficiency from a development point of view. It might be possible to compare results from different studies with participants having varied L2 proficiency levels, but such comparisons must take into consideration the following: (1) different studies use very different experimental settings (see discussion of methodological issues in Altarriba & Basnight-Brown, 2007); and (2) the criteria used to measure participants’ L2 proficiency can be quite different. Some attempts have been made to study the development of priming effects across languages with similar writing scripts (i.e. English and Spanish; see Kiran & Lebel, 2007), but not much work has been done with bilinguals from languages of different writing systems (e.g., Chinese and English; but see a recent work of “semantic competitor priming” by Li & MacWhinney, in press). The current study aims at filling this gap. In particular, we first designed our experiment to control a host of variables which might have influences on priming (such as word length, frequency, relatedness proportion, nonword ratio, etc. Altarriba & Basnight-Brown, 2007; McNamara, 2005). We thenran a lexical decision task on three groups of Chinese- English bilinguals with different L2 (English) proficiency levels and learning history: low L2 proficiency, high L2 proficiency but without study abroad experience, and high L2 proficiency group with at least one year of experience living in US. We examined the priming effects from these three groups of participants with regard to a computational model of bilingual lexical organization. Abstract In this paper we describe an experimental study of cross- language priming effects between Chinese and English. The priming effects for both translation equivalents and semantically related word pairs were examined from a developmental aspect, in particular under three different situations according to bilinguals’ second language (English) proficiency level measured by CPVT and language history questionnaire, and learning experience determined by whether they have lived in a foreign country. The results match up with previous findings, in terms of the larger effects of priming from L1 to L2 than from L2 to L1 (“priming asymmetry”) and the stronger facilitation for translation priming than semantic priming. More importantly, our study demonstrates how such asymmetries in priming change as the bilinguals’ L2 learning history changes. These findings are discussed in light of current models of bilingual lexical memory. Keywords: Bilingualism; cross-language priming; Chinese. Introduction Cross-language priming is a widely used experimental paradigm in psycholinguistic research to study bilingual lexical representation and organization. . In this paradigm, cross-language word pairs (semantically related or translation equivalents) are presented to participants sequentially and participants are required to give a timed response (such as lexical decision or word naming). The method tests if bilinguals show response time differences to pairs of prime-target words that differ in their semantic relatedness. A faster reaction time to related pairs across languages (e.g., prime from the first language and target from the second language) is usually explained as a result of facilitation caused by the implicit spreading of activation from the prime word to the target word in bilinguals’ mental lexicon, which indicates that the bilingual’s two lexicons share a common conceptual memory representation (cf. Pavelnko, 2009). Many cross-language priming experiments have been conducted in the past decades (see a detailed review in Altarriba & Basnight-Brown, 2007). In most studies researchers have found translation and semantic priming | [
{
"first": "Xiaowei",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Ping",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Youyi",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Xiaoping",
"middle": [],
"last": "Fang",
"suffix": ""
},
{
"first": "Hua",
"middle": [],
"last": "Shu",
"suffix": ""
}
] | 2,011 | CogSci | 2576410335 | [
"4933611",
"21650800",
"19001274",
"28356143",
"9772546",
"17894786",
"143592596",
"144516168",
"145444318",
"238502",
"142990298",
"60370777",
"8890546",
"38477854",
"54753176"
] | [
"55502864",
"19045962",
"152209123",
"151679355"
] | true | true | true | https://api.semanticscholar.org/CorpusID:15658095 | 0 | 0 | 0 | 1 | 0 |
||||||
GUEST EDITORS' INTRODUCTION | 7,605,635 | [
{
"first": "GEORGE",
"middle": [],
"last": "SPANOUDAKIS",
"suffix": ""
},
{
"first": "ANDREA",
"middle": [],
"last": "ZISMAN",
"suffix": ""
}
] | 2,005 | 10.1142/S0218194005002579 | International Journal of Software Engineering and Knowledge Engineering | International Journal of Software Engineering and Knowledge Engineering | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:7605635 | null | null | null | null | null |
||||||
Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data | 768,161 | The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The similarity join combines two point sets of a multidimensional vector space such that the result contains all point pairs where the distance does not exceed a parameter e. In this paper, we propose the Epsilon Grid Order, a new algorithm for determining the similarity join of very large data sets. Our solution is based on a particular sort order of the data points, which is obtained by laying an equi-distant grid with cell length e over the data space and comparing the grid cells lexicographically. A typical problem of grid-based approaches such as MSJ or the e-kdB-tree is that large portions of the data sets must be held simultaneously in main memory. Therefore, these approaches do not scale to large data sets. Our technique avoids this problem by an external sorting algorithm and a particular scheduling strategy during the join phase. In the experimental evaluation, a substantial improvement over competitive techniques is shown. | [
{
"first": "Christian",
"middle": [],
"last": "Böhm",
"suffix": ""
},
{
"first": "Bernhard",
"middle": [],
"last": "Braunmüller",
"suffix": ""
},
{
"first": "Florian",
"middle": [],
"last": "Krebs",
"suffix": ""
},
{
"first": "Hans-Peter",
"middle": [],
"last": "Kriegel",
"suffix": ""
}
] | 2,001 | 10.1145/375663.375714 | SIGMOD '01 | 2205071250 | [
"1310068",
"8342694",
"7232657",
"2385745",
"8270641",
"30662379",
"15209254",
"16043804",
"5900836",
"7869032",
"45115551"
] | [
"272902",
"9775897",
"7336396",
"11038984",
"15372883",
"201645190",
"8844326",
"8801260",
"3872797",
"14819695",
"7424147",
"39659796",
"2756271",
"198314276",
"16999709",
"16730530",
"9376216",
"16582237",
"5627448",
"1930683",
"16072772",
"59944319",
"3008817",
"1917351",
"257765",
"1432811",
"14131415",
"16950448",
"197671809",
"16041159",
"4589047",
"7778952",
"1655622",
"9264174",
"13946661",
"7343389",
"7515227",
"17575248",
"6477137",
"319031",
"6093708",
"1292538",
"39765626",
"285999",
"49334051",
"204746116",
"59409893",
"307707",
"6914603",
"199435567",
"12413742",
"14120094",
"28508628",
"139104532",
"52844091",
"16759742",
"207756894",
"198328612",
"10291620",
"18468043",
"892301",
"5226396",
"197680361",
"16597426"
] | true | true | true | https://api.semanticscholar.org/CorpusID:768161 | 0 | 0 | 0 | 1 | 0 |
|||||
Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages | 2,099,120 | The spider diagram logic forms a fragment of the constraint diagram logic and was designed to be primarily used as a diagrammatic software specification tool. Our interest is in using the logical basis of spider diagrams and the existing known equivalences between certain logics, formal language theory classes and some automata to inform the development of diagrammatic logics. Such developments could have many advantages, one of which would be aiding software engineers who are familiar with formal languages and automata to more intuitively understand diagrammatic logics. In this paper we consider relationships between spider diagrams of order (an extension of spider diagrams) and the star-free subset of regular languages. We extend the concept of the language of a spider diagram to encompass languages over arbitrary alphabets. Furthermore, the product of spider diagrams is introduced. This operator is the diagrammatic analogue of language concatenation. We establish that star-free languages are definable by spider diagrams of order equipped with the product operator and, based on this relationship, spider diagrams of order are as expressive as first order monadic logic of order. | [
{
"first": "Aidan",
"middle": [],
"last": "Delaney",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Taylor",
"suffix": ""
},
{
"first": "Simon",
"middle": [],
"last": "Thompson",
"suffix": ""
}
] | 2,008 | 10.1007/978-3-540-87730-1_18 | Diagrams | 1500534470 | [
"122784720",
"17432009",
"15176941",
"2063764",
"43283759",
"61104418",
"13448313",
"17858667",
"3011048",
"36109921",
"13317489",
"8743510"
] | [
"192182",
"39174823",
"10797023",
"16811919",
"15527001",
"6963927",
"8432245",
"6315668"
] | true | true | true | https://api.semanticscholar.org/CorpusID:2099120 | 1 | 1 | 1 | 1 | 1 |
|||||
DesignLibs: a scenario-based design method for ideation | 14,662,941 | Generating potential design ideas through ideation often benefits from the spontaneity of random ideas. Having potential users participate in this process can be beneficial, but is often difficult to implement. We present a new method for generating design ideas with potential users. The method uses scenarios with missing words, which potential users fill in to generate ideas for features and attributes of new technology designs, similar to the children's game of Mad Libs. We developed three different formats of DesignLibs, including 1) "Mad Libs-style": blanks presented before seeing the scenario, 2) "Fill-in-the-Blanks": blanks presented within the context of the scenario, and 3) "Q&A": blanks presented as questions and answers. We found that Design-Libs generated a number of new ideas, with the Fill-in-the-Blanks method providing the highest ratings for usefulness, feasibility, and diversity of answers. All three formats provided equal ratings for creativity. | [
{
"first": "Jared",
"middle": [
"S."
],
"last": "Bauer",
"suffix": ""
},
{
"first": "Julie",
"middle": [
"A."
],
"last": "Kientz",
"suffix": ""
}
] | 2,013 | 10.1145/2470654.2466258 | CHI '13 | 2034226048 | [
"6481095",
"110094395",
"1586548",
"109805403",
"52828118",
"1697822"
] | [
"4064041",
"24378677"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14662941 | 0 | 0 | 0 | 1 | 0 |
|||||
Cognitive Walkthrough for the Web | 198,337,242 | [
{
"first": "Waldemar",
"middle": [],
"last": "Karwowski",
"suffix": ""
}
] | 2,006 | 10.1201/9780849375477-227 | 2954423180 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:198337242 | null | null | null | null | null |
|||||||
Walking by Cycling: A Novel In-Place Locomotion User Interface for Seated Virtual Reality Experiences | 211,222,467 | [
{
"first": "Jann",
"middle": [
"Philipp"
],
"last": "Freiwald",
"suffix": ""
}
] | null | 3032370947 | [
"17113682",
"17522289",
"22899434",
"211604",
"143857420",
"28073298",
"6286600",
"201069424",
"10595902",
"28573324",
"8612494",
"12487715",
"19221832",
"109525367",
"13006130",
"10063130",
"109093193",
"14168235",
"201631557",
"201065929",
"195877601",
"3460173",
"5955419",
"43089641",
"7480416",
"60917928",
"5550965",
"1913279",
"1867356",
"207195167",
"215575113",
"14804561",
"201671917",
"207650134",
"18423578",
"40306561"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:211222467 | 0 | 0 | 0 | 1 | 0 |
||||||||
Image Dequantization: Restoration of Quantized Colors | 3,637,268 | Color quantization replaces the color of each pixel with the closest representative color, and thus it makes the resulting image partitioned into uniformly-colored regions. As a consequence, continuous, detailed variations of color over the corresponding regions in the original image are lost through color quantization. In this paper, we present a novel blind scheme for restoring such variations from a color-quantized input image without a priori knowledge of the quantization method. Our scheme identifies which pairs of uniformly-colored regions in the input image should have continuous variations of color in the resulting image. Then, such regions are seamlessly stitched through optimization while preserving the closest representative colors. The user can optionally indicate which regions should be separated or stitched by scribbling constraint brushes across the regions. We demonstrate the effectiveness of our approach through diverse examples, such as photographs, cartoons, and artistic illustrations. | [
{
"first": "Taehoon",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "Jongwoo",
"middle": [],
"last": "Ahn",
"suffix": ""
},
{
"first": "Min",
"middle": [
"Gyu"
],
"last": "Choi",
"suffix": ""
}
] | 2,007 | 10.1111/j.1467-8659.2007.01085.x | Comput. Graph. Forum | Comput. Graph. Forum | 2017034934 | [
"646197",
"6464014",
"6775458",
"28073011",
"123135024",
"15369601",
"11900928",
"6541990",
"14874229",
"7018966",
"195881122"
] | [
"3097999"
] | true | true | true | https://api.semanticscholar.org/CorpusID:3637268 | 0 | 0 | 0 | 1 | 0 |
||||
Bayan: an Arabic text database management system | 10,910,289 | Most existing databases lack features which allow for the convenient manipulation of text. It is even more difficult to use them if the text language is not based on the Roman alphabet. The Arabic language is a very good example of this case. Many projects have attempted to use conventional database systems for Arabic data manipulation (including text data), but because of Arabic's many differences with English, these projects have met with limited success. In the Bayan project, the approach has been different. Instead of simply trying to adopt an environment to Arabic, the properties of the Arabic language were the starting point and everything was designed to meet the needs of Arabic, thus avoiding the shortcomings of other projects. A text database management system was designed to overcome the shortcomings of conventional database management systems in manipulating text data. Bayan's data model is based on an object-oriented approach which helps the extensibility of the system for future use. In Bayan, we designed the database with the Arabic text properties in mind. We designed it to support the way Arabic words are derived, classified, and constructed. Furthermore, linguistic algorithms (for word generation and morphological decomposition of words) were designed, leading to a formalization of rules of Arabic language writing and sentence construction. A user interface was designed on top of this environment. A new representation of the Arabic characters was designed, a complete Arabic keyboard layout was created, and a window-based Arabic user interface was also designed. | [
{
"first": "Roger",
"middle": [],
"last": "King",
"suffix": ""
},
{
"first": "Ali",
"middle": [],
"last": "Morfeq",
"suffix": ""
}
] | 1,990 | 10.1145/93597.93614 | SIGMOD '90 | 2066932372 | [
"11345059"
] | [
"376160",
"15679758"
] | true | true | true | https://api.semanticscholar.org/CorpusID:10910289 | 0 | 0 | 0 | 1 | 0 |
|||||
The Neural Mechanisms of Relational Reasoning: Dissociating Representational Types. | 11,104,857 | [
{
"first": "Julia",
"middle": [],
"last": "Wertheim",
"suffix": ""
},
{
"first": "Marco",
"middle": [],
"last": "Ragni",
"suffix": ""
}
] | 2,017 | CogSci | 2785588907 | [
"22922773",
"1959732",
"11477995",
"8739",
"10661846",
"16004429",
"2973615",
"7720136",
"39870353",
"145543985",
"11208214",
"22888926",
"2872861",
"10634376",
"2020044",
"730317",
"18212031",
"14424783",
"207248173",
"205849677",
"7531985",
"20084633",
"215534761",
"782228",
"7330724",
"8415931",
"15735533",
"14758082",
"11352747",
"12491751",
"17498158",
"436294",
"15736384",
"15818111",
"17555647",
"985650",
"212729",
"12554005",
"13394030",
"44019775",
"41102",
"1876275",
"1086317",
"14278821",
"18296733"
] | [
"44154420"
] | true | true | true | https://api.semanticscholar.org/CorpusID:11104857 | 0 | 0 | 0 | 1 | 0 |
|||||||
Creating and animating subject-specific anatomical models | 15,186,228 | Creating and animating subject-specific anatomical models is traditionally a difficult process involving medical image segmentation, geometric corrections and the manual definition of kinematic parameters. In this paper, we introduce a novel template morphing algorithm that facilitates 3D modeling and parameterization of skeletons. Target data can be either medical images or surfaces of the whole skeleton. We incorporate prior knowledge about bone shape, the feasible skeleton pose, and the morphological variability in the population. This allows for noise reduction, bone separation, and the transfer, from the template, of anatomical and kinematical information not present in the input data. Our approach treats both local and global deformations in successive regularization steps: smooth elastic deformations are represented by an displacement field between the reference and current configuration of the template, while global and discontinuous displacements are estimated through a projection onto a statistical shape model and a new joint pose optimization scheme with joint limits. | [
{
"first": "Benjamin",
"middle": [],
"last": "Gilles",
"suffix": ""
},
{
"first": "Lionel",
"middle": [],
"last": "Reveret",
"suffix": ""
},
{
"first": "Dinesh",
"middle": [
"K."
],
"last": "Pai",
"suffix": ""
}
] | 2,010 | 10.1111/j.1467-8659.2010.01718.x | Comput. Graph. Forum | Comput. Graph. Forum | 2006616664 | [
"9825759",
"510379",
"3219036",
"29147523",
"8464570",
"69817",
"10034253",
"1331299",
"2977889",
"5837861",
"10591691",
"38397836",
"335987",
"9120143",
"14590372",
"14827406",
"16425206",
"35376966",
"53222950",
"17982667",
"837530",
"3401588",
"14470635",
"1781652",
"21255339",
"8907128",
"11952089",
"53248231",
"1070719",
"207163893",
"36329926",
"2845221",
"230280",
"15418267",
"6994570",
"206051485",
"226961"
] | [
"14604789",
"10282859",
"15043239",
"13320511",
"96441753",
"2855890",
"198968256"
] | true | true | true | https://api.semanticscholar.org/CorpusID:15186228 | 1 | 1 | 1 | 1 | 1 |
||||
A HARDWARE APPROACH TO THE CORE SYSTEM OF ACM/SIGGRAPH | 63,824,607 | [
{
"first": "Gerd",
"middle": [],
"last": "Möller",
"suffix": ""
}
] | 1,981 | 10.2312/eg.19811008 | 2472953149 | [] | [
"7056074"
] | false | true | false | https://api.semanticscholar.org/CorpusID:63824607 | null | null | null | null | null |
|||||||
From ethno-mathematics to generative design: metapatterns and interactive methods for the creation of decorative art | 61,495,733 | The research discussed in This work focuses on the development of interactive methods to image and analyze the surface designs of cultural artifacts and the generation of new designs. The project is interdisciplinary and uses methodologies from aesthetic and cultural inquiry, mathematics and computer science. The results of the research are obtained by using a combination of tools, such as neural networks, pattern recognition techniques including edge detection, and pattern generating techniques such as shape grammars. The first phase of this research focuses on the analysis of Congolese Kuba cloth and Moroccan Zillij mosaics because each has a complete and complex surface pattern with very different characteristics. Our work has three main facets: the description of the geometric content of ethno-mathematical artifacts; the classification of this content; and the generation of grammatical rules for the creation of new designs based on the studied artifacts. | [
{
"first": "Cheryl",
"middle": [
"Kolak"
],
"last": "Dudek",
"suffix": ""
},
{
"first": "Lydia",
"middle": [],
"last": "Sharman",
"suffix": ""
},
{
"first": "Fred",
"middle": [
"E."
],
"last": "Szabo",
"suffix": ""
},
{
"first": "Sushil",
"middle": [],
"last": "Bhakar",
"suffix": ""
},
{
"first": "Eric",
"middle": [],
"last": "Hortop",
"suffix": ""
},
{
"first": "Yun",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Wumo",
"middle": [],
"last": "Pan",
"suffix": ""
}
] | 2,004 | 10.1109/IV.2004.63 | 2157142381 | [] | [
"17292411",
"18828699"
] | false | true | false | https://api.semanticscholar.org/CorpusID:61495733 | null | null | null | null | null |
||||||
US-SQL: managing uncertain schemata | 2,323,441 | In this paper we describe a demo concerning the management of uncertain schemata. Many works have studied the problem of representing uncertainty on attribute values or tuples, like the fact that a value is 10 with probability .3 or 20 with probability .7, leading to the implementation of probabilistic database management systems. In our demo we deal with the representation of uncertainty about the meta-data, i.e., about the meaning of these values. Using our system it is possible to create alternative probabilistic schemata on a database, execute queries over uncertain schemata and verify how this additional information is stored in an underlying relational database and how queries are executed. | [
{
"first": "Matteo",
"middle": [],
"last": "Magnani",
"suffix": ""
},
{
"first": "Danilo",
"middle": [],
"last": "Montesi",
"suffix": ""
}
] | 2,010 | 10.1145/1807167.1807317 | SIGMOD Conference | 2025631941 | [
"1366841",
"1230690",
"3396566",
"3329828",
"59863539",
"31256097",
"508128",
"15051351",
"2847091"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:2323441 | 0 | 0 | 0 | 1 | 0 |
|||||
Collaborative knowledge management supporting mars mission scientists | 9,875,344 | This paper describes the design and deployment of a collaborative software tool, designed for and presently in use on the Mars Exploration Rovers (MER) 2003 mission. Two central questions are addressed. Does collaborative content like that created on easels and whiteboards have persistent value? Can groups of people jointly manage collaboratively created content? Based on substantial quantitative and qualitative data collected during mission operations, it remains difficult to conclusively answer the first question while there is some positive support for the second question. The MER mission provides a uniquely rich data set on the use of collaborative tools. | [
{
"first": "Irene",
"middle": [],
"last": "Tollinger",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "McCurdy",
"suffix": ""
},
{
"first": "Alonso",
"middle": [
"H."
],
"last": "Vera",
"suffix": ""
},
{
"first": "Preston",
"middle": [],
"last": "Tollinger",
"suffix": ""
}
] | 2,004 | 10.1145/1031607.1031614 | CSCW '04 | 2028855224 | [
"53770421",
"6500905",
"1753067",
"14404241",
"8350136",
"7930436",
"62731612",
"6686811",
"10718579",
"1038336",
"14728206",
"62008379",
"5732274",
"12292749",
"150778504",
"16650042",
"10006076",
"1952976",
"2549109"
] | [
"15958200",
"14068168",
"74589444",
"2988182",
"12372288",
"23026145",
"409213",
"14716260",
"484087",
"6506510",
"18428717",
"989497",
"8078832",
"2495011"
] | true | true | true | https://api.semanticscholar.org/CorpusID:9875344 | 0 | 0 | 0 | 1 | 0 |
|||||
Toward a cultural-sensitive image tagging interface | 2,712,819 | Do people from different cultures tag digital images differently? The current study examined the relationship between the position and content of tags for digital images created by participants from two cultural groups (European Americans and Chinese). In line with previous findings on cultural differences in attentional patterns, we found cultural differences in the order of the parts of images people chose to tag. European Americans tended to tag main objects first, and tag background objects and overall properties in the images later; in contrast, Chinese tended to tag the overall properties first, and tag the main and background objects later. Based on findings of the current study, we discuss implications on developing a cultural-sensitive algorithm to facilitate the tagging and search process of digital media and data-mining tools to identify user profiles based on their cultural origins. | [
{
"first": "Wei",
"middle": [],
"last": "Dong",
"suffix": ""
},
{
"first": "Wai-Tat",
"middle": [],
"last": "Fu",
"suffix": ""
}
] | 2,010 | 10.1145/1719970.1720019 | IUI '10 | 2049741001 | [
"1256745",
"16223931",
"8850771",
"18371575",
"13039172",
"140963776",
"3202587",
"12355336",
"396205"
] | [
"37295187",
"6227857",
"12750709",
"16350156",
"3943721"
] | true | true | true | https://api.semanticscholar.org/CorpusID:2712819 | 0 | 0 | 0 | 1 | 0 |
|||||
An Evaluation of Parallel Eccentricity Estimation Algorithms on Undirected Real-World Graphs | 18,767,238 | This paper presents efficient shared-memory parallel implementations and the first comprehensive experimental study of graph eccentricity estimation algorithms in the literature. The implementations include (1) a simple algorithm based on executing two-pass breadth-first searches from a sample of vertices, (2) algorithms with sub-quadratic worst-case running time for sparse graphs and non-trivial approximation guarantees that execute breadth-first searches from a carefully chosen set of vertices, (3) algorithms based on probabilistic counters, and (4) a well-known 2-approximation algorithm that executes one breadth-first search per connected component. Our experiments on large undirected real-world graphs show that the algorithm based on two-pass breadth-first searches works surprisingly well, outperforming the other algorithms in terms of running time and/or accuracy by up to orders of magnitude. The high accuracy, efficiency, and parallelism of our best implementation allows the fast generation of eccentricity estimates for large graphs, which are useful in many applications arising in large-scale network analysis. | [
{
"first": "Julian",
"middle": [],
"last": "Shun",
"suffix": ""
}
] | 2,015 | 10.1145/2783258.2783333 | KDD '15 | 2064737680 | [
"102737",
"11281723",
"6213179",
"7036025",
"58527178",
"2568854",
"12118850",
"5428476",
"27859998",
"15855125",
"2078881",
"15404050",
"1212001",
"4665323",
"13312741",
"998725",
"5955851",
"1645586",
"46066373",
"9149248",
"120335238",
"9077635",
"397891",
"9150898",
"31146560",
"42253873",
"10602988",
"62113622",
"123567585",
"11155896",
"1621075",
"11243243",
"9519754",
"9655680",
"3891574",
"18622986",
"12817713",
"6799937",
"13506921",
"4429113",
"17179623",
"38016481"
] | [
"739985",
"190231094",
"4537929",
"53080475",
"10165722",
"53235498",
"125142388",
"8070248",
"57753727",
"3238776",
"19201046",
"8830716"
] | true | true | true | https://api.semanticscholar.org/CorpusID:18767238 | 0 | 0 | 0 | 1 | 0 |
|||||
Big Data for Social Good | 86,724,507 | [
{
"first": "Natasha",
"middle": [],
"last": "Munshi",
"suffix": ""
}
] | 2,017 | 2914187145 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:86724507 | null | null | null | null | null |
||||||||
Geocaching with a Beam: Shared Outdoor Activities through a Telepresence Robot with 360 Degree Viewing | 5,075,162 | People often enjoy sharing outdoor activities together such as walking and hiking. However, when family and friends are separated by distance it can be difficult if not impossible to share such activities. We explore this design space by investigating the benefits and challenges of using a telepresence robot to support outdoor leisure activities. In our study, participants participated in the outdoor activity of geocaching where one person geocached with the help of a remote partner via a telepresence robot. We compared a wide field of view (WFOV) camera to a 360° camera. Results show the benefits of having a physical embodiment and a sense of immersion with the 360° view. Yet challenges related to a lack of environmental awareness, safety issues, and privacy concerns resulting from bystander interactions. These findings illustrate the need to design telepresence robots with the environment and public in mind to provide an enhanced sensory experience while balancing safety and privacy issues resulting from being amongst the general public. | [
{
"first": "Yasamin",
"middle": [],
"last": "Heshmat",
"suffix": ""
},
{
"first": "Brennan",
"middle": [],
"last": "Jones",
"suffix": ""
},
{
"first": "Xiaoxuan",
"middle": [],
"last": "Xiong",
"suffix": ""
},
{
"first": "Carman",
"middle": [],
"last": "Neustaedter",
"suffix": ""
},
{
"first": "Anthony",
"middle": [],
"last": "Tang",
"suffix": ""
},
{
"first": "Bernhard",
"middle": [
"E."
],
"last": "Riecke",
"suffix": ""
},
{
"first": "Lillian",
"middle": [],
"last": "Yang",
"suffix": ""
}
] | 2,018 | 10.1145/3173574.3173933 | CHI '18 | 2795473781 | [
"37245035",
"14627638",
"658559",
"629200",
"16162644",
"13590160",
"6272994",
"146172159",
"35887476",
"15248652",
"15242823",
"24443202",
"14370661",
"7826980",
"5400206",
"17322714",
"1730143",
"755930",
"1823617",
"7370567",
"13337313",
"8279793",
"731001",
"5791429",
"67300777",
"15039433",
"7917935",
"11863756",
"10385602",
"15823391",
"10677547",
"8056934",
"9590941",
"207220163",
"45867839",
"30530467",
"16831017",
"20232314",
"41352321"
] | [
"56173216",
"52978670",
"174800483",
"195259420",
"211296454",
"207959098",
"202728623",
"85501593",
"208033028",
"198489137"
] | true | true | true | https://api.semanticscholar.org/CorpusID:5075162 | 0 | 0 | 0 | 1 | 0 |
|||||
Pattern Mining in Frequent Dynamic Subgraphs | 11,776,226 | Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowledge. While current data mining deals with static graphs that do not change over time, coming years will see the advent of an increasing number of time series of graphs. In this article, we investigate how pattern mining on static graphs can be extended to time series of graphs. In particular, we are considering dynamic graphs with edge insertions and edge deletions over time. We define frequency in this setting and provide algorithmic solutions for finding frequent dynamic subgraph patterns. Existing subgraph mining algorithms can be easily integrated into our framework to make them handle dynamic graphs. Experimental results on real-world data confirm the practical feasibility of our approach. | [
{
"first": "K.M.",
"middle": [],
"last": "Borgwardt",
"suffix": ""
},
{
"first": "H.-P.",
"middle": [],
"last": "Kriegel",
"suffix": ""
},
{
"first": "P.",
"middle": [],
"last": "Wackersreuther",
"suffix": ""
}
] | 2,006 | 10.1109/ICDM.2006.124 | Sixth International Conference on Data Mining (ICDM'06) | Sixth International Conference on Data Mining (ICDM'06) | 2102135646 | [
"830",
"5634039",
"195837752",
"7065154",
"13451873",
"8684662",
"140133062",
"303918",
"10118968"
] | [
"16255305",
"5782433",
"18125747",
"16738296",
"7869011",
"16196280",
"43235686",
"40612595",
"7914981",
"8634059",
"17906208",
"9808665",
"18518016",
"985125",
"7263578",
"14633616",
"17728631",
"16842669",
"8298584",
"5252522",
"30011041",
"16790925",
"6148849",
"9522039",
"11391357",
"10996169",
"207185829",
"3408747",
"14291660",
"1808145",
"16578277",
"52157717",
"3166069",
"14952984",
"15628837",
"15238003",
"53280406",
"52161800",
"8029825",
"14560943",
"16741545",
"13650124",
"14947388",
"11067983",
"201631332",
"23873984",
"8262474",
"2851342",
"8214999",
"9843936",
"778877",
"16098381",
"18863571",
"60920585",
"54639596",
"11210611",
"928248",
"16816427",
"15204368",
"24359438",
"17822151",
"16969501",
"10840288",
"55815084",
"1567988",
"9508290"
] | true | true | true | https://api.semanticscholar.org/CorpusID:11776226 | 1 | 1 | 1 | 1 | 1 |
||||
Facilitating Development of Pragmatic Competence through a Voice-driven Video Learning Interface | 2,055,258 | Authentic foreign language videos are effective for developing pragmatic competence, or sensitivity to meanings expressed by tone and word choice, and the ability to effectively express these meanings. However, established methods for learning from foreign language videos are primarily text-based (e.g.captioning). Using text, learners do not practice aspects of oral performance (e.g. intonation, pausing, and pitch) that are important to pragmatic competence. In this paper we present a voice-driven system where learners practice and learn a foreign language by repeating phrases out loud from any video. Utterances are transcribed and translated and, if captions are available, the system indicates the correctness of the utterance. In an evaluation with 27 participants, we show that participants more frequently used the voice-driven system than a comparison text-based system. Furthermore, ina field study of 130 independent learners, we show potential for community-driven resource collection. | [
{
"first": "Gabriel",
"middle": [],
"last": "Culbertson",
"suffix": ""
},
{
"first": "Solace",
"middle": [],
"last": "Shen",
"suffix": ""
},
{
"first": "Malte",
"middle": [],
"last": "Jung",
"suffix": ""
},
{
"first": "Erik",
"middle": [],
"last": "Andersen",
"suffix": ""
}
] | 2,017 | 10.1145/3025453.3025805 | Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems | 2611352434 | [
"144782684",
"4093592",
"143833210",
"143294644",
"53933361",
"10093794",
"210348786",
"6603739",
"53244214",
"11747913",
"60940339",
"207977721",
"16101918",
"141280510",
"6469967",
"143727454",
"145777551",
"12598199",
"18700301",
"145055350",
"60807956",
"146525755",
"62263802",
"62006571",
"144053868",
"15310892",
"576309",
"24439712",
"5728929"
] | [
"199657691",
"51874853",
"53113908",
"140224485",
"202751513"
] | true | true | true | https://api.semanticscholar.org/CorpusID:2055258 | 0 | 0 | 0 | 1 | 0 |
|||||
Beyond Distributed Cognition: Towards a Taxonomy of Nonreductive Social Cognition. | 31,864,065 | [
{
"first": "Zachariah",
"middle": [
"A."
],
"last": "Neemeh",
"suffix": ""
},
{
"first": "Luis",
"middle": [
"H."
],
"last": "Favela",
"suffix": ""
}
] | 2,017 | CogSci | 2785896291 | [
"118436322",
"26266519",
"12142218",
"5964637",
"26456902",
"39869499",
"988378",
"15175317",
"14017673",
"6039543",
"151412990",
"60546718",
"145183659",
"214792503",
"1082224",
"10269704",
"84298445",
"141826363",
"129536315",
"55868847",
"205981453",
"23562808",
"4430488",
"8269509",
"142095462",
"18826604",
"145279344",
"143829309",
"70345391"
] | [
"72333270",
"196655963"
] | true | true | true | https://api.semanticscholar.org/CorpusID:31864065 | 0 | 0 | 0 | 1 | 0 |
|||||||
A novel framework for visual detection and exploration of performance bottlenecks in organic photovoltaic solar cell materials | 3,162,013 | Current characterization methods of the so-called Bulk Heterojunction (BHJ), which is the main material of Organic Photovoltaic (OPV) solar cells, are limited to the analysis of global fabrication parameters. This reduces the efficiency of the BHJ design process, since it misses critical information about the local performance bottlenecks in the morphology of the material. In this paper, we propose a novel framework that fills this gap through visual characterization and exploration of local structure-performance correlations. We also propose a formula that correlates the structural features with the performance bottlenecks. Since research into BHJ materials is highly multidisciplinary, our framework enables a visual feedback strategy that allows scientists to build intuition about the best choices of fabrication parameters. We evaluate the usefulness of our proposed system by obtaining new BHJ characterizations. Furthermore, we show that our approach could substantially reduce the turnaround time. | [
{
"first": "Amal",
"middle": [],
"last": "Aboulhassan",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Baum",
"suffix": ""
},
{
"first": "Olga",
"middle": [],
"last": "Wodo",
"suffix": ""
},
{
"first": "Baskar",
"middle": [],
"last": "Ganapathysubramanian",
"suffix": ""
},
{
"first": "Aram",
"middle": [],
"last": "Amassian",
"suffix": ""
},
{
"first": "Markus",
"middle": [],
"last": "Hadwiger",
"suffix": ""
}
] | 2,015 | 10.1111/cgf.12652 | Comput. Graph. Forum | Comput. Graph. Forum | 1482387172 | [
"51955805",
"5555232",
"15032149",
"122010197",
"138327923",
"108779434",
"31235173",
"17348986",
"354296",
"13915484",
"13258689",
"136557509",
"875321",
"55456757",
"97494169"
] | [
"215322563",
"218178",
"205004110",
"52815197",
"112242026"
] | true | true | true | https://api.semanticscholar.org/CorpusID:3162013 | 1 | 1 | 1 | 1 | 1 |
||||
Predicting human interruptibility with sensors | 3,162,456 | A person seeking another person's attention is normally able to quickly assess how interruptible the other person currently is. Such assessments allow behavior that we consider natural, socially appropriate, or simply polite. This is in sharp contrast to current computer and communication systems, which are largely unaware of the social situations surrounding their usage and the impact that their actions have on these situations. If systems could model human interruptibility, they could use this information to negotiate interruptions at appropriate times, thus improving human computer interaction.This article presents a series of studies that quantitatively demonstrate that simple sensors can support the construction of models that estimate human interruptibility as well as people do. These models can be constructed without using complex sensors, such as vision-based techniques, and therefore their use in everyday office environments is both practical and affordable. Although currently based on a demographically limited sample, our results indicate a substantial opportunity for future research to validate these results over larger groups of office workers. Our results also motivate the development of systems that use these models to negotiate interruptions at socially appropriate times. | [
{
"first": "James",
"middle": [],
"last": "Fogarty",
"suffix": ""
},
{
"first": "Scott",
"middle": [
"E."
],
"last": "Hudson",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"G."
],
"last": "Atkeson",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Avrahami",
"suffix": ""
},
{
"first": "Jodi",
"middle": [],
"last": "Forlizzi",
"suffix": ""
},
{
"first": "Sara",
"middle": [],
"last": "Kiesler",
"suffix": ""
},
{
"first": "Johnny",
"middle": [
"C."
],
"last": "Lee",
"suffix": ""
},
{
"first": "Jie",
"middle": [],
"last": "Yang",
"suffix": ""
}
] | 2,005 | 10.1145/1057237.1057243 | TCHI | 2029778954 | [
"1649407",
"5111320",
"2883911",
"194951",
"17478824",
"9439335",
"13964141",
"62566873",
"62730865",
"5943805",
"140853483",
"2452365",
"2145555",
"14171767",
"6644398",
"1609914",
"147116081",
"6847889",
"8943607",
"1183716",
"15198171",
"7599667",
"2225264",
"7313542",
"15943670",
"752723",
"7223945",
"1529044",
"14562400",
"59685288",
"145276534",
"5262555",
"1522813",
"62216452",
"2765130",
"9122013",
"64259583"
] | [
"18084433",
"16951235",
"12740852",
"18358202",
"3013016",
"13489861",
"15915938",
"15327447",
"16433919",
"3924304",
"17322495",
"1081103",
"13893628",
"2824980",
"15534121",
"18344161",
"17388264",
"14169315",
"93553",
"23340064",
"3424172",
"1518987",
"10264849",
"18954177",
"5178025",
"15643955",
"739599",
"16435890",
"1669625",
"5469281",
"14753509",
"12177802",
"13613464",
"27710885",
"207976840",
"6038614",
"19034198",
"14169952",
"9204302",
"18669029",
"15036147",
"15755985",
"51892710",
"14177003",
"7010793",
"37454600",
"207222948",
"492612",
"13429593",
"18050119",
"10537677",
"211730782",
"18341147",
"9370589",
"35983072",
"14311137",
"12229742",
"22997174",
"9368923",
"13442206",
"12365626",
"15217207",
"17758752",
"11970196",
"10098456",
"53954993",
"16939863",
"35935694",
"18427870",
"54569802",
"24303024",
"8283560",
"54954637",
"5012141",
"11172617",
"12126527",
"210927450",
"26448099",
"15253466",
"16992823",
"201894324",
"59236575",
"52056075",
"43339143",
"7322632",
"205841",
"1003013",
"5557953",
"13668831",
"6131963",
"6217742",
"15520485",
"16671231",
"16305919",
"3021978",
"16591121",
"12980342",
"22608122",
"10192338",
"34405775",
"16451176",
"16433405",
"9326704",
"625168",
"434102",
"590038",
"11861604",
"2098326",
"12850385",
"52096515",
"202896074",
"2820604",
"24739820",
"6038964",
"17644422",
"16421394",
"14662592",
"12718336",
"15262543",
"2232284",
"5626809",
"2349587",
"6857890",
"23408904",
"14957410",
"269179",
"8472540",
"17526544",
"20321606",
"15423193",
"17490986",
"9290261",
"434056",
"56204066",
"16820022",
"6749768",
"429436",
"52927923",
"10933493",
"7320005",
"15234769",
"5554283",
"27000842",
"55547331",
"9994593",
"207957480",
"211002866",
"5794426",
"16183085",
"9200419",
"193476",
"15215642",
"60834680",
"12243850",
"14171767",
"1636860",
"15919005",
"67771522",
"13940028",
"18541481",
"195766282",
"2902442",
"46964435",
"2443144",
"2003896",
"26765740",
"8356867",
"19243337",
"27395758",
"4944214",
"14479648",
"3822098",
"9367800",
"197672237",
"9647198",
"19012099",
"3182583",
"17274484",
"18174792",
"2009821",
"9755535",
"17697841",
"8178656",
"8933090",
"53111569",
"6555228",
"7259644",
"53037959",
"215093013",
"6661751",
"4697955",
"23881575",
"3814964",
"5197212",
"8308762",
"33493725",
"213442",
"16401536",
"4690962",
"3444011",
"7004283",
"77361475"
] | true | true | true | https://api.semanticscholar.org/CorpusID:3162456 | 0 | 0 | 0 | 1 | 0 |
|||||
Direct Manipulation in Tactile Displays | 8,281,011 | Tactile displays have predominantly been used for information transfer using patterns or as assistive feedback for interactions. With recent advances in hardware for conveying increasingly rich tactile information that mirrors visual information, and the increasing viability of wearables that remain in constant contact with the skin, there is a compelling argument for exploring tactile interactions as rich as visual displays. Direct Manipulation underlies much of the advances in visual interactions. In this work, we introduce the concept of a Direct Manipulation-enabled Tactile display (DMT). We define the concepts of a tactile screen, tactile pixel, tactile pointer, and tactile target which enable tactile pointing, selection and drag & drop. We build a proof of concept tactile display and study its precision limits. We further develop a performance model for DMTs based on a tactile target acquisition study. Finally, we study user performance in a real-world DMT menu application. The results show that users are able to use the application with relative ease and speed. | [
{
"first": "Aakar",
"middle": [],
"last": "Gupta",
"suffix": ""
},
{
"first": "Thomas",
"middle": [],
"last": "Pietrzak",
"suffix": ""
},
{
"first": "Nicolas",
"middle": [],
"last": "Roussel",
"suffix": ""
},
{
"first": "Ravin",
"middle": [],
"last": "Balakrishnan",
"suffix": ""
}
] | 2,016 | 10.1145/2858036.2858161 | Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems | 2408121295 | [
"36550963",
"18064339",
"11890402",
"9155680",
"33356791",
"10595902",
"6701648",
"35645895",
"8022318",
"6160388",
"16328134",
"15517653",
"15517653",
"16515725",
"16981752",
"8168475",
"5612388",
"120535723",
"9207453"
] | [
"10597389",
"18064339",
"27013375",
"12326289",
"201067598",
"53249712"
] | true | true | true | https://api.semanticscholar.org/CorpusID:8281011 | 1 | 1 | 1 | 1 | 1 |
|||||
Detecting Early Indicator Cars in an Automotive Database: A Multi-Strategy Approach | 9,180,975 | No company so far achieved the ultimate goal of zero faults in manufacturing. Even high-quality products occasionally show problems that must be handled as warranty cases. In this paper, we report work done during the development of an early warning system for a large quality information database in the automotive industry. We present a multi-strategy approach to flexible prediction of upcoming quality problems. We used existing techniques and combined them in a novel way to solve a concrete application problem. The basic idea is to identify sub populations that, at an early point in time, behave like the whole population at a later time. Such sub populations act as early indicators for future developments. We present our method in the context of a concrete application and present experimental results. At the end of the paper, we outline how this method can be generalised and transferred to other KDD application problems. | [
{
"first": "Rüdiger",
"middle": [],
"last": "Wirth",
"suffix": ""
},
{
"first": "Thomas",
"middle": [
"P."
],
"last": "Reinartz",
"suffix": ""
}
] | 1,996 | KDD | 87256202 | [
"7667022",
"4408326",
"37653291",
"5998872",
"42649296",
"5262555",
"60763643"
] | [
"15011464",
"30135",
"2285986",
"12732355",
"18399986",
"17440077",
"6728817"
] | true | true | true | https://api.semanticscholar.org/CorpusID:9180975 | 0 | 0 | 0 | 1 | 0 |
||||||
Promoting Representational Fluency for Cognitive Bias Mitigation in Information Visualization | 69,367,655 | Information visualization involves the use of visual representations of data to amplify cognition. While visualizations do generally amplify cognition, they also have representational biases that encourage thinking and reasoning in certain ways at the expense of others. I propose that the development of representational fluency by visualization designers and users can help mitigate such biases, and that promoting representational fluency in visualization education and practice can be a useful general strategy for mitigating cognitive biases. Literature from various disciplines is discussed, including perspectives on meta-visualization, representational competence, and meta-representational competence. Some implications for visualization research, education, and practice are examined. The need for engaging users in deep, effortful cognitive processing is discussed and is situated within literature on established bias-mitigating strategies. A preliminary research agenda comprising five challenges is also proposed. | [
{
"first": "Paul",
"middle": [],
"last": "Parsons",
"suffix": ""
}
] | 2,018 | 10.1007/978-3-319-95831-6_10 | Cognitive Biases in Visualizations | 2893048763 | [] | [
"57573726"
] | false | true | false | https://api.semanticscholar.org/CorpusID:69367655 | null | null | null | null | null |
|||||
Supervised tensor learning | 43,640,958 | This paper aims to take general tensors as inputs for supervised learning. A supervised tensor learning (STL) framework is established for convex optimization based learning techniques such as support vector machines (SVM) and minimax probability machines (MPM). Within the STL framework, many conventional learning machines can be generalized to take n/sup th/-order tensors as inputs. We also study the applications of tensors to learning machine design and feature extraction by linear discriminant analysis (LDA). Our method for tensor based feature extraction is named the tenor rank-one discriminant analysis (TR1DA). These generalized algorithms have several advantages: 1) reduce the curse of dimension problem in machine learning and data mining; 2) avoid the failure to converge; and 3) achieve better separation between the different categories of samples. As an example, we generalize MPM to its STL version, which is named the tensor MPM (TMPM). TMPM learns a series of tensor projections iteratively. It is then evaluated against the original MPM. Our experiments on a binary classification problem show that TMPM significantly outperforms the original MPM. | [
{
"first": "Dacheng",
"middle": [],
"last": "Tao",
"suffix": ""
},
{
"first": "Xuelong",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Weiming",
"middle": [],
"last": "Hu",
"suffix": ""
},
{
"first": "Stephen",
"middle": [
"J."
],
"last": "Maybank",
"suffix": ""
},
{
"first": "Xindong",
"middle": [],
"last": "Wu",
"suffix": ""
}
] | 2,005 | 10.1109/ICDM.2005.139 | ICDM | 2031049553 | [] | [
"46847400",
"8710207",
"8710207",
"54501641",
"8726020",
"424550",
"60440602",
"9745516",
"16763012",
"4775867",
"4775867",
"53366437",
"17106009",
"201073270",
"110248079",
"110248079",
"145832979",
"1053802",
"33518454",
"342344",
"6403444",
"16870734",
"27884124",
"16945657",
"7841095",
"208127944",
"20114432",
"16391397",
"9115420",
"9115420",
"3064393",
"3153088",
"28422047",
"8846391",
"15035629",
"199675174",
"22941565",
"12854325",
"15095335",
"22046593",
"22046593",
"52913960",
"52913960",
"16184230",
"4631966",
"5378795",
"10811364",
"7584070",
"13780323",
"16509628",
"2185499",
"11395809",
"209531869",
"16344199",
"16344199",
"16709991",
"4681183",
"33316752",
"18577920",
"4632839",
"4532591",
"4532591",
"4557919",
"4142562",
"22454153",
"736738",
"10932809",
"14618110",
"3956004",
"34114882",
"12318703",
"52881581",
"52881581",
"18719482",
"29487207",
"39354027",
"1109248",
"17007495",
"25980854",
"44125307",
"5445052",
"215144758",
"55194481",
"207222429",
"11003247",
"7701162",
"4946847",
"4946847",
"15720942",
"11096425",
"204852639",
"13536106",
"17861439",
"11292597",
"52143243",
"34658929",
"34658929",
"19140168",
"207101477",
"207101477",
"543380",
"5834380",
"117533201",
"14441458",
"6355497",
"32746718",
"3675806",
"4931066",
"4931066",
"25804161",
"14108569",
"34051215",
"3329064",
"208262232",
"20126393",
"14631416",
"27285247",
"51924489",
"7135597",
"207217007",
"8940227",
"18016968",
"15764679",
"17601973",
"9090634",
"2786917",
"9060128",
"209386477",
"19279545",
"2823109",
"9453263",
"211208678",
"9627932",
"7990264",
"6760856",
"4460113",
"124407510",
"12148384",
"18828297",
"8015814",
"49302363",
"1083112",
"15661036",
"52178882",
"4547224",
"12429280",
"207750240",
"26068498",
"35255835",
"37138728",
"46516248",
"1493444",
"8475957",
"12569215",
"5720814",
"6715175",
"56088302",
"3000097",
"150168",
"9966116",
"116672473",
"4794668",
"12570372",
"7957182",
"13216534",
"2534199",
"1332794",
"199454222",
"13895895",
"229262",
"10728682",
"51715566",
"4434356",
"18440240",
"1900121",
"370750",
"9952373",
"202672093",
"3080540",
"4908512",
"38834239",
"38834239",
"24468023",
"19206878",
"12095710",
"17656484",
"55362997",
"17089564",
"127827430",
"5860587",
"32660157",
"4646590",
"2241091",
"37472456",
"2367747",
"12980051",
"24077621",
"59601095",
"12822404",
"28012260",
"18530632",
"18530632",
"8118444",
"4925175",
"5012724",
"6178224",
"844345",
"14352525",
"4871109",
"30001668",
"4779811",
"56428918",
"4507594",
"4827729",
"39768662",
"18278733",
"15950305"
] | false | true | false | https://api.semanticscholar.org/CorpusID:43640958 | null | null | null | null | null |
|||||
Perceptually Adaptive Graphics | 2,081,934 | In recent years, the Graphics community has come to realise the importance of taking human perception into account when striving for realism in images, animations and Virtual Environments. In May 2001, a EUROGRAPHICS/SIGGRAPH Campfire brought together a group of researchers from various fields, including computer graphics and visualisation, psychology, neuroscience, eye-movements and medicine to discuss the future and current state of the field. Since then, many researchers have been very active in furthering the field of perceptually adaptive graphics. In this report, we outline the state of the art as discussed at that event and the progress that has been made since. | [
{
"first": "Carol",
"middle": [],
"last": "O'Sullivan",
"suffix": ""
},
{
"first": "Sarah",
"middle": [],
"last": "Howlett",
"suffix": ""
},
{
"first": "Rachel",
"middle": [],
"last": "McDonnell",
"suffix": ""
},
{
"first": "Yann",
"middle": [],
"last": "Morvan",
"suffix": ""
},
{
"first": "Keith",
"middle": [],
"last": "O'Conor",
"suffix": ""
}
] | 2,004 | 10.2312/egst.20041029 | 1510697626 | [
"6711088",
"7736312",
"53161033",
"5896356",
"1905821",
"5094948",
"122293753",
"8425286",
"207161946",
"193143939",
"60806007",
"2444123",
"8257618",
"18739610",
"3068402",
"6110371",
"69817479",
"621181",
"143707702",
"5906785",
"7090336",
"5120420",
"18446462",
"16293566",
"6182988",
"37466289",
"15465127",
"226853",
"18905847",
"30094890",
"17863326",
"14643719",
"11795608",
"3145747",
"140098821",
"16829722",
"2935281",
"207161594",
"15341860",
"6446858",
"7018150",
"12463047",
"7469287",
"10627592",
"19045982",
"53245002",
"6442059",
"9064263",
"950287",
"11405580",
"6579249",
"17199255",
"5354361",
"2027619",
"15340893",
"14308539",
"2487835",
"9167186",
"7731697",
"14590928",
"1104081",
"2464971",
"579143",
"16901329",
"6513680",
"37263004",
"6193699",
"484661"
] | [
"6864285",
"11367342",
"3096352",
"1171922",
"198963352",
"15399338",
"208635076",
"24959416",
"10572916",
"4874354",
"17597886",
"84840630",
"11269779",
"18825551",
"9467332",
"14749554",
"1278887",
"11358554",
"8704561",
"859759",
"11622173",
"13437997",
"2520832",
"1510642",
"15077102",
"7434827",
"774457",
"16778026",
"41171660",
"15881042",
"30742903",
"37419485",
"5183399",
"2689209",
"14542466",
"497022",
"15422170",
"13461653",
"41927905",
"3254225"
] | true | true | true | https://api.semanticscholar.org/CorpusID:2081934 | 0 | 0 | 0 | 1 | 0 |
||||||
Gardeners and gurus: patterns of cooperation among CAD users | 2,089,507 | We studied CAD system users to find out how they use the sophisticated customization and extension facilities offered by many CAD products. We found that users of varying levels of expertise collaborate to customize their CAD environments and to create programmatic extensions to their applications. Within a group of users, there is at least one local expert who provides support for other users. We call this person a local developer . The local developer is a fellow domain expert, not a professional programmer, outside technical consultant or MIS staff member. We found that in some CAD environments the support role has been formalized so that local developers are given official recognition, and time and resources to pursue local developer activities. In general, this formalization of the local developer role appears successful. We discuss the implications of our findings for work practices and for software design. | [
{
"first": "Michelle",
"middle": [],
"last": "Gantt",
"suffix": ""
},
{
"first": "Bonnie",
"middle": [
"A."
],
"last": "Nardi",
"suffix": ""
}
] | 1,992 | 10.1145/142750.142767 | CHI '92 | 2128198397 | [
"108797409",
"111209445",
"14348931",
"207052389",
"166613030",
"40997576",
"11562235",
"14049031",
"108789426",
"108465858",
"17317205",
"109071436",
"14425105",
"17685955",
"16240618",
"202793333",
"59702387",
"61035774",
"110350480",
"45268310",
"25555067",
"166876650"
] | [
"21624034",
"17029498",
"11456945",
"13672314",
"2080531",
"41870064",
"18222403",
"11523588",
"362771",
"8255942",
"9838491",
"17949387",
"8627643",
"21649531",
"7454139",
"174809615",
"11647910",
"3220492",
"11696896",
"207957317",
"6436559",
"18833169",
"17868605",
"18979413",
"64650569",
"33050572",
"53227102",
"15004401",
"10320157",
"17831674",
"51944687",
"276142",
"23123386",
"3913781",
"9118652",
"198313317",
"5556600",
"1991376",
"11336786",
"11673036",
"2957332",
"3116302",
"14580316",
"85520420",
"3807260",
"2090832",
"29863776",
"18913749",
"16713750",
"14594040",
"15325916",
"13898395",
"46955085",
"16831593",
"195259465",
"5775505",
"5215840",
"16332505",
"16265720",
"28417902",
"15878260",
"18761917",
"12977871",
"13712111",
"7651241",
"16616783",
"10376083",
"6467209",
"207182920",
"15819170",
"2247894",
"18129791",
"17738364",
"11148312",
"2992125",
"7003112",
"12946925",
"211041550",
"14348881",
"15700350",
"1186186",
"17766346",
"16120458",
"830375",
"5040980",
"7723669",
"1343517",
"17179135",
"15409723"
] | true | true | true | https://api.semanticscholar.org/CorpusID:2089507 | 0 | 0 | 0 | 1 | 0 |
|||||
A high performance, universal, key associative access method | 15,298,325 | A new file organization is proposed that combines the advantages of digital B-trees and extendible hashing methods into one organization that can be used universally. The method, like these predecessors, relies on digital searching. The key notions are: (i) that multipage nodes are addressed by the root and can have both data and index entries, the mix of entries changing over time; and (ii) that these nodes can be doubled with file growth and, when this occurs, data nodes at the next level of the tree are absorbed into the pages of these nodes, frequently keeping data closer to the root and simultaneously improving utilization. The result is an unbalanced tree that we call a digital lopsided tree or DL-tree. The paper describes DL-trees and their operations, and examines their properties. The most important engineering issues involve the doubling process and the methods used to optimize the tree properties. Ways of dealing with these issues are suggested. | [
{
"first": "David",
"middle": [
"B."
],
"last": "Lomet",
"suffix": ""
}
] | 1,983 | 10.1145/582192.582213 | SIGMOD '83 | 1982279067 | [
"26930249",
"2723596",
"59850636",
"14819963",
"8223365",
"15298325"
] | [
"10351417",
"17011776",
"3214529",
"15298325",
"11027450",
"11498438"
] | true | true | true | https://api.semanticscholar.org/CorpusID:15298325 | 0 | 0 | 0 | 1 | 0 |
|||||
Privacy Risk in Graph Stream Publishing for Social Network Data | 10,210,942 | To understand how social networks evolve over time, graphs representing the networks need to be published periodically or on-demand. The identity of the participants (nodes) must be anonymized to protect the privacy of the individuals and their relationships (edges) to the other members in the social network. We identify a new form of privacy attack, which we name the degree-trail attack. This attack re-identifies the nodes belonging to a target participant from a sequence of published graphs by comparing the degree of the nodes in the published graphs with the degree evolution of a target. The power of this attack is that the adversary can actively influence the degree of the target individual by interacting with the social network. We show that the adversary can succeed with a high probability even if published graphs are anonymized by strongest known privacy preserving techniques in the literature. Moreover, this success does not depend on the distinctiveness of the target nodes nor require the adversary to behave differently from a normal participant. One of our contributions is a formal method to assess the privacy risk of this type of attacks and empirically study the severity on real social network data. | [
{
"first": "Nigel",
"middle": [],
"last": "Medforth",
"suffix": ""
},
{
"first": "Ke",
"middle": [],
"last": "Wang",
"suffix": ""
}
] | 2,011 | 10.1109/ICDM.2011.120 | 2011 IEEE 11th International Conference on Data Mining | 2011 IEEE 11th International Conference on Data Mining | 1976013083 | [
"480386",
"2675640",
"17657062",
"40227327",
"264041",
"207179518",
"122132693",
"15311309",
"1228475",
"207167634",
"304685",
"11996464",
"13993093",
"6416294",
"14074654"
] | [
"214853784",
"55686539",
"14160862",
"10929966",
"29044845",
"284231",
"13739021",
"8500104",
"15663809",
"35797328",
"1534951",
"15246029",
"2096532",
"59231542",
"17880526",
"133605185",
"17971802",
"3326143"
] | true | true | true | https://api.semanticscholar.org/CorpusID:10210942 | 1 | 1 | 1 | 1 | 1 |
||||
Artificial subtle expressions: intuitive notification methodology of artifacts | 892,408 | We describe artificial subtle expressions (ASEs) as intuitive notification methodology for artifacts' internal states for users. We prepared two types of audio ASEs; one was a flat artificial sound (flat ASE), and the other was a sound that decreased in pitch (decreasing ASE). These two ASEs were played after a robot made a suggestion to the users. Specifically, we expected that the decreasing ASE would inform users of the robot's lower level of confidence about the suggestions. We then conducted a simple experiment to observe whether the participants accepted or rejected the robot's suggestion in terms of the ASEs. The results showed that they accepted the robot's suggestion when the flat ASE was used, whereas they rejected it when the decreasing ASE was used. Therefore, we found that the ASEs succeeded in conveying the robot's internal state to the users accurately and intuitively. | [
{
"first": "Takanori",
"middle": [],
"last": "Komatsu",
"suffix": ""
},
{
"first": "Seiji",
"middle": [],
"last": "Yamada",
"suffix": ""
},
{
"first": "Kazuki",
"middle": [],
"last": "Kobayashi",
"suffix": ""
},
{
"first": "Kotaro",
"middle": [],
"last": "Funakoshi",
"suffix": ""
},
{
"first": "Mikio",
"middle": [],
"last": "Nakano",
"suffix": ""
}
] | 2,010 | 10.1145/1753326.1753619 | CHI | 2013390482 | [
"145791076",
"42269515",
"1506452",
"2719134",
"14058076",
"40132734",
"14586847"
] | [
"3249856",
"6093050",
"2879188",
"1748465",
"51799794",
"7235624",
"17449047",
"9073068",
"16181554",
"16181554",
"16850217",
"14489968",
"198328183",
"211002658",
"16528588",
"38238015",
"10213895",
"14208295"
] | true | true | true | https://api.semanticscholar.org/CorpusID:892408 | 0 | 0 | 0 | 1 | 0 |
|||||
Targeting direct cash transfers to the extremely poor | 13,138,831 | Unconditional cash transfers to the extreme poor via mobile telephony represent a radical, new approach to giving. GiveDirectly is a non-governmental organization (NGO) at the vanguard of delivering this proven and effective approach to reducing poverty. In this work, we streamline an important step in the operations of the NGO by developing and deploying a data-driven system for locating villages with extreme poverty in Kenya and Uganda. Using the type of roof of a home, thatched or metal, as a proxy for poverty, we develop a new remote sensing approach for selecting extremely poor villages to target for cash transfers. We develop an analytics algorithm that estimates housing quality and density in patches of publicly-available satellite imagery by learning a predictive model with sieves of template matching results combined with color histograms as features. We develop and deploy a crowdsourcing interface to obtain labeled training data. We deploy the predictive model to construct a fine-scale heat map of poverty and integrate this discovered knowledge into the processes of GiveDirectly's operations. Aggregating estimates at the village level, we produce a ranked list from which top villages are included in GiveDirectly's planned distribution of cash transfers. The automated approach increases village selection efficiency significantly. | [
{
"first": "Brian",
"middle": [],
"last": "Abelson",
"suffix": ""
},
{
"first": "Kush",
"middle": [
"R."
],
"last": "Varshney",
"suffix": ""
},
{
"first": "Joy",
"middle": [],
"last": "Sun",
"suffix": ""
}
] | 2,014 | 10.1145/2623330.2623335 | KDD '14 | 1964565322 | [
"60686293",
"89141",
"28287278",
"32219555",
"2350432",
"8472717",
"203698",
"23655515",
"2973672",
"14488469",
"122692461"
] | [
"204424203",
"14143441",
"14727823",
"18501386",
"19232662",
"212700443",
"167217662"
] | true | true | true | https://api.semanticscholar.org/CorpusID:13138831 | 0 | 0 | 0 | 1 | 0 |
|||||
A mischief of mice: examining children's performance in single display groupware systems with 1 to 32 mice | 1,196,322 | Mischief is a system for classroom interaction that allows multiple children to use individual mice and cursors to interact with a single large display [20]. While the system can support large groups of children, it is unclear how children's performance is affected as group size increases. We explore this question via a study involving two tasks, with children working in group sizes ranging from 1 to 32. The first required reciprocal selection of two on-screen targets, resembling a swarm pointing scenario that might be used in educational applications. The second, a more temporally and spatially distributed pointing task, had children entering different words by selecting characters on an on-screen keyboard. Results indicate that performance is significantly affected by group size only when targets are small. Further, group size had a smaller effect when pointing was spatially and temporally distributed than when everyone was concurrently aiming at the same targets. | [
{
"first": "Neema",
"middle": [],
"last": "Moraveji",
"suffix": ""
},
{
"first": "Kori",
"middle": [],
"last": "Inkpen",
"suffix": ""
},
{
"first": "Ed",
"middle": [],
"last": "Cutrell",
"suffix": ""
},
{
"first": "Ravin",
"middle": [],
"last": "Balakrishnan",
"suffix": ""
}
] | 2,009 | 10.1145/1518701.1519030 | CHI | 2123201683 | [
"32735751",
"59790782",
"501599",
"16356818",
"20984669",
"14930642",
"12857408",
"8908252",
"6703204",
"195710035",
"8908560",
"143388193",
"6684748",
"3086545",
"6591510",
"45195177",
"6003501",
"40592975",
"614985",
"10152336",
"145791656"
] | [
"791558",
"16547562",
"7838746",
"40772678",
"49562770",
"16827115",
"5041555",
"9823740",
"18816458",
"16782334",
"14364643",
"16608010",
"17176983",
"14281952",
"6888609",
"1866449",
"3272474",
"205708788",
"14228366",
"14317169",
"61902244",
"18201052",
"14863345"
] | true | true | true | https://api.semanticscholar.org/CorpusID:1196322 | 0 | 0 | 0 | 1 | 0 |
|||||
An agglomerative hierarchical clustering using partial maximum array and incremental similarity computation method | 5,519,094 | As the tractable amount of data grows in the computer science area, fast clustering algorithms are required, because traditional clustering algorithms are not feasible for very large and high-dimensional data. Many studies have been reported on the clustering of large databases, but most of them circumvent this problem by using an approximation method, resulting in the deterioration of accuracy. In this paper, we propose a new clustering algorithm by means of a partial maximum array, which can realize agglomerative hierarchical clustering with the same accuracy as the brute-force algorithm and has O(N/sup 2/) time complexity. We also present an incremental method of similarity computation which substitutes a scalar calculation for the time-consuming calculation of vector similarity. Experimental results show that clustering becomes significantly fast for large and high-dimensional data. | [
{
"first": "SungYoung",
"middle": [],
"last": "Jung",
"suffix": ""
},
{
"first": "Taek-Soo",
"middle": [],
"last": "Kim",
"suffix": ""
}
] | 2,001 | 10.1109/ICDM.2001.989528 | Proceedings 2001 IEEE International Conference on Data Mining | Proceedings 2001 IEEE International Conference on Data Mining | 2151779484 | [
"7055940",
"2885948",
"851269",
"2061991",
"2551081",
"61116939",
"2385745",
"1455429",
"15828757",
"59907722",
"118889646",
"45115551",
"32863022",
"1343506"
] | [
"2483024",
"23428313",
"905675",
"62045334",
"4788929",
"196628146",
"4613827",
"14495422",
"2338909",
"5664864",
"28923929"
] | true | true | true | https://api.semanticscholar.org/CorpusID:5519094 | 0 | 0 | 0 | 1 | 0 |
||||
Reading Motor Intentions | 6,673,850 | Reading Motor Intentions Lewkowicz Daniel ([email protected]) URECA laboratory, Univ Lille Nord de France, F-59000 Lille, France Delevoye-Turrell Yvonne ([email protected]) URECA laboratory, Univ Lille Nord de France, F-59000 Lille, France MESHS, USR 3185, F-59000 Lille, France Abstract Some evidence in very recent psychological studies have demonstrated that motor simulation ability is crucial for the correct understanding of social intentions. The present study was conducted first to confirm that the nature of the motor intention leads to early modulations of movement kinematics. Then, we tested whether humans could read an agent’s intention when observing the very first element of a complex action sequence. Results revealed early variations in movement kinematics and further showed that human agents can use these deviants to distinguish above chance level between three different social actions. Similar performance levels were found using an artificial classifier (Neural Network) and this procedure demonstrated furthermore that decisions could be taken on the basis of information contained in the first 500ms of movement kinematics. Taken together these results confirm the importance of motor simulation for adapted social interaction, and suggest how robotic adaptive controllers may use as input low-level motor information (e.g. kinematics) to afford biologically inspired social behaviors. Keywords: Classifier; kinematics; sequences; motor control; intentionality: social interaction; internal models; prediction; motor planning; biological movement. Introduction In everyday activities, the grasping of an object might be performed with different prior intentions: e.g. touch, move, throw or pass. Ansuini et al. (2008) have measured the prior-to-contact grasping kinematics for reach-to-grasp movements performed toward a bottle filled with water. By comparing hand shaping across tasks involving different subsequent actions - pour the water into a container; throw the bottle; move the bottle from one spatial location to another - the authors demonstrated how the prior intention in grasping the object strongly affected the positioning of the fingers during the reaching and the contact phase of the action (Ansuini, Giosa, Turella, Altoe, & Castiello, 2008). In another series of studies, Becchio and collaborators investigated the effects of social context on reach-to-grasp actions. They found initial adjustments reflecting specific planning strategies (Becchio, Sartori, Bulgheroni, & Castiello, 2008a) as well as online adjustments (Sartori, Becchio, Bulgheroni, & Castiello, 2009) when performing under social context (see : Becchio et al., 2010 for a review). More recently, researchers have gone one step further to suggest that not only end-point constraints and social contexts affect movement kinematics, but that these deviants may be used to read motor intention. For example, when observing actions performed under social context or not, Castiello and collaborators demonstrated that humans can successfully use kinematic cues of reach-to-grasp movements to predict the final goal of the action (Sartori, Becchio, & Castiello, 2011). Similar results were also found using point-light displays of simple reach to grasp movements (Manera, Becchio, Cavallo, Sartori, & Castiello, 2011). However, in these studies, the classification rates were obtained under a forced two-choice paradigm, and for the most subtle differences (cooperative vs individual preferred speed or competitive vs fast speed) the classification rates were very small (near 50%). In the present work, we wanted to study the capacity of humans to read motor intention in a sequence of 2 motor elements. One novelty of this study is that the sequences were performed entirely during an interactive situation with a con-specific, without any interruption or verbal instruction between the sequences. As such, we recorded sequential actions during an ecologically inspired task (Jungle Speed), a simple face-to-face game using a unique manipulated object. Our main focus was to compare human and artificial categorization performances for three different sequential actions that took part during the game. To test the hypothesis that kinematics alone is sufficient to read social intention, we fed the artificial classifier with movement kinematics only. Confronting Jacob & Jeannerod’s (2005) reading motor intention hypothesis, we hypothesized that human agents are able to read motor intention through the simple observation of arm kinematics of the first element of a 2-sequence action. This is possible due to the fact that arm kinematics of the reach to grasp movements reveal specific deviants in function of goal intention from an ideal optimized trajectory. Finally, if motor simulation is sufficient, then an artificial neural network should be able to learn from the deviants and predict as well as humans, the motor intention of an observed agent. In the following section, we first describe the methods we used to make the observation videos (Part A), which were then played to human agents (Part B) and used as input parameters to an artificial neural network (Part C). Creating Stimuli Two adults participated in the study, one experimenter and the other as subject. Both participants were right handed | [
{
"first": "Daniel",
"middle": [],
"last": "Lewkowwicz",
"suffix": ""
},
{
"first": "Yvonne",
"middle": [],
"last": "Delevoye-Turrell",
"suffix": ""
}
] | 2,013 | CogSci | 2406652894 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:6673850 | null | null | null | null | null |
||||||
Spam filtering using a Markov random field model with variable weighting schemas | 14,277,498 | In this paper we present a Markov random field model based approach to filter spam. Our approach examines the importance of the neighborhood relationship (MRF cliques) among words in an email message for the purpose of spam classification. We propose and test several different theoretical bases for weighting schemes among corresponding neighborhood windows. Our results demonstrate that unexpected side effects depending on the neighborhood window size may have larger accuracy impact than the neighborhood relationship effects of the Markov random field. | [
{
"first": "S.",
"middle": [],
"last": "Chhabra",
"suffix": ""
},
{
"first": "W.S.",
"middle": [],
"last": "Yerazunis",
"suffix": ""
},
{
"first": "C.",
"middle": [],
"last": "Siefkes",
"suffix": ""
}
] | 2,004 | 10.1109/ICDM.2004.10031 | Fourth IEEE International Conference on Data Mining (ICDM'04) | Fourth IEEE International Conference on Data Mining (ICDM'04) | 1530678164 | [
"42087677",
"6334230",
"14119791",
"59750699",
"108200827"
] | [
"36262375",
"18356846",
"18504793",
"63863715",
"16288354",
"4336715",
"13311118",
"11139612",
"16653920",
"15833036",
"60511474",
"5867386",
"6119051",
"17130781",
"14095234",
"10674201",
"14891495",
"53054113",
"24184253",
"24184253",
"43782295",
"17030244",
"15094749",
"2187446",
"10404783",
"7893171"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14277498 | 1 | 1 | 1 | 1 | 1 |
||||
Retrospective think-aloud method: using eye movements as an extra cue for participants' verbalizations | 1,314,858 | The retrospective think-aloud method, in which participants work in silence and verbalize their thoughts afterwards while watching a recording of their performance, is often used for the evaluation of websites. However, participants may not always be able to recall what they thought, when they only see few visual cues that help them remembering their task execution process. In our study we complemented the recording of the performance with a gaze trail of the participant" eye movements, in order to elicit more verbalizations. A comparison was made between the traditional retrospective think-aloud protocols and the variant with eye movements. Contrary to our expectations, no differences were found between the two conditions on numbers of problems, the ways these problems were detected, and types of problems. Two possible explanations for this result are that eye movements might be rather confronting and distracting for participants, and the rather generic way of probing we used. The added value might be stronger when specific questions are asked, based on the observed eye movements. Implications for usability practitioners are discussed in the conclusions of this paper. | [
{
"first": "Sanne",
"middle": [],
"last": "Elling",
"suffix": ""
},
{
"first": "Leo",
"middle": [],
"last": "Lentz",
"suffix": ""
},
{
"first": "Menno",
"middle": [],
"last": "de Jong",
"suffix": ""
}
] | 2,011 | 10.1145/1978942.1979116 | CHI | 2006014968 | [
"11010701",
"14014323",
"29518802",
"1985356",
"208012017",
"59628641",
"16168808",
"145386990",
"15883226",
"1260312",
"14443886",
"15077193",
"35646128",
"9701717",
"8773880",
"972615",
"62596614",
"27441434",
"18239370",
"452597",
"207761834"
] | [
"54061837",
"11539894",
"30647017",
"56298840",
"7460183",
"53573487",
"199422898",
"53602907",
"55544167",
"3813898",
"20815949",
"52193211",
"196162745",
"3921722",
"26372837",
"195471922",
"8376467",
"199042436",
"15564832",
"209434712",
"215238644"
] | true | true | true | https://api.semanticscholar.org/CorpusID:1314858 | 0 | 0 | 0 | 1 | 0 |
|||||
Analogical gestures foster understanding of causal systems. | 20,764,686 | [
{
"first": "Kensy",
"middle": [],
"last": "Cooperrider",
"suffix": ""
},
{
"first": "Dedre",
"middle": [],
"last": "Gentner",
"suffix": ""
},
{
"first": "Susan",
"middle": [],
"last": "Goldin-Meadow",
"suffix": ""
}
] | 2,017 | CogSci | 2787503773 | [
"42104976",
"143508586",
"1160415",
"143871245",
"113681",
"9674380",
"21180723",
"9207578",
"8567308",
"118044041",
"2884477",
"37334395",
"60964547",
"9727601",
"34041352",
"371637",
"44955774",
"15839962",
"15537150",
"6998710",
"5250061",
"64233501",
"35421668",
"17766572",
"8728083",
"766955",
"15421083",
"143316949",
"1299022",
"65005467"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:20764686 | 0 | 0 | 0 | 1 | 0 |
|||||||
Modelling conceptual change as foraging for explanations on an epistemic landscape | 26,245,420 | [
{
"first": "Ismo",
"middle": [
"T."
],
"last": "Koponen",
"suffix": ""
},
{
"first": "Tommi",
"middle": [],
"last": "Kokkonen",
"suffix": ""
}
] | 2,017 | CogSci | 2785995120 | [
"144127281",
"143841716",
"118500236",
"67703794",
"33858357",
"52083554",
"7690481",
"1503169",
"14844710",
"143942056",
"18388875"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:26245420 | 0 | 0 | 0 | 1 | 0 |
|||||||
More than just a communication system: diversity in the use of electronic mail | 10,050,089 | This paper describes a series of interviews that focus on the ways that professional office workers use electronic mail to manage their daily work. A number of implications for the design of flexible mail systems are discussed. Two principal claims are made. First, electronic mail is more than just a communication system. In addition to supporting information management, it provides a mechanism for supporting a variety of time management and task management activities. Some people are prioritizers , concentrating on the problem of managing incoming messages. Others are archivers , concentrating on how to archive information for subsequent use. Similarly, some people use mail to delegate tasks, while others perform tasks delegated to them by others electronically. The second claim is that use of electronic mail is strikingly diverse, although not infinitely so. Individuals vary in their preferences, both in their general willingness to manage their work electronically and in their specific preferences along the dimensions described above. This diversity implies that one's own experiences with electronic mail are unlikely to provide sufficient understanding of other's uses of mail. Mail designers should thus seek flexible primitives that capture the important dimensions and provide flexibility for a wide range of users. | [
{
"first": "Wendy",
"middle": [
"E."
],
"last": "Mackay",
"suffix": ""
}
] | 1,988 | 10.1145/62266.62293 | CSCW '88 | 1983737815 | [
"155156454",
"7613862",
"52836934",
"15499503",
"1486850",
"59942628",
"61012784",
"18865860"
] | [
"18426875",
"6047456",
"18001519",
"16478622",
"18360154",
"28357018",
"11617910",
"15867992",
"6050882",
"18391391",
"17757013",
"110257323",
"907383",
"39810350",
"12025531",
"40392257",
"2530257",
"1778086",
"33342140",
"1712381",
"1308004",
"61886956",
"2625355",
"14843005",
"52100858",
"1681916",
"43821577",
"46543416",
"26320718",
"11970340",
"33378160",
"195056",
"7328402",
"14098508",
"14736305",
"55641700",
"7309237",
"107505189",
"14153605",
"58004588",
"8900749",
"16880768",
"3252664",
"974522",
"14053311",
"9163435",
"14887226",
"15352830",
"73724966",
"28151048",
"15811954",
"27830074",
"18691850",
"13667966",
"7252858",
"18854886",
"23670423",
"32614371",
"18185296",
"271125",
"2569913",
"55284968",
"9896928",
"3363165",
"1560477",
"10691503",
"59867397",
"116784964",
"5827376",
"14474371",
"14031244",
"12470647",
"7892668",
"18650129",
"9299585",
"44497308",
"144553218",
"12794169",
"62020818",
"56675510",
"6412905",
"3052955",
"16431922",
"7351277",
"6919565",
"5252126",
"14227874",
"49576131",
"18762183",
"2138714",
"10736330",
"18037615",
"55197729",
"20815334",
"537625",
"16404371",
"207599970",
"11446160",
"111380032",
"3162529"
] | true | true | true | https://api.semanticscholar.org/CorpusID:10050089 | 0 | 0 | 0 | 1 | 0 |
|||||
Atomic incremental garbage collection and recovery for a large stable heap | 12,643,562 | A stable heap is storage that is managed automatically using garbage collection, manipulated using atomic transactions, and accessed using a uniform storage model. These features enhance reliability and simplify programming by preventing errors due to explicit deallocation, by masking failures and concurrency using transactions, and by eliminating the distinction between accessing temporary storage and permanent storage. Stable heap management is useful for programming languages for reliable distributed computing, programming languages with persistent storage, and object-oriented database systems. Many applications that could benefit from a stable heap (e.g., computer-aided design, computer-aided software engineering, and office information systems) require large amounts of storage, timely responses for transactions, and high availability. We present garbage collection and recovery algorithms for a stable heap implementation that meet these goals and are appropriate for stock hardware. The collector is incremental: it does not attempt to collect the whole heap at once. The collector is also atomic: it is coordinated with the recovery system to prevent problems when it moves and modifies objects. The time for recovery is independent of heap size, even if a failure occurs during garbage collection. | [
{
"first": "Elliot",
"middle": [
"K."
],
"last": "Kolodner",
"suffix": ""
},
{
"first": "William",
"middle": [
"E."
],
"last": "Weihl",
"suffix": ""
}
] | 1,993 | 10.1145/170035.170068 | SIGMOD '93 | 2109176348 | [
"57425166",
"17661259",
"10785361",
"42562673",
"12323615",
"6919571",
"18112620",
"17206788",
"59758079",
"5374830",
"207235758",
"60765877",
"7887995",
"1328787",
"208049309",
"18936148",
"62755814",
"208049309",
"14161480",
"60454256",
"16233001"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:12643562 | 0 | 0 | 0 | 1 | 0 |
|||||
Learning to read with a machine teacher: Discovering efficient procedures for training the orth-to-phon relationships in English. | 117,746,292 | [
{
"first": "Christopher",
"middle": [],
"last": "Cox",
"suffix": ""
},
{
"first": "Matthew",
"middle": [
"Cooper"
],
"last": "Borkenhagen",
"suffix": ""
},
{
"first": "Mark",
"middle": [
"S."
],
"last": "Seidenberg",
"suffix": ""
}
] | 2,018 | CogSci | 2942364635 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:117746292 | null | null | null | null | null |
|||||||
Scalable Classification in Large Scale Spatiotemporal Domains Applied to Voltage-Sensitive Dye Imaging | 11,500,173 | We present an approach for learning models that obtain accurate classification of large scale data objects, collected in spatiotemporal domains. The model generation is structured in three phases: pixel selection (spatial dimension reduction), spatiotemporal features extraction and feature selection. Novel techniques for the first two phases are presented, with two alternatives for the middle phase. Model generation based on the combinations of techniques from each phase is explored. The introduced methodology is applied on datasets from the Voltage-Sensitive Dye Imaging (VSDI) domain, where the generated classification models successfully decode neuronal population responses in the visual cortex of behaving animals. VSDI currently is the best technique enabling simultaneous high spatial (10,000 points) and temporal (10 ms or less) resolution imaging from neuronal population in the cortex. We demonstrate that not only our approach is scalable enough to handle computationally challenging data, but it also contributes to the neuroimaging field of study with its decoding abilities. | [
{
"first": "Igor",
"middle": [],
"last": "Vainer",
"suffix": ""
},
{
"first": "Sarit",
"middle": [],
"last": "Kraus",
"suffix": ""
},
{
"first": "Gal",
"middle": [],
"last": "Kaminka",
"suffix": ""
},
{
"first": "Hamutal",
"middle": [],
"last": "Slovin",
"suffix": ""
}
] | 2,009 | 10.1109/ICDM.2009.24 | 2009 Ninth IEEE International Conference on Data Mining | 2009 Ninth IEEE International Conference on Data Mining | 2131651211 | [
"1909790",
"16235441",
"26494289",
"16091268",
"9197946",
"7054934",
"9765398",
"18187118",
"1255533",
"10482122",
"6764495",
"7478325",
"7400297",
"16892477",
"207720429",
"140109802",
"57146809",
"18338443",
"15641166"
] | [
"12660824",
"189807263",
"1504238",
"10091131"
] | true | true | true | https://api.semanticscholar.org/CorpusID:11500173 | 0 | 0 | 0 | 1 | 0 |
||||
A User Study with GUIs Tailored for Smartphones | 37,309,834 | Web-based graphical user interfaces (GUIs) are mostly not tailored for small devices with touchscreens, such as smartphones. There is little scientific evidence on the conditions where additional taps for navigation are better or scrolling. Therefore, we conducted a user study in which we evaluated different ways of tailoring a GUI for a smartphone. Each participant performed the same task with two different layouts of the same GUI. We collected quantitative data through measuring task completion time and error rates, as well as qualitative data through subjective questionnaires. The main result is that minimizing the number of taps is important on a smartphone. Users performed significantly better when they could scroll (vertically), instead of tapping on widget elements (tabs). This preference was also reflected in their subjective opinions. | [
{
"first": "David",
"middle": [],
"last": "Raneburger",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Alonso-Ríos",
"suffix": ""
},
{
"first": "Roman",
"middle": [],
"last": "Popp",
"suffix": ""
},
{
"first": "Hermann",
"middle": [],
"last": "Kaindl",
"suffix": ""
},
{
"first": "Jürgen",
"middle": [],
"last": "Falb",
"suffix": ""
}
] | 2,013 | 10.1007/978-3-642-40480-1_34 | INTERACT | 207709836 | [] | [
"10736672",
"15801421",
"65018569",
"3486965",
"2761512",
"18240707"
] | false | true | false | https://api.semanticscholar.org/CorpusID:37309834 | null | null | null | null | null |
|||||
Towards zero-shot learning for human activity recognition using semantic attribute sequence model | 14,514,285 | Understanding human activities is important for user-centric and context-aware applications. Previous studies showed promising results using various machine learning algorithms. However, most existing methods can only recognize the activities that were previously seen in the training data. In this paper, we present a new zero-shot learning framework for human activity recognition that can recognize an unseen new activity even when there are no training samples of that activity in the dataset. We propose a semantic attribute sequence model that takes into account both the hierarchical and sequential nature of activity data. Evaluation on datasets in two activity domains show that the proposed zero-shot learning approach achieves 70-75% precision and recall recognizing unseen new activities, and outperforms supervised learning with limited labeled data for the new classes. | [
{
"first": "Heng-Tze",
"middle": [],
"last": "Cheng",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Griss",
"suffix": ""
},
{
"first": "Paul",
"middle": [],
"last": "Davis",
"suffix": ""
},
{
"first": "Jianguo",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Di",
"middle": [],
"last": "You",
"suffix": ""
}
] | 2,013 | 10.1145/2493432.2493511 | UbiComp '13 | 1968197118 | [
"14132552",
"3950070",
"14409288",
"2092163",
"15387092",
"7547243",
"11633392",
"211123177",
"9119671",
"159563833",
"7490338",
"17052215",
"18360216",
"11475562",
"7455708",
"14384762"
] | [
"21127255",
"49392608",
"195832186",
"2282097",
"53032806",
"85524941",
"15899700",
"52968521",
"38458882",
"70245417",
"9051406",
"33740433",
"38187081",
"201070094",
"208214212",
"202159562",
"51908273",
"14682828",
"59337593",
"15196514",
"13888273",
"52296625",
"1226294",
"211027838",
"211507001",
"15570235",
"24471631"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14514285 | 0 | 0 | 0 | 1 | 0 |
|||||
Fragile online relationship: a first look at unfollow dynamics in twitter | 6,380,228 | We analyze the dynamics of the behavior known as 'unfollow' in Twitter. We collected daily snapshots of the online relationships of 1.2 million Korean-speaking users for 51 days as well as all of their tweets. We found that Twitter users frequently unfollow. We then discover the major factors, including the reciprocity of the relationships, the duration of a relationship, the followees' informativeness, and the overlap of the relationships, which affect the decision to unfollow. We conduct interview with 22 Korean respondents to supplement the quantitative results. They unfollowed those who left many tweets within a short time, created tweets about uninteresting topics, or tweeted about the mundane details of their lives. To the best of our knowledge, this work is the first systematic study of the unfollow behavior in Twitter. | [
{
"first": "Haewoon",
"middle": [],
"last": "Kwak",
"suffix": ""
},
{
"first": "Hyunwoo",
"middle": [],
"last": "Chun",
"suffix": ""
},
{
"first": "Sue",
"middle": [],
"last": "Moon",
"suffix": ""
}
] | 2,011 | 10.1145/1978942.1979104 | CHI | 2204868318,2112130747 | [
"524106",
"145228563",
"93906",
"142673610",
"18822007",
"11940919",
"6965607",
"18664455",
"3865671",
"144860444",
"10056599",
"1766526",
"207178765",
"32911002",
"2603383",
"9077635",
"61440772",
"8161899",
"60935820",
"145239304",
"2690560",
"6256236",
"143455676",
"9973484",
"207172321"
] | [
"7205362",
"1500752",
"54451583",
"886167",
"17764860",
"53278648",
"6854973",
"12844500",
"14351110",
"36609142",
"150086206",
"148146381",
"2614337",
"204753162",
"2681316",
"4807553",
"207201360",
"17044409",
"24000031",
"17822800",
"174803669",
"2820898",
"15372448",
"58912968",
"8975658",
"15759020",
"2324310",
"5701696",
"2747139",
"203599429",
"17603729",
"7145497",
"61907088",
"7230664",
"6910081",
"7513825",
"1203294",
"14547480",
"17352993",
"20676728",
"14278534",
"36815008",
"14861635",
"63713358",
"203655328",
"11227188",
"13755446",
"28621382",
"1108539",
"11942545",
"29522621",
"20297838",
"17324357",
"1193337",
"131776879",
"153467488",
"17090076",
"3125259",
"14272264",
"202729075",
"39500299",
"15556648",
"16672346",
"37248465",
"10427260",
"207290938",
"16474723",
"33852537",
"17558431",
"16058613",
"14196575",
"9056493",
"515841",
"11346647",
"5562408",
"17311088",
"210122798",
"12282134",
"15858607",
"17213000",
"15075467",
"13866981",
"19801611"
] | true | true | true | https://api.semanticscholar.org/CorpusID:6380228 | 0 | 0 | 0 | 1 | 0 |
|||||
Editorial | 214,626,498 | [
{
"first": "Kristina",
"middle": [],
"last": "Shin",
"suffix": ""
}
] | 2,018 | PMC5898683 | 10.1080/17543260903116356 | Global Spine Journal | Global Spine Journal | [] | [] | false | false | true | https://api.semanticscholar.org/CorpusID:214626498 | 1 | 0 | 1 | 0 | 1 |
|||||
Bidirectional gaze in remote computer mediated collaboration: setup and initial results from pair-programming | 2,157,016 | We investigate the role of gaze in communication and collaboration between humans in computerised environments. In this paper we describe a software solution to a multidirectional gaze display in shared-display collaborative tasks and we report on initial results of an experiment in which the system was applied to allow gaze display in a remote pair-programming lecture. Remotely, an expert was explaining two algorithms to a novice who then attempted to apply the algorithm on an unseen problem. We report on an analysis of data from the conditions when there was a gaze transmitted and displayed to the peer with the no-gaze condition. The remote gaze display reliably affected the variability of novices visual attention patterns and they were better able to focus on the information presented. Without the experts gaze display their strategies contained greater variety. | [
{
"first": "Roman",
"middle": [],
"last": "Bednarik",
"suffix": ""
},
{
"first": "Andrey",
"middle": [],
"last": "Shipilov",
"suffix": ""
},
{
"first": "Sami",
"middle": [],
"last": "Pietinen",
"suffix": ""
}
] | 2,011 | 10.1145/1958824.1958923 | CSCW '11 | 2049214556 | [] | [
"54001895",
"14361030",
"6144383"
] | false | true | false | https://api.semanticscholar.org/CorpusID:2157016 | null | null | null | null | null |
|||||
A Novel Traffic Light Control Strategy With a Reconfigured Stop Line | 201,811,659 | In this paper, we introduce a brand new intersection setting which combines a reconfigured stop line and variable message signs unit, along with vehicle-to-infrastructure and infrastructure-to-infrastructure communications. A buffer waiting zone resulting from the new stop line contributes to compensating the starting time from a standstill and shortening the intersection crossing time. An improved traffic light control algorithm is adapted for the proposed stop line, then both human-driven vehicles and connected and automated vehicles can distinctly determine their strategies only from the current phase without considering the remaining phase time. Compared with pre-timed and actuated traffic signal systems, simulations validate the effectiveness of our method. | [
{
"first": "Jinyan",
"middle": [],
"last": "Ji",
"suffix": ""
},
{
"first": "Jiabao",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Hao",
"middle": [],
"last": "Sun",
"suffix": ""
}
] | 2,019 | 10.1109/IVS.2019.8813782 | 2019 IEEE Intelligent Vehicles Symposium (IV) | 2019 IEEE Intelligent Vehicles Symposium (IV) | 2970491533,2984078561 | [
"51922995",
"8528102",
"18110264",
"11261330",
"25432622",
"15116417",
"39754254",
"15588317",
"55031451"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:201811659 | 0 | 0 | 0 | 1 | 0 |
||||
Towards Cross-Verification and Use of Simulation in the Assessment of Automated Driving | 201,812,944 | One remaining challenge for Automated Driving (AD) that remains unclear to this day is its assessment for market release. The application of previous strategies derived from the V-model is infeasible due to the vast amount of required real-road testing to prove safety with an acceptable significance. A full set of requirements covering all possible traffic scenarios for testing and AD system can still not be derived to this day. Several approaches address this issue by either improving the set of test cases or by including other virtual test domains in the assessment process. However, all rely on simulations that can not be validated as a whole and therefore not be used for proving safety. This work addresses this issue and exhibits a method to verify the use of simulation in a scenario-based assessment process. By introducing a pipeline for reprocessing real-world scenarios as test cases we demonstrate where errors emerge and how these can be isolated. We unveil an issue in simulation which may cause behavior changes of the AD function in resimulation and thus makes the straight forward use of simulation in the assessment process impossible. A solution promising to minimize reprocessing errors and to avoid this behavior change is presented. Finally, this enables the local variation of realworld driving tests in a solely simulative context yielding verified and usable results. | [
{
"first": "Sebastian",
"middle": [],
"last": "Wagner",
"suffix": ""
},
{
"first": "Korbinian",
"middle": [],
"last": "Groh",
"suffix": ""
},
{
"first": "Thomas",
"middle": [],
"last": "Kühbeck",
"suffix": ""
},
{
"first": "Alois",
"middle": [],
"last": "Knoll",
"suffix": ""
}
] | 2,019 | 10.1109/IVS.2019.8814268 | 2019 IEEE Intelligent Vehicles Symposium (IV) | 2019 IEEE Intelligent Vehicles Symposium (IV) | 2970897831,2984233444 | [
"53007988",
"114000394",
"55362244",
"52263105",
"113524559",
"86440789",
"53026713",
"207008770",
"53024643",
"13987505",
"22054277",
"3936854"
] | [
"210930795"
] | true | true | true | https://api.semanticscholar.org/CorpusID:201812944 | 0 | 0 | 0 | 1 | 0 |
||||
More than skin deep: measuring effects of the underlying model on access-control system usability | 14,108,472 | In access-control systems, policy rules conflict when they prescribe different decisions (allow or deny) for the same access. We present the results of a user study that demonstrates the significant impact of conflict-resolution method on policy-authoring usability. In our study of 54 participants, varying the conflict-resolution method yielded statistically significant differences in accuracy in five of the six tasks we tested, including differences in accuracy rates of up to 78%. Our results suggest that a conflict-resolution method favoring rules of smaller scope over rules of larger scope is more usable than the Microsoft Windows operating system's method of favoring deny rules over allow rules. Perhaps more importantly, our results demonstrate that even seemingly small changes to a system's semantics can fundamentally affect the system's usability in ways that are beyond the power of user interfaces to correct. | [
{
"first": "Robert",
"middle": [
"W."
],
"last": "Reeder",
"suffix": ""
},
{
"first": "Lujo",
"middle": [],
"last": "Bauer",
"suffix": ""
},
{
"first": "Lorrie",
"middle": [
"F."
],
"last": "Cranor",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"K."
],
"last": "Reiter",
"suffix": ""
},
{
"first": "Kami",
"middle": [],
"last": "Vaniea",
"suffix": ""
}
] | 2,011 | 10.1145/1978942.1979243 | CHI | 2070881494 | [
"1883850",
"1408370",
"34162712",
"469655",
"5623900",
"8511087",
"6821531",
"14850483",
"5771938",
"17776333",
"5874368",
"9255715",
"18815667",
"1717656",
"1460831",
"13216189",
"33183392",
"5792556",
"2409651"
] | [
"16727021",
"2805606",
"1800783",
"17674084",
"7548257",
"2565218",
"479319",
"17284691",
"1630526",
"31798710",
"9449104",
"16012526",
"7340693",
"5816301",
"12369319",
"208108282",
"13914224",
"62964324",
"18199009"
] | true | true | true | https://api.semanticscholar.org/CorpusID:14108472 | 0 | 0 | 0 | 1 | 0 |
|||||
A test of two models of probability judgment: quantum versus noisy probability | 17,227,395 | [
{
"first": "Fintan",
"middle": [
"J."
],
"last": "Costello",
"suffix": ""
},
{
"first": "Paul",
"middle": [],
"last": "Watts",
"suffix": ""
}
] | 2,016 | CogSci | 2978667443,2787227716 | [
"153731219",
"9199120",
"14371569",
"154450191",
"12754716",
"147618840",
"37788181",
"8402936",
"149191349",
"148684338",
"143452957",
"52087674",
"141168085"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:17227395 | 0 | 0 | 0 | 1 | 0 |
|||||||
Exploring Topic-Based Sharing Mechanisms | 33,852,537 | General-purpose content-sharing platforms make it difficult for users to limit sharing to people interested in particular topics. Additional topic-based controls may allow users to better reach desired audiences. Designing such tools requires understanding current interest-based targeting techniques and the potential impact of additional mechanisms. We present an exploratory, interview-based study (n = 16) that addresses these dynamics for Facebook. We use diary-driven probes to explore general topic-based sharing across applications. We then use Facebook-based mockups to probe use cases and design tensions around adding topic-based sharing mechanisms to Facebook. We find that participants currently draw on various audience-limiting and reaching strategies to target interest-based audiences. Participants felt additional topic-based sharing mechanisms on Facebook might allow them to avoid oversharing or offending others and allow them to target improved audiences or share improved content. Usable topic-based sharing tools would also need to account, however, for participants' varied desired engagement strategies. | [
{
"first": "Manya",
"middle": [],
"last": "Sleeper",
"suffix": ""
},
{
"first": "Lorrie",
"middle": [
"Faith"
],
"last": "Cranor",
"suffix": ""
},
{
"first": "Sarah",
"middle": [
"K."
],
"last": "Pearman",
"suffix": ""
}
] | 2,017 | 10.1145/3025453.3025840 | Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems | 2611740671 | [
"600035",
"13039172",
"886167",
"9506954",
"2707267",
"15244007",
"4776238",
"15194115",
"6776888",
"34895224",
"2598803",
"835957",
"6380228",
"16257224",
"8134180",
"144265716",
"8924335",
"15323869",
"23321842",
"37675864",
"153086513",
"16969683",
"17352993",
"23880903",
"46341",
"6847989",
"7673485",
"15874637",
"1145926",
"142330919",
"206727449",
"8502860",
"15271160",
"15881288",
"9141820"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:33852537 | 1 | 1 | 1 | 1 | 1 |
|||||
Efficient query processing in geographic web search engines | 6,854,621 | Geographic web search engines allow users to constrain and order search results in an intuitive manner by focusing a query on a particular geographic region. Geographic search technology, also called local search, has recently received significant interest from major search engine companies. Academic research in this area has focused primarily on techniques for extracting geographic knowledge from the web. In this paper, we study the problem of efficient query processing in scalable geographic search engines. Query processing is a major bottleneck in standard web search engines, and the main reason for the thousands of machines used by the major engines. Geographic search engine query processing is different in that it requires a combination of text and spatial data processing techniques. We propose several algorithms for efficient query processing in geographic search engines, integrate them into an existing web search query processor, and evaluate them on large sets of real data and query traces. | [
{
"first": "Yen-Yu",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Torsten",
"middle": [],
"last": "Suel",
"suffix": ""
},
{
"first": "Alexander",
"middle": [],
"last": "Markowetz",
"suffix": ""
}
] | 2,006 | 10.1145/1142473.1142505 | SIGMOD '06 | 2169307587 | [
"2589320",
"1525685",
"400964",
"3077937",
"11567855",
"911040",
"58456047",
"206134284",
"8188014",
"2036907",
"8475025",
"28200118",
"37107413",
"7075919",
"59865734",
"8623241",
"8344725",
"1198106",
"13920255",
"6531798",
"3849010",
"15396454",
"13361420",
"53249539",
"7210748",
"14354438",
"5985654",
"207197892",
"1381551",
"1056811",
"1973926",
"61887463",
"18735310",
"11957784",
"1891398",
"176290",
"5890543",
"35765580",
"1630712",
"12125361"
] | [
"17005530",
"54470858",
"13969473",
"15204839",
"44184768",
"6772112",
"14382063",
"5247127",
"17556908",
"16505857",
"7000411",
"16697279",
"61238169",
"9638751",
"17995594",
"419115",
"15051038",
"10511065",
"2330275",
"14411197",
"14395797",
"27226420",
"4811068",
"7484378",
"11750946",
"14367117",
"9434023",
"16287850",
"14945900",
"1387357",
"15819374",
"16613418",
"54554771",
"67295413",
"30016690",
"17324828",
"26664181",
"17065362",
"16924563",
"17010465",
"8822876",
"214779226",
"9333425",
"18405344",
"13199458",
"3684929",
"2235104",
"12678829",
"63483422",
"198394399",
"14724547",
"54810687",
"5180264",
"36587282",
"7036340",
"17038286",
"11482004",
"18509585",
"2531241",
"16336717",
"3460651",
"2466827",
"2068970",
"6547468",
"54311611",
"2929458",
"20836565",
"15836424",
"15836424",
"16578219",
"16748596",
"18791564",
"15013881",
"13228053",
"49348192",
"211061925",
"10827701",
"41215872",
"64168909",
"7273141",
"92985446",
"13559844",
"17106986",
"174818146",
"15900573",
"17509024",
"15750665",
"12572508",
"55868347",
"13563477",
"2722709",
"23076990",
"1413253",
"61935153",
"3815007",
"16868420",
"3193435",
"11757000",
"8509541",
"213194764",
"202722168",
"18424007",
"8841969",
"2224774",
"15184181",
"3534245",
"7875238",
"16065169",
"7784331",
"201090104",
"15786637",
"17283120",
"10834982",
"1029735",
"6722278",
"14466124",
"12371930",
"4162057",
"53306396",
"11069141",
"15182134",
"14025452",
"361272",
"14636988",
"2753410",
"7575796",
"40482457",
"14844970",
"209451670",
"41118470",
"10504538",
"16459330",
"18033283",
"7872989",
"16700290",
"6784228",
"14560952",
"30357102",
"15656505",
"5997369",
"265139",
"14346269",
"31949142",
"15218414",
"6632483",
"7866449",
"9791525",
"1066238",
"45674305",
"1227309",
"53529204",
"9165732",
"15511197",
"6373012",
"42671976",
"13951396",
"16759742",
"2169330",
"14206187",
"53032958",
"4107161",
"174818592",
"26244867",
"15357721",
"55041319",
"37961833",
"14658970",
"18835640",
"26691373",
"29164846",
"18551833",
"1639723",
"16753243",
"11355769",
"141066425",
"5635322",
"3212683",
"210875749",
"10637037",
"53081271",
"33732220",
"978822",
"212633089",
"12397976",
"54776922",
"55715562",
"6293753",
"59423150",
"11227243",
"1543251",
"6381967",
"53126286",
"63278920",
"7364812",
"16267026"
] | true | true | true | https://api.semanticscholar.org/CorpusID:6854621 | 0 | 0 | 0 | 1 | 0 |
|||||
ALOJA-ML: A Framework for Automating Characterization and Knowledge Discovery in Hadoop Deployments | 1,555,537 | This article presents ALOJA-Machine Learning (ALOJA-ML) an extension to the ALOJA project that uses machine learning techniques to interpret Hadoop benchmark performance data and performance tuning; here we detail the approach, efficacy of the model and initial results. The ALOJA-ML project is the latest phase of a long-term collaboration between BSC and Microsoft, to automate the characterization of cost-effectiveness on Big Data deployments, focusing on Hadoop. Hadoop presents a complex execution environment, where costs and performance depends on a large number of software (SW) configurations and on multiple hardware (HW) deployment choices. Recently the ALOJA project presented an open, vendor-neutral repository, featuring over 16.000 Hadoop executions. These results are accompanied by a test bed and tools to deploy and evaluate the cost-effectiveness of the different hardware configurations, parameter tunings, and Cloud services. Despite early success within ALOJA from expert-guided benchmarking, it became clear that a genuinely comprehensive study requires automation of modeling procedures to allow a systematic analysis of large and resource-constrained search spaces. ALOJA-ML provides such an automated system allowing knowledge discovery by modeling Hadoop executions from observed benchmarks across a broad set of configuration parameters. The resulting empirically-derived performance models can be used to forecast execution behavior of various workloads; they allow a-priori prediction of the execution times for new configurations and HW choices and they offer a route to model-based anomaly detection. In addition, these models can guide the benchmarking exploration efficiently, by automatically prioritizing candidate future benchmark tests. Insights from ALOJA-ML's models can be used to reduce the operational time on clusters, speed-up the data acquisition and knowledge discovery process, and importantly, reduce running costs. In addition to learning from the methodology presented in this work, the community can benefit in general from ALOJA data-sets, framework, and derived insights to improve the design and deployment of Big Data applications. | [
{
"first": "Josep",
"middle": [
"Ll."
],
"last": "Berral",
"suffix": ""
},
{
"first": "Nicolas",
"middle": [],
"last": "Poggi",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Carrera",
"suffix": ""
},
{
"first": "Aaron",
"middle": [],
"last": "Call",
"suffix": ""
},
{
"first": "Rob",
"middle": [],
"last": "Reinauer",
"suffix": ""
},
{
"first": "Daron",
"middle": [],
"last": "Green",
"suffix": ""
}
] | 2,015 | 1511.02030 | 10.1145/2783258.2788600 | Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Pages 1701-1710. ACM New York, NY, USA. 2015. ISBN: 978-1-4503-3664-2 | 2170997892 | [
"44971656",
"17136352",
"6413396",
"13861754",
"2443795",
"9517130",
"1056674",
"5964380",
"214750992",
"58534172",
"58458964",
"2333393"
] | [
"4675043",
"1952960",
"22643558",
"52051129",
"3881882",
"11140191",
"400327",
"1887938",
"17153645",
"214596465",
"11824617",
"20429552"
] | true | true | true | https://api.semanticscholar.org/CorpusID:1555537 | 1 | 1 | 1 | 1 | 1 |
||||
Global Texture Mapping for Dynamic Objects | 209,062,258 | [
{
"first": "Jungeon",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "Hyomin",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "Jaesik",
"middle": [],
"last": "Park",
"suffix": ""
},
{
"first": "Seungyong",
"middle": [],
"last": "Lee",
"suffix": ""
}
] | 2,019 | 10.1111/cgf.13872 | Comput. Graph. Forum | Comput. Graph. Forum | 2986474050 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:209062258 | null | null | null | null | null |
|||||
On Regulatory and Organizational Constraints in Visualization Design and Evaluation | 1,923,530 | Problem--based visualization research provides explicit guidance toward identifying and designing for the needs of users, but absent is more concrete guidance toward factors external to a user's needs that also have implications for visualization design and evaluation. This lack of more explicit guidance can leave visualization researchers and practitioners vulnerable to unforeseen constraints beyond the user's needs that can affect the validity of evaluations, or even lead to the premature termination of a project. Here we explore two types of external constraints in depth, regulatory and organizational constraints, and describe how these constraints impact visualization design and evaluation. By borrowing from techniques in software development, project management, and visualization research we recommend strategies for identifying, mitigating, and evaluating these external constraints through a design study methodology. Finally, we present an application of those recommendations in a healthcare case study. We argue that by explicitly incorporating external constraints into visualization design and evaluation, researchers and practitioners can improve the utility and validity of their visualization solution and improve the likelihood of successful collaborations with industries where external constraints are more present. | [
{
"first": "Anamaria",
"middle": [],
"last": "Crisan",
"suffix": ""
},
{
"first": "Jennifer",
"middle": [
"L."
],
"last": "Gardy",
"suffix": ""
},
{
"first": "Tamara",
"middle": [],
"last": "Munzner",
"suffix": ""
}
] | 2,016 | 1610.10056 | 10.1145/2993901.2993911 | BELIV '16 | 2528323795 | [
"2090317",
"192403",
"1943669",
"9240477",
"371925",
"9748472",
"394389",
"17457201",
"206804420",
"15736560",
"37160815",
"15024635",
"16489159",
"662339",
"14812997"
] | [
"204891873",
"170078841",
"215721572",
"53034863",
"16650441"
] | true | true | true | https://api.semanticscholar.org/CorpusID:1923530 | 1 | 1 | 1 | 1 | 1 |
||||
Improving Performance of Image Retrieval Based on Fuzzy Colour Histograms by Using Hybrid Colour Model and Genetic Algorithm | 32,539,016 | A hybrid colour model is a colour descriptor formed by combining channels from several different colour models. Although rarely used in computer graphics applications due to redundancy, hybrid colour models may be of interest for the Content-Based Image Retrieval CBIR. Best features of each colour model can be combined to obtain optimal retrieval performance. This paper evaluates several approaches to the construction of a hybrid colour model that is used to construct a fuzzy colour histogram of image as a compact feature for retrieval. By evaluating each channel separately, a colour model named HSY is proposed. Various parameters of fuzzy histogram are further improved using Genetic algorithm GA. Using standard data sets and the Average Normalized Modified Retrieval Rank ANMRR as a metric for retrieval performance, it is shown that this novel approach can give an improved retrieval performance. | [
{
"first": "Vedran",
"middle": [],
"last": "Ljubovic",
"suffix": ""
},
{
"first": "Haris",
"middle": [],
"last": "Supic",
"suffix": ""
}
] | 2,015 | 10.1111/cgf.12609 | Comput. Graph. Forum | Comput. Graph. Forum | 1601742764 | [] | [] | false | false | false | https://api.semanticscholar.org/CorpusID:32539016 | null | null | null | null | null |
||||
An Iterative Improvement Approach for the Discretization of Numeric Attributes in Bayesian Classifiers | 1,486,739 | The Bayesian classifier is a simple approach to classification that produces results that are easy for people to interpret. In many cases, the Bayesian classifier is at least as accurate as much more sophisticated learning algorithms that produce results that are more difficult for people to interpret. To use numeric attributes with Bayesian classifier often requires the attribute values to be discretized into a number of intervals. We show that the discretization of numeric attributes is critical to successful application of the Bayesian classifier and propose a new method based on iterative improvement search. We compare this method to previous approaches and show that it results in significant reductions in misclassification error and costs on an industrial problem of troubleshooting the local loop in a telephone network. The approach can take prior knowledge into account by improving upon a user-provided set of boundary points, or can operate autonomously. | [
{
"first": "Michael",
"middle": [
"J."
],
"last": "Pazzani",
"suffix": ""
}
] | 1,995 | KDD | 235630032 | [] | [
"14403239",
"14526423",
"12114283",
"10820121",
"17382631",
"18937883",
"9450251",
"14748066",
"14464256",
"166429834",
"292454",
"7876357",
"18910642",
"5463714",
"23436171",
"11158714",
"11463087",
"19803807",
"16400284",
"14974766",
"2515286",
"15635756",
"7422980",
"15294425",
"9866850"
] | false | true | true | https://api.semanticscholar.org/CorpusID:1486739 | 0 | 0 | 0 | 1 | 0 |
||||||
Semi-supervised Pattern Classification Using Optimum-Path Forest | 12,000,674 | We introduce a semi-supervised pattern classification approach based on the optimum-path forest (OPF) methodology. The method transforms the training set into a graph, finds prototypes in all classes among labeled training nodes, as in the original supervised OPF training, and propagates the class of each prototype to its most closely connected samples among the remaining labeled and unlabeled nodes of the graph. The classifier is an optimum-path forest rooted at those prototypes and the class of a new sample is determined, in an incremental way, as the class of its most closely connected prototype. We compare it with the supervised version using different learning strategies and an efficient method, Transductive Support Vector Machines (TSVM), on several datasets. Experimental results show the semi-supervised approach advantages in accuracy with statistical significance over the supervised method and TSVM. We also show the gain in accuracy of semi-supervised approach when more representative samples are selected for the training set. | [
{
"first": "Willian",
"middle": [],
"last": "Paraguassu Amorim",
"suffix": ""
},
{
"first": "Alexandre",
"middle": [],
"last": "Xavier Falcao",
"suffix": ""
},
{
"first": "Marcelo",
"middle": [
"Henriques"
],
"last": "De Carvalho",
"suffix": ""
}
] | 2,014 | 10.1109/SIBGRAPI.2014.45 | 2014 27th SIBGRAPI Conference on Graphics, Patterns and Images | 2014 27th SIBGRAPI Conference on Graphics, Patterns and Images | 1969684918 | [
"60860751",
"204018731",
"2943668",
"7045013",
"16258268",
"61771446",
"206433377",
"31073001",
"16720359",
"15108133",
"17138113",
"8979520",
"16819429",
"21348242",
"207228399",
"14591650",
"29013572",
"6901292",
"76987",
"156548"
] | [
"210932318",
"36431270",
"27925566",
"10603464",
"27084806",
"1486848",
"4299909",
"15329467",
"8218124"
] | true | true | true | https://api.semanticscholar.org/CorpusID:12000674 | 0 | 0 | 0 | 1 | 0 |
||||
Structure and Evolution of Online Social Networks | 60,268,360 | Social networks are complex systems which evolve through interactions among a growing set of actors or users. A popular methodology of studying such systems is to use tools of complex network theory to analyze the evolution of the networks, and the topological properties that emerge through the process of evolution. With the exponential rise in popularity of Online Social Networks (OSNs) in recent years, there have been a number of studies which measure the topological properties of such networks. Several network evolution models have also been proposed to explain the emergence of these properties, such as those based on preferential attachment, heterogeneity of nodes, and triadic closure. We survey some of these studies in this chapter. We also describe in detail a preferential attachment based model to analyze the evolution of OSNs in the presence of restrictions on node-degree that are presently being imposed in all popular OSNs. | [
{
"first": "Saptarshi",
"middle": [],
"last": "Ghosh",
"suffix": ""
},
{
"first": "Niloy",
"middle": [],
"last": "Ganguly",
"suffix": ""
}
] | 2,014 | 10.1007/978-3-319-05164-2_2 | Intelligent Systems Reference Library | Intelligent Systems Reference Library | 283267621 | [] | [
"54200204",
"19735786"
] | false | true | true | https://api.semanticscholar.org/CorpusID:60268360 | 0 | 0 | 0 | 0 | 0 |
||||
Understanding how the projection of availability state impacts the reception incoming communication | 3,182,583 | Many communication systems infer and project information about a user's availability, making it possible for others to decide whether and how to contact that user. Presumably when the system infers people are busy, they are less open to interruption. But analysis of 103,962 phone calls made using a popular enterprise communications tool reveals that people are actually significantly more likely to answer the phone when the system projects that they are busy than at other times. A follow-up survey of 569 users of the system suggests that this seemingly counter-intuitive fact may arise because people care a lot about the recipient's availability when initiating phone communications and are unlikely to attempt to call someone who appears to be busy unless the communication is important. Recipients thus perceive incoming calls as more important when they are busy than at other times, making them more likely to answer. | [
{
"first": "Jaime",
"middle": [],
"last": "Teevan",
"suffix": ""
},
{
"first": "Alexander",
"middle": [],
"last": "Hehmeyer",
"suffix": ""
}
] | 2,013 | 10.1145/2441776.2441860 | CSCW '13 | 2169677811 | [
"11109231",
"5734511",
"9439335",
"1609696",
"8029006",
"3162456",
"14171767",
"18325748",
"9847368",
"23001061",
"1681916"
] | [
"15416375",
"53245064",
"18050119",
"36331403",
"207818901",
"14662592",
"13126730",
"8356867",
"19243337",
"1075913"
] | true | true | true | https://api.semanticscholar.org/CorpusID:3182583 | 0 | 0 | 0 | 1 | 0 |
|||||
ReservoirBench: An Interactive Educational Reservoir Engineering Workbench | 8,662,790 | ReservoirBench is an interactive workbench for educational geological science and engineering tasks. It is designed to facilitate education of novice audiences to teach them basic concepts of reservoir modeling and simulation workflow. Traditional training using lectures and software practice can lead to information overload, and retainability is questionable. As an alternative, we propose a physical workbench that is coupled with digital augmentation for the purpose of learning. We take advantage of the crucial role that spatiality and 3D representations play in petroleum reservoir modeling and allow basic domain concepts to be introduced and explored in a tangible and experiential manner. We describe the design of our prototype and reflect on the findings from our preliminary design critique. | [
{
"first": "Sowmya",
"middle": [],
"last": "Somanath",
"suffix": ""
},
{
"first": "Allan",
"middle": [],
"last": "Rocha",
"suffix": ""
},
{
"first": "Hamidreza",
"middle": [],
"last": "Hamdi",
"suffix": ""
},
{
"first": "Ehud",
"middle": [],
"last": "Sharlin",
"suffix": ""
},
{
"first": "Mario",
"middle": [
"Costa"
],
"last": "Sousa",
"suffix": ""
}
] | 2,015 | 10.1007/978-3-319-22701-6_26 | INTERACT | 1213630331 | [
"17565253",
"22345373",
"18507220",
"5635174",
"92911934",
"31374807",
"2624729",
"462228",
"112033130",
"7146503",
"35806973",
"145664289",
"112710658",
"917579",
"1858960",
"1053741",
"39713481"
] | [
"6851011"
] | true | true | true | https://api.semanticscholar.org/CorpusID:8662790 | 1 | 1 | 1 | 1 | 1 |
|||||
Automated Audience Segmentation Using Reputation Signals | 50,767,213 | Selecting the right audience for an advertising campaign is one of the most challenging, time-consuming and costly steps in the advertising process. To target the right audience, advertisers usually have two options: a) market research to identify user segments of interest and b) sophisticated machine learning models trained on data from past campaigns. In this paper we study how demand-side platforms (DSPs) can leverage the data they collect (demographic and behavioral) in order to learn reputation signals about end user convertibility and advertisement (ad) quality. In particular, we propose a reputation system which learns interest scores about end users, as an additional signal of ad conversion, and quality scores about ads, as a signal of campaign success. Then our model builds user segments based on a combination of demographic, behavioral and the new reputation signals and recommends transparent targeting rules that are easy for the advertiser to interpret and refine. We perform an experimental evaluation on industry data that showcases the benefits of our approach for both new and existing advertiser campaigns. | [
{
"first": "Maria",
"middle": [],
"last": "Daltayanni",
"suffix": ""
},
{
"first": "Ali",
"middle": [],
"last": "Dasdan",
"suffix": ""
},
{
"first": "Luca",
"middle": [],
"last": "de Alfaro",
"suffix": ""
}
] | 2,018 | 10.1145/3219819.3219923 | Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining | 2883163516 | [
"479976",
"167161434",
"799986",
"1878383",
"14591658",
"346962",
"14590641",
"1868144",
"18207285",
"13638733"
] | [
"128358197"
] | true | true | true | https://api.semanticscholar.org/CorpusID:50767213 | 0 | 0 | 0 | 1 | 0 |
|||||
StockAssIstant: A Stock AI Assistant for Reliability Modeling of Stock Comments | 50,769,871 | Stock comments from analysts contain important consulting information for investors to foresee stock volatility and market trends. Existing studies on stock comments usually focused on capturing coarse-grained opinion polarities or understanding market fundamentals. However, investors are often overwhelmed and confused by massive comments with huge noises and ambiguous opinions. Therefore, it is an emerging need to have a fine-grained stock comment analysis tool to identify more reliable stock comments. To this end, this paper provides a solution called StockAssIstant for modeling the reliability of stock comments by considering multiple factors, such as stock price trends, comment content, and the performances of analysts, in a holistic manner. Specifically, we first analyze the pattern of analysts' opinion dynamics from historical comments. Then, we extract key features from the time-series constructed by using the semantic information in comment text, stock prices and the historical behaviors of analysts. Based on these features, we propose an ensemble learning based approach for measuring the reliability of comments. Finally, we conduct extensive experiments and provide a trading simulation on real-world stock data. The experimental results and the profit achieved by the simulated trading in 12-month period clearly validate the effectiveness of our approach for modeling the reliability of stock comments. | [
{
"first": "Chen",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Yijun",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Can",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Changying",
"middle": [],
"last": "Du",
"suffix": ""
},
{
"first": "Hongzhi",
"middle": [],
"last": "Yin",
"suffix": ""
},
{
"first": "Hao",
"middle": [],
"last": "Wang",
"suffix": ""
}
] | 2,018 | 10.1145/3219819.3219964 | Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining | 2883599634 | [
"15452246",
"154862727",
"17269455",
"14727513",
"2950859",
"16994508",
"157343937",
"2820418",
"6605744",
"154680021",
"16177852",
"56776745",
"5825949",
"7017535",
"2583916",
"23345223",
"1926604",
"14948357",
"2060590",
"2318959",
"16416899",
"15719673",
"15176324",
"195699772",
"917767",
"158458857",
"10893592",
"40340997",
"39697648",
"21081685",
"8170752",
"3587437",
"38836281",
"5190664",
"11082297",
"9011",
"2969616",
"28307599",
"10512107",
"153855897",
"15011469"
] | [
"86759693",
"195882581",
"57366181",
"201356415",
"211171490"
] | true | true | true | https://api.semanticscholar.org/CorpusID:50769871 | 0 | 0 | 0 | 1 | 0 |
|||||
Context dependency and systematicity in connectionism | 34,454,851 | Context dependency and systematicity in connectionism Jordi Maj` a University of Edinburgh Abstract: I argue that connectionist models are well prepared to deal with the problem of context dependency. I understand the problem of context dependency in the case of language processing and in relation to the problem of systematicity as follows: if the meaning of a word in a sentence is context dependent, then the systematicity of our cognitive capacities could not be explained, since the same word in a new sentence (though being the same) would not have the same meaning as in the initial sentence, and then, concerning systematicity, our ability to produce or understand a new sentence would not depend on our ability to produce or understand the initial sentence. A correctly trained network should be able to distinguish them as different meanings precisely because the meaning is always differently determined in the network. I will discuss to which extent systematicity would be a problem for connectionism. | [
{
"first": "Jordi",
"middle": [],
"last": "Maja",
"suffix": ""
}
] | 2,011 | CogSci | 2577018531 | [] | [] | false | false | true | https://api.semanticscholar.org/CorpusID:34454851 | 0 | 0 | 0 | 0 | 0 |
||||||
Combining Features to a Class-Specific Model in an Instance Detection Framework | 16,225,306 | Object detection is a Computer Vision task that determines if there is an object of some category (class) in an image or video sequence. When the classes are formed by only one specific object, person or place, the task is known as instance detection. Object recognition classifies an object as belonging to a class in a set of known classes. In this work we deal with an instance detection/recognition task. We collected pictures of famous landmarks from the Internet to build the instance classes and test our framework. Some examples of the classes are: monuments, churches, ancient constructions or modern buildings. We tested several approaches to the problem and a new global feature is proposed to be combined to some widely known features like PHOW. A combination of features and classifiers to model the given instances in the training phase was the most successful one. | [
{
"first": "Arnaldo",
"middle": [],
"last": "Lara",
"suffix": ""
},
{
"first": "Roberto",
"middle": [],
"last": "Hirata",
"suffix": ""
}
] | 2,011 | 10.1109/SIBGRAPI.2011.9 | 2011 24th SIBGRAPI Conference on Graphics, Patterns and Images | 2011 24th SIBGRAPI Conference on Graphics, Patterns and Images | 2043264856 | [
"17606900",
"52998092",
"1900911",
"206597351",
"6953475",
"4246903",
"10878162",
"1486613",
"14327585",
"5258236",
"206590483",
"2983005",
"118828957",
"60033325",
"1309931",
"130535382",
"1458265",
"17584818",
"1782131",
"6718692",
"14777911",
"61992380",
"2715202",
"7211257",
"60828197",
"1458265",
"206787478",
"2443126",
"14106275",
"1440386",
"206769491"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:16225306 | 0 | 0 | 0 | 1 | 0 |
||||
Linking dynamic query interfaces to knowledge models | 5,217,507 | This research aims at improving dynamic query based information access by using knowledge modelling to narrow the search space. Our objective is to allow users to quickly browse web pages and get the information content related to his/her profile and within semantically relevant dimensions. We have developed an application to link a dynamic query interface to ontologies containing knowledge about customers, products and shopping tasks in an online shop. | [
{
"first": "Maria",
"middle": [],
"last": "De Carvalho",
"suffix": ""
},
{
"first": "J.",
"middle": [],
"last": "Tan",
"suffix": ""
},
{
"first": "J.",
"middle": [],
"last": "Domingue",
"suffix": ""
},
{
"first": "H.",
"middle": [],
"last": "Petursson",
"suffix": ""
}
] | 2,002 | 10.1145/502716.502749 | IUI '02 | 2060878672 | [
"16002025",
"296997",
"60482655",
"8021243",
"1357047"
] | [] | true | false | true | https://api.semanticscholar.org/CorpusID:5217507 | 0 | 0 | 0 | 1 | 0 |
Subsets and Splits