id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.01167 | Dissipative dynamics of an interacting spin system with collective
damping | The competition between Hamiltonian and Lindblad dynamics in quantum systems
give rise to non-equillibrium phenomena with no counter part in conventional
condensed matter physics. In this paper, we investigate this interplay of
dynamics in infinite range Heisenberg model coupled to a non-Markovian bath and
subjected to Lindblad dynamics due to spin flipping at a given site. The spin
model is bosonized via Holstein-Primakoff transformations and is shown to be
valid for narrow range of parameters in the thermodynamic limit. Using
Schwinger-Keldysh technique, we derive mean field solution of the model and
observe that the system breaks $\mathcal{Z}_2$-symmetry at the transition
point. We calculate effective temperature that has linear dependence on the
effective system-bath coupling, and is independent of the dissipation rate and
cutoff frequency of the bath spectral density. Furthermore, we study the
fluctuations over mean field and show that the dissipative spectrum is modified
by ${\rm O}(\frac{1}{N})$ correction term which results change in various
physically measurable quantities.
| quant-ph cond-mat.stat-mech | the competition between hamiltonian and lindblad dynamics in quantum systems give rise to nonequillibrium phenomena with no counter part in conventional condensed matter physics in this paper we investigate this interplay of dynamics in infinite range heisenberg model coupled to a nonmarkovian bath and subjected to lindblad dynamics due to spin flipping at a given site the spin model is bosonized via holsteinprimakoff transformations and is shown to be valid for narrow range of parameters in the thermodynamic limit using schwingerkeldysh technique we derive mean field solution of the model and observe that the system breaks mathcalz_2symmetry at the transition point we calculate effective temperature that has linear dependence on the effective systembath coupling and is independent of the dissipation rate and cutoff frequency of the bath spectral density furthermore we study the fluctuations over mean field and show that the dissipative spectrum is modified by rm ofrac1n correction term which results change in various physically measurable quantities | [['the', 'competition', 'between', 'hamiltonian', 'and', 'lindblad', 'dynamics', 'in', 'quantum', 'systems', 'give', 'rise', 'to', 'nonequillibrium', 'phenomena', 'with', 'no', 'counter', 'part', 'in', 'conventional', 'condensed', 'matter', 'physics', 'in', 'this', 'paper', 'we', 'investigate', 'this', 'interplay', 'of', 'dynamics', 'in', 'infinite', 'range', 'heisenberg', 'model', 'coupled', 'to', 'a', 'nonmarkovian', 'bath', 'and', 'subjected', 'to', 'lindblad', 'dynamics', 'due', 'to', 'spin', 'flipping', 'at', 'a', 'given', 'site', 'the', 'spin', 'model', 'is', 'bosonized', 'via', 'holsteinprimakoff', 'transformations', 'and', 'is', 'shown', 'to', 'be', 'valid', 'for', 'narrow', 'range', 'of', 'parameters', 'in', 'the', 'thermodynamic', 'limit', 'using', 'schwingerkeldysh', 'technique', 'we', 'derive', 'mean', 'field', 'solution', 'of', 'the', 'model', 'and', 'observe', 'that', 'the', 'system', 'breaks', 'mathcalz_2symmetry', 'at', 'the', 'transition', 'point', 'we', 'calculate', 'effective', 'temperature', 'that', 'has', 'linear', 'dependence', 'on', 'the', 'effective', 'systembath', 'coupling', 'and', 'is', 'independent', 'of', 'the', 'dissipation', 'rate', 'and', 'cutoff', 'frequency', 'of', 'the', 'bath', 'spectral', 'density', 'furthermore', 'we', 'study', 'the', 'fluctuations', 'over', 'mean', 'field', 'and', 'show', 'that', 'the', 'dissipative', 'spectrum', 'is', 'modified', 'by', 'rm', 'ofrac1n', 'correction', 'term', 'which', 'results', 'change', 'in', 'various', 'physically', 'measurable', 'quantities']] | [-0.14647304335428152, 0.17922389418610438, -0.09644727341557859, 0.06218899260749625, -0.020242407801561058, -0.13637031583934073, 0.011213514405884039, 0.33063819072547423, -0.2765319297063479, -0.2877944385644737, 0.040301284583724416, -0.27154369302283804, -0.11789313762650416, 0.1750270867346531, 0.013770788703351074, 0.0045056038915778805, 0.0049471953486323736, 0.04489360352723035, -0.07758337622701196, -0.16447167813030492, 0.29849695061647874, 0.04997619818213876, 0.259610728025555, 0.08831638367520349, 0.1297764111707687, 0.01899646695222777, 0.05746390945485728, -0.0028099509276402223, -0.16737580916522313, 0.017470658391975105, 0.21559857284193443, 0.001536244498652919, 0.21629556956397708, -0.4157182113475101, -0.22874257430748623, 0.08012477531702893, 0.13242286121899818, 0.16015817386552003, -0.017328894208481976, -0.2607664240607221, -0.0014975452617665005, -0.20772854353829173, -0.13494184612708796, -0.10587848466079516, 0.04292744949347322, -0.01795792621323115, -0.2744456099488648, 0.13950658310909167, 0.07398282697981899, 0.06163685385205087, -0.0514833328023458, -0.039301922143686115, 0.006672176832754379, 0.09389685567136213, 0.03549395308491396, 0.02484307642640534, 0.1657094720834095, -0.1280482602880256, -0.07231721117985761, 0.3639278285335868, -0.1548753698077646, -0.19886590993613196, 0.1879949743895062, -0.1628845759198829, -0.09395422006269122, 0.11979871639792042, 0.1513748835671432, 0.07772244462612898, -0.1965211738089313, 0.134249067764839, 0.014442182486360762, 0.17329161167593382, 0.010242814963363158, 0.07176902431291736, 0.21101253566919428, 0.13286425228450138, 0.05473265144677394, 0.16962624245225363, -0.05801142469807795, -0.17827284507524627, -0.30218904263749247, -0.0995734325761367, -0.19509631423220322, 0.07349609332396441, -0.07401578538766751, -0.1346207139247978, 0.4033979284962651, 0.20382330615286995, 0.16953193881715037, 0.032015132284011386, 0.2280126278508146, 0.1995680636732252, 0.04654080563990079, 0.06222592066724304, 0.2478301004227844, 0.1857234740720255, 0.077694285415546, -0.3234769845066984, -0.008746518588856242, 0.05772450871641042] |
1,803.01168 | Magnetic wire as stress controlled micro-rheometer for cytoplasm
viscosity measurements | We review here different methods to measure the bulk viscosity of complex
fluids using micron-sized magnetic wires. The wires are characterized by length
of a few microns and diameter of a few hundreds of nanometers. We first draw
analogies between cone-and-plate rheometry and wire-based microrheology. In
particular we highlight that magnetic wires can be operated as
stress-controlled rheometers for two types of testing, the creep-recovery and
steady shear experiments. In the context of biophysical applications, the
cytoplasm of different cell lines including fibroblasts, epithelial and tumor
cells is studied. It reveals that the interior of living cells can be described
as a viscoelastic liquid with a static viscosity comprised between 10 and 100
Pas. We extend the previous approaches and show that the proposed technique can
also provide time resolved viscosity data, which for cells display strong
temporal fluctuations. The present work demonstrates the high potential of the
magnetic wires for quantitative rheometry in confined espaces.
| cond-mat.soft | we review here different methods to measure the bulk viscosity of complex fluids using micronsized magnetic wires the wires are characterized by length of a few microns and diameter of a few hundreds of nanometers we first draw analogies between coneandplate rheometry and wirebased microrheology in particular we highlight that magnetic wires can be operated as stresscontrolled rheometers for two types of testing the creeprecovery and steady shear experiments in the context of biophysical applications the cytoplasm of different cell lines including fibroblasts epithelial and tumor cells is studied it reveals that the interior of living cells can be described as a viscoelastic liquid with a static viscosity comprised between 10 and 100 pas we extend the previous approaches and show that the proposed technique can also provide time resolved viscosity data which for cells display strong temporal fluctuations the present work demonstrates the high potential of the magnetic wires for quantitative rheometry in confined espaces | [['we', 'review', 'here', 'different', 'methods', 'to', 'measure', 'the', 'bulk', 'viscosity', 'of', 'complex', 'fluids', 'using', 'micronsized', 'magnetic', 'wires', 'the', 'wires', 'are', 'characterized', 'by', 'length', 'of', 'a', 'few', 'microns', 'and', 'diameter', 'of', 'a', 'few', 'hundreds', 'of', 'nanometers', 'we', 'first', 'draw', 'analogies', 'between', 'coneandplate', 'rheometry', 'and', 'wirebased', 'microrheology', 'in', 'particular', 'we', 'highlight', 'that', 'magnetic', 'wires', 'can', 'be', 'operated', 'as', 'stresscontrolled', 'rheometers', 'for', 'two', 'types', 'of', 'testing', 'the', 'creeprecovery', 'and', 'steady', 'shear', 'experiments', 'in', 'the', 'context', 'of', 'biophysical', 'applications', 'the', 'cytoplasm', 'of', 'different', 'cell', 'lines', 'including', 'fibroblasts', 'epithelial', 'and', 'tumor', 'cells', 'is', 'studied', 'it', 'reveals', 'that', 'the', 'interior', 'of', 'living', 'cells', 'can', 'be', 'described', 'as', 'a', 'viscoelastic', 'liquid', 'with', 'a', 'static', 'viscosity', 'comprised', 'between', '10', 'and', '100', 'pas', 'we', 'extend', 'the', 'previous', 'approaches', 'and', 'show', 'that', 'the', 'proposed', 'technique', 'can', 'also', 'provide', 'time', 'resolved', 'viscosity', 'data', 'which', 'for', 'cells', 'display', 'strong', 'temporal', 'fluctuations', 'the', 'present', 'work', 'demonstrates', 'the', 'high', 'potential', 'of', 'the', 'magnetic', 'wires', 'for', 'quantitative', 'rheometry', 'in', 'confined', 'espaces']] | [-0.11354169543483295, 0.16890050266654447, -0.03615091285125042, -0.007892165693472354, -0.00434930939734794, -0.1438879492537429, 0.005698552402557256, 0.3856601049550451, -0.24419692345896366, -0.30364061773826295, 0.05778267485379146, -0.2633986292788998, -0.16213152835067982, 0.21364689963901093, -0.04435690044724302, 0.03348667639044997, 0.02543163940516444, -0.049832107882628825, -0.019181030967350427, -0.18154190475709187, 0.2384107748631579, -0.0019631088608338568, 0.296665794419077, 0.0757217317534527, 0.10696308444871996, -0.05828831783937625, 0.006921365125797307, 0.1172608094325719, -0.19328051517065128, 0.08695403626785637, 0.23940920032626495, 0.02846080086265619, 0.23889742147189397, -0.5198251002539809, -0.26070537792447096, 0.04506220572735541, 0.15787820464398605, 0.09468766721786381, -0.026918381398830276, -0.24382703953709167, 0.07458334443463872, -0.12090618419759454, -0.10243751752512673, -0.08954436188109983, 0.00725521283218255, 0.07329845800081668, -0.21764763396752712, 0.13126368347524803, 0.031980655003840536, 0.10801111749158455, -0.09440191358981583, -0.0905859889014839, -0.0014471620894395388, 0.14145460318869504, 0.037112052574789584, -0.007091939850793913, 0.21935734350102928, -0.11285968223259821, -0.10398186295209691, 0.333743142707345, -0.05026161671654942, -0.166428291631373, 0.25052177221872485, -0.16970728456418818, -0.07486864770702922, 0.12579171450731033, 0.16242177728921747, 0.1258324932420622, -0.145398343143125, 0.006538973933950332, -0.053591699291689276, 0.18135700598418808, 0.11865565523606701, 0.016782340851839248, 0.2135653147751537, 0.254223388086897, -0.023297095886216715, 0.13852280644641723, -0.15806046926613468, -0.040441861731382325, -0.23627444547123444, -0.2019927634839685, -0.15719893750233147, 0.03048316635436211, -0.10078414015786108, -0.16875168607713512, 0.36448309698757025, 0.12034857879953985, 0.17344222454733263, 0.029853585657502454, 0.25715853962808466, -0.016586085587429505, 0.07887607368637617, 0.008194179008476054, 0.26562012187264955, 0.1548334602736689, 0.14870867354329675, -0.2218296099633265, 0.02913836848277312, 0.018871259887535602] |
1,803.01169 | Peculiarities of superconducting properties of thin
superconductor-normal metal bilayer with large ratio of resistivities | We demonstrate, both theoretically and experimentally, that thin dirty
superconductor-normal metal bilayer with resistivity of normal metal $\rho_N$
much smaller than normal-state resistivity of superconductor $\rho_S$ has
unique superconducting properties. First of all the normal layer provides the
dominant contribution to the diamagnetic response of whole bilayer structure in
wide temperature interval below the critical temperature due to proximity
induced superconductivity. Secondly, the presence of the normal layer may
increase the critical current $I_c$ in several times (the effect is not
connected with enhanced vortex pinning), provides strong temperature dependence
of both $I_c$ and effective magnetic field penetration depth even at
temperatures much below the critical one and leads to the diode effect in
parallel magnetic field. Besides of general interest we believe that the found
results may be useful in construction of different kinds of superconducting
detectors.
| cond-mat.supr-con | we demonstrate both theoretically and experimentally that thin dirty superconductornormal metal bilayer with resistivity of normal metal rho_n much smaller than normalstate resistivity of superconductor rho_s has unique superconducting properties first of all the normal layer provides the dominant contribution to the diamagnetic response of whole bilayer structure in wide temperature interval below the critical temperature due to proximity induced superconductivity secondly the presence of the normal layer may increase the critical current i_c in several times the effect is not connected with enhanced vortex pinning provides strong temperature dependence of both i_c and effective magnetic field penetration depth even at temperatures much below the critical one and leads to the diode effect in parallel magnetic field besides of general interest we believe that the found results may be useful in construction of different kinds of superconducting detectors | [['we', 'demonstrate', 'both', 'theoretically', 'and', 'experimentally', 'that', 'thin', 'dirty', 'superconductornormal', 'metal', 'bilayer', 'with', 'resistivity', 'of', 'normal', 'metal', 'rho_n', 'much', 'smaller', 'than', 'normalstate', 'resistivity', 'of', 'superconductor', 'rho_s', 'has', 'unique', 'superconducting', 'properties', 'first', 'of', 'all', 'the', 'normal', 'layer', 'provides', 'the', 'dominant', 'contribution', 'to', 'the', 'diamagnetic', 'response', 'of', 'whole', 'bilayer', 'structure', 'in', 'wide', 'temperature', 'interval', 'below', 'the', 'critical', 'temperature', 'due', 'to', 'proximity', 'induced', 'superconductivity', 'secondly', 'the', 'presence', 'of', 'the', 'normal', 'layer', 'may', 'increase', 'the', 'critical', 'current', 'i_c', 'in', 'several', 'times', 'the', 'effect', 'is', 'not', 'connected', 'with', 'enhanced', 'vortex', 'pinning', 'provides', 'strong', 'temperature', 'dependence', 'of', 'both', 'i_c', 'and', 'effective', 'magnetic', 'field', 'penetration', 'depth', 'even', 'at', 'temperatures', 'much', 'below', 'the', 'critical', 'one', 'and', 'leads', 'to', 'the', 'diode', 'effect', 'in', 'parallel', 'magnetic', 'field', 'besides', 'of', 'general', 'interest', 'we', 'believe', 'that', 'the', 'found', 'results', 'may', 'be', 'useful', 'in', 'construction', 'of', 'different', 'kinds', 'of', 'superconducting', 'detectors']] | [-0.18129708633447686, 0.2169980343154537, -0.009527579734466322, 0.00469969426015176, -0.06956673395630998, -0.15920823893469313, 0.08241461144939093, 0.3620877660594989, -0.24424768947874723, -0.28422398260875564, -0.004466515945935406, -0.3042796709291313, -0.09436196687739289, 0.24439621552406554, 0.021599917780553948, -0.013810126148029298, -0.0930715155816448, 0.016869529175312273, -0.1221518491047259, -0.21920378685699424, 0.3073721265055887, 0.016924189960422074, 0.406287123489639, 0.12971275776921623, 0.0024077486334557552, -0.04450259160965789, 0.12567166084140216, 0.10184671938000922, -0.15885887890634467, -0.002250561936913679, 0.2565156140084635, -0.10019698764022061, 0.19806016463469173, -0.45483462281687104, -0.19812645219275693, 0.05775096817144557, 0.15035744831033482, 0.10704513332145153, -0.0406792171247155, -0.23080132656015348, 0.09472531610020045, -0.12161567540623355, -0.1256205148149646, -0.060531552644797426, 0.018033642620455637, -0.030171048751546314, -0.22906645795117822, 0.10975454377741857, 0.08515787654787478, 0.09684111422899624, -0.062457252584019865, -0.15589018434579688, -0.0660288351169531, 0.048332444692462465, 0.053727070455088455, 0.07247721421004245, 0.19108511409507153, -0.17038139558491716, -0.016697890921563343, 0.28176344058516883, -0.08283962071689767, -0.05036305426282511, 0.16922310795095089, -0.22437041590793355, -0.014685333345382325, 0.1797978061663014, 0.11032072632182119, 0.06482716788794252, -0.13091707930847854, 0.05234801494457381, -0.009991844940552677, 0.1692174613016887, 0.039593472132000374, 0.09497036098922684, 0.26160862229332543, 0.24726263814322327, 0.05920465173287506, 0.1573528558069813, -0.1487271498983213, -0.024476100909996076, -0.24353988733196605, -0.15990610972938527, -0.16111434744485398, 0.06961976864176508, -0.10450686703520858, -0.22142948767345777, 0.3914613203867676, 0.23242264779358832, 0.18805211725576437, -0.054674742459926914, 0.27871211209212954, 0.13557465004598032, 0.10921232940534642, 0.059793514574108565, 0.25427028067760926, 0.18911405114214058, 0.1367706186999609, -0.2752185427588816, 0.11852319508561514, -0.018595189989908882] |
1,803.0117 | How to interconnect for Massive MIMO Self-Calibration? | In time-division duplexing (TDD) systems, massive multiple-input
multiple-output (MIMO) relies on the channel reciprocity to obtain the downlink
(DL) channel state information (CSI) with the acquired uplink (UL) CSI at the
base station (BS). However, the mismatches in the radio frequency (RF) analog
circuits at different antennas at the BS break the end-to-end UL and DL channel
reciprocity. To restore the channel reciprocity, it is necessary to calibrate
all the antennas at the BS. This paper addresses the interconnection strategy
for the internal self-calibration at the BS where different antennas are
interconnected via hardware transmission lines. Specifically, the paper reveals
the optimality of the star interconnection and the daisy chain interconnection
respectively. From the results, we see the star interconnection is the optimal
interconnection strategy when the BS are given the same number of measurements.
On the other hand, the daisy chain interconnection outperforms the star
interconnection when the same amount of time resources are consumed. Numerical
results corroborate our theoretical analyses.
| eess.SP | in timedivision duplexing tdd systems massive multipleinput multipleoutput mimo relies on the channel reciprocity to obtain the downlink dl channel state information csi with the acquired uplink ul csi at the base station bs however the mismatches in the radio frequency rf analog circuits at different antennas at the bs break the endtoend ul and dl channel reciprocity to restore the channel reciprocity it is necessary to calibrate all the antennas at the bs this paper addresses the interconnection strategy for the internal selfcalibration at the bs where different antennas are interconnected via hardware transmission lines specifically the paper reveals the optimality of the star interconnection and the daisy chain interconnection respectively from the results we see the star interconnection is the optimal interconnection strategy when the bs are given the same number of measurements on the other hand the daisy chain interconnection outperforms the star interconnection when the same amount of time resources are consumed numerical results corroborate our theoretical analyses | [['in', 'timedivision', 'duplexing', 'tdd', 'systems', 'massive', 'multipleinput', 'multipleoutput', 'mimo', 'relies', 'on', 'the', 'channel', 'reciprocity', 'to', 'obtain', 'the', 'downlink', 'dl', 'channel', 'state', 'information', 'csi', 'with', 'the', 'acquired', 'uplink', 'ul', 'csi', 'at', 'the', 'base', 'station', 'bs', 'however', 'the', 'mismatches', 'in', 'the', 'radio', 'frequency', 'rf', 'analog', 'circuits', 'at', 'different', 'antennas', 'at', 'the', 'bs', 'break', 'the', 'endtoend', 'ul', 'and', 'dl', 'channel', 'reciprocity', 'to', 'restore', 'the', 'channel', 'reciprocity', 'it', 'is', 'necessary', 'to', 'calibrate', 'all', 'the', 'antennas', 'at', 'the', 'bs', 'this', 'paper', 'addresses', 'the', 'interconnection', 'strategy', 'for', 'the', 'internal', 'selfcalibration', 'at', 'the', 'bs', 'where', 'different', 'antennas', 'are', 'interconnected', 'via', 'hardware', 'transmission', 'lines', 'specifically', 'the', 'paper', 'reveals', 'the', 'optimality', 'of', 'the', 'star', 'interconnection', 'and', 'the', 'daisy', 'chain', 'interconnection', 'respectively', 'from', 'the', 'results', 'we', 'see', 'the', 'star', 'interconnection', 'is', 'the', 'optimal', 'interconnection', 'strategy', 'when', 'the', 'bs', 'are', 'given', 'the', 'same', 'number', 'of', 'measurements', 'on', 'the', 'other', 'hand', 'the', 'daisy', 'chain', 'interconnection', 'outperforms', 'the', 'star', 'interconnection', 'when', 'the', 'same', 'amount', 'of', 'time', 'resources', 'are', 'consumed', 'numerical', 'results', 'corroborate', 'our', 'theoretical', 'analyses']] | [-0.291684777866819, 0.031955708715098875, 0.024389967648599895, -0.0006368260645238614, -0.1102967449337428, -0.24730978790026756, 0.13324130954745747, 0.37345510975164536, -0.25688954213358184, -0.2655677349534084, 0.10864459510506734, -0.25557613670596, -0.1562488013131107, 0.09558228038130673, -0.06185525354503849, 0.018811862277625886, 0.06844798397893707, 0.059467434124262246, -0.015054808093815536, -0.23817941179372554, 0.30220154970941815, 0.12877165391627285, 0.39078556140309867, -0.03266046793246067, 0.07900339889018164, 0.018437961819955367, -0.052956312118000406, -0.1098651206746042, -0.09268344823202049, 0.03581071954887406, 0.35368982631207246, 0.1915843707967814, 0.21173975243014687, -0.46471045662959415, -0.2101067306968257, 0.04788912904463539, 0.173902508936374, 0.040526604690922445, 0.012051377860817737, -0.26121462132482803, 0.14332126347451574, -0.2323246605947246, -0.016932541033092104, 0.10029017614246702, -0.09894925045757842, 0.06074274505163761, -0.38488393278079636, 0.012673644343230091, -0.027375402651945657, 0.057624605811994384, -0.05061057105122916, -0.14442648267931085, -0.005547211133231075, 0.18124767419642102, 0.0012659862361572407, -0.059726223821700036, 0.10795221621029433, -0.08270838153462305, -0.07572935096542983, 0.3154899109913795, 0.04231323996547288, -0.2153692117627756, 0.1891181439234599, -0.1446524301779537, -0.1010340455931002, 0.12159135020452977, 0.21226669363332568, 0.01255543764255205, -0.1842001809016011, 0.025918912745431573, 0.0029494710364321498, 0.17988479479911657, 0.09697244239304169, 0.15711167192138317, 0.14849678383145573, 0.21118809900212068, 0.13578561330674055, 0.10131437078863526, -0.15435111139977156, -0.11621588632107976, -0.21880171733425446, -0.11446932712077583, -0.23877293264772168, 0.0007246842645223678, -0.1187599706562325, 0.007103399747269757, 0.3363559052900032, 0.09136479107748954, 0.08170471235212905, 0.16130556663308568, 0.43093721846831434, 0.12033659958404225, 0.09535412073572293, 0.1479066030156833, 0.23781764466359703, 0.17491022463497005, 0.19520085456171704, -0.30364947708432827, 0.03820853930162151, -0.04499552399063782] |
1,803.01171 | Global properties of asymptotically de Sitter and Anti de Sitter
spacetimes | In the first part of this work we show a uniqueness result for globally
hyperbolic spacetimes with a spacelike conformal boundary satisfying the vacuum
Einstein equations with positive cosmological constant. Then we present
applications of this result in the contexts of cosmic censorship and the
initial value problem in general relativity. Further extensions of this result
to non-vacuum solutions of the Einstein equations are also studied. On the
other hand, the second half of this thesis deals with spacetimes with timelike
boundary. We first develop the causal theory of such spacetimes and then use it
to prove a quasi-local version of the principle of topological censorship.
| gr-qc math.DG | in the first part of this work we show a uniqueness result for globally hyperbolic spacetimes with a spacelike conformal boundary satisfying the vacuum einstein equations with positive cosmological constant then we present applications of this result in the contexts of cosmic censorship and the initial value problem in general relativity further extensions of this result to nonvacuum solutions of the einstein equations are also studied on the other hand the second half of this thesis deals with spacetimes with timelike boundary we first develop the causal theory of such spacetimes and then use it to prove a quasilocal version of the principle of topological censorship | [['in', 'the', 'first', 'part', 'of', 'this', 'work', 'we', 'show', 'a', 'uniqueness', 'result', 'for', 'globally', 'hyperbolic', 'spacetimes', 'with', 'a', 'spacelike', 'conformal', 'boundary', 'satisfying', 'the', 'vacuum', 'einstein', 'equations', 'with', 'positive', 'cosmological', 'constant', 'then', 'we', 'present', 'applications', 'of', 'this', 'result', 'in', 'the', 'contexts', 'of', 'cosmic', 'censorship', 'and', 'the', 'initial', 'value', 'problem', 'in', 'general', 'relativity', 'further', 'extensions', 'of', 'this', 'result', 'to', 'nonvacuum', 'solutions', 'of', 'the', 'einstein', 'equations', 'are', 'also', 'studied', 'on', 'the', 'other', 'hand', 'the', 'second', 'half', 'of', 'this', 'thesis', 'deals', 'with', 'spacetimes', 'with', 'timelike', 'boundary', 'we', 'first', 'develop', 'the', 'causal', 'theory', 'of', 'such', 'spacetimes', 'and', 'then', 'use', 'it', 'to', 'prove', 'a', 'quasilocal', 'version', 'of', 'the', 'principle', 'of', 'topological', 'censorship']] | [-0.16402957291026019, 0.06526757350613205, -0.08353129023123744, 0.08311893469829745, -0.10938716915277939, -0.11597430035208334, -0.0476476719750109, 0.2661887194021201, -0.21380567691236171, -0.23150337509863642, 0.12064707078553631, -0.2579380241837704, -0.13823453533761906, 0.15801681681834864, -0.0837871993777676, 0.08143245658995409, 0.0462593108608897, 0.05984427330066573, -0.09902475254592609, -0.2865443923949914, 0.4685898420778718, 0.011096799667081181, 0.24840031022574963, 0.07837263862426691, 0.13247257726758999, -0.005630651673407487, -0.01485141343986264, 0.08359625527881226, -0.2054577116604086, 0.11788470806435349, 0.2390308956756204, 0.13910679853266492, 0.2617759452611076, -0.40665824792154553, -0.22810332749460666, 0.09571475102917625, 0.07815604926227539, 0.19231704727967297, -0.05567147351366485, -0.3269958093164946, 0.10597355292565278, -0.15462834503774023, -0.21517965620172755, -0.012365479690005194, -0.016730677902057133, -0.04770914321976169, -0.1945371800014433, 0.11188145806625231, 0.07980444334131086, 0.006327565926355573, -0.16499973601169604, -0.0030738723767429308, 0.024986443267959468, 0.05625689461528552, 0.15300497073100283, 0.015762201647651998, 0.03827952099348998, -0.09812680810233051, -0.1233568481731949, 0.3737127584985124, -0.09399138620334133, -0.2692013712916172, 0.13206941968286937, -0.19619488210103228, -0.18488709248145516, 0.01956610031039366, 0.14024091232128721, 0.21756922418497643, -0.14355899961138108, 0.16313038764077784, -0.04887571939451726, 0.09599372473510229, 0.12665658288213583, 0.014301527007087573, 0.20549388072576444, 0.08464748216002195, 0.11928265346302036, 0.1560693741869401, 0.03151317502433469, -0.08104416692930379, -0.43203006621520473, -0.23160657817981084, -0.12688311618831852, 0.12877834428602583, -0.1288636709639763, -0.2292157173692688, 0.34884725747638784, 0.14864972263356596, 0.131431085958128, 0.11133849859360676, 0.2524194409895056, 0.05988809855859112, -0.0024233033709263182, 0.1136533317577867, 0.2807819122483708, 0.15131747148895883, 0.1655371815464811, -0.17124386161883176, -0.039004703245635305, 0.1220893731630706] |
1,803.01172 | Polyhedral Characterization of Reversible Hinged Dissections | We prove that two polygons $A$ and $B$ have a reversible hinged dissection (a
chain hinged dissection that reverses inside and outside boundaries when
folding between $A$ and $B$) if and only if $A$ and $B$ are two noncrossing
nets of a common polyhedron. Furthermore, monotone reversible hinged
dissections (where all hinges rotate in the same direction when changing from
$A$ to $B$) correspond exactly to noncrossing nets of a common convex
polyhedron. By envelope/parcel magic, it becomes easy to design many hinged
dissections.
| cs.CG math.MG | we prove that two polygons a and b have a reversible hinged dissection a chain hinged dissection that reverses inside and outside boundaries when folding between a and b if and only if a and b are two noncrossing nets of a common polyhedron furthermore monotone reversible hinged dissections where all hinges rotate in the same direction when changing from a to b correspond exactly to noncrossing nets of a common convex polyhedron by envelopeparcel magic it becomes easy to design many hinged dissections | [['we', 'prove', 'that', 'two', 'polygons', 'a', 'and', 'b', 'have', 'a', 'reversible', 'hinged', 'dissection', 'a', 'chain', 'hinged', 'dissection', 'that', 'reverses', 'inside', 'and', 'outside', 'boundaries', 'when', 'folding', 'between', 'a', 'and', 'b', 'if', 'and', 'only', 'if', 'a', 'and', 'b', 'are', 'two', 'noncrossing', 'nets', 'of', 'a', 'common', 'polyhedron', 'furthermore', 'monotone', 'reversible', 'hinged', 'dissections', 'where', 'all', 'hinges', 'rotate', 'in', 'the', 'same', 'direction', 'when', 'changing', 'from', 'a', 'to', 'b', 'correspond', 'exactly', 'to', 'noncrossing', 'nets', 'of', 'a', 'common', 'convex', 'polyhedron', 'by', 'envelopeparcel', 'magic', 'it', 'becomes', 'easy', 'to', 'design', 'many', 'hinged', 'dissections']] | [-0.14448139424918285, 0.1762898219889591, -0.04198572873306203, 0.030309381670352208, -0.12439907930724053, -0.2452888969691044, 0.12016378690948687, 0.4110214883932866, -0.34365907104977644, -0.19693228898637266, 0.09735695292741195, -0.27558736148548413, -0.14392701213820333, 0.14771173705896698, -0.101222198697772, 0.027637519245316464, 0.1007625739348222, 0.010697056707668018, -0.05874847712174776, -0.20863721712705602, 0.2282770713608914, -0.11511770933754294, 0.20688994929014917, 0.01664735038529139, 0.09967538442305592, 0.07575052691601127, 0.08965179523879505, 0.09796796305980308, -0.14041329290895269, 0.10609188446977053, 0.21672055340674987, 0.1013668237439166, 0.25727432319916876, -0.4520502504275506, -0.08724492419152016, 0.14907905928431506, 0.16416372229199272, 0.08273627545056214, 0.005186402052360396, -0.18630239182342606, 0.09086424542635858, -0.08188981164516096, -0.10451375026570027, -0.015678517705570143, 0.11133722860242677, 0.07089994885925069, -0.2456833396264049, -0.03206169328102505, 0.16757762004587665, 0.06830543814877789, 0.017511171911540162, -0.10244564286745939, -0.09154451267053205, 0.09892045422415081, 0.01143543122628008, 0.09855362652318485, 0.09693180949775031, -0.042578237411756835, -0.12574130166546407, 0.3750343740558678, 0.07249555910281073, -0.28421175138778, 0.19848081632797798, -0.16725961311372467, -0.13855149452742863, 0.14640702041292405, 0.09129584520628833, 0.14206852713397827, -0.11412487530986869, 0.08858093345209575, -0.10562462219407401, 0.09870626242811713, 0.19476321443118694, -0.081782868277865, 0.23481112468359341, 0.1114414993137772, 0.13348108218317986, 0.22003963202552265, -0.02055544213178646, -0.11149266632049377, -0.2995869068047368, -0.17002070075776204, -0.15906281809810638, 0.018615465212882643, -0.07827324849880912, -0.2669508380433881, 0.3062366176261959, 0.044276229578224365, 0.2643553267446268, 0.11733443243990102, 0.26142262862658644, -0.04839639751667, 0.10091816109088979, 0.12597893674420305, 0.12518086006685372, 0.1472300516149725, -0.020044446344969862, -0.164880684478747, 0.04742235129037087, 0.11301926540278168] |
1,803.01173 | Lattices of coarse structures | We consider the lattice of coarse structures on a set $X$ and study
metrizable, locally finite and cellular coarse structures on $X$ from the
lattice point of view.
| math.GN | we consider the lattice of coarse structures on a set x and study metrizable locally finite and cellular coarse structures on x from the lattice point of view | [['we', 'consider', 'the', 'lattice', 'of', 'coarse', 'structures', 'on', 'a', 'set', 'x', 'and', 'study', 'metrizable', 'locally', 'finite', 'and', 'cellular', 'coarse', 'structures', 'on', 'x', 'from', 'the', 'lattice', 'point', 'of', 'view']] | [-0.157246629308377, 0.1445989637036941, -0.06653544918767043, 0.02161135877083455, -0.007747135058577571, -0.06470996518951974, 0.16593627285744464, 0.4758423737117222, -0.36984133001949104, -0.09682568761387042, 0.13244412829434232, -0.2458112875797919, -0.13076305110007524, 0.13420865395372467, -0.06380675929332418, -0.017463315278291702, 0.0657683823789869, 0.03464505572005042, -0.10898701740162713, -0.2644938679628207, 0.43904411633099827, -0.03629988102641489, 0.318382736827646, 0.02468242516208972, 0.1854196261265315, 0.01767726006385471, -0.03560241411573121, 0.11726732552051544, -0.1982689097058028, 0.16602123528718948, 0.1852103326735752, 0.03429153372001435, 0.20480782432215555, -0.3979395892737167, -0.28110613527574707, 0.07731697954503554, 0.021303303905629685, 0.02595872325556619, 0.005577376935564514, -0.28561616742185186, 0.1955057867287126, -0.08760421802955014, -0.07311681097572935, -0.08606782442490969, -0.018313148291781545, 0.030062862430765693, -0.1963841909808772, -0.0632561691371458, 0.04153641313314438, 0.15138875995762646, -0.07302151207945176, -0.09878450073301792, -0.1045104689879476, 0.10759304106302027, -0.11083517233990799, 0.07679536635155923, 0.09899915816328887, -0.06565703305282763, -0.08450781154845442, 0.5081249310501984, 0.0010796121122049434, -0.24083772275064672, 0.22409578359552793, -0.2051513528983508, -0.13152997074316122, 0.15419272147119045, 0.22058458224637434, 0.14878980466164649, -0.037596603123737235, 0.23613445540208236, -0.14793765771069697, 0.17460291497263825, 0.021607015947146074, 0.051179387307326706, 0.20210141705216042, 0.2199593181721866, 0.18193315475114755, 0.11895934153082115, -0.042021817760542035, -0.07808111208890166, -0.35209404810198713, -0.11082234872238976, -0.18865462697743038, 0.21240748704544135, -0.09907126413288227, -0.23236669786274433, 0.33297203451261986, 0.06580976134033076, 0.2439434813734676, 0.036321080988273025, 0.15837825129606894, -0.03519007314493398, -0.048885804800582786, 0.03866444568016699, -0.009675977219428335, 0.1207570804482592, 0.002685338874081416, -0.14154422352190263, -0.08782689902000129, 0.24360532127320766] |
1,803.01174 | Irreducible subgroups of simple algebraic groups - a survey | Let $G$ be a simple linear algebraic group over an algebraically closed field
$K$ of characteristic $p \geqslant 0$, let $H$ be a proper closed subgroup of
$G$ and let $V$ be a nontrivial finite dimensional irreducible rational
$KG$-module. We say that $(G,H,V)$ is an irreducible triple if $V$ is
irreducible as a $KH$-module. Determining these triples is a fundamental
problem in the representation theory of algebraic groups, which arises
naturally in the study of the subgroup structure of classical groups. In the
1980s, Seitz and Testerman extended earlier work of Dynkin on connected
subgroups in characteristic zero to all algebraically closed fields. In this
article we will survey recent advances towards a classification of irreducible
triples for all positive dimensional subgroups of simple algebraic groups.
| math.GR math.RT | let g be a simple linear algebraic group over an algebraically closed field k of characteristic p geqslant 0 let h be a proper closed subgroup of g and let v be a nontrivial finite dimensional irreducible rational kgmodule we say that ghv is an irreducible triple if v is irreducible as a khmodule determining these triples is a fundamental problem in the representation theory of algebraic groups which arises naturally in the study of the subgroup structure of classical groups in the 1980s seitz and testerman extended earlier work of dynkin on connected subgroups in characteristic zero to all algebraically closed fields in this article we will survey recent advances towards a classification of irreducible triples for all positive dimensional subgroups of simple algebraic groups | [['let', 'g', 'be', 'a', 'simple', 'linear', 'algebraic', 'group', 'over', 'an', 'algebraically', 'closed', 'field', 'k', 'of', 'characteristic', 'p', 'geqslant', '0', 'let', 'h', 'be', 'a', 'proper', 'closed', 'subgroup', 'of', 'g', 'and', 'let', 'v', 'be', 'a', 'nontrivial', 'finite', 'dimensional', 'irreducible', 'rational', 'kgmodule', 'we', 'say', 'that', 'ghv', 'is', 'an', 'irreducible', 'triple', 'if', 'v', 'is', 'irreducible', 'as', 'a', 'khmodule', 'determining', 'these', 'triples', 'is', 'a', 'fundamental', 'problem', 'in', 'the', 'representation', 'theory', 'of', 'algebraic', 'groups', 'which', 'arises', 'naturally', 'in', 'the', 'study', 'of', 'the', 'subgroup', 'structure', 'of', 'classical', 'groups', 'in', 'the', '1980s', 'seitz', 'and', 'testerman', 'extended', 'earlier', 'work', 'of', 'dynkin', 'on', 'connected', 'subgroups', 'in', 'characteristic', 'zero', 'to', 'all', 'algebraically', 'closed', 'fields', 'in', 'this', 'article', 'we', 'will', 'survey', 'recent', 'advances', 'towards', 'a', 'classification', 'of', 'irreducible', 'triples', 'for', 'all', 'positive', 'dimensional', 'subgroups', 'of', 'simple', 'algebraic', 'groups']] | [-0.23598435747673704, 0.1291889277721537, -0.12495484898450769, -0.010760757360710867, -0.13092193998662488, -0.1442899571968213, -0.0059126629244669205, 0.3423837395403386, -0.33660775835862355, -0.19228471163729582, 0.0490011294919347, -0.24437649340354026, -0.11192695104280516, 0.19644276858288942, -0.1237025050929174, -0.12262693616665071, 0.046074554922135635, 0.1699363157884883, -0.08101326105413988, -0.2897569732278556, 0.3708596013538126, -0.10637784206737129, 0.1829565380079051, 0.00709463023979749, 0.09496621706981272, 0.030284711010088877, 0.0005839974785755787, 0.03983035252895206, -0.14458257886831738, 0.10464592580221564, 0.3839353175005979, 0.058577488305874996, 0.2516912170334734, -0.31787302202382495, -0.1792639532156052, 0.2724244817426162, 0.22162318042671633, -0.02965056440619279, 0.0013849948974518432, -0.26262138313835576, 0.14227207920454915, -0.19227097724889597, -0.17874974262944998, -0.03725217750281214, 0.15933733387011295, -0.04374463064041698, -0.23345878443057974, 0.0021868604623402157, 0.10808272822113293, 0.18134291268633826, -0.044205447825204046, -0.13896910291412726, -0.017610453154211714, 0.07995095619163106, -0.06235241206798939, 0.09819325121832893, 0.03845045352650304, -0.06377782511475426, -0.1313836666836684, 0.3676989824910249, -0.07015537703340496, -0.1749512366211367, 0.1252677501179278, -0.18203667736804438, -0.18328836299146392, 0.14846914304357525, 0.1269641752310452, 0.16121198458685762, -0.04780921383644454, 0.26078187728149166, -0.1578032271197391, 0.03610920867077001, 0.02568853653908249, -0.05722408623449386, 0.16178944600479944, 0.059577609586995095, 0.04749643729467477, 0.10589078269503449, 0.08501550291908816, 0.06558688610629548, -0.3716829876371083, -0.18326901119213462, -0.09478955999171983, 0.2080231432226442, -0.10801008353651952, -0.18500575608581246, 0.4149203345711742, 0.028692988882539794, 0.14439449742961202, 0.08033478686064925, 0.19409334125174654, 0.07469167201022159, 0.029214445006338848, 0.0875272434685261, 0.03585959248067368, 0.2827256894005196, -0.1379804258273604, -0.1610320611332085, -0.04863531046199598, 0.16459371346891635] |
1,803.01175 | Inference on the marginal distribution of clustered data with
informative cluster size | In spite of recent contributions to the literature, informative cluster size
settings are not well known and understood. In this paper, we give a formal
definition of the problem and describe it from different viewpoints. Data
generating mechanisms, parametric and nonparametric models are considered in
light of examples. Our emphasis is on nonparametric and robust approaches to
the inference on the marginal distribution. Descriptive statistics and
parameters of interest are defined as functionals and they are accompanied with
a generally applicable testing procedure. The theory is illustrated with an
example on patients with incomplete spinal cord injuries.
| math.ST stat.TH | in spite of recent contributions to the literature informative cluster size settings are not well known and understood in this paper we give a formal definition of the problem and describe it from different viewpoints data generating mechanisms parametric and nonparametric models are considered in light of examples our emphasis is on nonparametric and robust approaches to the inference on the marginal distribution descriptive statistics and parameters of interest are defined as functionals and they are accompanied with a generally applicable testing procedure the theory is illustrated with an example on patients with incomplete spinal cord injuries | [['in', 'spite', 'of', 'recent', 'contributions', 'to', 'the', 'literature', 'informative', 'cluster', 'size', 'settings', 'are', 'not', 'well', 'known', 'and', 'understood', 'in', 'this', 'paper', 'we', 'give', 'a', 'formal', 'definition', 'of', 'the', 'problem', 'and', 'describe', 'it', 'from', 'different', 'viewpoints', 'data', 'generating', 'mechanisms', 'parametric', 'and', 'nonparametric', 'models', 'are', 'considered', 'in', 'light', 'of', 'examples', 'our', 'emphasis', 'is', 'on', 'nonparametric', 'and', 'robust', 'approaches', 'to', 'the', 'inference', 'on', 'the', 'marginal', 'distribution', 'descriptive', 'statistics', 'and', 'parameters', 'of', 'interest', 'are', 'defined', 'as', 'functionals', 'and', 'they', 'are', 'accompanied', 'with', 'a', 'generally', 'applicable', 'testing', 'procedure', 'the', 'theory', 'is', 'illustrated', 'with', 'an', 'example', 'on', 'patients', 'with', 'incomplete', 'spinal', 'cord', 'injuries']] | [-0.03208075992081353, 0.06722661914899777, -0.07401529655398167, 0.1264177606184247, -0.07506338338914913, -0.12893227763838835, 0.028469581641832886, 0.40851215935629054, -0.21647155083255054, -0.30861304779104964, 0.13719566952624387, -0.27097491221022363, -0.18616632982781253, 0.2500218984799354, -0.1727525679365799, 0.05941554566019589, 0.06217857512655025, 0.029757868176921436, -0.036546223860512456, -0.2696544071035364, 0.30774795145190026, 0.030103156707950475, 0.31187863985902253, 0.014240450696232393, 0.08130139750836551, -0.004591820279097895, -0.11498703996737286, 0.042910221922115334, -0.12173300304392487, 0.1583933453639662, 0.3012708696294363, 0.17562528666992164, 0.2826436822993931, -0.4090368073318422, -0.2262551555861287, 0.07812849463074055, 0.09444422482455284, 0.10983360804540594, -0.031120022982670973, -0.28106886427129435, 0.03724044414966838, -0.15837234032541975, -0.0876273292467267, -0.10614727110093095, -0.013182561347721932, 0.029448051773702976, -0.28405978562809603, 0.1192883946884846, 0.06257924347811081, 0.10258476399653352, -0.04234945567291153, -0.14417154749989816, 0.011382861229706286, 0.11462540107481566, 0.11066151765107955, 0.00011428907398403305, 0.1278802065284366, -0.14444228261949243, -0.12706462848336272, 0.3604919441883241, 0.03544599852601508, -0.23449384605454415, 0.23393847310877183, -0.08481030333211127, -0.15589100973603806, 0.06447792963422451, 0.18379655390132948, 0.14372798453892832, -0.15791575043202982, 0.06930053200135872, -0.005858237775925969, 0.11184961408779946, 0.021600878395418608, 0.012535770164476228, 0.18810201435321078, 0.18457005245937513, -0.004471099906668221, 0.12522583858100408, -0.05195602151738077, -0.10506211732485399, -0.31548425286393805, -0.06460711252923633, -0.17056525941486902, -0.005658632036167696, -0.056974829020057856, -0.2140392936266882, 0.3890139248375733, 0.14337113900014112, 0.19571288346226529, 0.06611697611005343, 0.2884496361324468, 0.10705109295368041, 0.036881097309176145, 0.027936593197362938, 0.1802457596184974, 0.13164933606713397, 0.028225746538643678, -0.11967605860068549, 0.12740740934554873, 0.0013937427897543944] |
1,803.01176 | Path Puzzles: Discrete Tomography with a Path Constraint is Hard | We prove that path puzzles with complete row and column information--or
equivalently, 2D orthogonal discrete tomography with Hamiltonicity
constraint--are strongly NP-complete, ASP-complete, and #P-complete. Along the
way, we newly establish ASP-completeness and #P-completeness for 3-Dimensional
Matching and Numerical 3-Dimensional Matching.
| cs.CG | we prove that path puzzles with complete row and column informationor equivalently 2d orthogonal discrete tomography with hamiltonicity constraintare strongly npcomplete aspcomplete and pcomplete along the way we newly establish aspcompleteness and pcompleteness for 3dimensional matching and numerical 3dimensional matching | [['we', 'prove', 'that', 'path', 'puzzles', 'with', 'complete', 'row', 'and', 'column', 'informationor', 'equivalently', '2d', 'orthogonal', 'discrete', 'tomography', 'with', 'hamiltonicity', 'constraintare', 'strongly', 'npcomplete', 'aspcomplete', 'and', 'pcomplete', 'along', 'the', 'way', 'we', 'newly', 'establish', 'aspcompleteness', 'and', 'pcompleteness', 'for', '3dimensional', 'matching', 'and', 'numerical', '3dimensional', 'matching']] | [-0.06210576377909731, 0.08247008713314662, 0.030306836646805342, 0.03187271016272339, -0.12640695399730592, -0.2020132292338924, 0.052845359251305866, 0.4806911135847504, -0.33667545866321874, -0.28070916733830364, 0.15741089391647964, -0.2423104396769525, -0.173298854179479, 0.09680324307063946, -0.08374094640886462, 0.11783744656556361, 0.11273282079177128, -0.016419973916600685, -0.09744192762426226, -0.22545512901568734, 0.2732430320812037, -0.048758216957385477, 0.2477953684944156, 0.060746921323919414, 0.09222954743214555, 0.09675044701057109, -0.048876746029064465, 0.09744163612658913, -0.2081359583403478, 0.10182491464641046, 0.2600017928996602, 0.1758862799474013, 0.09947687967655224, -0.4545012261416461, -0.11368416622281075, 0.16914955720406127, 0.16326353522772724, 0.06665729039122124, -0.07124434870265021, -0.21286728117312934, 0.11266284646164323, -0.06894583944734689, -0.13797719678463968, -0.036818776002808196, 0.04382274220886363, 0.005238990727308634, -0.2561234226450324, 0.0691025582821788, 0.07779109815286624, 0.024840754406476342, -0.03705536999513168, -0.14680296864763304, -0.0014955388331735456, 0.05762042072475762, -0.10259173196312543, 0.049099787226500546, -0.04691251556112154, -0.10731044509196402, -0.22115210272573135, 0.4290758892893791, -0.02241650998995111, -0.18908368939584172, 0.127740085225653, -0.14367668184678298, -0.1954556806264697, 0.12055390139387266, 0.061566565387152335, 0.1371760477966352, -0.03159687342122197, 0.09058454626466374, -0.20598068105912692, 0.12082557893685393, 0.13149709478524085, -0.01678250027140854, 0.14492989718427132, 0.08913229014472784, 0.17114465711386623, 0.1960425331206942, -0.018570388053745234, -0.041579225981557694, -0.22397245980195096, -0.1839682843435455, -0.1288559237444723, 0.040155334612102925, -0.15286602468601102, -0.19340243507680055, 0.34663706534617655, 0.07692239334731288, 0.12929836821717186, 0.18144641620283192, 0.30957979839798566, 0.09971451326399236, -0.04849087364650709, 0.19181745766183814, 0.0992069426747794, 0.23501337737449118, -0.05139266781357897, -0.1869877958166841, 0.002547585933997824, 0.19993959566125194] |
1,803.01177 | Remarks on basic calculus in hyperboloidal foliation | In this article we will give a systematic summary on the basic calculus in
the hyperboloidal foliation context, especially the estimates based on
commutators.
| math.AP | in this article we will give a systematic summary on the basic calculus in the hyperboloidal foliation context especially the estimates based on commutators | [['in', 'this', 'article', 'we', 'will', 'give', 'a', 'systematic', 'summary', 'on', 'the', 'basic', 'calculus', 'in', 'the', 'hyperboloidal', 'foliation', 'context', 'especially', 'the', 'estimates', 'based', 'on', 'commutators']] | [-0.1481252236602207, 0.0418651516471679, -0.12240246470901184, 0.11757070879199698, -0.15209586127699973, -0.009020404249895364, 0.0006655151955783367, 0.32438181651135284, -0.2364531954905639, -0.21099247956105197, 0.1695662879598482, -0.25437411402041715, -0.14604670034411052, 0.20828964305110276, -0.24424482761727026, 0.008875620861848196, 0.1404216947654883, 0.08330394629350242, -0.1350097432344531, -0.22574416470403472, 0.43219674145802855, 0.07559687927520524, 0.22999063758955648, 0.07568110106512904, 0.057727178325876594, 0.07716723347160344, -0.1427329349486778, 0.004415504013498624, -0.25482801204392064, 0.20232975473239398, 0.22272597967336574, 0.08708349743392318, 0.31410034264748293, -0.4624819220043719, -0.1229584207952333, 0.07268052784881245, 0.15497477121728784, 0.10962647506554883, -0.08966898503907335, -0.31450603921742487, 0.036369801576559745, -0.10555192137447496, -0.10477155870103161, -0.10237663759229083, -0.02142101778493573, 0.005656966241076589, -0.15026303759077564, 0.03435248815609763, 0.0683736599360903, 0.11658234564432253, -0.08037762347764026, -0.11984172901914765, 0.10495373265196879, -0.006407155694129567, 0.0179190069490384, 0.04265905029994125, 0.10733778229526554, -0.012553090996031338, -0.09358508667598169, 0.3100877031198858, -0.08108858050157626, -0.30230610941847164, 0.07253475177761477, -0.19329181307693943, -0.263608173506024, -0.03105315271144112, 0.21622367308009416, 0.18473851525535187, -0.19289632669339576, 0.13840196821062514, -0.01651954579089458, 0.08968501747585833, 0.0454857648195078, 0.03620610556875666, 0.15033644538683197, 0.20788733133425316, 0.07942461466882378, 0.07615118264220655, -0.05660446025043105, -0.09159248349412034, -0.45520402304828167, -0.20848819514503703, -0.09193660411983728, 0.07075144660969575, -0.08876075649944444, -0.17591886967420578, 0.4941099293064326, 0.2130373939871788, 0.1741830863369008, 0.08605001204220268, 0.28373631757373613, 0.08035796640130381, 0.024972678744234145, 0.03076048141034941, 0.2079590107120263, 0.15127471756810942, 0.15360359044279903, -0.09285110669831435, 0.041361679594653346, 0.19589689595159143] |
1,803.01178 | The GIT aspect of generalized K$\ddot{a}$hler reduction. I | We revisit generalized K$\ddot{a}$hler reduction introduced by Lin and Tolman
in \cite{LT} from a viewpoint of geometric invariant theory. It is shown that
in the strong Hamiltonian case introduced in the present paper, many well-known
conclusions of ordinary K$\ddot{a}$hler reduction can be generalized without
much effort to the generalized setting. It is also shown how generalized
holomorphic structures arise naturally from the reduction procedure.
| math.DG math.CV math.SG | we revisit generalized kddotahler reduction introduced by lin and tolman in citelt from a viewpoint of geometric invariant theory it is shown that in the strong hamiltonian case introduced in the present paper many wellknown conclusions of ordinary kddotahler reduction can be generalized without much effort to the generalized setting it is also shown how generalized holomorphic structures arise naturally from the reduction procedure | [['we', 'revisit', 'generalized', 'kddotahler', 'reduction', 'introduced', 'by', 'lin', 'and', 'tolman', 'in', 'citelt', 'from', 'a', 'viewpoint', 'of', 'geometric', 'invariant', 'theory', 'it', 'is', 'shown', 'that', 'in', 'the', 'strong', 'hamiltonian', 'case', 'introduced', 'in', 'the', 'present', 'paper', 'many', 'wellknown', 'conclusions', 'of', 'ordinary', 'kddotahler', 'reduction', 'can', 'be', 'generalized', 'without', 'much', 'effort', 'to', 'the', 'generalized', 'setting', 'it', 'is', 'also', 'shown', 'how', 'generalized', 'holomorphic', 'structures', 'arise', 'naturally', 'from', 'the', 'reduction', 'procedure']] | [-0.06649080172428512, 0.08875487868863274, -0.11935301311314106, 0.12832774017078918, -0.10781253626919352, -0.131301738692855, -0.011334346982039278, 0.28063273280349676, -0.3124142544256756, -0.29747814493020996, 0.06940687599308148, -0.20836700809013564, -0.29717606195117696, 0.19175575819826918, -0.17683109432982747, 0.0354141800198704, 0.04166915037785657, 0.004819605877855793, -0.09164662712646532, -0.27469380415277556, 0.3453844363175449, 0.051026310728047974, 0.2986001069220947, 0.05432009282412764, 0.08344073029002175, 0.03331994636391755, -0.05139739198057214, 0.08815003814379452, -0.13258965516126864, 0.1279013016319368, 0.24067499636294087, 0.09952876836905489, 0.20539543776249047, -0.3755178852879908, -0.2816653089685133, 0.12090632229228504, 0.11485998530406505, 0.13312880118610337, -0.010946164471533848, -0.26336956217346597, 0.09339590405579656, -0.21522931810977752, -0.16823312478663865, -0.11344475164150936, -0.00831725457101129, -0.06793937302973063, -0.19871640813653357, 0.05450661434178983, 0.15819209892651998, 0.032458879257319495, -0.029896316773374565, -0.0967603128956398, -0.014053340157261118, -0.014437639380048495, 0.06230607386532938, 0.0490106363868108, 0.05242025928600924, -0.03819233033573255, -0.10968659969512373, 0.39248797891195863, -0.07358665870924597, -0.27040524379117414, 0.14659001836844254, -0.06390485313750105, -0.1877765156532405, 0.10269019803672563, 0.09824790607672185, 0.11611362900657696, -0.13859296335431281, 0.1689149132644161, -0.07795790531963576, 0.08102604515261191, 0.12239984553889371, -0.03227535523910774, 0.09917735803173855, 0.05275017666281201, 0.0691164592271889, 0.18413480136769067, -0.0008791776490397751, -0.1522038771363441, -0.2927262671637436, -0.12201480520889163, -0.13228750568669057, 0.11993379514751723, -0.04768500987097468, -0.11550970087682799, 0.32607831402128795, 0.12353615540632745, 0.1843825429386925, 0.018395430623058928, 0.21995702975982567, 0.15595554347964935, 0.07360444901132723, 0.03616119835351128, 0.22116666235524463, 0.19125771348262788, 0.07302148119924823, -0.18292849773570197, -0.012561737683427054, 0.15227986675745342] |
1,803.01179 | Long Range Magnetic order stabilized by acceptors | Tuning magnetic order in magnetic semiconductors is a long sought goal. A
proper concentration of acceptors can dramatically suppress local magnetic
order in favor of the long one. Using Mn and an acceptor codoped LiZnAs as an
example, we demonstrate, by first-principles calculation, the emergence of a
long-range magnetic order. This intriguing phenomenon can be understood from an
interplay between an acceptor-free magnetism and a band coupling magnetism. Our
observation thus lays the ground for a precise control of the magnetic order in
future spintronic devices.
| cond-mat.mtrl-sci | tuning magnetic order in magnetic semiconductors is a long sought goal a proper concentration of acceptors can dramatically suppress local magnetic order in favor of the long one using mn and an acceptor codoped liznas as an example we demonstrate by firstprinciples calculation the emergence of a longrange magnetic order this intriguing phenomenon can be understood from an interplay between an acceptorfree magnetism and a band coupling magnetism our observation thus lays the ground for a precise control of the magnetic order in future spintronic devices | [['tuning', 'magnetic', 'order', 'in', 'magnetic', 'semiconductors', 'is', 'a', 'long', 'sought', 'goal', 'a', 'proper', 'concentration', 'of', 'acceptors', 'can', 'dramatically', 'suppress', 'local', 'magnetic', 'order', 'in', 'favor', 'of', 'the', 'long', 'one', 'using', 'mn', 'and', 'an', 'acceptor', 'codoped', 'liznas', 'as', 'an', 'example', 'we', 'demonstrate', 'by', 'firstprinciples', 'calculation', 'the', 'emergence', 'of', 'a', 'longrange', 'magnetic', 'order', 'this', 'intriguing', 'phenomenon', 'can', 'be', 'understood', 'from', 'an', 'interplay', 'between', 'an', 'acceptorfree', 'magnetism', 'and', 'a', 'band', 'coupling', 'magnetism', 'our', 'observation', 'thus', 'lays', 'the', 'ground', 'for', 'a', 'precise', 'control', 'of', 'the', 'magnetic', 'order', 'in', 'future', 'spintronic', 'devices']] | [-0.19404082926099792, 0.1725793074385044, 0.004245513614595813, 0.07533188611268997, -0.059152896910467566, -0.08887433185625603, 0.07910792278673719, 0.4120511544539648, -0.2934238971758853, -0.3503990775795982, 0.01683008496183902, -0.26686406676137053, -0.15250084452769336, 0.17164838699117194, 0.029562025900711032, -0.033258209651445644, -0.042318824919707634, -0.015162270187455066, -0.07911217854741742, -0.17531667798757553, 0.22455269430681843, 0.06024759022197138, 0.27438502993215536, 0.11314606294035912, 0.008100395361030036, 0.0019290211227010279, 0.14427785969832363, 0.04665514460819609, -0.10511991914656178, 0.11747543588828514, 0.25042038786135995, -0.08443410928114592, 0.30070200782159673, -0.49308215395054394, -0.2166443209437763, 0.03833614628871574, 0.15916164243347286, 0.18440884416101172, -0.10124556044500102, -0.2955975453643238, 0.058191264400888676, -0.1318457175457083, -0.14067191159719025, -0.13593859307687073, -0.01975191485355882, -0.004415249638259411, -0.2913663055309478, 0.032277455150752386, 0.09253037370303098, 0.10869814141050857, -0.12644827833950437, -0.06296359834206455, -0.0337500197785523, 0.12115750983905266, 0.04284435653894701, 0.09278074214234948, 0.11475788844091928, -0.12283950601704419, -0.16672388041830238, 0.3466670787619317, -0.05461855978321503, -0.0739405234102913, 0.14832111684988966, -0.1386532901238431, -0.08237354293575182, 0.11825386443558861, 0.12141417137292378, 0.13723911414032472, -0.14903394302408046, 0.07181257121127975, 0.03762947054244304, 0.21978279794840253, -0.013765846554409055, 0.10023100936018368, 0.30938071520889504, 0.2670202283517403, 0.09251398805748014, 0.10521143610616598, -0.11892911318076692, 0.0025877721443334045, -0.23709487987353522, -0.2055325193255318, -0.24475136076045387, 0.11832202371648129, -0.08275244103929522, -0.1544284118558554, 0.4004756554084666, 0.17571349531850394, 0.16385394290966146, -0.10683003974092357, 0.24610057144480593, 0.08781682363546947, 0.07012672553605893, -0.009820560345371418, 0.27004735720727374, 0.18827483266975512, 0.1281476736342644, -0.2828434689216973, 0.11552657381467082, -0.004703579958090011] |
1,803.0118 | Dynamical Signature of Fractionalization at the Deconfined Quantum
Critical Point | Deconfined quantum critical points govern continuous quantum phase
transitions at which fractionalized (deconfined) degrees of freedom emerge.
Here we study dynamical signatures of the fractionalized excitations in a
quantum magnet (the easy-plane J-Q model) that realize a deconfined quantum
critical point with emergent O(4) symmetry. By means of large-scale quantum
Monte Carlo simulations and stochastic analytic continuation of imaginary-time
correlation functions, we obtain the dynamic spin structure factors in the
$S^{x}$ and $S^{z}$ channels. In both channels, we observe broad continua that
originate from the deconfined excitations. We further identify several distinct
spectral features of the deconfined quantum critical point, including the lower
edge of the continuum and its form factor on moving through the Brillouin Zone.
We provide field-theoretical and lattice model calculations that explain the
overall shapes of the computed spectra, which highlight the importance of
interactions and gauge fluctuations to explaining the spectral-weight
distribution. We make further comparisons with the conventional Landau O(2)
transition in a different quantum magnet, at which no signatures of
fractionalization are observed. The distinctive spectral signatures of the
deconfined quantum critical point suggest the feasibility of its experimental
detection in neutron scattering and nuclear magnetic resonance experiments.
| cond-mat.str-el | deconfined quantum critical points govern continuous quantum phase transitions at which fractionalized deconfined degrees of freedom emerge here we study dynamical signatures of the fractionalized excitations in a quantum magnet the easyplane jq model that realize a deconfined quantum critical point with emergent o4 symmetry by means of largescale quantum monte carlo simulations and stochastic analytic continuation of imaginarytime correlation functions we obtain the dynamic spin structure factors in the sx and sz channels in both channels we observe broad continua that originate from the deconfined excitations we further identify several distinct spectral features of the deconfined quantum critical point including the lower edge of the continuum and its form factor on moving through the brillouin zone we provide fieldtheoretical and lattice model calculations that explain the overall shapes of the computed spectra which highlight the importance of interactions and gauge fluctuations to explaining the spectralweight distribution we make further comparisons with the conventional landau o2 transition in a different quantum magnet at which no signatures of fractionalization are observed the distinctive spectral signatures of the deconfined quantum critical point suggest the feasibility of its experimental detection in neutron scattering and nuclear magnetic resonance experiments | [['deconfined', 'quantum', 'critical', 'points', 'govern', 'continuous', 'quantum', 'phase', 'transitions', 'at', 'which', 'fractionalized', 'deconfined', 'degrees', 'of', 'freedom', 'emerge', 'here', 'we', 'study', 'dynamical', 'signatures', 'of', 'the', 'fractionalized', 'excitations', 'in', 'a', 'quantum', 'magnet', 'the', 'easyplane', 'jq', 'model', 'that', 'realize', 'a', 'deconfined', 'quantum', 'critical', 'point', 'with', 'emergent', 'o4', 'symmetry', 'by', 'means', 'of', 'largescale', 'quantum', 'monte', 'carlo', 'simulations', 'and', 'stochastic', 'analytic', 'continuation', 'of', 'imaginarytime', 'correlation', 'functions', 'we', 'obtain', 'the', 'dynamic', 'spin', 'structure', 'factors', 'in', 'the', 'sx', 'and', 'sz', 'channels', 'in', 'both', 'channels', 'we', 'observe', 'broad', 'continua', 'that', 'originate', 'from', 'the', 'deconfined', 'excitations', 'we', 'further', 'identify', 'several', 'distinct', 'spectral', 'features', 'of', 'the', 'deconfined', 'quantum', 'critical', 'point', 'including', 'the', 'lower', 'edge', 'of', 'the', 'continuum', 'and', 'its', 'form', 'factor', 'on', 'moving', 'through', 'the', 'brillouin', 'zone', 'we', 'provide', 'fieldtheoretical', 'and', 'lattice', 'model', 'calculations', 'that', 'explain', 'the', 'overall', 'shapes', 'of', 'the', 'computed', 'spectra', 'which', 'highlight', 'the', 'importance', 'of', 'interactions', 'and', 'gauge', 'fluctuations', 'to', 'explaining', 'the', 'spectralweight', 'distribution', 'we', 'make', 'further', 'comparisons', 'with', 'the', 'conventional', 'landau', 'o2', 'transition', 'in', 'a', 'different', 'quantum', 'magnet', 'at', 'which', 'no', 'signatures', 'of', 'fractionalization', 'are', 'observed', 'the', 'distinctive', 'spectral', 'signatures', 'of', 'the', 'deconfined', 'quantum', 'critical', 'point', 'suggest', 'the', 'feasibility', 'of', 'its', 'experimental', 'detection', 'in', 'neutron', 'scattering', 'and', 'nuclear', 'magnetic', 'resonance', 'experiments']] | [-0.15646696766698137, 0.23451517452366458, -0.1167666106356475, 0.08483911619927638, -0.01568869040108835, -0.12911863218192968, 0.08552998023343464, 0.3563426002382468, -0.22873899372390066, -0.24562121412406365, 0.01116927197883622, -0.3372205359679169, -0.141439127513709, 0.11425083164627162, 0.09404187072904255, 0.06562074515908861, -0.0001368283156830913, -0.008673027576729416, -0.10589675422674284, -0.14097109425048798, 0.3039958223199042, 0.022119836980859058, 0.28541708595286575, 0.09668712030546979, 0.04651497086892143, -0.012486641538830903, 0.03510529344710402, -0.02614706451885211, -0.16650008073920616, 0.02757841362020908, 0.2609392252488014, 0.003928815574647906, 0.13638112658324342, -0.42917981044126624, -0.2594909552262368, 0.06798338088063667, 0.15655576924491937, 0.1333422186271025, -0.06483306450924525, -0.31865512617648795, 0.041522261780650854, -0.1564846650754006, -0.15985882674069263, -0.12326987608550832, -0.05898490971616971, -0.020436812195783624, -0.212379963531529, 0.097733214417568, 0.04557469752214204, 0.10988697778901461, -0.03788654706202065, -0.10260218647905649, -0.036870958828009094, 0.10591078321150958, 0.02309135780848849, 0.045559990507526654, 0.16669859029173564, -0.1998607823989378, -0.2050747189930497, 0.384587020579821, -0.013713926824036604, -0.10322817844840196, 0.20326522862156615, -0.19348628053871486, -0.14718316073935384, 0.18316049644438467, 0.13691248529626487, 0.07597118612522116, -0.09289623007972318, 0.06905046785310007, -0.017330955519364814, 0.1422059673766713, -0.021640825306232542, 0.10610418401551075, 0.304567046988851, 0.11743197942104859, -0.006210162509710361, 0.1619506023871975, -0.13145870675619406, -0.2008288689292012, -0.33643801851102556, -0.15097488349255844, -0.20019582555844234, 0.05913142144966584, -0.10864090117736337, -0.17986289503721473, 0.40770586738004705, 0.17773421012426321, 0.1882209064336003, -0.04902796052957479, 0.23264505562300866, 0.12684235734482988, 0.037975897394025175, 0.06374885227519254, 0.23573883836372542, 0.15962643664067563, 0.06832311887485094, -0.32964666531277964, -0.04096671318850265, 0.057689318562356325] |
1,803.01181 | Nonlinear plasma waves in an electron gas | The nature of traveling wave solutions to equations of hydrodynamics of a
generic three-dimensional electron gas with parabolic dispersion law depends on
whether the motion is subsonic or supersonic. Solitons representing localized
depressions of the electrostatic potential and electron density are predicted
to exist in the subsonic regime: at rest the solitons are dark while in motion
they are grey. Two types of periodic waves are found in the supersonic regime:
(i) smooth waves whose small amplitude limit is described by harmonic theory,
and (ii) waves with sharp troughs and smooth crests of the potential with the
electrons accumulating in the troughs.
| physics.plasm-ph cond-mat.mtrl-sci | the nature of traveling wave solutions to equations of hydrodynamics of a generic threedimensional electron gas with parabolic dispersion law depends on whether the motion is subsonic or supersonic solitons representing localized depressions of the electrostatic potential and electron density are predicted to exist in the subsonic regime at rest the solitons are dark while in motion they are grey two types of periodic waves are found in the supersonic regime i smooth waves whose small amplitude limit is described by harmonic theory and ii waves with sharp troughs and smooth crests of the potential with the electrons accumulating in the troughs | [['the', 'nature', 'of', 'traveling', 'wave', 'solutions', 'to', 'equations', 'of', 'hydrodynamics', 'of', 'a', 'generic', 'threedimensional', 'electron', 'gas', 'with', 'parabolic', 'dispersion', 'law', 'depends', 'on', 'whether', 'the', 'motion', 'is', 'subsonic', 'or', 'supersonic', 'solitons', 'representing', 'localized', 'depressions', 'of', 'the', 'electrostatic', 'potential', 'and', 'electron', 'density', 'are', 'predicted', 'to', 'exist', 'in', 'the', 'subsonic', 'regime', 'at', 'rest', 'the', 'solitons', 'are', 'dark', 'while', 'in', 'motion', 'they', 'are', 'grey', 'two', 'types', 'of', 'periodic', 'waves', 'are', 'found', 'in', 'the', 'supersonic', 'regime', 'i', 'smooth', 'waves', 'whose', 'small', 'amplitude', 'limit', 'is', 'described', 'by', 'harmonic', 'theory', 'and', 'ii', 'waves', 'with', 'sharp', 'troughs', 'and', 'smooth', 'crests', 'of', 'the', 'potential', 'with', 'the', 'electrons', 'accumulating', 'in', 'the', 'troughs']] | [-0.18486581486478612, 0.19790095187650592, -0.04954701454342142, 0.04986677238690283, -0.03768906416371465, -0.13954421382525242, -0.07300283879671685, 0.3414114384144983, -0.2516499737953292, -0.2476225297021515, 0.05133293873137411, -0.32352168540305953, -0.0780341210250067, 0.17507415622993208, 0.035907047805285044, 0.0522334084973908, 0.01230790285740559, -0.0328923402737607, -0.012534837778338104, -0.160074621228976, 0.3346911558434002, -0.02762101129537412, 0.2486226493218804, 0.03300352301220318, 0.07990513363506134, -0.08268148827311747, 0.008821291762276315, 0.03373387023149168, -0.14947292371196488, 0.05194820344046343, 0.22230524467486962, -0.019156280599132765, 0.2501585591908581, -0.4972953755116346, -0.2562134055073793, 0.04825302226669794, 0.1919913043293134, 0.15672038759187082, -0.0549714820123935, -0.31223748872677487, 0.01882629853892414, -0.07496612631332349, -0.22983802612597012, 0.027220024791199202, 0.07938435439969979, 0.1655902645029082, -0.2135894421360218, 0.20632031290591055, 0.05811644203084357, 0.001151539161618726, -0.11134059758007746, 0.007319333344497078, -0.11271199283153549, 0.02407183898749816, 0.0805398052359712, -0.001176859556889052, 0.12365967886266756, -0.17981775280307322, -0.023032928419792476, 0.4212590239065535, -0.10973080038549561, -0.2011468236393971, 0.24176305249862956, -0.20796460357686394, 0.003415798645137864, 0.25153016997501254, 0.17910266095571512, 0.09029659907501614, -0.052025311212763006, 0.05625525460067472, -0.04266525513373256, 0.14294014585332251, 0.1634259051004169, 0.001331494504804997, 0.30518871414310794, 0.10958696920516006, 0.04155254770782502, 0.035891675801180745, -0.14523488851766303, -0.08424055706435706, -0.30439101614277153, -0.08385914172885903, -0.147231384445274, 0.000621852186918213, -0.05110777615225422, -0.22497293911874294, 0.4034773290303408, 0.03976679759501826, 0.14278021176783917, -0.0026351919479887277, 0.2649177333668751, 0.17752579615140954, -0.03567048275441516, 0.14939736818532942, 0.3108103297235371, 0.14961694758933256, 0.1095501086902896, -0.2085213859048535, -0.025419824916467656, 0.07129946356073168] |
1,803.01182 | The resilience of Kepler systems to stellar obliquity | The Kepler mission and its successor K2 have brought forth a cascade of
transiting planets. Many of these planetary systems exhibit multiple members,
but a large fraction possess only a single transiting example. This
overabundance of singles has lead to the suggestion that up to half of Kepler
systems might possess significant mutual inclinations between orbits, reducing
the transiting number (the so-called "Kepler Dichotomy"). In a recent paper,
Spalding & Batygin (2016) demonstrated that the quadrupole moment arising from
a young, oblate star is capable of misaligning the constituent orbits of a
close-in planetary system enough to reduce their transit number, provided that
the stellar spin axis is sufficiently misaligned with respect to the planetary
orbital plane. Moreover, tightly packed planetary systems were shown to be
susceptible to becoming destabilized during this process. Here, we investigate
the ubiquity of the stellar obliquity-driven instability within systems with a
range of multiplicities. We find that most planetary systems analysed,
including those possessing only 2 planets, underwent instability for stellar
spin periods below ~3 days and stellar tilts of order 30 degrees. Moreover, we
are able to place upper limits on the stellar obliquity in systems such as
K2-38 (obliquity <20 degrees), where other methods of measuring spin-orbit
misalignment are not currently available. Given the known parameters of T-Tauri
stars, we predict that up to 1/2 of super-Earth mass systems may encounter the
instability, in general agreement with the fraction typically proposed to
explain the observed abundance of single-transiting systems.
| astro-ph.EP | the kepler mission and its successor k2 have brought forth a cascade of transiting planets many of these planetary systems exhibit multiple members but a large fraction possess only a single transiting example this overabundance of singles has lead to the suggestion that up to half of kepler systems might possess significant mutual inclinations between orbits reducing the transiting number the socalled kepler dichotomy in a recent paper spalding batygin 2016 demonstrated that the quadrupole moment arising from a young oblate star is capable of misaligning the constituent orbits of a closein planetary system enough to reduce their transit number provided that the stellar spin axis is sufficiently misaligned with respect to the planetary orbital plane moreover tightly packed planetary systems were shown to be susceptible to becoming destabilized during this process here we investigate the ubiquity of the stellar obliquitydriven instability within systems with a range of multiplicities we find that most planetary systems analysed including those possessing only 2 planets underwent instability for stellar spin periods below 3 days and stellar tilts of order 30 degrees moreover we are able to place upper limits on the stellar obliquity in systems such as k238 obliquity 20 degrees where other methods of measuring spinorbit misalignment are not currently available given the known parameters of ttauri stars we predict that up to 12 of superearth mass systems may encounter the instability in general agreement with the fraction typically proposed to explain the observed abundance of singletransiting systems | [['the', 'kepler', 'mission', 'and', 'its', 'successor', 'k2', 'have', 'brought', 'forth', 'a', 'cascade', 'of', 'transiting', 'planets', 'many', 'of', 'these', 'planetary', 'systems', 'exhibit', 'multiple', 'members', 'but', 'a', 'large', 'fraction', 'possess', 'only', 'a', 'single', 'transiting', 'example', 'this', 'overabundance', 'of', 'singles', 'has', 'lead', 'to', 'the', 'suggestion', 'that', 'up', 'to', 'half', 'of', 'kepler', 'systems', 'might', 'possess', 'significant', 'mutual', 'inclinations', 'between', 'orbits', 'reducing', 'the', 'transiting', 'number', 'the', 'socalled', 'kepler', 'dichotomy', 'in', 'a', 'recent', 'paper', 'spalding', 'batygin', '2016', 'demonstrated', 'that', 'the', 'quadrupole', 'moment', 'arising', 'from', 'a', 'young', 'oblate', 'star', 'is', 'capable', 'of', 'misaligning', 'the', 'constituent', 'orbits', 'of', 'a', 'closein', 'planetary', 'system', 'enough', 'to', 'reduce', 'their', 'transit', 'number', 'provided', 'that', 'the', 'stellar', 'spin', 'axis', 'is', 'sufficiently', 'misaligned', 'with', 'respect', 'to', 'the', 'planetary', 'orbital', 'plane', 'moreover', 'tightly', 'packed', 'planetary', 'systems', 'were', 'shown', 'to', 'be', 'susceptible', 'to', 'becoming', 'destabilized', 'during', 'this', 'process', 'here', 'we', 'investigate', 'the', 'ubiquity', 'of', 'the', 'stellar', 'obliquitydriven', 'instability', 'within', 'systems', 'with', 'a', 'range', 'of', 'multiplicities', 'we', 'find', 'that', 'most', 'planetary', 'systems', 'analysed', 'including', 'those', 'possessing', 'only', '2', 'planets', 'underwent', 'instability', 'for', 'stellar', 'spin', 'periods', 'below', '3', 'days', 'and', 'stellar', 'tilts', 'of', 'order', '30', 'degrees', 'moreover', 'we', 'are', 'able', 'to', 'place', 'upper', 'limits', 'on', 'the', 'stellar', 'obliquity', 'in', 'systems', 'such', 'as', 'k238', 'obliquity', '20', 'degrees', 'where', 'other', 'methods', 'of', 'measuring', 'spinorbit', 'misalignment', 'are', 'not', 'currently', 'available', 'given', 'the', 'known', 'parameters', 'of', 'ttauri', 'stars', 'we', 'predict', 'that', 'up', 'to', '12', 'of', 'superearth', 'mass', 'systems', 'may', 'encounter', 'the', 'instability', 'in', 'general', 'agreement', 'with', 'the', 'fraction', 'typically', 'proposed', 'to', 'explain', 'the', 'observed', 'abundance', 'of', 'singletransiting', 'systems']] | [-0.17604708760742052, 0.19197917699081, -0.034446256240967234, 0.0646099254337119, -0.1123402420002929, -0.08767383150111303, 0.04390873357660297, 0.3216936152874965, -0.186927225906879, -0.3889771548520152, 0.06269070788975575, -0.2804835972985201, -0.10540384271365331, 0.23373253457868456, -0.08894551903501795, 0.044357812409737664, 0.13744140302377836, -0.013718616653455147, -0.02571755501519904, -0.3056480065189716, 0.2822233396129049, 0.029313952280361145, 0.05353087952959763, -0.04733321652366001, 0.04348614396141903, -0.05380741596321163, 0.029356869267773065, -0.033335348973852263, -0.1589573733601922, 0.07095745396724001, 0.23856656482351607, 0.11560968451629408, 0.2057392366936196, -0.3642430334489365, -0.1890584054845767, 0.09003517818474974, 0.17716396813673663, 0.06003796706237586, -0.05230786629521181, -0.24880341579183388, 0.09062859735100484, -0.23230443912611695, -0.2069525848663809, -0.02888407375373435, 0.0991676160283234, 0.03413015179771197, -0.24025827464189564, 0.06205931272535188, 0.09613198645653387, 0.14222883492158095, -0.11971288992971808, -0.1393844918266786, -0.09118843875199434, 0.08357207415259031, 0.05965191270327329, 0.030473413016121324, 0.12271538750482265, -0.08187665121980989, -0.04677738613004369, 0.4248833155534307, -0.035934082772983544, -0.07610988498333322, 0.2718491996881804, -0.2340268924103317, -0.14100774760800797, 0.15701839103569568, 0.20357450222611795, 0.10860494230148672, -0.14009169364332785, -0.003217862753415114, -0.01030062735996774, 0.2228974420186056, 0.09902668524949552, 0.06002451985266101, 0.3770160605810338, 0.12438570468621633, 0.058841492985251174, 0.07707212307680299, -0.1921690426658091, -0.11290077364156176, -0.14557077096117713, -0.09712923502789994, -0.13944459685885927, 0.0377442191697139, -0.06279742948844033, -0.1344501220617113, 0.33706589365477263, 0.16144367133708076, 0.1947182981348902, 0.025311279707000454, 0.2654459953983696, 0.0897690109649986, 0.12521618958378924, 0.08235842421017282, 0.34141535055632777, 0.16454613036724175, 0.07475232522644591, -0.24370552188254985, 0.09954652497325413, -0.03315535217206773] |
1,803.01183 | Design of Automated Dual Band 4G Jammer using MATLAB Simulink | This paper presents a design of efficient smart jammer to jam the 4G signals,
specifically band 3 and band 40 which can be predominantly used in India. The
MATLAB Simulink tool was used for the analysis of the circuit design. Simulink,
an advanced tool gives accurate results comparable to real-time analysis. The
DSP toolbox of the Simulink library has been largely used to construct and view
the results of the model. The main objective of this paper is to receive the
LTE signals, filter band 3 and band 40, add noise and increase the amplitude of
the signal. The uniqueness of this design is the use of full wave rectifier in
the circuit and the trigger enabled blocks. Full wave rectifier with added
circuitry acts as a trigger to the jammer which contains the noise block and
the gain block. Sine wave generators were used to replicate real-time signals
and additional signals were added as noise. The advantage of the design is when
none of the bands are detected, the output will not be generated, thus saving
power. The incorporation of the detector circuit and trigger circuit ensures
that power is not wasted by the jamming circuit when the signal is not
detected. These jammers can be used in examination halls, conference halls and
in secure location where telecommunication signals are unwanted.
| eess.SP | this paper presents a design of efficient smart jammer to jam the 4g signals specifically band 3 and band 40 which can be predominantly used in india the matlab simulink tool was used for the analysis of the circuit design simulink an advanced tool gives accurate results comparable to realtime analysis the dsp toolbox of the simulink library has been largely used to construct and view the results of the model the main objective of this paper is to receive the lte signals filter band 3 and band 40 add noise and increase the amplitude of the signal the uniqueness of this design is the use of full wave rectifier in the circuit and the trigger enabled blocks full wave rectifier with added circuitry acts as a trigger to the jammer which contains the noise block and the gain block sine wave generators were used to replicate realtime signals and additional signals were added as noise the advantage of the design is when none of the bands are detected the output will not be generated thus saving power the incorporation of the detector circuit and trigger circuit ensures that power is not wasted by the jamming circuit when the signal is not detected these jammers can be used in examination halls conference halls and in secure location where telecommunication signals are unwanted | [['this', 'paper', 'presents', 'a', 'design', 'of', 'efficient', 'smart', 'jammer', 'to', 'jam', 'the', '4g', 'signals', 'specifically', 'band', '3', 'and', 'band', '40', 'which', 'can', 'be', 'predominantly', 'used', 'in', 'india', 'the', 'matlab', 'simulink', 'tool', 'was', 'used', 'for', 'the', 'analysis', 'of', 'the', 'circuit', 'design', 'simulink', 'an', 'advanced', 'tool', 'gives', 'accurate', 'results', 'comparable', 'to', 'realtime', 'analysis', 'the', 'dsp', 'toolbox', 'of', 'the', 'simulink', 'library', 'has', 'been', 'largely', 'used', 'to', 'construct', 'and', 'view', 'the', 'results', 'of', 'the', 'model', 'the', 'main', 'objective', 'of', 'this', 'paper', 'is', 'to', 'receive', 'the', 'lte', 'signals', 'filter', 'band', '3', 'and', 'band', '40', 'add', 'noise', 'and', 'increase', 'the', 'amplitude', 'of', 'the', 'signal', 'the', 'uniqueness', 'of', 'this', 'design', 'is', 'the', 'use', 'of', 'full', 'wave', 'rectifier', 'in', 'the', 'circuit', 'and', 'the', 'trigger', 'enabled', 'blocks', 'full', 'wave', 'rectifier', 'with', 'added', 'circuitry', 'acts', 'as', 'a', 'trigger', 'to', 'the', 'jammer', 'which', 'contains', 'the', 'noise', 'block', 'and', 'the', 'gain', 'block', 'sine', 'wave', 'generators', 'were', 'used', 'to', 'replicate', 'realtime', 'signals', 'and', 'additional', 'signals', 'were', 'added', 'as', 'noise', 'the', 'advantage', 'of', 'the', 'design', 'is', 'when', 'none', 'of', 'the', 'bands', 'are', 'detected', 'the', 'output', 'will', 'not', 'be', 'generated', 'thus', 'saving', 'power', 'the', 'incorporation', 'of', 'the', 'detector', 'circuit', 'and', 'trigger', 'circuit', 'ensures', 'that', 'power', 'is', 'not', 'wasted', 'by', 'the', 'jamming', 'circuit', 'when', 'the', 'signal', 'is', 'not', 'detected', 'these', 'jammers', 'can', 'be', 'used', 'in', 'examination', 'halls', 'conference', 'halls', 'and', 'in', 'secure', 'location', 'where', 'telecommunication', 'signals', 'are', 'unwanted']] | [-0.13536677153797838, 0.04620754611994368, -0.05564278186307297, 0.022484673697895766, -0.08804217783255956, -0.1836525344610768, 0.023214585618703282, 0.3692641362614997, -0.25160213665164133, -0.3295263383067674, 0.15636717537543862, -0.28445520421892806, -0.17072734018989108, 0.20332695264159492, -0.06142521195684199, 0.08191211296136382, 0.047034984211194085, 0.0067012309650512965, 0.0004312673128453327, -0.21919862520650263, 0.209538652762972, 0.12007228050985046, 0.30283938956170064, 0.019692733197951236, 0.07412977404378539, 0.003892758670304944, -0.04265773692797568, -0.041654612923561186, -0.04850961416997126, 0.07325084397552518, 0.32128865140498625, 0.1525743455145726, 0.2379355656658509, -0.4611925683907225, -0.19770321961878254, 0.09812018345949147, 0.11442910431389201, 0.09641425222733167, -0.027005076285153796, -0.2815947357338627, 0.13130999568363164, -0.20187651034473936, -0.07654683026883684, -0.018265786589656094, -0.04511649657024054, 0.03617145076366813, -0.2864690826983434, -0.014377683287838826, 0.06735776707546802, 0.03254708086836848, -0.002279250656552445, -0.10932814064939078, -0.029339790715508768, 0.1816120716643012, -0.022202377125247474, 0.030117514164098916, 0.17775328491336187, -0.07910828398703702, -0.10840381936407187, 0.3660951098385225, -0.044164153094915254, -0.15858134562684525, 0.1405792826281122, -0.07844123015020815, -0.07823375363305614, 0.18045452384798377, 0.20817585840615704, -0.00672725406013899, -0.189394213970953, 0.04194601832627873, 0.051450046673110324, 0.23343130649982002, 0.04962136745368978, 0.05784692758115361, 0.1828404401873683, 0.18858950781459743, 0.06840608119209474, 0.16449655125574167, -0.1202789255959844, -0.01115991568259962, -0.28684097277142134, -0.1502427240148127, -0.1950609849583408, -0.0022553227485791016, -0.02429910883880881, -0.12623872018108764, 0.44429407885449157, 0.17866127131305434, 0.09408373539419929, 0.04866422853340303, 0.3548248206592492, 0.1370761322871224, 0.11663700279314071, 0.08637063622869014, 0.24178208761244407, 0.1071613918222185, 0.1511547747949088, -0.17939585926554477, 0.054374299798714554, -0.013204189996719611] |
1,803.01184 | Enhancing Distribution Resilience with Mobile Energy Storage: A
Progressive Hedging Approach | Electrochemical energy storage (ES) units (e.g. batteries) have been
field-validated as an efficient back-up resource that enhance resilience of the
distribution system in case of natural disasters. However, using these units
for resilience is not sufficient to economically justify their installation
and, therefore, these units are often installed in locations where they incur
the greatest economic value during normal operations. Motivated by the recent
progress in transportable ES technologies, i.e. ES units can be moved using
public transportation routes, this paper proposes to use this spatial
flexibility to bridge the gap between the economically optimal locations during
normal operations and disaster-specific locations where extra back-up capacity
is necessary. We propose a two-stage optimization model that optimizes
investments in mobile ES units in the first stage and can re-route the
installed mobile ES units in the second stage to avoid the expected load
shedding caused by disaster forecasts. Since the proposed model cannot be
solved efficiently with off-the-shelf solvers, even for relatively small
instances, we apply a progressive hedging algorithm. The proposed model and
progressive hedging algorithm are tested through two illustrative examples on a
15-bus radial distribution test system.
| eess.SP math.OC | electrochemical energy storage es units eg batteries have been fieldvalidated as an efficient backup resource that enhance resilience of the distribution system in case of natural disasters however using these units for resilience is not sufficient to economically justify their installation and therefore these units are often installed in locations where they incur the greatest economic value during normal operations motivated by the recent progress in transportable es technologies ie es units can be moved using public transportation routes this paper proposes to use this spatial flexibility to bridge the gap between the economically optimal locations during normal operations and disasterspecific locations where extra backup capacity is necessary we propose a twostage optimization model that optimizes investments in mobile es units in the first stage and can reroute the installed mobile es units in the second stage to avoid the expected load shedding caused by disaster forecasts since the proposed model cannot be solved efficiently with offtheshelf solvers even for relatively small instances we apply a progressive hedging algorithm the proposed model and progressive hedging algorithm are tested through two illustrative examples on a 15bus radial distribution test system | [['electrochemical', 'energy', 'storage', 'es', 'units', 'eg', 'batteries', 'have', 'been', 'fieldvalidated', 'as', 'an', 'efficient', 'backup', 'resource', 'that', 'enhance', 'resilience', 'of', 'the', 'distribution', 'system', 'in', 'case', 'of', 'natural', 'disasters', 'however', 'using', 'these', 'units', 'for', 'resilience', 'is', 'not', 'sufficient', 'to', 'economically', 'justify', 'their', 'installation', 'and', 'therefore', 'these', 'units', 'are', 'often', 'installed', 'in', 'locations', 'where', 'they', 'incur', 'the', 'greatest', 'economic', 'value', 'during', 'normal', 'operations', 'motivated', 'by', 'the', 'recent', 'progress', 'in', 'transportable', 'es', 'technologies', 'ie', 'es', 'units', 'can', 'be', 'moved', 'using', 'public', 'transportation', 'routes', 'this', 'paper', 'proposes', 'to', 'use', 'this', 'spatial', 'flexibility', 'to', 'bridge', 'the', 'gap', 'between', 'the', 'economically', 'optimal', 'locations', 'during', 'normal', 'operations', 'and', 'disasterspecific', 'locations', 'where', 'extra', 'backup', 'capacity', 'is', 'necessary', 'we', 'propose', 'a', 'twostage', 'optimization', 'model', 'that', 'optimizes', 'investments', 'in', 'mobile', 'es', 'units', 'in', 'the', 'first', 'stage', 'and', 'can', 'reroute', 'the', 'installed', 'mobile', 'es', 'units', 'in', 'the', 'second', 'stage', 'to', 'avoid', 'the', 'expected', 'load', 'shedding', 'caused', 'by', 'disaster', 'forecasts', 'since', 'the', 'proposed', 'model', 'can', 'not', 'be', 'solved', 'efficiently', 'with', 'offtheshelf', 'solvers', 'even', 'for', 'relatively', 'small', 'instances', 'we', 'apply', 'a', 'progressive', 'hedging', 'algorithm', 'the', 'proposed', 'model', 'and', 'progressive', 'hedging', 'algorithm', 'are', 'tested', 'through', 'two', 'illustrative', 'examples', 'on', 'a', '15bus', 'radial', 'distribution', 'test', 'system']] | [-0.13073268346488476, 0.08870849952502936, -0.04581109733855536, 0.05067964471916464, -0.05444517463724562, -0.2002041957659876, 0.09293766186216518, 0.4046815448903783, -0.2970345634182686, -0.3409519883888689, 0.15989321946007085, -0.24512237579596632, -0.154845593495912, 0.18580048511995073, -0.17104591099971178, 0.05766888671831034, 0.07066724637652783, -0.016637482194797718, -0.004141697221274368, -0.27572883445430885, 0.21003879057392877, 0.13365111663877804, 0.3349133608613741, 0.023829472120502654, 0.07057659049956676, -0.04495446467000174, -0.009692347896432274, -0.00560946913403683, -0.05568082083832475, 0.1253528009930795, 0.32669107235699174, 0.1740150073559377, 0.3411303730133702, -0.5359537982167726, -0.19294945000705713, 0.1587945581687724, 0.11937320367132755, 0.038799653539463956, -0.03276144665227655, -0.2387822048519464, 0.0770202186481559, -0.23068119239007287, -0.08434836912581468, -0.09307998379214323, -0.0018339136560611864, 0.038284626890865356, -0.2918278601588333, 0.01991596588127833, -0.008968391946272894, 0.04020638844336976, -0.0641051342880184, -0.09969452663354655, -0.017040517021787358, 0.13160374484701645, 0.031111836561031718, -0.0372377595189401, 0.1490318282425807, -0.09124141555767566, -0.12299709144934892, 0.36861728772740154, -0.003448212758344125, -0.17281753784120282, 0.14648267051035707, -0.04150292863023472, -0.11719875235513928, 0.075115190181423, 0.21818470285538047, 0.07670744042719072, -0.1866338788955049, 0.023584378286847535, 0.03362161247806753, 0.15248622683643856, 0.0715013713909582, 0.006876587271341745, 0.22436494744173624, 0.20786626862093088, 0.12464204914793173, 0.12372694549618916, -0.09485090810016177, -0.11614712356915946, -0.2363011416235819, -0.15812532585686978, -0.18791469599912192, -0.021472349584713966, -0.05750935332928062, -0.08978808754407626, 0.34844006977497255, 0.1784913510826222, 0.13785037179701629, 0.04970612420257241, 0.35358817658242697, 0.090349974188229, 0.10212667627673457, 0.1330339413853412, 0.17632500218715577, -0.026553632519681028, 0.16972191156670052, -0.1834511855621212, 0.13162627016918804, 0.025133228693954287] |
1,803.01185 | Tetrahedral hydrocarbon nanoparticles in space: X-ray spectra | It has been proposed, or confirmed, that diamond nanoparticles exist in
various environments in space: close to active galactic nuclei, in the vicinity
of supernovae and pulsars, in the interior of several planets in the Solar
system, in carbon planets and other exoplanets, carbon-rich stars, meteorites,
in X-ray active Herbig Ae/Be stars, and in the interstellar medium. Using
density functional theory methods we calculate the carbon K-edge X-ray
absorption spectrum of two large tetrahedral nanodiamonds: C26H32 and C51H52.
We also study and test our methods on the astrophysical molecule CH4, the
smallest C-H tetrahedral structure. A possible detection of nanodiamonds from
X-ray spectra by future telescopes, such as the project Arcus, is proposed.
Simulated spectra of the diffuse interstellar medium using Cyg X-2 as a source
show that nanodiamonds studied in this work can be detected by Arcus, a high
resolution X-ray spectrometer mission selected by NASA for a Phase A concept
study.
| astro-ph.SR astro-ph.EP astro-ph.GA cond-mat.mtrl-sci | it has been proposed or confirmed that diamond nanoparticles exist in various environments in space close to active galactic nuclei in the vicinity of supernovae and pulsars in the interior of several planets in the solar system in carbon planets and other exoplanets carbonrich stars meteorites in xray active herbig aebe stars and in the interstellar medium using density functional theory methods we calculate the carbon kedge xray absorption spectrum of two large tetrahedral nanodiamonds c26h32 and c51h52 we also study and test our methods on the astrophysical molecule ch4 the smallest ch tetrahedral structure a possible detection of nanodiamonds from xray spectra by future telescopes such as the project arcus is proposed simulated spectra of the diffuse interstellar medium using cyg x2 as a source show that nanodiamonds studied in this work can be detected by arcus a high resolution xray spectrometer mission selected by nasa for a phase a concept study | [['it', 'has', 'been', 'proposed', 'or', 'confirmed', 'that', 'diamond', 'nanoparticles', 'exist', 'in', 'various', 'environments', 'in', 'space', 'close', 'to', 'active', 'galactic', 'nuclei', 'in', 'the', 'vicinity', 'of', 'supernovae', 'and', 'pulsars', 'in', 'the', 'interior', 'of', 'several', 'planets', 'in', 'the', 'solar', 'system', 'in', 'carbon', 'planets', 'and', 'other', 'exoplanets', 'carbonrich', 'stars', 'meteorites', 'in', 'xray', 'active', 'herbig', 'aebe', 'stars', 'and', 'in', 'the', 'interstellar', 'medium', 'using', 'density', 'functional', 'theory', 'methods', 'we', 'calculate', 'the', 'carbon', 'kedge', 'xray', 'absorption', 'spectrum', 'of', 'two', 'large', 'tetrahedral', 'nanodiamonds', 'c26h32', 'and', 'c51h52', 'we', 'also', 'study', 'and', 'test', 'our', 'methods', 'on', 'the', 'astrophysical', 'molecule', 'ch4', 'the', 'smallest', 'ch', 'tetrahedral', 'structure', 'a', 'possible', 'detection', 'of', 'nanodiamonds', 'from', 'xray', 'spectra', 'by', 'future', 'telescopes', 'such', 'as', 'the', 'project', 'arcus', 'is', 'proposed', 'simulated', 'spectra', 'of', 'the', 'diffuse', 'interstellar', 'medium', 'using', 'cyg', 'x2', 'as', 'a', 'source', 'show', 'that', 'nanodiamonds', 'studied', 'in', 'this', 'work', 'can', 'be', 'detected', 'by', 'arcus', 'a', 'high', 'resolution', 'xray', 'spectrometer', 'mission', 'selected', 'by', 'nasa', 'for', 'a', 'phase', 'a', 'concept', 'study']] | [-0.0182995241295719, 0.1411849774901342, -0.026020673255510135, 0.06562099867925936, -0.04228455734297337, -0.05174009301175444, 0.06524406314213815, 0.461780056024328, -0.18028735660250908, -0.32958401434604595, 0.0526408272778418, -0.3588494587973352, -0.08466770284884727, 0.1860901413173939, -0.027045597262198292, 0.03187575040767524, 0.09321093144795753, -0.08341727892263787, 0.007641288713592148, -0.22707942756361618, 0.26208449646041093, 0.09809462861188792, 0.15919418999962262, -0.01642865336975021, 0.04839045531501907, -0.08937315133844335, -0.013402474365684371, -0.00642130407061434, -0.11724215807015036, 0.0773862355777266, 0.30235249101067124, 0.12810657693794775, 0.1694594428408891, -0.4004489717517813, -0.29935121974778295, 0.05360702620449149, 0.1695074112021938, 0.01110209347310149, -0.11668979746375513, -0.27777933165283, 0.08444162744786653, -0.17534477894027897, -0.17621592740645473, 0.005656910701716528, 0.028457504805078766, 0.053308805173250616, -0.18965646047152837, 0.008708450017883966, 0.008403136142042298, 0.11900487220815278, -0.1888641914019719, -0.12725880458281802, -0.033256044359230096, 0.06071153065553613, 0.0024072719007015033, 0.0035248371542721296, 0.19376568996890245, -0.09138671189873473, -0.07040410312447722, 0.43970484404041377, -0.09973666380430936, 0.008951482529573094, 0.21310520120310467, -0.24280798522021546, -0.2094422211586837, 0.16297106041159753, 0.15221437188297116, 0.2228042236313421, -0.19338990880572698, 0.057170107801497255, -0.055186180414058365, 0.19881023980048024, 0.08253277430391026, 0.07732725284672928, 0.2941929302702578, 0.16922356726120638, 0.03311932728385294, 0.14050015077474434, -0.2540841082724687, 0.020517037406992414, -0.1675457209749579, -0.17180463226993156, -0.19141510283167393, 0.04333778527497456, -0.10546889063847846, -0.11993045502015395, 0.3001881671031715, 0.08430370546889719, 0.137815214084486, -0.09934025790715059, 0.3184673428005039, 0.013613012933098273, 0.08477920796167081, 0.06206531600952642, 0.3154786444386307, 0.1664616067566915, 0.12392893125802673, -0.26157062134161185, 0.07815765930241012, 0.008704577788513228] |
1,803.01186 | Localization and landscape functions on quantum graphs | We discuss explicit landscape functions for quantum graphs. By a "landscape
function" $\Upsilon(x)$ we mean a function that controls the localization
properties of normalized eigenfunctions $\psi(x)$ through a pointwise
inequality of the form $$ |\psi(x)| \le \Upsilon(x). $$ The ideal $\Upsilon$ is
a function that
a) responds to the potential energy $V(x)$ and to the structure of the graph
in some formulaic way;
b) is small in examples where eigenfunctions are suppressed by the tunneling
effect, and
c) relatively large in regions where eigenfunctions may - or may not - be
concentrated, as observed in specific examples.
It turns out that the connectedness of a graph can present a barrier to the
existence of universal landscape functions in the high-energy r\'egime, as we
show with simple examples. We therefore apply different methods in different
r\'egimes determined by the values of the potential energy $V(x)$ and the
eigenvalue parameter $E$.
| math.SP | we discuss explicit landscape functions for quantum graphs by a landscape function upsilonx we mean a function that controls the localization properties of normalized eigenfunctions psix through a pointwise inequality of the form psix le upsilonx the ideal upsilon is a function that a responds to the potential energy vx and to the structure of the graph in some formulaic way b is small in examples where eigenfunctions are suppressed by the tunneling effect and c relatively large in regions where eigenfunctions may or may not be concentrated as observed in specific examples it turns out that the connectedness of a graph can present a barrier to the existence of universal landscape functions in the highenergy regime as we show with simple examples we therefore apply different methods in different regimes determined by the values of the potential energy vx and the eigenvalue parameter e | [['we', 'discuss', 'explicit', 'landscape', 'functions', 'for', 'quantum', 'graphs', 'by', 'a', 'landscape', 'function', 'upsilonx', 'we', 'mean', 'a', 'function', 'that', 'controls', 'the', 'localization', 'properties', 'of', 'normalized', 'eigenfunctions', 'psix', 'through', 'a', 'pointwise', 'inequality', 'of', 'the', 'form', 'psix', 'le', 'upsilonx', 'the', 'ideal', 'upsilon', 'is', 'a', 'function', 'that', 'a', 'responds', 'to', 'the', 'potential', 'energy', 'vx', 'and', 'to', 'the', 'structure', 'of', 'the', 'graph', 'in', 'some', 'formulaic', 'way', 'b', 'is', 'small', 'in', 'examples', 'where', 'eigenfunctions', 'are', 'suppressed', 'by', 'the', 'tunneling', 'effect', 'and', 'c', 'relatively', 'large', 'in', 'regions', 'where', 'eigenfunctions', 'may', 'or', 'may', 'not', 'be', 'concentrated', 'as', 'observed', 'in', 'specific', 'examples', 'it', 'turns', 'out', 'that', 'the', 'connectedness', 'of', 'a', 'graph', 'can', 'present', 'a', 'barrier', 'to', 'the', 'existence', 'of', 'universal', 'landscape', 'functions', 'in', 'the', 'highenergy', 'regime', 'as', 'we', 'show', 'with', 'simple', 'examples', 'we', 'therefore', 'apply', 'different', 'methods', 'in', 'different', 'regimes', 'determined', 'by', 'the', 'values', 'of', 'the', 'potential', 'energy', 'vx', 'and', 'the', 'eigenvalue', 'parameter', 'e']] | [-0.13933201946061233, 0.12485306541403306, -0.098223505691015, 0.11051450927163764, -0.045431835572877576, -0.13039328812075587, 0.04718128373396808, 0.3613043882338137, -0.2842583248584435, -0.24806138567690705, 0.05850705957393451, -0.29726653655605584, -0.1681453536810546, 0.18849155749194324, -0.03244616679590324, 0.03650738450564075, 0.041367417527362706, 0.05062018943757846, -0.049635394187322976, -0.17529236924842578, 0.3271164424235708, 0.022113741821095604, 0.19226924862455705, 0.11021751806316576, 0.05968848856101776, -0.01877345873428316, 0.06237644215981508, 0.022489713871016583, -0.1838792928839243, 0.06322057519493432, 0.23072894582011064, 0.09445459260765848, 0.29408036087768086, -0.3778442948478563, -0.18585955811471774, 0.16377187265697385, 0.17119484422888992, 0.03774092337116599, -0.04319881790735085, -0.2658400264472283, 0.08867601242622938, -0.13031087639291997, -0.15732331133030097, -0.0995711618327889, 0.06280587467782456, 0.07870135850690563, -0.2958842954200949, 0.08371749468918505, 0.027440866082906724, 0.015550584786025615, -0.05571970870268756, -0.10593401095669332, -0.046251358215472306, 0.07680409409202121, 0.021521701358644098, 0.03626360186728938, 0.12836127412216417, -0.14854524690408966, -0.06978603707433774, 0.3365038036914735, -0.07520111041336223, -0.2371503096176231, 0.14426380999482655, -0.17943093681964895, -0.10982166721068065, 0.08676527549095195, 0.12561156034694407, 0.14047315094684218, -0.11007162871136297, 0.16283841748633582, -0.020975899601411396, 0.11959015149141437, 0.04329461768783372, 0.03229098653677723, 0.15479941535098798, 0.09085466724274488, 0.07946775856805195, 0.15635258138484867, -0.05139723952923869, -0.07578036582803932, -0.34246854661353704, -0.12700404243479516, -0.21503555824787451, 0.0797234466123788, -0.09864992981842831, -0.18385944109538505, 0.4275237219327868, 0.07300412828867436, 0.26087794090010996, 0.02085041859476217, 0.23016135061223958, 0.16160947659759428, 0.05710776044850655, 0.07194626048078824, 0.19061108090019593, 0.09996607302655948, 0.06476280717500325, -0.1701593544783777, 0.042463683966418794, 0.06713094569999596] |
1,803.01187 | VoigtFit: A Python package for Voigt profile fitting | I present a Python package developed for fitting Voigt profiles to absorption
lines. The software fits multiple components for various atomic lines
simultaneously allowing parameters to be tied and fixed. Moreover, the code is
able to automatically fit a polynomial continuum model together with the line
profiles. Lastly, a physical model can readily be used to constrain thermal and
turbulent broadening of absorption lines as well as implementing molecular
excitation models. The code can be run with interactive features such as manual
continuum placement locally around each line, manual masking of undesired
fitting regions, and interactive definition of velocity components for various
elements. This greatly improves the ease by which the initial guesses can be
estimated. Since the code is written in pure Python, it can easily be scripted
and modified to fit the user's needs. The code uses a $\chi^2$ minimization
approach to find the best solution. The code and a set of test-data together
with the full documentation is available on GitHub.
| astro-ph.IM | i present a python package developed for fitting voigt profiles to absorption lines the software fits multiple components for various atomic lines simultaneously allowing parameters to be tied and fixed moreover the code is able to automatically fit a polynomial continuum model together with the line profiles lastly a physical model can readily be used to constrain thermal and turbulent broadening of absorption lines as well as implementing molecular excitation models the code can be run with interactive features such as manual continuum placement locally around each line manual masking of undesired fitting regions and interactive definition of velocity components for various elements this greatly improves the ease by which the initial guesses can be estimated since the code is written in pure python it can easily be scripted and modified to fit the users needs the code uses a chi2 minimization approach to find the best solution the code and a set of testdata together with the full documentation is available on github | [['i', 'present', 'a', 'python', 'package', 'developed', 'for', 'fitting', 'voigt', 'profiles', 'to', 'absorption', 'lines', 'the', 'software', 'fits', 'multiple', 'components', 'for', 'various', 'atomic', 'lines', 'simultaneously', 'allowing', 'parameters', 'to', 'be', 'tied', 'and', 'fixed', 'moreover', 'the', 'code', 'is', 'able', 'to', 'automatically', 'fit', 'a', 'polynomial', 'continuum', 'model', 'together', 'with', 'the', 'line', 'profiles', 'lastly', 'a', 'physical', 'model', 'can', 'readily', 'be', 'used', 'to', 'constrain', 'thermal', 'and', 'turbulent', 'broadening', 'of', 'absorption', 'lines', 'as', 'well', 'as', 'implementing', 'molecular', 'excitation', 'models', 'the', 'code', 'can', 'be', 'run', 'with', 'interactive', 'features', 'such', 'as', 'manual', 'continuum', 'placement', 'locally', 'around', 'each', 'line', 'manual', 'masking', 'of', 'undesired', 'fitting', 'regions', 'and', 'interactive', 'definition', 'of', 'velocity', 'components', 'for', 'various', 'elements', 'this', 'greatly', 'improves', 'the', 'ease', 'by', 'which', 'the', 'initial', 'guesses', 'can', 'be', 'estimated', 'since', 'the', 'code', 'is', 'written', 'in', 'pure', 'python', 'it', 'can', 'easily', 'be', 'scripted', 'and', 'modified', 'to', 'fit', 'the', 'users', 'needs', 'the', 'code', 'uses', 'a', 'chi2', 'minimization', 'approach', 'to', 'find', 'the', 'best', 'solution', 'the', 'code', 'and', 'a', 'set', 'of', 'testdata', 'together', 'with', 'the', 'full', 'documentation', 'is', 'available', 'on', 'github']] | [-0.016773243008817478, 0.023344266111962497, -0.06743497537199135, 0.05936165337263402, -0.12387336400002469, -0.22555659649178114, 0.02048884412676959, 0.42757872559368704, -0.27165026556155303, -0.37169051992922747, 0.10686408193063604, -0.22916431593561046, -0.03137681433340398, 0.19658228623533122, -0.012202181555217177, 0.07136741376243441, 0.10082500527411267, -0.05615135284549579, -0.03278466522489197, -0.21890930662772096, 0.2724155866095183, 0.12350096698373375, 0.23289299453608692, 0.03984941311305525, 0.025895921675283914, -0.025305364408712016, -0.08299316512278804, 0.025913562052088175, -0.10044837752413913, 0.10866811314509704, 0.2818877274186179, 0.20835059080216126, 0.19729184708558023, -0.3726441796937185, -0.2239616171133182, 0.027272637510422346, 0.19478201052378408, 0.13960429490047008, 0.0396326195566472, -0.2628646016095356, 0.048539066848184674, -0.18553799474271152, -0.1382871574903952, -0.08195038385570004, -0.032619434278231205, 0.049069676849218764, -0.31275967468802884, -0.02014653020177786, -0.016346105565345367, 0.09387479425285852, -0.03816069775578997, -0.10834763601362682, -0.07846802195375104, 0.14028168666437724, -0.015735181128015606, 0.053027330792690744, 0.1762360405068981, -0.07660767920428842, -0.07212782374344676, 0.4130504678753091, -0.10432375862870774, -0.19378405164149248, 0.1840860835026677, -0.028859031385253753, -0.11454794141847253, 0.16755827146024363, 0.16542679508693697, 0.08474070070561295, -0.17532803825806917, 0.04724029317979485, -0.007830619530556382, 0.2440142398913073, 0.03194810688586497, -0.026367806450452475, 0.23166869462342796, 0.06820028593547915, -0.01893802745654262, 0.13845684718398843, -0.09142435349313906, -0.0354499562654826, -0.29353544101006884, -0.14225155051241106, -0.1489032629093655, -0.014893987659001497, -0.08626571507716663, -0.17112539837523022, 0.40694215470675105, 0.1623114783248705, 0.1737129383765888, 0.04070919921420083, 0.3558997532193799, 0.097734928207856, 0.13628275388079444, 0.1270976028285875, 0.1671162042142142, 0.06221523776468707, 0.09058663211251813, -0.20047170869017975, 0.10269229354836591, 0.01836980480655301] |
1,803.01188 | Estimation and inference for precision matrices of non-stationary time
series | In this paper, we consider the estimation and inference of precision matrices
of a rich class of locally stationary and nonlinear time series assuming that
only one realization of the time series is observed. Using a Cholesky
decomposition technique, we show that the precision matrices can be directly
estimated via a series of least squares linear regressions with smoothly
time-varying coefficients. The method of sieves is utilized for the estimation
and is shown to be efficient and optimally adaptive in terms of estimation
accuracy and computational complexity. We establish an asymptotic theory for a
class of ${\cal L}^2$ tests based on the nonparametric sieve estimators. The
latter are used for testing whether the precision matrices are diagonal or
banded. A high dimensional Gaussian approximation result is established for a
wide class of quadratic form of non-stationary and nonlinear processes, which
is of interest by itself.
| math.ST stat.TH | in this paper we consider the estimation and inference of precision matrices of a rich class of locally stationary and nonlinear time series assuming that only one realization of the time series is observed using a cholesky decomposition technique we show that the precision matrices can be directly estimated via a series of least squares linear regressions with smoothly timevarying coefficients the method of sieves is utilized for the estimation and is shown to be efficient and optimally adaptive in terms of estimation accuracy and computational complexity we establish an asymptotic theory for a class of cal l2 tests based on the nonparametric sieve estimators the latter are used for testing whether the precision matrices are diagonal or banded a high dimensional gaussian approximation result is established for a wide class of quadratic form of nonstationary and nonlinear processes which is of interest by itself | [['in', 'this', 'paper', 'we', 'consider', 'the', 'estimation', 'and', 'inference', 'of', 'precision', 'matrices', 'of', 'a', 'rich', 'class', 'of', 'locally', 'stationary', 'and', 'nonlinear', 'time', 'series', 'assuming', 'that', 'only', 'one', 'realization', 'of', 'the', 'time', 'series', 'is', 'observed', 'using', 'a', 'cholesky', 'decomposition', 'technique', 'we', 'show', 'that', 'the', 'precision', 'matrices', 'can', 'be', 'directly', 'estimated', 'via', 'a', 'series', 'of', 'least', 'squares', 'linear', 'regressions', 'with', 'smoothly', 'timevarying', 'coefficients', 'the', 'method', 'of', 'sieves', 'is', 'utilized', 'for', 'the', 'estimation', 'and', 'is', 'shown', 'to', 'be', 'efficient', 'and', 'optimally', 'adaptive', 'in', 'terms', 'of', 'estimation', 'accuracy', 'and', 'computational', 'complexity', 'we', 'establish', 'an', 'asymptotic', 'theory', 'for', 'a', 'class', 'of', 'cal', 'l2', 'tests', 'based', 'on', 'the', 'nonparametric', 'sieve', 'estimators', 'the', 'latter', 'are', 'used', 'for', 'testing', 'whether', 'the', 'precision', 'matrices', 'are', 'diagonal', 'or', 'banded', 'a', 'high', 'dimensional', 'gaussian', 'approximation', 'result', 'is', 'established', 'for', 'a', 'wide', 'class', 'of', 'quadratic', 'form', 'of', 'nonstationary', 'and', 'nonlinear', 'processes', 'which', 'is', 'of', 'interest', 'by', 'itself']] | [-0.07978079373514729, 0.06430615888163849, -0.08390216514596652, 0.04323742225332635, -0.057069475120254634, -0.1468677067808036, 0.012793490004822099, 0.3671377362747645, -0.2919050897760638, -0.26710904911481614, 0.18735649446988928, -0.20710227209111226, -0.1732998786156933, 0.21606598954551437, -0.06090895762859747, 0.12869931140529184, 0.057753287592164144, 0.033010300833346516, -0.11417272204758021, -0.2742383492163158, 0.2726152635629064, 0.04081310204647738, 0.2700318211368446, -0.04079550869666554, 0.14111520385144857, 0.013712873698437008, -0.04203953855622817, 0.03982088779388317, -0.08179640564154271, 0.15271000548683364, 0.2745290286148545, 0.12177440332377265, 0.31534142326563597, -0.36231043165356946, -0.2048412072408045, 0.1309200855823041, 0.13251939168970647, 0.0734779821604426, -0.025616801305320756, -0.24124216258140474, 0.081113880390205, -0.15619322212156037, -0.10485560337627499, -0.1183392173128909, -0.03239846572857993, 0.020893044969677154, -0.39482601635671893, 0.11072738461742371, 0.0642218411225697, 0.04041269208336699, -0.004281022624465926, -0.13072328497816263, 0.0631964495694586, 0.06950782334977954, 0.02450000116810331, -0.029703649497141354, 0.06526659817699793, -0.09797951304740152, -0.09691523177998847, 0.33253022206240684, -0.1044385792272053, -0.24148436103273055, 0.1636600477893933, -0.1405868637503992, -0.15107326204246233, 0.11902978114526848, 0.22972754069828782, 0.1431159917329406, -0.14698483691518677, 0.11790113873731602, -0.05361365117774955, 0.15704278051210888, 0.03935711177644031, 0.005520347624631792, 0.1495861086898066, 0.16075010306266105, 0.09698462605733296, 0.1305073858640189, -0.08220404900192957, -0.0655140437057306, -0.28846539419529765, -0.16831406806113905, -0.22333175513475875, 0.02077623032723907, -0.1433699311959509, -0.20915770716543694, 0.3965301965475725, 0.09823041478099687, 0.19686303392759172, 0.10249796141629461, 0.26754789299749093, 0.18321954423947068, 0.01986818740080143, 0.08332457812824126, 0.1752281924452761, 0.17329310021555885, 0.006750425121522155, -0.18411257358203675, 0.10306993042327592, 0.09816593571630275] |
1,803.01189 | Theory of Fano resonance in single molecule electroluminescence induced
by a scanning tunneling microscope | The coupling between molecular exciton and gap plasmons plays a key role in
single molecular electroluminescence induced by a scanning tunneling microscope
(STM). But it has been difficult to clarify the complex experimental phenomena.
By employing the nonequilibrium Green's function method, we propose a general
theoretical model to understand the light emission spectrum from single
molecule and gap plasmons from an energy transport point of view. The coherent
interaction between gap plasmons and molecular exciton leads to a prominent
Fano resonance in the emission spectrum. We analyze the dependence of the Fano
line shape on the system parameters, based on which we provide a unified
account of several recent experimental observations. Moreover, we highlight the
effect of the tip-molecule electronic coupling on the spectrum, which has
hitherto not been considered.
| cond-mat.mes-hall physics.chem-ph | the coupling between molecular exciton and gap plasmons plays a key role in single molecular electroluminescence induced by a scanning tunneling microscope stm but it has been difficult to clarify the complex experimental phenomena by employing the nonequilibrium greens function method we propose a general theoretical model to understand the light emission spectrum from single molecule and gap plasmons from an energy transport point of view the coherent interaction between gap plasmons and molecular exciton leads to a prominent fano resonance in the emission spectrum we analyze the dependence of the fano line shape on the system parameters based on which we provide a unified account of several recent experimental observations moreover we highlight the effect of the tipmolecule electronic coupling on the spectrum which has hitherto not been considered | [['the', 'coupling', 'between', 'molecular', 'exciton', 'and', 'gap', 'plasmons', 'plays', 'a', 'key', 'role', 'in', 'single', 'molecular', 'electroluminescence', 'induced', 'by', 'a', 'scanning', 'tunneling', 'microscope', 'stm', 'but', 'it', 'has', 'been', 'difficult', 'to', 'clarify', 'the', 'complex', 'experimental', 'phenomena', 'by', 'employing', 'the', 'nonequilibrium', 'greens', 'function', 'method', 'we', 'propose', 'a', 'general', 'theoretical', 'model', 'to', 'understand', 'the', 'light', 'emission', 'spectrum', 'from', 'single', 'molecule', 'and', 'gap', 'plasmons', 'from', 'an', 'energy', 'transport', 'point', 'of', 'view', 'the', 'coherent', 'interaction', 'between', 'gap', 'plasmons', 'and', 'molecular', 'exciton', 'leads', 'to', 'a', 'prominent', 'fano', 'resonance', 'in', 'the', 'emission', 'spectrum', 'we', 'analyze', 'the', 'dependence', 'of', 'the', 'fano', 'line', 'shape', 'on', 'the', 'system', 'parameters', 'based', 'on', 'which', 'we', 'provide', 'a', 'unified', 'account', 'of', 'several', 'recent', 'experimental', 'observations', 'moreover', 'we', 'highlight', 'the', 'effect', 'of', 'the', 'tipmolecule', 'electronic', 'coupling', 'on', 'the', 'spectrum', 'which', 'has', 'hitherto', 'not', 'been', 'considered']] | [-0.12430818645605961, 0.06295122215535509, -0.12299189256647458, 0.07650773342555532, -0.04955032812431455, -0.13850352444614356, 0.0700821475743746, 0.4249622137070848, -0.2501552608723824, -0.3085671380878641, -0.04606539978323361, -0.2777990119030269, -0.17990246780861455, 0.19687323610907279, 0.03082465583530183, 0.039285890847587816, 0.014523176462031329, -0.06500272532687701, -0.012606596817763951, -0.11645292397588491, 0.3376222373272937, 0.07844536818134097, 0.3158881817335406, 0.1876519464708578, 0.05509219574383818, 0.011136783372897368, 0.062453357655053526, -0.026141476272963562, -0.15933163116883056, 0.13300066032948402, 0.22000963354814582, -0.007129319030075119, 0.23661840730704942, -0.45193199277497254, -0.2589729784271465, 0.03913247303750653, 0.17165992708648375, 0.14108637449725603, -0.08875023381898735, -0.28183432628328986, -0.008979340388367955, -0.11686115721957041, -0.08792106219692729, -0.06781523060949089, -0.0196292221510353, -0.007497920316214172, -0.19972827582835004, 0.07331034321194659, 0.012517337621046374, 0.07515587228565263, -0.04694702774465371, -0.07335437671773924, -0.013234559351649995, 0.10290682786502517, 0.018126506038690704, 0.013472423143684863, 0.18215347258553197, -0.11836210551241842, -0.11227409381849261, 0.3703743102888648, -0.08686405410273718, -0.13005512898358015, 0.18156516601582273, -0.1692137976624788, -0.07280958092126709, 0.17445436421280297, 0.1135871797746334, 0.11051060858970652, -0.14946422868300802, 0.07653808470036333, -0.04160931807441207, 0.19038645153475675, 0.0320895268725088, 0.11185881947749295, 0.25682785546836945, 0.1927824929714776, 0.01827483386374437, 0.13504640337509605, -0.16513749919563103, -0.09444428813428833, -0.24172915478165333, -0.13436934676809378, -0.19613205572733514, 0.10096813817161511, 0.0026357128109129216, -0.14278677911855853, 0.4674339709463171, 0.12326929818350786, 0.23470724803180648, -0.0636427878957385, 0.3050654327067045, 0.14469007630474293, 0.06775615960986425, -0.016993758669839456, 0.29067493725138216, 0.16162492096818123, 0.08033026192838756, -0.316708418327527, 0.048053279154611606, -0.008165926676100263] |
1,803.0119 | New features of parallel implementation of N-body problems on GPU | This paper focuses on the parallel implementation of a direct $N$-body
method~(particle-particle algorithm) and the application of multiple GPUs for
galactic dynamics simulations. Application of a hybrid OpenMP-CUDA technology
is considered for models with a number of particles $N \sim 10^5 \div 10^7$. By
means of $N$-body simulations of gravitationally unstable stellar galactic we
have investigated the algorithms parallelization efficiency for various Nvidia
Tesla graphics processors~(K20, K40, K80). Particular attention was paid to the
parallel performance of simulations and accuracy of the numerical solution by
comparing single and double floating-point precisions~(SP and DP). We showed
that the double-precision simulations are slower by a factor of~$1.7$ than the
single-precision runs performed on Nvidia Tesla K-Series processors. We also
claim that application of the single-precision operations leads to incorrect
result in the evolution of the non-axisymmetric gravitating $N$-body systems.
In particular, it leads to significant quantitative and even qualitative
distortions in the galactic disk evolution. For instance, after $10^4$
integration time steps for the single-precision numbers the total energy,
momentum, and angular momentum of a system with $N = 2^{20}$ conserve with
accuracy of $10^{-3}$, $10^{-2}$ and $10^{-3}$ respectively, in comparison to
the double-precision simulations these values are $10^{-5}$, $10^{-15}$ and
$10^{-13}$, respectively. Our estimations evidence in favour of usage of the
second-order accuracy schemes with double-precision numbers since it is more
efficient than in the fourth-order schemes with single-precision numbers.
| physics.comp-ph astro-ph.GA | this paper focuses on the parallel implementation of a direct nbody methodparticleparticle algorithm and the application of multiple gpus for galactic dynamics simulations application of a hybrid openmpcuda technology is considered for models with a number of particles n sim 105 div 107 by means of nbody simulations of gravitationally unstable stellar galactic we have investigated the algorithms parallelization efficiency for various nvidia tesla graphics processorsk20 k40 k80 particular attention was paid to the parallel performance of simulations and accuracy of the numerical solution by comparing single and double floatingpoint precisionssp and dp we showed that the doubleprecision simulations are slower by a factor of17 than the singleprecision runs performed on nvidia tesla kseries processors we also claim that application of the singleprecision operations leads to incorrect result in the evolution of the nonaxisymmetric gravitating nbody systems in particular it leads to significant quantitative and even qualitative distortions in the galactic disk evolution for instance after 104 integration time steps for the singleprecision numbers the total energy momentum and angular momentum of a system with n 220 conserve with accuracy of 103 102 and 103 respectively in comparison to the doubleprecision simulations these values are 105 1015 and 1013 respectively our estimations evidence in favour of usage of the secondorder accuracy schemes with doubleprecision numbers since it is more efficient than in the fourthorder schemes with singleprecision numbers | [['this', 'paper', 'focuses', 'on', 'the', 'parallel', 'implementation', 'of', 'a', 'direct', 'nbody', 'methodparticleparticle', 'algorithm', 'and', 'the', 'application', 'of', 'multiple', 'gpus', 'for', 'galactic', 'dynamics', 'simulations', 'application', 'of', 'a', 'hybrid', 'openmpcuda', 'technology', 'is', 'considered', 'for', 'models', 'with', 'a', 'number', 'of', 'particles', 'n', 'sim', '105', 'div', '107', 'by', 'means', 'of', 'nbody', 'simulations', 'of', 'gravitationally', 'unstable', 'stellar', 'galactic', 'we', 'have', 'investigated', 'the', 'algorithms', 'parallelization', 'efficiency', 'for', 'various', 'nvidia', 'tesla', 'graphics', 'processorsk20', 'k40', 'k80', 'particular', 'attention', 'was', 'paid', 'to', 'the', 'parallel', 'performance', 'of', 'simulations', 'and', 'accuracy', 'of', 'the', 'numerical', 'solution', 'by', 'comparing', 'single', 'and', 'double', 'floatingpoint', 'precisionssp', 'and', 'dp', 'we', 'showed', 'that', 'the', 'doubleprecision', 'simulations', 'are', 'slower', 'by', 'a', 'factor', 'of17', 'than', 'the', 'singleprecision', 'runs', 'performed', 'on', 'nvidia', 'tesla', 'kseries', 'processors', 'we', 'also', 'claim', 'that', 'application', 'of', 'the', 'singleprecision', 'operations', 'leads', 'to', 'incorrect', 'result', 'in', 'the', 'evolution', 'of', 'the', 'nonaxisymmetric', 'gravitating', 'nbody', 'systems', 'in', 'particular', 'it', 'leads', 'to', 'significant', 'quantitative', 'and', 'even', 'qualitative', 'distortions', 'in', 'the', 'galactic', 'disk', 'evolution', 'for', 'instance', 'after', '104', 'integration', 'time', 'steps', 'for', 'the', 'singleprecision', 'numbers', 'the', 'total', 'energy', 'momentum', 'and', 'angular', 'momentum', 'of', 'a', 'system', 'with', 'n', '220', 'conserve', 'with', 'accuracy', 'of', '103', '102', 'and', '103', 'respectively', 'in', 'comparison', 'to', 'the', 'doubleprecision', 'simulations', 'these', 'values', 'are', '105', '1015', 'and', '1013', 'respectively', 'our', 'estimations', 'evidence', 'in', 'favour', 'of', 'usage', 'of', 'the', 'secondorder', 'accuracy', 'schemes', 'with', 'doubleprecision', 'numbers', 'since', 'it', 'is', 'more', 'efficient', 'than', 'in', 'the', 'fourthorder', 'schemes', 'with', 'singleprecision', 'numbers']] | [-0.15735392098589987, 0.07928559428442636, -0.021422686031395903, 0.04060795771420089, -0.0006006592029734747, -0.07834977346647065, 0.04823299678277441, 0.36609739474027136, -0.1606309573263778, -0.4167355117554377, 0.07416698051279777, -0.26737872161694604, -0.0528248755160478, 0.279515809903387, 0.006863705970317824, 0.09352982742458542, 0.13273256547524528, -0.01585305877857276, -0.09596829812653596, -0.3023614206550909, 0.2168154473110917, 0.10505660498997063, 0.2072906020226323, 0.0038796366918956793, 0.0932002649684104, -0.07584321691449857, -0.023712683940954906, -0.02838971250457689, -0.12000824224618814, 0.06576492760047715, 0.2046276218344149, 0.08942772819968273, 0.2872176008282362, -0.45252379684617544, -0.1282770076567041, 0.04577183548566869, 0.1589897523993256, 0.05480025726657394, -0.07114000784862842, -0.21366098412545398, 0.14364948944967182, -0.2135029737297113, -0.0959336400446773, -0.08161457743387603, 0.03148284127486737, 0.04473792604819339, -0.26903890627155697, 0.11252129778988872, 0.02050265442604931, 0.07212506876801074, -0.03618814482407678, -0.1396961015224016, 0.013155637579724757, 0.017122646804637043, 0.020985900646857254, 0.07103622664102918, 0.14891961311514024, -0.10925544063814284, -0.13157358457933047, 0.4264460242952087, -0.05650984054084672, -0.18428800036391685, 0.17870408707053034, -0.1260498253395781, -0.13539874510856212, 0.14445919687672618, 0.1890794975926318, 0.12321183170466352, -0.06031869864818873, 0.07435585584919734, 0.007535838505386242, 0.21240215881386706, 0.08991433223738048, -0.005771087145798707, 0.16711192335683986, 0.18024558481140826, -0.0013985556589822018, 0.09459034961904374, -0.13120818587984623, -0.14070562909598397, -0.22410025239852466, -0.1703150045203594, -0.14684244477289862, 0.056609197213089955, -0.14039016269128166, -0.08867705394056559, 0.3432981770560478, 0.17646343981115414, 0.16253982871837383, 0.0808206077417708, 0.3536347120700936, 0.08172490281945752, 0.09263753473455186, 0.12137049342553448, 0.21972886867609173, 0.11953707995832831, 0.12110605697567475, -0.21571734385153313, -0.024416564689350446, 0.013501422974513844] |
1,803.01191 | On the twisted tensor product of small dg categories | Given two small dg categories $C,D$, defined over a field, we introduce their
(non-symmetric) twisted tensor product $C\overset{\sim}{\otimes} D$. We show
that $-\overset{\sim}{\otimes} D$ is left adjoint to the functor $Coh(D,-)$,
where $Coh(D,E)$ is the dg category of dg functors $D\to E$ and their coherent
natural transformations. This adjunction holds in the category of small dg
categories (not in the homotopy category of dg categories $\mathrm{Hot}$). We
show that for $C,D$ cofibrant, the adjunction descends to the corresponding
adjunction in the homotopy category. Then comparison with a result of To\"{e}n
shows that, for $C,D$ cofibtant, $C\overset{\sim}{\otimes} D$ is isomorphic to
$C\otimes D$, as an object of the homotopy category $\mathrm{Hot}$.
| math.CT math.KT | given two small dg categories cd defined over a field we introduce their nonsymmetric twisted tensor product coversetsimotimes d we show that oversetsimotimes d is left adjoint to the functor cohd where cohde is the dg category of dg functors dto e and their coherent natural transformations this adjunction holds in the category of small dg categories not in the homotopy category of dg categories mathrmhot we show that for cd cofibrant the adjunction descends to the corresponding adjunction in the homotopy category then comparison with a result of toen shows that for cd cofibtant coversetsimotimes d is isomorphic to cotimes d as an object of the homotopy category mathrmhot | [['given', 'two', 'small', 'dg', 'categories', 'cd', 'defined', 'over', 'a', 'field', 'we', 'introduce', 'their', 'nonsymmetric', 'twisted', 'tensor', 'product', 'coversetsimotimes', 'd', 'we', 'show', 'that', 'oversetsimotimes', 'd', 'is', 'left', 'adjoint', 'to', 'the', 'functor', 'cohd', 'where', 'cohde', 'is', 'the', 'dg', 'category', 'of', 'dg', 'functors', 'dto', 'e', 'and', 'their', 'coherent', 'natural', 'transformations', 'this', 'adjunction', 'holds', 'in', 'the', 'category', 'of', 'small', 'dg', 'categories', 'not', 'in', 'the', 'homotopy', 'category', 'of', 'dg', 'categories', 'mathrmhot', 'we', 'show', 'that', 'for', 'cd', 'cofibrant', 'the', 'adjunction', 'descends', 'to', 'the', 'corresponding', 'adjunction', 'in', 'the', 'homotopy', 'category', 'then', 'comparison', 'with', 'a', 'result', 'of', 'toen', 'shows', 'that', 'for', 'cd', 'cofibtant', 'coversetsimotimes', 'd', 'is', 'isomorphic', 'to', 'cotimes', 'd', 'as', 'an', 'object', 'of', 'the', 'homotopy', 'category', 'mathrmhot']] | [-0.15680804311334356, -0.006821872100237456, -0.0396976564673013, 0.08374651444918367, -0.07613949034837823, -0.16102185290233761, -0.04535017563395348, 0.4152979544710879, -0.4742019841739652, -0.17283479376312563, 0.021069728254623638, -0.16403712414937807, -0.08997390975755658, 0.11619573981300288, -0.2507285234728353, -0.15125774710402623, 0.09323945148007981, 0.138601724629053, -0.04179525919322509, -0.21235449316080512, 0.4710218761043221, -0.08078344969772826, 0.20999167389352663, 0.02690189448185265, 0.07956183188499007, -0.057095829942423446, -0.015438975337162321, 0.011819526859029544, -0.09705053860378422, 0.1461166449184484, 0.3502038876142572, 0.07662411268763974, 0.17578793305894544, -0.3281151584221744, -0.015629990875501844, 0.16990529969060683, 0.11548253106821886, 0.0023853496360756897, -0.017165925335504262, -0.32744788734571023, 0.18149004960729392, -0.2841813756682563, 0.0028682438104285623, -0.05835173186827816, 0.16489620501855753, 0.002628589879867493, -0.3173747538958731, -0.05867037762529399, 0.09215974805913135, 0.10346587709671654, -0.11850541768431225, -0.07760426044628463, -0.1419660361899136, 0.07142499877669502, -0.02661577487757028, 0.06489607932813027, 0.11332205574338634, -0.11720680048935772, -0.10621965552826285, 0.39259517510585923, -0.10059283459193859, -0.21233775162973495, 0.17922326322991913, -0.15773509553286666, -0.13758375982333923, 0.1323350676034084, -0.04113240139193687, 0.21908144946849228, 0.03410968107773977, 0.2289108634263268, -0.1389806178126224, 0.07270061948756669, 0.0897531940273064, 0.00678176473022676, 0.07556459919421696, 0.1456796403873858, 0.042948107111870366, 0.12356483036487856, -0.04935341386818418, -0.03257014663141294, -0.36318658200987414, -0.22834112388355768, -0.061782100961507096, 0.1473557534629043, -0.11173453970852779, -0.16920612166252205, 0.3725226744644198, 0.11821783593326222, 0.17472495748627218, 0.1627998390536317, 0.22674024580776983, 0.03068383735508713, 0.07235204654417056, 0.0031969195423538193, 0.17236989615119847, 0.2961969131092523, 0.0040480065120694535, -0.0828122769381997, -0.05711119928324193, 0.26713506328672465] |
1,803.01192 | Local Strain Heterogeneity Influences the Optoelectronic Properties of
Halide Perovskites | Halide perovskites are promising semiconductors for inexpensive,
high-performance optoelectronics. Despite a remarkable defect tolerance
compared to conventional semiconductors, perovskite thin films still show
substantial microscale heterogeneity in key properties such as luminescence
efficiency and device performance. This behavior has been attributed to spatial
fluctuations in the population of sub-bandgap electronic states that act as
trap-mediated non-radiative recombination sites. However, the origin of the
variations, trap states and extent of the defect tolerance remains a topic of
debate, and a precise understanding is critical to the rational design of
defect management strategies. By combining scanning X-ray diffraction beamlines
at two different synchrotrons with high-resolution transmission electron
microscopy, we reveal levels of heterogeneity on the ten-micrometer scale
(super-grains) and even ten-nanometer scale (sub-grain domains). We find that
local strain is associated with enhanced defect concentrations, and
correlations between the local structure and time-resolved photoluminescence
reveal that these strain-related defects are the cause of non-radiative
recombination. We reveal a direct connection between defect concentrations and
non-radiative losses, as well as complex heterogeneity across multiple length
scales, shedding new light on the presence and influence of structural defects
in halide perovskites.
| cond-mat.mtrl-sci | halide perovskites are promising semiconductors for inexpensive highperformance optoelectronics despite a remarkable defect tolerance compared to conventional semiconductors perovskite thin films still show substantial microscale heterogeneity in key properties such as luminescence efficiency and device performance this behavior has been attributed to spatial fluctuations in the population of subbandgap electronic states that act as trapmediated nonradiative recombination sites however the origin of the variations trap states and extent of the defect tolerance remains a topic of debate and a precise understanding is critical to the rational design of defect management strategies by combining scanning xray diffraction beamlines at two different synchrotrons with highresolution transmission electron microscopy we reveal levels of heterogeneity on the tenmicrometer scale supergrains and even tennanometer scale subgrain domains we find that local strain is associated with enhanced defect concentrations and correlations between the local structure and timeresolved photoluminescence reveal that these strainrelated defects are the cause of nonradiative recombination we reveal a direct connection between defect concentrations and nonradiative losses as well as complex heterogeneity across multiple length scales shedding new light on the presence and influence of structural defects in halide perovskites | [['halide', 'perovskites', 'are', 'promising', 'semiconductors', 'for', 'inexpensive', 'highperformance', 'optoelectronics', 'despite', 'a', 'remarkable', 'defect', 'tolerance', 'compared', 'to', 'conventional', 'semiconductors', 'perovskite', 'thin', 'films', 'still', 'show', 'substantial', 'microscale', 'heterogeneity', 'in', 'key', 'properties', 'such', 'as', 'luminescence', 'efficiency', 'and', 'device', 'performance', 'this', 'behavior', 'has', 'been', 'attributed', 'to', 'spatial', 'fluctuations', 'in', 'the', 'population', 'of', 'subbandgap', 'electronic', 'states', 'that', 'act', 'as', 'trapmediated', 'nonradiative', 'recombination', 'sites', 'however', 'the', 'origin', 'of', 'the', 'variations', 'trap', 'states', 'and', 'extent', 'of', 'the', 'defect', 'tolerance', 'remains', 'a', 'topic', 'of', 'debate', 'and', 'a', 'precise', 'understanding', 'is', 'critical', 'to', 'the', 'rational', 'design', 'of', 'defect', 'management', 'strategies', 'by', 'combining', 'scanning', 'xray', 'diffraction', 'beamlines', 'at', 'two', 'different', 'synchrotrons', 'with', 'highresolution', 'transmission', 'electron', 'microscopy', 'we', 'reveal', 'levels', 'of', 'heterogeneity', 'on', 'the', 'tenmicrometer', 'scale', 'supergrains', 'and', 'even', 'tennanometer', 'scale', 'subgrain', 'domains', 'we', 'find', 'that', 'local', 'strain', 'is', 'associated', 'with', 'enhanced', 'defect', 'concentrations', 'and', 'correlations', 'between', 'the', 'local', 'structure', 'and', 'timeresolved', 'photoluminescence', 'reveal', 'that', 'these', 'strainrelated', 'defects', 'are', 'the', 'cause', 'of', 'nonradiative', 'recombination', 'we', 'reveal', 'a', 'direct', 'connection', 'between', 'defect', 'concentrations', 'and', 'nonradiative', 'losses', 'as', 'well', 'as', 'complex', 'heterogeneity', 'across', 'multiple', 'length', 'scales', 'shedding', 'new', 'light', 'on', 'the', 'presence', 'and', 'influence', 'of', 'structural', 'defects', 'in', 'halide', 'perovskites']] | [-0.115575146701936, 0.14566029827920315, -0.022650897960968152, 0.05243893993832424, -0.0020420398644131164, -0.16268992613312666, 0.06421007999976966, 0.47070119084547396, -0.2905428427544868, -0.2990240973430564, 0.0312855407126177, -0.3040732065514337, -0.14971175161949563, 0.18999231565723437, -0.023047972802052518, 0.034891755614966234, 0.005742314008428999, -0.11774059080736428, -0.03497720315594368, -0.17116870999475592, 0.26296253222212923, 0.10169629803757467, 0.37677339118216996, 0.1552383436811278, 0.050368325676335306, -0.024916422644468104, 0.06010499843219093, 0.020840848368369854, -0.11491001214582629, 0.12318315062032564, 0.2745350195465384, -0.01967510004191275, 0.2467540673893856, -0.4902745490569783, -0.28140768049406295, 0.01062494173200558, 0.1679674517338002, 0.11656542229162448, -0.12394456263586029, -0.2250937633222708, 0.07417286263365025, -0.09474430081931844, -0.10155178719445679, -0.08490854512416737, -0.013575801613826669, 0.05227410150552675, -0.2044313516393152, 0.1090035516004402, -0.007421670668206744, 0.10542999418786443, -0.10068388156208169, -0.1021031727533504, -0.054903813091147204, 0.1134280274146358, 0.05094063518007043, -0.0303070152611168, 0.2267757562955882, -0.12862110020385287, -0.14979343103123424, 0.3743238146568689, -0.005562359158395101, -0.06803325354121625, 0.21249939703493906, -0.181937503134933, -0.09727628651054819, 0.17673926472248833, 0.13590196861743764, 0.10535401801335746, -0.11602505155283523, 0.043408676254488375, 0.048186864152186266, 0.212961550424908, 0.0932006620695693, 0.18315238513953416, 0.25387113766729547, 0.22330495529572741, 0.0475371091806269, 0.09202082576761629, -0.1339003050338563, -0.041626426676014926, -0.16940323946492636, -0.1779312754512395, -0.16011561167618746, 0.09776043302696527, -0.0837208664988398, -0.20271232616379048, 0.3768086176183399, 0.12278973752551753, 0.157149340043796, -0.054140214850517426, 0.2470848824488475, 0.04084760899372273, 0.10580505197836117, -0.020715195948824934, 0.21829206377024885, 0.13247076587171963, 0.10581558624305573, -0.30514704934625037, 0.12504565902307388, -0.043067043082808835] |
1,803.01193 | Evidence for a dynamical ground state in a frustrated pyrohafnate
Tb2Hf2O7 | We report the physical properties of Tb2Hf2O7 based on ac magnetic
susceptibility \chi_ac(T), dc magnetic susceptibility \chi(T), isothermal
magnetization M(H), and heat capacity C_p(T) measurements combined with muon
spin relaxation (\muSR) and neutron powder diffraction measurements. No
evidence for long-range magnetic order is found down to 0.1 K. However,
\chi_ac(T) data present a frequency-dependent broad peak (near 0.9 K at 16 Hz)
indicating slow spin dynamics. The slow spin dynamics is further evidenced from
the \muSR data (characterized by a stretched exponential behavior) which show
persistent spin fluctuations down to 0.3 K. The neutron powder diffraction data
collected at 0.1 K show a broad peak of magnetic origin (diffuse scattering)
but no magnetic Bragg peaks. The analysis of the diffuse scattering data
reveals a dominant antiferromagnetic interaction in agreement with the negative
Weiss temperature. The absence of long-range magnetic order and the presence of
slow spin dynamics and persistent spin fluctuations together reflect a
dynamical ground state in Tb2Hf2O7.
| cond-mat.str-el cond-mat.mtrl-sci | we report the physical properties of tb2hf2o7 based on ac magnetic susceptibility chi_act dc magnetic susceptibility chit isothermal magnetization mh and heat capacity c_pt measurements combined with muon spin relaxation musr and neutron powder diffraction measurements no evidence for longrange magnetic order is found down to 01 k however chi_act data present a frequencydependent broad peak near 09 k at 16 hz indicating slow spin dynamics the slow spin dynamics is further evidenced from the musr data characterized by a stretched exponential behavior which show persistent spin fluctuations down to 03 k the neutron powder diffraction data collected at 01 k show a broad peak of magnetic origin diffuse scattering but no magnetic bragg peaks the analysis of the diffuse scattering data reveals a dominant antiferromagnetic interaction in agreement with the negative weiss temperature the absence of longrange magnetic order and the presence of slow spin dynamics and persistent spin fluctuations together reflect a dynamical ground state in tb2hf2o7 | [['we', 'report', 'the', 'physical', 'properties', 'of', 'tb2hf2o7', 'based', 'on', 'ac', 'magnetic', 'susceptibility', 'chi_act', 'dc', 'magnetic', 'susceptibility', 'chit', 'isothermal', 'magnetization', 'mh', 'and', 'heat', 'capacity', 'c_pt', 'measurements', 'combined', 'with', 'muon', 'spin', 'relaxation', 'musr', 'and', 'neutron', 'powder', 'diffraction', 'measurements', 'no', 'evidence', 'for', 'longrange', 'magnetic', 'order', 'is', 'found', 'down', 'to', '01', 'k', 'however', 'chi_act', 'data', 'present', 'a', 'frequencydependent', 'broad', 'peak', 'near', '09', 'k', 'at', '16', 'hz', 'indicating', 'slow', 'spin', 'dynamics', 'the', 'slow', 'spin', 'dynamics', 'is', 'further', 'evidenced', 'from', 'the', 'musr', 'data', 'characterized', 'by', 'a', 'stretched', 'exponential', 'behavior', 'which', 'show', 'persistent', 'spin', 'fluctuations', 'down', 'to', '03', 'k', 'the', 'neutron', 'powder', 'diffraction', 'data', 'collected', 'at', '01', 'k', 'show', 'a', 'broad', 'peak', 'of', 'magnetic', 'origin', 'diffuse', 'scattering', 'but', 'no', 'magnetic', 'bragg', 'peaks', 'the', 'analysis', 'of', 'the', 'diffuse', 'scattering', 'data', 'reveals', 'a', 'dominant', 'antiferromagnetic', 'interaction', 'in', 'agreement', 'with', 'the', 'negative', 'weiss', 'temperature', 'the', 'absence', 'of', 'longrange', 'magnetic', 'order', 'and', 'the', 'presence', 'of', 'slow', 'spin', 'dynamics', 'and', 'persistent', 'spin', 'fluctuations', 'together', 'reflect', 'a', 'dynamical', 'ground', 'state', 'in', 'tb2hf2o7']] | [-0.19773351068157632, 0.26326489407987375, -0.0434802205414529, 0.05007636782736962, -0.08794264249788349, -0.10561296733609359, 0.11056768171382463, 0.38211807765208994, -0.2682149446195668, -0.3250900162205954, 0.038543640628492665, -0.3856806861367195, -0.01559835696551403, 0.20771062418011724, 0.1427493426818282, 0.009600150372216086, -0.03024747989668398, 0.04187201818297054, -0.1131544541552734, -0.13734642431810262, 0.21767064139460493, 0.030577735527519398, 0.31565882878342444, 0.0980168204816877, 0.05883565028553983, 0.027086221165866085, 0.08034150446854105, 0.02814870988534894, -0.1413066810136735, -0.03856909562163292, 0.24123144642172595, -0.08616882103204632, 0.10875629021483622, -0.4231757127389217, -0.23547661227506295, 0.03588398882917538, 0.12387957893071731, 0.06241701171617765, -0.061586280462367665, -0.2526606995564927, 0.033927636493922796, -0.069985044500227, -0.15151121360316552, -0.16275804062339827, -0.020153695076798938, -0.011763675188034726, -0.2763844578627758, 0.2203536935441291, 0.11812597333811739, 0.1979536212547712, -0.14116815162176016, -0.13246267158419464, -0.03214320356536443, -0.01428456753077116, 0.08320579558587188, 0.10405721093949144, 0.20477493211202868, -0.07882625805688606, -0.11797938301379253, 0.2548347270104346, -0.09422032773912926, 0.017965803059280677, 0.12787565861674394, -0.3046403651742656, -0.10793431232250325, 0.2603840302931038, 0.10111984955465753, 0.08731966385221891, -0.18616950889206996, 0.025197751223922347, 0.021403145537397285, 0.25472914473195174, 0.03894363280984864, 0.02139678163038512, 0.28390235119279783, 0.18617918523277638, -0.0017121185928250953, 0.1403176202942991, -0.22980600221777353, -0.04624799295524313, -0.18758798909676114, -0.06535394366602205, -0.1799177739941248, 0.14091628966749212, -0.11437086907184274, -0.13564541910413155, 0.3097458405503232, 0.13609829623026737, 0.19860060222945206, -0.022093321112945534, 0.284890341922451, 0.08818776814628891, 0.04816381765565105, 0.10205761678560428, 0.2038898714373161, 0.27024693914190834, 0.23177275641459474, -0.38043979692249114, 0.09109455197278386, -0.10172798459352866] |
1,803.01194 | A Surface Impedance-Based Three-Channel Acoustic Metasurface
Retroreflector | We propose the design and measurement of an acoustic metasurface
retroreflector that works at three discrete incident angles. An impedance model
is developed such that for acoustic waves impinging at -60 degrees, the
reflected wave is defined by the surface impedance of the metasurface, which is
realized by a periodic grating. At 0 and 60 degrees, the retroreflection
condition can be fulfilled by the diffraction of the surface. The thickness of
the metasurface is about half of the operating wavelength and the
retroreflector functions without parasitic diffraction associated with
conventional gradient-index metasurfaces. Such highly efficient and compact
retroreflectors open up possibilities in metamaterial-based acoustic sensing
and communications.
| physics.app-ph | we propose the design and measurement of an acoustic metasurface retroreflector that works at three discrete incident angles an impedance model is developed such that for acoustic waves impinging at 60 degrees the reflected wave is defined by the surface impedance of the metasurface which is realized by a periodic grating at 0 and 60 degrees the retroreflection condition can be fulfilled by the diffraction of the surface the thickness of the metasurface is about half of the operating wavelength and the retroreflector functions without parasitic diffraction associated with conventional gradientindex metasurfaces such highly efficient and compact retroreflectors open up possibilities in metamaterialbased acoustic sensing and communications | [['we', 'propose', 'the', 'design', 'and', 'measurement', 'of', 'an', 'acoustic', 'metasurface', 'retroreflector', 'that', 'works', 'at', 'three', 'discrete', 'incident', 'angles', 'an', 'impedance', 'model', 'is', 'developed', 'such', 'that', 'for', 'acoustic', 'waves', 'impinging', 'at', '60', 'degrees', 'the', 'reflected', 'wave', 'is', 'defined', 'by', 'the', 'surface', 'impedance', 'of', 'the', 'metasurface', 'which', 'is', 'realized', 'by', 'a', 'periodic', 'grating', 'at', '0', 'and', '60', 'degrees', 'the', 'retroreflection', 'condition', 'can', 'be', 'fulfilled', 'by', 'the', 'diffraction', 'of', 'the', 'surface', 'the', 'thickness', 'of', 'the', 'metasurface', 'is', 'about', 'half', 'of', 'the', 'operating', 'wavelength', 'and', 'the', 'retroreflector', 'functions', 'without', 'parasitic', 'diffraction', 'associated', 'with', 'conventional', 'gradientindex', 'metasurfaces', 'such', 'highly', 'efficient', 'and', 'compact', 'retroreflectors', 'open', 'up', 'possibilities', 'in', 'metamaterialbased', 'acoustic', 'sensing', 'and', 'communications']] | [-0.18994434192672233, 0.2127993736684292, -0.021618765748375766, -0.06936835072429798, -0.10573275804206311, -0.1513018914080599, 0.00397782454650118, 0.43990318731309097, -0.257013091847962, -0.2978292600399701, 0.10277909283971232, -0.28972734656254545, -0.1415221702446726, 0.25106214012767875, -0.022186891010431486, 0.0942415415405113, -0.012809436463655155, -0.03906616534184769, -0.02202340995753619, -0.1257292635360228, 0.2954196922707363, 0.061573563530936695, 0.31586770574066125, 0.06695045028142979, 0.15987952293775906, 0.053992511874291105, 0.03298865998964583, -0.01877598544674116, -0.08448330920135763, 0.08045945591597914, 0.26893905906232995, 0.05216648689009876, 0.19005646936543216, -0.44987237848619993, -0.2593609043614608, -0.01914247088395407, 0.10168980973148196, 0.07521210022805973, -0.060807954206644935, -0.2837660921493841, 0.05566114192680569, -0.06927029298026567, -0.2083396565008073, 0.038399728998611465, -0.05024833069835728, 0.003939416938435252, -0.22736351954463485, -0.0039031372087894476, 0.03977030240190781, 0.06395451704074985, -0.04929897619115415, -0.0746880512614952, -0.03761867936874661, 0.04362062601128889, -0.04339484370935917, 0.007571144584374868, 0.1189732244325297, -0.08762949094541858, -0.07644221455154714, 0.3833094437249771, -0.03374035112455348, -0.1843723137384263, 0.12261979623097126, -0.1524838676858937, 0.06809803185479663, 0.21603715448927518, 0.18247674370759, 0.10271027043601062, -0.13315581990771483, 0.03995478276552841, -0.017110704883762252, 0.20143942665809192, 0.21640312877292178, 0.057366092162746414, 0.23942024708577545, 0.1853645560288123, 0.07996163341199335, 0.11833958293280834, -0.14251338727674318, 0.08442553924831832, -0.28227961398487056, -0.10573679878850789, -0.2009129581067746, 0.020673620728226424, -0.09604042522959023, -0.16147530496677506, 0.407837988147251, 0.08642092862854077, 0.11046258717879792, -0.006818823310738064, 0.3585871042135372, 0.1267511946588176, 0.1055909016639621, 0.0512103097182568, 0.28905638108230153, 0.14610903172658007, 0.11283044305534284, -0.2206586617802348, -0.009443716441986159, -0.03959516415842504] |
1,803.01195 | The groups $G_{k+1}^{k}$ and fundamental groups of configuration spaces | In \cite{HigherGnk}, the author has constructed natural maps from fundamental
groups of topological spaces (restricted configuration spaces) to the groups
$G_{n}^{k}$. In the present paper, we show that in the case of $n=k+1$, the
group $G_{k+1}^{k}$ is isomorphic to the fundamental group of some (quotient
space of) some configuration space. In particular, this leads to the solution
of word and conjugacy problems in $G_{4}^{3}$ and sheds light on $G_{k+1}^{k}$
for higher $k$.
| math.GT | in citehighergnk the author has constructed natural maps from fundamental groups of topological spaces restricted configuration spaces to the groups g_nk in the present paper we show that in the case of nk1 the group g_k1k is isomorphic to the fundamental group of some quotient space of some configuration space in particular this leads to the solution of word and conjugacy problems in g_43 and sheds light on g_k1k for higher k | [['in', 'citehighergnk', 'the', 'author', 'has', 'constructed', 'natural', 'maps', 'from', 'fundamental', 'groups', 'of', 'topological', 'spaces', 'restricted', 'configuration', 'spaces', 'to', 'the', 'groups', 'g_nk', 'in', 'the', 'present', 'paper', 'we', 'show', 'that', 'in', 'the', 'case', 'of', 'nk1', 'the', 'group', 'g_k1k', 'is', 'isomorphic', 'to', 'the', 'fundamental', 'group', 'of', 'some', 'quotient', 'space', 'of', 'some', 'configuration', 'space', 'in', 'particular', 'this', 'leads', 'to', 'the', 'solution', 'of', 'word', 'and', 'conjugacy', 'problems', 'in', 'g_43', 'and', 'sheds', 'light', 'on', 'g_k1k', 'for', 'higher', 'k']] | [-0.15603287405033103, 0.09779621358029544, -0.08646264683236093, 0.04460930487103349, -0.08814921489615432, -0.05673011427964358, 0.05470939680440899, 0.3785360843381461, -0.32514658418264897, -0.24058202084373026, 0.10579638500006266, -0.25346547241925316, -0.16617895367637495, 0.22022973904933998, -0.16025428041158354, -0.010988943059654796, 0.025452165864408016, 0.11681391594602782, -0.10022948660052326, -0.29071330878821966, 0.45045103603864417, -0.0404726947822115, 0.2470851752167458, 0.008819758659228683, 0.09360595422742121, 0.0008397825158146374, -0.03141486595781958, -0.013804327002349858, -0.1354651431154386, 0.1607800964950858, 0.27506405827315417, 0.08640064719485749, 0.2317262511676424, -0.35788381628363447, -0.19536535263828494, 0.1812924035030472, 0.14440192814971156, 0.0408962820930516, -0.04379454439485391, -0.2782652582939002, 0.09349475885220968, -0.10891664619831477, -0.08933326543089659, -0.05842073250781087, 0.05694283647736644, -0.017887217074851778, -0.17173168927376323, -0.01009099288186168, 0.0715737825478701, 0.06462703295640976, -0.09329281541902353, -0.10021821479313076, -0.01460960612851469, 0.15308130407185458, 0.042538280663874876, 0.05936722985386629, 0.030944538432830834, -0.09436977731050267, -0.11910817418795298, 0.4774707148728125, -0.04493715575731853, -0.20268276018802733, 0.16512964057448484, -0.2139193386743393, -0.22975523406228818, 0.09572837840053527, 0.15556611615123556, 0.13772487130892627, -0.010979551082367407, 0.18246119834229296, -0.1290588183054591, 0.10622507241308032, 0.06870099183117204, 0.026078860583605572, 0.0824824485436479, 0.14188953314784586, 0.12648364605710788, 0.18099978623692603, 0.02602373150190996, -0.028263554502593574, -0.308198783053633, -0.2196525740711128, -0.13128939881811247, 0.028107504781527334, -0.09663433182311779, -0.14486192112706384, 0.41110919014660313, 0.1217600127805353, 0.16495423320242586, 0.06021664821652367, 0.1913984157350462, 0.04934282577596605, 0.05062475841601982, 0.05072631172644084, 0.17260823875189732, 0.18721504318733317, 0.0039040997473742158, -0.15034035669026813, -0.01791846498107428, 0.1713180166997892] |
1,803.01196 | Transient Structured Fluctuations in a Two-dimensional System with
Multiple Ordered Phases | We report the structure of transient fluctuations in the liquid phase of a
two-dimensional system that exhibits several ordered phases with different
symmetries. The density-temperature phase diagram of the system studied,
composed of particles with a repulsive shouldered soft-core pair interaction,
has regions with stable liquid and hexatic phases, a square solid phase, two
separate hexagonal solid phases and a quasi-crystalline phase with 12-fold
symmetry. The structure of a fluctuation was determined by computing the
same-time aperture cross correlation function of particle configurations. Along
a low-temperature isotherm that intersects all the ordered phases we find that
the liquid phase exhibits structured fluctuation with hexagonal symmetry near
both liquid-hexatic transition lines. Along the same isotherm and in the stable
liquid between the lower density hexatic-to-liquid and the higher density
liquid-to-square solid transitions, we find that transient hexagonal ordered
fluctuations dominate the liquid region near the hexatic-to-liquid transition
and square ordered fluctuations dominate the liquid region near the liquid-to
square solid transition, but that both structured fluctuations occur at all
densities between these transition lines. At a higher temperature, at phase
points in the liquid above but close to the density maximum of an underlying
transition, there are ordered fluctuations that can be correlated with the
structure of the lower temperature phase.
| cond-mat.soft | we report the structure of transient fluctuations in the liquid phase of a twodimensional system that exhibits several ordered phases with different symmetries the densitytemperature phase diagram of the system studied composed of particles with a repulsive shouldered softcore pair interaction has regions with stable liquid and hexatic phases a square solid phase two separate hexagonal solid phases and a quasicrystalline phase with 12fold symmetry the structure of a fluctuation was determined by computing the sametime aperture cross correlation function of particle configurations along a lowtemperature isotherm that intersects all the ordered phases we find that the liquid phase exhibits structured fluctuation with hexagonal symmetry near both liquidhexatic transition lines along the same isotherm and in the stable liquid between the lower density hexatictoliquid and the higher density liquidtosquare solid transitions we find that transient hexagonal ordered fluctuations dominate the liquid region near the hexatictoliquid transition and square ordered fluctuations dominate the liquid region near the liquidto square solid transition but that both structured fluctuations occur at all densities between these transition lines at a higher temperature at phase points in the liquid above but close to the density maximum of an underlying transition there are ordered fluctuations that can be correlated with the structure of the lower temperature phase | [['we', 'report', 'the', 'structure', 'of', 'transient', 'fluctuations', 'in', 'the', 'liquid', 'phase', 'of', 'a', 'twodimensional', 'system', 'that', 'exhibits', 'several', 'ordered', 'phases', 'with', 'different', 'symmetries', 'the', 'densitytemperature', 'phase', 'diagram', 'of', 'the', 'system', 'studied', 'composed', 'of', 'particles', 'with', 'a', 'repulsive', 'shouldered', 'softcore', 'pair', 'interaction', 'has', 'regions', 'with', 'stable', 'liquid', 'and', 'hexatic', 'phases', 'a', 'square', 'solid', 'phase', 'two', 'separate', 'hexagonal', 'solid', 'phases', 'and', 'a', 'quasicrystalline', 'phase', 'with', '12fold', 'symmetry', 'the', 'structure', 'of', 'a', 'fluctuation', 'was', 'determined', 'by', 'computing', 'the', 'sametime', 'aperture', 'cross', 'correlation', 'function', 'of', 'particle', 'configurations', 'along', 'a', 'lowtemperature', 'isotherm', 'that', 'intersects', 'all', 'the', 'ordered', 'phases', 'we', 'find', 'that', 'the', 'liquid', 'phase', 'exhibits', 'structured', 'fluctuation', 'with', 'hexagonal', 'symmetry', 'near', 'both', 'liquidhexatic', 'transition', 'lines', 'along', 'the', 'same', 'isotherm', 'and', 'in', 'the', 'stable', 'liquid', 'between', 'the', 'lower', 'density', 'hexatictoliquid', 'and', 'the', 'higher', 'density', 'liquidtosquare', 'solid', 'transitions', 'we', 'find', 'that', 'transient', 'hexagonal', 'ordered', 'fluctuations', 'dominate', 'the', 'liquid', 'region', 'near', 'the', 'hexatictoliquid', 'transition', 'and', 'square', 'ordered', 'fluctuations', 'dominate', 'the', 'liquid', 'region', 'near', 'the', 'liquidto', 'square', 'solid', 'transition', 'but', 'that', 'both', 'structured', 'fluctuations', 'occur', 'at', 'all', 'densities', 'between', 'these', 'transition', 'lines', 'at', 'a', 'higher', 'temperature', 'at', 'phase', 'points', 'in', 'the', 'liquid', 'above', 'but', 'close', 'to', 'the', 'density', 'maximum', 'of', 'an', 'underlying', 'transition', 'there', 'are', 'ordered', 'fluctuations', 'that', 'can', 'be', 'correlated', 'with', 'the', 'structure', 'of', 'the', 'lower', 'temperature', 'phase']] | [-0.18657332624694922, 0.30251953618028826, -0.09145658698455408, 0.0035459704310973968, 0.05648267432570276, -0.11490197416349518, 0.07670799580220951, 0.3766955652614919, -0.24680308074485965, -0.2613755290305651, 0.0809125700675905, -0.3405532194437777, -0.12387339988859689, 0.06908249371037704, 0.0947526113263604, -0.011529802968271259, -0.06930514786892185, -0.01323412499822131, -0.19044744944052272, -0.16509572646080903, 0.27214514480949176, 0.005503775842669534, 0.323192260296243, 0.0324874159391606, 0.07151231290772557, -0.03686792913216689, 0.12446991198514475, 0.06382835496489594, -0.19285614043807828, -0.006533233882723058, 0.2349507972828067, -0.06661134089184244, 0.11718754185840669, -0.4132151521378901, -0.2161621486359253, 0.08719422074784411, 0.11271404368893766, 0.08723676108482589, -0.07033553710888799, -0.27075585920545386, 0.005786104233958191, -0.12442255865146475, -0.172761291277981, -0.0658476188370004, 0.002762416611630015, 0.023307577290191745, -0.20936241612582263, 0.12915703727886443, 0.05653169232352478, 0.0666337014970983, -0.07067628953287877, -0.11960009202792696, -0.11616514775129716, 0.10046932035829963, -0.008305031982273227, 0.05017438571922844, 0.16140240893653798, -0.13962352992285315, -0.06318921505149863, 0.372386998533294, -0.05436093158929086, -0.06386286312211646, 0.20064900356640175, -0.2312216279508614, -0.10641519714305858, 0.3012122844084643, 0.12496687611337842, 0.06081892072632, -0.05944370903847058, 0.02862758425535725, -0.01315133878222962, 0.20780649703086876, 0.04401503523993419, 0.017366439603814263, 0.31421609825295643, 0.19905112190172075, 0.06871600385482718, 0.19000109601084417, -0.13967796455296438, -0.16804045107806237, -0.27112911935986544, -0.14251905737399329, -0.19218075744830435, -0.057559107665381415, -0.11199800233525599, -0.23857693236502933, 0.36773221271975737, 0.08060817751329301, 0.19203311506113627, -0.025739311306487496, 0.22682836787411717, 0.07594504772185734, 0.02250604716515759, 0.062220663529616305, 0.25911506505728493, 0.14054691270675237, 0.09282141810782799, -0.24268705521414918, 0.05829612237923756, 0.04777352854314192] |
1,803.01197 | Every toroidal graph without triangles adjacent to $5$-cycles is
DP-$4$-colorable | DP-coloring, also known as correspondence coloring, is introduced by
Dvo{\v{r}}{\'{a}}k and Postle. It is a generalization of list coloring. In this
paper, we show that every connected toroidal graph without triangles adjacent
to $5$-cycles has minimum degree at most three unless it is a 2-connected
$4$-regular graph with Euler characteristic $\epsilon(G) = 0$. Consequently,
every toroidal graph without triangles adjacent to $5$-cycles is
DP-$4$-colorable. In the final, we show that every planar graph without two
certain subgraphs is DP-$4$-colorable. As immediate consequences, (i) every
planar graph without $3$-cycles adjacent to $4$-cycles is DP-$4$-colorable;
(ii) every planar graph without $3$-cycles adjacent to $5$-cycles is
DP-$4$-colorable; (iii) every planar graph without $4$-cycles adjacent to
$5$-cycles is DP-$4$-colorable.
| math.CO cs.DM | dpcoloring also known as correspondence coloring is introduced by dvovrak and postle it is a generalization of list coloring in this paper we show that every connected toroidal graph without triangles adjacent to 5cycles has minimum degree at most three unless it is a 2connected 4regular graph with euler characteristic epsilong 0 consequently every toroidal graph without triangles adjacent to 5cycles is dp4colorable in the final we show that every planar graph without two certain subgraphs is dp4colorable as immediate consequences i every planar graph without 3cycles adjacent to 4cycles is dp4colorable ii every planar graph without 3cycles adjacent to 5cycles is dp4colorable iii every planar graph without 4cycles adjacent to 5cycles is dp4colorable | [['dpcoloring', 'also', 'known', 'as', 'correspondence', 'coloring', 'is', 'introduced', 'by', 'dvovrak', 'and', 'postle', 'it', 'is', 'a', 'generalization', 'of', 'list', 'coloring', 'in', 'this', 'paper', 'we', 'show', 'that', 'every', 'connected', 'toroidal', 'graph', 'without', 'triangles', 'adjacent', 'to', '5cycles', 'has', 'minimum', 'degree', 'at', 'most', 'three', 'unless', 'it', 'is', 'a', '2connected', '4regular', 'graph', 'with', 'euler', 'characteristic', 'epsilong', '0', 'consequently', 'every', 'toroidal', 'graph', 'without', 'triangles', 'adjacent', 'to', '5cycles', 'is', 'dp4colorable', 'in', 'the', 'final', 'we', 'show', 'that', 'every', 'planar', 'graph', 'without', 'two', 'certain', 'subgraphs', 'is', 'dp4colorable', 'as', 'immediate', 'consequences', 'i', 'every', 'planar', 'graph', 'without', '3cycles', 'adjacent', 'to', '4cycles', 'is', 'dp4colorable', 'ii', 'every', 'planar', 'graph', 'without', '3cycles', 'adjacent', 'to', '5cycles', 'is', 'dp4colorable', 'iii', 'every', 'planar', 'graph', 'without', '4cycles', 'adjacent', 'to', '5cycles', 'is', 'dp4colorable']] | [-0.22776826145944365, 0.12871059305606442, 0.032779840111176954, 0.026926478022799353, -0.16386500278716548, -0.22066286553449013, 0.01737646460471871, 0.4554819068687625, -0.2362023604627323, -0.34251276526207985, 0.06728403440782833, -0.3474306587084899, -0.20678435362826444, 0.014992164464242626, -0.18602021427400278, -0.06801722502119414, 0.17293930984625036, 0.0938052072826969, 0.07632997317909541, -0.2602439971664704, 0.26754044185457915, -0.1450472002473186, 0.14651046154546765, 0.12951852355903962, 0.07815520467709958, 0.07610038949356399, 0.065015956367317, 0.1589668660277599, -0.17346085618281218, -0.010931351736776139, 0.23408023436276013, 0.15775129678577446, 0.19649598391301798, -0.4379187115195428, -0.1481543013707555, 0.30052542941452803, 0.1445278501824329, 0.07431507952870768, 0.02483566999108645, -0.18992263213486263, 0.19487587651728014, -0.09032153254775678, -0.09058609186965776, 0.0824284677494832, 0.12206091752618943, -0.04890896885639481, -0.23937530732272486, -0.0855604573502716, 0.18171560274142967, 0.0279108491863314, 0.14639522553740167, -0.11477556914957077, -0.16757630067060522, 0.10714480366451633, -0.11990625823014661, 0.15875357864506282, -0.024528030162113475, -0.11331468526265796, -0.22353415787138306, 0.3371910949834018, 0.03203265637306398, -0.1895938912128801, 0.10078663568486247, -0.11283230752961938, -0.22677618920754053, 0.15445620534745486, -0.0015952428292254346, 0.13182770457167767, -0.0979071227147391, 0.14971391129534153, -0.1486027034473393, 0.09237197597445757, 0.26420717411102695, -0.061025287418855, 0.12617379786414012, 0.07429802609431933, 0.21357219111533804, 0.22446223448659702, 0.01744546139155302, 0.08687852845086079, -0.3011993427613848, -0.09179082406856316, -0.25760337367670183, 0.07878998183367546, -0.22327134493121106, -0.20318647665216735, 0.38460162683520793, 0.042104629260536874, 0.13535207414411402, 0.07080166058190036, 0.25190220098623906, 0.0003245391274328556, 0.09596191619710769, 0.24908925409902605, 0.10924760865766489, 0.1750817939193854, -0.0588717302113461, -0.11705408930796884, 0.05292052166789705, 0.2254510221435084] |
1,803.01198 | Double-parton scattering effects in $D^{0}B^{+}$ and $B^{+}B^{+}$
meson-meson pair production in proton-proton collisions at the LHC | We extend our previous studies of double-parton scattering (DPS) to
simultaneous production of $c \bar c$ and $b \bar b$ and production of two
pairs of $b \bar b$. The calculation is performed within factorized ansatz.
Each parton scattering is calculated within $k_T$-factorization approach. The
hadronization is done with the help of fragmentation functions. Production of
$D$ mesons in our framework was tested in our previous works. Here we present
our predictions for $B$ mesons. A good agreement is achieved with the LHCb
data. We present our results for $c \bar c b \bar b$ and $b \bar b b \bar b$
final states. For completeness we compare results for double- and single-parton
scattering (SPS). As for $c \bar c c \bar c$ final state also here the DPS
dominates over the SPS, especially for small transverse momenta. We present
several distributions and integrated cross sections with realistic cuts for
simultaneous production of $D^0 B^+$ and $B^+ B^+$, suggesting future
experimental studies at the LHC.
| hep-ph hep-ex | we extend our previous studies of doubleparton scattering dps to simultaneous production of c bar c and b bar b and production of two pairs of b bar b the calculation is performed within factorized ansatz each parton scattering is calculated within k_tfactorization approach the hadronization is done with the help of fragmentation functions production of d mesons in our framework was tested in our previous works here we present our predictions for b mesons a good agreement is achieved with the lhcb data we present our results for c bar c b bar b and b bar b b bar b final states for completeness we compare results for double and singleparton scattering sps as for c bar c c bar c final state also here the dps dominates over the sps especially for small transverse momenta we present several distributions and integrated cross sections with realistic cuts for simultaneous production of d0 b and b b suggesting future experimental studies at the lhc | [['we', 'extend', 'our', 'previous', 'studies', 'of', 'doubleparton', 'scattering', 'dps', 'to', 'simultaneous', 'production', 'of', 'c', 'bar', 'c', 'and', 'b', 'bar', 'b', 'and', 'production', 'of', 'two', 'pairs', 'of', 'b', 'bar', 'b', 'the', 'calculation', 'is', 'performed', 'within', 'factorized', 'ansatz', 'each', 'parton', 'scattering', 'is', 'calculated', 'within', 'k_tfactorization', 'approach', 'the', 'hadronization', 'is', 'done', 'with', 'the', 'help', 'of', 'fragmentation', 'functions', 'production', 'of', 'd', 'mesons', 'in', 'our', 'framework', 'was', 'tested', 'in', 'our', 'previous', 'works', 'here', 'we', 'present', 'our', 'predictions', 'for', 'b', 'mesons', 'a', 'good', 'agreement', 'is', 'achieved', 'with', 'the', 'lhcb', 'data', 'we', 'present', 'our', 'results', 'for', 'c', 'bar', 'c', 'b', 'bar', 'b', 'and', 'b', 'bar', 'b', 'b', 'bar', 'b', 'final', 'states', 'for', 'completeness', 'we', 'compare', 'results', 'for', 'double', 'and', 'singleparton', 'scattering', 'sps', 'as', 'for', 'c', 'bar', 'c', 'c', 'bar', 'c', 'final', 'state', 'also', 'here', 'the', 'dps', 'dominates', 'over', 'the', 'sps', 'especially', 'for', 'small', 'transverse', 'momenta', 'we', 'present', 'several', 'distributions', 'and', 'integrated', 'cross', 'sections', 'with', 'realistic', 'cuts', 'for', 'simultaneous', 'production', 'of', 'd0', 'b', 'and', 'b', 'b', 'suggesting', 'future', 'experimental', 'studies', 'at', 'the', 'lhc']] | [-0.09129569866468734, 0.12860072199819667, -0.08298979866403071, 0.05374769220467318, 0.02469240742396902, -0.1524231295270676, 0.06875552834350276, 0.35822951418883875, -0.2029567849116795, -0.21149714321857602, -0.06456582953617203, -0.3043850302470453, 0.027933280730168476, 0.14118980897421188, 0.08155897655665423, 0.11814832109675714, 0.14431208355747388, -0.040144421933501054, -0.026375046835252734, -0.2292572351285454, 0.2993674960819948, 0.004312176260194092, 0.17277624151020338, 0.1356738021413824, -0.04363910087144397, 0.0892293094798471, -0.0940196573042847, -0.023866307036951185, -0.1731609021735053, 0.0792855914720955, 0.23198034417617952, 0.15704240249187656, 0.09028907441816321, -0.3318422761265979, -0.07630794306257457, 0.03583078264174136, 0.15799710143950174, 0.08176688062535091, -0.030013091692870312, -0.2622412435484655, 0.16241164162620958, -0.22527687311398262, -0.09516746617984168, -0.07326308425346559, 0.13175058191356417, -0.04018519093480074, -0.37536864463014136, 0.06323792863139797, -0.013453606345733119, 0.05985525201893214, -0.021827412882086002, -0.2885491642197876, -0.04689047578581129, 0.027189628477913865, 0.034440363971798706, 0.1896254180217952, 0.18151925067614877, -0.11820273631337014, -0.1817455646553726, 0.36622243975712493, -0.1013262048533017, -0.15339743781439735, 0.22720393044027415, -0.21985480602209767, -0.1362242605551287, 0.09411502901577588, 0.22122403245108824, 0.10964197616911296, -0.1404588675182877, 0.13535402534092128, -0.03669556552459571, 0.08987994113739467, 0.07146740194240754, 0.0034694785643351322, 0.12220627056579388, 0.18860815488027804, -0.08309631295727961, 0.07043099496231386, -0.13474826152351768, -0.049091483275123846, -0.4420194952487663, -0.13929488838960727, -0.03635582798019503, 0.026616523396506, -0.015302011017356012, -0.050333281109730406, 0.3329499528094223, 0.05358844010695589, 0.3209684536764116, 0.028227052233661665, 0.29302993870594285, 0.050477442421922175, 0.05902934694789689, 0.11254916793638559, 0.27577379109958805, 0.17546088240024718, 0.11863534408833154, -0.2704693330790509, 0.059597520894286306, -0.041108027236028154] |
1,803.01199 | Chest X-Ray Analysis of Tuberculosis by Deep Learning with Segmentation
and Augmentation | The results of chest X-ray (CXR) analysis of 2D images to get the
statistically reliable predictions (availability of tuberculosis) by
computer-aided diagnosis (CADx) on the basis of deep learning are presented.
They demonstrate the efficiency of lung segmentation, lossless and lossy data
augmentation for CADx of tuberculosis by deep convolutional neural network
(CNN) applied to the small and not well-balanced dataset even. CNN demonstrates
ability to train (despite overfitting) on the pre-processed dataset obtained
after lung segmentation in contrast to the original not-segmented dataset.
Lossless data augmentation of the segmented dataset leads to the lowest
validation loss (without overfitting) and nearly the same accuracy (within the
limits of standard deviation) in comparison to the original and other
pre-processed datasets after lossy data augmentation. The additional limited
lossy data augmentation results in the lower validation loss, but with a
decrease of the validation accuracy. In conclusion, besides the more complex
deep CNNs and bigger datasets, the better progress of CADx for the small and
not well-balanced datasets even could be obtained by better segmentation, data
augmentation, dataset stratification, and exclusion of non-evident outliers.
| cs.LG cs.CV cs.CY | the results of chest xray cxr analysis of 2d images to get the statistically reliable predictions availability of tuberculosis by computeraided diagnosis cadx on the basis of deep learning are presented they demonstrate the efficiency of lung segmentation lossless and lossy data augmentation for cadx of tuberculosis by deep convolutional neural network cnn applied to the small and not wellbalanced dataset even cnn demonstrates ability to train despite overfitting on the preprocessed dataset obtained after lung segmentation in contrast to the original notsegmented dataset lossless data augmentation of the segmented dataset leads to the lowest validation loss without overfitting and nearly the same accuracy within the limits of standard deviation in comparison to the original and other preprocessed datasets after lossy data augmentation the additional limited lossy data augmentation results in the lower validation loss but with a decrease of the validation accuracy in conclusion besides the more complex deep cnns and bigger datasets the better progress of cadx for the small and not wellbalanced datasets even could be obtained by better segmentation data augmentation dataset stratification and exclusion of nonevident outliers | [['the', 'results', 'of', 'chest', 'xray', 'cxr', 'analysis', 'of', '2d', 'images', 'to', 'get', 'the', 'statistically', 'reliable', 'predictions', 'availability', 'of', 'tuberculosis', 'by', 'computeraided', 'diagnosis', 'cadx', 'on', 'the', 'basis', 'of', 'deep', 'learning', 'are', 'presented', 'they', 'demonstrate', 'the', 'efficiency', 'of', 'lung', 'segmentation', 'lossless', 'and', 'lossy', 'data', 'augmentation', 'for', 'cadx', 'of', 'tuberculosis', 'by', 'deep', 'convolutional', 'neural', 'network', 'cnn', 'applied', 'to', 'the', 'small', 'and', 'not', 'wellbalanced', 'dataset', 'even', 'cnn', 'demonstrates', 'ability', 'to', 'train', 'despite', 'overfitting', 'on', 'the', 'preprocessed', 'dataset', 'obtained', 'after', 'lung', 'segmentation', 'in', 'contrast', 'to', 'the', 'original', 'notsegmented', 'dataset', 'lossless', 'data', 'augmentation', 'of', 'the', 'segmented', 'dataset', 'leads', 'to', 'the', 'lowest', 'validation', 'loss', 'without', 'overfitting', 'and', 'nearly', 'the', 'same', 'accuracy', 'within', 'the', 'limits', 'of', 'standard', 'deviation', 'in', 'comparison', 'to', 'the', 'original', 'and', 'other', 'preprocessed', 'datasets', 'after', 'lossy', 'data', 'augmentation', 'the', 'additional', 'limited', 'lossy', 'data', 'augmentation', 'results', 'in', 'the', 'lower', 'validation', 'loss', 'but', 'with', 'a', 'decrease', 'of', 'the', 'validation', 'accuracy', 'in', 'conclusion', 'besides', 'the', 'more', 'complex', 'deep', 'cnns', 'and', 'bigger', 'datasets', 'the', 'better', 'progress', 'of', 'cadx', 'for', 'the', 'small', 'and', 'not', 'wellbalanced', 'datasets', 'even', 'could', 'be', 'obtained', 'by', 'better', 'segmentation', 'data', 'augmentation', 'dataset', 'stratification', 'and', 'exclusion', 'of', 'nonevident', 'outliers']] | [-0.0008839321678416875, -0.03781116228468346, -0.018488261393317697, 0.0687056994554458, -0.0821252837648502, -0.17187807107992595, 0.05543842528707435, 0.4207767220522735, -0.20945377071074195, -0.34503260252801754, 0.11876074594409508, -0.313346227224484, -0.10005187530595377, 0.24054006560196206, -0.17440151386811958, 0.1188597387649654, 0.22931684121600152, 0.024589814144078622, -0.03464325289087607, -0.3560735684966164, 0.26008451023674184, 0.08316458621559515, 0.4086863344730758, 0.025121829482773063, 0.09332784663471624, -0.04015395417262785, -0.06460253139494697, -0.017326886287133997, -0.03676723675848659, 0.1863952652375646, 0.30274305702251436, 0.181730050148535, 0.28111125708902407, -0.42212193218466326, -0.24407115105271998, 0.07981130446806468, 0.14630484479628708, 0.10674281639794019, -0.010048494311914655, -0.36225195833898627, 0.09546117456848553, -0.1371228531419778, -0.0005604338327947571, -0.1588717031019206, -0.03264510738521876, -0.05238697640932273, -0.2862479850856937, 0.11886887869428463, 0.06813445662595949, 0.09599834264806621, -0.08972979309963505, -0.12917958087421624, -0.041162684323132366, 0.1420226866014055, 0.01796771250202099, 0.06004786922066416, 0.13128836971105626, -0.25468125499435057, -0.084143326976671, 0.3456544750550175, -0.06931428577318706, -0.1865124291089461, 0.18988049794914644, -0.060837709810584784, -0.10420741707868668, 0.16828385284504963, 0.22095357947976416, 0.044814607043601365, -0.16376120799339444, -0.0484759799839584, -0.01893755851007319, 0.18519968818873167, 0.08252630776272912, -0.07857066960953876, 0.08932031547002371, 0.2967431964532817, -0.02288867009112879, 0.1572975976225722, -0.19936877437378409, 0.001500728976197582, -0.21007417068811576, -0.09498067475174868, -0.20092326578895114, -0.027525219258315893, -0.1574567201675478, -0.16981279056066473, 0.37057737926489454, 0.22333128609339506, 0.19528007707087444, 0.1001599555608729, 0.36639391184264786, -0.02694681175670571, 0.15613586861750842, 0.05452577701064845, 0.21853596168101985, 0.02450535271846746, 0.10136235150565183, -0.18642200524944463, 0.07408981760243438, 0.009478811074295261] |
1,803.012 | An ab-initio approach to describe coherent and non-coherent exciton
dynamics | The use of ultra-short laser pulses to pump and probe materials activates a
wealth of processes which involve the coherent and non coherent dynamics of
interacting electrons out of equilibrium. Non equilibrium (NEQ) many body
perturbation theory (MBPT) offers an equation of motion for the density-matrix
of the system which well describes both coherent and non coherent processes. In
the non correlated case there is a clear relation between these two regimes and
the matrix elements of the density-matrix. The same is not true for the
correlated case, where the potential binding of electrons and holes in
excitonic states need to be considered. In the present work we discuss how
NEQ-MBPT can be used to describe the dynamics of both coherent and non-coherent
excitons in the low density regime. The approach presented is well suited for
an ab initio implementation.
| cond-mat.mes-hall cond-mat.mtrl-sci | the use of ultrashort laser pulses to pump and probe materials activates a wealth of processes which involve the coherent and non coherent dynamics of interacting electrons out of equilibrium non equilibrium neq many body perturbation theory mbpt offers an equation of motion for the densitymatrix of the system which well describes both coherent and non coherent processes in the non correlated case there is a clear relation between these two regimes and the matrix elements of the densitymatrix the same is not true for the correlated case where the potential binding of electrons and holes in excitonic states need to be considered in the present work we discuss how neqmbpt can be used to describe the dynamics of both coherent and noncoherent excitons in the low density regime the approach presented is well suited for an ab initio implementation | [['the', 'use', 'of', 'ultrashort', 'laser', 'pulses', 'to', 'pump', 'and', 'probe', 'materials', 'activates', 'a', 'wealth', 'of', 'processes', 'which', 'involve', 'the', 'coherent', 'and', 'non', 'coherent', 'dynamics', 'of', 'interacting', 'electrons', 'out', 'of', 'equilibrium', 'non', 'equilibrium', 'neq', 'many', 'body', 'perturbation', 'theory', 'mbpt', 'offers', 'an', 'equation', 'of', 'motion', 'for', 'the', 'densitymatrix', 'of', 'the', 'system', 'which', 'well', 'describes', 'both', 'coherent', 'and', 'non', 'coherent', 'processes', 'in', 'the', 'non', 'correlated', 'case', 'there', 'is', 'a', 'clear', 'relation', 'between', 'these', 'two', 'regimes', 'and', 'the', 'matrix', 'elements', 'of', 'the', 'densitymatrix', 'the', 'same', 'is', 'not', 'true', 'for', 'the', 'correlated', 'case', 'where', 'the', 'potential', 'binding', 'of', 'electrons', 'and', 'holes', 'in', 'excitonic', 'states', 'need', 'to', 'be', 'considered', 'in', 'the', 'present', 'work', 'we', 'discuss', 'how', 'neqmbpt', 'can', 'be', 'used', 'to', 'describe', 'the', 'dynamics', 'of', 'both', 'coherent', 'and', 'noncoherent', 'excitons', 'in', 'the', 'low', 'density', 'regime', 'the', 'approach', 'presented', 'is', 'well', 'suited', 'for', 'an', 'ab', 'initio', 'implementation']] | [-0.13476491713119174, 0.17229147885591897, -0.10610832150677126, 0.09135837377829598, 0.020293509905903246, -0.1443258795431621, 0.04324108267139322, 0.3849264928977266, -0.28793550774990245, -0.24092207871136262, 0.01436343699988487, -0.2920755128838497, -0.1324530078186955, 0.2024572367558805, 0.02748016046239532, 0.02818771530103555, 0.02183775554525016, -0.017663322729159065, -0.017359216566860892, -0.16710559966498248, 0.3105058713762505, 0.043752818427001725, 0.26776965147406934, 0.05187012427720985, 0.08824871692860084, 0.0469854717266833, 0.021772938314825296, -0.011701205564435008, -0.09566071770227641, 0.09097018530349442, 0.27784764485286295, 0.04040064114119134, 0.24118440015000298, -0.46793485037553656, -0.2234478781348188, 0.06281417287323329, 0.15426293506204125, 0.1653358167583431, -0.046913815973822375, -0.27161182344911233, 0.015174802158215492, -0.1762454403571034, -0.14880777493775857, -0.1212066089978991, 0.0142161351688903, 0.05515856138370234, -0.2664378504536832, 0.09680451322078919, 0.03972677104744605, 0.008338434454187643, -0.07902328020444127, -0.059059354958204864, -0.001744828935672375, 0.13056817850962335, 0.007349643730658957, -0.0020611224387832683, 0.13414552913000471, -0.14868395631503073, -0.1008206495727084, 0.4157869768389266, -0.07694081103650303, -0.16409037361363712, 0.20977036563240714, -0.1696320460713971, -0.06907618421602243, 0.1306874096551039, 0.1293841782930515, 0.15323010959206887, -0.14773433790843693, 0.08625408489422089, 0.004214415781488039, 0.1735157308691322, 0.011649858701066282, 0.07789378085930784, 0.21193607343802992, 0.15843986913648922, 0.057026922055804875, 0.10219640929164807, -0.05427707916480764, -0.13079117924953215, -0.29522631414864453, -0.1433326643992135, -0.1775234767868981, 0.047977292369284816, -0.012313534732842683, -0.17725110649660553, 0.4050360071948535, 0.13325855940942177, 0.12350610686506298, -0.027905549338127642, 0.26869147946432975, 0.14750430751725924, -0.022271052157010536, 0.052508882950428576, 0.2640587727324836, 0.18467582218858192, 0.0455650293583171, -0.27150279697091084, 0.02134838742505518, -0.009083029685086376] |
1,803.01201 | Quantitative chemical imaging of amyloid-\beta{} plaques with Raman
micro-spectroscopy in human Alzheimer's diseased brains | Alzheimer's disease (AD) is a neurodegenerative disorder and the most common
cause of dementia in the elderly. The extracellular accumulation of
amyloid-$\beta$ (A$\beta$) in senile plaques is a principal event in the
pathogenesis and there is growing evidence that the dysregulation of lipid
pathways is implicated in the disease, however the link between these two is
still under study. In this work, we investigated human brain samples, from 11
AD patients and a control cohort of age-matched subjects without AD, using
label-free chemically-specific Raman micro-spectroscopy. The collected image
data were quantitatively analysed using an efficient quantitative
unsupervised/partially supervised non-negative matrix factorization method, to
retrieve the concentration maps and spectra of the samples' chemical
constituents. Significant changes in lipid composition as well as increased
concentrations of oxidative stress bio-markers were observed in AD tissues
compared to the control. In particular, the analysis revealed accumulations of
cholesteryl esters with saturated long-chain fatty acids (FAs), A$\beta$
fibrils, arachidic acid, fibrin, collagen-like amyloidogenic component (CLAC),
$\beta$-carotene and magnetite, co-localising in A$\beta$ plaques of AD human
brains and exhibiting concentrations highest at the fibrillar core and lowest
at the rim. This finding opens perspectives for new anti-inflammatory and
antioxidant drug strategies, designed to restore brain homeostasis as potential
therapeutics of AD. We also demonstrate by the means of spatial concentration
histograms that these identified species separate AD from non-demented control
brains, beneficial for AD diagnosis.
| physics.med-ph | alzheimers disease ad is a neurodegenerative disorder and the most common cause of dementia in the elderly the extracellular accumulation of amyloidbeta abeta in senile plaques is a principal event in the pathogenesis and there is growing evidence that the dysregulation of lipid pathways is implicated in the disease however the link between these two is still under study in this work we investigated human brain samples from 11 ad patients and a control cohort of agematched subjects without ad using labelfree chemicallyspecific raman microspectroscopy the collected image data were quantitatively analysed using an efficient quantitative unsupervisedpartially supervised nonnegative matrix factorization method to retrieve the concentration maps and spectra of the samples chemical constituents significant changes in lipid composition as well as increased concentrations of oxidative stress biomarkers were observed in ad tissues compared to the control in particular the analysis revealed accumulations of cholesteryl esters with saturated longchain fatty acids fas abeta fibrils arachidic acid fibrin collagenlike amyloidogenic component clac betacarotene and magnetite colocalising in abeta plaques of ad human brains and exhibiting concentrations highest at the fibrillar core and lowest at the rim this finding opens perspectives for new antiinflammatory and antioxidant drug strategies designed to restore brain homeostasis as potential therapeutics of ad we also demonstrate by the means of spatial concentration histograms that these identified species separate ad from nondemented control brains beneficial for ad diagnosis | [['alzheimers', 'disease', 'ad', 'is', 'a', 'neurodegenerative', 'disorder', 'and', 'the', 'most', 'common', 'cause', 'of', 'dementia', 'in', 'the', 'elderly', 'the', 'extracellular', 'accumulation', 'of', 'amyloidbeta', 'abeta', 'in', 'senile', 'plaques', 'is', 'a', 'principal', 'event', 'in', 'the', 'pathogenesis', 'and', 'there', 'is', 'growing', 'evidence', 'that', 'the', 'dysregulation', 'of', 'lipid', 'pathways', 'is', 'implicated', 'in', 'the', 'disease', 'however', 'the', 'link', 'between', 'these', 'two', 'is', 'still', 'under', 'study', 'in', 'this', 'work', 'we', 'investigated', 'human', 'brain', 'samples', 'from', '11', 'ad', 'patients', 'and', 'a', 'control', 'cohort', 'of', 'agematched', 'subjects', 'without', 'ad', 'using', 'labelfree', 'chemicallyspecific', 'raman', 'microspectroscopy', 'the', 'collected', 'image', 'data', 'were', 'quantitatively', 'analysed', 'using', 'an', 'efficient', 'quantitative', 'unsupervisedpartially', 'supervised', 'nonnegative', 'matrix', 'factorization', 'method', 'to', 'retrieve', 'the', 'concentration', 'maps', 'and', 'spectra', 'of', 'the', 'samples', 'chemical', 'constituents', 'significant', 'changes', 'in', 'lipid', 'composition', 'as', 'well', 'as', 'increased', 'concentrations', 'of', 'oxidative', 'stress', 'biomarkers', 'were', 'observed', 'in', 'ad', 'tissues', 'compared', 'to', 'the', 'control', 'in', 'particular', 'the', 'analysis', 'revealed', 'accumulations', 'of', 'cholesteryl', 'esters', 'with', 'saturated', 'longchain', 'fatty', 'acids', 'fas', 'abeta', 'fibrils', 'arachidic', 'acid', 'fibrin', 'collagenlike', 'amyloidogenic', 'component', 'clac', 'betacarotene', 'and', 'magnetite', 'colocalising', 'in', 'abeta', 'plaques', 'of', 'ad', 'human', 'brains', 'and', 'exhibiting', 'concentrations', 'highest', 'at', 'the', 'fibrillar', 'core', 'and', 'lowest', 'at', 'the', 'rim', 'this', 'finding', 'opens', 'perspectives', 'for', 'new', 'antiinflammatory', 'and', 'antioxidant', 'drug', 'strategies', 'designed', 'to', 'restore', 'brain', 'homeostasis', 'as', 'potential', 'therapeutics', 'of', 'ad', 'we', 'also', 'demonstrate', 'by', 'the', 'means', 'of', 'spatial', 'concentration', 'histograms', 'that', 'these', 'identified', 'species', 'separate', 'ad', 'from', 'nondemented', 'control', 'brains', 'beneficial', 'for', 'ad', 'diagnosis']] | [-0.060565266681231536, 0.12770827289045483, -0.007266604664261665, 0.05188782534943975, -0.022027197242877855, -0.14702572346575102, 0.05204997606281387, 0.41407504298388775, -0.2206288314298849, -0.252226776761011, 0.06678854982627008, -0.30165472617495415, -0.2529199460358972, 0.13835210933170297, -0.10815700870711896, 0.006649603585971994, 0.069133677793536, 0.022302653225906716, 0.08085615157094588, -0.17145612700423635, 0.22629515892568683, 0.051485581897411564, 0.3136533311437489, 0.06550024799811613, 0.06078497108274748, -0.026675261174922957, -0.028497365358481675, -0.032107961257886994, -0.13498827547587816, 0.13129583685131047, 0.3650205559832485, 0.1199384279278635, 0.28906491409738044, -0.4616866446092006, -0.2663650601947059, 0.10108697288562421, 0.16121308348144675, 0.07956062190083014, -0.04324390352581089, -0.27755956692271866, 0.11274678207190479, -0.12916603901733956, -0.08090917099565431, -0.05103751025652807, 0.021374606805661563, 0.006234960879713694, -0.2627297354731382, 0.1823233282039087, -0.03770460429644261, 0.1983830955353353, -0.16492485880275795, -0.14115843814879395, -0.07903509459707461, 0.1913748788775002, 0.09950514118852943, 0.005782691890520877, 0.2554872771194041, -0.15663125172559694, -0.09279995995753429, 0.2914266409086913, 0.006146391947639354, -0.11496820084836432, 0.2024007868077892, -0.09305590406272626, -0.1348205479249979, 0.1712331282456912, 0.13090119913836692, 0.1061850443651916, -0.21555843294634924, -0.056979067509242316, 0.03901593054832662, 0.18289446393477224, 0.12333684720981278, -0.05603503807153749, 0.14342770881449451, 0.23603589295127772, -0.04954048769171717, 0.08529373592688914, -0.11531166751509565, -0.015330812045201463, -0.1552250279428176, -0.1920377523403435, -0.08755503967455425, 0.04925596616700651, -0.09927514440629207, -0.18482918076915666, 0.3629993571401492, 0.09410286309598871, 0.1482313035074887, 0.004381675736798921, 0.21378593037329746, -0.04802718890163018, 0.13147820802987553, -0.03742281997294508, 0.15533641736092568, 0.08538876043396733, 0.13461602583482632, -0.27075915691328417, 0.18811611467083966, -0.02644537977022609] |
1,803.01202 | Hydrogen Bond Networks Near Supported Lipid Bilayers from Vibrational
Sum Frequency Generation Experiments and Atomistic Simulations | We report vibrational sum frequency generation spectra from supported lipid
bilayers in which the OH and the CH stretching signals are probed at different
salt concentrations. Atomistic simulations show a negligible impact of salt on
the OH stretching spectra, indicating the observed SFG intensity changes are
due to chi(3) and potential dependent contributions. These are further analyzed
in the contact of exact-zero reference states. Further experiments and
simulations identify specific hydrogen bonding interactions between interfacial
water molecules at the PC head group of the zwitterionic DMPC lipids at 3200
wavenumbers.
| cond-mat.soft | we report vibrational sum frequency generation spectra from supported lipid bilayers in which the oh and the ch stretching signals are probed at different salt concentrations atomistic simulations show a negligible impact of salt on the oh stretching spectra indicating the observed sfg intensity changes are due to chi3 and potential dependent contributions these are further analyzed in the contact of exactzero reference states further experiments and simulations identify specific hydrogen bonding interactions between interfacial water molecules at the pc head group of the zwitterionic dmpc lipids at 3200 wavenumbers | [['we', 'report', 'vibrational', 'sum', 'frequency', 'generation', 'spectra', 'from', 'supported', 'lipid', 'bilayers', 'in', 'which', 'the', 'oh', 'and', 'the', 'ch', 'stretching', 'signals', 'are', 'probed', 'at', 'different', 'salt', 'concentrations', 'atomistic', 'simulations', 'show', 'a', 'negligible', 'impact', 'of', 'salt', 'on', 'the', 'oh', 'stretching', 'spectra', 'indicating', 'the', 'observed', 'sfg', 'intensity', 'changes', 'are', 'due', 'to', 'chi3', 'and', 'potential', 'dependent', 'contributions', 'these', 'are', 'further', 'analyzed', 'in', 'the', 'contact', 'of', 'exactzero', 'reference', 'states', 'further', 'experiments', 'and', 'simulations', 'identify', 'specific', 'hydrogen', 'bonding', 'interactions', 'between', 'interfacial', 'water', 'molecules', 'at', 'the', 'pc', 'head', 'group', 'of', 'the', 'zwitterionic', 'dmpc', 'lipids', 'at', '3200', 'wavenumbers']] | [-0.13732033681904038, 0.1616204965315508, 0.0026872784620035816, -0.0017704983252320398, 0.042477952180367505, -0.12451929718862927, 0.06598533469048234, 0.451539237638203, -0.2577563568614842, -0.28189141323183026, -0.027568347168709623, -0.3239091409977232, -0.1079395287879481, 0.12339954064463088, 0.08918107083731781, -0.04229918598940366, 0.04303077337321606, -0.10696266769441996, 0.00979312602430582, -0.1370585063535176, 0.21053334539023677, 0.08219509671986354, 0.29940572293119483, 0.1452176175551133, 0.03550777685818043, -0.09727896751542942, -0.03535269601061271, -0.013117884890061248, -0.19553526455021117, 0.08218418419228021, 0.27755423641522947, -0.09666278126670487, 0.18302997892324843, -0.4486386969246054, -0.2278299314974483, 0.0057382356804492095, 0.10784031458858274, 0.1327389838014405, -0.037473537484340874, -0.27793564873464993, 0.012190176429111887, -0.10297800770050354, -0.08203020258649682, -0.03611030175123008, 0.012823881696532952, 0.10915793325710163, -0.22927454398589187, 0.17053342123746118, -0.0527431003414513, 0.14428760899293624, -0.143693448125458, -0.1977231954695301, -0.16003258915597132, 0.10748702686690736, 0.05389856748031766, -0.028112918148968328, 0.28794151086169245, -0.07051644905397061, -0.02038641289148605, 0.40855512557697765, -0.10526449739765585, -0.11999387143368132, 0.239668030511546, -0.19289442309795807, -0.1474069039091426, 0.23987537689423294, 0.12104816754672969, 0.08281572772094488, -0.11371053449071818, -0.018434787453596974, 0.03388998135296482, 0.23523976287563866, 0.1612474155753558, 0.03126849224293877, 0.23355605559988638, 0.12239649666870912, -0.017793981170051553, 0.1390305647647448, -0.1638948140388585, -0.04302187917984269, -0.20414773981921439, -0.11933150769242745, -0.16132130552334398, -0.0016485043864153074, -0.06718406395929777, -0.09690785641373878, 0.365650621797429, 0.05493421006304856, 0.13683801238016968, 0.024812449291714708, 0.24845555126196128, 0.021383753559144025, 0.07865175320714544, -0.017072534037958647, 0.26863499182757783, 0.14405060572068343, 0.11134289853599215, -0.32718159026843024, 0.07478788174202226, -0.0357205533537637] |
1,803.01203 | Multiresolution Tensor Decomposition for Multiple Spatial Passing
Networks | This article is motivated by soccer positional passing networks collected
across multiple games. We refer to these data as replicated spatial passing
networks---to accurately model such data it is necessary to take into account
the spatial positions of the passer and receiver for each passing event. This
spatial registration and replicates that occur across games represent key
differences with usual social network data. As a key step before investigating
how the passing dynamics influence team performance, we focus on developing
methods for summarizing different team's passing strategies. Our proposed
approach relies on a novel multiresolution data representation framework and
Poisson nonnegative block term decomposition model, which automatically
produces coarse-to-fine low-rank network motifs. The proposed methods are
applied to detailed passing record data collected from the 2014 FIFA World Cup.
| stat.AP cs.LG cs.SI stat.ML | this article is motivated by soccer positional passing networks collected across multiple games we refer to these data as replicated spatial passing networksto accurately model such data it is necessary to take into account the spatial positions of the passer and receiver for each passing event this spatial registration and replicates that occur across games represent key differences with usual social network data as a key step before investigating how the passing dynamics influence team performance we focus on developing methods for summarizing different teams passing strategies our proposed approach relies on a novel multiresolution data representation framework and poisson nonnegative block term decomposition model which automatically produces coarsetofine lowrank network motifs the proposed methods are applied to detailed passing record data collected from the 2014 fifa world cup | [['this', 'article', 'is', 'motivated', 'by', 'soccer', 'positional', 'passing', 'networks', 'collected', 'across', 'multiple', 'games', 'we', 'refer', 'to', 'these', 'data', 'as', 'replicated', 'spatial', 'passing', 'networksto', 'accurately', 'model', 'such', 'data', 'it', 'is', 'necessary', 'to', 'take', 'into', 'account', 'the', 'spatial', 'positions', 'of', 'the', 'passer', 'and', 'receiver', 'for', 'each', 'passing', 'event', 'this', 'spatial', 'registration', 'and', 'replicates', 'that', 'occur', 'across', 'games', 'represent', 'key', 'differences', 'with', 'usual', 'social', 'network', 'data', 'as', 'a', 'key', 'step', 'before', 'investigating', 'how', 'the', 'passing', 'dynamics', 'influence', 'team', 'performance', 'we', 'focus', 'on', 'developing', 'methods', 'for', 'summarizing', 'different', 'teams', 'passing', 'strategies', 'our', 'proposed', 'approach', 'relies', 'on', 'a', 'novel', 'multiresolution', 'data', 'representation', 'framework', 'and', 'poisson', 'nonnegative', 'block', 'term', 'decomposition', 'model', 'which', 'automatically', 'produces', 'coarsetofine', 'lowrank', 'network', 'motifs', 'the', 'proposed', 'methods', 'are', 'applied', 'to', 'detailed', 'passing', 'record', 'data', 'collected', 'from', 'the', '2014', 'fifa', 'world', 'cup']] | [-0.08899964611873656, -0.01503468865303148, -0.12149252629933471, 0.06963831738903536, -0.0925418101487594, -0.16302365269802976, 0.03760993017021974, 0.41571995794947725, -0.2991886577947298, -0.33900851418002276, 0.08003366497723619, -0.25589426710757834, -0.18530445662145212, 0.11606236753141275, -0.08470986668180558, 0.033613479011819436, 0.13105903974792454, 0.014973476609156933, 0.013243830523606448, -0.27189710982565884, 0.30492467243311694, 0.05871050016139634, 0.3575534137125942, -0.02307790245504293, 0.15255084952423204, 0.05081823281125253, -0.09723659210158075, 0.010783817180708866, -0.08437827745393633, 0.1223001121525158, 0.3036575172591256, 0.24092032403586927, 0.3024322287965333, -0.4744406743266154, -0.20592429327007267, 0.09308561249054037, 0.125814608483779, 0.09845808246222987, -0.015583012953356956, -0.3606677502684761, 0.06229861944120785, -0.15889972753302573, -0.03211401738008135, -0.10336815986374859, -0.04686894038604805, 0.008763563435422839, -0.28491764789941953, 0.022399149311240762, 0.030455754247668665, 0.06507990123463969, -0.01950153411780775, -0.11496417146918247, -0.002588669782198849, 0.21474889724777313, 0.025304858124400198, 0.006710445197313675, 0.14901124031712243, -0.0559332795037335, -0.14687612951092888, 0.3603251101085334, -0.007355182986430009, -0.16358917592151556, 0.15502347003530303, -0.036340278242278146, -0.17339135673842065, 0.11783247084713366, 0.23963886942510726, 0.11217226703593042, -0.19171155595540768, -0.0018413786033306678, -0.0401219966224744, 0.15904279108099217, 0.07648012020763417, -0.0387137775796873, 0.18985725809216092, 0.2220324541631271, 0.04186232582469529, 0.10150986770895543, -0.12855127825241652, -0.15935395237465855, -0.25925870164292064, -0.07964760304184892, -0.19400155675248243, -0.04222144755840418, -0.12462574419953398, -0.13054026287863962, 0.4013770550081972, 0.2083432083381922, 0.19785255293845694, 0.06281798563259144, 0.35167063623521244, 0.020877848854979675, 0.06860544643132016, 0.06687824543769239, 0.12647162936627865, 0.04030639989832707, 0.16520767944336967, -0.13530210500721296, 0.10363747913834231, 0.0501543643331388] |
1,803.01204 | The Gibbons-Hawking radiation of gravitons in the Poincar\'e and static
patches of de Sitter spacetime | We discuss the quantization of linearized gravity in the background de Sitter
spacetime using a gauge-invariant formalism to write the perturbed
gravitational field in the static patch. This field is quantized after fixing
the gauge completely. The response rate of this field to monochromatic
multipole sources is then computed in the thermal equilibrium state with the
well known Gibbons-Hawking temperature. We compare this response rate with the
one obtained in the Bunch-Davies-like vacuum state defined in the Poincar\'e
patch. These response rates are found to be the same as expected. This
agreement serves as a verification of the infrared finite graviton two-point
function in the static patch of de Sitter spacetime found previously.
| gr-qc hep-th | we discuss the quantization of linearized gravity in the background de sitter spacetime using a gaugeinvariant formalism to write the perturbed gravitational field in the static patch this field is quantized after fixing the gauge completely the response rate of this field to monochromatic multipole sources is then computed in the thermal equilibrium state with the well known gibbonshawking temperature we compare this response rate with the one obtained in the bunchdavieslike vacuum state defined in the poincare patch these response rates are found to be the same as expected this agreement serves as a verification of the infrared finite graviton twopoint function in the static patch of de sitter spacetime found previously | [['we', 'discuss', 'the', 'quantization', 'of', 'linearized', 'gravity', 'in', 'the', 'background', 'de', 'sitter', 'spacetime', 'using', 'a', 'gaugeinvariant', 'formalism', 'to', 'write', 'the', 'perturbed', 'gravitational', 'field', 'in', 'the', 'static', 'patch', 'this', 'field', 'is', 'quantized', 'after', 'fixing', 'the', 'gauge', 'completely', 'the', 'response', 'rate', 'of', 'this', 'field', 'to', 'monochromatic', 'multipole', 'sources', 'is', 'then', 'computed', 'in', 'the', 'thermal', 'equilibrium', 'state', 'with', 'the', 'well', 'known', 'gibbonshawking', 'temperature', 'we', 'compare', 'this', 'response', 'rate', 'with', 'the', 'one', 'obtained', 'in', 'the', 'bunchdavieslike', 'vacuum', 'state', 'defined', 'in', 'the', 'poincare', 'patch', 'these', 'response', 'rates', 'are', 'found', 'to', 'be', 'the', 'same', 'as', 'expected', 'this', 'agreement', 'serves', 'as', 'a', 'verification', 'of', 'the', 'infrared', 'finite', 'graviton', 'twopoint', 'function', 'in', 'the', 'static', 'patch', 'of', 'de', 'sitter', 'spacetime', 'found', 'previously']] | [-0.14653224655609978, 0.1326887282401523, -0.11331229515157507, 0.08449599918302349, -0.04661171349497246, -0.06682666971547795, -0.043047830778440196, 0.31116528658042497, -0.20541035985973263, -0.2520291703986004, 0.08085894417724505, -0.23468555536653316, -0.10504685076219696, 0.11519481258125909, -0.03189801131208826, 0.04696630546407375, -0.06653070388711058, 0.10226166573037128, -0.08361155545571819, -0.2610126497287898, 0.3339033408847172, 0.12660287932625838, 0.30049244676982717, -0.03988434713599937, 0.1012015339968327, 0.02344235335684581, -0.034709937421471944, 0.06592477848088103, -0.1336847694266388, 0.009201238717650995, 0.24372569187003787, 0.090098562617121, 0.17682203253726975, -0.4097932017341788, -0.21253685412271547, 0.06825631340741113, 0.12506101042423065, 0.20058719512806938, -0.03781399646374796, -0.303211366926137, 0.04727248459987875, -0.15707685700285115, -0.17821293566729374, -0.03994190849022873, -0.008729830414397708, -0.051751322645161836, -0.23087479243674483, 0.10986492805698488, -0.018572235670165225, -0.003312993877833443, -0.12890687536335982, -0.07544577763681966, -0.05669870922533197, 0.10642768767762131, 0.0941590669909991, 0.10322535901546612, 0.1573104453938348, -0.14352070375129447, -0.09164100717836325, 0.35205221145692384, -0.15844905674956472, -0.22015343556579733, 0.13499951331842958, -0.19855103281692468, -0.06708381785262775, 0.11607627036158062, 0.08862634728263531, 0.18185488451022788, -0.16156648335579252, 0.16289335330449312, 0.027248083499476446, 0.1521801866141946, 0.13566969137588916, 0.05042911967387097, 0.26081260988887933, 0.06771294637915812, 0.02818841302983596, 0.18761848163038458, -0.054126857950385396, -0.09496609613831554, -0.3768155226550464, -0.13955717221561567, -0.16610074850697337, 0.09195347260226429, -0.12297580158337951, -0.22970324088185276, 0.37160803113199237, 0.13774620477176672, 0.1459331358034563, 0.05441541567311755, 0.2796678164574717, 0.14808432588116766, 0.04517555753617281, 0.07789869239162986, 0.33280716967003954, 0.11213411054216392, 0.13953572486518948, -0.26936643762123175, -0.0637711046230314, 0.10043710071892877] |
1,803.01205 | Machine Learning of Frustrated Classical Spin Models. II. Kernel
Principal Component Analysis | In this work we apply the principal component analysis (PCA) method with
kernel trick to study classification of phases and phase transition in
classical XY models in frustrated lattices. Comparing to our previous work with
linear PCA method, the kernel PCA can capture non-linear function. In this
case, the Z2 chiral order of classical spins in these lattices are indeed a
non-linear function of the input spin configurations. In addition to the
principal component revealed by linear PCA, the kernel PCA can find out two
more principal components using data generated by Monte Carlo simulation at
various temperatures at input. One of them relates to the strength of the U(1)
order parameter and the other directly manifests the chiral order parameter
that characterizes the Z2 symmetry breaking. For a temperature resolved study,
the temperature dependence of the principal eigenvalue associated with the Z2
symmetry breaking clearly shows a second order phase transition behavior.
| cond-mat.stat-mech cond-mat.quant-gas | in this work we apply the principal component analysis pca method with kernel trick to study classification of phases and phase transition in classical xy models in frustrated lattices comparing to our previous work with linear pca method the kernel pca can capture nonlinear function in this case the z2 chiral order of classical spins in these lattices are indeed a nonlinear function of the input spin configurations in addition to the principal component revealed by linear pca the kernel pca can find out two more principal components using data generated by monte carlo simulation at various temperatures at input one of them relates to the strength of the u1 order parameter and the other directly manifests the chiral order parameter that characterizes the z2 symmetry breaking for a temperature resolved study the temperature dependence of the principal eigenvalue associated with the z2 symmetry breaking clearly shows a second order phase transition behavior | [['in', 'this', 'work', 'we', 'apply', 'the', 'principal', 'component', 'analysis', 'pca', 'method', 'with', 'kernel', 'trick', 'to', 'study', 'classification', 'of', 'phases', 'and', 'phase', 'transition', 'in', 'classical', 'xy', 'models', 'in', 'frustrated', 'lattices', 'comparing', 'to', 'our', 'previous', 'work', 'with', 'linear', 'pca', 'method', 'the', 'kernel', 'pca', 'can', 'capture', 'nonlinear', 'function', 'in', 'this', 'case', 'the', 'z2', 'chiral', 'order', 'of', 'classical', 'spins', 'in', 'these', 'lattices', 'are', 'indeed', 'a', 'nonlinear', 'function', 'of', 'the', 'input', 'spin', 'configurations', 'in', 'addition', 'to', 'the', 'principal', 'component', 'revealed', 'by', 'linear', 'pca', 'the', 'kernel', 'pca', 'can', 'find', 'out', 'two', 'more', 'principal', 'components', 'using', 'data', 'generated', 'by', 'monte', 'carlo', 'simulation', 'at', 'various', 'temperatures', 'at', 'input', 'one', 'of', 'them', 'relates', 'to', 'the', 'strength', 'of', 'the', 'u1', 'order', 'parameter', 'and', 'the', 'other', 'directly', 'manifests', 'the', 'chiral', 'order', 'parameter', 'that', 'characterizes', 'the', 'z2', 'symmetry', 'breaking', 'for', 'a', 'temperature', 'resolved', 'study', 'the', 'temperature', 'dependence', 'of', 'the', 'principal', 'eigenvalue', 'associated', 'with', 'the', 'z2', 'symmetry', 'breaking', 'clearly', 'shows', 'a', 'second', 'order', 'phase', 'transition', 'behavior']] | [-0.12284183965651987, 0.11506133862418043, -0.10500921078141949, 0.0346576608207649, -0.06400107430580249, -0.11758051843388505, -0.013261524899527918, 0.3929698945637914, -0.27975588178055155, -0.25232675878233674, 0.1066467267053287, -0.31048423252098895, -0.1535519943420404, 0.13473844778567273, 0.05672418155092624, 0.07155254244305242, -0.019809667994968253, 0.02084311345718448, -0.1196113564484917, -0.2208528314881465, 0.3208907415778977, 0.012133286781974282, 0.28285134934327183, -0.030976772270305385, 0.056018585896916884, 0.013963901656953728, -0.02320166414274889, -0.0009549876729793408, -0.09552132481812033, 0.07552633208094858, 0.2627743140065457, 0.0015471787283233569, 0.20529178213449864, -0.3764144787990969, -0.23310853186629565, 0.13113370724174567, 0.12417302913568135, 0.11000866176000511, 0.02488568564372828, -0.2691740073443214, 0.046472155339085705, -0.14892467394702477, -0.14877601248726516, -0.14091599089842216, -0.05791961603791885, -0.0393377394298262, -0.2610189495577775, 0.1290782880999781, 0.10578838298158123, 0.07408362437264836, -0.024037833730355392, -0.0985561407755549, -0.05417801144462858, 0.0644730606323315, 0.09415090036520649, 0.03675766774374091, 0.11178658814839044, -0.10571694494304217, -0.13238394602500145, 0.3591065877695489, -0.06970767216951726, -0.14632466568777436, 0.17942906165452904, -0.15173821748141883, -0.17627620606019703, 0.13182264934689586, 0.14534655738670646, 0.10093089770617, -0.10104595019110764, 0.06641150742930549, -0.013894874365160279, 0.21284295659774025, -0.02441345390504579, -0.028656635585612333, 0.18376763113865666, 0.14954124503689847, 0.050770222511798, 0.18694072541228368, -0.10830991162752636, -0.11420204036936067, -0.28463838485319143, -0.12311785271561711, -0.22923630866027297, 0.02253330217178278, -0.14525138828777892, -0.1382845419175996, 0.434746389003361, 0.17139646577880127, 0.2368475739825882, 0.03300497938385781, 0.28824853927530103, 0.1380681199077943, 0.0811900268521866, 0.044870551307290014, 0.21934418756441743, 0.1847221537468821, 0.04956116283227221, -0.28528709147369724, 0.008951183102623212, 0.10345339366338319] |
1,803.01206 | On the Power of Over-parametrization in Neural Networks with Quadratic
Activation | We provide new theoretical insights on why over-parametrization is effective
in learning neural networks. For a $k$ hidden node shallow network with
quadratic activation and $n$ training data points, we show as long as $ k \ge
\sqrt{2n}$, over-parametrization enables local search algorithms to find a
\emph{globally} optimal solution for general smooth and convex loss functions.
Further, despite that the number of parameters may exceed the sample size,
using theory of Rademacher complexity, we show with weight decay, the solution
also generalizes well if the data is sampled from a regular distribution such
as Gaussian. To prove when $k\ge \sqrt{2n}$, the loss function has benign
landscape properties, we adopt an idea from smoothed analysis, which may have
other applications in studying loss surfaces of neural networks.
| cs.LG cs.AI math.OC stat.ML | we provide new theoretical insights on why overparametrization is effective in learning neural networks for a k hidden node shallow network with quadratic activation and n training data points we show as long as k ge sqrt2n overparametrization enables local search algorithms to find a emphglobally optimal solution for general smooth and convex loss functions further despite that the number of parameters may exceed the sample size using theory of rademacher complexity we show with weight decay the solution also generalizes well if the data is sampled from a regular distribution such as gaussian to prove when kge sqrt2n the loss function has benign landscape properties we adopt an idea from smoothed analysis which may have other applications in studying loss surfaces of neural networks | [['we', 'provide', 'new', 'theoretical', 'insights', 'on', 'why', 'overparametrization', 'is', 'effective', 'in', 'learning', 'neural', 'networks', 'for', 'a', 'k', 'hidden', 'node', 'shallow', 'network', 'with', 'quadratic', 'activation', 'and', 'n', 'training', 'data', 'points', 'we', 'show', 'as', 'long', 'as', 'k', 'ge', 'sqrt2n', 'overparametrization', 'enables', 'local', 'search', 'algorithms', 'to', 'find', 'a', 'emphglobally', 'optimal', 'solution', 'for', 'general', 'smooth', 'and', 'convex', 'loss', 'functions', 'further', 'despite', 'that', 'the', 'number', 'of', 'parameters', 'may', 'exceed', 'the', 'sample', 'size', 'using', 'theory', 'of', 'rademacher', 'complexity', 'we', 'show', 'with', 'weight', 'decay', 'the', 'solution', 'also', 'generalizes', 'well', 'if', 'the', 'data', 'is', 'sampled', 'from', 'a', 'regular', 'distribution', 'such', 'as', 'gaussian', 'to', 'prove', 'when', 'kge', 'sqrt2n', 'the', 'loss', 'function', 'has', 'benign', 'landscape', 'properties', 'we', 'adopt', 'an', 'idea', 'from', 'smoothed', 'analysis', 'which', 'may', 'have', 'other', 'applications', 'in', 'studying', 'loss', 'surfaces', 'of', 'neural', 'networks']] | [-0.07218299705907702, 0.05056235726654995, -0.09848107206821442, 0.08975772364623845, -0.07958204791136086, -0.18324856111779808, 0.06370364457648248, 0.4013235528618097, -0.3046361475624144, -0.3090075946897268, 0.06449856321886181, -0.28515011359751224, -0.2144506797734648, 0.1883999631134793, -0.08531008626148105, 0.09139240479469299, 0.07433433105051518, 0.045902060171822086, -0.07833186716772617, -0.28929952198266984, 0.2975258023235947, 0.025821844689548016, 0.2658504431024194, 0.0449724190607667, 0.07467622601427137, 0.006299871552735567, 0.03747283826768398, 0.0013566340720281005, -0.12768029346159893, 0.10340086601581425, 0.26477216713689267, 0.1987222667131573, 0.32394697684049606, -0.4111466454041074, -0.2656255611181259, 0.14851986644789578, 0.15670478380843997, 0.09450759854447097, -0.0473223621424986, -0.21223614008165895, 0.12194289084617048, -0.10721196833997965, -0.10329690171778202, -0.12382806672528386, 0.005593687850981951, 0.0567849922478199, -0.3226774968635291, 0.04839749638689682, 0.06811598083470016, 0.04976663713902235, -0.05385845882631839, -0.1803235455173999, -0.006591466067358852, 0.09082245125924238, 0.03475289429351688, 0.05553416066244245, 0.09584496240597218, -0.1413821827098727, -0.10728149531781674, 0.28771755784377456, -0.07658497371152043, -0.18637762888718862, 0.1700607234351337, -0.0769256422445178, -0.13488188929855824, 0.11690724905207753, 0.22771124900132417, 0.12993312516435981, -0.11665654344728682, 0.10006556152459234, -0.06168574437499046, 0.16675599501281976, 0.050354915622621774, 0.04639605888584629, 0.13792547012120485, 0.20742325144074858, 0.11318946987204254, 0.16124277470307424, -0.09383035841397941, -0.060838995426893236, -0.26644683030992744, -0.11897173046274111, -0.22948573550209403, 0.08736286569293589, -0.14442669097310865, -0.1694732176028192, 0.34114895935356615, 0.11012727863527834, 0.25011527885496615, 0.1694059299090877, 0.25490758880972864, 0.07892767332214862, 0.09630907689221203, 0.14259692629612983, 0.17027448029257358, 0.07964659196697176, 0.045721150990575554, -0.1555040839202702, 0.08752939529926516, 0.05470592783205211] |
1,803.01207 | Automatic Instrument Segmentation in Robot-Assisted Surgery Using Deep
Learning | Semantic segmentation of robotic instruments is an important problem for the
robot-assisted surgery. One of the main challenges is to correctly detect an
instrument's position for the tracking and pose estimation in the vicinity of
surgical scenes. Accurate pixel-wise instrument segmentation is needed to
address this challenge. In this paper we describe our winning solution for
MICCAI 2017 Endoscopic Vision SubChallenge: Robotic Instrument Segmentation.
Our approach demonstrates an improvement over the state-of-the-art results
using several novel deep neural network architectures. It addressed the binary
segmentation problem, where every pixel in an image is labeled as an instrument
or background from the surgery video feed. In addition, we solve a multi-class
segmentation problem, where we distinguish different instruments or different
parts of an instrument from the background. In this setting, our approach
outperforms other methods in every task subcategory for automatic instrument
segmentation thereby providing state-of-the-art solution for this problem. The
source code for our solution is made publicly available at
https://github.com/ternaus/robot-surgery-segmentation
| cs.CV | semantic segmentation of robotic instruments is an important problem for the robotassisted surgery one of the main challenges is to correctly detect an instruments position for the tracking and pose estimation in the vicinity of surgical scenes accurate pixelwise instrument segmentation is needed to address this challenge in this paper we describe our winning solution for miccai 2017 endoscopic vision subchallenge robotic instrument segmentation our approach demonstrates an improvement over the stateoftheart results using several novel deep neural network architectures it addressed the binary segmentation problem where every pixel in an image is labeled as an instrument or background from the surgery video feed in addition we solve a multiclass segmentation problem where we distinguish different instruments or different parts of an instrument from the background in this setting our approach outperforms other methods in every task subcategory for automatic instrument segmentation thereby providing stateoftheart solution for this problem the source code for our solution is made publicly available at httpsgithubcomternausrobotsurgerysegmentation | [['semantic', 'segmentation', 'of', 'robotic', 'instruments', 'is', 'an', 'important', 'problem', 'for', 'the', 'robotassisted', 'surgery', 'one', 'of', 'the', 'main', 'challenges', 'is', 'to', 'correctly', 'detect', 'an', 'instruments', 'position', 'for', 'the', 'tracking', 'and', 'pose', 'estimation', 'in', 'the', 'vicinity', 'of', 'surgical', 'scenes', 'accurate', 'pixelwise', 'instrument', 'segmentation', 'is', 'needed', 'to', 'address', 'this', 'challenge', 'in', 'this', 'paper', 'we', 'describe', 'our', 'winning', 'solution', 'for', 'miccai', '2017', 'endoscopic', 'vision', 'subchallenge', 'robotic', 'instrument', 'segmentation', 'our', 'approach', 'demonstrates', 'an', 'improvement', 'over', 'the', 'stateoftheart', 'results', 'using', 'several', 'novel', 'deep', 'neural', 'network', 'architectures', 'it', 'addressed', 'the', 'binary', 'segmentation', 'problem', 'where', 'every', 'pixel', 'in', 'an', 'image', 'is', 'labeled', 'as', 'an', 'instrument', 'or', 'background', 'from', 'the', 'surgery', 'video', 'feed', 'in', 'addition', 'we', 'solve', 'a', 'multiclass', 'segmentation', 'problem', 'where', 'we', 'distinguish', 'different', 'instruments', 'or', 'different', 'parts', 'of', 'an', 'instrument', 'from', 'the', 'background', 'in', 'this', 'setting', 'our', 'approach', 'outperforms', 'other', 'methods', 'in', 'every', 'task', 'subcategory', 'for', 'automatic', 'instrument', 'segmentation', 'thereby', 'providing', 'stateoftheart', 'solution', 'for', 'this', 'problem', 'the', 'source', 'code', 'for', 'our', 'solution', 'is', 'made', 'publicly', 'available', 'at', 'httpsgithubcomternausrobotsurgerysegmentation']] | [-0.04587442946085503, -0.05281378755262267, -0.06404414187127258, 0.028835021844133734, -0.08833034657873214, -0.17099250599567312, -0.05331068688465166, 0.45196759393438696, -0.24670054403250105, -0.362319838773692, 0.1203848276330973, -0.2902321837609634, -0.16573425698734354, 0.2514201410143869, -0.2286458833841607, 0.0822530580284365, 0.21915173025918194, 0.036270625807810576, 0.0017284324640058912, -0.26543725928640927, 0.28024062202021016, 0.04989371183164622, 0.2946086712763645, 0.038981632294598965, 0.18006823808536865, -0.003540799549955409, -0.04427694315600093, -0.0435510156363307, -0.07764282288262621, 0.13728075543185697, 0.3902628365598503, 0.1955755155242514, 0.31149012890236916, -0.3797060912573215, -0.19720024113776163, 0.0685487251234008, 0.12825801302678883, 0.07396985788072925, -0.03732328867190517, -0.36516173725030965, 0.04566103269244195, -0.16281467559747398, -0.025357999821426346, -0.07253494946053252, -0.02309272112324834, -0.08717779750877526, -0.28590303675737233, -0.003899892291519791, 0.03996491137731937, 0.07902619742089882, -0.15165172986162362, -0.09212086274055764, 0.08927931727157556, 0.2581796316313557, -0.007101340491499286, 0.12579649707768112, 0.10648643457898288, -0.25671386464091484, -0.13214664752595126, 0.3538400789431762, -0.01881739979144186, -0.20940700002247467, 0.16368575464875904, -0.027834710152819752, -0.21315636886865832, 0.13323486346344, 0.18148306353832594, 0.17807076442113612, -0.1680099584344134, 4.6073228804743846e-05, -0.030541002011159436, 0.20151451514684596, 0.05280528584116837, -0.06953603366855532, 0.2055703805584926, 0.31215978635591457, 0.08317036201260634, 0.16121650873283216, -0.20329619644180638, -0.0005554069764912128, -0.24237567362142726, -0.13768113874020854, -0.16614620652981102, -0.06340783051564358, -0.07962063349978052, -0.151728758426907, 0.38095834967098197, 0.2805176050329464, 0.12995262027834542, 0.0749574199093331, 0.42935574463917875, -0.009667205811274471, 0.08054427536417279, 0.0490592506914254, 0.20439377242291812, -0.021221442747628317, 0.12801801124805934, -0.168802289001178, 0.044818777136970314, 0.09781552552449284] |
1,803.01208 | Jeu de taquin, uniqueness of rectification, and ultradiscrete KP | In this paper, we study tropical-theoretic aspects of the ``rectification
algorithm'' on skew Young tableaux. It is shown that the algorithm is
interpreted as a time evolution of some tropical integrable system. By using
this fact, we construct a new combinatorial map that is essentially equivalent
to the rectification algorithm. Some of properties of the rectification can be
seen more clearly via this map. For example, the uniqueness of a rectification
boils down to an easy combinatorial problem. Our method is mainly based on the
two previous researches: the theory of geometric tableaux by Noumi-Yamada, and
the study on the relationship between jeu de taquin slides and the
ultradiscrete KP equation by Mikami and Katayama-Kakei.
| math.CO | in this paper we study tropicaltheoretic aspects of the rectification algorithm on skew young tableaux it is shown that the algorithm is interpreted as a time evolution of some tropical integrable system by using this fact we construct a new combinatorial map that is essentially equivalent to the rectification algorithm some of properties of the rectification can be seen more clearly via this map for example the uniqueness of a rectification boils down to an easy combinatorial problem our method is mainly based on the two previous researches the theory of geometric tableaux by noumiyamada and the study on the relationship between jeu de taquin slides and the ultradiscrete kp equation by mikami and katayamakakei | [['in', 'this', 'paper', 'we', 'study', 'tropicaltheoretic', 'aspects', 'of', 'the', 'rectification', 'algorithm', 'on', 'skew', 'young', 'tableaux', 'it', 'is', 'shown', 'that', 'the', 'algorithm', 'is', 'interpreted', 'as', 'a', 'time', 'evolution', 'of', 'some', 'tropical', 'integrable', 'system', 'by', 'using', 'this', 'fact', 'we', 'construct', 'a', 'new', 'combinatorial', 'map', 'that', 'is', 'essentially', 'equivalent', 'to', 'the', 'rectification', 'algorithm', 'some', 'of', 'properties', 'of', 'the', 'rectification', 'can', 'be', 'seen', 'more', 'clearly', 'via', 'this', 'map', 'for', 'example', 'the', 'uniqueness', 'of', 'a', 'rectification', 'boils', 'down', 'to', 'an', 'easy', 'combinatorial', 'problem', 'our', 'method', 'is', 'mainly', 'based', 'on', 'the', 'two', 'previous', 'researches', 'the', 'theory', 'of', 'geometric', 'tableaux', 'by', 'noumiyamada', 'and', 'the', 'study', 'on', 'the', 'relationship', 'between', 'jeu', 'de', 'taquin', 'slides', 'and', 'the', 'ultradiscrete', 'kp', 'equation', 'by', 'mikami', 'and', 'katayamakakei']] | [-0.09182843347870014, 0.04562059323312236, -0.14078510926005297, 0.08736575728835305, -0.09754416837157416, -0.10832384278182872, 0.015175334219488181, 0.3685722340430532, -0.3496023779402354, -0.2821748181720198, 0.11787480517003653, -0.22422771721280046, -0.25316564136716935, 0.23503581038676202, -0.1387943173176609, 0.0025862508253859623, 0.048501244168229665, -0.003515153601516171, -0.051240151080622, -0.2374265351910643, 0.33061075876217466, 0.0352719868658044, 0.25676964609218494, 0.05108897809259361, 0.13477500417086827, 0.004942546338757633, -0.015229905057432396, 0.02845772532808561, -0.14397282815129334, 0.12498026892405635, 0.20693875906415218, 0.12610142439786745, 0.1977100725551801, -0.3677259821478011, -0.11632965381223974, 0.11003462686702344, 0.1645498108784003, 0.09494269206022311, -0.0550877969213356, -0.28677065850102473, 0.07877343289581924, -0.12473837126578603, -0.1076525768107136, -0.04192444181535393, 0.014657491456351377, 0.03682123474261191, -0.20982275183113025, 0.03266853309053529, 0.1338369663488785, 0.06707960175949015, -0.03336739784988042, -0.11032902108750672, 0.007931835880819043, 0.06542493746383116, 0.024235161844574447, 0.03771557672631128, 0.069122709516835, -0.12384933118300978, -0.15693209702814265, 0.3590612858201244, -0.03763490244974881, -0.2261459343135357, 0.15512644677015228, -0.09016404381171535, -0.13284143350652552, 0.1295156654668972, 0.08401186762577188, 0.14896752146471823, -0.15631888162377955, 0.09877493769090506, -0.1370624473285196, 0.1270150735342343, 0.09210816915479622, -0.044143870805523226, 0.18936637369084305, 0.1609283274551022, 0.08459281043282577, 0.20566084546797875, -0.020279323122979673, -0.09473843820991792, -0.2660820989466239, -0.17161407539658416, -0.15788014510222378, 0.07011915305961988, -0.08875680800455095, -0.17594785526489432, 0.39731899256418857, 0.1778100157929917, 0.18683696403500757, 0.07558673719384908, 0.25137949384017183, 0.13179184736301458, 0.04248522373382002, -0.014597326176174517, 0.16514967439590172, 0.1761374360544973, 0.12502580687162532, -0.2525286193122156, 0.05245693317348404, 0.15530731560180097] |
1,803.01209 | Stochastic Resonance for a Model with Two Pathways | In this thesis we consider stochastic resonance for a diffusion with drift
given by a potential, which has two metastable states and two pathways between
them. Depending on the direction of the forcing the height of the two barriers,
one for each path, will either oscillate alternating or in synchronisation.
We consider a simplified model given by discrete and continuous time Markov
Chains with two states. This was done for alternating and synchronised wells.
The invariant measures are derived for both cases and shown to be constant for
the synchronised case. A PDF for the escape time from an oscillatory potential
is reviewed.
Methods of detecting stochastic resonance are presented, which are linear
response, signal-to-noise ratio, energy, out-of-phase measures, relative
entropy and entropy. A new statistical test called the conditional
Kolmogorov-Smirnov test is developed, which can be used to analyse stochastic
resonance.
An explicit two dimensional potential is introduced, the critical point
structure derived and the dynamics, the invariant state and escape time studied
numerically.
The six measures are unable to detect the stochastic resonance in the case of
synchronised saddles. The distribution of escape times however not only shows a
clear sign of stochastic resonance, but changing the direction of the forcing
from alternating to synchronised saddles an additional resonance at double the
forcing frequency starts to appear. The conditional KS test reliably detects
the stochastic resonance even for forcing quick enough and for data so sparse
that the stochastic resonance is not obvious directly from the histogram of
escape times.
| math.PR math.ST physics.data-an physics.geo-ph stat.TH | in this thesis we consider stochastic resonance for a diffusion with drift given by a potential which has two metastable states and two pathways between them depending on the direction of the forcing the height of the two barriers one for each path will either oscillate alternating or in synchronisation we consider a simplified model given by discrete and continuous time markov chains with two states this was done for alternating and synchronised wells the invariant measures are derived for both cases and shown to be constant for the synchronised case a pdf for the escape time from an oscillatory potential is reviewed methods of detecting stochastic resonance are presented which are linear response signaltonoise ratio energy outofphase measures relative entropy and entropy a new statistical test called the conditional kolmogorovsmirnov test is developed which can be used to analyse stochastic resonance an explicit two dimensional potential is introduced the critical point structure derived and the dynamics the invariant state and escape time studied numerically the six measures are unable to detect the stochastic resonance in the case of synchronised saddles the distribution of escape times however not only shows a clear sign of stochastic resonance but changing the direction of the forcing from alternating to synchronised saddles an additional resonance at double the forcing frequency starts to appear the conditional ks test reliably detects the stochastic resonance even for forcing quick enough and for data so sparse that the stochastic resonance is not obvious directly from the histogram of escape times | [['in', 'this', 'thesis', 'we', 'consider', 'stochastic', 'resonance', 'for', 'a', 'diffusion', 'with', 'drift', 'given', 'by', 'a', 'potential', 'which', 'has', 'two', 'metastable', 'states', 'and', 'two', 'pathways', 'between', 'them', 'depending', 'on', 'the', 'direction', 'of', 'the', 'forcing', 'the', 'height', 'of', 'the', 'two', 'barriers', 'one', 'for', 'each', 'path', 'will', 'either', 'oscillate', 'alternating', 'or', 'in', 'synchronisation', 'we', 'consider', 'a', 'simplified', 'model', 'given', 'by', 'discrete', 'and', 'continuous', 'time', 'markov', 'chains', 'with', 'two', 'states', 'this', 'was', 'done', 'for', 'alternating', 'and', 'synchronised', 'wells', 'the', 'invariant', 'measures', 'are', 'derived', 'for', 'both', 'cases', 'and', 'shown', 'to', 'be', 'constant', 'for', 'the', 'synchronised', 'case', 'a', 'pdf', 'for', 'the', 'escape', 'time', 'from', 'an', 'oscillatory', 'potential', 'is', 'reviewed', 'methods', 'of', 'detecting', 'stochastic', 'resonance', 'are', 'presented', 'which', 'are', 'linear', 'response', 'signaltonoise', 'ratio', 'energy', 'outofphase', 'measures', 'relative', 'entropy', 'and', 'entropy', 'a', 'new', 'statistical', 'test', 'called', 'the', 'conditional', 'kolmogorovsmirnov', 'test', 'is', 'developed', 'which', 'can', 'be', 'used', 'to', 'analyse', 'stochastic', 'resonance', 'an', 'explicit', 'two', 'dimensional', 'potential', 'is', 'introduced', 'the', 'critical', 'point', 'structure', 'derived', 'and', 'the', 'dynamics', 'the', 'invariant', 'state', 'and', 'escape', 'time', 'studied', 'numerically', 'the', 'six', 'measures', 'are', 'unable', 'to', 'detect', 'the', 'stochastic', 'resonance', 'in', 'the', 'case', 'of', 'synchronised', 'saddles', 'the', 'distribution', 'of', 'escape', 'times', 'however', 'not', 'only', 'shows', 'a', 'clear', 'sign', 'of', 'stochastic', 'resonance', 'but', 'changing', 'the', 'direction', 'of', 'the', 'forcing', 'from', 'alternating', 'to', 'synchronised', 'saddles', 'an', 'additional', 'resonance', 'at', 'double', 'the', 'forcing', 'frequency', 'starts', 'to', 'appear', 'the', 'conditional', 'ks', 'test', 'reliably', 'detects', 'the', 'stochastic', 'resonance', 'even', 'for', 'forcing', 'quick', 'enough', 'and', 'for', 'data', 'so', 'sparse', 'that', 'the', 'stochastic', 'resonance', 'is', 'not', 'obvious', 'directly', 'from', 'the', 'histogram', 'of', 'escape', 'times']] | [-0.137323733880799, 0.15035113138542833, -0.07119686861158929, 0.11154877831641999, -0.04366223115311374, -0.17788505910097488, 0.034041910356516755, 0.35903691805692184, -0.28732067576342996, -0.2615412117115089, 0.09904544083595586, -0.25587191404072596, -0.10633066149210439, 0.1807337118440219, -0.02040729124195105, 0.06130905073904802, 0.04913867223686317, 0.0796436952770732, -0.02887352368616987, -0.18953270693993315, 0.29208920973802116, 0.030257633987015913, 0.23825963817182041, 0.0046817692466050624, 0.11332452898551267, -0.0025826228370461318, -0.007389284444913742, 0.02818178420933951, -0.12059709662493592, 0.07291231911383672, 0.21078004548880494, 0.10014585373620133, 0.2669028624169721, -0.42133608943827094, -0.19334490715880834, 0.13701862574274104, 0.15315284994848918, 0.11769238662479135, -0.03623724032732998, -0.28760213475667, 0.04874049612535312, -0.12526402280791588, -0.12376300910014719, -0.05939410747738466, 0.03520549766327594, 0.048776644935262285, -0.29368334746525054, 0.09867113792856727, 0.06389906461224619, 0.055495121291772066, -0.05885802948706976, -0.09109514739756132, -0.028456947751923478, 0.10369166304885838, 0.06598325220855056, 0.014638160665829977, 0.13812841261212255, -0.08204742922533201, -0.13739070326869657, 0.3135600661663043, -0.09554777481678194, -0.21922607594335983, 0.2237834261761727, -0.15233110817378417, -0.10985288590410842, 0.16461271409126413, 0.15658586147788262, 0.11595370299700233, -0.17930573384099205, 0.041899400569188096, 0.018181935252089585, 0.1575198381265398, 0.08649047099179515, -0.02878366384492625, 0.19904332229256513, 0.10239808009998616, 0.11039642960023476, 0.14719917329438476, -0.14347850473559304, -0.14077953883217617, -0.2655005129368325, -0.13498255993712635, -0.17349497624349575, 0.023337358415855783, -0.054781033267130304, -0.17328842174913642, 0.43041874983836825, 0.12258102173528021, 0.21288480938944435, 0.05825892468177093, 0.28693206646084224, 0.1790430316274675, 0.02869900306483494, 0.05418843632963087, 0.2521490596330887, 0.1266789201125946, 0.08399447125737511, -0.23133051993476877, 0.0685028515195766, 0.02960429654552764] |
1,803.0121 | Observation of correlated excitations in bimolecular collisions | Whereas collisions between atoms and molecules are largely understood,
collisions between two molecules have proven much harder to study. In both
experiment and theory, our ability to determine quantum state-resolved
bimolecular cross sections lags behind their atom-molecule counterparts by
decades. For many bimolecular systems, even rules of thumb -- much less
intuitive understanding -- of scattering cross sections are lacking. Here, we
report the measurement of state-to-state differential cross sections on the
collision of state-selected and velocity-controlled nitric oxide (NO) radicals
and oxygen (O2) molecules. Using velocity map imaging of the scattered NO
radicals, the full product-pair correlations of rotational excitation that
occurs in both collision partners from individual encounters are revealed. The
correlated cross sections show surprisingly good agreement with quantum
scattering calculations using ab initio NO-O2 potential energy surfaces. The
observations show that the well-known energy-gap law that governs atom-molecule
collisions does not generally apply to bimolecular excitation processes, and
reveal a propensity rule for the vector correlation of product angular momenta.
| physics.chem-ph | whereas collisions between atoms and molecules are largely understood collisions between two molecules have proven much harder to study in both experiment and theory our ability to determine quantum stateresolved bimolecular cross sections lags behind their atommolecule counterparts by decades for many bimolecular systems even rules of thumb much less intuitive understanding of scattering cross sections are lacking here we report the measurement of statetostate differential cross sections on the collision of stateselected and velocitycontrolled nitric oxide no radicals and oxygen o2 molecules using velocity map imaging of the scattered no radicals the full productpair correlations of rotational excitation that occurs in both collision partners from individual encounters are revealed the correlated cross sections show surprisingly good agreement with quantum scattering calculations using ab initio noo2 potential energy surfaces the observations show that the wellknown energygap law that governs atommolecule collisions does not generally apply to bimolecular excitation processes and reveal a propensity rule for the vector correlation of product angular momenta | [['whereas', 'collisions', 'between', 'atoms', 'and', 'molecules', 'are', 'largely', 'understood', 'collisions', 'between', 'two', 'molecules', 'have', 'proven', 'much', 'harder', 'to', 'study', 'in', 'both', 'experiment', 'and', 'theory', 'our', 'ability', 'to', 'determine', 'quantum', 'stateresolved', 'bimolecular', 'cross', 'sections', 'lags', 'behind', 'their', 'atommolecule', 'counterparts', 'by', 'decades', 'for', 'many', 'bimolecular', 'systems', 'even', 'rules', 'of', 'thumb', 'much', 'less', 'intuitive', 'understanding', 'of', 'scattering', 'cross', 'sections', 'are', 'lacking', 'here', 'we', 'report', 'the', 'measurement', 'of', 'statetostate', 'differential', 'cross', 'sections', 'on', 'the', 'collision', 'of', 'stateselected', 'and', 'velocitycontrolled', 'nitric', 'oxide', 'no', 'radicals', 'and', 'oxygen', 'o2', 'molecules', 'using', 'velocity', 'map', 'imaging', 'of', 'the', 'scattered', 'no', 'radicals', 'the', 'full', 'productpair', 'correlations', 'of', 'rotational', 'excitation', 'that', 'occurs', 'in', 'both', 'collision', 'partners', 'from', 'individual', 'encounters', 'are', 'revealed', 'the', 'correlated', 'cross', 'sections', 'show', 'surprisingly', 'good', 'agreement', 'with', 'quantum', 'scattering', 'calculations', 'using', 'ab', 'initio', 'noo2', 'potential', 'energy', 'surfaces', 'the', 'observations', 'show', 'that', 'the', 'wellknown', 'energygap', 'law', 'that', 'governs', 'atommolecule', 'collisions', 'does', 'not', 'generally', 'apply', 'to', 'bimolecular', 'excitation', 'processes', 'and', 'reveal', 'a', 'propensity', 'rule', 'for', 'the', 'vector', 'correlation', 'of', 'product', 'angular', 'momenta']] | [-0.09391867475642357, 0.15010040673660113, -0.07908467616944108, 0.12198965243151179, 0.021650466433493422, -0.13518337463610805, 0.04368471718516957, 0.452560109749902, -0.21849909438751638, -0.27125547057075894, -0.046873592447082044, -0.32990481835149693, -0.0902619445027085, 0.18048388293209428, 0.0692447148700012, 0.05379945613531163, 0.1067849380284315, -0.023536235724168363, -0.01757403128722217, -0.17932151992367834, 0.2760960701911245, 0.0987874760714476, 0.23711447311798112, 0.14759791659016627, 0.06977846249064897, 0.04154245910176542, -0.01448305368248839, -0.061265710700536144, -0.12903890937227516, 0.132145668440171, 0.30144279910309707, 0.009059807272569742, 0.14749320090486434, -0.4823212712770328, -0.185670387808932, 0.0981896160141332, 0.16487807167723076, 0.15739035386504838, -0.05862909599163686, -0.2260276683489792, -0.04239612134551862, -0.1585792257446883, -0.0967448348266771, -0.12313296828215244, 0.06929973690275801, 0.03959473809954943, -0.23122147932008374, 0.12061133482202421, 0.021662357928289567, 0.1202105710293381, -0.10180490920465672, -0.1599050266726408, -0.0888555609373725, 0.04207061637789593, 0.02724803935852833, -0.024890899759338937, 0.2111460387968691, -0.12488392652812763, -0.14073151820157365, 0.4085645090439357, -0.03123515745101031, -0.1283864471493871, 0.23377546880510636, -0.20504257980501278, -0.09299976073816651, 0.24116678850259632, 0.14105275782058016, 0.14206145232114978, -0.17060896961775143, 0.01830513462300587, 0.016677238282863983, 0.208210992118984, 0.12412247259035211, 0.05464565213583228, 0.16996781446796377, 0.1118125413369853, -0.024532911197820795, 0.03353951605677139, -0.10363047092541819, -0.16351455693948083, -0.2528150643593108, -0.15495941344997846, -0.13483874094672502, 0.06749924105106402, 0.006948429221392871, -0.09144492076884489, 0.256497971189674, 0.09598354135814588, 0.23296466863266688, 0.009205749818647746, 0.28723865761130585, 0.11769229286946939, 0.058860085390915626, 0.018354938304401002, 0.29942233766487336, 0.2082343323942041, 0.077072331369709, -0.27631125834595877, 0.1217919564107433, -0.003475349200743949] |
1,803.01211 | Robust Power Flow and Three-Phase Power Flow Analyses | Robust simulation is essential for reliable operation and planning of
transmission and distribution power grids. At present, disparate methods exist
for steady-state analysis of the transmission (power flow) and distribution
power grid (three-phase power flow). Due to the non-linear nature of the
problem, it is difficult for alternating current (AC) power flow and
three-phase power flow analyses to ensure convergence to the correct physical
solution, particularly from arbitrary initial conditions, or when evaluating a
change (e.g. contingency) in the grid. In this paper, we describe our
equivalent circuit formulation approach with current and voltage variables that
models both the positive sequence network of the transmission grid and
three-phase network of the distribution grid without loss of generality. The
proposed circuit models and formalism enable the extension and application of
circuit simulation techniques to solve for the steady-state solution with
excellent robustness of convergence. Examples for positive sequence
transmission and three-phase distribution systems, including actual 75k+ nodes
Eastern Interconnection transmission test cases and 8k+ nodes taxonomy
distribution test cases, are solved from arbitrary initial guesses to
demonstrate the efficacy of our approach.
| eess.SP cs.CE | robust simulation is essential for reliable operation and planning of transmission and distribution power grids at present disparate methods exist for steadystate analysis of the transmission power flow and distribution power grid threephase power flow due to the nonlinear nature of the problem it is difficult for alternating current ac power flow and threephase power flow analyses to ensure convergence to the correct physical solution particularly from arbitrary initial conditions or when evaluating a change eg contingency in the grid in this paper we describe our equivalent circuit formulation approach with current and voltage variables that models both the positive sequence network of the transmission grid and threephase network of the distribution grid without loss of generality the proposed circuit models and formalism enable the extension and application of circuit simulation techniques to solve for the steadystate solution with excellent robustness of convergence examples for positive sequence transmission and threephase distribution systems including actual 75k nodes eastern interconnection transmission test cases and 8k nodes taxonomy distribution test cases are solved from arbitrary initial guesses to demonstrate the efficacy of our approach | [['robust', 'simulation', 'is', 'essential', 'for', 'reliable', 'operation', 'and', 'planning', 'of', 'transmission', 'and', 'distribution', 'power', 'grids', 'at', 'present', 'disparate', 'methods', 'exist', 'for', 'steadystate', 'analysis', 'of', 'the', 'transmission', 'power', 'flow', 'and', 'distribution', 'power', 'grid', 'threephase', 'power', 'flow', 'due', 'to', 'the', 'nonlinear', 'nature', 'of', 'the', 'problem', 'it', 'is', 'difficult', 'for', 'alternating', 'current', 'ac', 'power', 'flow', 'and', 'threephase', 'power', 'flow', 'analyses', 'to', 'ensure', 'convergence', 'to', 'the', 'correct', 'physical', 'solution', 'particularly', 'from', 'arbitrary', 'initial', 'conditions', 'or', 'when', 'evaluating', 'a', 'change', 'eg', 'contingency', 'in', 'the', 'grid', 'in', 'this', 'paper', 'we', 'describe', 'our', 'equivalent', 'circuit', 'formulation', 'approach', 'with', 'current', 'and', 'voltage', 'variables', 'that', 'models', 'both', 'the', 'positive', 'sequence', 'network', 'of', 'the', 'transmission', 'grid', 'and', 'threephase', 'network', 'of', 'the', 'distribution', 'grid', 'without', 'loss', 'of', 'generality', 'the', 'proposed', 'circuit', 'models', 'and', 'formalism', 'enable', 'the', 'extension', 'and', 'application', 'of', 'circuit', 'simulation', 'techniques', 'to', 'solve', 'for', 'the', 'steadystate', 'solution', 'with', 'excellent', 'robustness', 'of', 'convergence', 'examples', 'for', 'positive', 'sequence', 'transmission', 'and', 'threephase', 'distribution', 'systems', 'including', 'actual', '75k', 'nodes', 'eastern', 'interconnection', 'transmission', 'test', 'cases', 'and', '8k', 'nodes', 'taxonomy', 'distribution', 'test', 'cases', 'are', 'solved', 'from', 'arbitrary', 'initial', 'guesses', 'to', 'demonstrate', 'the', 'efficacy', 'of', 'our', 'approach']] | [-0.1270478893719737, -0.020643098130616364, -0.05103625319846674, 0.014029323893923374, -0.02201293600923819, -0.19524933240062542, 0.06477030299055067, 0.3758190570203639, -0.26192804257699304, -0.3436970348130315, 0.13591245246809286, -0.2558023885731169, -0.13996642095921819, 0.20855709115424045, -0.06999703177034813, 0.14122805047332623, 0.08030314485218314, -0.030497899235262232, -0.013101087174332027, -0.21287249158540464, 0.3072575454739082, 0.058626265362810695, 0.36919375994752124, 0.04441342134676997, 0.10162291203841609, -0.014505909414941353, -0.021624427672105106, 0.04579925151473572, -0.0797263967371832, 0.09528564649842453, 0.25072084462132016, 0.1504337669952222, 0.23848107030090376, -0.4495991654951352, -0.23740124383372724, 0.1111799172339292, 0.12535538371272567, 0.07812757841542939, -0.028752569698353006, -0.19214611324527975, 0.11442156798767121, -0.20350868881999087, -0.10937707655605196, -0.09898365493503641, -0.003459343702136153, 0.08688398415109565, -0.3382706289225932, 0.055836337180525185, 0.03997643743718856, 0.07379087818611557, -0.07164352561362623, -0.08925677038914426, -0.004566039051346028, 0.16554028125710074, -0.0027154387233428944, -0.04405790210691234, 0.12809448278359864, -0.12581783847610636, -0.08604254553773703, 0.3633906757922133, 0.007466832519308226, -0.2067148429676067, 0.14194881419512284, -0.08547318821132327, -0.07659775288055204, 0.11923417653528284, 0.2124484417399196, 0.0852972966122302, -0.13102784825822414, 0.015171765372316605, 0.002400039131778874, 0.15676282999589422, 0.05135409152572614, -0.03629830886368017, 0.19203927818793823, 0.17574103446085604, 0.123356455400617, 0.13870740271265392, -0.08256102295962899, -0.14850582854657624, -0.2707308500552375, -0.09478182271906405, -0.17036866701226708, 0.02457827129028223, -0.1308662877564424, -0.1565522252921612, 0.4415663880622786, 0.1952223073670548, 0.14012512653289125, 0.11044968173643625, 0.39806973485106306, 0.1414492500763263, -0.006632685358700399, 0.10924772408312361, 0.15536534326544638, 0.1380129553434228, 0.1560060414922995, -0.2658656865312687, 0.08589141632980817, 0.01050435985021746] |
1,803.01212 | Influencers identification in complex networks through
reaction-diffusion dynamics | A pivotal idea in network science, marketing research and innovation
diffusion theories is that a small group of nodes -- called influencers -- have
the largest impact on social contagion and epidemic processes in networks.
Despite the long-standing interest in the influencers identification problem in
socio-economic and biological networks, there is not yet agreement on which is
the best identification strategy. State-of-the-art strategies are typically
based either on heuristic centrality metrics or on analytic arguments that only
hold for specific network topologies or peculiar dynamical regimes. Here, we
leverage the recently introduced random-walk effective distance -- a
topological metric that estimates almost perfectly the arrival time of
diffusive spreading processes on networks -- to introduce a new centrality
metric which quantifies how close a node is to the other nodes. We show that
the new centrality metric significantly outperforms state-of-the-art metrics in
detecting the influencers for global contagion processes. Our findings reveal
the essential role of the network effective distance for the influencers
identification and lead us closer to the optimal solution of the problem.
| physics.soc-ph cs.SI | a pivotal idea in network science marketing research and innovation diffusion theories is that a small group of nodes called influencers have the largest impact on social contagion and epidemic processes in networks despite the longstanding interest in the influencers identification problem in socioeconomic and biological networks there is not yet agreement on which is the best identification strategy stateoftheart strategies are typically based either on heuristic centrality metrics or on analytic arguments that only hold for specific network topologies or peculiar dynamical regimes here we leverage the recently introduced randomwalk effective distance a topological metric that estimates almost perfectly the arrival time of diffusive spreading processes on networks to introduce a new centrality metric which quantifies how close a node is to the other nodes we show that the new centrality metric significantly outperforms stateoftheart metrics in detecting the influencers for global contagion processes our findings reveal the essential role of the network effective distance for the influencers identification and lead us closer to the optimal solution of the problem | [['a', 'pivotal', 'idea', 'in', 'network', 'science', 'marketing', 'research', 'and', 'innovation', 'diffusion', 'theories', 'is', 'that', 'a', 'small', 'group', 'of', 'nodes', 'called', 'influencers', 'have', 'the', 'largest', 'impact', 'on', 'social', 'contagion', 'and', 'epidemic', 'processes', 'in', 'networks', 'despite', 'the', 'longstanding', 'interest', 'in', 'the', 'influencers', 'identification', 'problem', 'in', 'socioeconomic', 'and', 'biological', 'networks', 'there', 'is', 'not', 'yet', 'agreement', 'on', 'which', 'is', 'the', 'best', 'identification', 'strategy', 'stateoftheart', 'strategies', 'are', 'typically', 'based', 'either', 'on', 'heuristic', 'centrality', 'metrics', 'or', 'on', 'analytic', 'arguments', 'that', 'only', 'hold', 'for', 'specific', 'network', 'topologies', 'or', 'peculiar', 'dynamical', 'regimes', 'here', 'we', 'leverage', 'the', 'recently', 'introduced', 'randomwalk', 'effective', 'distance', 'a', 'topological', 'metric', 'that', 'estimates', 'almost', 'perfectly', 'the', 'arrival', 'time', 'of', 'diffusive', 'spreading', 'processes', 'on', 'networks', 'to', 'introduce', 'a', 'new', 'centrality', 'metric', 'which', 'quantifies', 'how', 'close', 'a', 'node', 'is', 'to', 'the', 'other', 'nodes', 'we', 'show', 'that', 'the', 'new', 'centrality', 'metric', 'significantly', 'outperforms', 'stateoftheart', 'metrics', 'in', 'detecting', 'the', 'influencers', 'for', 'global', 'contagion', 'processes', 'our', 'findings', 'reveal', 'the', 'essential', 'role', 'of', 'the', 'network', 'effective', 'distance', 'for', 'the', 'influencers', 'identification', 'and', 'lead', 'us', 'closer', 'to', 'the', 'optimal', 'solution', 'of', 'the', 'problem']] | [-0.1276868478346028, 0.0569258005527115, -0.08682578661593429, 0.10275023916330493, -0.10498368498264697, -0.1723248048199406, 0.09111282193988333, 0.4011140054429484, -0.23737611825311045, -0.26061580051825933, 0.059528512236858275, -0.3034000890574565, -0.24224550009307544, 0.1670522983492303, -0.07019946912347137, 0.0431611274934288, 0.0998506571128093, 0.07404821082590181, 0.015604150742945964, -0.24263699676470296, 0.35959532292156715, 0.08817461943281106, 0.3505923108263105, 0.08841446508947563, 0.09466829763899683, -0.020086311431005442, -0.05308303447666289, 0.058900430614036124, -0.138389298930112, 0.13358735894833348, 0.2830186263108027, 0.17494929617554036, 0.3367668467775336, -0.38359085682844907, -0.2754012544983889, 0.13726640158000658, 0.14293630939107715, 0.08871882941508502, -0.015566985945936227, -0.3039471363616094, 0.06974951755691167, -0.16672105201089765, -0.0701859287539094, -0.05761872949786702, 0.03206328764334539, 0.014483671319842534, -0.24878998244268416, 0.06054792217794555, 0.029930242699978068, 0.03101790554675802, -0.02579595837047683, -0.106930516948869, 0.005938139285249581, 0.18252506510937336, 0.054428863460306974, 0.01765222131269194, 0.15988624953986172, -0.14205786559325018, -0.19464705381760297, 0.35738134110749464, -0.011925859920740432, -0.19643846024045644, 0.20175777265171613, -0.07453151559525262, -0.1728950178125405, 0.08397379506322179, 0.24794236846453352, 0.11110395981728682, -0.16371190885615627, 0.01064314914061225, -0.03190212997972791, 0.140132107447536, 0.026549245546740746, 0.038587511168159366, 0.14550699063633604, 0.23084615047323948, 0.15785457202157124, 0.04378227787180831, -0.03374739468937783, -0.1431761731540686, -0.21550363337087353, -0.10699298442715822, -0.18331690470018147, 0.045201491324278004, -0.17815515201515655, -0.1787111448091373, 0.4258765538280274, 0.19207888526158823, 0.19004893896635622, 0.06746061003429281, 0.2608977615743418, 0.030294652051314146, 0.06965158921693675, 0.11544537859320728, 0.24274429575206877, 0.06754324610660953, 0.11286532066419329, -0.1744778921435538, 0.1968898917194347, 0.05876659739293479] |
1,803.01213 | Giant Planar Hall Effect in the Dirac Semimetal ZrTe5 | Recently, giant planar Hall effect originating from chiral anomaly has been
predicted in nonmagnetic Dirac/Weyl semimetals. ZrTe5 is considered to be an
intriguing Dirac semimetal at the boundary of weak topological insulators and
strong topological insulators, though this claim still remains controversial.
Here, we report the observation in ZrTe5 of the giant planar Hall resistivity
that shows two different magnetic-field dependences as predicted by theory and
a maximum at the Lifshitz transition temperature. We found that the giant
planar Hall resistivity fades out with decreasing the thickness of ZrTe5
nanoplates, which may be ascribed to the vanishing of the 3D nature of the
samples. In addition, we have observed a nontrivial Berry phase,
chiral-anomaly-induced negative longitudinal magnetoresistance, and a giant
in-plane anisotropic magnetoresistance in these ZrTe5 nanoplates. All the
experimental observations demonstrated coherently that ZrTe5 is a Dirac
semimetal.
| cond-mat.mes-hall cond-mat.mtrl-sci | recently giant planar hall effect originating from chiral anomaly has been predicted in nonmagnetic diracweyl semimetals zrte5 is considered to be an intriguing dirac semimetal at the boundary of weak topological insulators and strong topological insulators though this claim still remains controversial here we report the observation in zrte5 of the giant planar hall resistivity that shows two different magneticfield dependences as predicted by theory and a maximum at the lifshitz transition temperature we found that the giant planar hall resistivity fades out with decreasing the thickness of zrte5 nanoplates which may be ascribed to the vanishing of the 3d nature of the samples in addition we have observed a nontrivial berry phase chiralanomalyinduced negative longitudinal magnetoresistance and a giant inplane anisotropic magnetoresistance in these zrte5 nanoplates all the experimental observations demonstrated coherently that zrte5 is a dirac semimetal | [['recently', 'giant', 'planar', 'hall', 'effect', 'originating', 'from', 'chiral', 'anomaly', 'has', 'been', 'predicted', 'in', 'nonmagnetic', 'diracweyl', 'semimetals', 'zrte5', 'is', 'considered', 'to', 'be', 'an', 'intriguing', 'dirac', 'semimetal', 'at', 'the', 'boundary', 'of', 'weak', 'topological', 'insulators', 'and', 'strong', 'topological', 'insulators', 'though', 'this', 'claim', 'still', 'remains', 'controversial', 'here', 'we', 'report', 'the', 'observation', 'in', 'zrte5', 'of', 'the', 'giant', 'planar', 'hall', 'resistivity', 'that', 'shows', 'two', 'different', 'magneticfield', 'dependences', 'as', 'predicted', 'by', 'theory', 'and', 'a', 'maximum', 'at', 'the', 'lifshitz', 'transition', 'temperature', 'we', 'found', 'that', 'the', 'giant', 'planar', 'hall', 'resistivity', 'fades', 'out', 'with', 'decreasing', 'the', 'thickness', 'of', 'zrte5', 'nanoplates', 'which', 'may', 'be', 'ascribed', 'to', 'the', 'vanishing', 'of', 'the', '3d', 'nature', 'of', 'the', 'samples', 'in', 'addition', 'we', 'have', 'observed', 'a', 'nontrivial', 'berry', 'phase', 'chiralanomalyinduced', 'negative', 'longitudinal', 'magnetoresistance', 'and', 'a', 'giant', 'inplane', 'anisotropic', 'magnetoresistance', 'in', 'these', 'zrte5', 'nanoplates', 'all', 'the', 'experimental', 'observations', 'demonstrated', 'coherently', 'that', 'zrte5', 'is', 'a', 'dirac', 'semimetal']] | [-0.21511378723021218, 0.2393874781370961, -0.06341380940411119, -0.02180346654453045, -0.12418238733611676, -0.1953864525936112, 0.06635152401682665, 0.3775208790557108, -0.21507072593152954, -0.30544985703233146, -0.003301394718658665, -0.3413995496145841, -0.23887336589530975, 0.16461327798543093, 0.014761075866746081, 0.0511731706606899, -0.05969702404505317, -0.07603177094859058, -0.12705169627409213, -0.21617313268749663, 0.2933930799633305, -0.030732433501448806, 0.3419080282244291, 0.11282456260802143, 0.030563093860215253, -0.09612251368048748, 0.13117789136468555, 0.12082510831617359, -0.15027649983091143, -0.04494849089794603, 0.23330815186373133, -0.19678662105655784, 0.14575660287105627, -0.4133283389273329, -0.2302300137926595, -0.011796831360856153, 0.13492943626909476, 0.14012904198708662, -0.1305721493275917, -0.3342485315962762, 0.08283116093472294, -0.12373617711895402, -0.1321389963546687, -0.07591658215159955, 0.03071738734834598, -0.14947411888683942, -0.16507936753771282, 0.12589173389774194, 0.0682475364048277, 0.11438690993995608, -0.07703653915677273, -0.16069864954097549, -0.12009536281592496, 0.0440420361870117, 0.10532274249640793, 0.025363948054449713, 0.09655785270413195, -0.12971992601228852, -0.16240873550186338, 0.3386249657436881, -0.05741444839488553, -0.01468481375174462, 0.17473055618356212, -0.25765959190650156, -0.11213837485369024, 0.17491165059281216, 0.10930645000105184, 0.09442180017198341, -0.11742848101699643, 0.08353930324918347, -0.08708413312991109, 0.09448650367203695, 0.03288532492023069, 0.06837669414454613, 0.35565947505065065, 0.15742514852309544, 0.009993443623239147, 0.144781246118288, -0.15236718463880158, 0.03914129565321449, -0.21765466332030686, -0.18504685362795895, -0.2839078156343337, 0.15207803439335438, -0.036403565167848435, -0.2567336709589522, 0.3817726044503945, 0.15474641176289247, 0.19169052043403295, -0.1072896256666644, 0.22911776128171038, 0.13292417206136725, 0.0982209619715054, 0.05735995727118807, 0.3231193808825228, 0.2013591085712466, 0.1728163711166522, -0.3100217252706542, 0.09791452182875271, -0.013794863009420425] |
1,803.01214 | Existence and Uniqueness of Singular Solutions for a Conservation Law
Arising in Magnetohydrodynamics | The Brio system is a two-by-two system of conservation laws arising as a
simplified model in ideal magnetohydrodynamics (MHD). The system has the form
\begin{align*} \partial_t u+\partial_x \Big({\textstyle
\frac{u^2+v^2}{2}}\Big)=0,\\ \partial_t v+\partial_x \big(v(u-1)\big)=0.
\end{align*} It was found in previous works that the standard theory of
hyperbolic conservation laws does not apply to this system since the
characteristic fields are not genuinely nonlinear on the set $v=0$. As a
consequence, certain Riemann problems have no weak solutions in the traditional
class of functions of bounded variation.
It was argued in Nonlinearity 9, 1547--1563 (1996) that in order to solve the
system, singular solutions containing Dirac masses along the shock waves might
have to be used. Solutions of this type were exhibited in Proc. Edinb. Math.
Soc. 55, 711--729 (2012) and Russ. J. Math. Phys. 22, 518--527 (2015), but
uniqueness was not obtained.
In the current work, we introduce a nonlinear change of variables which makes
it possible to solve the Riemann problem in the framework of the standard
theory of conservation laws. In addition, we develop a criterion which leads to
an admissibility condition for singular solutions of the original system, and
it can be shown that admissible solutions are unique in the framework developed
here.
| math.AP | the brio system is a twobytwo system of conservation laws arising as a simplified model in ideal magnetohydrodynamics mhd the system has the form beginalign partial_t upartial_x bigtextstyle fracu2v22big0 partial_t vpartial_x bigvu1big0 endalign it was found in previous works that the standard theory of hyperbolic conservation laws does not apply to this system since the characteristic fields are not genuinely nonlinear on the set v0 as a consequence certain riemann problems have no weak solutions in the traditional class of functions of bounded variation it was argued in nonlinearity 9 15471563 1996 that in order to solve the system singular solutions containing dirac masses along the shock waves might have to be used solutions of this type were exhibited in proc edinb math soc 55 711729 2012 and russ j math phys 22 518527 2015 but uniqueness was not obtained in the current work we introduce a nonlinear change of variables which makes it possible to solve the riemann problem in the framework of the standard theory of conservation laws in addition we develop a criterion which leads to an admissibility condition for singular solutions of the original system and it can be shown that admissible solutions are unique in the framework developed here | [['the', 'brio', 'system', 'is', 'a', 'twobytwo', 'system', 'of', 'conservation', 'laws', 'arising', 'as', 'a', 'simplified', 'model', 'in', 'ideal', 'magnetohydrodynamics', 'mhd', 'the', 'system', 'has', 'the', 'form', 'beginalign', 'partial_t', 'upartial_x', 'bigtextstyle', 'fracu2v22big0', 'partial_t', 'vpartial_x', 'bigvu1big0', 'endalign', 'it', 'was', 'found', 'in', 'previous', 'works', 'that', 'the', 'standard', 'theory', 'of', 'hyperbolic', 'conservation', 'laws', 'does', 'not', 'apply', 'to', 'this', 'system', 'since', 'the', 'characteristic', 'fields', 'are', 'not', 'genuinely', 'nonlinear', 'on', 'the', 'set', 'v0', 'as', 'a', 'consequence', 'certain', 'riemann', 'problems', 'have', 'no', 'weak', 'solutions', 'in', 'the', 'traditional', 'class', 'of', 'functions', 'of', 'bounded', 'variation', 'it', 'was', 'argued', 'in', 'nonlinearity', '9', '15471563', '1996', 'that', 'in', 'order', 'to', 'solve', 'the', 'system', 'singular', 'solutions', 'containing', 'dirac', 'masses', 'along', 'the', 'shock', 'waves', 'might', 'have', 'to', 'be', 'used', 'solutions', 'of', 'this', 'type', 'were', 'exhibited', 'in', 'proc', 'edinb', 'math', 'soc', '55', '711729', '2012', 'and', 'russ', 'j', 'math', 'phys', '22', '518527', '2015', 'but', 'uniqueness', 'was', 'not', 'obtained', 'in', 'the', 'current', 'work', 'we', 'introduce', 'a', 'nonlinear', 'change', 'of', 'variables', 'which', 'makes', 'it', 'possible', 'to', 'solve', 'the', 'riemann', 'problem', 'in', 'the', 'framework', 'of', 'the', 'standard', 'theory', 'of', 'conservation', 'laws', 'in', 'addition', 'we', 'develop', 'a', 'criterion', 'which', 'leads', 'to', 'an', 'admissibility', 'condition', 'for', 'singular', 'solutions', 'of', 'the', 'original', 'system', 'and', 'it', 'can', 'be', 'shown', 'that', 'admissible', 'solutions', 'are', 'unique', 'in', 'the', 'framework', 'developed', 'here']] | [-0.1379260255923086, 0.04312964969462233, -0.0669171109116085, 0.038682907460998665, -0.09421269967320509, -0.1396714405332483, -0.02475720034182851, 0.27418604180958045, -0.27035804228543553, -0.28973165404156076, 0.10674027023968828, -0.27369901498456545, -0.15746746990563615, 0.19186659768694175, -0.09375533978609198, 0.08099351487150985, 0.033536722330609336, -0.013320584451228532, -0.04748638441259925, -0.23970152350137847, 0.309917072915206, -0.00841005037809551, 0.25715351877071807, 0.04341443766312221, 0.10441708110616042, -0.052066469133822055, 0.011088189281694288, 0.03683373260036187, -0.13730117186665036, 0.03564403581311831, 0.2310427181952519, 0.0972093674639354, 0.2785365513803355, -0.4113402658389235, -0.2208382185603188, 0.11752587008736648, 0.1095699668922509, 0.09025126018523409, 0.0173517308044675, -0.2740291486926643, 0.10042852229659674, -0.16004263291881438, -0.1815428763155217, -0.06718975068925291, 0.07005235422117521, 0.020824575581711392, -0.293593214499308, 0.12645507079064466, 0.11473908255943477, 0.01764930245509295, -0.10039942830145283, -0.087719708487477, -0.0338325696172934, 0.03283209106599798, 0.039506318415895254, 0.05117505392397051, 0.03792603950643418, -0.0948366763079729, -0.09821171750675659, 0.40290127993722885, -0.04635521396103657, -0.2526660776324095, 0.20124868572955684, -0.11684199241322599, -0.14622516323318135, 0.11653175918808283, 0.16477332283191534, 0.13688719173779293, -0.1854376485666298, 0.16532362631833353, -0.1036738576011124, 0.14596205756866507, 0.0829246484826566, -0.02662845652334259, 0.14510978143115774, 0.09050240077637255, 0.06440017335544511, 0.09026623088795198, -0.027568465023009317, -0.10746652020375501, -0.3223861565680376, -0.17220239417166544, -0.1468380959894584, 0.11095166408802247, -0.001299070860633427, -0.16541012334776922, 0.36783669464532476, 0.143414589806878, 0.12357731780265363, 0.025835849127342582, 0.17239545612614982, 0.1993643511916013, 0.047145271135563306, 0.10553514851941442, 0.2819783623895741, 0.15820202466019676, 0.17949729699793518, -0.18365630423365048, 0.00576047716443712, 0.11851981947486875] |
1,803.01215 | A Splitting Method For Overcoming the Curse of Dimensionality in
Hamilton-Jacobi Equations Arising from Nonlinear Optimal Control and
Differential Games with Applications to Trajectory Generation | Recent observations have been made that bridge splitting methods arising from
optimization, to the Hopf and Lax formulas for Hamilton-Jacobi Equations with
Hamiltonians $H(p)$. This has produced extremely fast algorithms in computing
solutions of these PDEs. More recent observations were made in generalizing the
Hopf and Lax formulas to state-and-time-dependent cases $H(x,p,t)$. In this
article, we apply a new splitting method based on the Primal Dual Hybrid
Gradient algorithm (a.k.a. Chambolle-Pock) to nonlinear optimal control and
differential games problems, based on techniques from the derivation of the new
Hopf and Lax formulas, which allow us to compute solutions at points $(x,t)$
directly, i.e. without the use of grids in space. This algorithm also allows us
to create trajectories directly. Thus we are able to lift the curse of
dimensionality a bit, and therefore compute solutions in much higher dimensions
than before. And in our numerical experiments, we actually observe that our
computations scale polynomially in time. Furthermore, this new algorithm is
embarrassingly parallelizable.
| math.OC | recent observations have been made that bridge splitting methods arising from optimization to the hopf and lax formulas for hamiltonjacobi equations with hamiltonians hp this has produced extremely fast algorithms in computing solutions of these pdes more recent observations were made in generalizing the hopf and lax formulas to stateandtimedependent cases hxpt in this article we apply a new splitting method based on the primal dual hybrid gradient algorithm aka chambollepock to nonlinear optimal control and differential games problems based on techniques from the derivation of the new hopf and lax formulas which allow us to compute solutions at points xt directly ie without the use of grids in space this algorithm also allows us to create trajectories directly thus we are able to lift the curse of dimensionality a bit and therefore compute solutions in much higher dimensions than before and in our numerical experiments we actually observe that our computations scale polynomially in time furthermore this new algorithm is embarrassingly parallelizable | [['recent', 'observations', 'have', 'been', 'made', 'that', 'bridge', 'splitting', 'methods', 'arising', 'from', 'optimization', 'to', 'the', 'hopf', 'and', 'lax', 'formulas', 'for', 'hamiltonjacobi', 'equations', 'with', 'hamiltonians', 'hp', 'this', 'has', 'produced', 'extremely', 'fast', 'algorithms', 'in', 'computing', 'solutions', 'of', 'these', 'pdes', 'more', 'recent', 'observations', 'were', 'made', 'in', 'generalizing', 'the', 'hopf', 'and', 'lax', 'formulas', 'to', 'stateandtimedependent', 'cases', 'hxpt', 'in', 'this', 'article', 'we', 'apply', 'a', 'new', 'splitting', 'method', 'based', 'on', 'the', 'primal', 'dual', 'hybrid', 'gradient', 'algorithm', 'aka', 'chambollepock', 'to', 'nonlinear', 'optimal', 'control', 'and', 'differential', 'games', 'problems', 'based', 'on', 'techniques', 'from', 'the', 'derivation', 'of', 'the', 'new', 'hopf', 'and', 'lax', 'formulas', 'which', 'allow', 'us', 'to', 'compute', 'solutions', 'at', 'points', 'xt', 'directly', 'ie', 'without', 'the', 'use', 'of', 'grids', 'in', 'space', 'this', 'algorithm', 'also', 'allows', 'us', 'to', 'create', 'trajectories', 'directly', 'thus', 'we', 'are', 'able', 'to', 'lift', 'the', 'curse', 'of', 'dimensionality', 'a', 'bit', 'and', 'therefore', 'compute', 'solutions', 'in', 'much', 'higher', 'dimensions', 'than', 'before', 'and', 'in', 'our', 'numerical', 'experiments', 'we', 'actually', 'observe', 'that', 'our', 'computations', 'scale', 'polynomially', 'in', 'time', 'furthermore', 'this', 'new', 'algorithm', 'is', 'embarrassingly', 'parallelizable']] | [-0.06788653113094538, 0.022812368181522612, -0.11877298189390359, 0.07631319756263918, -0.14080525009697417, -0.17675853678582948, 0.045665021589813455, 0.3659969191469344, -0.29663601729524447, -0.28960423338525915, 0.12054478035115833, -0.23517286258810385, -0.18020537589176525, 0.2365725100569335, -0.08772194469830863, 0.08386919466292854, 0.09831957687712907, -0.021277242583038723, -0.12620632953504907, -0.2584694617767071, 0.3137636535461808, 0.023089497396147546, 0.2402042128306664, 0.00681634336842201, 0.1397667728532623, -0.03460347193960146, -0.036084269242430175, 0.015500697769255814, -0.14855114823355653, 0.1519572152238753, 0.28175350551976375, 0.12575837165364467, 0.2539042555887405, -0.45759501010409476, -0.14652217667475112, 0.10928741660411757, 0.19106831743933814, 0.1584670824842401, -0.028994924662348005, -0.27512483538507865, 0.0936549564300358, -0.14135358228928835, -0.1059646054852271, -0.14706979280145102, 0.015228453033350776, 0.026165910244827378, -0.2680968621653723, 0.0230403187579438, 0.03240461939447099, 0.009075944380903686, -0.06261418585954406, -0.08320279662313376, 0.023632555403804153, 0.06369203914899702, 0.03235923133090384, 0.010132082953566202, 0.050606743110642755, -0.08487705030136478, -0.174426452808634, 0.33441710810142533, -0.03780859889059089, -0.24045336567279366, 0.19904926374632245, -0.0976166530472031, -0.17808177235340814, 0.16256379856969472, 0.19656330771617775, 0.18770594796004855, -0.11830304842729719, 0.1004214236479724, -0.031840521597912834, 0.1257576626943953, 0.07477744428561656, -0.005550232178382116, 0.10041974159819936, 0.11238879891382646, 0.11610250587555017, 0.13443241458110236, -0.03237586822878155, -0.1559172741289791, -0.24956327728513214, -0.1557686947527583, -0.1391809451577748, 0.03342987739489655, -0.07923563740760185, -0.15861304125024211, 0.3739176805527812, 0.21243012630967079, 0.18372628928297258, 0.09893080298458283, 0.2933124266564846, 0.138125828496054, 0.09811039710055208, 0.10151774906208394, 0.20623541459582034, 0.14914617531812163, 0.14865903216299176, -0.19686936990596515, 0.001168801008010812, 0.1612923273925934] |
1,803.01216 | Deep Bayesian Active Semi-Supervised Learning | In many applications the process of generating label information is expensive
and time consuming. We present a new method that combines active and
semi-supervised deep learning to achieve high generalization performance from a
deep convolutional neural network with as few known labels as possible. In a
setting where a small amount of labeled data as well as a large amount of
unlabeled data is available, our method first learns the labeled data set. This
initialization is followed by an expectation maximization algorithm, where
further training reduces classification entropy on the unlabeled data by
targeting a low entropy fit which is consistent with the labeled data. In
addition the algorithm asks at a specified frequency an oracle for labels of
data with entropy above a certain entropy quantile. Using this active learning
component we obtain an agile labeling process that achieves high accuracy, but
requires only a small amount of known labels. For the MNIST dataset we report
an error rate of 2.06% using only 300 labels and 1.06% for 1000 labels. These
results are obtained without employing any special network architecture or data
augmentation.
| cs.LG cs.CV stat.ML | in many applications the process of generating label information is expensive and time consuming we present a new method that combines active and semisupervised deep learning to achieve high generalization performance from a deep convolutional neural network with as few known labels as possible in a setting where a small amount of labeled data as well as a large amount of unlabeled data is available our method first learns the labeled data set this initialization is followed by an expectation maximization algorithm where further training reduces classification entropy on the unlabeled data by targeting a low entropy fit which is consistent with the labeled data in addition the algorithm asks at a specified frequency an oracle for labels of data with entropy above a certain entropy quantile using this active learning component we obtain an agile labeling process that achieves high accuracy but requires only a small amount of known labels for the mnist dataset we report an error rate of 206 using only 300 labels and 106 for 1000 labels these results are obtained without employing any special network architecture or data augmentation | [['in', 'many', 'applications', 'the', 'process', 'of', 'generating', 'label', 'information', 'is', 'expensive', 'and', 'time', 'consuming', 'we', 'present', 'a', 'new', 'method', 'that', 'combines', 'active', 'and', 'semisupervised', 'deep', 'learning', 'to', 'achieve', 'high', 'generalization', 'performance', 'from', 'a', 'deep', 'convolutional', 'neural', 'network', 'with', 'as', 'few', 'known', 'labels', 'as', 'possible', 'in', 'a', 'setting', 'where', 'a', 'small', 'amount', 'of', 'labeled', 'data', 'as', 'well', 'as', 'a', 'large', 'amount', 'of', 'unlabeled', 'data', 'is', 'available', 'our', 'method', 'first', 'learns', 'the', 'labeled', 'data', 'set', 'this', 'initialization', 'is', 'followed', 'by', 'an', 'expectation', 'maximization', 'algorithm', 'where', 'further', 'training', 'reduces', 'classification', 'entropy', 'on', 'the', 'unlabeled', 'data', 'by', 'targeting', 'a', 'low', 'entropy', 'fit', 'which', 'is', 'consistent', 'with', 'the', 'labeled', 'data', 'in', 'addition', 'the', 'algorithm', 'asks', 'at', 'a', 'specified', 'frequency', 'an', 'oracle', 'for', 'labels', 'of', 'data', 'with', 'entropy', 'above', 'a', 'certain', 'entropy', 'quantile', 'using', 'this', 'active', 'learning', 'component', 'we', 'obtain', 'an', 'agile', 'labeling', 'process', 'that', 'achieves', 'high', 'accuracy', 'but', 'requires', 'only', 'a', 'small', 'amount', 'of', 'known', 'labels', 'for', 'the', 'mnist', 'dataset', 'we', 'report', 'an', 'error', 'rate', 'of', '206', 'using', 'only', '300', 'labels', 'and', '106', 'for', '1000', 'labels', 'these', 'results', 'are', 'obtained', 'without', 'employing', 'any', 'special', 'network', 'architecture', 'or', 'data', 'augmentation']] | [-0.04706487616488669, 0.04144210191399274, 0.006156758379960514, 0.05529728438272207, -0.11311726189729676, -0.1723578674136661, 0.11383565759119253, 0.4269691053575472, -0.2665092468915922, -0.3906882344340177, 0.09845399815315867, -0.3082123297309685, -0.10463436244627582, 0.20517895752994303, -0.14723209088728967, 0.08808230453818712, 0.17245318729597467, 0.10533545512463087, -0.03918251838932401, -0.28966299730540335, 0.28169641843819787, 0.07145700568008065, 0.3122682738289966, 0.0009182157101231101, 0.17820832661654212, -0.02524929525806447, -0.021855267210175163, 0.002952664946307145, -0.0481365956642074, 0.15100557287603253, 0.29896986519325647, 0.22089276523784857, 0.33782729339461937, -0.36631979573006823, -0.20188121395894204, 0.1173926716322888, 0.11945278575497112, 0.1366248272084783, -0.06930571631591706, -0.29738966521867755, 0.09031829105831844, -0.1780563682348103, 0.010638382921056093, -0.15288109425202254, -0.020345001886396305, -0.024802205254040335, -0.35315602426619636, 0.0759367155057945, 0.03682350209482652, 0.08810404836462428, -0.0563649606306369, -0.10442673669604119, 0.0060326070815790445, 0.12380899132214203, 0.02281618053466841, 0.0925104508784463, 0.10026850069508604, -0.18268751540666056, -0.12218127254037307, 0.3157659603950932, -0.0553329294565154, -0.17628548483101084, 0.1668641706371842, -0.035926707099070365, -0.16262568651860498, 0.16534182046218673, 0.21369448941866565, 0.15185849455630648, -0.17334463751087795, 0.021829747662432845, -0.06338803998812143, 0.20347088339495595, 0.02454144643801872, -0.005510080005953331, 0.12174979176843012, 0.26981700777643075, 0.038743169021314396, 0.18389789256110342, -0.1681658782902599, -0.015338590171544954, -0.2733451611914105, -0.10404753358528504, -0.2971420966761956, 0.019758074643070122, -0.14356682414883992, -0.15384282913241212, 0.339332612261743, 0.1808084260910223, 0.2984527523747048, 0.13882080770069835, 0.333221352679412, 0.03853296524974449, 0.11686970656940146, 0.13837803377891364, 0.15567631408339366, 0.010047026811187843, 0.09823545254039345, -0.1300928101130842, 0.09690678272264726, 0.029058306771532996] |
1,803.01217 | A generalization of the theory of standardly stratified algebras I:
Standardly stratified ringoids | We extend the classical notion of standardly stratified $k$-algebra (stated
for finite dimensional $k$-algebras) to the more general class of rings,
possibly without $1,$ with enough idempotents. We show that many of the
fundamental results, which are known for classical standardly stratified
algebras, can be generalized to this context. Furthermore, new classes of rings
appear as: ideally standardly stratified and ideally quasi-hereditary. In the
classical theory, it is known that quasi-hereditary and ideally
quasi-hereditary algebras are equivalent notions, but in our general setting
this is no longer true. To develop the theory, we use the well known connection
between rings with enough idempotents and skeletally small categories (ringoids
or rings with several objects).
| math.RA | we extend the classical notion of standardly stratified kalgebra stated for finite dimensional kalgebras to the more general class of rings possibly without 1 with enough idempotents we show that many of the fundamental results which are known for classical standardly stratified algebras can be generalized to this context furthermore new classes of rings appear as ideally standardly stratified and ideally quasihereditary in the classical theory it is known that quasihereditary and ideally quasihereditary algebras are equivalent notions but in our general setting this is no longer true to develop the theory we use the well known connection between rings with enough idempotents and skeletally small categories ringoids or rings with several objects | [['we', 'extend', 'the', 'classical', 'notion', 'of', 'standardly', 'stratified', 'kalgebra', 'stated', 'for', 'finite', 'dimensional', 'kalgebras', 'to', 'the', 'more', 'general', 'class', 'of', 'rings', 'possibly', 'without', '1', 'with', 'enough', 'idempotents', 'we', 'show', 'that', 'many', 'of', 'the', 'fundamental', 'results', 'which', 'are', 'known', 'for', 'classical', 'standardly', 'stratified', 'algebras', 'can', 'be', 'generalized', 'to', 'this', 'context', 'furthermore', 'new', 'classes', 'of', 'rings', 'appear', 'as', 'ideally', 'standardly', 'stratified', 'and', 'ideally', 'quasihereditary', 'in', 'the', 'classical', 'theory', 'it', 'is', 'known', 'that', 'quasihereditary', 'and', 'ideally', 'quasihereditary', 'algebras', 'are', 'equivalent', 'notions', 'but', 'in', 'our', 'general', 'setting', 'this', 'is', 'no', 'longer', 'true', 'to', 'develop', 'the', 'theory', 'we', 'use', 'the', 'well', 'known', 'connection', 'between', 'rings', 'with', 'enough', 'idempotents', 'and', 'skeletally', 'small', 'categories', 'ringoids', 'or', 'rings', 'with', 'several', 'objects']] | [-0.10326497265924824, 0.09945365088060498, -0.046414878046288424, 0.15319342462889915, -0.12032461941110349, -0.1841795795918566, -0.07312018727364464, 0.3836872826239704, -0.3709291945483568, -0.21487745499666944, 0.11694619363581811, -0.16654145743994586, -0.14994473495949223, 0.21624202594218725, -0.16994503297043584, -0.0399892062476251, 0.06260442485686689, 0.06884937661708193, -0.0628692210421164, -0.29901716527034555, 0.39195817849285636, 0.033104685268084626, 0.21354515421146578, -0.030670038045309815, 0.01864351111719698, 0.0034232359354804576, -0.02756790001258518, 0.10521837784414205, -0.17307597603630873, 0.12488488585119491, 0.361574519128926, 0.07132938733340892, 0.22132815398374753, -0.40070059002105113, -0.1567942912945837, 0.1665691566659731, 0.13308450670921104, 0.07794898261204856, 0.005210940488505968, -0.23728145569546427, 0.1616919502828155, -0.22048398518143633, -0.12052029754917047, -0.0949429906368981, 0.051064669900466646, 0.028468349775447783, -0.2609634221638594, 0.03098729264765846, 0.17385330952114664, 0.09762379768576505, -0.060404881103524724, -0.07762852917524236, -0.022436725571174668, 0.062310595156015024, -0.04028902132377292, -0.02469156081664615, 0.09976637625522845, -0.0789809916011986, -0.13631139564599876, 0.3934602891877953, -0.030154844309178603, -0.23070798849736432, 0.2591640627489681, -0.19762697970016604, -0.14153913051545192, 0.0639872803678324, 0.03053779709688594, 0.19184595462660084, -0.04540275279597371, 0.13458348942799, -0.17187332435288524, 0.07610613389550584, 0.06780951489195788, 0.06115233283325107, 0.18632897794807116, 0.07474531370948638, 0.07559253825894681, 0.13277532096099173, 0.03720618474536237, -0.08195078017734057, -0.3456417792270669, -0.17897464035787677, -0.05709112925141786, 0.08115146206114936, -0.03669533766437821, -0.1892375343446249, 0.3178393258259887, 0.14706356232301784, 0.14105443694356795, 0.1305293531849387, 0.2381126322696991, 0.029835898503331484, 0.1274910665290282, 0.062436509020296876, 0.1770237865734153, 0.28051251797747295, 0.013212212724034238, -0.04777519010930462, -0.021615868348286247, 0.13844827244849464] |
1,803.01218 | Accurate Electron Affinities and Orbital Energies of Anions from a
Non-Empirically Tuned Range-Separated Density Functional Theory Approach | The treatment of atomic anions with Kohn-Sham density functional theory (DFT)
has long been controversial since the highest occupied molecular orbital (HOMO)
energy, $E_{HOMO}$, is often calculated to be positive with most approximate
density functionals. We assess the accuracy of orbital energies and electron
affinities for all three rows of elements in the periodic table (H-Ar) using a
variety of theoretical approaches and customized basis sets. Among all of the
theoretical methods studied here, we find that a non-empirically tuned
range-separated approach (constructed to satisfy DFT-Koopmans' theorem for the
anionic electron system) provides the best accuracy for a variety of basis sets
- even for small basis sets where most functionals typically fail. Previous
approaches to solve this conundrum of positive $E_{HOMO}$ values have utilized
non-self-consistent methods; however electronic properties, such as electronic
couplings/gradients (which require a self-consistent potential and energy),
become ill-defined with these approaches. In contrast, the non-empirically
tuned range-separated procedure used here yields well-defined electronic
couplings/gradients and correct $E_{HOMO}$ values since both the potential and
resulting electronic energy are computed self-consistently. Orbital energies
and electron affinities are further analyzed in the context of the electronic
energy as a function of electronic number (including fractional numbers of
electrons) to provide a stringent assessment of self-interaction errors for
these complex anion systems.
| physics.chem-ph physics.atm-clus physics.atom-ph | the treatment of atomic anions with kohnsham density functional theory dft has long been controversial since the highest occupied molecular orbital homo energy e_homo is often calculated to be positive with most approximate density functionals we assess the accuracy of orbital energies and electron affinities for all three rows of elements in the periodic table har using a variety of theoretical approaches and customized basis sets among all of the theoretical methods studied here we find that a nonempirically tuned rangeseparated approach constructed to satisfy dftkoopmans theorem for the anionic electron system provides the best accuracy for a variety of basis sets even for small basis sets where most functionals typically fail previous approaches to solve this conundrum of positive e_homo values have utilized nonselfconsistent methods however electronic properties such as electronic couplingsgradients which require a selfconsistent potential and energy become illdefined with these approaches in contrast the nonempirically tuned rangeseparated procedure used here yields welldefined electronic couplingsgradients and correct e_homo values since both the potential and resulting electronic energy are computed selfconsistently orbital energies and electron affinities are further analyzed in the context of the electronic energy as a function of electronic number including fractional numbers of electrons to provide a stringent assessment of selfinteraction errors for these complex anion systems | [['the', 'treatment', 'of', 'atomic', 'anions', 'with', 'kohnsham', 'density', 'functional', 'theory', 'dft', 'has', 'long', 'been', 'controversial', 'since', 'the', 'highest', 'occupied', 'molecular', 'orbital', 'homo', 'energy', 'e_homo', 'is', 'often', 'calculated', 'to', 'be', 'positive', 'with', 'most', 'approximate', 'density', 'functionals', 'we', 'assess', 'the', 'accuracy', 'of', 'orbital', 'energies', 'and', 'electron', 'affinities', 'for', 'all', 'three', 'rows', 'of', 'elements', 'in', 'the', 'periodic', 'table', 'har', 'using', 'a', 'variety', 'of', 'theoretical', 'approaches', 'and', 'customized', 'basis', 'sets', 'among', 'all', 'of', 'the', 'theoretical', 'methods', 'studied', 'here', 'we', 'find', 'that', 'a', 'nonempirically', 'tuned', 'rangeseparated', 'approach', 'constructed', 'to', 'satisfy', 'dftkoopmans', 'theorem', 'for', 'the', 'anionic', 'electron', 'system', 'provides', 'the', 'best', 'accuracy', 'for', 'a', 'variety', 'of', 'basis', 'sets', 'even', 'for', 'small', 'basis', 'sets', 'where', 'most', 'functionals', 'typically', 'fail', 'previous', 'approaches', 'to', 'solve', 'this', 'conundrum', 'of', 'positive', 'e_homo', 'values', 'have', 'utilized', 'nonselfconsistent', 'methods', 'however', 'electronic', 'properties', 'such', 'as', 'electronic', 'couplingsgradients', 'which', 'require', 'a', 'selfconsistent', 'potential', 'and', 'energy', 'become', 'illdefined', 'with', 'these', 'approaches', 'in', 'contrast', 'the', 'nonempirically', 'tuned', 'rangeseparated', 'procedure', 'used', 'here', 'yields', 'welldefined', 'electronic', 'couplingsgradients', 'and', 'correct', 'e_homo', 'values', 'since', 'both', 'the', 'potential', 'and', 'resulting', 'electronic', 'energy', 'are', 'computed', 'selfconsistently', 'orbital', 'energies', 'and', 'electron', 'affinities', 'are', 'further', 'analyzed', 'in', 'the', 'context', 'of', 'the', 'electronic', 'energy', 'as', 'a', 'function', 'of', 'electronic', 'number', 'including', 'fractional', 'numbers', 'of', 'electrons', 'to', 'provide', 'a', 'stringent', 'assessment', 'of', 'selfinteraction', 'errors', 'for', 'these', 'complex', 'anion', 'systems']] | [-0.08554934753488268, 0.07873754065626404, -0.056993460322788174, 0.11152839830421517, 0.007350050160242467, -0.12782036736340185, 0.0731842158942675, 0.38251829209278504, -0.22684048516029698, -0.34019461456623873, 0.0016324512207096344, -0.27710960915481503, -0.09567524174353081, 0.1860990661361286, 0.022186714213377125, 0.10198787427365304, 0.06611399741010054, -0.010933879769432836, -0.1055795642175226, -0.2164146815736903, 0.27495654161048066, 0.05451266951112602, 0.24976949655321654, 0.0910673152246517, 0.06575169493154619, 0.007378382342043177, 0.028699678198421043, 0.04899460200496624, -0.126565511096844, 0.16825161009367431, 0.30916774906908745, 0.028661787386261746, 0.3035239765173243, -0.48714684927613255, -0.20890949227296832, 0.0696880485635233, 0.11854062961864521, 0.1354441922263835, -0.030515749052024345, -0.21864079884988696, 0.06292904175942737, -0.1953966114402673, -0.120857129151973, -0.17427249435830022, 0.02511869416389454, 0.08426197437941582, -0.2555082725922457, 0.10388712967026302, -0.040926099102052915, 0.059331987604596896, -0.1341291437901414, -0.20819664343525365, -0.05414961187757159, 0.08358511101659477, 0.04062711507300334, 0.035585474334300704, 0.14351379995916091, -0.0730006252849947, -0.09269977753545251, 0.39988142203842625, -0.01577436514243341, -0.19964558316916048, 0.18408033340661364, -0.11652505333907456, -0.13783319671883396, 0.14877235763550303, 0.10349661365550225, 0.09527375777006934, -0.15380090873902352, 0.09999297667488581, 0.00875540796899054, 0.16964987614169788, 0.06893192885808967, 0.10355577188539519, 0.1894496367379809, 0.127608660707678, 0.034264063543938635, 0.020723228790111056, -0.0866658794047516, -0.08838577532659521, -0.1947382542574288, -0.12809258931579345, -0.2184927167847717, 0.01907099662103543, -0.04355769629691032, -0.2208628540493227, 0.4060059237409757, 0.14388228918238583, 0.15604645871606312, -0.014480044438367772, 0.2560395516085318, 0.13425153946285648, 0.055718905044302935, 0.04225045297981093, 0.21791348321046947, 0.12583826385153252, 0.03866007332756902, -0.21761796786811907, 0.06185007162958063, 0.06771505492378437] |
1,803.01219 | Structural and Electronic Properties of Graphdiyne Carbon Nanotubes from
Large-Scale DFT Calculations | Using large-scale DFT calculations, we have investigated the structural and
electronic properties of both armchair and zigzag graphdiyne nanotubes as a
function of size. To provide insight in these properties, we present new
detailed calculations of the structural relaxation energy, effective
electron/hole mass, and size-scaling of the bandgap as a function of size and
chirality using accurate screened-exchange DFT calculations. These calculations
provide a systematic evaluation of the structural and electronic properties of
the largest graphdiyne nanotubes to date - up to 1,296 atoms and 23,328 basis
functions. Our calculations find that zigzag graphdiyne nanotubes (GDNTs) are
structurally more stable compared to armchair GDNTs of the same size.
Furthermore, these large-scale calculations allow us to present simple
analytical formulae to guide future experimental efforts for estimating the
fundamental bandgaps of these unique nanotubes as a function of chirality and
diameter. While the bandgaps for both the armchair and zigzag GDNTs can be
tuned as a function of size, the conductivity in each of these two different
chiralities is markedly different. Zigzag GDNTs have wider valence and
conduction bands and are expected to have a higher electron- and hole-mobility
than their armchair counterparts.
| cond-mat.mes-hall cond-mat.mtrl-sci | using largescale dft calculations we have investigated the structural and electronic properties of both armchair and zigzag graphdiyne nanotubes as a function of size to provide insight in these properties we present new detailed calculations of the structural relaxation energy effective electronhole mass and sizescaling of the bandgap as a function of size and chirality using accurate screenedexchange dft calculations these calculations provide a systematic evaluation of the structural and electronic properties of the largest graphdiyne nanotubes to date up to 1296 atoms and 23328 basis functions our calculations find that zigzag graphdiyne nanotubes gdnts are structurally more stable compared to armchair gdnts of the same size furthermore these largescale calculations allow us to present simple analytical formulae to guide future experimental efforts for estimating the fundamental bandgaps of these unique nanotubes as a function of chirality and diameter while the bandgaps for both the armchair and zigzag gdnts can be tuned as a function of size the conductivity in each of these two different chiralities is markedly different zigzag gdnts have wider valence and conduction bands and are expected to have a higher electron and holemobility than their armchair counterparts | [['using', 'largescale', 'dft', 'calculations', 'we', 'have', 'investigated', 'the', 'structural', 'and', 'electronic', 'properties', 'of', 'both', 'armchair', 'and', 'zigzag', 'graphdiyne', 'nanotubes', 'as', 'a', 'function', 'of', 'size', 'to', 'provide', 'insight', 'in', 'these', 'properties', 'we', 'present', 'new', 'detailed', 'calculations', 'of', 'the', 'structural', 'relaxation', 'energy', 'effective', 'electronhole', 'mass', 'and', 'sizescaling', 'of', 'the', 'bandgap', 'as', 'a', 'function', 'of', 'size', 'and', 'chirality', 'using', 'accurate', 'screenedexchange', 'dft', 'calculations', 'these', 'calculations', 'provide', 'a', 'systematic', 'evaluation', 'of', 'the', 'structural', 'and', 'electronic', 'properties', 'of', 'the', 'largest', 'graphdiyne', 'nanotubes', 'to', 'date', 'up', 'to', '1296', 'atoms', 'and', '23328', 'basis', 'functions', 'our', 'calculations', 'find', 'that', 'zigzag', 'graphdiyne', 'nanotubes', 'gdnts', 'are', 'structurally', 'more', 'stable', 'compared', 'to', 'armchair', 'gdnts', 'of', 'the', 'same', 'size', 'furthermore', 'these', 'largescale', 'calculations', 'allow', 'us', 'to', 'present', 'simple', 'analytical', 'formulae', 'to', 'guide', 'future', 'experimental', 'efforts', 'for', 'estimating', 'the', 'fundamental', 'bandgaps', 'of', 'these', 'unique', 'nanotubes', 'as', 'a', 'function', 'of', 'chirality', 'and', 'diameter', 'while', 'the', 'bandgaps', 'for', 'both', 'the', 'armchair', 'and', 'zigzag', 'gdnts', 'can', 'be', 'tuned', 'as', 'a', 'function', 'of', 'size', 'the', 'conductivity', 'in', 'each', 'of', 'these', 'two', 'different', 'chiralities', 'is', 'markedly', 'different', 'zigzag', 'gdnts', 'have', 'wider', 'valence', 'and', 'conduction', 'bands', 'and', 'are', 'expected', 'to', 'have', 'a', 'higher', 'electron', 'and', 'holemobility', 'than', 'their', 'armchair', 'counterparts']] | [-0.10398499536952985, 0.1093186380502869, -0.057755750928404986, 0.0349428183258217, -0.036573693821647844, -0.11675981311617713, 0.08348898646470747, 0.5095390044937008, -0.23682746194597137, -0.30863342437353963, 0.012789898128922735, -0.2923292107800463, -0.12953118259136223, 0.16435015697865502, 0.08253506475471352, 0.08002726476690059, 0.0653179652449724, -0.07288441806878454, -0.13082568163119598, -0.18595632202800755, 0.20488120691948816, 0.05844703225700773, 0.2884077215959367, 0.1356325547553991, -0.041337952324140226, 0.001202785477385317, 0.07186563806853404, 0.06910810898744355, -0.20154752174072965, 0.15791597390902767, 0.24166015082553619, -0.05973137946995465, 0.22026890827048767, -0.4897147594252601, -0.17338343964105374, -0.017158935415117364, 0.1438797913749065, 0.15561152887162996, -0.02806393846442102, -0.2468482223253599, 0.138591838802983, -0.13664721682373632, -0.11080937785905247, -0.11837460951401706, 0.010828311116385617, 0.05077640778893654, -0.20548613953257078, 0.09301381860905646, -0.003538782416695827, 0.048952826524634334, -0.1143067506607622, -0.22296040581147136, -0.11759203778163187, 0.11592003458522653, 0.04578915954886102, -0.018813484392472005, 0.18118772491518603, -0.1010013061397905, -0.12980769136920572, 0.42656954087218957, -0.02176041683024347, -0.13210163955135565, 0.17922782745383875, -0.1326641019396974, -0.09293878574757591, 0.14258024138766096, 0.1155917056198967, 0.11943472283095807, -0.15033848505761277, 0.020981384352106894, -0.02629015648639516, 0.1325076440447255, 0.07677140181492034, 0.1331774581762913, 0.2240950448781644, 0.17458851519285848, 0.06348822664248904, 0.11312202350297747, -0.08377601863742855, -0.007358257624467737, -0.19407559188425932, -0.19200932275018298, -0.17248431482278792, 0.07126808104252344, -0.10886927300391681, -0.2293406369703773, 0.4691643050038501, 0.1258326238339865, 0.16583406326949204, 0.035755431862842094, 0.2148590853125298, 0.09245334708340172, 0.10334435012314076, 0.017836974426724116, 0.23772998109067742, 0.17058882210036053, 0.03923063454621067, -0.2423518768033797, 0.04240236981330733, -0.029496126933219402] |
1,803.0122 | Philosophy of Science and Educational Research: Strategies for
Scientific Effectiveness and Improvement of the Education | This article is a theoretical study on the effectiveness of educational
research in the context of Philosophy of science. This topic of discussion, in
the area of educational research, has been the subject of intellectual debate
and arises again at the beginning of the 21st century. This article outlines
the challenges and opportunities for scientific effectiveness facing
educational research if it aspires to contribute to the ideal of an education
of excellence and quality. Nine strategies to improve scientific effectiveness
in educational research are identified and discussed. As a conclusion, it is
argued that the foundations of contemporary educational research need to be
revisited and reformulated, parallel to the new concepts present in the
philosophy of science, to face the new problems present in our society.
| physics.ed-ph physics.hist-ph | this article is a theoretical study on the effectiveness of educational research in the context of philosophy of science this topic of discussion in the area of educational research has been the subject of intellectual debate and arises again at the beginning of the 21st century this article outlines the challenges and opportunities for scientific effectiveness facing educational research if it aspires to contribute to the ideal of an education of excellence and quality nine strategies to improve scientific effectiveness in educational research are identified and discussed as a conclusion it is argued that the foundations of contemporary educational research need to be revisited and reformulated parallel to the new concepts present in the philosophy of science to face the new problems present in our society | [['this', 'article', 'is', 'a', 'theoretical', 'study', 'on', 'the', 'effectiveness', 'of', 'educational', 'research', 'in', 'the', 'context', 'of', 'philosophy', 'of', 'science', 'this', 'topic', 'of', 'discussion', 'in', 'the', 'area', 'of', 'educational', 'research', 'has', 'been', 'the', 'subject', 'of', 'intellectual', 'debate', 'and', 'arises', 'again', 'at', 'the', 'beginning', 'of', 'the', '21st', 'century', 'this', 'article', 'outlines', 'the', 'challenges', 'and', 'opportunities', 'for', 'scientific', 'effectiveness', 'facing', 'educational', 'research', 'if', 'it', 'aspires', 'to', 'contribute', 'to', 'the', 'ideal', 'of', 'an', 'education', 'of', 'excellence', 'and', 'quality', 'nine', 'strategies', 'to', 'improve', 'scientific', 'effectiveness', 'in', 'educational', 'research', 'are', 'identified', 'and', 'discussed', 'as', 'a', 'conclusion', 'it', 'is', 'argued', 'that', 'the', 'foundations', 'of', 'contemporary', 'educational', 'research', 'need', 'to', 'be', 'revisited', 'and', 'reformulated', 'parallel', 'to', 'the', 'new', 'concepts', 'present', 'in', 'the', 'philosophy', 'of', 'science', 'to', 'face', 'the', 'new', 'problems', 'present', 'in', 'our', 'society']] | [-0.02722604831981857, 0.05837938199588929, -0.06667313509665075, 0.023382493508203577, -0.15699560620955058, -0.05985130799475998, 0.009721714410088247, 0.333984659378609, -0.24018395270797468, -0.3445695123103048, 0.1117132145122418, -0.26734126341484843, -0.18064973748747318, 0.2288757696718214, -0.16249175409653357, 0.013747584629094317, 0.061842755299978076, 0.030156436282032656, -0.011385109037205222, -0.3589912947888176, 0.2949953161194802, 0.10630545703442915, 0.38058415879421525, 0.1501418182123748, 0.03594546352646181, -0.03548730342438267, -0.10561461516449021, -0.002732644463697123, -0.12880961895054843, 0.22482791123172594, 0.4135018973722167, 0.2801589780313421, 0.47101649505988, -0.3953308183995504, -0.1749261754402329, 0.018054200022200508, 0.10898725654734003, 0.04339756123307678, -0.09128152521877801, -0.29744076375509537, 0.03826087986632797, -0.18136244344096336, -0.17218328979871575, -0.03244560847561511, 0.05529491589700301, -0.047923300328427954, -0.15272564963541096, -0.028435354497993275, 0.062008271496447304, 0.15715753699519805, -0.0258925836681137, -0.171893389149022, 0.06276140097964791, 0.1801297437059619, 0.13042625642588568, 0.07349666085145953, 0.10172748639588318, -0.17837058067033512, -0.17674087399306396, 0.4285972359191094, 0.03732660576139414, -0.10662120040358296, 0.17890293139683466, -0.10364072076562378, -0.19665753163973845, 0.01073427176812575, 0.23066413319034, 0.037467123800149514, -0.18310623267842902, 0.09638080738030054, 0.002005102145226879, 0.10103729035380105, 0.028600907762579265, 0.0019189673180263194, 0.2696302816833532, 0.23906342283866944, 0.041145650891675836, 0.1310185217492593, -0.012000871699355129, -0.13921624975692895, -0.2864721756546743, -0.20557611946400906, -0.14792592973551816, 0.0054764277745215665, 0.06075030255063515, -0.12123921305857717, 0.41552015789969277, 0.24318880920985803, 0.03887970881566169, -0.06311620755993302, 0.30386987720276154, 0.009876370134334716, 0.048197226184937686, 0.0419743897001599, 0.257346951171972, 0.06836885156937772, 0.22369355416028863, -0.1442785919717853, 0.07098130969375017, -0.01646458684875157] |
1,803.01221 | Byzantine-Resilient Locally Optimum Detection Using Collaborative
Autonomous Networks | In this paper, we propose a locally optimum detection (LOD) scheme for
detecting a weak radioactive source buried in background clutter. We develop a
decentralized algorithm, based on alternating direction method of multipliers
(ADMM), for implementing the proposed scheme in autonomous sensor networks.
Results show that algorithm performance approaches the centralized clairvoyant
detection algorithm in the low SNR regime, and exhibits excellent convergence
rate and scaling behavior (w.r.t. number of nodes). We also devise a
low-overhead, robust ADMM algorithm for Byzantine-resilient detection, and
demonstrate its robustness to data falsification attacks.
| cs.SY stat.OT | in this paper we propose a locally optimum detection lod scheme for detecting a weak radioactive source buried in background clutter we develop a decentralized algorithm based on alternating direction method of multipliers admm for implementing the proposed scheme in autonomous sensor networks results show that algorithm performance approaches the centralized clairvoyant detection algorithm in the low snr regime and exhibits excellent convergence rate and scaling behavior wrt number of nodes we also devise a lowoverhead robust admm algorithm for byzantineresilient detection and demonstrate its robustness to data falsification attacks | [['in', 'this', 'paper', 'we', 'propose', 'a', 'locally', 'optimum', 'detection', 'lod', 'scheme', 'for', 'detecting', 'a', 'weak', 'radioactive', 'source', 'buried', 'in', 'background', 'clutter', 'we', 'develop', 'a', 'decentralized', 'algorithm', 'based', 'on', 'alternating', 'direction', 'method', 'of', 'multipliers', 'admm', 'for', 'implementing', 'the', 'proposed', 'scheme', 'in', 'autonomous', 'sensor', 'networks', 'results', 'show', 'that', 'algorithm', 'performance', 'approaches', 'the', 'centralized', 'clairvoyant', 'detection', 'algorithm', 'in', 'the', 'low', 'snr', 'regime', 'and', 'exhibits', 'excellent', 'convergence', 'rate', 'and', 'scaling', 'behavior', 'wrt', 'number', 'of', 'nodes', 'we', 'also', 'devise', 'a', 'lowoverhead', 'robust', 'admm', 'algorithm', 'for', 'byzantineresilient', 'detection', 'and', 'demonstrate', 'its', 'robustness', 'to', 'data', 'falsification', 'attacks']] | [-0.18593592885881663, -0.07190861599002447, -0.06950138250572814, 0.022177932761971737, -0.06339161729491834, -0.24706197982757455, 0.10357808989808998, 0.4586024872286038, -0.2635119380067206, -0.29798082722506175, 0.10276065330124563, -0.20893577134443653, -0.18799120085313917, 0.20793003568736215, -0.13182051428593694, 0.10604037273507048, 0.09706628818271888, -0.006415045996093088, -0.05121944911208832, -0.2673845041491505, 0.21282582243697512, 0.11513119851135545, 0.4011122207390144, 0.031225561818832324, 0.16495707044248573, -0.02687410927998523, -0.000571273546665907, 0.023014555933574835, -0.02766769585602257, 0.10680980970048243, 0.29795663688823376, 0.19595417480191424, 0.3133822605634729, -0.3574325429793033, -0.15397384146021473, 0.13588057493584024, 0.20088647922707928, 0.11431265150765992, -0.15454264018917457, -0.3357332669612434, 0.1700305867008865, -0.2067787893426915, -0.0839261186063393, -0.11768535778909507, -0.07350934345223424, 0.0414579476773118, -0.3265426631189055, 0.061900100319892064, 0.03401462585510065, 0.01751907753965093, -0.058800687114449426, -0.06365206021194657, 0.1403076154904233, 0.031764941559069684, 0.036001355863279766, 0.0035532349617116983, 0.16373239010055032, -0.10344820077427559, -0.16027418631128967, 0.3075162731524971, -0.052506299287132505, -0.20858448886881686, 0.16634169005944083, -0.011451761114100616, -0.1796371477086925, 0.159211404228376, 0.25393939484945605, 0.17485447608762317, -0.1517396730163859, 0.03711076333388014, -0.013510210988008314, 0.15571468437297475, 0.0013993846485391259, 0.04046467573175, 0.08461435550384017, 0.24161645627270142, 0.22275377524395784, 0.15915448661382672, -0.16968241228152894, -0.021532337222662238, -0.21913575171234292, -0.13721367911332183, -0.17815653435730686, -0.061696321812147896, -0.12063513349486231, -0.14584570397079613, 0.39585633189700375, 0.2525766587919659, 0.13702075245221043, 0.1318195232293672, 0.4155940591668089, 0.05007016208773065, -0.015455076020831864, 0.1904029431959821, 0.22544161216873262, 0.07217072118332403, 0.10299250904160241, -0.25679891204668415, 0.11382989735704743, 0.11420354018401768] |
1,803.01222 | A locally integrable non-separable analytic geodesic flow | We explicitely construct an example of an analytic metric on $T^2$ which is
non-separable but it is locally integrable on an energy surface. The
construction is based on a KAM-like approach and a careful control on what
happens on the energy surface.
| math.DS | we explicitely construct an example of an analytic metric on t2 which is nonseparable but it is locally integrable on an energy surface the construction is based on a kamlike approach and a careful control on what happens on the energy surface | [['we', 'explicitely', 'construct', 'an', 'example', 'of', 'an', 'analytic', 'metric', 'on', 't2', 'which', 'is', 'nonseparable', 'but', 'it', 'is', 'locally', 'integrable', 'on', 'an', 'energy', 'surface', 'the', 'construction', 'is', 'based', 'on', 'a', 'kamlike', 'approach', 'and', 'a', 'careful', 'control', 'on', 'what', 'happens', 'on', 'the', 'energy', 'surface']] | [-0.09880590941646092, 0.08430095049490254, -0.15130509065818928, 0.11033147855916814, -0.08626453946566298, -0.1136952453913788, -0.005193199807157119, 0.4127590344952686, -0.21604442290429557, -0.21480185398831964, 0.14393808087888396, -0.2505169905128978, -0.19205952382513455, 0.294436872537647, -0.10831560664588497, -0.02551398149114989, 0.004046269559434482, 0.12895072109642483, -0.08292345220356115, -0.2505758927159366, 0.3948885251524016, 0.07339097218521472, 0.2987067579690899, 0.09170858612993643, 0.15490438593440645, 0.021059176152838126, 0.020745712021986645, -0.011681258800395188, -0.18078372782717148, 0.1087130817939483, 0.1580282887887387, 0.07428494759924001, 0.22264530416578054, -0.39552057317147654, -0.18729515774438846, 0.08262684517761781, 0.05199080089195853, 0.11628012435366622, -0.02991153504089674, -0.22734533959910982, 0.020833221366739877, -0.12000835407525301, -0.10825545229904708, -0.08714397890227181, 0.01103013933503202, -0.05999607271293089, -0.23877061983304365, 0.002330130853113674, 0.0963434318878821, 0.051228601047547444, -0.12469313783194161, -0.029209369693749716, -0.04491734216433196, 0.04958384107088759, -0.003358252784459009, 0.10884394609768476, 0.1081115380151286, -0.06408656198930528, -0.03437187778763473, 0.3286938329360315, -0.015063021598117692, -0.29560191264109953, 0.19465856613879579, -0.047205511281000714, -0.10174373998528435, 0.09774113836742583, 0.17255761797007704, 0.18017943185709773, -0.11792356150579594, 0.17223575371844208, -0.06273150621425538, 0.2053941077430777, 0.006393941806717997, -0.02999769588045421, 0.17253353954514578, 0.20362217338489635, 0.1672863909708602, 0.09077942042079355, -0.049484619277618117, -0.09247922919513214, -0.3591445888436976, -0.15337854047885185, -0.2352387542570276, 0.14106852770783007, -0.05377306557403201, -0.22902919972936311, 0.39848684555008296, 0.03088448706659533, 0.1980411687511064, 0.031017068546221015, 0.28116575885741485, 0.16391107238208255, 0.034854992802831386, 0.07637070601672999, 0.16878586083406671, 0.07708903064762819, -0.004673710392255869, -0.21641890260036148, -0.0051425977144390345, 0.1236870875138612] |
1,803.01223 | Long-Term Implications of the Revenue Transfer Methodology in the
Affordable Care Act | The Affordable Care Act introduced a revenue transfer formula that requires
insurance plans with generally healthier enrollees to pay funds into a revenue
transfer pool for to reimburse plans with generally less healthy enrollees. For
a given plan, the issue arises of whether the plan will be a payer into or a
receiver from the pool in a chosen future year. To examine that issue, we
analyze data from The Actuary Magazine on transfer payments for 2014-2015, and
we infer strong evidence of a statistical relationship between year-to-year
transfer payments. We also apply to the data a Markov transition model to study
annual changes in the payer-receiver statuses of insurance plans. We estimate
that the limiting conditional probability that an insurance plan will pay into
the pool, given that the plan had paid into the pool in 2014, is 55.6 percent.
Further, that limiting probability is attained quickly because the conditional
probability that an insurance plan will pay into the pool in 2024, given that
the plan had paid into the pool in 2014, is estimated to be 55.7 percent. We
also find the revenue transfer system to have the disturbing feature that once
a plan enters the "state" of paying into the pool then it will stay in that
state for an average period of 4.87 years; moreover, once a plan has received
funds from the pool then it will stay in that state for an average period of
3.89 years.
| stat.AP | the affordable care act introduced a revenue transfer formula that requires insurance plans with generally healthier enrollees to pay funds into a revenue transfer pool for to reimburse plans with generally less healthy enrollees for a given plan the issue arises of whether the plan will be a payer into or a receiver from the pool in a chosen future year to examine that issue we analyze data from the actuary magazine on transfer payments for 20142015 and we infer strong evidence of a statistical relationship between yeartoyear transfer payments we also apply to the data a markov transition model to study annual changes in the payerreceiver statuses of insurance plans we estimate that the limiting conditional probability that an insurance plan will pay into the pool given that the plan had paid into the pool in 2014 is 556 percent further that limiting probability is attained quickly because the conditional probability that an insurance plan will pay into the pool in 2024 given that the plan had paid into the pool in 2014 is estimated to be 557 percent we also find the revenue transfer system to have the disturbing feature that once a plan enters the state of paying into the pool then it will stay in that state for an average period of 487 years moreover once a plan has received funds from the pool then it will stay in that state for an average period of 389 years | [['the', 'affordable', 'care', 'act', 'introduced', 'a', 'revenue', 'transfer', 'formula', 'that', 'requires', 'insurance', 'plans', 'with', 'generally', 'healthier', 'enrollees', 'to', 'pay', 'funds', 'into', 'a', 'revenue', 'transfer', 'pool', 'for', 'to', 'reimburse', 'plans', 'with', 'generally', 'less', 'healthy', 'enrollees', 'for', 'a', 'given', 'plan', 'the', 'issue', 'arises', 'of', 'whether', 'the', 'plan', 'will', 'be', 'a', 'payer', 'into', 'or', 'a', 'receiver', 'from', 'the', 'pool', 'in', 'a', 'chosen', 'future', 'year', 'to', 'examine', 'that', 'issue', 'we', 'analyze', 'data', 'from', 'the', 'actuary', 'magazine', 'on', 'transfer', 'payments', 'for', '20142015', 'and', 'we', 'infer', 'strong', 'evidence', 'of', 'a', 'statistical', 'relationship', 'between', 'yeartoyear', 'transfer', 'payments', 'we', 'also', 'apply', 'to', 'the', 'data', 'a', 'markov', 'transition', 'model', 'to', 'study', 'annual', 'changes', 'in', 'the', 'payerreceiver', 'statuses', 'of', 'insurance', 'plans', 'we', 'estimate', 'that', 'the', 'limiting', 'conditional', 'probability', 'that', 'an', 'insurance', 'plan', 'will', 'pay', 'into', 'the', 'pool', 'given', 'that', 'the', 'plan', 'had', 'paid', 'into', 'the', 'pool', 'in', '2014', 'is', '556', 'percent', 'further', 'that', 'limiting', 'probability', 'is', 'attained', 'quickly', 'because', 'the', 'conditional', 'probability', 'that', 'an', 'insurance', 'plan', 'will', 'pay', 'into', 'the', 'pool', 'in', '2024', 'given', 'that', 'the', 'plan', 'had', 'paid', 'into', 'the', 'pool', 'in', '2014', 'is', 'estimated', 'to', 'be', '557', 'percent', 'we', 'also', 'find', 'the', 'revenue', 'transfer', 'system', 'to', 'have', 'the', 'disturbing', 'feature', 'that', 'once', 'a', 'plan', 'enters', 'the', 'state', 'of', 'paying', 'into', 'the', 'pool', 'then', 'it', 'will', 'stay', 'in', 'that', 'state', 'for', 'an', 'average', 'period', 'of', '487', 'years', 'moreover', 'once', 'a', 'plan', 'has', 'received', 'funds', 'from', 'the', 'pool', 'then', 'it', 'will', 'stay', 'in', 'that', 'state', 'for', 'an', 'average', 'period', 'of', '389', 'years']] | [-0.03003148950325946, 0.09720439942830125, -0.10611288590783564, 0.0792451181288925, -0.08542882490049426, -0.11911865272947277, 0.16043886662325046, 0.406478492061918, -0.24156516962878716, -0.2908636455812181, 0.14890067934993567, -0.31083674820838497, -0.07646553054825442, 0.1756879616975008, -0.1466505616980915, -0.014189361359361405, 0.10031281902823443, 0.06450000593225316, 0.00772091750841355, -0.3034762514735727, 0.25589885330215717, 0.11157701776052514, 0.28729370957783734, 0.026276838271102557, 0.10396118817249468, 0.010359105457124922, -0.023008382077144538, -0.029516496299766003, -0.12007432603334868, 0.07717455597476146, 0.29758824905147774, 0.2150571451386592, 0.3854363571542005, -0.4376095867017284, -0.14349028270808048, 0.14829803406222103, 0.05037694438554657, 0.08090516157293072, -0.039648248445882925, -0.2430111100509142, 0.04124158288153315, -0.25445010473874086, -0.08251916225174985, -0.03519814167812001, 0.07024064165792272, -0.01172264843286636, -0.29245891551836395, 0.004908396041476711, 0.022944103369566923, -0.013308273612832029, -0.07867742519592866, -0.1280135880432984, -0.08609866002225317, 0.19115774098415084, 0.08617506851163247, 0.04026523535818948, 0.11761983890125217, -0.1381987398674634, -0.10177267845332001, 0.37593359684105965, -0.031101248151874945, -0.15464312583596135, 0.08714940554103426, -0.14488731940897803, -0.11265472584442857, 0.1350584264068554, 0.2480269635275666, 0.04949681186893334, -0.18728353939562414, -0.007343696502357488, -0.03920502295174325, 0.19605407102499156, 0.07024592067658281, -0.04023630247102119, 0.23600905156927182, 0.1550006393479028, 0.09541640827083028, 0.14547251130861696, -0.09090649003143578, -0.11506640809626939, -0.2593582818362241, -0.17061066870422412, -0.14421700186115535, 0.0878538041783031, -0.013497856666739002, -0.08708636432565982, 0.3687899505253881, 0.1879874563581931, 0.16057421849739814, 0.0768489828032519, 0.24960404109733644, 0.10231480112779537, 0.06474663566683982, 0.08413043550972361, 0.224933818661763, -0.030747707209472234, 0.12582228654646316, -0.17114939277525992, 0.13363517170073463, -0.015245029713454036] |
1,803.01224 | Coherent Elastic Neutrino Nucleus Scattering (CE$\nu$NS) as a probe of
$Z'$ through kinetic and mass mixing effects | We examine the current constraints and future sensitivity of Coherent Elastic
Neutrino-Nucleus Scattering (CE$\nu$NS) experiments to mixing scenarios
involving a $Z^\prime$ which interacts via portals with the Standard Model. We
contrast the results against those from fixed target, atomic parity violation,
and solar neutrino experiments. We demonstrate a significant dependence of the
experimental reach on the $Z'$ coupling non-universality and the
complementarity of CE$\nu$NS to existing searches.
| hep-ph hep-ex | we examine the current constraints and future sensitivity of coherent elastic neutrinonucleus scattering cenuns experiments to mixing scenarios involving a zprime which interacts via portals with the standard model we contrast the results against those from fixed target atomic parity violation and solar neutrino experiments we demonstrate a significant dependence of the experimental reach on the z coupling nonuniversality and the complementarity of cenuns to existing searches | [['we', 'examine', 'the', 'current', 'constraints', 'and', 'future', 'sensitivity', 'of', 'coherent', 'elastic', 'neutrinonucleus', 'scattering', 'cenuns', 'experiments', 'to', 'mixing', 'scenarios', 'involving', 'a', 'zprime', 'which', 'interacts', 'via', 'portals', 'with', 'the', 'standard', 'model', 'we', 'contrast', 'the', 'results', 'against', 'those', 'from', 'fixed', 'target', 'atomic', 'parity', 'violation', 'and', 'solar', 'neutrino', 'experiments', 'we', 'demonstrate', 'a', 'significant', 'dependence', 'of', 'the', 'experimental', 'reach', 'on', 'the', 'z', 'coupling', 'nonuniversality', 'and', 'the', 'complementarity', 'of', 'cenuns', 'to', 'existing', 'searches']] | [-0.09247079214303573, 0.18872157250072308, 0.005708771142691596, 0.11505636406033787, -0.08093548808316353, -0.13620267053649052, 0.1012171780162338, 0.3280874654761891, -0.24896945613922913, -0.3185266910551755, 0.03420437953726792, -0.355089439718581, -0.07312377565192865, 0.1897025596204478, 0.09551258691683856, 0.10138683680639561, 0.09603263808886951, -0.03094856135213553, -0.08543309812614722, -0.19139037860918845, 0.284625781283005, 0.08898073746197259, 0.2834923628773262, 0.1311230671022143, 0.07765054219374572, 0.03325501216380899, -0.05079006530177682, -0.035307433178175744, -0.1232334784186035, 0.10133284440180704, 0.20750913828778178, 0.1328156401139142, 0.10872244239965481, -0.4390033909967586, -0.164508070254615, 0.15798867821915827, 0.09498807161033446, 0.12104148163856354, -0.11699376396535993, -0.371383310114937, 0.017022290019450513, -0.18427825377864845, -0.06770112422301865, -0.06656680683563672, -0.07845630696905193, -0.005256407157476268, -0.33685500285963516, 0.06018763656185856, -0.05334450980064584, -0.0028527276659968182, -0.05230879532034272, -0.13888708003379627, 0.01640142708905597, 0.04803029616683054, 0.1336413831780178, -0.019273174429701556, 0.19081591507906456, -0.19948299664920613, -0.1882331799368249, 0.4004015927828515, -0.13034759389945486, -0.17322020057533213, 0.2318405893617379, -0.16483841069153884, -0.12164012598110113, 0.053797971443342626, 0.21407409579451406, 0.06555041323290832, -0.11307686465139043, 0.12244900529804542, -0.09424915903685753, 0.1678320045944359, 0.04318593415334376, 0.060200640570316745, 0.24271271572406614, 0.2549851718011187, 0.04607954991063965, 0.03374660005723474, -0.15848866268756118, -0.0685953160386477, -0.3811518683084356, -0.08066929158156932, -0.04352237865217586, 0.04850732426701197, -0.04023293344544615, -0.03633346496177698, 0.37356508271629685, 0.1976561547576714, 0.2215362619330634, 0.027716729791709846, 0.34019624683554217, 0.04325074370283244, 0.07597004661141936, -0.052219398674179816, 0.3689328864522612, 0.11116755304774686, 0.08307201704166746, -0.2819113766517379, 0.0568110602230195, -0.040914049101020415] |
1,803.01225 | Dynamics in a one-dimensional ferrogel model: relaxation, pairing,
shock-wave propagation | Ferrogels are smart soft materials, consisting of a polymeric network and
embedded magnetic particles. Novel phenomena, such as the variation of the
overall mechanical properties by external magnetic fields, emerge consequently.
However, the dynamic behavior of ferrogels remains largely unveiled. In this
paper, we consider a one-dimensional chain consisting of magnetic dipoles and
elastic springs between them as a simple model for ferrogels. The model is
evaluated by corresponding simulations. To probe the dynamics theoretically, we
investigate a continuum limit of the energy governing the system and the
corresponding equation of motion. We provide general classification scenarios
for the dynamics, elucidating the touching/detachment dynamics of the magnetic
particles along the chain. In particular, it is verified in certain cases that
the long-time relaxation corresponds to solutions of shock-wave propagation,
while formations of particle pairs underlie the initial stage of the dynamics.
We expect that these results will provide insight into the understanding of the
dynamics of more realistic models with randomness in parameters and
time-dependent magnetic fields.
| cond-mat.soft cond-mat.mtrl-sci | ferrogels are smart soft materials consisting of a polymeric network and embedded magnetic particles novel phenomena such as the variation of the overall mechanical properties by external magnetic fields emerge consequently however the dynamic behavior of ferrogels remains largely unveiled in this paper we consider a onedimensional chain consisting of magnetic dipoles and elastic springs between them as a simple model for ferrogels the model is evaluated by corresponding simulations to probe the dynamics theoretically we investigate a continuum limit of the energy governing the system and the corresponding equation of motion we provide general classification scenarios for the dynamics elucidating the touchingdetachment dynamics of the magnetic particles along the chain in particular it is verified in certain cases that the longtime relaxation corresponds to solutions of shockwave propagation while formations of particle pairs underlie the initial stage of the dynamics we expect that these results will provide insight into the understanding of the dynamics of more realistic models with randomness in parameters and timedependent magnetic fields | [['ferrogels', 'are', 'smart', 'soft', 'materials', 'consisting', 'of', 'a', 'polymeric', 'network', 'and', 'embedded', 'magnetic', 'particles', 'novel', 'phenomena', 'such', 'as', 'the', 'variation', 'of', 'the', 'overall', 'mechanical', 'properties', 'by', 'external', 'magnetic', 'fields', 'emerge', 'consequently', 'however', 'the', 'dynamic', 'behavior', 'of', 'ferrogels', 'remains', 'largely', 'unveiled', 'in', 'this', 'paper', 'we', 'consider', 'a', 'onedimensional', 'chain', 'consisting', 'of', 'magnetic', 'dipoles', 'and', 'elastic', 'springs', 'between', 'them', 'as', 'a', 'simple', 'model', 'for', 'ferrogels', 'the', 'model', 'is', 'evaluated', 'by', 'corresponding', 'simulations', 'to', 'probe', 'the', 'dynamics', 'theoretically', 'we', 'investigate', 'a', 'continuum', 'limit', 'of', 'the', 'energy', 'governing', 'the', 'system', 'and', 'the', 'corresponding', 'equation', 'of', 'motion', 'we', 'provide', 'general', 'classification', 'scenarios', 'for', 'the', 'dynamics', 'elucidating', 'the', 'touchingdetachment', 'dynamics', 'of', 'the', 'magnetic', 'particles', 'along', 'the', 'chain', 'in', 'particular', 'it', 'is', 'verified', 'in', 'certain', 'cases', 'that', 'the', 'longtime', 'relaxation', 'corresponds', 'to', 'solutions', 'of', 'shockwave', 'propagation', 'while', 'formations', 'of', 'particle', 'pairs', 'underlie', 'the', 'initial', 'stage', 'of', 'the', 'dynamics', 'we', 'expect', 'that', 'these', 'results', 'will', 'provide', 'insight', 'into', 'the', 'understanding', 'of', 'the', 'dynamics', 'of', 'more', 'realistic', 'models', 'with', 'randomness', 'in', 'parameters', 'and', 'timedependent', 'magnetic', 'fields']] | [-0.15892270186296048, 0.1650306565577658, -0.06334688164383533, 0.054734509248224775, -0.01739969705960837, -0.08888945574816091, -0.008514408997669592, 0.36529355539929076, -0.28389232912863865, -0.30591896667807217, 0.06936251016681542, -0.2435074362690639, -0.16978523375589893, 0.1804432613678355, 0.0356004939313574, 0.02768738343414054, 0.04688383113517123, 0.014471169102850023, -0.02355531766920923, -0.15280853298419794, 0.30193221155366107, 0.038489059505827095, 0.2847909616665488, 0.034945854199040366, 0.11536314003988302, 0.012888598267033875, 0.04952976780562067, 0.04722760969371048, -0.15541264922850756, 0.0957560046093471, 0.1691679795708899, 0.03979187194084053, 0.23244133385190044, -0.497231640752001, -0.25599642167518655, 0.07585962041258722, 0.13905079798851477, 0.12848540423409902, -0.03800667335985142, -0.2693344491410507, 0.04683175291978272, -0.12241394339544497, -0.17893174616619945, -0.1011091821984085, 0.005041919962828417, 0.07472102700330104, -0.24207931895549578, 0.08431765028410199, 0.0820986204366873, 0.045068847166980244, -0.11794778881650643, -0.04228946983993771, -0.020181395252325, 0.13725942047523246, 0.06339516814206222, -0.028811103835455085, 0.16945687114227428, -0.19464678552242962, -0.11314372072018773, 0.41005624632115467, -0.03439582349502493, -0.19632190427355783, 0.21966087932036404, -0.1193496371548923, -0.11530287029412407, 0.12781780056868602, 0.20163661293918267, 0.10593268268808992, -0.19150828792578933, 0.05979709344613085, -0.033525991776021176, 0.14441130179136918, 0.0008397754814745073, 0.03178303788243569, 0.24985836202794887, 0.23905030423803367, -0.0012707786167500518, 0.1917392638279125, -0.07791182610465085, -0.133966544516811, -0.2728838083609176, -0.14849468905209418, -0.1447644019275006, 0.05983700588098671, -0.07832639429301685, -0.17595978648996496, 0.40958707223377044, 0.15741397166192359, 0.18260557313326253, 0.008962979025476757, 0.26016630800104285, 0.08659453244447843, 0.013449098614706513, 0.050344813638577145, 0.26345238219722206, 0.1499595558523279, 0.11304498708972438, -0.24145805466561074, 0.05081721022725105, 0.03409557868670448] |
1,803.01226 | Symbolic dynamics of piecewise contractions | A map $f{:}\,[0,1)\to [0,1)$ is a {\it piecewise contraction of $n$
intervals} ($n$-PC) if there exist $0<\lambda<1$ and a partition of $[0,1)$
into intervals $I_1,\ldots,I_n$ such that $f\vert_{I_i}$ is $\lambda$-Lipschitz
for every $1\le i\le n$. An infinite word $\theta=\theta_0\theta_1\ldots$ over
the alphabet $\mathcal{A}=\{1,\ldots,n\}$ is a {\it natural coding of} $f$ if
there exists $x\in I$ such that $\theta_k=i$ if and only if $f^k(x)\in I_i$. We
prove that if $\theta$ is a natural coding of an injective $n$-PC, then some
infinite subword of $\theta$ is either periodic or isomorphic to a natural
coding of a topologically transitive $m$-interval exchange transformation
($m$-IET), where $m\le n$. Conversely, every natural coding of a topologically
transitive $n$-IET is also a natural coding of some injective $n$-PC.
| math.DS | a map f01to 01 is a it piecewise contraction of n intervals npc if there exist 0lambda1 and a partition of 01 into intervals i_1ldotsi_n such that fvert_i_i is lambdalipschitz for every 1le ile n an infinite word thetatheta_0theta_1ldots over the alphabet mathcala1ldotsn is a it natural coding of f if there exists xin i such that theta_ki if and only if fkxin i_i we prove that if theta is a natural coding of an injective npc then some infinite subword of theta is either periodic or isomorphic to a natural coding of a topologically transitive minterval exchange transformation miet where mle n conversely every natural coding of a topologically transitive niet is also a natural coding of some injective npc | [['a', 'map', 'f01to', '01', 'is', 'a', 'it', 'piecewise', 'contraction', 'of', 'n', 'intervals', 'npc', 'if', 'there', 'exist', '0lambda1', 'and', 'a', 'partition', 'of', '01', 'into', 'intervals', 'i_1ldotsi_n', 'such', 'that', 'fvert_i_i', 'is', 'lambdalipschitz', 'for', 'every', '1le', 'ile', 'n', 'an', 'infinite', 'word', 'thetatheta_0theta_1ldots', 'over', 'the', 'alphabet', 'mathcala1ldotsn', 'is', 'a', 'it', 'natural', 'coding', 'of', 'f', 'if', 'there', 'exists', 'xin', 'i', 'such', 'that', 'theta_ki', 'if', 'and', 'only', 'if', 'fkxin', 'i_i', 'we', 'prove', 'that', 'if', 'theta', 'is', 'a', 'natural', 'coding', 'of', 'an', 'injective', 'npc', 'then', 'some', 'infinite', 'subword', 'of', 'theta', 'is', 'either', 'periodic', 'or', 'isomorphic', 'to', 'a', 'natural', 'coding', 'of', 'a', 'topologically', 'transitive', 'minterval', 'exchange', 'transformation', 'miet', 'where', 'mle', 'n', 'conversely', 'every', 'natural', 'coding', 'of', 'a', 'topologically', 'transitive', 'niet', 'is', 'also', 'a', 'natural', 'coding', 'of', 'some', 'injective', 'npc']] | [-0.19601809526711964, 0.18066224984833848, -0.05911266196339408, 0.06793015648400526, -0.04771904085288968, -0.2586378990304901, 0.05900546404116444, 0.4165726361240734, -0.38700893434712236, -0.09764750287949778, 0.12207102738964175, -0.30207682898770527, -0.18991563791049676, 0.1377463790714708, -0.12681048921423785, -0.03082498126936946, 0.01841135682096999, 0.1566268568000707, -0.0698954399997826, -0.26891401258150216, 0.28108870579550665, -0.11107997579924893, 0.17095639634256563, 0.03918285104609503, 0.18537362759295656, -0.011935838593145539, 0.05398505948189842, 0.010377996199837836, -0.16429124751199484, 0.0324092534035771, 0.3229204358108211, 0.20720651993944653, 0.2999385964838183, -0.3016472359881287, -0.1734538085660652, 0.24194427534709112, 0.1413041608930941, -0.02587759261133901, -0.05446189454462575, -0.18729612781878627, 0.16484583305652467, -0.15968460151762293, -0.007971691707018436, 0.008276307477468723, 0.18132424936425595, -0.012595155351925968, -0.3733524572790453, -0.02071316802498028, 0.18723303724995308, 0.06736218364778579, -0.006318996052805073, -0.06764863043402632, -0.07600718815892674, 0.09819781496965636, -0.01874789860704097, 0.15187661893453383, 0.012589406420215311, -0.03706994996786019, -0.07928884956830491, 0.37302923844637054, -0.041830288303460465, -0.281221241600354, 0.11945518071501794, -0.12653740098610064, -0.20248026719414874, 0.13243036544800066, 0.035515997878974304, 0.1236699434781545, -0.03199049368860167, 0.20359151685312227, -0.1846317334198638, 0.2486263387264651, 0.1686275971628595, 0.016427048114373496, 0.13814101569873297, 0.11346869374903147, 0.15192756279098002, 0.10627965343576905, 0.016623255449526926, 0.03019738631739624, -0.3397807117812989, -0.14792574388015883, -0.19610971840621347, 0.1394686213706767, -0.15323935542638586, -0.24329612577301368, 0.3012645941701505, 0.08004282988616053, 0.15910067273663325, 0.1194021723002375, 0.2215501397731714, 0.0778790111949651, 0.01766061776301317, 0.13703094757766576, 0.04454086905625126, 0.12742604717832842, -0.11082713041666961, -0.09685952295988325, 0.037501619850987926, 0.10498556807604537] |
1,803.01227 | Sulfate Radical Oxidation of Aromatic Contaminants: A Detailed
Assessment of Density Functional Theory and High-Level Quantum Chemical
Methods | Advanced oxidation processes that utilize highly oxidative radicals are
widely used in water reuse treatment. In recent years, the application of
sulfate radical (SO$_4\cdot^-$) as a promising oxidant for water treatment has
gained increasing attention. To understand the efficiency of SO$_4\cdot^-$ in
the degradation of organic contaminants in wastewater effluent, it is important
to be able to predict the reaction kinetics of various SO$_4\cdot^-$-driven
oxidation reactions. In this study, we utilize density functional theory (DFT)
and high-level wavefunction-based methods (including computationally-intensive
coupled cluster methods), to explore the activation energies and kinetic rates
of SO$_4\cdot^-$-driven oxidation reactions on a series of benzene-derived
contaminants. These high-level calculations encompassed a wide set of reactions
including 110 forward/reverse reactions and 5 different computational methods
in total. Based on the high-level coupled-cluster quantum calculations, we find
that the popular M06-2X DFT functional is significantly more accurate for
HO-additions than for SO$_4\cdot^-$ reactions. Most importantly, we highlight
some of the limitations and deficiencies of other computational methods, and we
recommend the use of high-level quantum calculations to spot-check
environmental chemistry reactions that may lie outside the training set of the
M06-2X functional, particularly for water oxidation reactions that involve
SO$_4\cdot^-$ and other inorganic species.
| physics.chem-ph physics.atm-clus | advanced oxidation processes that utilize highly oxidative radicals are widely used in water reuse treatment in recent years the application of sulfate radical so_4cdot as a promising oxidant for water treatment has gained increasing attention to understand the efficiency of so_4cdot in the degradation of organic contaminants in wastewater effluent it is important to be able to predict the reaction kinetics of various so_4cdotdriven oxidation reactions in this study we utilize density functional theory dft and highlevel wavefunctionbased methods including computationallyintensive coupled cluster methods to explore the activation energies and kinetic rates of so_4cdotdriven oxidation reactions on a series of benzenederived contaminants these highlevel calculations encompassed a wide set of reactions including 110 forwardreverse reactions and 5 different computational methods in total based on the highlevel coupledcluster quantum calculations we find that the popular m062x dft functional is significantly more accurate for hoadditions than for so_4cdot reactions most importantly we highlight some of the limitations and deficiencies of other computational methods and we recommend the use of highlevel quantum calculations to spotcheck environmental chemistry reactions that may lie outside the training set of the m062x functional particularly for water oxidation reactions that involve so_4cdot and other inorganic species | [['advanced', 'oxidation', 'processes', 'that', 'utilize', 'highly', 'oxidative', 'radicals', 'are', 'widely', 'used', 'in', 'water', 'reuse', 'treatment', 'in', 'recent', 'years', 'the', 'application', 'of', 'sulfate', 'radical', 'so_4cdot', 'as', 'a', 'promising', 'oxidant', 'for', 'water', 'treatment', 'has', 'gained', 'increasing', 'attention', 'to', 'understand', 'the', 'efficiency', 'of', 'so_4cdot', 'in', 'the', 'degradation', 'of', 'organic', 'contaminants', 'in', 'wastewater', 'effluent', 'it', 'is', 'important', 'to', 'be', 'able', 'to', 'predict', 'the', 'reaction', 'kinetics', 'of', 'various', 'so_4cdotdriven', 'oxidation', 'reactions', 'in', 'this', 'study', 'we', 'utilize', 'density', 'functional', 'theory', 'dft', 'and', 'highlevel', 'wavefunctionbased', 'methods', 'including', 'computationallyintensive', 'coupled', 'cluster', 'methods', 'to', 'explore', 'the', 'activation', 'energies', 'and', 'kinetic', 'rates', 'of', 'so_4cdotdriven', 'oxidation', 'reactions', 'on', 'a', 'series', 'of', 'benzenederived', 'contaminants', 'these', 'highlevel', 'calculations', 'encompassed', 'a', 'wide', 'set', 'of', 'reactions', 'including', '110', 'forwardreverse', 'reactions', 'and', '5', 'different', 'computational', 'methods', 'in', 'total', 'based', 'on', 'the', 'highlevel', 'coupledcluster', 'quantum', 'calculations', 'we', 'find', 'that', 'the', 'popular', 'm062x', 'dft', 'functional', 'is', 'significantly', 'more', 'accurate', 'for', 'hoadditions', 'than', 'for', 'so_4cdot', 'reactions', 'most', 'importantly', 'we', 'highlight', 'some', 'of', 'the', 'limitations', 'and', 'deficiencies', 'of', 'other', 'computational', 'methods', 'and', 'we', 'recommend', 'the', 'use', 'of', 'highlevel', 'quantum', 'calculations', 'to', 'spotcheck', 'environmental', 'chemistry', 'reactions', 'that', 'may', 'lie', 'outside', 'the', 'training', 'set', 'of', 'the', 'm062x', 'functional', 'particularly', 'for', 'water', 'oxidation', 'reactions', 'that', 'involve', 'so_4cdot', 'and', 'other', 'inorganic', 'species']] | [-0.0070916767361202315, 0.07340690666819329, -0.04563666891365148, 0.07337865874640537, -0.008028424919192038, -0.11651236932830876, 0.06823559221389361, 0.39365772607162053, -0.24000194969700428, -0.3018703935619617, 0.01437328902430292, -0.3035964245155183, -0.15151842596935872, 0.19141222325628962, -0.022966207294613895, 0.05553621767568909, 0.08862965483124334, -0.02538084139362209, -0.06306476985620711, -0.22751320856671606, 0.25638269625454563, 0.09773023928023411, 0.2590261102929094, 0.1206257314894136, 0.04287194083034606, -0.0370193834204246, -0.005686888985162108, -0.045454156956601634, -0.12422306091151288, 0.18831367770673157, 0.36396167902131155, 0.11215745985334247, 0.2695651750992308, -0.5318890927338953, -0.30353064141646413, 0.032919562007952, 0.08463883748666474, 0.1456331918064331, -0.09556994930314144, -0.2066249533573291, 0.053470718144762466, -0.18715768263414695, -0.05257528398471427, -0.13056422082087207, 0.015140417999457664, 0.058075563682344566, -0.22856994589954768, 0.07026878888043213, -0.023175194181521166, 0.0910297929687583, -0.08933927919450241, -0.2112931584549701, -0.06668792880403235, 0.10547353283120947, 0.022719447323666413, -0.0036900603039602756, 0.2593028878773818, -0.12717750997745814, -0.09413780389266774, 0.41345562308621375, -0.04346691538289327, -0.14181399031257536, 0.28276724940276865, -0.08996915007902821, -0.22449846197054793, 0.18346968810544517, 0.15822278596026523, 0.15025859031285801, -0.19494134345009845, 0.03669282959815153, 0.0881825127003116, 0.14676342055308897, 0.07219488971620566, 0.0015155641727603085, 0.11970856585696707, 0.22631570660639458, 0.01625027602123473, 0.06132807783538794, -0.09461761099995726, -0.09656400394090933, -0.19997447113376207, -0.21007906908699892, -0.10546798441876354, 0.04039025032492306, -0.03427008876213297, -0.14780144978777887, 0.3517702428088403, 0.17000401739382132, 0.0907097031203113, -0.027307792779038918, 0.24954199300924498, 0.050792992873379114, 0.09372441687167579, 0.008128749172883639, 0.19327982846201744, 0.14530538183569405, 0.06835258174977155, -0.24811421062102434, 0.13806769393512333, -0.0014073116743425632] |
1,803.01228 | Kardar-Parisi-Zhang growth on one-dimensional decreasing substrates | Recent experimental works on one-dimensional (1D) circular
Kardar-Parisi-Zhang (KPZ) systems whose radii decrease in time have reported
controversial conclusions about the statistics of their interfaces. Motivated
by this, we investigate here several 1D KPZ models on substrates whose size
changes in time as $L(t)=L_0 + \omega t$, focusing on the case $\omega<0$. From
extensive numerical simulations, we show that for $L_0 \gg 1$ there exists a
transient regime in which the statistics is consistent with that of flat KPZ
systems (the $\omega=0$ case), for both $\omega<0$ and $\omega>0$. Actually,
for a given model, $L_0$ and $|\omega|$, we observe that a difference between
ingrowing ($\omega<0$) and outgrowing ($\omega>0$) systems arises only at long
times ($t \gtrsim t_c=L_0/|\omega|$), when the expanding surfaces cross over to
the statistics of curved KPZ systems, whereas the shrinking ones become
completely correlated. A generalization of the Family-Vicsek scaling for the
roughness of ingrowing interfaces is presented. Our results demonstrate that a
transient flat statistics is a general feature of systems starting with large
initial sizes, regardless their curvature. This is consistent with their recent
observation in ingrowing turbulent liquid crystal interfaces, but it is in
contrast with the apparent observation of curved statistics in colloidal
deposition at the edge of evaporating drops. A possible explanation for this
last result, as a consequence of the very small number of monolayers analyzed
in this experiment, is given. This is illustrated in a competitive growth model
presenting a few-monolayer transient and an asymptotic behavior consistent,
respectively, with the curved and flat statistics.
| cond-mat.stat-mech | recent experimental works on onedimensional 1d circular kardarparisizhang kpz systems whose radii decrease in time have reported controversial conclusions about the statistics of their interfaces motivated by this we investigate here several 1d kpz models on substrates whose size changes in time as ltl_0 omega t focusing on the case omega0 from extensive numerical simulations we show that for l_0 gg 1 there exists a transient regime in which the statistics is consistent with that of flat kpz systems the omega0 case for both omega0 and omega0 actually for a given model l_0 and omega we observe that a difference between ingrowing omega0 and outgrowing omega0 systems arises only at long times t gtrsim t_cl_0omega when the expanding surfaces cross over to the statistics of curved kpz systems whereas the shrinking ones become completely correlated a generalization of the familyvicsek scaling for the roughness of ingrowing interfaces is presented our results demonstrate that a transient flat statistics is a general feature of systems starting with large initial sizes regardless their curvature this is consistent with their recent observation in ingrowing turbulent liquid crystal interfaces but it is in contrast with the apparent observation of curved statistics in colloidal deposition at the edge of evaporating drops a possible explanation for this last result as a consequence of the very small number of monolayers analyzed in this experiment is given this is illustrated in a competitive growth model presenting a fewmonolayer transient and an asymptotic behavior consistent respectively with the curved and flat statistics | [['recent', 'experimental', 'works', 'on', 'onedimensional', '1d', 'circular', 'kardarparisizhang', 'kpz', 'systems', 'whose', 'radii', 'decrease', 'in', 'time', 'have', 'reported', 'controversial', 'conclusions', 'about', 'the', 'statistics', 'of', 'their', 'interfaces', 'motivated', 'by', 'this', 'we', 'investigate', 'here', 'several', '1d', 'kpz', 'models', 'on', 'substrates', 'whose', 'size', 'changes', 'in', 'time', 'as', 'ltl_0', 'omega', 't', 'focusing', 'on', 'the', 'case', 'omega0', 'from', 'extensive', 'numerical', 'simulations', 'we', 'show', 'that', 'for', 'l_0', 'gg', '1', 'there', 'exists', 'a', 'transient', 'regime', 'in', 'which', 'the', 'statistics', 'is', 'consistent', 'with', 'that', 'of', 'flat', 'kpz', 'systems', 'the', 'omega0', 'case', 'for', 'both', 'omega0', 'and', 'omega0', 'actually', 'for', 'a', 'given', 'model', 'l_0', 'and', 'omega', 'we', 'observe', 'that', 'a', 'difference', 'between', 'ingrowing', 'omega0', 'and', 'outgrowing', 'omega0', 'systems', 'arises', 'only', 'at', 'long', 'times', 't', 'gtrsim', 't_cl_0omega', 'when', 'the', 'expanding', 'surfaces', 'cross', 'over', 'to', 'the', 'statistics', 'of', 'curved', 'kpz', 'systems', 'whereas', 'the', 'shrinking', 'ones', 'become', 'completely', 'correlated', 'a', 'generalization', 'of', 'the', 'familyvicsek', 'scaling', 'for', 'the', 'roughness', 'of', 'ingrowing', 'interfaces', 'is', 'presented', 'our', 'results', 'demonstrate', 'that', 'a', 'transient', 'flat', 'statistics', 'is', 'a', 'general', 'feature', 'of', 'systems', 'starting', 'with', 'large', 'initial', 'sizes', 'regardless', 'their', 'curvature', 'this', 'is', 'consistent', 'with', 'their', 'recent', 'observation', 'in', 'ingrowing', 'turbulent', 'liquid', 'crystal', 'interfaces', 'but', 'it', 'is', 'in', 'contrast', 'with', 'the', 'apparent', 'observation', 'of', 'curved', 'statistics', 'in', 'colloidal', 'deposition', 'at', 'the', 'edge', 'of', 'evaporating', 'drops', 'a', 'possible', 'explanation', 'for', 'this', 'last', 'result', 'as', 'a', 'consequence', 'of', 'the', 'very', 'small', 'number', 'of', 'monolayers', 'analyzed', 'in', 'this', 'experiment', 'is', 'given', 'this', 'is', 'illustrated', 'in', 'a', 'competitive', 'growth', 'model', 'presenting', 'a', 'fewmonolayer', 'transient', 'and', 'an', 'asymptotic', 'behavior', 'consistent', 'respectively', 'with', 'the', 'curved', 'and', 'flat', 'statistics']] | [-0.13764856817014515, 0.1496449248609715, -0.07761822378262878, 0.04391535051073879, -0.01164394173771143, -0.16806350852921606, 0.021926837962120773, 0.3756541605070233, -0.21645501777157186, -0.24618326467229054, 0.09263439407758414, -0.2928613263592124, -0.12765786709892563, 0.21228454624954612, -0.02638118190597743, 0.051431871926411986, 0.03652938093431294, -0.008612682280596346, -0.06558883624640294, -0.203287528961082, 0.2936081025209278, 0.04582456097565591, 0.27771832572482524, 0.05976848794706166, 0.07637865662574768, -0.033707874041050676, 0.00046720291208475826, 0.05554321411903947, -0.18994436067400966, 0.04299861842373502, 0.22517388080824458, -0.0049037416642531756, 0.23431293275207282, -0.38974370539188385, -0.24490250720607581, 0.07448446462489665, 0.15030503299180417, 0.1032813616975327, -0.0604655518620275, -0.26590054752398284, 0.0666715542464517, -0.12280334153585136, -0.16152005853131413, 0.005783627308905125, 0.09396635372145101, 0.022848691901774146, -0.2235558963380754, 0.14689438564470036, 0.08788479766342788, 0.05197095483570593, -0.05980087044648826, -0.08135825841175393, -0.02922279370203614, 0.06209981513966341, 0.07824597581615672, 0.021604854205623268, 0.09776593878306448, -0.14344609306706116, -0.08560367260873318, 0.35712151449918744, -0.05537355329375714, -0.17758920941874384, 0.22411520193330944, -0.20750555246323346, -0.11729984473343938, 0.12555490899458527, 0.12789307120000012, 0.1308343882355839, -0.09599417026276932, 0.11594114617793821, -0.05322538298089057, 0.1769020140803186, 0.0841004523485899, -0.00990803572605364, 0.21458479984663426, 0.2156732883984223, 0.03131645039189607, 0.1225909400479868, -0.0641354387300089, -0.10426209257845767, -0.3214002939499915, -0.1260743397423066, -0.2197859524677042, 0.07478602735884488, -0.10474974330299301, -0.1967773168901913, 0.3393414126895368, 0.1310960696041584, 0.23534539275616406, 0.10321421869797633, 0.21696060502855108, 0.11019660439016297, 0.024641018741298468, 0.07723584450781346, 0.2215182991810143, 0.09685481135174633, 0.13477914350526407, -0.18709058080334218, 0.04701173486188054, -0.010342212544754148] |
1,803.01229 | GAN-based Synthetic Medical Image Augmentation for increased CNN
Performance in Liver Lesion Classification | Deep learning methods, and in particular convolutional neural networks
(CNNs), have led to an enormous breakthrough in a wide range of computer vision
tasks, primarily by using large-scale annotated datasets. However, obtaining
such datasets in the medical domain remains a challenge. In this paper, we
present methods for generating synthetic medical images using recently
presented deep learning Generative Adversarial Networks (GANs). Furthermore, we
show that generated medical images can be used for synthetic data augmentation,
and improve the performance of CNN for medical image classification. Our novel
method is demonstrated on a limited dataset of computed tomography (CT) images
of 182 liver lesions (53 cysts, 64 metastases and 65 hemangiomas). We first
exploit GAN architectures for synthesizing high quality liver lesion ROIs. Then
we present a novel scheme for liver lesion classification using CNN. Finally,
we train the CNN using classic data augmentation and our synthetic data
augmentation and compare performance. In addition, we explore the quality of
our synthesized examples using visualization and expert assessment. The
classification performance using only classic data augmentation yielded 78.6%
sensitivity and 88.4% specificity. By adding the synthetic data augmentation
the results increased to 85.7% sensitivity and 92.4% specificity. We believe
that this approach to synthetic data augmentation can generalize to other
medical classification applications and thus support radiologists' efforts to
improve diagnosis.
| cs.CV cs.LG stat.ML | deep learning methods and in particular convolutional neural networks cnns have led to an enormous breakthrough in a wide range of computer vision tasks primarily by using largescale annotated datasets however obtaining such datasets in the medical domain remains a challenge in this paper we present methods for generating synthetic medical images using recently presented deep learning generative adversarial networks gans furthermore we show that generated medical images can be used for synthetic data augmentation and improve the performance of cnn for medical image classification our novel method is demonstrated on a limited dataset of computed tomography ct images of 182 liver lesions 53 cysts 64 metastases and 65 hemangiomas we first exploit gan architectures for synthesizing high quality liver lesion rois then we present a novel scheme for liver lesion classification using cnn finally we train the cnn using classic data augmentation and our synthetic data augmentation and compare performance in addition we explore the quality of our synthesized examples using visualization and expert assessment the classification performance using only classic data augmentation yielded 786 sensitivity and 884 specificity by adding the synthetic data augmentation the results increased to 857 sensitivity and 924 specificity we believe that this approach to synthetic data augmentation can generalize to other medical classification applications and thus support radiologists efforts to improve diagnosis | [['deep', 'learning', 'methods', 'and', 'in', 'particular', 'convolutional', 'neural', 'networks', 'cnns', 'have', 'led', 'to', 'an', 'enormous', 'breakthrough', 'in', 'a', 'wide', 'range', 'of', 'computer', 'vision', 'tasks', 'primarily', 'by', 'using', 'largescale', 'annotated', 'datasets', 'however', 'obtaining', 'such', 'datasets', 'in', 'the', 'medical', 'domain', 'remains', 'a', 'challenge', 'in', 'this', 'paper', 'we', 'present', 'methods', 'for', 'generating', 'synthetic', 'medical', 'images', 'using', 'recently', 'presented', 'deep', 'learning', 'generative', 'adversarial', 'networks', 'gans', 'furthermore', 'we', 'show', 'that', 'generated', 'medical', 'images', 'can', 'be', 'used', 'for', 'synthetic', 'data', 'augmentation', 'and', 'improve', 'the', 'performance', 'of', 'cnn', 'for', 'medical', 'image', 'classification', 'our', 'novel', 'method', 'is', 'demonstrated', 'on', 'a', 'limited', 'dataset', 'of', 'computed', 'tomography', 'ct', 'images', 'of', '182', 'liver', 'lesions', '53', 'cysts', '64', 'metastases', 'and', '65', 'hemangiomas', 'we', 'first', 'exploit', 'gan', 'architectures', 'for', 'synthesizing', 'high', 'quality', 'liver', 'lesion', 'rois', 'then', 'we', 'present', 'a', 'novel', 'scheme', 'for', 'liver', 'lesion', 'classification', 'using', 'cnn', 'finally', 'we', 'train', 'the', 'cnn', 'using', 'classic', 'data', 'augmentation', 'and', 'our', 'synthetic', 'data', 'augmentation', 'and', 'compare', 'performance', 'in', 'addition', 'we', 'explore', 'the', 'quality', 'of', 'our', 'synthesized', 'examples', 'using', 'visualization', 'and', 'expert', 'assessment', 'the', 'classification', 'performance', 'using', 'only', 'classic', 'data', 'augmentation', 'yielded', '786', 'sensitivity', 'and', '884', 'specificity', 'by', 'adding', 'the', 'synthetic', 'data', 'augmentation', 'the', 'results', 'increased', 'to', '857', 'sensitivity', 'and', '924', 'specificity', 'we', 'believe', 'that', 'this', 'approach', 'to', 'synthetic', 'data', 'augmentation', 'can', 'generalize', 'to', 'other', 'medical', 'classification', 'applications', 'and', 'thus', 'support', 'radiologists', 'efforts', 'to', 'improve', 'diagnosis']] | [0.057671824416760865, -0.05898980450448783, -0.004222371896361471, 0.05278824252522884, -0.10462544108271052, -0.15236582638644572, 0.03843941307042452, 0.490173752364113, -0.21381449057488838, -0.37767619452088935, 0.1033490606655213, -0.2794094092622207, -0.2084214895228864, 0.2510044307623127, -0.208450965051512, 0.11593204379132992, 0.20927776002384926, -0.01810276452473305, -0.036428672376883416, -0.3397976631990745, 0.257743826661464, 0.03004631844782826, 0.4240672277765126, 0.05222159922187037, 0.12863527864982469, -0.06334694446312315, -0.05214334942759314, 0.0008814935487002955, -0.065827393445409, 0.2173028719684092, 0.3590178209519304, 0.24288876338460302, 0.3105601950232452, -0.40382430791308027, -0.2575003006239208, 0.10920372279788103, 0.1567525528755825, 0.10065221124653888, -0.08742839338817557, -0.37950978906603033, 0.1328564555503838, -0.15375105813765094, 0.04839363407317993, -0.21123098702289575, -0.03273828509274375, -0.028979276348046378, -0.3106837697079354, 0.06362809319638672, 0.008948867521120594, 0.16477697562434873, -0.10887753112463776, -0.1344503922091045, 0.03220831988050406, 0.18108875883119438, -0.030276591552062592, 0.09522302058037294, 0.13899394655984681, -0.24044817953302158, -0.17818861961398924, 0.3031604487765068, -0.04167975974616321, -0.16489073023247564, 0.20276134254820988, -0.005365627484584074, -0.16118223159445808, 0.10585732604248808, 0.2545763804027789, 0.11694203987888513, -0.15878510685987907, -0.03145243737813504, -0.0045938160064322615, 0.18257496933721928, 0.06491626324046643, -0.08815718664618961, 0.11302292676655354, 0.31680051664770537, -0.06175873653723969, 0.1806983082187298, -0.25576505391247606, 0.054109045230663906, -0.15760170548744157, -0.11632638241360904, -0.21860524548597873, 0.006311643642262308, -0.10646667856013631, -0.12084880819834701, 0.41151565294493503, 0.27778870668988503, 0.19611356957226034, 0.08988238963161792, 0.37176570625240923, -0.03730238444831889, 0.12803209438138222, 0.03198640025648024, 0.16664168224328224, 0.013710121446878675, 0.1433721679762655, -0.15241054472633117, 0.02943922256743279, 0.010145448723919006] |
1,803.0123 | Fractal geometry of the complement of Lagrange spectrum in Markov
spectrum | The Lagrange and Markov spectra are classical objects in Number Theory
related to certain Diophantine approximation problems. Geometrically, they are
the spectra of heights of geodesics in the modular surface.
These objects were first studied by A. Markov in 1879, but, despite many
efforts, the structure of the complement $M\setminus L$ of the Lagrange
spectrum $L$ in the Markov spectrum $M$ remained somewhat mysterious. In fact,
it was shown by G. Freiman (in 1968 and 1973) and M. Flahive (in 1977) that
$M\setminus L$ contains infinite \emph{countable} subsets near 3.11 and 3.29,
and T. Cusick conjectured in 1975 that all elements of $M\setminus L$ were
$<\sqrt{12}=3.46\dots$, and this was the \emph{status quo} of our knowledge of
$M\setminus L$ until 2017.
In this article, we show the following two results. First, we prove that
$M\setminus L$ is \emph{richer} than it was previously thought because it
contains a Cantor set of Hausdorff dimension larger than $1/2$ near $3.7$: in
particular, this solves (negatively) Cusick's conjecture mentioned above.
Secondly, we show that $M\setminus L$ is \emph{not} very thick: its Hausdorff
dimension is strictly smaller than one.
| math.NT | the lagrange and markov spectra are classical objects in number theory related to certain diophantine approximation problems geometrically they are the spectra of heights of geodesics in the modular surface these objects were first studied by a markov in 1879 but despite many efforts the structure of the complement msetminus l of the lagrange spectrum l in the markov spectrum m remained somewhat mysterious in fact it was shown by g freiman in 1968 and 1973 and m flahive in 1977 that msetminus l contains infinite emphcountable subsets near 311 and 329 and t cusick conjectured in 1975 that all elements of msetminus l were sqrt12346dots and this was the emphstatus quo of our knowledge of msetminus l until 2017 in this article we show the following two results first we prove that msetminus l is emphricher than it was previously thought because it contains a cantor set of hausdorff dimension larger than 12 near 37 in particular this solves negatively cusicks conjecture mentioned above secondly we show that msetminus l is emphnot very thick its hausdorff dimension is strictly smaller than one | [['the', 'lagrange', 'and', 'markov', 'spectra', 'are', 'classical', 'objects', 'in', 'number', 'theory', 'related', 'to', 'certain', 'diophantine', 'approximation', 'problems', 'geometrically', 'they', 'are', 'the', 'spectra', 'of', 'heights', 'of', 'geodesics', 'in', 'the', 'modular', 'surface', 'these', 'objects', 'were', 'first', 'studied', 'by', 'a', 'markov', 'in', '1879', 'but', 'despite', 'many', 'efforts', 'the', 'structure', 'of', 'the', 'complement', 'msetminus', 'l', 'of', 'the', 'lagrange', 'spectrum', 'l', 'in', 'the', 'markov', 'spectrum', 'm', 'remained', 'somewhat', 'mysterious', 'in', 'fact', 'it', 'was', 'shown', 'by', 'g', 'freiman', 'in', '1968', 'and', '1973', 'and', 'm', 'flahive', 'in', '1977', 'that', 'msetminus', 'l', 'contains', 'infinite', 'emphcountable', 'subsets', 'near', '311', 'and', '329', 'and', 't', 'cusick', 'conjectured', 'in', '1975', 'that', 'all', 'elements', 'of', 'msetminus', 'l', 'were', 'sqrt12346dots', 'and', 'this', 'was', 'the', 'emphstatus', 'quo', 'of', 'our', 'knowledge', 'of', 'msetminus', 'l', 'until', '2017', 'in', 'this', 'article', 'we', 'show', 'the', 'following', 'two', 'results', 'first', 'we', 'prove', 'that', 'msetminus', 'l', 'is', 'emphricher', 'than', 'it', 'was', 'previously', 'thought', 'because', 'it', 'contains', 'a', 'cantor', 'set', 'of', 'hausdorff', 'dimension', 'larger', 'than', '12', 'near', '37', 'in', 'particular', 'this', 'solves', 'negatively', 'cusicks', 'conjecture', 'mentioned', 'above', 'secondly', 'we', 'show', 'that', 'msetminus', 'l', 'is', 'emphnot', 'very', 'thick', 'its', 'hausdorff', 'dimension', 'is', 'strictly', 'smaller', 'than', 'one']] | [-0.1452359660597926, 0.13094218926219103, -0.05612976388257583, 0.08003256207834301, -0.06875528584808645, -0.1144393150579561, 0.03424206407664846, 0.3364021027136301, -0.23687960323354418, -0.2934529496451024, 0.11088124956880707, -0.31229658459778875, -0.1204906811838279, 0.1999568842257258, -0.121321122125419, 0.014919413567266919, 0.023037976659886706, 0.06860026407467261, -0.026705490559956916, -0.29832531380849064, 0.312583818913992, 0.014648510274618571, 0.18640255017776378, 0.029598568118794747, 0.049182026393272064, -0.03901752836091883, -0.05142171354702768, 0.015542173281369542, -0.16129301219025569, 0.08232077807606605, 0.26099413382595804, 0.10162348556986309, 0.25263817439488856, -0.30674213124962335, -0.1698661120366462, 0.12178078121891549, 0.13917806182119452, 0.017321165368546932, 0.06171179832655183, -0.2503387990951789, 0.1423744286771529, -0.12923276053448574, -0.15800628471031283, 0.00499365208251925, 0.1339486909015209, -0.03649650486918648, -0.18350723070344951, 0.026591466938595425, 0.1670866255501934, 0.08583971400473141, -0.05141331532478249, -0.1876342405115118, -0.03925859160836409, 0.04994533475608764, 0.0323079553690446, 0.05781870455810737, 0.041363051821728856, -0.03086522657239778, -0.09582250088837856, 0.3426411578672404, -0.048195597498459884, -0.13543024812981988, 0.19825349943293782, -0.22091806669892178, -0.17598457249362817, 0.16706570905824245, 0.04984512733193533, 0.15361833795015647, -0.09925477525377593, 0.20320532698867047, -0.1418554077835314, 0.1287736336025671, 0.14884014193523215, -0.006730356070558342, 0.11660006638679109, 0.09989674030371491, 0.08027069339380871, 0.1045337114443877, -0.03431498722089559, -0.03751775314325069, -0.2849013841013801, -0.1512694530489232, -0.19240752605818148, 0.12269998770246408, -0.024846129315111293, -0.14410578612590685, 0.30981139398148555, 0.10859197001378418, 0.2037279891854759, 0.05888830205297923, 0.18473064300886702, 0.06506472168592645, 0.04105457450485405, 0.16413880258620706, 0.2149155090767053, 0.17291173409262484, 0.06167789806842051, -0.12970714670412367, 0.01477176589980261, 0.14493469824867972] |
1,803.01231 | Bayesian Projected Calibration of Computer Models | We develop a Bayesian approach called Bayesian projected calibration to
address the problem of calibrating an imperfect computer model using
observational data from a complex physical system. The calibration parameter
and the physical system are parametrized in an identifiable fashion via
$L_2$-projection. The physical process is assigned a Gaussian process prior,
which naturally induces a prior distribution on the calibration parameter
through the $L_2$-projection constraint. The calibration parameter is estimated
through its posterior distribution, which provides a natural and non-asymptotic
way for the uncertainty quantification. We provide a rigorous large sample
justification for the proposed approach by establishing the asymptotic
normality of the posterior of the calibration parameter with the efficient
covariance matrix. In addition, two efficient computational algorithms based on
stochastic approximation are designed with theoretical guarantees. Through
extensive simulation studies and two real-world datasets analyses, we show that
the Bayesian projected calibration can accurately estimate the calibration
parameters, appropriately calibrate the computer models, and compare favorably
to alternative approaches.
| stat.ME math.ST stat.TH | we develop a bayesian approach called bayesian projected calibration to address the problem of calibrating an imperfect computer model using observational data from a complex physical system the calibration parameter and the physical system are parametrized in an identifiable fashion via l_2projection the physical process is assigned a gaussian process prior which naturally induces a prior distribution on the calibration parameter through the l_2projection constraint the calibration parameter is estimated through its posterior distribution which provides a natural and nonasymptotic way for the uncertainty quantification we provide a rigorous large sample justification for the proposed approach by establishing the asymptotic normality of the posterior of the calibration parameter with the efficient covariance matrix in addition two efficient computational algorithms based on stochastic approximation are designed with theoretical guarantees through extensive simulation studies and two realworld datasets analyses we show that the bayesian projected calibration can accurately estimate the calibration parameters appropriately calibrate the computer models and compare favorably to alternative approaches | [['we', 'develop', 'a', 'bayesian', 'approach', 'called', 'bayesian', 'projected', 'calibration', 'to', 'address', 'the', 'problem', 'of', 'calibrating', 'an', 'imperfect', 'computer', 'model', 'using', 'observational', 'data', 'from', 'a', 'complex', 'physical', 'system', 'the', 'calibration', 'parameter', 'and', 'the', 'physical', 'system', 'are', 'parametrized', 'in', 'an', 'identifiable', 'fashion', 'via', 'l_2projection', 'the', 'physical', 'process', 'is', 'assigned', 'a', 'gaussian', 'process', 'prior', 'which', 'naturally', 'induces', 'a', 'prior', 'distribution', 'on', 'the', 'calibration', 'parameter', 'through', 'the', 'l_2projection', 'constraint', 'the', 'calibration', 'parameter', 'is', 'estimated', 'through', 'its', 'posterior', 'distribution', 'which', 'provides', 'a', 'natural', 'and', 'nonasymptotic', 'way', 'for', 'the', 'uncertainty', 'quantification', 'we', 'provide', 'a', 'rigorous', 'large', 'sample', 'justification', 'for', 'the', 'proposed', 'approach', 'by', 'establishing', 'the', 'asymptotic', 'normality', 'of', 'the', 'posterior', 'of', 'the', 'calibration', 'parameter', 'with', 'the', 'efficient', 'covariance', 'matrix', 'in', 'addition', 'two', 'efficient', 'computational', 'algorithms', 'based', 'on', 'stochastic', 'approximation', 'are', 'designed', 'with', 'theoretical', 'guarantees', 'through', 'extensive', 'simulation', 'studies', 'and', 'two', 'realworld', 'datasets', 'analyses', 'we', 'show', 'that', 'the', 'bayesian', 'projected', 'calibration', 'can', 'accurately', 'estimate', 'the', 'calibration', 'parameters', 'appropriately', 'calibrate', 'the', 'computer', 'models', 'and', 'compare', 'favorably', 'to', 'alternative', 'approaches']] | [-0.03852833226856149, 0.012547292571065292, -0.13699245262955484, 0.09126613697315052, -0.11065510927213344, -0.12515510811687172, 0.07816034110274704, 0.40357744266899925, -0.25265563366665217, -0.3650106981443534, 0.12578649451200552, -0.2134545658211335, -0.13157693599826661, 0.20202885357715752, -0.06761675438720663, 0.12808895296433284, 0.111686349749776, -0.03441140541873445, -0.09666414355050842, -0.19434864435098925, 0.26992053546321887, 0.09704730206948219, 0.32639266370609693, -0.04986362729028289, 0.14592059394535054, 0.019869821925161395, -0.08646939812761105, -0.0006746238612997457, -0.16708215451148614, 0.13114996074695937, 0.2432357964259706, 0.19635604377601695, 0.3106732254250432, -0.3918372785389103, -0.2241042467455069, 0.10368292718252999, 0.14287085708142142, 0.09125721725752745, -0.032741426890013074, -0.29026964306245623, 0.030345475093209708, -0.18355260739606694, -0.0811836691602549, -0.11383371112967765, -0.053740493821437064, 0.004919787458841156, -0.3572067574674041, 0.0882382908097978, 0.01208039926681316, 0.06266201517409967, -0.033608291082160326, -0.13461978037829903, 0.034727266026110204, 0.11445159639331436, 0.0247078356695502, -0.01636666576700203, 0.1450151328959154, -0.07978412641194772, -0.0898293956071607, 0.33178433193093015, -0.04984137264436181, -0.2581112786172743, 0.14631847261287179, -0.045885789956393766, -0.140155842931906, 0.08493334867511203, 0.18082202415702478, 0.09336971724405885, -0.21105120055752355, 0.07523204348014914, -0.0208311183700256, 0.1670208612512563, -0.05363806162568383, -0.029582479180850135, 0.17280377595210974, 0.22329372476856663, 0.06140141573964483, 0.13115045042860807, -0.14440571366949886, -0.124505646878256, -0.31133087708046603, -0.10347025182519881, -0.2004812572315429, -0.01674839716445678, -0.17493105689085633, -0.16702654452865603, 0.3660886572943356, 0.2399199496743814, 0.20692535734635853, 0.09016189421527088, 0.376963613941422, 0.1149154292923287, 0.006008633107837266, 0.049648661558873625, 0.23917737952433527, 0.12773317719645705, 0.012753191365971693, -0.18886480574004072, 0.14030813108016765, 0.009123700354599728] |
1,803.01232 | Strain Mapping In Single-Layer 2D Crystals Via Raman Activity | By performing density functional theory-based ab-initio calculations, Raman
active phonon modes of novel single-layer two-dimensional (2D) materials and
the effect of in-plane biaxial strain on the peak frequencies and corresponding
activities of the Raman active modes are calculated. Our findings confirm the
Raman spectrum of the unstrained 2D crystals and provide expected variations in
the Raman active modes of the crystals under in-plane biaxial strain. The
results are summarized as follows; (i) frequencies of the phonon modes soften
(harden) under applied tensile (compressive) strains, (ii) the response of the
Raman activities to applied strain for the in-plane and out-of-plane
vibrational modes have opposite trends, thus, the built-in strains in the
materials can be monitored by tracking the relative activities of those modes,
(iii) in particular, the A-peak in single-layer Si and Ge disappear under a
critical tensile strain, (iv) especially in mono and di- atomic single-layers,
the shift of the peak frequencies is stronger indication of the strain rather
than the change in Raman activities, (v) Raman active modes of single-layer ReX
2 (X=S, Se) are almost irresponsive to the applied strain. Strain-induced
modifications in the Raman spectrum of 2D materials in terms of the peak
positions and the relative Raman activities of the modes could be a convenient
tool for characterization.
| cond-mat.mes-hall | by performing density functional theorybased abinitio calculations raman active phonon modes of novel singlelayer twodimensional 2d materials and the effect of inplane biaxial strain on the peak frequencies and corresponding activities of the raman active modes are calculated our findings confirm the raman spectrum of the unstrained 2d crystals and provide expected variations in the raman active modes of the crystals under inplane biaxial strain the results are summarized as follows i frequencies of the phonon modes soften harden under applied tensile compressive strains ii the response of the raman activities to applied strain for the inplane and outofplane vibrational modes have opposite trends thus the builtin strains in the materials can be monitored by tracking the relative activities of those modes iii in particular the apeak in singlelayer si and ge disappear under a critical tensile strain iv especially in mono and di atomic singlelayers the shift of the peak frequencies is stronger indication of the strain rather than the change in raman activities v raman active modes of singlelayer rex 2 xs se are almost irresponsive to the applied strain straininduced modifications in the raman spectrum of 2d materials in terms of the peak positions and the relative raman activities of the modes could be a convenient tool for characterization | [['by', 'performing', 'density', 'functional', 'theorybased', 'abinitio', 'calculations', 'raman', 'active', 'phonon', 'modes', 'of', 'novel', 'singlelayer', 'twodimensional', '2d', 'materials', 'and', 'the', 'effect', 'of', 'inplane', 'biaxial', 'strain', 'on', 'the', 'peak', 'frequencies', 'and', 'corresponding', 'activities', 'of', 'the', 'raman', 'active', 'modes', 'are', 'calculated', 'our', 'findings', 'confirm', 'the', 'raman', 'spectrum', 'of', 'the', 'unstrained', '2d', 'crystals', 'and', 'provide', 'expected', 'variations', 'in', 'the', 'raman', 'active', 'modes', 'of', 'the', 'crystals', 'under', 'inplane', 'biaxial', 'strain', 'the', 'results', 'are', 'summarized', 'as', 'follows', 'i', 'frequencies', 'of', 'the', 'phonon', 'modes', 'soften', 'harden', 'under', 'applied', 'tensile', 'compressive', 'strains', 'ii', 'the', 'response', 'of', 'the', 'raman', 'activities', 'to', 'applied', 'strain', 'for', 'the', 'inplane', 'and', 'outofplane', 'vibrational', 'modes', 'have', 'opposite', 'trends', 'thus', 'the', 'builtin', 'strains', 'in', 'the', 'materials', 'can', 'be', 'monitored', 'by', 'tracking', 'the', 'relative', 'activities', 'of', 'those', 'modes', 'iii', 'in', 'particular', 'the', 'apeak', 'in', 'singlelayer', 'si', 'and', 'ge', 'disappear', 'under', 'a', 'critical', 'tensile', 'strain', 'iv', 'especially', 'in', 'mono', 'and', 'di', 'atomic', 'singlelayers', 'the', 'shift', 'of', 'the', 'peak', 'frequencies', 'is', 'stronger', 'indication', 'of', 'the', 'strain', 'rather', 'than', 'the', 'change', 'in', 'raman', 'activities', 'v', 'raman', 'active', 'modes', 'of', 'singlelayer', 'rex', '2', 'xs', 'se', 'are', 'almost', 'irresponsive', 'to', 'the', 'applied', 'strain', 'straininduced', 'modifications', 'in', 'the', 'raman', 'spectrum', 'of', '2d', 'materials', 'in', 'terms', 'of', 'the', 'peak', 'positions', 'and', 'the', 'relative', 'raman', 'activities', 'of', 'the', 'modes', 'could', 'be', 'a', 'convenient', 'tool', 'for', 'characterization']] | [-0.13736476659139185, 0.2131061405812443, -0.03837087535038944, -0.03978079110075018, -0.01031044412126226, -0.12988196350898928, 0.08735869937439524, 0.45702420023239054, -0.27834195970288383, -0.22605140766755666, -0.0036886327533642827, -0.30810477246499457, -0.1627598508146384, 0.19419598166601318, 0.04549471081909834, 0.02493484476934324, -0.005400079920428906, -0.05276230837081082, -0.06085723697018072, -0.1621776927015369, 0.22267168310086874, 0.08483885833772861, 0.417551550508799, 0.014495742004375764, -0.03761342789324539, 0.022232656488504032, 0.044547355762501885, 0.028368157257383328, -0.14392167672620296, 0.08558090531015636, 0.30282549880515625, -0.0927524493091235, 0.2288345349290501, -0.470805315457514, -0.2058606165184273, -0.014836680277590573, 0.10482042755322504, 0.13950787707545323, -0.017940006550441173, -0.2670677361018973, 0.06550258076162148, -0.07649973044679523, -0.09305419169531327, -0.09175169729657048, 0.010360875994549684, 0.016628722616380865, -0.24979513544055204, 0.13808597047190885, 0.03652607803421936, 0.13511551246545647, -0.17188822380178806, -0.13161391209175377, -0.12419387519081516, 0.061509574545542955, 0.09842594583757151, -0.0021456535982841986, 0.24632186090333114, -0.10046599294562157, -0.1178888513941662, 0.41388352568398157, -0.058664867163746685, -0.05761635505872386, 0.14914733730918636, -0.15153539218935427, -0.06578682133954425, 0.17550972342751567, 0.1494907080719989, 0.09286275669497601, -0.08047114773565171, 0.024242689000206482, 0.07545321219505839, 0.15597130375874552, 0.09536222886885583, 0.08122953350801392, 0.19802262942125728, 0.13588123820679068, 0.012830877930954346, 0.12127430558036925, -0.15336077210219726, 0.08278370049331885, -0.224364434973606, -0.16819583708685226, -0.18508257715790688, 0.03819030025417771, -0.09505755336403734, -0.15639183388678665, 0.4511910691477747, 0.0735634174440674, 0.1360633551904223, -0.038563547276348864, 0.21872261814084523, 0.11904052462013906, 0.10005962608770524, -0.012432051156051633, 0.35698184668046745, 0.18005135001711794, 0.11553609054050104, -0.28866875966595956, 0.05676998988125513, -0.04657952275328003] |
1,803.01233 | Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase
Procrustes Flow | We revisit the inductive matrix completion problem that aims to recover a
rank-$r$ matrix with ambient dimension $d$ given $n$ features as the side prior
information. The goal is to make use of the known $n$ features to reduce sample
and computational complexities. We present and analyze a new gradient-based
non-convex optimization algorithm that converges to the true underlying matrix
at a linear rate with sample complexity only linearly depending on $n$ and
logarithmically depending on $d$. To the best of our knowledge, all previous
algorithms either have a quadratic dependency on the number of features in
sample complexity or a sub-linear computational convergence rate. In addition,
we provide experiments on both synthetic and real world data to demonstrate the
effectiveness of our proposed algorithm.
| stat.ML cs.LG | we revisit the inductive matrix completion problem that aims to recover a rankr matrix with ambient dimension d given n features as the side prior information the goal is to make use of the known n features to reduce sample and computational complexities we present and analyze a new gradientbased nonconvex optimization algorithm that converges to the true underlying matrix at a linear rate with sample complexity only linearly depending on n and logarithmically depending on d to the best of our knowledge all previous algorithms either have a quadratic dependency on the number of features in sample complexity or a sublinear computational convergence rate in addition we provide experiments on both synthetic and real world data to demonstrate the effectiveness of our proposed algorithm | [['we', 'revisit', 'the', 'inductive', 'matrix', 'completion', 'problem', 'that', 'aims', 'to', 'recover', 'a', 'rankr', 'matrix', 'with', 'ambient', 'dimension', 'd', 'given', 'n', 'features', 'as', 'the', 'side', 'prior', 'information', 'the', 'goal', 'is', 'to', 'make', 'use', 'of', 'the', 'known', 'n', 'features', 'to', 'reduce', 'sample', 'and', 'computational', 'complexities', 'we', 'present', 'and', 'analyze', 'a', 'new', 'gradientbased', 'nonconvex', 'optimization', 'algorithm', 'that', 'converges', 'to', 'the', 'true', 'underlying', 'matrix', 'at', 'a', 'linear', 'rate', 'with', 'sample', 'complexity', 'only', 'linearly', 'depending', 'on', 'n', 'and', 'logarithmically', 'depending', 'on', 'd', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'all', 'previous', 'algorithms', 'either', 'have', 'a', 'quadratic', 'dependency', 'on', 'the', 'number', 'of', 'features', 'in', 'sample', 'complexity', 'or', 'a', 'sublinear', 'computational', 'convergence', 'rate', 'in', 'addition', 'we', 'provide', 'experiments', 'on', 'both', 'synthetic', 'and', 'real', 'world', 'data', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'proposed', 'algorithm']] | [-0.07185041484236718, 0.0036672319266945123, -0.0555435702111572, 0.026253101971931755, -0.10975418255105615, -0.14177305022999645, 0.09319622459076345, 0.3759443009197712, -0.28055286034941673, -0.34140954015031455, 0.12664907449297608, -0.2817154266387224, -0.16834075966104864, 0.1709126284364611, -0.07466776148974895, 0.08868123312294483, 0.05981362519413233, 0.07566849119053222, -0.09026336823031306, -0.35719778947532177, 0.2913588848337531, 0.05464166339300573, 0.2867588405609131, 0.007375842522829771, 0.10430730879772454, -0.01347690261155367, -0.03695294006448239, 0.0156195322945714, -0.090281635651947, 0.12321061739791185, 0.2663430561572313, 0.21315201587602498, 0.28212668415904046, -0.42198435316147515, -0.16923675329983234, 0.1274613013388589, 0.131049798338674, 0.09490156917273998, -0.03255934734642506, -0.21143802757561206, 0.11286321666184813, -0.07632400418817997, -0.07272387140616775, -0.09607793940417468, 0.0036973961517214773, -0.004942035719752312, -0.30821479664742946, 0.02218230159766972, 0.058244997803121805, 0.021139322854578493, -0.031455827297642826, -0.16780109170079233, 0.042798524312675, 0.10121834383998066, 0.04055408941023052, 0.032961917570792136, 0.11513280779123307, -0.10498153174668551, -0.13181965009495616, 0.3361482732407749, -0.08857692322693765, -0.22015712771378457, 0.2197222682237625, -0.12748099377006292, -0.11939554007072002, 0.14567064283974468, 0.25464113045856357, 0.14354087743163108, -0.07162062152475118, 0.13941644586063923, -0.06372516217082738, 0.2316530561596155, 0.013747487715445459, 0.028120686795562507, 0.05999306060560047, 0.17707489615306257, 0.11526999869197607, 0.15928454321995378, -0.06730057863146066, -0.06916336297243833, -0.2756457246169448, -0.12999337781220674, -0.2572449814090505, 0.03397449356596917, -0.1523242060164921, -0.13829355961084366, 0.36983293563872577, 0.173319087266922, 0.2767544155605137, 0.15876107835769654, 0.3216874710470438, 0.04548923188913614, 0.02594866765290499, 0.1233099754974246, 0.16411238405667244, 0.10121387450397015, 0.06817980588041246, -0.2594767353180796, 0.09865494361892342, 0.0685435445047915] |
1,803.01234 | Real-Time Quantum Dynamics of Long-Range Electronic Excitation Transfer
in Plasmonic Nanoantennas | Using large-scale, real-time quantum dynamics calculations, we present a
detailed analysis of electronic excitation transfer (EET) mechanisms in a
multi-particle plasmonic nanoantenna system. Specifically, we utilize
real-time, time-dependent, density functional tight binding (RT-TDDFTB) to
provide a quantum-mechanical description (at an electronic/atomistic level of
detail) for characterizing and analyzing these systems, without recourse to
classical approximations. We also demonstrate highly long-range electronic
couplings in these complex systems and find that the range of these couplings
is more than twice the conventional cutoff limit considered by FRET based
approaches. Furthermore, we attribute these unusually long-ranged electronic
couplings to the coherent oscillations of conduction electrons in plasmonic
nanoparticles. This long-range nature of plasmonic interactions has important
ramifications for EET - in particular, we show that the commonly used
"nearest-neighbor" FRET model is inadequate for accurately characterizing EET
even in simple plasmonic antenna systems. These findings provide a real-time,
quantum-mechanical perspective for understanding EET mechanisms and provide
guidance in enhancing plasmonic properties in artificial light-harvesting
systems.
| cond-mat.mes-hall cond-mat.mtrl-sci physics.chem-ph | using largescale realtime quantum dynamics calculations we present a detailed analysis of electronic excitation transfer eet mechanisms in a multiparticle plasmonic nanoantenna system specifically we utilize realtime timedependent density functional tight binding rttddftb to provide a quantummechanical description at an electronicatomistic level of detail for characterizing and analyzing these systems without recourse to classical approximations we also demonstrate highly longrange electronic couplings in these complex systems and find that the range of these couplings is more than twice the conventional cutoff limit considered by fret based approaches furthermore we attribute these unusually longranged electronic couplings to the coherent oscillations of conduction electrons in plasmonic nanoparticles this longrange nature of plasmonic interactions has important ramifications for eet in particular we show that the commonly used nearestneighbor fret model is inadequate for accurately characterizing eet even in simple plasmonic antenna systems these findings provide a realtime quantummechanical perspective for understanding eet mechanisms and provide guidance in enhancing plasmonic properties in artificial lightharvesting systems | [['using', 'largescale', 'realtime', 'quantum', 'dynamics', 'calculations', 'we', 'present', 'a', 'detailed', 'analysis', 'of', 'electronic', 'excitation', 'transfer', 'eet', 'mechanisms', 'in', 'a', 'multiparticle', 'plasmonic', 'nanoantenna', 'system', 'specifically', 'we', 'utilize', 'realtime', 'timedependent', 'density', 'functional', 'tight', 'binding', 'rttddftb', 'to', 'provide', 'a', 'quantummechanical', 'description', 'at', 'an', 'electronicatomistic', 'level', 'of', 'detail', 'for', 'characterizing', 'and', 'analyzing', 'these', 'systems', 'without', 'recourse', 'to', 'classical', 'approximations', 'we', 'also', 'demonstrate', 'highly', 'longrange', 'electronic', 'couplings', 'in', 'these', 'complex', 'systems', 'and', 'find', 'that', 'the', 'range', 'of', 'these', 'couplings', 'is', 'more', 'than', 'twice', 'the', 'conventional', 'cutoff', 'limit', 'considered', 'by', 'fret', 'based', 'approaches', 'furthermore', 'we', 'attribute', 'these', 'unusually', 'longranged', 'electronic', 'couplings', 'to', 'the', 'coherent', 'oscillations', 'of', 'conduction', 'electrons', 'in', 'plasmonic', 'nanoparticles', 'this', 'longrange', 'nature', 'of', 'plasmonic', 'interactions', 'has', 'important', 'ramifications', 'for', 'eet', 'in', 'particular', 'we', 'show', 'that', 'the', 'commonly', 'used', 'nearestneighbor', 'fret', 'model', 'is', 'inadequate', 'for', 'accurately', 'characterizing', 'eet', 'even', 'in', 'simple', 'plasmonic', 'antenna', 'systems', 'these', 'findings', 'provide', 'a', 'realtime', 'quantummechanical', 'perspective', 'for', 'understanding', 'eet', 'mechanisms', 'and', 'provide', 'guidance', 'in', 'enhancing', 'plasmonic', 'properties', 'in', 'artificial', 'lightharvesting', 'systems']] | [-0.1589472783640109, 0.11510008805712946, -0.04397514376843512, 0.13872885021436726, -0.01842658081730394, -0.17036201316957017, 0.0349709319431077, 0.4392026202436888, -0.2250704915942214, -0.2931573936165129, -0.04305235361211798, -0.2706569566800692, -0.24727107468866538, 0.2150869623277594, 0.039289773008405415, 0.05617015398401802, 0.08156067486295956, -0.06618918067246307, -0.02343069213594796, -0.12539681541710015, 0.2673370244256777, 0.08482198916161843, 0.27821316158855863, 0.14207319010915997, 0.03983112308343158, 0.056328579070304266, 0.08090991704759873, -0.04490145889210439, -0.14195616303351136, 0.18098428006043787, 0.31066575608766817, 0.0007626097590762114, 0.25899507288100587, -0.513634555604098, -0.27104181422465395, 0.05222954546905316, 0.18989667859101966, 0.1813509236587762, -0.07291977864489876, -0.2522045562758386, 0.03895033514214996, -0.15669794402483547, -0.11746366714923964, -0.1800922221070706, -0.01626462415856479, 0.026671839965091513, -0.24653783121655853, 0.07694064728083212, 0.049836283010787935, 0.09754438928006116, -0.09228785306218215, -0.06774568991990373, 0.01722004116547979, 0.09664627126236476, -0.05120777768235209, -0.07396344392053027, 0.19873571161871906, -0.1361167575715918, -0.1538938159560902, 0.40674840973444143, -0.029732565715218567, -0.18537460813451112, 0.23092963435370825, -0.13832378603881165, -0.10527734194352122, 0.1295564599937771, 0.18268526400990034, 0.10350647737395088, -0.2024693591344469, 0.03850777599716752, 0.0467413938714121, 0.19978602810428953, 0.0156361794709843, 0.14960908548871302, 0.22510323369196095, 0.21832189844564664, 0.02702943722969331, 0.1201069805794542, -0.05390052618799327, -0.12223693981192678, -0.19730084508938608, -0.12721132087366036, -0.1838555884365953, 0.08301147559449756, -0.07181035128611347, -0.14690501412739917, 0.3884122290666092, 0.19431180939914472, 0.13995505271643494, 0.0004033185541629791, 0.2858449085776653, 0.1263291642110818, 0.03257873615706867, 0.015252843177028047, 0.27335094803440496, 0.11838960201397492, 0.09335890008171774, -0.28790292287180963, 0.02608688203647217, 0.0006079961378830221] |
1,803.01235 | Simplified landscapes for optimization of shaken lattice interferometry | Motivated by recent results using shaken optical lattices to perform atom
interferometry, we explore splitting of an atom cloud trapped in a
phase-modulated ("shaken") optical lattice. Using a simple analytic model we
are able to show that we can obtain the simplest case of $\pm2\hbar
k_\mathrm{L}$ splitting via single-frequency shaking. This is confirmed both
via simulation and experiment. Furthermore, we are able to split with a
relative phase $\theta$ between the two split arms of $0$ or $\pi$ depending on
our shaking frequency. Addressing higher-order splitting, we determine that
$\pm6\hbar k_\mathrm{L}$ splitting is sufficient to be able to accelerate the
atoms in counter-propagating lattices. Finally, we show that we can use a
genetic algorithm to optimize $\pm4\hbar k_\mathrm{L}$ and $\pm6\hbar
k_\mathrm{L}$ splitting to within $\approx0.1\%$ by restricting our
optimization to the resonance frequencies corresponding to single- and
two-photon transitions between Bloch bands.
| quant-ph physics.atom-ph | motivated by recent results using shaken optical lattices to perform atom interferometry we explore splitting of an atom cloud trapped in a phasemodulated shaken optical lattice using a simple analytic model we are able to show that we can obtain the simplest case of pm2hbar k_mathrml splitting via singlefrequency shaking this is confirmed both via simulation and experiment furthermore we are able to split with a relative phase theta between the two split arms of 0 or pi depending on our shaking frequency addressing higherorder splitting we determine that pm6hbar k_mathrml splitting is sufficient to be able to accelerate the atoms in counterpropagating lattices finally we show that we can use a genetic algorithm to optimize pm4hbar k_mathrml and pm6hbar k_mathrml splitting to within approx01 by restricting our optimization to the resonance frequencies corresponding to single and twophoton transitions between bloch bands | [['motivated', 'by', 'recent', 'results', 'using', 'shaken', 'optical', 'lattices', 'to', 'perform', 'atom', 'interferometry', 'we', 'explore', 'splitting', 'of', 'an', 'atom', 'cloud', 'trapped', 'in', 'a', 'phasemodulated', 'shaken', 'optical', 'lattice', 'using', 'a', 'simple', 'analytic', 'model', 'we', 'are', 'able', 'to', 'show', 'that', 'we', 'can', 'obtain', 'the', 'simplest', 'case', 'of', 'pm2hbar', 'k_mathrml', 'splitting', 'via', 'singlefrequency', 'shaking', 'this', 'is', 'confirmed', 'both', 'via', 'simulation', 'and', 'experiment', 'furthermore', 'we', 'are', 'able', 'to', 'split', 'with', 'a', 'relative', 'phase', 'theta', 'between', 'the', 'two', 'split', 'arms', 'of', '0', 'or', 'pi', 'depending', 'on', 'our', 'shaking', 'frequency', 'addressing', 'higherorder', 'splitting', 'we', 'determine', 'that', 'pm6hbar', 'k_mathrml', 'splitting', 'is', 'sufficient', 'to', 'be', 'able', 'to', 'accelerate', 'the', 'atoms', 'in', 'counterpropagating', 'lattices', 'finally', 'we', 'show', 'that', 'we', 'can', 'use', 'a', 'genetic', 'algorithm', 'to', 'optimize', 'pm4hbar', 'k_mathrml', 'and', 'pm6hbar', 'k_mathrml', 'splitting', 'to', 'within', 'approx01', 'by', 'restricting', 'our', 'optimization', 'to', 'the', 'resonance', 'frequencies', 'corresponding', 'to', 'single', 'and', 'twophoton', 'transitions', 'between', 'bloch', 'bands']] | [-0.12102719956496055, 0.1655026119299599, -0.06487679000997888, 0.034416355260992015, -0.07500461049283436, -0.15509915408556876, 0.10407751365699738, 0.4823276847600937, -0.26683131704592833, -0.2602631913875972, 0.036396248633905816, -0.23024247063364348, -0.13805269142039175, 0.1908970710693224, 0.014353332935623232, 0.01540406293951083, 0.054689557518492846, -0.04954937169922219, -0.04857606991646352, -0.22170361822076223, 0.2835976128277463, 0.030173031414143632, 0.2385215152905363, 0.04700039011979665, 0.07901578778198556, 0.013256510685913372, 0.05624722981103358, -0.02059017923876535, -0.1364096403530562, 0.1271472012563406, 0.2256530714187555, 0.042824753199069615, 0.2104300234088863, -0.42443351820111275, -0.15092944784386866, 0.12095809287216136, 0.16861754633735973, 0.1755068853608859, -0.03421352858962221, -0.3049301699839829, 0.05895008564508264, -0.13836174116692046, -0.10870962272452163, -0.1471232649325258, -0.028947764629687088, 0.04563170704953508, -0.3165078042210012, 0.01994008780794515, 0.00970954576742783, 0.03926430322040898, -0.035490265915818185, -0.06911310011460244, 0.003059451586391399, 0.08381472876383181, -0.0340511332902099, 0.017444556059342795, 0.09775880858828516, -0.04026855541135022, -0.13939440026339414, 0.39754977651223866, -0.13709324512814602, -0.17539994288370878, 0.19866993243846556, -0.14079527705536643, -0.06297917931300143, 0.10371559035822588, 0.16743988155697784, 0.09412899387298503, -0.08216878958130795, 0.006574329453186416, -0.04382225326464876, 0.20449456284868706, 0.11878855053868577, -0.013098330846886434, 0.1811169144862831, 0.13246588536750767, 0.07249792217465954, 0.19685138929449697, -0.1308506792124388, -0.09993065103459968, -0.24112495362920605, -0.09197053964000088, -0.18381023209919964, 0.0357587830858656, 0.01722753849384574, -0.08356841914760678, 0.38694470471608033, 0.14773756501507823, 0.2178223225814493, -0.009209801631885162, 0.30828498599483917, 0.12614584564036466, 0.05608306987130124, 0.018154408617377066, 0.2690299689260217, 0.1351252973832163, 0.017617854272838736, -0.28002107881711447, -0.07302735736880424, 0.03402065754820849] |
1,803.01236 | Vocal effort modulates the motor planning of short speech structures | Speech requires programming the sequence of vocal gestures that produce the
sounds of words. Here we explored the timing of this program by asking our
participants to pronounce, as quickly as possible, a sequence of
consonant-consonant-vowel (CCV) structures appearing on screen. We measured the
delay between visual presentation and voice onset. In the case of plosive
consonants, produced by sharp and well defined movements of the vocal tract, we
found that delays are positively correlated with the duration of the transition
between consonants. We then used a battery of statistical tests and
mathematical vocal models to show that delays reflect the motor planning of
CCVs and transitions are proxy indicators of the vocal effort needed to produce
them. These results support that the effort required to produce the sequence of
movements of a vocal gesture modulates the onset of the motor plan.
| q-bio.NC physics.bio-ph | speech requires programming the sequence of vocal gestures that produce the sounds of words here we explored the timing of this program by asking our participants to pronounce as quickly as possible a sequence of consonantconsonantvowel ccv structures appearing on screen we measured the delay between visual presentation and voice onset in the case of plosive consonants produced by sharp and well defined movements of the vocal tract we found that delays are positively correlated with the duration of the transition between consonants we then used a battery of statistical tests and mathematical vocal models to show that delays reflect the motor planning of ccvs and transitions are proxy indicators of the vocal effort needed to produce them these results support that the effort required to produce the sequence of movements of a vocal gesture modulates the onset of the motor plan | [['speech', 'requires', 'programming', 'the', 'sequence', 'of', 'vocal', 'gestures', 'that', 'produce', 'the', 'sounds', 'of', 'words', 'here', 'we', 'explored', 'the', 'timing', 'of', 'this', 'program', 'by', 'asking', 'our', 'participants', 'to', 'pronounce', 'as', 'quickly', 'as', 'possible', 'a', 'sequence', 'of', 'consonantconsonantvowel', 'ccv', 'structures', 'appearing', 'on', 'screen', 'we', 'measured', 'the', 'delay', 'between', 'visual', 'presentation', 'and', 'voice', 'onset', 'in', 'the', 'case', 'of', 'plosive', 'consonants', 'produced', 'by', 'sharp', 'and', 'well', 'defined', 'movements', 'of', 'the', 'vocal', 'tract', 'we', 'found', 'that', 'delays', 'are', 'positively', 'correlated', 'with', 'the', 'duration', 'of', 'the', 'transition', 'between', 'consonants', 'we', 'then', 'used', 'a', 'battery', 'of', 'statistical', 'tests', 'and', 'mathematical', 'vocal', 'models', 'to', 'show', 'that', 'delays', 'reflect', 'the', 'motor', 'planning', 'of', 'ccvs', 'and', 'transitions', 'are', 'proxy', 'indicators', 'of', 'the', 'vocal', 'effort', 'needed', 'to', 'produce', 'them', 'these', 'results', 'support', 'that', 'the', 'effort', 'required', 'to', 'produce', 'the', 'sequence', 'of', 'movements', 'of', 'a', 'vocal', 'gesture', 'modulates', 'the', 'onset', 'of', 'the', 'motor', 'plan']] | [-0.09448409660752596, 0.11315335424151271, -0.07062706047935145, 0.0784685783977953, -0.09357198635448835, -0.1333682991431228, 0.059084553671501845, 0.4244811705380146, -0.24709154249035886, -0.35838549145306126, 0.06280632647935168, -0.2814445790402325, -0.19967756007931062, 0.21159898342074093, -0.1246511400444433, 0.06862654432770796, 0.08131197938429457, 0.09004000940892314, 0.011184707165479526, -0.19568892312901362, 0.24871650918087523, 0.027722108051446932, 0.23688942642017666, 0.02368407240968996, 0.11458068704190996, -0.04401739755578871, -0.054726284605567346, -0.03927911202523059, -0.10445094049895748, 0.14028505587152074, 0.2951783170536146, 0.19592009656064743, 0.2750621672195848, -0.4482730616682342, -0.17197389681823552, 0.08803482348199136, 0.10733587932772934, 0.0805893005137997, -0.008274099516399604, -0.3319972361820484, 0.07364690348040312, -0.15205220978657183, -0.0108062734428261, -0.03151821669058076, 0.034034892244796666, 0.07600901738540934, -0.22151199349235476, 0.06909608202653804, 0.0862733719616829, 0.11044399866368622, -0.06768319719371253, -0.043090232639640035, -0.030952006027343618, 0.25204087766219996, 0.11582008333976514, 0.037105407438606824, 0.1791039272710415, -0.1467084037672196, -0.12460435112339578, 0.3855548693266298, -0.0383474387482108, -0.17455346444621683, 0.1998201323889329, -0.1251249123298164, -0.07614376292497452, 0.12455303151759185, 0.20344013597017951, 0.08351804065251989, -0.11797489589828598, -0.10152243840649525, 0.008720358457815434, 0.24957870317489972, 0.10104921630118043, -0.021929853525944055, 0.19424295189923474, 0.17150801394849882, -0.018484660830082638, 0.1586964120464732, -0.08572590948169818, -0.013201411990407256, -0.2843203265851896, -0.12080883279974972, -0.11359840811097197, -0.03288569769106938, -0.03187339476301401, -0.16629798402677157, 0.4334816406680537, 0.17794655139025833, 0.18593863166170194, 0.10108225887441742, 0.2847422632288986, 0.049097261340856284, 0.05523661096480542, 0.005135244473889803, 0.19159992342881327, 0.040147017118787126, 0.13616226386678007, -0.267384194107061, 0.12910222317358214, 0.025639310063395118] |
1,803.01237 | Histogram Sort with Sampling | To minimize data movement, state-of-the-art parallel sorting algorithms use
techniques based on sampling and histogramming to partition keys prior to
redistribution. Sampling enables partitioning to be done using a representative
subset of the keys, while histogramming enables evaluation and iterative
improvement of a given partition. We introduce Histogram sort with sampling
(HSS), which combines sampling and iterative histogramming to find high quality
partitions with minimal data movement and high practical performance. Compared
to the best known (recently introduced) algorithm for finding these partitions,
our algorithm requires a factor of {\Theta}(log(p)/ log log(p)) less
communication, and substantially less when compared to standard variants of
Sample sort and Histogram sort. We provide a distributed memory implementation
of the proposed algorithm, compare its performance to two existing
implementations, and provide a brief application study showing benefit of the
new algorithm.
| cs.DC cs.DS | to minimize data movement stateoftheart parallel sorting algorithms use techniques based on sampling and histogramming to partition keys prior to redistribution sampling enables partitioning to be done using a representative subset of the keys while histogramming enables evaluation and iterative improvement of a given partition we introduce histogram sort with sampling hss which combines sampling and iterative histogramming to find high quality partitions with minimal data movement and high practical performance compared to the best known recently introduced algorithm for finding these partitions our algorithm requires a factor of thetalogp log logp less communication and substantially less when compared to standard variants of sample sort and histogram sort we provide a distributed memory implementation of the proposed algorithm compare its performance to two existing implementations and provide a brief application study showing benefit of the new algorithm | [['to', 'minimize', 'data', 'movement', 'stateoftheart', 'parallel', 'sorting', 'algorithms', 'use', 'techniques', 'based', 'on', 'sampling', 'and', 'histogramming', 'to', 'partition', 'keys', 'prior', 'to', 'redistribution', 'sampling', 'enables', 'partitioning', 'to', 'be', 'done', 'using', 'a', 'representative', 'subset', 'of', 'the', 'keys', 'while', 'histogramming', 'enables', 'evaluation', 'and', 'iterative', 'improvement', 'of', 'a', 'given', 'partition', 'we', 'introduce', 'histogram', 'sort', 'with', 'sampling', 'hss', 'which', 'combines', 'sampling', 'and', 'iterative', 'histogramming', 'to', 'find', 'high', 'quality', 'partitions', 'with', 'minimal', 'data', 'movement', 'and', 'high', 'practical', 'performance', 'compared', 'to', 'the', 'best', 'known', 'recently', 'introduced', 'algorithm', 'for', 'finding', 'these', 'partitions', 'our', 'algorithm', 'requires', 'a', 'factor', 'of', 'thetalogp', 'log', 'logp', 'less', 'communication', 'and', 'substantially', 'less', 'when', 'compared', 'to', 'standard', 'variants', 'of', 'sample', 'sort', 'and', 'histogram', 'sort', 'we', 'provide', 'a', 'distributed', 'memory', 'implementation', 'of', 'the', 'proposed', 'algorithm', 'compare', 'its', 'performance', 'to', 'two', 'existing', 'implementations', 'and', 'provide', 'a', 'brief', 'application', 'study', 'showing', 'benefit', 'of', 'the', 'new', 'algorithm']] | [-0.06974714451387305, -0.017777911835925326, -0.09524579650914188, 0.0491297031095361, -0.11456957700497963, -0.16562069830936654, 0.13367672408725517, 0.43238772943903525, -0.24849883353967658, -0.3895044947481331, 0.08768351442139487, -0.23173116257427917, -0.11499559239703505, 0.21034274854943813, -0.1288558640380335, 0.10289367555378703, 0.11475753437672906, -0.01221987738587332, -0.07933680382420254, -0.3183458196598461, 0.21560122381796484, 0.09823520372703891, 0.33740957202184396, -0.031363460618783444, 0.11077405105392887, 0.02825135677737896, -0.0886589443886324, 0.010041703949408495, -0.09754646085275454, 0.1510590911253958, 0.2337095818725442, 0.22035962053204833, 0.2906544302343665, -0.40122547069784237, -0.1409414659582955, 0.09831579730876804, 0.17391802861546987, 0.09542673436483122, -0.07904596392130342, -0.23685940882355414, 0.12588958196626182, -0.16010446109987028, -0.025695555754389393, -0.14238348997691097, -0.04649333598996129, 0.03258365968213184, -0.32935213550980036, 0.004284702388651888, 0.010791761245106017, 0.030771910108502627, 0.026820886886151342, -0.18110399911700584, 0.08218001342645627, 0.09403549541093525, 0.004672899395004874, 0.06100300527417429, 0.1249642526587088, -0.06384266392834594, -0.1937833416467423, 0.3845987677820684, -0.011665409578092615, -0.19253514435053254, 0.1869730236888726, -0.012032405086382128, -0.14165378930321074, 0.15012039807419675, 0.17802822467552581, 0.10069561065927915, -0.11342895862285599, 0.009703249818224268, 0.026903604922528544, 0.17676162140389137, 0.06866881598526721, 0.04027583248064141, 0.089354724258609, 0.219592350834693, 0.10279639842851526, 0.19456226135491092, -0.0996765757085728, -0.12850192865795074, -0.19522604250403888, -0.16717214865938707, -0.20851909086409517, -0.029485314187374625, -0.14437216434635047, -0.18908091692034812, 0.38144597541266945, 0.22315576168544152, 0.1969912930576624, 0.13750541764260132, 0.3794368934108848, 0.03713159888095962, 0.09597098804078996, 0.14354885226416894, 0.10021071340152583, 0.06713440808851052, 0.061121030465823, -0.18163394898789087, 0.06810286523335997, 0.06801079726873842] |
1,803.01238 | Dynamic risk measure for BSVIE with jumps and semimartingale issues | Risk measure is a fundamental concept in finance and in the insurance
industry, it is used to adjust life insurance rates. In this current paper, we
will study dynamic risk measures by means of backward stochastic Volterra
integral equations (BSVIEs) with jumps. We prove a comparison theorem for such
a type of equations. Since the solution of a BSVIEs is not a semimartingale in
general, we will discuss some particular semimartingale issues.
| math.OC | risk measure is a fundamental concept in finance and in the insurance industry it is used to adjust life insurance rates in this current paper we will study dynamic risk measures by means of backward stochastic volterra integral equations bsvies with jumps we prove a comparison theorem for such a type of equations since the solution of a bsvies is not a semimartingale in general we will discuss some particular semimartingale issues | [['risk', 'measure', 'is', 'a', 'fundamental', 'concept', 'in', 'finance', 'and', 'in', 'the', 'insurance', 'industry', 'it', 'is', 'used', 'to', 'adjust', 'life', 'insurance', 'rates', 'in', 'this', 'current', 'paper', 'we', 'will', 'study', 'dynamic', 'risk', 'measures', 'by', 'means', 'of', 'backward', 'stochastic', 'volterra', 'integral', 'equations', 'bsvies', 'with', 'jumps', 'we', 'prove', 'a', 'comparison', 'theorem', 'for', 'such', 'a', 'type', 'of', 'equations', 'since', 'the', 'solution', 'of', 'a', 'bsvies', 'is', 'not', 'a', 'semimartingale', 'in', 'general', 'we', 'will', 'discuss', 'some', 'particular', 'semimartingale', 'issues']] | [-0.09923300650108205, 0.03945362240645207, -0.0923970899602864, 0.16379909315987284, -0.12715073035926455, -0.09783125505135912, 0.06764558883959479, 0.36956453664849204, -0.32535308728822404, -0.16672930719020465, 0.22338519184591454, -0.27339594562848407, -0.1832646407549166, 0.21782824429424685, -0.23641288083227766, 0.052306484647690214, 0.054373542254325, 0.013348774699908163, -0.0006974148305339946, -0.22253771110748252, 0.30292054057806833, -0.00982855623199915, 0.24815030462600085, 0.05041093235033461, 0.15396583578290624, -0.002620061182824429, -0.0756926661512504, 0.003043169750728541, -0.17363217681284165, 0.1212616440122171, 0.35550362868363866, 0.1306171827632675, 0.4228162814138664, -0.41449720352991587, -0.18058655814578137, 0.16317977541540232, 0.06163496420574827, 0.0717001243481516, -0.03702729777756354, -0.26393198250702377, 0.018875217506623205, -0.19260876972435248, -0.198536321216832, -0.07511944234688094, 0.018912607778070703, 0.08850614287722339, -0.3059130249506173, 0.06355678227151253, 0.05315674281316913, 0.04198322494630702, -0.09182292651126368, -0.06795498828190223, 0.030313875345099304, 0.06051323899171419, 0.1124608335570277, -0.04075357493840986, 0.11163747222033432, -0.09279014089649233, -0.17327815756693277, 0.341234356811684, -0.12206272818406837, -0.2513837011841436, 0.12744970080287507, -0.1636431662999611, -0.1819202266762861, 0.07691421225253078, 0.2028573187482026, 0.10832814761670306, -0.2742239082387338, 0.1177857752053468, -0.025633894928937986, 0.09233354060496721, 0.05723655990894056, -0.006088897627099262, 0.10200382946317808, 0.20224490936056505, 0.1482529855113373, 0.12205263933477302, -0.01049249619892281, -0.15166524335897216, -0.32456110490279066, -0.23423882397926515, -0.11657534935511649, 0.10948524382891062, -0.07360574198678983, -0.16827123771266392, 0.36231606795142096, 0.1738278202052849, 0.06546946993977246, 0.08657891059475434, 0.24732738845826438, 0.2214051900146943, -0.035242295899984635, 0.058480800420511514, 0.16734788405988688, 0.10969107631697422, 0.19227102128530127, -0.12770916704579982, 0.14057667116867378, 0.09150003222748637] |
1,803.01239 | Krull dimension and regularity of binomial edge ideals of block graphs | We give a lower bound for the Castelnuovo-Mumford regularity of binomial edge
ideals of block graphs by computing the two distinguished extremal Betti
numbers of a new family of block graphs, called flower graphs. Moreover, we
present a linear time algorithm to compute the Castelnuovo-Mumford regularity
and Krull dimension of binomial edge ideals of block graphs.
| math.AC math.CO | we give a lower bound for the castelnuovomumford regularity of binomial edge ideals of block graphs by computing the two distinguished extremal betti numbers of a new family of block graphs called flower graphs moreover we present a linear time algorithm to compute the castelnuovomumford regularity and krull dimension of binomial edge ideals of block graphs | [['we', 'give', 'a', 'lower', 'bound', 'for', 'the', 'castelnuovomumford', 'regularity', 'of', 'binomial', 'edge', 'ideals', 'of', 'block', 'graphs', 'by', 'computing', 'the', 'two', 'distinguished', 'extremal', 'betti', 'numbers', 'of', 'a', 'new', 'family', 'of', 'block', 'graphs', 'called', 'flower', 'graphs', 'moreover', 'we', 'present', 'a', 'linear', 'time', 'algorithm', 'to', 'compute', 'the', 'castelnuovomumford', 'regularity', 'and', 'krull', 'dimension', 'of', 'binomial', 'edge', 'ideals', 'of', 'block', 'graphs']] | [-0.22393369714596442, 0.05129360354372433, -0.05298772015209709, 0.08416434793200876, -0.10961780093826487, -0.1954156327410601, -0.00471290759326491, 0.2926014506790255, -0.35949677428496735, -0.22373832163533994, 0.15129758726938494, -0.26813897443935275, -0.11463193731781628, 0.1422490938566625, -0.1371162486445558, 0.10677272849716246, 0.0845320575837312, 0.07720822884169008, 0.020697260333690792, -0.3317093228189541, 0.38939499164864955, 0.013225811383953052, 0.2072625945355477, 0.07757201948801853, 0.09418634292004364, -0.018716096512175033, -0.02708947841477181, 0.03537961020733097, -0.31060817052743267, 0.21693187882192433, 0.2966838959005794, 0.12622201740824884, 0.20847752916493587, -0.40376449143514037, -0.049603061010462364, 0.22604050106435483, 0.1384454461097318, 0.0498228930269501, -0.007656706114565688, -0.15547289799100586, 0.14172903810062312, -0.1675071006507746, -0.16564826571681937, -0.05643635984909322, 0.046664813899302056, 0.02841197995335928, -0.32127977300634875, -0.008787407947238535, 0.16433964649747526, 0.1254080094596637, 0.06013827383451696, -0.1913375542499125, -0.06985642607989055, 0.010898990845557168, -0.11269869678653777, -0.12646855853797337, 0.051068710845096836, -0.13372969181675995, -0.29411877693408833, 0.24304632723942632, -0.019714816406901394, -0.16658895472729845, 0.05947733171550291, -0.17721740035839112, -0.1660137145039958, 0.10153280043076458, 0.159395897295326, 0.19431388843804598, 0.007764665801265177, 0.16415555415005656, -0.18616269026616855, 0.006792022780116115, 0.20231110674129532, 0.08637125864126054, 0.07271065985384796, 0.08430553370687578, 0.18782757721575244, 0.2693880310980603, -0.011826088252876486, 0.02191439112565214, -0.2704393278275217, -0.20815017752569734, -0.2764407254788758, 0.0847536999208387, -0.2837048362164621, -0.2934634237483676, 0.5075397944476988, 0.09612520401632148, 0.1916839764786086, 0.22412057896144688, 0.20066184284431593, 0.024388736379998072, 0.0072778005019894666, 0.23425144221567148, 0.05026199477392116, 0.23717396636909274, -0.0027896072549213257, -0.09356794343329966, 0.08167287216721368, 0.30911132511183886] |
1,803.0124 | An extension of Azzalini's method | The aim of this paper is to extend Azzalini's method. This extension is done
in two stages: consider two dependent and non-identically distributed random
variables say $X_1$ and $X_2$; model the dependence between $X_1$ and $X_2$ by
a copula. To illustrate the new method, we assume $X_1$ and $X_2$ are
exponential random variables. This assumption leads to a new distribution
called the Generalized Weighted Exponential Distribution (GWED), a
generalization of Gupta and Kundu (2009)'s Weighted Exponential Distribution
(WED). Some mathematical properties of the GWED are derived, and its parameters
estimated by maximum likelihood. The GWED is applied to biochemical data sets
showing its good performance compared to the WED.
| math.ST stat.TH | the aim of this paper is to extend azzalinis method this extension is done in two stages consider two dependent and nonidentically distributed random variables say x_1 and x_2 model the dependence between x_1 and x_2 by a copula to illustrate the new method we assume x_1 and x_2 are exponential random variables this assumption leads to a new distribution called the generalized weighted exponential distribution gwed a generalization of gupta and kundu 2009s weighted exponential distribution wed some mathematical properties of the gwed are derived and its parameters estimated by maximum likelihood the gwed is applied to biochemical data sets showing its good performance compared to the wed | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'extend', 'azzalinis', 'method', 'this', 'extension', 'is', 'done', 'in', 'two', 'stages', 'consider', 'two', 'dependent', 'and', 'nonidentically', 'distributed', 'random', 'variables', 'say', 'x_1', 'and', 'x_2', 'model', 'the', 'dependence', 'between', 'x_1', 'and', 'x_2', 'by', 'a', 'copula', 'to', 'illustrate', 'the', 'new', 'method', 'we', 'assume', 'x_1', 'and', 'x_2', 'are', 'exponential', 'random', 'variables', 'this', 'assumption', 'leads', 'to', 'a', 'new', 'distribution', 'called', 'the', 'generalized', 'weighted', 'exponential', 'distribution', 'gwed', 'a', 'generalization', 'of', 'gupta', 'and', 'kundu', '2009s', 'weighted', 'exponential', 'distribution', 'wed', 'some', 'mathematical', 'properties', 'of', 'the', 'gwed', 'are', 'derived', 'and', 'its', 'parameters', 'estimated', 'by', 'maximum', 'likelihood', 'the', 'gwed', 'is', 'applied', 'to', 'biochemical', 'data', 'sets', 'showing', 'its', 'good', 'performance', 'compared', 'to', 'the', 'wed']] | [-0.11078235354496661, 0.09673349421744773, -0.1377964855658762, 0.08546795517872643, -0.06412396046820037, -0.1396999047394124, 0.047149554300848225, 0.37846698093339115, -0.31604245850184093, -0.23775788048499075, 0.05301023813267879, -0.2633336307950865, -0.13253119814320716, 0.14989707637535526, -0.12242998276546666, 0.07995075321384629, 0.032591414699809404, 0.025161788046975202, -0.05293318006389458, -0.29111842983914965, 0.28932753121886196, 0.0018590415834338157, 0.2636754554354611, -0.04689699832623431, 0.13607498872363, 0.03409462500632732, -0.06451128570388558, -0.01844688291328216, -0.14880455794120465, 0.11728689845207088, 0.18155382950405735, 0.16117986119053232, 0.32303827514000444, -0.36205806396047185, -0.1687121904549112, 0.16528208000391056, 0.14244207773045764, -0.004447887177416765, -0.006986030309093655, -0.2449456040550946, 0.09391938661942857, -0.16130651589141254, -0.13364457509826458, -0.04276614190600471, 0.004346292098522733, 0.11462817247529779, -0.36334621926786703, 0.08320364552344955, 0.10198783008979821, 0.0447498435041613, 0.01149812171773968, -0.1952854006405954, 0.015220394118800076, 0.042433502233198445, 0.04635387202596651, 0.044771416898851, 0.07485908462982112, -0.01889858230598134, -0.09304661712173475, 0.3065273857444798, -0.05082878456429638, -0.24701063632281547, 0.09813648881177085, -0.10742170388870147, -0.15001588858612772, 0.05078158456321652, 0.15163384601815577, 0.1511873718214418, -0.19326377202064618, 0.09768168572357797, -0.05452594776219184, 0.11478954938735915, 0.05415420071862706, -0.003301079026191098, 0.13253941287184048, 0.11198631489068406, 0.035523915001182654, 0.1767920044874516, -0.04175139177983644, -0.12285047234676846, -0.2859792585843542, -0.09977313444454121, -0.21169308054371985, 0.05941647150203449, -0.1503705738377736, -0.14880265451865185, 0.35510058169586395, 0.14000582910322268, 0.25176963141868763, 0.1007886805545983, 0.2361898973743445, 0.09309702939909259, -0.03994215633122063, 0.08601992518525975, 0.11941216361987696, 0.20532419785019865, 0.05601678619058717, -0.16879541718789778, 0.14571591685825122, 0.04811893265113371] |
1,803.01241 | Magnetic shielding of quantum entanglement states | The measure of quantum entanglement is determined for any dimer, either
ferromagnetic or antiferromagnetic, spin-1/2 Heisenberg systems in the presence
of external magnetic field. The physical quantity proposed as a measure of
thermal quantum entanglement is the distance between states defined through the
Hilbert-Schmidt norm. It has been shown that for ferromagnetic systems there is
no entanglement at all. However, although under applied magnetic field,
antiferromagnetic spin-1/2 dimers exhibit entanglement for temperatures below
the decoherence temperature -- the one above which the entanglement vanishes.
In addition to that, the decoherence temperature shows to be proportional to
the exchange coupling constant and independent on the applied magnetic field,
consequently, the entanglement may not be destroyed by external magnetic fields
-- the phenomenon of {\it magnetic shielding effect of quantum entanglement
states}. This effect is discussed for the binuclear nitrosyl iron complex
[Fe$_2$(SC$_3$H$_5$N$_2$)$_2$(NO)$_4$] and it is foreseen that the quantum
entanglement survives even under high magnetic fields of Tesla orders of
magnitude.
| quant-ph cond-mat.mes-hall cond-mat.mtrl-sci cond-mat.str-el hep-th | the measure of quantum entanglement is determined for any dimer either ferromagnetic or antiferromagnetic spin12 heisenberg systems in the presence of external magnetic field the physical quantity proposed as a measure of thermal quantum entanglement is the distance between states defined through the hilbertschmidt norm it has been shown that for ferromagnetic systems there is no entanglement at all however although under applied magnetic field antiferromagnetic spin12 dimers exhibit entanglement for temperatures below the decoherence temperature the one above which the entanglement vanishes in addition to that the decoherence temperature shows to be proportional to the exchange coupling constant and independent on the applied magnetic field consequently the entanglement may not be destroyed by external magnetic fields the phenomenon of it magnetic shielding effect of quantum entanglement states this effect is discussed for the binuclear nitrosyl iron complex fe_2sc_3h_5n_2_2no_4 and it is foreseen that the quantum entanglement survives even under high magnetic fields of tesla orders of magnitude | [['the', 'measure', 'of', 'quantum', 'entanglement', 'is', 'determined', 'for', 'any', 'dimer', 'either', 'ferromagnetic', 'or', 'antiferromagnetic', 'spin12', 'heisenberg', 'systems', 'in', 'the', 'presence', 'of', 'external', 'magnetic', 'field', 'the', 'physical', 'quantity', 'proposed', 'as', 'a', 'measure', 'of', 'thermal', 'quantum', 'entanglement', 'is', 'the', 'distance', 'between', 'states', 'defined', 'through', 'the', 'hilbertschmidt', 'norm', 'it', 'has', 'been', 'shown', 'that', 'for', 'ferromagnetic', 'systems', 'there', 'is', 'no', 'entanglement', 'at', 'all', 'however', 'although', 'under', 'applied', 'magnetic', 'field', 'antiferromagnetic', 'spin12', 'dimers', 'exhibit', 'entanglement', 'for', 'temperatures', 'below', 'the', 'decoherence', 'temperature', 'the', 'one', 'above', 'which', 'the', 'entanglement', 'vanishes', 'in', 'addition', 'to', 'that', 'the', 'decoherence', 'temperature', 'shows', 'to', 'be', 'proportional', 'to', 'the', 'exchange', 'coupling', 'constant', 'and', 'independent', 'on', 'the', 'applied', 'magnetic', 'field', 'consequently', 'the', 'entanglement', 'may', 'not', 'be', 'destroyed', 'by', 'external', 'magnetic', 'fields', 'the', 'phenomenon', 'of', 'it', 'magnetic', 'shielding', 'effect', 'of', 'quantum', 'entanglement', 'states', 'this', 'effect', 'is', 'discussed', 'for', 'the', 'binuclear', 'nitrosyl', 'iron', 'complex', 'fe_2sc_3h_5n_2_2no_4', 'and', 'it', 'is', 'foreseen', 'that', 'the', 'quantum', 'entanglement', 'survives', 'even', 'under', 'high', 'magnetic', 'fields', 'of', 'tesla', 'orders', 'of', 'magnitude']] | [-0.19009134069212658, 0.28486542804700554, -0.01786742518840589, 0.06363329837680053, 0.012519390034566449, -0.16634422762817733, -0.001751763319039041, 0.36758426284998846, -0.23563564289954436, -0.2656352836727669, 0.04655109143928642, -0.28253750435141906, -0.06013477797275943, 0.20347619426412994, 0.05338726200424372, 0.018925452177786524, -0.0327361944267989, 0.10191317348834424, -0.05960283337671096, -0.26247372337658503, 0.314448449395858, 0.03912848697261215, 0.3072808878674249, 0.13891125486045483, 0.08105445531807516, -0.009337757025981785, 0.14801601300632972, 0.04993967221349858, -0.10921633164586528, -0.0014874621978100792, 0.2299308916642835, -0.0065600966457162605, 0.19909181735911377, -0.4034066951365038, -0.22047414043384372, 0.12894591863362034, 0.11001095074306058, 0.1397295046714876, -0.03306046830694885, -0.30560898261180347, 0.01836639046995266, -0.14483785482752284, -0.12959611909775431, -0.11669313309752756, 0.011684487276461427, -0.06327265739265925, -0.26388523491265575, 0.12697272750424446, 0.09849974835012701, 0.13112168768598775, -0.046307289163184585, -0.05256541139167396, -0.03860939655951254, 0.09593996652149873, 0.05491187382175418, 0.0845846219261171, 0.19294131845295145, -0.10785139598483279, -0.13680237047908128, 0.331066775070444, -0.06298907288012041, -0.14349481969811156, 0.16967865141927246, -0.1723653369221338, -0.0741249497558708, 0.11954702468660132, 0.0638719851590076, 0.06228041179051065, -0.13778128474357593, 0.10431856232781295, 0.015544355805417534, 0.18699617639990748, 0.04302806820079779, 0.11923126324901512, 0.23992627306254047, 0.08829076463137131, 0.09322903730615878, 0.21154422337147794, -0.0856455848270517, -0.1358783143204726, -0.24367423951744463, -0.19010748249882015, -0.2890330572593305, 0.09938404424522727, -0.09749828436790824, -0.17925849785360176, 0.35842474703647337, 0.18724104060396957, 0.11485568930507656, -0.07371146974204239, 0.2653997838497162, 0.12629766308088566, 0.13054438666470206, 0.07416900771426832, 0.3070461433529142, 0.2347214694155653, 0.09861217589142797, -0.30982464018639677, 0.08714945155795023, -0.007304284904021651] |
1,803.01242 | Duality between atomic configurations and Bloch states in twistronic
materials | The relative orientation (twist) of successive layers of stacked
two-dimensional (2D) materials creates variations in the interlayer atomic
registry. The variations often form a super lattice, called a moir\'e pattern,
which can alter electronic properties. In this work we introduce a
classification of the single-particle electronic structures that can occur in
twisted stacks of 2D layers by characterizing them as "moir\'e molecules" or
"moir\'e crystals". The molecules generate localized electronic states and
moir\'e flat bands, while the crystals are sometimes unconventional and produce
electronic banding in the configuration basis. The underpinning of this
classification is the duality between interlayer configuration and monolayer
Bloch momentum in moir\'e Hamiltonians. We apply this understanding to diagrams
of local electron density in untwisted geometries to produce intuitive and
quantitative predictions of twistronic properties. We provide a conceptual
introduction to this framework through a one-dimensional model, and then apply
it to 2D twisted bilayers of the semi-metal graphene, and of MoS$_2$, a
representative material of the transition metal dichalcogenide (TMDC) family of
semiconductors. This level of thorough understanding of twistronic phenomena is
vital in the search for new material platforms for localized moir\'e electrons.
| cond-mat.mes-hall | the relative orientation twist of successive layers of stacked twodimensional 2d materials creates variations in the interlayer atomic registry the variations often form a super lattice called a moire pattern which can alter electronic properties in this work we introduce a classification of the singleparticle electronic structures that can occur in twisted stacks of 2d layers by characterizing them as moire molecules or moire crystals the molecules generate localized electronic states and moire flat bands while the crystals are sometimes unconventional and produce electronic banding in the configuration basis the underpinning of this classification is the duality between interlayer configuration and monolayer bloch momentum in moire hamiltonians we apply this understanding to diagrams of local electron density in untwisted geometries to produce intuitive and quantitative predictions of twistronic properties we provide a conceptual introduction to this framework through a onedimensional model and then apply it to 2d twisted bilayers of the semimetal graphene and of mos_2 a representative material of the transition metal dichalcogenide tmdc family of semiconductors this level of thorough understanding of twistronic phenomena is vital in the search for new material platforms for localized moire electrons | [['the', 'relative', 'orientation', 'twist', 'of', 'successive', 'layers', 'of', 'stacked', 'twodimensional', '2d', 'materials', 'creates', 'variations', 'in', 'the', 'interlayer', 'atomic', 'registry', 'the', 'variations', 'often', 'form', 'a', 'super', 'lattice', 'called', 'a', 'moire', 'pattern', 'which', 'can', 'alter', 'electronic', 'properties', 'in', 'this', 'work', 'we', 'introduce', 'a', 'classification', 'of', 'the', 'singleparticle', 'electronic', 'structures', 'that', 'can', 'occur', 'in', 'twisted', 'stacks', 'of', '2d', 'layers', 'by', 'characterizing', 'them', 'as', 'moire', 'molecules', 'or', 'moire', 'crystals', 'the', 'molecules', 'generate', 'localized', 'electronic', 'states', 'and', 'moire', 'flat', 'bands', 'while', 'the', 'crystals', 'are', 'sometimes', 'unconventional', 'and', 'produce', 'electronic', 'banding', 'in', 'the', 'configuration', 'basis', 'the', 'underpinning', 'of', 'this', 'classification', 'is', 'the', 'duality', 'between', 'interlayer', 'configuration', 'and', 'monolayer', 'bloch', 'momentum', 'in', 'moire', 'hamiltonians', 'we', 'apply', 'this', 'understanding', 'to', 'diagrams', 'of', 'local', 'electron', 'density', 'in', 'untwisted', 'geometries', 'to', 'produce', 'intuitive', 'and', 'quantitative', 'predictions', 'of', 'twistronic', 'properties', 'we', 'provide', 'a', 'conceptual', 'introduction', 'to', 'this', 'framework', 'through', 'a', 'onedimensional', 'model', 'and', 'then', 'apply', 'it', 'to', '2d', 'twisted', 'bilayers', 'of', 'the', 'semimetal', 'graphene', 'and', 'of', 'mos_2', 'a', 'representative', 'material', 'of', 'the', 'transition', 'metal', 'dichalcogenide', 'tmdc', 'family', 'of', 'semiconductors', 'this', 'level', 'of', 'thorough', 'understanding', 'of', 'twistronic', 'phenomena', 'is', 'vital', 'in', 'the', 'search', 'for', 'new', 'material', 'platforms', 'for', 'localized', 'moire', 'electrons']] | [-0.15952528171978372, 0.1585160233273375, -0.06236483492853648, 0.0628060033292146, -0.03158673225219715, -0.146897437905066, 0.07676661653533817, 0.4302305433261681, -0.2864365432047868, -0.2793262315643852, -0.0432493884277027, -0.26329758661216435, -0.23703089944475436, 0.14306564899385574, -0.0012977118612445123, 0.01794529364837762, 0.03292747235976478, -0.12069017785824811, -0.12485217546949531, -0.1814422239860729, 0.2925563109440998, 0.020169495268759722, 0.3483575543607859, 0.06476753207551127, 0.005830707661010684, 0.009359541461170516, 0.08717322990641914, 0.004803241061216051, -0.1596565264450927, 0.16385986289242283, 0.24987633815558158, -0.10185844554281968, 0.2007610021248699, -0.5025360616531601, -0.20834858597126754, -0.02217555578354806, 0.14066567004286, 0.16851479885788426, -0.06953424999594968, -0.27252651047818166, 0.03345842243615478, -0.13337490218816037, -0.11811368447170657, -0.11881812982682019, -0.01707462751789686, 0.015988871621411233, -0.21573488929565438, 0.077478540463642, 0.04814214459739477, 0.09851501810608461, -0.09918070584199037, -0.07172801424400573, -0.09994700470849632, 0.10170664477540568, 0.007200747824841761, 0.02613608668795488, 0.1576609630585912, -0.14712363892368086, -0.12559235610695366, 0.4455466925320315, -0.008261308477404602, -0.15296537210333117, 0.18179498770010263, -0.1572093450150547, -0.09072858296685857, 0.14044734855048, 0.14787373770486545, 0.08535654659826249, -0.12291314967043877, 0.052457359841686084, -0.08543162622655877, 0.15577781454390438, 0.0864691162646255, 0.11855986707826409, 0.2834480118497031, 0.19749327572585545, 0.04305045507390072, 0.14787300218912688, -0.11517299069630177, -0.03406241630517783, -0.20073424043123894, -0.22406078375039254, -0.19670328783757865, 0.06843225043117601, -0.042035685382306544, -0.2837467002308863, 0.4916448252073883, 0.11848706458222101, 0.19348530345369144, -0.0827240768146457, 0.22670550138644754, 0.04370937938117148, 0.11228883254838569, -0.02663914734537509, 0.20735533500120124, 0.13789904166765032, 0.08579291806264935, -0.18100402245228303, 0.02649795681233194, 0.07435504027472978] |
1,803.01243 | Axion Searches with Microwave Filters: the RADES project | We propose, design and construct a variant of the conventional axion
haloscope concept that could be competitive in the search for dark matter
axions of masses in the decade 10-100 $\mu$eV. Theses masses are located
somewhat above the mass range in which existing experiments have reached
sensitivity to benchmark QCD axion models. Our haloscope consists of an array
of small microwave cavities connected by rectangular irises, in an arrangement
commonly used in radio-frequency filters. The size of the unit cavity
determines the main resonant frequency, while the possibility to connect a
{large} number of cavities allows to reach large detection volumes. We develop
the theoretical framework of the detection concept, and present design
prescriptions to optimize detection capabilities. We describe the design and
realization of a first small-scale prototype of this concept, called Relic
Axion Detector Exploratory Setup (RADES). It consists of a copper-coated
stainless steel five-cavities microwave filter with the detecting mode
operating at around 8.4 GHz. This structure has been electromagnetically
characterized at 2 K and 298 K, and it is now placed in ultra-high vacuum in
one of the twin-bores of the 9 T CAST dipole magnet at CERN. We describe the
data acquisition system developed for relic axion detection, and present
preliminary results of the electromagnetic properties of the microwave filter,
which show the potential of filters to reach QCD axion window sensitivity at
X-band frequencies.
| hep-ex hep-ph | we propose design and construct a variant of the conventional axion haloscope concept that could be competitive in the search for dark matter axions of masses in the decade 10100 muev theses masses are located somewhat above the mass range in which existing experiments have reached sensitivity to benchmark qcd axion models our haloscope consists of an array of small microwave cavities connected by rectangular irises in an arrangement commonly used in radiofrequency filters the size of the unit cavity determines the main resonant frequency while the possibility to connect a large number of cavities allows to reach large detection volumes we develop the theoretical framework of the detection concept and present design prescriptions to optimize detection capabilities we describe the design and realization of a first smallscale prototype of this concept called relic axion detector exploratory setup rades it consists of a coppercoated stainless steel fivecavities microwave filter with the detecting mode operating at around 84 ghz this structure has been electromagnetically characterized at 2 k and 298 k and it is now placed in ultrahigh vacuum in one of the twinbores of the 9 t cast dipole magnet at cern we describe the data acquisition system developed for relic axion detection and present preliminary results of the electromagnetic properties of the microwave filter which show the potential of filters to reach qcd axion window sensitivity at xband frequencies | [['we', 'propose', 'design', 'and', 'construct', 'a', 'variant', 'of', 'the', 'conventional', 'axion', 'haloscope', 'concept', 'that', 'could', 'be', 'competitive', 'in', 'the', 'search', 'for', 'dark', 'matter', 'axions', 'of', 'masses', 'in', 'the', 'decade', '10100', 'muev', 'theses', 'masses', 'are', 'located', 'somewhat', 'above', 'the', 'mass', 'range', 'in', 'which', 'existing', 'experiments', 'have', 'reached', 'sensitivity', 'to', 'benchmark', 'qcd', 'axion', 'models', 'our', 'haloscope', 'consists', 'of', 'an', 'array', 'of', 'small', 'microwave', 'cavities', 'connected', 'by', 'rectangular', 'irises', 'in', 'an', 'arrangement', 'commonly', 'used', 'in', 'radiofrequency', 'filters', 'the', 'size', 'of', 'the', 'unit', 'cavity', 'determines', 'the', 'main', 'resonant', 'frequency', 'while', 'the', 'possibility', 'to', 'connect', 'a', 'large', 'number', 'of', 'cavities', 'allows', 'to', 'reach', 'large', 'detection', 'volumes', 'we', 'develop', 'the', 'theoretical', 'framework', 'of', 'the', 'detection', 'concept', 'and', 'present', 'design', 'prescriptions', 'to', 'optimize', 'detection', 'capabilities', 'we', 'describe', 'the', 'design', 'and', 'realization', 'of', 'a', 'first', 'smallscale', 'prototype', 'of', 'this', 'concept', 'called', 'relic', 'axion', 'detector', 'exploratory', 'setup', 'rades', 'it', 'consists', 'of', 'a', 'coppercoated', 'stainless', 'steel', 'fivecavities', 'microwave', 'filter', 'with', 'the', 'detecting', 'mode', 'operating', 'at', 'around', '84', 'ghz', 'this', 'structure', 'has', 'been', 'electromagnetically', 'characterized', 'at', '2', 'k', 'and', '298', 'k', 'and', 'it', 'is', 'now', 'placed', 'in', 'ultrahigh', 'vacuum', 'in', 'one', 'of', 'the', 'twinbores', 'of', 'the', '9', 't', 'cast', 'dipole', 'magnet', 'at', 'cern', 'we', 'describe', 'the', 'data', 'acquisition', 'system', 'developed', 'for', 'relic', 'axion', 'detection', 'and', 'present', 'preliminary', 'results', 'of', 'the', 'electromagnetic', 'properties', 'of', 'the', 'microwave', 'filter', 'which', 'show', 'the', 'potential', 'of', 'filters', 'to', 'reach', 'qcd', 'axion', 'window', 'sensitivity', 'at', 'xband', 'frequencies']] | [-0.13332301425224727, 0.15693670713147168, -0.029244286109276704, -0.007038764161846126, -0.06939253775125141, -0.11134307329918731, 0.02827609977388771, 0.38716861532118757, -0.18867275021304458, -0.37609042299976736, 0.09011040823054173, -0.2437209043470686, -0.047841315819440705, 0.20621987964484123, 0.01615034799467315, 0.05497461177608848, 0.02824636001886367, 0.009351993432031585, -0.01687000228986634, -0.1843446362140719, 0.23552958609581223, 0.11067471811915502, 0.2987568670181198, 0.044983074328628025, 0.11178843301502384, -0.04548780571183255, -0.009586436350282543, -0.047269097617173794, -0.1198895505912923, 0.07734982145076062, 0.26244720196108684, 0.11411160497574888, 0.22523479827724627, -0.3962703546378435, -0.1640955957904736, 0.11598913001893252, 0.11270714801809702, 0.07414940044308375, -0.06864056471947647, -0.301562945657663, 0.09532626423976596, -0.1666214838991628, -0.15031245405471214, -0.031784295204009765, -0.036347647269027665, -0.030343517151777633, -0.2509522297730559, -0.0044838573994000624, -0.01466898202769491, 0.006079420022535743, -0.03833659929541841, -0.14694776414768984, 0.08472290483258436, 0.02719867655296663, -0.01907727049751485, 0.013396218527320838, 0.19253339714231787, -0.13136057432316112, -0.12055473271124229, 0.3646763054303735, -0.10380822843198027, -0.09270014758569009, 0.17299882362171876, -0.15294556155506717, -0.11641171303978026, 0.1601718513789309, 0.20362803597297324, 0.08905970345439161, -0.15567059622614915, 0.07330454841282692, -0.021435585617406393, 0.2104855806305351, 0.11208290295479328, 0.05370215167753039, 0.30015206039605435, 0.260552759856198, 0.051077248613358266, 0.15991356332527, -0.14856535821270786, -0.007437341685688712, -0.30745449622444493, -0.10470114416124202, -0.15842913631326824, 0.007424325161417456, -0.0544090515530179, -0.13988691711340817, 0.38616753487210526, 0.17676278666936254, 0.1704080834427722, -0.0027264583725155446, 0.32160037486066456, 0.047464667108183596, 0.1141840125953438, 0.025057303780493766, 0.33131744529441276, 0.13294073659416059, 0.13230973018206688, -0.2278632011870637, -0.062138630446401964, 0.0006068865983060709] |
1,803.01244 | Beta Lyrae as seen by BRITE in 2016 | The BTr and UBr satellites observed $\beta$ Lyrae from May to October 2016 to
continuously monitor light-curve instabilities with the time resolution of
about 100 mins. An instrumental problem affecting localized patches on the BTr
CCD detector has been discovered by comparison with partly simultaneous UBr
observations; the origin of the problem is being investigated. A zero-point
offset permits utilization of the BTr data for a time-series characterization
of deviations from the mean light curve defined to $\simeq 0.0025$ mag.
| astro-ph.SR | the btr and ubr satellites observed beta lyrae from may to october 2016 to continuously monitor lightcurve instabilities with the time resolution of about 100 mins an instrumental problem affecting localized patches on the btr ccd detector has been discovered by comparison with partly simultaneous ubr observations the origin of the problem is being investigated a zeropoint offset permits utilization of the btr data for a timeseries characterization of deviations from the mean light curve defined to simeq 00025 mag | [['the', 'btr', 'and', 'ubr', 'satellites', 'observed', 'beta', 'lyrae', 'from', 'may', 'to', 'october', '2016', 'to', 'continuously', 'monitor', 'lightcurve', 'instabilities', 'with', 'the', 'time', 'resolution', 'of', 'about', '100', 'mins', 'an', 'instrumental', 'problem', 'affecting', 'localized', 'patches', 'on', 'the', 'btr', 'ccd', 'detector', 'has', 'been', 'discovered', 'by', 'comparison', 'with', 'partly', 'simultaneous', 'ubr', 'observations', 'the', 'origin', 'of', 'the', 'problem', 'is', 'being', 'investigated', 'a', 'zeropoint', 'offset', 'permits', 'utilization', 'of', 'the', 'btr', 'data', 'for', 'a', 'timeseries', 'characterization', 'of', 'deviations', 'from', 'the', 'mean', 'light', 'curve', 'defined', 'to', 'simeq', '00025', 'mag']] | [-0.09524664593918715, 0.10010784142523335, -0.11410419605672359, 0.03839035590208369, -0.0842870055232197, -0.11299267636495643, 0.08645816920907237, 0.3791793921496719, -0.24529729399364442, -0.38497507616411897, 0.1269040778744966, -0.34551684521720744, -0.05168117776047439, 0.21961673490295652, -0.13778900533216074, 0.02475696390829398, 0.09052316274028271, -0.048688033485086636, -0.06123462375253439, -0.23408905351534487, 0.18075576436240226, 0.10764483727980405, 0.2164217380923219, -0.05766538204770768, 0.0921377311591641, -0.004139128760289168, -0.09126249823966645, -0.046664085023803634, -0.13233265029848554, 0.06331943397817667, 0.20578671090770512, 0.09553457447036635, 0.21717441179789604, -0.34091254820814354, -0.2009075939480681, 0.09619847183348611, 0.1286081341910176, 0.002126385517476592, 0.011831170767254661, -0.3208935017872136, 0.048409369397268164, -0.09435262875631452, -0.18458459872636013, 0.049037221525213684, 0.0846011868561618, -0.00015746491262689233, -0.22575863890815526, 0.10941392677850673, -0.008635711082388298, 0.14551914378535002, -0.10663701192825101, -0.11026183924404905, -0.028461065574083476, 0.0872226140112616, 0.0660856247675838, 0.08656228676682076, 0.08704424147726968, -0.07531666917493567, -0.08105349749093875, 0.3527510157669894, -0.051683365118515213, -0.0026070807827636598, 0.1361215376877226, -0.1716538238029898, -0.08655724546406418, 0.1850812387885526, 0.15172357747214846, 0.06264183989260345, -0.19951132813803268, 0.038654970260540725, 0.033161633159033956, 0.24945597833866487, 0.08155564760381821, 0.042582430332549846, 0.24511485478433315, 0.16680832172278315, 0.04241527451667935, 0.07172293649055064, -0.2695939639437711, -0.017033942951820792, -0.22898170481203123, -0.051609898183960466, -0.14779335834318771, 0.06697455478715711, -0.07026822583266039, -0.12191133977030404, 0.39427972100675107, 0.10656510402477579, 0.19244679424446076, 0.025293199621955864, 0.2667559855035506, 0.09092683607595972, 0.09827472064935136, 0.06830468756961636, 0.2958401174284518, 0.14715408904303331, 0.12265923605882563, -0.209626786748413, 0.0775143319973722, -0.007053146325051785] |
1,803.01245 | CAPS: Context Aware Personalized POI Sequence Recommender System | The revolution of World Wide Web (WWW) and smart-phone technologies have been
the key-factor behind remarkable success of social networks. With the ease of
availability of check-in data, the location-based social networks (LBSN) (e.g.,
Facebook1, etc.) have been heavily explored in the past decade for
Point-of-Interest (POI) recommendation. Though many POI recommenders have been
defined, most of them have focused on recommending a single location or an
arbitrary list that is not contextually coherent. It has been cumbersome to
rely on such systems when one needs a contextually coherent list of locations,
that can be used for various day-to-day activities, for e.g., itinerary
planning. This paper proposes a model termed as CAPS (Context-Aware
Personalized POI Sequence Recommender System) that generates contextually
coherent POI sequences relevant to user preferences. To the best of our
knowledge, CAPS is the first attempt to formulate the contextual POI sequence
modeling by extending Recurrent Neural Network (RNN) and its variants. CAPS
extends RNN by incorporating multiple contexts to the hidden layer and by
incorporating global context (sequence features) to the hidden layers and the
output layer. It extends the variants of RNN (e.g., Long-short term memory
(LSTM)) by incorporating multiple contexts and global features in the gate
update relations. The major contributions of this paper are: (i) it models the
contextual POI sequence problem by incorporating personalized user preferences
through multiple constraints (e.g., categorical, social, temporal, etc.), (ii)
it extends RNN to incorporate the contexts of individual item and that of the
whole sequence. It also extends the gated functionality of variants of RNN to
incorporate the multiple contexts, and (iii) it evaluates the proposed models
against two real-world data sets.
| cs.IR | the revolution of world wide web www and smartphone technologies have been the keyfactor behind remarkable success of social networks with the ease of availability of checkin data the locationbased social networks lbsn eg facebook1 etc have been heavily explored in the past decade for pointofinterest poi recommendation though many poi recommenders have been defined most of them have focused on recommending a single location or an arbitrary list that is not contextually coherent it has been cumbersome to rely on such systems when one needs a contextually coherent list of locations that can be used for various daytoday activities for eg itinerary planning this paper proposes a model termed as caps contextaware personalized poi sequence recommender system that generates contextually coherent poi sequences relevant to user preferences to the best of our knowledge caps is the first attempt to formulate the contextual poi sequence modeling by extending recurrent neural network rnn and its variants caps extends rnn by incorporating multiple contexts to the hidden layer and by incorporating global context sequence features to the hidden layers and the output layer it extends the variants of rnn eg longshort term memory lstm by incorporating multiple contexts and global features in the gate update relations the major contributions of this paper are i it models the contextual poi sequence problem by incorporating personalized user preferences through multiple constraints eg categorical social temporal etc ii it extends rnn to incorporate the contexts of individual item and that of the whole sequence it also extends the gated functionality of variants of rnn to incorporate the multiple contexts and iii it evaluates the proposed models against two realworld data sets | [['the', 'revolution', 'of', 'world', 'wide', 'web', 'www', 'and', 'smartphone', 'technologies', 'have', 'been', 'the', 'keyfactor', 'behind', 'remarkable', 'success', 'of', 'social', 'networks', 'with', 'the', 'ease', 'of', 'availability', 'of', 'checkin', 'data', 'the', 'locationbased', 'social', 'networks', 'lbsn', 'eg', 'facebook1', 'etc', 'have', 'been', 'heavily', 'explored', 'in', 'the', 'past', 'decade', 'for', 'pointofinterest', 'poi', 'recommendation', 'though', 'many', 'poi', 'recommenders', 'have', 'been', 'defined', 'most', 'of', 'them', 'have', 'focused', 'on', 'recommending', 'a', 'single', 'location', 'or', 'an', 'arbitrary', 'list', 'that', 'is', 'not', 'contextually', 'coherent', 'it', 'has', 'been', 'cumbersome', 'to', 'rely', 'on', 'such', 'systems', 'when', 'one', 'needs', 'a', 'contextually', 'coherent', 'list', 'of', 'locations', 'that', 'can', 'be', 'used', 'for', 'various', 'daytoday', 'activities', 'for', 'eg', 'itinerary', 'planning', 'this', 'paper', 'proposes', 'a', 'model', 'termed', 'as', 'caps', 'contextaware', 'personalized', 'poi', 'sequence', 'recommender', 'system', 'that', 'generates', 'contextually', 'coherent', 'poi', 'sequences', 'relevant', 'to', 'user', 'preferences', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'caps', 'is', 'the', 'first', 'attempt', 'to', 'formulate', 'the', 'contextual', 'poi', 'sequence', 'modeling', 'by', 'extending', 'recurrent', 'neural', 'network', 'rnn', 'and', 'its', 'variants', 'caps', 'extends', 'rnn', 'by', 'incorporating', 'multiple', 'contexts', 'to', 'the', 'hidden', 'layer', 'and', 'by', 'incorporating', 'global', 'context', 'sequence', 'features', 'to', 'the', 'hidden', 'layers', 'and', 'the', 'output', 'layer', 'it', 'extends', 'the', 'variants', 'of', 'rnn', 'eg', 'longshort', 'term', 'memory', 'lstm', 'by', 'incorporating', 'multiple', 'contexts', 'and', 'global', 'features', 'in', 'the', 'gate', 'update', 'relations', 'the', 'major', 'contributions', 'of', 'this', 'paper', 'are', 'i', 'it', 'models', 'the', 'contextual', 'poi', 'sequence', 'problem', 'by', 'incorporating', 'personalized', 'user', 'preferences', 'through', 'multiple', 'constraints', 'eg', 'categorical', 'social', 'temporal', 'etc', 'ii', 'it', 'extends', 'rnn', 'to', 'incorporate', 'the', 'contexts', 'of', 'individual', 'item', 'and', 'that', 'of', 'the', 'whole', 'sequence', 'it', 'also', 'extends', 'the', 'gated', 'functionality', 'of', 'variants', 'of', 'rnn', 'to', 'incorporate', 'the', 'multiple', 'contexts', 'and', 'iii', 'it', 'evaluates', 'the', 'proposed', 'models', 'against', 'two', 'realworld', 'data', 'sets']] | [-0.08107979019765149, 0.005370009803604758, -0.02486647597514093, 0.08516166569220579, -0.1543234302408316, -0.1835724351910705, 0.0519702906323999, 0.4444723188809373, -0.32083417948885734, -0.3161097488450733, 0.07840448695622565, -0.3038723909979242, -0.1923231165932322, 0.15814739822240717, -0.119017099740661, 0.05137626751135527, 0.0698092808811502, 0.07074424047615718, 0.0004871731939916076, -0.2969722280109471, 0.3378003339892761, 0.04336203804408962, 0.32187449887140906, 0.01044907504608008, 0.11257483288053084, 0.033803430396894166, -0.070083598729477, -0.019870478511279956, -0.043856970605715605, 0.17825011239429428, 0.322451959118083, 0.23711737838743085, 0.3514494581114162, -0.4476141512800347, -0.29566742073913865, 0.06996183093637227, 0.14314006144921718, 0.07799901743334803, -0.004841462614607404, -0.3416685189603066, 0.10362117017280649, -0.23617052580441603, 0.02211999785155058, -0.09672329573722725, 0.012340669086710974, 0.05093469880394299, -0.24832702744582838, -0.025901840172644536, 0.08846819968470795, 0.0467285814974457, -0.03405727926430038, -0.10627061991613697, -0.006917660923420705, 0.22374670170639133, 0.07566503210437737, 0.015209232168272137, 0.14335769022476266, -0.1599115257066759, -0.18008615746924822, 0.3552219203995033, -0.01860891778784042, -0.17733279009349645, 0.17791731984608553, -0.02629314991052855, -0.17528540086297487, 0.07338197699896144, 0.21573560404167935, 0.10118598774255423, -0.1994644874971974, 0.0329745035959323, -0.0642767455284907, 0.17382644010961734, 0.06078828019005331, 0.04426781149073081, 0.22426783619956536, 0.23518344729376786, 0.02575513955756006, 0.08138873794835738, -0.07263859909239478, -0.11739511819683354, -0.16803541700863703, -0.10821774253198368, -0.1382458595677533, -0.022251975148524665, -0.10343400829307609, -0.1492846361615441, 0.42375101444396107, 0.21291791706769303, 0.1866952891681682, 0.05658656558783894, 0.2992067242616957, 0.02533239268367073, 0.1458995232836936, 0.05131661969152364, 0.11579606165093455, -0.004518605048175563, 0.18795228501273828, -0.12192248811775988, 0.17427150118418716, 0.05296252465468239] |
1,803.01246 | Long time instability of the Couette flow in low Gevrey spaces | We prove the instability of the Couette flow if the disturbances is less
smooth than the Gevrey space of class 2. This shows that this is the critical
regularity for this problem since it was proved in [5] that stability and
inviscid damping hold for disturbances which are smoother than the Gevrey space
of class 2. A big novelty is that this critical space is due to an instability
mechanism which is completely nonlinear and is due to some energy cascade.
| math.AP | we prove the instability of the couette flow if the disturbances is less smooth than the gevrey space of class 2 this shows that this is the critical regularity for this problem since it was proved in 5 that stability and inviscid damping hold for disturbances which are smoother than the gevrey space of class 2 a big novelty is that this critical space is due to an instability mechanism which is completely nonlinear and is due to some energy cascade | [['we', 'prove', 'the', 'instability', 'of', 'the', 'couette', 'flow', 'if', 'the', 'disturbances', 'is', 'less', 'smooth', 'than', 'the', 'gevrey', 'space', 'of', 'class', '2', 'this', 'shows', 'that', 'this', 'is', 'the', 'critical', 'regularity', 'for', 'this', 'problem', 'since', 'it', 'was', 'proved', 'in', '5', 'that', 'stability', 'and', 'inviscid', 'damping', 'hold', 'for', 'disturbances', 'which', 'are', 'smoother', 'than', 'the', 'gevrey', 'space', 'of', 'class', '2', 'a', 'big', 'novelty', 'is', 'that', 'this', 'critical', 'space', 'is', 'due', 'to', 'an', 'instability', 'mechanism', 'which', 'is', 'completely', 'nonlinear', 'and', 'is', 'due', 'to', 'some', 'energy', 'cascade']] | [-0.15751187682128798, 0.13495744616069894, -0.07995514440016797, 0.10916412429148216, -0.0723206218286061, -0.09776257881664752, -0.08185479138046503, 0.296315394077496, -0.30471092285473406, -0.2125142773061439, 0.17119971171444007, -0.2358162969028876, -0.16576593703256898, 0.22322794912313973, -0.10452767354608686, 0.061274215942651124, 0.03620116959935353, 0.017141784391837354, -0.023970884233598173, -0.2513300172329225, 0.40289369337030767, 0.0357941462698588, 0.2582016542530906, 0.030599581485867132, 0.05328050019495465, -0.08565789793710006, 0.05569620604086437, -0.008285200069184174, -0.14432491360504948, 0.07300592620747831, 0.2185755242984512, 0.05958981203478703, 0.3485444010936736, -0.3417426913424774, -0.26705373805246235, 0.14273066292114464, 0.15411843214023077, 0.09659417238902807, -0.007303840679082053, -0.2228073195243875, 0.1780009956823455, -0.10890866305828555, -0.14370363560953625, -0.03682353515407921, 0.08807653758996799, -0.010566495956830036, -0.3162685118408667, 0.08928608470653862, 0.15469405379284312, 0.049830952348808445, -0.11329189271171704, -0.022494111020393944, -0.039271950606762626, 0.03301442038543798, 0.0896359232576265, 0.09159016130020681, 0.06020034575420949, -0.12195382057976575, 0.0024719442597325937, 0.39815326310970167, 0.00969275771633055, -0.2374354217339445, 0.19721828650375597, -0.18054394780393737, -0.09565877263077799, 0.19161715181429445, 0.13944359698453573, 0.1164438391196323, -0.07265135764293833, 0.08928664825299042, -0.038131387151179856, 0.1807904465434452, 0.08275521262031463, -0.005793802514902235, 0.07620277754778479, 0.20934205191830793, 0.1915070244260592, 0.14557983166966473, -0.06035855696622834, -0.08025579862756493, -0.3184145664635264, -0.16777545332126778, -0.14785691237157603, 0.06560025232798064, -0.05685124414891039, -0.189276495637993, 0.38478747980646144, 0.16070322513028426, 0.16476433075688504, 0.08505884984818597, 0.2730170144802994, 0.15011568657226032, 0.01981459253318148, 0.1533531270990217, 0.3046505956319132, 0.08411619402928117, 0.1334783015427766, -0.17264175866902978, 0.09040988395910388, 0.09043454520266365] |
1,803.01247 | Generalized Lennard-Jones Potentials, SUSYQM and Differential Galois
Theory | In this paper we start with proving that the Schr\"odinger equation (SE) with
the classical $12-6$ Lennard-Jones (L-J) potential is nonintegrable in the
sense of the differential Galois theory (DGT), for any value of energy; i.e.,
there are no solutions in closed form for such differential equation. We study
the $10-6$ potential through DGT and SUSYQM; being it one of the two partner
potentials built with a superpotential of the form $w(r)\propto 1/r^5$. We also
find that it is integrable in the sense of DGT for zero energy. A first
analysis of the applicability and physical consequences of the model is carried
out in terms of the so called De Boer principle of corresponding states. A
comparison of the second virial coefficient $B(T)$ for both potentials shows a
good agreement for low temperatures. As a consequence of these results we
propose the $10-6$ potential as an integrable alternative to be applied in
further studies instead of the original $12-6$ L-J potential. Finally we study
through DGT and SUSYQM the integrability of the SE with a generalized
$(2\nu-2)-\nu$ L-J potential. This analysis do not include the study of square
integrable wave functions, excited states and energies different than zero for
the generalization of L-J potentials.
| quant-ph math-ph math.MP | in this paper we start with proving that the schrodinger equation se with the classical 126 lennardjones lj potential is nonintegrable in the sense of the differential galois theory dgt for any value of energy ie there are no solutions in closed form for such differential equation we study the 106 potential through dgt and susyqm being it one of the two partner potentials built with a superpotential of the form wrpropto 1r5 we also find that it is integrable in the sense of dgt for zero energy a first analysis of the applicability and physical consequences of the model is carried out in terms of the so called de boer principle of corresponding states a comparison of the second virial coefficient bt for both potentials shows a good agreement for low temperatures as a consequence of these results we propose the 106 potential as an integrable alternative to be applied in further studies instead of the original 126 lj potential finally we study through dgt and susyqm the integrability of the se with a generalized 2nu2nu lj potential this analysis do not include the study of square integrable wave functions excited states and energies different than zero for the generalization of lj potentials | [['in', 'this', 'paper', 'we', 'start', 'with', 'proving', 'that', 'the', 'schrodinger', 'equation', 'se', 'with', 'the', 'classical', '126', 'lennardjones', 'lj', 'potential', 'is', 'nonintegrable', 'in', 'the', 'sense', 'of', 'the', 'differential', 'galois', 'theory', 'dgt', 'for', 'any', 'value', 'of', 'energy', 'ie', 'there', 'are', 'no', 'solutions', 'in', 'closed', 'form', 'for', 'such', 'differential', 'equation', 'we', 'study', 'the', '106', 'potential', 'through', 'dgt', 'and', 'susyqm', 'being', 'it', 'one', 'of', 'the', 'two', 'partner', 'potentials', 'built', 'with', 'a', 'superpotential', 'of', 'the', 'form', 'wrpropto', '1r5', 'we', 'also', 'find', 'that', 'it', 'is', 'integrable', 'in', 'the', 'sense', 'of', 'dgt', 'for', 'zero', 'energy', 'a', 'first', 'analysis', 'of', 'the', 'applicability', 'and', 'physical', 'consequences', 'of', 'the', 'model', 'is', 'carried', 'out', 'in', 'terms', 'of', 'the', 'so', 'called', 'de', 'boer', 'principle', 'of', 'corresponding', 'states', 'a', 'comparison', 'of', 'the', 'second', 'virial', 'coefficient', 'bt', 'for', 'both', 'potentials', 'shows', 'a', 'good', 'agreement', 'for', 'low', 'temperatures', 'as', 'a', 'consequence', 'of', 'these', 'results', 'we', 'propose', 'the', '106', 'potential', 'as', 'an', 'integrable', 'alternative', 'to', 'be', 'applied', 'in', 'further', 'studies', 'instead', 'of', 'the', 'original', '126', 'lj', 'potential', 'finally', 'we', 'study', 'through', 'dgt', 'and', 'susyqm', 'the', 'integrability', 'of', 'the', 'se', 'with', 'a', 'generalized', '2nu2nu', 'lj', 'potential', 'this', 'analysis', 'do', 'not', 'include', 'the', 'study', 'of', 'square', 'integrable', 'wave', 'functions', 'excited', 'states', 'and', 'energies', 'different', 'than', 'zero', 'for', 'the', 'generalization', 'of', 'lj', 'potentials']] | [-0.10126370764199165, 0.0718132228669647, -0.09343430892527473, 0.08560596664936401, -0.026128262893462758, -0.1407907797060538, 0.026066203917478128, 0.2981861451557736, -0.2274734530768514, -0.2667147061501694, 0.06647418864419463, -0.2938718028541765, -0.17733762210285714, 0.1754553162090545, 0.011928239046010456, 0.05476349582526796, 0.03979361566281555, 0.06441592450782721, -0.10315742659022903, -0.22782823042298603, 0.32074611095162936, 0.023608387372396556, 0.2206130928525904, 0.08168216357307306, 0.09235341264866292, 0.01448666138515697, 0.026628903813814598, 0.004803714282478731, -0.15568331879683792, 0.0845644693483949, 0.2213402210347502, 0.058230539444963085, 0.26063759446992435, -0.385137998388324, -0.19548802357628056, 0.13529176610443594, 0.13407947976225157, 0.11275422220385753, -0.06036648290729759, -0.25531719727349456, 0.07534758530679334, -0.18991338018452436, -0.19155213916397626, -0.08352028352835465, 0.03180584957647958, 0.07101581222262454, -0.2454157829801045, 0.11220167682674427, 0.051490472841749686, 0.04201640596298909, -0.12036749853817101, -0.1308149005572247, -0.027949901947770084, 0.04441186023811524, 0.032768035727659114, 0.03406293270072098, 0.08419537520045323, -0.12465012921389229, -0.0744451018140218, 0.3967780793998575, -0.09780368429274669, -0.23242881251867897, 0.1928443382136837, -0.11265197304529276, -0.11862731308418115, 0.09939035515780423, 0.10115030408366629, 0.09842227685431221, -0.15927393580233623, 0.1208033443540669, -0.013270177057697, 0.1317142514047434, 0.07583141741619473, 0.0022186667967508756, 0.16387590131201404, 0.12664405142659055, 0.03909039102514311, 0.12284036306260929, -0.053256774489481996, -0.1491143254212814, -0.3346957857305608, -0.19756993454290867, -0.1740645715876916, 0.061179501456635, -0.0753481197951818, -0.16046300972523722, 0.39849612571179205, 0.12634782460466312, 0.1925738832249426, 0.062167742264244964, 0.20956821257183975, 0.15856128646692463, 0.044616770407007456, 0.03517119338076635, 0.27153975448322176, 0.16250746361542456, 0.10065590112128912, -0.21136116180733183, -0.041623724954165886, 0.06348329510466003] |
1,803.01248 | Imprecise temporal associations and decision support systems | The quick and pervasive infiltration of decision support systems, artificial
intelligence, and data mining in consumer electronics and everyday life in
general has been significant in recent years. Fields such as UX have been
facilitating the integration of such technologies into software and hardware,
but the back-end processing is still based on binary foundations. This article
describes an approach to mining for imprecise temporal associations among
events in data streams, taking into account the very natural concept of
approximation. This type of association analysis is likely to lead to more
meaningful and actionable decision support systems.
| cs.DB | the quick and pervasive infiltration of decision support systems artificial intelligence and data mining in consumer electronics and everyday life in general has been significant in recent years fields such as ux have been facilitating the integration of such technologies into software and hardware but the backend processing is still based on binary foundations this article describes an approach to mining for imprecise temporal associations among events in data streams taking into account the very natural concept of approximation this type of association analysis is likely to lead to more meaningful and actionable decision support systems | [['the', 'quick', 'and', 'pervasive', 'infiltration', 'of', 'decision', 'support', 'systems', 'artificial', 'intelligence', 'and', 'data', 'mining', 'in', 'consumer', 'electronics', 'and', 'everyday', 'life', 'in', 'general', 'has', 'been', 'significant', 'in', 'recent', 'years', 'fields', 'such', 'as', 'ux', 'have', 'been', 'facilitating', 'the', 'integration', 'of', 'such', 'technologies', 'into', 'software', 'and', 'hardware', 'but', 'the', 'backend', 'processing', 'is', 'still', 'based', 'on', 'binary', 'foundations', 'this', 'article', 'describes', 'an', 'approach', 'to', 'mining', 'for', 'imprecise', 'temporal', 'associations', 'among', 'events', 'in', 'data', 'streams', 'taking', 'into', 'account', 'the', 'very', 'natural', 'concept', 'of', 'approximation', 'this', 'type', 'of', 'association', 'analysis', 'is', 'likely', 'to', 'lead', 'to', 'more', 'meaningful', 'and', 'actionable', 'decision', 'support', 'systems']] | [-0.11235454062777232, 0.0378684807863768, -0.09508593432838097, 0.09028989663056564, -0.15576943952085762, -0.12241693231044337, 0.05330224131466821, 0.40578019436604035, -0.25226738895677653, -0.32380148440521833, 0.14594835528259864, -0.2709060840473588, -0.17507233870370933, 0.2321011800765215, -0.12362512335918534, 0.0678393302562957, 0.10096140374662355, 0.04418623722449411, 0.04183893228764646, -0.24652519123628736, 0.26738019434075494, 0.055875727756453365, 0.3311087786181209, 0.05690683499657704, 0.07460398234979948, 0.02232569589978084, -0.10180629719252465, -0.034834832166476794, -0.0269912840546264, 0.18241520362365313, 0.36973591932231403, 0.2646229550494657, 0.3558666706909814, -0.4883768403669819, -0.23173856559636383, 0.08829186224223425, 0.15106126885317886, 0.056297220658355705, -0.07437939470355559, -0.32031291203869233, 0.08207704963084932, -0.20203114007017575, -0.04962130393444871, -0.12534053946001222, 0.10015287250765444, -0.0029768014859049194, -0.23613715564715676, -0.006556386254184569, 0.06146615116570805, 0.12987724807074605, -0.06715918803577854, -0.11398791989752984, 0.04943736534914933, 0.15539635242506242, 0.06807752366391166, 0.029948418736845877, 0.12314678249579931, -0.14379169262974756, -0.15989013734118393, 0.4089958343732481, 0.034975481122576944, -0.13022128238420314, 0.2602218284276508, -0.06794595590569467, -0.22151482669869438, 0.11370159652627383, 0.2750415624177549, 0.025415783932354923, -0.24504228604685827, 0.042849726457764824, 0.06489868415519595, 0.17017650734245157, 0.029296347382114618, 0.05134395196303861, 0.28512349944988574, 0.2811701704316268, 0.0282811424525183, 0.07663446953423166, -0.04170449367908683, -0.1283437223173678, -0.18066665961426528, -0.20999685837887228, -0.12131151018062762, 0.016599733749899315, -0.06641352615088181, -0.17688859696500003, 0.30557042117773864, 0.20291882772774747, 0.12076958669543576, -0.0008062377601163462, 0.3462302323484134, 0.0794338038698091, 0.13894031027060313, 0.03788089191948529, 0.16034560054928684, 0.06893896153390718, 0.1960035665591325, -0.09091796137120885, 0.13046280067768143, -0.03528286707781566] |
1,803.01249 | The Radion as a Dark Matter Candidate | I study a class of Randall-Sundrum (RS) models with Spontaneous Breaking of
Scale Invariance (SBSI). This class of models implements the
Contino-Pomarol-Rattazzi (CPR) mechanism to achieve SBSI through the small
running of an external close-to-marginal scale-breaking operator that leads to
a light dilaton/radion with couplings to matter suppressed by the small
running. I show that for radion masses $\lesssim 1$ KeV, it can serve as a Dark
Matter (DM) candidate, with a lifetime longer than the age of the universe, and
show that the experimental bounds from LHC, Non-Newtonian Gravity and
Axion-Like Particle (ALP) searches allow for the existence of such a radion.
| hep-ph | i study a class of randallsundrum rs models with spontaneous breaking of scale invariance sbsi this class of models implements the continopomarolrattazzi cpr mechanism to achieve sbsi through the small running of an external closetomarginal scalebreaking operator that leads to a light dilatonradion with couplings to matter suppressed by the small running i show that for radion masses lesssim 1 kev it can serve as a dark matter dm candidate with a lifetime longer than the age of the universe and show that the experimental bounds from lhc nonnewtonian gravity and axionlike particle alp searches allow for the existence of such a radion | [['i', 'study', 'a', 'class', 'of', 'randallsundrum', 'rs', 'models', 'with', 'spontaneous', 'breaking', 'of', 'scale', 'invariance', 'sbsi', 'this', 'class', 'of', 'models', 'implements', 'the', 'continopomarolrattazzi', 'cpr', 'mechanism', 'to', 'achieve', 'sbsi', 'through', 'the', 'small', 'running', 'of', 'an', 'external', 'closetomarginal', 'scalebreaking', 'operator', 'that', 'leads', 'to', 'a', 'light', 'dilatonradion', 'with', 'couplings', 'to', 'matter', 'suppressed', 'by', 'the', 'small', 'running', 'i', 'show', 'that', 'for', 'radion', 'masses', 'lesssim', '1', 'kev', 'it', 'can', 'serve', 'as', 'a', 'dark', 'matter', 'dm', 'candidate', 'with', 'a', 'lifetime', 'longer', 'than', 'the', 'age', 'of', 'the', 'universe', 'and', 'show', 'that', 'the', 'experimental', 'bounds', 'from', 'lhc', 'nonnewtonian', 'gravity', 'and', 'axionlike', 'particle', 'alp', 'searches', 'allow', 'for', 'the', 'existence', 'of', 'such', 'a', 'radion']] | [-0.1112847628217994, 0.22708268641786966, -0.07335005798057526, 0.12717467461890705, -0.11671500354457427, -0.19288690188927027, 0.008801516372021105, 0.30971787882713125, -0.20735825567652344, -0.37097046637505876, 0.03666231401410757, -0.22077616208287723, -0.05271102376190909, 0.17646592058008537, 0.039823287121002, 0.008068101594735887, 0.022767809333791043, 0.0009904138118430389, -0.0286326722776079, -0.21675154908249775, 0.2726200732092063, 0.06377106603216745, 0.17980241188414248, 0.07081433544939786, 0.0817427352600384, -0.04700991177164456, 0.028406630904760723, -0.04933703185844363, -0.12866171928887044, 0.0591764848989745, 0.16758987784944077, 0.09483612498882518, 0.1768769448664149, -0.36977014307151823, -0.2125612081635707, 0.17774699587265358, 0.14112972158609943, 0.10173670392182163, -0.10688675650139796, -0.32189972229831504, 0.11871031309505377, -0.2130490022382754, -0.11226112852968714, -0.025803023593171555, 0.003283053485895781, -0.05357514875347489, -0.3187133707973522, 0.08737784471390221, 0.004045699948476919, -0.02886250136675788, -0.05716585270676981, -0.10299653076000657, -0.016846164732294923, -0.02519636842257836, 0.15763361613932705, 0.01843377273739772, 0.17708346005711778, -0.18887622614605717, -0.12155605060066663, 0.40875797634761707, -0.16255669122834018, -0.1403179805561462, 0.17227293276136704, -0.11109649237044447, -0.1255884124650894, 0.09596509939543538, 0.1658835132622306, 0.11499675418998972, -0.10372424733770244, 0.1513903726054374, -0.01784143916230795, 0.21342222007475428, 0.023499850046766156, 0.08390741345618724, 0.29310461261547077, 0.21610711097680763, 0.06276268105698275, 0.06903734019678999, -0.08456948913597301, -0.05736656494178426, -0.38166953217895594, -0.13550312033861273, -0.10092730722937952, 0.06823219881249208, -0.13131654543280555, -0.11618135454402506, 0.36087170082107917, 0.16382341593156988, 0.2139635564777635, 0.08730958438679284, 0.2484744292382589, 0.055639188005086763, 0.11547545245026841, 0.05655139541326493, 0.3212733560369587, 0.08182742486150898, 0.10948527714137134, -0.23499511444128537, -0.010552396148662357, 0.03938031663168587] |
1,803.0125 | A Benchmark for Iris Location and a Deep Learning Detector Evaluation | The iris is considered as the biometric trait with the highest unique
probability. The iris location is an important task for biometrics systems,
affecting directly the results obtained in specific applications such as iris
recognition, spoofing and contact lenses detection, among others. This work
defines the iris location problem as the delimitation of the smallest squared
window that encompasses the iris region. In order to build a benchmark for iris
location we annotate (iris squared bounding boxes) four databases from
different biometric applications and make them publicly available to the
community. Besides these 4 annotated databases, we include 2 others from the
literature. We perform experiments on these six databases, five obtained with
near infra-red sensors and one with visible light sensor. We compare the
classical and outstanding Daugman iris location approach with two window based
detectors: 1) a sliding window detector based on features from Histogram of
Oriented Gradients (HOG) and a linear Support Vector Machines (SVM) classifier;
2) a deep learning based detector fine-tuned from YOLO object detector.
Experimental results showed that the deep learning based detector outperforms
the other ones in terms of accuracy and runtime (GPUs version) and should be
chosen whenever possible.
| cs.CV | the iris is considered as the biometric trait with the highest unique probability the iris location is an important task for biometrics systems affecting directly the results obtained in specific applications such as iris recognition spoofing and contact lenses detection among others this work defines the iris location problem as the delimitation of the smallest squared window that encompasses the iris region in order to build a benchmark for iris location we annotate iris squared bounding boxes four databases from different biometric applications and make them publicly available to the community besides these 4 annotated databases we include 2 others from the literature we perform experiments on these six databases five obtained with near infrared sensors and one with visible light sensor we compare the classical and outstanding daugman iris location approach with two window based detectors 1 a sliding window detector based on features from histogram of oriented gradients hog and a linear support vector machines svm classifier 2 a deep learning based detector finetuned from yolo object detector experimental results showed that the deep learning based detector outperforms the other ones in terms of accuracy and runtime gpus version and should be chosen whenever possible | [['the', 'iris', 'is', 'considered', 'as', 'the', 'biometric', 'trait', 'with', 'the', 'highest', 'unique', 'probability', 'the', 'iris', 'location', 'is', 'an', 'important', 'task', 'for', 'biometrics', 'systems', 'affecting', 'directly', 'the', 'results', 'obtained', 'in', 'specific', 'applications', 'such', 'as', 'iris', 'recognition', 'spoofing', 'and', 'contact', 'lenses', 'detection', 'among', 'others', 'this', 'work', 'defines', 'the', 'iris', 'location', 'problem', 'as', 'the', 'delimitation', 'of', 'the', 'smallest', 'squared', 'window', 'that', 'encompasses', 'the', 'iris', 'region', 'in', 'order', 'to', 'build', 'a', 'benchmark', 'for', 'iris', 'location', 'we', 'annotate', 'iris', 'squared', 'bounding', 'boxes', 'four', 'databases', 'from', 'different', 'biometric', 'applications', 'and', 'make', 'them', 'publicly', 'available', 'to', 'the', 'community', 'besides', 'these', '4', 'annotated', 'databases', 'we', 'include', '2', 'others', 'from', 'the', 'literature', 'we', 'perform', 'experiments', 'on', 'these', 'six', 'databases', 'five', 'obtained', 'with', 'near', 'infrared', 'sensors', 'and', 'one', 'with', 'visible', 'light', 'sensor', 'we', 'compare', 'the', 'classical', 'and', 'outstanding', 'daugman', 'iris', 'location', 'approach', 'with', 'two', 'window', 'based', 'detectors', '1', 'a', 'sliding', 'window', 'detector', 'based', 'on', 'features', 'from', 'histogram', 'of', 'oriented', 'gradients', 'hog', 'and', 'a', 'linear', 'support', 'vector', 'machines', 'svm', 'classifier', '2', 'a', 'deep', 'learning', 'based', 'detector', 'finetuned', 'from', 'yolo', 'object', 'detector', 'experimental', 'results', 'showed', 'that', 'the', 'deep', 'learning', 'based', 'detector', 'outperforms', 'the', 'other', 'ones', 'in', 'terms', 'of', 'accuracy', 'and', 'runtime', 'gpus', 'version', 'and', 'should', 'be', 'chosen', 'whenever', 'possible']] | [-0.035971417733548484, 0.0037630669055961612, -0.0532057503212319, 0.04415870726529301, -0.10451135805425078, -0.230648208078621, -0.007101847010139887, 0.43531606853632304, -0.2253516892486531, -0.34471016499180784, 0.13519775260772868, -0.35981593376526677, -0.15295201201502442, 0.22445108829062316, -0.09707942965389041, 0.12712891379059268, 0.12347242727327316, 0.09069591668448623, -0.02374869063620687, -0.25767910106788355, 0.2898268578337685, 0.068488600148245, 0.31302743112883497, 0.016888752163075817, 0.10783481049743779, -0.026961552720223814, -0.07222736280394935, 0.013830897379382916, -0.088331509152617, 0.15194569562968377, 0.3084627302318603, 0.2081487720340566, 0.25025721978062887, -0.35445122583414695, -0.18016798853836385, 0.04851663151878845, 0.1302746088801869, 0.052112143775117276, -0.0433676757549555, -0.3637441803020458, 0.09019834857887876, -0.13143900730339858, -0.042493121197380995, -0.04322673490762635, -0.025786096960552, -0.0180846579700264, -0.26013653490427635, -0.003437740242505815, 0.02195984046896778, 0.11376461424855373, -0.08944402639411371, -0.15692038751599677, 0.03273522428374, 0.1924088643627421, 0.009459832231135954, 0.03270653205058599, 0.17892859530810096, -0.17905891202047447, -0.14967433713981645, 0.33877953451107906, -0.0787641191506418, -0.14478158390593862, 0.21064326130941055, -0.07140701974690111, -0.13111161337432636, 0.10844125277433676, 0.1884376883346039, 0.1249984312007147, -0.15444639560099938, 0.0024418978089688886, -0.032058402327442455, 0.20408198269329927, 0.09120702176936311, 0.046213535242123044, 0.2068559612776271, 0.20051135757682742, 0.023157802474245353, 0.15656559061652597, -0.2365625372529089, -0.04704452465379346, -0.260475414987124, -0.12518340330287284, -0.18091566533649217, -0.0813962679431977, -0.09827632695706243, -0.15297321229168512, 0.37156782858546467, 0.23638970976044496, 0.2059813915257848, 0.058352741948210725, 0.34797674581068117, -0.01487308797405248, 0.16576079699934135, 0.08368998007384379, 0.21909014434910612, -0.016250410475319034, 0.13300408695252414, -0.15755179265707844, 0.060414446239935256, 0.05959074142823932] |
1,803.01251 | On the correlation of shear band formation and texture evolution in
$\alpha$-brass during accumulative roll bonding | We studied the microstructural evolution of the low stacking fault energy
$\alpha$-brass alloy CuZn15 during accumulative roll bonding (ARB). Most
notably, the typical brass-type texture was clearly observed after four ARB
passes (approx. 93.8 % total thickness reduction), before significant shear
localization set in. This observation contradicts the widely accepted idea that
shear band formation is a necessary prerequisite for the development of the
brass type texture, indicating that the two phenomena, shear banding and
development of the brass texture, are only correlated in ARB, and that their
order of appearance can be switched depending on experimental parameters.
| cond-mat.mtrl-sci | we studied the microstructural evolution of the low stacking fault energy alphabrass alloy cuzn15 during accumulative roll bonding arb most notably the typical brasstype texture was clearly observed after four arb passes approx 938 total thickness reduction before significant shear localization set in this observation contradicts the widely accepted idea that shear band formation is a necessary prerequisite for the development of the brass type texture indicating that the two phenomena shear banding and development of the brass texture are only correlated in arb and that their order of appearance can be switched depending on experimental parameters | [['we', 'studied', 'the', 'microstructural', 'evolution', 'of', 'the', 'low', 'stacking', 'fault', 'energy', 'alphabrass', 'alloy', 'cuzn15', 'during', 'accumulative', 'roll', 'bonding', 'arb', 'most', 'notably', 'the', 'typical', 'brasstype', 'texture', 'was', 'clearly', 'observed', 'after', 'four', 'arb', 'passes', 'approx', '938', 'total', 'thickness', 'reduction', 'before', 'significant', 'shear', 'localization', 'set', 'in', 'this', 'observation', 'contradicts', 'the', 'widely', 'accepted', 'idea', 'that', 'shear', 'band', 'formation', 'is', 'a', 'necessary', 'prerequisite', 'for', 'the', 'development', 'of', 'the', 'brass', 'type', 'texture', 'indicating', 'that', 'the', 'two', 'phenomena', 'shear', 'banding', 'and', 'development', 'of', 'the', 'brass', 'texture', 'are', 'only', 'correlated', 'in', 'arb', 'and', 'that', 'their', 'order', 'of', 'appearance', 'can', 'be', 'switched', 'depending', 'on', 'experimental', 'parameters']] | [-0.1379622885551145, 0.17053951030012537, -0.048966346316992135, 0.019175993516407114, -0.0273816078391045, -0.11568353901260552, 0.000596638001065622, 0.36896291028391176, -0.2644317216262162, -0.3283190099879148, 0.11936426208047395, -0.23844660483696994, -0.15756422435205944, 0.17139303568314682, -0.019278296299199475, 0.05924071498992952, 0.047939319284775225, -0.042185422290671376, -0.08560397427657897, -0.2608092288149798, 0.22910670901306884, 0.06549188645774538, 0.36299937911965746, 0.05600507709722807, 0.026760520798679282, 0.000493692989619647, -0.009406270529886589, 0.030319975817853465, -0.15150614122312425, 0.018189760769638134, 0.22614146818585218, 0.039251558217771126, 0.20763199916109443, -0.4325366959451361, -0.2126540588165455, 0.037675768057716656, 0.13040323641171006, 0.09161316405268426, -0.03719839254428851, -0.19856385791555364, 0.10634244344335922, -0.12057759674721734, -0.08707558143849267, -0.023974350612100334, 0.05974936183106075, -0.00996383940404717, -0.21632281991162713, 0.13499567996056633, 0.0869529481699809, 0.08243817078108166, -0.10901261053166966, -0.12369398399692108, -0.08358812816391521, 0.07814423646777868, 0.06511095578118445, 0.03547617079729729, 0.19906259582259078, -0.110183771508944, -0.0609653068587501, 0.383890882183976, -0.01806283572396422, -0.0723109798545533, 0.19811144438473152, -0.12253355951187142, -0.13413075693793833, 0.17629754445961418, 0.11172215973443174, 0.05484068112081274, -0.12590275405153156, -0.021010183780937098, 0.03535647040475754, 0.21478809560946327, 0.10964669605736878, -0.020985977610256126, 0.23714723129895457, 0.2302109194248221, 0.020622431786057164, 0.10478032250427938, -0.17849323772478531, -0.037423420261512415, -0.28770906330542045, -0.1330019316736341, -0.1781975284288142, 0.026560078060472423, -0.11452645484446003, -0.19262407518962912, 0.42864397064128773, 0.13351139982548008, 0.18237028582494685, -0.05006627074908465, 0.237667768886511, 0.041125435772397745, 0.09658553429255064, 0.014859336165790545, 0.31919637086622893, 0.1007645565402159, 0.10789953355003704, -0.22589514321310722, 0.18088596277533375, 0.02889942801854712] |
1,803.01252 | A Swift Heuristic Method for Work Order Scheduling under the
Skilled-Workforce Constraint | The considered problem is how to optimally allocate a set of jobs to
technicians of different skills such that the number of technicians of each
skill does not exceed the number of persons with that skill designation. The
key motivation is the quick sensitivity analysis in terms of the workforce size
which is quite necessary in many industries in the presence of unexpected work
orders. A time-indexed mathematical model is proposed to minimize the total
weighted completion time of the jobs. The proposed model is decomposed into a
number of single-skill sub-problems so that each one is a combination of a
series of nested binary Knapsack problems. A heuristic procedure is proposed to
solve the problem. Our experimental results, based on a real-world case study,
reveal that the proposed method quickly produces a schedule statistically close
to the optimal one while the classical optimal procedure is very
time-consuming.
| cs.AI | the considered problem is how to optimally allocate a set of jobs to technicians of different skills such that the number of technicians of each skill does not exceed the number of persons with that skill designation the key motivation is the quick sensitivity analysis in terms of the workforce size which is quite necessary in many industries in the presence of unexpected work orders a timeindexed mathematical model is proposed to minimize the total weighted completion time of the jobs the proposed model is decomposed into a number of singleskill subproblems so that each one is a combination of a series of nested binary knapsack problems a heuristic procedure is proposed to solve the problem our experimental results based on a realworld case study reveal that the proposed method quickly produces a schedule statistically close to the optimal one while the classical optimal procedure is very timeconsuming | [['the', 'considered', 'problem', 'is', 'how', 'to', 'optimally', 'allocate', 'a', 'set', 'of', 'jobs', 'to', 'technicians', 'of', 'different', 'skills', 'such', 'that', 'the', 'number', 'of', 'technicians', 'of', 'each', 'skill', 'does', 'not', 'exceed', 'the', 'number', 'of', 'persons', 'with', 'that', 'skill', 'designation', 'the', 'key', 'motivation', 'is', 'the', 'quick', 'sensitivity', 'analysis', 'in', 'terms', 'of', 'the', 'workforce', 'size', 'which', 'is', 'quite', 'necessary', 'in', 'many', 'industries', 'in', 'the', 'presence', 'of', 'unexpected', 'work', 'orders', 'a', 'timeindexed', 'mathematical', 'model', 'is', 'proposed', 'to', 'minimize', 'the', 'total', 'weighted', 'completion', 'time', 'of', 'the', 'jobs', 'the', 'proposed', 'model', 'is', 'decomposed', 'into', 'a', 'number', 'of', 'singleskill', 'subproblems', 'so', 'that', 'each', 'one', 'is', 'a', 'combination', 'of', 'a', 'series', 'of', 'nested', 'binary', 'knapsack', 'problems', 'a', 'heuristic', 'procedure', 'is', 'proposed', 'to', 'solve', 'the', 'problem', 'our', 'experimental', 'results', 'based', 'on', 'a', 'realworld', 'case', 'study', 'reveal', 'that', 'the', 'proposed', 'method', 'quickly', 'produces', 'a', 'schedule', 'statistically', 'close', 'to', 'the', 'optimal', 'one', 'while', 'the', 'classical', 'optimal', 'procedure', 'is', 'very', 'timeconsuming']] | [-0.09394468362070937, 0.045813447675433286, -0.08783236846682571, 0.049484495669096504, -0.1231328128729345, -0.1318409231706795, 0.09309513529692935, 0.34623378604574473, -0.26789168023574006, -0.3503618769436365, 0.09646136610971472, -0.2491105503915828, -0.15871685325820634, 0.2131226055425446, -0.1219927182478108, 0.058337134576789074, 0.1061313591998856, 0.05323168112528922, -0.010106131070147769, -0.32233032540569273, 0.2632103710162903, 0.056229183982525556, 0.298896481390713, 0.03359580790738062, 0.10759850279238, -0.01270784280376927, -0.016208832228214155, 0.0379153444514084, -0.05119664875927483, 0.1223825730183827, 0.31664173950624913, 0.1919178098509861, 0.3856266943395746, -0.4047640367683505, -0.1662253456722413, 0.13333200277811308, 0.11199299373416877, 0.06479793213082946, 0.004280023326698158, -0.20168105631094224, 0.10753718962683817, -0.14464923792334944, -0.07300328368599825, -0.051048587071614304, 0.00012990746165619416, -0.003855308069971067, -0.3091586938881803, 0.015597019018288576, 0.030434218146616503, -0.01793511550189281, -0.062092128298467116, -0.11221109956921059, 0.027465957787115962, 0.1566856924577483, 0.09023126189242162, 0.02556133827631723, 0.11268615263132505, -0.1094945741684309, -0.13378141843872207, 0.4158590730203658, 0.017597347364893982, -0.2121846140378161, 0.16519730775078542, -0.07310967684603062, -0.14734233765020258, 0.1430624177755446, 0.18834074841951634, 0.14117231849124845, -0.1618704925161362, 0.017438369818969447, -0.09494035914033448, 0.2032853447591417, 0.030375126109388816, -0.025729311253165917, 0.15933794896973638, 0.20512629181089603, 0.12770074609386717, 0.14652204697755272, -0.03317698373041135, -0.10122733781126891, -0.26814753104786887, -0.14603650638339472, -0.21727566485812722, -0.008732641461763854, -0.07967290896399669, -0.17904978441264557, 0.41216647673119494, 0.1781277738168652, 0.19380456488579512, 0.07952837859910793, 0.32937268528859226, 0.10144711094031342, 0.07456482166216905, 0.08290148660268153, 0.17117670555060513, 0.05322069085882596, 0.09101754990659755, -0.24169756264147052, 0.11345966422588241, 0.06390458724515348] |
1,803.01253 | Hopf actions on vertex operator algebras | The Hopf actions on vertex operator algebras are investigated. If the action
is semisimple, a Schur-Weyl type decomposition is obtained. When the Hopf
algebra is finite dimensional and the action is faithful, the action is a group
action. Moreover if the Hopf algebra is finite dimensional and the action is
semisimple and inner faithful, the action is also a group action. In this case,
inner faithfulness is equivalent to faithfulness.
| math.QA math.RT | the hopf actions on vertex operator algebras are investigated if the action is semisimple a schurweyl type decomposition is obtained when the hopf algebra is finite dimensional and the action is faithful the action is a group action moreover if the hopf algebra is finite dimensional and the action is semisimple and inner faithful the action is also a group action in this case inner faithfulness is equivalent to faithfulness | [['the', 'hopf', 'actions', 'on', 'vertex', 'operator', 'algebras', 'are', 'investigated', 'if', 'the', 'action', 'is', 'semisimple', 'a', 'schurweyl', 'type', 'decomposition', 'is', 'obtained', 'when', 'the', 'hopf', 'algebra', 'is', 'finite', 'dimensional', 'and', 'the', 'action', 'is', 'faithful', 'the', 'action', 'is', 'a', 'group', 'action', 'moreover', 'if', 'the', 'hopf', 'algebra', 'is', 'finite', 'dimensional', 'and', 'the', 'action', 'is', 'semisimple', 'and', 'inner', 'faithful', 'the', 'action', 'is', 'also', 'a', 'group', 'action', 'in', 'this', 'case', 'inner', 'faithfulness', 'is', 'equivalent', 'to', 'faithfulness']] | [-0.19628829495715244, 0.12860056877668416, -0.12666996294366462, 0.037375386232244116, -0.21914268670869724, -0.14314103132512954, -0.07829582465679517, 0.39320100620388987, -0.33950535607125076, -0.1059469274976956, 0.19372960063462544, -0.22795383014849255, -0.17842429227062634, 0.14525938921474985, -0.18938524878716895, -0.12221887812816672, 0.15064481141577873, 0.2805053543964667, -0.12056553524785808, -0.25363052189350127, 0.4417764345450061, -0.003281381563283503, 0.27194338575271626, 0.017066876470510448, 0.14480044708720274, -0.009703019620584591, 0.02010708602943591, 0.015932522048907622, -0.05070352305525116, 0.056888876938527184, 0.26464370395988224, 0.03969019312810685, 0.21550480404070446, -0.30244872546089546, -0.13031109885445663, 0.15499269448752914, 0.10909478057042829, 0.051658974787486454, 0.0042704384025585435, -0.30821762204369796, 0.13001773787130202, -0.27645234327231133, -0.06606115185256516, -0.03998873183237655, 0.12203380009159445, -0.1822891044829573, -0.32050756423601084, 0.020194552848365025, 0.07244570375021014, 0.16145010079656327, -0.116257870762742, -0.0010645592053021703, -0.11656469459246312, 0.13706273663930396, -0.0643123542524076, 0.061561832816473074, 0.1535569654777646, -0.09912647038768878, -0.12633585049105542, 0.41097063714904447, -0.018780267937108873, -0.2820554395871503, 0.1921018080968809, -0.2194532686711422, -0.12382977455189186, 0.08614643013903073, 0.00999681619661195, 0.16807145882797028, -0.055816915974927335, 0.2712851778845236, -0.16788612861585403, 0.04257361250264304, 0.021319212757849267, -0.038353117422333785, 0.0737278077618352, 0.13136415216473063, 0.09227275235046234, 0.12428556486432041, 0.07639086450383599, -0.03794071867263743, -0.34980768114328387, -0.16437725573778153, -0.0757264057307371, 0.14897022676055452, -0.10671566589673083, -0.13016617195680738, 0.41476105047123774, 0.07027219682100362, 0.08834366817027331, 0.10468371749988624, 0.24455688425472805, 0.1490861455909908, 0.1342423481334533, 0.06982415351085365, 0.12029814539211137, 0.28052386975448046, -0.13546795352096005, -0.2069558774852859, -0.07285362717562488, 0.3507977955442454] |
1,803.01254 | Revisiting Spatial-Temporal Similarity: A Deep Learning Framework for
Traffic Prediction | Traffic prediction has drawn increasing attention in AI research field due to
the increasing availability of large-scale traffic data and its importance in
the real world. For example, an accurate taxi demand prediction can assist taxi
companies in pre-allocating taxis. The key challenge of traffic prediction lies
in how to model the complex spatial dependencies and temporal dynamics.
Although both factors have been considered in modeling, existing works make
strong assumptions about spatial dependence and temporal dynamics, i.e.,
spatial dependence is stationary in time, and temporal dynamics is strictly
periodical. However, in practice, the spatial dependence could be dynamic
(i.e., changing from time to time), and the temporal dynamics could have some
perturbation from one period to another period. In this paper, we make two
important observations: (1) the spatial dependencies between locations are
dynamic; and (2) the temporal dependency follows daily and weekly pattern but
it is not strictly periodic for its dynamic temporal shifting. To address these
two issues, we propose a novel Spatial-Temporal Dynamic Network (STDN), in
which a flow gating mechanism is introduced to learn the dynamic similarity
between locations, and a periodically shifted attention mechanism is designed
to handle long-term periodic temporal shifting. To the best of our knowledge,
this is the first work that tackles both issues in a unified framework. Our
experimental results on real-world traffic datasets verify the effectiveness of
the proposed method.
| cs.LG | traffic prediction has drawn increasing attention in ai research field due to the increasing availability of largescale traffic data and its importance in the real world for example an accurate taxi demand prediction can assist taxi companies in preallocating taxis the key challenge of traffic prediction lies in how to model the complex spatial dependencies and temporal dynamics although both factors have been considered in modeling existing works make strong assumptions about spatial dependence and temporal dynamics ie spatial dependence is stationary in time and temporal dynamics is strictly periodical however in practice the spatial dependence could be dynamic ie changing from time to time and the temporal dynamics could have some perturbation from one period to another period in this paper we make two important observations 1 the spatial dependencies between locations are dynamic and 2 the temporal dependency follows daily and weekly pattern but it is not strictly periodic for its dynamic temporal shifting to address these two issues we propose a novel spatialtemporal dynamic network stdn in which a flow gating mechanism is introduced to learn the dynamic similarity between locations and a periodically shifted attention mechanism is designed to handle longterm periodic temporal shifting to the best of our knowledge this is the first work that tackles both issues in a unified framework our experimental results on realworld traffic datasets verify the effectiveness of the proposed method | [['traffic', 'prediction', 'has', 'drawn', 'increasing', 'attention', 'in', 'ai', 'research', 'field', 'due', 'to', 'the', 'increasing', 'availability', 'of', 'largescale', 'traffic', 'data', 'and', 'its', 'importance', 'in', 'the', 'real', 'world', 'for', 'example', 'an', 'accurate', 'taxi', 'demand', 'prediction', 'can', 'assist', 'taxi', 'companies', 'in', 'preallocating', 'taxis', 'the', 'key', 'challenge', 'of', 'traffic', 'prediction', 'lies', 'in', 'how', 'to', 'model', 'the', 'complex', 'spatial', 'dependencies', 'and', 'temporal', 'dynamics', 'although', 'both', 'factors', 'have', 'been', 'considered', 'in', 'modeling', 'existing', 'works', 'make', 'strong', 'assumptions', 'about', 'spatial', 'dependence', 'and', 'temporal', 'dynamics', 'ie', 'spatial', 'dependence', 'is', 'stationary', 'in', 'time', 'and', 'temporal', 'dynamics', 'is', 'strictly', 'periodical', 'however', 'in', 'practice', 'the', 'spatial', 'dependence', 'could', 'be', 'dynamic', 'ie', 'changing', 'from', 'time', 'to', 'time', 'and', 'the', 'temporal', 'dynamics', 'could', 'have', 'some', 'perturbation', 'from', 'one', 'period', 'to', 'another', 'period', 'in', 'this', 'paper', 'we', 'make', 'two', 'important', 'observations', '1', 'the', 'spatial', 'dependencies', 'between', 'locations', 'are', 'dynamic', 'and', '2', 'the', 'temporal', 'dependency', 'follows', 'daily', 'and', 'weekly', 'pattern', 'but', 'it', 'is', 'not', 'strictly', 'periodic', 'for', 'its', 'dynamic', 'temporal', 'shifting', 'to', 'address', 'these', 'two', 'issues', 'we', 'propose', 'a', 'novel', 'spatialtemporal', 'dynamic', 'network', 'stdn', 'in', 'which', 'a', 'flow', 'gating', 'mechanism', 'is', 'introduced', 'to', 'learn', 'the', 'dynamic', 'similarity', 'between', 'locations', 'and', 'a', 'periodically', 'shifted', 'attention', 'mechanism', 'is', 'designed', 'to', 'handle', 'longterm', 'periodic', 'temporal', 'shifting', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'work', 'that', 'tackles', 'both', 'issues', 'in', 'a', 'unified', 'framework', 'our', 'experimental', 'results', 'on', 'realworld', 'traffic', 'datasets', 'verify', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method']] | [-0.11700105689182554, 0.08483585374405779, -0.08160372174689141, 0.08385148479643723, -0.1202973776537439, -0.13190879205889675, 0.03214145625749117, 0.445545683550122, -0.2896314658325813, -0.32227206494983124, 0.10765426774691467, -0.2578181974094427, -0.18123141921570768, 0.16728452273502784, -0.108923122617821, 0.07575458447099663, 0.04524043342655363, 0.030419033632168302, -0.021915674349672728, -0.22004301411443916, 0.2837843562496583, 0.04947749361719774, 0.3599492555342453, 0.0960679260791158, 0.08554466394150792, -0.003121309883325644, -0.07359283693544769, 0.005057560781563592, -0.04380031528938992, 0.13958069606603163, 0.2765262345884643, 0.15347429443930236, 0.3397732957387748, -0.45790443260060704, -0.27050100992555204, 0.08738700296405864, 0.12722465891957932, 0.07724849040545372, -0.015190419308719751, -0.2894832303823458, 0.08504495565050646, -0.13093877774055884, -0.09489901445897134, -0.0941472506393557, 0.04689767575883193, 0.02472018651492165, -0.2720681542105487, 0.0459629304666558, 0.0523158512847579, 0.0707409747335908, -0.04809805974870434, -0.023816389298957328, -0.004241271811011045, 0.20817152008657222, 0.09976757544690096, 0.008465190229775465, 0.09442589273473814, -0.11015376652864253, -0.14011068095088652, 0.37463763250928855, -0.038476362249449544, -0.1953451871132964, 0.1778536397715747, -0.12119754630991299, -0.1449718066835371, 0.09633950429016967, 0.23528162926111532, 0.0875467479320081, -0.1662846537732074, 0.016854373545831313, -0.022993945005936954, 0.21993234550944812, 0.0587943357582528, 0.012668847207564598, 0.1994315579391854, 0.2510705296172882, 0.0540922614252296, 0.09518181423545288, -0.11885258142087285, -0.16584541294318828, -0.19065115819887624, -0.06118466245540691, -0.14281027577108826, -0.02225617120825716, -0.11446570266675933, -0.11257560632233356, 0.4492348430253079, 0.22398802011638233, 0.2106608047797952, 0.05302131325866946, 0.3355292349335049, 0.07758518502662849, 0.061665064043431216, 0.07818259781064546, 0.15558460064639804, 0.02742353733426527, 0.21182472391823387, -0.22299716143524678, 0.13253151782099967, -0.008836144800095454] |
1,803.01255 | Understanding and Improving Multi-Sense Word Embeddings via Extended
Robust Principal Component Analysis | Unsupervised learned representations of polysemous words generate a large of
pseudo multi senses since unsupervised methods are overly sensitive to
contextual variations. In this paper, we address the pseudo multi-sense
detection for word embeddings by dimensionality reduction of sense pairs. We
propose a novel principal analysis method, termed Ex-RPCA, designed to detect
both pseudo multi senses and real multi senses. With Ex-RPCA, we empirically
show that pseudo multi senses are generated systematically in unsupervised
method. Moreover, the multi-sense word embeddings can by improved by a simple
linear transformation based on Ex-RPCA. Our improved word embedding outperform
the original one by 5.6 points on Stanford contextual word similarity (SCWS)
dataset. We hope our simple yet effective approach will help the linguistic
analysis of multi-sense word embeddings in the future.
| cs.CL | unsupervised learned representations of polysemous words generate a large of pseudo multi senses since unsupervised methods are overly sensitive to contextual variations in this paper we address the pseudo multisense detection for word embeddings by dimensionality reduction of sense pairs we propose a novel principal analysis method termed exrpca designed to detect both pseudo multi senses and real multi senses with exrpca we empirically show that pseudo multi senses are generated systematically in unsupervised method moreover the multisense word embeddings can by improved by a simple linear transformation based on exrpca our improved word embedding outperform the original one by 56 points on stanford contextual word similarity scws dataset we hope our simple yet effective approach will help the linguistic analysis of multisense word embeddings in the future | [['unsupervised', 'learned', 'representations', 'of', 'polysemous', 'words', 'generate', 'a', 'large', 'of', 'pseudo', 'multi', 'senses', 'since', 'unsupervised', 'methods', 'are', 'overly', 'sensitive', 'to', 'contextual', 'variations', 'in', 'this', 'paper', 'we', 'address', 'the', 'pseudo', 'multisense', 'detection', 'for', 'word', 'embeddings', 'by', 'dimensionality', 'reduction', 'of', 'sense', 'pairs', 'we', 'propose', 'a', 'novel', 'principal', 'analysis', 'method', 'termed', 'exrpca', 'designed', 'to', 'detect', 'both', 'pseudo', 'multi', 'senses', 'and', 'real', 'multi', 'senses', 'with', 'exrpca', 'we', 'empirically', 'show', 'that', 'pseudo', 'multi', 'senses', 'are', 'generated', 'systematically', 'in', 'unsupervised', 'method', 'moreover', 'the', 'multisense', 'word', 'embeddings', 'can', 'by', 'improved', 'by', 'a', 'simple', 'linear', 'transformation', 'based', 'on', 'exrpca', 'our', 'improved', 'word', 'embedding', 'outperform', 'the', 'original', 'one', 'by', '56', 'points', 'on', 'stanford', 'contextual', 'word', 'similarity', 'scws', 'dataset', 'we', 'hope', 'our', 'simple', 'yet', 'effective', 'approach', 'will', 'help', 'the', 'linguistic', 'analysis', 'of', 'multisense', 'word', 'embeddings', 'in', 'the', 'future']] | [-0.011795829677464821, 0.04889513594721715, -0.06622161720989375, 0.14502898594786184, -0.17702817538474488, -0.17797167761449328, 0.056647331061531005, 0.46729351540543435, -0.3304758083962608, -0.288649670985036, 0.03160394859907225, -0.3005988445191637, -0.2139097891791951, 0.16732119719037697, -0.14727544537048756, 0.044874800325143994, 0.13172099934010875, 0.11477577250714846, -0.10308117060702089, -0.2879805504894397, 0.32667446941665307, 0.010629774682685791, 0.36085039504077726, -0.05099883330545909, 0.15918526216593432, -0.0016914577421358252, -0.09395148006898504, -0.0039676228156826625, -0.06075419936752851, 0.23574309957426365, 0.32079066018991936, 0.18743310793940945, 0.3091655446374129, -0.3098175037637588, -0.20854334229251414, 0.09433024493229436, 0.1855572491781566, 0.0954045027450431, -0.06099166535207723, -0.38826681249664996, 0.14332383455787456, -0.15898921378836858, 0.07106678138714372, -0.18170082996650708, -0.04658113471709016, -0.02703409216881869, -0.24604060891539034, 0.031810369585336166, 0.14550021915571895, 0.06578595666434821, -0.06548139811530122, -0.0948452466446173, 0.07577121864023938, 0.10543633298581745, 0.012929442954638342, 0.03030862911663011, 0.10629408274535236, -0.1031576582362626, -0.21980273602512027, 0.3456755058150592, -0.14507866762285157, -0.28257708071078375, 0.18734284239366475, -0.005289599603760665, -0.16302619429165863, 0.03881018036815125, 0.24078931820745705, 0.09011652202924758, -0.16213518818913716, 0.03485982375325796, -0.06785978855726522, 0.21977707523922252, 0.08415413831221306, -0.011533552217920582, 0.1733100606576818, 0.21798300893938785, -0.006801023074209426, 0.12943883035258633, -0.10178470800403418, -0.0016689272194103462, -0.197055520566811, -0.10233606089375855, -0.15754934661200373, -0.04730991174386242, -0.11231081704707636, -0.15737109817197825, 0.40317244940679375, 0.2265999129951352, 0.23033475360510444, 0.11179466124103353, 0.3050081716542404, 0.024081380372338996, 0.11822557179614769, 0.08236528591318863, 0.16684475487582093, -0.008082951448388456, 0.08315425771691902, -0.1568276672954048, 0.0630440516837352, 0.14772211614757635] |
1,803.01256 | ZebraLancer: Decentralized Crowdsourcing of Human Knowledge atop Open
Blockchain | We design and implement the first private and anonymous decentralized
crowdsourcing system ZebraLancer, and overcome two fundamental challenges of
decentralizing crowdsourcing, i.e., data leakage and identity breach.
First, our outsource-then-prove methodology resolves the tension between the
blockchain transparency and the data confidentiality to guarantee the basic
utilities/fairness requirements of data crowdsourcing, thus ensuring: (i) a
requester will not pay more than what data deserve, according to a policy
announced when her task is published via the blockchain; (ii) each worker
indeed gets a payment based on the policy, if he submits data to the
blockchain; (iii) the above properties are realized not only without a central
arbiter, but also without leaking the data to the open blockchain. Second, the
transparency of blockchain allows one to infer private information about
workers and requesters through their participation history. Simply enabling
anonymity is seemingly attempting but will allow malicious workers to submit
multiple times to reap rewards. ZebraLancer also overcomes this problem by
allowing anonymous requests/submissions without sacrificing accountability. The
idea behind is a subtle linkability: if a worker submits twice to a task,
anyone can link the submissions, or else he stays anonymous and unlinkable
across tasks. To realize this delicate linkability, we put forward a novel
cryptographic concept, i.e., the common-prefix-linkable anonymous
authentication. We remark the new anonymous authentication scheme might be of
independent interest. Finally, we implement our protocol for a common image
annotation task and deploy it in a test net of Ethereum. The experiment results
show the applicability of our protocol atop the existing real-world blockchain.
| cs.HC cs.CR cs.DC cs.SI | we design and implement the first private and anonymous decentralized crowdsourcing system zebralancer and overcome two fundamental challenges of decentralizing crowdsourcing ie data leakage and identity breach first our outsourcethenprove methodology resolves the tension between the blockchain transparency and the data confidentiality to guarantee the basic utilitiesfairness requirements of data crowdsourcing thus ensuring i a requester will not pay more than what data deserve according to a policy announced when her task is published via the blockchain ii each worker indeed gets a payment based on the policy if he submits data to the blockchain iii the above properties are realized not only without a central arbiter but also without leaking the data to the open blockchain second the transparency of blockchain allows one to infer private information about workers and requesters through their participation history simply enabling anonymity is seemingly attempting but will allow malicious workers to submit multiple times to reap rewards zebralancer also overcomes this problem by allowing anonymous requestssubmissions without sacrificing accountability the idea behind is a subtle linkability if a worker submits twice to a task anyone can link the submissions or else he stays anonymous and unlinkable across tasks to realize this delicate linkability we put forward a novel cryptographic concept ie the commonprefixlinkable anonymous authentication we remark the new anonymous authentication scheme might be of independent interest finally we implement our protocol for a common image annotation task and deploy it in a test net of ethereum the experiment results show the applicability of our protocol atop the existing realworld blockchain | [['we', 'design', 'and', 'implement', 'the', 'first', 'private', 'and', 'anonymous', 'decentralized', 'crowdsourcing', 'system', 'zebralancer', 'and', 'overcome', 'two', 'fundamental', 'challenges', 'of', 'decentralizing', 'crowdsourcing', 'ie', 'data', 'leakage', 'and', 'identity', 'breach', 'first', 'our', 'outsourcethenprove', 'methodology', 'resolves', 'the', 'tension', 'between', 'the', 'blockchain', 'transparency', 'and', 'the', 'data', 'confidentiality', 'to', 'guarantee', 'the', 'basic', 'utilitiesfairness', 'requirements', 'of', 'data', 'crowdsourcing', 'thus', 'ensuring', 'i', 'a', 'requester', 'will', 'not', 'pay', 'more', 'than', 'what', 'data', 'deserve', 'according', 'to', 'a', 'policy', 'announced', 'when', 'her', 'task', 'is', 'published', 'via', 'the', 'blockchain', 'ii', 'each', 'worker', 'indeed', 'gets', 'a', 'payment', 'based', 'on', 'the', 'policy', 'if', 'he', 'submits', 'data', 'to', 'the', 'blockchain', 'iii', 'the', 'above', 'properties', 'are', 'realized', 'not', 'only', 'without', 'a', 'central', 'arbiter', 'but', 'also', 'without', 'leaking', 'the', 'data', 'to', 'the', 'open', 'blockchain', 'second', 'the', 'transparency', 'of', 'blockchain', 'allows', 'one', 'to', 'infer', 'private', 'information', 'about', 'workers', 'and', 'requesters', 'through', 'their', 'participation', 'history', 'simply', 'enabling', 'anonymity', 'is', 'seemingly', 'attempting', 'but', 'will', 'allow', 'malicious', 'workers', 'to', 'submit', 'multiple', 'times', 'to', 'reap', 'rewards', 'zebralancer', 'also', 'overcomes', 'this', 'problem', 'by', 'allowing', 'anonymous', 'requestssubmissions', 'without', 'sacrificing', 'accountability', 'the', 'idea', 'behind', 'is', 'a', 'subtle', 'linkability', 'if', 'a', 'worker', 'submits', 'twice', 'to', 'a', 'task', 'anyone', 'can', 'link', 'the', 'submissions', 'or', 'else', 'he', 'stays', 'anonymous', 'and', 'unlinkable', 'across', 'tasks', 'to', 'realize', 'this', 'delicate', 'linkability', 'we', 'put', 'forward', 'a', 'novel', 'cryptographic', 'concept', 'ie', 'the', 'commonprefixlinkable', 'anonymous', 'authentication', 'we', 'remark', 'the', 'new', 'anonymous', 'authentication', 'scheme', 'might', 'be', 'of', 'independent', 'interest', 'finally', 'we', 'implement', 'our', 'protocol', 'for', 'a', 'common', 'image', 'annotation', 'task', 'and', 'deploy', 'it', 'in', 'a', 'test', 'net', 'of', 'ethereum', 'the', 'experiment', 'results', 'show', 'the', 'applicability', 'of', 'our', 'protocol', 'atop', 'the', 'existing', 'realworld', 'blockchain']] | [-0.15063517910589108, -0.0069912089128924965, -0.08084416175298097, 0.07122198532987756, -0.19146178614547743, -0.27145417550179574, 0.1958524729374663, 0.38803016838972415, -0.2942572525584154, -0.33128670089331175, 0.11884128206570278, -0.29736685919643996, -0.07538199770201501, 0.146689125305293, -0.17656355898546439, 0.04005650603415681, 0.06324162429033701, 0.04012694518129888, 0.031038799273249294, -0.34118711814886726, 0.30314049247415764, 0.05007576605393773, 0.33085374280049035, 0.0959729177808936, 0.07229331561589673, 0.007938749220643547, -0.050283655227671954, -0.06398095599598448, -0.060231206176381204, 0.13768167686436164, 0.3174370316980732, 0.24402664413803052, 0.39311883086892996, -0.4231985121233655, -0.09084085256622601, 0.10070813852750386, 0.12144342109945322, 0.11431025113346377, -0.056274815846134314, -0.3352300309694357, 0.10129130557653832, -0.23868942221105544, -0.07564971668993138, -0.07563308126612803, -0.03504888071597273, -0.01661376711461575, -0.26375398137292544, -0.02315820183531965, 0.033158340252980235, 0.03596579987511393, 0.015471617364840182, -0.022230104643515207, -0.006235779398897042, 0.19576261783656682, 0.042579730491048566, -0.01468034661217918, 0.17267404598579372, -0.12981660168149992, -0.16893249102369218, 0.3923248928372881, 0.041310732839072384, -0.15589854349049606, 0.1350327454062016, -0.03398749306195116, -0.160685330304125, 0.062035485666008694, 0.16909899492378508, 0.05088388852568136, -0.1990372266499478, 0.0027604401351824875, -0.0672069784209487, 0.226775910825901, 0.04643505961090947, 0.024701860564250853, 0.18240970806200205, 0.16992971194087572, 0.09904152039985453, 0.08356962939179206, -0.008273476391978975, -0.10801727340338634, -0.24259919519115808, -0.1563745739842402, -0.16178037204857296, 0.051547413529381934, -0.0568925655213192, -0.09359092098690333, 0.34343920157633484, 0.2423464110775274, 0.15186077139722848, 0.05876022645090762, 0.4006362886958948, -0.006541299981541843, 0.10897291553047826, 0.1497410941956332, 0.17981353126251923, -0.028043670214838275, 0.19901958449063675, -0.14748908405280894, 0.18947475713803358, -0.0063284333697834335] |
1,803.01257 | Nonnegative Matrix Factorization for Signal and Data Analytics:
Identifiability, Algorithms, and Applications | Nonnegative matrix factorization (NMF) has become a workhorse for signal and
data analytics, triggered by its model parsimony and interpretability. Perhaps
a bit surprisingly, the understanding to its model identifiability---the major
reason behind the interpretability in many applications such as topic mining
and hyperspectral imaging---had been rather limited until recent years.
Beginning from the 2010s, the identifiability research of NMF has progressed
considerably: Many interesting and important results have been discovered by
the signal processing (SP) and machine learning (ML) communities. NMF
identifiability has a great impact on many aspects in practice, such as
ill-posed formulation avoidance and performance-guaranteed algorithm design. On
the other hand, there is no tutorial paper that introduces NMF from an
identifiability viewpoint. In this paper, we aim at filling this gap by
offering a comprehensive and deep tutorial on model identifiability of NMF as
well as the connections to algorithms and applications. This tutorial will help
researchers and graduate students grasp the essence and insights of NMF,
thereby avoiding typical `pitfalls' that are often times due to unidentifiable
NMF formulations. This paper will also help practitioners pick/design suitable
factorization tools for their own problems.
| eess.SP cs.LG stat.ML | nonnegative matrix factorization nmf has become a workhorse for signal and data analytics triggered by its model parsimony and interpretability perhaps a bit surprisingly the understanding to its model identifiabilitythe major reason behind the interpretability in many applications such as topic mining and hyperspectral imaginghad been rather limited until recent years beginning from the 2010s the identifiability research of nmf has progressed considerably many interesting and important results have been discovered by the signal processing sp and machine learning ml communities nmf identifiability has a great impact on many aspects in practice such as illposed formulation avoidance and performanceguaranteed algorithm design on the other hand there is no tutorial paper that introduces nmf from an identifiability viewpoint in this paper we aim at filling this gap by offering a comprehensive and deep tutorial on model identifiability of nmf as well as the connections to algorithms and applications this tutorial will help researchers and graduate students grasp the essence and insights of nmf thereby avoiding typical pitfalls that are often times due to unidentifiable nmf formulations this paper will also help practitioners pickdesign suitable factorization tools for their own problems | [['nonnegative', 'matrix', 'factorization', 'nmf', 'has', 'become', 'a', 'workhorse', 'for', 'signal', 'and', 'data', 'analytics', 'triggered', 'by', 'its', 'model', 'parsimony', 'and', 'interpretability', 'perhaps', 'a', 'bit', 'surprisingly', 'the', 'understanding', 'to', 'its', 'model', 'identifiabilitythe', 'major', 'reason', 'behind', 'the', 'interpretability', 'in', 'many', 'applications', 'such', 'as', 'topic', 'mining', 'and', 'hyperspectral', 'imaginghad', 'been', 'rather', 'limited', 'until', 'recent', 'years', 'beginning', 'from', 'the', '2010s', 'the', 'identifiability', 'research', 'of', 'nmf', 'has', 'progressed', 'considerably', 'many', 'interesting', 'and', 'important', 'results', 'have', 'been', 'discovered', 'by', 'the', 'signal', 'processing', 'sp', 'and', 'machine', 'learning', 'ml', 'communities', 'nmf', 'identifiability', 'has', 'a', 'great', 'impact', 'on', 'many', 'aspects', 'in', 'practice', 'such', 'as', 'illposed', 'formulation', 'avoidance', 'and', 'performanceguaranteed', 'algorithm', 'design', 'on', 'the', 'other', 'hand', 'there', 'is', 'no', 'tutorial', 'paper', 'that', 'introduces', 'nmf', 'from', 'an', 'identifiability', 'viewpoint', 'in', 'this', 'paper', 'we', 'aim', 'at', 'filling', 'this', 'gap', 'by', 'offering', 'a', 'comprehensive', 'and', 'deep', 'tutorial', 'on', 'model', 'identifiability', 'of', 'nmf', 'as', 'well', 'as', 'the', 'connections', 'to', 'algorithms', 'and', 'applications', 'this', 'tutorial', 'will', 'help', 'researchers', 'and', 'graduate', 'students', 'grasp', 'the', 'essence', 'and', 'insights', 'of', 'nmf', 'thereby', 'avoiding', 'typical', 'pitfalls', 'that', 'are', 'often', 'times', 'due', 'to', 'unidentifiable', 'nmf', 'formulations', 'this', 'paper', 'will', 'also', 'help', 'practitioners', 'pickdesign', 'suitable', 'factorization', 'tools', 'for', 'their', 'own', 'problems']] | [-0.01344574474659498, 0.0007246209219159428, -0.11678081629447319, 0.1049350702976157, -0.170823912489258, -0.21060242566556397, 0.008945311817105218, 0.4187871434235124, -0.29740844960875246, -0.33172175842988233, 0.18491368617872478, -0.26180963617404024, -0.23369975007259317, 0.16398196895381495, -0.1277780196396634, 0.11588865296692358, 0.11866025496975229, 0.023075261899340217, -0.07328442804595475, -0.27815722952464156, 0.2689185786256266, 0.1012124565618691, 0.28981766009813437, 0.08668072669955705, 0.08365724364518418, 0.011164392494866926, -0.05641969212741461, 0.003023152064371814, -0.0861979164274676, 0.14175757477861098, 0.3713059194426062, 0.26711085940503404, 0.40358974266376707, -0.4136345445789317, -0.22595522377229427, 0.12492697987009481, 0.1732179742176286, 0.08310281150343438, -0.08595643414532446, -0.2733807767220643, 0.0658409779062695, -0.17558625742532713, -0.045014768508100204, -0.12884224515460851, 0.015255550831376065, -0.05234189370586988, -0.20651128175868702, 0.005649147551320243, 0.09847761868681978, 0.08796099105208952, 0.005732804848512094, -0.2284069866022115, 0.10317546787035842, 0.10171998508765252, 0.13412938526673843, 0.037251405471745595, 0.0884218655228715, -0.18474795289778262, -0.12745139297218092, 0.3853077335052833, 0.03112452772135536, -0.1502907117027589, 0.24156330250484007, -0.020024674925802937, -0.21163567339110198, 0.10854314873245374, 0.21113871076733864, 0.03983156788112816, -0.17502233986893007, 0.09435780691633862, -0.009558808357675148, 0.14519892777353827, 0.047779358057205075, 0.031173905486025676, 0.20687968604346757, 0.23534471817284583, 0.04121108704167718, 0.07242328328767701, -0.02541105355003408, -0.0771830349269333, -0.18064059670238444, -0.10907460160813826, -0.18467183174785748, 0.010136872054308011, -0.06580867462522996, -0.1284276385233307, 0.4245911285791907, 0.22484276879338488, 0.1768400009611361, 0.012437005560489631, 0.3652252583734451, 0.04253526550957993, 0.06166834430643908, 0.05605396354866404, 0.18552637062290864, 0.15672621368781053, 0.18049578287047885, -0.11349805894117522, 0.1318981718467248, 0.013839246953026421] |
1,803.01258 | Schr\"odinger Evolution of Self-Gravitating Disks | An understanding of the long-term evolution of self-gravitating disks ranks
among the classic outstanding problems of astrophysics. In this work, we show
that the secular inclination dynamics of a geometrically thin quasi-Keplerian
disk, with a surface density profile that scales as the inverse square-root of
the orbital radius, are described by the time-dependent Schr\"odinger equation.
Within the context of this formalism, nodal bending waves correspond to the
eigenmodes of a quasiparticle's wavefunction, confined in an infinite square
well with boundaries given by the radial extent of the disk. We further show
that external secular perturbations upon self-gravitating disks exhibit a
mathematical similarity to quantum scattering theory. Employing this framework,
we derive an analytic criterion for the gravitational rigidity of a
nearly-Keplerian disk under external perturbations. Applications of the theory
to circumstellar disks and Galactic nuclei are discussed.
| astro-ph.EP astro-ph.GA | an understanding of the longterm evolution of selfgravitating disks ranks among the classic outstanding problems of astrophysics in this work we show that the secular inclination dynamics of a geometrically thin quasikeplerian disk with a surface density profile that scales as the inverse squareroot of the orbital radius are described by the timedependent schrodinger equation within the context of this formalism nodal bending waves correspond to the eigenmodes of a quasiparticles wavefunction confined in an infinite square well with boundaries given by the radial extent of the disk we further show that external secular perturbations upon selfgravitating disks exhibit a mathematical similarity to quantum scattering theory employing this framework we derive an analytic criterion for the gravitational rigidity of a nearlykeplerian disk under external perturbations applications of the theory to circumstellar disks and galactic nuclei are discussed | [['an', 'understanding', 'of', 'the', 'longterm', 'evolution', 'of', 'selfgravitating', 'disks', 'ranks', 'among', 'the', 'classic', 'outstanding', 'problems', 'of', 'astrophysics', 'in', 'this', 'work', 'we', 'show', 'that', 'the', 'secular', 'inclination', 'dynamics', 'of', 'a', 'geometrically', 'thin', 'quasikeplerian', 'disk', 'with', 'a', 'surface', 'density', 'profile', 'that', 'scales', 'as', 'the', 'inverse', 'squareroot', 'of', 'the', 'orbital', 'radius', 'are', 'described', 'by', 'the', 'timedependent', 'schrodinger', 'equation', 'within', 'the', 'context', 'of', 'this', 'formalism', 'nodal', 'bending', 'waves', 'correspond', 'to', 'the', 'eigenmodes', 'of', 'a', 'quasiparticles', 'wavefunction', 'confined', 'in', 'an', 'infinite', 'square', 'well', 'with', 'boundaries', 'given', 'by', 'the', 'radial', 'extent', 'of', 'the', 'disk', 'we', 'further', 'show', 'that', 'external', 'secular', 'perturbations', 'upon', 'selfgravitating', 'disks', 'exhibit', 'a', 'mathematical', 'similarity', 'to', 'quantum', 'scattering', 'theory', 'employing', 'this', 'framework', 'we', 'derive', 'an', 'analytic', 'criterion', 'for', 'the', 'gravitational', 'rigidity', 'of', 'a', 'nearlykeplerian', 'disk', 'under', 'external', 'perturbations', 'applications', 'of', 'the', 'theory', 'to', 'circumstellar', 'disks', 'and', 'galactic', 'nuclei', 'are', 'discussed']] | [-0.15360208424012156, 0.12148132429398294, -0.09571223145853865, 0.07533850203553745, -0.05842483422997659, -0.03193719832593725, -0.03683720622551594, 0.34538852382386714, -0.2629799068052267, -0.27385648555822506, 0.04427661588177574, -0.22685958513051924, -0.15377903940754323, 0.16819797151205368, -0.024252227482039236, 0.06819713027148515, 0.016559816828935685, -0.03251044298556164, -0.08335061019276316, -0.20378925510423843, 0.3406667110839872, 0.07690707929211459, 0.15187748444749274, 0.008434719296875852, 0.041853749471914996, -0.012675296168529639, 0.005178352661539603, 0.016047053008483057, -0.20737317804221436, 0.09962913276029438, 0.21550466559455989, 0.05719555193816658, 0.26020651042502185, -0.4527107294458542, -0.26168018115627456, 0.013121345399940101, 0.16248288290425592, 0.10813969485189794, -0.04330427363433324, -0.2670761814925575, 0.035780583549100554, -0.18241240935277764, -0.25430530275687246, -0.03130637971602761, 0.06718357251345242, 0.03345668317247046, -0.21209289103510184, 0.11834841536997008, 0.1206319204941188, 0.07217488051766027, -0.14495583103262705, -0.05479721247769185, -0.03273726522031981, 0.05313094724037678, 0.08373869547661203, 0.015654606207607002, 0.18651749946544097, -0.1277489067249877, -0.08722757517672858, 0.396418738675161, -0.07737715168427813, -0.19436347954328695, 0.1865186039698276, -0.1754020185933795, -0.07894878528577133, 0.12542104669744625, 0.19538162806390846, 0.1415149417916571, -0.12260427718207131, 0.10586613829951456, -0.07083790399895533, 0.17424797530143257, 0.08628061927182015, 0.024685228776261482, 0.31991684512935414, 0.11602094640528755, 0.04366236391739009, 0.13162217933657397, -0.09729909309845446, -0.13662819668139078, -0.29484756293971714, -0.10966192215431357, -0.1512603391111441, 0.07694895410006118, -0.10894307921065721, -0.21819113382566585, 0.35264553240479996, 0.08869273840606104, 0.19758390276318918, 0.024633978407421698, 0.2735132281770454, 0.1253473352994362, 0.0347397719666253, 0.12373935046136705, 0.27791830286533187, 0.20346768665039083, 0.06573249458475124, -0.29648143710079095, 0.007146276472421893, 0.056470196921867825] |
1,803.01259 | On the volume and the Chern-Simons invariant for the hyperbolic
alternating knot orbifolds | We extend the Neumann's methods and give the explicit formulae for the volume
and the Chern-Simons invariant for hyperbolic alternating knot orbifolds.
| math.GT | we extend the neumanns methods and give the explicit formulae for the volume and the chernsimons invariant for hyperbolic alternating knot orbifolds | [['we', 'extend', 'the', 'neumanns', 'methods', 'and', 'give', 'the', 'explicit', 'formulae', 'for', 'the', 'volume', 'and', 'the', 'chernsimons', 'invariant', 'for', 'hyperbolic', 'alternating', 'knot', 'orbifolds']] | [-0.16827015443281693, 0.0938134285775463, -0.10888304895806042, 0.19133548125285993, -0.11771799581633373, -0.15808362852443347, 0.0209554781798612, 0.29388748786666175, -0.1883535705168139, -0.2304733952676708, 0.14349806814623828, -0.2282471141396937, -0.1757262558252974, 0.1801577867432074, -0.15509035531431437, 0.04448996348814531, -0.009126522557132623, 0.05278312829746441, -0.221399980597198, -0.25590662929144775, 0.3477009023455056, -0.07694266702641141, 0.2201231795955788, 0.16909117658029904, 0.16190897063775497, -0.0019101891666650772, -0.10753822843120857, -0.006457516584884037, -0.28607951206239784, 0.15335943600670857, 0.2770266334780238, 0.023215561427853325, 0.021013049355877392, -0.4530551264231855, -0.14937368570826948, 0.10905033697120169, 0.13314589360644194, 0.08792885206639767, -0.053042226640338246, -0.31765182003040204, 0.007187256250869144, -0.19232362119311636, -0.15828441659157927, -0.13784777779470792, 0.018033236265182495, 0.02092411339452321, -0.19978126951239325, 0.07695869781309739, 0.11058297245339914, 0.0943462318232791, -0.03479961229657585, -0.12122499087656086, 0.05251390884884379, 0.1320615204643797, 0.06476207797161558, -0.015038325112651695, 0.08812072434970601, -0.0875588980588046, -0.16455055265264076, 0.34783962030302396, -0.059141280722211705, -0.33868287706916983, 0.09842898573895748, -0.08616460114717484, -0.21269304982640527, 0.18937060101465744, 0.07362299632619727, 0.16746544296091254, 0.014979639429260384, 0.17624412578086115, -0.141441220078956, 0.03347704496065324, 0.0892514322291721, -0.08515830134803598, 0.11054241327060894, -0.029585301876068115, 0.1405421376905658, 0.21194500713979572, -0.015084510669112206, -0.06972167221829295, -0.37320159714330325, -0.30496011210859497, -0.10392912509004501, 0.07966940007595853, -0.15441342544694303, -0.19314478100700813, 0.39568286058916285, 0.013998850841413845, 0.10970558700236407, 0.25347591043365275, 0.29811684821139683, 0.11986099421946247, 0.05774377565830946, 0.0656692036004229, 0.13933671623288485, 0.2267706123265353, 0.03924632409722439, -0.21086814203722912, -0.088929125869816, 0.3513500266285105] |
1,803.0126 | Unsupervised Learning of Face Representations | We present an approach for unsupervised training of CNNs in order to learn
discriminative face representations. We mine supervised training data by noting
that multiple faces in the same video frame must belong to different persons
and the same face tracked across multiple frames must belong to the same
person. We obtain millions of face pairs from hundreds of videos without using
any manual supervision. Although faces extracted from videos have a lower
spatial resolution than those which are available as part of standard
supervised face datasets such as LFW and CASIA-WebFace, the former represent a
much more realistic setting, e.g. in surveillance scenarios where most of the
faces detected are very small. We train our CNNs with the relatively low
resolution faces extracted from video frames collected, and achieve a higher
verification accuracy on the benchmark LFW dataset cf. hand-crafted features
such as LBPs, and even surpasses the performance of state-of-the-art deep
networks such as VGG-Face, when they are made to work with low resolution input
images.
| cs.CV | we present an approach for unsupervised training of cnns in order to learn discriminative face representations we mine supervised training data by noting that multiple faces in the same video frame must belong to different persons and the same face tracked across multiple frames must belong to the same person we obtain millions of face pairs from hundreds of videos without using any manual supervision although faces extracted from videos have a lower spatial resolution than those which are available as part of standard supervised face datasets such as lfw and casiawebface the former represent a much more realistic setting eg in surveillance scenarios where most of the faces detected are very small we train our cnns with the relatively low resolution faces extracted from video frames collected and achieve a higher verification accuracy on the benchmark lfw dataset cf handcrafted features such as lbps and even surpasses the performance of stateoftheart deep networks such as vggface when they are made to work with low resolution input images | [['we', 'present', 'an', 'approach', 'for', 'unsupervised', 'training', 'of', 'cnns', 'in', 'order', 'to', 'learn', 'discriminative', 'face', 'representations', 'we', 'mine', 'supervised', 'training', 'data', 'by', 'noting', 'that', 'multiple', 'faces', 'in', 'the', 'same', 'video', 'frame', 'must', 'belong', 'to', 'different', 'persons', 'and', 'the', 'same', 'face', 'tracked', 'across', 'multiple', 'frames', 'must', 'belong', 'to', 'the', 'same', 'person', 'we', 'obtain', 'millions', 'of', 'face', 'pairs', 'from', 'hundreds', 'of', 'videos', 'without', 'using', 'any', 'manual', 'supervision', 'although', 'faces', 'extracted', 'from', 'videos', 'have', 'a', 'lower', 'spatial', 'resolution', 'than', 'those', 'which', 'are', 'available', 'as', 'part', 'of', 'standard', 'supervised', 'face', 'datasets', 'such', 'as', 'lfw', 'and', 'casiawebface', 'the', 'former', 'represent', 'a', 'much', 'more', 'realistic', 'setting', 'eg', 'in', 'surveillance', 'scenarios', 'where', 'most', 'of', 'the', 'faces', 'detected', 'are', 'very', 'small', 'we', 'train', 'our', 'cnns', 'with', 'the', 'relatively', 'low', 'resolution', 'faces', 'extracted', 'from', 'video', 'frames', 'collected', 'and', 'achieve', 'a', 'higher', 'verification', 'accuracy', 'on', 'the', 'benchmark', 'lfw', 'dataset', 'cf', 'handcrafted', 'features', 'such', 'as', 'lbps', 'and', 'even', 'surpasses', 'the', 'performance', 'of', 'stateoftheart', 'deep', 'networks', 'such', 'as', 'vggface', 'when', 'they', 'are', 'made', 'to', 'work', 'with', 'low', 'resolution', 'input', 'images']] | [-0.017600910368769075, -0.008458557662639319, -0.014594026544294874, 0.058169920111097215, -0.0966325931894105, -0.1955650148031834, -0.03325633293466775, 0.47841663175218163, -0.23481755203448257, -0.3841025928323645, 0.09953955969415672, -0.33654758000990287, -0.09793983782791267, 0.19311040560881207, -0.18795792499856492, 0.060259712140361354, 0.19106824423596708, 0.0951817361610232, -0.0502243861424393, -0.3259232963693129, 0.28830772807816085, -0.005055283494411491, 0.3230044892212997, -0.020998487398693606, 0.1413302745294502, -0.06188378344467353, -0.027694135467754677, -0.0011097576435921447, 0.004857256969530897, 0.17936249716079883, 0.36294451543445966, 0.19500327529039213, 0.2845773742176659, -0.43061760928858783, -0.20602491952567584, 0.08686443772568878, 0.1419102658445419, 0.1257677866490537, -0.02534179884770267, -0.38036433559110655, 0.14058228448266163, -0.14827698520440163, 0.051641283803508575, -0.13186183775819482, -0.03714558991002074, -0.03215278065112043, -0.27487558339877677, 0.04237966003018387, 0.02980084252721142, 0.13877643974930315, -0.05777252223647554, -0.13517389847298286, -0.009139678625312323, 0.22906716875790845, 0.04664898211333258, 0.055342625169682184, 0.12512588127615995, -0.253294224507131, -0.10129080691036679, 0.4170575908363043, -0.06249540774236569, -0.20150008987236237, 0.2665863689118331, -0.08485743530937248, -0.13172160677744874, 0.1267271535374069, 0.23217989841387385, 0.1560872116838471, -0.14258353173681826, -0.04473481493845438, -0.08424475703144535, 0.19362137541715388, 0.14244089189395753, 0.039132066312179505, 0.1690609507942489, 0.23231778571027376, -0.003900165995305759, 0.11765899534692012, -0.19322829755782595, -0.010258873073672433, -0.19632150275546814, -0.04691132907902058, -0.2352238974764034, -0.028838294100881155, -0.12354924583251843, -0.11781256336421177, 0.36761378590017557, 0.23817271972629464, 0.26360679422283456, 0.12296826044465499, 0.33711937472357284, -0.04202774055184342, 0.1925898299320709, 0.07288215430786035, 0.16703138165619402, -0.09603323455805712, 0.13370707370839746, -0.09001620120086175, 0.05126610807721071, 0.03775350081767621] |
1,803.01261 | AntShield: On-Device Detection of Personal Information Exposure | Mobile devices have access to personal, potentially sensitive data, and there
is a growing number of applications that transmit this personally identifiable
information (PII) over the network. In this paper, we present the AntShield
system that performs on-device packet-level monitoring and detects the
transmission of such sensitive information accurately and in real-time. A key
insight is to distinguish PII that is predefined and is easily available on the
device from PII that is unknown a priori but can be automatically detected by
classifiers. Our system not only combines, for the first time, the advantages
of on-device monitoring with the power of learning unknown PII, but also
outperforms either of the two approaches alone. We demonstrate the real-time
performance of our prototype as well as the classification performance using a
dataset that we collect and analyze from scratch (including new findings in
terms of leaks and patterns). AntShield is a first step towards enabling
distributed learning of private information exposure.
| cs.NI cs.CR | mobile devices have access to personal potentially sensitive data and there is a growing number of applications that transmit this personally identifiable information pii over the network in this paper we present the antshield system that performs ondevice packetlevel monitoring and detects the transmission of such sensitive information accurately and in realtime a key insight is to distinguish pii that is predefined and is easily available on the device from pii that is unknown a priori but can be automatically detected by classifiers our system not only combines for the first time the advantages of ondevice monitoring with the power of learning unknown pii but also outperforms either of the two approaches alone we demonstrate the realtime performance of our prototype as well as the classification performance using a dataset that we collect and analyze from scratch including new findings in terms of leaks and patterns antshield is a first step towards enabling distributed learning of private information exposure | [['mobile', 'devices', 'have', 'access', 'to', 'personal', 'potentially', 'sensitive', 'data', 'and', 'there', 'is', 'a', 'growing', 'number', 'of', 'applications', 'that', 'transmit', 'this', 'personally', 'identifiable', 'information', 'pii', 'over', 'the', 'network', 'in', 'this', 'paper', 'we', 'present', 'the', 'antshield', 'system', 'that', 'performs', 'ondevice', 'packetlevel', 'monitoring', 'and', 'detects', 'the', 'transmission', 'of', 'such', 'sensitive', 'information', 'accurately', 'and', 'in', 'realtime', 'a', 'key', 'insight', 'is', 'to', 'distinguish', 'pii', 'that', 'is', 'predefined', 'and', 'is', 'easily', 'available', 'on', 'the', 'device', 'from', 'pii', 'that', 'is', 'unknown', 'a', 'priori', 'but', 'can', 'be', 'automatically', 'detected', 'by', 'classifiers', 'our', 'system', 'not', 'only', 'combines', 'for', 'the', 'first', 'time', 'the', 'advantages', 'of', 'ondevice', 'monitoring', 'with', 'the', 'power', 'of', 'learning', 'unknown', 'pii', 'but', 'also', 'outperforms', 'either', 'of', 'the', 'two', 'approaches', 'alone', 'we', 'demonstrate', 'the', 'realtime', 'performance', 'of', 'our', 'prototype', 'as', 'well', 'as', 'the', 'classification', 'performance', 'using', 'a', 'dataset', 'that', 'we', 'collect', 'and', 'analyze', 'from', 'scratch', 'including', 'new', 'findings', 'in', 'terms', 'of', 'leaks', 'and', 'patterns', 'antshield', 'is', 'a', 'first', 'step', 'towards', 'enabling', 'distributed', 'learning', 'of', 'private', 'information', 'exposure']] | [-0.10794572708060503, 0.016210438206103767, -0.07929994688505769, 0.018677549178646818, -0.10665099669224137, -0.20486210622664563, 0.08220423901806567, 0.3991599951047305, -0.26542886713472236, -0.33377342868098026, 0.16229221400149332, -0.314699436806344, -0.16204026625432358, 0.23153778743947956, -0.1082593439302985, 0.03187617017727369, 0.08148773246782885, 0.07275088810937325, -0.015830357809651904, -0.24812815239086486, 0.30488357929717513, 0.054160195218909316, 0.2992487303248257, 0.058803250543049475, 0.12128663517217371, 0.0007310437044472831, -0.06142106148559648, 0.007832096325519797, -0.03238867837784606, 0.13706411168447868, 0.3063296756520274, 0.24043038268840522, 0.29225233543343887, -0.4113241030959187, -0.22889240228446425, 0.08919859163842764, 0.17208077489164106, 0.10014094854853335, -0.06754674621676778, -0.32207175813449224, 0.1156241664111282, -0.17890607965457592, -0.03959953047438587, -0.13292164394074374, -0.023445661417000992, 0.02984104877090153, -0.2928599191408391, 0.029328665063585967, 0.017184809215847332, 0.05986019021795861, -0.022864614089577944, -0.06048381515885377, 0.00963962481469865, 0.22559833406191912, 0.012954665225586456, 0.0007711114357433216, 0.1476315668143427, -0.13466518574726477, -0.1156745204689113, 0.3595644980164802, -0.028949392673256955, -0.15390638358873215, 0.17602113668605163, -0.05096121644008027, -0.15038904043768717, 0.12950723592761407, 0.21475276150399594, 0.10595329484018455, -0.20447335125297117, 0.0030108775630605165, -0.029362846326059216, 0.2347283978371104, 0.0031790982184421485, 0.0755719733913874, 0.16755354644695095, 0.22097540367987883, 0.07215266300151778, 0.12072034370507095, -0.12655681333575802, -0.04139322941161835, -0.25912515473163505, -0.17137838970679956, -0.22149376583339017, 0.01362811335205667, -0.046099374168085315, -0.10863362798455414, 0.4165552731627112, 0.2332864664050092, 0.16169227441701634, 0.05215865931811796, 0.39363886194101944, 0.036049928083114184, 0.10752810275027896, 0.11606194678498254, 0.18243966002764692, -0.014880530591045691, 0.14290178132578613, -0.16151505107783778, 0.15167451046472474, -0.05657280194662084] |
1,803.01262 | A conservative diffuse interface method for two-phase flows with
provable boundedness properties | Central finite difference schemes have long been avoided in the context of
two-phase flows for the advection of the phase indicator function due to
numerical overshoots and undershoots associated with their dispersion errors.
We will show however, for an incompressible flow, in the context of a specific
diffuse interface model, one can maintain the boundedness of the phase field
while also taking advantage of the low cost and ease of implementation of
central differences to construct a non-dissipative discretization scheme for
the advective terms. This is made possible by combining the advection and
reinitialization steps of a conservative level set scheme introduced by Olsson
and Kreiss [J. Comput. Phys., 210, 225 (2005)] to form a phase field equation
similar to that of Chiu and Lin [J. Comput. Phys., 230, 185 (2011)]. Instead of
resorting to specialized upwind methods as in these articles, we prove that the
boundedness of the phase field is guaranteed for certain choices of the free
parameters ($\epsilon$ and $\gamma$) for a specific central difference scheme
that we propose. The proposed discretely conservative and bounded phase field
equation, which is free of any reinitialization or mass redistribution,
possesses desirable properties that can be leveraged in the coupled finite
difference discretization of the two-phase momentum equation. Additionally, as
compared to the state-of-the-art conservative and bounded two-phase flow
methods, the proposed method boasts competitive accuracy-vs-cost trade-off,
small memory requirements, ease of implementation and excellent
parallelizability, providing a viable alternative for realistic two-phase flow
calculations.
| physics.flu-dyn physics.comp-ph | central finite difference schemes have long been avoided in the context of twophase flows for the advection of the phase indicator function due to numerical overshoots and undershoots associated with their dispersion errors we will show however for an incompressible flow in the context of a specific diffuse interface model one can maintain the boundedness of the phase field while also taking advantage of the low cost and ease of implementation of central differences to construct a nondissipative discretization scheme for the advective terms this is made possible by combining the advection and reinitialization steps of a conservative level set scheme introduced by olsson and kreiss j comput phys 210 225 2005 to form a phase field equation similar to that of chiu and lin j comput phys 230 185 2011 instead of resorting to specialized upwind methods as in these articles we prove that the boundedness of the phase field is guaranteed for certain choices of the free parameters epsilon and gamma for a specific central difference scheme that we propose the proposed discretely conservative and bounded phase field equation which is free of any reinitialization or mass redistribution possesses desirable properties that can be leveraged in the coupled finite difference discretization of the twophase momentum equation additionally as compared to the stateoftheart conservative and bounded twophase flow methods the proposed method boasts competitive accuracyvscost tradeoff small memory requirements ease of implementation and excellent parallelizability providing a viable alternative for realistic twophase flow calculations | [['central', 'finite', 'difference', 'schemes', 'have', 'long', 'been', 'avoided', 'in', 'the', 'context', 'of', 'twophase', 'flows', 'for', 'the', 'advection', 'of', 'the', 'phase', 'indicator', 'function', 'due', 'to', 'numerical', 'overshoots', 'and', 'undershoots', 'associated', 'with', 'their', 'dispersion', 'errors', 'we', 'will', 'show', 'however', 'for', 'an', 'incompressible', 'flow', 'in', 'the', 'context', 'of', 'a', 'specific', 'diffuse', 'interface', 'model', 'one', 'can', 'maintain', 'the', 'boundedness', 'of', 'the', 'phase', 'field', 'while', 'also', 'taking', 'advantage', 'of', 'the', 'low', 'cost', 'and', 'ease', 'of', 'implementation', 'of', 'central', 'differences', 'to', 'construct', 'a', 'nondissipative', 'discretization', 'scheme', 'for', 'the', 'advective', 'terms', 'this', 'is', 'made', 'possible', 'by', 'combining', 'the', 'advection', 'and', 'reinitialization', 'steps', 'of', 'a', 'conservative', 'level', 'set', 'scheme', 'introduced', 'by', 'olsson', 'and', 'kreiss', 'j', 'comput', 'phys', '210', '225', '2005', 'to', 'form', 'a', 'phase', 'field', 'equation', 'similar', 'to', 'that', 'of', 'chiu', 'and', 'lin', 'j', 'comput', 'phys', '230', '185', '2011', 'instead', 'of', 'resorting', 'to', 'specialized', 'upwind', 'methods', 'as', 'in', 'these', 'articles', 'we', 'prove', 'that', 'the', 'boundedness', 'of', 'the', 'phase', 'field', 'is', 'guaranteed', 'for', 'certain', 'choices', 'of', 'the', 'free', 'parameters', 'epsilon', 'and', 'gamma', 'for', 'a', 'specific', 'central', 'difference', 'scheme', 'that', 'we', 'propose', 'the', 'proposed', 'discretely', 'conservative', 'and', 'bounded', 'phase', 'field', 'equation', 'which', 'is', 'free', 'of', 'any', 'reinitialization', 'or', 'mass', 'redistribution', 'possesses', 'desirable', 'properties', 'that', 'can', 'be', 'leveraged', 'in', 'the', 'coupled', 'finite', 'difference', 'discretization', 'of', 'the', 'twophase', 'momentum', 'equation', 'additionally', 'as', 'compared', 'to', 'the', 'stateoftheart', 'conservative', 'and', 'bounded', 'twophase', 'flow', 'methods', 'the', 'proposed', 'method', 'boasts', 'competitive', 'accuracyvscost', 'tradeoff', 'small', 'memory', 'requirements', 'ease', 'of', 'implementation', 'and', 'excellent', 'parallelizability', 'providing', 'a', 'viable', 'alternative', 'for', 'realistic', 'twophase', 'flow', 'calculations']] | [-0.12456317965635938, 0.08212986457039703, -0.0765598642393626, 0.027927932223557023, -0.0827921229866944, -0.1267771678595025, 0.05304930821732908, 0.3579859781941613, -0.2644008907306268, -0.32091699757414766, 0.10210167264735677, -0.22177413129629414, -0.07629953562062554, 0.1906202197061531, -0.09903496889908966, 0.07231164767767577, 0.04309883018570082, -0.04055865080340109, -0.08761098560615686, -0.23485041370035195, 0.2700779398287299, 0.05373782547167884, 0.2826920420183804, 0.05686076018829509, 0.14673692634716615, -0.035993455960720656, -0.04684321010999618, 0.036622469126414814, -0.143332581282579, 0.07456600572818463, 0.23968914638990996, 0.03815425689080272, 0.28089541450265, -0.40146251148391576, -0.23605899093290944, 0.10171436441901949, 0.13297310892824601, 0.07196109058558711, -0.05942920311335016, -0.2477826677858219, 0.09742468100644221, -0.2033768655187412, -0.12515921186327505, -0.10093364799032599, 0.035882487026669206, 0.04138055122500385, -0.2975000565772357, 0.12783900792097394, 0.06989169984933782, 0.03583961525322086, -0.056327334683403736, -0.10238436220183236, -0.04011348381230119, 0.07916744922184706, 0.008673280879490642, 0.046053896883915785, 0.07653476412553097, -0.10981216550457337, -0.07887520430014149, 0.3940488950246334, -0.08069133089299955, -0.2188482023164874, 0.19978781159371747, -0.06885104124304518, -0.07513735570170016, 0.1668143368967366, 0.14901184022701422, 0.12187967573046364, -0.1358906964296246, 0.09846809218515028, -0.018526247233060785, 0.16199243745049002, 0.055377753609867734, 0.005394755381724385, 0.12528017675885778, 0.1457800789956637, 0.07460869608168322, 0.1002170234593204, -0.07851251001211196, -0.13540480089145826, -0.3114955721596699, -0.1868655327603161, -0.15164934923742576, 0.008857608809074784, -0.101266150801673, -0.15096610242149747, 0.36848711686701285, 0.1600164637174963, 0.14486375699949558, 0.0351159586251492, 0.28700533873863426, 0.15050243685785614, 0.022337752580332576, 0.13214693957038956, 0.22857342320246254, 0.14420183853543989, 0.12514375823217858, -0.2440689159905515, 0.0364048826435703, 0.10116035219500906] |
1,803.01263 | Discrete time Toda systems | In this paper, we discuss several concepts of the modern theory of discrete
integrable systems, including:
- Time discretization based on the notion of B\"acklund transformation;
- Symplectic realizations of multi-Hamiltonian structures;
- Interrelations between discrete 1D systems and lattice 2D systems;
- Multi-dimensional consistency as integrability of discrete systems;
- Interrelations between integrable systems of quad-equations and integrable
systems of Laplace type;
- Pluri-Lagrangian structure as integrability of discrete variational
systems.
All these concepts are illustrated by the discrete time Toda lattices and
their relativistic analogs.
| math-ph math.MP nlin.SI | in this paper we discuss several concepts of the modern theory of discrete integrable systems including time discretization based on the notion of backlund transformation symplectic realizations of multihamiltonian structures interrelations between discrete 1d systems and lattice 2d systems multidimensional consistency as integrability of discrete systems interrelations between integrable systems of quadequations and integrable systems of laplace type plurilagrangian structure as integrability of discrete variational systems all these concepts are illustrated by the discrete time toda lattices and their relativistic analogs | [['in', 'this', 'paper', 'we', 'discuss', 'several', 'concepts', 'of', 'the', 'modern', 'theory', 'of', 'discrete', 'integrable', 'systems', 'including', 'time', 'discretization', 'based', 'on', 'the', 'notion', 'of', 'backlund', 'transformation', 'symplectic', 'realizations', 'of', 'multihamiltonian', 'structures', 'interrelations', 'between', 'discrete', '1d', 'systems', 'and', 'lattice', '2d', 'systems', 'multidimensional', 'consistency', 'as', 'integrability', 'of', 'discrete', 'systems', 'interrelations', 'between', 'integrable', 'systems', 'of', 'quadequations', 'and', 'integrable', 'systems', 'of', 'laplace', 'type', 'plurilagrangian', 'structure', 'as', 'integrability', 'of', 'discrete', 'variational', 'systems', 'all', 'these', 'concepts', 'are', 'illustrated', 'by', 'the', 'discrete', 'time', 'toda', 'lattices', 'and', 'their', 'relativistic', 'analogs']] | [-0.17437282824934816, 0.08175079084725843, -0.057613591203627024, 0.14164873413068968, -0.0720621924329963, -0.1553812625668483, -0.04601194729948026, 0.35640047635469174, -0.3488987997220254, -0.21749551332107298, 0.1617784281189404, -0.23835676100197029, -0.23495412827181963, 0.1958428227837071, -0.04148991495646812, 0.15522901928857152, 0.03935746205855667, -0.04130322610913419, -0.21639552168594098, -0.24853188436288662, 0.385378599172619, -0.035718302759859294, 0.2526631426572064, -0.04562988097744959, 0.14514217355373363, 0.02832803119226922, -0.026515396472848493, -0.05726734931684203, -0.11232689467983113, 0.15397348085038917, 0.23291782865208793, 0.034221579096521494, 0.20565508548917685, -0.4460020500384731, -0.2409210753293685, 0.06919310640336739, 0.1433386000758612, 0.0828754583971552, 0.0006348338182210738, -0.3506008745343597, -0.016869273059713988, -0.11934877282445445, -0.18963869118971038, -0.10739542098922862, 0.01917520174641668, 0.1484853614144671, -0.13810103964764786, 0.12888233975037885, 0.13046920390937616, 0.1571203040556959, -0.1241630478417156, -0.059593041323953204, -0.07510801710412596, 0.059438894887995204, -0.026394553591761693, -0.08783474228241378, 0.013948122344129248, -0.05186813285884758, -0.22176438214165378, 0.47278629815964784, 0.02459508056441943, -0.28370962388537546, 0.25303243885656107, -0.050869513038591836, -0.22374355856812111, 0.04929965534419925, 0.1917515168984041, 0.05962975535909703, -0.17249757467760463, 0.15803303070334765, -0.05759012932532731, 0.09405821353990447, 0.04805003522814792, 0.1253094979573363, 0.20329538491313104, 0.13988503425979965, 0.020327679439229362, 0.10698545734672218, 0.03842713955623086, -0.25696472034295215, -0.3312317718418292, -0.15797287558009962, -0.17421408334637728, 0.06391179053986698, -0.08698305849759856, -0.19439148240044346, 0.3635085417578618, 0.1146207345465635, 0.11102007719239702, 0.09366164996035765, 0.15447158921929652, 0.15223535139654062, 0.014404912043742283, -0.0109632848445786, 0.09363789046988075, 0.2589884147904583, 0.10784066236221496, -0.21452911559745302, -0.13595287617939858, 0.22418239766754855] |
1,803.01264 | Relative linear extensions of sextic del Pezzo fibrations | In this paper, we study a sextic del Pezzo fibration over a curve
comprehensively. We obtain certain formulae of several basic invariants of such
a fibration. We also establish the embedding theorem of such a fibration which
asserts that every such a fibration is a relative linear section of a Mori
fiber space with the general fiber $(\mathbb{P}^{1})^{3}$ and that with the
general fiber $(\mathbb{P}^{2})^{2}$. As an application of this embedding
theorem, we classify singular fibers of such a fibrations and answer a question
of T. Fujita about existence of non-normal fibers.
| math.AG | in this paper we study a sextic del pezzo fibration over a curve comprehensively we obtain certain formulae of several basic invariants of such a fibration we also establish the embedding theorem of such a fibration which asserts that every such a fibration is a relative linear section of a mori fiber space with the general fiber mathbbp13 and that with the general fiber mathbbp22 as an application of this embedding theorem we classify singular fibers of such a fibrations and answer a question of t fujita about existence of nonnormal fibers | [['in', 'this', 'paper', 'we', 'study', 'a', 'sextic', 'del', 'pezzo', 'fibration', 'over', 'a', 'curve', 'comprehensively', 'we', 'obtain', 'certain', 'formulae', 'of', 'several', 'basic', 'invariants', 'of', 'such', 'a', 'fibration', 'we', 'also', 'establish', 'the', 'embedding', 'theorem', 'of', 'such', 'a', 'fibration', 'which', 'asserts', 'that', 'every', 'such', 'a', 'fibration', 'is', 'a', 'relative', 'linear', 'section', 'of', 'a', 'mori', 'fiber', 'space', 'with', 'the', 'general', 'fiber', 'mathbbp13', 'and', 'that', 'with', 'the', 'general', 'fiber', 'mathbbp22', 'as', 'an', 'application', 'of', 'this', 'embedding', 'theorem', 'we', 'classify', 'singular', 'fibers', 'of', 'such', 'a', 'fibrations', 'and', 'answer', 'a', 'question', 'of', 't', 'fujita', 'about', 'existence', 'of', 'nonnormal', 'fibers']] | [-0.1999858074614571, -0.021328988854414397, -0.13161620299021404, 0.09276507480665007, -0.06885790797985263, -0.16606044250333474, 0.016345469023670175, 0.31756787803024056, -0.32410481323798496, -0.19279055547797017, 0.11140737138662694, -0.25629504694499905, -0.22796632216518953, 0.2239950992891358, -0.20144774975876015, 0.006690986309614446, 0.06316198298914565, 0.05266545254012777, -0.10212105391547084, -0.3001461856895023, 0.416905307976736, -0.08870040419925418, 0.19829128641221258, 0.11705303113493655, 0.18806694217233194, 0.07067991031023363, 0.026234110144691333, 0.0014020536039930044, -0.20906585297214203, 0.15691664923603335, 0.32084661962257494, 0.08621125797637635, 0.19920731184797155, -0.3239985074262626, -0.19717027811954418, 0.23082401630365187, 0.06633104999653167, 0.06777989720996831, 0.010340467974957492, -0.22477937274509005, 0.09886857738407949, -0.17473965746661027, -0.21216680142614577, -0.0826374780593647, 0.021612252812418672, 0.060592515546725026, -0.19161610452251301, -0.0878290280107952, 0.178885131606512, 0.14434466734528542, -0.010670862988465361, 0.019292809263182182, -0.07215829624070061, 0.03425819761533704, 0.023576201348856154, 0.06523797922095077, 0.0816449447580251, -0.10984930909342236, -0.0836176534416154, 0.3662657395341537, -0.12687414390966295, -0.19243520895640057, 0.07450047167173277, -0.09559895843267441, -0.16171652255321128, 0.13323054837269915, 0.12415403241498603, 0.19274399949806845, -0.032803402944571444, 0.14139340124481048, -0.15301809000472227, 0.1196950327605009, 0.16260329199333987, -0.0051180002680565745, 0.12400343416827835, 0.1838238781525029, 0.08756767137803965, 0.0994810246138109, -0.04207721702857978, -0.002360552466577954, -0.4171238328433699, -0.27043993836786184, -0.07500405384020672, 0.21258147481001086, -0.11596138582842994, -0.18195362821635272, 0.4569147045982795, 0.005336327426549461, 0.2502976904105809, 0.10866215127753094, 0.25337483713196385, 0.010666244372259825, 0.023552244627434347, 0.027535427273768516, 0.1889014588875903, 0.2100847185951554, -0.0012205401223683212, -0.050991559116583735, -0.05750269139599469, 0.1769983518247803] |
1,803.01265 | Study of a Dynamic Cooperative Trading Queue Routing Control Scheme for
Freeways and Facilities with Parallel Queues | This article explores the coalitional stability of a new cooperative control
policy for freeways and parallel queuing facilities with multiple servers.
Based on predicted future delays per queue or lane, a VOT-heterogeneous
population of agents can agree to switch lanes or queues and transfer payments
to each other in order to minimize the total cost of the incoming platoon. The
strategic interaction is captured by an n-level Stackelberg model with
coalitions, while the cooperative structure is formulated as a partition
function game (PFG). The stability concept explored is the strong-core for PFGs
which we found appropiate given the nature of the problem. This concept ensures
that the efficient allocation is individually rational and coalitionally
stable. We analyze this control mechanism for two settings: a static vertical
queue and a dynamic horizontal queue. For the former, we first characterize the
properties of the underlying cooperative game. Our simulation results suggest
that the setting is always strong-core stable. For the latter, we propose a new
relaxation program for the strong-core concept. Our simulation results on a
freeway bottleneck with constant outflow using Newell's car-following model
show the imputations to be generally strong-core stable and the coalitional
instabilities to remain small with regard to users' costs.
| cs.GT | this article explores the coalitional stability of a new cooperative control policy for freeways and parallel queuing facilities with multiple servers based on predicted future delays per queue or lane a votheterogeneous population of agents can agree to switch lanes or queues and transfer payments to each other in order to minimize the total cost of the incoming platoon the strategic interaction is captured by an nlevel stackelberg model with coalitions while the cooperative structure is formulated as a partition function game pfg the stability concept explored is the strongcore for pfgs which we found appropiate given the nature of the problem this concept ensures that the efficient allocation is individually rational and coalitionally stable we analyze this control mechanism for two settings a static vertical queue and a dynamic horizontal queue for the former we first characterize the properties of the underlying cooperative game our simulation results suggest that the setting is always strongcore stable for the latter we propose a new relaxation program for the strongcore concept our simulation results on a freeway bottleneck with constant outflow using newells carfollowing model show the imputations to be generally strongcore stable and the coalitional instabilities to remain small with regard to users costs | [['this', 'article', 'explores', 'the', 'coalitional', 'stability', 'of', 'a', 'new', 'cooperative', 'control', 'policy', 'for', 'freeways', 'and', 'parallel', 'queuing', 'facilities', 'with', 'multiple', 'servers', 'based', 'on', 'predicted', 'future', 'delays', 'per', 'queue', 'or', 'lane', 'a', 'votheterogeneous', 'population', 'of', 'agents', 'can', 'agree', 'to', 'switch', 'lanes', 'or', 'queues', 'and', 'transfer', 'payments', 'to', 'each', 'other', 'in', 'order', 'to', 'minimize', 'the', 'total', 'cost', 'of', 'the', 'incoming', 'platoon', 'the', 'strategic', 'interaction', 'is', 'captured', 'by', 'an', 'nlevel', 'stackelberg', 'model', 'with', 'coalitions', 'while', 'the', 'cooperative', 'structure', 'is', 'formulated', 'as', 'a', 'partition', 'function', 'game', 'pfg', 'the', 'stability', 'concept', 'explored', 'is', 'the', 'strongcore', 'for', 'pfgs', 'which', 'we', 'found', 'appropiate', 'given', 'the', 'nature', 'of', 'the', 'problem', 'this', 'concept', 'ensures', 'that', 'the', 'efficient', 'allocation', 'is', 'individually', 'rational', 'and', 'coalitionally', 'stable', 'we', 'analyze', 'this', 'control', 'mechanism', 'for', 'two', 'settings', 'a', 'static', 'vertical', 'queue', 'and', 'a', 'dynamic', 'horizontal', 'queue', 'for', 'the', 'former', 'we', 'first', 'characterize', 'the', 'properties', 'of', 'the', 'underlying', 'cooperative', 'game', 'our', 'simulation', 'results', 'suggest', 'that', 'the', 'setting', 'is', 'always', 'strongcore', 'stable', 'for', 'the', 'latter', 'we', 'propose', 'a', 'new', 'relaxation', 'program', 'for', 'the', 'strongcore', 'concept', 'our', 'simulation', 'results', 'on', 'a', 'freeway', 'bottleneck', 'with', 'constant', 'outflow', 'using', 'newells', 'carfollowing', 'model', 'show', 'the', 'imputations', 'to', 'be', 'generally', 'strongcore', 'stable', 'and', 'the', 'coalitional', 'instabilities', 'to', 'remain', 'small', 'with', 'regard', 'to', 'users', 'costs']] | [-0.17904745987823953, 0.06577747060963711, -0.08492040501142123, 0.07859068669005306, -0.07961646324521539, -0.1755787375184827, 0.1147798968226612, 0.39363768318723336, -0.30672362632127387, -0.2779952909423979, 0.09547964042101037, -0.224104863789744, -0.13440065818497599, 0.1149720692820386, -0.1078381665318393, 0.0438053397470993, 0.050820663292422005, 0.03158665224587047, 0.04800795910662123, -0.23772346844901285, 0.3088104783512403, 0.06337181126495989, 0.29480060372077443, 0.03183309209307121, 0.10112254032265801, 0.02138237005196475, 0.016547132537027102, 0.035825814839710694, -0.13647924428066588, 0.10049347238474535, 0.2638140555467148, 0.12470511081029136, 0.321349148575152, -0.4255088004110713, -0.19582559959962964, 0.09853367325573201, 0.1180750590508186, 0.08739664003144636, -0.028925137803544023, -0.2568950796670437, 0.11604560820309741, -0.20633327846627425, -0.09347429605993894, -0.02829608801201373, -0.028892597705725175, 0.05880391017717106, -0.315247368778962, -0.004883172718974033, 0.012276095358913046, 0.017106801845446818, -0.10138994815302921, -0.0923549917153092, -0.014443940160298112, 0.14684753854168892, 0.041489290242806065, -0.01924907516383815, 0.1464415785451973, -0.11316107829230478, -0.1763060658128176, 0.3902582414817102, -0.023178442527129695, -0.1879895802951501, 0.16854575413652687, -0.05802908524787884, -0.12157741694545171, 0.10302699398419976, 0.18474976784125488, 0.1311153412305538, -0.1553379409778794, 0.0023918664581395943, -0.07254326730473244, 0.16770188847330794, 0.03398175952070863, 0.013762172733982196, 0.17123170726699755, 0.21906940418175688, 0.15627988200348866, 0.14573969199330233, -0.04251733164551972, -0.19469980327504696, -0.2550759057650956, -0.1354161601489563, -0.13241024828276202, -0.0011061590745823809, -0.07194063131486257, -0.11946612059848734, 0.35884393382319574, 0.12317725908158735, 0.13712840703676804, 0.14324991709188475, 0.34587053182802285, 0.11026925887937869, 0.020534081358029185, 0.11909520047449387, 0.1979290578827852, 0.04795615245832481, 0.13561565863916022, -0.26170184513978145, 0.126588497809388, 0.02239777106966934] |
1,803.01266 | A strong limit on the very-high-energy emission from GRB 150323A | On 2015 March 23, VERITAS responded to a $Swift$-BAT detection of a gamma-ray
burst, with observations beginning 270 seconds after the onset of BAT emission,
and only 135 seconds after the main BAT emission peak. No statistically
significant signal is detected above 140 GeV. The VERITAS upper limit on the
fluence in a 40 minute integration corresponds to about 1% of the prompt
fluence. Our limit is particularly significant since the very-high-energy (VHE)
observation started only $\sim$2 minutes after the prompt emission peaked, and
$Fermi$-LAT observations of numerous other bursts have revealed that the
high-energy emission is typically delayed relative to the prompt radiation and
lasts significantly longer. Also, the proximity of GRB~150323A ($z=0.593$)
limits the attenuation by the extragalactic background light to $\sim 50$ % at
100-200 GeV. We conclude that GRB 150323A had an intrinsically very weak
high-energy afterglow, or that the GeV spectrum had a turnover below $\sim100$
GeV. If the GRB exploded into the stellar wind of a massive progenitor, the VHE
non-detection constrains the wind density parameter to be $A\gtrsim 3\times
10^{11}$ g cm$^{-1}$, consistent with a standard Wolf-Rayet progenitor.
Alternatively, the VHE emission from the blast wave would be weak in a very
tenuous medium such as the ISM, which therefore cannot be ruled out as the
environment of GRB 150323A.
| astro-ph.HE | on 2015 march 23 veritas responded to a swiftbat detection of a gammaray burst with observations beginning 270 seconds after the onset of bat emission and only 135 seconds after the main bat emission peak no statistically significant signal is detected above 140 gev the veritas upper limit on the fluence in a 40 minute integration corresponds to about 1 of the prompt fluence our limit is particularly significant since the veryhighenergy vhe observation started only sim2 minutes after the prompt emission peaked and fermilat observations of numerous other bursts have revealed that the highenergy emission is typically delayed relative to the prompt radiation and lasts significantly longer also the proximity of grb150323a z0593 limits the attenuation by the extragalactic background light to sim 50 at 100200 gev we conclude that grb 150323a had an intrinsically very weak highenergy afterglow or that the gev spectrum had a turnover below sim100 gev if the grb exploded into the stellar wind of a massive progenitor the vhe nondetection constrains the wind density parameter to be agtrsim 3times 1011 g cm1 consistent with a standard wolfrayet progenitor alternatively the vhe emission from the blast wave would be weak in a very tenuous medium such as the ism which therefore cannot be ruled out as the environment of grb 150323a | [['on', '2015', 'march', '23', 'veritas', 'responded', 'to', 'a', 'swiftbat', 'detection', 'of', 'a', 'gammaray', 'burst', 'with', 'observations', 'beginning', '270', 'seconds', 'after', 'the', 'onset', 'of', 'bat', 'emission', 'and', 'only', '135', 'seconds', 'after', 'the', 'main', 'bat', 'emission', 'peak', 'no', 'statistically', 'significant', 'signal', 'is', 'detected', 'above', '140', 'gev', 'the', 'veritas', 'upper', 'limit', 'on', 'the', 'fluence', 'in', 'a', '40', 'minute', 'integration', 'corresponds', 'to', 'about', '1', 'of', 'the', 'prompt', 'fluence', 'our', 'limit', 'is', 'particularly', 'significant', 'since', 'the', 'veryhighenergy', 'vhe', 'observation', 'started', 'only', 'sim2', 'minutes', 'after', 'the', 'prompt', 'emission', 'peaked', 'and', 'fermilat', 'observations', 'of', 'numerous', 'other', 'bursts', 'have', 'revealed', 'that', 'the', 'highenergy', 'emission', 'is', 'typically', 'delayed', 'relative', 'to', 'the', 'prompt', 'radiation', 'and', 'lasts', 'significantly', 'longer', 'also', 'the', 'proximity', 'of', 'grb150323a', 'z0593', 'limits', 'the', 'attenuation', 'by', 'the', 'extragalactic', 'background', 'light', 'to', 'sim', '50', 'at', '100200', 'gev', 'we', 'conclude', 'that', 'grb', '150323a', 'had', 'an', 'intrinsically', 'very', 'weak', 'highenergy', 'afterglow', 'or', 'that', 'the', 'gev', 'spectrum', 'had', 'a', 'turnover', 'below', 'sim100', 'gev', 'if', 'the', 'grb', 'exploded', 'into', 'the', 'stellar', 'wind', 'of', 'a', 'massive', 'progenitor', 'the', 'vhe', 'nondetection', 'constrains', 'the', 'wind', 'density', 'parameter', 'to', 'be', 'agtrsim', '3times', '1011', 'g', 'cm1', 'consistent', 'with', 'a', 'standard', 'wolfrayet', 'progenitor', 'alternatively', 'the', 'vhe', 'emission', 'from', 'the', 'blast', 'wave', 'would', 'be', 'weak', 'in', 'a', 'very', 'tenuous', 'medium', 'such', 'as', 'the', 'ism', 'which', 'therefore', 'can', 'not', 'be', 'ruled', 'out', 'as', 'the', 'environment', 'of', 'grb', '150323a']] | [-0.04466268245979024, 0.20811657010428136, -0.036492025925659796, 0.17160838452100036, -0.13218289595359647, -0.0966173448395465, 0.06623099856690762, 0.4588682227090281, -0.1520394642854835, -0.37935004965292873, 0.04588341086932366, -0.32337829322191264, 0.06408298445948588, 0.24891495449848894, 0.004975514596835338, -0.06338201018767388, 0.13656582818650795, -0.05238373242019394, -0.039742022314428097, -0.23262505342160733, 0.1811464488503038, 0.17628671260107365, 0.17214819259010802, 0.07313787127722562, 0.08022369985892809, -0.0807719257476569, -0.0180237780919762, -0.11996219904892182, -0.06338394135987564, -0.01839062724122559, 0.21280686319871267, 0.11553557431205075, 0.20303347699689578, -0.35459521800244637, -0.26738123034789474, 0.1244565452484003, 0.1478941154451997, -0.05749577157223431, -0.004095319904602338, -0.3496533513239677, 0.059980379804496615, -0.22507157029164299, -0.15118407327331987, 0.1488788041205281, 0.06460744542662195, 0.009037240001727159, -0.15748639213071017, 0.12531208773698338, 0.0008945100266935125, 0.04042509676625694, -0.08458208723404738, -0.02452484582509286, -0.035104343404188894, -0.0199269685432962, 0.10594567804304367, 0.11223455804330187, 0.17893435367415308, -0.11814146046800006, -0.05223736832215682, 0.40649673031170813, -0.07444201798960916, 0.10748730719137604, 0.18826446454958912, -0.2283647181509946, -0.21032062090251227, 0.31841741403031376, 0.11584509988512162, 0.06793515303635646, -0.1673012439972074, -0.02256651446941973, 0.00628405147700236, 0.27801981431480166, 0.07914892161273761, 0.050919453470810304, 0.2869148934653527, 0.14944647288304086, 0.04201906793991305, 0.058219237472510024, -0.27703369393323857, 0.037523937427456286, -0.3234037114678939, -0.04824971032745375, -0.12992702504869183, 0.20581653919382492, -0.11652611073948489, -0.07150554016862117, 0.4203468089258657, 0.10667249364772934, 0.21278309695392042, 0.02656627359019566, 0.281838807004106, 0.11543825423473955, 0.05637996353891114, 0.13125235887114264, 0.4154337664864992, 0.11690082255217461, 0.15166285962408557, -0.12927007715069108, 0.06705785028312898, -0.05190060058599907] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.