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.04567
|
Convolutional Neural Networks and Language Embeddings for End-to-End
Dialect Recognition
|
Dialect identification (DID) is a special case of general language
identification (LID), but a more challenging problem due to the linguistic
similarity between dialects. In this paper, we propose an end-to-end DID system
and a Siamese neural network to extract language embeddings. We use both
acoustic and linguistic features for the DID task on the Arabic dialectal
speech dataset: Multi-Genre Broadcast 3 (MGB-3). The end-to-end DID system was
trained using three kinds of acoustic features: Mel-Frequency Cepstral
Coefficients (MFCCs), log Mel-scale Filter Bank energies (FBANK) and
spectrogram energies. We also investigated a dataset augmentation approach to
achieve robust performance with limited data resources. Our linguistic feature
research focused on learning similarities and dissimilarities between dialects
using the Siamese network, so that we can reduce feature dimensionality as well
as improve DID performance. The best system using a single feature set achieves
73% accuracy, while a fusion system using multiple features yields 78% on the
MGB-3 dialect test set consisting of 5 dialects. The experimental results
indicate that FBANK features achieve slightly better results than MFCCs.
Dataset augmentation via speed perturbation appears to add significant
robustness to the system. Although the Siamese network with language embeddings
did not achieve as good a result as the end-to-end DID system, the two
approaches had good synergy when combined together in a fused system.
|
cs.SD eess.AS
|
dialect identification did is a special case of general language identification lid but a more challenging problem due to the linguistic similarity between dialects in this paper we propose an endtoend did system and a siamese neural network to extract language embeddings we use both acoustic and linguistic features for the did task on the arabic dialectal speech dataset multigenre broadcast 3 mgb3 the endtoend did system was trained using three kinds of acoustic features melfrequency cepstral coefficients mfccs log melscale filter bank energies fbank and spectrogram energies we also investigated a dataset augmentation approach to achieve robust performance with limited data resources our linguistic feature research focused on learning similarities and dissimilarities between dialects using the siamese network so that we can reduce feature dimensionality as well as improve did performance the best system using a single feature set achieves 73 accuracy while a fusion system using multiple features yields 78 on the mgb3 dialect test set consisting of 5 dialects the experimental results indicate that fbank features achieve slightly better results than mfccs dataset augmentation via speed perturbation appears to add significant robustness to the system although the siamese network with language embeddings did not achieve as good a result as the endtoend did system the two approaches had good synergy when combined together in a fused system
|
[['dialect', 'identification', 'did', 'is', 'a', 'special', 'case', 'of', 'general', 'language', 'identification', 'lid', 'but', 'a', 'more', 'challenging', 'problem', 'due', 'to', 'the', 'linguistic', 'similarity', 'between', 'dialects', 'in', 'this', 'paper', 'we', 'propose', 'an', 'endtoend', 'did', 'system', 'and', 'a', 'siamese', 'neural', 'network', 'to', 'extract', 'language', 'embeddings', 'we', 'use', 'both', 'acoustic', 'and', 'linguistic', 'features', 'for', 'the', 'did', 'task', 'on', 'the', 'arabic', 'dialectal', 'speech', 'dataset', 'multigenre', 'broadcast', '3', 'mgb3', 'the', 'endtoend', 'did', 'system', 'was', 'trained', 'using', 'three', 'kinds', 'of', 'acoustic', 'features', 'melfrequency', 'cepstral', 'coefficients', 'mfccs', 'log', 'melscale', 'filter', 'bank', 'energies', 'fbank', 'and', 'spectrogram', 'energies', 'we', 'also', 'investigated', 'a', 'dataset', 'augmentation', 'approach', 'to', 'achieve', 'robust', 'performance', 'with', 'limited', 'data', 'resources', 'our', 'linguistic', 'feature', 'research', 'focused', 'on', 'learning', 'similarities', 'and', 'dissimilarities', 'between', 'dialects', 'using', 'the', 'siamese', 'network', 'so', 'that', 'we', 'can', 'reduce', 'feature', 'dimensionality', 'as', 'well', 'as', 'improve', 'did', 'performance', 'the', 'best', 'system', 'using', 'a', 'single', 'feature', 'set', 'achieves', '73', 'accuracy', 'while', 'a', 'fusion', 'system', 'using', 'multiple', 'features', 'yields', '78', 'on', 'the', 'mgb3', 'dialect', 'test', 'set', 'consisting', 'of', '5', 'dialects', 'the', 'experimental', 'results', 'indicate', 'that', 'fbank', 'features', 'achieve', 'slightly', 'better', 'results', 'than', 'mfccs', 'dataset', 'augmentation', 'via', 'speed', 'perturbation', 'appears', 'to', 'add', 'significant', 'robustness', 'to', 'the', 'system', 'although', 'the', 'siamese', 'network', 'with', 'language', 'embeddings', 'did', 'not', 'achieve', 'as', 'good', 'a', 'result', 'as', 'the', 'endtoend', 'did', 'system', 'the', 'two', 'approaches', 'had', 'good', 'synergy', 'when', 'combined', 'together', 'in', 'a', 'fused', 'system']]
|
[-0.04837176339794805, -0.052933286176393674, -0.05401313957868255, 0.08178232433573437, -0.14218652300502455, -0.1999100135049757, 0.0638465101151394, 0.4556268808355025, -0.2359507201632502, -0.34654702009166455, 0.02443354227259721, -0.33121075268104294, -0.18880958979043666, 0.20174824175587214, -0.1475926614793684, 0.07405607224604406, 0.172801275066994, 0.08907382696580757, -0.05951918239401944, -0.27148558488201113, 0.28000349474007075, 0.062496221347160874, 0.37788888093601025, 0.005856260721392314, 0.1332554053905027, -0.04933716056424133, -0.024799785847506493, -0.037963672497292655, -0.01582569281556996, 0.1555212734639858, 0.3218483988648503, 0.19669504486101277, 0.28877277274983465, -0.374261051903419, -0.21643261258477567, 0.05203368759782421, 0.16295441600105323, 0.10947013064821619, 0.024872525903989598, -0.3441376332273715, 0.06707927039311772, -0.1932977339543334, 0.059797191273617566, -0.12486700124488855, -0.029566739241532778, -0.02603679474677096, -0.25765113721851585, 0.0711339914095492, 0.10646600957047793, 0.11871006860132885, -0.07013341321720906, -0.1487518005893318, 0.006189613705135827, 0.1644199598200647, -0.009848551426313544, 0.0779669734504108, 0.11502174024284313, -0.13544131414601665, -0.13285723696633694, 0.3746322276361218, -0.12678500784513244, -0.2185416050381326, 0.23158814993776689, -0.01740867049014623, -0.14875780141094289, 0.08916970900723971, 0.23707943623901534, 0.05286661865896708, -0.16525606962633502, -0.03380141200373855, -0.05153753800283468, 0.29096463071011486, 0.10723305599328233, 0.013598801790567867, 0.14022110872063573, 0.2532801413214381, -0.039264476185220235, 0.1500398305526704, -0.1465703996353347, -0.011826075266922798, -0.19010226138458383, -0.08796586595591022, -0.157619463478497, -0.061591966571048685, -0.08242290109847758, -0.12238534565036689, 0.40850804157879783, 0.20935031749231212, 0.19887472479390578, 0.12219961565158782, 0.30734750961696883, -0.004337280232928172, 0.1349313962038333, 0.08631436557080725, 0.18144781044641628, -0.017592658664723603, 0.15632157217750728, -0.1672567036793217, 0.09186754717893146, 0.06672045792076643]
|
1,803.04568
|
On $L^1$-estimates for probability solutions to Fokker-Planck-Kolmogorov
equations
|
We prove two new results connected with elliptic Fokker-Planck-Kolmogorov
equations with drifts integrable with respect to solutions. The first result
answers negatively a long-standing question and shows that a density of a
probability measure satisfying the Fokker-Planck-Kolmogorov equation with a
drift integrable with respect to this density can fail to belong to the Sobolev
class~$W^{1,1}(\mathbb{R}^d)$. There is also a version of this result for
densities with respect to Gaussian measures. The second new result gives some
positive information about properties of such solutions: the solution density
is proved to belong to certain fractional Sobolev classes.
|
math.PR
|
we prove two new results connected with elliptic fokkerplanckkolmogorov equations with drifts integrable with respect to solutions the first result answers negatively a longstanding question and shows that a density of a probability measure satisfying the fokkerplanckkolmogorov equation with a drift integrable with respect to this density can fail to belong to the sobolev classw11mathbbrd there is also a version of this result for densities with respect to gaussian measures the second new result gives some positive information about properties of such solutions the solution density is proved to belong to certain fractional sobolev classes
|
[['we', 'prove', 'two', 'new', 'results', 'connected', 'with', 'elliptic', 'fokkerplanckkolmogorov', 'equations', 'with', 'drifts', 'integrable', 'with', 'respect', 'to', 'solutions', 'the', 'first', 'result', 'answers', 'negatively', 'a', 'longstanding', 'question', 'and', 'shows', 'that', 'a', 'density', 'of', 'a', 'probability', 'measure', 'satisfying', 'the', 'fokkerplanckkolmogorov', 'equation', 'with', 'a', 'drift', 'integrable', 'with', 'respect', 'to', 'this', 'density', 'can', 'fail', 'to', 'belong', 'to', 'the', 'sobolev', 'classw11mathbbrd', 'there', 'is', 'also', 'a', 'version', 'of', 'this', 'result', 'for', 'densities', 'with', 'respect', 'to', 'gaussian', 'measures', 'the', 'second', 'new', 'result', 'gives', 'some', 'positive', 'information', 'about', 'properties', 'of', 'such', 'solutions', 'the', 'solution', 'density', 'is', 'proved', 'to', 'belong', 'to', 'certain', 'fractional', 'sobolev', 'classes']]
|
[-0.10978794775586179, 0.05777526412535697, -0.09204114601016045, 0.063656533701702, -0.09296258179312374, -0.15374274654412998, -0.03416872170179131, 0.319932404420081, -0.29330463823366987, -0.25797799275630706, 0.10538211047768276, -0.3221632720942193, -0.10519805992458095, 0.18123069620552532, -0.13467844881295682, 0.09260111184483592, 0.04756948938395115, 0.06944183626786825, -0.09411900951972905, -0.24620141423842373, 0.3949944040331831, -0.03806430120714643, 0.21535462513566017, 0.06102966297259356, 0.11460878351267348, -0.08805061063124393, -0.013366685407434372, 0.032221331221467635, -0.20742729779104072, 0.1420476832557123, 0.26075670956336755, 0.07725324410761884, 0.3130814340560043, -0.33566073877142466, -0.19069752807510978, 0.1541227197740227, 0.07180508764143637, 0.08476296782077468, -0.05569053790779745, -0.3117693038261, 0.11380573993231705, -0.11280904600317491, -0.2536473545602503, -0.07080537830528981, 0.010141019342823866, 0.11351183990135472, -0.3050587394849417, 0.10232115872520112, 0.10242041927623621, -0.05939668589370682, -0.12946627103287647, -0.0660784846825644, 0.016798267299507525, 0.04955932067489212, 0.0773736145718895, 0.08692822900868238, -0.0011326639685145718, -0.0969255563872371, -0.12179435226828494, 0.33861748752818305, -0.11799842980937993, -0.310178290319411, 0.1852537954741336, -0.18002556073182124, -0.16111684826752568, 0.13901186707191804, 0.12767739992271712, 0.09407713147316207, -0.11916018771800271, 0.07739812654797285, -0.08019180842452346, 0.16999766165192456, 0.08309220345294539, 0.03844227697799339, 0.12100142406973433, 0.09639988620171046, 0.19822924843731712, 0.12729161225031427, 0.005147922585936303, -0.12935198050121122, -0.310187914547451, -0.1841727812437618, -0.135548829229826, 0.13594533007671225, -0.06848275037268746, -0.20994404243662002, 0.37371796868900037, 0.13509451639045902, 0.2183584554982867, 0.11911788244949693, 0.17483138114689512, 0.19200492245046066, 0.01420448396597652, 0.10995727539944285, 0.12080749785781471, 0.21938286708578705, 0.0920181501300094, -0.147437073818242, 0.05858302672710666, 0.1187792186491548]
|
1,803.04569
|
Colour fields of the quark-antiquark excited flux tube
|
We present colour field density profiles for some of the first SU(3) gluonic
excitations of the flux tube in the presence of a static quark-antiquark pair.
The results are obtained from a large set of gluonic operators.
|
hep-lat
|
we present colour field density profiles for some of the first su3 gluonic excitations of the flux tube in the presence of a static quarkantiquark pair the results are obtained from a large set of gluonic operators
|
[['we', 'present', 'colour', 'field', 'density', 'profiles', 'for', 'some', 'of', 'the', 'first', 'su3', 'gluonic', 'excitations', 'of', 'the', 'flux', 'tube', 'in', 'the', 'presence', 'of', 'a', 'static', 'quarkantiquark', 'pair', 'the', 'results', 'are', 'obtained', 'from', 'a', 'large', 'set', 'of', 'gluonic', 'operators']]
|
[-0.14963334763573632, 0.2190411470301852, -0.08021235118645269, 0.09076214357707146, -0.003912172418691822, 0.007008255383855588, 0.008680142179081167, 0.36826646871663427, -0.10425416644461252, -0.25080484131703507, 0.00709769843032936, -0.3107128653272584, -0.035450564634457636, 0.09458027797675617, 0.058307826267303645, 0.05335456170645114, 0.026404345156373205, 0.08289368611735266, -0.08168554155004991, -0.194001728127635, 0.41497759359913905, -0.07776055341536128, 0.225061484511841, 0.15360583050327525, 0.007946910386955415, 0.014894286321627127, -0.0695028785691672, 0.05302183491152686, -0.06577761902322841, 0.10078549887859137, 0.16517390935002146, 0.06502017844468355, 0.1388532743738914, -0.42548913691142526, -0.18019294041536144, 0.0720229877058316, 0.1261302504587818, 0.16702984781256197, -0.0553421773821921, -0.31009473873151316, 0.10043706289316351, -0.2013958889135235, -0.17448244610096555, -0.06694048617941302, 0.013733762986580463, 0.022736238970144373, -0.30223727118022536, 0.0830142446541907, -0.019042410157822275, 0.06581811372794814, -0.09184481766125238, -0.1762320177654761, -0.07320608663674746, 0.10785430284670076, 0.07714068391234488, 0.09448926303082623, 0.1650118997093995, -0.24692188023363013, -0.12190070194569794, 0.3528880929020611, -0.10872666317516484, -0.1753354698822305, 0.11402038885028781, -0.17256037770090876, -0.11546585343878817, 0.1691813896523436, 0.13317041998458523, 0.1514056320176334, -0.17813097886942528, 0.07954991647872973, -0.10478783537621132, 0.13231040879681305, 0.05600805687592239, 0.08778825473996836, 0.2635965955166801, 0.12099923893205218, 0.024375915174951423, 0.19870985350319864, -0.11435327950764347, -0.06214995848367343, -0.4343778283612148, -0.0789855902108389, -0.15874155077177124, 0.03506483293667033, -0.1237679815196709, -0.23847599304910447, 0.4424263992019602, 0.09067422923053035, 0.19853288609836553, 0.009473797890382845, 0.25844293401098334, 0.12445132859480705, 0.0892474606280794, 0.09005473506309696, 0.22418998528312817, 0.21116659601495877, 0.13726044141662283, -0.28149254272087804, -0.09323017633947972, 0.12157810532890663]
|
1,803.0457
|
Sharp inequalities for linear combinations of orthogonal martingales
|
For any two real-valued continuous-path martingales $X=\{X_t\}_{t\geq 0}$ and
$Y=\{Y_t\}_{t\geq 0}$, with $X$ and $Y$ being orthogonal and $Y$ being
differentially subordinate to $X$, we obtain sharp $L^p$ inequalities for
martingales of the form $aX+bY$ with $a, b$ real numbers. The best $L^p$
constant is equal to the norm of the operator $aI+bH$ from $L^p$ to $L^p$,
where $H$ is the Hilbert transform on the circle or real line. The values of
these norms were found by Hollenbeck, Kalton and Verbitsky \cite{HKV}.
|
math.CA math.PR
|
for any two realvalued continuouspath martingales xx_t_tgeq 0 and yy_t_tgeq 0 with x and y being orthogonal and y being differentially subordinate to x we obtain sharp lp inequalities for martingales of the form axby with a b real numbers the best lp constant is equal to the norm of the operator aibh from lp to lp where h is the hilbert transform on the circle or real line the values of these norms were found by hollenbeck kalton and verbitsky citehkv
|
[['for', 'any', 'two', 'realvalued', 'continuouspath', 'martingales', 'xx_t_tgeq', '0', 'and', 'yy_t_tgeq', '0', 'with', 'x', 'and', 'y', 'being', 'orthogonal', 'and', 'y', 'being', 'differentially', 'subordinate', 'to', 'x', 'we', 'obtain', 'sharp', 'lp', 'inequalities', 'for', 'martingales', 'of', 'the', 'form', 'axby', 'with', 'a', 'b', 'real', 'numbers', 'the', 'best', 'lp', 'constant', 'is', 'equal', 'to', 'the', 'norm', 'of', 'the', 'operator', 'aibh', 'from', 'lp', 'to', 'lp', 'where', 'h', 'is', 'the', 'hilbert', 'transform', 'on', 'the', 'circle', 'or', 'real', 'line', 'the', 'values', 'of', 'these', 'norms', 'were', 'found', 'by', 'hollenbeck', 'kalton', 'and', 'verbitsky', 'citehkv']]
|
[-0.09925086249422747, 0.09750883040978806, -0.0349315761737671, 0.07424011590483133, -0.07116671174007934, -0.18812783985049464, 0.03461481388367247, 0.37272335765883324, -0.3219416550593451, -0.18998507489450275, 0.16222647306858562, -0.3054688240401447, -0.06450201573024969, 0.17931604669138324, -0.08186438127886504, 0.059722893229809414, -0.00943304036918562, 0.0789764202432707, -0.07729442025301977, -0.26637633149512113, 0.336194953386439, -0.06493366216309368, 0.14143607272999362, -0.01724996310658753, 0.06664892765693367, 0.00688043262634892, 0.005982684098125901, -0.06541015693219379, -0.15982095227809623, 0.14655093427281826, 0.24585388458217494, 0.10701299562933855, 0.28926600408740344, -0.3238388446508907, -0.10001770207600202, 0.191251555015333, 0.09011220900865738, -0.08696512312162667, 0.016209287381207103, -0.3296769228298217, 0.09171893619932234, -0.012785387504845858, -0.08839420639560558, -0.07071816426469013, 0.08765970350505085, 0.09138091428321786, -0.38487505359807983, 0.059419903610250915, 0.11540869656018912, 0.04100654538924573, -0.10221119148482102, -0.21743760198296513, -0.03002978065633215, 0.051261332441936244, 0.04038703728583641, 0.1451864108283189, 0.06330354919773526, 0.006195342529099435, -0.10267758658155798, 0.2994237546619843, -0.10613969843761879, -0.24714801427617203, 0.12574168031569571, -0.2516949107841356, -0.0794219043746125, 0.10310633207554928, 0.102020521677332, 0.16626775998156518, -0.0653050665394403, 0.2133606909948867, -0.07902105564717203, 0.10117478216125164, 0.08883325505303219, 0.020274052605964245, 0.04794265433447435, 0.005189169570803643, 0.13913078410550953, 0.08237989301560447, -0.04245399850478861, -0.052858825807925315, -0.3181657281704247, -0.20611015756439882, -0.18210689197294413, 0.13190181410172955, -0.13919798730566982, -0.1371342962840572, 0.29377424574631733, 0.0243436184595339, 0.23375741963536711, 0.11752130629029126, 0.1849540752824396, 0.13156085313530638, 0.013390927576256217, 0.08247931849909947, 0.13878767731366679, 0.17547762242029422, 0.08532945060287603, -0.11850181896879804, 0.05544692065450363, 0.16094433232210575]
|
1,803.04571
|
Laser Cooling of Optically Trapped Molecules
|
Calcium monofluoride (CaF) molecules are loaded into an optical dipole trap
(ODT) and subsequently laser cooled within the trap. Starting with
magneto-optical trapping, we sub-Doppler cool CaF and then load $150(30)$ CaF
molecules into an ODT. Enhanced loading by a factor of five is obtained when
sub-Doppler cooling light and trapping light are on simultaneously. For trapped
molecules, we directly observe efficient sub-Doppler cooling to a temperature
of $60(5)$ $\mu\text{K}$. The trapped molecular density of $8(2)\times10^7$
cm$^{-3}$ is an order of magnitude greater than in the initial sub-Doppler
cooled sample. The trap lifetime of 750(40) ms is dominated by background gas
collisions.
|
physics.atom-ph cond-mat.quant-gas
|
calcium monofluoride caf molecules are loaded into an optical dipole trap odt and subsequently laser cooled within the trap starting with magnetooptical trapping we subdoppler cool caf and then load 15030 caf molecules into an odt enhanced loading by a factor of five is obtained when subdoppler cooling light and trapping light are on simultaneously for trapped molecules we directly observe efficient subdoppler cooling to a temperature of 605 mutextk the trapped molecular density of 82times107 cm3 is an order of magnitude greater than in the initial subdoppler cooled sample the trap lifetime of 75040 ms is dominated by background gas collisions
|
[['calcium', 'monofluoride', 'caf', 'molecules', 'are', 'loaded', 'into', 'an', 'optical', 'dipole', 'trap', 'odt', 'and', 'subsequently', 'laser', 'cooled', 'within', 'the', 'trap', 'starting', 'with', 'magnetooptical', 'trapping', 'we', 'subdoppler', 'cool', 'caf', 'and', 'then', 'load', '15030', 'caf', 'molecules', 'into', 'an', 'odt', 'enhanced', 'loading', 'by', 'a', 'factor', 'of', 'five', 'is', 'obtained', 'when', 'subdoppler', 'cooling', 'light', 'and', 'trapping', 'light', 'are', 'on', 'simultaneously', 'for', 'trapped', 'molecules', 'we', 'directly', 'observe', 'efficient', 'subdoppler', 'cooling', 'to', 'a', 'temperature', 'of', '605', 'mutextk', 'the', 'trapped', 'molecular', 'density', 'of', '82times107', 'cm3', 'is', 'an', 'order', 'of', 'magnitude', 'greater', 'than', 'in', 'the', 'initial', 'subdoppler', 'cooled', 'sample', 'the', 'trap', 'lifetime', 'of', '75040', 'ms', 'is', 'dominated', 'by', 'background', 'gas', 'collisions']]
|
[-0.032090032849180494, 0.3196956698243133, -0.006861181544824218, -0.06123405633308944, 0.06946956281721288, -0.19277808710229488, 0.08406600855737545, 0.4698378077271033, -0.18911953209614268, -0.24890296494740308, 0.01582408941954336, -0.2678106281602261, 0.1014637344003636, 0.21023119127910053, 0.0328922498714635, -0.01040110358379173, -0.01770848964283965, -0.05328907230298738, -0.007581874604660029, -0.21852903742799346, 0.19425871711680476, 0.0871800021743592, 0.2740370082735483, 0.07276181692057955, 0.10849330613237558, -0.08354457736975152, 0.12301776401118888, -0.0676815707844739, -0.14055948579512842, 0.10744116146251682, 0.16228807943740062, 0.010541718163318475, 0.23218840300770743, -0.4795042220024215, -0.23329603640666727, 0.09121368071824616, 0.23698911667155215, 0.20325726454801935, -0.06967205058293874, -0.2895687653930212, -0.052750174495467574, -0.1116332047077238, -0.17327772681506312, -0.09915741880386307, 0.04112434959305184, 0.037962291891596334, -0.32493780625565927, 0.04029638140595385, 0.0366694129081633, 0.13889430510830514, -0.14941669901006152, -0.10460709951513884, 0.03159653304182753, -0.01543855879601918, -0.09371550510665971, 0.061224427696659554, 0.3129601606585998, -0.08023382767284175, 0.036344518495381485, 0.4047651258558605, -0.14977808449401317, 0.02457099976208137, 0.15329417671856224, -0.1578630214861157, -0.0194581473954212, 0.3053006454922107, 0.15911082823627762, 0.10366030353862717, -0.12860708365205567, -0.08127455135073265, 0.0018505750880909286, 0.24539810979776844, 0.16885708128244672, 0.04318996587274026, 0.2253827814735016, 0.23631572579176222, 0.017666983064169025, 0.2009026753616386, -0.20260747953327563, -0.04543902065928037, -0.16191382560646161, -0.12602679484181714, -0.17429761968229954, 0.015001790944905, -0.0536535154139844, -0.041592427903586734, 0.3220903016502104, 0.08056308867704427, 0.17011080266033507, -0.09374003231107277, 0.40882475434669424, 0.11899185371680224, 0.05290991203783422, 0.04519631332071612, 0.284895843227527, 0.17256774693936566, 0.0541779445840654, -0.3766516989942792, -0.03853887222393663, -0.0031919009551139815]
|
1,803.04572
|
COPA: Constrained PARAFAC2 for Sparse & Large Datasets
|
PARAFAC2 has demonstrated success in modeling irregular tensors, where the
tensor dimensions vary across one of the modes. An example scenario is modeling
treatments across a set of patients with the varying number of medical
encounters over time. Despite recent improvements on unconstrained PARAFAC2,
its model factors are usually dense and sensitive to noise which limits their
interpretability. As a result, the following open challenges remain: a) various
modeling constraints, such as temporal smoothness, sparsity and non-negativity,
are needed to be imposed for interpretable temporal modeling and b) a scalable
approach is required to support those constraints efficiently for large
datasets. To tackle these challenges, we propose a {\it CO}nstrained {\it
PA}RAFAC2 (COPA) method, which carefully incorporates optimization constraints
such as temporal smoothness, sparsity, and non-negativity in the resulting
factors. To efficiently support all those constraints, COPA adopts a hybrid
optimization framework using alternating optimization and alternating direction
method of multiplier (AO-ADMM). As evaluated on large electronic health record
(EHR) datasets with hundreds of thousands of patients, COPA achieves
significant speedups (up to 36 times faster) over prior PARAFAC2 approaches
that only attempt to handle a subset of the constraints that COPA enables.
Overall, our method outperforms all the baselines attempting to handle a subset
of the constraints in terms of speed, while achieving the same level of
accuracy. Through a case study on temporal phenotyping of medically complex
children, we demonstrate how the constraints imposed by COPA reveal concise
phenotypes and meaningful temporal profiles of patients. The clinical
interpretation of both the phenotypes and the temporal profiles was confirmed
by a medical expert.
|
cs.LG stat.ML
|
parafac2 has demonstrated success in modeling irregular tensors where the tensor dimensions vary across one of the modes an example scenario is modeling treatments across a set of patients with the varying number of medical encounters over time despite recent improvements on unconstrained parafac2 its model factors are usually dense and sensitive to noise which limits their interpretability as a result the following open challenges remain a various modeling constraints such as temporal smoothness sparsity and nonnegativity are needed to be imposed for interpretable temporal modeling and b a scalable approach is required to support those constraints efficiently for large datasets to tackle these challenges we propose a it constrained it parafac2 copa method which carefully incorporates optimization constraints such as temporal smoothness sparsity and nonnegativity in the resulting factors to efficiently support all those constraints copa adopts a hybrid optimization framework using alternating optimization and alternating direction method of multiplier aoadmm as evaluated on large electronic health record ehr datasets with hundreds of thousands of patients copa achieves significant speedups up to 36 times faster over prior parafac2 approaches that only attempt to handle a subset of the constraints that copa enables overall our method outperforms all the baselines attempting to handle a subset of the constraints in terms of speed while achieving the same level of accuracy through a case study on temporal phenotyping of medically complex children we demonstrate how the constraints imposed by copa reveal concise phenotypes and meaningful temporal profiles of patients the clinical interpretation of both the phenotypes and the temporal profiles was confirmed by a medical expert
|
[['parafac2', 'has', 'demonstrated', 'success', 'in', 'modeling', 'irregular', 'tensors', 'where', 'the', 'tensor', 'dimensions', 'vary', 'across', 'one', 'of', 'the', 'modes', 'an', 'example', 'scenario', 'is', 'modeling', 'treatments', 'across', 'a', 'set', 'of', 'patients', 'with', 'the', 'varying', 'number', 'of', 'medical', 'encounters', 'over', 'time', 'despite', 'recent', 'improvements', 'on', 'unconstrained', 'parafac2', 'its', 'model', 'factors', 'are', 'usually', 'dense', 'and', 'sensitive', 'to', 'noise', 'which', 'limits', 'their', 'interpretability', 'as', 'a', 'result', 'the', 'following', 'open', 'challenges', 'remain', 'a', 'various', 'modeling', 'constraints', 'such', 'as', 'temporal', 'smoothness', 'sparsity', 'and', 'nonnegativity', 'are', 'needed', 'to', 'be', 'imposed', 'for', 'interpretable', 'temporal', 'modeling', 'and', 'b', 'a', 'scalable', 'approach', 'is', 'required', 'to', 'support', 'those', 'constraints', 'efficiently', 'for', 'large', 'datasets', 'to', 'tackle', 'these', 'challenges', 'we', 'propose', 'a', 'it', 'constrained', 'it', 'parafac2', 'copa', 'method', 'which', 'carefully', 'incorporates', 'optimization', 'constraints', 'such', 'as', 'temporal', 'smoothness', 'sparsity', 'and', 'nonnegativity', 'in', 'the', 'resulting', 'factors', 'to', 'efficiently', 'support', 'all', 'those', 'constraints', 'copa', 'adopts', 'a', 'hybrid', 'optimization', 'framework', 'using', 'alternating', 'optimization', 'and', 'alternating', 'direction', 'method', 'of', 'multiplier', 'aoadmm', 'as', 'evaluated', 'on', 'large', 'electronic', 'health', 'record', 'ehr', 'datasets', 'with', 'hundreds', 'of', 'thousands', 'of', 'patients', 'copa', 'achieves', 'significant', 'speedups', 'up', 'to', '36', 'times', 'faster', 'over', 'prior', 'parafac2', 'approaches', 'that', 'only', 'attempt', 'to', 'handle', 'a', 'subset', 'of', 'the', 'constraints', 'that', 'copa', 'enables', 'overall', 'our', 'method', 'outperforms', 'all', 'the', 'baselines', 'attempting', 'to', 'handle', 'a', 'subset', 'of', 'the', 'constraints', 'in', 'terms', 'of', 'speed', 'while', 'achieving', 'the', 'same', 'level', 'of', 'accuracy', 'through', 'a', 'case', 'study', 'on', 'temporal', 'phenotyping', 'of', 'medically', 'complex', 'children', 'we', 'demonstrate', 'how', 'the', 'constraints', 'imposed', 'by', 'copa', 'reveal', 'concise', 'phenotypes', 'and', 'meaningful', 'temporal', 'profiles', 'of', 'patients', 'the', 'clinical', 'interpretation', 'of', 'both', 'the', 'phenotypes', 'and', 'the', 'temporal', 'profiles', 'was', 'confirmed', 'by', 'a', 'medical', 'expert']]
|
[-0.08096517918359798, 0.016532231843291702, -0.04433572061437493, 0.060209526192369536, -0.11906686291331425, -0.13614603006951229, 0.05271162146108867, 0.4034936301353754, -0.2604149153992308, -0.35955751894013677, 0.11958616193486236, -0.2435664653030196, -0.1476132128381957, 0.20020329674871667, -0.09951847757805478, 0.08589572070239669, 0.11195127754410461, 0.01696763987296656, -0.07501167204197896, -0.29476888342565927, 0.23992272063200784, 0.032965970980567916, 0.3078744145635882, 0.04164229335296885, 0.13537293445551768, -0.020652875226611894, -0.03833157222349352, 0.034099410124878035, -0.04678520099679934, 0.16968413181585315, 0.2935850871788606, 0.2185508281691, 0.3296012169713239, -0.43773068870778487, -0.24921274560928755, 0.07909669014836916, 0.11755416735788017, 0.06618392670619262, 0.008838169982702697, -0.294919901787635, 0.09131275939183649, -0.15395281556993723, -0.053479231528895485, -0.1507161520672856, -0.02257751697713199, 0.019300437854932777, -0.3173443626287873, 0.1000724069987579, 0.019790271734536596, 0.05254249622565553, -0.07138143215464272, -0.13442075419218533, 0.0149569014306921, 0.13223168274183109, 0.07617485000060475, 0.03090829437893593, 0.13449075991869022, -0.14888182963477448, -0.1251194040900869, 0.37140964703443885, -0.01276209243444486, -0.2187223607430827, 0.2111590663844254, -0.07886258599694085, -0.1590774305962744, 0.12199969029681983, 0.21264252776128353, 0.11881237537300242, -0.16921984663658254, 0.04106634250638308, -0.01825033318671172, 0.18844569198810143, 0.0710960987577864, 0.03248008284671497, 0.1598067058463736, 0.2131518537000485, 0.062058153365576414, 0.09858668327753108, -0.08484298330960993, -0.06415109826908023, -0.2167805549062464, -0.09652669818795843, -0.12737238080113789, -0.011564425271706457, -0.12480980889069376, -0.13645504111649864, 0.4174423464609197, 0.18812761486553814, 0.20090167968428982, 0.07642019068126418, 0.3280537634414169, 0.03550661375017874, 0.1144980156706438, 0.04965859810666492, 0.14130384104051205, 0.07184606646787318, 0.07699283237404113, -0.21602916937748282, 0.113580858025781, -0.026346328932876615]
|
1,803.04573
|
Identification of GSM and LTE Signals Using Their Second-order
Cyclostationarity
|
Automatic signal identification (ASI) has various millitary and commercial
applications, such as spectrum surveillance and cognitive radio. In this paper,
a novel ASI algorithm is proposed for the identification of GSM and LTE
signals, which is based on the pilot-induced second-order cyclostationarity.
The proposed algorithm provides a very good performance at low signal-to-noise
ratios and short observation times, with no need for channel estimation, and
timing and frequency synchronization. Simulations and off-the-air signals
acquired with the ThinkRF WSA4000 receiver are used to confirm the findings.
|
eess.SP
|
automatic signal identification asi has various millitary and commercial applications such as spectrum surveillance and cognitive radio in this paper a novel asi algorithm is proposed for the identification of gsm and lte signals which is based on the pilotinduced secondorder cyclostationarity the proposed algorithm provides a very good performance at low signaltonoise ratios and short observation times with no need for channel estimation and timing and frequency synchronization simulations and offtheair signals acquired with the thinkrf wsa4000 receiver are used to confirm the findings
|
[['automatic', 'signal', 'identification', 'asi', 'has', 'various', 'millitary', 'and', 'commercial', 'applications', 'such', 'as', 'spectrum', 'surveillance', 'and', 'cognitive', 'radio', 'in', 'this', 'paper', 'a', 'novel', 'asi', 'algorithm', 'is', 'proposed', 'for', 'the', 'identification', 'of', 'gsm', 'and', 'lte', 'signals', 'which', 'is', 'based', 'on', 'the', 'pilotinduced', 'secondorder', 'cyclostationarity', 'the', 'proposed', 'algorithm', 'provides', 'a', 'very', 'good', 'performance', 'at', 'low', 'signaltonoise', 'ratios', 'and', 'short', 'observation', 'times', 'with', 'no', 'need', 'for', 'channel', 'estimation', 'and', 'timing', 'and', 'frequency', 'synchronization', 'simulations', 'and', 'offtheair', 'signals', 'acquired', 'with', 'the', 'thinkrf', 'wsa4000', 'receiver', 'are', 'used', 'to', 'confirm', 'the', 'findings']]
|
[-0.1454983199830167, -0.0023091384500730783, -0.06017614680458792, 0.008612964733038098, -0.06248085807019379, -0.1841474856599234, 0.043296159002056814, 0.431196249416098, -0.16286407739389688, -0.3389261043863371, 0.1709856211717124, -0.24763838821090758, -0.19108933409443124, 0.2331308117863955, -0.06930677776108496, 0.08586095568025484, 0.07930913885356858, 0.02454992546699941, -0.032388583404826934, -0.17102794992970302, 0.1833784330796334, 0.15470100106031168, 0.36803959796670827, 0.036914128041826186, 0.10575963053852319, 0.0022781601641327144, -0.06663125935592688, -0.04591493860352784, -0.06744933605659753, 0.07909485739655793, 0.33791031436994673, 0.18352326336753322, 0.22597188574727625, -0.3819784071180038, -0.23517970620887355, 0.10399229942122475, 0.13547056157840415, 0.08330309230805141, -0.10511298665223875, -0.32327912081964316, 0.13775659145321698, -0.18199970055138692, -0.021397826122120024, -0.028431641845963897, -0.03403680600458756, 0.038704516058351145, -0.3235520705697127, 0.03405466395779513, -0.00425957222469151, 0.0870838003931567, -0.06719993709702976, -0.12055967610212974, 0.057766475356766024, 0.16576376449811506, 0.029300883729592896, -0.00833088961080648, 0.10360954062780366, -0.06621832502714824, -0.12549181685317307, 0.3719196941354312, -0.0728442116174847, -0.15286547800060363, 0.24230586166595458, -0.07768045394332149, -0.139423479832476, 0.16279931003809905, 0.19965962087735534, 0.048260419943835585, -0.15777066817245214, 0.00953484261808626, 0.04898421859834343, 0.23226187322288752, 0.03450378510169685, 0.10273485199868446, 0.1813348079478601, 0.21057603320805357, 0.06725850363145583, 0.07324373931623995, -0.20129728041065392, -0.030488275887910275, -0.19094072688458255, -0.11388377478942857, -0.1917530965874903, -0.017505811410956085, -0.07972119101195858, -0.11603209315799176, 0.4155073190224357, 0.16333398168208077, 0.12157716595102101, 0.09827834012248786, 0.40293951851781457, 0.10452964749856619, 0.037194589091814126, 0.0723122677532956, 0.23833442516624928, 0.09193524514557794, 0.17547222835128196, -0.21279667488997803, 0.08035323692602106, -0.03106944425671827]
|
1,803.04574
|
Boosting computational power through spatial multiplexing in quantum
reservoir computing
|
Quantum reservoir computing provides a framework for exploiting the natural
dynamics of quantum systems as a computational resource. It can implement
real-time signal processing and solve temporal machine learning problems in
general, which requires memory and nonlinear mapping of the recent input stream
using the quantum dynamics in computational supremacy region, where the
classical simulation of the system is intractable. A nuclear magnetic resonance
spin-ensemble system is one of the realistic candidates for such physical
implementations, which is currently available in laboratories. In this paper,
considering these realistic experimental constraints for implementing the
framework, we introduce a scheme, which we call a spatial multiplexing
technique, to effectively boost the computational power of the platform. This
technique exploits disjoint dynamics, which originate from multiple different
quantum systems driven by common input streams in parallel. Accordingly, unlike
designing a single large quantum system to increase the number of qubits for
computational nodes, it is possible to prepare a huge number of qubits from
multiple but small quantum systems, which are operationally easy to handle in
laboratory experiments. We numerically demonstrate the effectiveness of the
technique using several benchmark tasks and quantitatively investigate its
specifications, range of validity, and limitations in detail.
|
quant-ph
|
quantum reservoir computing provides a framework for exploiting the natural dynamics of quantum systems as a computational resource it can implement realtime signal processing and solve temporal machine learning problems in general which requires memory and nonlinear mapping of the recent input stream using the quantum dynamics in computational supremacy region where the classical simulation of the system is intractable a nuclear magnetic resonance spinensemble system is one of the realistic candidates for such physical implementations which is currently available in laboratories in this paper considering these realistic experimental constraints for implementing the framework we introduce a scheme which we call a spatial multiplexing technique to effectively boost the computational power of the platform this technique exploits disjoint dynamics which originate from multiple different quantum systems driven by common input streams in parallel accordingly unlike designing a single large quantum system to increase the number of qubits for computational nodes it is possible to prepare a huge number of qubits from multiple but small quantum systems which are operationally easy to handle in laboratory experiments we numerically demonstrate the effectiveness of the technique using several benchmark tasks and quantitatively investigate its specifications range of validity and limitations in detail
|
[['quantum', 'reservoir', 'computing', 'provides', 'a', 'framework', 'for', 'exploiting', 'the', 'natural', 'dynamics', 'of', 'quantum', 'systems', 'as', 'a', 'computational', 'resource', 'it', 'can', 'implement', 'realtime', 'signal', 'processing', 'and', 'solve', 'temporal', 'machine', 'learning', 'problems', 'in', 'general', 'which', 'requires', 'memory', 'and', 'nonlinear', 'mapping', 'of', 'the', 'recent', 'input', 'stream', 'using', 'the', 'quantum', 'dynamics', 'in', 'computational', 'supremacy', 'region', 'where', 'the', 'classical', 'simulation', 'of', 'the', 'system', 'is', 'intractable', 'a', 'nuclear', 'magnetic', 'resonance', 'spinensemble', 'system', 'is', 'one', 'of', 'the', 'realistic', 'candidates', 'for', 'such', 'physical', 'implementations', 'which', 'is', 'currently', 'available', 'in', 'laboratories', 'in', 'this', 'paper', 'considering', 'these', 'realistic', 'experimental', 'constraints', 'for', 'implementing', 'the', 'framework', 'we', 'introduce', 'a', 'scheme', 'which', 'we', 'call', 'a', 'spatial', 'multiplexing', 'technique', 'to', 'effectively', 'boost', 'the', 'computational', 'power', 'of', 'the', 'platform', 'this', 'technique', 'exploits', 'disjoint', 'dynamics', 'which', 'originate', 'from', 'multiple', 'different', 'quantum', 'systems', 'driven', 'by', 'common', 'input', 'streams', 'in', 'parallel', 'accordingly', 'unlike', 'designing', 'a', 'single', 'large', 'quantum', 'system', 'to', 'increase', 'the', 'number', 'of', 'qubits', 'for', 'computational', 'nodes', 'it', 'is', 'possible', 'to', 'prepare', 'a', 'huge', 'number', 'of', 'qubits', 'from', 'multiple', 'but', 'small', 'quantum', 'systems', 'which', 'are', 'operationally', 'easy', 'to', 'handle', 'in', 'laboratory', 'experiments', 'we', 'numerically', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'technique', 'using', 'several', 'benchmark', 'tasks', 'and', 'quantitatively', 'investigate', 'its', 'specifications', 'range', 'of', 'validity', 'and', 'limitations', 'in', 'detail']]
|
[-0.13939472859732377, 0.08115948338047531, -0.062237849282381595, 0.04424530134569086, -0.0677007160654956, -0.17584634802524168, 0.039404438259243856, 0.35451297257469977, -0.3036639596798911, -0.3555066337968087, 0.08062170335587732, -0.22022170906221897, -0.14666532357480733, 0.264214726146217, -0.05152312474662845, 0.1373787907118343, 0.08337012508383311, -0.0005577126103710739, -0.02465670240075379, -0.23824442266814186, 0.2761545427560095, 0.05263943666119559, 0.3178106632198315, 0.021761750327376414, 0.12489619885744462, -0.008375128461445808, 0.014763798107201206, 0.011939672060572922, -0.051758296033086716, 0.13619187767570604, 0.2996045498799851, 0.18021802152518707, 0.30770778835250356, -0.4541911250401532, -0.23455642065005236, 0.08021380551903504, 0.14208517099927231, 0.15922011878053616, -0.06374127935470741, -0.2739234664758209, 0.06484097598153331, -0.19193367748263868, -0.06391555004303891, -0.12610174047242353, -0.017302996907196003, -0.01324642035436241, -0.26809515175526616, 0.03110429761467979, 0.020896015715102044, 0.048550746373214465, 0.00881055309659516, -0.043159773472659105, 0.08616340217934032, 0.14122274683217456, -0.046970579024970566, 0.0017801206114341566, 0.14534421700249478, -0.13050992081489357, -0.15720333519330876, 0.41128942105526, 0.006475866941884909, -0.2105811396239316, 0.22483695688921884, -0.07476322179440532, -0.1565619172135265, 0.08194213252966222, 0.21154211584628377, 0.10373217537975753, -0.17339369505363045, 0.0869706814802116, -0.0136722076857397, 0.181326104941118, 0.017292003190594176, 0.09533131399901816, 0.20707998767111394, 0.22153462076924704, 0.03373262746523991, 0.18609247270189974, -0.08470141919605884, -0.16150072255860967, -0.25058067831077413, -0.15606340864116336, -0.2134991681165806, 0.00543485011966272, -0.06323984461624746, -0.12305848613783867, 0.37758939684112075, 0.21571954163510923, 0.15607353500862742, 0.021392351359798195, 0.3802887926266608, 0.09253969260821372, 0.0887368008785123, 0.0824651953087998, 0.18516762073072207, 0.09054035145494543, 0.11393348444908408, -0.24377761714759483, 0.02901398387665032, -0.023289696408357312]
|
1,803.04575
|
Feasibility of rational shape design of single-polymer micelle using
spontaneous surface curvature
|
Polymeric micelles are used in a variety of applications, with the micelle's
shape often playing an important role. Consequently, a scheme to design
micelles of arbitrary shape is desirable. In this paper, we consider micelles
formed from a single, linear, multiblock copolymer, and we study how easily the
micelle's shape can be controlled by altering the copolymer block lengths.
Using a rational design scheme, we identify a few aspects of the multiblock
composition that are expected to have a well-behaved, predictable effect on
micelle shape. Starting from a reference micelle composition, itself already
exhibiting a nonstandard shape having a moderately sized dimple, we alter these
aspects of the multiblock composition and observe the regularity of the micelle
shape response. The response of the shape is found to be somewhat smooth, but
significantly nonlinear and sometimes nonmonotonic, suggesting that
sophisticated techniques may be required to aid in micelle design.
|
cond-mat.soft
|
polymeric micelles are used in a variety of applications with the micelles shape often playing an important role consequently a scheme to design micelles of arbitrary shape is desirable in this paper we consider micelles formed from a single linear multiblock copolymer and we study how easily the micelles shape can be controlled by altering the copolymer block lengths using a rational design scheme we identify a few aspects of the multiblock composition that are expected to have a wellbehaved predictable effect on micelle shape starting from a reference micelle composition itself already exhibiting a nonstandard shape having a moderately sized dimple we alter these aspects of the multiblock composition and observe the regularity of the micelle shape response the response of the shape is found to be somewhat smooth but significantly nonlinear and sometimes nonmonotonic suggesting that sophisticated techniques may be required to aid in micelle design
|
[['polymeric', 'micelles', 'are', 'used', 'in', 'a', 'variety', 'of', 'applications', 'with', 'the', 'micelles', 'shape', 'often', 'playing', 'an', 'important', 'role', 'consequently', 'a', 'scheme', 'to', 'design', 'micelles', 'of', 'arbitrary', 'shape', 'is', 'desirable', 'in', 'this', 'paper', 'we', 'consider', 'micelles', 'formed', 'from', 'a', 'single', 'linear', 'multiblock', 'copolymer', 'and', 'we', 'study', 'how', 'easily', 'the', 'micelles', 'shape', 'can', 'be', 'controlled', 'by', 'altering', 'the', 'copolymer', 'block', 'lengths', 'using', 'a', 'rational', 'design', 'scheme', 'we', 'identify', 'a', 'few', 'aspects', 'of', 'the', 'multiblock', 'composition', 'that', 'are', 'expected', 'to', 'have', 'a', 'wellbehaved', 'predictable', 'effect', 'on', 'micelle', 'shape', 'starting', 'from', 'a', 'reference', 'micelle', 'composition', 'itself', 'already', 'exhibiting', 'a', 'nonstandard', 'shape', 'having', 'a', 'moderately', 'sized', 'dimple', 'we', 'alter', 'these', 'aspects', 'of', 'the', 'multiblock', 'composition', 'and', 'observe', 'the', 'regularity', 'of', 'the', 'micelle', 'shape', 'response', 'the', 'response', 'of', 'the', 'shape', 'is', 'found', 'to', 'be', 'somewhat', 'smooth', 'but', 'significantly', 'nonlinear', 'and', 'sometimes', 'nonmonotonic', 'suggesting', 'that', 'sophisticated', 'techniques', 'may', 'be', 'required', 'to', 'aid', 'in', 'micelle', 'design']]
|
[-0.0902243858955272, 0.11754867523632129, -0.14269375353044755, 0.014489498183703856, -0.0661963291884702, -0.1649948055824466, -0.037270355394670135, 0.42708597206384746, -0.30465811044268776, -0.27078317599119367, 0.10803193039877491, -0.18742304478734229, -0.18312908338093375, 0.16965414260551837, -0.06328654728792105, 0.039197483760732656, 0.025220564975579444, -0.024245083860650257, -0.09790672187227756, -0.19935259473434574, 0.2627445816351856, 0.06518709713772468, 0.264406590318194, 0.018095933549055778, 0.04642294456061791, 0.013179630119781438, 0.05118772897372224, 0.09054188072882793, -0.16606090867286627, 0.12627127690152642, 0.272701247231846, 0.06348201821256717, 0.23591838911729487, -0.4504940702856795, -0.20766815117157594, 0.09905665481425319, 0.17924114446646558, 0.14013157208211016, -0.0772543971566798, -0.21064191341173608, 0.08548137301585411, -0.15356323545849002, -0.16181661871047942, -0.054783549820500856, -0.025058903130450966, 0.08581422794157186, -0.25212219325397667, 0.045939402371594634, 0.08159540446059829, 0.04432943456403508, -0.04433714557199966, -0.10561168500587244, -0.0460465343171932, 0.09804711329775888, 0.03671144700146633, -0.010156171086458238, 0.2497097757185583, -0.10810844432735639, -0.022810434387694742, 0.39775203163358, -0.0027282518221417792, -0.22609028943839507, 0.20000446909358977, -0.09386138510386888, -0.11947420524823404, 0.19242442488934644, 0.1974877450879462, 0.15593998983653412, -0.13339864429891915, 0.026789303765572432, -0.024425549479830708, 0.26250005403621673, 0.1172843012924155, 0.013829419096755618, 0.241526611690485, 0.2253345042605557, 0.052153933222242, 0.20154323997809803, -0.03239281518177155, -0.1013459400399714, -0.20220186361866826, -0.14275301868769316, -0.13022114885845096, 0.017188523499597166, -0.1288870840375288, -0.22591141664511147, 0.3635260720874047, 0.07259538709233213, 0.20448291921560224, 0.05703492960703836, 0.2162577172716123, 0.02262366397583203, 0.10113634010525169, 0.001506876725879674, 0.20312268756144378, 0.08894543801717511, 0.11349686987720102, -0.2385724843644877, 0.15558509637343673, 0.028031452439373005]
|
1,803.04576
|
Plasmonic Superconductivity in Layered Materials
|
Plasmonic excitations behave fundamentally different in layered materials in
comparison to bulk systems. They form gapless modes, which in turn couple at
low energies to the electrons. Thereby they can strongly influence
superconducting instabilities. Here, we show how these excitations can be
controlled from the outside via changes in the dielectric environment or in the
doping level, which allows for external tuning of the superconducting
transition temperature. By solving the gap equation for an effective system, we
find that the plasmonic influence can both strongly enhance or reduce the
transition temperature, depending on the details of the plasmon-phonon
interplay. We formulate simple experimental guidelines to find plasmon- induced
elevated transition temperatures in layered materials.
|
cond-mat.supr-con
|
plasmonic excitations behave fundamentally different in layered materials in comparison to bulk systems they form gapless modes which in turn couple at low energies to the electrons thereby they can strongly influence superconducting instabilities here we show how these excitations can be controlled from the outside via changes in the dielectric environment or in the doping level which allows for external tuning of the superconducting transition temperature by solving the gap equation for an effective system we find that the plasmonic influence can both strongly enhance or reduce the transition temperature depending on the details of the plasmonphonon interplay we formulate simple experimental guidelines to find plasmon induced elevated transition temperatures in layered materials
|
[['plasmonic', 'excitations', 'behave', 'fundamentally', 'different', 'in', 'layered', 'materials', 'in', 'comparison', 'to', 'bulk', 'systems', 'they', 'form', 'gapless', 'modes', 'which', 'in', 'turn', 'couple', 'at', 'low', 'energies', 'to', 'the', 'electrons', 'thereby', 'they', 'can', 'strongly', 'influence', 'superconducting', 'instabilities', 'here', 'we', 'show', 'how', 'these', 'excitations', 'can', 'be', 'controlled', 'from', 'the', 'outside', 'via', 'changes', 'in', 'the', 'dielectric', 'environment', 'or', 'in', 'the', 'doping', 'level', 'which', 'allows', 'for', 'external', 'tuning', 'of', 'the', 'superconducting', 'transition', 'temperature', 'by', 'solving', 'the', 'gap', 'equation', 'for', 'an', 'effective', 'system', 'we', 'find', 'that', 'the', 'plasmonic', 'influence', 'can', 'both', 'strongly', 'enhance', 'or', 'reduce', 'the', 'transition', 'temperature', 'depending', 'on', 'the', 'details', 'of', 'the', 'plasmonphonon', 'interplay', 'we', 'formulate', 'simple', 'experimental', 'guidelines', 'to', 'find', 'plasmon', 'induced', 'elevated', 'transition', 'temperatures', 'in', 'layered', 'materials']]
|
[-0.1504578861015289, 0.2685133613986341, -0.047930428946162, 0.026773310093854537, -0.0689707060136195, -0.15874883419121288, 0.08704650603242937, 0.40905568908017714, -0.2784098054633656, -0.3154840294165504, -0.011021068750619235, -0.30967891130919606, -0.16904786431941352, 0.17420089399654484, 0.03422185666287285, -0.01891653881849427, -0.03473242651058459, -0.05038374324233206, -0.11689673774271157, -0.16419930326376567, 0.3134207877477533, 0.058303169309766145, 0.3455005640025136, 0.13175560073240808, -0.007760510967815654, -0.030097921709264546, 0.14670289146076693, 0.02555218455790166, -0.13980660488525978, 0.04277837255990322, 0.30164053087661924, -0.06228467270225417, 0.21411592178373484, -0.49415267520306405, -0.22922615463265397, 0.021648716877966205, 0.1951629627557786, 0.1513054012218817, -0.0594075708456027, -0.2522487789269929, 0.03327200669190732, -0.11606689321955568, -0.12153902182175794, -0.10708868610182483, -0.07126638309605289, 0.005818467944352865, -0.22776119272518708, 0.05752164940885881, 0.046870161011292225, 0.030569092305213735, -0.11019184805397679, -0.0886402079506712, -0.057839013746400415, 0.08149489194661248, 0.01404004846291061, -0.02433771870518716, 0.23093138809577285, -0.13904882483837896, -0.06994193807865183, 0.36186860153745665, -0.0650204947573672, -0.1717563606308479, 0.2350530741070479, -0.15670755331143083, -0.04847270876512324, 0.16783762040441824, 0.20267985421008217, 0.08087342036397834, -0.1276652148614327, 0.04455479650922618, 0.053111646512294546, 0.18852582176495752, 0.052956824337965565, 0.11282283486389931, 0.2747936949395297, 0.16360755178979353, 0.017815401646913143, 0.15682521027721172, -0.024703321260555338, -0.029537852771841643, -0.22464181755653076, -0.1401043247733788, -0.17316212269820666, 0.029212238140436903, -0.06379194463717572, -0.19754143917510336, 0.4085483677427922, 0.198042315320651, 0.1679137189415071, -0.06928783942732894, 0.22405037501614475, 0.15824143849966818, 0.08446556551120522, 0.0589037990741832, 0.3159721414681132, 0.09320620309332744, 0.07444486643285736, -0.3141980940994823, 0.0520892716727726, -0.012170684785304363]
|
1,803.04577
|
Bayesian optimization for computationally extensive probability
distributions
|
An efficient method for finding a better maximizer of computationally
extensive probability distributions is proposed on the basis of a Bayesian
optimization technique. A key idea of the proposed method is to use extreme
values of acquisition functions by Gaussian processes for the next training
phase, which should be located near a local maximum or a global maximum of the
probability distribution. Our Bayesian optimization technique is applied to the
posterior distribution in the effective physical model estimation, which is a
computationally extensive probability distribution. Even when the number of
sampling points on the posterior distributions is fixed to be small, the
Bayesian optimization provides a better maximizer of the posterior
distributions in comparison to those by the random search method, the steepest
descent method, or the Monte Carlo method. Furthermore, the Bayesian
optimization improves the results efficiently by combining the steepest descent
method and thus it is a powerful tool to search for a better maximizer of
computationally extensive probability distributions.
|
physics.data-an cond-mat.stat-mech
|
an efficient method for finding a better maximizer of computationally extensive probability distributions is proposed on the basis of a bayesian optimization technique a key idea of the proposed method is to use extreme values of acquisition functions by gaussian processes for the next training phase which should be located near a local maximum or a global maximum of the probability distribution our bayesian optimization technique is applied to the posterior distribution in the effective physical model estimation which is a computationally extensive probability distribution even when the number of sampling points on the posterior distributions is fixed to be small the bayesian optimization provides a better maximizer of the posterior distributions in comparison to those by the random search method the steepest descent method or the monte carlo method furthermore the bayesian optimization improves the results efficiently by combining the steepest descent method and thus it is a powerful tool to search for a better maximizer of computationally extensive probability distributions
|
[['an', 'efficient', 'method', 'for', 'finding', 'a', 'better', 'maximizer', 'of', 'computationally', 'extensive', 'probability', 'distributions', 'is', 'proposed', 'on', 'the', 'basis', 'of', 'a', 'bayesian', 'optimization', 'technique', 'a', 'key', 'idea', 'of', 'the', 'proposed', 'method', 'is', 'to', 'use', 'extreme', 'values', 'of', 'acquisition', 'functions', 'by', 'gaussian', 'processes', 'for', 'the', 'next', 'training', 'phase', 'which', 'should', 'be', 'located', 'near', 'a', 'local', 'maximum', 'or', 'a', 'global', 'maximum', 'of', 'the', 'probability', 'distribution', 'our', 'bayesian', 'optimization', 'technique', 'is', 'applied', 'to', 'the', 'posterior', 'distribution', 'in', 'the', 'effective', 'physical', 'model', 'estimation', 'which', 'is', 'a', 'computationally', 'extensive', 'probability', 'distribution', 'even', 'when', 'the', 'number', 'of', 'sampling', 'points', 'on', 'the', 'posterior', 'distributions', 'is', 'fixed', 'to', 'be', 'small', 'the', 'bayesian', 'optimization', 'provides', 'a', 'better', 'maximizer', 'of', 'the', 'posterior', 'distributions', 'in', 'comparison', 'to', 'those', 'by', 'the', 'random', 'search', 'method', 'the', 'steepest', 'descent', 'method', 'or', 'the', 'monte', 'carlo', 'method', 'furthermore', 'the', 'bayesian', 'optimization', 'improves', 'the', 'results', 'efficiently', 'by', 'combining', 'the', 'steepest', 'descent', 'method', 'and', 'thus', 'it', 'is', 'a', 'powerful', 'tool', 'to', 'search', 'for', 'a', 'better', 'maximizer', 'of', 'computationally', 'extensive', 'probability', 'distributions']]
|
[-0.02168517689117127, 0.007433138219413295, -0.1854335464749853, 0.13001154142181837, -0.06860146226712077, -0.12807281120726263, 0.10360557434471025, 0.4093648648740333, -0.28008732307748296, -0.3359407828660843, 0.10096221938470586, -0.22551469975381078, -0.1501645348695923, 0.18985607693931894, -0.03875329058019467, 0.1416461028491562, 0.10224540938693674, -0.006848988848318702, -0.09548260319265134, -0.2492472526565608, 0.24753056871877224, 0.1394134675738988, 0.33360028368087463, -0.05061913731530952, 0.10838024423710634, 0.04554795012069165, -0.007826783763313735, 0.003744553477089438, -0.09827293486285518, 0.18373411710741988, 0.22211961995488333, 0.2212395204409359, 0.369235193391365, -0.3311100157184733, -0.218360542198988, 0.16050531263290732, 0.1576536317401922, 0.09485896468524718, -0.048851483239918767, -0.2667289888917434, 0.08644091280502049, -0.143674596820751, -0.1002953676506877, -0.10419250741876938, -0.047540152074631165, 0.05590144178131595, -0.38321444167997, 0.07544360597661759, -1.6713359703620274e-06, 0.014745952253931282, -0.002584363207404996, -0.1449749106713743, 0.001081719015793944, 0.06864383445860801, 0.028238045248593906, 0.06592489710008656, 0.13000610516188138, -0.11121455339116999, -0.10901607884479296, 0.3301872130408653, -0.03753602077299154, -0.2488792167967875, 0.1420256339163048, -0.08277569095788087, -0.12677872160242665, 0.19630845647914635, 0.1781979599898612, 0.22767646167208844, -0.17439367749951393, 0.03953200472298906, -0.040879181651599754, 0.12049652925221088, -0.03857907000929117, -0.07190706645839928, 0.1751299946839105, 0.2047069372629379, 0.1735251486491136, 0.1443691666174772, -0.1491198373450409, -0.15011096259515824, -0.26650172711729453, -0.14446876530340055, -0.2768037806992293, -0.014473837547372153, -0.15741055634116716, -0.1773980295624768, 0.38778492711472934, 0.19378310512107463, 0.19220860422600383, 0.1060036601955761, 0.3592677635635123, 0.12712756953458015, 0.01950196982620077, 0.09330347983775959, 0.18127580419366743, 0.1118434206482, 0.029119232922424503, -0.18990060576111262, 0.1381295220868915, 0.07641402545045878]
|
1,803.04578
|
Spanning Trees With Edge Conflicts and Wireless Connectivity
|
We introduce the problem of finding a spanning tree along with a partition of
the tree edges into fewest number of feasible sets, where constraints on the
edges define feasibility. The motivation comes from wireless networking, where
we seek to model the irregularities seen in actual wireless environments. Not
all node pairs may be able to communicate, even if geographically close ---
thus, the available pairs are modeled with a link graph $\mathcal{L}=(V,E)$.
Also, signal attenuation need not follow a nice geometric formulas --- hence,
interference is modeled by a conflict (hyper)graph $\mathcal{C}=(E,F)$ on the
links. The objective is to maximize the efficiency of the communication, or
equivalently minimizing the length of a schedule of the tree edges in the form
of a coloring.
We find that in spite of all this generality, the problem can be approximated
linearly in terms of a versatile parameter, the inductive independence of the
interference graph. Specifically, we give a simple algorithm that attains a
$O(\rho \log n)$-approximation, where $n$ is the number of nodes and $\rho$ is
the inductive independence, and show that near-linear dependence on $\rho$ is
also necessary. We also treat an extension to Steiner trees, modeling
multicasting, and obtain a comparable result.
Our results suggest that several canonical assumptions of geometry,
regularity and "niceness" in wireless settings can sometimes be relaxed without
a significant hit in algorithm performance.
|
cs.NI cs.DS
|
we introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets where constraints on the edges define feasibility the motivation comes from wireless networking where we seek to model the irregularities seen in actual wireless environments not all node pairs may be able to communicate even if geographically close thus the available pairs are modeled with a link graph mathcallve also signal attenuation need not follow a nice geometric formulas hence interference is modeled by a conflict hypergraph mathcalcef on the links the objective is to maximize the efficiency of the communication or equivalently minimizing the length of a schedule of the tree edges in the form of a coloring we find that in spite of all this generality the problem can be approximated linearly in terms of a versatile parameter the inductive independence of the interference graph specifically we give a simple algorithm that attains a orho log napproximation where n is the number of nodes and rho is the inductive independence and show that nearlinear dependence on rho is also necessary we also treat an extension to steiner trees modeling multicasting and obtain a comparable result our results suggest that several canonical assumptions of geometry regularity and niceness in wireless settings can sometimes be relaxed without a significant hit in algorithm performance
|
[['we', 'introduce', 'the', 'problem', 'of', 'finding', 'a', 'spanning', 'tree', 'along', 'with', 'a', 'partition', 'of', 'the', 'tree', 'edges', 'into', 'fewest', 'number', 'of', 'feasible', 'sets', 'where', 'constraints', 'on', 'the', 'edges', 'define', 'feasibility', 'the', 'motivation', 'comes', 'from', 'wireless', 'networking', 'where', 'we', 'seek', 'to', 'model', 'the', 'irregularities', 'seen', 'in', 'actual', 'wireless', 'environments', 'not', 'all', 'node', 'pairs', 'may', 'be', 'able', 'to', 'communicate', 'even', 'if', 'geographically', 'close', 'thus', 'the', 'available', 'pairs', 'are', 'modeled', 'with', 'a', 'link', 'graph', 'mathcallve', 'also', 'signal', 'attenuation', 'need', 'not', 'follow', 'a', 'nice', 'geometric', 'formulas', 'hence', 'interference', 'is', 'modeled', 'by', 'a', 'conflict', 'hypergraph', 'mathcalcef', 'on', 'the', 'links', 'the', 'objective', 'is', 'to', 'maximize', 'the', 'efficiency', 'of', 'the', 'communication', 'or', 'equivalently', 'minimizing', 'the', 'length', 'of', 'a', 'schedule', 'of', 'the', 'tree', 'edges', 'in', 'the', 'form', 'of', 'a', 'coloring', 'we', 'find', 'that', 'in', 'spite', 'of', 'all', 'this', 'generality', 'the', 'problem', 'can', 'be', 'approximated', 'linearly', 'in', 'terms', 'of', 'a', 'versatile', 'parameter', 'the', 'inductive', 'independence', 'of', 'the', 'interference', 'graph', 'specifically', 'we', 'give', 'a', 'simple', 'algorithm', 'that', 'attains', 'a', 'orho', 'log', 'napproximation', 'where', 'n', 'is', 'the', 'number', 'of', 'nodes', 'and', 'rho', 'is', 'the', 'inductive', 'independence', 'and', 'show', 'that', 'nearlinear', 'dependence', 'on', 'rho', 'is', 'also', 'necessary', 'we', 'also', 'treat', 'an', 'extension', 'to', 'steiner', 'trees', 'modeling', 'multicasting', 'and', 'obtain', 'a', 'comparable', 'result', 'our', 'results', 'suggest', 'that', 'several', 'canonical', 'assumptions', 'of', 'geometry', 'regularity', 'and', 'niceness', 'in', 'wireless', 'settings', 'can', 'sometimes', 'be', 'relaxed', 'without', 'a', 'significant', 'hit', 'in', 'algorithm', 'performance']]
|
[-0.18493161820931295, 0.07717379211011835, -0.05717125594050491, 0.07370571591309272, -0.11172930716254216, -0.1517920396831219, 0.10223959439723071, 0.3799497510605891, -0.28423246421568493, -0.3228121846249061, 0.06719744922572447, -0.2624786837009846, -0.16729199425649963, 0.14025391125635775, -0.11130756924798593, 0.020789352480278467, 0.09857807218369478, 0.08162736716518079, -0.008134170765905375, -0.25776138148467, 0.288665078197872, 0.03397521136087432, 0.2560233189651626, 0.0761605954508663, 0.07783522838508361, 0.03293187878287946, -0.010446033559024468, 0.07070015781001919, -0.1074710645912741, 0.08914412588325961, 0.2776373861758787, 0.18200216477894823, 0.2591883583185596, -0.4209966724281133, -0.18851659270096985, 0.1686061670230369, 0.14958678730597189, 0.06197118953215457, -0.006439890830474074, -0.20761792868558718, 0.1242471384484166, -0.14327431235610025, -0.07264292901475398, -0.005284907647624745, -0.012387178046732774, 0.030957942658070742, -0.31080644049299216, 0.0001399307767704678, 0.05361758816330361, 0.007955094735994603, -0.0035884163646967083, -0.09718651578129668, -0.011091766819715434, 0.11263755084551771, -0.021890676739920827, 0.04559682548486827, 0.08088608914528907, -0.12433341334170629, -0.13779900436566095, 0.3826070583392201, -0.023305160324006074, -0.22025169306133258, 0.15620508362137894, -0.08898831331836325, -0.15121637714868744, 0.11892884370172396, 0.18018532953906938, 0.10963713844206982, -0.13731249297571985, 0.09322562763138974, -0.08726790633642979, 0.15109119379485492, 0.09596339768281073, 0.049748580977653285, 0.15005542040515657, 0.15896279892643048, 0.15478455523511261, 0.15996577889382024, -0.03495228313736983, -0.06365306805881639, -0.28489954885610913, -0.13748010036813088, -0.2172731945902342, 0.04339707575763896, -0.15312707129357608, -0.16593037915559503, 0.3693494656108669, 0.1563911879519375, 0.24020663538457093, 0.13038043646416295, 0.3284980878888746, 0.09299319134307941, 0.060342227349922596, 0.13458731521469808, 0.1681500574902332, 0.11340529715406385, 0.026320862723098668, -0.18260232866513043, 0.11060312740612842, 0.039117464067593186]
|
1,803.04579
|
It was the training data pruning too!
|
We study the current best model (KDG) for question answering on tabular data
evaluated over the WikiTableQuestions dataset. Previous ablation studies
performed against this model attributed the model's performance to certain
aspects of its architecture. In this paper, we find that the model's
performance also crucially depends on a certain pruning of the data used to
train the model. Disabling the pruning step drops the accuracy of the model
from 43.3% to 36.3%. The large impact on the performance of the KDG model
suggests that the pruning may be a useful pre-processing step in training other
semantic parsers as well.
|
cs.LG cs.CL
|
we study the current best model kdg for question answering on tabular data evaluated over the wikitablequestions dataset previous ablation studies performed against this model attributed the models performance to certain aspects of its architecture in this paper we find that the models performance also crucially depends on a certain pruning of the data used to train the model disabling the pruning step drops the accuracy of the model from 433 to 363 the large impact on the performance of the kdg model suggests that the pruning may be a useful preprocessing step in training other semantic parsers as well
|
[['we', 'study', 'the', 'current', 'best', 'model', 'kdg', 'for', 'question', 'answering', 'on', 'tabular', 'data', 'evaluated', 'over', 'the', 'wikitablequestions', 'dataset', 'previous', 'ablation', 'studies', 'performed', 'against', 'this', 'model', 'attributed', 'the', 'models', 'performance', 'to', 'certain', 'aspects', 'of', 'its', 'architecture', 'in', 'this', 'paper', 'we', 'find', 'that', 'the', 'models', 'performance', 'also', 'crucially', 'depends', 'on', 'a', 'certain', 'pruning', 'of', 'the', 'data', 'used', 'to', 'train', 'the', 'model', 'disabling', 'the', 'pruning', 'step', 'drops', 'the', 'accuracy', 'of', 'the', 'model', 'from', '433', 'to', '363', 'the', 'large', 'impact', 'on', 'the', 'performance', 'of', 'the', 'kdg', 'model', 'suggests', 'that', 'the', 'pruning', 'may', 'be', 'a', 'useful', 'preprocessing', 'step', 'in', 'training', 'other', 'semantic', 'parsers', 'as', 'well']]
|
[-0.04676592660136521, -0.007013931863475591, -0.06760469001717866, 0.06263708774698898, -0.07634899985045195, -0.1217067253170535, 0.11314977631554939, 0.4026294359564781, -0.2371311413589865, -0.34356087949126957, 0.08028625353937968, -0.24974963538348674, -0.14735012450721116, 0.22089079015655444, -0.09184087945148349, 0.07195185658463743, 0.14081995889544488, 0.04736359949223697, -0.033571792556904255, -0.33011117974267107, 0.2926223310106434, 0.11440426601096988, 0.3308204961870797, 0.059688331251963975, 0.08383896676125005, -0.06986399681773037, -0.046499353484250605, -0.03066879028454423, -0.10728487614149344, 0.09848350922344253, 0.23404823354307155, 0.17022351605352015, 0.2827191483275965, -0.38599937710911036, -0.21563100395724177, 0.08732172637595795, 0.1316441001370549, 0.0948020162107423, -0.0035185838758479806, -0.313374095056206, 0.0807699313829653, -0.18491434141993524, -0.015397993106162175, -0.08454766960814596, -0.03603371988981962, -0.01391889618942514, -0.2481092787347734, 0.028655318062228617, 0.10924272921925876, 0.03995331024751067, -0.07148461369448342, -0.1394766886718571, -0.017610205926466733, 0.12902347735187505, 0.05113135330728255, 0.07636968456907198, 0.1441795428376645, -0.18266235480550677, -0.1261180447920924, 0.3769823870062828, -0.0966530393064022, -0.20279194568982348, 0.2041560564748943, -0.058822976760566234, -0.16793374088127166, 0.07539996339939535, 0.24041228509508072, 0.12890853150747716, -0.1270590593200177, 0.011935804954264313, -0.04589178309775889, 0.20463836416602135, 0.02990830853115767, -0.025143439313396812, 0.14734029670013116, 0.2980795505829155, -0.01940017184242606, 0.16886304190324153, -0.1265544954058714, -0.049581687899772076, -0.23364182570017875, -0.0790922140982002, -0.1488921333756298, -0.02115181542932987, -0.10752566174603999, -0.15373258721083402, 0.43082642249763015, 0.2728379278734792, 0.24152123754844068, 0.08101801458746195, 0.32313621154055, 0.037395846041617914, 0.11217113600810989, 0.07570230898447335, 0.22792457980103792, 0.0008236437337473035, 0.10047100594150833, -0.21015049726003782, 0.13476722944993524, 0.04268996873172]
|
1,803.0458
|
Mechanisms of pyroelectricity in three- and two-dimensional materials
|
Pyroelectricity is a very promising phenomenon in three- and two-dimensional
(2D) materials, but first-principles calculations have not so far been used to
elucidate the underlying mechanisms. Here we report density-functional theory
(DFT) calculations based on the Born-Szigeti theory of pyroelectricity, by
combining fundamental thermodynamics and the modern theory of polarization. We
find satisfactory agreement with experimental data in the case of bulk
benchmark materials, showing that the so-called electron-phonon
renormalization, whose contribution has been viewed as negligible, is
important. We predict out-of-plane pyroelectricity in the recently synthesized
Janus MoSSe monolayer and in-plane pyroelectricity in the group-IV
monochalcogenide GeS monolayer. It is notable that the so-called secondary
pyroelectricity is found to be dominant in GeS monolayer. The present work
opens a theoretical route to study the pyroelectric effect using DFT and
provides a valuable tool in the search for new candidates for pyroelectric
applications.
|
cond-mat.mtrl-sci
|
pyroelectricity is a very promising phenomenon in three and twodimensional 2d materials but firstprinciples calculations have not so far been used to elucidate the underlying mechanisms here we report densityfunctional theory dft calculations based on the bornszigeti theory of pyroelectricity by combining fundamental thermodynamics and the modern theory of polarization we find satisfactory agreement with experimental data in the case of bulk benchmark materials showing that the socalled electronphonon renormalization whose contribution has been viewed as negligible is important we predict outofplane pyroelectricity in the recently synthesized janus mosse monolayer and inplane pyroelectricity in the groupiv monochalcogenide ges monolayer it is notable that the socalled secondary pyroelectricity is found to be dominant in ges monolayer the present work opens a theoretical route to study the pyroelectric effect using dft and provides a valuable tool in the search for new candidates for pyroelectric applications
|
[['pyroelectricity', 'is', 'a', 'very', 'promising', 'phenomenon', 'in', 'three', 'and', 'twodimensional', '2d', 'materials', 'but', 'firstprinciples', 'calculations', 'have', 'not', 'so', 'far', 'been', 'used', 'to', 'elucidate', 'the', 'underlying', 'mechanisms', 'here', 'we', 'report', 'densityfunctional', 'theory', 'dft', 'calculations', 'based', 'on', 'the', 'bornszigeti', 'theory', 'of', 'pyroelectricity', 'by', 'combining', 'fundamental', 'thermodynamics', 'and', 'the', 'modern', 'theory', 'of', 'polarization', 'we', 'find', 'satisfactory', 'agreement', 'with', 'experimental', 'data', 'in', 'the', 'case', 'of', 'bulk', 'benchmark', 'materials', 'showing', 'that', 'the', 'socalled', 'electronphonon', 'renormalization', 'whose', 'contribution', 'has', 'been', 'viewed', 'as', 'negligible', 'is', 'important', 'we', 'predict', 'outofplane', 'pyroelectricity', 'in', 'the', 'recently', 'synthesized', 'janus', 'mosse', 'monolayer', 'and', 'inplane', 'pyroelectricity', 'in', 'the', 'groupiv', 'monochalcogenide', 'ges', 'monolayer', 'it', 'is', 'notable', 'that', 'the', 'socalled', 'secondary', 'pyroelectricity', 'is', 'found', 'to', 'be', 'dominant', 'in', 'ges', 'monolayer', 'the', 'present', 'work', 'opens', 'a', 'theoretical', 'route', 'to', 'study', 'the', 'pyroelectric', 'effect', 'using', 'dft', 'and', 'provides', 'a', 'valuable', 'tool', 'in', 'the', 'search', 'for', 'new', 'candidates', 'for', 'pyroelectric', 'applications']]
|
[-0.09602520792600765, 0.09504202949079935, -0.09976000880369995, 0.01984439982211178, -0.06988530556841845, -0.14582255527600121, 0.06458037847351335, 0.41186712088037125, -0.25310616526739593, -0.28558099213790833, 0.009273101272336928, -0.3161697604818086, -0.23092050161327457, 0.22085100867208357, 0.02793587560266991, 0.07416777191749237, -0.004755049339712034, -0.0648345729716542, -0.055867818267819225, -0.17968814610503614, 0.2157050750520028, 0.0940501954151124, 0.34606031696377715, 0.1207220608099613, 0.018283915131895565, -0.03174218533455696, 0.05339876074232423, 0.051260703499100994, -0.1732465990243724, 0.12135966005407169, 0.2750506541990137, -0.054718287340299765, 0.21902092663623707, -0.4591479838471597, -0.24123786768259506, -0.010627695415037828, 0.11767643364146352, 0.17832821148487044, -0.16098317772586188, -0.22253631432311163, 0.12416056867583956, -0.13855593246211048, -0.09804903139347132, -0.13920996285988096, -0.0067395836501841395, -0.034268748495583486, -0.20799081098668698, 0.07816146828011203, -0.0044277689983727225, 0.07310799706936733, -0.10912692630794686, -0.1846998836459841, -0.05198256079186226, 0.08585622595806777, 0.05900878530622027, 0.06090603580265503, 0.1253496435729944, -0.07966570478608229, -0.14134111473153174, 0.46268759887258876, -0.06294157886287381, -0.09142405891651206, 0.1649872792891266, -0.13425815905752578, -0.1709635444510151, 0.09708696990732996, 0.10767010745959697, 0.1410061214742264, -0.18954261163787417, 0.10394747238639007, -0.028846299153806734, 0.15564338509386905, 0.0017394150581053446, 0.07697792890973341, 0.23327195114443, 0.23332202265081717, -0.024385704457248285, 0.1300743756730529, -0.10915923705586875, -0.04846652581940182, -0.1941260222188184, -0.17722598715803364, -0.2111874205047186, 0.07414454679034772, -0.03356408874273077, -0.18277599336579442, 0.3699241868797427, 0.16205725487908612, 0.10840243627120491, -0.06667043522170836, 0.24905993953399674, 0.07592417366850242, 0.09891472619295802, -0.007736951270819934, 0.3545587423034537, 0.16127209983352886, 0.07873701869877396, -0.2278138184592023, 0.10235022787089972, 0.007831685431957456]
|
1,803.04581
|
Nonribbon 2-links all of whose components are trivial knots and some of
whose band-sums are nonribbon knots
|
There is a nonribbon 2-link all of whose components are trivial 2-knots and
one of whose band-sums is a nonribbon 2-knot.
|
math.GT
|
there is a nonribbon 2link all of whose components are trivial 2knots and one of whose bandsums is a nonribbon 2knot
|
[['there', 'is', 'a', 'nonribbon', '2link', 'all', 'of', 'whose', 'components', 'are', 'trivial', '2knots', 'and', 'one', 'of', 'whose', 'bandsums', 'is', 'a', 'nonribbon', '2knot']]
|
[-0.2586930464539263, 0.1869145892819183, -0.09656773683511549, -0.04125894822128531, -0.061590484214118786, -0.20628320632709396, -0.044878149547407195, 0.36681294896536404, -0.23754436067408985, -0.18409662569562593, 0.18016957326067817, -0.3009774622817834, -0.13773117126483056, 0.22550443942762083, -0.03880573177917136, -0.07324391308551033, -0.017008210428886943, 0.15451408217712823, -0.040634290444561176, -0.23289189115166664, 0.3823576403988732, -0.15370277501642704, 0.10287199655754699, 0.027552026841375563, 0.1722726755672031, -0.09318862938218647, -0.005092262471508648, 0.05362819481848015, -0.0672589175713559, 0.16596623251421583, 0.26290192558533615, 0.08087220581041442, 0.19850805443194178, -0.2862669016338057, -0.12217940783335103, 0.21193906271623242, 0.09655916864155895, 8.88067815038893e-05, 0.019582389077792566, -0.1940941084176302, 0.19588855312516293, -0.1427128611960345, -0.11347381708522637, 0.007609091492162811, 0.08274089855452378, 0.007288263282842106, -0.21734732068661186, -0.046437567099928856, 0.14101339928391907, 0.08053416903648111, 0.0007738401311346226, -0.09069685306813982, -0.11339456857078606, 0.15886661819078857, 0.00106688865667416, 0.0927205118868086, 0.029647944236381188, -0.11616813375925024, -0.11295937063793342, 0.4287727672813667, 0.04516069360801743, -0.2142049576052361, 0.2057577669620514, -0.07472808472812176, -0.13805054932729238, 0.21338577995387217, -0.03750102180573675, 0.15002270167072615, -0.0862605145925449, 0.16336858023876427, -0.14625737257301807, 0.13242409003174138, 0.03454841743223369, -0.018815346683065098, 0.21071340035026273, 0.10872761369682848, 0.10238730559123926, 0.10320289246737957, 0.01339649326271481, -0.03642137868640324, -0.33660001969999737, -0.21893820207979944, -0.17457372036167523, 0.1020759018138051, -0.0303346173984917, -0.3170596878561709, 0.4539877809584141, -0.0495949974283576, 0.21726755001064804, 0.053299258566564985, 0.29768705347345936, 0.11748640342719024, 0.10823394492682484, 0.12131130379728144, 0.19038402773569235, 0.14527302814854515, -0.09840342899163564, -0.06517552413667242, 0.07032134632269542, 0.07100243545654747]
|
1,803.04582
|
Deep Bayesian Supervised Learning given Hypercuboidally-shaped,
Discontinuous Data, using Compound Tensor-Variate & Scalar-Variate Gaussian
Processes
|
We undertake Bayesian learning of the high-dimensional functional
relationship between a system parameter vector and an observable, that is in
general tensor-valued. The ultimate aim is Bayesian inverse prediction of the
system parameters, at which test data is recorded. We attempt such learning
given hypercuboidally-shaped data that displays strong discontinuities,
rendering learning challenging. We model the sought high-dimensional function,
with a tensor-variate Gaussian Process (GP), and use three independent ways for
learning covariance matrices of the resulting likelihood, which is
Tensor-Normal. We demonstrate that the discontinuous data demands that
implemented covariance kernels be non-stationary--achieved by modelling each
kernel hyperparameter, as a function of the sample function of the invoked
tensor-variate GP. Each such function can be shown to be temporally-evolving,
and treated as a realisation from a distinct scalar-variate GP, with covariance
described adaptively by collating information from a historical set of samples
of chosen sample-size. We prove that deep-learning using 2-"layers", suffice,
where the outer-layer comprises the tensor-variate GP, compounded with multiple
scalar-variate GPs in the "inner-layer", and undertake inference with
Metropolis-within-Gibbs. We apply our method to a cuboidally-shaped,
discontinuous, real dataset, and subsequently perform forward prediction to
generate data from our model, given our results--to perform model-checking.
|
stat.ME stat.CO
|
we undertake bayesian learning of the highdimensional functional relationship between a system parameter vector and an observable that is in general tensorvalued the ultimate aim is bayesian inverse prediction of the system parameters at which test data is recorded we attempt such learning given hypercuboidallyshaped data that displays strong discontinuities rendering learning challenging we model the sought highdimensional function with a tensorvariate gaussian process gp and use three independent ways for learning covariance matrices of the resulting likelihood which is tensornormal we demonstrate that the discontinuous data demands that implemented covariance kernels be nonstationaryachieved by modelling each kernel hyperparameter as a function of the sample function of the invoked tensorvariate gp each such function can be shown to be temporallyevolving and treated as a realisation from a distinct scalarvariate gp with covariance described adaptively by collating information from a historical set of samples of chosen samplesize we prove that deeplearning using 2layers suffice where the outerlayer comprises the tensorvariate gp compounded with multiple scalarvariate gps in the innerlayer and undertake inference with metropoliswithingibbs we apply our method to a cuboidallyshaped discontinuous real dataset and subsequently perform forward prediction to generate data from our model given our resultsto perform modelchecking
|
[['we', 'undertake', 'bayesian', 'learning', 'of', 'the', 'highdimensional', 'functional', 'relationship', 'between', 'a', 'system', 'parameter', 'vector', 'and', 'an', 'observable', 'that', 'is', 'in', 'general', 'tensorvalued', 'the', 'ultimate', 'aim', 'is', 'bayesian', 'inverse', 'prediction', 'of', 'the', 'system', 'parameters', 'at', 'which', 'test', 'data', 'is', 'recorded', 'we', 'attempt', 'such', 'learning', 'given', 'hypercuboidallyshaped', 'data', 'that', 'displays', 'strong', 'discontinuities', 'rendering', 'learning', 'challenging', 'we', 'model', 'the', 'sought', 'highdimensional', 'function', 'with', 'a', 'tensorvariate', 'gaussian', 'process', 'gp', 'and', 'use', 'three', 'independent', 'ways', 'for', 'learning', 'covariance', 'matrices', 'of', 'the', 'resulting', 'likelihood', 'which', 'is', 'tensornormal', 'we', 'demonstrate', 'that', 'the', 'discontinuous', 'data', 'demands', 'that', 'implemented', 'covariance', 'kernels', 'be', 'nonstationaryachieved', 'by', 'modelling', 'each', 'kernel', 'hyperparameter', 'as', 'a', 'function', 'of', 'the', 'sample', 'function', 'of', 'the', 'invoked', 'tensorvariate', 'gp', 'each', 'such', 'function', 'can', 'be', 'shown', 'to', 'be', 'temporallyevolving', 'and', 'treated', 'as', 'a', 'realisation', 'from', 'a', 'distinct', 'scalarvariate', 'gp', 'with', 'covariance', 'described', 'adaptively', 'by', 'collating', 'information', 'from', 'a', 'historical', 'set', 'of', 'samples', 'of', 'chosen', 'samplesize', 'we', 'prove', 'that', 'deeplearning', 'using', '2layers', 'suffice', 'where', 'the', 'outerlayer', 'comprises', 'the', 'tensorvariate', 'gp', 'compounded', 'with', 'multiple', 'scalarvariate', 'gps', 'in', 'the', 'innerlayer', 'and', 'undertake', 'inference', 'with', 'metropoliswithingibbs', 'we', 'apply', 'our', 'method', 'to', 'a', 'cuboidallyshaped', 'discontinuous', 'real', 'dataset', 'and', 'subsequently', 'perform', 'forward', 'prediction', 'to', 'generate', 'data', 'from', 'our', 'model', 'given', 'our', 'resultsto', 'perform', 'modelchecking']]
|
[-0.016175699262841185, 0.011164971320347624, -0.10572640090659646, 0.07629676223489937, -0.10432175937750487, -0.15336012892627732, 0.04390548820452948, 0.39807214562834237, -0.2884762467855076, -0.30614207189896875, 0.10857993784756279, -0.24679814836907882, -0.1739758283354962, 0.17293563732060657, -0.05453494036994836, 0.10840065406823599, 0.08280408664225297, 0.009689701969585733, -0.05849080505117972, -0.22800953402256333, 0.31779439924912134, 0.03328108144176091, 0.276743099797961, -0.061183902260080136, 0.15973932953030257, 0.026318087951893016, -0.04666892572310922, 0.004741551033631353, -0.0819546586307688, 0.12049381187188057, 0.30511271946223867, 0.20248197596015768, 0.3203837871479131, -0.3884228210112637, -0.21273642541826196, 0.13789595828097256, 0.11594569496327886, 0.07733440318222067, -0.0196070913551134, -0.30079643039389903, 0.06260247741357805, -0.15313791771723353, -0.06907797635199955, -0.1326867766905132, -0.04361040382694279, 0.006766614940565157, -0.35875598044397666, 0.06755925369463436, 0.0280075962413971, 0.04997543503477243, -0.031545314802715815, -0.11277978043880198, -0.0018231755959767597, 0.11972640383592928, 0.037651002294730174, 0.04408012975159299, 0.11181705126205913, -0.09321421801101736, -0.10950869506639983, 0.3370030407202394, -0.07494954709952861, -0.2392056733032042, 0.16742772330081215, -0.0875028768612236, -0.14987543211776977, 0.09417917983066001, 0.2256819802804469, 0.10048126916695443, -0.17098850303527374, 0.06344708158798822, -0.039681874534331286, 0.17733337251237868, -0.02053499898820189, -0.053885322692381804, 0.1582811618286518, 0.2107849607975198, 0.031491710624652745, 0.13742095048097808, -0.1370903845644831, -0.08022793665663412, -0.2982176843830963, -0.11394994150921992, -0.23870036502518338, 0.02035767729442393, -0.129663238547597, -0.18140926698528573, 0.36776371374533273, 0.20267503085386954, 0.2429337456600422, 0.09109488513846664, 0.29309936253344304, 0.1332877476282998, 0.060471011782933626, 0.08581860483155968, 0.15827318332085646, 0.08023263502943238, 0.06212161679527785, -0.17178597791878014, 0.09569010769536988, 0.00822265882411769]
|
1,803.04583
|
Arithmetic of curves on moduli of local systems
|
We investigate the arithmetic of algebraic curves on coarse moduli spaces for
special linear rank two local systems on surfaces with fixed boundary traces.
We prove a structure theorem for morphisms from the affine line into the moduli
space. We show that the set of integral points on any nondegenerate algebraic
curve on the moduli space can be effectively determined.
|
math.NT math.AG math.GT
|
we investigate the arithmetic of algebraic curves on coarse moduli spaces for special linear rank two local systems on surfaces with fixed boundary traces we prove a structure theorem for morphisms from the affine line into the moduli space we show that the set of integral points on any nondegenerate algebraic curve on the moduli space can be effectively determined
|
[['we', 'investigate', 'the', 'arithmetic', 'of', 'algebraic', 'curves', 'on', 'coarse', 'moduli', 'spaces', 'for', 'special', 'linear', 'rank', 'two', 'local', 'systems', 'on', 'surfaces', 'with', 'fixed', 'boundary', 'traces', 'we', 'prove', 'a', 'structure', 'theorem', 'for', 'morphisms', 'from', 'the', 'affine', 'line', 'into', 'the', 'moduli', 'space', 'we', 'show', 'that', 'the', 'set', 'of', 'integral', 'points', 'on', 'any', 'nondegenerate', 'algebraic', 'curve', 'on', 'the', 'moduli', 'space', 'can', 'be', 'effectively', 'determined']]
|
[-0.20530937301615873, 0.05837894311795632, -0.13823683755472302, 0.10777720175683499, -0.09673860508870954, -0.0945833173347637, 0.05685340585187078, 0.37400192208588123, -0.37511337123190364, -0.15852383530388275, 0.14160856337596972, -0.21710306816191102, -0.16063376904154816, 0.27356082228943707, -0.14512294676775733, 0.02040910640110572, 0.04401795044541359, 0.04247435152841111, -0.14332268591582153, -0.3277968818283019, 0.5145918181786935, -0.11444720377524693, 0.23544004502085347, 0.018198610298956433, 0.16383198932744564, 0.06529148971894756, -0.016341412719339133, 0.0230959909647936, -0.1479772596509671, 0.16734952786161253, 0.2773332894469301, 0.05028313430569445, 0.13312186546390875, -0.40973675918454927, -0.21678633159026503, 0.22192600215785205, 0.08073779607657343, 0.032487308715159695, 0.06385257209573562, -0.260198413922141, 0.10058462348145743, -0.034289708857734996, -0.1524769943440333, -0.11147151046898215, 0.007189594436204061, 0.04695279394897322, -0.17043922597561809, -0.0972414121342202, 0.03299229374776284, 0.16389237640736004, -0.14285076110002895, -0.0988632413209416, -0.1015584083700863, 0.03463153309033563, -0.052457351610064505, 0.02110197541769594, 0.10075887236744166, -0.05912185375733922, -0.05482594828742246, 0.3650707608088851, -0.07428468658278385, -0.24217476707951088, 0.12810912660012644, -0.12484729797967399, -0.1406830453973574, 0.13000101114351612, 0.18125385565993687, 0.1465890471750754, 0.01304503125041568, 0.20945077918392296, -0.10740236667722153, 0.1387493043206632, 0.07804330658788482, -0.0037875717680435628, 0.1693100099839891, 0.057339931915824614, 0.10808875422614315, 0.14243590941963097, -0.018528035659498225, -0.08977508383007565, -0.3875283872708678, -0.20212636321860675, -0.1249676179451247, 0.12786852909872928, -0.1931584985849137, -0.20132188086087505, 0.3758076933367799, 0.013153778311486045, 0.25084233925833055, 0.12809388481934245, 0.22319222974280517, 0.07876023440452021, 0.027030263980850577, 0.08415936260328939, 0.16834524599059175, 0.13281802541265886, -0.04092748421244323, -0.16135173812896633, -0.01143534576209883, 0.25609197343389195]
|
1,803.04584
|
Sensitivity Based Thevenin Index for Voltage Stability Assessment
Considering N-1 Contingency
|
This paper proposes an approach to address the voltage stability assessment
(VSA) considering N-1 contingency. The approach leverages the sensitivity based
Thevenin index (STI) which involves evaluating the Jacobian matrix at current
operating condition. Since the N-1 contingency case is hypothetical, there is
no information regarding the operating condition after a foreseen contingency.
The proposed approach first estimates the post-contingency operating point as
well as possible PV-PQ transitions based on the current operating point. Then
the STI for each contingency can be predicted using the estimated operating
condition. Numerical results based on IEEE 14-bus system demonstrate the
accuracy of the proposed approach in predicting the voltage stability margin
under contingency. Moreover, the on-line implementation of the proposed
approach is promising since it only involves solving several linear equations.
|
math.OC math.NA
|
this paper proposes an approach to address the voltage stability assessment vsa considering n1 contingency the approach leverages the sensitivity based thevenin index sti which involves evaluating the jacobian matrix at current operating condition since the n1 contingency case is hypothetical there is no information regarding the operating condition after a foreseen contingency the proposed approach first estimates the postcontingency operating point as well as possible pvpq transitions based on the current operating point then the sti for each contingency can be predicted using the estimated operating condition numerical results based on ieee 14bus system demonstrate the accuracy of the proposed approach in predicting the voltage stability margin under contingency moreover the online implementation of the proposed approach is promising since it only involves solving several linear equations
|
[['this', 'paper', 'proposes', 'an', 'approach', 'to', 'address', 'the', 'voltage', 'stability', 'assessment', 'vsa', 'considering', 'n1', 'contingency', 'the', 'approach', 'leverages', 'the', 'sensitivity', 'based', 'thevenin', 'index', 'sti', 'which', 'involves', 'evaluating', 'the', 'jacobian', 'matrix', 'at', 'current', 'operating', 'condition', 'since', 'the', 'n1', 'contingency', 'case', 'is', 'hypothetical', 'there', 'is', 'no', 'information', 'regarding', 'the', 'operating', 'condition', 'after', 'a', 'foreseen', 'contingency', 'the', 'proposed', 'approach', 'first', 'estimates', 'the', 'postcontingency', 'operating', 'point', 'as', 'well', 'as', 'possible', 'pvpq', 'transitions', 'based', 'on', 'the', 'current', 'operating', 'point', 'then', 'the', 'sti', 'for', 'each', 'contingency', 'can', 'be', 'predicted', 'using', 'the', 'estimated', 'operating', 'condition', 'numerical', 'results', 'based', 'on', 'ieee', '14bus', 'system', 'demonstrate', 'the', 'accuracy', 'of', 'the', 'proposed', 'approach', 'in', 'predicting', 'the', 'voltage', 'stability', 'margin', 'under', 'contingency', 'moreover', 'the', 'online', 'implementation', 'of', 'the', 'proposed', 'approach', 'is', 'promising', 'since', 'it', 'only', 'involves', 'solving', 'several', 'linear', 'equations']]
|
[-0.12835551436081177, 0.00937005132539876, -0.03823339730486509, 0.023183774741597503, -0.04527195971679148, -0.1869151955653774, 0.09469002466300487, 0.3221625732551292, -0.21453136605885262, -0.30241435039495157, 0.18353148401938527, -0.2313250965937444, -0.19148429337976955, 0.22326948344854153, -0.06923136034408423, 0.11611311785935417, 0.06757819104030377, 0.044812520546105315, -0.0799581635872628, -0.2595859620661482, 0.27568027587592836, 0.0977193779792402, 0.3723587442013457, 0.09008506923963455, 0.13705567449448616, 0.018143281206767274, -0.011131901240826943, -0.00492320998065819, -0.06842528312562371, 0.07272339985966242, 0.2771458775886723, 0.17024635558963505, 0.29723624361488293, -0.3953345610400823, -0.17282902749115966, 0.09451651876410982, 0.05900871574211367, 0.050651334104216184, -0.04571645877206713, -0.3004190519169765, 0.09457000671321247, -0.18146016012041236, -0.11044104687693551, -0.06736944856554798, -0.0489034721349168, 0.01584226942041845, -0.34591903984931655, 0.02535084449854775, 0.05189625616827026, 0.09131338736262377, -0.0640935162302312, -0.14052233101679085, -0.0010958992249119703, 0.08601890706070368, 0.03275688090838316, -0.03615554475581171, 0.15242027908592948, -0.07523292137903902, -0.12114785033402832, 0.37531637529453893, -0.024147540796548128, -0.20293950831414911, 0.11560007708154502, -0.04132428349868402, -0.11673201621128759, 0.08928290245995864, 0.14245557906766107, 0.07725914928504801, -0.16914990572918823, 0.06346085007067799, -0.012848855729588844, 0.17123192758711905, 0.08328513834762065, -0.03476434668955049, 0.18228290703946973, 0.27052216723150624, 0.08459963538779283, 0.13029101463199746, -0.1333737739464488, -0.1234100608702375, -0.2965898829453632, -0.09122142059303175, -0.20241415324642903, 0.010677933284103519, -0.10263474460133887, -0.13494552002383733, 0.41743048100812935, 0.22871559206763004, 0.12587137509680052, 0.06996777753517999, 0.34635901430944405, 0.14494585411762453, 0.04295763285742618, 0.0858365562506108, 0.21714364735805614, 0.06112765824407574, 0.10990312557638161, -0.21691952897859076, 0.1056125936369727, 0.08247238206933802]
|
1,803.04585
|
Categorizing Variants of Goodhart's Law
|
There are several distinct failure modes for overoptimization of systems on
the basis of metrics. This occurs when a metric which can be used to improve a
system is used to an extent that further optimization is ineffective or
harmful, and is sometimes termed Goodhart's Law. This class of failure is often
poorly understood, partly because terminology for discussing them is ambiguous,
and partly because discussion using this ambiguous terminology ignores
distinctions between different failure modes of this general type. This paper
expands on an earlier discussion by Garrabrant, which notes there are "(at
least) four different mechanisms" that relate to Goodhart's Law. This paper is
intended to explore these mechanisms further, and specify more clearly how they
occur. This discussion should be helpful in better understanding these types of
failures in economic regulation, in public policy, in machine learning, and in
Artificial Intelligence alignment. The importance of Goodhart effects depends
on the amount of power directed towards optimizing the proxy, and so the
increased optimization power offered by artificial intelligence makes it
especially critical for that field.
|
cs.AI q-fin.GN stat.ML
|
there are several distinct failure modes for overoptimization of systems on the basis of metrics this occurs when a metric which can be used to improve a system is used to an extent that further optimization is ineffective or harmful and is sometimes termed goodharts law this class of failure is often poorly understood partly because terminology for discussing them is ambiguous and partly because discussion using this ambiguous terminology ignores distinctions between different failure modes of this general type this paper expands on an earlier discussion by garrabrant which notes there are at least four different mechanisms that relate to goodharts law this paper is intended to explore these mechanisms further and specify more clearly how they occur this discussion should be helpful in better understanding these types of failures in economic regulation in public policy in machine learning and in artificial intelligence alignment the importance of goodhart effects depends on the amount of power directed towards optimizing the proxy and so the increased optimization power offered by artificial intelligence makes it especially critical for that field
|
[['there', 'are', 'several', 'distinct', 'failure', 'modes', 'for', 'overoptimization', 'of', 'systems', 'on', 'the', 'basis', 'of', 'metrics', 'this', 'occurs', 'when', 'a', 'metric', 'which', 'can', 'be', 'used', 'to', 'improve', 'a', 'system', 'is', 'used', 'to', 'an', 'extent', 'that', 'further', 'optimization', 'is', 'ineffective', 'or', 'harmful', 'and', 'is', 'sometimes', 'termed', 'goodharts', 'law', 'this', 'class', 'of', 'failure', 'is', 'often', 'poorly', 'understood', 'partly', 'because', 'terminology', 'for', 'discussing', 'them', 'is', 'ambiguous', 'and', 'partly', 'because', 'discussion', 'using', 'this', 'ambiguous', 'terminology', 'ignores', 'distinctions', 'between', 'different', 'failure', 'modes', 'of', 'this', 'general', 'type', 'this', 'paper', 'expands', 'on', 'an', 'earlier', 'discussion', 'by', 'garrabrant', 'which', 'notes', 'there', 'are', 'at', 'least', 'four', 'different', 'mechanisms', 'that', 'relate', 'to', 'goodharts', 'law', 'this', 'paper', 'is', 'intended', 'to', 'explore', 'these', 'mechanisms', 'further', 'and', 'specify', 'more', 'clearly', 'how', 'they', 'occur', 'this', 'discussion', 'should', 'be', 'helpful', 'in', 'better', 'understanding', 'these', 'types', 'of', 'failures', 'in', 'economic', 'regulation', 'in', 'public', 'policy', 'in', 'machine', 'learning', 'and', 'in', 'artificial', 'intelligence', 'alignment', 'the', 'importance', 'of', 'goodhart', 'effects', 'depends', 'on', 'the', 'amount', 'of', 'power', 'directed', 'towards', 'optimizing', 'the', 'proxy', 'and', 'so', 'the', 'increased', 'optimization', 'power', 'offered', 'by', 'artificial', 'intelligence', 'makes', 'it', 'especially', 'critical', 'for', 'that', 'field']]
|
[-0.10782615953457675, 0.11827462725490998, -0.07102711978501507, 0.11327406891155987, -0.11174291489512793, -0.17008818752531493, 0.05357935612089932, 0.3713392996575151, -0.2792911975192172, -0.30593648797699385, 0.11974825225570904, -0.23428946487871663, -0.21187436014147742, 0.18824113678286916, -0.14902264284731895, -0.0058248725533485415, 0.029864747471043042, 0.004582439090258308, -0.005432613125470068, -0.25348491929471495, 0.34536268214162974, 0.10181126551702618, 0.3199368600094957, 0.07639603713793414, 0.030642108680414303, -0.022052589068189264, -0.04784951503654676, 0.03434545143640467, -0.0835938562312679, 0.1348154538104843, 0.324359857789906, 0.18704934142796056, 0.3390474174198295, -0.4357645878195763, -0.2127594171943409, 0.12481283394619823, 0.1612226638463991, 0.08945949088116842, -0.010256002847121895, -0.22903108420382653, 0.09228299045536136, -0.156350213930543, -0.09045036801818891, -0.09103242649181213, 0.03296770142457847, -0.00347125772686143, -0.2065603126159736, 0.0378569991673742, 0.09857260397236262, 0.09708285894644048, -0.024275130185165576, -0.10121814067475497, 0.029206122508538622, 0.144328178452727, 0.10460881939157844, 0.028775074955608163, 0.12900759825017302, -0.1333291864205551, -0.1106909006567938, 0.40161358963165966, 0.025495802769437432, -0.2142164152022451, 0.22944193037492888, -0.06823217456362077, -0.15740019836063895, 0.08866434369768415, 0.18854207808584242, 0.0896194085389808, -0.16612128703896556, -0.011010371214111468, 0.023537003166690867, 0.15953480873256923, 0.046664024868181775, 0.027004679189662317, 0.23657750699935215, 0.16540331493131816, 0.050094581158565625, 0.1191057440066444, -0.005391705185341249, -0.10645560842822306, -0.26669588158705404, -0.12791909576925847, -0.1498829362754311, 0.0503830062225461, -0.04271974246109104, -0.13308027068419115, 0.36960149386099406, 0.20291244592251523, 0.16840209397354297, 0.0030763272355709757, 0.29950168655386994, 0.10721834985007132, 0.07536634299904107, 0.05560476042862449, 0.2533857204977955, 0.04191102816390672, 0.10203184229987008, -0.1759555417046483, 0.1353566881189389, 0.009492773206106255]
|
1,803.04586
|
Some properties of ordinary sense slice 1-links: Some answers to the
problem (26) of Fox
|
We prove that, for any ordinary sense slice 1-link $L$, we can define the Arf
invariant and Arf(L)=0. We prove that, for any m-component 1-link L_1, there
exists a 3m-component ordinary sense slaice 1-link L_2 of which L_1 is a
sublink.
|
math.GT
|
we prove that for any ordinary sense slice 1link l we can define the arf invariant and arfl0 we prove that for any mcomponent 1link l_1 there exists a 3mcomponent ordinary sense slaice 1link l_2 of which l_1 is a sublink
|
[['we', 'prove', 'that', 'for', 'any', 'ordinary', 'sense', 'slice', '1link', 'l', 'we', 'can', 'define', 'the', 'arf', 'invariant', 'and', 'arfl0', 'we', 'prove', 'that', 'for', 'any', 'mcomponent', '1link', 'l_1', 'there', 'exists', 'a', '3mcomponent', 'ordinary', 'sense', 'slaice', '1link', 'l_2', 'of', 'which', 'l_1', 'is', 'a', 'sublink']]
|
[-0.2406899959437157, 0.12177215661167314, -0.12928565199437894, 0.1421595323787953, -0.059354262818631376, -0.20116291624052743, -0.039270686769956036, 0.395794877782464, -0.3356660152540395, -0.134424963966012, 0.09406851018827997, -0.27762408133007976, -0.1896896075677911, 0.14261969825939128, -0.14312351906770154, 0.012487880174854868, 0.07463900760845527, 0.14047435528941846, -0.12942542524175032, -0.20188589697997822, 0.3392250659679504, -0.15605886800116614, 0.12632212948244015, 0.014063971950427481, 0.19927486796912394, 0.045080288129515554, 0.02609491321307264, 0.040118355745155564, -0.2453959969161109, 0.0991005259566009, 0.29089468384259626, 0.10499607559636627, 0.2584088019855124, -0.2772152289552124, -0.14856500440203635, 0.292812321972298, 0.1583534983525935, -0.02814931193623986, -0.012330830673147974, -0.17894613517350272, 0.23549727762216016, -0.1210299221014506, -0.12718296874510615, -0.07434607277575292, 0.0970596839967919, -0.025406180047675184, -0.38135348338829844, 0.008276670337899736, 0.18797664285490387, 0.051712960764569674, 0.0030379229666371095, -0.06997528275180805, -0.04486837393395897, 0.035172364748034035, -0.004399469692112976, 0.09634392021076851, 0.025472127078836292, -0.0018925341091265804, -0.12729557145901613, 0.34402863269573764, -0.1121007944457233, -0.2744923376135136, 0.13885461450186803, -0.07401385259397916, -0.13420309145983897, 0.03486562794760654, 0.013368648820017514, 0.13808401615211838, -0.023962651305880985, 0.1858973943269934, -0.16810380598824276, 0.1645976511246868, 0.11395057567738388, 0.029771997201207438, 0.07810604395835023, 0.009303239232394844, 0.19129565752748595, 0.11967217814373343, -0.01667527062818408, -0.002582305012957046, -0.3772894778337918, -0.27102644908192913, -0.13993464852683246, 0.14982621736922547, -0.0875958465158443, -0.20560095596470332, 0.24520458820226945, 0.07995214170506715, 0.2124268418962234, 0.17525245244676052, 0.21985071451758573, 0.16053904024393936, 0.04008330777287483, 0.17587327647120937, 0.15917996860011235, 0.07683451027045712, -0.05889902219764496, -0.13050339999608696, 0.03072225649252926, 0.23451320586824104]
|
1,803.04587
|
Constrained Optimal Consensus in Dynamical Networks
|
In this paper, an optimal consensus problem with local inequality constraints
is studied for a network of single-integrator agents. The goal is that a group
of single-integrator a gents rendezvous at the optimal point of the sum of
local convex objective functions. The local objective functions are only
available to the corresponding agents that only need to know their relative
distances from their neighbors in order to seek the final optimal point. This
point is supposed to be confined by some local inequality constraints. To
tackle this problem, we integrate the primal dual gradient-based optimization
algorithm with a consensus protocol to drive the agents toward the agreed point
that satisfies KKT conditions. The asymptotic convergence of the solution of
the optimization problem is proven with the help of LaSalle's invariance
principle for hybrid systems. A numerical example is presented to show the
effectiveness of our protocol.
|
math.DS math.OC
|
in this paper an optimal consensus problem with local inequality constraints is studied for a network of singleintegrator agents the goal is that a group of singleintegrator a gents rendezvous at the optimal point of the sum of local convex objective functions the local objective functions are only available to the corresponding agents that only need to know their relative distances from their neighbors in order to seek the final optimal point this point is supposed to be confined by some local inequality constraints to tackle this problem we integrate the primal dual gradientbased optimization algorithm with a consensus protocol to drive the agents toward the agreed point that satisfies kkt conditions the asymptotic convergence of the solution of the optimization problem is proven with the help of lasalles invariance principle for hybrid systems a numerical example is presented to show the effectiveness of our protocol
|
[['in', 'this', 'paper', 'an', 'optimal', 'consensus', 'problem', 'with', 'local', 'inequality', 'constraints', 'is', 'studied', 'for', 'a', 'network', 'of', 'singleintegrator', 'agents', 'the', 'goal', 'is', 'that', 'a', 'group', 'of', 'singleintegrator', 'a', 'gents', 'rendezvous', 'at', 'the', 'optimal', 'point', 'of', 'the', 'sum', 'of', 'local', 'convex', 'objective', 'functions', 'the', 'local', 'objective', 'functions', 'are', 'only', 'available', 'to', 'the', 'corresponding', 'agents', 'that', 'only', 'need', 'to', 'know', 'their', 'relative', 'distances', 'from', 'their', 'neighbors', 'in', 'order', 'to', 'seek', 'the', 'final', 'optimal', 'point', 'this', 'point', 'is', 'supposed', 'to', 'be', 'confined', 'by', 'some', 'local', 'inequality', 'constraints', 'to', 'tackle', 'this', 'problem', 'we', 'integrate', 'the', 'primal', 'dual', 'gradientbased', 'optimization', 'algorithm', 'with', 'a', 'consensus', 'protocol', 'to', 'drive', 'the', 'agents', 'toward', 'the', 'agreed', 'point', 'that', 'satisfies', 'kkt', 'conditions', 'the', 'asymptotic', 'convergence', 'of', 'the', 'solution', 'of', 'the', 'optimization', 'problem', 'is', 'proven', 'with', 'the', 'help', 'of', 'lasalles', 'invariance', 'principle', 'for', 'hybrid', 'systems', 'a', 'numerical', 'example', 'is', 'presented', 'to', 'show', 'the', 'effectiveness', 'of', 'our', 'protocol']]
|
[-0.1462363283149898, -0.011108940865358755, -0.1189569156825671, 0.059663839629602394, -0.08703434253593201, -0.16523470105603338, 0.09342435441413445, 0.3803097572739654, -0.3445192453933173, -0.27966409830440736, 0.12027666331911138, -0.2419218943165294, -0.15455924426687176, 0.11964721476723408, -0.0989887464598849, 0.11451950413014354, 0.053889946979952266, 0.05881544829442583, -0.061908308418210725, -0.29347088569775226, 0.31672943298672807, 0.035911947806719045, 0.2607495533270312, 0.018755227670972718, 0.13197263257802816, -0.00953028618261732, 0.04542006075639149, 0.026647404892016845, -0.11824877444601513, 0.13836069817831417, 0.28763664734774624, 0.18024496421988667, 0.3654854984825541, -0.40758929790222437, -0.14346129177459355, 0.16282068854519005, 0.11840494188624595, 0.08447208644758011, -0.019963001810688653, -0.2604295792764631, 0.12212854245163757, -0.1029533784354812, -0.15375384673925824, -0.03386291109410853, -0.04571721622527673, 0.07190735719070353, -0.3419915280754453, 0.02554805113388033, 0.03969728996649039, 0.00755423872956428, -0.09201227471007613, -0.06291604685629236, 0.001014185097903527, 0.1387321394354362, 0.046842660719593025, 0.0667380603817131, 0.1376329348262014, -0.10641554970462838, -0.13648684923376503, 0.3877745086648341, 0.027662504961360888, -0.23639016224850162, 0.16382548191408017, -0.06925394445786189, -0.13855340853975764, 0.11793928469113749, 0.18163953887395046, 0.15772009770674952, -0.19920300664440407, 0.08111720608611558, -0.07785257654071882, 0.13663573026544704, 0.004053600309095506, 0.019346232543667328, 0.1349304511019125, 0.14772524316474026, 0.2288749831824981, 0.13780836643378153, 0.010367857658400618, -0.1491686187170703, -0.3116991666498883, -0.1364862259027773, -0.22843346501989611, 0.020175011590893927, -0.09711622130768052, -0.10196687386467539, 0.3503419449231748, 0.16308727744195994, 0.159239955052055, 0.11370305013521735, 0.2980234586473169, 0.1176268921113284, 0.013657008501668942, 0.10787067085119156, 0.26915302838556115, 0.09386624315882038, 0.09383501454160131, -0.24809778180968917, 0.10040975155244614, 0.10647216728920567]
|
1,803.04588
|
Electrical detection of a skyrmion in a magnetic tunneling junction
|
We theoretically investigated a method to detect a single skyrmion in a
magnetic tunneling junction (MTJ) geometry. Using the tunneling Hamiltonian
approach, we calculated the tunneling magnetoresistance (TMR) ratio of the
skyrmion-ferromagnet bilayer system. We show the TMR ratio is determined sorely
by the spin profile of the skyrmion and geometrical factor of the device, if
only the system is reasonably clean such that the spectral broadening is
smaller than the exchange coupling between the local and the itinerant magnetic
moment. The TMR ratio in that case can amount to $30\%$ or higher when the
diameter of the skyrmion is as large as the size of the device. Since this
criterion is easily achievable in real systems, MTJ geometry can be a good
candidate of the electrical detection of a single skyrmion i.e., the reading
process of the information in the future skyrmionics memory devices.
|
cond-mat.mes-hall
|
we theoretically investigated a method to detect a single skyrmion in a magnetic tunneling junction mtj geometry using the tunneling hamiltonian approach we calculated the tunneling magnetoresistance tmr ratio of the skyrmionferromagnet bilayer system we show the tmr ratio is determined sorely by the spin profile of the skyrmion and geometrical factor of the device if only the system is reasonably clean such that the spectral broadening is smaller than the exchange coupling between the local and the itinerant magnetic moment the tmr ratio in that case can amount to 30 or higher when the diameter of the skyrmion is as large as the size of the device since this criterion is easily achievable in real systems mtj geometry can be a good candidate of the electrical detection of a single skyrmion ie the reading process of the information in the future skyrmionics memory devices
|
[['we', 'theoretically', 'investigated', 'a', 'method', 'to', 'detect', 'a', 'single', 'skyrmion', 'in', 'a', 'magnetic', 'tunneling', 'junction', 'mtj', 'geometry', 'using', 'the', 'tunneling', 'hamiltonian', 'approach', 'we', 'calculated', 'the', 'tunneling', 'magnetoresistance', 'tmr', 'ratio', 'of', 'the', 'skyrmionferromagnet', 'bilayer', 'system', 'we', 'show', 'the', 'tmr', 'ratio', 'is', 'determined', 'sorely', 'by', 'the', 'spin', 'profile', 'of', 'the', 'skyrmion', 'and', 'geometrical', 'factor', 'of', 'the', 'device', 'if', 'only', 'the', 'system', 'is', 'reasonably', 'clean', 'such', 'that', 'the', 'spectral', 'broadening', 'is', 'smaller', 'than', 'the', 'exchange', 'coupling', 'between', 'the', 'local', 'and', 'the', 'itinerant', 'magnetic', 'moment', 'the', 'tmr', 'ratio', 'in', 'that', 'case', 'can', 'amount', 'to', '30', 'or', 'higher', 'when', 'the', 'diameter', 'of', 'the', 'skyrmion', 'is', 'as', 'large', 'as', 'the', 'size', 'of', 'the', 'device', 'since', 'this', 'criterion', 'is', 'easily', 'achievable', 'in', 'real', 'systems', 'mtj', 'geometry', 'can', 'be', 'a', 'good', 'candidate', 'of', 'the', 'electrical', 'detection', 'of', 'a', 'single', 'skyrmion', 'ie', 'the', 'reading', 'process', 'of', 'the', 'information', 'in', 'the', 'future', 'skyrmionics', 'memory', 'devices']]
|
[-0.22830914164519023, 0.10996909100665814, -0.03644291890021931, 0.03545460731529854, -0.0445888191704095, -0.1585088006621744, 0.0662077814554828, 0.36620673671778703, -0.2842534442736198, -0.35187359498619725, 0.02280328602905178, -0.2567614324701329, -0.12147348605503794, 0.21694154870379456, -0.011796674813215051, 0.007925661604127122, 0.013294434250888621, 0.03374135064142239, -0.037509663283951035, -0.23165865787046236, 0.266142403763499, 0.06801250361604616, 0.32543360793756115, 0.0967305484001473, 0.0594914224638564, 0.0018814111212527172, 0.13069385027059374, 0.07596296128920382, -0.10904003347998999, 0.059723629118202046, 0.18595399278597646, -0.011458952277381387, 0.16864030389115214, -0.4160084757928012, -0.1558635731788753, 0.04246348703357702, 0.16296478215695565, 0.1493783103651367, -0.014618979577790014, -0.2646832157042809, 0.11735360759768002, -0.16614378629148835, -0.07650766278018434, -0.07300638122574633, 0.011279406426991854, -0.007584634114108566, -0.2576196815611588, 0.07628418182462661, 0.0467175121476531, 0.05205779706334902, -0.05129583621005117, -0.0932954057041368, -0.059337360014776803, 0.07493938983700194, 0.013414852474549358, 0.029267903683325533, 0.197955426355798, -0.1419260627573951, -0.1200840132530882, 0.32660780213255847, -0.05735534796794026, -0.16943671184930686, 0.09548800617954435, -0.20172257360698292, -0.02800987334921956, 0.12357254994761509, 0.11968450976807314, 0.14015683310248683, -0.16016333824973117, 0.0606536357809091, -0.008011841047037806, 0.19868090085704657, 0.04213971230718824, 0.059408603126131415, 0.2585649043030571, 0.2315768339920194, 0.06308228892157786, 0.15428680321444213, -0.17892957129515707, -0.04065020985176994, -0.2269587887769578, -0.1828996070253197, -0.25526781541621957, 0.1038582795675514, -0.11541892875922916, -0.17231977685393454, 0.38492622879695976, 0.1651063815904005, 0.1988021119048224, -0.03550524925069314, 0.35258866475325906, 0.14809976006411793, 0.12651065702084452, 0.01702465017701292, 0.257753127720207, 0.14261152617432848, 0.150643227272667, -0.2942636520925185, 0.1103635486215353, -0.02755252571660094]
|
1,803.04589
|
Height functions for motives, II
|
This is the Part II of our paper "Height functions for motives". We consider
more general period domains and the height functions on more general sets of
motives. We also consider the corresponding Hodge theoretic variant of
Nevanlinna theory.
|
math.NT
|
this is the part ii of our paper height functions for motives we consider more general period domains and the height functions on more general sets of motives we also consider the corresponding hodge theoretic variant of nevanlinna theory
|
[['this', 'is', 'the', 'part', 'ii', 'of', 'our', 'paper', 'height', 'functions', 'for', 'motives', 'we', 'consider', 'more', 'general', 'period', 'domains', 'and', 'the', 'height', 'functions', 'on', 'more', 'general', 'sets', 'of', 'motives', 'we', 'also', 'consider', 'the', 'corresponding', 'hodge', 'theoretic', 'variant', 'of', 'nevanlinna', 'theory']]
|
[-0.11815398153610146, 0.033431973723240964, -0.1209339245270269, 0.16005936618416738, -0.07106856308065546, -0.07352820136703742, 0.007064115578451982, 0.31475472192351633, -0.33605305487528825, -0.18392169006312123, 0.08508760546549009, -0.20293330401182175, -0.2180961138353898, 0.21278245938129914, -0.2057994885895497, -0.02939104649405449, 0.009848011824756097, 0.040617160546856046, -0.06985963114465658, -0.3070670079129438, 0.5254966694121368, -0.033604185455120526, 0.21783909754445538, 0.06676397558588248, 0.012751549016684294, 0.07178937597200274, -0.022242466755694926, -0.05259274520600835, -0.18884738732893497, 0.2330926370401031, 0.27010867047386294, 0.1145331911288966, 0.2848241986372532, -0.41825976189321434, -0.1531900738258488, 0.1467495938667502, 0.04605162721604873, 0.07964133034245326, 0.04102945828568549, -0.2101435036613391, 0.0958977140701161, -0.1718440308020665, -0.16826741381858787, -0.034962398979144216, 0.06331078575637478, 0.01644110660522412, -0.26111786717023605, 0.028909299921883173, -0.012733035458204074, 0.1743311270689353, -0.11744806054645242, -0.14562814032587296, 0.011748480246378442, 0.019329898895170443, 0.01885236392561824, 0.028476139972320735, 0.06816184866982393, -0.10692339604839873, -0.12160002607374619, 0.33590129939600444, -0.05279531998512072, -0.21595258112901297, 0.1421835694509821, -0.15365219929327184, -0.14714981564201224, 0.030356523485328905, 0.14613290183628216, 0.27282425057954895, -0.006014253251636639, 0.14017951237604928, -0.15169105148659304, 0.1714252761254708, 0.1166144664136645, -0.002980040108713393, 0.14973550418821666, 0.1009385075706702, 0.10108514242948821, 0.18559716140421537, -0.026601518056570336, -0.13175479513712418, -0.40427804740671164, -0.17262646377994081, -0.08879875665745483, 0.03737426174279207, -0.12437522361160984, -0.20305550236923572, 0.4613339674109832, 0.1033810461178804, 0.14822705815999937, 0.20046927039630902, 0.2355602602354991, 0.14907757750748155, 0.005907248238844869, 0.01322490930891572, 0.11009122469486335, 0.1959829964579489, 0.10114398050623444, -0.09467402691594683, 0.011665380906122617, 0.139441873305119]
|
1,803.0459
|
Causality and Legendrian linking for higher dimensional spacetimes
|
Let $(X^{m+1}, g)$ be an $(m+1)$-dimensional globally hyperbolic spacetime
with Cauchy surface $M^m$, and let $\widetilde M^m$ be the universal cover of
the Cauchy surface. Let $\mathcal N_{X}$ be the contact manifold of all future
directed unparameterized light rays in $X$ that we identify with the spherical
cotangent bundle $ST^*M.$ Jointly with Stefan Nemirovski we showed when
$\widetilde M^m$ is {\bf not\/} a compact manifold, then two points $x, y\in X$
are causally related if and only if the Legendrian spheres $\mathfrak S_x,
\mathfrak S_y$ of all light rays through $x$ and $y$ are linked in $\mathcal
N_{X}.$
In this short note we use the contact Bott-Samelson theorem of Frauenfelder,
Labrousse and Schlenk to show that the same statement is true for all $X$ for
which the integral cohomology ring of a closed $\widetilde M$ is {\bf not} the
one of the CROSS (compact rank one symmetric space).
If $M$ admits a Riemann metric $\overline g$, a point $x$ and a number
$\ell>0$ such that all unit speed geodesics starting from $x$ return back to
$x$ in time $\ell$, then $(M, \overline g)$ is called a $Y^x_{\ell}$ manifold.
Jointly with Stefan Nemirovski we observed that causality in $(M\times \mathbb
R, \overline g\oplus -t^2)$ is {\bf not} equivalent to Legendrian linking.
Every $Y^x_{\ell}$-Riemann manifold has compact universal cover and its
integral cohomology ring is the one of a CROSS. So we conjecture that
Legendrian linking is equivalent to causality if and only if one can {\bf not}
put a $Y^x_{\ell}$ Riemann metric on a Cauchy surface $M.$
|
math.DG gr-qc math-ph math.MP math.SG
|
let xm1 g be an m1dimensional globally hyperbolic spacetime with cauchy surface mm and let widetilde mm be the universal cover of the cauchy surface let mathcal n_x be the contact manifold of all future directed unparameterized light rays in x that we identify with the spherical cotangent bundle stm jointly with stefan nemirovski we showed when widetilde mm is bf not a compact manifold then two points x yin x are causally related if and only if the legendrian spheres mathfrak s_x mathfrak s_y of all light rays through x and y are linked in mathcal n_x in this short note we use the contact bottsamelson theorem of frauenfelder labrousse and schlenk to show that the same statement is true for all x for which the integral cohomology ring of a closed widetilde m is bf not the one of the cross compact rank one symmetric space if m admits a riemann metric overline g a point x and a number ell0 such that all unit speed geodesics starting from x return back to x in time ell then m overline g is called a yx_ell manifold jointly with stefan nemirovski we observed that causality in mtimes mathbb r overline goplus t2 is bf not equivalent to legendrian linking every yx_ellriemann manifold has compact universal cover and its integral cohomology ring is the one of a cross so we conjecture that legendrian linking is equivalent to causality if and only if one can bf not put a yx_ell riemann metric on a cauchy surface m
|
[['let', 'xm1', 'g', 'be', 'an', 'm1dimensional', 'globally', 'hyperbolic', 'spacetime', 'with', 'cauchy', 'surface', 'mm', 'and', 'let', 'widetilde', 'mm', 'be', 'the', 'universal', 'cover', 'of', 'the', 'cauchy', 'surface', 'let', 'mathcal', 'n_x', 'be', 'the', 'contact', 'manifold', 'of', 'all', 'future', 'directed', 'unparameterized', 'light', 'rays', 'in', 'x', 'that', 'we', 'identify', 'with', 'the', 'spherical', 'cotangent', 'bundle', 'stm', 'jointly', 'with', 'stefan', 'nemirovski', 'we', 'showed', 'when', 'widetilde', 'mm', 'is', 'bf', 'not', 'a', 'compact', 'manifold', 'then', 'two', 'points', 'x', 'yin', 'x', 'are', 'causally', 'related', 'if', 'and', 'only', 'if', 'the', 'legendrian', 'spheres', 'mathfrak', 's_x', 'mathfrak', 's_y', 'of', 'all', 'light', 'rays', 'through', 'x', 'and', 'y', 'are', 'linked', 'in', 'mathcal', 'n_x', 'in', 'this', 'short', 'note', 'we', 'use', 'the', 'contact', 'bottsamelson', 'theorem', 'of', 'frauenfelder', 'labrousse', 'and', 'schlenk', 'to', 'show', 'that', 'the', 'same', 'statement', 'is', 'true', 'for', 'all', 'x', 'for', 'which', 'the', 'integral', 'cohomology', 'ring', 'of', 'a', 'closed', 'widetilde', 'm', 'is', 'bf', 'not', 'the', 'one', 'of', 'the', 'cross', 'compact', 'rank', 'one', 'symmetric', 'space', 'if', 'm', 'admits', 'a', 'riemann', 'metric', 'overline', 'g', 'a', 'point', 'x', 'and', 'a', 'number', 'ell0', 'such', 'that', 'all', 'unit', 'speed', 'geodesics', 'starting', 'from', 'x', 'return', 'back', 'to', 'x', 'in', 'time', 'ell', 'then', 'm', 'overline', 'g', 'is', 'called', 'a', 'yx_ell', 'manifold', 'jointly', 'with', 'stefan', 'nemirovski', 'we', 'observed', 'that', 'causality', 'in', 'mtimes', 'mathbb', 'r', 'overline', 'goplus', 't2', 'is', 'bf', 'not', 'equivalent', 'to', 'legendrian', 'linking', 'every', 'yx_ellriemann', 'manifold', 'has', 'compact', 'universal', 'cover', 'and', 'its', 'integral', 'cohomology', 'ring', 'is', 'the', 'one', 'of', 'a', 'cross', 'so', 'we', 'conjecture', 'that', 'legendrian', 'linking', 'is', 'equivalent', 'to', 'causality', 'if', 'and', 'only', 'if', 'one', 'can', 'bf', 'not', 'put', 'a', 'yx_ell', 'riemann', 'metric', 'on', 'a', 'cauchy', 'surface', 'm']]
|
[-0.21464454680163828, 0.10827447145504901, -0.08447979368724018, 0.016752884818411005, -0.11910135812118709, -0.20575237971183563, -0.021635679179795145, 0.36967676995499504, -0.3163582116054992, -0.17316069015087412, 0.08092065632023612, -0.28783954043100246, -0.10756076543752681, 0.16707849337734162, -0.1373475431790298, -0.02520235403397468, 0.054762342048528055, 0.1118250452120611, -0.10247484645861689, -0.28049408316303653, 0.3512952796715711, -0.06487004813878605, 0.1790777545187637, 0.06591674468816361, 0.15961630572934474, 0.003536895431193804, 0.04859592219711178, 0.02160099650156178, -0.17596534945201595, 0.06262626128626012, 0.29258967300374356, 0.09945122979670054, 0.18072876564711185, -0.3616997348785628, -0.15865848833669183, 0.2298092801892568, 0.11855454477740245, -0.11575600392571354, 0.048138050101457226, -0.2742816057492284, 0.15607458255729556, -0.08270265485182227, -0.1307299944594325, -0.021706162114805055, 0.14516329332134717, -0.004014768154500792, -0.2407140388829811, -0.015220265769000565, 0.09427932555979443, 0.01669884479368135, -0.04097830266405326, -0.0919545934764698, -0.1303243134799044, 0.040861392585539426, 0.0021001242816315164, 0.19010262015563922, 0.09233733073652109, -0.004652616851556573, -0.047924463709239806, 0.36585313273179865, -0.09152093225034945, -0.2770190518792896, 0.08724853114639815, -0.2115306506332542, -0.14193582789102083, 0.1647168322168808, 0.08976443520458859, 0.18631970114548163, -0.0471717439874723, 0.23750126478839703, -0.14526921075340066, 0.11313519568936918, 0.1006186380312549, -0.047120457209299305, 0.1752986213255171, 0.0984930836647335, 0.10814997273897346, 0.05900434635917745, -0.06975573555119188, 0.030990234427412763, -0.3982802377459371, -0.22810566098251867, -0.16722388002912456, 0.22867631039509204, -0.10145171237459252, -0.14866907849153949, 0.29613781574141557, 0.014166724572460803, 0.21677608292416803, 0.11369725449208451, 0.2010345694734641, 0.022123801286354484, 0.015164155030294158, 0.1741699549787131, 0.10928539141997813, 0.19248899355501173, -0.01604615162045414, -0.11666492998345002, -0.033289758566839044, 0.1682609204287892]
|
1,803.04591
|
A Generalization of the Robust Positive Expectation Theorem for Stock
Trading via Feedback Control
|
The starting point of this paper is the so-called Robust Positive Expectation
(RPE) Theorem, a result which appears in literature in the context of
Simultaneous Long-Short stock trading. This theorem states that using a
combination of two specially-constructed linear feedback trading controllers,
one long and one short, the expected value of the resulting gain-loss function
is guaranteed to be robustly positive with respect to a large class of
stochastic processes for the stock price. The main result of this paper is a
generalization of this theorem. Whereas previous work applies to a single
stock, in this paper, we consider a pair of stocks. To this end, we make two
assumptions on their expected returns. The first assumption involves price
correlation between the two stocks and the second involves a bounded non-zero
momentum condition. With known uncertainty bounds on the parameters associated
with these assumptions, our new version of the RPE Theorem provides necessary
and sufficient conditions on the positive feedback parameter K of the
controller under which robust positive expectation is assured. We also
demonstrate that our result generalizes the one existing for the single-stock
case. Finally, it is noted that our results also can be interpreted in the
context of pairs trading.
|
q-fin.ST q-fin.CP
|
the starting point of this paper is the socalled robust positive expectation rpe theorem a result which appears in literature in the context of simultaneous longshort stock trading this theorem states that using a combination of two speciallyconstructed linear feedback trading controllers one long and one short the expected value of the resulting gainloss function is guaranteed to be robustly positive with respect to a large class of stochastic processes for the stock price the main result of this paper is a generalization of this theorem whereas previous work applies to a single stock in this paper we consider a pair of stocks to this end we make two assumptions on their expected returns the first assumption involves price correlation between the two stocks and the second involves a bounded nonzero momentum condition with known uncertainty bounds on the parameters associated with these assumptions our new version of the rpe theorem provides necessary and sufficient conditions on the positive feedback parameter k of the controller under which robust positive expectation is assured we also demonstrate that our result generalizes the one existing for the singlestock case finally it is noted that our results also can be interpreted in the context of pairs trading
|
[['the', 'starting', 'point', 'of', 'this', 'paper', 'is', 'the', 'socalled', 'robust', 'positive', 'expectation', 'rpe', 'theorem', 'a', 'result', 'which', 'appears', 'in', 'literature', 'in', 'the', 'context', 'of', 'simultaneous', 'longshort', 'stock', 'trading', 'this', 'theorem', 'states', 'that', 'using', 'a', 'combination', 'of', 'two', 'speciallyconstructed', 'linear', 'feedback', 'trading', 'controllers', 'one', 'long', 'and', 'one', 'short', 'the', 'expected', 'value', 'of', 'the', 'resulting', 'gainloss', 'function', 'is', 'guaranteed', 'to', 'be', 'robustly', 'positive', 'with', 'respect', 'to', 'a', 'large', 'class', 'of', 'stochastic', 'processes', 'for', 'the', 'stock', 'price', 'the', 'main', 'result', 'of', 'this', 'paper', 'is', 'a', 'generalization', 'of', 'this', 'theorem', 'whereas', 'previous', 'work', 'applies', 'to', 'a', 'single', 'stock', 'in', 'this', 'paper', 'we', 'consider', 'a', 'pair', 'of', 'stocks', 'to', 'this', 'end', 'we', 'make', 'two', 'assumptions', 'on', 'their', 'expected', 'returns', 'the', 'first', 'assumption', 'involves', 'price', 'correlation', 'between', 'the', 'two', 'stocks', 'and', 'the', 'second', 'involves', 'a', 'bounded', 'nonzero', 'momentum', 'condition', 'with', 'known', 'uncertainty', 'bounds', 'on', 'the', 'parameters', 'associated', 'with', 'these', 'assumptions', 'our', 'new', 'version', 'of', 'the', 'rpe', 'theorem', 'provides', 'necessary', 'and', 'sufficient', 'conditions', 'on', 'the', 'positive', 'feedback', 'parameter', 'k', 'of', 'the', 'controller', 'under', 'which', 'robust', 'positive', 'expectation', 'is', 'assured', 'we', 'also', 'demonstrate', 'that', 'our', 'result', 'generalizes', 'the', 'one', 'existing', 'for', 'the', 'singlestock', 'case', 'finally', 'it', 'is', 'noted', 'that', 'our', 'results', 'also', 'can', 'be', 'interpreted', 'in', 'the', 'context', 'of', 'pairs', 'trading']]
|
[-0.11765956307621903, 0.0729432784777024, -0.1059782533205603, 0.08851772741965562, -0.07047738420251425, -0.1294514737668272, 0.08358382497566041, 0.34558853539776535, -0.2736019187360209, -0.26640653886110754, 0.126639921097131, -0.24360857672509875, -0.16208637491938208, 0.20395009014478857, -0.11203867417073228, 0.019420459778924093, 0.05528283157353612, 0.04693606028812799, -0.030316264961043945, -0.2685806587820246, 0.34405884892440003, 0.02281634573591873, 0.26314771006870463, 0.06886833182179904, 0.12446050901002813, 0.004394498958003403, -0.037943795128577935, 0.004638412747172509, -0.11829688447111344, 0.14361508178039417, 0.22728209581461245, 0.08803437590036578, 0.3242621789732487, -0.3685431355555164, -0.15320771384412551, 0.15731344837522465, 0.04814373483949936, 0.08849259275518874, -0.018021813726933247, -0.24246280144215424, 0.09957926859502855, -0.17444767392964314, -0.13146906133538278, -0.04310598952148518, -0.005349182468460928, 0.005011641148061839, -0.33925595197199593, 0.0814076954222833, 0.128269307156143, -0.004973498928821115, -0.06261382324362894, -0.0888729135604981, -0.014997540471734166, 0.10690420761354047, 0.1028510308435468, 0.0005844444500992425, 0.08721903690810104, -0.08217416731364066, -0.1457339957132267, 0.34322032365154953, -0.08789248675560939, -0.19424444122129295, 0.15427105848465372, -0.12024927359664499, -0.1496069423363332, 0.08061219707228207, 0.149987311012545, 0.11836007676931043, -0.1560228454585344, 0.056700206383899096, -0.10240603459648567, 0.1798498636962544, 0.048688286740222186, 0.020525847870561453, 0.15623488793804283, 0.14819020744399306, 0.1297251466929101, 0.16118139749402088, -0.0493035871010518, -0.143885044036387, -0.33834500788794003, -0.13751970497674612, -0.1814885822938534, 0.056400757854675306, -0.10964299450459311, -0.14977406502855795, 0.4006350094309575, 0.15329278724401785, 0.19481890153161152, 0.128278103699714, 0.2875017748205083, 0.1544822622785036, 0.025914733361517363, 0.06628983963216369, 0.22397072759392386, 0.07842822388589087, 0.11249393637356635, -0.17753150449137292, 0.11613581137325947, 0.05751047611009217]
|
1,803.04592
|
Effects of "stuffing" on the atomic and electronic structure of the
pyrochlore Yb$_2$Ti$_2$O$_7$
|
There are reasons to believe that the ground state of the magnetic rare earth
pyrochlore Yb$_2$Ti$_2$O$_7$ is on the boundary between competing ground
states. We have carried out $\mathrm{\textit{ab initio}}$ density functional
calculations to determine the most stable chemical formula as a function of the
oxygen chemical potential and the likely location of the oxygen atoms in the
unit cell of the "stuffed" system. We find that it is energetically favorable
in the "stuffed" crystal (with an Yb replacement on a Ti site) to contain
oxygen vacancies which dope the Yb 4$\mathrm{\textit{f}}$ orbitals and
qualitatively change the electronic properties of the system. In addition, with
the inclusion of the contribution of spin-orbit-coupling (SOC) on top of the
GGA+U approach, we investigated the electronic structure and the magnetic
moments of the most stable "stuffed" system. In our determined "stuffed"
structure the valence bands as compared to those of the pure system are pushed
down and a change in hybridization between the O 2$\mathrm{\textit{p}}$
orbitals and the metal ion states is found. Our first-principle findings should
form a foundation for effective models describing the low-temperature
properties of this material whose true ground state remains controversial.
|
cond-mat.str-el
|
there are reasons to believe that the ground state of the magnetic rare earth pyrochlore yb_2ti_2o_7 is on the boundary between competing ground states we have carried out mathrmtextitab initio density functional calculations to determine the most stable chemical formula as a function of the oxygen chemical potential and the likely location of the oxygen atoms in the unit cell of the stuffed system we find that it is energetically favorable in the stuffed crystal with an yb replacement on a ti site to contain oxygen vacancies which dope the yb 4mathrmtextitf orbitals and qualitatively change the electronic properties of the system in addition with the inclusion of the contribution of spinorbitcoupling soc on top of the ggau approach we investigated the electronic structure and the magnetic moments of the most stable stuffed system in our determined stuffed structure the valence bands as compared to those of the pure system are pushed down and a change in hybridization between the o 2mathrmtextitp orbitals and the metal ion states is found our firstprinciple findings should form a foundation for effective models describing the lowtemperature properties of this material whose true ground state remains controversial
|
[['there', 'are', 'reasons', 'to', 'believe', 'that', 'the', 'ground', 'state', 'of', 'the', 'magnetic', 'rare', 'earth', 'pyrochlore', 'yb_2ti_2o_7', 'is', 'on', 'the', 'boundary', 'between', 'competing', 'ground', 'states', 'we', 'have', 'carried', 'out', 'mathrmtextitab', 'initio', 'density', 'functional', 'calculations', 'to', 'determine', 'the', 'most', 'stable', 'chemical', 'formula', 'as', 'a', 'function', 'of', 'the', 'oxygen', 'chemical', 'potential', 'and', 'the', 'likely', 'location', 'of', 'the', 'oxygen', 'atoms', 'in', 'the', 'unit', 'cell', 'of', 'the', 'stuffed', 'system', 'we', 'find', 'that', 'it', 'is', 'energetically', 'favorable', 'in', 'the', 'stuffed', 'crystal', 'with', 'an', 'yb', 'replacement', 'on', 'a', 'ti', 'site', 'to', 'contain', 'oxygen', 'vacancies', 'which', 'dope', 'the', 'yb', '4mathrmtextitf', 'orbitals', 'and', 'qualitatively', 'change', 'the', 'electronic', 'properties', 'of', 'the', 'system', 'in', 'addition', 'with', 'the', 'inclusion', 'of', 'the', 'contribution', 'of', 'spinorbitcoupling', 'soc', 'on', 'top', 'of', 'the', 'ggau', 'approach', 'we', 'investigated', 'the', 'electronic', 'structure', 'and', 'the', 'magnetic', 'moments', 'of', 'the', 'most', 'stable', 'stuffed', 'system', 'in', 'our', 'determined', 'stuffed', 'structure', 'the', 'valence', 'bands', 'as', 'compared', 'to', 'those', 'of', 'the', 'pure', 'system', 'are', 'pushed', 'down', 'and', 'a', 'change', 'in', 'hybridization', 'between', 'the', 'o', '2mathrmtextitp', 'orbitals', 'and', 'the', 'metal', 'ion', 'states', 'is', 'found', 'our', 'firstprinciple', 'findings', 'should', 'form', 'a', 'foundation', 'for', 'effective', 'models', 'describing', 'the', 'lowtemperature', 'properties', 'of', 'this', 'material', 'whose', 'true', 'ground', 'state', 'remains', 'controversial']]
|
[-0.1110637439120757, 0.14698342371396536, -0.018834828096441925, 0.04763651873034082, 0.031236516150008692, -0.10430630235687682, 0.13938728562176325, 0.3877143689578301, -0.25848189704549057, -0.2776552988412349, -0.0005061962108715976, -0.3462955962082273, -0.10939000505022704, 0.12030970309278928, 0.056377542743728935, -0.029973105521333452, 0.032725883111063586, 0.010123945753041066, -0.102295703836104, -0.21189785954959103, 0.28824639813239245, 0.06807084940995226, 0.2910948266618346, 0.07763089004989812, 0.010951453568046226, -0.04149203471300241, 0.11230900637977022, 0.009979632781132272, -0.12373464329353547, 0.13369271447820785, 0.22740570157055978, -0.010012349937307208, 0.1969866065725096, -0.46481150948491534, -0.17574094208570099, 0.005229902577488438, 0.09320266288460086, 0.15738952728784888, -0.06624897421570494, -0.26795755215479355, 0.05154788302514996, -0.13881826623784085, -0.15706088378976443, -0.11266222798179737, 0.0137723431652902, 0.008933654929693913, -0.23451557885671623, 0.05077351623775413, 0.04411333697651954, 0.0800831044982356, -0.1669568680643447, -0.1902383446730183, -0.13974680900328645, 0.09651507394584385, 0.04082760545792744, 0.05275212049539397, 0.1604564287797793, -0.09059121724444834, -0.05479466177670187, 0.42979362610433447, -0.03888295265649887, -0.13305712737507602, 0.2057522008722452, -0.17725715061502628, -0.1256205918849446, 0.13860824983444456, 0.07802773729965434, 0.1268379061865026, -0.1242557444223693, 0.0868910043534063, -0.020261918996019583, 0.17960154439154538, 0.010598761338961163, 0.0717153680915209, 0.23315391228289195, 0.1729878376483133, 0.04131110663476743, 0.11158701117513517, -0.11855362351297548, -0.0956086051282718, -0.21894556739318527, -0.20896718001581335, -0.20831661157089432, 0.03077748876837033, -0.047536969644026705, -0.22448198441416026, 0.3931841743313462, 0.11973256013405166, 0.1538790288810177, -0.11298696664345793, 0.20139117955573296, 0.07721257999900875, 0.05796086993068457, 0.026850732263349192, 0.2642528485604807, 0.15384817709411053, 0.0736944090440183, -0.292889495360616, 0.11856692912988365, 0.036686397390440106]
|
1,803.04593
|
How Smart Are `Water Smart Landscapes'?
|
Understanding the effectiveness of alternative approaches to water
conservation is crucially important for ensuring the security and reliability
of water services for urban residents. We analyze data from one of the
longest-running "cash for grass" policies - the Southern Nevada Water
Authority's Water Smart Landscapes program, where homeowners are paid to
replace grass with xeric landscaping. We use a twelve year long panel dataset
of monthly water consumption records for 300,000 households in Las Vegas,
Nevada. Utilizing a panel difference-in-differences approach, we estimate the
average water savings per square meter of turf removed. We find that
participation in this program reduced the average treated household's
consumption by 18 percent. We find no evidence that water savings degrade as
the landscape ages, or that water savings per unit area are influenced by the
value of the rebate. Depending on the assumed time horizon of benefits from
turf removal, we find that the WSL program cost the water authority about $1.62
per thousand gallons of water saved, which compares favorably to alternative
means of water conservation or supply augmentation.
|
econ.EM
|
understanding the effectiveness of alternative approaches to water conservation is crucially important for ensuring the security and reliability of water services for urban residents we analyze data from one of the longestrunning cash for grass policies the southern nevada water authoritys water smart landscapes program where homeowners are paid to replace grass with xeric landscaping we use a twelve year long panel dataset of monthly water consumption records for 300000 households in las vegas nevada utilizing a panel differenceindifferences approach we estimate the average water savings per square meter of turf removed we find that participation in this program reduced the average treated households consumption by 18 percent we find no evidence that water savings degrade as the landscape ages or that water savings per unit area are influenced by the value of the rebate depending on the assumed time horizon of benefits from turf removal we find that the wsl program cost the water authority about 162 per thousand gallons of water saved which compares favorably to alternative means of water conservation or supply augmentation
|
[['understanding', 'the', 'effectiveness', 'of', 'alternative', 'approaches', 'to', 'water', 'conservation', 'is', 'crucially', 'important', 'for', 'ensuring', 'the', 'security', 'and', 'reliability', 'of', 'water', 'services', 'for', 'urban', 'residents', 'we', 'analyze', 'data', 'from', 'one', 'of', 'the', 'longestrunning', 'cash', 'for', 'grass', 'policies', 'the', 'southern', 'nevada', 'water', 'authoritys', 'water', 'smart', 'landscapes', 'program', 'where', 'homeowners', 'are', 'paid', 'to', 'replace', 'grass', 'with', 'xeric', 'landscaping', 'we', 'use', 'a', 'twelve', 'year', 'long', 'panel', 'dataset', 'of', 'monthly', 'water', 'consumption', 'records', 'for', '300000', 'households', 'in', 'las', 'vegas', 'nevada', 'utilizing', 'a', 'panel', 'differenceindifferences', 'approach', 'we', 'estimate', 'the', 'average', 'water', 'savings', 'per', 'square', 'meter', 'of', 'turf', 'removed', 'we', 'find', 'that', 'participation', 'in', 'this', 'program', 'reduced', 'the', 'average', 'treated', 'households', 'consumption', 'by', '18', 'percent', 'we', 'find', 'no', 'evidence', 'that', 'water', 'savings', 'degrade', 'as', 'the', 'landscape', 'ages', 'or', 'that', 'water', 'savings', 'per', 'unit', 'area', 'are', 'influenced', 'by', 'the', 'value', 'of', 'the', 'rebate', 'depending', 'on', 'the', 'assumed', 'time', 'horizon', 'of', 'benefits', 'from', 'turf', 'removal', 'we', 'find', 'that', 'the', 'wsl', 'program', 'cost', 'the', 'water', 'authority', 'about', '162', 'per', 'thousand', 'gallons', 'of', 'water', 'saved', 'which', 'compares', 'favorably', 'to', 'alternative', 'means', 'of', 'water', 'conservation', 'or', 'supply', 'augmentation']]
|
[-0.08894261045748737, 0.04395302548742286, -0.02228815650337258, 0.09436746377192823, -0.0398779702747519, -0.10956211158491928, 0.1357111212711824, 0.3493045398901249, -0.21156705201913914, -0.3959699175052944, 0.15853244118558393, -0.3530873855998761, -0.07224471248511022, 0.18653101448756482, -0.121095396891429, 0.0034968487686884387, 0.08569287427235395, -0.023093222439738697, 0.010568374455786022, -0.3189804616716059, 0.19361592863549895, 0.1263311569720785, 0.30726916893203365, 0.07808670250233263, 0.1437254684874199, -0.011676686704854599, -0.058608287677768316, -0.0038945692927234046, -0.12025835555620176, 0.12876762270568817, 0.2880285800957849, 0.16033881432048966, 0.33497270204169655, -0.4654217381565564, -0.17898497052876086, 0.10096064018588727, 0.06246477805998647, 0.03842065320818567, -0.01534071487666311, -0.21802207790368675, 0.015531553629914234, -0.24445314982226227, -0.1312217316697298, 0.004507213708511072, -0.004598494530816017, 0.0592289080598874, -0.21119089845311026, 0.08685089905756986, -0.06709912010393608, 0.12701227062317574, -0.08726336408791871, -0.19622183398172344, -0.11009001010900428, 0.1750947379978138, 0.052799992551010144, -0.021090947265533365, 0.21587901994660924, -0.11771030618070528, -0.059913107177949156, 0.383559395419969, -0.08762348419986665, -0.13623083878212192, 0.13297358877426976, -0.09578087351528457, -0.1303317976590974, 0.1860479853402331, 0.2134708092633592, 0.04506024602672149, -0.17794174131477017, -0.04053827699564194, -0.05603447292888558, 0.22666968903290216, 0.12914170653976756, -0.01684462320495761, 0.19507652679030066, 0.21819886024077906, 0.14014421861308315, 0.1208198172693949, -0.1262686606054997, -0.11098629627885276, -0.21779515175817898, -0.17928496906105643, -0.13998244835288617, 0.03299367290536134, -0.0731148025235556, -0.09153337487730133, 0.35486707524878197, 0.16158546390675607, 0.06643659992868765, 0.09924677434048199, 0.2939500626090957, 0.025754536260534935, 0.10469991605869032, 0.12624268266024474, 0.17566876223674793, -0.05646858698067566, 0.18470386632225722, -0.20422374059435452, 0.1115310828578819, 0.006036049398679243]
|
1,803.04594
|
Realizing spin-dependent gauge field with biaxial metamaterials
|
Artificial magnetic field in electromagnetism is becoming an emerging way as
a robust control of light based on its geometric and topological nature. Other
than demonstrating topological photonics properties in the diffractive regime
using photonic crystals or arrays of waveguides, it will be of great interest
if similar manipulations can be done simply in the long wavelength limit, in
which only a few optical parameters can be used to describe the system, making
the future optical component design much easier. Here, by designing and
fabricating a metamaterial with split dispersion surface, we provide a
straight-forward experimental realization of spin-dependent gauge field in the
real space using a biaxial material. A "magnetic force bending" for light of
desired pseudospins is visualized experimentally by such a gauge field as a
manifestation of optical spin Hall effect. Such a demonstration is potentially
useful to develop pseudospin optics, topological components and spin-enabled
transformation optical devices.
|
physics.optics physics.app-ph
|
artificial magnetic field in electromagnetism is becoming an emerging way as a robust control of light based on its geometric and topological nature other than demonstrating topological photonics properties in the diffractive regime using photonic crystals or arrays of waveguides it will be of great interest if similar manipulations can be done simply in the long wavelength limit in which only a few optical parameters can be used to describe the system making the future optical component design much easier here by designing and fabricating a metamaterial with split dispersion surface we provide a straightforward experimental realization of spindependent gauge field in the real space using a biaxial material a magnetic force bending for light of desired pseudospins is visualized experimentally by such a gauge field as a manifestation of optical spin hall effect such a demonstration is potentially useful to develop pseudospin optics topological components and spinenabled transformation optical devices
|
[['artificial', 'magnetic', 'field', 'in', 'electromagnetism', 'is', 'becoming', 'an', 'emerging', 'way', 'as', 'a', 'robust', 'control', 'of', 'light', 'based', 'on', 'its', 'geometric', 'and', 'topological', 'nature', 'other', 'than', 'demonstrating', 'topological', 'photonics', 'properties', 'in', 'the', 'diffractive', 'regime', 'using', 'photonic', 'crystals', 'or', 'arrays', 'of', 'waveguides', 'it', 'will', 'be', 'of', 'great', 'interest', 'if', 'similar', 'manipulations', 'can', 'be', 'done', 'simply', 'in', 'the', 'long', 'wavelength', 'limit', 'in', 'which', 'only', 'a', 'few', 'optical', 'parameters', 'can', 'be', 'used', 'to', 'describe', 'the', 'system', 'making', 'the', 'future', 'optical', 'component', 'design', 'much', 'easier', 'here', 'by', 'designing', 'and', 'fabricating', 'a', 'metamaterial', 'with', 'split', 'dispersion', 'surface', 'we', 'provide', 'a', 'straightforward', 'experimental', 'realization', 'of', 'spindependent', 'gauge', 'field', 'in', 'the', 'real', 'space', 'using', 'a', 'biaxial', 'material', 'a', 'magnetic', 'force', 'bending', 'for', 'light', 'of', 'desired', 'pseudospins', 'is', 'visualized', 'experimentally', 'by', 'such', 'a', 'gauge', 'field', 'as', 'a', 'manifestation', 'of', 'optical', 'spin', 'hall', 'effect', 'such', 'a', 'demonstration', 'is', 'potentially', 'useful', 'to', 'develop', 'pseudospin', 'optics', 'topological', 'components', 'and', 'spinenabled', 'transformation', 'optical', 'devices']]
|
[-0.16312914149525265, 0.1892572795499776, -0.1015938293437163, 0.013129633251422395, -0.13636312877138457, -0.1773851527273655, 0.0034316696785390375, 0.44941412076974907, -0.27405798868586617, -0.30366162682573, 0.08562405408980946, -0.21224854363438983, -0.2017528716971477, 0.2783663579557712, -0.019170129379878442, 0.07222669915373747, -0.01904270688071847, -0.05174762046876519, -0.031169589199125766, -0.17431776854209602, 0.23570027640361027, 0.009215420875698328, 0.3018479297542945, 0.04607232411624864, 0.0825411300950994, 0.05376244573650183, 0.06879592914289484, 0.044573092181041524, -0.0577758182521211, 0.11821655216316382, 0.2579100129318734, -0.02222379353828728, 0.2246572489105165, -0.45651452040920654, -0.24665563269363094, 0.06736056390839318, 0.15493322745353605, 0.16560237674275413, -0.100179992938259, -0.3096585703237603, 0.02104882664474038, -0.13820068039620917, -0.16392893369610342, -0.12405220514784257, 0.009707694369523475, -0.02255613873208252, -0.21936636877711863, -0.01815706436126978, 0.009775454016635194, 0.0957355177627566, -0.026561009488553586, -0.05764740742975846, -0.03715475219922761, 0.05743651282352706, -0.025438212264173976, 0.05004042103731384, 0.1754408990809073, -0.15515055309825887, -0.13798291773535312, 0.4370634234448274, -0.04328991338969596, -0.1889986275602132, 0.13919050866737961, -0.11800932657051211, -0.04524774766216676, 0.10737544629722834, 0.17464639741927385, 0.08656288518570364, -0.1323965989239514, 0.036822661178885024, -0.004059570614869396, 0.19007452034934735, 0.030757689190407594, 0.1438887692677478, 0.3158423967349033, 0.22460459109395742, 0.055021077445271654, 0.14873561501929847, -0.07997563680478682, 0.007356328169504801, -0.2685140108441313, -0.201784849918137, -0.22757170310088745, 0.0932683680811897, -0.06985066415092055, -0.16421144005532065, 0.39838349759268266, 0.1537781501437227, 0.1556738908092181, -0.06426973620352025, 0.31691694280132654, 0.11216782527199635, 0.11919582802802324, -0.00824079044473668, 0.30595661583667, 0.17321126979154844, 0.10575101226257781, -0.18905487385888894, 0.009930682327443112, -0.005500186846281091]
|
1,803.04595
|
A higher-order tangent map and a conjecture on the higher Nash blowup of
curves
|
We introduce a higher-order version of the tangent map of a morphism and find
a matrix representation. We then apply this matrix to solve a conjecture by T.
Yasuda regarding the semigroup of the higher Nash blowup of formal curves. We
first show that the conjecture is true for toric curves. We conclude by
exhibiting a family of non-monomial curves where the conjecture fails.
|
math.AG
|
we introduce a higherorder version of the tangent map of a morphism and find a matrix representation we then apply this matrix to solve a conjecture by t yasuda regarding the semigroup of the higher nash blowup of formal curves we first show that the conjecture is true for toric curves we conclude by exhibiting a family of nonmonomial curves where the conjecture fails
|
[['we', 'introduce', 'a', 'higherorder', 'version', 'of', 'the', 'tangent', 'map', 'of', 'a', 'morphism', 'and', 'find', 'a', 'matrix', 'representation', 'we', 'then', 'apply', 'this', 'matrix', 'to', 'solve', 'a', 'conjecture', 'by', 't', 'yasuda', 'regarding', 'the', 'semigroup', 'of', 'the', 'higher', 'nash', 'blowup', 'of', 'formal', 'curves', 'we', 'first', 'show', 'that', 'the', 'conjecture', 'is', 'true', 'for', 'toric', 'curves', 'we', 'conclude', 'by', 'exhibiting', 'a', 'family', 'of', 'nonmonomial', 'curves', 'where', 'the', 'conjecture', 'fails']]
|
[-0.14844358141999692, 0.015272300639480818, -0.15595343735185452, 0.10622209037683206, -0.07252004753536312, -0.15300773051421857, 0.0496858574624639, 0.3060653906723019, -0.322280575055629, -0.1919083136090194, 0.08840442437212914, -0.24576277117375867, -0.2182085865351837, 0.1728067166841356, -0.14221905409067404, 0.011215516533411574, 0.05605184441083111, 0.019363087048986927, -0.1268083066715917, -0.2926440412666125, 0.426015236065723, -0.04904588873614557, 0.21360269899014384, 0.08373233482416254, 0.13782157177047338, 0.013663906218425836, -0.0011514784710016102, -0.0015412617503898218, -0.1670847649990037, 0.14133834237145493, 0.24155563715612516, 0.16268626172677614, 0.2323002089106012, -0.35655796216451563, -0.1713137901497248, 0.18982021902047563, 0.09012096843798645, 0.110237976663484, -0.029773174828733318, -0.20813956949859858, 0.15329857056349283, -0.1572488915262511, -0.20990708819954307, -0.10106358142365934, 0.030938917363528162, 0.008038416621275246, -0.2617650818283437, 0.020587610619259067, 0.14198031173145864, 0.10714447396458127, -0.04685172077734023, -0.03585238190862583, -0.030789070720857126, 0.022097858098277356, -0.016831486358569236, 0.03719377573725069, 0.015058632539876271, -0.10489425676860265, -0.12992618220596341, 0.3711082397667269, -0.11709965221962193, -0.1645878192211967, 0.06919929039577255, -0.14994393882807344, -0.17027672309995978, 0.10571423346118536, 0.09175855337525718, 0.1745230149517738, -0.04621961488010129, 0.13617491205422994, -0.14398643882304896, 0.11005941836629063, 0.07748812611862377, -0.079794766199484, 0.1391072970800451, 0.07502948827459477, 0.09538514209270943, 0.18406986250738555, -0.026597790529194754, -0.0467201020946959, -0.33604123050463386, -0.22576615060097538, -0.12399017959614866, 0.1389262104203226, -0.10058041063507517, -0.15953992461436428, 0.4031510449713096, 0.10479083206155337, 0.23424487808370031, 0.17518382967682555, 0.20316735398955643, 0.11334689255454578, -0.019198998535102874, 0.09684276977350237, 0.16095219843191444, 0.18582864441123093, 0.01488382727256976, -0.17211519424745347, 0.026181383294897387, 0.19351881805050652]
|
1,803.04596
|
Automatic Detection of Online Jihadist Hate Speech
|
We have developed a system that automatically detects online jihadist hate
speech with over 80% accuracy, by using techniques from Natural Language
Processing and Machine Learning. The system is trained on a corpus of 45,000
subversive Twitter messages collected from October 2014 to December 2016. We
present a qualitative and quantitative analysis of the jihadist rhetoric in the
corpus, examine the network of Twitter users, outline the technical procedure
used to train the system, and discuss examples of use.
|
cs.CL cs.AI cs.CR
|
we have developed a system that automatically detects online jihadist hate speech with over 80 accuracy by using techniques from natural language processing and machine learning the system is trained on a corpus of 45000 subversive twitter messages collected from october 2014 to december 2016 we present a qualitative and quantitative analysis of the jihadist rhetoric in the corpus examine the network of twitter users outline the technical procedure used to train the system and discuss examples of use
|
[['we', 'have', 'developed', 'a', 'system', 'that', 'automatically', 'detects', 'online', 'jihadist', 'hate', 'speech', 'with', 'over', '80', 'accuracy', 'by', 'using', 'techniques', 'from', 'natural', 'language', 'processing', 'and', 'machine', 'learning', 'the', 'system', 'is', 'trained', 'on', 'a', 'corpus', 'of', '45000', 'subversive', 'twitter', 'messages', 'collected', 'from', 'october', '2014', 'to', 'december', '2016', 'we', 'present', 'a', 'qualitative', 'and', 'quantitative', 'analysis', 'of', 'the', 'jihadist', 'rhetoric', 'in', 'the', 'corpus', 'examine', 'the', 'network', 'of', 'twitter', 'users', 'outline', 'the', 'technical', 'procedure', 'used', 'to', 'train', 'the', 'system', 'and', 'discuss', 'examples', 'of', 'use']]
|
[-0.05433616374449974, -0.031009740051027242, -0.10224780723355807, 0.0784059237377331, -0.13598702067823767, -0.13643976440955582, 0.09149004225981991, 0.40189306292828025, -0.20241714945038805, -0.3908822253178624, 0.0974240591250626, -0.3670858378800285, -0.19053541122355147, 0.23381038276212557, -0.13678737825339105, 0.051259139540617345, 0.17311509038237008, 0.0865209489704001, -0.0018789110820159897, -0.332264666288317, 0.2939576150897842, 0.04157830183333778, 0.3369407748997018, 0.01146421975202181, 0.14818375371396542, -0.010372649179771543, -0.08466501152989539, -0.07378301332408393, -0.08182878373540385, 0.15709428543636164, 0.3415145225454025, 0.27468532560296455, 0.3290682431104799, -0.3862511088433615, -0.15111990030643277, 0.02191477874898678, 0.07565236154735064, 0.09546550858747697, -0.006101236976501713, -0.4227831686979958, 0.07725339166687004, -0.2180574316676561, 0.02892051831299028, -0.10606902258398083, 0.010229330673184874, 0.0029365933838893066, -0.2160594975439735, 0.031235899225893347, 0.039451153468122925, 0.19233089694813765, 0.00600558633057328, -0.06399918064723009, 0.02267818368499639, 0.19594395118946958, 0.07710029064774417, 0.042504802932841826, 0.14801073895598, -0.10358284883709117, -0.16757345366497317, 0.34762963768723726, -0.08012946822995005, -0.07880937341939319, 0.20149626811458307, -0.012339116627495591, -0.15283501032110933, 0.08150049973908183, 0.3333923246759873, 0.05310908654196696, -0.2109494638786494, 0.00600385978022687, -0.06088397476531855, 0.2673541984411997, 0.09014690471450229, -0.07701527475464073, 0.15275624654612613, 0.23857711432743575, -0.04097776261593711, 0.15903614716855324, -0.12153690638226251, -0.0021452307580159856, -0.22514866385608912, -0.11311539856402518, -0.15289084284336535, -0.005277935126735889, -0.04768511978852678, -0.09215597680455388, 0.4257408020074491, 0.24002725112118892, 0.1495019936686164, 0.07480067211844317, 0.27882795971999697, -0.01730107083045817, 0.050243613497632275, 0.13215586136687885, 0.16945311459319592, 0.009419940245736922, 0.2631750773206087, -0.13468457565963413, 0.038210333905533536, 0.027482469372644827]
|
1,803.04597
|
A stability-reversibility map unifies elasticity, plasticity, yielding
and jamming in hard sphere glasses
|
Amorphous solids, such as glasses, have complex responses to deformations,
with significant consequences in material design and applications. In this
respect two intertwined aspects are important: stability and reversibility. It
is crucial to understand on the one hand how a glass may become unstable due to
increased plasticity under shear deformations; on the other hand, to what
extent the response is reversible, meaning how much a system is able to recover
the original configuration once the perturbation is released. Here we focus on
assemblies of hard spheres as the simplest model of amorphous solids such as
colloidal glasses and granular matter. We prepare glass states quenched from
equilibrium supercooled liquid states, which are obtained by using the swap
Monte Carlo algorithm and correspond to a wide range of structural relaxation
time scales. We exhaustively map out their stability and reversibility under
volume and shear strains, using extensive numerical simulations. The region on
the volume-shear strain phase diagram where the original glass state remains
solid is bounded by the shear-yielding and the shear-jamming lines which meet
at a yielding-jamming crossover point. This solid phase can be further divided
into two sub-phases: the stable glass phase where the system deforms purely
elastically and is totally reversible, and the marginal glass phase where it
experiences stochastic plastic deformations at mesoscopic scales and is
partially irreversible. The details of the stability-reversibility map depend
strongly on the quality of annealing of the glass. This study provides a
unified framework for understanding elasticity, plasticity, yielding and
jamming in amorphous solids.
|
cond-mat.soft cond-mat.dis-nn cond-mat.stat-mech
|
amorphous solids such as glasses have complex responses to deformations with significant consequences in material design and applications in this respect two intertwined aspects are important stability and reversibility it is crucial to understand on the one hand how a glass may become unstable due to increased plasticity under shear deformations on the other hand to what extent the response is reversible meaning how much a system is able to recover the original configuration once the perturbation is released here we focus on assemblies of hard spheres as the simplest model of amorphous solids such as colloidal glasses and granular matter we prepare glass states quenched from equilibrium supercooled liquid states which are obtained by using the swap monte carlo algorithm and correspond to a wide range of structural relaxation time scales we exhaustively map out their stability and reversibility under volume and shear strains using extensive numerical simulations the region on the volumeshear strain phase diagram where the original glass state remains solid is bounded by the shearyielding and the shearjamming lines which meet at a yieldingjamming crossover point this solid phase can be further divided into two subphases the stable glass phase where the system deforms purely elastically and is totally reversible and the marginal glass phase where it experiences stochastic plastic deformations at mesoscopic scales and is partially irreversible the details of the stabilityreversibility map depend strongly on the quality of annealing of the glass this study provides a unified framework for understanding elasticity plasticity yielding and jamming in amorphous solids
|
[['amorphous', 'solids', 'such', 'as', 'glasses', 'have', 'complex', 'responses', 'to', 'deformations', 'with', 'significant', 'consequences', 'in', 'material', 'design', 'and', 'applications', 'in', 'this', 'respect', 'two', 'intertwined', 'aspects', 'are', 'important', 'stability', 'and', 'reversibility', 'it', 'is', 'crucial', 'to', 'understand', 'on', 'the', 'one', 'hand', 'how', 'a', 'glass', 'may', 'become', 'unstable', 'due', 'to', 'increased', 'plasticity', 'under', 'shear', 'deformations', 'on', 'the', 'other', 'hand', 'to', 'what', 'extent', 'the', 'response', 'is', 'reversible', 'meaning', 'how', 'much', 'a', 'system', 'is', 'able', 'to', 'recover', 'the', 'original', 'configuration', 'once', 'the', 'perturbation', 'is', 'released', 'here', 'we', 'focus', 'on', 'assemblies', 'of', 'hard', 'spheres', 'as', 'the', 'simplest', 'model', 'of', 'amorphous', 'solids', 'such', 'as', 'colloidal', 'glasses', 'and', 'granular', 'matter', 'we', 'prepare', 'glass', 'states', 'quenched', 'from', 'equilibrium', 'supercooled', 'liquid', 'states', 'which', 'are', 'obtained', 'by', 'using', 'the', 'swap', 'monte', 'carlo', 'algorithm', 'and', 'correspond', 'to', 'a', 'wide', 'range', 'of', 'structural', 'relaxation', 'time', 'scales', 'we', 'exhaustively', 'map', 'out', 'their', 'stability', 'and', 'reversibility', 'under', 'volume', 'and', 'shear', 'strains', 'using', 'extensive', 'numerical', 'simulations', 'the', 'region', 'on', 'the', 'volumeshear', 'strain', 'phase', 'diagram', 'where', 'the', 'original', 'glass', 'state', 'remains', 'solid', 'is', 'bounded', 'by', 'the', 'shearyielding', 'and', 'the', 'shearjamming', 'lines', 'which', 'meet', 'at', 'a', 'yieldingjamming', 'crossover', 'point', 'this', 'solid', 'phase', 'can', 'be', 'further', 'divided', 'into', 'two', 'subphases', 'the', 'stable', 'glass', 'phase', 'where', 'the', 'system', 'deforms', 'purely', 'elastically', 'and', 'is', 'totally', 'reversible', 'and', 'the', 'marginal', 'glass', 'phase', 'where', 'it', 'experiences', 'stochastic', 'plastic', 'deformations', 'at', 'mesoscopic', 'scales', 'and', 'is', 'partially', 'irreversible', 'the', 'details', 'of', 'the', 'stabilityreversibility', 'map', 'depend', 'strongly', 'on', 'the', 'quality', 'of', 'annealing', 'of', 'the', 'glass', 'this', 'study', 'provides', 'a', 'unified', 'framework', 'for', 'understanding', 'elasticity', 'plasticity', 'yielding', 'and', 'jamming', 'in', 'amorphous', 'solids']]
|
[-0.07989236558787524, 0.22090313832834363, -0.12500046060234307, 0.017801770922262223, -0.018040327789261935, -0.13225441212835723, 0.030198378753848374, 0.3835664242003113, -0.28965000913850963, -0.23710590172861704, 0.14197425468964503, -0.27044277703948316, -0.18317658627498895, 0.12300041426997632, -0.024005186029826292, 0.05952513594459742, -0.0010223145852796733, -0.02200553795089945, -0.07364317132299766, -0.22441412266762928, 0.27640890289470554, 0.05214030602760613, 0.31356747134402396, 0.04994947634963319, 0.0941554620563984, 0.004132865804713219, 0.06739078409224748, 0.05245220066839829, -0.18367206701263786, 0.0398676996845752, 0.2569163796342909, 0.004835321772843599, 0.21174574614781885, -0.4773756803497672, -0.23313226655125618, 0.09571547137666493, 0.0855801985253347, 0.11244082363601773, -0.013510830192943104, -0.2439360991641879, 0.038578814210835845, -0.126220664344728, -0.09205867770686746, -0.12052493253629655, 0.015567740643396973, 0.014664420498284016, -0.19177483300701714, 0.08703258229419589, 0.08212255375366657, 0.061485756997484715, -0.09183604899235069, -0.07526634409930558, -0.04588236116804183, 0.09450289446534589, 0.029596424035262317, 0.026570005052257328, 0.23479492755420506, -0.13501537177618592, -0.0506822280632332, 0.4301514006499201, 0.01272557545080781, -0.17127898794412613, 0.2509841726338491, -0.120086644211784, -0.11007212613150477, 0.19206014066934585, 0.15672995782271026, 0.0900527268499136, -0.13209138502553106, 0.029717273580143228, 0.020827005533501506, 0.2030744413851062, 0.03708974705683067, 0.002561810678802431, 0.24717445000074803, 0.2424412182015367, 0.04502039478160441, 0.20815983271668664, -0.05815265524480492, -0.16114668162167073, -0.2609077442996204, -0.16286283860914408, -0.19484266963601113, 0.04751805578265339, -0.08782959362427936, -0.17492434821859934, 0.36460279692709446, 0.12889672417985276, 0.1793931563394144, 0.023022142096655443, 0.24581814860226586, 0.03597251671226695, 0.04049927123356611, 0.014570066224783658, 0.26190607169643043, 0.13491398238297553, 0.11202760224835948, -0.2201381744639948, 0.09955351908132434, 0.04359858012123732]
|
1,803.04598
|
A complementary proof of Baker's theorem of completely invariant
components for transcendental entire functions
|
Baker proved that for transcendental entire functions there is at most one
completely invariant component of the Fatou set. It was observed by Julien
Duval that there is a missing case in Baker's proof. In this article we follow
Baker's ideas and give some alternative arguments to establish the result.
|
math.DS
|
baker proved that for transcendental entire functions there is at most one completely invariant component of the fatou set it was observed by julien duval that there is a missing case in bakers proof in this article we follow bakers ideas and give some alternative arguments to establish the result
|
[['baker', 'proved', 'that', 'for', 'transcendental', 'entire', 'functions', 'there', 'is', 'at', 'most', 'one', 'completely', 'invariant', 'component', 'of', 'the', 'fatou', 'set', 'it', 'was', 'observed', 'by', 'julien', 'duval', 'that', 'there', 'is', 'a', 'missing', 'case', 'in', 'bakers', 'proof', 'in', 'this', 'article', 'we', 'follow', 'bakers', 'ideas', 'and', 'give', 'some', 'alternative', 'arguments', 'to', 'establish', 'the', 'result']]
|
[-0.134069406343624, 0.05373563210945576, -0.16501996585167944, 0.14478640423389152, -0.07046108927577734, -0.1487514898646623, 0.02027954185381532, 0.2979926011711359, -0.2613128327880986, -0.2078140839189291, 0.0843181778350845, -0.26328450240194795, -0.20295672599226236, 0.2442428463883698, -0.10932127209380268, 0.011821053933817893, 0.06135531394742429, -0.02144127305597067, 0.03389241294004023, -0.30958401832729576, 0.35477978142444044, -0.06604936614632606, 0.18474023414775728, 0.0980912494752556, 0.0945627131126821, 0.021227111453190447, -0.08531655910424889, -0.05299355199560523, -0.19179108563024783, 0.09092401538044215, 0.3245628083171323, 0.1732125372812152, 0.2680284382216632, -0.33369463942945005, -0.17206143769435583, 0.16536017120815813, 0.11573031106963753, 0.06667769790627062, -0.07125390829518437, -0.21045777083840222, 0.1133879526797682, -0.1354087607190013, -0.22159935259260238, -0.08870744049549102, 0.10713262462057173, -0.004655283454339952, -0.22759106736630202, 0.043916432466357944, 0.20519391350448132, 0.11356717597693206, -0.018110105701489375, -0.11006587243056856, 0.0056791487755253915, 0.05094455424696207, 0.0778382261749357, 0.13083762569352986, 0.04373342796228826, -0.016467510345391928, -0.11140484511852264, 0.27708310244604945, -0.03147775816731155, -0.21730288974940776, 0.20614167042076587, -0.13986614939756692, -0.23059569709002972, 0.11006969611393287, 0.0034647803008556366, 0.08354055758565665, -0.15713171707466245, 0.1056714735913556, -0.18502449264749884, 0.11679715715348721, 0.15054454550147056, -0.07750080712139606, 0.0920520942285657, 0.05808437305502594, 0.11102024711668491, 0.1709346098266542, 0.059878018889576196, -0.07817146643996238, -0.3079152975603938, -0.14064737632870675, -0.21157108749262987, 0.11586572269443422, 0.0038666193376411685, -0.171760424785316, 0.41682478830218317, 0.12599942907691003, 0.17209299303591252, 0.1075577782606706, 0.21950688891112805, 0.09358994340320351, 0.035963044269010425, 0.10013960108160973, 0.20330147217784542, 0.1717840597452596, 0.09362854236736894, -0.05858033623080701, 0.07582170738838613, 0.18902946318499744]
|
1,803.04599
|
Neutrino masses in the minimal gauged $(B-L)$ supersymmetry
|
We present the radiative corrections to neutrino masses in a minimal
supersymmetric extension of the standard model with local $U(1)_{B-L}$
symmetry. At tree level, three tiny active neutrinos and two nearly massless
sterile neutrinos can be obtained through the seesaw mechanism. Considering the
one-loop corrections to the neutrino masses, the numerical results indicate
that two sterile neutrinos obtain ${\rm KeV}$ masses and the small
active-sterile neutrino mixing angles. The lighter sterile neutrino is a very
interesting dark matter candidate in cosmology. Meanwhile the active neutrinos
mixing angles and mass squared differences agree with present experimental
data.
|
hep-ph
|
we present the radiative corrections to neutrino masses in a minimal supersymmetric extension of the standard model with local u1_bl symmetry at tree level three tiny active neutrinos and two nearly massless sterile neutrinos can be obtained through the seesaw mechanism considering the oneloop corrections to the neutrino masses the numerical results indicate that two sterile neutrinos obtain rm kev masses and the small activesterile neutrino mixing angles the lighter sterile neutrino is a very interesting dark matter candidate in cosmology meanwhile the active neutrinos mixing angles and mass squared differences agree with present experimental data
|
[['we', 'present', 'the', 'radiative', 'corrections', 'to', 'neutrino', 'masses', 'in', 'a', 'minimal', 'supersymmetric', 'extension', 'of', 'the', 'standard', 'model', 'with', 'local', 'u1_bl', 'symmetry', 'at', 'tree', 'level', 'three', 'tiny', 'active', 'neutrinos', 'and', 'two', 'nearly', 'massless', 'sterile', 'neutrinos', 'can', 'be', 'obtained', 'through', 'the', 'seesaw', 'mechanism', 'considering', 'the', 'oneloop', 'corrections', 'to', 'the', 'neutrino', 'masses', 'the', 'numerical', 'results', 'indicate', 'that', 'two', 'sterile', 'neutrinos', 'obtain', 'rm', 'kev', 'masses', 'and', 'the', 'small', 'activesterile', 'neutrino', 'mixing', 'angles', 'the', 'lighter', 'sterile', 'neutrino', 'is', 'a', 'very', 'interesting', 'dark', 'matter', 'candidate', 'in', 'cosmology', 'meanwhile', 'the', 'active', 'neutrinos', 'mixing', 'angles', 'and', 'mass', 'squared', 'differences', 'agree', 'with', 'present', 'experimental', 'data']]
|
[-0.10155455430382669, 0.3717976611951599, 0.027298730157781392, 0.29542303493387106, -0.06638458212061475, -0.1860120494287306, 0.05431475775549188, 0.328168844479175, -0.170256920857355, -0.36622131840946776, 0.0005200102993209536, -0.3213691954151727, 0.025454221293330193, 0.1461666315808543, 0.08794938832337114, 0.004611245240084827, 0.0693797239655396, -0.04615999342058785, -0.11408438090923785, -0.23006899194054617, 0.28026851478110376, 0.10057645200868137, 0.15641055421050018, 0.05368055991615014, 0.10983370679120223, -0.13811126033154628, -0.05573964098099774, -0.1564889188739471, -0.07517373255579211, 0.0010121337448557217, 0.1502305898902705, 0.06645543537342746, 0.047622055346437264, -0.3743589564401191, -0.18984009737566035, 0.2130820332095027, 0.17435418446499776, 0.09013961900685293, -0.1515098670424777, -0.3226469345778848, 0.02925873427496602, -0.23704215458443892, -0.1481719544317457, -0.011711873880509907, -0.12775245164812077, -0.16481455074002346, -0.3365905226867956, 0.11612533182293798, -0.12936694803647697, -0.07813532635918818, -0.015760020488717903, -0.22763262596708955, -0.043125362120918, 0.023382562086529408, 0.24431569430574504, -0.11019609497786102, 0.14571122521617022, -0.14151587351322328, -0.10259266269470875, 0.48318678932264447, -0.12461421461193822, -0.13378929977382845, 0.09971937957743648, -0.17420320044523882, -0.1309462326753419, 0.16153552394583434, 0.15527102140670954, 0.046563913419959135, -0.18258139187431274, 0.13584340625493496, -0.1590718136455204, 0.17923492663006377, 0.036889122100546956, 0.005792875250335783, 0.3520587158369987, 0.23253086688540256, 0.08697690592574266, -0.10518239937058145, -0.1305655720013116, -0.032739775497854375, -0.41956512393274653, -0.07485440825500216, -0.0484717115565824, 0.05900326247077222, -0.14706373399000464, -0.09116933013137896, 0.4184130542174292, 0.1335181892500259, 0.1867560049383125, 0.07067605777895854, 0.32701131377446774, 0.01515153853688389, 0.06680950186273549, 0.040207548566589445, 0.3938445736324259, 0.17380443075671792, 0.09718521663065378, -0.3027272801021657, -0.09007021424379975, 0.1071599679805028]
|
1,803.046
|
LAB4D: A Low Power, Multi-GSa/s, Transient Digitizer with Sampling
Timebase Trimming Capabilities
|
The LAB4D is a new application-specific integrated circuit (ASIC) of the
Large Analog Bandwidth Recorder and Digitizer with Ordered Readout (LABRADOR)
family, for use in direct wideband radio frequency digitization such as is used
in ultrahigh energy neutrino and cosmic ray astrophysics. The LAB4D is a single
channel switched-capacitor array (SCA) 12-bit sampler with integrated
analog-to-digital converters (ADC), developed in the TSMC 0.25um process. The
LAB4D, operating at 3.2GSa/s, contains 4096 total samples arranged in 32
windows, for a total record length of 1280ns. The 3dB bandwidth is
approximately 1.3GHz, with a directly-coupled 50ohm input. This represents a
factor of 16 increase in the sample depth and an increase in analog bandwidth
and sampling depth in comparison to the previous generation LAB3 digitizer.
Individually addressable windows allow for sampling and digitization to occur
simultaneously, leading to nearly deadtime-free readout for kHz readout rates.
All biases and current references are generated via internal digital-to-analog
converters (DACs), resulting in a stand-alone digitizer with no additional
support circuitry. In addition, the LAB4D contains sample cell timebase
trimming capabilities, reducing the intrinsic sample-to-sample time variance to
less than 5ps; an improvement of about 80%. This allows the LAB4D to be used in
precision timing applications with minimal post-hoc calibration.
|
physics.ins-det astro-ph.IM
|
the lab4d is a new applicationspecific integrated circuit asic of the large analog bandwidth recorder and digitizer with ordered readout labrador family for use in direct wideband radio frequency digitization such as is used in ultrahigh energy neutrino and cosmic ray astrophysics the lab4d is a single channel switchedcapacitor array sca 12bit sampler with integrated analogtodigital converters adc developed in the tsmc 025um process the lab4d operating at 32gsas contains 4096 total samples arranged in 32 windows for a total record length of 1280ns the 3db bandwidth is approximately 13ghz with a directlycoupled 50ohm input this represents a factor of 16 increase in the sample depth and an increase in analog bandwidth and sampling depth in comparison to the previous generation lab3 digitizer individually addressable windows allow for sampling and digitization to occur simultaneously leading to nearly deadtimefree readout for khz readout rates all biases and current references are generated via internal digitaltoanalog converters dacs resulting in a standalone digitizer with no additional support circuitry in addition the lab4d contains sample cell timebase trimming capabilities reducing the intrinsic sampletosample time variance to less than 5ps an improvement of about 80 this allows the lab4d to be used in precision timing applications with minimal posthoc calibration
|
[['the', 'lab4d', 'is', 'a', 'new', 'applicationspecific', 'integrated', 'circuit', 'asic', 'of', 'the', 'large', 'analog', 'bandwidth', 'recorder', 'and', 'digitizer', 'with', 'ordered', 'readout', 'labrador', 'family', 'for', 'use', 'in', 'direct', 'wideband', 'radio', 'frequency', 'digitization', 'such', 'as', 'is', 'used', 'in', 'ultrahigh', 'energy', 'neutrino', 'and', 'cosmic', 'ray', 'astrophysics', 'the', 'lab4d', 'is', 'a', 'single', 'channel', 'switchedcapacitor', 'array', 'sca', '12bit', 'sampler', 'with', 'integrated', 'analogtodigital', 'converters', 'adc', 'developed', 'in', 'the', 'tsmc', '025um', 'process', 'the', 'lab4d', 'operating', 'at', '32gsas', 'contains', '4096', 'total', 'samples', 'arranged', 'in', '32', 'windows', 'for', 'a', 'total', 'record', 'length', 'of', '1280ns', 'the', '3db', 'bandwidth', 'is', 'approximately', '13ghz', 'with', 'a', 'directlycoupled', '50ohm', 'input', 'this', 'represents', 'a', 'factor', 'of', '16', 'increase', 'in', 'the', 'sample', 'depth', 'and', 'an', 'increase', 'in', 'analog', 'bandwidth', 'and', 'sampling', 'depth', 'in', 'comparison', 'to', 'the', 'previous', 'generation', 'lab3', 'digitizer', 'individually', 'addressable', 'windows', 'allow', 'for', 'sampling', 'and', 'digitization', 'to', 'occur', 'simultaneously', 'leading', 'to', 'nearly', 'deadtimefree', 'readout', 'for', 'khz', 'readout', 'rates', 'all', 'biases', 'and', 'current', 'references', 'are', 'generated', 'via', 'internal', 'digitaltoanalog', 'converters', 'dacs', 'resulting', 'in', 'a', 'standalone', 'digitizer', 'with', 'no', 'additional', 'support', 'circuitry', 'in', 'addition', 'the', 'lab4d', 'contains', 'sample', 'cell', 'timebase', 'trimming', 'capabilities', 'reducing', 'the', 'intrinsic', 'sampletosample', 'time', 'variance', 'to', 'less', 'than', '5ps', 'an', 'improvement', 'of', 'about', '80', 'this', 'allows', 'the', 'lab4d', 'to', 'be', 'used', 'in', 'precision', 'timing', 'applications', 'with', 'minimal', 'posthoc', 'calibration']]
|
[-0.11790424034843454, 0.12407084129590658, 0.03981787053053267, -0.009280366735429197, -0.05079494550824165, -0.16018123138463125, 0.06241050830285531, 0.4255833004415035, -0.21697457051835956, -0.3731434404058382, 0.12820342278457247, -0.27783929016099135, -0.01042699240380898, 0.2577857352793217, -0.09321473429678008, 0.08112513724016025, 0.06844714642735199, -0.03135883272916544, -0.02803767144912854, -0.20086209860630333, 0.10976249934406951, 0.1678073198895436, 0.32967064796946943, -0.055425498187541965, 0.17220117603908874, 0.0030291230880538935, -0.0584710527502466, -0.08788515666034073, -0.05973054348491132, 0.07513747785822489, 0.3080096112238243, 0.10199520998634398, 0.21640915767289698, -0.4051387945704482, -0.16123132004402577, 0.09224751050234772, 0.11960210026591085, 0.050636135889217254, -0.04828126213280484, -0.21238499309518374, 0.1325764183391584, -0.21612497254740448, -0.05940367383416742, 0.014761266103014349, -0.030832124426960945, 0.03586798568023369, -0.2843660021573305, 0.03026075322792167, 0.012290407016407698, 0.06381358641199768, -0.007891621204616967, -0.1368467856606003, 0.043506696635158736, 0.08873029227834195, -0.08500384678962292, 0.04811735023278743, 0.14832409087655832, -0.08013579020014731, -0.11229587093461305, 0.28681777821806465, -0.05609789204470871, -0.16306213331001346, 0.12998878960177535, -0.11795369214378297, -0.0634851147622976, 0.21906980099156498, 0.18659294763114304, -0.009066747646138539, -0.17459131821698975, 0.038916322223958556, 0.07599937998456881, 0.28955713510513303, 0.13528688651276752, 0.12164255803334527, 0.16088508809218183, 0.25444827300612816, 0.08782951888162643, 0.15498297145881224, -0.18743711810500827, 0.008088846375467256, -0.2724939376034308, -0.15194861155643594, -0.15997967121744294, 0.05086969736032188, -0.07169559944421053, -0.1348706806427799, 0.38426901997067037, 0.14154497829149476, 0.13489495421759784, 0.037845454581547526, 0.3696200390625745, 0.09730869256483857, 0.1624144738097675, 0.07200912285596132, 0.17242750128963963, 0.11760580315312837, 0.15221882898476907, -0.18668509770999664, -0.010792882479654509, -0.034706274732016026]
|
1,803.04601
|
Suzaku Observations of Low Surface Brightness Cluster Abell 1631
|
We present analysis results for a nearby galaxy cluster Abell 1631 at
$z~=~0.046$ using the X-ray observatory Suzaku. This cluster is categorized as
a low X-ray surface brightness cluster. To study the dynamical state of the
cluster, we conduct four-pointed Suzaku observations and investigate physical
properties of the Mpc-scale hot gas associated with the A1631 cluster for the
first time. Unlike relaxed clusters, the X-ray image shows no strong peak at
the center and an irregular morphology. We perform spectral analysis and
investigate the radial profiles of the gas temperature, density, and entropy
out to approximately 1.5~Mpc in the east, north, west, and south directions by
combining with the XMM-Newton data archive. The measured gas density in the
central region is relatively low (${\rm a~few} \times~10^{-4}~{\rm cm^{-3}}$)
at the given temperature ($\sim2.9~{\rm keV}$) compared with X-ray-selected
clusters. The entropy profile and value within the central region
($r<0.1~r_{200}$) are found to be flatter and higher ($\gtrsim400~ {\rm
keV~cm}^2$). The observed bolometric luminosity is approximately three times
lower than that expected from the luminosity-temperature relation in previous
studies for relaxed clusters. These features are also observed in another low
surface brightness cluster, Abell 76. The spatial distributions of galaxies and
the hot gas appear to be different. The X-ray luminosity is relatively lower
than that expected from the velocity dispersion. A post-merger scenario may
explain the observed results.
|
astro-ph.HE
|
we present analysis results for a nearby galaxy cluster abell 1631 at z0046 using the xray observatory suzaku this cluster is categorized as a low xray surface brightness cluster to study the dynamical state of the cluster we conduct fourpointed suzaku observations and investigate physical properties of the mpcscale hot gas associated with the a1631 cluster for the first time unlike relaxed clusters the xray image shows no strong peak at the center and an irregular morphology we perform spectral analysis and investigate the radial profiles of the gas temperature density and entropy out to approximately 15mpc in the east north west and south directions by combining with the xmmnewton data archive the measured gas density in the central region is relatively low rm afew times104rm cm3 at the given temperature sim29rm kev compared with xrayselected clusters the entropy profile and value within the central region r01r_200 are found to be flatter and higher gtrsim400 rm kevcm2 the observed bolometric luminosity is approximately three times lower than that expected from the luminositytemperature relation in previous studies for relaxed clusters these features are also observed in another low surface brightness cluster abell 76 the spatial distributions of galaxies and the hot gas appear to be different the xray luminosity is relatively lower than that expected from the velocity dispersion a postmerger scenario may explain the observed results
|
[['we', 'present', 'analysis', 'results', 'for', 'a', 'nearby', 'galaxy', 'cluster', 'abell', '1631', 'at', 'z0046', 'using', 'the', 'xray', 'observatory', 'suzaku', 'this', 'cluster', 'is', 'categorized', 'as', 'a', 'low', 'xray', 'surface', 'brightness', 'cluster', 'to', 'study', 'the', 'dynamical', 'state', 'of', 'the', 'cluster', 'we', 'conduct', 'fourpointed', 'suzaku', 'observations', 'and', 'investigate', 'physical', 'properties', 'of', 'the', 'mpcscale', 'hot', 'gas', 'associated', 'with', 'the', 'a1631', 'cluster', 'for', 'the', 'first', 'time', 'unlike', 'relaxed', 'clusters', 'the', 'xray', 'image', 'shows', 'no', 'strong', 'peak', 'at', 'the', 'center', 'and', 'an', 'irregular', 'morphology', 'we', 'perform', 'spectral', 'analysis', 'and', 'investigate', 'the', 'radial', 'profiles', 'of', 'the', 'gas', 'temperature', 'density', 'and', 'entropy', 'out', 'to', 'approximately', '15mpc', 'in', 'the', 'east', 'north', 'west', 'and', 'south', 'directions', 'by', 'combining', 'with', 'the', 'xmmnewton', 'data', 'archive', 'the', 'measured', 'gas', 'density', 'in', 'the', 'central', 'region', 'is', 'relatively', 'low', 'rm', 'afew', 'times104rm', 'cm3', 'at', 'the', 'given', 'temperature', 'sim29rm', 'kev', 'compared', 'with', 'xrayselected', 'clusters', 'the', 'entropy', 'profile', 'and', 'value', 'within', 'the', 'central', 'region', 'r01r_200', 'are', 'found', 'to', 'be', 'flatter', 'and', 'higher', 'gtrsim400', 'rm', 'kevcm2', 'the', 'observed', 'bolometric', 'luminosity', 'is', 'approximately', 'three', 'times', 'lower', 'than', 'that', 'expected', 'from', 'the', 'luminositytemperature', 'relation', 'in', 'previous', 'studies', 'for', 'relaxed', 'clusters', 'these', 'features', 'are', 'also', 'observed', 'in', 'another', 'low', 'surface', 'brightness', 'cluster', 'abell', '76', 'the', 'spatial', 'distributions', 'of', 'galaxies', 'and', 'the', 'hot', 'gas', 'appear', 'to', 'be', 'different', 'the', 'xray', 'luminosity', 'is', 'relatively', 'lower', 'than', 'that', 'expected', 'from', 'the', 'velocity', 'dispersion', 'a', 'postmerger', 'scenario', 'may', 'explain', 'the', 'observed', 'results']]
|
[-0.04610869237466303, 0.08447697013011893, -0.10839894575760041, 0.11243438314525284, -0.04260968429261827, -0.03529960001429722, 0.035743035723723164, 0.43300547827562513, -0.16418166928307992, -0.3497715766281719, 0.08919413642507029, -0.3248118188436309, -0.0013281172906903372, 0.20386642827461027, 0.010018227316522077, -0.04032192844764614, 0.027561901660304363, -0.029497975704672674, -0.09108718668778329, -0.24795334231529437, 0.25981705538613814, 0.11097412800190962, 0.24772462965686673, -0.00142142556599218, 0.04991050340398959, -0.08420856526657326, -0.05668652482271262, 0.015215375800893459, -0.1439195630837234, 0.04270331662751045, 0.23948910292004102, 0.0843139643651714, 0.20755433422602612, -0.3503904833913394, -0.20180098084173673, 0.04768003028345435, 0.17338061695238022, -0.0024196046710728784, -0.039713851271886126, -0.2866561549490309, 0.08228555979147621, -0.1791893838592231, -0.19456963206866765, 0.08673605664748035, 0.027438294674061475, 0.013005553343924418, -0.16599080051172133, 0.21550179991462337, -0.03921786340585587, 0.06039739767574284, -0.144113601758687, -0.11990054056992473, -0.0643986640157833, 0.049818406296154, -0.0026697292838875016, 0.08612087980172167, 0.2027352948281829, -0.12551878222060223, -0.012811045417536611, 0.36390967643872907, -0.04912772156379492, 0.04875331679699287, 0.25150532424931, -0.23622438428949002, -0.2036395950804222, 0.15271838828836265, 0.14580958487984796, 0.06380039412894001, -0.14502749667337086, 0.00029364600711178935, -0.07022512465562314, 0.2346233385976523, 0.05242796639962862, 0.040208085423686805, 0.2965047666101321, 0.09533380474161662, 0.0579492054288552, 0.16630653100200932, -0.2602867535892215, -0.02047191919614327, -0.21596088615505526, -0.07524709362264502, -0.12540704171283842, 0.020338967909236953, -0.13205889293224418, -0.0927359731006755, 0.33091943843936605, 0.0878402395891536, 0.2457109132152238, 0.05163094701354932, 0.29442375020834205, 0.12839227660238045, 0.08885861724746928, 0.15211621698919156, 0.2598093315006391, 0.18284946033884197, 0.09316935394061347, -0.2562977597372581, 0.04360546369810448, -0.021575729370773154]
|
1,803.04602
|
Spin Seebeck effect in a simple ferromagnet near Tc: A Ginzburg-Landau
approach
|
A time-dependent Ginzburg-Landau theory is used to examine the longitudinal
spin Seebeck effect in a simple ferromagnet in the vicinity of the Curie
temperature Tc. It is shown analytically that the spin Seebeck effect is
proportional to the magnetization near Tc, whose result is in line with the
previous numerical finding. It is argued that the present result can be tested
experimentally using a simple magnetic system such as EuO/Pt or EuS/Pt.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
a timedependent ginzburglandau theory is used to examine the longitudinal spin seebeck effect in a simple ferromagnet in the vicinity of the curie temperature tc it is shown analytically that the spin seebeck effect is proportional to the magnetization near tc whose result is in line with the previous numerical finding it is argued that the present result can be tested experimentally using a simple magnetic system such as euopt or euspt
|
[['a', 'timedependent', 'ginzburglandau', 'theory', 'is', 'used', 'to', 'examine', 'the', 'longitudinal', 'spin', 'seebeck', 'effect', 'in', 'a', 'simple', 'ferromagnet', 'in', 'the', 'vicinity', 'of', 'the', 'curie', 'temperature', 'tc', 'it', 'is', 'shown', 'analytically', 'that', 'the', 'spin', 'seebeck', 'effect', 'is', 'proportional', 'to', 'the', 'magnetization', 'near', 'tc', 'whose', 'result', 'is', 'in', 'line', 'with', 'the', 'previous', 'numerical', 'finding', 'it', 'is', 'argued', 'that', 'the', 'present', 'result', 'can', 'be', 'tested', 'experimentally', 'using', 'a', 'simple', 'magnetic', 'system', 'such', 'as', 'euopt', 'or', 'euspt']]
|
[-0.14060257584621597, 0.15806775098400458, -0.07199067978986672, 0.020461869920005222, -0.08910739858235632, -0.13126209980276013, 0.032891457630986616, 0.37762724930154423, -0.2624451176928622, -0.2596631513509367, 0.03350551047395649, -0.2903905203083663, -0.1686636004497164, 0.255601747171022, 0.034278069882254514, 0.0222219587170652, -0.06623559019395284, 0.07265428735408933, -0.052036442760644216, -0.23316222434597356, 0.2513121981772461, 0.034239516633429695, 0.3114976891981704, 0.12357789282687008, 0.0512692090389984, -0.026971197263420826, 0.1363796448933759, 0.11584003244393638, -0.11565735135331384, -0.029848189399178538, 0.26559596151845266, -0.06832899658807687, 0.17724621047132783, -0.3699747205578855, -0.22814706734581186, 0.038797691051981276, 0.11785489114533577, 0.1692139075536813, -0.025955246009730867, -0.2389366955895509, 0.07193430434646352, -0.17234551267964499, -0.17657856653843607, -0.10469666261758123, 0.022587900715214864, -0.05265245425980538, -0.28348893469997816, 0.11889024489958372, 0.04967703311038869, 0.08394663876720837, -0.04279956091195345, -0.10286302278317246, -0.0655633051879704, 0.014573391310737602, 0.0919987473555271, 0.10201003234833479, 0.1668018384570522, -0.053871334729982276, -0.11689737564218895, 0.35049932976918563, -0.08836410652313914, -0.16135728578748448, 0.11815378909398402, -0.1974646938997986, -0.04002774536077466, 0.13210145054118974, 0.09109890891704708, 0.11847988770875548, -0.1714378005824983, 0.07736852027010173, -0.07330073333744491, 0.16406511813402175, 0.0045879790260057365, -0.02716524928276028, 0.2528179254915033, 0.22572998722483004, 0.033668335221175634, 0.1741187808885505, -0.12139617982985718, -0.053309070121031255, -0.22864637560310908, -0.15194499057584576, -0.2643279287165829, 0.10421352071820625, -0.059306797651307926, -0.1621942892217443, 0.36278820524790456, 0.21975554961048016, 0.1865151509642601, -0.014424833575529712, 0.2655369309176292, 0.2013342970566425, 0.09058930718206934, 0.07619236397024776, 0.2784083408569651, 0.196909048607839, 0.15025242763970578, -0.3416869666493897, 0.11947225273054625, 0.03270735756627151]
|
1,803.04603
|
Modifications to the neutrino mixing from the mu-tau reflection symmetry
|
The $\mu$-$\tau$ reflection symmetry serves as a unique basis for
understanding the observed neutrino mixing as it can lead us to the interesting
results $\theta^{}_{23} = \pi/4$ and $\delta = -\pi/2$ which stand close to the
current experimental results. But a precise measurement for $\theta^{}_{23}$
and $\delta$ will probably force us to modify the neutrino mixing $U^{(0)}$
from such a symmetry. Here we perform a study for modifications to $U^{(0)}$ in
the forms of $U^{(1)\dagger} U^{(0)}$ and $U^{(0)} U^{(1)}$ where $U^{(1)}=
R^{(1)}_{ij}$ (for $ij = 12, 23$ and 13) with $R^{(1)}_{ij}$ denoting a real
orthogonal rotation on the $ij$ plane.
|
hep-ph
|
the mutau reflection symmetry serves as a unique basis for understanding the observed neutrino mixing as it can lead us to the interesting results theta_23 pi4 and delta pi2 which stand close to the current experimental results but a precise measurement for theta_23 and delta will probably force us to modify the neutrino mixing u0 from such a symmetry here we perform a study for modifications to u0 in the forms of u1dagger u0 and u0 u1 where u1 r1_ij for ij 12 23 and 13 with r1_ij denoting a real orthogonal rotation on the ij plane
|
[['the', 'mutau', 'reflection', 'symmetry', 'serves', 'as', 'a', 'unique', 'basis', 'for', 'understanding', 'the', 'observed', 'neutrino', 'mixing', 'as', 'it', 'can', 'lead', 'us', 'to', 'the', 'interesting', 'results', 'theta_23', 'pi4', 'and', 'delta', 'pi2', 'which', 'stand', 'close', 'to', 'the', 'current', 'experimental', 'results', 'but', 'a', 'precise', 'measurement', 'for', 'theta_23', 'and', 'delta', 'will', 'probably', 'force', 'us', 'to', 'modify', 'the', 'neutrino', 'mixing', 'u0', 'from', 'such', 'a', 'symmetry', 'here', 'we', 'perform', 'a', 'study', 'for', 'modifications', 'to', 'u0', 'in', 'the', 'forms', 'of', 'u1dagger', 'u0', 'and', 'u0', 'u1', 'where', 'u1', 'r1_ij', 'for', 'ij', '12', '23', 'and', '13', 'with', 'r1_ij', 'denoting', 'a', 'real', 'orthogonal', 'rotation', 'on', 'the', 'ij', 'plane']]
|
[-0.15455453034658778, 0.17941403509355447, -0.00868740808615025, 0.0734289099853684, -0.12043691344777162, -0.2030340106662442, 0.09730235301453541, 0.31793752954678334, -0.2524762381180289, -0.26920677513934355, 0.10488497319029387, -0.3295173726014872, -0.07466087556206324, 0.16135119105827936, 0.008534268025269217, 0.02682004165538448, 0.007001866814383167, 0.010995760020066766, -0.1386873136581655, -0.13797103915799488, 0.2479636197206267, -0.028552951999603116, 0.20401180326007307, 0.0593880652103256, 0.06746387414812566, -0.03156674903460798, 0.04600471186332722, -0.06466418389785797, -0.19312025032977156, 0.0018043916603114377, 0.1948588010752846, 0.05291558703546353, 0.14358037774589785, -0.37825821248933356, -0.09835794958177003, 0.15009762044560085, 0.14194966138258794, 0.06630568499949345, -0.04475438205074479, -0.34344462217376664, 0.03056785497198902, -0.15893168539363653, -0.19672772777762185, -0.0793981793376201, 0.01814790641730453, -0.05685506594872617, -0.41033412140120373, 0.1055958704487916, 0.028982633313639684, 0.02342470974086764, -0.009044318909489332, -0.16318536422988203, -0.04347633547644983, 0.11232511980577986, 0.11583424410089216, 0.09113007799989761, 0.05114806962863324, -0.11651157653900458, -0.07368446493328133, 0.45867043717744505, -0.04876765048507839, -0.22178174646452387, 0.11266078636981547, -0.2300258800052998, -0.146021630550596, 0.06716701206057629, 0.12248112270212237, 0.026893455876988617, -0.08686739770061475, 0.08749120455344227, -0.10559537937428723, 0.16265843524300355, 0.10578997692271591, -0.00224823917836902, 0.20701560314170064, 0.14227404070899208, 0.15237162088321404, -0.0039204503904948845, -0.10924329326062047, -0.022662012481150476, -0.3607367903013971, -0.11920103224668097, -0.1131177160138403, 0.1500121839988501, -0.0558672151571645, -0.11251346854136345, 0.4150239115858332, 0.15826101052919106, 0.24207200721262934, -0.00010370132339959766, 0.23546784771408172, 0.07440863952704488, 0.056509974333358574, 0.011102125672821669, 0.22803079147644817, 0.1338999343372168, 0.12489532644147093, -0.2576577104702394, 0.010408776747855418, 0.0290428837885129]
|
1,803.04604
|
Direct numerical study of speed of sound in dispersed air-water
two-phase flow
|
Speed of sound is a key parameter for the compressibility effects in
multiphase flow. We present a new approach to do direct numerical simulations
on the speed of sound in compressible two-phase flow, based on the stratified
multiphase flow model (Chang & Liou, JCP 2007). In this method, each face is
divided into gas-gas, gas-liquid, and liquid-liquid parts via reconstruction of
volume fraction, and the corresponding fluxes are calculated by Riemann
solvers. Viscosity and heat transfer models are included. The effects of
frequency (below the natural frequency of bubbles), volume fraction, viscosity
and heat transfer are investigated. With frequency 1 kHz, under viscous and
isothermal conditions, the simulation results satisfy the experimental ones
very well. The simulation results show that the speed of sound in air-water
bubbly two-phase flow is larger when the frequency is higher. At lower
frequency, for the phasic velocities, the homogeneous condition is better
satisfied. Considering the phasic temperatures, during the wave propagation an
isothermal bubble behavior is observed. Finally, the dispersion relation of
acoustics in two-phase flow is compared with analytical results below the
natural frequency. This work for the first time presents an approach to the
direct numerical simulations of speed of sound and other compressibility
effects in multiphase flow, which can be applied to study more complex
situations, especially when it is hard to do experimental study.
|
physics.flu-dyn
|
speed of sound is a key parameter for the compressibility effects in multiphase flow we present a new approach to do direct numerical simulations on the speed of sound in compressible twophase flow based on the stratified multiphase flow model chang liou jcp 2007 in this method each face is divided into gasgas gasliquid and liquidliquid parts via reconstruction of volume fraction and the corresponding fluxes are calculated by riemann solvers viscosity and heat transfer models are included the effects of frequency below the natural frequency of bubbles volume fraction viscosity and heat transfer are investigated with frequency 1 khz under viscous and isothermal conditions the simulation results satisfy the experimental ones very well the simulation results show that the speed of sound in airwater bubbly twophase flow is larger when the frequency is higher at lower frequency for the phasic velocities the homogeneous condition is better satisfied considering the phasic temperatures during the wave propagation an isothermal bubble behavior is observed finally the dispersion relation of acoustics in twophase flow is compared with analytical results below the natural frequency this work for the first time presents an approach to the direct numerical simulations of speed of sound and other compressibility effects in multiphase flow which can be applied to study more complex situations especially when it is hard to do experimental study
|
[['speed', 'of', 'sound', 'is', 'a', 'key', 'parameter', 'for', 'the', 'compressibility', 'effects', 'in', 'multiphase', 'flow', 'we', 'present', 'a', 'new', 'approach', 'to', 'do', 'direct', 'numerical', 'simulations', 'on', 'the', 'speed', 'of', 'sound', 'in', 'compressible', 'twophase', 'flow', 'based', 'on', 'the', 'stratified', 'multiphase', 'flow', 'model', 'chang', 'liou', 'jcp', '2007', 'in', 'this', 'method', 'each', 'face', 'is', 'divided', 'into', 'gasgas', 'gasliquid', 'and', 'liquidliquid', 'parts', 'via', 'reconstruction', 'of', 'volume', 'fraction', 'and', 'the', 'corresponding', 'fluxes', 'are', 'calculated', 'by', 'riemann', 'solvers', 'viscosity', 'and', 'heat', 'transfer', 'models', 'are', 'included', 'the', 'effects', 'of', 'frequency', 'below', 'the', 'natural', 'frequency', 'of', 'bubbles', 'volume', 'fraction', 'viscosity', 'and', 'heat', 'transfer', 'are', 'investigated', 'with', 'frequency', '1', 'khz', 'under', 'viscous', 'and', 'isothermal', 'conditions', 'the', 'simulation', 'results', 'satisfy', 'the', 'experimental', 'ones', 'very', 'well', 'the', 'simulation', 'results', 'show', 'that', 'the', 'speed', 'of', 'sound', 'in', 'airwater', 'bubbly', 'twophase', 'flow', 'is', 'larger', 'when', 'the', 'frequency', 'is', 'higher', 'at', 'lower', 'frequency', 'for', 'the', 'phasic', 'velocities', 'the', 'homogeneous', 'condition', 'is', 'better', 'satisfied', 'considering', 'the', 'phasic', 'temperatures', 'during', 'the', 'wave', 'propagation', 'an', 'isothermal', 'bubble', 'behavior', 'is', 'observed', 'finally', 'the', 'dispersion', 'relation', 'of', 'acoustics', 'in', 'twophase', 'flow', 'is', 'compared', 'with', 'analytical', 'results', 'below', 'the', 'natural', 'frequency', 'this', 'work', 'for', 'the', 'first', 'time', 'presents', 'an', 'approach', 'to', 'the', 'direct', 'numerical', 'simulations', 'of', 'speed', 'of', 'sound', 'and', 'other', 'compressibility', 'effects', 'in', 'multiphase', 'flow', 'which', 'can', 'be', 'applied', 'to', 'study', 'more', 'complex', 'situations', 'especially', 'when', 'it', 'is', 'hard', 'to', 'do', 'experimental', 'study']]
|
[-0.12252898022559609, 0.15093262519151276, -0.07966169137131807, 0.009242922513465911, -0.0776097871375692, -0.08990480798722617, -0.002674624794726615, 0.3632393394609404, -0.2608298204814172, -0.2725251173859487, 0.1003137547032064, -0.2536396974647593, -0.08459710117613253, 0.26253491638002774, -0.01078920863096857, 0.08813563285754668, 0.045839306590410425, 0.0029363359255202516, -0.051673650548682705, -0.17753518107159255, 0.2739604864094089, 0.07468002746006967, 0.31181215005404744, 0.09178288049255644, 0.07697853075879138, -0.08430882966127079, -0.022052920444329757, 0.06690944576502314, -0.19076191862923592, 0.02586760190148491, 0.2417787493792324, 0.04321509115439694, 0.2283856956906316, -0.4327870043738006, -0.28706751122753316, 0.05168117975582256, 0.10540279248654175, 0.09090550574881229, -0.040834806623334594, -0.23868473920962802, 0.08682316600107808, -0.14577834151743707, -0.10918580264287935, -0.05493620056826037, -0.005066003330937282, 0.022880167483702935, -0.2554155390233536, 0.19657833132299807, 0.05488360330155495, 0.05270449147714227, -0.09694171496280657, -0.0925635062523537, -0.0283533680229761, 0.08059234902624984, 0.04247736616316982, -0.012128042132330583, 0.14369119949338147, -0.15948718295729147, -0.03311094994585744, 0.4224910130933128, -0.07746500842353629, -0.21303608815338163, 0.23505401319089125, -0.1375357949203914, -0.04406993863101832, 0.18645725280439038, 0.21406720655306238, 0.11115611212812532, -0.11042118815022872, -0.0018099404515431266, -0.05029942853173456, 0.18084517499377675, 0.07061112575826022, -0.08405538984979483, 0.1701371397284348, 0.1952229089253987, 0.032043910057037536, 0.1480126661546591, -0.09886229774323992, -0.10832800881544571, -0.29227312280057255, -0.16159062284450026, -0.1463961934622778, -0.02134817998628957, -0.10589012704179372, -0.1332698548708587, 0.34486970920199234, 0.1593985390231314, 0.17840086402906097, 0.05535754063552989, 0.35151596227034326, 0.144796966236281, -0.0025074314806326353, 0.12606566374486672, 0.2699584772898043, 0.13074122221655976, 0.16763883812307076, -0.24961548774386233, 0.05431523811878144, 0.08214028874378769]
|
1,803.04605
|
Quantum Mechanics in the Light of Quantum Cosmology
|
We sketch a quantum mechanical framework for the universe as a whole. Within
that framework we propose a program for describing the ultimate origin in
quantum cosmology of the quasiclassical domain of familiar experience and for
characterizing the process of measurement. Predictions in quantum mechanics are
made from probabilities for sets of alternative histories. Probabilities can be
assigned only to sets of histories that approximately decohere. Decoherence is
defined and the mechanism of decoherence is reviewed. Decoherence requires a
sufficiently coarse-grained description of alternative histories of the
universe. A quasiclassical domain consists of a branching set of alternative
decohering histories, described by a coarse graining that is maximally refined
consistent with decoherence, with individual branches that exhibit a high level
of classical correlation in time. A quasiclassical domain is emergent in the
universe as a consequence of the initial condition and the action function of
the elementary particles. It is an important question whether all the
quasiclassical domains are roughly equivalent or whether there are various
essentially inequivalent ones. A measurement is a correlation with variables in
a quasiclassical domain. An observer (or information gathering and utilizing
system) is a complex adaptive system that has evolved to exploit the relative
predictability of a quasiclassical domain. We suggest that resolution of many
of the problems of interpretation presented by quantum mechanics is to be
accomplished, not by further scrutiny of the subject as it applies to
reproducible laboratory situations, but rather by an examination of alternative
histories of the universe, stemming from its initial condition, and a study of
the problem of quasiclassical domains.
|
gr-qc quant-ph
|
we sketch a quantum mechanical framework for the universe as a whole within that framework we propose a program for describing the ultimate origin in quantum cosmology of the quasiclassical domain of familiar experience and for characterizing the process of measurement predictions in quantum mechanics are made from probabilities for sets of alternative histories probabilities can be assigned only to sets of histories that approximately decohere decoherence is defined and the mechanism of decoherence is reviewed decoherence requires a sufficiently coarsegrained description of alternative histories of the universe a quasiclassical domain consists of a branching set of alternative decohering histories described by a coarse graining that is maximally refined consistent with decoherence with individual branches that exhibit a high level of classical correlation in time a quasiclassical domain is emergent in the universe as a consequence of the initial condition and the action function of the elementary particles it is an important question whether all the quasiclassical domains are roughly equivalent or whether there are various essentially inequivalent ones a measurement is a correlation with variables in a quasiclassical domain an observer or information gathering and utilizing system is a complex adaptive system that has evolved to exploit the relative predictability of a quasiclassical domain we suggest that resolution of many of the problems of interpretation presented by quantum mechanics is to be accomplished not by further scrutiny of the subject as it applies to reproducible laboratory situations but rather by an examination of alternative histories of the universe stemming from its initial condition and a study of the problem of quasiclassical domains
|
[['we', 'sketch', 'a', 'quantum', 'mechanical', 'framework', 'for', 'the', 'universe', 'as', 'a', 'whole', 'within', 'that', 'framework', 'we', 'propose', 'a', 'program', 'for', 'describing', 'the', 'ultimate', 'origin', 'in', 'quantum', 'cosmology', 'of', 'the', 'quasiclassical', 'domain', 'of', 'familiar', 'experience', 'and', 'for', 'characterizing', 'the', 'process', 'of', 'measurement', 'predictions', 'in', 'quantum', 'mechanics', 'are', 'made', 'from', 'probabilities', 'for', 'sets', 'of', 'alternative', 'histories', 'probabilities', 'can', 'be', 'assigned', 'only', 'to', 'sets', 'of', 'histories', 'that', 'approximately', 'decohere', 'decoherence', 'is', 'defined', 'and', 'the', 'mechanism', 'of', 'decoherence', 'is', 'reviewed', 'decoherence', 'requires', 'a', 'sufficiently', 'coarsegrained', 'description', 'of', 'alternative', 'histories', 'of', 'the', 'universe', 'a', 'quasiclassical', 'domain', 'consists', 'of', 'a', 'branching', 'set', 'of', 'alternative', 'decohering', 'histories', 'described', 'by', 'a', 'coarse', 'graining', 'that', 'is', 'maximally', 'refined', 'consistent', 'with', 'decoherence', 'with', 'individual', 'branches', 'that', 'exhibit', 'a', 'high', 'level', 'of', 'classical', 'correlation', 'in', 'time', 'a', 'quasiclassical', 'domain', 'is', 'emergent', 'in', 'the', 'universe', 'as', 'a', 'consequence', 'of', 'the', 'initial', 'condition', 'and', 'the', 'action', 'function', 'of', 'the', 'elementary', 'particles', 'it', 'is', 'an', 'important', 'question', 'whether', 'all', 'the', 'quasiclassical', 'domains', 'are', 'roughly', 'equivalent', 'or', 'whether', 'there', 'are', 'various', 'essentially', 'inequivalent', 'ones', 'a', 'measurement', 'is', 'a', 'correlation', 'with', 'variables', 'in', 'a', 'quasiclassical', 'domain', 'an', 'observer', 'or', 'information', 'gathering', 'and', 'utilizing', 'system', 'is', 'a', 'complex', 'adaptive', 'system', 'that', 'has', 'evolved', 'to', 'exploit', 'the', 'relative', 'predictability', 'of', 'a', 'quasiclassical', 'domain', 'we', 'suggest', 'that', 'resolution', 'of', 'many', 'of', 'the', 'problems', 'of', 'interpretation', 'presented', 'by', 'quantum', 'mechanics', 'is', 'to', 'be', 'accomplished', 'not', 'by', 'further', 'scrutiny', 'of', 'the', 'subject', 'as', 'it', 'applies', 'to', 'reproducible', 'laboratory', 'situations', 'but', 'rather', 'by', 'an', 'examination', 'of', 'alternative', 'histories', 'of', 'the', 'universe', 'stemming', 'from', 'its', 'initial', 'condition', 'and', 'a', 'study', 'of', 'the', 'problem', 'of', 'quasiclassical', 'domains']]
|
[-0.12282450909827244, 0.14854684001570276, -0.15639805445932703, 0.090235278163779, -0.04595959111702887, -0.11204982123128758, 0.03937659803919579, 0.34684571268270675, -0.2525559839325118, -0.2749431863189905, 0.0818424782894566, -0.2250374452752759, -0.10210453223161746, 0.19055633653245668, -0.0660743286254189, 0.03524058346150571, 0.06129739028065263, 0.04403418980843384, -0.042435352602210465, -0.21865641161092972, 0.3425492421695573, 0.04893412249084888, 0.26485196677808553, -0.004395840186696542, 0.1259562768991116, -0.0002327294818377087, -0.019340740621245744, 0.053794120838546934, -0.10701420985841938, 0.10099531660173372, 0.2490501641596848, 0.1694634768106185, 0.27482946495571575, -0.4346681944600983, -0.21640109537371183, 0.0654202940822455, 0.14085869764919773, 0.15525850934992783, -0.023050811876960724, -0.28716444769279303, 0.06470814361055506, -0.1549863314960761, -0.123857463885297, -0.059483045127823556, 0.042987446123627884, -0.04427732708474388, -0.2520863455490071, 0.10023968905642515, 0.06367518076998605, 0.04555919315228186, -0.05666488497526856, -0.05285837365572869, 0.024182527314096036, 0.12150048754822478, 0.007027732516783236, 0.03928924735005637, 0.14063559185550636, -0.14362765343314454, -0.14200422489270215, 0.41283585594704963, -0.021145009603253974, -0.2089389977204709, 0.2032383178190785, -0.13576911051293744, -0.08771548423820491, 0.10129158840899377, 0.09427671831724421, 0.11540191032757324, -0.1917884115575894, 0.09338458186481259, -0.01851937004910364, 0.15723894169986136, 0.046282155454971476, 0.07603378662974096, 0.24940784916302947, 0.1802936850660994, 0.05019029825832872, 0.11769892897425015, -0.018014040564898644, -0.14446141105676388, -0.3413404230340012, -0.16722884819357736, -0.21258798409510093, 0.09217183735579502, -0.06555081948879425, -0.1725592037584073, 0.3707383831612369, 0.14600651142937254, 0.20527412986041024, 0.02884369031897969, 0.2555226181339855, 0.10283115018959672, 0.030194051939987015, 0.004416720715029158, 0.20096239147835301, 0.12422191786328365, 0.05778874413414855, -0.2124053298782543, 0.0795017335964048, 0.030565546929992082]
|
1,803.04606
|
On the Variability of Chaos Indices in Sleep EEG Signals
|
Previous researches revealed the chaotic and nonlinear nature of EEG signal.
In this paper we inspected the variability of chaotic indices of the sleep EEG
signal such as largest Lyapunov exponent, mutual information, correlation
dimension and minimum embedding dimension among different subjects, conditions
and sleep stages. Empirical histograms of these indices are obtained from sleep
EEG of 31 subjects, showing that, with a good accuracy, these indices in each
stage of sleep vary from healthy human subjects to subjects suspected to have
sleep-disordered breathing.
|
eess.SP
|
previous researches revealed the chaotic and nonlinear nature of eeg signal in this paper we inspected the variability of chaotic indices of the sleep eeg signal such as largest lyapunov exponent mutual information correlation dimension and minimum embedding dimension among different subjects conditions and sleep stages empirical histograms of these indices are obtained from sleep eeg of 31 subjects showing that with a good accuracy these indices in each stage of sleep vary from healthy human subjects to subjects suspected to have sleepdisordered breathing
|
[['previous', 'researches', 'revealed', 'the', 'chaotic', 'and', 'nonlinear', 'nature', 'of', 'eeg', 'signal', 'in', 'this', 'paper', 'we', 'inspected', 'the', 'variability', 'of', 'chaotic', 'indices', 'of', 'the', 'sleep', 'eeg', 'signal', 'such', 'as', 'largest', 'lyapunov', 'exponent', 'mutual', 'information', 'correlation', 'dimension', 'and', 'minimum', 'embedding', 'dimension', 'among', 'different', 'subjects', 'conditions', 'and', 'sleep', 'stages', 'empirical', 'histograms', 'of', 'these', 'indices', 'are', 'obtained', 'from', 'sleep', 'eeg', 'of', '31', 'subjects', 'showing', 'that', 'with', 'a', 'good', 'accuracy', 'these', 'indices', 'in', 'each', 'stage', 'of', 'sleep', 'vary', 'from', 'healthy', 'human', 'subjects', 'to', 'subjects', 'suspected', 'to', 'have', 'sleepdisordered', 'breathing']]
|
[-0.08585225084953639, 0.11838553133364542, -0.11360592183556004, 0.07578121167916176, -0.05353799494367699, -0.1955809217698154, 0.048960184264670026, 0.3893628521311849, -0.19517480070332446, -0.3119166031569602, 0.09958007254256272, -0.3383497063923313, -0.25217281422207516, 0.186839075498872, -0.15023797730836702, 0.09271480198560356, 0.09572921689958816, 0.11471764238394168, 0.011976939881310225, -0.2445415247860084, 0.25286439842129327, -0.009132623941783446, 0.3164369574220604, -0.07099207057280982, 0.04945426997560334, -0.04369999590352267, -0.09162174935553627, 0.008824932849012226, -0.09380554272388235, 0.10512889353334005, 0.34973669701805676, 0.1545296033103782, 0.31522911686046295, -0.39341511202594603, -0.24090940985514456, 0.12225415519822995, 0.12885732667279395, 0.02076292430690254, 0.03254672173545303, -0.3590075186711837, 0.129511889956712, -0.098710598334311, -0.027190159613558328, -0.032797476287976086, 0.07439454090613198, -0.008053359093077212, -0.2957549592008792, 0.1943396214916124, -0.021761851014950907, 0.20957988809165826, -0.12210942815473101, -0.11495702389448163, -0.03281350618968886, 0.2728457733685802, 0.1659686245677813, -0.01419634144354881, 0.16850364612729615, -0.10999500437594771, -0.15696373522346166, 0.23761237575392047, 0.04887376263659133, -0.11114073437021439, 0.23626247174252057, -0.1547789017793285, -0.13521236030340014, 0.09748032893312264, 0.21228453311620346, 0.02052018371219915, -0.14973016151687107, -0.10014810012751652, 0.054666910399065675, 0.24397030743175602, 0.1247897087820772, 0.05302864775981709, 0.12704942274434738, 0.1483210591285164, -0.03668022450587028, 0.1133426942873791, -0.1355944260511637, -0.01734748124762113, -0.23514635934976927, -0.08050096508519478, -0.18632485448236924, 0.04213944860700383, -0.17782696546844337, -0.12384582236858017, 0.5102216491857207, 0.11691366919282689, 0.15102629570559745, 0.07321749143975687, 0.24486049893031636, 0.03619564045080354, 0.04174814774957766, 0.07567234114036862, 0.231533232689218, 0.0676076563568898, 0.14719607021255665, -0.22041860628446722, 0.06713899458668766, 0.009970735514491617]
|
1,803.04607
|
A Perceptual Based Motion Compensation Technique for Video Coding
|
Motion estimation is one of the important procedures in the all video
encoders. Most of the complexity of the video coder depends on the complexity
of the motion estimation step. The original motion estimation algorithm has a
remarkable complexity and therefore many improvements were proposed to enhance
the crude version of the motion estimation. The basic idea of many of these
works were to optimize some distortion function for mean squared error (MSE) or
sum of absolute difference (SAD) in block matching But it is shown that these
metrics do not conclude the quality as it is, on the other hand, they are not
compatible with the human visual system (HVS). In this paper we explored the
usage of the image quality metrics in the video coding and more specific in the
motion estimation. We have utilized the perceptual image quality metrics
instead of MSE or SAD in the block based motion estimation. Three different
metrics have used: structural similarity or SSIM, complex wavelet structural
similarity or CW-SSIM, visual information fidelity or VIF. Experimental results
showed that usage of the quality criterions can improve the compression rate
while the quality remains fix and thus better quality in coded video at the
same bit budget.
|
eess.IV
|
motion estimation is one of the important procedures in the all video encoders most of the complexity of the video coder depends on the complexity of the motion estimation step the original motion estimation algorithm has a remarkable complexity and therefore many improvements were proposed to enhance the crude version of the motion estimation the basic idea of many of these works were to optimize some distortion function for mean squared error mse or sum of absolute difference sad in block matching but it is shown that these metrics do not conclude the quality as it is on the other hand they are not compatible with the human visual system hvs in this paper we explored the usage of the image quality metrics in the video coding and more specific in the motion estimation we have utilized the perceptual image quality metrics instead of mse or sad in the block based motion estimation three different metrics have used structural similarity or ssim complex wavelet structural similarity or cwssim visual information fidelity or vif experimental results showed that usage of the quality criterions can improve the compression rate while the quality remains fix and thus better quality in coded video at the same bit budget
|
[['motion', 'estimation', 'is', 'one', 'of', 'the', 'important', 'procedures', 'in', 'the', 'all', 'video', 'encoders', 'most', 'of', 'the', 'complexity', 'of', 'the', 'video', 'coder', 'depends', 'on', 'the', 'complexity', 'of', 'the', 'motion', 'estimation', 'step', 'the', 'original', 'motion', 'estimation', 'algorithm', 'has', 'a', 'remarkable', 'complexity', 'and', 'therefore', 'many', 'improvements', 'were', 'proposed', 'to', 'enhance', 'the', 'crude', 'version', 'of', 'the', 'motion', 'estimation', 'the', 'basic', 'idea', 'of', 'many', 'of', 'these', 'works', 'were', 'to', 'optimize', 'some', 'distortion', 'function', 'for', 'mean', 'squared', 'error', 'mse', 'or', 'sum', 'of', 'absolute', 'difference', 'sad', 'in', 'block', 'matching', 'but', 'it', 'is', 'shown', 'that', 'these', 'metrics', 'do', 'not', 'conclude', 'the', 'quality', 'as', 'it', 'is', 'on', 'the', 'other', 'hand', 'they', 'are', 'not', 'compatible', 'with', 'the', 'human', 'visual', 'system', 'hvs', 'in', 'this', 'paper', 'we', 'explored', 'the', 'usage', 'of', 'the', 'image', 'quality', 'metrics', 'in', 'the', 'video', 'coding', 'and', 'more', 'specific', 'in', 'the', 'motion', 'estimation', 'we', 'have', 'utilized', 'the', 'perceptual', 'image', 'quality', 'metrics', 'instead', 'of', 'mse', 'or', 'sad', 'in', 'the', 'block', 'based', 'motion', 'estimation', 'three', 'different', 'metrics', 'have', 'used', 'structural', 'similarity', 'or', 'ssim', 'complex', 'wavelet', 'structural', 'similarity', 'or', 'cwssim', 'visual', 'information', 'fidelity', 'or', 'vif', 'experimental', 'results', 'showed', 'that', 'usage', 'of', 'the', 'quality', 'criterions', 'can', 'improve', 'the', 'compression', 'rate', 'while', 'the', 'quality', 'remains', 'fix', 'and', 'thus', 'better', 'quality', 'in', 'coded', 'video', 'at', 'the', 'same', 'bit', 'budget']]
|
[-0.0950478780312765, 0.005841900544314116, -0.08845418216386701, 0.07631584783723834, -0.07233720829882419, -0.13145845959204996, 0.01656937982724961, 0.45325851394776623, -0.25360348939755245, -0.32656542398035526, 0.1376733437902979, -0.2747440940070459, -0.17698725299138174, 0.18648837077118657, -0.20294158413604485, 0.1325277807539119, 0.08078474280944861, 0.1278793640815945, -0.10069693760163442, -0.3352516862225956, 0.2561755326905233, 0.06580830432985928, 0.3558323896471776, 0.010855903526866242, 0.09845498121370945, -0.009708597478867672, -0.06179374370577873, 0.01416672229785107, -0.10003162507122147, 0.16261480744544635, 0.23848269179271644, 0.20676308770791865, 0.29286645781522724, -0.34797589326569556, -0.22290217489752845, 0.0634374867522103, 0.16105799769809215, 0.07509539774593363, -0.03880160216017519, -0.27869785707626565, 0.09207285169110287, -0.11953667962727338, 0.03474708250495514, -0.07261781650823633, -0.03627804360425502, 0.016671232659171115, -0.25095536985991557, 0.08605434408630519, 0.05945910890495368, 0.05860660885296324, -0.07103677427364222, -0.14067349256662304, 0.02762862652261723, 0.22664346420959405, 0.07004044084996898, 0.06001390209912286, 0.14857360629328326, -0.16675519898782631, -0.10943411397816175, 0.4120185042379935, -0.049276455750063466, -0.270121240604888, 0.1762390541079381, -0.10392496866110128, -0.11457505420206443, 0.13918330265076684, 0.19204517192887507, 0.06633223180531286, -0.1362069732144757, -0.009949966690756436, 0.005262289515824295, 0.21243624514261006, 0.10827443150429092, 0.08002100712802335, 0.15314195618289067, 0.1659765949335255, 0.06372820218915448, 0.10682392298094426, -0.10812448220574022, -0.040574291087550056, -0.22575072590923667, -0.1635198198354748, -0.1947505324616727, -0.03737974795042058, -0.15634419428683674, -0.1625619325151966, 0.39625900381646467, 0.18095028195103605, 0.17580266831460975, 0.07027277420274913, 0.3690840969142942, 0.06109533248886959, 0.06886046373955312, 0.07632418906809214, 0.24108733615439099, 0.022604872119914302, 0.08833915063787215, -0.21193692652170784, 0.13057209091836258, 0.08909703123693664]
|
1,803.04608
|
Building Better Quality Predictors Using "$\epsilon$-Dominance"
|
Despite extensive research, many methods in software quality prediction still
exhibit some degree of uncertainty in their results. Rather than treating this
as a problem, this paper asks if this uncertainty is a resource that can
simplify software quality prediction.
For example, Deb's principle of $\epsilon$-dominance states that if there
exists some $\epsilon$ value below which it is useless or impossible to
distinguish results, then it is superfluous to explore anything less than
$\epsilon$. We say that for "large $\epsilon$ problems", the results space of
learning effectively contains just a few regions. If many learners are then
applied to such large $\epsilon$ problems, they would exhibit a "many roads
lead to Rome" property; i.e., many different software quality prediction
methods would generate a small set of very similar results.
This paper explores DART, an algorithm especially selected to succeed for
large $\epsilon$ software quality prediction problems. DART is remarkable
simple yet, on experimentation, it dramatically out-performs three sets of
state-of-the-art defect prediction methods.
The success of DART for defect prediction begs the questions: how many other
domains in software quality predictors can also be radically simplified? This
will be a fruitful direction for future work.
|
cs.SE
|
despite extensive research many methods in software quality prediction still exhibit some degree of uncertainty in their results rather than treating this as a problem this paper asks if this uncertainty is a resource that can simplify software quality prediction for example debs principle of epsilondominance states that if there exists some epsilon value below which it is useless or impossible to distinguish results then it is superfluous to explore anything less than epsilon we say that for large epsilon problems the results space of learning effectively contains just a few regions if many learners are then applied to such large epsilon problems they would exhibit a many roads lead to rome property ie many different software quality prediction methods would generate a small set of very similar results this paper explores dart an algorithm especially selected to succeed for large epsilon software quality prediction problems dart is remarkable simple yet on experimentation it dramatically outperforms three sets of stateoftheart defect prediction methods the success of dart for defect prediction begs the questions how many other domains in software quality predictors can also be radically simplified this will be a fruitful direction for future work
|
[['despite', 'extensive', 'research', 'many', 'methods', 'in', 'software', 'quality', 'prediction', 'still', 'exhibit', 'some', 'degree', 'of', 'uncertainty', 'in', 'their', 'results', 'rather', 'than', 'treating', 'this', 'as', 'a', 'problem', 'this', 'paper', 'asks', 'if', 'this', 'uncertainty', 'is', 'a', 'resource', 'that', 'can', 'simplify', 'software', 'quality', 'prediction', 'for', 'example', 'debs', 'principle', 'of', 'epsilondominance', 'states', 'that', 'if', 'there', 'exists', 'some', 'epsilon', 'value', 'below', 'which', 'it', 'is', 'useless', 'or', 'impossible', 'to', 'distinguish', 'results', 'then', 'it', 'is', 'superfluous', 'to', 'explore', 'anything', 'less', 'than', 'epsilon', 'we', 'say', 'that', 'for', 'large', 'epsilon', 'problems', 'the', 'results', 'space', 'of', 'learning', 'effectively', 'contains', 'just', 'a', 'few', 'regions', 'if', 'many', 'learners', 'are', 'then', 'applied', 'to', 'such', 'large', 'epsilon', 'problems', 'they', 'would', 'exhibit', 'a', 'many', 'roads', 'lead', 'to', 'rome', 'property', 'ie', 'many', 'different', 'software', 'quality', 'prediction', 'methods', 'would', 'generate', 'a', 'small', 'set', 'of', 'very', 'similar', 'results', 'this', 'paper', 'explores', 'dart', 'an', 'algorithm', 'especially', 'selected', 'to', 'succeed', 'for', 'large', 'epsilon', 'software', 'quality', 'prediction', 'problems', 'dart', 'is', 'remarkable', 'simple', 'yet', 'on', 'experimentation', 'it', 'dramatically', 'outperforms', 'three', 'sets', 'of', 'stateoftheart', 'defect', 'prediction', 'methods', 'the', 'success', 'of', 'dart', 'for', 'defect', 'prediction', 'begs', 'the', 'questions', 'how', 'many', 'other', 'domains', 'in', 'software', 'quality', 'predictors', 'can', 'also', 'be', 'radically', 'simplified', 'this', 'will', 'be', 'a', 'fruitful', 'direction', 'for', 'future', 'work']]
|
[-0.08973358443112488, 0.07416079288323653, -0.0700712219653555, 0.10695318270117025, -0.11111976070084714, -0.1925849599581327, 0.04514099740466468, 0.423724270502547, -0.2723930181200933, -0.3438944650828039, 0.11347126932310651, -0.2675849139977237, -0.16257854897202445, 0.2644280314207864, -0.14694462145964338, 0.05635760831598615, 0.1616951044476063, 0.04589658247405356, -0.059627970156725496, -0.2968446430414147, 0.26225746420485724, 0.03036482228907113, 0.28801896249318554, 0.06412822849683694, 0.041362578591773495, -0.051445729848112645, 0.012520280122377709, 0.06518932880540307, -0.10456574076261418, 0.13332611165362285, 0.346475775790468, 0.2080106908508298, 0.3679630754745959, -0.3718274808584799, -0.19316598693312137, 0.13923199751928025, 0.1561616994572573, 0.11456533463026118, -0.02276443182094714, -0.23847018887010432, 0.11404800979083299, -0.15759473665656112, -0.10581521527645461, -0.11452031699873354, 0.014632899226553584, -0.062304897020515726, -0.2594846654035266, 0.0046675002390516385, 0.05673682011817534, 0.03892188933766952, 0.0030417528277090224, -0.13841539640795708, 0.03992762184010569, 0.16153400251281821, 0.08642669528309908, 0.07400213405921978, 0.12750165942053013, -0.16558314733445456, -0.13206361656583673, 0.40763777666773227, -0.010312129045055324, -0.2162225154665366, 0.23150598423641905, -0.09143418367572859, -0.20679179695674899, 0.12263196669566954, 0.1720467920837559, 0.1012409556148209, -0.14217682873119705, 0.04612333400981482, -0.046283881792068944, 0.2041584357796909, 0.08069120997505397, 0.018875939780534198, 0.16695826540199427, 0.18968480424331405, 0.08163937014502416, 0.07213104586747053, -0.02410956983785769, -0.04388928240328336, -0.23091080212922402, -0.12567015758627958, -0.1685566351552177, 0.03174690398346806, -0.09289053578251377, -0.17674847519908524, 0.34955231190332664, 0.21669072351873295, 0.1680762052173563, 0.04945186557507469, 0.2998053098245063, 0.037738518404234894, 0.06986698327878893, 0.09208013907497384, 0.2221172330507975, -0.0016116279911864357, 0.07328544098394203, -0.11822304263538153, 0.11645298629528698, 0.0014742103155663947]
|
1,803.04609
|
Rational Approximation in the Bergman Spaces
|
It is known that adaptive Fourier decomposition (AFD) offers efficient
rational approxima- tions to functions in the classical Hardy H2 spaces with
significant applications. This study aims at rational approximation in Bergman,
and more widely, in weighted Bergman spaces, the functions of which have more
singularity than those in the Hardy spaces. Due to lack of an effective inner
function theory, direct adaptation of the Hardy-space AFD is not performable.
We, however, show that a pre-orthogonal method, being equivalent to AFD in the
classical cases, is available for all weighted Bergman spaces. The theory in
the Bergman spaces has equal force as AFD in the Hardy spaces. The methodology
of approximation is via constructing the rational orthogonal systems of the
Bergman type spaces, called Bergman space rational orthog- onal (BRO) system,
that have the same role as the Takennaka-Malmquist (TM) system in the Hardy
spaces. Subsequently, we prove a certain type direct sum decomposition of the
Bergman spaces that reveals the orthogonal complement relation between the span
of the BRO system and the zero-based invariant spaces. We provide a sequence of
examples with different and ex- plicit singularities at the boundary along with
a study on the inclusion relations of the weighted Bergman spaces. We finally
present illustrative examples for effectiveness of the approximation.
|
math.FA
|
it is known that adaptive fourier decomposition afd offers efficient rational approxima tions to functions in the classical hardy h2 spaces with significant applications this study aims at rational approximation in bergman and more widely in weighted bergman spaces the functions of which have more singularity than those in the hardy spaces due to lack of an effective inner function theory direct adaptation of the hardyspace afd is not performable we however show that a preorthogonal method being equivalent to afd in the classical cases is available for all weighted bergman spaces the theory in the bergman spaces has equal force as afd in the hardy spaces the methodology of approximation is via constructing the rational orthogonal systems of the bergman type spaces called bergman space rational orthog onal bro system that have the same role as the takennakamalmquist tm system in the hardy spaces subsequently we prove a certain type direct sum decomposition of the bergman spaces that reveals the orthogonal complement relation between the span of the bro system and the zerobased invariant spaces we provide a sequence of examples with different and ex plicit singularities at the boundary along with a study on the inclusion relations of the weighted bergman spaces we finally present illustrative examples for effectiveness of the approximation
|
[['it', 'is', 'known', 'that', 'adaptive', 'fourier', 'decomposition', 'afd', 'offers', 'efficient', 'rational', 'approxima', 'tions', 'to', 'functions', 'in', 'the', 'classical', 'hardy', 'h2', 'spaces', 'with', 'significant', 'applications', 'this', 'study', 'aims', 'at', 'rational', 'approximation', 'in', 'bergman', 'and', 'more', 'widely', 'in', 'weighted', 'bergman', 'spaces', 'the', 'functions', 'of', 'which', 'have', 'more', 'singularity', 'than', 'those', 'in', 'the', 'hardy', 'spaces', 'due', 'to', 'lack', 'of', 'an', 'effective', 'inner', 'function', 'theory', 'direct', 'adaptation', 'of', 'the', 'hardyspace', 'afd', 'is', 'not', 'performable', 'we', 'however', 'show', 'that', 'a', 'preorthogonal', 'method', 'being', 'equivalent', 'to', 'afd', 'in', 'the', 'classical', 'cases', 'is', 'available', 'for', 'all', 'weighted', 'bergman', 'spaces', 'the', 'theory', 'in', 'the', 'bergman', 'spaces', 'has', 'equal', 'force', 'as', 'afd', 'in', 'the', 'hardy', 'spaces', 'the', 'methodology', 'of', 'approximation', 'is', 'via', 'constructing', 'the', 'rational', 'orthogonal', 'systems', 'of', 'the', 'bergman', 'type', 'spaces', 'called', 'bergman', 'space', 'rational', 'orthog', 'onal', 'bro', 'system', 'that', 'have', 'the', 'same', 'role', 'as', 'the', 'takennakamalmquist', 'tm', 'system', 'in', 'the', 'hardy', 'spaces', 'subsequently', 'we', 'prove', 'a', 'certain', 'type', 'direct', 'sum', 'decomposition', 'of', 'the', 'bergman', 'spaces', 'that', 'reveals', 'the', 'orthogonal', 'complement', 'relation', 'between', 'the', 'span', 'of', 'the', 'bro', 'system', 'and', 'the', 'zerobased', 'invariant', 'spaces', 'we', 'provide', 'a', 'sequence', 'of', 'examples', 'with', 'different', 'and', 'ex', 'plicit', 'singularities', 'at', 'the', 'boundary', 'along', 'with', 'a', 'study', 'on', 'the', 'inclusion', 'relations', 'of', 'the', 'weighted', 'bergman', 'spaces', 'we', 'finally', 'present', 'illustrative', 'examples', 'for', 'effectiveness', 'of', 'the', 'approximation']]
|
[-0.1148716492823356, 0.05284889169117067, -0.07851095482159706, 0.11843472755330911, -0.07189477179464288, -0.05200066324764801, 0.006049008863995744, 0.39231691703694693, -0.27428971722024664, -0.15796321353950135, 0.13836062529954124, -0.2461569289701949, -0.197760822224956, 0.21499352107680805, -0.09365301168859182, 0.03518443677620742, 0.024880436039419394, 0.040354328336093745, -0.16741175637293554, -0.257892256966029, 0.40660183332635363, 0.016830618303463357, 0.24419463228575566, 0.027996319134265042, 0.06290836536912557, 0.020509191065964893, -0.042970345419847025, -0.05021655906310728, -0.16641988318870882, 0.15689546985869512, 0.2718682512287845, 0.10987777119806981, 0.318766513870261, -0.3732219972930213, -0.1930478181793703, 0.18837095147894775, 0.15427157303133, -0.049888562588175644, 0.009143118004913782, -0.2581709796492169, 0.02493600574017489, -0.12582331372952416, -0.11362428677718539, -0.12848653732876236, 0.008490701625344313, 0.06185345133044867, -0.2847989845813486, 0.02954946287675381, 0.08926851764515537, 0.0617635865978261, -0.1524107748547666, -0.12008899000034143, 0.001420657143826592, 0.08978460490139713, -0.019317190372495432, 0.09496246208754033, 0.04915363742347577, -0.04945637007967803, -0.11704519025593008, 0.34950111023265146, -0.07485276162112628, -0.2578967601961293, 0.15455846213934263, -0.1721395134343214, -0.09986477967470848, 0.10286387047946664, 0.10299800831595021, 0.16282004533584948, -0.05843999038474696, 0.1315192016521888, -0.08513717888606165, 0.07597008036610657, 0.10203810555692674, 0.06428791561177204, 0.07480534625138152, 0.11689489374987745, 0.11537671521674595, 0.16210856594661718, -0.022910285480397696, -0.11220318152954342, -0.3024200854063811, -0.18706655107610703, -0.16248232152112163, 0.014267624789582437, -0.14142994382767662, -0.22104872397248637, 0.341038457941158, 0.06305103593448538, 0.16963589831996903, 0.08691028904079313, 0.26367023993301164, 0.07617823623884382, 0.06890235450869135, 0.04218782082650263, 0.2248906142197514, 0.17948562295343815, 0.07986499135872412, -0.18878049889945764, 0.02136319653672868, 0.21652634705800863]
|
1,803.0461
|
Target Driven Instance Detection
|
While state-of-the-art general object detectors are getting better and
better, there are not many systems specifically designed to take advantage of
the instance detection problem. For many applications, such as household
robotics, a system may need to recognize a few very specific instances at a
time. Speed can be critical in these applications, as can the need to recognize
previously unseen instances. We introduce a Target Driven Instance
Detector(TDID), which modifies existing general object detectors for the
instance recognition setting. TDID not only improves performance on instances
seen during training, with a fast runtime, but is also able to generalize to
detect novel instances.
|
cs.CV
|
while stateoftheart general object detectors are getting better and better there are not many systems specifically designed to take advantage of the instance detection problem for many applications such as household robotics a system may need to recognize a few very specific instances at a time speed can be critical in these applications as can the need to recognize previously unseen instances we introduce a target driven instance detectortdid which modifies existing general object detectors for the instance recognition setting tdid not only improves performance on instances seen during training with a fast runtime but is also able to generalize to detect novel instances
|
[['while', 'stateoftheart', 'general', 'object', 'detectors', 'are', 'getting', 'better', 'and', 'better', 'there', 'are', 'not', 'many', 'systems', 'specifically', 'designed', 'to', 'take', 'advantage', 'of', 'the', 'instance', 'detection', 'problem', 'for', 'many', 'applications', 'such', 'as', 'household', 'robotics', 'a', 'system', 'may', 'need', 'to', 'recognize', 'a', 'few', 'very', 'specific', 'instances', 'at', 'a', 'time', 'speed', 'can', 'be', 'critical', 'in', 'these', 'applications', 'as', 'can', 'the', 'need', 'to', 'recognize', 'previously', 'unseen', 'instances', 'we', 'introduce', 'a', 'target', 'driven', 'instance', 'detectortdid', 'which', 'modifies', 'existing', 'general', 'object', 'detectors', 'for', 'the', 'instance', 'recognition', 'setting', 'tdid', 'not', 'only', 'improves', 'performance', 'on', 'instances', 'seen', 'during', 'training', 'with', 'a', 'fast', 'runtime', 'but', 'is', 'also', 'able', 'to', 'generalize', 'to', 'detect', 'novel', 'instances']]
|
[-0.04804953238407524, 0.04376234758791386, -0.04422290113243256, 0.0985551178078715, -0.17155580428958522, -0.24546596890443242, 0.011172332344394104, 0.4276340770462126, -0.2504619765323678, -0.4058467715467308, 0.11990515843796197, -0.23855018629646843, -0.13616996495893188, 0.2787522759982476, -0.17855474130506171, 0.08801778838695849, 0.13237978416088714, 0.0950590032769148, -0.05906444853719543, -0.2816512062301056, 0.25750970757137254, 0.03293481590591517, 0.2510385066088216, 0.042643624735658296, 0.0894734978894977, -0.05223730844034649, 0.04412702098032277, 0.048160486731349546, 0.004819115644375629, 0.09745578202030931, 0.367747571428909, 0.18309512754957027, 0.29637305418431176, -0.4179145297692979, -0.2541961794006912, 0.16537665774790095, 0.17153264594939993, 0.1480631801635301, -0.05287377046553564, -0.32646484955159183, 0.1066100711331648, -0.15724355532952092, -0.04560291859567823, -0.14592697816289157, 0.01710527156497918, -0.0006783082379329511, -0.26851668526582856, -0.01930144861341664, 0.09328720297244396, -0.009776839835788398, -0.041512274510893676, -0.09576670187365666, 0.09648649331510943, 0.19732451137593565, 0.013858363669201294, 0.042281150028073027, 0.15902226921353563, -0.18567667157827494, -0.13345179162741475, 0.4159889372029141, -0.007433059075208125, -0.203913182029318, 0.2927531065195616, -0.07490404614466517, -0.18314113011172808, 0.13001532140347705, 0.23650519648457274, 0.15122333368943894, -0.15891309901524117, -0.008139095589285716, -0.020475011930673147, 0.21048562049719632, 0.08428437369829957, 0.020096398850072028, 0.1956743581435077, 0.2062335059813717, 0.09763742826465864, 0.16263397955723727, -0.11443187217638992, -0.048326146122360344, -0.22006199820031064, -0.1150109670124948, -0.15030495644382694, -0.009541250924824043, -0.05594150070543287, -0.1405556016925759, 0.3725095711392807, 0.23601520508336585, 0.19273407994449943, 0.08933516245622955, 0.3160268891164485, 0.05570879174332481, 0.1445179495175241, 0.09167637554449304, 0.1942728247673835, -0.05511777676806292, 0.14432732971823392, -0.11363351227277342, 0.13858515761482218, 0.012765165792741612]
|
1,803.04611
|
Bohr's Complementarity: Completed with Entanglement
|
Ninety years ago in 1927, at an international congress in Como, Italy, Niels
Bohr gave an address which is recognized as the first instance in which the
term "complementarity", as a physical concept, was spoken publicly [1],
revealing Bohr's own thinking about Louis de Broglie's "duality". Bohr had very
slowly accepted duality as a principle of physics: close observation of any
quantum object will reveal either wave-like or particle-like behavior, one or
the other of two fundamental and complementary features. Little disagreement
exists today about complementarity's importance and broad applicability in
quantum science. Book-length scholarly examinations even provide speculations
about the relevance of complementarity in fields as different from physics as
biology, psychology and social anthropology, connections which were apparently
of interest to Bohr himself (see Jammer [2], Murdoch [3] and Whitaker [4]).
Confusion evident in Como following his talk was not eliminated by Bohr's
article [1], and complementarity has been subjected to nine decades of repeated
examination ever since with no agreed resolution. Semi-popular treatments [5]
as well as expert examinations [6-9] show that the topic cannot be avoided, and
complementarity retains its central place in the interpretation of quantum
mechanics. However, recent approaches by our group [10-13] and others [14-20]
to the underlying notion of coherence now allow us to present a universal
formulation of complementarity that may signal the end to the confusion. We
demonstrate a new relationship that constrains the behavior of an
electromagnetic field (quantum or classical) in the fundamental context of
two-slit experiments. We show that entanglement is the ingredient needed to
complete Bohr's formulation of complementarity, debated for decades because of
its incompleteness.
|
quant-ph physics.hist-ph physics.optics
|
ninety years ago in 1927 at an international congress in como italy niels bohr gave an address which is recognized as the first instance in which the term complementarity as a physical concept was spoken publicly 1 revealing bohrs own thinking about louis de broglies duality bohr had very slowly accepted duality as a principle of physics close observation of any quantum object will reveal either wavelike or particlelike behavior one or the other of two fundamental and complementary features little disagreement exists today about complementaritys importance and broad applicability in quantum science booklength scholarly examinations even provide speculations about the relevance of complementarity in fields as different from physics as biology psychology and social anthropology connections which were apparently of interest to bohr himself see jammer 2 murdoch 3 and whitaker 4 confusion evident in como following his talk was not eliminated by bohrs article 1 and complementarity has been subjected to nine decades of repeated examination ever since with no agreed resolution semipopular treatments 5 as well as expert examinations 69 show that the topic cannot be avoided and complementarity retains its central place in the interpretation of quantum mechanics however recent approaches by our group 1013 and others 1420 to the underlying notion of coherence now allow us to present a universal formulation of complementarity that may signal the end to the confusion we demonstrate a new relationship that constrains the behavior of an electromagnetic field quantum or classical in the fundamental context of twoslit experiments we show that entanglement is the ingredient needed to complete bohrs formulation of complementarity debated for decades because of its incompleteness
|
[['ninety', 'years', 'ago', 'in', '1927', 'at', 'an', 'international', 'congress', 'in', 'como', 'italy', 'niels', 'bohr', 'gave', 'an', 'address', 'which', 'is', 'recognized', 'as', 'the', 'first', 'instance', 'in', 'which', 'the', 'term', 'complementarity', 'as', 'a', 'physical', 'concept', 'was', 'spoken', 'publicly', '1', 'revealing', 'bohrs', 'own', 'thinking', 'about', 'louis', 'de', 'broglies', 'duality', 'bohr', 'had', 'very', 'slowly', 'accepted', 'duality', 'as', 'a', 'principle', 'of', 'physics', 'close', 'observation', 'of', 'any', 'quantum', 'object', 'will', 'reveal', 'either', 'wavelike', 'or', 'particlelike', 'behavior', 'one', 'or', 'the', 'other', 'of', 'two', 'fundamental', 'and', 'complementary', 'features', 'little', 'disagreement', 'exists', 'today', 'about', 'complementaritys', 'importance', 'and', 'broad', 'applicability', 'in', 'quantum', 'science', 'booklength', 'scholarly', 'examinations', 'even', 'provide', 'speculations', 'about', 'the', 'relevance', 'of', 'complementarity', 'in', 'fields', 'as', 'different', 'from', 'physics', 'as', 'biology', 'psychology', 'and', 'social', 'anthropology', 'connections', 'which', 'were', 'apparently', 'of', 'interest', 'to', 'bohr', 'himself', 'see', 'jammer', '2', 'murdoch', '3', 'and', 'whitaker', '4', 'confusion', 'evident', 'in', 'como', 'following', 'his', 'talk', 'was', 'not', 'eliminated', 'by', 'bohrs', 'article', '1', 'and', 'complementarity', 'has', 'been', 'subjected', 'to', 'nine', 'decades', 'of', 'repeated', 'examination', 'ever', 'since', 'with', 'no', 'agreed', 'resolution', 'semipopular', 'treatments', '5', 'as', 'well', 'as', 'expert', 'examinations', '69', 'show', 'that', 'the', 'topic', 'can', 'not', 'be', 'avoided', 'and', 'complementarity', 'retains', 'its', 'central', 'place', 'in', 'the', 'interpretation', 'of', 'quantum', 'mechanics', 'however', 'recent', 'approaches', 'by', 'our', 'group', '1013', 'and', 'others', '1420', 'to', 'the', 'underlying', 'notion', 'of', 'coherence', 'now', 'allow', 'us', 'to', 'present', 'a', 'universal', 'formulation', 'of', 'complementarity', 'that', 'may', 'signal', 'the', 'end', 'to', 'the', 'confusion', 'we', 'demonstrate', 'a', 'new', 'relationship', 'that', 'constrains', 'the', 'behavior', 'of', 'an', 'electromagnetic', 'field', 'quantum', 'or', 'classical', 'in', 'the', 'fundamental', 'context', 'of', 'twoslit', 'experiments', 'we', 'show', 'that', 'entanglement', 'is', 'the', 'ingredient', 'needed', 'to', 'complete', 'bohrs', 'formulation', 'of', 'complementarity', 'debated', 'for', 'decades', 'because', 'of', 'its', 'incompleteness']]
|
[-0.07087771687484173, 0.10078656130650349, -0.11227295837727272, 0.1202831239922455, -0.12892355150370685, -0.17121791403257736, 0.029213708806438025, 0.31863023769110443, -0.2266468372371121, -0.3512045873001356, 0.09871649184885124, -0.2934606036602485, -0.15730832797664873, 0.17849989751681547, -0.11889144529898961, 0.012027899218999126, 0.040474109483141174, 0.05416725925439365, -0.049641691535901, -0.2449409291593097, 0.2782745475660906, 0.11000526487499614, 0.2828718806940338, 0.09288001471472349, 0.10656698147585202, 0.031168327314986123, -0.04035812261238418, 0.007334193423459375, -0.1042800481488316, 0.10616473072311944, 0.30842394568026066, 0.21046599995439735, 0.33841945380662325, -0.42354826280778207, -0.2034836909017974, 0.05033653979707095, 0.11707394715157096, 0.08581963551480806, -0.037686467497971735, -0.30749541925680307, 0.0040986512822133525, -0.1694870201939786, -0.12493538572776339, -0.023584637688731567, 0.07235287177695514, -0.04798016899892698, -0.13662668931539412, 0.08266982844496076, 0.08918551814966594, 0.10692843908564774, -0.014759104154331402, -0.13460653020689886, 0.04873535185578038, 0.13433763167682897, 0.06918358195323014, 0.047810070348593095, 0.09951787641254702, -0.1278605654645987, -0.19132000266884763, 0.40269503165726306, -0.0009601551872980996, -0.09880201828976472, 0.20292592362880155, -0.15374885632837604, -0.15106582671481494, 0.0653508767908163, 0.0701671275637906, 0.062617711977671, -0.1322599014271637, 0.07677915286018375, -0.05888890472965108, 0.19228366536122782, 0.1350307891516153, 0.04676973182682155, 0.266087075647967, 0.12358527618149916, 0.004045931464578542, 0.04683206291261336, -0.033327237733950216, -0.14305708372137613, -0.28163684130887745, -0.16954304366221618, -0.16156928323174793, 0.10576446438219002, -0.008188329863844922, -0.09496124987490476, 0.3180290424230474, 0.17419927808546667, 0.14715117693585517, -0.024911261945898232, 0.2265645778043782, 0.031494989159034086, 0.04466945891510005, 0.005066179032696204, 0.3116499800692071, 0.15098743876011145, 0.15210346180117792, -0.14701422031050446, 0.06396010478018542, 0.031219800008478127]
|
1,803.04612
|
Procedural Planetary Multi-resolution Terrain Generation for Games
|
Terrains are the main part of an electronic game. To reduce human effort on
game development, procedural techniques are used to generate synthetic
terrains. However rendering a terrain is not a trivial task. Their rendering
techniques must be optimal for gaming. Specially planetary terrains, which must
account for precision and scale conversion. Multi-resolution models are best
fit to planetary terrains. An observer can change his point of view without
noticing any decrease in visual quality. There are several proposals regarding
real-time terrain rendering with multi-resolution models, and there are game
engines capable of generating large scale terrains with fixed resolution.
However for the best of our knowledge, it was noticed that there are no
techniques which combine both aspects. In this paper we present a new technique
capable of generating large-scale multi-resolution terrains, whichcan be
rendered and viewed at different scales. Rendering large scale models with high
definition and low scale areas with finer details added with the aid of
procedural content generation.
|
cs.GR
|
terrains are the main part of an electronic game to reduce human effort on game development procedural techniques are used to generate synthetic terrains however rendering a terrain is not a trivial task their rendering techniques must be optimal for gaming specially planetary terrains which must account for precision and scale conversion multiresolution models are best fit to planetary terrains an observer can change his point of view without noticing any decrease in visual quality there are several proposals regarding realtime terrain rendering with multiresolution models and there are game engines capable of generating large scale terrains with fixed resolution however for the best of our knowledge it was noticed that there are no techniques which combine both aspects in this paper we present a new technique capable of generating largescale multiresolution terrains whichcan be rendered and viewed at different scales rendering large scale models with high definition and low scale areas with finer details added with the aid of procedural content generation
|
[['terrains', 'are', 'the', 'main', 'part', 'of', 'an', 'electronic', 'game', 'to', 'reduce', 'human', 'effort', 'on', 'game', 'development', 'procedural', 'techniques', 'are', 'used', 'to', 'generate', 'synthetic', 'terrains', 'however', 'rendering', 'a', 'terrain', 'is', 'not', 'a', 'trivial', 'task', 'their', 'rendering', 'techniques', 'must', 'be', 'optimal', 'for', 'gaming', 'specially', 'planetary', 'terrains', 'which', 'must', 'account', 'for', 'precision', 'and', 'scale', 'conversion', 'multiresolution', 'models', 'are', 'best', 'fit', 'to', 'planetary', 'terrains', 'an', 'observer', 'can', 'change', 'his', 'point', 'of', 'view', 'without', 'noticing', 'any', 'decrease', 'in', 'visual', 'quality', 'there', 'are', 'several', 'proposals', 'regarding', 'realtime', 'terrain', 'rendering', 'with', 'multiresolution', 'models', 'and', 'there', 'are', 'game', 'engines', 'capable', 'of', 'generating', 'large', 'scale', 'terrains', 'with', 'fixed', 'resolution', 'however', 'for', 'the', 'best', 'of', 'our', 'knowledge', 'it', 'was', 'noticed', 'that', 'there', 'are', 'no', 'techniques', 'which', 'combine', 'both', 'aspects', 'in', 'this', 'paper', 'we', 'present', 'a', 'new', 'technique', 'capable', 'of', 'generating', 'largescale', 'multiresolution', 'terrains', 'whichcan', 'be', 'rendered', 'and', 'viewed', 'at', 'different', 'scales', 'rendering', 'large', 'scale', 'models', 'with', 'high', 'definition', 'and', 'low', 'scale', 'areas', 'with', 'finer', 'details', 'added', 'with', 'the', 'aid', 'of', 'procedural', 'content', 'generation']]
|
[-0.06173845096548766, 0.10245512284063245, -0.09773745687597972, 0.08687813945450923, -0.12355155376200047, -0.14625808559925824, -0.009592420382017016, 0.41560397308641744, -0.2620255411947491, -0.4026675611090513, 0.14252651386957524, -0.23768405431276474, -0.15073804592248052, 0.22199346239241646, -0.16146042266354702, 0.06490288891852546, 0.0955952441457797, -0.04377237405558979, -0.016422190397322452, -0.23497791981531513, 0.29064145216568843, 0.07304250999974708, 0.25351581863346107, 0.03692309180975972, 0.11011452283307818, -0.05278462021076983, -0.062286687613878816, 0.03140485895521663, -0.07382941296789257, 0.12075095512490305, 0.31471459067264124, 0.17874757267454247, 0.2749747811402712, -0.47026442482285663, -0.22577645711566288, 0.10699622230431824, 0.13376995810181086, 0.10714588038203662, -0.08124934727351905, -0.2839245456788275, 0.11028685550964265, -0.11908779657204394, -0.07744269085944527, -0.11393494319377674, 0.0012809223506921603, -0.007534045263841063, -0.26858114830885127, -0.028298983882169847, 0.026675020620502806, 0.137127122324374, -0.04695719093756957, -0.1155055741187369, -0.0008009647229042502, 0.21841625881059396, 0.013923259413180252, 0.0385902483895835, 0.1397054711695226, -0.17650952376676782, -0.12820952979525851, 0.4340139711275697, 0.005736640778105752, -0.20831884436573786, 0.23859530587876102, -0.07896735867266946, -0.13063415230243225, 0.15608393491452766, 0.17038420410855548, 0.10160348326237988, -0.11758817549231519, 0.05310217161496877, -0.004938850713962758, 0.21617574872895298, 0.07117628320235253, 0.01487975759808273, 0.26544716295406773, 0.20424166967069018, 0.09761564620126637, 0.07034621098406475, -0.08906323472354101, -0.09400492957735687, -0.22649314585084349, -0.09441948332823813, -0.14556524822097502, -0.03855128377310595, -0.11335825266706022, -0.16010712968784868, 0.3363419502260692, 0.21161674598898786, 0.18278452726138503, 0.08437344852265799, 0.34149971829704295, 0.05268927126401392, 0.10015347870038017, 0.07900216451373215, 0.15929195017447512, -0.025654066135577948, 0.14984348859568988, -0.13662429603555434, 0.10333227085087586, 0.031035866535176742]
|
1,803.04613
|
Application BMO type space to parabolic equations of Navier-Stokes type
with the Neumann boundary condition
|
Let $L$ be a Neumann operator of the form $L=-\Delta_{N}$ acting on
$L^2(\mathbb R^n)$. Let ${BMO}_{\Delta_{N}}(\mathbb R^n)$ denote the BMO space
on $\mathbb R^n$ associated to the Neumann operator $\L$. In this article we
will show that a function $f\in { BMO}_{\Delta_{N}}(\mathbb R^n)$ is the trace
of the solution of $${\mathbb L}u=u_{t}+L u=0, u(x,0)= f(x),$$
where $u$ satisfies a Carleson-type condition \begin{eqnarray*}
\sup_{x_B, r_B} r_B^{-n}\int_0^{r_B^2}\int_{B(x_B, r_B)} |\nabla u(x,t)|^2
{dx dt } \leq C <\infty, \end{eqnarray*} for some constant $C>0$. Conversely,
this Carleson condition characterizes all the ${\mathbb L}$-carolic functions
whose traces belong to the space ${BMO}_{\Delta_{N}}(\mathbb R^n)$. This result
extends the analogous characterization founded by E. Fabes and U. Neri in
({Duke Math. J.} {42} (1975), 725-734) for the classical BMO space of John and
Nirenberg. Furthermore, based on the characterization of
${BMO}_{\Delta_{N}}(\mathbb R^n)$ space mentioned above, we prove global
well-posedness for parabolic equations of Navier-Stokes type with the Neumann
boundary condition under smallness condition on intial data $u_{0}\in {{
BMO}_{\Delta_{N}}^{-1}(\mathbb R^n)}$, which is motivated by the work of P.
Auscher and D. Frey ({J. Inst. Math. Jussieu} {16(5)} (2017), 947-985).
|
math.AP
|
let l be a neumann operator of the form ldelta_n acting on l2mathbb rn let bmo_delta_nmathbb rn denote the bmo space on mathbb rn associated to the neumann operator l in this article we will show that a function fin bmo_delta_nmathbb rn is the trace of the solution of mathbb luu_tl u0 ux0 fx where u satisfies a carlesontype condition begineqnarray sup_x_b r_b r_bnint_0r_b2int_bx_b r_b nabla uxt2 dx dt leq c infty endeqnarray for some constant c0 conversely this carleson condition characterizes all the mathbb lcarolic functions whose traces belong to the space bmo_delta_nmathbb rn this result extends the analogous characterization founded by e fabes and u neri in duke math j 42 1975 725734 for the classical bmo space of john and nirenberg furthermore based on the characterization of bmo_delta_nmathbb rn space mentioned above we prove global wellposedness for parabolic equations of navierstokes type with the neumann boundary condition under smallness condition on intial data u_0in bmo_delta_n1mathbb rn which is motivated by the work of p auscher and d frey j inst math jussieu 165 2017 947985
|
[['let', 'l', 'be', 'a', 'neumann', 'operator', 'of', 'the', 'form', 'ldelta_n', 'acting', 'on', 'l2mathbb', 'rn', 'let', 'bmo_delta_nmathbb', 'rn', 'denote', 'the', 'bmo', 'space', 'on', 'mathbb', 'rn', 'associated', 'to', 'the', 'neumann', 'operator', 'l', 'in', 'this', 'article', 'we', 'will', 'show', 'that', 'a', 'function', 'fin', 'bmo_delta_nmathbb', 'rn', 'is', 'the', 'trace', 'of', 'the', 'solution', 'of', 'mathbb', 'luu_tl', 'u0', 'ux0', 'fx', 'where', 'u', 'satisfies', 'a', 'carlesontype', 'condition', 'begineqnarray', 'sup_x_b', 'r_b', 'r_bnint_0r_b2int_bx_b', 'r_b', 'nabla', 'uxt2', 'dx', 'dt', 'leq', 'c', 'infty', 'endeqnarray', 'for', 'some', 'constant', 'c0', 'conversely', 'this', 'carleson', 'condition', 'characterizes', 'all', 'the', 'mathbb', 'lcarolic', 'functions', 'whose', 'traces', 'belong', 'to', 'the', 'space', 'bmo_delta_nmathbb', 'rn', 'this', 'result', 'extends', 'the', 'analogous', 'characterization', 'founded', 'by', 'e', 'fabes', 'and', 'u', 'neri', 'in', 'duke', 'math', 'j', '42', '1975', '725734', 'for', 'the', 'classical', 'bmo', 'space', 'of', 'john', 'and', 'nirenberg', 'furthermore', 'based', 'on', 'the', 'characterization', 'of', 'bmo_delta_nmathbb', 'rn', 'space', 'mentioned', 'above', 'we', 'prove', 'global', 'wellposedness', 'for', 'parabolic', 'equations', 'of', 'navierstokes', 'type', 'with', 'the', 'neumann', 'boundary', 'condition', 'under', 'smallness', 'condition', 'on', 'intial', 'data', 'u_0in', 'bmo_delta_n1mathbb', 'rn', 'which', 'is', 'motivated', 'by', 'the', 'work', 'of', 'p', 'auscher', 'and', 'd', 'frey', 'j', 'inst', 'math', 'jussieu', '165', '2017', '947985']]
|
[-0.1732670779036748, 0.05392188641518831, -0.00020413057266756198, -0.01653371078062391, -0.10487194277930241, -0.16406774963793713, -0.0385684349247915, 0.2382338400984313, -0.3016284228557028, -0.12243275813958716, 0.15801019693229368, -0.3428938933973049, -0.04796527236494301, 0.1886592495829127, -0.15597113306352564, 0.0611759971415754, 0.014793795477301098, 0.03679335288917321, -0.09841424707194038, -0.22601785080583203, 0.3558227979242368, -0.11837824885625133, 0.1704166609239575, 0.061460643054763134, 0.05969216774263809, 0.015850407151277935, 0.025414504265131126, -0.0741032407948, -0.31604939553133504, 0.060196169815838425, 0.20147050408846806, 0.11140121086189242, 0.30708265215764907, -0.3528433130339308, -0.15511594949435506, 0.22970960958627984, 0.1004602914746461, -0.1637812781609259, 0.05005856099684701, -0.3825093774547324, 0.08790751140859779, -0.06426827774415615, -0.18304072970762675, -0.018739441478744064, 0.15712843434939291, 0.050676382141361054, -0.41959697815459657, 0.15444403182888447, 0.15657575868021392, 0.05552334105595946, -0.1697900552521893, -0.1709666347894601, -0.0756358808058119, -0.037219509303699744, -0.05822528041709691, 0.2237207950417732, 0.02319583204185027, 0.01192792316730849, -0.0021857231270608515, 0.3215943068471672, -0.09947269033101863, -0.24156438658923604, 0.07363859815983274, -0.22879591466165905, -0.1241533208860431, 0.010153842513953053, 0.0934678936501705, 0.16877723938709688, -0.09683627531008232, 0.34107644775196055, -0.13135665114261724, 0.08508254349675723, 0.1771028080771049, -0.007731384877250854, -0.013857007381332996, 0.03438869221027681, 0.12437845052620612, 0.07550617884289539, -0.009929328804245479, 0.008304861406687387, -0.41622099395419015, -0.166720041628862, -0.17896988240021908, 0.20488888775621172, -0.07640443458792084, -0.11326547641696971, 0.23846588753905623, 0.05297078320121685, 0.186975316225746, 0.09922168610095003, 0.10309679328117433, 0.09455566533278068, -0.03220520674408045, 0.13551356609241338, 0.0770151648586846, 0.1875721202908777, 0.16577499711664048, -0.19968020712529028, -0.01978030580713219, 0.243953061165548]
|
1,803.04614
|
Exploring the Distributed Video Coding in a Quality Assessment Context
|
In the popular video coding trend, the encoder has the task to exploit both
spatial and temporal redundancies present in the video sequence, which is a
complex procedure. As a result almost all video encoders have five to ten times
more complexity than their decoders. In a video compression process, one of the
main tasks at the encoder side is motion estimation which is to extract the
temporal correlation between frames. Distributed video coding (DVC) proposed
the idea that can lead to low complexity encoders and higher complexity
decoders. DVC is a new paradigm in video compression based on the information
theoretic ideas of Slepian-Wolf and Wyner-Ziv theorems. Wyner-Ziv coding is
naturally robust against transmission errors and can be used for joint source
and channel coding. Side Information is one of the key components of the
Wyner-Ziv decoder. Better side information generation will result in better
functionality of Wyner-Ziv coder. In this paper we proposed a new method that
can generate side information with a better quality and thus better
compression. We have used HVS (human visual system) based image quality metrics
as our quality criterion. The motion estimation we used in the decoder is
modified due to these metrics such that we could obtain finer side information.
The motion compensation is optimized for perceptual quality metrics and leads
to better side information generation compared to con- ventional MSE (mean
squared error) or SAD (sum of absolute difference) based motion compensation
currently used in the literature. Better motion compensation means better
compression.
|
eess.IV
|
in the popular video coding trend the encoder has the task to exploit both spatial and temporal redundancies present in the video sequence which is a complex procedure as a result almost all video encoders have five to ten times more complexity than their decoders in a video compression process one of the main tasks at the encoder side is motion estimation which is to extract the temporal correlation between frames distributed video coding dvc proposed the idea that can lead to low complexity encoders and higher complexity decoders dvc is a new paradigm in video compression based on the information theoretic ideas of slepianwolf and wynerziv theorems wynerziv coding is naturally robust against transmission errors and can be used for joint source and channel coding side information is one of the key components of the wynerziv decoder better side information generation will result in better functionality of wynerziv coder in this paper we proposed a new method that can generate side information with a better quality and thus better compression we have used hvs human visual system based image quality metrics as our quality criterion the motion estimation we used in the decoder is modified due to these metrics such that we could obtain finer side information the motion compensation is optimized for perceptual quality metrics and leads to better side information generation compared to con ventional mse mean squared error or sad sum of absolute difference based motion compensation currently used in the literature better motion compensation means better compression
|
[['in', 'the', 'popular', 'video', 'coding', 'trend', 'the', 'encoder', 'has', 'the', 'task', 'to', 'exploit', 'both', 'spatial', 'and', 'temporal', 'redundancies', 'present', 'in', 'the', 'video', 'sequence', 'which', 'is', 'a', 'complex', 'procedure', 'as', 'a', 'result', 'almost', 'all', 'video', 'encoders', 'have', 'five', 'to', 'ten', 'times', 'more', 'complexity', 'than', 'their', 'decoders', 'in', 'a', 'video', 'compression', 'process', 'one', 'of', 'the', 'main', 'tasks', 'at', 'the', 'encoder', 'side', 'is', 'motion', 'estimation', 'which', 'is', 'to', 'extract', 'the', 'temporal', 'correlation', 'between', 'frames', 'distributed', 'video', 'coding', 'dvc', 'proposed', 'the', 'idea', 'that', 'can', 'lead', 'to', 'low', 'complexity', 'encoders', 'and', 'higher', 'complexity', 'decoders', 'dvc', 'is', 'a', 'new', 'paradigm', 'in', 'video', 'compression', 'based', 'on', 'the', 'information', 'theoretic', 'ideas', 'of', 'slepianwolf', 'and', 'wynerziv', 'theorems', 'wynerziv', 'coding', 'is', 'naturally', 'robust', 'against', 'transmission', 'errors', 'and', 'can', 'be', 'used', 'for', 'joint', 'source', 'and', 'channel', 'coding', 'side', 'information', 'is', 'one', 'of', 'the', 'key', 'components', 'of', 'the', 'wynerziv', 'decoder', 'better', 'side', 'information', 'generation', 'will', 'result', 'in', 'better', 'functionality', 'of', 'wynerziv', 'coder', 'in', 'this', 'paper', 'we', 'proposed', 'a', 'new', 'method', 'that', 'can', 'generate', 'side', 'information', 'with', 'a', 'better', 'quality', 'and', 'thus', 'better', 'compression', 'we', 'have', 'used', 'hvs', 'human', 'visual', 'system', 'based', 'image', 'quality', 'metrics', 'as', 'our', 'quality', 'criterion', 'the', 'motion', 'estimation', 'we', 'used', 'in', 'the', 'decoder', 'is', 'modified', 'due', 'to', 'these', 'metrics', 'such', 'that', 'we', 'could', 'obtain', 'finer', 'side', 'information', 'the', 'motion', 'compensation', 'is', 'optimized', 'for', 'perceptual', 'quality', 'metrics', 'and', 'leads', 'to', 'better', 'side', 'information', 'generation', 'compared', 'to', 'con', 'ventional', 'mse', 'mean', 'squared', 'error', 'or', 'sad', 'sum', 'of', 'absolute', 'difference', 'based', 'motion', 'compensation', 'currently', 'used', 'in', 'the', 'literature', 'better', 'motion', 'compensation', 'means', 'better', 'compression']]
|
[-0.10843695484026472, -0.008095588984100946, -0.13352459231724165, 0.09854266904127172, -0.10744819795815731, -0.21849273725427568, 0.024586166377308212, 0.44246747769463424, -0.2871413228456818, -0.2882603405575667, 0.1375426347737038, -0.2601256463381033, -0.168694721014213, 0.16920499368810968, -0.21601243672101567, 0.109186085096019, 0.062242523423813666, 0.0884767096768695, -0.08158409453666074, -0.29800450928243144, 0.2583675499957439, 0.10784280965278398, 0.3741855293157555, 0.013040067923222003, 0.11804387187730177, -0.0005555742989397711, -0.0376057902790813, -0.03360565685083173, -0.07025153267458668, 0.1731019502668272, 0.3017731132078177, 0.2023537827573443, 0.2688388407492774, -0.3746549902106857, -0.24268334647197098, 0.026395298387219625, 0.17060560281647164, 0.12685668064440261, -0.052832567944047726, -0.2864868028665937, 0.12671953193022914, -0.14780990162260077, 0.07382798640959201, -0.04518806562012446, -0.0677440159063461, -0.004061418503942337, -0.3162619537001269, 0.07507462849071811, 0.07990087638239539, 0.019668190483196034, -0.033724731527313236, -0.11728488383509796, 0.03852716066028243, 0.22064796510976664, 0.036404237586202, 0.10653726939049121, 0.11590408009526852, -0.13138933376675205, -0.1428615073514049, 0.3840506123739206, -0.07039883560234254, -0.24769747663762362, 0.16125377394662735, -0.06077553713250728, -0.09344725168517067, 0.15131669712718576, 0.22608686906899075, 0.07089767249375914, -0.15469904751594257, -0.06085376253054525, 0.01180835927112235, 0.2520615310881228, 0.11707620187440798, 0.12990732855969184, 0.16585470619796228, 0.18935960804718355, 0.08753209800843684, 0.15800846477421665, -0.12820300295124837, -0.0820993644671352, -0.2234833963323451, -0.12852276546791905, -0.17177629988642396, -0.046653755635253175, -0.15367014945346338, -0.10306456900526961, 0.35349609624845757, 0.18254681036896295, 0.13779683287868957, 0.08611981103765881, 0.4088121957204763, 0.048531471507250526, 0.07356865029682272, 0.11535865930809883, 0.18072476714391203, 0.08144117724464556, 0.11455201024803081, -0.159300583473865, 0.09304582002195752, 0.09782267501485342]
|
1,803.04615
|
Heat capacity and Mosssbauer study of Self flux grown FeTe Single
Crystal
|
We report mainly the heat capacity and Mossbauer study of self flux grown
FeTe single crystal, which is ground state compound of the Fe chalcogenides
superconducting series, i.e., FeTe1-x(Se/S)x. The as grown FeTe single crystal
is large enough to the tune of few cm and the same crystallizes in tetragonal
structure having space group of P4/nmm. FeTe shows the structural/magnetic
phase transition at 70K in both magnetic and resistivity measurements. Heat
capacity measurement also confirms the coupled structural/magnetic transition
at the same temperature. The Debye model fitting of low temperature (below 70K)
heat capacity exhibited Debye temperature to be 324K. M\"Ossbauer spectra are
performed at 300K and 5K. The 300K spectra showed two paramagnetic doublets and
the 5K spectra exhibited hyperfine magnetic sextet with an average hyperfine
field of 10.6Tesla matching with the results of Yoshikazu Mizuguchi et al.
|
cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el
|
we report mainly the heat capacity and mossbauer study of self flux grown fete single crystal which is ground state compound of the fe chalcogenides superconducting series ie fete1xsesx the as grown fete single crystal is large enough to the tune of few cm and the same crystallizes in tetragonal structure having space group of p4nmm fete shows the structuralmagnetic phase transition at 70k in both magnetic and resistivity measurements heat capacity measurement also confirms the coupled structuralmagnetic transition at the same temperature the debye model fitting of low temperature below 70k heat capacity exhibited debye temperature to be 324k mossbauer spectra are performed at 300k and 5k the 300k spectra showed two paramagnetic doublets and the 5k spectra exhibited hyperfine magnetic sextet with an average hyperfine field of 106tesla matching with the results of yoshikazu mizuguchi et al
|
[['we', 'report', 'mainly', 'the', 'heat', 'capacity', 'and', 'mossbauer', 'study', 'of', 'self', 'flux', 'grown', 'fete', 'single', 'crystal', 'which', 'is', 'ground', 'state', 'compound', 'of', 'the', 'fe', 'chalcogenides', 'superconducting', 'series', 'ie', 'fete1xsesx', 'the', 'as', 'grown', 'fete', 'single', 'crystal', 'is', 'large', 'enough', 'to', 'the', 'tune', 'of', 'few', 'cm', 'and', 'the', 'same', 'crystallizes', 'in', 'tetragonal', 'structure', 'having', 'space', 'group', 'of', 'p4nmm', 'fete', 'shows', 'the', 'structuralmagnetic', 'phase', 'transition', 'at', '70k', 'in', 'both', 'magnetic', 'and', 'resistivity', 'measurements', 'heat', 'capacity', 'measurement', 'also', 'confirms', 'the', 'coupled', 'structuralmagnetic', 'transition', 'at', 'the', 'same', 'temperature', 'the', 'debye', 'model', 'fitting', 'of', 'low', 'temperature', 'below', '70k', 'heat', 'capacity', 'exhibited', 'debye', 'temperature', 'to', 'be', '324k', 'mossbauer', 'spectra', 'are', 'performed', 'at', '300k', 'and', '5k', 'the', '300k', 'spectra', 'showed', 'two', 'paramagnetic', 'doublets', 'and', 'the', '5k', 'spectra', 'exhibited', 'hyperfine', 'magnetic', 'sextet', 'with', 'an', 'average', 'hyperfine', 'field', 'of', '106tesla', 'matching', 'with', 'the', 'results', 'of', 'yoshikazu', 'mizuguchi', 'et', 'al']]
|
[-0.1315327554596243, 0.255169817188828, 0.01172529880164398, -0.07246871004743433, -0.046004628729834046, -0.1601093243100439, 0.1313042083306721, 0.4280066953834008, -0.2404568392024548, -0.3299785263353476, -0.013895292362819115, -0.3886517381157588, 0.006237291056593811, 0.15941506617840517, 0.07905664419565626, 0.015070332895481476, -0.06240730467079966, 0.03832727749659507, -0.15754334521652372, -0.22407986823710854, 0.2679358294000849, 0.07867144492834255, 0.38554229621809943, 0.08074864383648943, 0.055494290638577054, -0.07850494768332553, 0.14496458406491136, 0.017336204623656898, -0.1350207319776355, -0.031103259152560323, 0.274660905022864, -0.109506035734106, 0.1065459077919109, -0.3603960239362937, -0.23415938672325057, 0.0028594503627607116, 0.06516489629047337, 0.08744868631992075, -0.048450232442054486, -0.23370185296430632, 0.044255790900852944, -0.09435876599616475, -0.04908379926863644, -0.11766087567364727, -0.09831362616667455, -0.04624268573501872, -0.23182288265347273, 0.1413056628483227, 0.045969469522781393, 0.19188798456970188, -0.16130448752255352, -0.20689813935163395, -0.08300339516804174, 0.052157401048612814, 0.041269554503917415, 0.07079445524658594, 0.1648997694115948, -0.04656579554839819, -0.06160810815032434, 0.3509407277490633, -0.09593036609391371, 0.06739855396940753, 0.12025916391328254, -0.2738181830763265, -0.1260925447947725, 0.247257395464651, 0.050020706342291776, 0.11415395823962711, -0.150962727127545, 0.07699462224328373, -0.015857676609798713, 0.25398356842084063, 0.07825690006354341, 0.04196020965981814, 0.18667188673452648, 0.18791880810426342, -0.059909499484907695, 0.18305435660208955, -0.15202687894408073, -0.007387038699299511, -0.1707839840885114, -0.17677038667930497, -0.20724624556972196, 0.058549496329699954, -0.10627745187752967, -0.19230079995813193, 0.3696907864849049, 0.0840846195920474, 0.20438957516517903, -0.06010866571062555, 0.22132671110125052, 0.06235897281483092, 0.06476995249761751, 0.08114838749429004, 0.2220444813232731, 0.2394534567543478, 0.20324188127717072, -0.34231981908281645, 0.0764722555772298, -0.008624471860282399]
|
1,803.04616
|
Calculation of multidimensional potential energy surfaces for even-even
transuranium nuclei: Systematic investigation of the triaxiality effect on
fission barrier
|
Static fission barriers for 95 even-even transuranium nuclei with charge
number $Z=94-118$ have been systematically investigated by means of pairing
self-consistent Woods-Saxon-Strutinsky calculations using the potential energy
surface approach in multidimensional ($\beta_2$, $\gamma$, $\beta_4$)
deformation space. Taking the heavier $^{252}$Cf nucleus (with the available
fission barrier from experiment) as an example, the formation of the fission
barrier and the influence of macroscopic, shell and pairing correction energies
on it are analyzed. The results of the present calculated $\beta_2$ values and
barrier heights are compared with previous calculations and available
experiments. The role of triaxiality in the region of the first saddle is
discussed. It is found that the second fission barrier is also considerably
affected by the triaxial deformation degree of freedom in some nuclei (e.g.,
the $Z=112-118$ isotopes). Based on the potential energy curves, general trends
of the evolution of the fission barrier heights and widths as a function of the
nucleon numbers are investigated. In addition, the effects of Woods-Saxon
potential parameter modifications (e.g., the strength of the spin-orbit
coupling and the nuclear surface diffuseness) on the fission barrier are
briefly discussed.
|
nucl-th
|
static fission barriers for 95 eveneven transuranium nuclei with charge number z94118 have been systematically investigated by means of pairing selfconsistent woodssaxonstrutinsky calculations using the potential energy surface approach in multidimensional beta_2 gamma beta_4 deformation space taking the heavier 252cf nucleus with the available fission barrier from experiment as an example the formation of the fission barrier and the influence of macroscopic shell and pairing correction energies on it are analyzed the results of the present calculated beta_2 values and barrier heights are compared with previous calculations and available experiments the role of triaxiality in the region of the first saddle is discussed it is found that the second fission barrier is also considerably affected by the triaxial deformation degree of freedom in some nuclei eg the z112118 isotopes based on the potential energy curves general trends of the evolution of the fission barrier heights and widths as a function of the nucleon numbers are investigated in addition the effects of woodssaxon potential parameter modifications eg the strength of the spinorbit coupling and the nuclear surface diffuseness on the fission barrier are briefly discussed
|
[['static', 'fission', 'barriers', 'for', '95', 'eveneven', 'transuranium', 'nuclei', 'with', 'charge', 'number', 'z94118', 'have', 'been', 'systematically', 'investigated', 'by', 'means', 'of', 'pairing', 'selfconsistent', 'woodssaxonstrutinsky', 'calculations', 'using', 'the', 'potential', 'energy', 'surface', 'approach', 'in', 'multidimensional', 'beta_2', 'gamma', 'beta_4', 'deformation', 'space', 'taking', 'the', 'heavier', '252cf', 'nucleus', 'with', 'the', 'available', 'fission', 'barrier', 'from', 'experiment', 'as', 'an', 'example', 'the', 'formation', 'of', 'the', 'fission', 'barrier', 'and', 'the', 'influence', 'of', 'macroscopic', 'shell', 'and', 'pairing', 'correction', 'energies', 'on', 'it', 'are', 'analyzed', 'the', 'results', 'of', 'the', 'present', 'calculated', 'beta_2', 'values', 'and', 'barrier', 'heights', 'are', 'compared', 'with', 'previous', 'calculations', 'and', 'available', 'experiments', 'the', 'role', 'of', 'triaxiality', 'in', 'the', 'region', 'of', 'the', 'first', 'saddle', 'is', 'discussed', 'it', 'is', 'found', 'that', 'the', 'second', 'fission', 'barrier', 'is', 'also', 'considerably', 'affected', 'by', 'the', 'triaxial', 'deformation', 'degree', 'of', 'freedom', 'in', 'some', 'nuclei', 'eg', 'the', 'z112118', 'isotopes', 'based', 'on', 'the', 'potential', 'energy', 'curves', 'general', 'trends', 'of', 'the', 'evolution', 'of', 'the', 'fission', 'barrier', 'heights', 'and', 'widths', 'as', 'a', 'function', 'of', 'the', 'nucleon', 'numbers', 'are', 'investigated', 'in', 'addition', 'the', 'effects', 'of', 'woodssaxon', 'potential', 'parameter', 'modifications', 'eg', 'the', 'strength', 'of', 'the', 'spinorbit', 'coupling', 'and', 'the', 'nuclear', 'surface', 'diffuseness', 'on', 'the', 'fission', 'barrier', 'are', 'briefly', 'discussed']]
|
[-0.07424880578620795, 0.16740997539454838, -0.06258565944793461, 0.13464379250417352, 0.037762015410647776, -0.08382573158091323, 0.029988172996257032, 0.37226802248835233, -0.2105569225009326, -0.3045332510085715, -0.017261347134730647, -0.2881640390861411, -0.06722459530043365, 0.19190407693283734, 0.05607512792054906, 0.03679400349266451, 0.028923603745080163, 0.040770704771013376, -0.06572614940379716, -0.18684987603204378, 0.3503257530526473, 0.1286939372267615, 0.23533504357776389, 0.13650459499974835, 0.003992508669578276, 0.00864912030942083, 0.0475548089604702, -0.02443508837889537, -0.18213453597107238, 0.09723051947510832, 0.19987737706857273, -0.005563222267153253, 0.19102028609447919, -0.4345137885474897, -0.21329982941049141, 0.07599333640965787, 0.13921892353903456, 0.14121381009181777, -0.11861113986898479, -0.28549582071494883, 0.025309853090560525, -0.2388956677495626, -0.17419684083702472, -0.06214624302779007, 0.0531037590507377, 0.12399353994732047, -0.20619244326883415, 0.08833368438801979, -0.025130467243738228, 0.07213833424252149, -0.14862163602387288, -0.24205160920781973, -0.09926646556398207, 0.052334365634513755, 0.12492849700572481, -0.0018232261869483269, 0.22491870356140312, -0.07790417737099803, -0.05990778954679167, 0.4021859895540299, 0.03284549578553536, -0.1528857707322299, 0.05877364760345989, -0.14197969934289026, -0.06789321183472626, 0.1783371847314801, 0.0991378502106642, 0.1280932913913013, -0.11964127536259264, 0.10864949895767495, 0.05747099144762934, 0.13263276632962195, 0.08824351066413239, 0.01067623752713009, 0.1639112553272683, 0.19164142842854853, -0.02132810812295097, 0.07268222245729303, -0.18999089255729423, -0.15493424000105932, -0.3311538303598434, -0.09525616948779386, -0.15136530436831272, -0.012710431593234886, -0.0668541262027677, -0.1307890851917014, 0.3986368266031515, 0.04285490758919188, 0.17702868134602084, -0.015360448032279837, 0.2527466452025532, 0.09655575892647503, 0.0973489461824871, 0.0023644440858573705, 0.30849186785389276, 0.17392375030948853, 0.0375565359686184, -0.29163721885169464, 0.09951069447785042, 0.01704299124469469]
|
1,803.04617
|
Robust LSB Watermarking Optimized for Local Structural Similarity
|
Growth of the Internet and networked multimedia systems has emphasized the
need for copyright protection of the media. Media can be images, audio clips,
videos and etc. Digital watermarking is today extensively used for many
applications such as authentication of ownership or identification of illegal
copies. Digital watermark is an invisible or maybe visible structure added to
the original media (known as asset). Images are considered as communication
channel when they are subject to a watermark embedding procedure so in the case
of embedding a digital watermark in an image, the capacity of the channel
should be considered. There is a trade-off between imperceptibility, robustness
and capacity for embedding a watermark in an asset. In the case of image
watermarks, it is reasonable that the watermarking algorithm should depend on
the content and structure of the image. Conventionally, mean squared error
(MSE) has been used as a common distortion measure to assess the quality of the
images. Newly developed quality metrics proposed some distortion measures that
are based on human visual system (HVS). These metrics show that MSE is not
based on HVS and it has a lack of accuracy when dealing with perceptually
important signals such as images and videos. SSIM or structural similarity is a
state of the art HVS based image quality criterion that has recently been of
much interest. In this paper we propose a robust least significant bit (LSB)
watermarking scheme which is optimized for structural similarity. The watermark
is embedded into a host image through an adaptive algorithm. Various attacks
examined on the embedding approach and simulation results revealed the fact
that the watermarked sequence can be extracted with an acceptable accuracy
after all attacks.
|
cs.MM eess.IV
|
growth of the internet and networked multimedia systems has emphasized the need for copyright protection of the media media can be images audio clips videos and etc digital watermarking is today extensively used for many applications such as authentication of ownership or identification of illegal copies digital watermark is an invisible or maybe visible structure added to the original media known as asset images are considered as communication channel when they are subject to a watermark embedding procedure so in the case of embedding a digital watermark in an image the capacity of the channel should be considered there is a tradeoff between imperceptibility robustness and capacity for embedding a watermark in an asset in the case of image watermarks it is reasonable that the watermarking algorithm should depend on the content and structure of the image conventionally mean squared error mse has been used as a common distortion measure to assess the quality of the images newly developed quality metrics proposed some distortion measures that are based on human visual system hvs these metrics show that mse is not based on hvs and it has a lack of accuracy when dealing with perceptually important signals such as images and videos ssim or structural similarity is a state of the art hvs based image quality criterion that has recently been of much interest in this paper we propose a robust least significant bit lsb watermarking scheme which is optimized for structural similarity the watermark is embedded into a host image through an adaptive algorithm various attacks examined on the embedding approach and simulation results revealed the fact that the watermarked sequence can be extracted with an acceptable accuracy after all attacks
|
[['growth', 'of', 'the', 'internet', 'and', 'networked', 'multimedia', 'systems', 'has', 'emphasized', 'the', 'need', 'for', 'copyright', 'protection', 'of', 'the', 'media', 'media', 'can', 'be', 'images', 'audio', 'clips', 'videos', 'and', 'etc', 'digital', 'watermarking', 'is', 'today', 'extensively', 'used', 'for', 'many', 'applications', 'such', 'as', 'authentication', 'of', 'ownership', 'or', 'identification', 'of', 'illegal', 'copies', 'digital', 'watermark', 'is', 'an', 'invisible', 'or', 'maybe', 'visible', 'structure', 'added', 'to', 'the', 'original', 'media', 'known', 'as', 'asset', 'images', 'are', 'considered', 'as', 'communication', 'channel', 'when', 'they', 'are', 'subject', 'to', 'a', 'watermark', 'embedding', 'procedure', 'so', 'in', 'the', 'case', 'of', 'embedding', 'a', 'digital', 'watermark', 'in', 'an', 'image', 'the', 'capacity', 'of', 'the', 'channel', 'should', 'be', 'considered', 'there', 'is', 'a', 'tradeoff', 'between', 'imperceptibility', 'robustness', 'and', 'capacity', 'for', 'embedding', 'a', 'watermark', 'in', 'an', 'asset', 'in', 'the', 'case', 'of', 'image', 'watermarks', 'it', 'is', 'reasonable', 'that', 'the', 'watermarking', 'algorithm', 'should', 'depend', 'on', 'the', 'content', 'and', 'structure', 'of', 'the', 'image', 'conventionally', 'mean', 'squared', 'error', 'mse', 'has', 'been', 'used', 'as', 'a', 'common', 'distortion', 'measure', 'to', 'assess', 'the', 'quality', 'of', 'the', 'images', 'newly', 'developed', 'quality', 'metrics', 'proposed', 'some', 'distortion', 'measures', 'that', 'are', 'based', 'on', 'human', 'visual', 'system', 'hvs', 'these', 'metrics', 'show', 'that', 'mse', 'is', 'not', 'based', 'on', 'hvs', 'and', 'it', 'has', 'a', 'lack', 'of', 'accuracy', 'when', 'dealing', 'with', 'perceptually', 'important', 'signals', 'such', 'as', 'images', 'and', 'videos', 'ssim', 'or', 'structural', 'similarity', 'is', 'a', 'state', 'of', 'the', 'art', 'hvs', 'based', 'image', 'quality', 'criterion', 'that', 'has', 'recently', 'been', 'of', 'much', 'interest', 'in', 'this', 'paper', 'we', 'propose', 'a', 'robust', 'least', 'significant', 'bit', 'lsb', 'watermarking', 'scheme', 'which', 'is', 'optimized', 'for', 'structural', 'similarity', 'the', 'watermark', 'is', 'embedded', 'into', 'a', 'host', 'image', 'through', 'an', 'adaptive', 'algorithm', 'various', 'attacks', 'examined', 'on', 'the', 'embedding', 'approach', 'and', 'simulation', 'results', 'revealed', 'the', 'fact', 'that', 'the', 'watermarked', 'sequence', 'can', 'be', 'extracted', 'with', 'an', 'acceptable', 'accuracy', 'after', 'all', 'attacks']]
|
[-0.11074140445814797, -0.007476823814733209, -0.11410451579003783, 0.08078695744155075, -0.07507953650890427, -0.16666238758964894, 0.02416357015312593, 0.4433843235732172, -0.2560430469985279, -0.3074403911848881, 0.16897420283511375, -0.30637806814389296, -0.17426788617750744, 0.1886617415261478, -0.19981130674560935, 0.11366597330280549, 0.05643718107354917, 0.09174847946290152, -0.02053248628872874, -0.31725802394027863, 0.2817482825209556, 0.03603321352676949, 0.36517289086341115, 0.02155837690763447, 0.0998940068383105, -0.017345375415796144, -0.041292737049193146, 0.004564773887511859, -0.06528090329961855, 0.09830261443847678, 0.289748031390811, 0.2156802013241338, 0.2921468931974452, -0.3618828830362241, -0.24345397118651357, 0.09503906573545108, 0.17335395772735923, 0.09427095571367337, -0.12931067818109596, -0.3629072418244178, 0.15351284884274324, -0.15775531573797777, 0.028796292428802234, -0.08290732703320815, 0.010141825475779716, -0.025065099581656813, -0.26054848833887895, 0.03199277336632972, 0.05146290762519822, 0.06892572736427241, -0.032327595170176325, -0.07991002464221188, -0.027914788120333437, 0.19899428841675337, 0.05154773061125609, 0.05667905485277392, 0.15106326090072503, -0.168979972888868, -0.09374722446566879, 0.4326115594464238, -0.01663320108227352, -0.22788913855561158, 0.15066291588388409, -0.02658208334407093, -0.08140463157253691, 0.1455302673783087, 0.2088498963918073, 0.050736415151049284, -0.18204858415816857, 0.009862281672293619, -0.032961084055001734, 0.2499624071816758, 0.07038400067493744, 0.10746521171964572, 0.16860550891250053, 0.1924522718647909, 0.058677489380642205, 0.15034649473676306, -0.11857677953486792, -0.023581797097978644, -0.2058204589252115, -0.18061835150105143, -0.23143213501679, -0.01460893776385218, -0.11123966299511329, -0.15853688289209192, 0.36925484281115045, 0.1659021749131355, 0.17497602947473898, 0.006856957819640928, 0.39574914049685295, 0.046209768746363074, 0.1207581175670601, 0.06334509017207789, 0.20271561009649045, 0.03441183575598052, 0.09880323309511, -0.11301873814069345, 0.13592254650759183, 0.050680407755150626]
|
1,803.04618
|
Coupled-channels analyses for $^{9,11}$Li + $^{208}$Pb fusion reactions
with multi-neutron transfer couplings
|
We discuss the role of two-neutron transfer processes in the fusion reaction
of the $^{9,11}$Li + $^{208}$Pb systems. We first analyze the $^{9}$Li +
$^{208}$Pb reaction by taking into account the coupling to the $^{7}$Li +
$^{210}$Pb channel. To this end, we assume that two neutrons are directly
transferred to a single effective channel in $^{210}$Pb and solve the
coupled-channels equations with the two channels. By adjusting the coupling
strength and the effective $Q$-value, we successfully reproduce the
experimental fusion cross sections for this system. We then analyze the
$^{11}$Li + $^{208}$Pb reaction in a similar manner, that is, by taking into
account three effective channels with $^{11}$Li + $^{208}$Pb, $^{9}$Li +
$^{210}$Pb, and $^{7}$Li + $^{212}$Pb partitions. In order to take into account
the halo structure of the $^{11}$Li nucleus, we construct the potential between
$^{11}$Li and $^{208}$Pb with a double folding procedure, while we employ a
Wood-Saxon type potential with the global Aky\"uz-Winther parameters for the
other channels. Our calculation indicates that the multiple two-neutron
transfer process plays a crucial role in the $^{11}$Li + $^{208}$Pb fusion
reaction at energies around the Coulomb barrier.
|
nucl-th
|
we discuss the role of twoneutron transfer processes in the fusion reaction of the 911li 208pb systems we first analyze the 9li 208pb reaction by taking into account the coupling to the 7li 210pb channel to this end we assume that two neutrons are directly transferred to a single effective channel in 210pb and solve the coupledchannels equations with the two channels by adjusting the coupling strength and the effective qvalue we successfully reproduce the experimental fusion cross sections for this system we then analyze the 11li 208pb reaction in a similar manner that is by taking into account three effective channels with 11li 208pb 9li 210pb and 7li 212pb partitions in order to take into account the halo structure of the 11li nucleus we construct the potential between 11li and 208pb with a double folding procedure while we employ a woodsaxon type potential with the global akyuzwinther parameters for the other channels our calculation indicates that the multiple twoneutron transfer process plays a crucial role in the 11li 208pb fusion reaction at energies around the coulomb barrier
|
[['we', 'discuss', 'the', 'role', 'of', 'twoneutron', 'transfer', 'processes', 'in', 'the', 'fusion', 'reaction', 'of', 'the', '911li', '208pb', 'systems', 'we', 'first', 'analyze', 'the', '9li', '208pb', 'reaction', 'by', 'taking', 'into', 'account', 'the', 'coupling', 'to', 'the', '7li', '210pb', 'channel', 'to', 'this', 'end', 'we', 'assume', 'that', 'two', 'neutrons', 'are', 'directly', 'transferred', 'to', 'a', 'single', 'effective', 'channel', 'in', '210pb', 'and', 'solve', 'the', 'coupledchannels', 'equations', 'with', 'the', 'two', 'channels', 'by', 'adjusting', 'the', 'coupling', 'strength', 'and', 'the', 'effective', 'qvalue', 'we', 'successfully', 'reproduce', 'the', 'experimental', 'fusion', 'cross', 'sections', 'for', 'this', 'system', 'we', 'then', 'analyze', 'the', '11li', '208pb', 'reaction', 'in', 'a', 'similar', 'manner', 'that', 'is', 'by', 'taking', 'into', 'account', 'three', 'effective', 'channels', 'with', '11li', '208pb', '9li', '210pb', 'and', '7li', '212pb', 'partitions', 'in', 'order', 'to', 'take', 'into', 'account', 'the', 'halo', 'structure', 'of', 'the', '11li', 'nucleus', 'we', 'construct', 'the', 'potential', 'between', '11li', 'and', '208pb', 'with', 'a', 'double', 'folding', 'procedure', 'while', 'we', 'employ', 'a', 'woodsaxon', 'type', 'potential', 'with', 'the', 'global', 'akyuzwinther', 'parameters', 'for', 'the', 'other', 'channels', 'our', 'calculation', 'indicates', 'that', 'the', 'multiple', 'twoneutron', 'transfer', 'process', 'plays', 'a', 'crucial', 'role', 'in', 'the', '11li', '208pb', 'fusion', 'reaction', 'at', 'energies', 'around', 'the', 'coulomb', 'barrier']]
|
[-0.015110125467551618, 0.14448161314199257, -0.08889018908336187, 0.12916712779444464, 0.03747671671656214, -0.11417593296606686, 0.05179701209735041, 0.35023248914248223, -0.22600936016798104, -0.2692262666374022, -0.09956476327087413, -0.2939232468157901, -0.06173521847007247, 0.1138119599358602, 0.08659568579237616, 0.04406472689085852, 0.09073488306206524, 0.036334489658739505, -0.04322042752507762, -0.15435180794950362, 0.3726822370874949, 0.10675500771189532, 0.23934568398081782, 0.1337153014180992, 0.05917220705305226, 0.07972753232487859, 0.039834070375780524, -0.09055850623090836, -0.14100126140754748, 0.08602121232516682, 0.2869344757584093, 0.0411056269235401, 0.18740043680008966, -0.4598587253660133, -0.20038292622881604, 0.12586476233396257, 0.18235648137422025, 0.17942865632490299, -0.08692525164753367, -0.31744681629987265, 0.05692354385973886, -0.2589069862495473, -0.07526730736902788, -0.056505415191746906, 0.04037142938151109, 0.03173882864708007, -0.3038508078256696, 0.02179548590174818, 0.004707922534593804, -0.027966900628102434, -0.17589199557551183, -0.24146029649140968, -0.00208246024902275, 0.13893473136704415, 0.0643562771674624, 0.00514514278157466, 0.21789862937955398, -0.07651177314883997, -0.020079399298662214, 0.3729837169468572, -0.008694608623045497, -0.16161920538764785, 0.0744728306103339, -0.13227719477039168, -0.11392744826232294, 0.16018653827698223, 0.17194081596178215, 0.08395070883985185, -0.19464159782331658, 0.05892619256073059, 0.018032572061532515, 0.17810055003527933, 0.08425307149908887, -0.031670579710573125, 0.15208132498082705, 0.22497705985072322, -0.02243728139464193, 0.10322853670169768, -0.19366912026816863, -0.12549061724513938, -0.28766849355286633, -0.0980822098790668, -0.07337718233942393, 0.02573466456405268, -0.027938023621986344, -0.04854793786415195, 0.3654555187632385, 0.06238440930081362, 0.2468407293715493, -0.03468075624682983, 0.31071050149727275, 0.10535941008790607, 0.09602804832452834, 0.006843895161926577, 0.3223636258838021, 0.23426963163894304, 0.04507151635665319, -0.30727613026233896, 0.06305761833606414, 0.027269663049744187]
|
1,803.04619
|
Two-point distortion theorems and the Schwarzian derivatives of
meromorphic functions
|
For a meromorphic function $f$ in the unit disk $U=\{z:\;|z|<1\}$ and
arbitrary points $z_1,z_2$ in $U$ distinct from the poles of $f$, a sharp upper
bound on the product $|f'(z_1)f'(z_2)|$ is established. Further, we prove a
sharp distortion theorem involving the derivatives $f'(z_1)$, $f'(z_2)$ and the
Schwarzian derivatives $S_f(z_1)$, $S_f(z_2)$ for $z_1,z_2\in U$. Both
estimates hold true under some geometric restrictions on the image $f(U)$.
|
math.CV
|
for a meromorphic function f in the unit disk uzz1 and arbitrary points z_1z_2 in u distinct from the poles of f a sharp upper bound on the product fz_1fz_2 is established further we prove a sharp distortion theorem involving the derivatives fz_1 fz_2 and the schwarzian derivatives s_fz_1 s_fz_2 for z_1z_2in u both estimates hold true under some geometric restrictions on the image fu
|
[['for', 'a', 'meromorphic', 'function', 'f', 'in', 'the', 'unit', 'disk', 'uzz1', 'and', 'arbitrary', 'points', 'z_1z_2', 'in', 'u', 'distinct', 'from', 'the', 'poles', 'of', 'f', 'a', 'sharp', 'upper', 'bound', 'on', 'the', 'product', 'fz_1fz_2', 'is', 'established', 'further', 'we', 'prove', 'a', 'sharp', 'distortion', 'theorem', 'involving', 'the', 'derivatives', 'fz_1', 'fz_2', 'and', 'the', 'schwarzian', 'derivatives', 's_fz_1', 's_fz_2', 'for', 'z_1z_2in', 'u', 'both', 'estimates', 'hold', 'true', 'under', 'some', 'geometric', 'restrictions', 'on', 'the', 'image', 'fu']]
|
[-0.1882817631083556, 0.00040635022288951716, -0.06491133974307813, 0.1063571482854819, -0.07010237751986648, -0.12256052947343617, 0.08225923486542507, 0.3284607554221007, -0.2695196502093897, -0.1904032697412567, 0.12140502885199193, -0.28923044410213583, -0.13271184026675878, 0.2127234838505993, -0.09448702574600695, 0.07238908054604822, -0.013230599142366746, 0.09567639537033487, -0.11213402656578748, -0.24647437741399789, 0.32971691456241686, -0.1362379090860486, 0.163005281789381, 0.11783850221745823, 0.08774370117662628, 0.003022521547209777, 0.028253364895821594, -0.09442319293491176, -0.2274272035746301, 0.11829636006264901, 0.17689465630616322, 0.05247910115791515, 0.27075732472642766, -0.38870054858996245, -0.1743943515371104, 0.13694153203949577, 0.07340332819148898, -0.06069626414873561, -0.02999839905008185, -0.28187938831502296, 0.046715706762414974, -0.050902353874484045, -0.15927304767194342, -0.024916026466449755, 0.06475331054496594, 0.06157502240012781, -0.36363389168972854, 0.09199785770939999, 0.1374752956373831, 0.061757992658683966, -0.13048481722133326, -0.16523945672803972, -0.07644560417068787, 0.06652723324530926, 0.02805833389875708, 0.1473676675938253, 0.04620671734885603, -0.10594303309001395, -0.022598700628417435, 0.29350459433664555, -0.12116303346806863, -0.260193116657558, 0.1193230841585557, -0.22260739159632903, -0.15504790072856073, 0.09498398028863747, 0.11663247801775693, 0.14761349500813445, -0.07339621530693086, 0.21869984433841205, -0.08027239237744056, 0.10129961989949778, 0.18253047926328528, 0.04689518726033876, 0.11133022631564346, -0.011996844768157749, 0.153758117013046, 0.14918959873621582, -0.039789393986956995, -0.01452513976541699, -0.3810934260731838, -0.15514767621586587, -0.1885807615118941, 0.07543842867780172, -0.16292488803947727, -0.17731909107294727, 0.3537274522126698, 0.0441166366656601, 0.21267832736255693, 0.08729828658635866, 0.22402875168157405, 0.17656967311059354, 0.054455530133144164, 0.0672362926816873, 0.14408979101009195, 0.15203136578583937, 0.024262827248541546, -0.1424731583693294, 0.06954851053410867, 0.16645518003306428]
|
1,803.0462
|
Image Segmentation and Processing for Efficient Parking Space Analysis
|
In this paper, we develop a method to detect vacant parking spaces in an
environment with unclear segments and contours with the help of MATLAB image
processing capabilities. Due to the anomalies present in the parking spaces,
such as uneven illumination, distorted slot lines and overlapping of cars. The
present-day conventional algorithms have difficulties processing the image for
accurate results. The algorithm proposed uses a combination of image
pre-processing and false contour detection techniques to improve the detection
efficiency. The proposed method also eliminates the need to employ individual
sensors to detect a car, instead uses real-time static images to consider a
group of slots together, instead of the usual single slot method. This greatly
decreases the expenses required to design an efficient parking system. We
compare the performance of our algorithm to that of other techniques. These
comparisons show that the proposed algorithm can detect the vacancies in the
parking spots while ignoring the false data and other distortions.
|
eess.IV cs.CV
|
in this paper we develop a method to detect vacant parking spaces in an environment with unclear segments and contours with the help of matlab image processing capabilities due to the anomalies present in the parking spaces such as uneven illumination distorted slot lines and overlapping of cars the presentday conventional algorithms have difficulties processing the image for accurate results the algorithm proposed uses a combination of image preprocessing and false contour detection techniques to improve the detection efficiency the proposed method also eliminates the need to employ individual sensors to detect a car instead uses realtime static images to consider a group of slots together instead of the usual single slot method this greatly decreases the expenses required to design an efficient parking system we compare the performance of our algorithm to that of other techniques these comparisons show that the proposed algorithm can detect the vacancies in the parking spots while ignoring the false data and other distortions
|
[['in', 'this', 'paper', 'we', 'develop', 'a', 'method', 'to', 'detect', 'vacant', 'parking', 'spaces', 'in', 'an', 'environment', 'with', 'unclear', 'segments', 'and', 'contours', 'with', 'the', 'help', 'of', 'matlab', 'image', 'processing', 'capabilities', 'due', 'to', 'the', 'anomalies', 'present', 'in', 'the', 'parking', 'spaces', 'such', 'as', 'uneven', 'illumination', 'distorted', 'slot', 'lines', 'and', 'overlapping', 'of', 'cars', 'the', 'presentday', 'conventional', 'algorithms', 'have', 'difficulties', 'processing', 'the', 'image', 'for', 'accurate', 'results', 'the', 'algorithm', 'proposed', 'uses', 'a', 'combination', 'of', 'image', 'preprocessing', 'and', 'false', 'contour', 'detection', 'techniques', 'to', 'improve', 'the', 'detection', 'efficiency', 'the', 'proposed', 'method', 'also', 'eliminates', 'the', 'need', 'to', 'employ', 'individual', 'sensors', 'to', 'detect', 'a', 'car', 'instead', 'uses', 'realtime', 'static', 'images', 'to', 'consider', 'a', 'group', 'of', 'slots', 'together', 'instead', 'of', 'the', 'usual', 'single', 'slot', 'method', 'this', 'greatly', 'decreases', 'the', 'expenses', 'required', 'to', 'design', 'an', 'efficient', 'parking', 'system', 'we', 'compare', 'the', 'performance', 'of', 'our', 'algorithm', 'to', 'that', 'of', 'other', 'techniques', 'these', 'comparisons', 'show', 'that', 'the', 'proposed', 'algorithm', 'can', 'detect', 'the', 'vacancies', 'in', 'the', 'parking', 'spots', 'while', 'ignoring', 'the', 'false', 'data', 'and', 'other', 'distortions']]
|
[-0.08711550696698396, 0.009536983240286645, -0.05835059032833669, 0.0462855459547427, -0.09396571819088421, -0.13887393751065247, 0.09997267166545498, 0.44674162958108354, -0.2602203958667815, -0.340834109102434, 0.09991673780932615, -0.28117194438818843, -0.1639879617912811, 0.1771941751940176, -0.16457926339644474, 0.07886204711394385, 0.09365827232104493, 0.033818703376164196, -0.05925468642526539, -0.2743787969680852, 0.2594413034399622, 0.07565380231535528, 0.3219029304862488, 0.02638405958423391, 0.08243352114004665, 0.025996219848457257, -0.07459248263621703, -0.008990132791223005, -0.06504714271040939, 0.15097691516857595, 0.28262501776916904, 0.1623749377737113, 0.2707835190551123, -0.44265200218651446, -0.21542351649841293, 0.09475432500767056, 0.17104035244556143, 0.08103163521445822, -0.07151370855717687, -0.3118174012633972, 0.08645202577306463, -0.1360505854827352, -0.0830799193776329, -0.08229869329807116, -0.02523068565678841, 0.02244975940520817, -0.28285089072887787, 0.022282300966435287, 0.027848887316940817, 0.005008502109558321, -0.06588579691015184, -0.06904068286457914, 0.034510449816662, 0.17112452291767113, 0.010456462768343045, 0.03288054943841416, 0.1523492009626352, -0.12230896754190326, -0.16399749608972342, 0.3876028348458931, -0.030305263376794754, -0.1986661328934133, 0.19529489421620383, -0.09077422115951776, -0.12470747323823161, 0.17036516586349534, 0.21640492339793127, 0.12560429885343183, -0.11417616281541995, -0.007225970792933367, 0.01859443627035944, 0.18274225661880336, 0.069865235305042, 0.012677826879371423, 0.17749670092453015, 0.16071068058954552, 0.11060973486892181, 0.15049138080976263, -0.18145976308442185, -0.015301209752942668, -0.2098049132502638, -0.17365708484348943, -0.1737611851305701, -0.09740770746866474, -0.05733974228169245, -0.16996928696171382, 0.37552053355029785, 0.24508185932354537, 0.1972228198632365, 0.06782768593693618, 0.3955547941615805, 0.06147992667283688, 0.12255589970154687, 0.06440122774638439, 0.16798912766680588, 0.00842035091445723, 0.12700218149257125, -0.23760459654586158, 0.051455508388971796, 0.04647976972046308]
|
1,803.04621
|
Cubic Spline Interpolation Segmenting over Conventional Segmentation
Procedures: Application and Advantages
|
To design a novel method for segmenting the image using Cubic Spline
Interpolation and compare it with different techniques to determine which gives
an efficient data to segment an image. This paper compares polynomial least
square interpolation and the conventional Otsu thresholding with spline
interpolation technique for image segmentation. The threshold value is
determined using the above-mentioned techniques which are then used to segment
an image into the binary image. The results of the proposed technique are also
compared with the conventional algorithms after applying image equalizations.
The better technique is determined based on the deviation and mean square error
when compared with an accurately segmented image. The image with least amount
of deviation and mean square error is declared as the better technique.
|
eess.IV
|
to design a novel method for segmenting the image using cubic spline interpolation and compare it with different techniques to determine which gives an efficient data to segment an image this paper compares polynomial least square interpolation and the conventional otsu thresholding with spline interpolation technique for image segmentation the threshold value is determined using the abovementioned techniques which are then used to segment an image into the binary image the results of the proposed technique are also compared with the conventional algorithms after applying image equalizations the better technique is determined based on the deviation and mean square error when compared with an accurately segmented image the image with least amount of deviation and mean square error is declared as the better technique
|
[['to', 'design', 'a', 'novel', 'method', 'for', 'segmenting', 'the', 'image', 'using', 'cubic', 'spline', 'interpolation', 'and', 'compare', 'it', 'with', 'different', 'techniques', 'to', 'determine', 'which', 'gives', 'an', 'efficient', 'data', 'to', 'segment', 'an', 'image', 'this', 'paper', 'compares', 'polynomial', 'least', 'square', 'interpolation', 'and', 'the', 'conventional', 'otsu', 'thresholding', 'with', 'spline', 'interpolation', 'technique', 'for', 'image', 'segmentation', 'the', 'threshold', 'value', 'is', 'determined', 'using', 'the', 'abovementioned', 'techniques', 'which', 'are', 'then', 'used', 'to', 'segment', 'an', 'image', 'into', 'the', 'binary', 'image', 'the', 'results', 'of', 'the', 'proposed', 'technique', 'are', 'also', 'compared', 'with', 'the', 'conventional', 'algorithms', 'after', 'applying', 'image', 'equalizations', 'the', 'better', 'technique', 'is', 'determined', 'based', 'on', 'the', 'deviation', 'and', 'mean', 'square', 'error', 'when', 'compared', 'with', 'an', 'accurately', 'segmented', 'image', 'the', 'image', 'with', 'least', 'amount', 'of', 'deviation', 'and', 'mean', 'square', 'error', 'is', 'declared', 'as', 'the', 'better', 'technique']]
|
[0.030249864608806565, -0.041215075431221236, -0.10339883221994813, 0.06692917436187164, -0.06047758343440246, -0.16166987396943255, -0.008517768952382229, 0.4435970741740572, -0.2888424457656598, -0.33122430776995493, 0.1575199534011081, -0.2742557047555844, -0.14991116834183535, 0.22950427848997154, -0.12773779512390615, 0.12227009144816094, 0.06987683888055324, 0.06401029399717302, -0.12078649642294258, -0.30311719909673784, 0.263642552732755, 0.08061440137585973, 0.314800265150493, -0.017868622794853357, 0.1409573484660785, 0.012545987214075356, -0.040333709251741325, 0.011726856371766426, -0.12046981024427142, 0.1729369213903035, 0.22837626549029133, 0.13088917912067316, 0.25788602089070206, -0.3767599602252608, -0.16847250322107135, 0.10121123093687664, 0.14490793312225886, 0.08251382654335926, -0.042122869605645236, -0.28717664865174947, 0.12652094722006138, -0.085849904358705, -0.04333961095161191, -0.0906560530552898, -0.06076775127037511, 0.01510607545657795, -0.3388269488459332, 0.06753240064391298, 0.029831228735648488, 0.07061249096461428, -0.0425200422514018, -0.1636498622365326, 0.05188234426399193, 0.13956147789263273, 0.017315688355621403, 0.12618049947030055, 0.09215090459030939, -0.1236569604900764, -0.11412005647789777, 0.3784705070491002, -0.07066106647480189, -0.2311359015118323, 0.1138072842448132, -0.04816801050238735, -0.04642579628048631, 0.18687523679610918, 0.15473933090887418, 0.10575517969089086, -0.14031456333144504, -0.01565324620919196, -0.010355075868603781, 0.2207419931873437, 0.07190837128640615, -0.0540807593000553, 0.11969134301265202, 0.2059276746178985, 0.09504693395759138, 0.1762734742218068, -0.23070724607384727, -0.028335104280007566, -0.2439274780633973, -0.12157229027460988, -0.2525831880502221, -0.0827355539356169, -0.14167211194119483, -0.19542969405136215, 0.3895125639420457, 0.1729847964399108, 0.21086413074072782, 0.09392038720841633, 0.36840456612105293, 0.12126410904631958, 0.1064102152301892, 0.03440079823461914, 0.1944964805852652, 0.09398639579189987, 0.03315219497005266, -0.17490682905214286, 0.04072492230471557, 0.15518425915359965]
|
1,803.04622
|
Crossed modules of monoids III. Simplicial monoids of Moore length 1
|
This is the last part of a series of three strongly related papers in which
three equivalent structures are studied:
- internal categories in categories of monoids; defined in terms of pullbacks
relative to a chosen class of spans
- crossed modules of monoids relative to this class of spans
- simplicial monoids of so-called Moore length 1 relative to this class of
spans.
The most important examples of monoids that are covered are small categories
(treated as monoids in categories of spans) and bimonoids in symmetric monoidal
categories (regarded as monoids in categories of comonoids). In this third part
relative simplicial monoids are analyzed. Their Moore length is introduced and
the equivalence is proven between relative simplicial monoids of Moore length
1, and relative categories of monoids in Part I. This equivalence is obtained
in one direction by truncating a simplicial monoid at the first two degrees;
and in the other direction by taking the simplicial nerve of a relative
category.
|
math.CT math.QA
|
this is the last part of a series of three strongly related papers in which three equivalent structures are studied internal categories in categories of monoids defined in terms of pullbacks relative to a chosen class of spans crossed modules of monoids relative to this class of spans simplicial monoids of socalled moore length 1 relative to this class of spans the most important examples of monoids that are covered are small categories treated as monoids in categories of spans and bimonoids in symmetric monoidal categories regarded as monoids in categories of comonoids in this third part relative simplicial monoids are analyzed their moore length is introduced and the equivalence is proven between relative simplicial monoids of moore length 1 and relative categories of monoids in part i this equivalence is obtained in one direction by truncating a simplicial monoid at the first two degrees and in the other direction by taking the simplicial nerve of a relative category
|
[['this', 'is', 'the', 'last', 'part', 'of', 'a', 'series', 'of', 'three', 'strongly', 'related', 'papers', 'in', 'which', 'three', 'equivalent', 'structures', 'are', 'studied', 'internal', 'categories', 'in', 'categories', 'of', 'monoids', 'defined', 'in', 'terms', 'of', 'pullbacks', 'relative', 'to', 'a', 'chosen', 'class', 'of', 'spans', 'crossed', 'modules', 'of', 'monoids', 'relative', 'to', 'this', 'class', 'of', 'spans', 'simplicial', 'monoids', 'of', 'socalled', 'moore', 'length', '1', 'relative', 'to', 'this', 'class', 'of', 'spans', 'the', 'most', 'important', 'examples', 'of', 'monoids', 'that', 'are', 'covered', 'are', 'small', 'categories', 'treated', 'as', 'monoids', 'in', 'categories', 'of', 'spans', 'and', 'bimonoids', 'in', 'symmetric', 'monoidal', 'categories', 'regarded', 'as', 'monoids', 'in', 'categories', 'of', 'comonoids', 'in', 'this', 'third', 'part', 'relative', 'simplicial', 'monoids', 'are', 'analyzed', 'their', 'moore', 'length', 'is', 'introduced', 'and', 'the', 'equivalence', 'is', 'proven', 'between', 'relative', 'simplicial', 'monoids', 'of', 'moore', 'length', '1', 'and', 'relative', 'categories', 'of', 'monoids', 'in', 'part', 'i', 'this', 'equivalence', 'is', 'obtained', 'in', 'one', 'direction', 'by', 'truncating', 'a', 'simplicial', 'monoid', 'at', 'the', 'first', 'two', 'degrees', 'and', 'in', 'the', 'other', 'direction', 'by', 'taking', 'the', 'simplicial', 'nerve', 'of', 'a', 'relative', 'category']]
|
[-0.13079995983543824, 0.10177428116026165, 0.01381479186421764, 0.10047210053813134, -0.04070535817611143, -0.07223545138009549, -0.06197504918003138, 0.388763140840163, -0.4170493534597738, -0.22112852176534212, 0.05209902401006072, -0.25465763596899854, -0.06673614890461073, 0.17364289829472326, -0.18657381941546808, -0.11971610975114969, 0.04656259944873317, 0.07713876422436076, -0.0550761955787293, -0.26734304132888903, 0.4570541923760243, -0.014585292780971003, 0.24367810309858723, 0.01744501040545556, 0.08680828219959102, -0.04906345919322269, -0.09876646672275925, 0.09529201324396538, -0.12134249114861409, 0.1622106653620612, 0.37336016418236606, 0.0486258457900968, 0.22813810596210332, -0.3321310004055406, -0.09229029252328588, 0.11947937295684274, 0.09156752968025424, 0.01649515014420023, 0.04327873186261024, -0.30032961039493483, 0.10620701539333113, -0.25149892004054486, -0.04961852458709816, 0.016426342041612422, 0.14914857556621702, 0.05585415257615441, -0.19269956620234363, -0.02990792340557999, 0.11758193884164046, 0.138630128342588, -0.06356832626020922, -0.12055043192469052, -0.05460653775635193, 0.14978082419179803, -0.01430343852360856, -0.047518746303570156, 0.11197173201227151, -0.12516087051349217, -0.13509501524433587, 0.41354151913579906, -0.02955961242060429, -0.1887313735908565, 0.175508358132141, -0.1326917700832651, -0.13867918994430006, 0.18154044400420297, 0.022726644756002997, 0.19162999999668426, -0.0525613055687468, 0.14691566979020554, -0.15028800578998788, 0.06696986057575932, 0.1663221752610784, 0.04196480216763023, 0.14358903557273014, 0.15290852586311177, 0.023088681124994216, 0.18879957876421524, 0.045189473599359486, -0.0738037250666592, -0.3269611774773905, -0.16805068699572728, -0.09066742410848164, 0.07103886769252753, -0.05325744312758845, -0.1803285531881236, 0.3997342763644344, 0.11875227381879429, 0.16030585385768223, 0.11065531707787593, 0.20232697540700859, -0.023298843374253256, 0.10468416130345948, -0.023126384793962323, 0.1595057680054843, 0.2737874107269875, 0.0038797503143970695, -0.04321930918303676, 0.02247045833746311, 0.2431665152697912]
|
1,803.04623
|
Thompson Sampling for Combinatorial Semi-Bandits
|
In this paper, we study the application of the Thompson sampling (TS)
methodology to the stochastic combinatorial multi-armed bandit (CMAB)
framework. We first analyze the standard TS algorithm for the general CMAB
model when the outcome distributions of all the base arms are independent, and
obtain a distribution-dependent regret bound of $O(m\log K_{\max}\log T /
\Delta_{\min})$, where $m$ is the number of base arms, $K_{\max}$ is the size
of the largest super arm, $T$ is the time horizon, and $\Delta_{\min}$ is the
minimum gap between the expected reward of the optimal solution and any
non-optimal solution. This regret upper bound is better than the $O(m(\log
K_{\max})^2\log T / \Delta_{\min})$ bound in prior works. Moreover, our novel
analysis techniques can help to tighten the regret bounds of other existing
UCB-based policies (e.g., ESCB), as we improve the method of counting the
cumulative regret. Then we consider the matroid bandit setting (a special class
of CMAB model), where we could remove the independence assumption across arms
and achieve a regret upper bound that matches the lower bound. Except for the
regret upper bounds, we also point out that one cannot directly replace the
exact offline oracle (which takes the parameters of an offline problem instance
as input and outputs the exact best action under this instance) with an
approximation oracle in TS algorithm for even the classical MAB problem.
Finally, we use some experiments to show the comparison between regrets of TS
and other existing algorithms, the experimental results show that TS
outperforms existing baselines.
|
cs.LG
|
in this paper we study the application of the thompson sampling ts methodology to the stochastic combinatorial multiarmed bandit cmab framework we first analyze the standard ts algorithm for the general cmab model when the outcome distributions of all the base arms are independent and obtain a distributiondependent regret bound of omlog k_maxlog t delta_min where m is the number of base arms k_max is the size of the largest super arm t is the time horizon and delta_min is the minimum gap between the expected reward of the optimal solution and any nonoptimal solution this regret upper bound is better than the omlog k_max2log t delta_min bound in prior works moreover our novel analysis techniques can help to tighten the regret bounds of other existing ucbbased policies eg escb as we improve the method of counting the cumulative regret then we consider the matroid bandit setting a special class of cmab model where we could remove the independence assumption across arms and achieve a regret upper bound that matches the lower bound except for the regret upper bounds we also point out that one cannot directly replace the exact offline oracle which takes the parameters of an offline problem instance as input and outputs the exact best action under this instance with an approximation oracle in ts algorithm for even the classical mab problem finally we use some experiments to show the comparison between regrets of ts and other existing algorithms the experimental results show that ts outperforms existing baselines
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'application', 'of', 'the', 'thompson', 'sampling', 'ts', 'methodology', 'to', 'the', 'stochastic', 'combinatorial', 'multiarmed', 'bandit', 'cmab', 'framework', 'we', 'first', 'analyze', 'the', 'standard', 'ts', 'algorithm', 'for', 'the', 'general', 'cmab', 'model', 'when', 'the', 'outcome', 'distributions', 'of', 'all', 'the', 'base', 'arms', 'are', 'independent', 'and', 'obtain', 'a', 'distributiondependent', 'regret', 'bound', 'of', 'omlog', 'k_maxlog', 't', 'delta_min', 'where', 'm', 'is', 'the', 'number', 'of', 'base', 'arms', 'k_max', 'is', 'the', 'size', 'of', 'the', 'largest', 'super', 'arm', 't', 'is', 'the', 'time', 'horizon', 'and', 'delta_min', 'is', 'the', 'minimum', 'gap', 'between', 'the', 'expected', 'reward', 'of', 'the', 'optimal', 'solution', 'and', 'any', 'nonoptimal', 'solution', 'this', 'regret', 'upper', 'bound', 'is', 'better', 'than', 'the', 'omlog', 'k_max2log', 't', 'delta_min', 'bound', 'in', 'prior', 'works', 'moreover', 'our', 'novel', 'analysis', 'techniques', 'can', 'help', 'to', 'tighten', 'the', 'regret', 'bounds', 'of', 'other', 'existing', 'ucbbased', 'policies', 'eg', 'escb', 'as', 'we', 'improve', 'the', 'method', 'of', 'counting', 'the', 'cumulative', 'regret', 'then', 'we', 'consider', 'the', 'matroid', 'bandit', 'setting', 'a', 'special', 'class', 'of', 'cmab', 'model', 'where', 'we', 'could', 'remove', 'the', 'independence', 'assumption', 'across', 'arms', 'and', 'achieve', 'a', 'regret', 'upper', 'bound', 'that', 'matches', 'the', 'lower', 'bound', 'except', 'for', 'the', 'regret', 'upper', 'bounds', 'we', 'also', 'point', 'out', 'that', 'one', 'can', 'not', 'directly', 'replace', 'the', 'exact', 'offline', 'oracle', 'which', 'takes', 'the', 'parameters', 'of', 'an', 'offline', 'problem', 'instance', 'as', 'input', 'and', 'outputs', 'the', 'exact', 'best', 'action', 'under', 'this', 'instance', 'with', 'an', 'approximation', 'oracle', 'in', 'ts', 'algorithm', 'for', 'even', 'the', 'classical', 'mab', 'problem', 'finally', 'we', 'use', 'some', 'experiments', 'to', 'show', 'the', 'comparison', 'between', 'regrets', 'of', 'ts', 'and', 'other', 'existing', 'algorithms', 'the', 'experimental', 'results', 'show', 'that', 'ts', 'outperforms', 'existing', 'baselines']]
|
[-0.10754999605473131, 0.032579368069418704, -0.0915930971421767, 0.11979615648742765, -0.1269048244263977, -0.16177623322978615, 0.14182929117209278, 0.36757316762115805, -0.2688583487048745, -0.3529981021620333, 0.10407538367400411, -0.25680101931560784, -0.1535469977930188, 0.19793422025721522, -0.09817458375822753, 0.07508111158368411, 0.038127365698572245, 0.09733997157774865, -0.05720549542972003, -0.3014091457081959, 0.27091313830483704, 0.07575154628045858, 0.2647460855022073, 0.006048443084349856, 0.07805623047240079, -0.007371186741394922, 0.041635028060991314, 0.022381763856159524, -0.17287104755590554, 0.0721389459995553, 0.27055191023973746, 0.19916078171992557, 0.29515892515331504, -0.3758143652193248, -0.14231371560692788, 0.15620564046129584, 0.11979731661366531, 0.08963558863895014, -0.005139601804316044, -0.2561526012560353, 0.08140094458125531, -0.13006365795846067, -0.026726619048044086, -0.01403368323482573, -0.0339513044860214, 0.011925688080489636, -0.3730930172763765, 0.029324593337369153, 0.10415335791558027, -0.03462079835997429, -0.06409026697278022, -0.176215599602554, 0.08685872978763655, 0.1056551778918365, 0.0655227080467157, 0.06024608958605677, 0.10536931919492781, -0.12525161911454052, -0.19170788944605738, 0.30337895585782826, -0.0929319166080677, -0.16256516755651682, 0.14783215024531818, -0.11560013524442911, -0.12388177762366831, 0.08722049904474989, 0.19447278748638927, 0.19065349678415805, -0.11415745430375682, 0.13062693189131097, -0.13337014280539006, 0.1501922104252735, 0.082460011173971, 0.03938948277733289, 0.04743626027647406, 0.17144405648112296, 0.18022913968749343, 0.17810136325238274, -0.07139407031284645, -0.12562780119571834, -0.29535439190641044, -0.1362827320616925, -0.17358058852003888, -0.025625781369803008, -0.1662682276290143, -0.11458028113376349, 0.31517745087249205, 0.17391626080288553, 0.2101555178500712, 0.17447928983846214, 0.35062746063619854, 0.10947424483997747, 0.010643193671130575, 0.18150759608950465, 0.21826222447503824, 0.03740937598980963, 0.006841883724555373, -0.23001304419478402, 0.140431986996904, 0.07723810435459018]
|
1,803.04624
|
A Human Visual System-Based 3D Video Quality Metric
|
Although several 2D quality metrics have been proposed for images and videos,
in the case of 3D efforts are only at the initial stages. In this paper, we
propose a new full-reference quality metric for 3D content. Our method is
modeled around the HVS, fusing the information of both left and right channels,
considering color components, the cyclopean views of the two videos and
disparity. Performance evaluations showed that our 3D quality metric
successfully monitors the degradation of quality caused by several
representative types of distortion and it has 86% correlation with the results
of subjective evaluations.
|
eess.IV
|
although several 2d quality metrics have been proposed for images and videos in the case of 3d efforts are only at the initial stages in this paper we propose a new fullreference quality metric for 3d content our method is modeled around the hvs fusing the information of both left and right channels considering color components the cyclopean views of the two videos and disparity performance evaluations showed that our 3d quality metric successfully monitors the degradation of quality caused by several representative types of distortion and it has 86 correlation with the results of subjective evaluations
|
[['although', 'several', '2d', 'quality', 'metrics', 'have', 'been', 'proposed', 'for', 'images', 'and', 'videos', 'in', 'the', 'case', 'of', '3d', 'efforts', 'are', 'only', 'at', 'the', 'initial', 'stages', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'fullreference', 'quality', 'metric', 'for', '3d', 'content', 'our', 'method', 'is', 'modeled', 'around', 'the', 'hvs', 'fusing', 'the', 'information', 'of', 'both', 'left', 'and', 'right', 'channels', 'considering', 'color', 'components', 'the', 'cyclopean', 'views', 'of', 'the', 'two', 'videos', 'and', 'disparity', 'performance', 'evaluations', 'showed', 'that', 'our', '3d', 'quality', 'metric', 'successfully', 'monitors', 'the', 'degradation', 'of', 'quality', 'caused', 'by', 'several', 'representative', 'types', 'of', 'distortion', 'and', 'it', 'has', '86', 'correlation', 'with', 'the', 'results', 'of', 'subjective', 'evaluations']]
|
[-0.073573004588792, 0.007215271369054837, -0.05088353878578421, 0.005596210968863104, -0.014315383453294155, -0.09403344967220094, -0.010580802018293324, 0.4572033122489133, -0.19188452427534713, -0.36390343162509586, 0.09317798439602934, -0.333013713513453, -0.16288807695088237, 0.17248284101927863, -0.1375317942715951, 0.080799613839265, 0.10370003152638674, 0.04856972178425064, -0.08260329541289392, -0.30675564180176285, 0.33958771276780847, 0.03018611563926505, 0.3644494299786453, 0.05061004521594066, 0.12217604436614003, -0.04905551481396728, -0.06307794249702975, 0.06308270942452171, -0.06424998886411896, 0.12623432578192545, 0.23273272652985508, 0.2056512613084705, 0.2691701817489469, -0.38263597441165104, -0.2430948850881193, 0.024490076960328507, 0.11882625104974687, 0.04866616399094616, -0.10526289306965071, -0.35296845370567564, 0.11243023071438074, -0.1350209932179027, 0.0013431767577823904, -0.07294023662959177, -0.002812632958443125, -0.011892543222332738, -0.2795562197060622, 0.05824286771035686, 0.03827446913970731, 0.06634255112196828, -0.07789561672366618, -0.10597673343187294, -0.009600921946856165, 0.2405711233606274, 0.08017110908115954, 0.05375858267034721, 0.09767361880116857, -0.19077883027049894, -0.10223971831446667, 0.4040161460714856, -0.0326417438594682, -0.22924062874667422, 0.20983044386447705, -0.09674664802570856, -0.09726680821460701, 0.1338215592058049, 0.18016078025486665, 0.1315259912876969, -0.16129697546286068, -0.011616270069858617, -0.03418846068586962, 0.17225058142428248, 0.0906145743612853, 0.052002073548849406, 0.1825513543834737, 0.17447180301191034, -0.02424999620333691, 0.12842751202442365, -0.16515016251426076, -0.01927793167589098, -0.2175525417647411, -0.15082619173125816, -0.1658643661258915, -0.036724220056263204, -0.11184896868545581, -0.11657616517088885, 0.4578412124867906, 0.18557467570374767, 0.1983332145411867, 0.05182536867130356, 0.37083222726648, 0.013653350132277486, 0.06364803318145502, 0.051818867257229756, 0.21592110032983816, -0.004391025470992185, 0.11239388305693865, -0.16624952045739771, 0.09053144895366018, 0.04256011154406618]
|
1,803.04625
|
The power of the largest player
|
Decisions in a shareholder meeting or a legislative committee are often
modeled as a weighted game. Influence of a member is then measured by a power
index. A large variety of different indices has been introduced in the
literature. This paper analyzes how power indices differ with respect to the
largest possible power of a non-dictatorial player. It turns out that the
considered set of power indices can be partitioned into two classes. This may
serve as another indication which index to use in a given application.
|
cs.GT
|
decisions in a shareholder meeting or a legislative committee are often modeled as a weighted game influence of a member is then measured by a power index a large variety of different indices has been introduced in the literature this paper analyzes how power indices differ with respect to the largest possible power of a nondictatorial player it turns out that the considered set of power indices can be partitioned into two classes this may serve as another indication which index to use in a given application
|
[['decisions', 'in', 'a', 'shareholder', 'meeting', 'or', 'a', 'legislative', 'committee', 'are', 'often', 'modeled', 'as', 'a', 'weighted', 'game', 'influence', 'of', 'a', 'member', 'is', 'then', 'measured', 'by', 'a', 'power', 'index', 'a', 'large', 'variety', 'of', 'different', 'indices', 'has', 'been', 'introduced', 'in', 'the', 'literature', 'this', 'paper', 'analyzes', 'how', 'power', 'indices', 'differ', 'with', 'respect', 'to', 'the', 'largest', 'possible', 'power', 'of', 'a', 'nondictatorial', 'player', 'it', 'turns', 'out', 'that', 'the', 'considered', 'set', 'of', 'power', 'indices', 'can', 'be', 'partitioned', 'into', 'two', 'classes', 'this', 'may', 'serve', 'as', 'another', 'indication', 'which', 'index', 'to', 'use', 'in', 'a', 'given', 'application']]
|
[-0.10913215635408616, 0.08690418285885076, -0.12002569978960373, 0.054017376672508645, -0.08640378936268818, -0.1542191543434372, 0.07210645744518174, 0.35812058004325836, -0.2678139291104229, -0.33178983717399446, 0.11921442568371736, -0.284176842876892, -0.14768904987347967, 0.1718386156576814, -0.12184821175753899, -0.00898262027208827, 0.010143165455210483, 0.07713673460222352, 0.018961622167630227, -0.2317324248410162, 0.2995515230229531, 0.049416556595771134, 0.2729531942770399, 0.004966828319104923, 0.05850832203895539, -0.046521062695089425, -0.0617990434415981, 0.15185764017675457, -0.0854208683784069, 0.09100035705132646, 0.2994236522621807, 0.16460667394540518, 0.352327604703177, -0.33670550411374406, -0.18576957313236833, 0.18420077552055492, 0.10400716200920529, 0.006700197345812687, -0.013153377229925888, -0.20594428034349418, 0.11158870239795625, -0.25038395892700244, -0.10605912325882363, -0.023693954360660636, 0.0300478995670618, 0.044121321429894576, -0.2943199096226144, -0.046798381922986014, 0.02625328715055667, 0.05160375834367741, -0.015288704594104797, -0.140041322190443, -0.04152608561950425, 0.18272008803865775, 0.05548856401783896, 0.000228086582802493, 0.09275510068447597, -0.08714949339360598, -0.152976507769266, 0.4255441016164319, -0.03933003048637304, -0.20145777247888946, 0.12244781442040086, -0.0638918412110672, -0.16627581632192964, 0.06795859734538472, 0.20299717474557544, 0.0758086853371612, -0.13589406167906334, 0.01929751541679618, -0.08794374265119262, 0.20608010085235381, 0.10539565994885974, 0.015381352039289543, 0.23232260423755252, 0.1390485205706316, 0.07425477208526826, 0.16781376801356246, -0.011998712601696795, -0.07241588746446409, -0.26907792671358793, -0.13741280263471792, -0.18396032254757552, 0.07994277676802942, -0.07041725463330231, -0.1533133700789734, 0.44229488991115284, 0.06800459099039649, 0.2021859134119218, 0.0016008767516127434, 0.26975972311646174, 0.14124025918972202, 0.06714358563727603, 0.0674097622669805, 0.21247257340442519, 0.058070556573762463, 0.08400778962706013, -0.1083106411240952, 0.10422380376692819, 0.03341706405425894]
|
1,803.04626
|
Maintaining Natural Image Statistics with the Contextual Loss
|
Maintaining natural image statistics is a crucial factor in restoration and
generation of realistic looking images. When training CNNs, photorealism is
usually attempted by adversarial training (GAN), that pushes the output images
to lie on the manifold of natural images. GANs are very powerful, but not
perfect. They are hard to train and the results still often suffer from
artifacts. In this paper we propose a complementary approach, that could be
applied with or without GAN, whose goal is to train a feed-forward CNN to
maintain natural internal statistics. We look explicitly at the distribution of
features in an image and train the network to generate images with natural
feature distributions. Our approach reduces by orders of magnitude the number
of images required for training and achieves state-of-the-art results on both
single-image super-resolution, and high-resolution surface normal estimation.
|
cs.CV
|
maintaining natural image statistics is a crucial factor in restoration and generation of realistic looking images when training cnns photorealism is usually attempted by adversarial training gan that pushes the output images to lie on the manifold of natural images gans are very powerful but not perfect they are hard to train and the results still often suffer from artifacts in this paper we propose a complementary approach that could be applied with or without gan whose goal is to train a feedforward cnn to maintain natural internal statistics we look explicitly at the distribution of features in an image and train the network to generate images with natural feature distributions our approach reduces by orders of magnitude the number of images required for training and achieves stateoftheart results on both singleimage superresolution and highresolution surface normal estimation
|
[['maintaining', 'natural', 'image', 'statistics', 'is', 'a', 'crucial', 'factor', 'in', 'restoration', 'and', 'generation', 'of', 'realistic', 'looking', 'images', 'when', 'training', 'cnns', 'photorealism', 'is', 'usually', 'attempted', 'by', 'adversarial', 'training', 'gan', 'that', 'pushes', 'the', 'output', 'images', 'to', 'lie', 'on', 'the', 'manifold', 'of', 'natural', 'images', 'gans', 'are', 'very', 'powerful', 'but', 'not', 'perfect', 'they', 'are', 'hard', 'to', 'train', 'and', 'the', 'results', 'still', 'often', 'suffer', 'from', 'artifacts', 'in', 'this', 'paper', 'we', 'propose', 'a', 'complementary', 'approach', 'that', 'could', 'be', 'applied', 'with', 'or', 'without', 'gan', 'whose', 'goal', 'is', 'to', 'train', 'a', 'feedforward', 'cnn', 'to', 'maintain', 'natural', 'internal', 'statistics', 'we', 'look', 'explicitly', 'at', 'the', 'distribution', 'of', 'features', 'in', 'an', 'image', 'and', 'train', 'the', 'network', 'to', 'generate', 'images', 'with', 'natural', 'feature', 'distributions', 'our', 'approach', 'reduces', 'by', 'orders', 'of', 'magnitude', 'the', 'number', 'of', 'images', 'required', 'for', 'training', 'and', 'achieves', 'stateoftheart', 'results', 'on', 'both', 'singleimage', 'superresolution', 'and', 'highresolution', 'surface', 'normal', 'estimation']]
|
[0.004291584197283331, 0.04443654286824049, -0.056522150223642806, 0.09621584843726073, -0.11058110925301477, -0.15515823071768534, -0.014074266626688557, 0.48618486909654696, -0.2639403296786401, -0.37590469126049697, 0.06935158229190046, -0.25741382632269594, -0.1749133216149673, 0.18218364976717671, -0.17947588105132614, 0.08618996190784527, 0.13102442913762954, 0.03363907731144918, -0.06253100450756366, -0.291092495337817, 0.31787226004087354, 0.053939036761774965, 0.36806117689263995, -0.014628706024149838, 0.14470105602041536, -0.06935704536137063, -0.005464894062690977, -0.013239610348861881, -0.016313368194433693, 0.16130007692887718, 0.2960615506415944, 0.17806168481964024, 0.28812997337714163, -0.46496658657502005, -0.21821638106274, 0.101521921188881, 0.12939811862947798, 0.13254852320971913, -0.05706151728552051, -0.30877669023322885, 0.13395699821041385, -0.07517121022607645, 0.019335579994283078, -0.1545094418460908, -0.04727257507350431, -0.039101309538228386, -0.31974780787013646, 0.05360683023362704, 0.10143597034966924, 0.05076057121724538, -0.02806040779788695, -0.07105360262305138, -0.011364096622117728, 0.16915770604016184, 0.020124850209222, 0.08760629520090162, 0.11278245889980758, -0.25045248585967417, -0.08894077993539648, 0.40285820266960753, -0.055958695471813175, -0.21244371019723907, 0.20668416792877775, -0.08101664163658152, -0.10060099160393188, 0.15567850159562152, 0.20426559753389523, 0.12275912781057043, -0.12955019994779318, -0.021611210566597816, -0.02778067640554292, 0.17558458535864518, 0.07728926521604476, 0.003810290490155635, 0.17489032867108134, 0.2168592251415459, 0.042378116351808756, 0.15909209763344404, -0.18025540588638725, -0.016486503733018333, -0.21099275829729394, -0.07134945710878009, -0.22236598974626942, 0.025896991982797088, -0.06755062681232643, -0.14090562876367915, 0.41789590765087714, 0.2285752689374773, 0.26089878133633104, 0.10092404644018498, 0.3669201248743828, 0.05390166032273133, 0.15000500994316046, 0.05711527405968071, 0.1893572541007745, 0.038182932242373194, 0.07987391505689036, -0.11512877102570096, 0.056417645717822554, 0.027008360413753468]
|
1,803.04627
|
A Random Matrix Approach to Wide Band Spectrum Sensing: Unknown Noise
Variance Case
|
In this paper three different scenarios in wide band spectrum sensing have
been studied. While the signal and noise statistics are supposed to be
unspecified, random matrixes have been utilized in order to estimate the noise
variance. These scenarios are: 1- Number of subbands is specified and there is
enough information regarding being used or being unused for each of them. 2-
Number of subbands is known but there is no information about usage
distribution among them. 3- Number of subbands is unknown. Simulation results
showed the superior performance of the proposed scheme. Regarding the number of
samples, the proposed method requires less number of samples compared to the
cyclo-stationary spectrum sensing algorithms and more samples compared to the
energy detection based methods. But, regarding the detection probability, the
proposed method is superior compared to both other spectrum sensing methods.
|
eess.SP
|
in this paper three different scenarios in wide band spectrum sensing have been studied while the signal and noise statistics are supposed to be unspecified random matrixes have been utilized in order to estimate the noise variance these scenarios are 1 number of subbands is specified and there is enough information regarding being used or being unused for each of them 2 number of subbands is known but there is no information about usage distribution among them 3 number of subbands is unknown simulation results showed the superior performance of the proposed scheme regarding the number of samples the proposed method requires less number of samples compared to the cyclostationary spectrum sensing algorithms and more samples compared to the energy detection based methods but regarding the detection probability the proposed method is superior compared to both other spectrum sensing methods
|
[['in', 'this', 'paper', 'three', 'different', 'scenarios', 'in', 'wide', 'band', 'spectrum', 'sensing', 'have', 'been', 'studied', 'while', 'the', 'signal', 'and', 'noise', 'statistics', 'are', 'supposed', 'to', 'be', 'unspecified', 'random', 'matrixes', 'have', 'been', 'utilized', 'in', 'order', 'to', 'estimate', 'the', 'noise', 'variance', 'these', 'scenarios', 'are', '1', 'number', 'of', 'subbands', 'is', 'specified', 'and', 'there', 'is', 'enough', 'information', 'regarding', 'being', 'used', 'or', 'being', 'unused', 'for', 'each', 'of', 'them', '2', 'number', 'of', 'subbands', 'is', 'known', 'but', 'there', 'is', 'no', 'information', 'about', 'usage', 'distribution', 'among', 'them', '3', 'number', 'of', 'subbands', 'is', 'unknown', 'simulation', 'results', 'showed', 'the', 'superior', 'performance', 'of', 'the', 'proposed', 'scheme', 'regarding', 'the', 'number', 'of', 'samples', 'the', 'proposed', 'method', 'requires', 'less', 'number', 'of', 'samples', 'compared', 'to', 'the', 'cyclostationary', 'spectrum', 'sensing', 'algorithms', 'and', 'more', 'samples', 'compared', 'to', 'the', 'energy', 'detection', 'based', 'methods', 'but', 'regarding', 'the', 'detection', 'probability', 'the', 'proposed', 'method', 'is', 'superior', 'compared', 'to', 'both', 'other', 'spectrum', 'sensing', 'methods']]
|
[-0.0881030761162817, 0.055074269746962404, -0.05697108075754451, 0.06490292521942008, -0.04070752334914037, -0.17482014485368771, 0.023769999385279204, 0.423204565074827, -0.21757017724615121, -0.38166118206073796, 0.1280978454551327, -0.3126761761493981, -0.1297169347830017, 0.22162418040679768, -0.09688998611111727, 0.0955364253438477, 0.033798153106389305, 0.07320980258019907, -0.025097734607490044, -0.2807324886987252, 0.25665732293107013, 0.07446176705249985, 0.33536487786498453, 0.0002951777174270579, 0.062197044754533894, -0.03201376524521038, -0.0746353014912789, 0.010492630257171445, -0.05113386086720441, 0.10601429164442899, 0.27961032216304116, 0.13662305112728582, 0.29084002738818526, -0.3775627235748938, -0.2522013631649315, 0.14960407445822577, 0.1555538749122726, 0.09945057773397172, -0.060885275656411456, -0.2599118343055514, 0.1414017099587779, -0.15992698221733528, -0.023910432874358126, -0.07592374409681985, -0.023351471781331512, 0.019782654767706326, -0.28225274667409916, 0.06130566048835005, 0.022942178403692587, 0.012488543164051537, -0.04101519059788968, -0.18821265867113002, 0.019534610248436887, 0.166142960619514, 0.09339583691409124, -0.02707050764916598, 0.10630050310865044, -0.11766838077289452, -0.11273329948474253, 0.3713161369494628, 0.006262077330445338, -0.20915262470287935, 0.2305718406486059, -0.13173464060694512, -0.0934326684933954, 0.20011429543207798, 0.1402341758233628, 0.10715187017340214, -0.13687330201667333, 0.04643018102215137, 0.006953548154394542, 0.1975469950403619, 0.06399490632050271, 0.09800410470509502, 0.13630606582488067, 0.15486502318110848, 0.08292008550238929, 0.10018730543545513, -0.14658540596927716, -0.04834911051938044, -0.19447240395737544, -0.09366142634036285, -0.2676668850039797, -0.03800739161670208, -0.05528820773688494, -0.10459888305382005, 0.4250825282245257, 0.2027887273978974, 0.1709411013986807, 0.046063881337509625, 0.35240067331386465, 0.10414492022578738, 0.06214228801296225, 0.08997785292366253, 0.19831228425027803, 0.14459500942113143, 0.06314209038558016, -0.1547096043442642, 0.10677785222318821, -0.03658298245365066]
|
1,803.04628
|
Tutorial on dynamic average consensus: the problem, its applications,
and the algorithms
|
This paper considers the problem of dynamic average consensus algorithm
design for a group of communicating agents. This problem consists of designing
a distributed algorithm that enables a group of agents with communication and
computation capabilities to use local interactions to track the average of
locally time-varying reference signals at each agent. The objective of this
article is to provide an overview of the dynamic average consensus problem that
serves as a comprehensive introduction to the problem definition, its
applications, and the distributed methods available to solve them. Our primary
intention, rather than providing a full account of all the available
literature, is to introduce the reader, in a tutorial fashion, to the main
ideas behind dynamic average consensus algorithms, the performance trade-offs
considered in their design, and the requirements needed for their analysis and
convergence guarantees.
|
cs.SY
|
this paper considers the problem of dynamic average consensus algorithm design for a group of communicating agents this problem consists of designing a distributed algorithm that enables a group of agents with communication and computation capabilities to use local interactions to track the average of locally timevarying reference signals at each agent the objective of this article is to provide an overview of the dynamic average consensus problem that serves as a comprehensive introduction to the problem definition its applications and the distributed methods available to solve them our primary intention rather than providing a full account of all the available literature is to introduce the reader in a tutorial fashion to the main ideas behind dynamic average consensus algorithms the performance tradeoffs considered in their design and the requirements needed for their analysis and convergence guarantees
|
[['this', 'paper', 'considers', 'the', 'problem', 'of', 'dynamic', 'average', 'consensus', 'algorithm', 'design', 'for', 'a', 'group', 'of', 'communicating', 'agents', 'this', 'problem', 'consists', 'of', 'designing', 'a', 'distributed', 'algorithm', 'that', 'enables', 'a', 'group', 'of', 'agents', 'with', 'communication', 'and', 'computation', 'capabilities', 'to', 'use', 'local', 'interactions', 'to', 'track', 'the', 'average', 'of', 'locally', 'timevarying', 'reference', 'signals', 'at', 'each', 'agent', 'the', 'objective', 'of', 'this', 'article', 'is', 'to', 'provide', 'an', 'overview', 'of', 'the', 'dynamic', 'average', 'consensus', 'problem', 'that', 'serves', 'as', 'a', 'comprehensive', 'introduction', 'to', 'the', 'problem', 'definition', 'its', 'applications', 'and', 'the', 'distributed', 'methods', 'available', 'to', 'solve', 'them', 'our', 'primary', 'intention', 'rather', 'than', 'providing', 'a', 'full', 'account', 'of', 'all', 'the', 'available', 'literature', 'is', 'to', 'introduce', 'the', 'reader', 'in', 'a', 'tutorial', 'fashion', 'to', 'the', 'main', 'ideas', 'behind', 'dynamic', 'average', 'consensus', 'algorithms', 'the', 'performance', 'tradeoffs', 'considered', 'in', 'their', 'design', 'and', 'the', 'requirements', 'needed', 'for', 'their', 'analysis', 'and', 'convergence', 'guarantees']]
|
[-0.15964529976031205, -0.010544292983003335, -0.09407049933504517, 0.032191828721760345, -0.13642192033398218, -0.14665450935802646, 0.08550189644264833, 0.4023096651980912, -0.28079825913003326, -0.3487501514898817, 0.0995111731781767, -0.22762651377133208, -0.15511688168660268, 0.14366819366581574, -0.10501356621720678, 0.0634799930568696, 0.06289637603382342, 0.06752940229107082, -0.04450492001730051, -0.28845250562435004, 0.2580847722719539, 0.09978030292303676, 0.2936131193584688, 0.013561887340280262, 0.1291091822973201, 0.04805725237803302, -0.05938118951136831, 0.014234047478241642, -0.1109185573636651, 0.1911569395252116, 0.3077257167493557, 0.20235811948545113, 0.3862777088027801, -0.41718054152209394, -0.15531043837316008, 0.10295801927729843, 0.1479775205961544, 0.10644437352120605, -0.03804334013953968, -0.25611790505842896, 0.096789218587325, -0.16773746941021106, -0.09594129199454439, -0.020690660383280393, -0.017531081636429486, 0.03592630961134921, -0.2909337904603377, -0.004032596510692234, 0.05889185082616053, 0.05520257682124846, -0.06855145187977953, -0.082818757293977, 0.08589862893253945, 0.20127816337847362, 0.022272897631874865, 0.01760041441455701, 0.13976384285517907, -0.10422225040383637, -0.1540558986947022, 0.41684586470470814, 0.008259534412535267, -0.19495778554947674, 0.17483433652125355, -0.00963559998947121, -0.13254098958900049, 0.11074384894344384, 0.23539934778776372, 0.1181320979864928, -0.19683981056063415, 0.035829617810116086, -0.006707986371496516, 0.16572057404793308, -0.043884793381431024, 0.051689993151647115, 0.1514957971670359, 0.2245672249989788, 0.15257620036493252, 0.14218512210437526, 0.012490815515111602, -0.12130322290183365, -0.28765885253992596, -0.14539228300190102, -0.1474861993248758, -0.023032499785725382, -0.050956677449578214, -0.13898830159812023, 0.42085421457886696, 0.2112378092724014, 0.15639906436422446, 0.12607184166673327, 0.3889403881056465, 0.040558203024939246, 0.006535935878454551, 0.11892662566651448, 0.18491297363079268, 0.10288946713273325, 0.15008973251402813, -0.19578772980792458, 0.10167885071387256, 0.029437318794347727]
|
1,803.04629
|
3D Video Quality Metric for 3D Video Compression
|
As the evolution of multiview display technology is bringing glasses-free
3DTV closer to reality, MPEG and VCEG are preparing an extension to HEVC to
encode multiview video content. View synthesis in the current version of the 3D
video codec is performed using PSNR as a quality metric measure. In this paper,
we propose a full- reference Human-Visual-System based 3D video quality metric
to be used in multiview encoding as an alternative to PSNR. Performance of our
metric is tested in a 2-view case scenario. The quality of the compressed
stereo pair, formed from a decoded view and a synthesized view, is evaluated at
the encoder side. The performance is verified through a series of subjective
tests and compared with that of PSNR, SSIM, MS-SSIM, VIFp, and VQM metrics.
Experimental results showed that our 3D quality metric has the highest
correlation with Mean Opinion Scores (MOS) compared to the other tested
metrics.
|
eess.IV
|
as the evolution of multiview display technology is bringing glassesfree 3dtv closer to reality mpeg and vceg are preparing an extension to hevc to encode multiview video content view synthesis in the current version of the 3d video codec is performed using psnr as a quality metric measure in this paper we propose a full reference humanvisualsystem based 3d video quality metric to be used in multiview encoding as an alternative to psnr performance of our metric is tested in a 2view case scenario the quality of the compressed stereo pair formed from a decoded view and a synthesized view is evaluated at the encoder side the performance is verified through a series of subjective tests and compared with that of psnr ssim msssim vifp and vqm metrics experimental results showed that our 3d quality metric has the highest correlation with mean opinion scores mos compared to the other tested metrics
|
[['as', 'the', 'evolution', 'of', 'multiview', 'display', 'technology', 'is', 'bringing', 'glassesfree', '3dtv', 'closer', 'to', 'reality', 'mpeg', 'and', 'vceg', 'are', 'preparing', 'an', 'extension', 'to', 'hevc', 'to', 'encode', 'multiview', 'video', 'content', 'view', 'synthesis', 'in', 'the', 'current', 'version', 'of', 'the', '3d', 'video', 'codec', 'is', 'performed', 'using', 'psnr', 'as', 'a', 'quality', 'metric', 'measure', 'in', 'this', 'paper', 'we', 'propose', 'a', 'full', 'reference', 'humanvisualsystem', 'based', '3d', 'video', 'quality', 'metric', 'to', 'be', 'used', 'in', 'multiview', 'encoding', 'as', 'an', 'alternative', 'to', 'psnr', 'performance', 'of', 'our', 'metric', 'is', 'tested', 'in', 'a', '2view', 'case', 'scenario', 'the', 'quality', 'of', 'the', 'compressed', 'stereo', 'pair', 'formed', 'from', 'a', 'decoded', 'view', 'and', 'a', 'synthesized', 'view', 'is', 'evaluated', 'at', 'the', 'encoder', 'side', 'the', 'performance', 'is', 'verified', 'through', 'a', 'series', 'of', 'subjective', 'tests', 'and', 'compared', 'with', 'that', 'of', 'psnr', 'ssim', 'msssim', 'vifp', 'and', 'vqm', 'metrics', 'experimental', 'results', 'showed', 'that', 'our', '3d', 'quality', 'metric', 'has', 'the', 'highest', 'correlation', 'with', 'mean', 'opinion', 'scores', 'mos', 'compared', 'to', 'the', 'other', 'tested', 'metrics']]
|
[-0.061587343030698495, -0.05317498551189664, -0.11807819730474627, 0.03525569343186711, -0.045379997956668576, -0.1534372303213873, -0.003997218912333404, 0.4624634872458569, -0.21638844622305453, -0.3243326280163984, 0.06053286787658317, -0.308472469391633, -0.14840544659519977, 0.18417093490429018, -0.17631050722591007, 0.0901604471488996, 0.11195755090998256, 0.10211043413218161, -0.1290853608699439, -0.2980831187116365, 0.2535798445372676, 0.1167578320664813, 0.40249661576921403, 0.003412703446858907, 0.12148226729964148, -0.031462207742749826, -0.03428373480700467, 0.06236013160916428, -0.04726706818114944, 0.15251913282076177, 0.27542313375695265, 0.21580650356968176, 0.2566756311523384, -0.34760527846671335, -0.2191781736527608, 0.009233766125574108, 0.11207078129359305, 0.036621960331303105, -0.09809912029137095, -0.37080425700038827, 0.14721111266248643, -0.15914750825103424, 0.021877936527694333, -0.06532332368756402, -0.06039153781324012, -0.040362133414880055, -0.3060461317319806, 0.029279685258699506, -0.027803185512311757, 0.08748753936578559, -0.0700325584294249, -0.10624321594145404, 0.009250814866989034, 0.1977291071168721, 0.03467852282752474, 0.13483835092732963, 0.14205347370573204, -0.14675608617397126, -0.1501567521150868, 0.4400520765618102, -0.1070648727875541, -0.2266922436338811, 0.15654116147676203, -0.05449027385026829, -0.07237959534790182, 0.1215720522498125, 0.18126110217297986, 0.08352264109042103, -0.1276368012983505, -0.008750347925305418, -0.026431298839432276, 0.22545683171683029, 0.10330506845071197, 0.047534328866239685, 0.1673024361410931, 0.22508197413655381, -0.025783341556583364, 0.17208296289366082, -0.12446566398035454, -0.03750894026199279, -0.20550467196871106, -0.1714822638665058, -0.20443724883458744, -0.014174795243889093, -0.12946921174234252, -0.13951165804779794, 0.37755325848670446, 0.1982870889916914, 0.1989499210214166, 0.08830755523546305, 0.3792381223198664, 0.040463560027204304, 0.05471669621877245, 0.03876722451899048, 0.2108018387695902, 0.02826671284298119, 0.1423207633165413, -0.12324797155252619, 0.07546648312972425, 0.08658453894855633]
|
1,803.0463
|
An integral representation of operator means via the power means and an
application to the Ando-Hiai inequality
|
An integral representation of an operator mean via the power means is
obtained. As an application, we shall give explicit condition of operator means
that the Ando-Hiai inequality holds.
|
math.FA
|
an integral representation of an operator mean via the power means is obtained as an application we shall give explicit condition of operator means that the andohiai inequality holds
|
[['an', 'integral', 'representation', 'of', 'an', 'operator', 'mean', 'via', 'the', 'power', 'means', 'is', 'obtained', 'as', 'an', 'application', 'we', 'shall', 'give', 'explicit', 'condition', 'of', 'operator', 'means', 'that', 'the', 'andohiai', 'inequality', 'holds']]
|
[-0.1405726551692451, 0.04099471433286892, -0.1382292272394587, 0.08415545782090389, -0.09985103175557893, -0.0656752164379276, -0.02581783040458786, 0.3460100806992629, -0.3174482869177029, -0.20565120985024962, 0.13431720209211626, -0.27397939146913847, -0.19560879244115845, 0.2673622161342666, -0.09188671702326372, 0.0028719611722847513, 0.04285354025918862, 0.12432469820989103, -0.08563198117089682, -0.20566935670273057, 0.3643369173695301, 0.0758125296119472, 0.19929239359395257, 0.13030976233281324, 0.1828318397225491, 0.08490163312646849, 0.03773714512072761, -0.011879341114826244, -0.18350293465758521, 0.13602723435956407, 0.17032745894815388, 0.15874527972833863, 0.2798108579269771, -0.4481110802112982, -0.10915617320228946, 0.16861835671267633, 0.17351533512681208, 0.013780839612771725, -0.09366124210044227, -0.25701250412083904, 0.04846162360225772, -0.18470687380638615, -0.2509741246186454, -0.14016573959640388, -0.02955532523578611, -0.028417613293076384, -0.40802375946579306, 0.10191675609555738, 0.09824705897862542, 0.1424026472879381, -0.1250821256745157, -0.07985409108343823, 0.04483202634507726, 0.11724876201358335, -0.0026274127002548554, -0.00519487454459585, 0.049878157755552696, -0.07610664238896349, -0.11490429186358533, 0.2780782212984973, -0.08834253024341988, -0.25105253144584855, 0.018384557666963543, -0.03394268642597158, -0.07429316768358493, 0.021247176244726468, 0.024299635840901012, 0.14681432693233265, -0.15721281797721467, 0.14819374089610987, -0.11011924194814317, 0.1210263851259289, 0.03825102884579321, 0.04644924201520866, 0.03057331933061881, 0.0639975512207582, 0.18320450103231545, 0.20803064878644614, 0.012345162059726387, -0.02619218440919087, -0.4003641890233447, -0.24513844220802702, -0.23031044168526243, 0.1317581214203403, -0.16051902531260817, -0.14014351856091928, 0.30412196554243565, 0.05161502893114912, 0.16033723141098843, 0.09070754311336525, 0.24796096428201117, 0.32655622588133376, 0.006095043672569867, 0.04686119065395203, 0.14843205568091622, 0.1904756642621139, 0.07704922344920964, -0.13891397553078574, 0.008642360688476214, 0.20554244813734088]
|
1,803.04631
|
CuLDA_CGS: Solving Large-scale LDA Problems on GPUs
|
Latent Dirichlet Allocation(LDA) is a popular topic model. Given the fact
that the input corpus of LDA algorithms consists of millions to billions of
tokens, the LDA training process is very time-consuming, which may prevent the
usage of LDA in many scenarios, e.g., online service. GPUs have benefited
modern machine learning algorithms and big data analysis as they can provide
high memory bandwidth and computation power. Therefore, many frameworks, e.g.
Ten- sorFlow, Caffe, CNTK, support to use GPUs for accelerating the popular
machine learning data-intensive algorithms. However, we observe that LDA
solutions on GPUs are not satisfying.
In this paper, we present CuLDA_CGS, a GPU-based efficient and scalable
approach to accelerate large-scale LDA problems. CuLDA_CGS is designed to
efficiently solve LDA problems at high throughput. To it, we first delicately
design workload partition and synchronization mechanism to exploit the benefits
of mul- tiple GPUs. Then, we offload the LDA sampling process to each
individual GPU by optimizing from the sampling algorithm, par- allelization,
and data compression perspectives. Evaluations show that compared with
state-of-the-art LDA solutions, CuLDA_CGS outperforms them by a large margin
(up to 7.3X) on a single GPU. CuLDA_CGS is able to achieve extra 3.0X speedup
on 4 GPUs. The source code is publicly available on https://github.com/cuMF/
CuLDA_CGS.
|
cs.DC
|
latent dirichlet allocationlda is a popular topic model given the fact that the input corpus of lda algorithms consists of millions to billions of tokens the lda training process is very timeconsuming which may prevent the usage of lda in many scenarios eg online service gpus have benefited modern machine learning algorithms and big data analysis as they can provide high memory bandwidth and computation power therefore many frameworks eg ten sorflow caffe cntk support to use gpus for accelerating the popular machine learning dataintensive algorithms however we observe that lda solutions on gpus are not satisfying in this paper we present culda_cgs a gpubased efficient and scalable approach to accelerate largescale lda problems culda_cgs is designed to efficiently solve lda problems at high throughput to it we first delicately design workload partition and synchronization mechanism to exploit the benefits of mul tiple gpus then we offload the lda sampling process to each individual gpu by optimizing from the sampling algorithm par allelization and data compression perspectives evaluations show that compared with stateoftheart lda solutions culda_cgs outperforms them by a large margin up to 73x on a single gpu culda_cgs is able to achieve extra 30x speedup on 4 gpus the source code is publicly available on httpsgithubcomcumf culda_cgs
|
[['latent', 'dirichlet', 'allocationlda', 'is', 'a', 'popular', 'topic', 'model', 'given', 'the', 'fact', 'that', 'the', 'input', 'corpus', 'of', 'lda', 'algorithms', 'consists', 'of', 'millions', 'to', 'billions', 'of', 'tokens', 'the', 'lda', 'training', 'process', 'is', 'very', 'timeconsuming', 'which', 'may', 'prevent', 'the', 'usage', 'of', 'lda', 'in', 'many', 'scenarios', 'eg', 'online', 'service', 'gpus', 'have', 'benefited', 'modern', 'machine', 'learning', 'algorithms', 'and', 'big', 'data', 'analysis', 'as', 'they', 'can', 'provide', 'high', 'memory', 'bandwidth', 'and', 'computation', 'power', 'therefore', 'many', 'frameworks', 'eg', 'ten', 'sorflow', 'caffe', 'cntk', 'support', 'to', 'use', 'gpus', 'for', 'accelerating', 'the', 'popular', 'machine', 'learning', 'dataintensive', 'algorithms', 'however', 'we', 'observe', 'that', 'lda', 'solutions', 'on', 'gpus', 'are', 'not', 'satisfying', 'in', 'this', 'paper', 'we', 'present', 'culda_cgs', 'a', 'gpubased', 'efficient', 'and', 'scalable', 'approach', 'to', 'accelerate', 'largescale', 'lda', 'problems', 'culda_cgs', 'is', 'designed', 'to', 'efficiently', 'solve', 'lda', 'problems', 'at', 'high', 'throughput', 'to', 'it', 'we', 'first', 'delicately', 'design', 'workload', 'partition', 'and', 'synchronization', 'mechanism', 'to', 'exploit', 'the', 'benefits', 'of', 'mul', 'tiple', 'gpus', 'then', 'we', 'offload', 'the', 'lda', 'sampling', 'process', 'to', 'each', 'individual', 'gpu', 'by', 'optimizing', 'from', 'the', 'sampling', 'algorithm', 'par', 'allelization', 'and', 'data', 'compression', 'perspectives', 'evaluations', 'show', 'that', 'compared', 'with', 'stateoftheart', 'lda', 'solutions', 'culda_cgs', 'outperforms', 'them', 'by', 'a', 'large', 'margin', 'up', 'to', '73x', 'on', 'a', 'single', 'gpu', 'culda_cgs', 'is', 'able', 'to', 'achieve', 'extra', '30x', 'speedup', 'on', '4', 'gpus', 'the', 'source', 'code', 'is', 'publicly', 'available', 'on', 'httpsgithubcomcumf', 'culda_cgs']]
|
[-0.08069607743103899, -0.02888520184036308, -0.0635447721675183, 0.07815256751054071, -0.1499183605090507, -0.20209131505593514, 0.07529128341567115, 0.46405961569308224, -0.3046447093083153, -0.36858653264047886, 0.10740893039099637, -0.2865107179474135, -0.09803846325850775, 0.22960483447142235, -0.07204472460968814, 0.1127342113471156, 0.18273185106453224, 0.03206807829440205, -0.07682383081986506, -0.35560323791725346, 0.222536599968107, 0.1262594857027085, 0.35497288510725533, 0.013627539386574938, 0.07896623251215415, -0.06263543907281699, -0.006335734079469863, -0.048146484885717974, -0.04089988970128651, 0.18727187755816047, 0.3348386556280831, 0.21190704267869875, 0.3775493470020592, -0.461084350500509, -0.19038017151099676, 0.0704130654571379, 0.14648538946614315, 0.06558519299763697, -0.03097403429909745, -0.22692711627590062, 0.12702990475549245, -0.19741048542014097, 0.023442271482018592, -0.1981257799907149, -0.06394987479779074, 0.024082894489006364, -0.2884226540867601, 0.050135105900303685, 0.00942389519819628, 0.024778018050004267, -0.028026044175471856, -0.16285140652693267, 0.09267284786916401, 0.07418952507500365, 0.02970233910465025, 0.06747018030134834, 0.14192400263956956, -0.13561529155483795, -0.17011108164205352, 0.4020412481272394, -0.046014996677257336, -0.17221295293330133, 0.1975035213490098, 0.025839231520081933, -0.1945590520101301, 0.10182989970102761, 0.27020773591102976, 0.08053994289310017, -0.15350950263142224, 0.0785359343199073, 0.010715476225934994, 0.20105316092314435, 0.06312085108185024, -0.03455764013659028, 0.137694847810159, 0.243937273898605, 0.035516161454369054, 0.12108185775216343, -0.08600565102824476, -0.11487363569565046, -0.13643524322423686, -0.11709342541702056, -0.2314535213014997, -0.043343840705417885, -0.12896854029842642, -0.1721721937907046, 0.3406520814010964, 0.23937309853443242, 0.13044280766337676, 0.09709640680156757, 0.3761722288971532, 0.020201798681581156, 0.16303669425203393, 0.21941691333003052, 0.0890005673270546, -0.000256670874010012, 0.15879965743990343, -0.15154985255602457, 0.027121822025346597, -0.017878830930200016]
|
1,803.04632
|
Growth of a Black Hole on a Self-Gravitating Radiation
|
We feed a black hole on a self-gravitating radiation and observe what happens
during the process. Considering a spherical shell of radiation, we show that
the contribution of self-gravity makes the thermodynamic interaction through
the bottom of the shell be distinguished from thermodynamic interaction through
its top. The growth of a black hole horizon appears to be a sudden jump rather
than a sequential increase. We additionally show that much of the entropy will
be absorbed into the black hole only at the last moment of the collapse.
|
gr-qc hep-th
|
we feed a black hole on a selfgravitating radiation and observe what happens during the process considering a spherical shell of radiation we show that the contribution of selfgravity makes the thermodynamic interaction through the bottom of the shell be distinguished from thermodynamic interaction through its top the growth of a black hole horizon appears to be a sudden jump rather than a sequential increase we additionally show that much of the entropy will be absorbed into the black hole only at the last moment of the collapse
|
[['we', 'feed', 'a', 'black', 'hole', 'on', 'a', 'selfgravitating', 'radiation', 'and', 'observe', 'what', 'happens', 'during', 'the', 'process', 'considering', 'a', 'spherical', 'shell', 'of', 'radiation', 'we', 'show', 'that', 'the', 'contribution', 'of', 'selfgravity', 'makes', 'the', 'thermodynamic', 'interaction', 'through', 'the', 'bottom', 'of', 'the', 'shell', 'be', 'distinguished', 'from', 'thermodynamic', 'interaction', 'through', 'its', 'top', 'the', 'growth', 'of', 'a', 'black', 'hole', 'horizon', 'appears', 'to', 'be', 'a', 'sudden', 'jump', 'rather', 'than', 'a', 'sequential', 'increase', 'we', 'additionally', 'show', 'that', 'much', 'of', 'the', 'entropy', 'will', 'be', 'absorbed', 'into', 'the', 'black', 'hole', 'only', 'at', 'the', 'last', 'moment', 'of', 'the', 'collapse']]
|
[-0.10738351778127253, 0.14216478771149096, -0.11637020232261751, 0.12054459083192755, -0.05838032875379378, -0.09828498620878566, 0.06717407559004972, 0.319982155199713, -0.248326680527746, -0.2573182874740186, 0.10129427293379029, -0.30985013469630346, -0.0567859019422692, 0.1711785668740049, 0.007519406959049361, -0.060212967023703226, 0.04747044345078228, 0.06615733174046247, -0.10184195916570554, -0.20571763944727453, 0.3672848203939132, 0.10770715840838173, 0.20171576211578213, 0.055012974718754944, 0.07194299908058549, -0.023286771727725863, 0.041561795779588545, 0.06770415526327932, -0.11906882152255673, 0.04159033745103939, 0.13574991770623124, 0.10952195307684386, 0.26106150520354277, -0.4659028272991153, -0.22563153905899858, 0.06255948430043645, 0.1446871812751686, 0.16388765680180353, -0.08456992724412968, -0.2215653999129162, 0.04365814287236638, -0.2731642035174776, -0.12762078826993026, 0.021487659134932488, 0.03574756545607339, -0.024620333302168132, -0.22765854057136245, 0.10485309638633308, 0.10590356355533004, -0.06398571774744513, -0.08186498999897264, -0.014892969915474003, -0.10206439158223062, 0.09088625683745538, 0.10275497601800122, 0.018013045876035572, 0.2603965156277726, -0.12527856012853922, -0.04731165379052982, 0.3694447629492391, -0.07314380756609105, -0.13883546756485224, 0.1840866964670237, -0.25792434136383235, -0.07426747143670748, 0.18065331320130182, 0.16227715104733678, 0.16087599262457594, -0.11776978170614298, 0.056630228624271695, 0.023012222378218376, 0.19172062304146079, 0.10117822594475001, -0.01826813915448094, 0.3667262045412578, 0.18682163209252228, 0.00017564414619383487, 0.2330418159849201, -0.09347021915494803, -0.11328695328186521, -0.3017053793777119, -0.1814563981553709, -0.17675428256254896, 0.12530858205917123, -0.11236127626282476, -0.18415409907571634, 0.3329549676167186, 0.11338353040628135, 0.218984780351589, -0.0011188065056392754, 0.2655272782166404, 0.1099578544295086, 0.07911615043518726, 0.09755987106737765, 0.3489293272988024, 0.08290739914016078, 0.11950937544249675, -0.2583562540530693, 0.05002332539350556, 0.04089334907687523]
|
1,803.04633
|
Tight Piecewise Convex Relaxations for Global Optimization of Optimal
Power Flow
|
Since the alternating current optimal power flow (ACOPF) problem was
introduced in 1962, developing efficient solution algorithms for the problem
has been an active field of research. In recent years, there has been
increasing interest in convex relaxations-based solution approaches that are
often tight in practice. Based on these approaches, we develop tight piecewise
convex relaxations with convex-hull representations, an adaptive, multivariate
partitioning algorithm with bound tightening that progressively improves these
relaxations and, given sufficient time, converges to the globally optimal
solution. We illustrate the strengths of our algorithm using benchmark ACOPF
test cases from the literature. Computational results show that our novel
algorithm reduces the best-known optimality gaps for some hard ACOPF cases.
|
math.OC cs.SY
|
since the alternating current optimal power flow acopf problem was introduced in 1962 developing efficient solution algorithms for the problem has been an active field of research in recent years there has been increasing interest in convex relaxationsbased solution approaches that are often tight in practice based on these approaches we develop tight piecewise convex relaxations with convexhull representations an adaptive multivariate partitioning algorithm with bound tightening that progressively improves these relaxations and given sufficient time converges to the globally optimal solution we illustrate the strengths of our algorithm using benchmark acopf test cases from the literature computational results show that our novel algorithm reduces the bestknown optimality gaps for some hard acopf cases
|
[['since', 'the', 'alternating', 'current', 'optimal', 'power', 'flow', 'acopf', 'problem', 'was', 'introduced', 'in', '1962', 'developing', 'efficient', 'solution', 'algorithms', 'for', 'the', 'problem', 'has', 'been', 'an', 'active', 'field', 'of', 'research', 'in', 'recent', 'years', 'there', 'has', 'been', 'increasing', 'interest', 'in', 'convex', 'relaxationsbased', 'solution', 'approaches', 'that', 'are', 'often', 'tight', 'in', 'practice', 'based', 'on', 'these', 'approaches', 'we', 'develop', 'tight', 'piecewise', 'convex', 'relaxations', 'with', 'convexhull', 'representations', 'an', 'adaptive', 'multivariate', 'partitioning', 'algorithm', 'with', 'bound', 'tightening', 'that', 'progressively', 'improves', 'these', 'relaxations', 'and', 'given', 'sufficient', 'time', 'converges', 'to', 'the', 'globally', 'optimal', 'solution', 'we', 'illustrate', 'the', 'strengths', 'of', 'our', 'algorithm', 'using', 'benchmark', 'acopf', 'test', 'cases', 'from', 'the', 'literature', 'computational', 'results', 'show', 'that', 'our', 'novel', 'algorithm', 'reduces', 'the', 'bestknown', 'optimality', 'gaps', 'for', 'some', 'hard', 'acopf', 'cases']]
|
[-0.07445781218069317, -0.014193818889778784, -0.07152874386597392, 0.04895034639280191, -0.08419275418978876, -0.172413398701269, 0.050270548691989575, 0.4130258790621188, -0.2766676171954754, -0.32504034292908895, 0.14662417323138993, -0.2344980267148498, -0.20018896659984525, 0.24821762979624018, -0.11619346068792902, 0.16180369843094222, 0.07675602515351719, -0.03077289836266927, -0.07928857001459506, -0.3336459083968889, 0.22964238545206267, 0.06338673296788361, 0.32363979203577065, 0.06360068771806834, 0.09775203087705031, -0.026579067152224283, -0.0028574463820694824, 0.06999274142690089, -0.1582129251147364, 0.13828074232988324, 0.3100541651813495, 0.20855905483600445, 0.37062731502058427, -0.4436939268381195, -0.16982975528798008, 0.11965747222724675, 0.17365320242397422, 0.10020883952522963, -0.1083368630307125, -0.20819792655848823, 0.07408357153036756, -0.11008025264054273, -0.04656181921275843, -0.11622212914671683, 0.014656526038620984, 0.033049651757459594, -0.316236080140271, 0.05352332592072311, 0.0733004851097785, 0.011688112446098728, -0.11613259754819483, -0.1802526444353295, 0.10010268223117542, 0.07263392694830169, 0.09627398376278909, 0.062398939828215316, 0.06113086588911514, -0.08099916947395665, -0.17927060958484303, 0.3045246497752656, -0.010785585965763414, -0.21742036355148375, 0.18615455764955718, -0.03642337792346963, -0.1783783429228099, 0.15942609501359736, 0.19616420936474033, 0.17223934618245185, -0.12472029838842892, 0.1422939674379675, -0.11609623096553626, 0.1441738005445248, 0.062144156772049916, -0.030199605394649293, 0.11170797476718054, 0.20521947830519846, 0.19638831702275283, 0.16868656721023792, -0.01651568060320497, -0.1466002950230531, -0.2117513914683224, -0.07651502610054443, -0.19180430728835013, -0.05118157159465863, -0.11440757448994658, -0.13140950722009997, 0.3741135241842903, 0.154395575225106, 0.13659449118659295, 0.1266299417918235, 0.3368479919319033, 0.1543588939538036, 0.016383208375654917, 0.18949949987793127, 0.26548147647753895, 0.0956498445980086, 0.07213037890027714, -0.19911847157873608, 0.09465725364398409, 0.11003688378754047]
|
1,803.04634
|
Scattering of accelerated wave packets
|
Wave-packet scattering from a stationary potential is significantly modified
when the wave-packet is subject to an external time-dependent force during the
interaction. In the semiclassical limit, wave--packet motion is simply
described by Newtonian equations and the external force can, for example,
cancel the potential force making a potential barrier transparent. Here we
consider wave-packet scattering from reflectionless potentials, where in
general the potential becomes reflective when probed by an accelerated
wave-packet. In the particular case of the recently-introduced class of complex
Kramers-Kronig potentials we show that a broad class of time dependent forces
can be applied without inducing any scattering, while there is a breakdown of
the reflectionless property when there is a broadband distribution of initial
particle momentum, involving both positive and negative components.
|
quant-ph physics.optics
|
wavepacket scattering from a stationary potential is significantly modified when the wavepacket is subject to an external timedependent force during the interaction in the semiclassical limit wavepacket motion is simply described by newtonian equations and the external force can for example cancel the potential force making a potential barrier transparent here we consider wavepacket scattering from reflectionless potentials where in general the potential becomes reflective when probed by an accelerated wavepacket in the particular case of the recentlyintroduced class of complex kramerskronig potentials we show that a broad class of time dependent forces can be applied without inducing any scattering while there is a breakdown of the reflectionless property when there is a broadband distribution of initial particle momentum involving both positive and negative components
|
[['wavepacket', 'scattering', 'from', 'a', 'stationary', 'potential', 'is', 'significantly', 'modified', 'when', 'the', 'wavepacket', 'is', 'subject', 'to', 'an', 'external', 'timedependent', 'force', 'during', 'the', 'interaction', 'in', 'the', 'semiclassical', 'limit', 'wavepacket', 'motion', 'is', 'simply', 'described', 'by', 'newtonian', 'equations', 'and', 'the', 'external', 'force', 'can', 'for', 'example', 'cancel', 'the', 'potential', 'force', 'making', 'a', 'potential', 'barrier', 'transparent', 'here', 'we', 'consider', 'wavepacket', 'scattering', 'from', 'reflectionless', 'potentials', 'where', 'in', 'general', 'the', 'potential', 'becomes', 'reflective', 'when', 'probed', 'by', 'an', 'accelerated', 'wavepacket', 'in', 'the', 'particular', 'case', 'of', 'the', 'recentlyintroduced', 'class', 'of', 'complex', 'kramerskronig', 'potentials', 'we', 'show', 'that', 'a', 'broad', 'class', 'of', 'time', 'dependent', 'forces', 'can', 'be', 'applied', 'without', 'inducing', 'any', 'scattering', 'while', 'there', 'is', 'a', 'breakdown', 'of', 'the', 'reflectionless', 'property', 'when', 'there', 'is', 'a', 'broadband', 'distribution', 'of', 'initial', 'particle', 'momentum', 'involving', 'both', 'positive', 'and', 'negative', 'components']]
|
[-0.12942420215159656, 0.18778567085624673, -0.1094129578191787, 0.05441023842338472, -0.06626376204565168, -0.16856288527324795, -0.0016351460171863436, 0.38990483729541303, -0.28863303299248216, -0.22356478802114726, 0.012605964140035212, -0.27254163996130226, -0.15041718553751707, 0.18648292032536118, 0.001646224983036518, 0.05214991892129183, 0.04783775524049998, 0.03545378397125751, -0.008613794324919582, -0.13948706689849497, 0.3697678455933929, 0.03228829370997846, 0.23262378587201238, 0.10916349046677351, 0.09629390295222402, 0.09740193398296833, 0.04643333539832383, 0.03707839412242174, -0.056632341429183726, 0.02519239777326584, 0.17847911281185225, 0.02183171352930367, 0.2706316197663546, -0.4650652490109205, -0.25727515953779223, 0.11346003406867385, 0.1617412845827639, 0.171645685037598, -0.09858560110628604, -0.3088974635731429, -0.02888539850153029, -0.13426250878348947, -0.22169485995918511, -0.06446269315481186, 0.07576300428062678, 0.04488649323908612, -0.3009240146279335, 0.10548938011378049, 0.05959615451842547, 0.01109012157469988, -0.10761483501829207, -0.02191839163657278, 0.0006644118167459965, 0.07059993825037963, 0.040997410957701506, 0.02678417188860476, 0.16195654637366533, -0.15068435747222975, -0.04300125226099044, 0.41351364348828795, -0.09577684449404478, -0.2520077860802412, 0.14615934554766863, -0.13687806640565395, -0.007043727822601795, 0.15915434390679, 0.12352732662111521, 0.13379976515099407, -0.17245654935750646, 0.1323062045937986, 0.018828114219009876, 0.13863702594768257, 0.10784771427512169, -0.010563488183077424, 0.18798673205077648, 0.10187298960983754, 0.06413758472859626, 0.13406945470627396, -0.08133930554240942, -0.11952215208485722, -0.3257817269638181, -0.10936049088835716, -0.2034756791703403, 0.10447313069924712, -0.07280697799823246, -0.15945345228910446, 0.3771048269867897, 0.1134696541018784, 0.15362846470624208, 0.015447345428168774, 0.3049746058881283, 0.20838224648684264, 0.06710284386947751, 0.03622696116566658, 0.28472823993861673, 0.10376771591976285, 0.08592922943271697, -0.23200263695418835, 0.03351024886220694, -0.01869172474741936]
|
1,803.04635
|
Controlling the biphoton orbital angular momentum eigenmodes using
asymmetric pump vortex beam
|
We report on controlling the bi-photon orbital angular momentum (OAM)
eigenmodes in the spontaneous parametric down conversion process by simply
adjusting the asymmetry of the pump vortex beam. Adjusting the optic axis of
the spiral phase plate (SPP) of phase winding corresponding to OAM mode, l,
with respect to the beam propagation axis, we have transformed a Gaussian beam
into an asymmetric vortex beam with OAM modes, l, l-1, l-2, 0 with different
weightages. Pumping the nonlinear crystal with such asymmetric vortices and
controlling their asymmetry we have tailored the spiral spectrum of the
biphoton OAM eigenmodes. Calculating the Schmidt number of the biphotons we
observe the increase in the spiral bandwidth of the OAM eigenmodes and hence
the dimensionality of the system. Although we have restricted our study to show
the increase in spiral bandwidth of the biphotons by simply controlling the
asymmetry of the pump vortices, we can, in principle, further enhance the
dimensionality of the entangled states by manipulating the pump beam size and
crystal length.
|
quant-ph physics.optics
|
we report on controlling the biphoton orbital angular momentum oam eigenmodes in the spontaneous parametric down conversion process by simply adjusting the asymmetry of the pump vortex beam adjusting the optic axis of the spiral phase plate spp of phase winding corresponding to oam mode l with respect to the beam propagation axis we have transformed a gaussian beam into an asymmetric vortex beam with oam modes l l1 l2 0 with different weightages pumping the nonlinear crystal with such asymmetric vortices and controlling their asymmetry we have tailored the spiral spectrum of the biphoton oam eigenmodes calculating the schmidt number of the biphotons we observe the increase in the spiral bandwidth of the oam eigenmodes and hence the dimensionality of the system although we have restricted our study to show the increase in spiral bandwidth of the biphotons by simply controlling the asymmetry of the pump vortices we can in principle further enhance the dimensionality of the entangled states by manipulating the pump beam size and crystal length
|
[['we', 'report', 'on', 'controlling', 'the', 'biphoton', 'orbital', 'angular', 'momentum', 'oam', 'eigenmodes', 'in', 'the', 'spontaneous', 'parametric', 'down', 'conversion', 'process', 'by', 'simply', 'adjusting', 'the', 'asymmetry', 'of', 'the', 'pump', 'vortex', 'beam', 'adjusting', 'the', 'optic', 'axis', 'of', 'the', 'spiral', 'phase', 'plate', 'spp', 'of', 'phase', 'winding', 'corresponding', 'to', 'oam', 'mode', 'l', 'with', 'respect', 'to', 'the', 'beam', 'propagation', 'axis', 'we', 'have', 'transformed', 'a', 'gaussian', 'beam', 'into', 'an', 'asymmetric', 'vortex', 'beam', 'with', 'oam', 'modes', 'l', 'l1', 'l2', '0', 'with', 'different', 'weightages', 'pumping', 'the', 'nonlinear', 'crystal', 'with', 'such', 'asymmetric', 'vortices', 'and', 'controlling', 'their', 'asymmetry', 'we', 'have', 'tailored', 'the', 'spiral', 'spectrum', 'of', 'the', 'biphoton', 'oam', 'eigenmodes', 'calculating', 'the', 'schmidt', 'number', 'of', 'the', 'biphotons', 'we', 'observe', 'the', 'increase', 'in', 'the', 'spiral', 'bandwidth', 'of', 'the', 'oam', 'eigenmodes', 'and', 'hence', 'the', 'dimensionality', 'of', 'the', 'system', 'although', 'we', 'have', 'restricted', 'our', 'study', 'to', 'show', 'the', 'increase', 'in', 'spiral', 'bandwidth', 'of', 'the', 'biphotons', 'by', 'simply', 'controlling', 'the', 'asymmetry', 'of', 'the', 'pump', 'vortices', 'we', 'can', 'in', 'principle', 'further', 'enhance', 'the', 'dimensionality', 'of', 'the', 'entangled', 'states', 'by', 'manipulating', 'the', 'pump', 'beam', 'size', 'and', 'crystal', 'length']]
|
[-0.19310962431375267, 0.23887837598761255, -0.0790849220084809, -0.022837480097147964, -0.06651417368515973, -0.10581926512669705, 0.04728852010183257, 0.42573482774683, -0.28072854033092687, -0.27509241967672793, 0.019685571139799598, -0.2329958966828486, -0.021086014873353688, 0.17122471735388392, 0.029856933195408455, 0.10551364609479805, 0.006589043855160122, -0.0834208771396296, -0.02710611608221069, -0.14382425106417102, 0.3137565687196825, 0.04728202184954294, 0.36492227013470857, -0.02508955736804379, 0.11108836170131638, 0.040682930373256064, 0.0021970312678690493, -0.08701501109157882, -0.13292118101849182, 0.08581430511652442, 0.19117943799266449, 0.025465397577534413, 0.21825833689178942, -0.41670172897404467, -0.17281269541384994, 0.08332047032291544, 0.2179892261143355, 0.1663693121796992, -0.01086317477734021, -0.28938854932812585, 0.00849803040229809, -0.11790050578044628, -0.1902076777473048, -0.05739464239388175, 0.012385777150936557, 0.06447115959737383, -0.2427260026600234, 0.059535414961403646, 0.08514377295133277, 0.07329071497202978, 0.010447278508596872, -0.07940081341299586, -0.12571496121756204, 0.01816979599234885, 0.04484718381933532, 0.024794004090163396, 0.1521048372853878, -0.13175840869879338, -0.12019645433718636, 0.3367096627232365, -0.024650131318492252, -0.2120748199632711, 0.05595851557869354, -0.20714195876863797, 0.03007024867713628, 0.17893814647256137, 0.19139199264102325, 0.06808978147231616, 0.007284578294135057, -0.02811744542807594, -0.03070978622349012, 0.2116927308300455, 0.17580399861746637, 0.14484487260146253, 0.24736445444152474, 0.1288104305545298, 0.061429857895310046, 0.21089558789407362, -0.16239648830619524, -0.044807478984247494, -0.2583951397121129, -0.13917562164939368, -0.2214803332550735, 0.019747468529919373, -0.08998242360872104, -0.0787601688623252, 0.4710859422346015, 0.07662804013107126, 0.1595342567947572, -0.04213189700144459, 0.30374789319535683, 0.16750005582835217, 0.10227267813769626, 0.04214066326943331, 0.302847647763921, 0.16525709067716554, 0.1180848083445064, -0.3823157383691101, -0.008615090510361557, -0.027133071869501525]
|
1,803.04636
|
TOM-Net: Learning Transparent Object Matting from a Single Image
|
This paper addresses the problem of transparent object matting. Existing
image matting approaches for transparent objects often require tedious
capturing procedures and long processing time, which limit their practical use.
In this paper, we first formulate transparent object matting as a refractive
flow estimation problem. We then propose a deep learning framework, called
TOM-Net, for learning the refractive flow. Our framework comprises two parts,
namely a multi-scale encoder-decoder network for producing a coarse prediction,
and a residual network for refinement. At test time, TOM-Net takes a single
image as input, and outputs a matte (consisting of an object mask, an
attenuation mask and a refractive flow field) in a fast feed-forward pass. As
no off-the-shelf dataset is available for transparent object matting, we create
a large-scale synthetic dataset consisting of 158K images of transparent
objects rendered in front of images sampled from the Microsoft COCO dataset. We
also collect a real dataset consisting of 876 samples using 14 transparent
objects and 60 background images. Promising experimental results have been
achieved on both synthetic and real data, which clearly demonstrate the
effectiveness of our approach.
|
cs.CV
|
this paper addresses the problem of transparent object matting existing image matting approaches for transparent objects often require tedious capturing procedures and long processing time which limit their practical use in this paper we first formulate transparent object matting as a refractive flow estimation problem we then propose a deep learning framework called tomnet for learning the refractive flow our framework comprises two parts namely a multiscale encoderdecoder network for producing a coarse prediction and a residual network for refinement at test time tomnet takes a single image as input and outputs a matte consisting of an object mask an attenuation mask and a refractive flow field in a fast feedforward pass as no offtheshelf dataset is available for transparent object matting we create a largescale synthetic dataset consisting of 158k images of transparent objects rendered in front of images sampled from the microsoft coco dataset we also collect a real dataset consisting of 876 samples using 14 transparent objects and 60 background images promising experimental results have been achieved on both synthetic and real data which clearly demonstrate the effectiveness of our approach
|
[['this', 'paper', 'addresses', 'the', 'problem', 'of', 'transparent', 'object', 'matting', 'existing', 'image', 'matting', 'approaches', 'for', 'transparent', 'objects', 'often', 'require', 'tedious', 'capturing', 'procedures', 'and', 'long', 'processing', 'time', 'which', 'limit', 'their', 'practical', 'use', 'in', 'this', 'paper', 'we', 'first', 'formulate', 'transparent', 'object', 'matting', 'as', 'a', 'refractive', 'flow', 'estimation', 'problem', 'we', 'then', 'propose', 'a', 'deep', 'learning', 'framework', 'called', 'tomnet', 'for', 'learning', 'the', 'refractive', 'flow', 'our', 'framework', 'comprises', 'two', 'parts', 'namely', 'a', 'multiscale', 'encoderdecoder', 'network', 'for', 'producing', 'a', 'coarse', 'prediction', 'and', 'a', 'residual', 'network', 'for', 'refinement', 'at', 'test', 'time', 'tomnet', 'takes', 'a', 'single', 'image', 'as', 'input', 'and', 'outputs', 'a', 'matte', 'consisting', 'of', 'an', 'object', 'mask', 'an', 'attenuation', 'mask', 'and', 'a', 'refractive', 'flow', 'field', 'in', 'a', 'fast', 'feedforward', 'pass', 'as', 'no', 'offtheshelf', 'dataset', 'is', 'available', 'for', 'transparent', 'object', 'matting', 'we', 'create', 'a', 'largescale', 'synthetic', 'dataset', 'consisting', 'of', '158k', 'images', 'of', 'transparent', 'objects', 'rendered', 'in', 'front', 'of', 'images', 'sampled', 'from', 'the', 'microsoft', 'coco', 'dataset', 'we', 'also', 'collect', 'a', 'real', 'dataset', 'consisting', 'of', '876', 'samples', 'using', '14', 'transparent', 'objects', 'and', '60', 'background', 'images', 'promising', 'experimental', 'results', 'have', 'been', 'achieved', 'on', 'both', 'synthetic', 'and', 'real', 'data', 'which', 'clearly', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approach']]
|
[-0.05109503341626133, -0.016788358653170493, -0.08612382806123882, 0.021404997986910927, -0.10563757227045363, -0.1564504236068941, 0.005484242304785015, 0.47784288320690393, -0.23226732990461524, -0.36249455796433205, 0.10080690351985497, -0.2549624121706786, -0.16168574675786027, 0.22723116189919654, -0.14169213242206277, 0.08235460600522145, 0.1485892600524138, -0.003824099913522925, -0.016900221323379337, -0.2143797744470446, 0.2840042946602056, 0.008134248324653448, 0.3159115476554017, -0.0032986126151745734, 0.18753120834551976, 0.005636638437863439, -0.05133346716225471, 0.004987317723292938, -0.019801211640815778, 0.15580359587076362, 0.27932853536185576, 0.15618305719639783, 0.27541263099714264, -0.4240848081560967, -0.23412419871791548, 0.039714916887612126, 0.14307069227241143, 0.09629837175421214, -0.11412983276671224, -0.35102789371740073, 0.08341968320461962, -0.151631013407377, -0.0008749345459205949, -0.0932270122082074, 0.01292781137517127, -0.08334155938254022, -0.31611295805677125, 0.03798184551487793, 0.029836271358046517, 0.06704196908369499, -0.05758775351822133, -0.06919285359174904, 0.050661599978490776, 0.18261300883276146, -0.04449970148245642, 0.02710468469835494, 0.15043035752150108, -0.18481792305069772, -0.08419695867822789, 0.39435239890894, -0.04482742386550814, -0.1797578391953088, 0.18575279123615474, -0.00258613044633935, -0.11069534947518664, 0.14938044391633215, 0.23757287020524256, 0.18371733515928296, -0.155383765632312, 0.0023170190948092013, -0.09592363759672837, 0.22519396050547189, 0.06529930872468116, -0.03475196259007688, 0.1988986258233047, 0.28053359130812483, 0.005534050726767063, 0.1859696294148149, -0.1884692769039564, 0.012973978681459455, -0.25346794389896904, -0.1427776546220032, -0.1999647323492631, -0.01882719606383825, -0.12168366047151959, -0.2023480075624083, 0.39926235861165205, 0.2250281733298755, 0.21943913176959462, 0.09824037274634263, 0.403725275625576, -0.01096669977477691, 0.09208686252089177, 0.06509953687149707, 0.1784600029451489, 0.009347190627443564, 0.15583052393618424, -0.09809273534388606, 0.026933976893222123, 0.04682198439537467]
|
1,803.04637
|
On higher energy decompositions and the sum-product phenomenon
|
Let $A \subset \mathbb{R}$ be finite. We quantitatively improve the
Balog-Wooley decomposition, that is $A$ can be partitioned into sets $B$ and
$C$ such that $$\max\{E^+(B) , E^{\times}(C)\} \lesssim |A|^{3 - 7/26}, \ \
\max \{E^+(B,A) , E^{\times}(C, A) \}\lesssim |A|^{3 - 1/4}.$$ We use similar
decompositions to improve upon various sum-product estimates. For instance, we
show $$ |A+A| + |A A| \gtrsim |A|^{4/3 + 5/5277}.$$
|
math.NT math.CO
|
let a subset mathbbr be finite we quantitatively improve the balogwooley decomposition that is a can be partitioned into sets b and c such that maxeb etimesc lesssim a3 726 max eba etimesc a lesssim a3 14 we use similar decompositions to improve upon various sumproduct estimates for instance we show aa a a gtrsim a43 55277
|
[['let', 'a', 'subset', 'mathbbr', 'be', 'finite', 'we', 'quantitatively', 'improve', 'the', 'balogwooley', 'decomposition', 'that', 'is', 'a', 'can', 'be', 'partitioned', 'into', 'sets', 'b', 'and', 'c', 'such', 'that', 'maxeb', 'etimesc', 'lesssim', 'a3', '726', 'max', 'eba', 'etimesc', 'a', 'lesssim', 'a3', '14', 'we', 'use', 'similar', 'decompositions', 'to', 'improve', 'upon', 'various', 'sumproduct', 'estimates', 'for', 'instance', 'we', 'show', 'aa', 'a', 'a', 'gtrsim', 'a43', '55277']]
|
[-0.07280256292114984, 0.136264156550169, -0.06646122214524953, 0.09699310370466127, -0.07444737380686796, -0.16235307297440912, 0.06775710297713303, 0.3625625670659092, -0.2634912023215361, -0.2441201765213232, 0.09741824461182333, -0.2849082862167566, -0.05630824792216409, 0.19714454296132866, -0.05568095578653914, -0.05249693461052441, 0.07682600188648926, -0.0032645601708933994, -0.08744723471057303, -0.23737616611222895, 0.2036116229159371, -0.08022228095083023, 0.18888821103170794, 0.10107496020577426, 0.041235578580285016, -0.010101880904568254, 0.04572682805196821, 0.07187527036382202, -0.21813679355738097, 0.05642814753260815, 0.2209541844028347, 0.18569902310648687, 0.27525356545482044, -0.3275392414509969, -0.16604372560275052, 0.18669732510692105, 0.23128164144461308, 0.003940993252227891, 0.04541311769763816, -0.25540676807879276, 0.21815325655394568, -0.19897897653984573, -0.038573059736628015, -0.0855033677071333, 0.06551211959910842, 0.041844210728018916, -0.3805925871403712, 0.020705886255457717, 0.058562990418582594, 0.003795279444740066, -0.06835920120290709, -0.21550007617839104, 0.016274544091912795, 0.04049640991461446, -0.0820267380847824, 0.17812927547877408, 0.07254817139550622, -0.029354915356720395, -0.018007907418991036, 0.40135552628703836, -0.10724569793860868, -0.17228820764477243, 0.15067124285928482, -0.11803765691605941, -0.18385700266456828, 0.060875776847648735, 0.16843470867793514, 0.13097955029949826, -0.058306496462978, 0.10286241080853561, -0.09101592689612002, 0.19123727631456447, 0.0783204705858568, -0.029978663344287646, 0.11389322093916389, 0.12143138223239835, 0.07304822385557136, 0.059195235727425174, -0.09020527310774855, 0.06891001877374947, -0.30842698404108576, -0.13889880896598664, -0.11516804961522795, 0.1452374668651313, -0.16946072802623022, -0.08596036938142101, 0.32793996194904707, 0.11956494168888004, 0.2777282419210335, 0.0722075047076873, 0.20172559153640046, 0.08797632022497226, 0.07507916226135215, 0.1358711936462776, 0.13007689260368077, 0.13552595908700857, 0.002028052326080934, -0.14639226448467388, 0.002479486334366056, 0.09252424249952694]
|
1,803.04638
|
A New Simulation Algorithm for Absorbing Receiver in Molecular
Communication
|
The simulation of diffusion-based molecular communication systems with
absorbing receivers often requires a high computational complexity to produce
accurate results. In this work, a new a priori Monte Carlo (APMC) algorithm is
proposed to precisely simulate the molecules absorbed at a spherical receiver
when the simulation time step length is relatively large. This algorithm
addresses the limitations of the current refined Monte Carlo (RMC) algorithm,
since the RMC algorithm provides accurate simulation only for a relatively
small time step length. The APMC algorithm is demonstrated to achieve a higher
simulation efficiency than the existing algorithms by finding that the APMC
algorithm, for a relatively large time step length, absorbs the fraction of
molecules expected by analysis, while other algorithms do not.
|
cs.ET cs.IT math.IT
|
the simulation of diffusionbased molecular communication systems with absorbing receivers often requires a high computational complexity to produce accurate results in this work a new a priori monte carlo apmc algorithm is proposed to precisely simulate the molecules absorbed at a spherical receiver when the simulation time step length is relatively large this algorithm addresses the limitations of the current refined monte carlo rmc algorithm since the rmc algorithm provides accurate simulation only for a relatively small time step length the apmc algorithm is demonstrated to achieve a higher simulation efficiency than the existing algorithms by finding that the apmc algorithm for a relatively large time step length absorbs the fraction of molecules expected by analysis while other algorithms do not
|
[['the', 'simulation', 'of', 'diffusionbased', 'molecular', 'communication', 'systems', 'with', 'absorbing', 'receivers', 'often', 'requires', 'a', 'high', 'computational', 'complexity', 'to', 'produce', 'accurate', 'results', 'in', 'this', 'work', 'a', 'new', 'a', 'priori', 'monte', 'carlo', 'apmc', 'algorithm', 'is', 'proposed', 'to', 'precisely', 'simulate', 'the', 'molecules', 'absorbed', 'at', 'a', 'spherical', 'receiver', 'when', 'the', 'simulation', 'time', 'step', 'length', 'is', 'relatively', 'large', 'this', 'algorithm', 'addresses', 'the', 'limitations', 'of', 'the', 'current', 'refined', 'monte', 'carlo', 'rmc', 'algorithm', 'since', 'the', 'rmc', 'algorithm', 'provides', 'accurate', 'simulation', 'only', 'for', 'a', 'relatively', 'small', 'time', 'step', 'length', 'the', 'apmc', 'algorithm', 'is', 'demonstrated', 'to', 'achieve', 'a', 'higher', 'simulation', 'efficiency', 'than', 'the', 'existing', 'algorithms', 'by', 'finding', 'that', 'the', 'apmc', 'algorithm', 'for', 'a', 'relatively', 'large', 'time', 'step', 'length', 'absorbs', 'the', 'fraction', 'of', 'molecules', 'expected', 'by', 'analysis', 'while', 'other', 'algorithms', 'do', 'not']]
|
[-0.11018025357091477, 0.06886047112932506, -0.08576181601378913, 0.07541112452148929, -0.04048589259878663, -0.1830751445213687, 0.0796609388718243, 0.4216818459916952, -0.24315541448872074, -0.35589914758928304, 0.085828216025829, -0.2106069204674587, -0.09875359306927801, 0.22919181668996225, -0.02170974316031187, 0.09183938411826437, 0.14538372594724633, -0.029557612988220388, -0.054691374517423064, -0.25475468875624796, 0.16607097280019326, 0.17968866073965165, 0.25287240884874845, 0.006721838754563292, 0.1411411450321455, -0.021442015435977662, -0.03326133337095072, 0.013684157243629626, -0.1294615032608464, 0.11056838165545328, 0.26483310286479056, 0.11309207403986168, 0.322570898208848, -0.4259103957933089, -0.22264491314114618, 0.1053433499572229, 0.18230468784612872, 0.16748522078110414, -0.06782548233851297, -0.21408698980288565, 0.09867239846609348, -0.12477832223665862, -0.11050152943338737, -0.040731389658556376, -0.014845546517782837, 0.021878835818757235, -0.28911023023576776, 0.05961662209939119, -0.009692215830210812, 0.030173745260319927, 0.04357302821941735, -0.11973144648181012, 0.054431613376902895, 0.09425642127329907, -0.011239758723469313, 0.0654695470344029, 0.14264283231498043, -0.07588189130664365, -0.1136815321731789, 0.35889804878941745, -0.009869821345234436, -0.18828195654440763, 0.20151415508055737, -0.1033993322394542, -0.17142852645921558, 0.2846228070528254, 0.15891336353326385, 0.16454530074376583, -0.1125572818926245, 0.05225805396383459, -0.016107300334910223, 0.2268194167582272, -0.03527386033953714, -0.009604018116138938, 0.11233238765415697, 0.22795345947292656, 0.09369579446886873, 0.1321434280416574, -0.09713501459726494, -0.12744142750878473, -0.21780162161477834, -0.16737289151945536, -0.2617442070406454, -0.008864491674659412, -0.1035527061778775, -0.14356734940381952, 0.317407323678663, 0.20428477746072757, 0.1416421286292251, 0.159246227078617, 0.428350129895959, 0.06561663247594872, 0.06773494534225256, 0.12451844796738472, 0.17112165266524784, 0.07313367118193068, 0.09479750222661186, -0.2462176246730195, 0.12367296100340107, 0.07532663163459621]
|
1,803.04639
|
Correct Undetected Errors with List Decoding in ARQ Error-control
Systems
|
Undetected errors are important for linear codes, which are the only type of
errors after hard decision and automatic-repeat-request (ARQ), but do not
receive much attention on their correction. In concatenated channel coding,
suboptimal source coding and joint source-channel coding, constrains among
successive codewords may be utilized to improve decoding performance. In this
paper, list decoding is used to correct the undetected errors. The benefit
proportion of the correction is obviously improved especially on Hamming codes
and Reed-Muller codes, which achieves about 40% in some cases. But this
improvement is significant only after the selection of final codewords from the
lists based on the constrains among the successive transmitted codewords. The
selection algorithm is investigated here to complete the list decoding program
in the application of Markov context model. The performance of the algorithm is
analysed and a lower bound of the correctly selected probability is derived to
determine the proper context length.
|
cs.IT math.IT
|
undetected errors are important for linear codes which are the only type of errors after hard decision and automaticrepeatrequest arq but do not receive much attention on their correction in concatenated channel coding suboptimal source coding and joint sourcechannel coding constrains among successive codewords may be utilized to improve decoding performance in this paper list decoding is used to correct the undetected errors the benefit proportion of the correction is obviously improved especially on hamming codes and reedmuller codes which achieves about 40 in some cases but this improvement is significant only after the selection of final codewords from the lists based on the constrains among the successive transmitted codewords the selection algorithm is investigated here to complete the list decoding program in the application of markov context model the performance of the algorithm is analysed and a lower bound of the correctly selected probability is derived to determine the proper context length
|
[['undetected', 'errors', 'are', 'important', 'for', 'linear', 'codes', 'which', 'are', 'the', 'only', 'type', 'of', 'errors', 'after', 'hard', 'decision', 'and', 'automaticrepeatrequest', 'arq', 'but', 'do', 'not', 'receive', 'much', 'attention', 'on', 'their', 'correction', 'in', 'concatenated', 'channel', 'coding', 'suboptimal', 'source', 'coding', 'and', 'joint', 'sourcechannel', 'coding', 'constrains', 'among', 'successive', 'codewords', 'may', 'be', 'utilized', 'to', 'improve', 'decoding', 'performance', 'in', 'this', 'paper', 'list', 'decoding', 'is', 'used', 'to', 'correct', 'the', 'undetected', 'errors', 'the', 'benefit', 'proportion', 'of', 'the', 'correction', 'is', 'obviously', 'improved', 'especially', 'on', 'hamming', 'codes', 'and', 'reedmuller', 'codes', 'which', 'achieves', 'about', '40', 'in', 'some', 'cases', 'but', 'this', 'improvement', 'is', 'significant', 'only', 'after', 'the', 'selection', 'of', 'final', 'codewords', 'from', 'the', 'lists', 'based', 'on', 'the', 'constrains', 'among', 'the', 'successive', 'transmitted', 'codewords', 'the', 'selection', 'algorithm', 'is', 'investigated', 'here', 'to', 'complete', 'the', 'list', 'decoding', 'program', 'in', 'the', 'application', 'of', 'markov', 'context', 'model', 'the', 'performance', 'of', 'the', 'algorithm', 'is', 'analysed', 'and', 'a', 'lower', 'bound', 'of', 'the', 'correctly', 'selected', 'probability', 'is', 'derived', 'to', 'determine', 'the', 'proper', 'context', 'length']]
|
[-0.14908013047857416, 0.03441713047305159, -0.055879276081481404, 0.11894253153183491, -0.05602736590168396, -0.2454186281382587, 0.15373704443439185, 0.4146672657453546, -0.27507459829117054, -0.294797312523074, 0.1385267936172621, -0.24093137134560474, -0.12301870958203924, 0.17107292027227897, -0.16678992225149392, 0.0827928155636281, 0.0992141506388126, 0.0758142841072887, -0.11246771579593104, -0.37221531179776185, 0.250275949242957, 0.18611274900681832, 0.2945617965888232, 0.0036455593102313333, 0.07197012339819077, 0.038343268964025706, -0.09429136716024158, -0.04526607886905635, -0.09664834507138413, 0.09509914844552529, 0.27767394091690484, 0.19747717799984066, 0.240342656211331, -0.32302100829220093, -0.22799119026722764, 0.08129184959407627, 0.17245547793002106, 0.1747701083799958, 0.0010032979657362197, -0.22743214850064392, 0.13152457723695346, -0.16622492625397856, 0.04784351995719286, 0.03013417270229338, -0.02517375094036943, 0.005856670437721548, -0.28419596484095294, 0.019732118241817635, 0.06762389232118438, 0.0093451458352064, -0.013920724038886868, -0.19152808737837607, 0.03284613494578676, 0.16415369176774536, 0.03780261374282608, 0.05898766776202916, 0.0886659515759865, -0.06671653136997514, -0.12025532082599752, 0.3705214575006097, 0.012522629468269597, -0.2019221750681526, 0.1098060416985224, -0.060782280120560354, -0.1604003646316652, 0.2223899139371378, 0.23784567432758075, 0.07986384355676135, -0.15174930217048896, 0.018839472334138026, -0.008617579778717235, 0.22327594385707591, 0.0984213695757919, 0.13828936712420697, 0.1555095622848622, 0.10877977106933256, 0.03463270404799142, 0.1636356618445598, -0.10480867138321152, -0.07053904725372596, -0.28545036244820926, -0.08504956707493798, -0.18960913502933835, -0.03550114452348508, -0.09833117042709251, -0.13372976967480546, 0.36473151894736716, 0.1542867723939137, 0.11742716592799696, 0.12072777644779802, 0.3086583873750094, 0.0463989916397563, 0.08922660386865484, 0.1598287366537584, 0.2309011972543184, 0.13812209765565295, -0.008296597161211585, -0.21174841968105265, 0.1428071475082558, 0.07985898852348328]
|
1,803.0464
|
Bayesian Detection of Abnormal ADS in Mutant Caenorhabditis elegans
Embryos
|
Cell division timing is critical for cell fate specification and
morphogenesis during embryogenesis. How division timings are regulated among
cells during development is poorly understood. Here we focus on the comparison
of asynchrony of division between sister cells (ADS) between wild-type and
mutant individuals of Caenorhabditis elegans. Since the replicate number of
mutant individuals of each mutated gene, usually one, is far smaller than that
of wild-type, direct comparison of two distributions of ADS between wild-type
and mutant type, such as Kolmogorov- Smirnov test, is not feasible. On the
other hand, we find that sometimes ADS is correlated with the life span of
corresponding mother cell in wild-type. Hence, we apply a semiparametric
Bayesian quantile regression method to estimate the 95% confidence interval
curve of ADS with respect to life span of mother cell of wild-type individuals.
Then, mutant-type ADSs outside the corresponding confidence interval are
selected out as abnormal one with a significance level of 0.05. Simulation
study demonstrates the accuracy of our method and Gene Enrichment Analysis
validates the results of real data sets.
|
q-bio.QM stat.AP
|
cell division timing is critical for cell fate specification and morphogenesis during embryogenesis how division timings are regulated among cells during development is poorly understood here we focus on the comparison of asynchrony of division between sister cells ads between wildtype and mutant individuals of caenorhabditis elegans since the replicate number of mutant individuals of each mutated gene usually one is far smaller than that of wildtype direct comparison of two distributions of ads between wildtype and mutant type such as kolmogorov smirnov test is not feasible on the other hand we find that sometimes ads is correlated with the life span of corresponding mother cell in wildtype hence we apply a semiparametric bayesian quantile regression method to estimate the 95 confidence interval curve of ads with respect to life span of mother cell of wildtype individuals then mutanttype adss outside the corresponding confidence interval are selected out as abnormal one with a significance level of 005 simulation study demonstrates the accuracy of our method and gene enrichment analysis validates the results of real data sets
|
[['cell', 'division', 'timing', 'is', 'critical', 'for', 'cell', 'fate', 'specification', 'and', 'morphogenesis', 'during', 'embryogenesis', 'how', 'division', 'timings', 'are', 'regulated', 'among', 'cells', 'during', 'development', 'is', 'poorly', 'understood', 'here', 'we', 'focus', 'on', 'the', 'comparison', 'of', 'asynchrony', 'of', 'division', 'between', 'sister', 'cells', 'ads', 'between', 'wildtype', 'and', 'mutant', 'individuals', 'of', 'caenorhabditis', 'elegans', 'since', 'the', 'replicate', 'number', 'of', 'mutant', 'individuals', 'of', 'each', 'mutated', 'gene', 'usually', 'one', 'is', 'far', 'smaller', 'than', 'that', 'of', 'wildtype', 'direct', 'comparison', 'of', 'two', 'distributions', 'of', 'ads', 'between', 'wildtype', 'and', 'mutant', 'type', 'such', 'as', 'kolmogorov', 'smirnov', 'test', 'is', 'not', 'feasible', 'on', 'the', 'other', 'hand', 'we', 'find', 'that', 'sometimes', 'ads', 'is', 'correlated', 'with', 'the', 'life', 'span', 'of', 'corresponding', 'mother', 'cell', 'in', 'wildtype', 'hence', 'we', 'apply', 'a', 'semiparametric', 'bayesian', 'quantile', 'regression', 'method', 'to', 'estimate', 'the', '95', 'confidence', 'interval', 'curve', 'of', 'ads', 'with', 'respect', 'to', 'life', 'span', 'of', 'mother', 'cell', 'of', 'wildtype', 'individuals', 'then', 'mutanttype', 'adss', 'outside', 'the', 'corresponding', 'confidence', 'interval', 'are', 'selected', 'out', 'as', 'abnormal', 'one', 'with', 'a', 'significance', 'level', 'of', '005', 'simulation', 'study', 'demonstrates', 'the', 'accuracy', 'of', 'our', 'method', 'and', 'gene', 'enrichment', 'analysis', 'validates', 'the', 'results', 'of', 'real', 'data', 'sets']]
|
[-0.07722649599026356, 0.11491347195447556, -0.04996592900050538, 0.09183192433589803, -0.060125093484363915, -0.16474588072991797, 0.14184878343051033, 0.375998560456293, -0.20769141990026194, -0.23399578175274655, 0.07361989876987146, -0.2830699750139112, -0.19155936734118897, 0.19490015872454802, -0.11495110867545008, -0.0371325957908162, 0.10770986865873315, 0.053605813547702774, 0.061106497823659865, -0.27243530424644374, 0.23147098806021468, 0.047979704442300965, 0.32172754232904743, -0.05621788383062397, 0.08854581986487443, -0.02770003088550376, -0.05334894938660519, -0.01672182154708675, -0.14237777526132828, 0.10853146875144115, 0.27852076125730363, 0.21997783305123447, 0.30720841243863106, -0.40467484807861703, -0.1781905871935721, 0.12231199358456901, 0.1918439479438322, 0.08075650143304042, 0.029497418833364333, -0.20784588574964022, 0.10697914597046163, -0.16223773970667804, -0.0902217556828899, -0.02317317599164588, 0.03953745467629882, 0.03227495460205578, -0.24475112536389912, 0.1574578338655244, -0.03590725229254791, 0.14952345570283276, -0.08472937321689512, -0.1342150602010744, -0.11758732886319714, 0.17426554952881165, 0.10102937450233315, -0.01590732967364602, 0.20803601878828237, -0.06100254022499679, -0.1293472398205527, 0.3197035241978509, 0.009391912217501418, -0.1906030082689124, 0.21781901534779796, -0.22287962767628156, -0.13079368818817394, 0.12425236498670919, 0.16343537093007138, 0.06598189188433545, -0.17267707826303585, 0.020308523943115556, -0.012135929981512682, 0.1772133291383008, 0.14417577971305165, -0.033648903713162454, 0.17231735395001513, 0.25179236574896746, 0.017740849841918264, 0.08885559976599844, -0.09894984413404018, -0.1396977831582938, -0.25430847488343716, -0.16674499311085259, -0.14833710772650582, 0.03179259071334465, -0.1254058397523061, -0.208479332911915, 0.40517758576997687, 0.0952042370462524, 0.17526840522885323, 0.1226076166704297, 0.2205455421895853, -0.0018083725091336028, 0.060886652001312803, -0.016483812925538847, 0.1642280621480729, 0.05036554976100368, 0.05609260617821876, -0.2437960648031107, 0.15034352643016194, 0.023916258811950683]
|
1,803.04641
|
Analysis of a quasi-reversibility method for a terminal value
quasi-linear parabolic problem with measurements
|
This paper presents a modified quasi-reversibility method for computing the
exponentially unstable solution of a nonlocal terminal-boundary value parabolic
problem with noisy data. Based on data measurements, we perturb the problem by
the so-called filter regularized operator to design an approximate problem.
Different from recently developed approaches that consist in the conventional
spectral methods, we analyze this new approximation in a variational framework,
where the finite element method can be applied. To see the whole skeleton of
this method, our main results lie in the analysis of a semi-linear case and we
discuss some generalizations where this analysis can be adapted. As is
omnipresent in many physical processes, there is likely a myriad of models
derived from this simpler case, such as source localization problems for brain
tumors and heat conduction problems with nonlinear sinks in nuclear science.
With respect to each noise level, we benefit from the Faedo-Galerkin method to
study the weak solvability of the approximate problem. Relying on the
energy-like analysis, we provide detailed convergence rates in $L^2$-$H^1$ of
the proposed method when the true solution is sufficiently smooth. Depending on
the dimensions of the domain, we obtain an error estimate in $L^{r}$ for some
$r>2$. Proof of the backward uniqueness for the quasi-linear system is also
depicted in this work. To prove the regularity assumptions acceptable, several
physical applications are discussed.
|
math.NA math.AP
|
this paper presents a modified quasireversibility method for computing the exponentially unstable solution of a nonlocal terminalboundary value parabolic problem with noisy data based on data measurements we perturb the problem by the socalled filter regularized operator to design an approximate problem different from recently developed approaches that consist in the conventional spectral methods we analyze this new approximation in a variational framework where the finite element method can be applied to see the whole skeleton of this method our main results lie in the analysis of a semilinear case and we discuss some generalizations where this analysis can be adapted as is omnipresent in many physical processes there is likely a myriad of models derived from this simpler case such as source localization problems for brain tumors and heat conduction problems with nonlinear sinks in nuclear science with respect to each noise level we benefit from the faedogalerkin method to study the weak solvability of the approximate problem relying on the energylike analysis we provide detailed convergence rates in l2h1 of the proposed method when the true solution is sufficiently smooth depending on the dimensions of the domain we obtain an error estimate in lr for some r2 proof of the backward uniqueness for the quasilinear system is also depicted in this work to prove the regularity assumptions acceptable several physical applications are discussed
|
[['this', 'paper', 'presents', 'a', 'modified', 'quasireversibility', 'method', 'for', 'computing', 'the', 'exponentially', 'unstable', 'solution', 'of', 'a', 'nonlocal', 'terminalboundary', 'value', 'parabolic', 'problem', 'with', 'noisy', 'data', 'based', 'on', 'data', 'measurements', 'we', 'perturb', 'the', 'problem', 'by', 'the', 'socalled', 'filter', 'regularized', 'operator', 'to', 'design', 'an', 'approximate', 'problem', 'different', 'from', 'recently', 'developed', 'approaches', 'that', 'consist', 'in', 'the', 'conventional', 'spectral', 'methods', 'we', 'analyze', 'this', 'new', 'approximation', 'in', 'a', 'variational', 'framework', 'where', 'the', 'finite', 'element', 'method', 'can', 'be', 'applied', 'to', 'see', 'the', 'whole', 'skeleton', 'of', 'this', 'method', 'our', 'main', 'results', 'lie', 'in', 'the', 'analysis', 'of', 'a', 'semilinear', 'case', 'and', 'we', 'discuss', 'some', 'generalizations', 'where', 'this', 'analysis', 'can', 'be', 'adapted', 'as', 'is', 'omnipresent', 'in', 'many', 'physical', 'processes', 'there', 'is', 'likely', 'a', 'myriad', 'of', 'models', 'derived', 'from', 'this', 'simpler', 'case', 'such', 'as', 'source', 'localization', 'problems', 'for', 'brain', 'tumors', 'and', 'heat', 'conduction', 'problems', 'with', 'nonlinear', 'sinks', 'in', 'nuclear', 'science', 'with', 'respect', 'to', 'each', 'noise', 'level', 'we', 'benefit', 'from', 'the', 'faedogalerkin', 'method', 'to', 'study', 'the', 'weak', 'solvability', 'of', 'the', 'approximate', 'problem', 'relying', 'on', 'the', 'energylike', 'analysis', 'we', 'provide', 'detailed', 'convergence', 'rates', 'in', 'l2h1', 'of', 'the', 'proposed', 'method', 'when', 'the', 'true', 'solution', 'is', 'sufficiently', 'smooth', 'depending', 'on', 'the', 'dimensions', 'of', 'the', 'domain', 'we', 'obtain', 'an', 'error', 'estimate', 'in', 'lr', 'for', 'some', 'r2', 'proof', 'of', 'the', 'backward', 'uniqueness', 'for', 'the', 'quasilinear', 'system', 'is', 'also', 'depicted', 'in', 'this', 'work', 'to', 'prove', 'the', 'regularity', 'assumptions', 'acceptable', 'several', 'physical', 'applications', 'are', 'discussed']]
|
[-0.06201639471316917, 0.002390138841260018, -0.08522688134366439, 0.07833907526814275, -0.08144934277567599, -0.13057185372337698, 0.0156430612406176, 0.3358590625557635, -0.3016949508235686, -0.2592425775189056, 0.15280404947284196, -0.25566312569297023, -0.1691077802881288, 0.2290989271965292, -0.09384596849377784, 0.07873007960617542, 0.08636423349483974, 0.031487282937935866, -0.07930997649104231, -0.21193347793900305, 0.33620818823989895, 0.00020159178723891575, 0.26365344296726917, 0.057007209927671484, 0.0926097786726637, -0.013927496558883123, -0.022240596861164603, 0.025327466214075684, -0.14656902125386598, 0.13907357764533823, 0.2718317892989176, 0.11908301737676892, 0.31702456603033674, -0.41295008757462104, -0.22638051729131903, 0.11108050411153171, 0.1377898403774533, 0.13290287882354784, -0.056964255076341536, -0.28642039825622406, 0.10797410268129574, -0.13014710027556348, -0.14597891081434985, -0.07083044877275825, -0.031805028629799684, 0.036289625752510296, -0.3000295117021435, 0.09553365619529763, 0.07021161605552252, 0.035972988891104854, -0.10290101524028514, -0.1039491179642371, 0.04588098023345487, 0.09560615390293403, 0.05698024472014772, 0.01188231511416638, 0.07067783491116846, -0.10456841282960441, -0.09851132035307172, 0.3615479962031047, -0.06651423419308332, -0.2639265549545073, 0.17504283476206992, -0.09546888188976381, -0.15630029457052136, 0.10504702579333551, 0.1898516957130697, 0.16490250900180803, -0.16072372924051403, 0.10076415930305505, -0.04398593850226866, 0.14624965216757524, 0.03770394278638479, 0.01038880714111858, 0.10518983453331102, 0.18651625595883362, 0.11451736690036746, 0.1525073427003291, -0.06429434816559984, -0.09205306854047295, -0.3130253973044455, -0.12694768068380655, -0.17510472657572893, 0.039474199168228856, -0.09791267921514292, -0.17561028002450862, 0.38788840564381744, 0.19385163226682278, 0.17691551083077986, 0.04665505213869942, 0.30136716932886176, 0.15628876691373686, 0.015477263938325147, 0.07798390173599021, 0.21558872961878983, 0.11923721441378196, 0.11523099008947611, -0.2106499235259576, 0.041914278126528696, 0.1048018010550489]
|
1,803.04642
|
The value of astrometry for exoplanet science
|
Exoplanets mass measurements will be a critical next step to assess the
habitability of Earth-like planets: a key aspect of the 2020 vision in the
previous decadal survey and also central to NASA's strategic priorities.
Precision astrometry delivers measurement of exoplanet masses, allowing
discrimination of rocky planets from water worlds and enabling much better
modeling of their atmosphere improving species retrieval from spectroscopy. The
scientific potential of astrometry will be enormous. The intrinsic
astrophysical noise floor set by star spots and stellar surface activity is
about a factor of ten more benign for astrometry than for the more established
technique of Radial Velocity, widening the discovery region and pushing
detection thresholds to lower masses than previously possible. On the
instrumental side, precision astrometry is limited by optical field distortion
and detector calibration issues. Both technical challenges are now being
addressed successfully in the laboratory. However, we have identified the need
to continue these technology development efforts to achieve sub-microarcsecond
astrometry precision necessary for detection and characterization of Earth-like
planets around nearby FGK stars. The international community has realized the
importance of astrometry, and various astrometry missions have been proposed
and under development, with a few high profile missions now operational. We
believe that it is vital for the U.S. scientific community to participate in
the development of these new technologies and scientific discoveries. We
recommend exploring alternatives to incorporate astrometric capabilities into
future exoplanet flagship missions such as HABEX and LUVOIR, substantially
increasing the scientific return associated with the expected yield of
earth-like planets to be recovered.
|
astro-ph.IM
|
exoplanets mass measurements will be a critical next step to assess the habitability of earthlike planets a key aspect of the 2020 vision in the previous decadal survey and also central to nasas strategic priorities precision astrometry delivers measurement of exoplanet masses allowing discrimination of rocky planets from water worlds and enabling much better modeling of their atmosphere improving species retrieval from spectroscopy the scientific potential of astrometry will be enormous the intrinsic astrophysical noise floor set by star spots and stellar surface activity is about a factor of ten more benign for astrometry than for the more established technique of radial velocity widening the discovery region and pushing detection thresholds to lower masses than previously possible on the instrumental side precision astrometry is limited by optical field distortion and detector calibration issues both technical challenges are now being addressed successfully in the laboratory however we have identified the need to continue these technology development efforts to achieve submicroarcsecond astrometry precision necessary for detection and characterization of earthlike planets around nearby fgk stars the international community has realized the importance of astrometry and various astrometry missions have been proposed and under development with a few high profile missions now operational we believe that it is vital for the us scientific community to participate in the development of these new technologies and scientific discoveries we recommend exploring alternatives to incorporate astrometric capabilities into future exoplanet flagship missions such as habex and luvoir substantially increasing the scientific return associated with the expected yield of earthlike planets to be recovered
|
[['exoplanets', 'mass', 'measurements', 'will', 'be', 'a', 'critical', 'next', 'step', 'to', 'assess', 'the', 'habitability', 'of', 'earthlike', 'planets', 'a', 'key', 'aspect', 'of', 'the', '2020', 'vision', 'in', 'the', 'previous', 'decadal', 'survey', 'and', 'also', 'central', 'to', 'nasas', 'strategic', 'priorities', 'precision', 'astrometry', 'delivers', 'measurement', 'of', 'exoplanet', 'masses', 'allowing', 'discrimination', 'of', 'rocky', 'planets', 'from', 'water', 'worlds', 'and', 'enabling', 'much', 'better', 'modeling', 'of', 'their', 'atmosphere', 'improving', 'species', 'retrieval', 'from', 'spectroscopy', 'the', 'scientific', 'potential', 'of', 'astrometry', 'will', 'be', 'enormous', 'the', 'intrinsic', 'astrophysical', 'noise', 'floor', 'set', 'by', 'star', 'spots', 'and', 'stellar', 'surface', 'activity', 'is', 'about', 'a', 'factor', 'of', 'ten', 'more', 'benign', 'for', 'astrometry', 'than', 'for', 'the', 'more', 'established', 'technique', 'of', 'radial', 'velocity', 'widening', 'the', 'discovery', 'region', 'and', 'pushing', 'detection', 'thresholds', 'to', 'lower', 'masses', 'than', 'previously', 'possible', 'on', 'the', 'instrumental', 'side', 'precision', 'astrometry', 'is', 'limited', 'by', 'optical', 'field', 'distortion', 'and', 'detector', 'calibration', 'issues', 'both', 'technical', 'challenges', 'are', 'now', 'being', 'addressed', 'successfully', 'in', 'the', 'laboratory', 'however', 'we', 'have', 'identified', 'the', 'need', 'to', 'continue', 'these', 'technology', 'development', 'efforts', 'to', 'achieve', 'submicroarcsecond', 'astrometry', 'precision', 'necessary', 'for', 'detection', 'and', 'characterization', 'of', 'earthlike', 'planets', 'around', 'nearby', 'fgk', 'stars', 'the', 'international', 'community', 'has', 'realized', 'the', 'importance', 'of', 'astrometry', 'and', 'various', 'astrometry', 'missions', 'have', 'been', 'proposed', 'and', 'under', 'development', 'with', 'a', 'few', 'high', 'profile', 'missions', 'now', 'operational', 'we', 'believe', 'that', 'it', 'is', 'vital', 'for', 'the', 'us', 'scientific', 'community', 'to', 'participate', 'in', 'the', 'development', 'of', 'these', 'new', 'technologies', 'and', 'scientific', 'discoveries', 'we', 'recommend', 'exploring', 'alternatives', 'to', 'incorporate', 'astrometric', 'capabilities', 'into', 'future', 'exoplanet', 'flagship', 'missions', 'such', 'as', 'habex', 'and', 'luvoir', 'substantially', 'increasing', 'the', 'scientific', 'return', 'associated', 'with', 'the', 'expected', 'yield', 'of', 'earthlike', 'planets', 'to', 'be', 'recovered']]
|
[-0.0659568519902267, 0.13751608904828008, -0.06272205506706907, 0.05975500128915033, -0.15874581987170525, -0.08572107260858329, 0.08382092640238745, 0.3615617697935276, -0.1793366505941992, -0.407476022761634, 0.1454571680866131, -0.2955885671807547, -0.07867169120903435, 0.2649759223063183, -0.12157979226820188, 0.11154469385415185, 0.1536117358131385, -0.042583565590069684, -0.021001834832521424, -0.2923795897459271, 0.23434297093697587, 0.1651207307618155, 0.1684217296381289, 0.030175472213569594, 0.0359515757662342, -0.07445403248622491, -0.11954374921418444, -0.03860640046023673, -0.16375348882676408, 0.13498858800828312, 0.34721880582440284, 0.22169350934620757, 0.2946647270455783, -0.36754612801669, -0.23897644490228262, 0.08257296992701856, 0.13117430847707107, 0.0232874501463939, -0.05728952723733287, -0.332040575161714, 0.03850386659628331, -0.2034105276616457, -0.18332917935120718, -0.07014521299988205, 0.04733003641737821, 0.004821753276127902, -0.22445279088030762, -0.011959185081480637, 0.01848568449318699, 0.14498172251979644, -0.11140413845142763, -0.16967665713374658, -0.020674049148991964, 0.1842358649005309, 0.006045020679609872, 0.04967519327886502, 0.1589409142228909, -0.16373621089273432, -0.07745601678292488, 0.417233628737251, -0.06071533904837151, -0.059185910501593456, 0.21066500169110886, -0.216374554879717, -0.14376610413679294, 0.11219073239494666, 0.20445373933920855, 0.09557587252966045, -0.18624331727478988, -0.004270469751942845, 0.07418294998831641, 0.16719127079183851, 0.09257112011668574, 0.09230648757299184, 0.3606045565999146, 0.23080721505326926, 0.1501851970839934, 0.02226574496358836, -0.2017508378763799, -0.028313432783223617, -0.17994326028197366, -0.15447848295459546, -0.1263869798303752, 0.014311416893617653, -0.043420146246950765, -0.07285283471127892, 0.35580255642373854, 0.2240860792738023, 0.06871114816455033, -0.0077032443581707055, 0.35447285789634003, 0.016495791442408262, 0.12778832116399816, 0.014824185698883833, 0.3473789099574901, 0.09958771920440436, 0.1315162490622108, -0.1778121754157462, 0.10792651830299066, -0.03268972791528423]
|
1,803.04643
|
Journey to the Centre of the Earth: Jule Vernes' dream in the laboratory
from an NMR perspective
|
High pressure nuclear magnetic resonance is among the most challenging fields
of research for every NMR spectroscopist due to inherently low signal
intensities, inaccessible and ultra-small samples, and overall extremely harsh
conditions in the sample cavity of modern high pressure vessels. This review
aims to provide a comprehensive overview of the topic of high pressure research
and its fairly young and brief relationship with NMR.
|
physics.app-ph
|
high pressure nuclear magnetic resonance is among the most challenging fields of research for every nmr spectroscopist due to inherently low signal intensities inaccessible and ultrasmall samples and overall extremely harsh conditions in the sample cavity of modern high pressure vessels this review aims to provide a comprehensive overview of the topic of high pressure research and its fairly young and brief relationship with nmr
|
[['high', 'pressure', 'nuclear', 'magnetic', 'resonance', 'is', 'among', 'the', 'most', 'challenging', 'fields', 'of', 'research', 'for', 'every', 'nmr', 'spectroscopist', 'due', 'to', 'inherently', 'low', 'signal', 'intensities', 'inaccessible', 'and', 'ultrasmall', 'samples', 'and', 'overall', 'extremely', 'harsh', 'conditions', 'in', 'the', 'sample', 'cavity', 'of', 'modern', 'high', 'pressure', 'vessels', 'this', 'review', 'aims', 'to', 'provide', 'a', 'comprehensive', 'overview', 'of', 'the', 'topic', 'of', 'high', 'pressure', 'research', 'and', 'its', 'fairly', 'young', 'and', 'brief', 'relationship', 'with', 'nmr']]
|
[-0.11380554460562192, 0.15738666928373277, -0.046405566712984674, 0.039219032579029985, -0.11505900135693642, -0.12488344681377594, 0.02769321164725205, 0.4031041018664837, -0.20545006611635191, -0.3748083971440792, 0.10907612284466338, -0.24819748848676682, -0.08424234689714817, 0.20873090962951, -0.06598527632080592, 0.03273623858381493, 0.05202153607343252, 0.010769399682221074, -0.04035462628190334, -0.18186012718898173, 0.2509944699991208, 0.15272453309824832, 0.34462669871819135, 0.11112620862057576, 0.0948512273603298, -0.05573133012423148, -0.03485315833957149, -0.01079906693014961, -0.1144316533437142, 0.11531489288004546, 0.35900009052398113, 0.10637131462303492, 0.30263569658765427, -0.45569787844019277, -0.16657033022649836, 0.061916616619922794, 0.09916117775898714, 0.10200125754166108, -0.13407899125192602, -0.24148357963332764, 0.06452959768760663, -0.10468529010048279, -0.10594181381165982, -0.09244019300318682, 0.051083941105753185, 0.013776400241141136, -0.2172361109405756, 0.07794340575257173, 0.023916375388104757, 0.19346045333032424, -0.10656116345288376, -0.12867890771908255, 0.09659371140341345, 0.08804330532797254, 0.046452603263493916, 0.08420926496529808, 0.20343577610239244, -0.20056276923546998, -0.004369429541895023, 0.39268391633836125, -0.03494269520115967, -0.04134704156850393, 0.28470805710575614, -0.23634878379794266, -0.132733578249239, 0.17716715255608925, 0.19001736648094195, 0.0989659854130318, -0.18356190005747172, 0.010564897037917175, 0.050803650113252496, 0.15806976412064755, 0.014790260684318268, 0.08989744686091748, 0.23414452334579366, 0.22607447345956014, 0.04232161434976241, 0.1433423576088479, -0.1216398804126164, -0.003981417345886047, -0.2219693303394776, -0.11620695535093546, -0.13953214249430368, 0.025584623074302308, -0.041630006924522324, -0.15467813896158567, 0.3626223129220307, 0.18324885197843496, 0.1899335819368179, -0.06058587849570008, 0.36185867617336603, 0.012560884439601348, 0.03771849813369604, 0.0342985166165118, 0.20620768137562734, 0.2482162323135596, 0.15735771294969778, -0.2539484894118057, 0.06118533154949546, -0.11739620137959719]
|
1,803.04644
|
Model Visualization in understanding rapid growth of a journal in an
emerging area
|
A recent independent study resulted in a ranking system which ranked
Astronomy and Computing (ASCOM) much higher than most of the older journals
highlighting the niche prominence of the particular journal. We investigate the
remarkable ascendancy in reputation of ASCOM by proposing a novel differential
equation based modeling. The Modeling is a consequence of knowledge discovery
from big data-centric methods, namely L1-SVD. The inadequacy of the ranking
method in explaining the reason behind the growth in reputation of ASCOM is
reasonable to understand given that the study was post-facto. Thus, we propose
a growth model by accounting for the behavior of parameters that contribute to
the growth of a field. It is worthwhile to spend some time in analysing the
cause and control variables behind rapid rise in reputation of a journal in a
niche area. We intent to probe and bring out parameters responsible for its
growing influence. Delay differential equations are used to model the change of
influence on a journal's status by exploiting the effects of historical data.
|
cs.DL
|
a recent independent study resulted in a ranking system which ranked astronomy and computing ascom much higher than most of the older journals highlighting the niche prominence of the particular journal we investigate the remarkable ascendancy in reputation of ascom by proposing a novel differential equation based modeling the modeling is a consequence of knowledge discovery from big datacentric methods namely l1svd the inadequacy of the ranking method in explaining the reason behind the growth in reputation of ascom is reasonable to understand given that the study was postfacto thus we propose a growth model by accounting for the behavior of parameters that contribute to the growth of a field it is worthwhile to spend some time in analysing the cause and control variables behind rapid rise in reputation of a journal in a niche area we intent to probe and bring out parameters responsible for its growing influence delay differential equations are used to model the change of influence on a journals status by exploiting the effects of historical data
|
[['a', 'recent', 'independent', 'study', 'resulted', 'in', 'a', 'ranking', 'system', 'which', 'ranked', 'astronomy', 'and', 'computing', 'ascom', 'much', 'higher', 'than', 'most', 'of', 'the', 'older', 'journals', 'highlighting', 'the', 'niche', 'prominence', 'of', 'the', 'particular', 'journal', 'we', 'investigate', 'the', 'remarkable', 'ascendancy', 'in', 'reputation', 'of', 'ascom', 'by', 'proposing', 'a', 'novel', 'differential', 'equation', 'based', 'modeling', 'the', 'modeling', 'is', 'a', 'consequence', 'of', 'knowledge', 'discovery', 'from', 'big', 'datacentric', 'methods', 'namely', 'l1svd', 'the', 'inadequacy', 'of', 'the', 'ranking', 'method', 'in', 'explaining', 'the', 'reason', 'behind', 'the', 'growth', 'in', 'reputation', 'of', 'ascom', 'is', 'reasonable', 'to', 'understand', 'given', 'that', 'the', 'study', 'was', 'postfacto', 'thus', 'we', 'propose', 'a', 'growth', 'model', 'by', 'accounting', 'for', 'the', 'behavior', 'of', 'parameters', 'that', 'contribute', 'to', 'the', 'growth', 'of', 'a', 'field', 'it', 'is', 'worthwhile', 'to', 'spend', 'some', 'time', 'in', 'analysing', 'the', 'cause', 'and', 'control', 'variables', 'behind', 'rapid', 'rise', 'in', 'reputation', 'of', 'a', 'journal', 'in', 'a', 'niche', 'area', 'we', 'intent', 'to', 'probe', 'and', 'bring', 'out', 'parameters', 'responsible', 'for', 'its', 'growing', 'influence', 'delay', 'differential', 'equations', 'are', 'used', 'to', 'model', 'the', 'change', 'of', 'influence', 'on', 'a', 'journals', 'status', 'by', 'exploiting', 'the', 'effects', 'of', 'historical', 'data']]
|
[-0.10397785142105183, 0.05860756943824098, -0.08765047937888405, 0.07709849766277543, -0.13177364865208374, -0.10255413396448335, 0.08501936049638864, 0.3241789777062984, -0.2360057335162042, -0.32992729836499646, 0.08031788905329236, -0.2676731133039164, -0.1708597480223569, 0.19378928593633807, -0.10079498970881104, 0.004841512296800776, 0.0464216384844964, 0.023889480839373874, -0.029385581809808225, -0.2579388264347525, 0.3202656137346126, 0.09925639601972173, 0.29089374690289227, 0.053509519591598824, 0.07782687058412087, -0.011575346060699838, -0.12484388038625611, 0.032358799440621894, -0.12937930982315105, 0.16471691604101044, 0.2518886803895892, 0.16611204144081806, 0.37054167297833107, -0.40293625725761933, -0.19872049494536922, 0.07004127674188246, 0.1143995365497711, 0.09952648852006807, -0.060826333884067614, -0.2576337009866941, 0.056973506961538294, -0.19197389088324546, -0.12439308337702909, -0.03820191182963112, 0.06381228604586794, 0.021140028027858696, -0.20384407578693592, 0.06572423659484176, 0.04885919375673813, 0.0827730361961157, -0.062236222959644, -0.09884168263182373, 0.0074680991676252554, 0.14753762967199743, 0.08290752311244004, 0.016770060207037366, 0.11975509281242815, -0.18328816557631772, -0.122237711405272, 0.40914831899435206, -0.05424180784689002, -0.14639968059902245, 0.14941427730681264, -0.12873714142479004, -0.14690910382196307, 0.10122030060190489, 0.22828750427853425, 0.061620139881201526, -0.1818208630771979, 0.034880961205550086, 0.006255512240835849, 0.1707974984009257, 0.041058834625736756, 0.01705952819217654, 0.2024294397985453, 0.23455160460023977, 0.03165285894373322, 0.11215019721592612, -0.030617293163531404, -0.12699063179658396, -0.22093705313335008, -0.17088925035889535, -0.1240780235706445, 0.035560536320211694, -0.07005353853738223, -0.16213425674804433, 0.43392222062958513, 0.20172118418576085, 0.19211751545286354, -0.01985764156355906, 0.26079358942258885, 0.10520678801763364, 0.07954761983333704, 0.06790510666940142, 0.2312929080451688, 0.08780965093276738, 0.14290308629381746, -0.19470658320796622, 0.16622119864572169, 0.024956047143924104]
|
1,803.04645
|
The Calabi invariant and The Lyndon-Hochschild-Serre spectral sequence
|
Let $G$ be a group and $N$ be a normal subgroup of $G$. There exists the
group extension $G$ of $G/N$ by $N$. For a $G$-module $A$ which $N$ acts on
trivially and a $G$-invariant homomorphism on $N$ to $A$, we obtain a central
extension of $G/N$ by $A$. By using connection cochains, we exhibit the formula
of its extension class such that clarify the relation among connection
cochains, extension classes and the LHS spectral sequence.
|
math.GR math.GT
|
let g be a group and n be a normal subgroup of g there exists the group extension g of gn by n for a gmodule a which n acts on trivially and a ginvariant homomorphism on n to a we obtain a central extension of gn by a by using connection cochains we exhibit the formula of its extension class such that clarify the relation among connection cochains extension classes and the lhs spectral sequence
|
[['let', 'g', 'be', 'a', 'group', 'and', 'n', 'be', 'a', 'normal', 'subgroup', 'of', 'g', 'there', 'exists', 'the', 'group', 'extension', 'g', 'of', 'gn', 'by', 'n', 'for', 'a', 'gmodule', 'a', 'which', 'n', 'acts', 'on', 'trivially', 'and', 'a', 'ginvariant', 'homomorphism', 'on', 'n', 'to', 'a', 'we', 'obtain', 'a', 'central', 'extension', 'of', 'gn', 'by', 'a', 'by', 'using', 'connection', 'cochains', 'we', 'exhibit', 'the', 'formula', 'of', 'its', 'extension', 'class', 'such', 'that', 'clarify', 'the', 'relation', 'among', 'connection', 'cochains', 'extension', 'classes', 'and', 'the', 'lhs', 'spectral', 'sequence']]
|
[-0.19283893757107617, 0.08025873106855311, -0.11804614595970825, 0.02596263431845919, -0.12581181896262264, -0.14874224437670291, 0.08518879051399908, 0.3560293316350956, -0.30935815568572206, -0.2925388212070653, 0.09920359087654536, -0.25253360206261277, -0.1499397375584139, 0.16949205806380824, -0.06034699595214701, -0.11097859743734405, 0.04144386601278951, 0.1371677680627296, -0.07609956653629381, -0.16761839502540074, 0.35165419079069243, -0.07952368891748943, 0.17487864749273285, -0.019014237007420314, 0.10404875063288369, -0.00042251105983986666, 0.00678903424475146, 0.012250244479601909, -0.13179331792161975, 0.09818924488009591, 0.27961318432292165, 0.06959151097965476, 0.253126703031165, -0.3124813546769713, -0.1705450695988379, 0.25455855836748686, 0.10299602835929315, -0.08222236931109556, -0.060718510082408195, -0.24944479082171855, 0.12569980855148874, -0.21860541619427845, -0.11445878017816301, -0.02648845398308415, 0.14439415529762445, -0.015230004687940604, -0.297652706748953, -0.03436178294941783, 0.12763654153892084, 0.07751362721778844, 0.030784572356711386, -0.06966464691734138, -0.052685260907501766, 0.07590484962259468, -0.06506236309283658, 0.1094877926179355, 0.07829075630280913, -0.053398735968298035, -0.10908022453077137, 0.40810499945655465, -0.15948087082391507, -0.2232824017440802, 0.11066690579939045, -0.12072872568387538, -0.19395884614143716, 0.06734001950213783, 0.06089809762411996, 0.15426848581256836, -0.007350512817011852, 0.23512062020860244, -0.1824571701183327, 0.10872994589398761, 0.04849438741803169, -0.021452058247584654, 0.1468165888156938, 0.11510602091622882, 0.11614400413083403, 0.14952989039930367, 0.03494415154043389, 0.06774501154493344, -0.3668614234775305, -0.20661971779344113, -0.17399126756936312, 0.16285445547270538, -0.12588962937010556, -0.13554754398616128, 0.3912409559431437, 0.038758422508468164, 0.219109528440688, 0.142157236912202, 0.14889302451966183, 0.0864613524570718, 0.08190777900285627, 0.10512823068634852, 0.049342618715998376, 0.28734141739857333, -0.11362269051422022, -0.200489030983973, -0.0036482062607415414, 0.21691496486432457]
|
1,803.04646
|
On Cryptographic Attacks Using Backdoors for SAT
|
Propositional satisfiability (SAT) is at the nucleus of state-of-the-art
approaches to a variety of computationally hard problems, one of which is
cryptanalysis. Moreover, a number of practical applications of SAT can only be
tackled efficiently by identifying and exploiting a subset of formula's
variables called backdoor set (or simply backdoors). This paper proposes a new
class of backdoor sets for SAT used in the context of cryptographic attacks,
namely guess-and-determine attacks. The idea is to identify the best set of
backdoor variables subject to a statistically estimated hardness of the
guess-and-determine attack using a SAT solver. Experimental results on weakened
variants of the renowned encryption algorithms exhibit advantage of the
proposed approach compared to the state of the art in terms of the estimated
hardness of the resulting guess-and-determine attacks.
|
cs.AI cs.CR
|
propositional satisfiability sat is at the nucleus of stateoftheart approaches to a variety of computationally hard problems one of which is cryptanalysis moreover a number of practical applications of sat can only be tackled efficiently by identifying and exploiting a subset of formulas variables called backdoor set or simply backdoors this paper proposes a new class of backdoor sets for sat used in the context of cryptographic attacks namely guessanddetermine attacks the idea is to identify the best set of backdoor variables subject to a statistically estimated hardness of the guessanddetermine attack using a sat solver experimental results on weakened variants of the renowned encryption algorithms exhibit advantage of the proposed approach compared to the state of the art in terms of the estimated hardness of the resulting guessanddetermine attacks
|
[['propositional', 'satisfiability', 'sat', 'is', 'at', 'the', 'nucleus', 'of', 'stateoftheart', 'approaches', 'to', 'a', 'variety', 'of', 'computationally', 'hard', 'problems', 'one', 'of', 'which', 'is', 'cryptanalysis', 'moreover', 'a', 'number', 'of', 'practical', 'applications', 'of', 'sat', 'can', 'only', 'be', 'tackled', 'efficiently', 'by', 'identifying', 'and', 'exploiting', 'a', 'subset', 'of', 'formulas', 'variables', 'called', 'backdoor', 'set', 'or', 'simply', 'backdoors', 'this', 'paper', 'proposes', 'a', 'new', 'class', 'of', 'backdoor', 'sets', 'for', 'sat', 'used', 'in', 'the', 'context', 'of', 'cryptographic', 'attacks', 'namely', 'guessanddetermine', 'attacks', 'the', 'idea', 'is', 'to', 'identify', 'the', 'best', 'set', 'of', 'backdoor', 'variables', 'subject', 'to', 'a', 'statistically', 'estimated', 'hardness', 'of', 'the', 'guessanddetermine', 'attack', 'using', 'a', 'sat', 'solver', 'experimental', 'results', 'on', 'weakened', 'variants', 'of', 'the', 'renowned', 'encryption', 'algorithms', 'exhibit', 'advantage', 'of', 'the', 'proposed', 'approach', 'compared', 'to', 'the', 'state', 'of', 'the', 'art', 'in', 'terms', 'of', 'the', 'estimated', 'hardness', 'of', 'the', 'resulting', 'guessanddetermine', 'attacks']]
|
[-0.11698568447206456, -0.03099934498492915, -0.08227397940511134, 0.0906007308136815, -0.09564947824781904, -0.17850128705613316, 0.11819204704639, 0.312517018075316, -0.30183573411061215, -0.3436688026234221, 0.12005884690711704, -0.2428199750944399, -0.1082457605122517, 0.24776470774892145, -0.10874241916765011, 0.12992230609345895, 0.04903074270830705, -0.0015217425803152414, -0.049762733383641504, -0.30958186173095154, 0.324087468880372, -0.030107789121281644, 0.24575443185436038, 0.027648235185020336, 0.08636026714856808, -0.006892887227093944, 0.012063454643178444, 0.0902313608246354, -0.03738779730450075, 0.13908848493145062, 0.3071456266620841, 0.23917489375274342, 0.3332505237454405, -0.3985641378479508, -0.14401633417806947, 0.12208317950761949, 0.09333641939223386, 0.12476240182564093, -0.005802923467798302, -0.3152768772167082, 0.1168354672451432, -0.18262520351518804, -0.05083594165312556, -0.09429284849633965, 0.013542776318410268, 0.025866734291104455, -0.24969079373404385, -0.02762849270366132, 0.09207144166127994, 0.019460093677760318, 0.010572736649415814, -0.15713812380742567, 0.0951211334618095, 0.04464017868695709, 0.04562570348990938, 0.023597600266265756, 0.14384560604096175, -0.16488020443536627, -0.19985832827917946, 0.38112555151948563, 0.00935023775897347, -0.1748525381858389, 0.15588681116843453, 0.015353640888889249, -0.18211176497503542, 0.14808738933732876, 0.1927972636400507, 0.16345334721442598, -0.11979167014449978, 0.051533301639854194, -0.08678601942956447, 0.23300812161312653, 0.07046841969713569, 0.019215412753132672, 0.13001837175867806, 0.1929309133780547, 0.06618053059881697, 0.21529393763585875, -0.07694414559429368, -0.05538058751620925, -0.23791224558551152, -0.10711597055913163, -0.18901394680142403, -0.006423637505549078, -0.08125361078765798, -0.18063562192882482, 0.40118248615628826, 0.2026323389638072, 0.12677292951311056, 0.09928833570850726, 0.3353421375137539, 0.07636758616986648, 0.07368382721279676, 0.09163839916268793, 0.19384265930141106, 0.11008914128984683, 0.03731381308932144, -0.1870665068236681, 0.1869287849063627, 0.07478772668512718]
|
1,803.04647
|
On symplectic eigenvalues of positive definite matrices
|
If $A$ is a $2n \times 2n$ real positive definite matrix, then there exists a
symplectic matrix $M$ such that $M^TAM = \left [ \begin{array}{cc} D & O \\ O &
D \end{array} \right ]$ where $D= \diag (d_1 (A), \ldots, d_n(A))$ is a
diagonal matrix with positive diagonal entries, which are called the symplectic
eigenvalues of $A.$ In this paper we derive several fundamental inequalities
about these numbers. Among them are relations between the symplectic
eigenvalues of $A$ and those of $A^t,$ between the symplectic eigenvalues of
$m$ matrices $A_1, \ldots, A_m$ and of their Riemannian mean, a perturbation
theorem, some variational principles, and some inequalities between the
symplectic and ordinary eigenvalues.
|
math-ph math.MP
|
if a is a 2n times 2n real positive definite matrix then there exists a symplectic matrix m such that mtam left beginarraycc d o o d endarray right where d diag d_1 a ldots d_na is a diagonal matrix with positive diagonal entries which are called the symplectic eigenvalues of a in this paper we derive several fundamental inequalities about these numbers among them are relations between the symplectic eigenvalues of a and those of at between the symplectic eigenvalues of m matrices a_1 ldots a_m and of their riemannian mean a perturbation theorem some variational principles and some inequalities between the symplectic and ordinary eigenvalues
|
[['if', 'a', 'is', 'a', '2n', 'times', '2n', 'real', 'positive', 'definite', 'matrix', 'then', 'there', 'exists', 'a', 'symplectic', 'matrix', 'm', 'such', 'that', 'mtam', 'left', 'beginarraycc', 'd', 'o', 'o', 'd', 'endarray', 'right', 'where', 'd', 'diag', 'd_1', 'a', 'ldots', 'd_na', 'is', 'a', 'diagonal', 'matrix', 'with', 'positive', 'diagonal', 'entries', 'which', 'are', 'called', 'the', 'symplectic', 'eigenvalues', 'of', 'a', 'in', 'this', 'paper', 'we', 'derive', 'several', 'fundamental', 'inequalities', 'about', 'these', 'numbers', 'among', 'them', 'are', 'relations', 'between', 'the', 'symplectic', 'eigenvalues', 'of', 'a', 'and', 'those', 'of', 'at', 'between', 'the', 'symplectic', 'eigenvalues', 'of', 'm', 'matrices', 'a_1', 'ldots', 'a_m', 'and', 'of', 'their', 'riemannian', 'mean', 'a', 'perturbation', 'theorem', 'some', 'variational', 'principles', 'and', 'some', 'inequalities', 'between', 'the', 'symplectic', 'and', 'ordinary', 'eigenvalues']]
|
[-0.21591028522805505, 0.15372955190228685, -0.017318060063704285, 0.03992748052817506, -0.03647215327441271, -0.21805457314827814, 0.0013899607946305484, 0.3414330610935137, -0.2913117643845496, -0.19251031417592937, 0.08233002015666263, -0.36443331777908894, -0.1908035903624347, 0.09293218347779915, -0.034960686593790945, 0.0009842632593200454, 0.04512550391450103, 0.13496529968139134, -0.17122826435963429, -0.2196748003293321, 0.35916721530891255, -0.1290027723199565, 0.11105024441198078, 0.04889644941486383, 0.12757879717468792, -0.058637065417572576, 0.031224513255094864, -0.0805483617433259, -0.14271345003849864, 0.13099953783280655, 0.27833523191863074, 0.14361935263974066, 0.2750987673951489, -0.38585222614401915, -0.04579412183539836, 0.2503067574481357, 0.1600077750714812, -0.03906047363646926, 0.01190310528607301, -0.2982469661653323, 0.13314877989243953, -0.0951608739406714, -0.14907915900760102, -0.03865503705818347, 0.12988096309228875, 0.0029376062722700946, -0.33303370180908803, 0.07206708036433414, 0.11031044959881396, 0.08654125578886003, 0.02876586079562329, -0.24957249488435546, -0.021404821602495842, 0.08053269453417018, 0.0020565811307433077, 0.003130329397225858, 0.024890925990031013, 0.011171870528860896, -0.04899085268272825, 0.343192905925636, -0.017657842346519795, -0.2913969116601742, 0.05161365090412492, -0.16907760153419144, -0.15155438787110573, 0.0665579520974238, 0.06960355860339303, 0.15862724984521573, -0.05337603495649572, 0.19793841054548844, -0.14889573911204934, 0.10369086510695096, 0.12674800332038189, 0.02182157425086875, 0.11172817164663014, 0.001404167829468003, 0.09688117984190302, -0.0022229345137569703, 0.0235653968178118, -0.05113715628372892, -0.35435742767141115, -0.18357642316523026, -0.20794985519792392, 0.20668212795547178, -0.20180065364012373, -0.15829964095445456, 0.33482870895345257, 0.001954287312538275, 0.25844981233185194, 0.1239925800165917, 0.20927230082781775, 0.0766192346741006, 0.0025314053779749096, 0.09179986043358748, 0.07002289047001263, 0.3038058706453808, 0.022395483850729914, -0.18264735687550437, -0.04071990360576167, 0.17291015426997305]
|
1,803.04648
|
Particle emission from open-quantum systems
|
In this work, we discuss connections between different theoretical physics
communities and their works, all related to systems that act as sources of
particles such as photons, phonons, or electrons. Our interest is to understand
how a low-dimensional quantum system driven by coherent fields, e.g. a
two-level system, Jaynes-Cummings system, or photon pair source driven by a
laser pulse, emits photons into a waveguide. Of particular relevance to
solid-state sources is that we provide a way to include dissipation into the
formalism for temporal-mode quantum optics. We will discuss the connections
between temporal-mode quantum optics, scattering matrices, quantum stochastic
calculus, continuous matrix product states and operators, and very traditional
quantum optical concepts such as the Mandel photon counting formula and the
Lindblad form of the quantum-optical master equation. We close with an example
of how our formalism relates to single-photon sources with dephasing.
|
quant-ph physics.atom-ph physics.optics
|
in this work we discuss connections between different theoretical physics communities and their works all related to systems that act as sources of particles such as photons phonons or electrons our interest is to understand how a lowdimensional quantum system driven by coherent fields eg a twolevel system jaynescummings system or photon pair source driven by a laser pulse emits photons into a waveguide of particular relevance to solidstate sources is that we provide a way to include dissipation into the formalism for temporalmode quantum optics we will discuss the connections between temporalmode quantum optics scattering matrices quantum stochastic calculus continuous matrix product states and operators and very traditional quantum optical concepts such as the mandel photon counting formula and the lindblad form of the quantumoptical master equation we close with an example of how our formalism relates to singlephoton sources with dephasing
|
[['in', 'this', 'work', 'we', 'discuss', 'connections', 'between', 'different', 'theoretical', 'physics', 'communities', 'and', 'their', 'works', 'all', 'related', 'to', 'systems', 'that', 'act', 'as', 'sources', 'of', 'particles', 'such', 'as', 'photons', 'phonons', 'or', 'electrons', 'our', 'interest', 'is', 'to', 'understand', 'how', 'a', 'lowdimensional', 'quantum', 'system', 'driven', 'by', 'coherent', 'fields', 'eg', 'a', 'twolevel', 'system', 'jaynescummings', 'system', 'or', 'photon', 'pair', 'source', 'driven', 'by', 'a', 'laser', 'pulse', 'emits', 'photons', 'into', 'a', 'waveguide', 'of', 'particular', 'relevance', 'to', 'solidstate', 'sources', 'is', 'that', 'we', 'provide', 'a', 'way', 'to', 'include', 'dissipation', 'into', 'the', 'formalism', 'for', 'temporalmode', 'quantum', 'optics', 'we', 'will', 'discuss', 'the', 'connections', 'between', 'temporalmode', 'quantum', 'optics', 'scattering', 'matrices', 'quantum', 'stochastic', 'calculus', 'continuous', 'matrix', 'product', 'states', 'and', 'operators', 'and', 'very', 'traditional', 'quantum', 'optical', 'concepts', 'such', 'as', 'the', 'mandel', 'photon', 'counting', 'formula', 'and', 'the', 'lindblad', 'form', 'of', 'the', 'quantumoptical', 'master', 'equation', 'we', 'close', 'with', 'an', 'example', 'of', 'how', 'our', 'formalism', 'relates', 'to', 'singlephoton', 'sources', 'with', 'dephasing']]
|
[-0.10099217522290203, 0.19852619879104447, -0.07601086842547451, 0.07120356919533749, -0.05278458803162708, -0.18815595945585567, 0.04540574032051319, 0.38955567063359947, -0.2682536431829204, -0.27252392760653804, -0.0006659093021473789, -0.3288167418498494, -0.15967046295559698, 0.26112093865363434, -0.02973725012718485, 0.07306887877623101, 0.04020148296221778, -0.02592867054024848, -0.02449256961943803, -0.1632657787873299, 0.3269924045877427, 0.05480701582249046, 0.24765353741684368, 0.03021223372216027, 0.1443062103776769, 0.04070203224398722, 0.023385863562303405, -0.07262111293034745, -0.07197663146349963, 0.10762365867987836, 0.29003326965404763, 0.09122918928497946, 0.2528502654180035, -0.4656808129609465, -0.22208382848363656, 0.07850999294591325, 0.14039559661884143, 0.1676781109674228, -0.055761572878833834, -0.3281400133692822, -0.04982178175652569, -0.1907320401755038, -0.12470959512096784, -0.08727340610417818, -0.005058337201631361, 0.02245995840969515, -0.20710050599597446, 0.022650924302845984, 0.08422209632214993, -0.011794756415342405, 0.0030508304431617677, -0.014001432696350857, 0.04014849140621409, 0.10132377595360671, -0.052736864135424784, -0.004673927429724823, 0.1953308501157102, -0.13561056535430513, -0.18447821068095524, 0.37536071722193826, -0.05546389154966113, -0.19823895039857475, 0.1844712327775005, -0.11613847304239765, -0.07378012480513825, 0.06416024794554585, 0.16187743364077817, 0.08040091246724702, -0.1646979661280667, 0.05053901498798619, 0.008702872353573362, 0.17636147432250682, 0.06521048627376973, 0.16661206596055544, 0.22843672214010796, 0.11822409409267659, 0.01885398503448293, 0.1827059956495422, -0.05571652143066944, -0.13537204819666288, -0.32153281159829217, -0.16796832354264082, -0.1947328444656597, 0.11414916500761792, -0.050487372121802966, -0.14145888425686587, 0.36923199906860565, 0.15346664404195337, 0.13954990025661834, -0.02823525107094458, 0.28431339326829136, 0.1802415599439202, 0.02683798964721496, 0.03718696039990633, 0.21715116793276756, 0.23118589031575182, 0.10057860650643186, -0.22973590555529183, -0.03273565790427106, 0.00990210374543717]
|
1,803.04649
|
Optical Properties of Monolayer Bismuthene in Electric Fields
|
Optical excitations of monolayer bismuthene present the rich and unique
absorption spectra. The threshold frequency is not equal to an indirect energy
gap, and it becomes zero under the critical electric field. The frequency,
number, intensity and form of the absorption structures are dramatically
changed by the external field. The prominent peaks and the observable
shoulders, respectively, arise from the constant-energy loop and the band-edge
states of parabolic dispersions. These directly reflect the unusual electronic
properties, being very different from those in monolayer graphene.
|
cond-mat.mes-hall
|
optical excitations of monolayer bismuthene present the rich and unique absorption spectra the threshold frequency is not equal to an indirect energy gap and it becomes zero under the critical electric field the frequency number intensity and form of the absorption structures are dramatically changed by the external field the prominent peaks and the observable shoulders respectively arise from the constantenergy loop and the bandedge states of parabolic dispersions these directly reflect the unusual electronic properties being very different from those in monolayer graphene
|
[['optical', 'excitations', 'of', 'monolayer', 'bismuthene', 'present', 'the', 'rich', 'and', 'unique', 'absorption', 'spectra', 'the', 'threshold', 'frequency', 'is', 'not', 'equal', 'to', 'an', 'indirect', 'energy', 'gap', 'and', 'it', 'becomes', 'zero', 'under', 'the', 'critical', 'electric', 'field', 'the', 'frequency', 'number', 'intensity', 'and', 'form', 'of', 'the', 'absorption', 'structures', 'are', 'dramatically', 'changed', 'by', 'the', 'external', 'field', 'the', 'prominent', 'peaks', 'and', 'the', 'observable', 'shoulders', 'respectively', 'arise', 'from', 'the', 'constantenergy', 'loop', 'and', 'the', 'bandedge', 'states', 'of', 'parabolic', 'dispersions', 'these', 'directly', 'reflect', 'the', 'unusual', 'electronic', 'properties', 'being', 'very', 'different', 'from', 'those', 'in', 'monolayer', 'graphene']]
|
[-0.15568549365603498, 0.18685507215853986, -0.047515232930891216, 0.052124628937149066, -0.052092039137191716, -0.13474903004022226, 0.05705011838636849, 0.42544271965466796, -0.3038145817284073, -0.3044015415057185, 0.03251960033542543, -0.315145023265532, -0.11992662484269767, 0.18084907999062644, 0.05878806227840306, 0.006255721762066796, -0.014940841286997533, 0.0027971516163753612, -0.023713232406104606, -0.13023610805699026, 0.3326087332707608, 0.038505283245328994, 0.33000779838212546, 0.07426340671164715, -0.008912036971499523, -0.0166837195838092, 0.07080625840726065, 0.03149027693905823, -0.10250579281931832, 0.0926033347100851, 0.2346188483920525, -0.05402935606183573, 0.20513101946562529, -0.4073270294327466, -0.1698668395457346, 0.03950599924705568, 0.1305794581393933, 0.12340427533767763, -0.03652662942407742, -0.2915374676342167, 0.02426635737841328, -0.08601903222456929, -0.13542035404437533, -0.029689319700645728, -0.00529073773872196, 0.032760742701135485, -0.1622907801065594, 0.10733969118224368, 0.025543676417631406, 0.07720104156483319, -0.10531818690443677, -0.16059854322867023, -0.12321385492326781, 0.11247243199475288, 0.049069411162885705, -0.020059402472162174, 0.19855601482448124, -0.17152204189083672, -0.05977762228299287, 0.38333819964568, -0.07137944864197857, -0.05593484142307369, 0.19077923878406486, -0.20665520894718134, -0.03304159100627571, 0.23605472864472263, 0.10533897589041208, 0.06780772103229538, -0.08834080691061293, 0.06891938602105559, 0.006848692173315655, 0.17361118804824183, 0.09920893669948869, 0.13591586532337324, 0.2731271432380059, 0.07397833561879538, 0.042374264426706804, 0.11509816370727051, -0.12269284391437568, -0.022043413632283255, -0.22366778630142412, -0.11884219449434784, -0.1654487350024283, 0.07228316882104818, -0.05450712353281449, -0.20207428696310326, 0.4555540645655821, 0.116978050871694, 0.21816302719525993, -0.03920007485985046, 0.2619834577365379, 0.2064250690441224, 0.10060761870616781, 0.0460963289879146, 0.302202731503972, 0.15108735506544776, 0.11083010373736865, -0.26551753324678257, 0.03869063505304179, -0.06359879842715427]
|
1,803.0465
|
Ground state properties of $^{4}He$ and $^{12}C$ nuclei at equilibrium
and at large static compression at zero temperature using Nijmegen and Reid
Soft Core nucleon-nucleon interactions
|
In this paper, we investigate the ground state properties ($i.e$ binding
energy, nuclear radius, radial density distribution and single particle
energies) for $^{4}He$ and $^{12}C$ nuclei at equilibrium and at large static
compression at zero temperature by using two realistic different potentials
namely, Nijmegen and Reid Soft Core (RSC)potentials. We carry out the
calculations in No-Core Shell Model space consisting of six major oscillator
shells within the framework of the Constrained Spherical Hartree- Fock (CSHF)
approximations. We find out that, the computed equilibrium root mean square
radii and the Hartree Fock energies for 4He and 12C with those two different
potentials are very close to the experimental values of the nuclear radii and
nuclear binding energies for the same nuclei.
|
nucl-th
|
in this paper we investigate the ground state properties ie binding energy nuclear radius radial density distribution and single particle energies for 4he and 12c nuclei at equilibrium and at large static compression at zero temperature by using two realistic different potentials namely nijmegen and reid soft core rscpotentials we carry out the calculations in nocore shell model space consisting of six major oscillator shells within the framework of the constrained spherical hartree fock cshf approximations we find out that the computed equilibrium root mean square radii and the hartree fock energies for 4he and 12c with those two different potentials are very close to the experimental values of the nuclear radii and nuclear binding energies for the same nuclei
|
[['in', 'this', 'paper', 'we', 'investigate', 'the', 'ground', 'state', 'properties', 'ie', 'binding', 'energy', 'nuclear', 'radius', 'radial', 'density', 'distribution', 'and', 'single', 'particle', 'energies', 'for', '4he', 'and', '12c', 'nuclei', 'at', 'equilibrium', 'and', 'at', 'large', 'static', 'compression', 'at', 'zero', 'temperature', 'by', 'using', 'two', 'realistic', 'different', 'potentials', 'namely', 'nijmegen', 'and', 'reid', 'soft', 'core', 'rscpotentials', 'we', 'carry', 'out', 'the', 'calculations', 'in', 'nocore', 'shell', 'model', 'space', 'consisting', 'of', 'six', 'major', 'oscillator', 'shells', 'within', 'the', 'framework', 'of', 'the', 'constrained', 'spherical', 'hartree', 'fock', 'cshf', 'approximations', 'we', 'find', 'out', 'that', 'the', 'computed', 'equilibrium', 'root', 'mean', 'square', 'radii', 'and', 'the', 'hartree', 'fock', 'energies', 'for', '4he', 'and', '12c', 'with', 'those', 'two', 'different', 'potentials', 'are', 'very', 'close', 'to', 'the', 'experimental', 'values', 'of', 'the', 'nuclear', 'radii', 'and', 'nuclear', 'binding', 'energies', 'for', 'the', 'same', 'nuclei']]
|
[-0.023527450153162165, 0.1877500278149116, -0.0605974151610823, 0.12009023576955137, 0.0808500145419927, -0.1024267687304419, 0.012999487142039115, 0.40921350435937864, -0.18578552761336126, -0.29060738707371686, -0.036150292688743924, -0.3110185199164612, 0.00977231084045528, 0.09847828240027272, 0.11881255708344801, 0.050396797179280965, 0.07250818924710029, 0.047304167903533555, -0.14198705032901934, -0.1623328528268326, 0.350986248931958, 0.09014617891634925, 0.22951613513405544, 0.07170730927205345, 0.046969730012371376, 0.030228642957932237, 0.06926419452558887, -9.12870353944126e-05, -0.16903023780314932, 0.10054865897775202, 0.2303564682481041, 0.016295816658569846, 0.23518731558332379, -0.4664767909858186, -0.17723684368844508, 0.10525074888906694, 0.12325966115883094, 0.16591500539048495, -0.03217473813979808, -0.2559234958489315, 0.012378692512510944, -0.23041160100029182, -0.1986727015691478, -0.12157309323280924, 0.05347719288557389, 0.09587403056527471, -0.2153252228518348, 0.11100162414368242, -0.05283577729734766, 0.038329562051377115, -0.19891616088038278, -0.26897419042395965, -0.018856359578637502, 0.0782320980787656, -0.004195483915420975, 0.013962590400034846, 0.19851511423732549, -0.11127586899348929, -0.010989591515804562, 0.4052207600404272, -0.011090206917596318, -0.12970180802394526, 0.17633989671545136, -0.15386097558963477, -0.11664035721776723, 0.15161283300021441, 0.1438478632253926, 0.11545986360751913, -0.15100228447088246, 0.07491469153220828, -0.001981187217190104, 0.17984298929390577, 0.11020083913887394, -0.0005856997893839064, 0.1881562377783959, 0.15449217539596355, 0.0079992531435722, 0.07801530921389743, -0.182786770646413, -0.16880726243637628, -0.3121750931081883, -0.05048100410573879, -0.17091951921771645, 0.02388660678387446, -0.0727999622183033, -0.13615809367985418, 0.3669472177615547, 0.024122814020394522, 0.18419820313357702, 0.025460099675140138, 0.26808419266431516, 0.059752108773879584, 0.04458054227328275, 0.09645381491627324, 0.31478391917248777, 0.16105058149758222, 0.035329450363829985, -0.2761574658896711, -0.06101090997315438, 0.06536255002029683]
|
1,803.04651
|
Compressive Sensing Based User Clustering for Downlink NOMA Systems with
Decoding Power
|
This letter investigates joint power control and user clustering for downlink
non-orthogonal multiple access systems. Our aim is to minimize the total power
consumption by taking into account not only the conventional transmission power
but also the decoding power of the users. To solve this optimization problem,
it is firstly transformed into an equivalent problem with tractable
constraints. Then, an efficient algorithm is proposed to tackle the equivalent
problem by using the techniques of reweighted 1-norm minimization and
majorization-minimization. Numerical results validate the superiority of the
proposed algorithm over the conventional algorithms including the popular
matching-based algorithm.
|
cs.IT math.IT
|
this letter investigates joint power control and user clustering for downlink nonorthogonal multiple access systems our aim is to minimize the total power consumption by taking into account not only the conventional transmission power but also the decoding power of the users to solve this optimization problem it is firstly transformed into an equivalent problem with tractable constraints then an efficient algorithm is proposed to tackle the equivalent problem by using the techniques of reweighted 1norm minimization and majorizationminimization numerical results validate the superiority of the proposed algorithm over the conventional algorithms including the popular matchingbased algorithm
|
[['this', 'letter', 'investigates', 'joint', 'power', 'control', 'and', 'user', 'clustering', 'for', 'downlink', 'nonorthogonal', 'multiple', 'access', 'systems', 'our', 'aim', 'is', 'to', 'minimize', 'the', 'total', 'power', 'consumption', 'by', 'taking', 'into', 'account', 'not', 'only', 'the', 'conventional', 'transmission', 'power', 'but', 'also', 'the', 'decoding', 'power', 'of', 'the', 'users', 'to', 'solve', 'this', 'optimization', 'problem', 'it', 'is', 'firstly', 'transformed', 'into', 'an', 'equivalent', 'problem', 'with', 'tractable', 'constraints', 'then', 'an', 'efficient', 'algorithm', 'is', 'proposed', 'to', 'tackle', 'the', 'equivalent', 'problem', 'by', 'using', 'the', 'techniques', 'of', 'reweighted', '1norm', 'minimization', 'and', 'majorizationminimization', 'numerical', 'results', 'validate', 'the', 'superiority', 'of', 'the', 'proposed', 'algorithm', 'over', 'the', 'conventional', 'algorithms', 'including', 'the', 'popular', 'matchingbased', 'algorithm']]
|
[-0.09938904268369463, -0.07872775024416395, -0.06738231692117513, 0.04703318703674817, -0.10260645024593651, -0.20593397983244247, 0.05938192921661839, 0.39231709429283734, -0.33761854976722877, -0.3174384817404231, 0.09087243305576831, -0.23436416895368817, -0.18919234903356463, 0.18057018285617232, -0.12000038751314596, 0.1275888517758204, 0.055378661116527526, 0.00034183649749485487, -0.0707187827762946, -0.32398498479934584, 0.2708968393187778, 0.12749726367519074, 0.3583634747672327, 0.03527896136487114, 0.1360890754443334, 0.04696074684544169, -0.045909863675838894, 0.0466274407778665, -0.08206218565794994, 0.13044617746202947, 0.2809687067164089, 0.25527977822444486, 0.36038323069356154, -0.43193925488932233, -0.22022609702628299, 0.13085819486067773, 0.17361693312750034, 0.03173751778631788, -0.01726369060499152, -0.24326145472293048, 0.14237710398132192, -0.1837095807584905, 0.027756540349579042, -0.05375744397607968, -0.08128434103270321, 0.0027620750815444384, -0.352339810859796, 0.02169031419607657, 0.02465126100332313, -0.03438758069514921, -0.09916152453443669, -0.12756551885209286, 0.10027382614273463, 0.09515716965531104, 0.058213710633692205, -0.015641395057810797, 0.05870320921350924, -0.05315725892763009, -0.1618703976777603, 0.40923487003316583, 0.03899671378324634, -0.23324245788617848, 0.09424446410374697, 0.02911136293610961, -0.10735595324460763, 0.19570511323939913, 0.2380557309202466, 0.1211233463320766, -0.1926914731559065, 0.05857441821927685, -0.04912814823430531, 0.18060360658798635, 0.02196207711684335, 0.0013312472212944448, 0.12619082653923824, 0.17584844911831057, 0.15350962866136095, 0.17663738758125602, -0.07482740656501546, -0.11218473950842607, -0.17807738618870006, -0.10794910223981768, -0.22710316496200322, -0.0412454162434778, -0.08119230541207385, -0.0675406671638034, 0.4155363885820219, 0.1735197648924497, 0.14029296977234254, 0.15353161650085725, 0.471714637328669, 0.17813574384115444, 0.03168230381201396, 0.13115338389233677, 0.180861627268989, 0.11119398350356934, 0.0899495132706733, -0.2920917627562471, 0.02301631913491592, 0.05150111570723893]
|
1,803.04652
|
Music Genre Classification Using Spectral Analysis and Sparse
Representation of the Signals
|
In this paper, we proposed a robust music genre classification method based
on a sparse FFT based feature extraction method which extracted with
discriminating power of spectral analysis of non-stationary audio signals, and
the capability of sparse representation based classifiers. Feature extraction
method combines two sets of features namely short-term features (extracted from
windowed signals) and long-term features (extracted from combination of
extracted short-time features). Experimental results demonstrate that the
proposed feature extraction method leads to a sparse representation of audio
signals. As a result, a significant reduction in the dimensionality of the
signals is achieved. The extracted features are then fed into a sparse
representation based classifier (SRC). Our experimental results on the GTZAN
database demonstrate that the proposed method outperforms the other state of
the art SRC approaches. Moreover, the computational efficiency of the proposed
method is better than that of the other Compressive Sampling (CS)-based
classifiers.
|
cs.SD eess.AS
|
in this paper we proposed a robust music genre classification method based on a sparse fft based feature extraction method which extracted with discriminating power of spectral analysis of nonstationary audio signals and the capability of sparse representation based classifiers feature extraction method combines two sets of features namely shortterm features extracted from windowed signals and longterm features extracted from combination of extracted shorttime features experimental results demonstrate that the proposed feature extraction method leads to a sparse representation of audio signals as a result a significant reduction in the dimensionality of the signals is achieved the extracted features are then fed into a sparse representation based classifier src our experimental results on the gtzan database demonstrate that the proposed method outperforms the other state of the art src approaches moreover the computational efficiency of the proposed method is better than that of the other compressive sampling csbased classifiers
|
[['in', 'this', 'paper', 'we', 'proposed', 'a', 'robust', 'music', 'genre', 'classification', 'method', 'based', 'on', 'a', 'sparse', 'fft', 'based', 'feature', 'extraction', 'method', 'which', 'extracted', 'with', 'discriminating', 'power', 'of', 'spectral', 'analysis', 'of', 'nonstationary', 'audio', 'signals', 'and', 'the', 'capability', 'of', 'sparse', 'representation', 'based', 'classifiers', 'feature', 'extraction', 'method', 'combines', 'two', 'sets', 'of', 'features', 'namely', 'shortterm', 'features', 'extracted', 'from', 'windowed', 'signals', 'and', 'longterm', 'features', 'extracted', 'from', 'combination', 'of', 'extracted', 'shorttime', 'features', 'experimental', 'results', 'demonstrate', 'that', 'the', 'proposed', 'feature', 'extraction', 'method', 'leads', 'to', 'a', 'sparse', 'representation', 'of', 'audio', 'signals', 'as', 'a', 'result', 'a', 'significant', 'reduction', 'in', 'the', 'dimensionality', 'of', 'the', 'signals', 'is', 'achieved', 'the', 'extracted', 'features', 'are', 'then', 'fed', 'into', 'a', 'sparse', 'representation', 'based', 'classifier', 'src', 'our', 'experimental', 'results', 'on', 'the', 'gtzan', 'database', 'demonstrate', 'that', 'the', 'proposed', 'method', 'outperforms', 'the', 'other', 'state', 'of', 'the', 'art', 'src', 'approaches', 'moreover', 'the', 'computational', 'efficiency', 'of', 'the', 'proposed', 'method', 'is', 'better', 'than', 'that', 'of', 'the', 'other', 'compressive', 'sampling', 'csbased', 'classifiers']]
|
[-0.016288994352455132, -0.03897487127140865, -0.15934138848671328, 0.012666666584133152, -0.08712461772343556, -0.15860405985590995, 0.014429279188969291, 0.39011683135024655, -0.28722962938974167, -0.26796339848860096, 0.07491139647700892, -0.3000009576321248, -0.22254798641340845, 0.2532486186229785, -0.06140136550611898, 0.09511151411429973, 0.16376731105323805, 0.06372009837943686, -0.10187971510224345, -0.22570711875405872, 0.2729792011864233, 0.05885748451125602, 0.4281224609296394, -0.019069450644888734, 0.16376028097103407, -0.009956391642320176, -0.1201232792051734, -0.023355051400077424, 0.017907446315412443, 0.21792491005058556, 0.3143489195546448, 0.2161405198623116, 0.26622866413512286, -0.35559319892285657, -0.25981004493648574, 0.058594812283561185, 0.12456180802515189, 0.10259595551549913, -0.07709453036483602, -0.3757833907280692, 0.14375355134361842, -0.15322324502963147, 0.05928602611221023, -0.1662667948665135, -0.06036615792361882, 0.01592892739568656, -0.3198800776778852, 0.10286610506649986, 0.1257225097603971, 0.032984528884341655, -0.10581286979414173, -0.17784964155418262, 0.04649191296459394, 0.11220936955659082, 0.030301526513875732, 0.028078485352937256, 0.13792911333175714, -0.1523624610940257, -0.16006529343122267, 0.3405042357505268, -0.10583539732043153, -0.20297944015704544, 0.18300213259113515, -0.02864482664446903, -0.13365858188055255, 0.1530359065310167, 0.22523884127313434, 0.10319468292451445, -0.11619079130507956, -0.044940641310047234, -0.040976865473359624, 0.2575874044716158, 0.03461888325345959, 0.05467056202695974, 0.12996723967910612, 0.2521143543765249, -0.019462353312379162, 0.15817257024475917, -0.21087556457672044, -0.008579088932828315, -0.19638052990116278, -0.03600828123947718, -0.2782219321241965, -0.08838373788041781, -0.1427619114434956, -0.1351912360225848, 0.48850950937493137, 0.22992026404596416, 0.21943837242363484, 0.06776169158327675, 0.3801565471342796, 0.04915354874972629, 0.10040720340939577, 0.06762547082198947, 0.17351197395254953, 0.05639707621486995, 0.09065512989353913, -0.21508177416086596, 0.057560713524186374, 0.11388003687478208]
|
1,803.04653
|
Effect of High Frame Rates on 3D Video Quality of Experience
|
In this paper, we study the effect of 3D videos with increased frame rates on
the viewers quality of experience. We performed a series of subjective tests to
seek the subjects preferences among videos of the same scene at four different
frame rates: 24, 30, 48, and 60 frames per second (fps). Results revealed that
subjects clearly prefer higher frame rates. In particular, Mean Opinion Score
(MOS) values associated with the 60 fps 3D videos were 55% greater than MOS
values of the 24 fps 3D videos.
|
eess.IV
|
in this paper we study the effect of 3d videos with increased frame rates on the viewers quality of experience we performed a series of subjective tests to seek the subjects preferences among videos of the same scene at four different frame rates 24 30 48 and 60 frames per second fps results revealed that subjects clearly prefer higher frame rates in particular mean opinion score mos values associated with the 60 fps 3d videos were 55 greater than mos values of the 24 fps 3d videos
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'effect', 'of', '3d', 'videos', 'with', 'increased', 'frame', 'rates', 'on', 'the', 'viewers', 'quality', 'of', 'experience', 'we', 'performed', 'a', 'series', 'of', 'subjective', 'tests', 'to', 'seek', 'the', 'subjects', 'preferences', 'among', 'videos', 'of', 'the', 'same', 'scene', 'at', 'four', 'different', 'frame', 'rates', '24', '30', '48', 'and', '60', 'frames', 'per', 'second', 'fps', 'results', 'revealed', 'that', 'subjects', 'clearly', 'prefer', 'higher', 'frame', 'rates', 'in', 'particular', 'mean', 'opinion', 'score', 'mos', 'values', 'associated', 'with', 'the', '60', 'fps', '3d', 'videos', 'were', '55', 'greater', 'than', 'mos', 'values', 'of', 'the', '24', 'fps', '3d', 'videos']]
|
[-0.08729172353472175, 0.04518470347687688, -0.011368955400552943, 0.03834296000088383, -0.029172951936315018, -0.12315232096368382, 0.08836045217480853, 0.4724873307685571, -0.127861555473044, -0.42594671831733877, 0.02719638766132124, -0.33447369934198845, -0.0834498670562331, 0.1562614462327683, -0.14476855944215866, 0.011694707637773184, 0.13224949902351732, 0.13427828683721266, -0.09640595738925896, -0.3619274477121131, 0.21178007643701957, 0.08486982311346922, 0.33864567754254943, -0.03868114555538257, 0.13677449386309962, -0.03666382375034107, -0.07144290693746559, 0.019432479119592016, -0.10564597378842513, 0.1321456378336525, 0.2581992652160169, 0.10144946357535048, 0.34404974940350685, -0.4187956615297616, -0.14173181436356458, 0.003284916704541993, 0.07478066073495081, 0.04305811623518152, -0.011895031578592613, -0.3266524760582452, 0.13516191830965638, -0.14501655501067295, 0.0009733676246699246, 0.012411469186859569, 0.040694592060285736, -0.02673946192819925, -0.26642210715204134, 0.11445597287577887, -0.035373719411784375, 0.19236480872864012, -0.12963392795866419, -0.1184337002910331, 0.0012763681307691953, 0.199710626717143, 0.0865696745218131, 0.07629346113983841, 0.1782337499182971, -0.16466515347222402, -0.14327569527487302, 0.44090614710859527, -0.08165313184261991, -0.14628401290539694, 0.20852644375429072, -0.22614912293722916, -0.08416713208452552, 0.2142716729344436, 0.20641610562672902, 0.15870214953494055, -0.13478599601136199, -0.13991642016556177, -0.04993391279987563, 0.23777299853919567, 0.14886937248078977, 0.028256062466394286, 0.17502480503921022, 0.12996758652005302, -0.05432614867425599, 0.0673812781969064, -0.19734621322887747, -0.07503380730277164, -0.23649556247715506, -0.1523798688999966, -0.10442230970352545, -0.018107589914988, -0.16631192119839608, -0.014314276423176816, 0.4369717278014654, 0.20163616647237334, 0.18465184274761157, 0.1225151563726965, 0.23588006562371364, 0.012614227585151962, 0.08460882034463187, 0.0536944999669989, 0.1931788112925387, -0.044091942139376686, 0.1981614764790511, -0.11935484335636025, 0.015232867871721586, 0.014191184562213462]
|
1,803.04654
|
Simulation and Calibration of a Fully Bayesian Marked Multidimensional
Hawkes Process with Dissimilar Decays
|
We propose a simulation method for multidimensional Hawkes processes based on
superposition theory of point processes. This formulation allows us to design
efficient simulations for Hawkes processes with differing exponentially
decaying intensities. We demonstrate that inter-arrival times can be decomposed
into simpler auxiliary variables that can be sampled directly, giving exact
simulation with no approximation. We establish that the auxiliary variables
provides information on the parent process for each event time. The algorithm
correctness is shown by verifying the simulated intensities with their
theoretical moments. A modular inference procedure consisting of Gibbs samplers
through the auxiliary variable augmentation and adaptive rejection sampling is
presented. Finally, we compare our proposed simulation method against existing
methods, and find significant improvement in terms of algorithm speed. Our
inference algorithm is used to discover the strengths of mutually excitations
in real dark networks.
|
stat.ML
|
we propose a simulation method for multidimensional hawkes processes based on superposition theory of point processes this formulation allows us to design efficient simulations for hawkes processes with differing exponentially decaying intensities we demonstrate that interarrival times can be decomposed into simpler auxiliary variables that can be sampled directly giving exact simulation with no approximation we establish that the auxiliary variables provides information on the parent process for each event time the algorithm correctness is shown by verifying the simulated intensities with their theoretical moments a modular inference procedure consisting of gibbs samplers through the auxiliary variable augmentation and adaptive rejection sampling is presented finally we compare our proposed simulation method against existing methods and find significant improvement in terms of algorithm speed our inference algorithm is used to discover the strengths of mutually excitations in real dark networks
|
[['we', 'propose', 'a', 'simulation', 'method', 'for', 'multidimensional', 'hawkes', 'processes', 'based', 'on', 'superposition', 'theory', 'of', 'point', 'processes', 'this', 'formulation', 'allows', 'us', 'to', 'design', 'efficient', 'simulations', 'for', 'hawkes', 'processes', 'with', 'differing', 'exponentially', 'decaying', 'intensities', 'we', 'demonstrate', 'that', 'interarrival', 'times', 'can', 'be', 'decomposed', 'into', 'simpler', 'auxiliary', 'variables', 'that', 'can', 'be', 'sampled', 'directly', 'giving', 'exact', 'simulation', 'with', 'no', 'approximation', 'we', 'establish', 'that', 'the', 'auxiliary', 'variables', 'provides', 'information', 'on', 'the', 'parent', 'process', 'for', 'each', 'event', 'time', 'the', 'algorithm', 'correctness', 'is', 'shown', 'by', 'verifying', 'the', 'simulated', 'intensities', 'with', 'their', 'theoretical', 'moments', 'a', 'modular', 'inference', 'procedure', 'consisting', 'of', 'gibbs', 'samplers', 'through', 'the', 'auxiliary', 'variable', 'augmentation', 'and', 'adaptive', 'rejection', 'sampling', 'is', 'presented', 'finally', 'we', 'compare', 'our', 'proposed', 'simulation', 'method', 'against', 'existing', 'methods', 'and', 'find', 'significant', 'improvement', 'in', 'terms', 'of', 'algorithm', 'speed', 'our', 'inference', 'algorithm', 'is', 'used', 'to', 'discover', 'the', 'strengths', 'of', 'mutually', 'excitations', 'in', 'real', 'dark', 'networks']]
|
[-0.0738719345745463, 0.0711400506234051, -0.13705756089804197, 0.08693943127808708, -0.0652380792437483, -0.14593870969315012, 0.07238426895916006, 0.4400933675347365, -0.25289198638295096, -0.31371353310700373, 0.05477879987192079, -0.22089863901050416, -0.14708879365579045, 0.21839448981147877, -0.02323776320219308, 0.08119253045711801, 0.11370779575927438, -0.010856661637373966, -0.03847529234619235, -0.27973352587386535, 0.24048427614993115, 0.07573486081485321, 0.3061855069274525, -0.04575041712851351, 0.157258142898087, 0.044330314396404856, -0.06887892114413942, -0.00500455903385183, -0.10430707880910343, 0.11252644799462111, 0.2417888542345772, 0.18836639413489498, 0.2747322292010159, -0.422902075943986, -0.21579564238811355, 0.1127176894454567, 0.1728756918853296, 0.11043102187569347, -0.03882501527780948, -0.31113859466377564, 0.057837411907849925, -0.1313897961873742, -0.09306037535542529, -0.17018884130277864, -0.04840984646056732, 0.045239535839591685, -0.3594390386782533, 0.06450430204314615, 0.022060365705472824, 0.001620379276573658, -0.033617100328719576, -0.1257995074839338, 0.02025972256142137, 0.066750687812522, 0.03900980711357648, -0.00234246476161421, 0.1386811019121602, -0.03544668361867892, -0.1984105550603633, 0.3053668426951099, -0.060665553643807046, -0.24028751707431464, 0.20631367117736032, -0.06776372362062227, -0.15067321710328727, 0.17435764713152546, 0.19909481066924004, 0.11941182256254146, -0.15589889847814178, 0.0551760609072412, -0.012409278628811669, 0.16495015071776173, 0.00402049021627888, -0.0012861124328639117, 0.1495718859243307, 0.19391200083086815, 0.047262552455603644, 0.1770030142816467, -0.09440107406251025, -0.17089184556866613, -0.2994022968513288, -0.1381150821429885, -0.17412810648034374, 0.01924795530595743, -0.14661595354291357, -0.15373805520629757, 0.37305899933583553, 0.2573755306573652, 0.16755341167441107, 0.1162360689381687, 0.34566249692035345, 0.14899430500859354, 0.023526973679005136, 0.09863010641998149, 0.15440861275084586, 0.11408418888835867, 0.05698806439901588, -0.1806251317121946, 0.11316920386580415, 0.0663243979383126]
|
1,803.04655
|
About the Problem of Utilization the Low-Potential Heat and Recent
Perspective Developments
|
Problem of utilization of the low-potential heat and its perspectives are
considered and one example from the author works is presented in detail.
Description of the project and the results obtained are presented by a
development of the Liquid Metal Magnetohydrodynamic (LMMHD) Gravitational Mini
Power Plant (GMPP) for utilization of the low-potential heat from any available
low-exergy sources, which are the huge sources of the wasted energy around the
globe. Project is based on the experience by the LMMHD energy transformation
with gravitational vapour/gas-lift driving principle. An example of the GMPP
was developed and designed for small local consumers (100kW-1MW) for the
application in the geothermal low-temperature sources 150-250C, big ferries
(unused hot waters from engine), hot waters and gases from metallurgical and
chemical factories, and many other similar customers. The drawings for the
construction have been made and the optimal parameters computed for some
potential liquid metal working media and two variants of the unit modules
assembling have been elaborated (parallel assembling for getting the desired
voltage or consecutive assembling for obtaining the desired current in the
electrical network). The optimal height of the liquid metal circulating loop
was obtained in the range 10-15 m, and the voltage in a unit 1-2 Volt.
|
physics.app-ph
|
problem of utilization of the lowpotential heat and its perspectives are considered and one example from the author works is presented in detail description of the project and the results obtained are presented by a development of the liquid metal magnetohydrodynamic lmmhd gravitational mini power plant gmpp for utilization of the lowpotential heat from any available lowexergy sources which are the huge sources of the wasted energy around the globe project is based on the experience by the lmmhd energy transformation with gravitational vapourgaslift driving principle an example of the gmpp was developed and designed for small local consumers 100kw1mw for the application in the geothermal lowtemperature sources 150250c big ferries unused hot waters from engine hot waters and gases from metallurgical and chemical factories and many other similar customers the drawings for the construction have been made and the optimal parameters computed for some potential liquid metal working media and two variants of the unit modules assembling have been elaborated parallel assembling for getting the desired voltage or consecutive assembling for obtaining the desired current in the electrical network the optimal height of the liquid metal circulating loop was obtained in the range 1015 m and the voltage in a unit 12 volt
|
[['problem', 'of', 'utilization', 'of', 'the', 'lowpotential', 'heat', 'and', 'its', 'perspectives', 'are', 'considered', 'and', 'one', 'example', 'from', 'the', 'author', 'works', 'is', 'presented', 'in', 'detail', 'description', 'of', 'the', 'project', 'and', 'the', 'results', 'obtained', 'are', 'presented', 'by', 'a', 'development', 'of', 'the', 'liquid', 'metal', 'magnetohydrodynamic', 'lmmhd', 'gravitational', 'mini', 'power', 'plant', 'gmpp', 'for', 'utilization', 'of', 'the', 'lowpotential', 'heat', 'from', 'any', 'available', 'lowexergy', 'sources', 'which', 'are', 'the', 'huge', 'sources', 'of', 'the', 'wasted', 'energy', 'around', 'the', 'globe', 'project', 'is', 'based', 'on', 'the', 'experience', 'by', 'the', 'lmmhd', 'energy', 'transformation', 'with', 'gravitational', 'vapourgaslift', 'driving', 'principle', 'an', 'example', 'of', 'the', 'gmpp', 'was', 'developed', 'and', 'designed', 'for', 'small', 'local', 'consumers', '100kw1mw', 'for', 'the', 'application', 'in', 'the', 'geothermal', 'lowtemperature', 'sources', '150250c', 'big', 'ferries', 'unused', 'hot', 'waters', 'from', 'engine', 'hot', 'waters', 'and', 'gases', 'from', 'metallurgical', 'and', 'chemical', 'factories', 'and', 'many', 'other', 'similar', 'customers', 'the', 'drawings', 'for', 'the', 'construction', 'have', 'been', 'made', 'and', 'the', 'optimal', 'parameters', 'computed', 'for', 'some', 'potential', 'liquid', 'metal', 'working', 'media', 'and', 'two', 'variants', 'of', 'the', 'unit', 'modules', 'assembling', 'have', 'been', 'elaborated', 'parallel', 'assembling', 'for', 'getting', 'the', 'desired', 'voltage', 'or', 'consecutive', 'assembling', 'for', 'obtaining', 'the', 'desired', 'current', 'in', 'the', 'electrical', 'network', 'the', 'optimal', 'height', 'of', 'the', 'liquid', 'metal', 'circulating', 'loop', 'was', 'obtained', 'in', 'the', 'range', '1015', 'm', 'and', 'the', 'voltage', 'in', 'a', 'unit', '12', 'volt']]
|
[-0.10461438918660272, 0.12722615530366616, -0.012627179339302309, 0.029059217147990084, -0.028502393871395276, -0.11690530889535869, 0.06283982829696433, 0.35381440587830965, -0.23673013152056044, -0.33790977296861585, 0.13519420479882904, -0.318180539197232, -0.0731305685100108, 0.24962630497780863, -0.02192982441200075, 0.055118543051496015, 0.030301838024340645, 0.008488778873920591, -0.018893693206888256, -0.22152922684891205, 0.27059254616809386, 0.0900940738590152, 0.28821149310026545, 0.06526696826672332, 0.09739399580473099, -0.041544646803892894, -0.03863516908534097, -0.0057035517000423915, -0.10282325009095737, 0.11409276109682678, 0.25097761580231365, 0.08347043568371898, 0.2560303795099672, -0.4606574636441891, -0.21695339722388937, 0.0772345342703935, 0.08620101996495229, 0.07560232058202734, -0.10931141714793582, -0.24690714544814193, 0.05416171852677985, -0.1762704782075051, -0.11673903767480467, -0.02621142284080652, 0.007970184623969324, 0.06858940266094504, -0.21680033511736177, 0.012765990355050732, 0.017261448245317113, 0.05818549073254219, -0.09533809417108488, -0.1519160724593082, -0.025094248166288993, 0.1694821461043297, 0.017881200309005574, 0.017813436863379495, 0.18557779614418518, -0.1370316057341324, -0.07602533946669839, 0.383373635571751, -0.0204247160499558, -0.1126698210913067, 0.17251418774354865, -0.14019476413736215, -0.09498294592703307, 0.12612622092252201, 0.1429369620540217, 0.0794732808629333, -0.1895393575424084, 0.05410880667823038, 0.010214636684395373, 0.11007041289463593, 0.10151475797274451, -0.006886704815457566, 0.25048035733763957, 0.2076968259243953, 0.04210705320101532, 0.14075114633658703, -0.08375821672638671, -0.06677848995413932, -0.23715604737346915, -0.18253475446104087, -0.17074281396755872, 0.02746859023752011, -0.05764689002432414, -0.13560173628914093, 0.4040978438581923, 0.09841828342207302, 0.1280277482506753, -0.005213738375459798, 0.31109914798853977, 0.07129495863854471, 0.09327484975625394, 0.10181570636823473, 0.22311583857802847, 0.09481422480365093, 0.17742959255437282, -0.21194635260017644, 0.051230130731269266, 0.029726872460521532]
|
1,803.04656
|
Effect of Eye Dominance on the Perception of Stereoscopic 3D Video
|
Asymmetric schemes have widespread applications in the 3D video transmission
pipeline. The significance of eye dominance becomes a concern when designing
such schemes. In this paper, in order to investigate the effect of eye
dominance on the perceptual 3D video quality, a database of representative
asymmetric stereoscopic sequences is prepared and the overall 3D quality of
these sequences is evaluated through subjective experiments. Experiment results
showed that viewers find an asymmetric video more pleasant when the view with
higher quality is projected to their dominant eye. Moreover, the eye dominance
changes the mean opinion quality score by 16 % at most, a result caused by
slight asymmetric video compression. For all other representative types of
asymmetry, the statistical difference is much lower and in some cases even
negligible.
|
cs.GR cs.MM
|
asymmetric schemes have widespread applications in the 3d video transmission pipeline the significance of eye dominance becomes a concern when designing such schemes in this paper in order to investigate the effect of eye dominance on the perceptual 3d video quality a database of representative asymmetric stereoscopic sequences is prepared and the overall 3d quality of these sequences is evaluated through subjective experiments experiment results showed that viewers find an asymmetric video more pleasant when the view with higher quality is projected to their dominant eye moreover the eye dominance changes the mean opinion quality score by 16 at most a result caused by slight asymmetric video compression for all other representative types of asymmetry the statistical difference is much lower and in some cases even negligible
|
[['asymmetric', 'schemes', 'have', 'widespread', 'applications', 'in', 'the', '3d', 'video', 'transmission', 'pipeline', 'the', 'significance', 'of', 'eye', 'dominance', 'becomes', 'a', 'concern', 'when', 'designing', 'such', 'schemes', 'in', 'this', 'paper', 'in', 'order', 'to', 'investigate', 'the', 'effect', 'of', 'eye', 'dominance', 'on', 'the', 'perceptual', '3d', 'video', 'quality', 'a', 'database', 'of', 'representative', 'asymmetric', 'stereoscopic', 'sequences', 'is', 'prepared', 'and', 'the', 'overall', '3d', 'quality', 'of', 'these', 'sequences', 'is', 'evaluated', 'through', 'subjective', 'experiments', 'experiment', 'results', 'showed', 'that', 'viewers', 'find', 'an', 'asymmetric', 'video', 'more', 'pleasant', 'when', 'the', 'view', 'with', 'higher', 'quality', 'is', 'projected', 'to', 'their', 'dominant', 'eye', 'moreover', 'the', 'eye', 'dominance', 'changes', 'the', 'mean', 'opinion', 'quality', 'score', 'by', '16', 'at', 'most', 'a', 'result', 'caused', 'by', 'slight', 'asymmetric', 'video', 'compression', 'for', 'all', 'other', 'representative', 'types', 'of', 'asymmetry', 'the', 'statistical', 'difference', 'is', 'much', 'lower', 'and', 'in', 'some', 'cases', 'even', 'negligible']]
|
[-0.10651920983974829, 0.05447497428681309, -0.0682641548438247, 0.08065268522638123, -0.054200086896637766, -0.14513376486803017, 0.007146255416597614, 0.4552735256867146, -0.21107844493670874, -0.3351761301700759, 0.07789165507928711, -0.27710378522742685, -0.17271412520185406, 0.18880200416847007, -0.1429134813709346, 0.022821532867621543, 0.1153418297886731, 0.0659178105131613, -0.050781789712431864, -0.287405149131192, 0.28533678555377123, 0.07993883729223016, 0.3747361739730741, 0.025009324384567246, 0.07298648079461235, -0.014838719230849208, -0.07852097554132342, 0.04097283797212966, -0.06355998602515411, 0.12842098109780006, 0.2771503601597226, 0.13650676413387883, 0.28877368484675064, -0.3743854010052334, -0.1924661509106009, 0.07461554215355652, 0.13493217942928235, 0.09657180834356255, -0.11343585091102666, -0.31309038139586376, 0.12440313392788113, -0.15051183368512025, -0.05708043789124395, -0.03487929912911009, 0.018119201100776045, -0.0033867223862939933, -0.2598195666791944, 0.08409083678797767, 0.043370857132657425, 0.12746272847701715, -0.04809059898779676, -0.11330141652536792, -0.009573232389869183, 0.17781429668369622, 0.06928035136180248, 0.03569217810891275, 0.13706766819860053, -0.2184312199077415, -0.11045487158368965, 0.4311725468059459, -0.04325736846177157, -0.1824703516629268, 0.17740661778494599, -0.11668499224859576, -0.09086437904693949, 0.18302154733696732, 0.17610510681961172, 0.08925278604719934, -0.1085968766277601, -0.03986759897134465, -0.028875621853352296, 0.19724130572010506, 0.10917812989021865, 0.027463710430540203, 0.1994682266184415, 0.16874236001919105, 0.026236878534756952, 0.1422086337560194, -0.11696286166204124, -0.07118802381987412, -0.2109360916349362, -0.12533643413115086, -0.13007304159370728, -0.011106069549903508, -0.12505498170961743, -0.1217462649407584, 0.38794931363842383, 0.15806992468974135, 0.17395168714459955, 0.03666121525851291, 0.3647892087052657, 0.05041350087326929, 0.04361894437823239, -0.0028897857385266784, 0.21348990642719565, -0.01533135853517126, 0.14935578793052615, -0.19865372387223004, 0.10940276608091053, 0.010324342946309274]
|
1,803.04657
|
A note on polyomino chains with extremum general sum-connectivity index
|
The general sum-connectivity index of a graph $G$ is defined as
$\chi_{\alpha}(G)= \sum_{uv\in E(G)} (d_u + d_{v})^{\alpha}$ where $d_{u}$ is
degree of the vertex $u\in V(G)$, $\alpha$ is a real number different from $0$
and $uv$ is the edge connecting the vertices $u,v$. In this note, the problem
of characterizing the graphs having extremum $\chi_{\alpha}$ values from a
certain collection of polyomino chain graphs is solved for $\alpha<0$. The
obtained results together with already known results (concerning extremum
values of polyomino chain graphs) give the complete solution of the
aforementioned problem.
|
math.CO
|
the general sumconnectivity index of a graph g is defined as chi_alphag sum_uvin eg d_u d_valpha where d_u is degree of the vertex uin vg alpha is a real number different from 0 and uv is the edge connecting the vertices uv in this note the problem of characterizing the graphs having extremum chi_alpha values from a certain collection of polyomino chain graphs is solved for alpha0 the obtained results together with already known results concerning extremum values of polyomino chain graphs give the complete solution of the aforementioned problem
|
[['the', 'general', 'sumconnectivity', 'index', 'of', 'a', 'graph', 'g', 'is', 'defined', 'as', 'chi_alphag', 'sum_uvin', 'eg', 'd_u', 'd_valpha', 'where', 'd_u', 'is', 'degree', 'of', 'the', 'vertex', 'uin', 'vg', 'alpha', 'is', 'a', 'real', 'number', 'different', 'from', '0', 'and', 'uv', 'is', 'the', 'edge', 'connecting', 'the', 'vertices', 'uv', 'in', 'this', 'note', 'the', 'problem', 'of', 'characterizing', 'the', 'graphs', 'having', 'extremum', 'chi_alpha', 'values', 'from', 'a', 'certain', 'collection', 'of', 'polyomino', 'chain', 'graphs', 'is', 'solved', 'for', 'alpha0', 'the', 'obtained', 'results', 'together', 'with', 'already', 'known', 'results', 'concerning', 'extremum', 'values', 'of', 'polyomino', 'chain', 'graphs', 'give', 'the', 'complete', 'solution', 'of', 'the', 'aforementioned', 'problem']]
|
[-0.17931613691193474, 0.10654154118019092, -0.00947665977450511, 0.019526376447174698, -0.09459727534241127, -0.17037067818984558, 0.02387682275465605, 0.3394042536277663, -0.2731498008678583, -0.3127633589425717, 0.10077730133277575, -0.3562701452015476, -0.12436871832786975, 0.13818524617024444, -0.08318662642638876, 0.03372825991887525, 0.07916536612901837, 0.11889162494017827, 0.012588609888387675, -0.20926784023024744, 0.3264527002942156, -0.05715143318626691, 0.15649864032060246, 0.07217967523716982, 0.0763337136648426, 0.02425273043759675, 0.012459636732025749, 0.08146108636124567, -0.21642098199597307, 0.07498732696297918, 0.2424999241378497, 0.13715296233724736, 0.23132500990124588, -0.3286184159700166, -0.16127828861565582, 0.20846231564461382, 0.08395934222756875, 0.010024049022996967, 0.02738883014270951, -0.22728185014354743, 0.09766193386167288, -0.09160375839449196, -0.16551267814991827, 0.06844919324132868, 0.0984307039867748, 0.02167206558674066, -0.31396378469865094, 0.007468426446642049, 0.07432648700407961, 0.055950481317598715, 0.00918614545794712, -0.18239400478011125, -0.07824594593628055, 0.1301644368054853, 0.005121091319861906, 0.09155326332388954, 0.0399871110831472, -0.13782051132875495, -0.14123333390902684, 0.36266253274780785, 0.003075298757969656, -0.15304819407174364, 0.09977837537140162, -0.13656141914808276, -0.16322193113790656, 0.12102284553376111, 0.05742131074657664, 0.1564210142215333, -0.11079655244777148, 0.21355357626386898, -0.11406875383214686, 0.09954897640272975, 0.11946550102650443, 0.00807345645444002, 0.12243225169368088, 0.11274367260524411, 0.16184171542144296, 0.19953714763026006, 0.026044482534581966, -0.0025748853275383062, -0.33125813214362343, -0.09413033587836915, -0.2523757617031647, 0.09616270212096754, -0.22164831411034605, -0.1916927942603996, 0.42789888026362116, 0.07271148712278443, 0.22766438138734718, 0.11862361556003717, 0.18147682812361215, 0.12128876520992807, 0.010688758587507024, 0.11585056943162768, 0.1270151285412298, 0.14629989982826042, 0.02329103230096569, -0.1719282834065697, 0.05090865085102533, 0.16769678415518932]
|
1,803.04658
|
Quantum thermodynamics of single particle systems
|
Classical thermodynamics is built with the concept of equilibrium states.
However, it is less clear how equilibrium thermodynamics emerges through the
dynamics that follows the principle of quantum mechanics. In this paper, we
develop a theory to study the exact nonequilibrium thermodynamics of quantum
systems that is applicable to arbitrary small systems, even for single particle
systems, in contact with a reservoir. We generalize the concept of temperature
into nonequilibrium regime that depends on the detailed dynamics of quantum
states. When we apply the theory to the cavity system and the two-level atomic
system interacting with a heat reservoir, the exact nonequilibrium theory
unravels unambiguously (1) the emergence of classical thermodynamics from
quantum dynamics in the weak system-reservoir coupling regime, without
introducing equilibrium hypothesis; (2) the breakdown of classical
thermodynamics in the strong coupling regime, which is induced by non-Markovian
memory dynamics; and (3) the occurrence of dynamical quantum phase transition
characterized by inflationary dynamics associated with a negative
nonequilibrium temperature, from which the third law of thermodynamics,
allocated in the deep quantum realm, is naturally proved. The corresponding
dynamical criticality provides the border separating the classical and quantum
thermodynamics. The inflationary dynamics may also provide a simple picture for
the origin of big bang and universe inflation.
|
quant-ph cond-mat.stat-mech
|
classical thermodynamics is built with the concept of equilibrium states however it is less clear how equilibrium thermodynamics emerges through the dynamics that follows the principle of quantum mechanics in this paper we develop a theory to study the exact nonequilibrium thermodynamics of quantum systems that is applicable to arbitrary small systems even for single particle systems in contact with a reservoir we generalize the concept of temperature into nonequilibrium regime that depends on the detailed dynamics of quantum states when we apply the theory to the cavity system and the twolevel atomic system interacting with a heat reservoir the exact nonequilibrium theory unravels unambiguously 1 the emergence of classical thermodynamics from quantum dynamics in the weak systemreservoir coupling regime without introducing equilibrium hypothesis 2 the breakdown of classical thermodynamics in the strong coupling regime which is induced by nonmarkovian memory dynamics and 3 the occurrence of dynamical quantum phase transition characterized by inflationary dynamics associated with a negative nonequilibrium temperature from which the third law of thermodynamics allocated in the deep quantum realm is naturally proved the corresponding dynamical criticality provides the border separating the classical and quantum thermodynamics the inflationary dynamics may also provide a simple picture for the origin of big bang and universe inflation
|
[['classical', 'thermodynamics', 'is', 'built', 'with', 'the', 'concept', 'of', 'equilibrium', 'states', 'however', 'it', 'is', 'less', 'clear', 'how', 'equilibrium', 'thermodynamics', 'emerges', 'through', 'the', 'dynamics', 'that', 'follows', 'the', 'principle', 'of', 'quantum', 'mechanics', 'in', 'this', 'paper', 'we', 'develop', 'a', 'theory', 'to', 'study', 'the', 'exact', 'nonequilibrium', 'thermodynamics', 'of', 'quantum', 'systems', 'that', 'is', 'applicable', 'to', 'arbitrary', 'small', 'systems', 'even', 'for', 'single', 'particle', 'systems', 'in', 'contact', 'with', 'a', 'reservoir', 'we', 'generalize', 'the', 'concept', 'of', 'temperature', 'into', 'nonequilibrium', 'regime', 'that', 'depends', 'on', 'the', 'detailed', 'dynamics', 'of', 'quantum', 'states', 'when', 'we', 'apply', 'the', 'theory', 'to', 'the', 'cavity', 'system', 'and', 'the', 'twolevel', 'atomic', 'system', 'interacting', 'with', 'a', 'heat', 'reservoir', 'the', 'exact', 'nonequilibrium', 'theory', 'unravels', 'unambiguously', '1', 'the', 'emergence', 'of', 'classical', 'thermodynamics', 'from', 'quantum', 'dynamics', 'in', 'the', 'weak', 'systemreservoir', 'coupling', 'regime', 'without', 'introducing', 'equilibrium', 'hypothesis', '2', 'the', 'breakdown', 'of', 'classical', 'thermodynamics', 'in', 'the', 'strong', 'coupling', 'regime', 'which', 'is', 'induced', 'by', 'nonmarkovian', 'memory', 'dynamics', 'and', '3', 'the', 'occurrence', 'of', 'dynamical', 'quantum', 'phase', 'transition', 'characterized', 'by', 'inflationary', 'dynamics', 'associated', 'with', 'a', 'negative', 'nonequilibrium', 'temperature', 'from', 'which', 'the', 'third', 'law', 'of', 'thermodynamics', 'allocated', 'in', 'the', 'deep', 'quantum', 'realm', 'is', 'naturally', 'proved', 'the', 'corresponding', 'dynamical', 'criticality', 'provides', 'the', 'border', 'separating', 'the', 'classical', 'and', 'quantum', 'thermodynamics', 'the', 'inflationary', 'dynamics', 'may', 'also', 'provide', 'a', 'simple', 'picture', 'for', 'the', 'origin', 'of', 'big', 'bang', 'and', 'universe', 'inflation']]
|
[-0.14892584410755752, 0.2088420449889292, -0.14518167597774523, 0.07626966267036131, 0.0020339287248834106, -0.17949792442623919, 0.059626960866668154, 0.24393419188093574, -0.29115036945404427, -0.2511488297537793, 0.03609344788296417, -0.2618154873892378, -0.15791246617803922, 0.15538527416300404, -2.597630597077883e-05, 0.04197527985133302, 0.010636334932104755, 0.025910048811755796, -0.03423163647732089, -0.17867285896164292, 0.34142352670404275, 0.06143827359301213, 0.2828205477876159, 0.06021273334324807, 0.09034823670607203, -0.016118999984778035, 0.08353406532282512, 0.03871651898505381, -0.14835952808688, 0.07822947746955414, 0.21312850197472683, 0.07998465964024384, 0.27028717702324473, -0.4503867721202998, -0.2605780189713606, 0.07290571388372112, 0.09567787372753418, 0.17127879963663872, -0.0472085027817789, -0.2779488562709258, 0.008290881573115118, -0.162645285691654, -0.17064147394669887, -0.09342551531545513, -0.006415329670954424, -0.03272556403792875, -0.19092734755339244, 0.1340944773478091, 0.1042776158705797, 0.0423960868233385, -0.038582298670707345, 0.01609723835337298, 0.013281556933249634, 0.11925451549919111, -0.028638671968320314, -0.018255457949215688, 0.1845356185468308, -0.13864231544721406, -0.1259470324618563, 0.39226915058232126, -0.07166926100371011, -0.14061600138218358, 0.2117323426310367, -0.17220418328696935, -0.1456921133934744, 0.09389255199550042, 0.09240612028056952, 0.09608088887835738, -0.16849639205086603, 0.13318804920261476, 0.026244305074214935, 0.1662593852793529, 0.002822418366961826, 0.05620818084347635, 0.27778392505849925, 0.16965428055510318, 0.025349141040351242, 0.18516634775845048, -0.019967420182533367, -0.29209696627535425, -0.3332325065768181, -0.14689153049403103, -0.2076019310110356, 0.14199039817545922, -0.09046122572768721, -0.17340223077021968, 0.35105494642406343, 0.15243665951633234, 0.1393587292583946, 0.034145764703190744, 0.2642488333580192, 0.14943927059693335, -0.015529479379228387, 0.057618844063164525, 0.27691106147204453, 0.18467549046125406, 0.14228601084568465, -0.29468949500565383, 0.033438182928456135, 0.07518538354801982]
|
1,803.04659
|
Protein Mutation Stability Ternary Classification using Neural Networks
and Rigidity Analysis
|
Discerning how a mutation affects the stability of a protein is central to
the study of a wide range of diseases. Machine learning and statistical
analysis techniques can inform how to allocate limited resources to the
considerable time and cost associated with wet lab mutagenesis experiments. In
this work we explore the effectiveness of using a neural network classifier to
predict the change in the stability of a protein due to a mutation. Assessing
the accuracy of our approach is dependent on the use of experimental data about
the effects of mutations performed in vitro. Because the experimental data is
prone to discrepancies when similar experiments have been performed by multiple
laboratories, the use of the data near the juncture of stabilizing and
destabilizing mutations is questionable. We address this later problem via a
systematic approach in which we explore the use of a three-way classification
scheme with stabilizing, destabilizing, and inconclusive labels. For a
systematic search of potential classification cutoff values our classifier
achieved 68 percent accuracy on ternary classification for cutoff values of
-0.6 and 0.7 with a low rate of classifying stabilizing as destabilizing and
vice versa.
|
q-bio.QM
|
discerning how a mutation affects the stability of a protein is central to the study of a wide range of diseases machine learning and statistical analysis techniques can inform how to allocate limited resources to the considerable time and cost associated with wet lab mutagenesis experiments in this work we explore the effectiveness of using a neural network classifier to predict the change in the stability of a protein due to a mutation assessing the accuracy of our approach is dependent on the use of experimental data about the effects of mutations performed in vitro because the experimental data is prone to discrepancies when similar experiments have been performed by multiple laboratories the use of the data near the juncture of stabilizing and destabilizing mutations is questionable we address this later problem via a systematic approach in which we explore the use of a threeway classification scheme with stabilizing destabilizing and inconclusive labels for a systematic search of potential classification cutoff values our classifier achieved 68 percent accuracy on ternary classification for cutoff values of 06 and 07 with a low rate of classifying stabilizing as destabilizing and vice versa
|
[['discerning', 'how', 'a', 'mutation', 'affects', 'the', 'stability', 'of', 'a', 'protein', 'is', 'central', 'to', 'the', 'study', 'of', 'a', 'wide', 'range', 'of', 'diseases', 'machine', 'learning', 'and', 'statistical', 'analysis', 'techniques', 'can', 'inform', 'how', 'to', 'allocate', 'limited', 'resources', 'to', 'the', 'considerable', 'time', 'and', 'cost', 'associated', 'with', 'wet', 'lab', 'mutagenesis', 'experiments', 'in', 'this', 'work', 'we', 'explore', 'the', 'effectiveness', 'of', 'using', 'a', 'neural', 'network', 'classifier', 'to', 'predict', 'the', 'change', 'in', 'the', 'stability', 'of', 'a', 'protein', 'due', 'to', 'a', 'mutation', 'assessing', 'the', 'accuracy', 'of', 'our', 'approach', 'is', 'dependent', 'on', 'the', 'use', 'of', 'experimental', 'data', 'about', 'the', 'effects', 'of', 'mutations', 'performed', 'in', 'vitro', 'because', 'the', 'experimental', 'data', 'is', 'prone', 'to', 'discrepancies', 'when', 'similar', 'experiments', 'have', 'been', 'performed', 'by', 'multiple', 'laboratories', 'the', 'use', 'of', 'the', 'data', 'near', 'the', 'juncture', 'of', 'stabilizing', 'and', 'destabilizing', 'mutations', 'is', 'questionable', 'we', 'address', 'this', 'later', 'problem', 'via', 'a', 'systematic', 'approach', 'in', 'which', 'we', 'explore', 'the', 'use', 'of', 'a', 'threeway', 'classification', 'scheme', 'with', 'stabilizing', 'destabilizing', 'and', 'inconclusive', 'labels', 'for', 'a', 'systematic', 'search', 'of', 'potential', 'classification', 'cutoff', 'values', 'our', 'classifier', 'achieved', '68', 'percent', 'accuracy', 'on', 'ternary', 'classification', 'for', 'cutoff', 'values', 'of', '06', 'and', '07', 'with', 'a', 'low', 'rate', 'of', 'classifying', 'stabilizing', 'as', 'destabilizing', 'and', 'vice', 'versa']]
|
[-0.08599148067694745, 0.06567157617476034, -0.06298312573742709, 0.07764489932696482, -0.056683403406733356, -0.13429900825905958, 0.14481292800536674, 0.36785757318567974, -0.2424992282115119, -0.3171622896468953, 0.10109391462940134, -0.24195218979822178, -0.1571777610843511, 0.19172489548540111, -0.09552498157381227, 0.041217552168496985, 0.10749497359716578, 0.023521703829694734, -0.04622483462750863, -0.26753419302158843, 0.2971387278846171, 0.12960353454967077, 0.31079897981529175, 0.06208606228526486, 0.09000538966471427, -0.028881396740478904, -0.06071605739232741, 0.014351829366243787, -0.11919756606956454, 0.1328410782612321, 0.29318066906355517, 0.12058565484629453, 0.3503905962858545, -0.3792822436674645, -0.2184724163257909, 0.12911777773773983, 0.1272322220923869, 0.13553172785874554, -0.0714007844541859, -0.264421964152471, 0.12038816374506017, -0.15994707225625845, -0.06652421110897865, -0.11893259381605803, 0.0067559900056374704, 0.00701893084118829, -0.26526529859065223, 0.09239629818322627, 0.029552236431290544, 0.11151376971484799, -0.09152863025665284, -0.1022783238839015, -0.010152952787221262, 0.1569875570288308, 0.06425449184975342, 0.035659597503438, 0.16273827123406687, -0.15431768344470154, -0.13665459402653046, 0.37689263130734235, -0.035076171285503444, -0.19314765987158017, 0.21115296795768174, -0.10197102767660429, -0.14615783836128876, 0.11236188166627759, 0.23326147477124132, 0.10185236019376469, -0.1331459590053878, 0.010232245242743949, 0.011998900241757694, 0.19657722498584343, 0.06884209604835824, -0.03069119999356764, 0.1877457936000275, 0.25427889927707026, 0.007879516674744848, 0.130624942883457, -0.12719225443464605, -0.06284771395332524, -0.22907230578099474, -0.12449246167303309, -0.1453956981042498, 0.024641489698919224, -0.07536887825592299, -0.13544591160975153, 0.39207528708447126, 0.19103198161311938, 0.220877686280169, 0.05920485138317178, 0.2814834704316079, 0.03016524056254543, 0.08818659060389587, -0.0012293282001720448, 0.23404552185430044, 0.082304172192112, 0.08092604229030641, -0.26786964768727656, 0.10933234439412205, -0.01411614364723822]
|
1,803.0466
|
Certificates in P and Subquadratic-Time Computation of Radius, Diameter,
and all Eccentricities in Graphs
|
In the context of fine-grained complexity, we investigate the notion of
certificate enabling faster polynomial-time algorithms. We specifically target
radius (minimum eccentricity), diameter (maximum eccentricity), and
all-eccentricity computations for which quadratic-time lower bounds are known
under plausible conjectures. In each case, we introduce a notion of certificate
as a specific set of nodes from which appropriate bounds on all eccentricities
can be derived in subquadratic time when this set has sublinear size. The
existence of small certificates is a barrier against SETH-based lower bounds
for these problems. We indeed prove that for graph classes with small
certificates, there exist randomized subquadratic-time algorithms for computing
the radius, the diameter, and all eccentricities respectively.Moreover, these
notions of certificates are tightly related to algorithms probing the graph
through one-to-all distance queries and allow to explain the efficiency of
practical radius and diameter algorithms from the literature. Our formalization
enables a novel primal-dual analysis of a classical approach for diameter
computation that leads to algorithms for radius, diameter and all
eccentricities with theoretical guarantees with respect to certain graph
parameters. This is complemented by experimental results on various types of
real-world graphs showing that these parameters appear to be low in practice.
Finally, we obtain refined results for several graph classes.
|
cs.DM cs.CC cs.DS cs.NI
|
in the context of finegrained complexity we investigate the notion of certificate enabling faster polynomialtime algorithms we specifically target radius minimum eccentricity diameter maximum eccentricity and alleccentricity computations for which quadratictime lower bounds are known under plausible conjectures in each case we introduce a notion of certificate as a specific set of nodes from which appropriate bounds on all eccentricities can be derived in subquadratic time when this set has sublinear size the existence of small certificates is a barrier against sethbased lower bounds for these problems we indeed prove that for graph classes with small certificates there exist randomized subquadratictime algorithms for computing the radius the diameter and all eccentricities respectivelymoreover these notions of certificates are tightly related to algorithms probing the graph through onetoall distance queries and allow to explain the efficiency of practical radius and diameter algorithms from the literature our formalization enables a novel primaldual analysis of a classical approach for diameter computation that leads to algorithms for radius diameter and all eccentricities with theoretical guarantees with respect to certain graph parameters this is complemented by experimental results on various types of realworld graphs showing that these parameters appear to be low in practice finally we obtain refined results for several graph classes
|
[['in', 'the', 'context', 'of', 'finegrained', 'complexity', 'we', 'investigate', 'the', 'notion', 'of', 'certificate', 'enabling', 'faster', 'polynomialtime', 'algorithms', 'we', 'specifically', 'target', 'radius', 'minimum', 'eccentricity', 'diameter', 'maximum', 'eccentricity', 'and', 'alleccentricity', 'computations', 'for', 'which', 'quadratictime', 'lower', 'bounds', 'are', 'known', 'under', 'plausible', 'conjectures', 'in', 'each', 'case', 'we', 'introduce', 'a', 'notion', 'of', 'certificate', 'as', 'a', 'specific', 'set', 'of', 'nodes', 'from', 'which', 'appropriate', 'bounds', 'on', 'all', 'eccentricities', 'can', 'be', 'derived', 'in', 'subquadratic', 'time', 'when', 'this', 'set', 'has', 'sublinear', 'size', 'the', 'existence', 'of', 'small', 'certificates', 'is', 'a', 'barrier', 'against', 'sethbased', 'lower', 'bounds', 'for', 'these', 'problems', 'we', 'indeed', 'prove', 'that', 'for', 'graph', 'classes', 'with', 'small', 'certificates', 'there', 'exist', 'randomized', 'subquadratictime', 'algorithms', 'for', 'computing', 'the', 'radius', 'the', 'diameter', 'and', 'all', 'eccentricities', 'respectivelymoreover', 'these', 'notions', 'of', 'certificates', 'are', 'tightly', 'related', 'to', 'algorithms', 'probing', 'the', 'graph', 'through', 'onetoall', 'distance', 'queries', 'and', 'allow', 'to', 'explain', 'the', 'efficiency', 'of', 'practical', 'radius', 'and', 'diameter', 'algorithms', 'from', 'the', 'literature', 'our', 'formalization', 'enables', 'a', 'novel', 'primaldual', 'analysis', 'of', 'a', 'classical', 'approach', 'for', 'diameter', 'computation', 'that', 'leads', 'to', 'algorithms', 'for', 'radius', 'diameter', 'and', 'all', 'eccentricities', 'with', 'theoretical', 'guarantees', 'with', 'respect', 'to', 'certain', 'graph', 'parameters', 'this', 'is', 'complemented', 'by', 'experimental', 'results', 'on', 'various', 'types', 'of', 'realworld', 'graphs', 'showing', 'that', 'these', 'parameters', 'appear', 'to', 'be', 'low', 'in', 'practice', 'finally', 'we', 'obtain', 'refined', 'results', 'for', 'several', 'graph', 'classes']]
|
[-0.12999088200172637, 0.05719407071847832, -0.06045309465105941, 0.08424604012653596, -0.09356842280547248, -0.1552832853435198, 0.06924883441193165, 0.3935656247013135, -0.2644059611416263, -0.36152632362691955, 0.11608062204166611, -0.2306466312624696, -0.12345534354595968, 0.2604781506901107, -0.1247304410093021, 0.1030443142917825, 0.10761111386421296, 0.029858468464865326, -0.06134090880272774, -0.28781641663744956, 0.2809161048780036, 0.02575653747019426, 0.1949435534546288, 0.09714438081577012, 0.04254138165994025, -0.0160940993713533, 0.02152167820348972, 0.083354033904559, -0.21940686205659693, 0.14009656172881765, 0.26438846794388643, 0.21047486450023403, 0.27680075805543397, -0.393916509627569, -0.1251254866013258, 0.14216797644238374, 0.1162780999859778, 0.12043649622625331, -0.024924665164747617, -0.23724837567112067, 0.1587795565381828, -0.12758276159307216, -0.11063856983489198, -0.07976178387407122, 0.04728300391991691, 0.04549299824710299, -0.2922035541249121, 0.02005998584123828, 0.07009218143435512, 0.025578434052082096, -0.01844093025855084, -0.1592810414265841, 0.03796298667709003, 0.09369831298117344, 0.013639476012811916, -0.02443910783111322, 0.09324850661725533, -0.06938872266157599, -0.17356602113023856, 0.328407219452102, -0.005179823362893175, -0.16630191790712315, 0.1885506185078312, -0.08657477007292938, -0.17061888311944176, 0.11315902444965592, 0.2101658624642324, 0.1483030584277358, -0.10062019152363774, 0.08198930500288176, -0.07841299911506655, 0.1769464835575668, 0.10641481414346433, 0.08340575806228671, 0.15380600333986122, 0.14576810430735349, 0.15921889315018567, 0.14353819863711734, -0.029714701331515863, -0.09166377539542027, -0.27159135882492835, -0.10249649855058368, -0.1840751789209274, -0.02182870113614538, -0.20184345808492055, -0.17198985824645383, 0.36727980110885167, 0.16226702191527625, 0.2092465612560329, 0.1723424495686209, 0.29979566106027583, 0.074280208273274, 0.07359553243419746, 0.16632651930515904, 0.21419825579221474, 0.131313136641345, 0.03545836773814588, -0.16319629886931536, 0.1202417802630651, 0.09361029448805422]
|
1,803.04661
|
Pharmacophore and ligand-guided screening of antibacterial leads
targeting antibiotic resistance factor in Gram-negative bacteria
|
Pathogenic Gram-negative bacteria have developed resistance to antibiotics
due to their ability in creating an envelope on the outer layer of
lipooligosaccharides (LOS). The cationic phosphoethanolamine (PEA) decoration
of LOS lipid A is regulated by lipid A-PEA transferase (EptA) which may serve
as a prominent target for developing new antibiotics. The structural
characterization of Neisserial EptA has provided a structural basis to its
catalytic mechanisms and ligand recognition that are crucial for inhibitor
development. In this study, a combination of pharmacophore- and ligand-based
approach has been employed to explore novel potent EptA inhibitors among
millions of commercially-available compounds and approved drugs. A total of
8166 hit molecules obtained from ZincPharmer pharmacophore-based screening and
PubMed ligand similarity search were further examined through individual
two-step semi-flexible docking simulation performed in MOE. Best hits were
therefore selected based on their docking score and consensus of the two
docking validations. Free energy of binding calculation suggests that the best
20 consensus compounds have a stronger binding affinity than EptA natural
substrate PEA. Further interaction analyses of selected eight ligands
demonstrate that these ligands have overall more effective interactions with
catalytically-essential residues and metal cofactors of EptA. Selected hits can
be further analyzed in vitro and examined through a pre-clinical trial. This
study provides an insight into drug repurposing which may serve as an initial
step to develop novel potent EptA inhibitors to combat the virulence of
multi-drug resistant Gram-negative bacteria.
|
q-bio.BM
|
pathogenic gramnegative bacteria have developed resistance to antibiotics due to their ability in creating an envelope on the outer layer of lipooligosaccharides los the cationic phosphoethanolamine pea decoration of los lipid a is regulated by lipid apea transferase epta which may serve as a prominent target for developing new antibiotics the structural characterization of neisserial epta has provided a structural basis to its catalytic mechanisms and ligand recognition that are crucial for inhibitor development in this study a combination of pharmacophore and ligandbased approach has been employed to explore novel potent epta inhibitors among millions of commerciallyavailable compounds and approved drugs a total of 8166 hit molecules obtained from zincpharmer pharmacophorebased screening and pubmed ligand similarity search were further examined through individual twostep semiflexible docking simulation performed in moe best hits were therefore selected based on their docking score and consensus of the two docking validations free energy of binding calculation suggests that the best 20 consensus compounds have a stronger binding affinity than epta natural substrate pea further interaction analyses of selected eight ligands demonstrate that these ligands have overall more effective interactions with catalyticallyessential residues and metal cofactors of epta selected hits can be further analyzed in vitro and examined through a preclinical trial this study provides an insight into drug repurposing which may serve as an initial step to develop novel potent epta inhibitors to combat the virulence of multidrug resistant gramnegative bacteria
|
[['pathogenic', 'gramnegative', 'bacteria', 'have', 'developed', 'resistance', 'to', 'antibiotics', 'due', 'to', 'their', 'ability', 'in', 'creating', 'an', 'envelope', 'on', 'the', 'outer', 'layer', 'of', 'lipooligosaccharides', 'los', 'the', 'cationic', 'phosphoethanolamine', 'pea', 'decoration', 'of', 'los', 'lipid', 'a', 'is', 'regulated', 'by', 'lipid', 'apea', 'transferase', 'epta', 'which', 'may', 'serve', 'as', 'a', 'prominent', 'target', 'for', 'developing', 'new', 'antibiotics', 'the', 'structural', 'characterization', 'of', 'neisserial', 'epta', 'has', 'provided', 'a', 'structural', 'basis', 'to', 'its', 'catalytic', 'mechanisms', 'and', 'ligand', 'recognition', 'that', 'are', 'crucial', 'for', 'inhibitor', 'development', 'in', 'this', 'study', 'a', 'combination', 'of', 'pharmacophore', 'and', 'ligandbased', 'approach', 'has', 'been', 'employed', 'to', 'explore', 'novel', 'potent', 'epta', 'inhibitors', 'among', 'millions', 'of', 'commerciallyavailable', 'compounds', 'and', 'approved', 'drugs', 'a', 'total', 'of', '8166', 'hit', 'molecules', 'obtained', 'from', 'zincpharmer', 'pharmacophorebased', 'screening', 'and', 'pubmed', 'ligand', 'similarity', 'search', 'were', 'further', 'examined', 'through', 'individual', 'twostep', 'semiflexible', 'docking', 'simulation', 'performed', 'in', 'moe', 'best', 'hits', 'were', 'therefore', 'selected', 'based', 'on', 'their', 'docking', 'score', 'and', 'consensus', 'of', 'the', 'two', 'docking', 'validations', 'free', 'energy', 'of', 'binding', 'calculation', 'suggests', 'that', 'the', 'best', '20', 'consensus', 'compounds', 'have', 'a', 'stronger', 'binding', 'affinity', 'than', 'epta', 'natural', 'substrate', 'pea', 'further', 'interaction', 'analyses', 'of', 'selected', 'eight', 'ligands', 'demonstrate', 'that', 'these', 'ligands', 'have', 'overall', 'more', 'effective', 'interactions', 'with', 'catalyticallyessential', 'residues', 'and', 'metal', 'cofactors', 'of', 'epta', 'selected', 'hits', 'can', 'be', 'further', 'analyzed', 'in', 'vitro', 'and', 'examined', 'through', 'a', 'preclinical', 'trial', 'this', 'study', 'provides', 'an', 'insight', 'into', 'drug', 'repurposing', 'which', 'may', 'serve', 'as', 'an', 'initial', 'step', 'to', 'develop', 'novel', 'potent', 'epta', 'inhibitors', 'to', 'combat', 'the', 'virulence', 'of', 'multidrug', 'resistant', 'gramnegative', 'bacteria']]
|
[-0.08003859212106347, 0.09968961825615495, -0.034630955761888786, 0.05788816323068826, -0.05393473372545518, -0.18433468142246598, 0.1020337440351253, 0.40015008072818126, -0.18628821070224308, -0.3105496250076644, 0.01636823380275082, -0.28718226462431057, -0.21041299550581657, 0.16893263047524287, -0.03469952440252854, -0.004832193018764404, 0.07074077688198406, -0.018999105084507743, 0.059863408753779115, -0.2265666690328273, 0.1919390159207723, 0.14245967493109657, 0.2728629433846085, 0.09087827573520164, 0.08289228223178438, -0.0105599708974631, -0.004718813028088526, -0.007235105088176696, -0.13762204814443785, 0.15875966070125924, 0.2951467720867776, 0.1362942296985063, 0.3208371233766931, -0.47422301597288696, -0.22368955626479237, 0.048565941014666145, 0.15878040827361442, 0.10963320085603188, -0.10148645276358206, -0.29860392778707473, 0.08682586438851758, -0.1958802213336815, -0.08005030411144967, -0.10019060515387218, -0.006923129700385688, 0.08395547446235198, -0.23973208474502858, 0.05614480237853601, -0.027518334884294553, 0.10066820403740726, -0.11916069718529143, -0.19741319005761557, -0.07307834195569485, 0.18127881068115434, 0.0639556508052792, 0.02476625222449289, 0.24997702588555976, -0.08935809085807322, -0.11962579099794343, 0.34511055718094374, -0.0049306666111525585, -0.15989191126688015, 0.22270951141999512, -0.045036884958662676, -0.14391278182544434, 0.16691751433781496, 0.19044649594753424, 0.11701928786504523, -0.23542185026127027, -0.05552231596773613, 0.010275010434142723, 0.19326300510376887, 0.11377889982459397, -0.04309895736106116, 0.18705038663424683, 0.24492057153889746, 0.022242803338980467, 0.14789320078316928, -0.10388048303113401, -0.03537645705223998, -0.1452117094263565, -0.20974611828569323, -0.12110052811565988, 0.044213979667371235, -0.052542013644709014, -0.17205940758229413, 0.3621922280402495, 0.09445274623175735, 0.12412039199708695, 0.005473471427409861, 0.21707440264371894, -0.053846346648418135, 0.1301648226973045, -0.053028890665971856, 0.19375753394489406, 0.06516692515875197, 0.05595590265900746, -0.25477773935856757, 0.1968086553408699, 0.02002230705387008]
|
1,803.04662
|
Constraints on two Higgs doublet models from domain walls
|
We show that there is a constraint on the parameter space of two Higgs
doublet models that comes from the existence of the stable vortex-domain wall
systems. The constraint is quite universal in the sense that it depends on only
two combinations of Lagrangian parameters and does not depend on how fermions
couple to two Higgs fields. Numerical solutions of field configurations of
domain wall-vortex system are obtained, which provide a basis for further
quantitative study of cosmology which involve such topological objects.
|
hep-ph hep-th
|
we show that there is a constraint on the parameter space of two higgs doublet models that comes from the existence of the stable vortexdomain wall systems the constraint is quite universal in the sense that it depends on only two combinations of lagrangian parameters and does not depend on how fermions couple to two higgs fields numerical solutions of field configurations of domain wallvortex system are obtained which provide a basis for further quantitative study of cosmology which involve such topological objects
|
[['we', 'show', 'that', 'there', 'is', 'a', 'constraint', 'on', 'the', 'parameter', 'space', 'of', 'two', 'higgs', 'doublet', 'models', 'that', 'comes', 'from', 'the', 'existence', 'of', 'the', 'stable', 'vortexdomain', 'wall', 'systems', 'the', 'constraint', 'is', 'quite', 'universal', 'in', 'the', 'sense', 'that', 'it', 'depends', 'on', 'only', 'two', 'combinations', 'of', 'lagrangian', 'parameters', 'and', 'does', 'not', 'depend', 'on', 'how', 'fermions', 'couple', 'to', 'two', 'higgs', 'fields', 'numerical', 'solutions', 'of', 'field', 'configurations', 'of', 'domain', 'wallvortex', 'system', 'are', 'obtained', 'which', 'provide', 'a', 'basis', 'for', 'further', 'quantitative', 'study', 'of', 'cosmology', 'which', 'involve', 'such', 'topological', 'objects']]
|
[-0.16962080648759517, 0.14197391432301118, -0.10613171250570747, 0.0713858688392154, -0.10806223716041664, -0.15955030470632198, 0.015531438482334702, 0.3440493385466497, -0.22210715762225958, -0.2670814073758154, 0.10947214474009986, -0.22622595224302353, -0.13570481592721148, 0.23585021516262758, -0.01387872092039665, 0.002884757080365245, 0.07929369137145398, 0.038643412678516696, -0.06851867140304842, -0.25793105424041063, 0.4036863801728298, -0.05882716738823347, 0.24836184614815, 0.04930925060904062, 0.11906789572591461, -0.032203030184751784, 0.020911868019938107, 0.028323698930496282, -0.13975944207466942, 0.11020258929943894, 0.15993149191477066, 0.1259163160206432, 0.1900057642289051, -0.39767275922136697, -0.21203483114155328, 0.11799867806967529, 0.1338611282372745, 0.0955014493651461, -0.03642742055263824, -0.23760041785880742, 0.09191856046048243, -0.11692889900196617, -0.0734567112153078, -0.11111215965413465, -0.018351575335567225, 0.005973766032583648, -0.2826561396316875, 0.044423731026898436, 0.045055829398845115, 0.03990087126631562, -0.07810981316696398, -0.11340525306096845, -0.0651881861750309, 0.0891667128108987, 0.11278479743362745, 0.011323937365399083, 0.12922871648333967, -0.18092001521982615, -0.11390922701400819, 0.40291752380023643, -0.07893861051387631, -0.2675923953321194, 0.22270323941484094, -0.13242598897891072, -0.1485966721027181, 0.09700445934176082, 0.14302691092953176, 0.12398849006333365, -0.10214553170315013, 0.15910516892738708, -0.08594780058100275, 0.2149774281538046, 0.030473029984888142, 0.06019127865821668, 0.2356565714836484, 0.12244109207446255, 0.11278344744322367, 0.08092897281436841, -0.019394639978844035, -0.1392358683572128, -0.3798380875732841, -0.14469966667181836, -0.168338534694801, 0.009762710372231639, -0.06390590685765435, -0.20999230031298882, 0.40615643870380774, 0.15881774642663757, 0.20669040820992937, -0.0010738368486849273, 0.2270282530793693, 0.104098048992455, 0.06397129646388859, 0.015192723989191397, 0.30607114865717183, 0.10411650880535202, 0.0614821610506624, -0.2038890846420034, -0.004655418008929346, 0.07536392734192948]
|
1,803.04663
|
Binary Matrix Completion Using Unobserved Entries
|
A matrix completion problem, which aims to recover a complete matrix from its
partial observations, is one of the important problems in the machine learning
field and has been studied actively. However, there is a discrepancy between
the mainstream problem setting, which assumes continuous-valued observations,
and some practical applications such as recommendation systems and SNS link
predictions where observations take discrete or even binary values. To cope
with this problem, Davenport et al. (2014) proposed a binary matrix completion
(BMC) problem, where observations are quantized into binary values. Hsieh et
al. (2015) proposed a PU (Positive and Unlabeled) matrix completion problem,
which is an extension of the BMC problem. This problem targets the setting
where we cannot observe negative values, such as SNS link predictions. In the
construction of their method for this setting, they introduced a methodology of
the classification problem, regarding each matrix entry as a sample. Their
risk, which defines losses over unobserved entries as well, indicates the
possibility of the use of unobserved entries. In this paper, motivated by a
semi-supervised classification method recently proposed by Sakai et al. (2017),
we develop a method for the BMC problem which can use all of positive,
negative, and unobserved entries, by combining the risks of Davenport et al.
(2014) and Hsieh et al. (2015). To the best of our knowledge, this is the first
BMC method which exploits all kinds of matrix entries. We experimentally show
that an appropriate mixture of risks improves the performance.
|
stat.ML cs.LG
|
a matrix completion problem which aims to recover a complete matrix from its partial observations is one of the important problems in the machine learning field and has been studied actively however there is a discrepancy between the mainstream problem setting which assumes continuousvalued observations and some practical applications such as recommendation systems and sns link predictions where observations take discrete or even binary values to cope with this problem davenport et al 2014 proposed a binary matrix completion bmc problem where observations are quantized into binary values hsieh et al 2015 proposed a pu positive and unlabeled matrix completion problem which is an extension of the bmc problem this problem targets the setting where we cannot observe negative values such as sns link predictions in the construction of their method for this setting they introduced a methodology of the classification problem regarding each matrix entry as a sample their risk which defines losses over unobserved entries as well indicates the possibility of the use of unobserved entries in this paper motivated by a semisupervised classification method recently proposed by sakai et al 2017 we develop a method for the bmc problem which can use all of positive negative and unobserved entries by combining the risks of davenport et al 2014 and hsieh et al 2015 to the best of our knowledge this is the first bmc method which exploits all kinds of matrix entries we experimentally show that an appropriate mixture of risks improves the performance
|
[['a', 'matrix', 'completion', 'problem', 'which', 'aims', 'to', 'recover', 'a', 'complete', 'matrix', 'from', 'its', 'partial', 'observations', 'is', 'one', 'of', 'the', 'important', 'problems', 'in', 'the', 'machine', 'learning', 'field', 'and', 'has', 'been', 'studied', 'actively', 'however', 'there', 'is', 'a', 'discrepancy', 'between', 'the', 'mainstream', 'problem', 'setting', 'which', 'assumes', 'continuousvalued', 'observations', 'and', 'some', 'practical', 'applications', 'such', 'as', 'recommendation', 'systems', 'and', 'sns', 'link', 'predictions', 'where', 'observations', 'take', 'discrete', 'or', 'even', 'binary', 'values', 'to', 'cope', 'with', 'this', 'problem', 'davenport', 'et', 'al', '2014', 'proposed', 'a', 'binary', 'matrix', 'completion', 'bmc', 'problem', 'where', 'observations', 'are', 'quantized', 'into', 'binary', 'values', 'hsieh', 'et', 'al', '2015', 'proposed', 'a', 'pu', 'positive', 'and', 'unlabeled', 'matrix', 'completion', 'problem', 'which', 'is', 'an', 'extension', 'of', 'the', 'bmc', 'problem', 'this', 'problem', 'targets', 'the', 'setting', 'where', 'we', 'can', 'not', 'observe', 'negative', 'values', 'such', 'as', 'sns', 'link', 'predictions', 'in', 'the', 'construction', 'of', 'their', 'method', 'for', 'this', 'setting', 'they', 'introduced', 'a', 'methodology', 'of', 'the', 'classification', 'problem', 'regarding', 'each', 'matrix', 'entry', 'as', 'a', 'sample', 'their', 'risk', 'which', 'defines', 'losses', 'over', 'unobserved', 'entries', 'as', 'well', 'indicates', 'the', 'possibility', 'of', 'the', 'use', 'of', 'unobserved', 'entries', 'in', 'this', 'paper', 'motivated', 'by', 'a', 'semisupervised', 'classification', 'method', 'recently', 'proposed', 'by', 'sakai', 'et', 'al', '2017', 'we', 'develop', 'a', 'method', 'for', 'the', 'bmc', 'problem', 'which', 'can', 'use', 'all', 'of', 'positive', 'negative', 'and', 'unobserved', 'entries', 'by', 'combining', 'the', 'risks', 'of', 'davenport', 'et', 'al', '2014', 'and', 'hsieh', 'et', 'al', '2015', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'bmc', 'method', 'which', 'exploits', 'all', 'kinds', 'of', 'matrix', 'entries', 'we', 'experimentally', 'show', 'that', 'an', 'appropriate', 'mixture', 'of', 'risks', 'improves', 'the', 'performance']]
|
[-0.051674618785675135, 0.031531875022811885, -0.024857167616456507, 0.014760851346974021, -0.11606021676280145, -0.12984278268038085, 0.07901948675909455, 0.35675047175778496, -0.2743088285656526, -0.35304045505190806, 0.11803430708495134, -0.27570056599365816, -0.22216471802582213, 0.15516059629284898, -0.1358673360054156, 0.09114426937025376, 0.07738367662410207, 0.00034012430302438236, -0.039816290349042376, -0.31876172754545545, 0.29628647099091343, 0.07878247959794657, 0.2598149351927737, 0.015073728565532234, 0.1247811340783242, 0.040273241117604136, -0.05881818525695933, 0.0231406171308575, -0.08798632912766474, 0.11091797331379982, 0.2949073401790473, 0.1654876388014189, 0.3168995394972303, -0.34730543184826773, -0.25264904539618593, 0.15055523909470667, 0.08709834264253356, 0.10222290960542348, -0.04046049571198021, -0.30192470882461603, 0.0847872594669987, -0.20881587944947363, -0.05104473651003753, -0.034666558661903706, 0.036576351411865965, -0.03589952378317849, -0.34428661320341614, 0.0650787636461187, 0.09357893895761546, 0.004490029368166541, -0.06384141308550287, -0.16000074946561887, 0.07414758476267208, 0.10250477479759514, 0.032561255042486255, 0.015638964138962628, 0.041033533788586575, -0.08312549877624523, -0.15777188588324334, 0.33170760290698625, -0.038144480853882286, -0.15982036420140386, 0.1610750513951174, -0.046748198540655955, -0.15524834242739505, 0.08608753151155167, 0.17898162825018046, 0.13260950057226564, -0.13251098690623972, 0.12294049875392023, -0.12183359560496625, 0.15305197197613457, 0.05049356270953262, -0.041022547299132475, 0.15869446822644903, 0.1360328710607944, 0.035038883196032274, 0.10393326425354087, -0.057381041854481035, -0.051926808841310575, -0.23299597854155205, -0.1457662673409129, -0.2283406802011849, 0.013203578089580274, -0.049415310344615604, -0.15026648876242218, 0.3717296562540615, 0.16283920060302462, 0.26901486416106984, 0.05678174322876599, 0.28603894082217235, 0.08564847311466903, 0.011768814663575482, 0.1127988988488552, 0.19546410665932326, 0.14720932554055546, 0.10444691724795473, -0.16995640439938964, 0.11347256898185268, 0.07451071393781251]
|
1,803.04664
|
A switchable diode based on room-temperature two-dimensional
ferroelectric {\alpha}-In2Se3 thin layers
|
Nanoscaled room-temperature ferroelectricity is ideal for developing advanced
non-volatile high-density memories. However, reaching the thin film limit in
conventional ferroelectrics is a long-standing challenge due to the possible
critical thickness effect. Van der Waals materials, thanks to their stable
layered structure, saturate interfacial chemistry and weak interlayer
couplings, are promising for exploring ultra-thin two-dimensional (2D)
ferroelectrics and device applications. Here, we demonstrate a switchable
room-temperature ferroelectric diode built upon a 2D ferroelectric
{\alpha}-In2Se3 layer as thin as 5 nm in the form of graphene/{\alpha}-In2Se3
heterojunction. The intrinsic out-of-plane ferroelectricity of the
{\alpha}-In2Se3 thin layers is evidenced by the observation of reversible
spontaneous electric polarization with a relative low coercive electric field
of ~$2 X 10^5 V/cm$ and a typical ferroelectric domain size of around tens
${\mu}m^2$. Owing to the out-of-plane ferroelectricity of the {\alpha}-In2Se3
layer, the Schottky barrier at the graphene/{\alpha}-In2Se3 interface can be
effectively tuned by switching the electric polarization with an applied
voltage, leading to a pronounced switchable double diode effect with an on/off
ratio of ~$10^4$. Our results offer a new way for developing novel
nanoelectronic devices based on 2D ferroelectrics.
|
cond-mat.mtrl-sci
|
nanoscaled roomtemperature ferroelectricity is ideal for developing advanced nonvolatile highdensity memories however reaching the thin film limit in conventional ferroelectrics is a longstanding challenge due to the possible critical thickness effect van der waals materials thanks to their stable layered structure saturate interfacial chemistry and weak interlayer couplings are promising for exploring ultrathin twodimensional 2d ferroelectrics and device applications here we demonstrate a switchable roomtemperature ferroelectric diode built upon a 2d ferroelectric alphain2se3 layer as thin as 5 nm in the form of graphenealphain2se3 heterojunction the intrinsic outofplane ferroelectricity of the alphain2se3 thin layers is evidenced by the observation of reversible spontaneous electric polarization with a relative low coercive electric field of 2 x 105 vcm and a typical ferroelectric domain size of around tens mum2 owing to the outofplane ferroelectricity of the alphain2se3 layer the schottky barrier at the graphenealphain2se3 interface can be effectively tuned by switching the electric polarization with an applied voltage leading to a pronounced switchable double diode effect with an onoff ratio of 104 our results offer a new way for developing novel nanoelectronic devices based on 2d ferroelectrics
|
[['nanoscaled', 'roomtemperature', 'ferroelectricity', 'is', 'ideal', 'for', 'developing', 'advanced', 'nonvolatile', 'highdensity', 'memories', 'however', 'reaching', 'the', 'thin', 'film', 'limit', 'in', 'conventional', 'ferroelectrics', 'is', 'a', 'longstanding', 'challenge', 'due', 'to', 'the', 'possible', 'critical', 'thickness', 'effect', 'van', 'der', 'waals', 'materials', 'thanks', 'to', 'their', 'stable', 'layered', 'structure', 'saturate', 'interfacial', 'chemistry', 'and', 'weak', 'interlayer', 'couplings', 'are', 'promising', 'for', 'exploring', 'ultrathin', 'twodimensional', '2d', 'ferroelectrics', 'and', 'device', 'applications', 'here', 'we', 'demonstrate', 'a', 'switchable', 'roomtemperature', 'ferroelectric', 'diode', 'built', 'upon', 'a', '2d', 'ferroelectric', 'alphain2se3', 'layer', 'as', 'thin', 'as', '5', 'nm', 'in', 'the', 'form', 'of', 'graphenealphain2se3', 'heterojunction', 'the', 'intrinsic', 'outofplane', 'ferroelectricity', 'of', 'the', 'alphain2se3', 'thin', 'layers', 'is', 'evidenced', 'by', 'the', 'observation', 'of', 'reversible', 'spontaneous', 'electric', 'polarization', 'with', 'a', 'relative', 'low', 'coercive', 'electric', 'field', 'of', '2', 'x', '105', 'vcm', 'and', 'a', 'typical', 'ferroelectric', 'domain', 'size', 'of', 'around', 'tens', 'mum2', 'owing', 'to', 'the', 'outofplane', 'ferroelectricity', 'of', 'the', 'alphain2se3', 'layer', 'the', 'schottky', 'barrier', 'at', 'the', 'graphenealphain2se3', 'interface', 'can', 'be', 'effectively', 'tuned', 'by', 'switching', 'the', 'electric', 'polarization', 'with', 'an', 'applied', 'voltage', 'leading', 'to', 'a', 'pronounced', 'switchable', 'double', 'diode', 'effect', 'with', 'an', 'onoff', 'ratio', 'of', '104', 'our', 'results', 'offer', 'a', 'new', 'way', 'for', 'developing', 'novel', 'nanoelectronic', 'devices', 'based', 'on', '2d', 'ferroelectrics']]
|
[-0.17500293805970105, 0.16127089885268794, 0.03654455143579661, -0.07673397757961149, -0.07998386671597772, -0.19966081614544676, 0.0924660968952454, 0.4417469786776864, -0.29462625312485863, -0.30609713920013426, -0.004969477517898758, -0.25256367162852494, -0.1372444479173602, 0.23794359375292864, 0.005119225903859382, 0.04491112730913581, -0.08153533371124458, -0.15853916405915067, -0.047511154789590164, -0.1375256969432275, 0.2051188373576164, 0.027699788005710425, 0.38215367146767676, 0.10530328923826116, 0.09209797048050869, -0.0749017474674954, 0.18963140464172915, 0.025594704879759966, -0.13179891092119392, 0.10010707756033638, 0.27433452234797917, -0.19261951933187627, 0.23131006024905817, -0.5086137642469871, -0.20514788681764032, -0.04538492343623887, 0.09555313777393447, 0.15369737420517665, -0.13019373323538105, -0.2719126833554173, 0.1249810024650747, -0.135729945129152, -0.12227148581083523, -0.09289503635859096, 0.02649420346862606, 0.02905794293402213, -0.24175699351606175, 0.043555974059707514, 0.08688563741328595, 0.08183885952642483, -0.07455538522129415, -0.1598385546566243, -0.053039290048028494, 0.03353700258242667, 0.0016055669664957939, 0.09456598618743266, 0.2520353895647881, -0.13711045457883023, -0.13282642535005623, 0.3455883917324552, -0.04433440149963704, -0.060490371114420856, 0.1283961796933519, -0.1628863937528497, 0.023152700551161236, 0.17126311687448773, 0.11648800727721959, 0.12836467989453032, -0.14396813209456452, 0.09601453119414925, 0.08451173013552082, 0.20347401494119358, 0.10222744959621476, 0.08971270524313325, 0.3001117874397436, 0.285276765740671, 0.040017724999195925, 0.17276946738027138, -0.14189177943818312, 0.010062305901166317, -0.1961778073480793, -0.2078019202457214, -0.19221192122575223, 0.12925215576683263, -0.12843906242954659, -0.2370737531416855, 0.36594081220119823, 0.14603982560060264, 0.11812241906607217, -0.08414553525949736, 0.26668787507754804, 0.0628750393228544, 0.1357433411899115, -0.027616760763851413, 0.29789263765701185, 0.19075132341758644, 0.1795840302400213, -0.22861812787468208, 0.11951635372415595, -0.04739085514006297]
|
1,803.04665
|
Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence
|
We consider the problem of near-optimal arm identification in the fixed
confidence setting of the infinitely armed bandit problem when nothing is known
about the arm reservoir distribution. We (1) introduce a PAC-like framework
within which to derive and cast results; (2) derive a sample complexity lower
bound for near-optimal arm identification; (3) propose an algorithm that
identifies a nearly-optimal arm with high probability and derive an upper bound
on its sample complexity which is within a log factor of our lower bound; and
(4) discuss whether our log^2(1/delta) dependence is inescapable for
"two-phase" (select arms first, identify the best later) algorithms in the
infinite setting. This work permits the application of bandit models to a
broader class of problems where fewer assumptions hold.
|
stat.ML cs.LG
|
we consider the problem of nearoptimal arm identification in the fixed confidence setting of the infinitely armed bandit problem when nothing is known about the arm reservoir distribution we 1 introduce a paclike framework within which to derive and cast results 2 derive a sample complexity lower bound for nearoptimal arm identification 3 propose an algorithm that identifies a nearlyoptimal arm with high probability and derive an upper bound on its sample complexity which is within a log factor of our lower bound and 4 discuss whether our log21delta dependence is inescapable for twophase select arms first identify the best later algorithms in the infinite setting this work permits the application of bandit models to a broader class of problems where fewer assumptions hold
|
[['we', 'consider', 'the', 'problem', 'of', 'nearoptimal', 'arm', 'identification', 'in', 'the', 'fixed', 'confidence', 'setting', 'of', 'the', 'infinitely', 'armed', 'bandit', 'problem', 'when', 'nothing', 'is', 'known', 'about', 'the', 'arm', 'reservoir', 'distribution', 'we', '1', 'introduce', 'a', 'paclike', 'framework', 'within', 'which', 'to', 'derive', 'and', 'cast', 'results', '2', 'derive', 'a', 'sample', 'complexity', 'lower', 'bound', 'for', 'nearoptimal', 'arm', 'identification', '3', 'propose', 'an', 'algorithm', 'that', 'identifies', 'a', 'nearlyoptimal', 'arm', 'with', 'high', 'probability', 'and', 'derive', 'an', 'upper', 'bound', 'on', 'its', 'sample', 'complexity', 'which', 'is', 'within', 'a', 'log', 'factor', 'of', 'our', 'lower', 'bound', 'and', '4', 'discuss', 'whether', 'our', 'log21delta', 'dependence', 'is', 'inescapable', 'for', 'twophase', 'select', 'arms', 'first', 'identify', 'the', 'best', 'later', 'algorithms', 'in', 'the', 'infinite', 'setting', 'this', 'work', 'permits', 'the', 'application', 'of', 'bandit', 'models', 'to', 'a', 'broader', 'class', 'of', 'problems', 'where', 'fewer', 'assumptions', 'hold']]
|
[-0.09598173297269912, 0.012166579300012883, -0.08635891264793082, 0.08628492310956182, -0.09518135623571264, -0.17178632378135425, 0.1315553147254176, 0.34739634700760735, -0.2185318612810377, -0.38592631038522623, 0.10855410808743146, -0.20378540859740898, -0.13570459379402341, 0.18766050122403463, -0.08941625054452385, 0.03879751877326778, -0.003302329731341757, 0.05421086033180234, -0.04889672826097698, -0.27297473333195826, 0.28476780509866284, 0.03666671305741222, 0.2433826026084955, -0.023132290019363653, 0.11425058362761238, -0.013781071972621024, 0.015425019038718988, -0.030321501886288894, -0.17585889926996343, 0.12901358246673508, 0.26531673932857036, 0.1841830176828032, 0.34719138835999563, -0.37773887650241034, -0.1639879348336673, 0.09613188931844427, 0.1728863833456865, 0.10331118903809884, -0.04761870750932206, -0.24222367498680156, 0.09323263421585998, -0.14221164463827737, -0.1265506404576075, 0.01717205257985176, 0.016930955584298392, -0.03838147752017516, -0.31835662360402345, 0.06523319205162345, 0.08219013897488352, -0.013046146929884313, -0.06037609172759761, -0.14825002945287793, 0.1164957906432511, 0.11309420986823379, 0.0066719581802436685, 0.049671628084949786, 0.12837355472452816, -0.1476220988237192, -0.15260964737380625, 0.3391301628301439, -0.05232295049278096, -0.18148133419568604, 0.16761539301875078, -0.12349246832404713, -0.179878416738366, 0.1233079382676448, 0.22291577300514842, 0.1653082009717883, -0.13429239497495696, 0.09551979302758824, -0.13271910678137278, 0.20027238026368202, 0.04758848437942091, 0.04459563682054277, 0.08449870408474483, 0.18413551235151646, 0.18856925492987922, 0.2023571005690324, -0.07121433556789807, -0.10585774952301481, -0.3143001270220905, -0.12945374296777729, -0.12113909034027917, 0.0039034563299940256, -0.1452873450906453, -0.1476715055886431, 0.30985865787770905, 0.1628763210829958, 0.24199422135124685, 0.16272016233940165, 0.2883575711719936, 0.10834981757025311, -0.003864671267782811, 0.1553841883690692, 0.20921057056002013, 0.07810137717847208, -0.02184902278507953, -0.18184130872050147, 0.11338442968219885, 0.037657608904066636]
|
1,803.04666
|
Level curve portraits of rational inner functions
|
We analyze the behavior of rational inner functions on the unit bidisk near
singularities on the distinguished boundary $\mathbb{T}^2$ using level sets. We
show that the unimodular level sets of a rational inner function $\phi$ can be
parametrized with analytic curves and connect the behavior of these analytic
curves to that of the zero set of $\phi$. We apply these results to obtain a
detailed description of the fine numerical stability of $\phi$: for instance,
we show that $\frac{\partial \phi}{\partial z_1}$ and $\frac{\partial
\phi}{\partial z_2}$ always possess the same $L^{\mathfrak{p}}$-integrability
on $\mathbb{T}^2$, and we obtain combinatorial relations between intersection
multiplicities at singularities and vanishing orders for branches of level
sets. We also present several new methods of constructing rational inner
functions that allow us to prescribe properties of their zero sets, unimodular
level sets, and singularities.
|
math.CV math.AG math.FA
|
we analyze the behavior of rational inner functions on the unit bidisk near singularities on the distinguished boundary mathbbt2 using level sets we show that the unimodular level sets of a rational inner function phi can be parametrized with analytic curves and connect the behavior of these analytic curves to that of the zero set of phi we apply these results to obtain a detailed description of the fine numerical stability of phi for instance we show that fracpartial phipartial z_1 and fracpartial phipartial z_2 always possess the same lmathfrakpintegrability on mathbbt2 and we obtain combinatorial relations between intersection multiplicities at singularities and vanishing orders for branches of level sets we also present several new methods of constructing rational inner functions that allow us to prescribe properties of their zero sets unimodular level sets and singularities
|
[['we', 'analyze', 'the', 'behavior', 'of', 'rational', 'inner', 'functions', 'on', 'the', 'unit', 'bidisk', 'near', 'singularities', 'on', 'the', 'distinguished', 'boundary', 'mathbbt2', 'using', 'level', 'sets', 'we', 'show', 'that', 'the', 'unimodular', 'level', 'sets', 'of', 'a', 'rational', 'inner', 'function', 'phi', 'can', 'be', 'parametrized', 'with', 'analytic', 'curves', 'and', 'connect', 'the', 'behavior', 'of', 'these', 'analytic', 'curves', 'to', 'that', 'of', 'the', 'zero', 'set', 'of', 'phi', 'we', 'apply', 'these', 'results', 'to', 'obtain', 'a', 'detailed', 'description', 'of', 'the', 'fine', 'numerical', 'stability', 'of', 'phi', 'for', 'instance', 'we', 'show', 'that', 'fracpartial', 'phipartial', 'z_1', 'and', 'fracpartial', 'phipartial', 'z_2', 'always', 'possess', 'the', 'same', 'lmathfrakpintegrability', 'on', 'mathbbt2', 'and', 'we', 'obtain', 'combinatorial', 'relations', 'between', 'intersection', 'multiplicities', 'at', 'singularities', 'and', 'vanishing', 'orders', 'for', 'branches', 'of', 'level', 'sets', 'we', 'also', 'present', 'several', 'new', 'methods', 'of', 'constructing', 'rational', 'inner', 'functions', 'that', 'allow', 'us', 'to', 'prescribe', 'properties', 'of', 'their', 'zero', 'sets', 'unimodular', 'level', 'sets', 'and', 'singularities']]
|
[-0.16821196368136615, 0.05118009753663231, -0.12740724394787792, 0.08600819221594268, -0.07745522066812824, -0.10393860004497348, 0.04746104110963643, 0.3444515233514486, -0.28366133611028393, -0.20180494734258564, 0.08982090273251137, -0.3043306692848327, -0.15058341256722255, 0.22042013601727645, -0.04977569420718485, 0.041137087952207635, 0.03584060876250819, 0.05005036769952211, -0.13652524074827346, -0.2605403507059371, 0.4037389082903111, -0.048813252709805965, 0.18711994336573062, 0.08481287229806185, 0.12654566159126934, -0.02169850919119738, 0.02693878164238952, 0.021360071751944446, -0.23749988016745732, 0.12329274968209641, 0.21656928356042718, 0.10139260593180856, 0.1808026300881196, -0.42504775264748823, -0.14182749528575828, 0.1648277996038949, 0.12663017383052244, 0.0002470856187520204, 0.006105877167579752, -0.2310121864080429, 0.14131340837554524, -0.10120349355317929, -0.1957453216460568, -0.1273059446019707, -0.004776042679117786, 0.05778975332742212, -0.25552891317961945, 0.030461419195893943, 0.04575079017732706, 0.0959509717921416, -0.06896904723856737, -0.13544994720637246, -0.07141985327384814, 0.1329235975596088, 0.01732624578807089, 0.014905607107923262, 0.0836654345056525, -0.09443254847493436, -0.09650754115233819, 0.32373635281843166, -0.06915787319238816, -0.26288706396740896, 0.1820142071970083, -0.2225464606243703, -0.15624995120732044, 0.10290244096993573, 0.15341146180613174, 0.13313532617908938, -0.052409871619979474, 0.1504521848922768, -0.06573800625089832, 0.11999161052517593, 0.1380963795852882, 0.017197811625966872, 0.1870711200905067, 0.04669168346940919, 0.07911064249627223, 0.1293080503974731, -0.029873248955441845, -0.08448433030258726, -0.3916881979891547, -0.13555894805877297, -0.10120462013615503, 0.09197040157116673, -0.11701925434463192, -0.2218791248449297, 0.40540225820408926, 0.0801645414179398, 0.24337258188795574, 0.11013980742405963, 0.22064116032863104, 0.1255791011431332, 0.018693639953508628, 0.07032143153957333, 0.1488210482177911, 0.10111396462587571, -0.0032557068634088394, -0.1953941288990555, -0.01767254112702277, 0.131289622756756]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.