id int64 0 30.4k | document stringlengths 403 26.1k | summary stringlengths 73 1.77k | jaccard_doc_score sequencelengths 2 21 | jaccard_doc_edu_score sequencelengths 2 21 | jaccard_multi_doc_score sequencelengths 2 21 | jaccard_multi_doc_edu_score sequencelengths 2 21 | sent_trans_doc_score sequencelengths 2 21 | sent_trans_doc_edu_score sequencelengths 2 21 | doc_token_num sequencelengths 2 21 | doc_rough_word_num sequencelengths 2 21 | predict_doc_rank sequencelengths 2 21 | predict_doc_edu_score sequencelengths 2 21 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
0 | Author(s): Kuperberg, Greg; Thurston, Dylan P. | || Abstract: || We give a purely topological definition of the perturbative quantum invariants of links and 3-manifolds associated with Chern-Simons field theory. || Our definition is as close as possible to one given by Kontsevich. || We will also establish some bas... | Two other generalizations that can be considered are invariants of graphs in 3-manifolds, and invariants associated to other flat connections cite . We will analyze these in future work. Among other things, there should be a general relation between flat bundles and links in 3-manifolds on the one hand and finite cover... | [
0.5837479270315091,
0.7156626506024096,
0.7281947261663286
] | [
[
0.10399999999999998,
0.02452316076294281,
0.3790322580645161,
0.17663043478260865,
0.4986737400530503,
0.2975871313672922
],
[
0.15902964959568733,
0.27717391304347827,
0.136,
0.09562841530054644,
0.22010869565217395
],
[
0.43199999999999994,
0.225543478... | [
0.22580645161290322,
0.0967741935483871,
0.06451612903225806
] | [
[
0,
0,
0.12903225806451613,
0.03225806451612903,
0.06451612903225806,
0
],
[
0,
0.06451612903225806,
0.03225806451612903,
0,
0.03225806451612903
],
[
0.03225806451612903,
0.03225806451612903,
0.03225806451612903,
0.03225806451612903
]
] | [
0.5674442052841187,
0.5404402017593384,
0.5769424438476562
] | [
[
0.0907474160194397,
0.17879262566566467,
0.6012547612190247,
0.13346058130264282,
0.522700309753418,
0.17921781539916992
],
[
0.29877665638923645,
0.5470221042633057,
0.3202812969684601,
0.23468801379203796,
0.38933372497558594
],
[
0.49355629086494446,
... | [
130,
80,
118
] | [
88,
56,
78
] | [
1,
0,
2
] | [
[
0.07909778505563736,
0.24365481734275818,
0.48909804224967957,
0.06771787256002426,
0.4643016457557678,
0.1689857840538025
],
[
0.24499699473381042,
0.43611374497413635,
0.18393419682979584,
0.3459683060646057,
0.27478620409965515
],
[
0.365586519241333,
... |
1 | A statistical model for segmentation and word discovery in child directed speech is presented. || An incremental unsupervised learning algorithm to infer word boundaries based on this model is described || and results of empirical tests showing that the algorithm is competitive with other models that have been used f... | Model Based Dynamic Programming, hereafter referred to as MBDP-1 cite , is probably the most recent work that addresses the exact same issue as that considered in this paper. Both the approach presented in this paper and Brent's MBDP-1 are based on explicit probability models. Approaches not based on explicit probabili... | [
0.3847006651884701,
0.6395522388059701
] | [
[
0.10432852386237512,
0.1165371809100999,
0.1653718091009989
],
[
0.16648168701442845,
0.09877913429522756,
0.06992230854605996,
0.1330376940133038,
0.15742793791574283,
0.12208657047724747,
0.023307436182020025,
0.13429522752497225,
0.0910099889012208,
0.135... | [
0.07407407407407407,
0.12345679012345678
] | [
[
0.04938271604938271,
0.024691358024691357,
0.024691358024691357
],
[
0.012345679012345678,
0.024691358024691357,
0.012345679012345678,
0.012345679012345678,
0.024691358024691357,
0.024691358024691357,
0.012345679012345678,
0.012345679012345678,
0.012345679012345... | [
0.45081645250320435,
0.45451420545578003
] | [
[
0.42737624049186707,
0.4064871072769165,
0.45941171050071716
],
[
0.36935317516326904,
0.38360244035720825,
0.24884504079818726,
0.33441609144210815,
0.4774458110332489,
0.3712290823459625,
0.11711420118808746,
0.26762670278549194,
0.2642640471458435,
0.3163... | [
58,
234
] | [
53,
196
] | [
0,
1
] | [
[
0.5323754549026489,
0.4727588891983032,
0.3138616383075714
],
[
0.40138792991638184,
0.43883007764816284,
0.1899094581604004,
0.22677969932556152,
0.4661150574684143,
0.3913743197917938,
0.15739108622074127,
0.2269093543291092,
0.3614950180053711,
0.39379873... |
2 | We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. || Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic programming within each piece. || The same methods can be used to solve other plan... | Recently we were able to characterize the graphs that can occur at most @math times as a subgraph isomorph in an @math -vertex planar graph: they are exactly the 3-connected planar graphs cite . However our proof does not lead to an efficient algorithm for 3-connected planar subgraph isomorphism. In this paper we use d... | [
0.7775330396475771,
0.6560283687943262
] | [
[
0.2724935732647815,
0.39331619537275064,
0.3877551020408163
],
[
0.19437340153452687,
0.11340206185567014,
0.12755102040816324,
0.09278350515463918,
0.06958762886597936,
0.18556701030927836,
0.25,
0.21649484536082475,
0.007672634271099765,
0.0484693877551020... | [
0.2571428571428571,
0.2857142857142857
] | [
[
0.11428571428571428,
0.05714285714285714,
0.14285714285714285
],
[
0.05714285714285714,
0,
0.11428571428571428,
0,
0,
0.05714285714285714,
0.08571428571428572,
0.02857142857142857,
0,
0
]
] | [
0.7758008241653442,
0.6730386018753052
] | [
[
0.8132511377334595,
0.5283694267272949,
0.717425525188446
],
[
0.6582636833190918,
0.11145412921905518,
0.6198104619979858,
0.2864108681678772,
0.16872768104076385,
0.3747154474258423,
0.5022908449172974,
0.3586897850036621,
0.09418541938066483,
0.0033658659... | [
86,
141
] | [
64,
96
] | [
0,
1
] | [
[
0.6693316102027893,
0.45851242542266846,
0.534175455570221
],
[
0.5529388189315796,
-0.005865417420864105,
0.5161870121955872,
0.23882006108760834,
0.04249563813209534,
0.2926987111568451,
0.37396565079689026,
0.0901302844285965,
0.008912453427910805,
0.0110... |
3 | Daviau showed the equivalence of matrix Dirac theory, formulated within a spinor bundle (S_x C _x^4 ), to a Clifford algebraic formulation within space Clifford algebra (C ( R ^3 , ) M _ 2 ( C ) P ) Pauli algebra (matrices) ≃ H ⨁ H ≃ biquaternions. || We will show, that Daviau's map θ: ( : C ^4 M _ 2 ( C ) ) is an iso... | A further genuine and important approach to the spinor-tensor transition was developed starting probably with Crawford by P. Lounesto, cite and references there. He investigated the question, how a spinor field can be reconstructed from known tensor densities. The major characterization is derived, using Fierz-Kofink i... | [
0.5441624365482234,
0.7224137931034482
] | [
[
0.3605442176870748,
0.10934744268077601,
0.24640287769784175,
0.12137681159420288,
0.2900355871886121,
0.2459312839059674,
0.22603978300180838
],
[
0.23550724637681153,
0.21480144404332124,
0.1811594202898551,
0.13586956521739135,
0.03804347826086962
]
] | [
0.04081632653061224,
0.061224489795918366
] | [
[
0.02040816326530612,
0,
0,
0,
0,
0.02040816326530612,
0
],
[
0.04081632653061224,
0,
0.02040816326530612,
0.02040816326530612,
0
]
] | [
0.5187935829162598,
0.5672430992126465
] | [
[
0.5115899443626404,
0.25310394167900085,
0.3918050527572632,
0.24276450276374817,
0.20362788438796997,
0.16041980683803558,
0.4088420271873474
],
[
0.5791518092155457,
0.44832736253738403,
0.3981732428073883,
0.459346204996109,
0.06967862695455551
]
] | [
250,
97
] | [
173,
67
] | [
1,
0
] | [
[
0.2799929678440094,
0.09117621928453445,
0.1752517819404602,
0.1655755639076233,
0.18602663278579712,
0.06904388219118118,
0.29196876287460327
],
[
0.38790711760520935,
0.2616589367389679,
0.287050724029541,
0.3672257959842682,
0.08152025192975998
]
] |
4 | We present an open architecture for just-in-time code generation and dynamic code optimization || that is flexible, customizable, and extensible. || While previous research has primarily investigated functional aspects of such a system, || architectural aspects have so far remained unexplored. || In this paper, we ... | Pioneering research in dynamic runtime optimization was done by Hansen cite who first described a fully automated system for runtime code optimization. His system was similar in structure to our system---it was composed of a loader, a profiler, and an optimizer---but used profiling data only to decide when to optimize ... | [
0.7078651685393258,
0.5895249695493301
] | [
[
0.18399999999999994,
0.09199999999999997,
0.1696606786427146,
0.10599999999999998,
0.11823647294589179,
0.25450901803607207,
0.0701402805611222,
0.10999999999999999
],
[
0.018036072144288595,
0.29821073558648115,
0.0662650602409639,
0.312625250501002,
0.1536... | [
0.1568627450980392,
0.1568627450980392
] | [
[
0.09803921568627451,
0,
0.0392156862745098,
0,
0,
0.0196078431372549,
0,
0.0392156862745098
],
[
0,
0.0392156862745098,
0,
0.058823529411764705,
0,
0,
0.0196078431372549,
0,
0,
0,
0,
0.0196078431372549,
0.0196078431372549
]
... | [
0.6659261584281921,
0.7062844038009644
] | [
[
0.6061096787452698,
0.21647915244102478,
0.2634720206260681,
0.12211757898330688,
0.048167914152145386,
0.5503664612770081,
0.06739530712366104,
0.4834830164909363
],
[
0.0916876494884491,
0.7113732099533081,
0.21944554150104523,
0.5497969388961792,
0.258472... | [
94,
141
] | [
78,
123
] | [
0,
1
] | [
[
0.5523353815078735,
0.10486423224210739,
0.3429716229438782,
0.18692825734615326,
0.05540617182850838,
0.32343459129333496,
-0.023151060566306114,
0.3376576900482178
],
[
0.09555026888847351,
0.5432278513908386,
0.20780156552791595,
0.48754027485847473,
0.32... |
5 | We present an open architecture for just-in-time code generation and dynamic code optimization || that is flexible, customizable, and extensible. || While previous research has primarily investigated functional aspects of such a system, || architectural aspects have so far remained unexplored. || In this paper, we ... | Hansen's work was followed by several other projects that have investigated the benefits of runtime optimization: the Smalltalk cite and SELF cite systems that focused on the benefits of dynamic optimization in an object-oriented environment; Morph'', a project developed at Harvard University cite ; and the system desc... | [
0.6923076923076923,
0.5205580029368576,
0.7706214689265537,
0.7820823244552058,
0.756786102062975,
0.45723472668810294,
0.7122969837587007
] | [
[
0.1268758526603001,
0.06557377049180324,
0.11869031377899042,
0.07513661202185795,
0.08049113233287852,
0.17486338797814205,
0.04774897680763979,
0.07786885245901642
],
[
0.1891156462585034,
0.13915416098226463,
0.17847411444141692,
0.016371077762619368,
0.1... | [
0.1111111111111111,
0.09523809523809523,
0.1111111111111111,
0.12698412698412698,
0.15873015873015872,
0.07936507936507936,
0.07936507936507936
] | [
[
0.047619047619047616,
0,
0.031746031746031744,
0,
0.015873015873015872,
0.015873015873015872,
0.015873015873015872,
0.015873015873015872
],
[
0.015873015873015872,
0,
0.015873015873015872,
0,
0.015873015873015872,
0.015873015873015872,
0,
0.01587... | [
0.5794440507888794,
0.5565978288650513,
0.547382116317749,
0.6079511046409607,
0.6134850382804871,
0.5837857723236084,
0.5602011680603027
] | [
[
0.5132670402526855,
0.2622978091239929,
0.2513757050037384,
0.08726518601179123,
0.16505569219589233,
0.511439323425293,
0.1712501347064972,
0.4398925304412842
],
[
0.41037434339523315,
0.44863176345825195,
0.44583240151405334,
0.09889715909957886,
0.2085587... | [
94,
245,
162,
135,
151,
249,
128
] | [
78,
181,
127,
106,
117,
202,
104
] | [
6,
3,
2,
4,
5,
0,
1
] | [
[
0.4008745849132538,
0.14908172190189362,
0.310675710439682,
0.1708189845085144,
0.15440964698791504,
0.2771468758583069,
0.06157710403203964,
0.2619559168815613
],
[
0.1631777137517929,
0.24894432723522186,
0.20693835616111755,
-0.01930222660303116,
0.034697... |
6 | We present an open architecture for just-in-time code generation and dynamic code optimization || that is flexible, customizable, and extensible. || While previous research has primarily investigated functional aspects of such a system, || architectural aspects have so far remained unexplored. || In this paper, we ... | Common to the above-mentioned work is that the main focus has always been on functional aspects, that is how to profile and which optimizations to perform. Related to this is research on how to boost application performance by combining profiling data and code optimizations at compile time (not at runtime), including w... | [
0.7142857142857143,
0.44256756756756754,
0.7152,
0.45934959349593496,
0.36030341340075855,
0.2922606924643585,
0.4619124797406807,
0.7089452603471295
] | [
[
0.1617391304347826,
0.07986111111111116,
0.14930555555555558,
0.0939130434782609,
0.1026086956521739,
0.22299651567944245,
0.060869565217391286,
0.0993031358885017
],
[
0.08145580589254764,
0.09059233449477355,
0.045217391304347876,
0.10627177700348434,
0.13... | [
0.09433962264150944,
0.018867924528301886,
0.018867924528301886,
0.09433962264150944,
0.20754716981132076,
0.09433962264150944,
0.16981132075471697,
0.05660377358490566
] | [
[
0.03773584905660377,
0,
0.05660377358490566,
0.018867924528301886,
0,
0.018867924528301886,
0,
0.018867924528301886
],
[
0,
0,
0,
0,
0.018867924528301886
],
[
0,
0,
0,
0,
0,
0.018867924528301886,
0
],
[
0,
0.056603... | [
0.6035846471786499,
0.6171159744262695,
0.5314871668815613,
0.520596444606781,
0.6758003234863281,
0.6592647433280945,
0.6709005832672119,
0.6459319591522217
] | [
[
0.5330889821052551,
0.20218104124069214,
0.1782512068748474,
0.1149609163403511,
0.15528354048728943,
0.5303856730461121,
0.17516517639160156,
0.41008538007736206
],
[
0.503793478012085,
0.3968767523765564,
0.46338433027267456,
0.23981255292892456,
0.4626492... | [
94,
62,
84,
239,
282,
389,
223,
131
] | [
78,
47,
66,
164,
229,
312,
189,
105
] | [
6,
5,
7,
4,
0,
2,
1,
3
] | [
[
0.29940441250801086,
0.062253616750240326,
0.37362995743751526,
0.20561152696609497,
0.14596138894557953,
0.37579718232154846,
0.11582697927951813,
0.1967012882232666
],
[
0.17653940618038177,
0.13831299543380737,
0.19410540163516998,
0.16797982156276703,
0.... |
7 | Scripting languages are becoming more and more important as a tool for software development, || as they provide great flexibility for rapid prototyping and for configuring componentware applications. || In this paper we present LuaJava, a scripting tool for Java. || LuaJava adopts Lua, a dynamically typed interprete... | For Tcl cite two integration solutions exist: the TclBlend binding cite and the Jacl implementation cite . TclBlend is a binding between Java and Tcl, which, as LuaJava, allows Java objects to be manipulated by scripts. Some operations, such as access to fields and static method invocations, require specific functions.... | [
0.5212464589235127,
0.49473684210526314,
0.5062413314840499
] | [
[
0.23575129533678751,
0.2570694087403599,
0.15544041450777202,
0.21705426356589141,
0.227390180878553,
0.21188630490956073,
0.12207792207792212,
0.31105398457583555
],
[
0.19948186528497414,
0.13178294573643412,
0.3178294573643411,
0.1968911917098446,
0.13506... | [
0.1794871794871795,
0.1282051282051282,
0
] | [
[
0,
0,
0.05128205128205128,
0.02564102564102564,
0.05128205128205128,
0.02564102564102564,
0.02564102564102564,
0.05128205128205128
],
[
0,
0.05128205128205128,
0.05128205128205128,
0.05128205128205128,
0,
0.02564102564102564,
0.05128205128205128,
... | [
0.4720911383628845,
0.7105615139007568,
0.110362209379673
] | [
[
0.3511177599430084,
0.17400041222572327,
0.5144195556640625,
0.4217624366283417,
0.2723795175552368,
0.2753255367279053,
0.2243269681930542,
0.4383246600627899
],
[
0.04380815476179123,
0.6699641942977905,
0.5460913181304932,
0.4852758049964905,
0.1110436171... | [
129,
138,
129
] | [
104,
118,
110
] | [
1,
0,
2
] | [
[
0.1421658843755722,
0.05202705040574074,
0.37852534651756287,
0.31611761450767517,
0.18860258162021637,
0.2500930428504944,
0.15426334738731384,
0.2938656806945801
],
[
0.003989111632108688,
0.52544766664505,
0.3325265944004059,
0.38029372692108154,
0.112673... |
8 | The thesis begins with an introduction to M-theory (at a graduate student's level), || starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. || The following chapter treats, in a self-contained way, of general classical p-brane solutions. || Black and extremal bran... | The main objective of this chapter was to study the basic @math -branes that one encounters in M-theory, and to treat them in a unified way. The need to unify the treatment is inspired by U-duality cite cite cite , which states that from the effective lower dimensional space-time point of view, all the charges carried ... | [
0.6010309278350515,
0.6780185758513931,
0.6456692913385826
] | [
[
0.13545150501672243,
0.17391304347826086,
0.15939597315436238,
0.14381270903010035,
0.07705192629815749,
0.15577889447236182,
0.26845637583892623,
0.1792294807370184,
0.10570469798657722,
0.13621794871794868
],
[
0.1419031719532554,
0.5320197044334976,
0.102... | [
0.2222222222222222,
0.07407407407407407,
0.18518518518518517
] | [
[
0.037037037037037035,
0.07407407407407407,
0.05555555555555555,
0.018518518518518517,
0.018518518518518517,
0,
0.037037037037037035,
0.037037037037037035,
0,
0
],
[
0.037037037037037035,
0.05555555555555555,
0
],
[
0.09259259259259259,
0,
0.0... | [
0.7462854981422424,
0.6486759185791016,
0.6557039618492126
] | [
[
0.5222201943397522,
0.7129155397415161,
0.6658409237861633,
0.659412145614624,
0.5492200255393982,
0.48166927695274353,
0.721688985824585,
0.49463605880737305,
0.03904484212398529,
0.15964655578136444
],
[
0.5642260313034058,
0.6284943222999573,
0.4389822483... | [
210,
101,
203
] | [
140,
76,
148
] | [
0,
2,
1
] | [
[
0.3329661190509796,
0.4410310387611389,
0.410077303647995,
0.39080148935317993,
0.37624475359916687,
0.2813071310520172,
0.5393905639648438,
0.30594730377197266,
0.027690917253494263,
0.11921826004981995
],
[
0.45656251907348633,
0.4617060720920563,
0.386937... |
9 | The thesis begins with an introduction to M-theory (at a graduate student's level), || starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. || The following chapter treats, in a self-contained way, of general classical p-brane solutions. || Black and extremal bran... | It should also not be underestimated that the derivation of the intersecting solutions presented in this chapter is a thorough consistency check of all the dualities acting on, and between, the supergravity theories. It is straightforward to check that, starting from one definite configuration, all its dual configurati... | [
0.793040293040293,
0.18873517786561267,
0.7838345864661654
] | [
[
0.08183632734530932,
0.10589410589410586,
0.09381237524950103,
0.08682634730538918,
0.04590818363273452,
0.09390609390609395,
0.1586826347305389,
0.10678642714570863,
0.06293706293706292,
0.08260447035957241
],
[
0.1357779980178394,
0.054835493519441725
],
[... | [
0.17073170731707318,
0.04878048780487805,
0.14634146341463414
] | [
[
0,
0.036585365853658534,
0.024390243902439025,
0,
0.012195121951219513,
0,
0.024390243902439025,
0.06097560975609756,
0.012195121951219513,
0
],
[
0.024390243902439025,
0.024390243902439025
],
[
0.07317073170731707,
0.012195121951219513,
0.012195... | [
0.7619843482971191,
0.7244013547897339,
0.7211571335792542
] | [
[
0.2934378385543823,
0.44881007075309753,
0.5002186894416809,
0.6275324821472168,
0.51051265001297,
0.5212224721908569,
0.5760408043861389,
0.6149861216545105,
0.18477550148963928,
0.17416085302829742
],
[
0.7015923261642456,
0.2874619960784912
],
[
0.697... | [
210,
48,
185
] | [
140,
32,
123
] | [
0,
1,
2
] | [
[
0.018840568140149117,
0.13338631391525269,
0.3040580749511719,
0.37186703085899353,
0.38705870509147644,
0.42484918236732483,
0.26006463170051575,
0.43746137619018555,
0.20963948965072632,
0.19209478795528412
],
[
0.5001313090324402,
0.3272324800491333
],
[
... |
10 | The thesis begins with an introduction to M-theory (at a graduate student's level), || starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. || The following chapter treats, in a self-contained way, of general classical p-brane solutions. || Black and extremal bran... | Some of the intersection rules intersectionrules point towards an M-theory interpretation in terms of open branes ending on other branes. This idea will be elaborated and made firmer in the next chapter. It suffices to say here that this interpretation is consistent with dualities if we postulate that the open characte... | [
0.812093023255814,
0.3242971887550201,
0.5821782178217821
] | [
[
0.08375378405650857,
0.10696266397578202,
0.09586276488395562,
0.08660624370594161,
0.0463709677419355,
0.09485368314833498,
0.16145307769929362,
0.10674723061430014,
0.06357214934409683,
0.08875739644970415
],
[
0.09869083585095673,
0.14818548387096775,
0.0... | [
0.16455696202531644,
0.0379746835443038,
0.05063291139240506
] | [
[
0.012658227848101266,
0.0379746835443038,
0.012658227848101266,
0.012658227848101266,
0.012658227848101266,
0.02531645569620253,
0.05063291139240506,
0.012658227848101266,
0.012658227848101266,
0
],
[
0.02531645569620253,
0,
0.012658227848101266
],
[
... | [
0.6222581267356873,
0.5658794045448303,
0.47870609164237976
] | [
[
0.3458790183067322,
0.5639028549194336,
0.478924423456192,
0.45872658491134644,
0.5525272488594055,
0.5391730070114136,
0.5648177862167358,
0.4128648042678833,
0.00867794081568718,
0.1156792938709259
],
[
0.5988987684249878,
0.318397581577301,
0.430443108081... | [
210,
66,
129
] | [
140,
52,
96
] | [
0,
1,
2
] | [
[
0.1751389056444168,
0.28046008944511414,
0.3301042318344116,
0.3054591119289398,
0.4617917239665985,
0.4710979759693146,
0.47854816913604736,
0.3116356134414673,
0.013047471642494202,
0.10693192481994629
],
[
0.5096442699432373,
0.2011411041021347,
0.2849408... |
11 | The thesis begins with an introduction to M-theory (at a graduate student's level), || starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. || The following chapter treats, in a self-contained way, of general classical p-brane solutions. || Black and extremal bran... | In this chapter we presented only extremal configurations of intersecting branes. The natural further step to take would be to consider also non-extremal configurations of intersecting branes. There is however a subtlety: there could be a difference between intersections of non-extremal branes, and non-extremal interse... | [
0.734208367514356,
0.7781456953642384,
0.6254266211604096
] | [
[
0.06988783433994827,
0.08973252804141496,
0.08210890233362145,
0.07512953367875652,
0.03972366148531947,
0.08124459809853068,
0.13828867761452035,
0.09240069084628666,
0.05445116681071738,
0.07172995780590719
],
[
0.24273504273504276,
0.193103448275862,
0.13... | [
0.17894736842105263,
0.07368421052631578,
0.09473684210526316
] | [
[
0,
0,
0.031578947368421054,
0.021052631578947368,
0.042105263157894736,
0.010526315789473684,
0.031578947368421054,
0.031578947368421054,
0.010526315789473684,
0
],
[
0.031578947368421054,
0.031578947368421054,
0.021052631578947368,
0.010526315789473684,... | [
0.7498741149902344,
0.6855584979057312,
0.7592977285385132
] | [
[
0.253105103969574,
0.5691191554069519,
0.6457334160804749,
0.7084749341011047,
0.6995320916175842,
0.4954586625099182,
0.7179870009422302,
0.6042250394821167,
0.11645707488059998,
0.254635214805603
],
[
0.6148883104324341,
0.6310979127883911,
0.5938521623611... | [
210,
231,
154
] | [
140,
162,
124
] | [
2,
1,
0
] | [
[
0.02470935881137848,
0.18083754181861877,
0.4623584747314453,
0.5161012411117554,
0.732811689376831,
0.320079505443573,
0.42885321378707886,
0.5060276389122009,
0.10928523540496826,
0.10515256226062775
],
[
0.5637874603271484,
0.4247402846813202,
0.386002719... |
12 | The thesis begins with an introduction to M-theory (at a graduate student's level), || starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. || The following chapter treats, in a self-contained way, of general classical p-brane solutions. || Black and extremal bran... | Supergravity solutions corresponding to D-branes at angles were found in cite cite cite . The resulting solutions contain as expected off-diagonal elements in the internal metric, and the derivation from the equations of motion as in cite is accordingly rather intricated. | [
0.28288100208768263,
0.556237218813906,
0.318075117370892
] | [
[
0.28623188405797095,
0.3745454545454545,
0.33941605839416056,
0.3090909090909091,
0.16849816849816857,
0.33576642335766427,
0.5373665480427047,
0.371841155234657,
0.2316176470588236,
0.24595469255663427
],
[
0.46402877697841727,
0.24264705882352944,
0.036764... | [
0.08,
0.12,
0.2
] | [
[
0,
0.04,
0.04,
0,
0,
0,
0,
0,
0,
0
],
[
0.04,
0,
0.04,
0,
0,
0,
0.08,
0,
0,
0
],
[
0,
0.04,
0.08,
0,
0.04,
0.08,
0,
0,
0,
0
]
] | [
0.6435760259628296,
0.512468695640564,
0.6613504886627197
] | [
[
0.22204917669296265,
0.4985524117946625,
0.637930691242218,
0.5974542498588562,
0.5030159950256348,
0.4333754777908325,
0.6006500124931335,
0.5689452290534973,
-0.016006341204047203,
0.13171997666358948
],
[
0.3263211250305176,
0.20301692187786102,
0.0118366... | [
210,
103,
176
] | [
140,
69,
128
] | [
2,
1,
0
] | [
[
0.01772308349609375,
0.17114929854869843,
0.41160908341407776,
0.3463483154773712,
0.36521291732788086,
0.2944045662879944,
0.3423649072647095,
0.39737775921821594,
-0.047291893512010574,
0.12580007314682007
],
[
0.38497427105903625,
0.07916385680437088,
0.0... |
13 | The thesis begins with an introduction to M-theory (at a graduate student's level), || starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. || The following chapter treats, in a self-contained way, of general classical p-brane solutions. || Black and extremal bran... | Other half-supersymmetric bound states of this class are the @math multiplets of 1- and 5-branes in type IIB theory cite cite , or more precisely the configurations F1 @math D1 and NS5 @math D5, also called @math 1- and 5-branes, where @math is the NSNS charge and @math the RR charge of the compound. The classical solu... | [
0.43248730964466997,
0.7065420560747664,
0.7381818181818182
] | [
[
0.16993464052287588,
0.225382932166302,
0.20925110132158586,
0.1859956236323851,
0.09868421052631582,
0.20175438596491224,
0.3464912280701755,
0.2297592997811816,
0.13876651982378851,
0.18867924528301883
],
[
0.35064935064935066,
0.4112554112554112,
0.197802... | [
0.0625,
0.08333333333333333,
0.10416666666666667
] | [
[
0,
0.020833333333333332,
0.041666666666666664,
0,
0,
0,
0,
0,
0,
0
],
[
0.0625,
0.041666666666666664,
0
],
[
0.0625,
0.020833333333333332,
0,
0.041666666666666664
]
] | [
0.5174385905265808,
0.6649659872055054,
0.590602695941925
] | [
[
0.1944146454334259,
0.37478160858154297,
0.5072208046913147,
0.5711650252342224,
0.4184556305408478,
0.4793771505355835,
0.45006585121154785,
0.39780718088150024,
0.011217053048312664,
0.26844465732574463
],
[
0.6249993443489075,
0.6308974623680115,
0.195557... | [
210,
95,
107
] | [
140,
70,
79
] | [
1,
2,
0
] | [
[
0.06682483851909637,
0.19452640414237976,
0.30482015013694763,
0.3173901438713074,
0.2010222226381302,
0.36233851313591003,
0.1962539702653885,
0.18267932534217834,
0.043966639786958694,
0.2605813145637512
],
[
0.3575347363948822,
0.5322281718254089,
0.10693... |
14 | The thesis begins with an introduction to M-theory (at a graduate student's level), || starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. || The following chapter treats, in a self-contained way, of general classical p-brane solutions. || Black and extremal bran... | In cite (inspired by cite ) a solution is presented which corresponds to a M5 @math M5=1 configuration, which follows the harmonic superposition rule, provided however that the harmonic functions depend on the respective relative transverse space (i.e. they are functions of two different spaces). The problem now is tha... | [
0.6612305411415864,
0.16447876447876442,
0.7067137809187279
] | [
[
0.06381322957198443,
0.08255451713395634,
0.07398753894081,
0.067704280155642,
0.03579766536964979,
0.07320872274143297,
0.12461059190031154,
0.08326848249027241,
0.0490654205607477,
0.06967840735068909
],
[
0.06449106449106445,
0.10061919504643968
],
[
... | [
0.07339449541284404,
0.03669724770642202,
0.11926605504587157
] | [
[
0,
0.009174311926605505,
0.01834862385321101,
0,
0.009174311926605505,
0.009174311926605505,
0.009174311926605505,
0.009174311926605505,
0.009174311926605505,
0
],
[
0.01834862385321101,
0.027522935779816515
],
[
0.009174311926605505,
0,
0,
0... | [
0.6507720351219177,
0.5561565160751343,
0.7154815196990967
] | [
[
0.2631303071975708,
0.4450681507587433,
0.6152648329734802,
0.5421507358551025,
0.5996966361999512,
0.6382057666778564,
0.5524318218231201,
0.5197296738624573,
-0.012372445315122604,
0.2008189558982849
],
[
0.5703558921813965,
0.4934103190898895
],
[
0.5... | [
210,
53,
268
] | [
140,
31,
181
] | [
2,
0,
1
] | [
[
0.025645943358540535,
0.09023252129554749,
0.40839746594429016,
0.26975011825561523,
0.45919713377952576,
0.4987315237522125,
0.2962430715560913,
0.36190927028656006,
-0.05512222275137901,
0.1712658852338791
],
[
0.34609121084213257,
0.33523958921432495
],
[... |
15 | In this work, we are interested in the applications of big data in the telecommunication domain, || analysing two weeks of datasets provided by Telecom Italia for Milan and Trento. || Our objective is to identify hotspots which are places with very high communication traffic relative to others || and measure the int... | Nowadays, telecom companies use widely big data in order to mine the behaviour of their customers, improve the quality of service that they provide and reduce the customers' churn. Towards this direction, demographic statistics, network deployments and call detail records (CDRs) are key factors that need to be carefull... | [
0.5246671887235709,
0.7856272838002436
] | [
[
0.13929618768328444,
0.11566617862371886,
0.15959004392386533,
0.06167400881057272,
0.06011730205278587,
0.1204111600587372,
0.055718475073313734,
0.07624633431085048,
0.10132158590308371,
0.12023460410557185,
0.06304985337243396,
0.10572687224669608,
0.21961932... | [
0.10144927536231885,
0.17391304347826086
] | [
[
0.028985507246376812,
0.014492753623188406,
0.014492753623188406,
0,
0,
0,
0,
0.014492753623188406,
0.014492753623188406,
0,
0,
0.028985507246376812,
0.014492753623188406,
0,
0,
0
],
[
0.043478260869565216,
0,
0.014492753623188406,
... | [
0.522842526435852,
0.7793545126914978
] | [
[
0.6303797960281372,
0.519902229309082,
0.5216126441955566,
0.08423028886318207,
0.30378812551498413,
0.24043160676956177,
0.2384737730026245,
0.04194355010986328,
0.032112181186676025,
0.0740995928645134,
0.19604261219501495,
0.07020297646522522,
0.2582160532474... | [
242,
148
] | [
205,
116
] | [
1,
0
] | [
[
0.5945949554443359,
0.3620038628578186,
0.4012625813484192,
0.13465499877929688,
0.17174479365348816,
0.20456726849079132,
0.21587321162223816,
-0.0566190704703331,
0.07242251932621002,
-0.007992273196578026,
0.2435929775238037,
0.11676503717899323,
0.1312662959... |
16 | In this work, we are interested in the applications of big data in the telecommunication domain, || analysing two weeks of datasets provided by Telecom Italia for Milan and Trento. || Our objective is to identify hotspots which are places with very high communication traffic relative to others || and measure the int... | For example, the authors in cite analyse an heterogeneous cellular network which consists of different types of nodes, such as macrocells and microcells. Nowadays a popular model is the one from Wyner cite , but it fails to fully capture a real heterogeneous cellular network because it is simplistic. Another approach i... | [
0.6950943396226416,
0.7361111111111112,
0.6539491298527443
] | [
[
0.09683995922528033,
0.08044806517311609,
0.11099796334012224,
0.042857142857142816,
0.042857142857142816,
0.08256880733944949,
0.03979591836734697,
0.05300713557594294,
0.07040816326530608,
0.08358817533129459,
0.04489795918367345,
0.07346938775510203,
0.153924... | [
0.05747126436781609,
0.10344827586206896,
0.3563218390804598
] | [
[
0,
0,
0,
0,
0.022988505747126436,
0,
0,
0.011494252873563218,
0,
0.022988505747126436,
0,
0,
0,
0,
0,
0
],
[
0.05747126436781609,
0.011494252873563218,
0.022988505747126436,
0.04597701149425287,
0,
0,
0.034482758620689... | [
0.5442765951156616,
0.5432925820350647,
0.8375298976898193
] | [
[
0.3687151372432709,
0.43577855825424194,
0.5446147322654724,
0.17608270049095154,
0.5205645561218262,
0.3195810914039612,
0.3396673798561096,
0.08235450088977814,
0.043504782021045685,
0.16333915293216705,
0.22098764777183533,
0.046368829905986786,
0.43456554412... | [
242,
239,
273
] | [
205,
197,
220
] | [
2,
0,
1
] | [
[
0.2378406524658203,
0.1999204158782959,
0.38205045461654663,
0.1511184722185135,
0.44672098755836487,
0.41430771350860596,
0.2735941410064697,
0.026944944635033607,
0.15406455099582672,
0.1904936283826828,
0.14244335889816284,
0.11727029085159302,
0.260715156793... |
17 | Learning the dynamics of robots from data can help achieve more accurate tracking controllers, || or aid their navigation algorithms. || However, when the actual dynamics of the robots change due to external conditions, || on-line adaptation of their models is required || to maintain high fidelity performance. || ... | In the field of marine robotics, cite used locally weighted projection regression to compensate the mismatch between the physics based model and the sensors reading of the AUV Nessie. Auto-regressive networks augmented with a genetic algorithm as a gating network were used to identify the model of a simulated AUV with ... | [
0.8425026968716289,
0.8491155046826223,
0.7004555808656037,
0.80990099009901
] | [
[
0.10776361529548084,
0.04176334106728541,
0.09375,
0.05330243337195828,
0.04524361948955913,
0.09048723897911837,
0.030162412993039456,
0.09164733178654294,
0.05793742757821552,
0.1218097447795824,
0.06836616454229438,
0.07995365005793742,
0.0892236384704519
]... | [
0.19767441860465115,
0.1744186046511628,
0.12790697674418605,
0.22093023255813954
] | [
[
0.023255813953488372,
0,
0.023255813953488372,
0.023255813953488372,
0,
0.06976744186046512,
0,
0.046511627906976744,
0.023255813953488372,
0.023255813953488372,
0,
0.023255813953488372,
0.03488372093023256
],
[
0.046511627906976744,
0.03488372093023... | [
0.6257053017616272,
0.7329071164131165,
0.6970952749252319,
0.680012047290802
] | [
[
0.5974081158638,
0.20110785961151123,
0.40232136845588684,
0.4935544431209564,
-0.02008151262998581,
0.5841720104217529,
0.08708071708679199,
0.31910520792007446,
0.3465988039970398,
0.35544344782829285,
0.24029472470283508,
0.21297110617160797,
0.42992156744003... | [
143,
169,
122,
190
] | [
123,
137,
94,
135
] | [
1,
3,
2,
0
] | [
[
0.34214356541633606,
0.27548298239707947,
0.4083103537559509,
0.4856884479522705,
0.06460747122764587,
0.4700508117675781,
0.18363501131534576,
0.35803133249282837,
0.26353919506073,
0.2754231095314026,
0.09619691967964172,
0.22517375648021698,
0.379141926765441... |
18 | In this work, we present a camera geopositioning system based on matching a query image against a database with panoramic images. || For matching, our system uses memory vectors aggregated from global image descriptors || based on convolutional features || to facilitate fast searching in the database. || To speed u... | In recent years, research regarding image matching has been influenced by the developments in other areas of computer vision. Deep learning architectures have been developed both for image matching cite cite cite and geopositioning cite cite cite with attractive results. | [
0.2872340425531915,
0.19650655021834063,
0.29690949227373076,
0.5066413662239089,
0.48381294964028776,
0.19852941176470584,
0.2107728337236534
] | [
[
0.4545454545454546,
0.3125,
0.11808118081180807,
0.1697416974169742,
0.08088235294117652,
0.11439114391143912,
0.2140221402214022,
0.18681318681318682,
0.1439114391143912,
0.3655913978494624,
0.3745454545454545,
0.353356890459364,
0.19485294117647056,
0.2087... | [
0.18518518518518517,
0.2962962962962963,
0.14814814814814814,
0.037037037037037035,
0.1111111111111111,
0.18518518518518517,
0.1111111111111111
] | [
[
0.1111111111111111,
0.07407407407407407,
0,
0,
0,
0,
0,
0.037037037037037035,
0,
0.1111111111111111,
0,
0,
0,
0.037037037037037035
],
[
0.07407407407407407,
0.07407407407407407,
0,
0,
0.037037037037037035,
0.037037037037037035,
... | [
0.589413046836853,
0.6908408403396606,
0.6944023370742798,
0.578749418258667,
0.5115437507629395,
0.5878198146820068,
0.641411304473877
] | [
[
0.49793875217437744,
0.5609030723571777,
0.44350945949554443,
0.0914338082075119,
0.1133405789732933,
0.11642377078533173,
0.23148001730442047,
0.32735806703567505,
0.12263135612010956,
0.5121151208877563,
0.3444923162460327,
0.18954534828662872,
0.3458735942840... | [
175,
261,
172,
102,
107,
247,
241
] | [
142,
205,
128,
79,
70,
187,
186
] | [
1,
2,
4,
0,
3,
6,
5
] | [
[
0.4864371418952942,
0.4455481767654419,
0.06690023839473724,
0.1293693333864212,
0.23371393978595734,
0.2360048145055771,
0.25094813108444214,
0.2640542984008789,
0.06245237588882446,
0.30790001153945923,
0.14559614658355713,
0.07929623126983643,
0.2462467253208... |
19 | In this work, we present a camera geopositioning system based on matching a query image against a database with panoramic images. || For matching, our system uses memory vectors aggregated from global image descriptors || based on convolutional features || to facilitate fast searching in the database. || To speed u... | Convolutional features extracted from the deep layers of CNNs have shown great utility when addressing image matching and retrieval problems. Babenko cite employ pre-trained networks to generate descriptors based on high-level convolutional features used for retrieving images of various landmarks. Sunderhauf cite solve... | [
0.559748427672956,
0.6646191646191646,
0.39882697947214074,
0.4506224066390041
] | [
[
0.2304900181488203,
0.15454545454545454,
0.05828779599271405,
0.08378870673952643,
0.041894353369763215,
0.0564663023679417,
0.10564663023679421,
0.09255898366606174,
0.07103825136612019,
0.18953068592057765,
0.19272727272727275,
0.19314079422382668,
0.096363636... | [
0.16363636363636364,
0.2545454545454545,
0.32727272727272727,
0.21818181818181817
] | [
[
0.07272727272727272,
0.05454545454545454,
0.05454545454545454,
0,
0,
0.03636363636363636,
0,
0.01818181818181818,
0.01818181818181818,
0.03636363636363636,
0,
0,
0.01818181818181818,
0
],
[
0.01818181818181818,
0.07272727272727272,
0.01818181... | [
0.5278245806694031,
0.7141088247299194,
0.7134289741516113,
0.6404628157615662
] | [
[
0.38353514671325684,
0.5030924081802368,
0.5122249126434326,
0.12013763189315796,
0.13611078262329102,
0.11265207827091217,
0.12888270616531372,
0.24273304641246796,
0.06866151094436646,
0.40489906072616577,
0.33648455142974854,
0.1925225555896759,
0.22988338768... | [
175,
142,
247,
201
] | [
142,
119,
187,
161
] | [
2,
1,
3,
0
] | [
[
0.34846818447113037,
0.3800358474254608,
0.41066256165504456,
0.2505161762237549,
0.2912994623184204,
0.26709607243537903,
0.2511938810348511,
0.1547691524028778,
0.048498645424842834,
0.28116536140441895,
0.22604677081108093,
0.13922181725502014,
0.259430527687... |
20 | In this work, we present a camera geopositioning system based on matching a query image against a database with panoramic images. || For matching, our system uses memory vectors aggregated from global image descriptors || based on convolutional features || to facilitate fast searching in the database. || To speed u... | The problem of geopositioning can be seen as a dedicated branch of image retrieval. In this case, the objective is to compute extrinsic parameters (or coordinates) of a camera capturing the query image, based on the matched georeferenced images from a database. There exist many different algorithms and neural network a... | [
0.7870182555780934,
0.6471291866028708,
0.8372340425531914,
0.5901520637219406
] | [
[
0.1567436208991495,
0.10315533980582525,
0.03888213851761846,
0.05589307411907651,
0.027946537059538312,
0.0376670716889429,
0.07047387606318345,
0.06439854191980554,
0.047387606318347486,
0.128174123337364,
0.13001215066828675,
0.13196125907990308,
0.0643203883... | [
0.1875,
0.1875,
0.3125,
0.2875
] | [
[
0.1,
0.025,
0.025,
0.0125,
0,
0.0125,
0.0125,
0.025,
0.0125,
0.05,
0,
0,
0.0125,
0.0125
],
[
0.075,
0.1,
0,
0.0125,
0,
0,
0
],
[
0.0375,
0.0375,
0.075,
0.0375,
0.025,
0.0125,
0.075,
0,
0... | [
0.7673503160476685,
0.7079731225967407,
0.7390493750572205,
0.7673423290252686
] | [
[
0.7286572456359863,
0.47895723581314087,
0.38792192935943604,
0.1498604267835617,
0.13885186612606049,
0.15733486413955688,
0.2761419415473938,
0.4466458559036255,
0.11638671159744263,
0.5827487707138062,
0.5502038598060608,
0.13174737989902496,
0.42634040117263... | [
175,
107,
172,
261
] | [
142,
70,
128,
205
] | [
3,
0,
1,
2
] | [
[
0.7174666523933411,
0.38023456931114197,
0.10236208885908127,
0.185517817735672,
0.20041313767433167,
0.30618640780448914,
0.3441908061504364,
0.451171875,
0.03790490701794624,
0.3998850882053375,
0.3203740119934082,
0.03409404307603836,
0.3683340847492218,
... |
21 | In this work, we present a camera geopositioning system based on matching a query image against a database with panoramic images. || For matching, our system uses memory vectors aggregated from global image descriptors || based on convolutional features || to facilitate fast searching in the database. || To speed u... | A common factor of the above work is that it either requires the combination of aerial and street-level images for geopositioning, or extensive training on specific datasets. Both cases and their solutions cannot be easily generalized. In our approach, we utilize georeferenced, street-level panoramic images only and a ... | [
0.6687565308254964,
0.7522255192878339
] | [
[
0.19604863221884505,
0.1306990881458967,
0.04863221884498481,
0.06990881458966569,
0.03495440729483279,
0.04711246200607899,
0.08814589665653494,
0.078907435508346,
0.059270516717325195,
0.16012084592145015,
0.15909090909090906,
0.15963855421686746,
0.0820668693... | [
0.19642857142857142,
0.125
] | [
[
0.14285714285714285,
0.03571428571428571,
0,
0.017857142857142856,
0,
0,
0,
0.03571428571428571,
0,
0.05357142857142857,
0.017857142857142856,
0,
0.03571428571428571,
0.017857142857142856
],
[
0,
0.03571428571428571,
0.03571428571428571,
... | [
0.7592605948448181,
0.7142931818962097
] | [
[
0.6878299713134766,
0.4026314616203308,
0.3954468071460724,
0.17302106320858002,
0.1599997878074646,
0.13990530371665955,
0.24223574995994568,
0.4927869439125061,
0.07729718089103699,
0.5304431915283203,
0.4903891980648041,
0.1624453067779541,
0.4164577722549438... | [
175,
102
] | [
142,
79
] | [
1,
0
] | [
[
0.6767460703849792,
0.3328646421432495,
0.07429870963096619,
0.2426278293132782,
0.2613239586353302,
0.230227530002594,
0.3384816348552704,
0.4664528965950012,
0.05502966791391373,
0.38232913613319397,
0.3423803150653839,
0.13051092624664307,
0.32153263688087463... |
22 | In this paper, we study the relationship between two crucial properties in linear dynamical networks of diffusively coupled agents, that is controllability and robustness to noise and structural changes in the network. || In particular, for any given network size and diameter, we identify networks that are maximally r... | Kirchhoff index or equivalently effective graph resistance based measures have been instrumental in quantifying the effect of noise on the expected steady state dispersion in linear dynamical networks, particularly in the ones with the consensus dynamics, for instance see cite cite cite . Furthermore, limits on robustn... | [
0.7182835820895522,
0.7186346863468634,
0.7814938684503902,
0.7634730538922155,
0.6021423106350421,
0.6002460024600246,
0.7916219119226638
] | [
[
0.26732673267326734,
0.12639405204460963,
0.07196029776674939,
0.06567534076827752,
0.11662531017369726,
0.2007434944237918,
0.04962779156327546,
0.049566294919454745,
0.07816377171215882,
0.24907063197026025
],
[
0.22867737948084055,
0.23172242874845106,
0.... | [
0.20512820512820512,
0.08974358974358974,
0.14102564102564102,
0.0641025641025641,
0.08974358974358974,
0.10256410256410256,
0.0641025641025641
] | [
[
0.07692307692307693,
0.02564102564102564,
0,
0,
0.01282051282051282,
0.02564102564102564,
0.02564102564102564,
0.02564102564102564,
0.02564102564102564,
0.05128205128205128
],
[
0.05128205128205128,
0.05128205128205128,
0.02564102564102564,
0.02564102564... | [
0.7571372985839844,
0.546007513999939,
0.6214141845703125,
0.6679699420928955,
0.7286028265953064,
0.5780796408653259,
0.5293563604354858
] | [
[
0.6470224261283875,
0.6838899850845337,
0.30443164706230164,
0.18680164217948914,
0.45121991634368896,
0.49164098501205444,
0.3445455729961395,
0.33531102538108826,
0.6377825736999512,
0.6415871381759644
],
[
0.4572732448577881,
0.46896862983703613,
0.345277... | [
186,
203,
146,
166,
233,
95,
162
] | [
148,
171,
128,
141,
204,
74,
130
] | [
0,
2,
4,
5,
6,
1,
3
] | [
[
0.43549102544784546,
0.4943247437477112,
0.2912488579750061,
0.1699669063091278,
0.39159202575683594,
0.34458231925964355,
0.35767269134521484,
0.5240542888641357,
0.5165266394615173,
0.421882301568985
],
[
0.41648805141448975,
0.4544859528541565,
0.36043512... |
23 | In this paper, we study the relationship between two crucial properties in linear dynamical networks of diffusively coupled agents, that is controllability and robustness to noise and structural changes in the network. || In particular, for any given network size and diameter, we identify networks that are maximally r... | To quantify controllability, several approaches have been adapted, including determining the minimum number of inputs (leader nodes) needed to (structurally or strong structurally) control a network, determining the worst-case control energy, metrics based on controllability Gramians, and so on (e.g., see cite cite ). ... | [
0.8336206896551724,
0.6945910290237467,
0.8193069306930693,
0.7171806167400882,
0.5295186194368756,
0.6666666666666666
] | [
[
0.19871794871794868,
0.09340659340659341,
0.05316223648029328,
0.048534798534798584,
0.08615948670944085,
0.1494042163153071,
0.036663611365719495,
0.03568161024702654,
0.057745187901008244,
0.18406593406593408
],
[
0.14194139194139188,
0.03483043079743353,
... | [
0.2222222222222222,
0.21212121212121213,
0.13131313131313133,
0.12121212121212122,
0.10101010101010101,
0.12121212121212122
] | [
[
0.050505050505050504,
0.010101010101010102,
0.030303030303030304,
0.030303030303030304,
0.020202020202020204,
0.04040404040404041,
0.020202020202020204,
0.010101010101010102,
0.030303030303030304,
0.09090909090909091
],
[
0.04040404040404041,
0.01010101010101010... | [
0.7602936625480652,
0.686680257320404,
0.6499032974243164,
0.7830582857131958,
0.7260733246803284,
0.7514276504516602
] | [
[
0.5875591039657593,
0.6170656085014343,
0.4459225535392761,
0.31583407521247864,
0.5888681411743164,
0.6835775375366211,
0.2925102710723877,
0.18807834386825562,
0.5601820349693298,
0.8313611745834351
],
[
0.6669940948486328,
0.3810737729072571,
0.2770315408... | [
186,
275,
201,
164,
116,
138
] | [
148,
233,
161,
131,
83,
104
] | [
1,
3,
4,
0,
5,
2
] | [
[
0.4756646752357483,
0.44850093126296997,
0.5349036455154419,
0.3572414815425873,
0.528343677520752,
0.6431859731674194,
0.27172866463661194,
0.2391117811203003,
0.4046218693256378,
0.7344465851783752
],
[
0.5687435269355774,
0.3405786454677582,
0.07433291524... |
24 | In this paper, we study the relationship between two crucial properties in linear dynamical networks of diffusively coupled agents, that is controllability and robustness to noise and structural changes in the network. || In particular, for any given network size and diameter, we identify networks that are maximally r... | Very recently in cite , trade-off between controllability and fragility in complex networks is investigated. Fragility measures the smallest perturbation in edge weights to make the network unstable. Authors in cite show that networks that require small control energy, as measured by the eigen values of the controllabi... | [
0.8094861660079051,
0.8415492957746479
] | [
[
0.1739824421388667,
0.08220271348762964,
0.04628890662410212,
0.04226475279106856,
0.07501995211492418,
0.13008778930566645,
0.03192338387869109,
0.03189792663476876,
0.05027932960893855,
0.16028708133971292
],
[
0.09177972865123707,
0.01995211492418192,
0.0... | [
0.34513274336283184,
0.20353982300884957
] | [
[
0.07964601769911504,
0.04424778761061947,
0.02654867256637168,
0.017699115044247787,
0.04424778761061947,
0.07964601769911504,
0.017699115044247787,
0.02654867256637168,
0.04424778761061947,
0.061946902654867256
],
[
0.017699115044247787,
0,
0.00884955752212... | [
0.7849414944648743,
0.6240592002868652
] | [
[
0.6198768615722656,
0.7605693340301514,
0.42428654432296753,
0.2270067185163498,
0.5580320358276367,
0.6871967315673828,
0.3541855216026306,
0.304742693901062,
0.5743498206138611,
0.7549498677253723
],
[
0.375779390335083,
0.0545344352722168,
0.2348213940858... | [
186,
242
] | [
148,
194
] | [
0,
1
] | [
[
0.5331597924232483,
0.48549747467041016,
0.47069451212882996,
0.14840297400951385,
0.43973320722579956,
0.4866505265235901,
0.3622463047504425,
0.26114267110824585,
0.41163596510887146,
0.6175264716148376
],
[
0.34771284461021423,
0.12497449666261673,
0.2364... |
25 | Effective problem solving among multiple agents requires a better understanding of the role of communication in collaboration. || In this paper we show that there are communicative strategies that greatly improve the performance of resource-bounded agents, but that these strategies are highly sensitive to the task req... | Design-World is also based on the method used in Carletta's JAM simulation for the Edinburgh Map-Task cite . JAM is based on the Map-Task Dialogue corpus, where the goal of the task is for the planning agent, the instructor, to instruct the reactive agent, the instructee, how to get from one place to another on the map... | [
0.7293064876957495,
0.7691466083150985
] | [
[
0.14688601645123378,
0.29694835680751175,
0.34837962962962965
],
[
0.03638497652582162,
0.07529411764705884,
0.0505882352941176,
0.1598119858989424,
0.06352941176470583,
0.15070093457943923,
0.06352941176470583,
0.010588235294117676,
0.07647058823529407,
0.0... | [
0.13513513513513514,
0.08108108108108109
] | [
[
0.013513513513513514,
0.08108108108108109,
0.08108108108108109
],
[
0,
0,
0,
0.013513513513513514,
0.013513513513513514,
0.013513513513513514,
0.02702702702702703,
0,
0.04054054054054054,
0,
0,
0.013513513513513514
]
] | [
0.6196957230567932,
0.6308673024177551
] | [
[
0.5748270153999329,
0.5333546996116638,
0.5884549617767334
],
[
0.041927944868803024,
0.2399168312549591,
0.1529102623462677,
0.4761239290237427,
0.23611752688884735,
0.512051522731781,
0.10365024209022522,
0.10480824112892151,
0.44965386390686035,
0.2042092... | [
122,
135
] | [
96,
119
] | [
0,
1
] | [
[
0.3426278829574585,
0.3562297224998474,
0.5691072344779968
],
[
-0.016670962795615196,
0.26357126235961914,
0.023051291704177856,
0.30140623450279236,
0.09698884934186935,
0.28498488664627075,
0.25710153579711914,
0.08285161852836609,
0.44056427478790283,
0.... |
26 | The aim of the Alma project is the design of a strongly typed constraint programming language that combines the advantages of logic and imperative programming. || The first stage of the project was the design and implementation of Alma-0, a small programming language that provides a support for declarative programming... | We concentrate here on the related work involving addition of constraints to imperative languages. For an overview of related work pertaining to the language we refer the reader to cite . | [
0.21637426900584789,
0.2281134401972873
] | [
[
0.6320754716981132,
0.683982683982684,
0.4691943127962086,
0.7248908296943232,
0.6811594202898551
],
[
0.30499999999999994,
0.5428571428571428,
0.25396825396825395,
0.3631578947368421,
0.15263157894736845,
0.2551020408163265,
0.263681592039801,
0.53431372549... | [
0.17647058823529413,
0.11764705882352941
] | [
[
0.11764705882352941,
0.11764705882352941,
0,
0.11764705882352941,
0
],
[
0.058823529411764705,
0.058823529411764705,
0,
0,
0,
0,
0,
0.058823529411764705,
0,
0.058823529411764705
]
] | [
0.6586035490036011,
0.4638640582561493
] | [
[
0.7104933261871338,
0.4954066872596741,
0.563439130783081,
0.5594016313552856,
0.6372824311256409
],
[
0.41438546776771545,
0.6636433005332947,
0.4777764081954956,
0.16013558208942413,
0.21933186054229736,
0.19908784329891205,
0.21319237351417542,
0.50904130... | [
153,
147
] | [
133,
119
] | [
1,
0
] | [
[
0.36764514446258545,
0.34091097116470337,
0.27403005957603455,
0.44491106271743774,
0.5290893316268921
],
[
0.27538347244262695,
0.5559284090995789,
0.42554810643196106,
0.08035203814506531,
0.17564363777637482,
0.2563309371471405,
0.28026437759399414,
0.448... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 14