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.09467
|
A Switch to the Concern of User: Importance Coefficient in Utility
Distribution and Message Importance Measure
|
This paper mainly focuses on the utilization frequency in receiving end of
communication systems, which shows the inclination of the user about different
symbols. When the average number of use is limited, a specific utility
distribution is proposed on the best effort in term of fairness, which is also
the closest one to occurring probability in the relative entropy. Similar to a
switch, its parameter can be selected to make it satisfy different users'
requirements: negative parameter means the user focus on high-probability
events and positive parameter means the user is interested in small-probability
events. In fact, the utility distribution is a measure of message importance in
essence. It illustrates the meaning of message importance measure (MIM), and
extend it to the general case by selecting the parameter. Numerical results
show that this utility distribution characterizes the message importance like
MIM and its parameter determines the concern of users.
|
cs.IT math.IT math.PR math.ST stat.TH
|
this paper mainly focuses on the utilization frequency in receiving end of communication systems which shows the inclination of the user about different symbols when the average number of use is limited a specific utility distribution is proposed on the best effort in term of fairness which is also the closest one to occurring probability in the relative entropy similar to a switch its parameter can be selected to make it satisfy different users requirements negative parameter means the user focus on highprobability events and positive parameter means the user is interested in smallprobability events in fact the utility distribution is a measure of message importance in essence it illustrates the meaning of message importance measure mim and extend it to the general case by selecting the parameter numerical results show that this utility distribution characterizes the message importance like mim and its parameter determines the concern of users
|
[['this', 'paper', 'mainly', 'focuses', 'on', 'the', 'utilization', 'frequency', 'in', 'receiving', 'end', 'of', 'communication', 'systems', 'which', 'shows', 'the', 'inclination', 'of', 'the', 'user', 'about', 'different', 'symbols', 'when', 'the', 'average', 'number', 'of', 'use', 'is', 'limited', 'a', 'specific', 'utility', 'distribution', 'is', 'proposed', 'on', 'the', 'best', 'effort', 'in', 'term', 'of', 'fairness', 'which', 'is', 'also', 'the', 'closest', 'one', 'to', 'occurring', 'probability', 'in', 'the', 'relative', 'entropy', 'similar', 'to', 'a', 'switch', 'its', 'parameter', 'can', 'be', 'selected', 'to', 'make', 'it', 'satisfy', 'different', 'users', 'requirements', 'negative', 'parameter', 'means', 'the', 'user', 'focus', 'on', 'highprobability', 'events', 'and', 'positive', 'parameter', 'means', 'the', 'user', 'is', 'interested', 'in', 'smallprobability', 'events', 'in', 'fact', 'the', 'utility', 'distribution', 'is', 'a', 'measure', 'of', 'message', 'importance', 'in', 'essence', 'it', 'illustrates', 'the', 'meaning', 'of', 'message', 'importance', 'measure', 'mim', 'and', 'extend', 'it', 'to', 'the', 'general', 'case', 'by', 'selecting', 'the', 'parameter', 'numerical', 'results', 'show', 'that', 'this', 'utility', 'distribution', 'characterizes', 'the', 'message', 'importance', 'like', 'mim', 'and', 'its', 'parameter', 'determines', 'the', 'concern', 'of', 'users']]
|
[-0.1592985142335677, 0.04788491636477161, -0.054602394177384626, 0.0823040111990483, -0.1334571039457274, -0.14125945671905307, 0.11689394786907048, 0.35238957080065003, -0.26339947969821476, -0.29729831918148986, 0.06481518263103528, -0.29512714377085636, -0.14611960071195293, 0.17507475468286332, -0.12318471920732783, 0.04002043115281369, 0.033755302894860506, 0.11180868434200951, -0.01258979665956166, -0.27000806445643405, 0.34018870244808996, 0.10825158455002828, 0.32080207622903806, 0.05064420155468303, 0.07706829261084731, 0.03279574704200229, -0.05111503875158077, -0.014862263897096351, -0.12445279647055708, 0.09560393528300244, 0.27242221986568665, 0.1980419824143634, 0.33673385072236994, -0.33656669794363064, -0.19689290528654452, 0.09007220438700295, 0.10899405310949273, 0.03811864668484652, -0.03622068268100062, -0.2527228468863431, 0.09966580654125685, -0.1849132677283913, -0.09024046636780336, -0.0011206049809619884, 0.0013588606942470042, 0.05077339247831662, -0.27751873374210306, 0.025484640655793787, 0.04516602910910741, 0.026736431961391596, 0.00017829738938618427, -0.0782256701253292, -0.009873908953803698, 0.1743134172008632, 0.10032226267620771, -0.006607084345985079, 0.1402195523236722, -0.11225653989490547, -0.06225618399717164, 0.3806880813267007, -0.0004922659198859794, -0.23890273597860245, 0.15490964874500196, -0.14485252185430902, -0.10744193708211583, 0.11457139783345113, 0.18330867251892255, 0.11793593764023842, -0.136865948490668, 0.05320550342154495, -0.0022454855076018596, 0.20230320504797786, 0.06401034652555498, 0.07272560056806823, 0.17861831565106276, 0.15578769528519537, 0.09332014839227418, 0.15216609895707503, -0.06041122569652562, -0.12346595634812577, -0.2555241347321828, -0.1726222868990028, -0.23860979489919623, -0.004201688309943916, -0.10599582091775869, -0.0952885247541954, 0.41450604695151716, 0.2018297648186453, 0.2009654492046059, 0.06190852373338386, 0.31815110469524494, 0.12419199419751663, 0.03689398948609479, 0.06227776330064407, 0.21988767613000518, 0.07432023576154505, 0.1041868628040206, -0.2107840351754137, 0.17400840984113614, 0.0022997821606195613]
|
1,803.09468
|
Clipping free attacks against artificial neural networks
|
During the last years, a remarkable breakthrough has been made in AI domain
thanks to artificial deep neural networks that achieved a great success in many
machine learning tasks in computer vision, natural language processing, speech
recognition, malware detection and so on. However, they are highly vulnerable
to easily crafted adversarial examples. Many investigations have pointed out
this fact and different approaches have been proposed to generate attacks while
adding a limited perturbation to the original data. The most robust known
method so far is the so called C&W attack [1]. Nonetheless, a countermeasure
known as feature squeezing coupled with ensemble defense showed that most of
these attacks can be destroyed [6]. In this paper, we present a new method we
call Centered Initial Attack (CIA) whose advantage is twofold : first, it
insures by construction the maximum perturbation to be smaller than a threshold
fixed beforehand, without the clipping process that degrades the quality of
attacks. Second, it is robust against recently introduced defenses such as
feature squeezing, JPEG encoding and even against a voting ensemble of
defenses. While its application is not limited to images, we illustrate this
using five of the current best classifiers on ImageNet dataset among which two
are adversarialy retrained on purpose to be robust against attacks. With a
fixed maximum perturbation of only 1.5% on any pixel, around 80% of attacks
(targeted) fool the voting ensemble defense and nearly 100% when the
perturbation is only 6%. While this shows how it is difficult to defend against
CIA attacks, the last section of the paper gives some guidelines to limit their
impact.
|
cs.LG cs.CR stat.ML
|
during the last years a remarkable breakthrough has been made in ai domain thanks to artificial deep neural networks that achieved a great success in many machine learning tasks in computer vision natural language processing speech recognition malware detection and so on however they are highly vulnerable to easily crafted adversarial examples many investigations have pointed out this fact and different approaches have been proposed to generate attacks while adding a limited perturbation to the original data the most robust known method so far is the so called cw attack 1 nonetheless a countermeasure known as feature squeezing coupled with ensemble defense showed that most of these attacks can be destroyed 6 in this paper we present a new method we call centered initial attack cia whose advantage is twofold first it insures by construction the maximum perturbation to be smaller than a threshold fixed beforehand without the clipping process that degrades the quality of attacks second it is robust against recently introduced defenses such as feature squeezing jpeg encoding and even against a voting ensemble of defenses while its application is not limited to images we illustrate this using five of the current best classifiers on imagenet dataset among which two are adversarialy retrained on purpose to be robust against attacks with a fixed maximum perturbation of only 15 on any pixel around 80 of attacks targeted fool the voting ensemble defense and nearly 100 when the perturbation is only 6 while this shows how it is difficult to defend against cia attacks the last section of the paper gives some guidelines to limit their impact
|
[['during', 'the', 'last', 'years', 'a', 'remarkable', 'breakthrough', 'has', 'been', 'made', 'in', 'ai', 'domain', 'thanks', 'to', 'artificial', 'deep', 'neural', 'networks', 'that', 'achieved', 'a', 'great', 'success', 'in', 'many', 'machine', 'learning', 'tasks', 'in', 'computer', 'vision', 'natural', 'language', 'processing', 'speech', 'recognition', 'malware', 'detection', 'and', 'so', 'on', 'however', 'they', 'are', 'highly', 'vulnerable', 'to', 'easily', 'crafted', 'adversarial', 'examples', 'many', 'investigations', 'have', 'pointed', 'out', 'this', 'fact', 'and', 'different', 'approaches', 'have', 'been', 'proposed', 'to', 'generate', 'attacks', 'while', 'adding', 'a', 'limited', 'perturbation', 'to', 'the', 'original', 'data', 'the', 'most', 'robust', 'known', 'method', 'so', 'far', 'is', 'the', 'so', 'called', 'cw', 'attack', '1', 'nonetheless', 'a', 'countermeasure', 'known', 'as', 'feature', 'squeezing', 'coupled', 'with', 'ensemble', 'defense', 'showed', 'that', 'most', 'of', 'these', 'attacks', 'can', 'be', 'destroyed', '6', 'in', 'this', 'paper', 'we', 'present', 'a', 'new', 'method', 'we', 'call', 'centered', 'initial', 'attack', 'cia', 'whose', 'advantage', 'is', 'twofold', 'first', 'it', 'insures', 'by', 'construction', 'the', 'maximum', 'perturbation', 'to', 'be', 'smaller', 'than', 'a', 'threshold', 'fixed', 'beforehand', 'without', 'the', 'clipping', 'process', 'that', 'degrades', 'the', 'quality', 'of', 'attacks', 'second', 'it', 'is', 'robust', 'against', 'recently', 'introduced', 'defenses', 'such', 'as', 'feature', 'squeezing', 'jpeg', 'encoding', 'and', 'even', 'against', 'a', 'voting', 'ensemble', 'of', 'defenses', 'while', 'its', 'application', 'is', 'not', 'limited', 'to', 'images', 'we', 'illustrate', 'this', 'using', 'five', 'of', 'the', 'current', 'best', 'classifiers', 'on', 'imagenet', 'dataset', 'among', 'which', 'two', 'are', 'adversarialy', 'retrained', 'on', 'purpose', 'to', 'be', 'robust', 'against', 'attacks', 'with', 'a', 'fixed', 'maximum', 'perturbation', 'of', 'only', '15', 'on', 'any', 'pixel', 'around', '80', 'of', 'attacks', 'targeted', 'fool', 'the', 'voting', 'ensemble', 'defense', 'and', 'nearly', '100', 'when', 'the', 'perturbation', 'is', 'only', '6', 'while', 'this', 'shows', 'how', 'it', 'is', 'difficult', 'to', 'defend', 'against', 'cia', 'attacks', 'the', 'last', 'section', 'of', 'the', 'paper', 'gives', 'some', 'guidelines', 'to', 'limit', 'their', 'impact']]
|
[-0.08454373824491981, 0.03366508844651674, -0.06788486746381409, 0.06128965723843764, -0.08323284656796745, -0.23257826903967985, 0.05461474376095151, 0.40678680192721184, -0.2281719934662692, -0.31931768139212435, 0.1409910517658065, -0.2939333966653094, -0.204757515983516, 0.21675440453385053, -0.15965032577339588, 0.10083464291222442, 0.07435276631626504, 0.04737842320271985, -0.008366473023061942, -0.3549949337449975, 0.2990742228694148, 0.0699143713939527, 0.31929763771429015, 0.024734680092704475, 0.08194502829302705, -0.04196659657890607, -0.0043735083575969684, -0.00035143853952982146, -0.029797226212859896, 0.09419289689358813, 0.3042838270084484, 0.19112583102231243, 0.3519817750753933, -0.38558830987509773, -0.21770238983687767, 0.11772666444312221, 0.14096550888091297, 0.18523715229580684, -0.04642695033287322, -0.32573695840223, 0.14974314405467304, -0.21721350474990345, -0.04671259748021183, -0.1450300602442795, 0.02357500527777072, -0.023603909434724415, -0.21210076703639225, -0.0395755688721118, 0.11428894055657145, 0.0766125530673233, 0.014092951767493207, -0.10582954745785214, 0.004737420974796484, 0.09879504970270052, 0.06536075193774134, 0.04250109642463967, 0.17435812201925127, -0.14223516391195476, -0.11697394078811, 0.35780382696784246, -0.045075685389200315, -0.17127195795336247, 0.1870854694651846, -0.029325531137392932, -0.16797774341097452, 0.13516970212340243, 0.1738719359119913, 0.12403039356318996, -0.1510873716301044, 0.0006842500306105704, -0.0023367569118360044, 0.20800795333978153, 0.10958573696180772, 0.007670644497414841, 0.16191730122484574, 0.20475796434334198, 0.09024630104063806, 0.13615058808932362, -0.11537920555127855, -0.06474740001113903, -0.20094766216772728, -0.06613998857768397, -0.21163613004942558, 0.039751277499120156, -0.0332985126876878, -0.13408106477244905, 0.3902915188372205, 0.24519835272978963, 0.18866694985654317, 0.0572782077155202, 0.36810098815782877, 0.020198168981421207, 0.13745594622851331, 0.0939377881411491, 0.28241712070620334, 0.044091110307674264, 0.0764772166798672, -0.11729241493151478, 0.12541723803746604, -0.01818162906578833]
|
1,803.09469
|
The Effects of Interfacial Recombination and Injection Barrier on the
Electrical Characteristics of Perovskite Solar Cells
|
Charge carrier recombination in the perovskite solar cells (PSCs) has a deep
influence on the electrical performance, such as open circuit voltage, short
circuit current, fill factor and ultimately power conversion efficiency. The
impacts of injection barrier, recombination channels, doping properties of
carrier transport layers and light intensity on the performance of PSCs are
theoretically investigated by drift-diffusion model in this work. The results
indicate that due to the injection barrier at the interfaces of perovskite and
carrier transport layer, the accumulated carriers modify the electric field
distribution throughout the PSCs. Thus, a zero electric field is generated at a
specific applied voltage, with greatly increases the interfacial recombination,
resulting in a local kink of current density-voltage (J-V) curve. This work
provides an effective strategy to improve the efficiency of PSCs by pertinently
reducing both the injection barrier and interfacial recombination.
|
cond-mat.mes-hall cond-mat.mtrl-sci physics.app-ph physics.optics
|
charge carrier recombination in the perovskite solar cells pscs has a deep influence on the electrical performance such as open circuit voltage short circuit current fill factor and ultimately power conversion efficiency the impacts of injection barrier recombination channels doping properties of carrier transport layers and light intensity on the performance of pscs are theoretically investigated by driftdiffusion model in this work the results indicate that due to the injection barrier at the interfaces of perovskite and carrier transport layer the accumulated carriers modify the electric field distribution throughout the pscs thus a zero electric field is generated at a specific applied voltage with greatly increases the interfacial recombination resulting in a local kink of current densityvoltage jv curve this work provides an effective strategy to improve the efficiency of pscs by pertinently reducing both the injection barrier and interfacial recombination
|
[['charge', 'carrier', 'recombination', 'in', 'the', 'perovskite', 'solar', 'cells', 'pscs', 'has', 'a', 'deep', 'influence', 'on', 'the', 'electrical', 'performance', 'such', 'as', 'open', 'circuit', 'voltage', 'short', 'circuit', 'current', 'fill', 'factor', 'and', 'ultimately', 'power', 'conversion', 'efficiency', 'the', 'impacts', 'of', 'injection', 'barrier', 'recombination', 'channels', 'doping', 'properties', 'of', 'carrier', 'transport', 'layers', 'and', 'light', 'intensity', 'on', 'the', 'performance', 'of', 'pscs', 'are', 'theoretically', 'investigated', 'by', 'driftdiffusion', 'model', 'in', 'this', 'work', 'the', 'results', 'indicate', 'that', 'due', 'to', 'the', 'injection', 'barrier', 'at', 'the', 'interfaces', 'of', 'perovskite', 'and', 'carrier', 'transport', 'layer', 'the', 'accumulated', 'carriers', 'modify', 'the', 'electric', 'field', 'distribution', 'throughout', 'the', 'pscs', 'thus', 'a', 'zero', 'electric', 'field', 'is', 'generated', 'at', 'a', 'specific', 'applied', 'voltage', 'with', 'greatly', 'increases', 'the', 'interfacial', 'recombination', 'resulting', 'in', 'a', 'local', 'kink', 'of', 'current', 'densityvoltage', 'jv', 'curve', 'this', 'work', 'provides', 'an', 'effective', 'strategy', 'to', 'improve', 'the', 'efficiency', 'of', 'pscs', 'by', 'pertinently', 'reducing', 'both', 'the', 'injection', 'barrier', 'and', 'interfacial', 'recombination']]
|
[-0.1437326498983547, 0.1489046780296134, 0.01353854699066926, -0.0033223824319594825, 0.019399780357349003, -0.13267595052049522, 0.12987484707966024, 0.39528727637445354, -0.29187395729468013, -0.31824942989975, 0.012718010671496232, -0.25701599200883657, -0.10427651728060863, 0.22053907162192812, -0.03915275453345467, 0.012000932325179695, 0.01502875213392396, -0.08361192873236559, -0.014247684805581333, -0.21285989383815174, 0.23867707704325994, 0.12486490818439877, 0.3945918990074531, 0.175774179848162, 0.06679021213401823, -0.04902503176770629, 0.0554439522134444, 0.004086837492856785, -0.12225460058520093, 0.09578570276036436, 0.20734934642224023, -0.017381202967850663, 0.19882277722292124, -0.4982395207918916, -0.2821490177686544, -0.018813926359995247, 0.16370175225026112, 0.1068772639986788, -0.13987164936153917, -0.18907927137845798, 0.06325764215719748, -0.15992381024927377, -0.07590036706483745, 0.012903368450595554, 0.004969537355573782, 0.07382144539861392, -0.2511289178539094, 0.06453974676836144, 0.05840646820836403, 0.03864367232750441, -0.09432657042531468, -0.13448966106941515, -0.06293606985994477, 0.10933140064928192, 0.042868429508410286, 0.03824393268912397, 0.2766330923673743, -0.17352105784915217, -0.09331112219919022, 0.27968433290614303, -0.06930553348378297, -0.13846523990583812, 0.13148432166203328, -0.15837128914674706, 0.030835900758516954, 0.19237416860125695, 0.15486613739982036, 0.0783704078264191, -0.1626578215773858, 0.09081615340988422, 0.06170899706978536, 0.13933470568715442, 0.07491628195205373, 0.05792659418393217, 0.24665284289562323, 0.24172178153377952, 0.06894879625013746, 0.10288193415857005, -0.12820328771077255, -0.05157250273767991, -0.1959229366365054, -0.1846696980601401, -0.1549397023635791, 0.08480940666049719, -0.05641064317261219, -0.17947620741613474, 0.493496826116709, 0.18338005270832466, 0.15457828819474323, -0.031493619312235016, 0.3237364677289593, 0.16599558618708996, 0.08145645642587056, 0.04845114919218294, 0.24408284181907297, 0.14778715660069006, 0.16332298710427068, -0.3529084623619544, 0.13206862829665236, -0.020751475420919187]
|
1,803.0947
|
Real Time Surveillance for Low Resolution and Limited-Data Scenarios: An
Image Set Classification Approach
|
This paper proposes a novel image set classification technique based on the
concept of linear regression. Unlike most other approaches, the proposed
technique does not involve any training or feature extraction. The gallery
image sets are represented as subspaces in a high dimensional space. Class
specific gallery subspaces are used to estimate regression models for each
image of the test image set. Images of the test set are then projected on the
gallery subspaces. Residuals, calculated using the Euclidean distance between
the original and the projected test images, are used as the distance metric.
Three different strategies are devised to decide on the final class of the test
image set. We performed extensive evaluations of the proposed technique under
the challenges of low resolution, noise and less gallery data for the tasks of
surveillance, video-based face recognition and object recognition. Experiments
show that the proposed technique achieves a better classification accuracy and
a faster execution time compared to existing techniques especially under the
challenging conditions of low resolution and small gallery and test data.
|
cs.CV
|
this paper proposes a novel image set classification technique based on the concept of linear regression unlike most other approaches the proposed technique does not involve any training or feature extraction the gallery image sets are represented as subspaces in a high dimensional space class specific gallery subspaces are used to estimate regression models for each image of the test image set images of the test set are then projected on the gallery subspaces residuals calculated using the euclidean distance between the original and the projected test images are used as the distance metric three different strategies are devised to decide on the final class of the test image set we performed extensive evaluations of the proposed technique under the challenges of low resolution noise and less gallery data for the tasks of surveillance videobased face recognition and object recognition experiments show that the proposed technique achieves a better classification accuracy and a faster execution time compared to existing techniques especially under the challenging conditions of low resolution and small gallery and test data
|
[['this', 'paper', 'proposes', 'a', 'novel', 'image', 'set', 'classification', 'technique', 'based', 'on', 'the', 'concept', 'of', 'linear', 'regression', 'unlike', 'most', 'other', 'approaches', 'the', 'proposed', 'technique', 'does', 'not', 'involve', 'any', 'training', 'or', 'feature', 'extraction', 'the', 'gallery', 'image', 'sets', 'are', 'represented', 'as', 'subspaces', 'in', 'a', 'high', 'dimensional', 'space', 'class', 'specific', 'gallery', 'subspaces', 'are', 'used', 'to', 'estimate', 'regression', 'models', 'for', 'each', 'image', 'of', 'the', 'test', 'image', 'set', 'images', 'of', 'the', 'test', 'set', 'are', 'then', 'projected', 'on', 'the', 'gallery', 'subspaces', 'residuals', 'calculated', 'using', 'the', 'euclidean', 'distance', 'between', 'the', 'original', 'and', 'the', 'projected', 'test', 'images', 'are', 'used', 'as', 'the', 'distance', 'metric', 'three', 'different', 'strategies', 'are', 'devised', 'to', 'decide', 'on', 'the', 'final', 'class', 'of', 'the', 'test', 'image', 'set', 'we', 'performed', 'extensive', 'evaluations', 'of', 'the', 'proposed', 'technique', 'under', 'the', 'challenges', 'of', 'low', 'resolution', 'noise', 'and', 'less', 'gallery', 'data', 'for', 'the', 'tasks', 'of', 'surveillance', 'videobased', 'face', 'recognition', 'and', 'object', 'recognition', 'experiments', 'show', 'that', 'the', 'proposed', 'technique', 'achieves', 'a', 'better', 'classification', 'accuracy', 'and', 'a', 'faster', 'execution', 'time', 'compared', 'to', 'existing', 'techniques', 'especially', 'under', 'the', 'challenging', 'conditions', 'of', 'low', 'resolution', 'and', 'small', 'gallery', 'and', 'test', 'data']]
|
[-0.05323867644611532, -0.03455580056018742, -0.05942312189131633, 0.03291316699482843, -0.07632731206597354, -0.17147085671152534, 0.002924116858918134, 0.41058096779917164, -0.23235269505115783, -0.32724950078542975, 0.13770116637822177, -0.2615660915697186, -0.11830073896957423, 0.23891217464811287, -0.1371054846402686, 0.15766208461852443, 0.15359604769739613, 0.05858660427968542, -0.08283808132788788, -0.3045882966085712, 0.30447814927683586, 0.024254326612271112, 0.3812236866228625, -0.024364945993239552, 0.15779049048098553, -0.02065388314444679, -0.060841830947768245, 0.026600211423948198, -0.07145552826001096, 0.16063652872964312, 0.2885309982874965, 0.2255168019970558, 0.30272427169424104, -0.3714981756397876, -0.16902452490651101, 0.10759161689168849, 0.11451935055585385, 0.08816095281006961, -0.022154323389384382, -0.3358588432250866, 0.09682887468765351, -0.10182286832139067, 0.002219041094723179, -0.12197102119827685, -0.03198564942021608, -0.0337849307046593, -0.2943751442583342, 0.04887997141862609, 0.06331994120585571, 0.08000220816941055, -0.07972758091938008, -0.13379828059703283, 0.029100568456596684, 0.14433187245653578, 0.02047706165768463, 0.05457475103555654, 0.14066584011133032, -0.15763686925639303, -0.1358852975201611, 0.43444582470960313, -0.06602130497366875, -0.25187902092591097, 0.2652308639987297, -0.0816085118942241, -0.09512261826486124, 0.11016752263638137, 0.24824918911192867, 0.14668031164776835, -0.13749342932012573, 0.006728163185387571, -0.054099552135315095, 0.17909924875832453, 0.11227770474734021, 0.017171109824484193, 0.16425431938039076, 0.21226332610474374, 0.05480403978720136, 0.14855686992697215, -0.20915404234975363, 0.01044133015983235, -0.24882262369521477, -0.1002745202892385, -0.2409558876513921, -0.07781275310518485, -0.11794406452283783, -0.1555020771706584, 0.41038766090929424, 0.20003943244537578, 0.21521601311584143, 0.07485661931849759, 0.3442777878679763, 0.02923275727474923, 0.09430105864015494, 0.04803721515204886, 0.1772907513331611, 0.013685885784697944, 0.04985958653610553, -0.20114547665827726, 0.02876986216100725, 0.08995186700753269]
|
1,803.09471
|
Low-lying states in even Gd isotopes studied with five-dimensional
collective Hamiltonian based on covariant density functional theory
|
Five-dimensional collective Hamiltonian based on the covariant density
functional theory has been applied to study the the low-lying states of
even-even $^{148-162}$Gd isotopes. The shape evolution from $^{148}$Gd to
$^{162}$Gd is presented. The experimental energy spectra and intraband $B(E2)$
transition probabilities for the $^{148-162}$Gd isotopes are reproduced by the
present calculations. The relative $B(E2)$ ratios in present calculations are
also compared with the available interacting boson model results and
experimental data. It is found that the occupations of neutron $1i_{13/2}$
orbital result in the well-deformed prolate shape, and are essential for Gd
isotopes.
|
nucl-th
|
fivedimensional collective hamiltonian based on the covariant density functional theory has been applied to study the the lowlying states of eveneven 148162gd isotopes the shape evolution from 148gd to 162gd is presented the experimental energy spectra and intraband be2 transition probabilities for the 148162gd isotopes are reproduced by the present calculations the relative be2 ratios in present calculations are also compared with the available interacting boson model results and experimental data it is found that the occupations of neutron 1i_132 orbital result in the welldeformed prolate shape and are essential for gd isotopes
|
[['fivedimensional', 'collective', 'hamiltonian', 'based', 'on', 'the', 'covariant', 'density', 'functional', 'theory', 'has', 'been', 'applied', 'to', 'study', 'the', 'the', 'lowlying', 'states', 'of', 'eveneven', '148162gd', 'isotopes', 'the', 'shape', 'evolution', 'from', '148gd', 'to', '162gd', 'is', 'presented', 'the', 'experimental', 'energy', 'spectra', 'and', 'intraband', 'be2', 'transition', 'probabilities', 'for', 'the', '148162gd', 'isotopes', 'are', 'reproduced', 'by', 'the', 'present', 'calculations', 'the', 'relative', 'be2', 'ratios', 'in', 'present', 'calculations', 'are', 'also', 'compared', 'with', 'the', 'available', 'interacting', 'boson', 'model', 'results', 'and', 'experimental', 'data', 'it', 'is', 'found', 'that', 'the', 'occupations', 'of', 'neutron', '1i_132', 'orbital', 'result', 'in', 'the', 'welldeformed', 'prolate', 'shape', 'and', 'are', 'essential', 'for', 'gd', 'isotopes']]
|
[-0.03854198754351172, 0.17849524710327386, -0.05838292749702102, 0.11534023417625576, 0.04993686570475499, -0.09870442333113816, 0.027473856010732964, 0.39209698498662976, -0.12950767476836011, -0.289877253688044, -0.05837051924059374, -0.356924422395726, -0.07832798404722578, 0.13817935256132235, 0.05549143198877573, 0.07139739437649648, 0.09086134178150031, 0.05558950876196225, -0.10303216736194575, -0.14865731220019773, 0.28359511556207306, 0.10113507804869894, 0.2804673827460243, 0.04237638153135777, -0.02962212107118426, -0.017773580455428196, 0.047286115002094044, -0.05980258112152417, -0.1548093886118699, 0.11051654573206583, 0.28500490995744865, 0.05340615651932441, 0.11413037157100107, -0.425973496834437, -0.17096976853208617, 0.031067754641278752, 0.16225097209939526, 0.17164797171329457, -0.07213678810771348, -0.3344640565622184, 0.031382049340754746, -0.21695027884302867, -0.13889714506868686, -0.18581480536765108, 0.05839119556670388, 0.08009952725583894, -0.23274539019912482, 0.10353987818396287, -0.031853140768604744, 0.07849689233747388, -0.18702068604632385, -0.24226325111360186, -0.0998173541492886, 0.049337585122622034, 0.11273179522379198, -0.00722376737329695, 0.1542908104447027, -0.03564687329861853, -0.09561704898046122, 0.42373254040463104, -0.015614741877652705, -0.12077445381631453, 0.11171067981308119, -0.1610133320830452, -0.14011254178153143, 0.18495380815325513, 0.09183009740793042, 0.14075215507505667, -0.12070964329565564, 0.11577644842586274, -0.005477973909324242, 0.16002954742612524, -0.001646990325470041, 0.03390961416686575, 0.16851282921723193, 0.15243621975080007, -0.05835749685971273, 0.05595715354558908, -0.15726812973152846, -0.13812522227979368, -0.2838480367997868, -0.08349120983233055, -0.1833806607975728, 0.00956144503886915, -0.027851302376721933, -0.10819563026533514, 0.39257735909066266, 0.06360195309130681, 0.1853463139708361, -0.007084885490540829, 0.23920360317764183, 0.13510734465801053, 0.04351644952160617, 0.01534540120822688, 0.339437625464052, 0.2214319672357912, 0.06098561923200679, -0.30760744191033557, 0.06970323226932022, 0.054398217303160995]
|
1,803.09472
|
Analytic estimation of transition between instantaneous eigenstates of
quantum two-level system
|
Transition amplitudes between instantaneous eigenstates of quantum two-level
system are evaluated analytically on the basis of a new parametrization of its
evolution operator, which has recently been proposed to construct exact
solutions. In particular, they are estimated when the Hamiltonian varies
infinitesimally slowly. The results, not only confirm the adiabatic theorem in
the adiabatic limit, but also bring us with an analytic estimation of the
adiabatic approximation. The condition under which no transition between
different instantaneous eigenstates is allowed is also clarified.
|
quant-ph
|
transition amplitudes between instantaneous eigenstates of quantum twolevel system are evaluated analytically on the basis of a new parametrization of its evolution operator which has recently been proposed to construct exact solutions in particular they are estimated when the hamiltonian varies infinitesimally slowly the results not only confirm the adiabatic theorem in the adiabatic limit but also bring us with an analytic estimation of the adiabatic approximation the condition under which no transition between different instantaneous eigenstates is allowed is also clarified
|
[['transition', 'amplitudes', 'between', 'instantaneous', 'eigenstates', 'of', 'quantum', 'twolevel', 'system', 'are', 'evaluated', 'analytically', 'on', 'the', 'basis', 'of', 'a', 'new', 'parametrization', 'of', 'its', 'evolution', 'operator', 'which', 'has', 'recently', 'been', 'proposed', 'to', 'construct', 'exact', 'solutions', 'in', 'particular', 'they', 'are', 'estimated', 'when', 'the', 'hamiltonian', 'varies', 'infinitesimally', 'slowly', 'the', 'results', 'not', 'only', 'confirm', 'the', 'adiabatic', 'theorem', 'in', 'the', 'adiabatic', 'limit', 'but', 'also', 'bring', 'us', 'with', 'an', 'analytic', 'estimation', 'of', 'the', 'adiabatic', 'approximation', 'the', 'condition', 'under', 'which', 'no', 'transition', 'between', 'different', 'instantaneous', 'eigenstates', 'is', 'allowed', 'is', 'also', 'clarified']]
|
[-0.1371851269377214, 0.15832267338910463, -0.13496056864628705, 0.0704676408232644, -0.025665651404912154, -0.16368134738877416, 0.0612618622182664, 0.3696298971772194, -0.2125676421266867, -0.2627747848788958, 0.07776313438364191, -0.22220770542640467, -0.1399405994566112, 0.18836610949393817, -0.007012153436179932, 0.07460788597009235, 0.07406748514395298, 0.07290158562487127, -0.14856556595853962, -0.20352739727170002, 0.296572837768486, 0.04315012708879871, 0.2910874185703195, 0.0616262943743694, 0.09217717743864874, -0.03009145378941534, 0.022129108550072444, -0.04352695360870623, -0.15088169759412, 0.05368551302405938, 0.21733367129615166, 0.06986099536383025, 0.22899580824688623, -0.42685739282609486, -0.1801100131124258, 0.11525900914651774, 0.17294321865661116, 0.13365535254919583, 0.011471756863146566, -0.2948261299113766, 0.03640140811117684, -0.18538299536264344, -0.14749095913749644, -0.11538370921299225, 0.061391205197518194, 0.0005716251226414632, -0.26536206339724455, 0.08123030599203847, 0.06313232616407842, 0.01278746962581375, -0.08151273436492264, -0.04159975620185411, -0.031912071107909445, 0.13005252896201877, 0.06332764904192761, 0.0011264171121960005, 0.10164071102740198, -0.06545813397572535, -0.06345909202425945, 0.34724037300102506, -0.06140123161191984, -0.23506398732978395, 0.1670833134274112, -0.14343703315002707, -0.101415662503824, 0.13329043597687126, 0.09046505570479828, 0.10565052468261522, -0.16672973812748706, 0.15082909734692515, -0.024126570546863284, 0.14743193659204534, 0.07545489203411995, 0.03693591098431725, 0.15906042917972293, 0.0626634533982724, 0.05864948364792437, 0.13125689401825116, -0.031448347440057596, -0.20419385737353346, -0.2897943176965161, -0.10176143452820437, -0.22004697331022927, 0.05979474993133719, -0.0957126703181463, -0.18989354457206478, 0.3924524878583303, 0.13889892248822966, 0.17273027470857813, 0.02287777761145063, 0.27525839601393515, 0.24652544550438663, 0.018997026579000237, 0.09738056183361062, 0.32635128707057093, 0.1689527190415325, 0.044563954179288774, -0.2420655927541325, 0.053993489263897264, 0.06639163535394955]
|
1,803.09473
|
code2vec: Learning Distributed Representations of Code
|
We present a neural model for representing snippets of code as continuous
distributed vectors ("code embeddings"). The main idea is to represent a code
snippet as a single fixed-length $\textit{code vector}$, which can be used to
predict semantic properties of the snippet. This is performed by decomposing
code to a collection of paths in its abstract syntax tree, and learning the
atomic representation of each path $\textit{simultaneously}$ with learning how
to aggregate a set of them. We demonstrate the effectiveness of our approach by
using it to predict a method's name from the vector representation of its body.
We evaluate our approach by training a model on a dataset of 14M methods. We
show that code vectors trained on this dataset can predict method names from
files that were completely unobserved during training. Furthermore, we show
that our model learns useful method name vectors that capture semantic
similarities, combinations, and analogies. Comparing previous techniques over
the same data set, our approach obtains a relative improvement of over 75%,
being the first to successfully predict method names based on a large,
cross-project, corpus. Our trained model, visualizations and vector
similarities are available as an interactive online demo at
http://code2vec.org. The code, data, and trained models are available at
https://github.com/tech-srl/code2vec.
|
cs.LG cs.AI cs.PL stat.ML
|
we present a neural model for representing snippets of code as continuous distributed vectors code embeddings the main idea is to represent a code snippet as a single fixedlength textitcode vector which can be used to predict semantic properties of the snippet this is performed by decomposing code to a collection of paths in its abstract syntax tree and learning the atomic representation of each path textitsimultaneously with learning how to aggregate a set of them we demonstrate the effectiveness of our approach by using it to predict a methods name from the vector representation of its body we evaluate our approach by training a model on a dataset of 14m methods we show that code vectors trained on this dataset can predict method names from files that were completely unobserved during training furthermore we show that our model learns useful method name vectors that capture semantic similarities combinations and analogies comparing previous techniques over the same data set our approach obtains a relative improvement of over 75 being the first to successfully predict method names based on a large crossproject corpus our trained model visualizations and vector similarities are available as an interactive online demo at httpcode2vecorg the code data and trained models are available at httpsgithubcomtechsrlcode2vec
|
[['we', 'present', 'a', 'neural', 'model', 'for', 'representing', 'snippets', 'of', 'code', 'as', 'continuous', 'distributed', 'vectors', 'code', 'embeddings', 'the', 'main', 'idea', 'is', 'to', 'represent', 'a', 'code', 'snippet', 'as', 'a', 'single', 'fixedlength', 'textitcode', 'vector', 'which', 'can', 'be', 'used', 'to', 'predict', 'semantic', 'properties', 'of', 'the', 'snippet', 'this', 'is', 'performed', 'by', 'decomposing', 'code', 'to', 'a', 'collection', 'of', 'paths', 'in', 'its', 'abstract', 'syntax', 'tree', 'and', 'learning', 'the', 'atomic', 'representation', 'of', 'each', 'path', 'textitsimultaneously', 'with', 'learning', 'how', 'to', 'aggregate', 'a', 'set', 'of', 'them', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approach', 'by', 'using', 'it', 'to', 'predict', 'a', 'methods', 'name', 'from', 'the', 'vector', 'representation', 'of', 'its', 'body', 'we', 'evaluate', 'our', 'approach', 'by', 'training', 'a', 'model', 'on', 'a', 'dataset', 'of', '14m', 'methods', 'we', 'show', 'that', 'code', 'vectors', 'trained', 'on', 'this', 'dataset', 'can', 'predict', 'method', 'names', 'from', 'files', 'that', 'were', 'completely', 'unobserved', 'during', 'training', 'furthermore', 'we', 'show', 'that', 'our', 'model', 'learns', 'useful', 'method', 'name', 'vectors', 'that', 'capture', 'semantic', 'similarities', 'combinations', 'and', 'analogies', 'comparing', 'previous', 'techniques', 'over', 'the', 'same', 'data', 'set', 'our', 'approach', 'obtains', 'a', 'relative', 'improvement', 'of', 'over', '75', 'being', 'the', 'first', 'to', 'successfully', 'predict', 'method', 'names', 'based', 'on', 'a', 'large', 'crossproject', 'corpus', 'our', 'trained', 'model', 'visualizations', 'and', 'vector', 'similarities', 'are', 'available', 'as', 'an', 'interactive', 'online', 'demo', 'at', 'httpcode2vecorg', 'the', 'code', 'data', 'and', 'trained', 'models', 'are', 'available', 'at', 'httpsgithubcomtechsrlcode2vec']]
|
[-0.017369034501172387, 0.013337573712650411, -0.10004566827544815, 0.07463436589454238, -0.10569686395143277, -0.14994059580245997, 0.07050487655441015, 0.4428695213700672, -0.29466832049408004, -0.3369984087597543, 0.053656820548603365, -0.2966382228498103, -0.15352400191901341, 0.20421762584970848, -0.06745878451851929, 0.05487908970183711, 0.1588953287098828, 0.09146179458198761, -0.05630780390273888, -0.2978481013300711, 0.3219976463271839, 0.03922830125570152, 0.30781428491271745, -0.0118226909521714, 0.14973316065293457, -0.03164892787231331, -0.0621749080735365, -0.005064179693592839, -0.049642792363335755, 0.19036167016867728, 0.28666734662397836, 0.24858339874806262, 0.2847186022243707, -0.36605012057195374, -0.21781163477763824, 0.03467072679738071, 0.11430093615419837, 0.1593170665420402, -0.009450683360625493, -0.33327334900431843, 0.12530845097996277, -0.19633439667432487, 0.002514763696806379, -0.13704011598147015, -0.025885047317591035, 0.010007433581970704, -0.2746053600380902, -0.012379546351934268, 0.05569544272798648, 0.07566518236394719, -0.08628461033996485, -0.1065314991074135, -0.03155002552078973, 0.16656490474898658, 0.006928186370873625, 0.08673311313908114, 0.10887162765099224, -0.10251460135012308, -0.15488981014994668, 0.37508161225835385, -0.09190517523805204, -0.2174460539646284, 0.1794200006305032, -0.019483368461770775, -0.11547496391107663, 0.09705942750397563, 0.2613870953887846, 0.1285212041089058, -0.1672624451338847, 0.01234163811715157, -0.10540691598598818, 0.21912876548510027, 0.026264629751733205, -0.048701280669209736, 0.19707277794504902, 0.21174537036703556, -0.059049106528530425, 0.1652799656075534, -0.10354056215217197, -0.04687160281102779, -0.26942162723642166, -0.12287326083061946, -0.2061905695839776, -0.04463730155133181, -0.0976908739757367, -0.1523788708264406, 0.4161945144754373, 0.24954227965044817, 0.2165312785716011, 0.11421264231078398, 0.3197056513225425, -0.015001394027404406, 0.140729685016745, 0.11809724037879084, 0.11006528931925326, 0.011603598690872054, 0.09502184800735847, -0.14278166245350396, 0.09891400454131868, 0.08158368821418618]
|
1,803.09474
|
Semantic See-Through Rendering on Light Fields
|
We present a novel semantic light field (LF) refocusing technique that can
achieve unprecedented see-through quality. Different from prior art, our
semantic see-through (SST) differentiates rays in their semantic meaning and
depth. Specifically, we combine deep learning and stereo matching to provide
each ray a semantic label. We then design tailored weighting schemes for
blending the rays. Although simple, our solution can effectively remove
foreground residues when focusing on the background. At the same time, SST
maintains smooth transitions in varying focal depths. Comprehensive experiments
on synthetic and new real indoor and outdoor datasets demonstrate the
effectiveness and usefulness of our technique.
|
cs.CV
|
we present a novel semantic light field lf refocusing technique that can achieve unprecedented seethrough quality different from prior art our semantic seethrough sst differentiates rays in their semantic meaning and depth specifically we combine deep learning and stereo matching to provide each ray a semantic label we then design tailored weighting schemes for blending the rays although simple our solution can effectively remove foreground residues when focusing on the background at the same time sst maintains smooth transitions in varying focal depths comprehensive experiments on synthetic and new real indoor and outdoor datasets demonstrate the effectiveness and usefulness of our technique
|
[['we', 'present', 'a', 'novel', 'semantic', 'light', 'field', 'lf', 'refocusing', 'technique', 'that', 'can', 'achieve', 'unprecedented', 'seethrough', 'quality', 'different', 'from', 'prior', 'art', 'our', 'semantic', 'seethrough', 'sst', 'differentiates', 'rays', 'in', 'their', 'semantic', 'meaning', 'and', 'depth', 'specifically', 'we', 'combine', 'deep', 'learning', 'and', 'stereo', 'matching', 'to', 'provide', 'each', 'ray', 'a', 'semantic', 'label', 'we', 'then', 'design', 'tailored', 'weighting', 'schemes', 'for', 'blending', 'the', 'rays', 'although', 'simple', 'our', 'solution', 'can', 'effectively', 'remove', 'foreground', 'residues', 'when', 'focusing', 'on', 'the', 'background', 'at', 'the', 'same', 'time', 'sst', 'maintains', 'smooth', 'transitions', 'in', 'varying', 'focal', 'depths', 'comprehensive', 'experiments', 'on', 'synthetic', 'and', 'new', 'real', 'indoor', 'and', 'outdoor', 'datasets', 'demonstrate', 'the', 'effectiveness', 'and', 'usefulness', 'of', 'our', 'technique']]
|
[-0.019106816167157946, 0.045176672679315064, -0.08247807685413636, 0.07828835217629139, -0.14021943456164615, -0.10701046497606691, 0.04253010301595079, 0.5131357048327724, -0.25313704057286185, -0.3399824499992617, 0.014258434838505791, -0.26251753459812377, -0.17024512794644883, 0.20634508785773434, -0.1346359679420643, 0.05640877358724966, 0.11205726500837972, -0.034101706913240964, -0.06004449923057109, -0.26582271392073703, 0.2994550829388055, 0.05956695638066295, 0.37717396329504016, 0.06708396566283031, 0.18327702986825184, -0.0044312122707054315, -0.07024101731504369, 0.002729618840841759, -0.056354244249115594, 0.15016134164076955, 0.2946313209923021, 0.22393319313414395, 0.21295834080699613, -0.4104864101528245, -0.2640678178719884, 0.03983157444471384, 0.14638281547847917, 0.06467630247732135, -0.07767103797546131, -0.3854157252182417, 0.07455514256349381, -0.07496901227197811, -0.007096266040724574, -0.11796812586801346, -0.06472385158264718, 0.020018803311840576, -0.2648662761054641, -0.01381994801911288, 0.017315727599220825, 0.0975837888944821, -0.07342293877017629, -0.10079511962420143, 0.030897123636403942, 0.18279510842979768, -0.03458173808586948, 0.045329999553003146, 0.12627582882494465, -0.15319287319959818, -0.09612296029181201, 0.3522751827395576, -0.0931418118039694, -0.17026660612364317, 0.23494314622389628, -0.07142477829520609, -0.1320621318448627, 0.13915837351369725, 0.25263570597870094, 0.1129763068074324, -0.12733429578414265, 0.03750277141864667, -0.015943995603889812, 0.2160680609499561, 0.10455698267940212, 0.005399427728216145, 0.20681728871411406, 0.22303448833853884, 0.06116922516158928, 0.12801919925464866, -0.22069880661244193, 0.010677583104766467, -0.2365211196855514, -0.12345695851699394, -0.16445489863262458, -0.03545208700462336, -0.16519500569862144, -0.1242397831497239, 0.4180262780876136, 0.27402304681748446, 0.19063978153737446, 0.09040873907689079, 0.41486235511690084, 0.003826008441940169, 0.04431920980477669, 0.05344211288234767, 0.20290014953535124, -0.006734335724282644, 0.1244565702383589, -0.20331098210847223, 0.028576169030594768, 0.04209783952825876]
|
1,803.09475
|
Theoretical spin-wave dispersions in the antiferromagnetic phase AF1 of
MnWO$_4$ based on the polar atomistic model in P2
|
The spin wave dispersions of the low temperature antiferromagnetic phase
(AF1) MnWO$_4$ have been numerically calculated based on the recently reported
non-collinear spin configuration with two different canting angles. A
Heisenberg model with competing magnetic exchange couplings and single-ion
anisotropy terms could properly describe the spin wave excitations, including
the newly observed low-lying energy excitation mode $\omega_2$=0.45 meV
appearing at the magnetic zone centre. The spin wave dispersion and intensities
are highly sensitive to two differently aligned spin-canting sublattices in the
AF1 model. Thus this study reinsures the otherwise hardly provable hidden polar
character in MnWO$_4$.
|
cond-mat.mtrl-sci
|
the spin wave dispersions of the low temperature antiferromagnetic phase af1 mnwo_4 have been numerically calculated based on the recently reported noncollinear spin configuration with two different canting angles a heisenberg model with competing magnetic exchange couplings and singleion anisotropy terms could properly describe the spin wave excitations including the newly observed lowlying energy excitation mode omega_2045 mev appearing at the magnetic zone centre the spin wave dispersion and intensities are highly sensitive to two differently aligned spincanting sublattices in the af1 model thus this study reinsures the otherwise hardly provable hidden polar character in mnwo_4
|
[['the', 'spin', 'wave', 'dispersions', 'of', 'the', 'low', 'temperature', 'antiferromagnetic', 'phase', 'af1', 'mnwo_4', 'have', 'been', 'numerically', 'calculated', 'based', 'on', 'the', 'recently', 'reported', 'noncollinear', 'spin', 'configuration', 'with', 'two', 'different', 'canting', 'angles', 'a', 'heisenberg', 'model', 'with', 'competing', 'magnetic', 'exchange', 'couplings', 'and', 'singleion', 'anisotropy', 'terms', 'could', 'properly', 'describe', 'the', 'spin', 'wave', 'excitations', 'including', 'the', 'newly', 'observed', 'lowlying', 'energy', 'excitation', 'mode', 'omega_2045', 'mev', 'appearing', 'at', 'the', 'magnetic', 'zone', 'centre', 'the', 'spin', 'wave', 'dispersion', 'and', 'intensities', 'are', 'highly', 'sensitive', 'to', 'two', 'differently', 'aligned', 'spincanting', 'sublattices', 'in', 'the', 'af1', 'model', 'thus', 'this', 'study', 'reinsures', 'the', 'otherwise', 'hardly', 'provable', 'hidden', 'polar', 'character', 'in', 'mnwo_4']]
|
[-0.21392029397031095, 0.2961272502793594, 0.024583386168121658, 0.07697370649746402, -0.08664372335144745, -0.11875047321193555, -0.013755601404749967, 0.43044612951021877, -0.24560507922433317, -0.2950320215697618, -0.017972662559452842, -0.301151055842638, -0.04709197914208028, 0.13535585809756626, 0.1665226085547437, -0.014096868407734215, -0.035188025662407994, 0.005592311063702119, -0.09121867730480401, -0.1418007846582344, 0.2596407694484484, 0.01702167002850787, 0.35198341732091726, 0.06137681003917563, 0.04435853251909956, 0.023267847035040565, 0.16654461219490685, -0.014542868152815611, -0.13284950060373607, 0.02762273531109887, 0.24889064144263875, -0.1484746385955232, 0.11412006196630325, -0.43305944936706664, -0.19781764139956298, 0.014747953463464658, 0.14737166866085472, 0.1723950149471614, -0.03535995438343231, -0.3274323470949968, -0.012902442323777111, -0.18180831002339007, -0.15833725181390887, -0.12776712074558785, -0.04229339948568018, -0.003712768034831165, -0.21272763394146285, 0.12425346500884266, 0.05771869367008355, 0.09758756938885818, -0.10449748689759562, -0.191571900495972, -0.13701902071578784, 0.009694233754689389, 0.10426145883901243, 0.09723115460749002, 0.1015327347719923, -0.054155599749448925, -0.14185092478316833, 0.33953455502682545, -0.03059549544482155, -0.1220824774329927, 0.1564057038705598, -0.22003988420622958, -0.09898243201995625, 0.18607290259542617, 0.1245356234183109, 0.06302810784805804, -0.13281222748907007, 0.053890863999766496, 0.019090776010187334, 0.18038927427582205, 0.06145134904332697, 0.0824669592350008, 0.29305489012535585, 0.10442593307333424, -0.009489684967581737, 0.11330868300803482, -0.1829619615393235, -0.11807897418212304, -0.15790999084314766, -0.08490850760581646, -0.20722369224352, 0.0048561157187152195, -0.08904493760603649, -0.1548865476543916, 0.4396260026545125, 0.13295647137342614, 0.15534848121410988, -0.08670385668618961, 0.2575937552783797, 0.07966851973113545, 0.07138151231102963, 0.0531360690254084, 0.3249050151913407, 0.21438378413663584, 0.10071492295692418, -0.31467820180857436, 0.09599659112876559, 0.004150900316048175]
|
1,803.09476
|
Gromov-Witten theory with derived algebraic geometry
|
In this survey we add two new results that are not in our paper [MR15]. Using
the idea of brane actions discovered by Toen, we construct a lax associative
action of the operad of stable curves of genus zero on a smooth variety X seen
as an object in correspondences in derived stacks. This action encodes the
Gromov-Witten theory of X in purely geometrical terms.
|
math.AG
|
in this survey we add two new results that are not in our paper mr15 using the idea of brane actions discovered by toen we construct a lax associative action of the operad of stable curves of genus zero on a smooth variety x seen as an object in correspondences in derived stacks this action encodes the gromovwitten theory of x in purely geometrical terms
|
[['in', 'this', 'survey', 'we', 'add', 'two', 'new', 'results', 'that', 'are', 'not', 'in', 'our', 'paper', 'mr15', 'using', 'the', 'idea', 'of', 'brane', 'actions', 'discovered', 'by', 'toen', 'we', 'construct', 'a', 'lax', 'associative', 'action', 'of', 'the', 'operad', 'of', 'stable', 'curves', 'of', 'genus', 'zero', 'on', 'a', 'smooth', 'variety', 'x', 'seen', 'as', 'an', 'object', 'in', 'correspondences', 'in', 'derived', 'stacks', 'this', 'action', 'encodes', 'the', 'gromovwitten', 'theory', 'of', 'x', 'in', 'purely', 'geometrical', 'terms']]
|
[-0.17768719858577242, 0.025547443003461012, -0.13466015900485218, 0.060055539548557135, -0.08301105129066855, -0.10624173590622377, -0.005115903877594974, 0.35947958209726494, -0.3179105660528876, -0.24416604267025832, 0.04722507366386708, -0.2257493118813727, -0.22171632392564788, 0.1960067257459741, -0.22429360065143555, -0.05022106230899226, 0.03479830731293987, 0.0583124895056244, -0.10849151387446909, -0.30947163491509855, 0.4346278571829316, -0.0654652277007699, 0.21634610283217626, 0.0042236608860548586, 0.14901755795835925, -0.007864680061175022, -0.01907814369769767, 0.011308542714687064, -0.1240978344873156, 0.1785630351077998, 0.2910014241169847, 0.09319624501949875, 0.12207241094438359, -0.40052715700585395, -0.19198649778263643, 0.10832225135527551, 0.14405843392160023, 0.07111029906081967, -0.05344955797227158, -0.28650152699265163, 0.1201555366278626, -0.19896603889355902, -0.1411309952454758, -0.08446657394779322, 0.04990432647173293, -0.0003633522355812602, -0.169785465568566, -0.03029341763976845, 0.0898094621807104, 0.1362120254598267, -0.10147401295034797, -0.05992040010460187, -0.08228684517598595, 0.09824368597764987, 0.011584288833546452, 0.09573792426090222, 0.07675547593680676, -0.17043429526529508, -0.1459919011904276, 0.3475452201528242, -0.11806330300169066, -0.21403573476709425, 0.14719054330998915, -0.09962103214729723, -0.17256528534926474, 0.11955902843692456, 0.09963444690220058, 0.23184664444124792, -0.11160106125316815, 0.1667368251219159, -0.101704276559758, 0.11531953154189978, 0.08304620220587822, 0.020278374619920214, 0.2020987530122511, 0.11289385017880704, 0.014630035191657953, 0.15445077182630484, -0.029615484530950198, -0.07602868397952989, -0.38111625487726997, -0.15587356692412868, -0.1120310851110844, 0.14750193733584638, -0.0809776554669952, -0.16353929956676438, 0.39084023408940993, 0.13362927675188985, 0.2426540978540288, 0.09668663113916409, 0.23753837010008283, 0.04129851325342315, 0.05508618049498182, -0.008116268385492731, 0.1722825004690094, 0.14428906113971607, 0.023817776214855257, -0.11772427861069445, -0.04581983159732772, 0.20600775945786154]
|
1,803.09477
|
Reignited star formation in dwarf galaxies quenched during reionization
|
Irregular dwarf galaxies of the Local Group have very varied properties and
star formation histories. Some of them formed the majority of their stars very
late compared to the others. Extreme examples are Leo A and Aquarius which
reached the peak of star formation at $z<1$ ( > 6 Gyr after BB). This fact
seemingly challenges the LCDM cosmology because the dark matter halos of these
galaxies on average should assemble the majority of their masses before z~2 (<3
Gyr after BB). In this work we investigate whether the delayed star formation
histories of some irregular dwarf galaxies could be explained purely by the
stochasticity of their mass assembly histories coupled with the effect of
cosmic reionization. We develop a semi-analytic model to follow the accretion
of baryonic matter, star formation and stellar feedback in dark matter halos
with present day virial masses 10^9 M_Sun < M < 10^11 M_Sun and with different
stochastic growth histories obtained using the PINOCCHIO code based on
Lagrangian perturbation theory. We obtain the distributions of observable
parameters and the evolution histories for these galaxies. Accretion of
baryonic matter is strongly suppressed after the epoch of reionization in some
models but they continue to accrete dark matter and eventually reach enough
mass for accretion of baryonic matter to begin again. These "reborn" model
galaxies show very similar delayed star formation histories to those of Leo A
and Aquarius. We find that the stochasticity caused by mass assembly histories
is enhanced in systems with virial masses ~10^10 M_Sun because of their
sensitivity to the photoionizing intergalactic radiation field after the epoch
of reionization. This results in qualitatively different star formation
histories in late- and early-forming galaxies and it might explain the peculiar
star formation histories of irregular dwarf galaxies such as Leo A and
Aquarius.
|
astro-ph.GA
|
irregular dwarf galaxies of the local group have very varied properties and star formation histories some of them formed the majority of their stars very late compared to the others extreme examples are leo a and aquarius which reached the peak of star formation at z1 6 gyr after bb this fact seemingly challenges the lcdm cosmology because the dark matter halos of these galaxies on average should assemble the majority of their masses before z2 3 gyr after bb in this work we investigate whether the delayed star formation histories of some irregular dwarf galaxies could be explained purely by the stochasticity of their mass assembly histories coupled with the effect of cosmic reionization we develop a semianalytic model to follow the accretion of baryonic matter star formation and stellar feedback in dark matter halos with present day virial masses 109 m_sun m 1011 m_sun and with different stochastic growth histories obtained using the pinocchio code based on lagrangian perturbation theory we obtain the distributions of observable parameters and the evolution histories for these galaxies accretion of baryonic matter is strongly suppressed after the epoch of reionization in some models but they continue to accrete dark matter and eventually reach enough mass for accretion of baryonic matter to begin again these reborn model galaxies show very similar delayed star formation histories to those of leo a and aquarius we find that the stochasticity caused by mass assembly histories is enhanced in systems with virial masses 1010 m_sun because of their sensitivity to the photoionizing intergalactic radiation field after the epoch of reionization this results in qualitatively different star formation histories in late and earlyforming galaxies and it might explain the peculiar star formation histories of irregular dwarf galaxies such as leo a and aquarius
|
[['irregular', 'dwarf', 'galaxies', 'of', 'the', 'local', 'group', 'have', 'very', 'varied', 'properties', 'and', 'star', 'formation', 'histories', 'some', 'of', 'them', 'formed', 'the', 'majority', 'of', 'their', 'stars', 'very', 'late', 'compared', 'to', 'the', 'others', 'extreme', 'examples', 'are', 'leo', 'a', 'and', 'aquarius', 'which', 'reached', 'the', 'peak', 'of', 'star', 'formation', 'at', 'z1', '6', 'gyr', 'after', 'bb', 'this', 'fact', 'seemingly', 'challenges', 'the', 'lcdm', 'cosmology', 'because', 'the', 'dark', 'matter', 'halos', 'of', 'these', 'galaxies', 'on', 'average', 'should', 'assemble', 'the', 'majority', 'of', 'their', 'masses', 'before', 'z2', '3', 'gyr', 'after', 'bb', 'in', 'this', 'work', 'we', 'investigate', 'whether', 'the', 'delayed', 'star', 'formation', 'histories', 'of', 'some', 'irregular', 'dwarf', 'galaxies', 'could', 'be', 'explained', 'purely', 'by', 'the', 'stochasticity', 'of', 'their', 'mass', 'assembly', 'histories', 'coupled', 'with', 'the', 'effect', 'of', 'cosmic', 'reionization', 'we', 'develop', 'a', 'semianalytic', 'model', 'to', 'follow', 'the', 'accretion', 'of', 'baryonic', 'matter', 'star', 'formation', 'and', 'stellar', 'feedback', 'in', 'dark', 'matter', 'halos', 'with', 'present', 'day', 'virial', 'masses', '109', 'm_sun', 'm', '1011', 'm_sun', 'and', 'with', 'different', 'stochastic', 'growth', 'histories', 'obtained', 'using', 'the', 'pinocchio', 'code', 'based', 'on', 'lagrangian', 'perturbation', 'theory', 'we', 'obtain', 'the', 'distributions', 'of', 'observable', 'parameters', 'and', 'the', 'evolution', 'histories', 'for', 'these', 'galaxies', 'accretion', 'of', 'baryonic', 'matter', 'is', 'strongly', 'suppressed', 'after', 'the', 'epoch', 'of', 'reionization', 'in', 'some', 'models', 'but', 'they', 'continue', 'to', 'accrete', 'dark', 'matter', 'and', 'eventually', 'reach', 'enough', 'mass', 'for', 'accretion', 'of', 'baryonic', 'matter', 'to', 'begin', 'again', 'these', 'reborn', 'model', 'galaxies', 'show', 'very', 'similar', 'delayed', 'star', 'formation', 'histories', 'to', 'those', 'of', 'leo', 'a', 'and', 'aquarius', 'we', 'find', 'that', 'the', 'stochasticity', 'caused', 'by', 'mass', 'assembly', 'histories', 'is', 'enhanced', 'in', 'systems', 'with', 'virial', 'masses', '1010', 'm_sun', 'because', 'of', 'their', 'sensitivity', 'to', 'the', 'photoionizing', 'intergalactic', 'radiation', 'field', 'after', 'the', 'epoch', 'of', 'reionization', 'this', 'results', 'in', 'qualitatively', 'different', 'star', 'formation', 'histories', 'in', 'late', 'and', 'earlyforming', 'galaxies', 'and', 'it', 'might', 'explain', 'the', 'peculiar', 'star', 'formation', 'histories', 'of', 'irregular', 'dwarf', 'galaxies', 'such', 'as', 'leo', 'a', 'and', 'aquarius']]
|
[-0.0743135138091205, 0.153929599881038, -0.12496277121353452, 0.14856891678606743, -0.10330455382749186, -0.02993976162209854, 0.014512170156290345, 0.3881718157853742, -0.13445769900582352, -0.38007021207023034, 0.02476451206021011, -0.2367228923649606, -0.02500947523325429, 0.1461840099363067, -0.034538361425432616, -0.061102373405533324, 0.05419290961492491, -0.06722871486997327, -0.06695447275454526, -0.3997944583579645, 0.3253045507095028, 0.08131646390341349, 0.10090920400442713, -0.07575760974422475, 0.04751432349281859, -0.12855256196679704, -0.10465443933943003, -0.07945935649055419, -0.23295921054641594, -0.04546044005309942, 0.2140538177963655, 0.16370555539694379, 0.21968370974932055, -0.4187665200839608, -0.20915621843354745, 0.10125921861726349, 0.21636408309331875, 0.0802216098722765, -0.1574378027095286, -0.2643711620744444, 0.08103117965856346, -0.23423549674167218, -0.13855108673826366, 0.08223339413466342, 0.040868792585412955, 0.018415026043984945, -0.20325423461085154, 0.20525542846999242, 0.018030680840740266, -0.01090950807122419, -0.08560842927624235, -0.05178984131474616, -0.09466963168391485, 0.03677229119969879, 0.023222456260000246, 0.031152814509883775, 0.275555566418916, -0.18809582301735153, 0.0012863706045594635, 0.45021296101543357, -0.06783978324857051, 0.032260144384325305, 0.2674630882005381, -0.22621173022662178, -0.1910820551926933, 0.10290936937612892, 0.1298101261392299, 0.09353803367653893, -0.16587175050024258, 0.009466915893747267, 0.03940202497829825, 0.17538868747493724, 0.0610818982045403, 0.034847284935541074, 0.4272213324525599, 0.1286405266459905, 0.015887273380816993, -0.016559844448673144, -0.08807184391317621, -0.07176086955143422, -0.19112635245467774, -0.05994630242240126, -0.10811692886054516, 0.11416629204542329, -0.15068609278749723, -0.09676618541164671, 0.337419093037182, 0.09808550528960966, 0.2652543424739171, 0.10083280919313084, 0.2984571419447124, 0.04396693079685003, 0.08231988434316748, 0.08386488661359427, 0.2805918998131331, 0.22253487722285217, 0.08188715474167049, -0.2829637424341577, 0.045115767961162755, -0.012024461850523948]
|
1,803.09478
|
User Positioning in mmW 5G Networks using Beam-RSRP Measurements and
Kalman Filtering
|
In this paper, we exploit the 3D-beamforming features of multiantenna
equipment employed in fifth generation (5G) networks, operating in the
millimeter wave (mmW) band, for accurate positioning and tracking of users. We
consider sequential estimation of users' positions, and propose a two-stage
extended Kalman filter (EKF) that is based on reference signal received power
(RSRP) measurements. In particular, beamformed downlink (DL) reference signals
(RS) are transmitted by multiple base stations (BSs) and measured by user
equipmentn(UE) employing receive beamforming. The so-obtained BRSRP
measurements are fed back to the BS where the corresponding
direction-of-departure are sequentially estimated by a novel EKF. Such angle
estimates from multiple BSs are subsequently fused on a central entity into 3D
position estimates of UE by means of an angle-based EKF. The proposed
positioning scheme is scalable since the computational burden is shared among
different network entities, namely transmission/reception points (TRPs) and
5G-NR Node B (gNB), and may be accomplished with the signalling currently
specified for 5G. We assess the performance of the proposed algorithm on a
realistic outdoor 5G deployment with a detailed ray tracing propagation model
based on the METIS Madrid map. Numerical results with a system operating at 39
GHz show that sub-meter 3D positioning accuracy is achievable in future mmW 5G
networks.
|
cs.IT eess.SP math.IT
|
in this paper we exploit the 3dbeamforming features of multiantenna equipment employed in fifth generation 5g networks operating in the millimeter wave mmw band for accurate positioning and tracking of users we consider sequential estimation of users positions and propose a twostage extended kalman filter ekf that is based on reference signal received power rsrp measurements in particular beamformed downlink dl reference signals rs are transmitted by multiple base stations bss and measured by user equipmentnue employing receive beamforming the soobtained brsrp measurements are fed back to the bs where the corresponding directionofdeparture are sequentially estimated by a novel ekf such angle estimates from multiple bss are subsequently fused on a central entity into 3d position estimates of ue by means of an anglebased ekf the proposed positioning scheme is scalable since the computational burden is shared among different network entities namely transmissionreception points trps and 5gnr node b gnb and may be accomplished with the signalling currently specified for 5g we assess the performance of the proposed algorithm on a realistic outdoor 5g deployment with a detailed ray tracing propagation model based on the metis madrid map numerical results with a system operating at 39 ghz show that submeter 3d positioning accuracy is achievable in future mmw 5g networks
|
[['in', 'this', 'paper', 'we', 'exploit', 'the', '3dbeamforming', 'features', 'of', 'multiantenna', 'equipment', 'employed', 'in', 'fifth', 'generation', '5g', 'networks', 'operating', 'in', 'the', 'millimeter', 'wave', 'mmw', 'band', 'for', 'accurate', 'positioning', 'and', 'tracking', 'of', 'users', 'we', 'consider', 'sequential', 'estimation', 'of', 'users', 'positions', 'and', 'propose', 'a', 'twostage', 'extended', 'kalman', 'filter', 'ekf', 'that', 'is', 'based', 'on', 'reference', 'signal', 'received', 'power', 'rsrp', 'measurements', 'in', 'particular', 'beamformed', 'downlink', 'dl', 'reference', 'signals', 'rs', 'are', 'transmitted', 'by', 'multiple', 'base', 'stations', 'bss', 'and', 'measured', 'by', 'user', 'equipmentnue', 'employing', 'receive', 'beamforming', 'the', 'soobtained', 'brsrp', 'measurements', 'are', 'fed', 'back', 'to', 'the', 'bs', 'where', 'the', 'corresponding', 'directionofdeparture', 'are', 'sequentially', 'estimated', 'by', 'a', 'novel', 'ekf', 'such', 'angle', 'estimates', 'from', 'multiple', 'bss', 'are', 'subsequently', 'fused', 'on', 'a', 'central', 'entity', 'into', '3d', 'position', 'estimates', 'of', 'ue', 'by', 'means', 'of', 'an', 'anglebased', 'ekf', 'the', 'proposed', 'positioning', 'scheme', 'is', 'scalable', 'since', 'the', 'computational', 'burden', 'is', 'shared', 'among', 'different', 'network', 'entities', 'namely', 'transmissionreception', 'points', 'trps', 'and', '5gnr', 'node', 'b', 'gnb', 'and', 'may', 'be', 'accomplished', 'with', 'the', 'signalling', 'currently', 'specified', 'for', '5g', 'we', 'assess', 'the', 'performance', 'of', 'the', 'proposed', 'algorithm', 'on', 'a', 'realistic', 'outdoor', '5g', 'deployment', 'with', 'a', 'detailed', 'ray', 'tracing', 'propagation', 'model', 'based', 'on', 'the', 'metis', 'madrid', 'map', 'numerical', 'results', 'with', 'a', 'system', 'operating', 'at', '39', 'ghz', 'show', 'that', 'submeter', '3d', 'positioning', 'accuracy', 'is', 'achievable', 'in', 'future', 'mmw', '5g', 'networks']]
|
[-0.20188942609948288, -0.007522727146946326, 0.01766806300729513, -0.007566419165445174, -0.07493734207890201, -0.2398209317610031, 0.07857046590652317, 0.4168496992140895, -0.22584057610209396, -0.27757447245065386, 0.09257138409231586, -0.2590897407269151, -0.16697326845279326, 0.16343346432464698, -0.10146997822448611, 0.07308996854940565, 0.0958326884068367, 0.021867935021021745, -0.04392339278285096, -0.20183948453447623, 0.2389933603006506, 0.1450235299811494, 0.3657157593315876, -0.03504685773173483, 0.10460142344917829, 0.02718758879161281, -0.08136413095110073, -0.05001816651272792, -0.044228173056035304, 0.11691660301578118, 0.3403968668043068, 0.19170042472641644, 0.2769984164343375, -0.43289601863248317, -0.25193507816960536, 0.051821436643282454, 0.15481911751259936, 0.03565333773631875, -0.027033892890620158, -0.36780887588790456, 0.13883858732055737, -0.21990651964073682, -0.05008604889054124, 0.030755863688522723, -0.09148960693898361, 0.08795505971988526, -0.3544272453955761, -0.00038970734515204663, -0.06385164854752763, 0.06890195969310475, -0.04782680264438457, -0.10742215355347115, 0.00047193032621247014, 0.163863221646809, -0.03517924321292922, 0.012014574102103347, 0.1371975640297822, -0.07626880528746037, -0.10817531032555895, 0.39593596587570884, 0.0018084525755356724, -0.24366637568511978, 0.1472933199574671, -0.08859945388637532, -0.1063175502823802, 0.1543699538562356, 0.26939910958725505, 0.0464232755643202, -0.19960146803954026, 0.0006303386811007995, -0.0005478057421874482, 0.16529657290339833, 0.09029217744246125, 0.08501181646943001, 0.20143222307315006, 0.22475081839451067, 0.12248305597047253, 0.07058719129460614, -0.2074237494093434, -0.07354246421558101, -0.20970474647091156, -0.09165518600713723, -0.23101339912405464, -0.019358608369479842, -0.09598658465710752, -0.04882616349382372, 0.3836549412908292, 0.1843600941202944, 0.12633456048532957, 0.08519637693492015, 0.411850803184164, 0.08944580468303728, 0.0727084479149908, 0.12270961196229953, 0.21622841171629262, 0.04482830206681861, 0.16005799799430662, -0.16794655374592035, 0.03483988846107045, 0.039646484032727594]
|
1,803.09479
|
Interpolation error of misspecified Gaussian process regression
|
An interpolation error is an integral of the squared error of a regression
model over a domain of interest. We consider the interpolation error for the
case of misspecified Gaussian process regression: used covariance function
differs from the true one. We derive the interpolation error for an infinite
grid design of experiments. In particular, we show that for Matern 1/2
covariance function poor estimation of parameters only slightly affects the
quality of interpolation. Then we proceed to numerical experiments that
consider the misspecification for the most common covariance functions
including other Matern and squared exponential covariance functions. For them,
the quality of estimates of parameters affects the interpolation error.
|
math.ST stat.TH
|
an interpolation error is an integral of the squared error of a regression model over a domain of interest we consider the interpolation error for the case of misspecified gaussian process regression used covariance function differs from the true one we derive the interpolation error for an infinite grid design of experiments in particular we show that for matern 12 covariance function poor estimation of parameters only slightly affects the quality of interpolation then we proceed to numerical experiments that consider the misspecification for the most common covariance functions including other matern and squared exponential covariance functions for them the quality of estimates of parameters affects the interpolation error
|
[['an', 'interpolation', 'error', 'is', 'an', 'integral', 'of', 'the', 'squared', 'error', 'of', 'a', 'regression', 'model', 'over', 'a', 'domain', 'of', 'interest', 'we', 'consider', 'the', 'interpolation', 'error', 'for', 'the', 'case', 'of', 'misspecified', 'gaussian', 'process', 'regression', 'used', 'covariance', 'function', 'differs', 'from', 'the', 'true', 'one', 'we', 'derive', 'the', 'interpolation', 'error', 'for', 'an', 'infinite', 'grid', 'design', 'of', 'experiments', 'in', 'particular', 'we', 'show', 'that', 'for', 'matern', '12', 'covariance', 'function', 'poor', 'estimation', 'of', 'parameters', 'only', 'slightly', 'affects', 'the', 'quality', 'of', 'interpolation', 'then', 'we', 'proceed', 'to', 'numerical', 'experiments', 'that', 'consider', 'the', 'misspecification', 'for', 'the', 'most', 'common', 'covariance', 'functions', 'including', 'other', 'matern', 'and', 'squared', 'exponential', 'covariance', 'functions', 'for', 'them', 'the', 'quality', 'of', 'estimates', 'of', 'parameters', 'affects', 'the', 'interpolation', 'error']]
|
[-0.053657082477669926, -0.015864653897993995, -0.05437388704286529, 0.1612503869794161, -0.0463693319657527, -0.12699574094539115, 0.05136823100507806, 0.3968265040888699, -0.28945341961214816, -0.232366822053328, 0.14459286155414108, -0.255801384567941, -0.16878103121363242, 0.20754013163808716, -0.11266503880364359, 0.13269487991523202, 0.05939956369100634, 0.010073367719871735, -0.17763299006678232, -0.2869258144701652, 0.33935504673271005, 0.07185594549556391, 0.26888287759497076, -0.0498137323168713, 0.12191445005784204, 0.07175251881703051, -0.05509008780771166, -0.05830430630765377, -0.15220181542780323, 0.12677091806315297, 0.1970482731212375, 0.13918361034235754, 0.3509311133636794, -0.34437818043446594, -0.21566755178629063, 0.1448890430716063, 0.15366303451666866, 0.05000501871109009, -0.027513659030515187, -0.22994119063694748, 0.03374098820201711, -0.14616251779600567, -0.10397141157658002, -0.04824498733249279, -0.04742025649773145, 0.061240645843224785, -0.4327357548861465, 0.15038394818184983, 0.046408906656449846, 0.05893570457696231, -0.05248966521942356, -0.20598364268523564, 0.04363960948336972, 0.14946737773545565, 0.06216639391688092, 0.004823637073710048, 0.11279437127480403, -0.14811800454461246, -0.07721201459014225, 0.3293000238204221, -0.07024075316453199, -0.3221366823642352, 0.10219675378549263, -0.14910479630728107, -0.09998165463511789, 0.0986564310455541, 0.2337609430446093, 0.06183177153801507, -0.121247627217015, 0.10774042612793984, -0.024277934556775682, 0.18032724290676072, 0.02434246014235456, -0.0024140715052228456, 0.0793813623753889, 0.1395872243991925, 0.11209088134570816, 0.15038329653854166, -0.14190022616434647, -0.08113491489475064, -0.3504115197329073, -0.13288794551044703, -0.2608914257650939, -0.02157592243480778, -0.21833886702130056, -0.2357863199666416, 0.40200808637459345, 0.18239439463396684, 0.18280573446013101, 0.1329944503382532, 0.28585117607625254, 0.15828994846979685, 0.025090145814411956, 0.06687235217369236, 0.21631647452472821, 0.11140107265630857, -0.0006765639505545617, -0.18189497211939493, 0.10806386927655394, 0.05903159009696971]
|
1,803.0948
|
Diagrammatic treatment of few-photon scattering from a Rydberg blockaded
atomic ensemble in a cavity
|
In a previous letter we studied the giant optical nonlinearities of a Rydberg
atomic medium within an optical cavity, in the Schwinger-Keldysh formalism. In
particular, we calculated the non-linear contributions to the spectrum of the
light transmitted through the cavity. In this article we spell out the
essential details of this calculation, and we show how it can be extended to
higher input photon numbers, and higher order correlation functions. As a
relevant example, we calculate and discuss the three-photon correlation
function of the transmitted light, and discuss its physical significance in
terms of the polariton energy levels of the Rydberg medium within the optical
cavity.
|
quant-ph physics.atom-ph physics.optics
|
in a previous letter we studied the giant optical nonlinearities of a rydberg atomic medium within an optical cavity in the schwingerkeldysh formalism in particular we calculated the nonlinear contributions to the spectrum of the light transmitted through the cavity in this article we spell out the essential details of this calculation and we show how it can be extended to higher input photon numbers and higher order correlation functions as a relevant example we calculate and discuss the threephoton correlation function of the transmitted light and discuss its physical significance in terms of the polariton energy levels of the rydberg medium within the optical cavity
|
[['in', 'a', 'previous', 'letter', 'we', 'studied', 'the', 'giant', 'optical', 'nonlinearities', 'of', 'a', 'rydberg', 'atomic', 'medium', 'within', 'an', 'optical', 'cavity', 'in', 'the', 'schwingerkeldysh', 'formalism', 'in', 'particular', 'we', 'calculated', 'the', 'nonlinear', 'contributions', 'to', 'the', 'spectrum', 'of', 'the', 'light', 'transmitted', 'through', 'the', 'cavity', 'in', 'this', 'article', 'we', 'spell', 'out', 'the', 'essential', 'details', 'of', 'this', 'calculation', 'and', 'we', 'show', 'how', 'it', 'can', 'be', 'extended', 'to', 'higher', 'input', 'photon', 'numbers', 'and', 'higher', 'order', 'correlation', 'functions', 'as', 'a', 'relevant', 'example', 'we', 'calculate', 'and', 'discuss', 'the', 'threephoton', 'correlation', 'function', 'of', 'the', 'transmitted', 'light', 'and', 'discuss', 'its', 'physical', 'significance', 'in', 'terms', 'of', 'the', 'polariton', 'energy', 'levels', 'of', 'the', 'rydberg', 'medium', 'within', 'the', 'optical', 'cavity']]
|
[-0.1307206464676573, 0.1376561843319236, -0.07491096673875977, 0.07647072724593838, 0.016879372720448475, -0.07093137487898721, 0.0629099587380517, 0.4022082581694396, -0.23869508381862686, -0.2769762286564933, 0.018849343403005304, -0.26416213651416154, -0.16056347824633121, 0.17293435712081362, 0.019552193780842605, 0.04585473950598652, -0.005871828728935348, 0.010666136981321956, -0.03868651091788878, -0.19258269341662526, 0.3023289330742972, 0.06438790363663772, 0.2429247809297247, 0.11688690824996469, 0.09884411477887968, 0.030818610001829855, -0.034034481777299966, -0.04154246320666851, -0.11628477859644676, 0.12790890493570775, 0.22956583311535278, 0.056063556797661875, 0.2434897311558982, -0.447282173055804, -0.20068054483821265, 0.07986375483912679, 0.18339821015361626, 0.17152452619992337, -0.009479625871018419, -0.2576686839819095, -0.016150343715090235, -0.18480017106488067, -0.16225949165253145, -0.047766667272333266, -0.011722661093545129, 0.01803386615742022, -0.20590946407777802, 0.039573409208008704, 0.010051023531353698, 0.025810609527705412, -0.049574435707225625, -0.05053450178161685, -0.012588091732775968, 0.08871174145507503, -0.021626206380666566, -0.0009423773010911525, 0.15711750553586995, -0.15712090043948507, -0.06993324291905528, 0.4003411983579116, -0.12190415817071279, -0.14882177706667274, 0.12875075517266216, -0.2009433003478543, -0.0788447295913016, 0.10976232094075179, 0.19423669085723683, 0.08958524195856266, -0.13508258717802335, 0.04299965114025223, -0.034511196163465395, 0.20482185267720301, 0.09217022443278078, 0.15475315884423424, 0.1867490189044543, 0.12532614150967555, -0.04495425657632778, 0.21891404918004004, -0.09962269307096612, -0.05461601963275516, -0.33697928983788444, -0.14981474823465726, -0.1669316123380273, 0.038602137105662446, -0.07408474324620329, -0.10397645813151579, 0.4637299049030638, 0.17306620778322643, 0.17148793355302605, -0.023943822224677173, 0.34423099058012496, 0.19330000950634163, 0.053680702635385796, 0.017112047512541122, 0.3125767014516553, 0.1622934798239994, 0.10146760514867052, -0.2822545709018156, -0.03105068074996179, -0.0016354445174758165]
|
1,803.09481
|
Uniqueness of the sum of points of the period five cycle of quadratic
polynomials
|
It is well known that the sum of points of the period five cycle of the
quadratic polynomial $f_{c}(x)=x^{2}+c$ is generally not one-valued. In this
paper we will show that the sum of cycle points of the curves of period five is
at most three-valued on a new coordinate plane, and that this result is
essentially the best possible. The method of our proof relies on a implementing
Gr\"obner-bases and especially extension theory from the theory of polynomial
algebra.
|
math.DS
|
it is well known that the sum of points of the period five cycle of the quadratic polynomial f_cxx2c is generally not onevalued in this paper we will show that the sum of cycle points of the curves of period five is at most threevalued on a new coordinate plane and that this result is essentially the best possible the method of our proof relies on a implementing grobnerbases and especially extension theory from the theory of polynomial algebra
|
[['it', 'is', 'well', 'known', 'that', 'the', 'sum', 'of', 'points', 'of', 'the', 'period', 'five', 'cycle', 'of', 'the', 'quadratic', 'polynomial', 'f_cxx2c', 'is', 'generally', 'not', 'onevalued', 'in', 'this', 'paper', 'we', 'will', 'show', 'that', 'the', 'sum', 'of', 'cycle', 'points', 'of', 'the', 'curves', 'of', 'period', 'five', 'is', 'at', 'most', 'threevalued', 'on', 'a', 'new', 'coordinate', 'plane', 'and', 'that', 'this', 'result', 'is', 'essentially', 'the', 'best', 'possible', 'the', 'method', 'of', 'our', 'proof', 'relies', 'on', 'a', 'implementing', 'grobnerbases', 'and', 'especially', 'extension', 'theory', 'from', 'the', 'theory', 'of', 'polynomial', 'algebra']]
|
[-0.17008805491077977, 0.06377033937053803, -0.11128267338977028, 0.013120080407064121, -0.06945001567678097, -0.06992964228042044, 0.06425009424147458, 0.3029214170976327, -0.2835300344785747, -0.2560374804485876, 0.14143616545987195, -0.2491774001182654, -0.2160789932195957, 0.26204568948835516, -0.07653119944883749, -0.00834394745880929, 0.05933785031979474, 0.08427587712708956, -0.046679815997590475, -0.3132952842145012, 0.32820850537301827, 0.02030180951055044, 0.2224660732019215, 0.04166024756761125, 0.10710374545902969, 0.03710558857076252, -0.045433461872819, 0.0016311654009116, -0.07990412403766338, 0.1268766701269226, 0.2254520990432073, 0.1514126754556902, 0.20666226735099769, -0.34867500777666766, -0.13336608305764505, 0.13808255128783342, 0.12984425979308212, 0.09627561301040725, 0.02722410539177079, -0.1527909214536731, 0.10187393936585301, -0.13395256553895962, -0.14938527397036802, -0.02214914087492686, 0.03983267206841937, 0.019152051739346903, -0.2455543010817984, 0.02968296627752865, 0.1111829729574637, 0.11056279117623583, -0.049320233517135374, -0.13461504033050284, -0.007024861866226181, 0.06965072327651657, 0.045006078823159136, 0.08356648161768532, 0.04420481478341688, -0.0651852834629468, -0.132997333107946, 0.39512731770101267, -0.061390255279361435, -0.15588738286616996, 0.17150557744436157, -0.1614957241078791, -0.14609346834297937, 0.09807609838361923, 0.09483783245564271, 0.17941442511689204, -0.1223284688909562, 0.11215223896597774, -0.10258679324761033, 0.16008612721298748, 0.07362120698850888, -0.004926202514280493, 0.1745580125313539, 0.1386831766472031, 0.12166711378197831, 0.1096396048878654, -0.042518153338908, -0.1201656033077504, -0.3675589114606667, -0.15174976279750133, -0.20817349593375978, 0.04152175061906933, -0.09620241144969044, -0.17287958635447118, 0.4520582902507904, 0.10104130891462167, 0.17026095443333572, 0.09262421477932292, 0.27875645398998106, 0.13900618869602346, 0.07984405300671008, 0.05785283021246775, 0.23826172684605879, 0.10209032471697682, 0.04438386098422015, -0.17797966113684174, 0.04822719941297785, 0.13151414272709724]
|
1,803.09482
|
A new approach to simple modules for preprojective algebras
|
The work of the first author on the moment map for representations of quivers
included a classification of the possible dimension vectors of simple modules
for deformed preprojective algebras. That classification was later used to
solve an additive analogue of the Deligne-Simpson problem. The last step in the
proof of the classification involved some general position arguments; here we
give a new approach which avoids such arguments.
|
math.RT
|
the work of the first author on the moment map for representations of quivers included a classification of the possible dimension vectors of simple modules for deformed preprojective algebras that classification was later used to solve an additive analogue of the delignesimpson problem the last step in the proof of the classification involved some general position arguments here we give a new approach which avoids such arguments
|
[['the', 'work', 'of', 'the', 'first', 'author', 'on', 'the', 'moment', 'map', 'for', 'representations', 'of', 'quivers', 'included', 'a', 'classification', 'of', 'the', 'possible', 'dimension', 'vectors', 'of', 'simple', 'modules', 'for', 'deformed', 'preprojective', 'algebras', 'that', 'classification', 'was', 'later', 'used', 'to', 'solve', 'an', 'additive', 'analogue', 'of', 'the', 'delignesimpson', 'problem', 'the', 'last', 'step', 'in', 'the', 'proof', 'of', 'the', 'classification', 'involved', 'some', 'general', 'position', 'arguments', 'here', 'we', 'give', 'a', 'new', 'approach', 'which', 'avoids', 'such', 'arguments']]
|
[-0.0911107032434709, 0.014451803982044126, -0.09906099287014622, 0.08565817334438994, -0.11319133366194012, -0.12375262579203013, 0.022740483343941784, 0.32215565587602446, -0.31392769170091, -0.2340144355148911, 0.11539518912218567, -0.19593549111107392, -0.1935027649090973, 0.1930639284815806, -0.15233805831243744, 0.01221930002098653, 0.07945322033031774, 0.09072865337592119, -0.10349776278990112, -0.3368354524249461, 0.39209090718137685, 0.04150456077864032, 0.22868894999012795, 0.0345102264754363, 0.12177459658610064, 0.05529527902714352, -0.0727849809188785, -0.028871079767817883, -0.15191970102598895, 0.1784586506155528, 0.2604653773162125, 0.08827863911986907, 0.24469655373745333, -0.3783369826625532, -0.1500910386458776, 0.12781660837024006, 0.14517432802231678, 0.14889592926344597, -0.039575556461671504, -0.2735410733704469, 0.0596835845994499, -0.20668342425974448, -0.16186164494659475, -0.08584948186415123, 0.06615549014314814, -0.04284231594777597, -0.23142930606741513, 0.043064010475498085, 0.1661242548265119, 0.0823924361325022, -0.13183772151615583, -0.13368879201467523, 0.03358800453481389, 0.13113764180530751, 0.0013900023342958137, 0.025980692146582277, 0.06170412671488168, -0.11745046329364847, -0.1999114458449185, 0.3379928595803456, 0.011809499753611301, -0.2135841506463823, 0.1510888594272199, -0.06314778599693481, -0.2193353480395319, 0.09044258530362885, 0.13765038071728464, 0.16009647281034223, -0.10945017413416905, 0.08303741838282613, -0.0957051743405746, 0.08998985702707085, 0.11849868358738387, -0.04216891343170193, 0.12447719763853211, 0.1588090611065724, 0.05044764759880838, 0.14816675520738337, -0.04328750030471207, -0.016618722828223246, -0.3500178637566851, -0.19094826699470852, -0.16738381114816153, 0.05561692837917649, -0.07561223748237339, -0.16357923009947165, 0.4295865179442648, 0.1324365649983954, 0.18997797834575733, 0.10864409626593619, 0.2568833821856264, 0.11061117717468028, 0.09082652953429037, -0.0065044417226714875, 0.1721289371676333, 0.20659726108910878, 0.04808116678509917, -0.1300428158867715, 0.012823497271860268, 0.2072614465506553]
|
1,803.09483
|
Clustering to Given Connectivities
|
We define a general variant of the graph clustering problem where the
criterion of density for the clusters is (high) connectivity. In {\sc
Clustering to Given Connectivities}, we are given an $n$-vertex graph $G$, an
integer $k$, and a sequence $\Lambda=\langle
\lambda_{1},\ldots,\lambda_{t}\rangle$ of positive integers and we ask whether
it is possible to remove at most $k$ edges from $G$ such that the resulting
connected components are {\sl exactly} $t$ and their corresponding edge
connectivities are lower-bounded by the numbers in $\Lambda$. We prove that
this problem, parameterized by $k$, is fixed parameter tractable i.e., can be
solved by an $f(k)\cdot n^{O(1)}$-step algorithm, for some function $f$ that
depends only on the parameter $k$. Our algorithm uses the recursive
understanding technique that is especially adapted so to deal with the fact
that, in out setting, we do not impose any restriction to the connectivity
demands in $\Lambda$.
|
cs.DS
|
we define a general variant of the graph clustering problem where the criterion of density for the clusters is high connectivity in sc clustering to given connectivities we are given an nvertex graph g an integer k and a sequence lambdalangle lambda_1ldotslambda_trangle of positive integers and we ask whether it is possible to remove at most k edges from g such that the resulting connected components are sl exactly t and their corresponding edge connectivities are lowerbounded by the numbers in lambda we prove that this problem parameterized by k is fixed parameter tractable ie can be solved by an fkcdot no1step algorithm for some function f that depends only on the parameter k our algorithm uses the recursive understanding technique that is especially adapted so to deal with the fact that in out setting we do not impose any restriction to the connectivity demands in lambda
|
[['we', 'define', 'a', 'general', 'variant', 'of', 'the', 'graph', 'clustering', 'problem', 'where', 'the', 'criterion', 'of', 'density', 'for', 'the', 'clusters', 'is', 'high', 'connectivity', 'in', 'sc', 'clustering', 'to', 'given', 'connectivities', 'we', 'are', 'given', 'an', 'nvertex', 'graph', 'g', 'an', 'integer', 'k', 'and', 'a', 'sequence', 'lambdalangle', 'lambda_1ldotslambda_trangle', 'of', 'positive', 'integers', 'and', 'we', 'ask', 'whether', 'it', 'is', 'possible', 'to', 'remove', 'at', 'most', 'k', 'edges', 'from', 'g', 'such', 'that', 'the', 'resulting', 'connected', 'components', 'are', 'sl', 'exactly', 't', 'and', 'their', 'corresponding', 'edge', 'connectivities', 'are', 'lowerbounded', 'by', 'the', 'numbers', 'in', 'lambda', 'we', 'prove', 'that', 'this', 'problem', 'parameterized', 'by', 'k', 'is', 'fixed', 'parameter', 'tractable', 'ie', 'can', 'be', 'solved', 'by', 'an', 'fkcdot', 'no1step', 'algorithm', 'for', 'some', 'function', 'f', 'that', 'depends', 'only', 'on', 'the', 'parameter', 'k', 'our', 'algorithm', 'uses', 'the', 'recursive', 'understanding', 'technique', 'that', 'is', 'especially', 'adapted', 'so', 'to', 'deal', 'with', 'the', 'fact', 'that', 'in', 'out', 'setting', 'we', 'do', 'not', 'impose', 'any', 'restriction', 'to', 'the', 'connectivity', 'demands', 'in', 'lambda']]
|
[-0.16617658154831993, 0.12251998034834186, -0.07117872801609337, 0.04592286063982303, -0.1215533784141169, -0.1624758197576739, 0.05592162514626074, 0.4067212170145164, -0.3237978755795565, -0.3285762537852861, 0.062150604326032206, -0.2706053285930668, -0.16539564917911775, 0.1312426771045365, -0.05399452906325072, 0.01426316059304453, 0.052111272797143705, 0.11021277997093017, -0.00048572183530066267, -0.275290680766678, 0.32601001869382645, 0.0009285390264671554, 0.1880065125587862, 0.05739620167231704, 0.07228333291191626, 0.010846028777046336, 0.007240609634512414, 0.09517459203440619, -0.16041316710920406, 0.06115323435895132, 0.2850797563539042, 0.1779246319347294, 0.2778046652124936, -0.38930547413312727, -0.17265610521200062, 0.1929777732713976, 0.13534148703911342, 0.04689723776472318, 0.021156267509569362, -0.2065453359973617, 0.17952903868151932, -0.08073387448530411, -0.08216835202397811, -0.04892512881391061, 0.06008953355679599, -0.0023192702275183466, -0.3130767732509412, 0.00836876837678978, 0.08706188827960028, 0.014415187077247538, -0.00456343598327496, -0.1379927869347739, -0.015474089510260254, 0.09821590032596658, -0.03902766420893992, 0.07032015409640735, 0.05272045986364699, -0.11882327043147395, -0.09597004850446764, 0.3503519609641646, -0.03729378878940932, -0.21601497097354797, 0.14188743431522097, -0.10925410904908656, -0.18891232185867718, 0.1122657953561025, 0.12197961402125657, 0.15381794314210614, -0.09102646982258496, 0.14820917768722414, -0.08551483516203007, 0.16262994640015271, 0.06681780851795338, -0.019828268007889466, 0.14419785512048597, 0.10475752311888048, 0.1590995522318129, 0.1422082165089604, -0.0250514107966511, -0.003779275582524456, -0.274903371251033, -0.10174931978367062, -0.24339985572441947, 0.031162008309365774, -0.12425202889557517, -0.15741355133812046, 0.348218032456417, 0.1540770238643745, 0.2458706561721758, 0.09099886214890932, 0.24773410299450108, 0.15293187111011422, 0.04643842614879961, 0.1430554678534261, 0.12429708648192496, 0.11797362833102751, -0.0038745068628082257, -0.19824403814305291, 0.08761190977141571, 0.08416551769348896]
|
1,803.09484
|
Quantum key distribution with setting-choice-independently correlated
light sources
|
Despite the enormous theoretical and experimental progress made so far in
quantum key distribution (QKD), the security of most existing QKD
implementations is not rigorously established yet. A critical obstacle is that
almost all existing security proofs make ideal assumptions on the QKD devices.
Problematically, such assumptions are hard to satisfy in the experiments, and
therefore it is not obvious how to apply such security proofs to practical QKD
systems. Fortunately, any imperfections and security-loopholes in the
measurement devices can be perfectly closed by measurement-device-independent
QKD (MDI-QKD), and thus we only need to consider how to secure the source
devices. Among imperfections in the source devices, correlations between the
sending pulses are one of the principal problems. In this paper, we consider a
setting-choice-independent correlation (SCIC) framework in which the sending
pulses can present arbitrary correlations but they are independent of the
previous setting choices such as the bit, the basis and the intensity settings.
Within the framework of SCIC, we consider the dominant fluctuations of the
sending states, such as the relative phases and the intensities, and provide a
self-contained information theoretic security proof for the loss-tolerant QKD
protocol in the finite-key regime. We demonstrate the feasibility of secure
quantum communication within a reasonable number of pulses sent, and thus we
are convinced that our work constitutes a crucial step toward guaranteeing
implementation security of QKD.
|
quant-ph
|
despite the enormous theoretical and experimental progress made so far in quantum key distribution qkd the security of most existing qkd implementations is not rigorously established yet a critical obstacle is that almost all existing security proofs make ideal assumptions on the qkd devices problematically such assumptions are hard to satisfy in the experiments and therefore it is not obvious how to apply such security proofs to practical qkd systems fortunately any imperfections and securityloopholes in the measurement devices can be perfectly closed by measurementdeviceindependent qkd mdiqkd and thus we only need to consider how to secure the source devices among imperfections in the source devices correlations between the sending pulses are one of the principal problems in this paper we consider a settingchoiceindependent correlation scic framework in which the sending pulses can present arbitrary correlations but they are independent of the previous setting choices such as the bit the basis and the intensity settings within the framework of scic we consider the dominant fluctuations of the sending states such as the relative phases and the intensities and provide a selfcontained information theoretic security proof for the losstolerant qkd protocol in the finitekey regime we demonstrate the feasibility of secure quantum communication within a reasonable number of pulses sent and thus we are convinced that our work constitutes a crucial step toward guaranteeing implementation security of qkd
|
[['despite', 'the', 'enormous', 'theoretical', 'and', 'experimental', 'progress', 'made', 'so', 'far', 'in', 'quantum', 'key', 'distribution', 'qkd', 'the', 'security', 'of', 'most', 'existing', 'qkd', 'implementations', 'is', 'not', 'rigorously', 'established', 'yet', 'a', 'critical', 'obstacle', 'is', 'that', 'almost', 'all', 'existing', 'security', 'proofs', 'make', 'ideal', 'assumptions', 'on', 'the', 'qkd', 'devices', 'problematically', 'such', 'assumptions', 'are', 'hard', 'to', 'satisfy', 'in', 'the', 'experiments', 'and', 'therefore', 'it', 'is', 'not', 'obvious', 'how', 'to', 'apply', 'such', 'security', 'proofs', 'to', 'practical', 'qkd', 'systems', 'fortunately', 'any', 'imperfections', 'and', 'securityloopholes', 'in', 'the', 'measurement', 'devices', 'can', 'be', 'perfectly', 'closed', 'by', 'measurementdeviceindependent', 'qkd', 'mdiqkd', 'and', 'thus', 'we', 'only', 'need', 'to', 'consider', 'how', 'to', 'secure', 'the', 'source', 'devices', 'among', 'imperfections', 'in', 'the', 'source', 'devices', 'correlations', 'between', 'the', 'sending', 'pulses', 'are', 'one', 'of', 'the', 'principal', 'problems', 'in', 'this', 'paper', 'we', 'consider', 'a', 'settingchoiceindependent', 'correlation', 'scic', 'framework', 'in', 'which', 'the', 'sending', 'pulses', 'can', 'present', 'arbitrary', 'correlations', 'but', 'they', 'are', 'independent', 'of', 'the', 'previous', 'setting', 'choices', 'such', 'as', 'the', 'bit', 'the', 'basis', 'and', 'the', 'intensity', 'settings', 'within', 'the', 'framework', 'of', 'scic', 'we', 'consider', 'the', 'dominant', 'fluctuations', 'of', 'the', 'sending', 'states', 'such', 'as', 'the', 'relative', 'phases', 'and', 'the', 'intensities', 'and', 'provide', 'a', 'selfcontained', 'information', 'theoretic', 'security', 'proof', 'for', 'the', 'losstolerant', 'qkd', 'protocol', 'in', 'the', 'finitekey', 'regime', 'we', 'demonstrate', 'the', 'feasibility', 'of', 'secure', 'quantum', 'communication', 'within', 'a', 'reasonable', 'number', 'of', 'pulses', 'sent', 'and', 'thus', 'we', 'are', 'convinced', 'that', 'our', 'work', 'constitutes', 'a', 'crucial', 'step', 'toward', 'guaranteeing', 'implementation', 'security', 'of', 'qkd']]
|
[-0.1908760453082828, 0.07063706321848763, -0.11371221013781097, 0.05992083726606021, -0.0030573333034084904, -0.22822797145073612, 0.07636748917142136, 0.40073727030720974, -0.2451569567543144, -0.27921848712075087, 0.10954218567918159, -0.24972960761230853, -0.09894785959584018, 0.2513680707042416, -0.13212652060720656, 0.1261922629066329, 0.044659376839796705, -0.017422558065995367, -0.018505349196493624, -0.2567204066570331, 0.31720886685782007, 0.04015235512931314, 0.32901948599144815, 0.08478533321991563, 0.07169045912826227, 0.01704247596156266, 0.0005519790078202883, -0.06729954165458266, -0.099473917116217, 0.10950568561209366, 0.3199232805106375, 0.1475685542255006, 0.3019104140996933, -0.42743275283732346, -0.199287527323597, 0.11321582882561618, 0.16002900887694624, 0.1566323234860061, -0.04403604267216805, -0.29576738469923536, 0.06906738028758103, -0.19292983322507806, -0.11675647454103455, -0.08122283802678187, -0.01474779841179649, 0.038665801626112724, -0.2348000865494315, -0.009264667403573791, 0.07072681008078184, 0.04848997589097255, 0.044007402742022854, -0.040641140341758725, 0.04596516501675877, 0.1601616181133108, 0.004866918351811667, -0.012040301131912404, 0.15170570720194115, -0.11853677540500131, -0.1257902393880714, 0.3626809331609143, 0.017079584766179323, -0.19538833872829048, 0.1401896630274132, -0.08147685191290091, -0.14542803407957156, 0.0622945640857021, 0.13635328512845768, 0.06892889080569148, -0.1433318213492425, 0.044264954502383866, -0.03443691397292747, 0.21109468968171213, 0.04183924118160374, 0.1752860001536707, 0.18078534161878956, 0.1360798869571752, 0.08420169439994626, 0.1034053646457485, -0.055940960079638495, -0.13277190669129293, -0.3353121282915688, -0.17391236377854108, -0.2278852431470942, 0.07780904132420094, -0.04161184732543512, -0.09781842035965788, 0.36585312861638764, 0.250116255158662, 0.11873271110571093, 0.039319478190090094, 0.41525091075234943, 0.05210565189468778, 0.06704542689853245, 0.11369828656108844, 0.27104429110056827, 0.11691252360223896, 0.1001390228441192, -0.11635914919483993, 0.16161173375944296, -0.0520168408130606]
|
1,803.09485
|
Comparing the degrees of enumerability and the closed Medvedev degrees
|
We compare the degrees of enumerability and the closed Medvedev degrees and
find that many situations occur. There are nonzero closed degrees that do not
bound nonzero degrees of enumerability, there are nonzero degrees of
enumerability that do not bound nonzero closed degrees, and there are degrees
that are nontrivially both degrees of enumerability and closed degrees. We also
show that the compact degrees of enumerability exactly correspond to the
cototal enumeration degrees.
|
math.LO
|
we compare the degrees of enumerability and the closed medvedev degrees and find that many situations occur there are nonzero closed degrees that do not bound nonzero degrees of enumerability there are nonzero degrees of enumerability that do not bound nonzero closed degrees and there are degrees that are nontrivially both degrees of enumerability and closed degrees we also show that the compact degrees of enumerability exactly correspond to the cototal enumeration degrees
|
[['we', 'compare', 'the', 'degrees', 'of', 'enumerability', 'and', 'the', 'closed', 'medvedev', 'degrees', 'and', 'find', 'that', 'many', 'situations', 'occur', 'there', 'are', 'nonzero', 'closed', 'degrees', 'that', 'do', 'not', 'bound', 'nonzero', 'degrees', 'of', 'enumerability', 'there', 'are', 'nonzero', 'degrees', 'of', 'enumerability', 'that', 'do', 'not', 'bound', 'nonzero', 'closed', 'degrees', 'and', 'there', 'are', 'degrees', 'that', 'are', 'nontrivially', 'both', 'degrees', 'of', 'enumerability', 'and', 'closed', 'degrees', 'we', 'also', 'show', 'that', 'the', 'compact', 'degrees', 'of', 'enumerability', 'exactly', 'correspond', 'to', 'the', 'cototal', 'enumeration', 'degrees']]
|
[-0.3022906006096977, 0.2648693246843472, -0.03262446633195632, 0.011561246308153623, -0.06126884978315602, -0.13369074254615665, 0.03342474142268096, 0.3511282659123001, -0.21705113596295658, -0.26164111872650175, 0.05719284130234833, -0.27690618214746043, -0.14383902860014405, 0.14070552791953597, -0.05346117353653663, -0.11296663438416507, 0.06131564182777927, 0.10266751211378979, -0.08151893045080265, -0.3178644306345345, 0.27046922002344914, -0.08989773818278966, 0.16126816696806312, 0.09781942944909917, 0.18323231492931508, -0.015236320637472689, 0.05776604078391133, 0.07393302424007082, -0.17203817543924918, 0.09541157694622772, 0.25719578635610946, 0.14932612415199, 0.14323139767328355, -0.36861329608635135, -0.18884395439279814, 0.1951251285571656, 0.1256876228606864, 0.09561468780755181, 0.051904521576345786, -0.17038355404128358, 0.0895656253313263, -0.1398670237307271, -0.21664794848287758, -0.16224476567482296, 0.03777040092095937, 0.02810537456598592, -0.1874854440277774, 0.07921860189207396, 0.13071830811821025, 0.14467612243168157, 0.028559209676842168, -0.23489334841246065, -0.10596723234510586, 0.1284802275301557, 0.038810541470573376, -0.0009011072616973152, 0.042872702358418134, -0.1347574072392428, -0.10420397843859375, 0.3096595008487571, 0.018883515812762795, -0.28451316972097307, 0.22503562034299113, -0.1970801880098369, -0.14625799617002885, 0.19148658503051083, 0.12644839103091254, 0.15251292720794268, -0.07994222772396999, 0.14523018288987447, -0.14042966145932775, 0.16427999091883227, 0.12992997310596377, 0.16658262222724624, 0.22664371602339287, -0.09917439531841099, 0.08608567544294216, 0.08826506883543853, -0.005836966179617464, -0.16944948535361518, -0.390227786073946, -0.08762764259184111, -0.13296801991097323, 0.07201560193151299, -0.09544101190252535, -0.14636455062929898, 0.3586065776850263, 0.13328931720493592, 0.1401156165624318, 0.0597029926689112, 0.19692988054546184, 0.0378347509779827, 0.0989925708647256, 0.2037580039811461, 0.21296133513702717, 0.16324311445071682, -0.11728477098162554, -0.17831043003458683, -0.017646360115390527, -0.012354822854881417]
|
1,803.09486
|
Continuity properties of multilinear localization operators on
modulation spaces
|
We introduce multilinear localization operators in terms of the short-time
Fourier transform, and multilinear Weyl pseudodifferential operators. We prove
that such localization operators are in fact Weyl pseudodifferential operators
whose symbols are given by the convolution between the symbol of the
localization operator and the multilinear Wigner transform. For such
interpretation we use the kenrel theorem for the Gelfand-Shilov space.
Furthermore, we study the continuity properties of the multilinear localization
operators on modulation spaces. Our results extend some known results when
restricted to the linear case.
|
math.FA
|
we introduce multilinear localization operators in terms of the shorttime fourier transform and multilinear weyl pseudodifferential operators we prove that such localization operators are in fact weyl pseudodifferential operators whose symbols are given by the convolution between the symbol of the localization operator and the multilinear wigner transform for such interpretation we use the kenrel theorem for the gelfandshilov space furthermore we study the continuity properties of the multilinear localization operators on modulation spaces our results extend some known results when restricted to the linear case
|
[['we', 'introduce', 'multilinear', 'localization', 'operators', 'in', 'terms', 'of', 'the', 'shorttime', 'fourier', 'transform', 'and', 'multilinear', 'weyl', 'pseudodifferential', 'operators', 'we', 'prove', 'that', 'such', 'localization', 'operators', 'are', 'in', 'fact', 'weyl', 'pseudodifferential', 'operators', 'whose', 'symbols', 'are', 'given', 'by', 'the', 'convolution', 'between', 'the', 'symbol', 'of', 'the', 'localization', 'operator', 'and', 'the', 'multilinear', 'wigner', 'transform', 'for', 'such', 'interpretation', 'we', 'use', 'the', 'kenrel', 'theorem', 'for', 'the', 'gelfandshilov', 'space', 'furthermore', 'we', 'study', 'the', 'continuity', 'properties', 'of', 'the', 'multilinear', 'localization', 'operators', 'on', 'modulation', 'spaces', 'our', 'results', 'extend', 'some', 'known', 'results', 'when', 'restricted', 'to', 'the', 'linear', 'case']]
|
[-0.12437483616830672, 0.09311086429173455, -0.050674764236763994, 0.13039242492660003, -0.09588522140402347, -0.07193298611570807, -0.01822489663712023, 0.34492963648894254, -0.35448408959543004, -0.1262723129680928, 0.15388920306885506, -0.29620713875355087, -0.2528902869890718, 0.21787513326853514, -0.1025918417117175, 0.11204961400259944, 0.03787847095552613, 0.08376473878674648, -0.193464630680597, -0.22568053029861082, 0.45341381649760637, -0.038073589269290956, 0.2182740231099374, 0.03592956979923388, 0.04275231158141704, 0.09278807603918454, -0.0858709938605042, -0.10333303891512675, -0.08570010817981229, 0.1728136673788814, 0.2617264229366008, 0.054771472297280153, 0.23456879963769633, -0.41502177268266677, -0.18570756839916985, 0.15724136542446693, 0.1371124277000918, -0.012712855234413463, -0.012690747637466035, -0.3942735802135704, 0.09270833057954031, -0.14048573081107701, -0.10133036695256391, -0.16409892755396227, -0.010401816485340104, 0.05361719040254898, -0.3009549871196642, 0.09070000801345005, 0.17273606530883734, 0.06092934426577652, -0.1607229188303737, -0.08469393546966945, 0.05610692500794197, 0.09643398828920909, -0.012592750276877162, -0.027742603566387997, 0.05670637314016109, -0.05914070612805731, -0.14835111914093005, 0.2916776902973652, -0.07220074792447335, -0.2874515345429673, 0.12587362356922205, -0.2246010674547185, -0.1306092941804844, -0.012413500194602153, 0.11047674498575576, 0.1526682277867461, -0.10039777356723789, 0.18457172709544573, -0.07739770009511096, 0.09425168205052614, 0.10060281648355372, 0.1730077304165153, 0.03264653851784875, 0.04186483920442269, 0.16105923821382662, 0.15049825549016105, -0.04380601747235393, -0.036380273226292476, -0.35761440304272313, -0.1898360956515021, -0.2201220820493558, 0.03766442884636276, -0.13250316150233094, -0.20958969023297816, 0.45528644817908676, 0.1437962076078881, 0.17689847008270376, 0.14551626911715548, 0.20476495060412322, 0.22597408023635474, 0.1139890283894013, 0.038212358398253425, 0.14531864671426936, 0.20729402082643528, 0.12802628496223512, -0.17329813728437704, -0.01938350941876278, 0.27467075984048495]
|
1,803.09487
|
Lower bounds on the maximum delay margin by analytic interpolation
|
We study the delay margin problem in the context of recent works by T. Qi, J.
Zhu, and J. Chen, where a sufficient condition for the maximal delay margin is
formulated in terms of an interpolation problem obtained after introducing a
rational approximation. Instead we omit the approximation step and solve the
same problem directly using techniques from function theory and analytic
interpolation. Furthermore, we introduce a constant shift in the domain of the
interpolation problem. In this way we are able to improve on their lower bound
for the maximum delay margin.
|
math.OC cs.SY eess.SY
|
we study the delay margin problem in the context of recent works by t qi j zhu and j chen where a sufficient condition for the maximal delay margin is formulated in terms of an interpolation problem obtained after introducing a rational approximation instead we omit the approximation step and solve the same problem directly using techniques from function theory and analytic interpolation furthermore we introduce a constant shift in the domain of the interpolation problem in this way we are able to improve on their lower bound for the maximum delay margin
|
[['we', 'study', 'the', 'delay', 'margin', 'problem', 'in', 'the', 'context', 'of', 'recent', 'works', 'by', 't', 'qi', 'j', 'zhu', 'and', 'j', 'chen', 'where', 'a', 'sufficient', 'condition', 'for', 'the', 'maximal', 'delay', 'margin', 'is', 'formulated', 'in', 'terms', 'of', 'an', 'interpolation', 'problem', 'obtained', 'after', 'introducing', 'a', 'rational', 'approximation', 'instead', 'we', 'omit', 'the', 'approximation', 'step', 'and', 'solve', 'the', 'same', 'problem', 'directly', 'using', 'techniques', 'from', 'function', 'theory', 'and', 'analytic', 'interpolation', 'furthermore', 'we', 'introduce', 'a', 'constant', 'shift', 'in', 'the', 'domain', 'of', 'the', 'interpolation', 'problem', 'in', 'this', 'way', 'we', 'are', 'able', 'to', 'improve', 'on', 'their', 'lower', 'bound', 'for', 'the', 'maximum', 'delay', 'margin']]
|
[-0.11140373663135594, 0.018419822193688453, -0.058674630568793386, 0.056402389749994765, -0.08517857345061437, -0.11429046675743114, 0.12981610974392063, 0.35687169290438137, -0.3049076705850581, -0.3140438300587477, 0.09982126476042853, -0.2187542775145141, -0.17115443320794693, 0.1838585216732275, -0.13528148021789327, 0.11109793229248896, 0.04424892643201215, 0.008877345731341711, -0.09720768533166378, -0.29970689590329364, 0.31968282778517054, 0.03810778536623524, 0.23886498023558067, 0.09604889420061423, 0.10806656376989458, 0.04598567892186424, -0.04152586667357834, 0.039476469366921375, -0.17172670828163503, 0.1464879665053099, 0.2212046493390595, 0.13916221057235073, 0.306927034110632, -0.39936365825074016, -0.20778217742479937, 0.1254325287757061, 0.11393875218001545, 0.10362496126633418, -0.01512786843914098, -0.2450431801018215, 0.08641721174791855, -0.14480857825988241, -0.10582526669316795, -0.02773603322284837, 0.02207338982211646, 0.011768053917925285, -0.3283670986764714, 0.08559757531169922, 0.08723500558683368, 0.04738253287930963, -0.06505696595175772, -0.10417932031803855, 0.07005596561457521, 0.09766525707097463, -0.007530644858977006, 0.0755597002108291, 0.01720752600224949, -0.1265492281395822, -0.10199657326403966, 0.34871491533453747, -0.09836077939353442, -0.24689250555570408, 0.10190729335731556, -0.07108240224100569, -0.10054183082382967, 0.06004702391713777, 0.16522649903931924, 0.16993200269002612, -0.1129401497222403, 0.14447450706727744, -0.051486885610727534, 0.11529203335834687, 0.1451649587771665, -0.012719543130006842, 0.07279019573483095, 0.11944855377578767, 0.1399097726530125, 0.15572050785625813, -0.05137292096661704, -0.09060077660626942, -0.2971571741165012, -0.1161531793355431, -0.19301642087458443, -0.0009017627966660325, -0.06386234948204415, -0.09966515848082641, 0.3762843113753103, 0.1243195601673897, 0.24243496392442976, 0.09650285040298777, 0.28911668862346357, 0.20176885373857853, 0.00371461405521459, 0.0847782213065613, 0.22871225739964435, 0.12768211174175464, 0.10702891486086032, -0.22168148154898557, 0.06586706089181325, 0.16438287880612157]
|
1,803.09488
|
Solving linear parabolic rough partial differential equations
|
We study linear rough partial differential equations in the setting of [Friz
and Hairer, Springer, 2014, Chapter 12]. More precisely, we consider a linear
parabolic partial differential equation driven by a deterministic rough path
$\mathbf{W}$ of H\"older regularity $\alpha$ with $1/3 < \alpha
\le 1/2$. Based on a stochastic representation of the solution of the rough
partial differential equation, we propose a regression Monte Carlo algorithm
for spatio-temporal approximation of the solution. We provide a full
convergence analysis of the proposed approximation method which essentially
relies on the new bounds for the higher order derivatives of the solution in
space. Finally, a comprehensive simulation study showing the applicability of
the proposed algorithm is presented.
|
math.PR
|
we study linear rough partial differential equations in the setting of friz and hairer springer 2014 chapter 12 more precisely we consider a linear parabolic partial differential equation driven by a deterministic rough path mathbfw of holder regularity alpha with 13 alpha le 12 based on a stochastic representation of the solution of the rough partial differential equation we propose a regression monte carlo algorithm for spatiotemporal approximation of the solution we provide a full convergence analysis of the proposed approximation method which essentially relies on the new bounds for the higher order derivatives of the solution in space finally a comprehensive simulation study showing the applicability of the proposed algorithm is presented
|
[['we', 'study', 'linear', 'rough', 'partial', 'differential', 'equations', 'in', 'the', 'setting', 'of', 'friz', 'and', 'hairer', 'springer', '2014', 'chapter', '12', 'more', 'precisely', 'we', 'consider', 'a', 'linear', 'parabolic', 'partial', 'differential', 'equation', 'driven', 'by', 'a', 'deterministic', 'rough', 'path', 'mathbfw', 'of', 'holder', 'regularity', 'alpha', 'with', '13', 'alpha', 'le', '12', 'based', 'on', 'a', 'stochastic', 'representation', 'of', 'the', 'solution', 'of', 'the', 'rough', 'partial', 'differential', 'equation', 'we', 'propose', 'a', 'regression', 'monte', 'carlo', 'algorithm', 'for', 'spatiotemporal', 'approximation', 'of', 'the', 'solution', 'we', 'provide', 'a', 'full', 'convergence', 'analysis', 'of', 'the', 'proposed', 'approximation', 'method', 'which', 'essentially', 'relies', 'on', 'the', 'new', 'bounds', 'for', 'the', 'higher', 'order', 'derivatives', 'of', 'the', 'solution', 'in', 'space', 'finally', 'a', 'comprehensive', 'simulation', 'study', 'showing', 'the', 'applicability', 'of', 'the', 'proposed', 'algorithm', 'is', 'presented']]
|
[-0.10006083526125227, -0.0124453137076534, -0.1023397953805835, 0.06659124034716525, -0.1007429636928327, -0.09697472735151516, 0.035687484020218915, 0.31178740553755674, -0.2913477573774557, -0.2763096975838452, 0.12354164497011992, -0.27887639222847943, -0.1897465130396649, 0.2034701842575672, -0.055411048583785254, 0.13230045304625435, 0.0658621324588899, 0.001709162997570202, -0.10216373925105529, -0.26804934175215267, 0.3313539634351577, -0.004347085512853104, 0.21937273259777412, -0.01910843055662328, 0.20394645474719264, 0.041197283127534706, -0.09289704889998632, 0.015927985831590337, -0.24621598636813924, 0.15249845194341863, 0.2166211349576448, 0.06475321946055752, 0.3168371474469262, -0.38544916684648634, -0.17306684622689422, 0.04897576110618832, 0.10724610375396008, 0.0952776204269231, -0.06177032260964439, -0.2912550067314796, 0.08433578853841574, -0.148245089052789, -0.14847341742659137, -0.0687410476704054, -0.0021171690154392106, 0.0684443089443432, -0.32155086230321794, 0.0992467018808609, 0.09216383962471665, 0.0575863233524317, -0.07091882035334025, -0.1035208033904664, 0.0072451580966929946, -0.0017162491773477697, -0.03492518066247282, 0.0009949584532759886, 0.018057681912704644, -0.08171759690858621, -0.13644226205914356, 0.3186079276626748, -0.12322661856681817, -0.2562281306074784, 0.12825354311689405, -0.15669374591135213, -0.13402334281034248, 0.1671399419315456, 0.20903708321759396, 0.20445214678014142, -0.1638582031102439, 0.14121777031403776, -0.06939348355924661, 0.15956177603684168, 0.040035355992747095, -0.04956375894062551, 0.011926987002188014, 0.22311839801712638, 0.13425413547526732, 0.10685951505433273, -0.05000389190349497, -0.14896262811282568, -0.34379736163892444, -0.18791733879958633, -0.10715751553910365, 0.060530654415364614, -0.13414798504057385, -0.18432549864313344, 0.36662488956152733, 0.16365324377609763, 0.15567890094774486, 0.10345590060094652, 0.25214809072162725, 0.19994491079113388, -0.07467803551889626, 0.07261408427271752, 0.17772993569847492, 0.1784778871837245, 0.12892630049315965, -0.19861264448134905, 0.053827211429752345, 0.16396393371020665]
|
1,803.09489
|
Genome packaging within icosahedral capsids and large-scale segmentation
in viral genomic sequences
|
The assembly and maturation of viruses with icosahedral capsids must be
coordinated with icosahedral symmetry. The icosahedral symmetry imposes also
the restrictions on the cooperative specific interactions between genomic
RNA/DNA and coat proteins that should be reflected in quasi-regular
segmentation of viral genomic sequences. Combining discrete direct and double
Fourier transforms, we studied the quasi-regular large-scale segmentation in
genomic sequences of different ssRNA, ssDNA, and dsDNA viruses. The particular
representatives included satellite tobacco mosaic virus and the strains of
satellite tobacco necrosis virus, STNV-C, STNV-1, STNV-2, Escherichia phages
MS2, phiX174, alpha3, and HK97, and Simian virus 40. In all their genomes, we
found the significant quasi-regular segmentation of genomic sequences related
to the virion assembly and the genome packaging within icosahedral capsid. We
also found good correspondence between our results and available cryo-electron
microscopy data on capsid structures and genome packaging in these viruses.
Fourier analysis of genomic sequences provides the additional insight into
mechanisms of hierarchical genome packaging and may be used for verification of
the concepts of 3-fold or 5-fold intermediates in virion assembly. The results
of sequence analysis should be taken into account at the choice of models and
data interpretation. They also may be helpful for the development of antiviral
drugs.
|
q-bio.QM q-bio.BM
|
the assembly and maturation of viruses with icosahedral capsids must be coordinated with icosahedral symmetry the icosahedral symmetry imposes also the restrictions on the cooperative specific interactions between genomic rnadna and coat proteins that should be reflected in quasiregular segmentation of viral genomic sequences combining discrete direct and double fourier transforms we studied the quasiregular largescale segmentation in genomic sequences of different ssrna ssdna and dsdna viruses the particular representatives included satellite tobacco mosaic virus and the strains of satellite tobacco necrosis virus stnvc stnv1 stnv2 escherichia phages ms2 phix174 alpha3 and hk97 and simian virus 40 in all their genomes we found the significant quasiregular segmentation of genomic sequences related to the virion assembly and the genome packaging within icosahedral capsid we also found good correspondence between our results and available cryoelectron microscopy data on capsid structures and genome packaging in these viruses fourier analysis of genomic sequences provides the additional insight into mechanisms of hierarchical genome packaging and may be used for verification of the concepts of 3fold or 5fold intermediates in virion assembly the results of sequence analysis should be taken into account at the choice of models and data interpretation they also may be helpful for the development of antiviral drugs
|
[['the', 'assembly', 'and', 'maturation', 'of', 'viruses', 'with', 'icosahedral', 'capsids', 'must', 'be', 'coordinated', 'with', 'icosahedral', 'symmetry', 'the', 'icosahedral', 'symmetry', 'imposes', 'also', 'the', 'restrictions', 'on', 'the', 'cooperative', 'specific', 'interactions', 'between', 'genomic', 'rnadna', 'and', 'coat', 'proteins', 'that', 'should', 'be', 'reflected', 'in', 'quasiregular', 'segmentation', 'of', 'viral', 'genomic', 'sequences', 'combining', 'discrete', 'direct', 'and', 'double', 'fourier', 'transforms', 'we', 'studied', 'the', 'quasiregular', 'largescale', 'segmentation', 'in', 'genomic', 'sequences', 'of', 'different', 'ssrna', 'ssdna', 'and', 'dsdna', 'viruses', 'the', 'particular', 'representatives', 'included', 'satellite', 'tobacco', 'mosaic', 'virus', 'and', 'the', 'strains', 'of', 'satellite', 'tobacco', 'necrosis', 'virus', 'stnvc', 'stnv1', 'stnv2', 'escherichia', 'phages', 'ms2', 'phix174', 'alpha3', 'and', 'hk97', 'and', 'simian', 'virus', '40', 'in', 'all', 'their', 'genomes', 'we', 'found', 'the', 'significant', 'quasiregular', 'segmentation', 'of', 'genomic', 'sequences', 'related', 'to', 'the', 'virion', 'assembly', 'and', 'the', 'genome', 'packaging', 'within', 'icosahedral', 'capsid', 'we', 'also', 'found', 'good', 'correspondence', 'between', 'our', 'results', 'and', 'available', 'cryoelectron', 'microscopy', 'data', 'on', 'capsid', 'structures', 'and', 'genome', 'packaging', 'in', 'these', 'viruses', 'fourier', 'analysis', 'of', 'genomic', 'sequences', 'provides', 'the', 'additional', 'insight', 'into', 'mechanisms', 'of', 'hierarchical', 'genome', 'packaging', 'and', 'may', 'be', 'used', 'for', 'verification', 'of', 'the', 'concepts', 'of', '3fold', 'or', '5fold', 'intermediates', 'in', 'virion', 'assembly', 'the', 'results', 'of', 'sequence', 'analysis', 'should', 'be', 'taken', 'into', 'account', 'at', 'the', 'choice', 'of', 'models', 'and', 'data', 'interpretation', 'they', 'also', 'may', 'be', 'helpful', 'for', 'the', 'development', 'of', 'antiviral', 'drugs']]
|
[-0.11386149300038723, 0.12191862629330026, -0.05082068668873197, 0.10662331544831026, -0.03616816664372783, -0.13299899659376582, 0.030030149081549006, 0.4137900179565543, -0.26983509330300265, -0.2688074945204195, 0.08837618183351519, -0.2668640368101118, -0.24228843136593736, 0.1501513537063291, -0.09166515910523104, -0.01182230697578225, 0.12664282853752007, -0.03158077094150652, 0.07187847919142021, -0.2411049334078769, 0.19691763329204393, 0.08193315167699268, 0.2732639675256842, 0.023948020908041018, 0.06995389302547025, 0.007973925780365473, -0.04130507054932342, -0.02221595188418385, -0.22154704143776874, 0.1544441128516164, 0.31263271429297407, 0.17953190073315609, 0.22571494884899643, -0.4823342770854435, -0.16648862158215724, 0.10340402387935521, 0.21545258357470837, 0.15670822308477161, -0.08779049562267258, -0.3015734201607221, 0.0969982448628744, -0.10803799269810817, -0.05638658313431067, -0.08417158544243378, -0.003628621580388102, 0.04981330671998336, -0.20749578567101887, 0.11941151995076982, 0.016460417981932658, 0.13604504094542105, -0.12844687306303715, -0.13018375257200718, -0.13144927619527658, 0.22071742787980245, 0.0970353129680619, -0.006716009789598312, 0.23506433840859497, -0.07542968579996746, -0.11055469251984712, 0.3786664561271704, 0.060236484078588975, -0.14743146581326308, 0.18454129645245906, -0.11124263906224381, -0.2156395168587713, 0.18067644377202163, 0.1252527266255543, 0.043625472851171354, -0.17525164237116822, 0.01935075569406871, 0.04075716600417952, 0.22674556141131383, 0.16097811920254831, -0.03878696345825597, 0.2035412793168752, 0.21087490097218478, -0.010492075112184952, 0.12089384820296124, -0.11343570484717533, -0.07376085644320465, -0.164351175767992, -0.19938040326930362, -0.08379584225298062, 0.0032013405568547325, -0.1415649467168922, -0.1952701204474831, 0.3661597385578374, 0.017048963820541597, 0.13336129474746394, 0.05736744440723174, 0.20218734229490679, -0.12678608366710106, 0.1786935579395936, -0.10287132849086925, 0.0836229658579583, 0.049869144286978806, 0.0473042588639488, -0.24342065003451588, 0.10506237225404175, 0.021075022020169747]
|
1,803.0949
|
Unsupervised Learning and Segmentation of Complex Activities from Video
|
This paper presents a new method for unsupervised segmentation of complex
activities from video into multiple steps, or sub-activities, without any
textual input. We propose an iterative discriminative-generative approach which
alternates between discriminatively learning the appearance of sub-activities
from the videos' visual features to sub-activity labels and generatively
modelling the temporal structure of sub-activities using a Generalized Mallows
Model. In addition, we introduce a model for background to account for frames
unrelated to the actual activities. Our approach is validated on the
challenging Breakfast Actions and Inria Instructional Videos datasets and
outperforms both unsupervised and weakly-supervised state of the art.
|
cs.CV
|
this paper presents a new method for unsupervised segmentation of complex activities from video into multiple steps or subactivities without any textual input we propose an iterative discriminativegenerative approach which alternates between discriminatively learning the appearance of subactivities from the videos visual features to subactivity labels and generatively modelling the temporal structure of subactivities using a generalized mallows model in addition we introduce a model for background to account for frames unrelated to the actual activities our approach is validated on the challenging breakfast actions and inria instructional videos datasets and outperforms both unsupervised and weaklysupervised state of the art
|
[['this', 'paper', 'presents', 'a', 'new', 'method', 'for', 'unsupervised', 'segmentation', 'of', 'complex', 'activities', 'from', 'video', 'into', 'multiple', 'steps', 'or', 'subactivities', 'without', 'any', 'textual', 'input', 'we', 'propose', 'an', 'iterative', 'discriminativegenerative', 'approach', 'which', 'alternates', 'between', 'discriminatively', 'learning', 'the', 'appearance', 'of', 'subactivities', 'from', 'the', 'videos', 'visual', 'features', 'to', 'subactivity', 'labels', 'and', 'generatively', 'modelling', 'the', 'temporal', 'structure', 'of', 'subactivities', 'using', 'a', 'generalized', 'mallows', 'model', 'in', 'addition', 'we', 'introduce', 'a', 'model', 'for', 'background', 'to', 'account', 'for', 'frames', 'unrelated', 'to', 'the', 'actual', 'activities', 'our', 'approach', 'is', 'validated', 'on', 'the', 'challenging', 'breakfast', 'actions', 'and', 'inria', 'instructional', 'videos', 'datasets', 'and', 'outperforms', 'both', 'unsupervised', 'and', 'weaklysupervised', 'state', 'of', 'the', 'art']]
|
[-0.019807030223309995, -0.0007029422825144138, -0.09310184885489889, 0.056495596980676056, -0.14097330174874514, -0.1439926779596135, 0.03226636288804002, 0.466547141559422, -0.24475504256784916, -0.3393632200174034, 0.018089765630429612, -0.27844442875590175, -0.1950992793275509, 0.13848447474883868, -0.15413911189418286, 0.03327370037208311, 0.14520763741631526, 0.06949900021776557, -0.05970031070522964, -0.23098329935921355, 0.32317187916487455, -0.011387961796717718, 0.337424822114408, -0.013572916681878268, 0.20653750439174473, 0.005564837194979191, -0.08341692558140494, -0.011360242273658514, -0.03148164995014668, 0.19279308134457096, 0.3266339940833859, 0.23694101418732316, 0.2978255040035583, -0.40448134431615473, -0.23834788508946075, 0.06041549504734576, 0.12909982630982994, 0.10698976799161755, -0.03309507931699045, -0.4397748443298042, 0.07543633388821036, -0.14965670896694064, 0.08315801050281152, -0.14199225711403415, -0.025285460222512483, -0.04976809521205723, -0.31337806065392215, 0.07209355417173356, 0.0833356924940017, 0.0838498371001333, -0.11986511284019798, -0.1000418309099041, 0.05770639525959268, 0.20692992815515027, 0.037866912065073845, 0.04676498395390809, 0.09459764379775151, -0.20350283752428366, -0.17601117267273367, 0.37913263590075075, -0.051272025788202884, -0.19980432374752127, 0.20622647872194647, 0.018470806037075817, -0.14746765876421705, 0.1045965976268053, 0.24641379861161114, 0.16721565895248205, -0.16803746701043565, -0.022095659871120006, -0.058876838689902795, 0.2001808014512062, 0.03333669165149331, -0.047252334062941374, 0.19402338190586307, 0.26456751172430815, -0.03169407680921722, 0.14820212726132012, -0.14799509025877342, -0.05994206184055656, -0.22228186714986806, -0.10469929320272059, -0.14943684486672282, -0.06133686519227922, -0.11931898431794252, -0.15018619261682034, 0.43449952305294576, 0.24860103769693523, 0.2160298664867878, 0.10576383134233765, 0.3644479088950902, -0.026447769085643814, 0.060083788007032124, 0.07902486071456223, 0.090659473054111, -0.035442900294438, 0.12454742127563805, -0.18315767710912043, 0.06823399061104282, 0.10915348538808757]
|
1,803.09491
|
The decisive future of inflation
|
How much more will we learn about single-field inflationary models in the
future? We address this question in the context of Bayesian design and
information theory. We develop a novel method to compute the expected utility
of deciding between models and apply it to a set of futuristic measurements.
This necessarily requires one to evaluate the Bayesian evidence many thousands
of times over, which is numerically challenging. We show how this can be done
using a number of simplifying assumptions and discuss their validity. We also
modify the form of the expected utility, as previously introduced in the
literature in different contexts, in order to partition each possible future
into either the rejection of models at the level of the maximum likelihood or
the decision between models using Bayesian model comparison. We then quantify
the ability of future experiments to constrain the reheating temperature and
the scalar running. Our approach allows us to discuss possible strategies for
maximising information from future cosmological surveys. In particular, our
conclusions suggest that, in the context of inflationary model selection, a
decrease in the measurement uncertainty of the scalar spectral index would be
more decisive than a decrease in the uncertainty in the tensor-to-scalar ratio.
We have incorporated our approach into a publicly available python class, foxi
(https://sites.google.com/view/foxicode), that can be readily applied to any
survey optimisation problem.
|
astro-ph.CO hep-th
|
how much more will we learn about singlefield inflationary models in the future we address this question in the context of bayesian design and information theory we develop a novel method to compute the expected utility of deciding between models and apply it to a set of futuristic measurements this necessarily requires one to evaluate the bayesian evidence many thousands of times over which is numerically challenging we show how this can be done using a number of simplifying assumptions and discuss their validity we also modify the form of the expected utility as previously introduced in the literature in different contexts in order to partition each possible future into either the rejection of models at the level of the maximum likelihood or the decision between models using bayesian model comparison we then quantify the ability of future experiments to constrain the reheating temperature and the scalar running our approach allows us to discuss possible strategies for maximising information from future cosmological surveys in particular our conclusions suggest that in the context of inflationary model selection a decrease in the measurement uncertainty of the scalar spectral index would be more decisive than a decrease in the uncertainty in the tensortoscalar ratio we have incorporated our approach into a publicly available python class foxi httpssitesgooglecomviewfoxicode that can be readily applied to any survey optimisation problem
|
[['how', 'much', 'more', 'will', 'we', 'learn', 'about', 'singlefield', 'inflationary', 'models', 'in', 'the', 'future', 'we', 'address', 'this', 'question', 'in', 'the', 'context', 'of', 'bayesian', 'design', 'and', 'information', 'theory', 'we', 'develop', 'a', 'novel', 'method', 'to', 'compute', 'the', 'expected', 'utility', 'of', 'deciding', 'between', 'models', 'and', 'apply', 'it', 'to', 'a', 'set', 'of', 'futuristic', 'measurements', 'this', 'necessarily', 'requires', 'one', 'to', 'evaluate', 'the', 'bayesian', 'evidence', 'many', 'thousands', 'of', 'times', 'over', 'which', 'is', 'numerically', 'challenging', 'we', 'show', 'how', 'this', 'can', 'be', 'done', 'using', 'a', 'number', 'of', 'simplifying', 'assumptions', 'and', 'discuss', 'their', 'validity', 'we', 'also', 'modify', 'the', 'form', 'of', 'the', 'expected', 'utility', 'as', 'previously', 'introduced', 'in', 'the', 'literature', 'in', 'different', 'contexts', 'in', 'order', 'to', 'partition', 'each', 'possible', 'future', 'into', 'either', 'the', 'rejection', 'of', 'models', 'at', 'the', 'level', 'of', 'the', 'maximum', 'likelihood', 'or', 'the', 'decision', 'between', 'models', 'using', 'bayesian', 'model', 'comparison', 'we', 'then', 'quantify', 'the', 'ability', 'of', 'future', 'experiments', 'to', 'constrain', 'the', 'reheating', 'temperature', 'and', 'the', 'scalar', 'running', 'our', 'approach', 'allows', 'us', 'to', 'discuss', 'possible', 'strategies', 'for', 'maximising', 'information', 'from', 'future', 'cosmological', 'surveys', 'in', 'particular', 'our', 'conclusions', 'suggest', 'that', 'in', 'the', 'context', 'of', 'inflationary', 'model', 'selection', 'a', 'decrease', 'in', 'the', 'measurement', 'uncertainty', 'of', 'the', 'scalar', 'spectral', 'index', 'would', 'be', 'more', 'decisive', 'than', 'a', 'decrease', 'in', 'the', 'uncertainty', 'in', 'the', 'tensortoscalar', 'ratio', 'we', 'have', 'incorporated', 'our', 'approach', 'into', 'a', 'publicly', 'available', 'python', 'class', 'foxi', 'httpssitesgooglecomviewfoxicode', 'that', 'can', 'be', 'readily', 'applied', 'to', 'any', 'survey', 'optimisation', 'problem']]
|
[-0.043825366764501376, 0.047393616709463834, -0.10251709096697956, 0.10549174859251424, -0.1161166205163206, -0.12255604485855312, 0.056255082586708874, 0.38340417555373935, -0.2548854129099463, -0.3436124551147726, 0.10645647756629498, -0.2344260265986327, -0.13774137132222186, 0.20721056595809656, -0.052930512920710014, 0.04520110663672624, 0.06197071187135235, 0.020343901333608874, -0.06739304449906372, -0.275313159862013, 0.2859789004469676, 0.10137862417855309, 0.25795721821906464, 0.05245170049654605, 0.045844048440984976, -0.009112424744442021, -0.04754960298462695, 0.03906510521548691, -0.1594154213748265, 0.1474855610181007, 0.2617300155451065, 0.21709320293152118, 0.30155448121991985, -0.4115922280234864, -0.23044108744156924, 0.16653285171366758, 0.14281233332931642, 0.13369898377290532, 0.006050315745219983, -0.2557034235330181, 0.07566537408051731, -0.19592991196731344, -0.09415404727422372, -0.09575888547031125, -0.04050860826140018, -0.03754976732385773, -0.28680741070635485, 0.04322597632294223, 0.003486649582145719, -0.005676691857195954, -0.042640200128353005, -0.10988807577539135, -0.0030103361124995055, 0.11347169876581074, 0.06087345543720231, 0.002532282529156529, 0.11585537763731973, -0.13904581433667476, -0.1296292820070694, 0.38102085499076155, -0.09672097769453922, -0.19986740871005365, 0.1503928766485203, -0.12136568418108262, -0.17823939332696567, 0.06256144491563392, 0.22406179650250385, 0.12298441123687201, -0.15067016381376028, 0.0505291582263486, -0.005245737264746682, 0.1880168594264736, 0.03850988335991362, 0.010616391513345612, 0.2590501894146573, 0.18405671316924765, 0.0516038578816979, 0.14274939275944504, -0.08629923625975042, -0.0862283984598754, -0.30996269490653733, -0.14035215518680644, -0.1466725131487348, 0.03235250265287185, -0.11132992267255201, -0.1079604701369897, 0.3993311574344884, 0.29181613831420067, 0.1921018708973435, 0.07616001922377125, 0.29766841904104996, 0.0947968858622066, 0.06587661829512767, 0.04618230935916103, 0.26022008427855065, 0.08193547127617372, 0.08161908865073561, -0.18686647876270687, 0.07694846024078124, -0.018329111846616945]
|
1,803.09492
|
Latency and Throughput Characterization of Convolutional Neural Networks
for Mobile Computer Vision
|
We study performance characteristics of convolutional neural networks (CNN)
for mobile computer vision systems. CNNs have proven to be a powerful and
efficient approach to implement such systems. However, the system performance
depends largely on the utilization of hardware accelerators, which are able to
speed up the execution of the underlying mathematical operations tremendously
through massive parallelism. Our contribution is performance characterization
of multiple CNN-based models for object recognition and detection with several
different hardware platforms and software frameworks, using both local
(on-device) and remote (network-side server) computation. The measurements are
conducted using real workloads and real processing platforms. On the platform
side, we concentrate especially on TensorFlow and TensorRT. Our measurements
include embedded processors found on mobile devices and high-performance
processors that can be used on the network side of mobile systems. We show that
there exists significant latency--throughput trade-offs but the behavior is
very complex. We demonstrate and discuss several factors that affect the
performance and yield this complex behavior.
|
cs.CV
|
we study performance characteristics of convolutional neural networks cnn for mobile computer vision systems cnns have proven to be a powerful and efficient approach to implement such systems however the system performance depends largely on the utilization of hardware accelerators which are able to speed up the execution of the underlying mathematical operations tremendously through massive parallelism our contribution is performance characterization of multiple cnnbased models for object recognition and detection with several different hardware platforms and software frameworks using both local ondevice and remote networkside server computation the measurements are conducted using real workloads and real processing platforms on the platform side we concentrate especially on tensorflow and tensorrt our measurements include embedded processors found on mobile devices and highperformance processors that can be used on the network side of mobile systems we show that there exists significant latencythroughput tradeoffs but the behavior is very complex we demonstrate and discuss several factors that affect the performance and yield this complex behavior
|
[['we', 'study', 'performance', 'characteristics', 'of', 'convolutional', 'neural', 'networks', 'cnn', 'for', 'mobile', 'computer', 'vision', 'systems', 'cnns', 'have', 'proven', 'to', 'be', 'a', 'powerful', 'and', 'efficient', 'approach', 'to', 'implement', 'such', 'systems', 'however', 'the', 'system', 'performance', 'depends', 'largely', 'on', 'the', 'utilization', 'of', 'hardware', 'accelerators', 'which', 'are', 'able', 'to', 'speed', 'up', 'the', 'execution', 'of', 'the', 'underlying', 'mathematical', 'operations', 'tremendously', 'through', 'massive', 'parallelism', 'our', 'contribution', 'is', 'performance', 'characterization', 'of', 'multiple', 'cnnbased', 'models', 'for', 'object', 'recognition', 'and', 'detection', 'with', 'several', 'different', 'hardware', 'platforms', 'and', 'software', 'frameworks', 'using', 'both', 'local', 'ondevice', 'and', 'remote', 'networkside', 'server', 'computation', 'the', 'measurements', 'are', 'conducted', 'using', 'real', 'workloads', 'and', 'real', 'processing', 'platforms', 'on', 'the', 'platform', 'side', 'we', 'concentrate', 'especially', 'on', 'tensorflow', 'and', 'tensorrt', 'our', 'measurements', 'include', 'embedded', 'processors', 'found', 'on', 'mobile', 'devices', 'and', 'highperformance', 'processors', 'that', 'can', 'be', 'used', 'on', 'the', 'network', 'side', 'of', 'mobile', 'systems', 'we', 'show', 'that', 'there', 'exists', 'significant', 'latencythroughput', 'tradeoffs', 'but', 'the', 'behavior', 'is', 'very', 'complex', 'we', 'demonstrate', 'and', 'discuss', 'several', 'factors', 'that', 'affect', 'the', 'performance', 'and', 'yield', 'this', 'complex', 'behavior']]
|
[-0.16792989295063307, -0.010121745138894767, -0.060484698248910715, 0.014213704229041469, -0.06643699630221818, -0.21063162365171592, 0.006015226506860927, 0.4652780540112872, -0.25184798750269694, -0.35157629146706315, 0.12714109645457938, -0.2557822353905067, -0.21055982225807385, 0.3088032957399264, -0.08442511905141145, 0.10456054876485724, 0.1578377329329669, 0.026667212850588838, -0.04879341208288679, -0.30031116598984225, 0.2609918776914128, 0.05120821104501374, 0.3581556219782215, 0.08330427826440427, 0.06407633816124872, -0.05820702366909245, -0.000660888763377443, -0.023138748104247497, -0.03272680220975417, 0.17976733158284333, 0.28097019882800395, 0.1990352110733511, 0.2688262150521041, -0.49267540462315085, -0.20196912150549906, 0.0731064316467382, 0.14971299631724833, 0.04490832726223744, -0.07359886105623445, -0.30352764429990203, 0.11220150457520503, -0.1955128399305977, -0.009177865920446494, -0.1448543622798752, -0.013575828858301974, 0.025174816905200716, -0.21324597202037693, -0.04523821598268114, 0.0048263265744026285, 0.07570669983251718, 0.0003005038236551627, -0.10264307288089185, 0.0517455733512179, 0.19511038846685552, -0.007480739781749434, -0.01188342447130708, 0.21180575650942046, -0.17425211920490255, -0.17131425017141738, 0.3884513455326669, -0.0028812872740672903, -0.19829956483008573, 0.27713219232828123, -0.03517064158659196, -0.17454218173224945, 0.05607283329009079, 0.292534639762016, 0.08647100130910985, -0.15070217719185167, 0.06512983649408852, 0.04719935427128803, 0.2046598245986388, 0.01819214824354276, 0.07018803389219101, 0.19959994664532132, 0.2622733746218728, 0.03436701168102445, 0.11954705112220836, -0.09247295274253702, -0.09008088906412012, -0.1696337304671033, -0.15781974363781046, -0.1844745450958726, -0.0014355395920119917, -0.08898743860399919, -0.1421781388693489, 0.3701318176288623, 0.21942526768398238, 0.14776629284169757, 0.09275220323106623, 0.39584431629264144, 0.0466525616702711, 0.1624184074709774, 0.15640140702016653, 0.18228872490217327, 0.024610215280699777, 0.16585168289602734, -0.1924301774270134, 0.07498166227596811, -0.038552836495546215]
|
1,803.09493
|
Manipulability Maximization Using Continuous-Time Gaussian Processes
|
A significant challenge in motion planning is to avoid being in or near
\emph{singular configurations} (\textit{singularities}), that is, joint
configurations that result in the loss of the ability to move in certain
directions in task space. A robotic system's capacity for motion is reduced
even in regions that are in close proximity to (i.e., neighbouring) a
singularity. In this work we examine singularity avoidance in a motion planning
context, finding trajectories which minimize proximity to singular regions,
subject to constraints. We define a manipulability-based likelihood associated
with singularity avoidance over a continuous trajectory representation, which
we then maximize using a \textit{maximum a posteriori} (MAP) estimator. Viewing
the MAP problem as inference on a factor graph, we use gradient information
from interpolated states to maximize the trajectory's overall manipulability.
Both qualitative and quantitative analyses of experimental data show increases
in manipulability that result in smooth trajectories with visibly more
dexterous arm configurations.
|
cs.RO
|
a significant challenge in motion planning is to avoid being in or near emphsingular configurations textitsingularities that is joint configurations that result in the loss of the ability to move in certain directions in task space a robotic systems capacity for motion is reduced even in regions that are in close proximity to ie neighbouring a singularity in this work we examine singularity avoidance in a motion planning context finding trajectories which minimize proximity to singular regions subject to constraints we define a manipulabilitybased likelihood associated with singularity avoidance over a continuous trajectory representation which we then maximize using a textitmaximum a posteriori map estimator viewing the map problem as inference on a factor graph we use gradient information from interpolated states to maximize the trajectorys overall manipulability both qualitative and quantitative analyses of experimental data show increases in manipulability that result in smooth trajectories with visibly more dexterous arm configurations
|
[['a', 'significant', 'challenge', 'in', 'motion', 'planning', 'is', 'to', 'avoid', 'being', 'in', 'or', 'near', 'emphsingular', 'configurations', 'textitsingularities', 'that', 'is', 'joint', 'configurations', 'that', 'result', 'in', 'the', 'loss', 'of', 'the', 'ability', 'to', 'move', 'in', 'certain', 'directions', 'in', 'task', 'space', 'a', 'robotic', 'systems', 'capacity', 'for', 'motion', 'is', 'reduced', 'even', 'in', 'regions', 'that', 'are', 'in', 'close', 'proximity', 'to', 'ie', 'neighbouring', 'a', 'singularity', 'in', 'this', 'work', 'we', 'examine', 'singularity', 'avoidance', 'in', 'a', 'motion', 'planning', 'context', 'finding', 'trajectories', 'which', 'minimize', 'proximity', 'to', 'singular', 'regions', 'subject', 'to', 'constraints', 'we', 'define', 'a', 'manipulabilitybased', 'likelihood', 'associated', 'with', 'singularity', 'avoidance', 'over', 'a', 'continuous', 'trajectory', 'representation', 'which', 'we', 'then', 'maximize', 'using', 'a', 'textitmaximum', 'a', 'posteriori', 'map', 'estimator', 'viewing', 'the', 'map', 'problem', 'as', 'inference', 'on', 'a', 'factor', 'graph', 'we', 'use', 'gradient', 'information', 'from', 'interpolated', 'states', 'to', 'maximize', 'the', 'trajectorys', 'overall', 'manipulability', 'both', 'qualitative', 'and', 'quantitative', 'analyses', 'of', 'experimental', 'data', 'show', 'increases', 'in', 'manipulability', 'that', 'result', 'in', 'smooth', 'trajectories', 'with', 'visibly', 'more', 'dexterous', 'arm', 'configurations']]
|
[-0.13437739501147838, 0.016452736552529688, -0.10805853051383474, 0.0558512812345945, -0.0974010299616212, -0.10829908637042414, 0.06991180836304323, 0.417350710888437, -0.2913644908389839, -0.2926335407971036, 0.08558081034586558, -0.2893448369796294, -0.15955575948093562, 0.15962246721672932, -0.15982904637329307, 0.05931431183516479, 0.11749174636741788, 0.05285208954338309, -0.07467971320714077, -0.190880490571062, 0.2983949753243301, 0.04422161754708262, 0.26981661760642023, 0.0027307377340609596, 0.09476453009383415, 0.032222765810387646, 0.029832903792278452, 0.06616176644808162, -0.12667977876415096, 0.1068610368369166, 0.28797850626420807, 0.1402333737757282, 0.304118466719785, -0.3834446331207959, -0.19953505903319924, 0.14137011344525838, 0.14817893672726687, 0.09048650267333942, -0.015158013012217227, -0.2877030133225974, 0.08649323973804712, -0.14156863926566088, -0.11182394705950313, -0.050977653430012246, 0.006757315910802591, 0.003561521550615462, -0.28625255379350795, 0.042166350903177025, 0.03209340167169353, 0.04702978671197123, -0.08246386953904575, -0.024208163455028662, -0.011934123727049203, 0.1411157301002051, 0.021900888463644772, 0.08731689080111557, 0.13467328602935644, -0.17705135761710172, -0.1290111116964945, 0.3681118973240181, -0.02849654310645423, -0.2577475865165259, 0.1654103591994401, -0.13317906809345686, -0.13549338651906181, 0.14240856437425084, 0.2239330153437269, 0.12953068887902386, -0.13538733466009564, 0.024337988215164225, -0.011301136378748905, 0.11856895307744635, 0.08732193711857568, -0.007697295034991815, 0.21183608323585668, 0.16544846629086357, 0.17466421145633262, 0.1511781214698899, -0.0907800510645244, -0.14865744677559792, -0.27994298599910417, -0.1214528255752169, -0.1475222154251681, -0.010877257406761582, -0.07027012814879777, -0.15217254724003523, 0.3385310276323967, 0.1731979536242633, 0.2682105698403996, 0.07083122866015706, 0.3119346735133296, 0.07376649274452489, 0.054838696732217036, 0.07030749450642428, 0.21640987144845644, 0.04372533965127655, 0.06167546539464278, -0.21625649074605047, 0.07112880579302175, 0.04068024690269224]
|
1,803.09494
|
Equation of state of boron subarsenide B12As2 to 47 GPa
|
Compressibility of boron subarsenide B12As2 has been studied by synchrotron
X-ray diffraction up to 47 GPa at room temperature in a diamond anvil cell
using Ne pressure transmitting medium. A fit of experimental p-V data by Vinet
equation of state yielded the bulk modulus of 150(4) GPa and its first pressure
derivative of 6.4(3). No pressure-induced phase transitions have been observed.
|
cond-mat.mtrl-sci
|
compressibility of boron subarsenide b12as2 has been studied by synchrotron xray diffraction up to 47 gpa at room temperature in a diamond anvil cell using ne pressure transmitting medium a fit of experimental pv data by vinet equation of state yielded the bulk modulus of 1504 gpa and its first pressure derivative of 643 no pressureinduced phase transitions have been observed
|
[['compressibility', 'of', 'boron', 'subarsenide', 'b12as2', 'has', 'been', 'studied', 'by', 'synchrotron', 'xray', 'diffraction', 'up', 'to', '47', 'gpa', 'at', 'room', 'temperature', 'in', 'a', 'diamond', 'anvil', 'cell', 'using', 'ne', 'pressure', 'transmitting', 'medium', 'a', 'fit', 'of', 'experimental', 'pv', 'data', 'by', 'vinet', 'equation', 'of', 'state', 'yielded', 'the', 'bulk', 'modulus', 'of', '1504', 'gpa', 'and', 'its', 'first', 'pressure', 'derivative', 'of', '643', 'no', 'pressureinduced', 'phase', 'transitions', 'have', 'been', 'observed']]
|
[-0.07291444500718834, 0.17991530633200023, -0.09255924367669464, -0.12019609539943227, -0.00976723047383761, -0.121730453674129, 0.18718674449818368, 0.4628115420750642, -0.248917008544934, -0.3036363931625324, 0.0385002837244074, -0.3777929142243781, -0.007090687171666552, 0.12574427011343886, 0.06368872465272789, 0.1108567830938767, -0.05781204509154215, 0.014483212944222772, -0.09441672816430613, -0.21680390121320547, 0.18743117787417465, 0.07207143351325165, 0.3178918188461497, 0.0816948137688056, 0.10078971067609234, -0.12527041190098656, 0.09650191217976606, 0.05807863783596431, -0.15448863623600642, -0.04777661070101342, 0.2676066406805195, -0.03507351022118987, 0.1704472960446472, -0.39949694585244533, -0.32238512724574847, 0.03508331075752691, 0.04490935518327406, 0.03000445297714007, -0.09967797392213686, -0.2242103570093543, 0.08991205117712586, -0.15424618890540578, -0.15290003322001736, -0.09769798246196519, -0.0007082478506332737, -0.04063834706163508, -0.19971798147248515, 0.18834810765554844, -0.045606625530774055, 0.17202608421508034, -0.2107515580245783, -0.22165028561474914, -0.05839423952876764, -0.03297458988440744, -0.017817761970020957, 0.09292507811323188, 0.18268476266382358, -0.06603410323860787, -0.11671294761284934, 0.43953813366213085, -0.0074614855634459, 0.10880773293517404, 0.11470539284617466, -0.2104335078689412, -0.09315842767324993, 0.3041794006570607, 0.08576503533364857, 0.032132169097598834, -0.20191503973614613, 0.08904121137299117, 0.009295388410988627, 0.2298396457049806, 0.2151287727578843, -0.05181540538738403, 0.16270283683029524, 0.1959358797570438, -0.05477957311875613, 0.16006172846181918, -0.14571271277964115, 0.023498231371454265, -0.17564472794469635, -0.17970190506617903, -0.16375854976822513, 0.07890263334769061, -0.11221292944821347, -0.13464047189928213, 0.28483290728023747, 0.04910448027806262, 0.12759724886046123, -0.09122474490412337, 0.24985865181532957, 0.10162713663589398, 0.0644715390428585, 0.05510492534455606, 0.3187792470868109, 0.2493459164733225, 0.20396477826949905, -0.2851310588608859, 0.07674684425642303, -0.021094859998117763]
|
1,803.09495
|
Symmetry Breaking and Lattice Kirigami
|
In this work we consider an interacting quantum field theory on a curved
two-dimensional manifold that we construct by geometrically deforming a flat
hexagonal lattice by the insertion of a defect. Depending on how the
deformation is done, the resulting geometry acquires a locally non-vanishing
curvature that can be either positive or negative. Fields propagating on this
background are forced to satisfy boundary conditions modulated by the geometry
and that can be assimilated by a non-dynamical gauge field. We present an
explicit example where curvature and boundary conditions compete in altering
the way symmetry breaking takes place, resulting in a surprising behaviour of
the order parameter in the vicinity of the defect. The effect described here is
expected to be generic and of relevance in a variety of situations.
|
hep-th cond-mat.str-el gr-qc math-ph math.MP
|
in this work we consider an interacting quantum field theory on a curved twodimensional manifold that we construct by geometrically deforming a flat hexagonal lattice by the insertion of a defect depending on how the deformation is done the resulting geometry acquires a locally nonvanishing curvature that can be either positive or negative fields propagating on this background are forced to satisfy boundary conditions modulated by the geometry and that can be assimilated by a nondynamical gauge field we present an explicit example where curvature and boundary conditions compete in altering the way symmetry breaking takes place resulting in a surprising behaviour of the order parameter in the vicinity of the defect the effect described here is expected to be generic and of relevance in a variety of situations
|
[['in', 'this', 'work', 'we', 'consider', 'an', 'interacting', 'quantum', 'field', 'theory', 'on', 'a', 'curved', 'twodimensional', 'manifold', 'that', 'we', 'construct', 'by', 'geometrically', 'deforming', 'a', 'flat', 'hexagonal', 'lattice', 'by', 'the', 'insertion', 'of', 'a', 'defect', 'depending', 'on', 'how', 'the', 'deformation', 'is', 'done', 'the', 'resulting', 'geometry', 'acquires', 'a', 'locally', 'nonvanishing', 'curvature', 'that', 'can', 'be', 'either', 'positive', 'or', 'negative', 'fields', 'propagating', 'on', 'this', 'background', 'are', 'forced', 'to', 'satisfy', 'boundary', 'conditions', 'modulated', 'by', 'the', 'geometry', 'and', 'that', 'can', 'be', 'assimilated', 'by', 'a', 'nondynamical', 'gauge', 'field', 'we', 'present', 'an', 'explicit', 'example', 'where', 'curvature', 'and', 'boundary', 'conditions', 'compete', 'in', 'altering', 'the', 'way', 'symmetry', 'breaking', 'takes', 'place', 'resulting', 'in', 'a', 'surprising', 'behaviour', 'of', 'the', 'order', 'parameter', 'in', 'the', 'vicinity', 'of', 'the', 'defect', 'the', 'effect', 'described', 'here', 'is', 'expected', 'to', 'be', 'generic', 'and', 'of', 'relevance', 'in', 'a', 'variety', 'of', 'situations']]
|
[-0.17293123169910424, 0.19557219385119812, -0.08351183641528667, 0.024170087188366773, -0.09638388988800174, -0.12692414906756708, -0.011123191270175888, 0.368393830947809, -0.2523814834647112, -0.25058260729965975, 0.11406377631748571, -0.2155674867974522, -0.1892061174338207, 0.14833996261383386, -0.06219362515537429, -0.040988985243318385, -0.00560363881694254, 0.06238512203905933, -0.07652020260426325, -0.22586222371454676, 0.3837105469532715, 0.0396165174997029, 0.2657408826883391, 0.0512997984828413, 0.08836571834873148, -0.0052579817607594555, 0.06258959602384084, 0.10405785308847594, -0.14473657633101003, 0.09053312591277063, 0.18268572258972382, 0.00725981401452838, 0.1987331922693077, -0.46374065775510875, -0.2512969175108181, 0.08980726470174484, 0.1348307754180228, 0.13882410210059132, -0.08088413106418367, -0.29321447715105475, 0.06814887136935668, -0.12422276474174487, -0.16658008657125106, -0.07861247106975075, -0.027627421349879038, -0.05525346346878151, -0.2578829175958684, 0.06421309779578632, 0.07824444546014099, 0.05524321981207576, -0.07050962336794582, -0.015568558105029339, -0.06208632404143496, 0.1013779352408249, 0.04959296146245284, 0.049943560435682134, 0.14052513411517667, -0.14486360162417153, -0.09311537773803223, 0.39022510516089065, -0.09542175751024236, -0.27573031413029564, 0.14977326401141147, -0.1208045188637176, -0.08952310149622865, 0.12958335559706874, 0.18432056644296116, 0.128652467327409, -0.10705300685615719, 0.15746726735199254, -0.02582680259636322, 0.13727823608417727, 0.084523671772331, -0.019658721510551928, 0.247121149349178, 0.10239618932178547, 0.07169451995016357, 0.16802499198639953, -0.03601090077765633, -0.11933543976728422, -0.3560984774832, -0.15994432428964528, -0.1757149830254791, 0.11394338771094416, -0.09368695746062689, -0.18714179438286166, 0.3896482325584967, 0.10648560133408899, 0.2338706657656851, -0.033149277166268955, 0.23351468823402544, 0.1383261081858271, 0.053370990956476495, 0.027966597632384523, 0.23576993439635335, 0.11002882287202244, 0.04585374349930374, -0.20475117239537974, 0.01071025440180602, 0.061767479599735074]
|
1,803.09496
|
On the loss of Fisher information in some multi-object tracking
observation models
|
The concept of Fisher information can be useful even in cases where the
probability distributions of interest are not absolutely continuous with
respect to the natural reference measure on the underlying space. Practical
examples where this extension is useful are provided in the context of
multi-object tracking statistical models. Upon defining the Fisher information
without introducing a reference measure, we provide remarkably concise proofs
of the loss of Fisher information in some widely used multi-object tracking
observation models.
|
math.ST stat.TH
|
the concept of fisher information can be useful even in cases where the probability distributions of interest are not absolutely continuous with respect to the natural reference measure on the underlying space practical examples where this extension is useful are provided in the context of multiobject tracking statistical models upon defining the fisher information without introducing a reference measure we provide remarkably concise proofs of the loss of fisher information in some widely used multiobject tracking observation models
|
[['the', 'concept', 'of', 'fisher', 'information', 'can', 'be', 'useful', 'even', 'in', 'cases', 'where', 'the', 'probability', 'distributions', 'of', 'interest', 'are', 'not', 'absolutely', 'continuous', 'with', 'respect', 'to', 'the', 'natural', 'reference', 'measure', 'on', 'the', 'underlying', 'space', 'practical', 'examples', 'where', 'this', 'extension', 'is', 'useful', 'are', 'provided', 'in', 'the', 'context', 'of', 'multiobject', 'tracking', 'statistical', 'models', 'upon', 'defining', 'the', 'fisher', 'information', 'without', 'introducing', 'a', 'reference', 'measure', 'we', 'provide', 'remarkably', 'concise', 'proofs', 'of', 'the', 'loss', 'of', 'fisher', 'information', 'in', 'some', 'widely', 'used', 'multiobject', 'tracking', 'observation', 'models']]
|
[-0.03197943139448165, 0.04553688167092892, -0.13243150679418483, 0.10234346028226309, -0.08670759221347861, -0.14777004636991292, 0.00765163420389096, 0.3825713750064516, -0.26918205926314187, -0.28664183390747683, 0.14496712272730058, -0.2731728457356206, -0.14458186704760942, 0.22199850929423404, -0.14565240076850527, 0.08908088396464546, 0.06945782379271129, 0.11833993439564111, -0.08113413249464849, -0.22977466236811894, 0.2983262405883019, 0.0895830003831249, 0.2988580826383371, -0.014884073854400178, 0.11160753973019429, 0.05235423647368757, -0.10796444409359725, 0.018519659208532876, -0.16250858325153017, 0.17276378547868285, 0.28676621190121904, 0.19373613448353866, 0.29070828372063356, -0.3475897376043483, -0.2370664773341746, 0.1465582374889308, 0.12790463872862837, 0.09872150208609991, -0.058797159693382964, -0.3403260800509881, 0.020991108928007096, -0.14101792446886882, -0.08560005442884105, -0.13768400146345344, -0.026270453436061356, 0.032554050346311085, -0.29204521004038936, 0.05664905523045514, 0.05100045619287695, 0.07783641380807146, -0.03322178626564355, -0.09025419944037612, -0.007225265087655339, 0.15132003070977637, -0.008809995064392494, 0.018546381793641604, 0.12089833558107224, -0.14157654189516622, -0.08498324238611624, 0.3693349059933844, -0.07502450377572902, -0.29041043807489747, 0.14718436950053543, -0.13187060303365192, -0.15683451219079778, 0.07935140950557514, 0.16051304714085582, 0.1178972277766428, -0.17412705913645765, 0.07666458402617046, -0.03746540173410605, 0.15827819301436344, 0.027020933870703746, 0.1256622618947847, 0.2307397828031427, 0.15335387379551926, 0.06726464961553948, 0.11844647176360759, -0.0804378140795355, -0.14402598622613227, -0.3198099200470516, -0.16419600424706005, -0.2194059659541847, -7.284685759655893e-05, -0.11141091225764309, -0.1291770511903824, 0.3679202905891893, 0.1956253077996035, 0.19480457930013728, 0.033536043704654545, 0.3083289495836466, 0.10185695364354895, 0.027801339708579082, 0.032508702551683366, 0.2104493324329199, 0.13320769348110145, 0.0809805330951722, -0.09134544156348476, 0.12648474169859233, 0.022216821459527962]
|
1,803.09497
|
Long time behavior of the volume of the Wiener sausage on Dirichlet
spaces
|
In the present paper, we consider long time behaviors of the volume of the
Wiener sausage on Dirichlet spaces. We focus on the volume of the Wiener
sausage for diffusion processes on metric measure spaces other than the Euclid
space equipped with the Lebesgue measure. We obtain the growth rate of the
expectations and almost sure behaviors of the volumes of the Wiener sausages on
metric measure Dirichlet spaces satisfying Ahlfors regularity and sub-Gaussian
heat kernel estimates. We show that the growth rate of the expectations on a
"bounded" modification of the Euclidian space is identical with the one on the
Euclidian space equipped with the Lebesgue measure. We give an example of a
metric measure Dirichlet space on which a scaled of the means fluctuates.
|
math.PR
|
in the present paper we consider long time behaviors of the volume of the wiener sausage on dirichlet spaces we focus on the volume of the wiener sausage for diffusion processes on metric measure spaces other than the euclid space equipped with the lebesgue measure we obtain the growth rate of the expectations and almost sure behaviors of the volumes of the wiener sausages on metric measure dirichlet spaces satisfying ahlfors regularity and subgaussian heat kernel estimates we show that the growth rate of the expectations on a bounded modification of the euclidian space is identical with the one on the euclidian space equipped with the lebesgue measure we give an example of a metric measure dirichlet space on which a scaled of the means fluctuates
|
[['in', 'the', 'present', 'paper', 'we', 'consider', 'long', 'time', 'behaviors', 'of', 'the', 'volume', 'of', 'the', 'wiener', 'sausage', 'on', 'dirichlet', 'spaces', 'we', 'focus', 'on', 'the', 'volume', 'of', 'the', 'wiener', 'sausage', 'for', 'diffusion', 'processes', 'on', 'metric', 'measure', 'spaces', 'other', 'than', 'the', 'euclid', 'space', 'equipped', 'with', 'the', 'lebesgue', 'measure', 'we', 'obtain', 'the', 'growth', 'rate', 'of', 'the', 'expectations', 'and', 'almost', 'sure', 'behaviors', 'of', 'the', 'volumes', 'of', 'the', 'wiener', 'sausages', 'on', 'metric', 'measure', 'dirichlet', 'spaces', 'satisfying', 'ahlfors', 'regularity', 'and', 'subgaussian', 'heat', 'kernel', 'estimates', 'we', 'show', 'that', 'the', 'growth', 'rate', 'of', 'the', 'expectations', 'on', 'a', 'bounded', 'modification', 'of', 'the', 'euclidian', 'space', 'is', 'identical', 'with', 'the', 'one', 'on', 'the', 'euclidian', 'space', 'equipped', 'with', 'the', 'lebesgue', 'measure', 'we', 'give', 'an', 'example', 'of', 'a', 'metric', 'measure', 'dirichlet', 'space', 'on', 'which', 'a', 'scaled', 'of', 'the', 'means', 'fluctuates']]
|
[-0.12436288642065992, 0.11641142386418771, -0.08993634191297349, 0.11343005548198042, -0.07745012034854246, -0.02803333163897078, 0.023744780526843867, 0.3672289008289457, -0.2652600591795312, -0.16315140413297785, 0.1754456143817007, -0.3268911782060824, -0.0969982182843581, 0.21507577776228862, -0.10572086756915919, 0.06312317319864792, 0.03927573664409537, 0.12271613134292975, -0.06571028467142097, -0.2709139716785608, 0.4337234230460747, 0.033451473687790216, 0.28758270261690966, -0.02130035058196102, 0.1628807353683644, -0.010058708407635253, -0.08771868301777258, 0.004869357112699026, -0.2480509259448953, 0.1530309841849856, 0.1341914169320334, 0.06776258836145557, 0.2885391175569523, -0.3624877053468178, -0.21836239163438598, 0.174761150231851, 0.06793808303256002, -0.07762286646221395, -0.007588996347742126, -0.31751776834033313, 0.0378240236683586, -0.0686104306188922, -0.13900408386031077, -0.04580619334731074, -0.009287249856805872, 0.04257510768781815, -0.2935723334639555, 0.08103966073498928, 0.06620283031629191, 0.028215424209419224, -0.1522256618343471, -0.06928424942972404, 0.01886420214681753, 0.09310769328167515, 0.02875601499625999, 0.05537261083603851, 0.10006154704809425, -0.030936990698267306, -0.11829197554228206, 0.3461698334228011, -0.14398364974280528, -0.28819678380109726, 0.16773206820445402, -0.2530670660725307, -0.09413509398314451, 0.0584976299414559, 0.2005114862067063, 0.1022861107282104, -0.07974590197028149, 0.16641275301882405, -0.03476850956767088, 0.11896889819740503, 0.10632201282691861, 0.06473243044733647, 0.09648532142478322, 0.19351340755118088, 0.20404196875022043, 0.149779646124761, -0.07034216119190825, -0.08751017947372655, -0.3398069854278768, -0.20797322088083814, -0.21702258675433103, 0.08231933464458774, -0.2016377549991289, -0.27605068321443266, 0.3270756434242699, 0.07991315985822843, 0.21228255581716815, 0.1533005303815968, 0.21685789205828712, 0.12513111685476605, 0.013744229351961247, 0.07344546445852353, 0.1615241068075337, 0.13535090623098234, 0.1151465564921853, -0.1670419226200985, 0.056854148181007494, 0.1288176242021672]
|
1,803.09498
|
Alternative interpretation of the Pl\"ucker quadric's ambient space and
its application
|
It is well-known that there exists a bijection between the set of lines of
the projective 3-dimensional space $P^3$ and all real points of the so-called
Pl\"ucker quadric $\Psi$. Moreover one can identify each point of the Pl\"ucker
quadric's ambient space with a linear complex of lines in $P^3$. Within this
paper we give an alternative interpretation for the points of $P^5$ as lines of
an Euclidean 4-space $E^4$, which are orthogonal to a fixed direction. By using
the quaternionic notation for lines, we study straight lines in $P^5$ which
correspond in the general case to cubic 2-surfaces in $E^4$. We show that these
surfaces are geometrically connected with circular Darboux 2-motions in $E^4$,
as they are basic surfaces of the underlying line-symmetric motions. Moreover
we extend the obtained results to line-elements of the Euclidean 3-space $E^3$,
which can be represented as points of a cone over $\Psi$ sliced along the
2-dimensional generator space of ideal lines. We also study straight lines of
its ambient space $P^6$ and show that they correspond to ruled surface strips
composed of the mentioned 2-surfaces with circles on it. Finally we present an
application of this interpretation in the context of interactive design of
ruled surfaces and ruled surface strips/patches based on the algorithm of De
Casteljau.
|
cs.CG
|
it is wellknown that there exists a bijection between the set of lines of the projective 3dimensional space p3 and all real points of the socalled plucker quadric psi moreover one can identify each point of the plucker quadrics ambient space with a linear complex of lines in p3 within this paper we give an alternative interpretation for the points of p5 as lines of an euclidean 4space e4 which are orthogonal to a fixed direction by using the quaternionic notation for lines we study straight lines in p5 which correspond in the general case to cubic 2surfaces in e4 we show that these surfaces are geometrically connected with circular darboux 2motions in e4 as they are basic surfaces of the underlying linesymmetric motions moreover we extend the obtained results to lineelements of the euclidean 3space e3 which can be represented as points of a cone over psi sliced along the 2dimensional generator space of ideal lines we also study straight lines of its ambient space p6 and show that they correspond to ruled surface strips composed of the mentioned 2surfaces with circles on it finally we present an application of this interpretation in the context of interactive design of ruled surfaces and ruled surface stripspatches based on the algorithm of de casteljau
|
[['it', 'is', 'wellknown', 'that', 'there', 'exists', 'a', 'bijection', 'between', 'the', 'set', 'of', 'lines', 'of', 'the', 'projective', '3dimensional', 'space', 'p3', 'and', 'all', 'real', 'points', 'of', 'the', 'socalled', 'plucker', 'quadric', 'psi', 'moreover', 'one', 'can', 'identify', 'each', 'point', 'of', 'the', 'plucker', 'quadrics', 'ambient', 'space', 'with', 'a', 'linear', 'complex', 'of', 'lines', 'in', 'p3', 'within', 'this', 'paper', 'we', 'give', 'an', 'alternative', 'interpretation', 'for', 'the', 'points', 'of', 'p5', 'as', 'lines', 'of', 'an', 'euclidean', '4space', 'e4', 'which', 'are', 'orthogonal', 'to', 'a', 'fixed', 'direction', 'by', 'using', 'the', 'quaternionic', 'notation', 'for', 'lines', 'we', 'study', 'straight', 'lines', 'in', 'p5', 'which', 'correspond', 'in', 'the', 'general', 'case', 'to', 'cubic', '2surfaces', 'in', 'e4', 'we', 'show', 'that', 'these', 'surfaces', 'are', 'geometrically', 'connected', 'with', 'circular', 'darboux', '2motions', 'in', 'e4', 'as', 'they', 'are', 'basic', 'surfaces', 'of', 'the', 'underlying', 'linesymmetric', 'motions', 'moreover', 'we', 'extend', 'the', 'obtained', 'results', 'to', 'lineelements', 'of', 'the', 'euclidean', '3space', 'e3', 'which', 'can', 'be', 'represented', 'as', 'points', 'of', 'a', 'cone', 'over', 'psi', 'sliced', 'along', 'the', '2dimensional', 'generator', 'space', 'of', 'ideal', 'lines', 'we', 'also', 'study', 'straight', 'lines', 'of', 'its', 'ambient', 'space', 'p6', 'and', 'show', 'that', 'they', 'correspond', 'to', 'ruled', 'surface', 'strips', 'composed', 'of', 'the', 'mentioned', '2surfaces', 'with', 'circles', 'on', 'it', 'finally', 'we', 'present', 'an', 'application', 'of', 'this', 'interpretation', 'in', 'the', 'context', 'of', 'interactive', 'design', 'of', 'ruled', 'surfaces', 'and', 'ruled', 'surface', 'stripspatches', 'based', 'on', 'the', 'algorithm', 'of', 'de', 'casteljau']]
|
[-0.17858027777457167, 0.06953073421325479, -0.04662602288382394, 0.04234512035812562, -0.07206431490125223, -0.1222313227331532, 0.01790827456141068, 0.4028051064868036, -0.2530008161529189, -0.21924016508939012, 0.08294883263408251, -0.2646849167533219, -0.17780590474694258, 0.23171306275540873, -0.09051374135583284, -0.01114259757838833, -0.0015411953918547149, 0.03696445723263813, -0.1169418761273846, -0.2833307727328723, 0.3728416751903881, -0.023509968010087808, 0.2050952256790229, 0.002412988773236672, 0.08998542324240719, 0.010573253714080367, 0.02365495161419468, 0.051057389801523335, -0.16226519279211754, 0.14875651853480598, 0.2649446057011595, 0.10389145543089225, 0.12228921823913143, -0.405341625045098, -0.18015928136495252, 0.16538030303837287, 0.16892759769356677, 0.037735259447418644, 0.005716211859890748, -0.257368643869025, 0.0577716695782285, -0.050145267199591864, -0.2101438377717776, -0.054382550281782946, 0.023502116041657115, 0.030950504794184652, -0.16164827469204154, -0.004100124159179229, 0.10721920354823981, 0.13480321517258528, -0.0501471120259902, -0.08930046251986087, -0.08159618714181263, 0.06809139329540942, 0.008452402571925805, 0.06799249455687545, 0.06597900195934234, -0.04295964277615505, -0.12406339783531924, 0.415101162388566, -0.042877543038810556, -0.24680974732729652, 0.13190334418544636, -0.14464255139298204, -0.11972211130916895, 0.16338318688628664, 0.15646388782853526, 0.14399940415418575, -0.05922728523797732, 0.13044964679599313, -0.11314710937551267, 0.08211038698555924, 0.12811154608969533, -0.041522887322242324, 0.20895349430474675, 0.07601231976545282, 0.06827720318078286, 0.13064431048114783, -0.09715252322410899, -0.07055010287939305, -0.4189472625226093, -0.2563557744336625, -0.1343296529242902, 0.06273663332685828, -0.09411911017218483, -0.2052238559705161, 0.3635786496901086, 0.05183329433535359, 0.24832322468005474, 0.010265344116175714, 0.2318527261554707, 0.07123918573024206, 0.036709323895740366, 0.09636977855337872, 0.2009482534059013, 0.10809068078330407, 0.009129146583533535, -0.12274060999486773, -0.05738798267030645, 0.1217493927217133]
|
1,803.09499
|
Inverse scattering for Schr\"{o}dinger operators on perturbed lattices
|
We study the inverse scattering for Schr{\"o}dinger operators on locally
perturbed periodic lattices. We show that the associated scattering matrix is
equivalent to the Dirichlet-to-Neumann map for a boundary value problem on a
finite part of the graph, and reconstruct scalar potentials as well as the
graph structure from the knowledge of the S-matrix. In particular, we give a
procedure for probing defects in hexagonal lattices (graphene).
|
math.SP
|
we study the inverse scattering for schrodinger operators on locally perturbed periodic lattices we show that the associated scattering matrix is equivalent to the dirichlettoneumann map for a boundary value problem on a finite part of the graph and reconstruct scalar potentials as well as the graph structure from the knowledge of the smatrix in particular we give a procedure for probing defects in hexagonal lattices graphene
|
[['we', 'study', 'the', 'inverse', 'scattering', 'for', 'schrodinger', 'operators', 'on', 'locally', 'perturbed', 'periodic', 'lattices', 'we', 'show', 'that', 'the', 'associated', 'scattering', 'matrix', 'is', 'equivalent', 'to', 'the', 'dirichlettoneumann', 'map', 'for', 'a', 'boundary', 'value', 'problem', 'on', 'a', 'finite', 'part', 'of', 'the', 'graph', 'and', 'reconstruct', 'scalar', 'potentials', 'as', 'well', 'as', 'the', 'graph', 'structure', 'from', 'the', 'knowledge', 'of', 'the', 'smatrix', 'in', 'particular', 'we', 'give', 'a', 'procedure', 'for', 'probing', 'defects', 'in', 'hexagonal', 'lattices', 'graphene']]
|
[-0.10451691268262134, 0.08143581926767061, -0.04506290296732045, 0.06746532565934944, -0.0709545326023015, -0.09088023571964743, -0.0009065542557735496, 0.4120834168713929, -0.31135396481449923, -0.19244225727005013, 0.13074739167202654, -0.3256820892887329, -0.20835560974456482, 0.1490178611407529, 0.0015931380078641336, 0.08684159053572968, 0.07527871746847879, 0.06763391964721369, -0.08949515961263496, -0.1723957472809229, 0.4060689185315104, -0.008700787979386636, 0.2259122706296395, 0.08696842802438273, 0.07633715489559542, 0.06744818541624431, 0.019260623923210957, -0.00039974702244151885, -0.1296490064980471, 0.11469017727641083, 0.2114601634276002, 0.014660597000437887, 0.15312883283234022, -0.4373495557915364, -0.22392945503816009, 0.11339973142620788, 0.13289972106272827, 0.1453796835240922, -0.03982671646665392, -0.2980073908093705, 0.07539792413781606, -0.0858418860771596, -0.14935874495544096, -0.04530144814721573, 0.02364214875304432, -0.031176225973793596, -0.30046826007223426, 0.04897914853628113, 0.04427044008990555, 0.041971089332295, -0.12936000074190435, -0.08615742694002701, -0.005999184078050416, 0.0908336034114125, -0.045811062737771156, 0.00348886553851415, 0.10015843596670833, -0.12444344670303277, -0.10745543459909898, 0.4031278929992843, -0.09077485078083936, -0.22773174154780693, 0.10926942649617125, -0.13647191510049264, -0.1029104771050833, 0.09134679924307475, 0.18615786875806636, 0.12663088427550756, -0.14049456514932437, 0.18608831729541825, -0.08534610203168452, 0.12790324560491673, 0.09330013605640895, 0.013020021875680828, 0.1549664816138015, 0.14295843778414402, 0.15874430886122273, 0.1885074599743334, -0.009088552227667742, -0.04337144673649055, -0.3345415562168876, -0.1351439065174825, -0.23579657002379978, 0.10050094714249248, -0.11322687366788811, -0.2638097483901057, 0.4196803467487221, 0.11822938154548851, 0.22767225853097972, 0.043512097281862554, 0.20324286684366083, 0.1507935448056226, 0.07050613916492951, 0.04349669057931473, 0.16927164406932668, 0.20350989083231275, 0.07607017271394438, -0.24015478708141885, -0.04330034873017402, 0.15262988814389084]
|
1,803.095
|
The theta bump condition for product fractional integrals
|
We extend some one parameter theorems on fractional integrals due to Sawyer
and Wheeden to the two parameter setting using a recent iteration method of
Tanaka and Yabuta.
|
math.CA
|
we extend some one parameter theorems on fractional integrals due to sawyer and wheeden to the two parameter setting using a recent iteration method of tanaka and yabuta
|
[['we', 'extend', 'some', 'one', 'parameter', 'theorems', 'on', 'fractional', 'integrals', 'due', 'to', 'sawyer', 'and', 'wheeden', 'to', 'the', 'two', 'parameter', 'setting', 'using', 'a', 'recent', 'iteration', 'method', 'of', 'tanaka', 'and', 'yabuta']]
|
[-0.08028765954077244, 0.007447815383784473, -0.09534527665735888, 0.04752657103485295, -0.14680493350273796, -0.1461449903934928, 0.12000225191669804, 0.2931155243090221, -0.2684196570355977, -0.2656461847946048, 0.1727188139588439, -0.266591029108635, -0.13093111777145947, 0.2697803552395531, -0.15987830133443431, 0.09917709277942777, 0.022984664887189865, -0.05375999944018466, -0.0613461421869163, -0.290878993176323, 0.32280128098292543, -0.025248802732676268, 0.13942398210721357, 0.03808916117330747, 0.1131759984751365, 0.03441854967137, -0.09644673674899552, -0.01745051345122712, -0.22537516082437442, 0.14209837985358068, 0.19752580808043213, 0.03458797537522124, 0.3379799708990114, -0.36454575242740767, -0.17344582697634386, 0.1353395695665053, 0.06989155124340739, 0.06169526990769165, 0.04807855339770738, -0.32134791809533325, 0.052218062204441855, -0.18357305255319392, -0.12352698374473091, -0.12636326825512306, 0.005970629996487072, 0.02499878030669476, -0.31745530515243964, 0.10660851686926824, 0.10826063607237302, -0.01969043190391468, -0.07713209388644568, -0.1581810349598527, 0.057491562412386496, -0.02582491947604077, 0.07786175322585873, 0.05612262484750578, 0.057193675893358886, -0.028847924965832914, -0.19871786223458393, 0.2505284555788551, -0.04524528393605059, -0.25304047350904774, 0.16161139369277017, -0.14932641313810432, -0.18920124362089805, 0.04377063520119658, 0.10364803349304046, 0.19317590340506285, -0.07566129234952054, 0.15037321859355351, 0.012936658225953579, 0.04791722380157028, 0.13677690653795643, -0.015112838707864285, -0.03904673813043961, 0.058350185331489356, 0.07897341680446905, 0.12428992817045323, -0.07528927812485822, -0.1421826139890722, -0.2608937345711248, -0.1817779698010002, -0.15647523999879404, 0.012090892165101, -0.10143996495649585, -0.10012861570742514, 0.3849315051920712, 0.1722986215858587, 0.23838090178157603, 0.059329911900152056, 0.222550953073161, 0.1328100289683789, 0.0119751608664436, 0.029904368250364705, 0.17879781085918825, 0.24128991458564997, 0.1301130406458729, -0.1615397868944066, -0.016140839263763546, 0.23982656115133846]
|
1,803.09501
|
A general white noise test based on kernel lag-window estimates of the
spectral density operator
|
We propose a general white noise test for functional time series based on
estimating a distance between the spectral density operator of a weakly
stationary time series and the constant spectral density operator of an
uncorrelated time series. The estimator that we propose is based on a kernel
lag-window type estimator of the spectral density operator. When the observed
time series is a strong white noise in a real separable Hilbert space, we show
that the asymptotic distribution of the test statistic is standard normal, and
we further show that the test statistic diverges for general serially
correlated time series. These results recover as special cases those of Hong
(1996) and Horv\'ath et al. (2013). In order to implement the test, we propose
and study a number of kernel and bandwidth choices, including a new data
adaptive bandwidth, as well as data adaptive power transformations of the test
statistic that improve the normal approximation in finite samples. A simulation
study demonstrated that the proposed method has good size and improved power
when compared to other methods available in the literature, while also offering
a light computational burden.
|
math.ST stat.TH
|
we propose a general white noise test for functional time series based on estimating a distance between the spectral density operator of a weakly stationary time series and the constant spectral density operator of an uncorrelated time series the estimator that we propose is based on a kernel lagwindow type estimator of the spectral density operator when the observed time series is a strong white noise in a real separable hilbert space we show that the asymptotic distribution of the test statistic is standard normal and we further show that the test statistic diverges for general serially correlated time series these results recover as special cases those of hong 1996 and horvath et al 2013 in order to implement the test we propose and study a number of kernel and bandwidth choices including a new data adaptive bandwidth as well as data adaptive power transformations of the test statistic that improve the normal approximation in finite samples a simulation study demonstrated that the proposed method has good size and improved power when compared to other methods available in the literature while also offering a light computational burden
|
[['we', 'propose', 'a', 'general', 'white', 'noise', 'test', 'for', 'functional', 'time', 'series', 'based', 'on', 'estimating', 'a', 'distance', 'between', 'the', 'spectral', 'density', 'operator', 'of', 'a', 'weakly', 'stationary', 'time', 'series', 'and', 'the', 'constant', 'spectral', 'density', 'operator', 'of', 'an', 'uncorrelated', 'time', 'series', 'the', 'estimator', 'that', 'we', 'propose', 'is', 'based', 'on', 'a', 'kernel', 'lagwindow', 'type', 'estimator', 'of', 'the', 'spectral', 'density', 'operator', 'when', 'the', 'observed', 'time', 'series', 'is', 'a', 'strong', 'white', 'noise', 'in', 'a', 'real', 'separable', 'hilbert', 'space', 'we', 'show', 'that', 'the', 'asymptotic', 'distribution', 'of', 'the', 'test', 'statistic', 'is', 'standard', 'normal', 'and', 'we', 'further', 'show', 'that', 'the', 'test', 'statistic', 'diverges', 'for', 'general', 'serially', 'correlated', 'time', 'series', 'these', 'results', 'recover', 'as', 'special', 'cases', 'those', 'of', 'hong', '1996', 'and', 'horvath', 'et', 'al', '2013', 'in', 'order', 'to', 'implement', 'the', 'test', 'we', 'propose', 'and', 'study', 'a', 'number', 'of', 'kernel', 'and', 'bandwidth', 'choices', 'including', 'a', 'new', 'data', 'adaptive', 'bandwidth', 'as', 'well', 'as', 'data', 'adaptive', 'power', 'transformations', 'of', 'the', 'test', 'statistic', 'that', 'improve', 'the', 'normal', 'approximation', 'in', 'finite', 'samples', 'a', 'simulation', 'study', 'demonstrated', 'that', 'the', 'proposed', 'method', 'has', 'good', 'size', 'and', 'improved', 'power', 'when', 'compared', 'to', 'other', 'methods', 'available', 'in', 'the', 'literature', 'while', 'also', 'offering', 'a', 'light', 'computational', 'burden']]
|
[-0.07450351411138069, 0.041314964475969905, -0.11602927401741558, 0.08540516883012823, -0.05558267084851781, -0.13104639520101688, 0.06852833818977967, 0.37432289009983527, -0.22819959427314726, -0.2943245938974109, 0.11872150054709478, -0.24921814383774557, -0.15723769472324275, 0.21360535839980938, -0.09076420165956976, 0.09299979633825986, 0.0693676727226273, 0.019002927242489382, -0.08598961896651529, -0.28889778157245405, 0.29412341279221726, 0.1043455222233094, 0.330810715429445, -0.02890866138987283, 0.10211990232190944, 0.011832210885231348, -0.07091557333821102, 0.029897627601795564, -0.10377528914347706, 0.06689825570484732, 0.2154554693342092, 0.1274839589935055, 0.3176062201538228, -0.3786719856711533, -0.22215247900788, 0.11377210076773828, 0.08630425983013953, 0.05041771211890494, -0.04724100078916785, -0.25531830279191425, 0.05834922882763141, -0.17523714255063452, -0.10398227559809728, -0.10411625224250284, 0.014051232237946541, 0.047881936820978445, -0.35175964161056406, 0.12069354043077593, 0.044425516377482065, 0.027509430209224556, -0.022053499787019933, -0.11525226191537863, 0.038145619845777294, 0.08027482428868117, 0.028474388545737625, 0.0016227458220194368, 0.06816098876490462, -0.06758457141614614, -0.08999844667885233, 0.30835738304079846, -0.11832542945836287, -0.17698972286870654, 0.17064383230794639, -0.14910182397673155, -0.12732356328039088, 0.07052024423560616, 0.19722541258296863, 0.13174268168790695, -0.13379671069358245, 0.1063644139321501, -0.057743776419678115, 0.17100456909321368, 0.04622362738594731, 0.026709455100914097, 0.09262562190795089, 0.15145592660678023, 0.0685851555149554, 0.14806596861864604, -0.13618657254753386, -0.0542847243835527, -0.2967384185624573, -0.1712466500759284, -0.24543326898642323, 0.0019469714529294381, -0.12458847488110442, -0.19213100841996025, 0.41678667040093537, 0.1543762945933616, 0.2066631511297017, 0.1006090009527749, 0.30037499780960897, 0.1505305075720401, 0.011128568913498744, 0.10565888460098023, 0.1627142137105771, 0.11070140214626961, 0.06630227860016001, -0.21139967927141465, 0.043785074634856, 0.05230323313084869]
|
1,803.09502
|
Long-term Tracking in the Wild: A Benchmark
|
We introduce the OxUvA dataset and benchmark for evaluating single-object
tracking algorithms. Benchmarks have enabled great strides in the field of
object tracking by defining standardized evaluations on large sets of diverse
videos. However, these works have focused exclusively on sequences that are
just tens of seconds in length and in which the target is always visible.
Consequently, most researchers have designed methods tailored to this
"short-term" scenario, which is poorly representative of practitioners' needs.
Aiming to address this disparity, we compile a long-term, large-scale tracking
dataset of sequences with average length greater than two minutes and with
frequent target object disappearance. The OxUvA dataset is much larger than the
object tracking datasets of recent years: it comprises 366 sequences spanning
14 hours of video. We assess the performance of several algorithms, considering
both the ability to locate the target and to determine whether it is present or
absent. Our goal is to offer the community a large and diverse benchmark to
enable the design and evaluation of tracking methods ready to be used "in the
wild". The project website is http://oxuva.net
|
cs.CV
|
we introduce the oxuva dataset and benchmark for evaluating singleobject tracking algorithms benchmarks have enabled great strides in the field of object tracking by defining standardized evaluations on large sets of diverse videos however these works have focused exclusively on sequences that are just tens of seconds in length and in which the target is always visible consequently most researchers have designed methods tailored to this shortterm scenario which is poorly representative of practitioners needs aiming to address this disparity we compile a longterm largescale tracking dataset of sequences with average length greater than two minutes and with frequent target object disappearance the oxuva dataset is much larger than the object tracking datasets of recent years it comprises 366 sequences spanning 14 hours of video we assess the performance of several algorithms considering both the ability to locate the target and to determine whether it is present or absent our goal is to offer the community a large and diverse benchmark to enable the design and evaluation of tracking methods ready to be used in the wild the project website is httpoxuvanet
|
[['we', 'introduce', 'the', 'oxuva', 'dataset', 'and', 'benchmark', 'for', 'evaluating', 'singleobject', 'tracking', 'algorithms', 'benchmarks', 'have', 'enabled', 'great', 'strides', 'in', 'the', 'field', 'of', 'object', 'tracking', 'by', 'defining', 'standardized', 'evaluations', 'on', 'large', 'sets', 'of', 'diverse', 'videos', 'however', 'these', 'works', 'have', 'focused', 'exclusively', 'on', 'sequences', 'that', 'are', 'just', 'tens', 'of', 'seconds', 'in', 'length', 'and', 'in', 'which', 'the', 'target', 'is', 'always', 'visible', 'consequently', 'most', 'researchers', 'have', 'designed', 'methods', 'tailored', 'to', 'this', 'shortterm', 'scenario', 'which', 'is', 'poorly', 'representative', 'of', 'practitioners', 'needs', 'aiming', 'to', 'address', 'this', 'disparity', 'we', 'compile', 'a', 'longterm', 'largescale', 'tracking', 'dataset', 'of', 'sequences', 'with', 'average', 'length', 'greater', 'than', 'two', 'minutes', 'and', 'with', 'frequent', 'target', 'object', 'disappearance', 'the', 'oxuva', 'dataset', 'is', 'much', 'larger', 'than', 'the', 'object', 'tracking', 'datasets', 'of', 'recent', 'years', 'it', 'comprises', '366', 'sequences', 'spanning', '14', 'hours', 'of', 'video', 'we', 'assess', 'the', 'performance', 'of', 'several', 'algorithms', 'considering', 'both', 'the', 'ability', 'to', 'locate', 'the', 'target', 'and', 'to', 'determine', 'whether', 'it', 'is', 'present', 'or', 'absent', 'our', 'goal', 'is', 'to', 'offer', 'the', 'community', 'a', 'large', 'and', 'diverse', 'benchmark', 'to', 'enable', 'the', 'design', 'and', 'evaluation', 'of', 'tracking', 'methods', 'ready', 'to', 'be', 'used', 'in', 'the', 'wild', 'the', 'project', 'website', 'is', 'httpoxuvanet']]
|
[-0.07493545691607593, 0.028447871758991477, -0.04526467540941342, 0.05594755217430374, -0.08414308743436909, -0.14526800893757014, 0.01842129509505821, 0.4515291707038713, -0.19949670687809523, -0.3998002610949789, 0.13869092423226892, -0.2833913050825427, -0.09816484024596021, 0.24951201248731902, -0.11305463891580451, 0.07668124682818898, 0.1397260666341006, 0.05062662949265298, -0.036483261256879354, -0.31042676157963217, 0.25458993802841795, 0.08016957615777934, 0.29918939805220207, 0.026055232025995103, 0.08850157384390946, -0.0402934640052848, -0.09504985001703006, -0.00493489887525377, -0.08240163768141683, 0.1610907538957873, 0.287820291014742, 0.20830516911023322, 0.3276737837827187, -0.40273224046276934, -0.18082927882817038, 0.1211905880316093, 0.13267026801773102, 0.0865163424010187, -0.020323661499228797, -0.31612613340761697, 0.1303364804532254, -0.14293458822635965, -0.046571034517961254, -0.08869631070313277, 0.05364443438046992, 0.008763592624217376, -0.22652949891755533, 0.014211000744565572, -0.0014245869831166454, 0.10792119501876599, -0.03128671009736084, -0.11553996384362351, 0.05785432599703443, 0.21816236032147024, 0.0687737591166632, 0.05649670774335635, 0.12884175003240894, -0.15579917824530568, -0.12297588601375425, 0.3988870818999742, -0.045268207510924176, -0.15663821357559263, 0.24115238120706553, -0.11043145042823305, -0.12606997902286576, 0.14944587825822211, 0.22934242454747664, 0.18483700505952097, -0.1807129742712948, -0.011447884505952828, -0.0488002835226625, 0.20861102075591767, 0.05082472065312778, 0.013290402737014286, 0.21524531290314924, 0.27285066792772633, 0.04377775286992897, 0.1263411189188827, -0.15989126535860937, -0.08141667334175559, -0.19171578868932232, -0.0930581528865134, -0.153904784218455, -0.017420597481099087, -0.04743772961264971, -0.14222013433828076, 0.42402489106502517, 0.24091119334288982, 0.16866551659085563, 0.039472605987561235, 0.30911779096193986, -0.0015271499814132655, 0.14713964465545104, 0.06418498488163898, 0.20107056400556556, -0.018265096983201178, 0.1245940843305691, -0.15727774389790547, 0.07620774081832724, -0.0006514796622971583]
|
1,803.09503
|
V2676 Oph: Estimating physical parameters of a moderately fast nova
|
Using our previously reported observations, we derive some physical
parameters of the moderately fast nova V2676 Ophiuchi 2012 # 1. The best-fit
CLOUDY model of the nebular spectrum obtained on 2015 May 8 shows a hot white
dwarf source with Tbb = 1.0 x 10^{5} K having a luminosity of 1.0 x 10^{38}
ergs/s. Our abundance analysis shows that the ejecta are significantly enhanced
relative to solar, He/H = 2.14, O/H = 2.37, S/H = 6.62 and Ar/H = 3.25. The
ejecta mass is estimated to be 1.42 x 10^{-5} Msun. The nova showed a
pronounced dust formation phase after 90 days from discovery. The J-H and H-K
colors were very large as compared to other molecule- and dust-forming novae in
recent years. The dust temperature and mass at two epochs have been estimated
from spectral energy distribution (SED) fits to infrared photometry.
|
astro-ph.SR
|
using our previously reported observations we derive some physical parameters of the moderately fast nova v2676 ophiuchi 2012 1 the bestfit cloudy model of the nebular spectrum obtained on 2015 may 8 shows a hot white dwarf source with tbb 10 x 105 k having a luminosity of 10 x 1038 ergss our abundance analysis shows that the ejecta are significantly enhanced relative to solar heh 214 oh 237 sh 662 and arh 325 the ejecta mass is estimated to be 142 x 105 msun the nova showed a pronounced dust formation phase after 90 days from discovery the jh and hk colors were very large as compared to other molecule and dustforming novae in recent years the dust temperature and mass at two epochs have been estimated from spectral energy distribution sed fits to infrared photometry
|
[['using', 'our', 'previously', 'reported', 'observations', 'we', 'derive', 'some', 'physical', 'parameters', 'of', 'the', 'moderately', 'fast', 'nova', 'v2676', 'ophiuchi', '2012', '1', 'the', 'bestfit', 'cloudy', 'model', 'of', 'the', 'nebular', 'spectrum', 'obtained', 'on', '2015', 'may', '8', 'shows', 'a', 'hot', 'white', 'dwarf', 'source', 'with', 'tbb', '10', 'x', '105', 'k', 'having', 'a', 'luminosity', 'of', '10', 'x', '1038', 'ergss', 'our', 'abundance', 'analysis', 'shows', 'that', 'the', 'ejecta', 'are', 'significantly', 'enhanced', 'relative', 'to', 'solar', 'heh', '214', 'oh', '237', 'sh', '662', 'and', 'arh', '325', 'the', 'ejecta', 'mass', 'is', 'estimated', 'to', 'be', '142', 'x', '105', 'msun', 'the', 'nova', 'showed', 'a', 'pronounced', 'dust', 'formation', 'phase', 'after', '90', 'days', 'from', 'discovery', 'the', 'jh', 'and', 'hk', 'colors', 'were', 'very', 'large', 'as', 'compared', 'to', 'other', 'molecule', 'and', 'dustforming', 'novae', 'in', 'recent', 'years', 'the', 'dust', 'temperature', 'and', 'mass', 'at', 'two', 'epochs', 'have', 'been', 'estimated', 'from', 'spectral', 'energy', 'distribution', 'sed', 'fits', 'to', 'infrared', 'photometry']]
|
[-0.015083336266247135, 0.1177242311247944, -0.04550432105188387, 0.06942046354575776, -0.0338752634574134, -0.1284178659510221, 0.0981838411573375, 0.44772735175533884, -0.1061235692209299, -0.4242812323751078, 0.061015559209979746, -0.33248794162441997, 0.021070292926509016, 0.1721356955601623, -0.054242200765378064, -0.01937406907881182, 0.09593118149719208, -0.09915335800024565, -0.07338068385975585, -0.2786053837188622, 0.16896606224714814, 0.06908267560367384, 0.15145044247653797, -0.001994929589113615, 0.02203291934663362, -0.15077138378244084, -0.07225653518120466, -0.1311967364643245, -0.1650070427787039, -0.01033899913725518, 0.200914154497118, 0.10973028261316464, 0.13071615195809352, -0.29293522516088766, -0.2514274772171638, 0.04254747912318303, 0.15592085170715939, -0.048164424030993976, -0.0197969106607858, -0.2368049783135907, 0.05100746968094885, -0.22528182483366588, -0.1502593835598252, 0.09309843367383727, 0.11098861040370743, -0.005431059316262929, -0.2647668976297629, 0.1356336715610793, -0.031865078710896104, 0.11012294132561579, -0.12764867562052867, -0.22260853619974133, -0.11344410018845849, -0.020366671780654547, 0.005517639524820023, 0.12275495898848685, 0.16494556531704363, -0.0490287621913437, 0.023098380320168435, 0.37956673925594653, -0.14682586564483582, 0.11417018984746949, 0.2429870802630419, -0.19736657964650298, -0.17151739590386622, 0.2526783254133524, 0.09129727484418731, 0.1113740225988746, -0.17368728278653464, 0.00524835387945012, -0.024285153489233584, 0.2476311778568112, 0.0664443195012337, 0.05674346101327534, 0.2581282796008499, 0.09439721549895123, -0.06777400958324599, 0.043352722312259166, -0.30595741383425457, -0.017362678539089477, -0.19852306652324694, -0.07282893723841369, -0.12273934460584972, 0.1476863167481497, -0.17038264845023748, -0.03980093487507806, 0.3541543592365771, 0.0881769981576864, 0.2771955091509642, 0.013957487881509927, 0.2527196066410291, 0.071488206330041, 0.05332663334756546, 0.15883922207604306, 0.33811388227066375, 0.1969145459333693, 0.13986363340114807, -0.20697825518946578, 0.05544023596202397, -0.0037390208857501074]
|
1,803.09504
|
Efficient space virtualisation for Hoshen--Kopelman algorithm
|
In this paper the efficient space virtualisation for Hoshen--Kopelman
algorithm is presented. We observe minimal parallel overhead during
computations, due to negligible communication costs. The proposed algorithm is
applied for computation of random-site percolation thresholds for four
dimensional simple cubic lattice with sites' neighbourhoods containing
next-next-nearest neighbours (3NN). The obtained percolation thresholds are
$p_C(\text{NN})=0.19680(23)$, $p_C(\text{2NN})=0.08410(23)$,
$p_C(\text{3NN})=0.04540(23)$, $p_C(\text{2NN+NN})=0.06180(23)$,
$p_C(\text{3NN+NN})=0.04000(23)$, $p_C(\text{3NN+2NN})=0.03310(23)$,
$p_C(\text{3NN+2NN+NN})=0.03190(23)$, where 2NN and NN stand for next-nearest
neighbours and nearest neighbours, respectively.
|
physics.comp-ph cs.DC
|
in this paper the efficient space virtualisation for hoshenkopelman algorithm is presented we observe minimal parallel overhead during computations due to negligible communication costs the proposed algorithm is applied for computation of randomsite percolation thresholds for four dimensional simple cubic lattice with sites neighbourhoods containing nextnextnearest neighbours 3nn the obtained percolation thresholds are p_ctextnn01968023 p_ctext2nn00841023 p_ctext3nn00454023 p_ctext2nnnn00618023 p_ctext3nnnn00400023 p_ctext3nn2nn00331023 p_ctext3nn2nnnn00319023 where 2nn and nn stand for nextnearest neighbours and nearest neighbours respectively
|
[['in', 'this', 'paper', 'the', 'efficient', 'space', 'virtualisation', 'for', 'hoshenkopelman', 'algorithm', 'is', 'presented', 'we', 'observe', 'minimal', 'parallel', 'overhead', 'during', 'computations', 'due', 'to', 'negligible', 'communication', 'costs', 'the', 'proposed', 'algorithm', 'is', 'applied', 'for', 'computation', 'of', 'randomsite', 'percolation', 'thresholds', 'for', 'four', 'dimensional', 'simple', 'cubic', 'lattice', 'with', 'sites', 'neighbourhoods', 'containing', 'nextnextnearest', 'neighbours', '3nn', 'the', 'obtained', 'percolation', 'thresholds', 'are', 'p_ctextnn01968023', 'p_ctext2nn00841023', 'p_ctext3nn00454023', 'p_ctext2nnnn00618023', 'p_ctext3nnnn00400023', 'p_ctext3nn2nn00331023', 'p_ctext3nn2nnnn00319023', 'where', '2nn', 'and', 'nn', 'stand', 'for', 'nextnearest', 'neighbours', 'and', 'nearest', 'neighbours', 'respectively']]
|
[-0.15349089741133726, 0.07705700926196117, 0.08087580999216208, 0.06136669437221896, -0.012209129645130955, -0.24626779885819325, 0.15319990768419722, 0.4711238604110594, -0.2051022628035683, -0.23876931813473884, 0.05121972559270664, -0.328530120004255, -0.14437469276957787, 0.07546304624456053, 0.028327286351346768, -0.006381383437949878, 0.06880530492904094, 0.053903942125347944, 0.006181809449425111, -0.3801956127397716, 0.21949388348998933, 0.05283097685672916, 0.24025602042675018, 0.07327405882354539, 0.052835369654572924, 0.08017548475271234, 0.03127654894756583, 0.015526611708516542, -0.1693657791815125, 0.08591786191167418, 0.2261710147301738, 0.02483223653756655, 0.22939989366210423, -0.411338274123577, -0.1312266163671246, 0.15097366492622175, 0.165484917930399, 0.11270783906086133, -0.009624414088634344, -0.2509877298457118, 0.11844561913838754, -0.155590489331203, -0.09583460275943463, -0.06799728119065268, 0.06313463757531002, 0.04526125983549999, -0.3257488227664278, 0.05844194166935407, 0.006479106299006022, 0.08596380226170787, -0.00453255228125132, -0.14994593755556987, -0.01015643086284399, 0.11225727825210645, -0.04464903762217056, 0.07446798460844617, 0.0941630343763301, -0.05592771273502596, -0.18964495955464933, 0.40308064153561224, 0.03615533640751472, -0.14703087292325037, 0.21679054423450278, -0.047514785482333254, -0.16756824628235056, 0.12150310555902812, 0.20483995240468245, 0.05602346669452695, -0.12813050570682838, 0.1328036682662339, 0.06695251547229977, 0.10791281785529394, 0.039554847795695354, -0.025256713709005944, 0.07127095327640955, 0.19530301972364003, 0.1017220961359831, 0.14710937082194364, -0.10531427080814655, -0.17166848197006263, -0.22808519107504532, -0.1259649255241339, -0.25962329038347187, -0.04421512202288096, -0.18619042491638818, -0.14618595854307598, 0.3139251618932646, 0.12450625056562085, 0.20939261646887575, 0.11759002801890557, 0.2704994757014971, 0.03029448248159427, 0.07234573556253543, 0.17215127633165908, 0.1998542619224351, 0.10699594436356655, 0.017768101336864326, -0.18233717698603868, 0.05167762218401409, 0.16306047959683034]
|
1,803.09505
|
Energetics of Hi-C EUV Brightenings
|
We study the thermal structure and energetics of the point-like EUV
brightenings within a system of fan loops observed in the active region
\textsl{AR~11520}. These brightenings were simultaneously observed on 2012 July
11 by the HIgh-resolution Coronal (Hi-C) imager and the Atmospheric Imaging
Assembly (AIA) on board the Solar Dynamics Observatory (SDO). We identified 27
brightenings by automatically determining intensity enhancements in both Hi-C
and AIA ~193~{\AA} light curves. The energetics of these brightenings were
studied by using the Differential Emission Measure (DEM) diagnostics. The DEM
weighted temperatures of these transients are in the range $\log{T} (K) = 6.2 -
6.6$ with radiative energies ${\approx}10^{24-25}$~ergs and densities
${\approx}$ a few times $10^{9}$~cm$^{-3}$. To the best of our knowledge, these
are the smallest brightenings in EUV ever detected. We used these results to
determine the mechanism of energy loss in these brightenings. Our analysis
reveals that the dominant mechanism of energy loss for all the identified
brightenings is conduction rather than radiation.
|
astro-ph.SR
|
we study the thermal structure and energetics of the pointlike euv brightenings within a system of fan loops observed in the active region textslar11520 these brightenings were simultaneously observed on 2012 july 11 by the highresolution coronal hic imager and the atmospheric imaging assembly aia on board the solar dynamics observatory sdo we identified 27 brightenings by automatically determining intensity enhancements in both hic and aia 193aa light curves the energetics of these brightenings were studied by using the differential emission measure dem diagnostics the dem weighted temperatures of these transients are in the range logt k 62 66 with radiative energies approx102425ergs and densities approx a few times 109cm3 to the best of our knowledge these are the smallest brightenings in euv ever detected we used these results to determine the mechanism of energy loss in these brightenings our analysis reveals that the dominant mechanism of energy loss for all the identified brightenings is conduction rather than radiation
|
[['we', 'study', 'the', 'thermal', 'structure', 'and', 'energetics', 'of', 'the', 'pointlike', 'euv', 'brightenings', 'within', 'a', 'system', 'of', 'fan', 'loops', 'observed', 'in', 'the', 'active', 'region', 'textslar11520', 'these', 'brightenings', 'were', 'simultaneously', 'observed', 'on', '2012', 'july', '11', 'by', 'the', 'highresolution', 'coronal', 'hic', 'imager', 'and', 'the', 'atmospheric', 'imaging', 'assembly', 'aia', 'on', 'board', 'the', 'solar', 'dynamics', 'observatory', 'sdo', 'we', 'identified', '27', 'brightenings', 'by', 'automatically', 'determining', 'intensity', 'enhancements', 'in', 'both', 'hic', 'and', 'aia', '193aa', 'light', 'curves', 'the', 'energetics', 'of', 'these', 'brightenings', 'were', 'studied', 'by', 'using', 'the', 'differential', 'emission', 'measure', 'dem', 'diagnostics', 'the', 'dem', 'weighted', 'temperatures', 'of', 'these', 'transients', 'are', 'in', 'the', 'range', 'logt', 'k', '62', '66', 'with', 'radiative', 'energies', 'approx102425ergs', 'and', 'densities', 'approx', 'a', 'few', 'times', '109cm3', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'these', 'are', 'the', 'smallest', 'brightenings', 'in', 'euv', 'ever', 'detected', 'we', 'used', 'these', 'results', 'to', 'determine', 'the', 'mechanism', 'of', 'energy', 'loss', 'in', 'these', 'brightenings', 'our', 'analysis', 'reveals', 'that', 'the', 'dominant', 'mechanism', 'of', 'energy', 'loss', 'for', 'all', 'the', 'identified', 'brightenings', 'is', 'conduction', 'rather', 'than', 'radiation']]
|
[-0.06832143228655313, 0.19431536769862198, 0.013651564924912468, 0.1763272256609705, -0.02398617011287315, -0.03333113369810733, 0.013908521129874287, 0.47904067353647983, -0.20427155205801983, -0.4023041744141062, 0.09428873717824551, -0.3164375328346138, -0.11534478515386581, 0.2311839518866911, -0.00029172200526431157, 0.023753992240330216, 0.1177696489966406, -0.07204609978788348, 0.0030798405708424795, -0.18075291955825773, 0.23355400967144757, 0.12004493166852719, 0.18619510492274335, 0.024782854541661632, 0.06622358109612184, -0.1006833224295591, -0.06585390765552118, 0.0011510237455249401, -0.127809189003401, 0.05059790478835392, 0.2200495446661404, 0.09520477247365104, 0.18912954398677062, -0.3988376344453282, -0.25459496227721834, -0.003353321711253968, 0.1435052452662331, -0.06188646212863813, 0.016866357506187573, -0.284796092665167, 0.06506223062788889, -0.04583549214257105, -0.07950872098908397, 0.05038386907659851, -0.001277834704964404, 0.021017690381972463, -0.24474499634338046, 0.06989681825136683, -0.014786052230632845, 0.1273896911457347, -0.12996715213510263, -0.06045420581377022, -0.07911953030845185, 0.13268929049313352, 0.015943705500251832, 0.010552605007520052, 0.1853211914740835, -0.09049711985940671, -0.11315651865569269, 0.3282594036804564, -0.06014062217067835, 0.051666975930439916, 0.1968818030966695, -0.23687640949193933, -0.14589049100614848, 0.27183230953872395, 0.12569813142607736, 0.1268210076863409, -0.1673731123379752, -0.017710907884523463, -0.04535704952513408, 0.1616007004060729, 0.09984576667267474, 0.04353522647181111, 0.23055307472949244, 0.10807862897940383, -0.019590238094401018, 0.1136779928243286, -0.30586609484592253, -0.07465294939109901, -0.2859719517717885, -0.11285276990383863, -0.04931198203251074, 0.05063639486069156, -0.05252292923663393, -0.16539650328181518, 0.41330612567105113, 0.15843586680319183, 0.2167471077732125, -0.04128485862580929, 0.2762882191640366, 0.07661537868919883, 0.07645854863240295, 0.1601225425263831, 0.30037364805900274, 0.16358864626099776, 0.2037363912210248, -0.27074296194407493, 0.035311032549306086, 0.07944678928655614]
|
1,803.09506
|
Existence of constant scalar curvature Kaehler cone metrics, properness and geodesic stability
|
We show that the existence of constant scalar curvature K\"ahler (cscK) metrics with cone singularities is equivalent to the properness of log $K$-energy. We also prove their equivalence to the geodesic stability. They are extensions of the solution of the properness conjecture and Donaldson's geodesic stability conjecture of the cscK problem for smooth K\"ahler metrics by Chen-Cheng to the setting of cscK cone metrics.
One applications of our main results is that we introduce and construct singular cscK metrics with possible degeneration in big cohomology class. As another application, we also prove both openness and approximation property for the path of cscK cone metrics, which are paralleling to Donaldson's continuity method through K\"ahler-Einstein cone metrics in the resolution of Yau-Tian-Donaldson conjecture for Fano K\"ahler-Einstein metrics.
|
math.DG math.AP
|
we show that the existence of constant scalar curvature kahler csck metrics with cone singularities is equivalent to the properness of log kenergy we also prove their equivalence to the geodesic stability they are extensions of the solution of the properness conjecture and donaldsons geodesic stability conjecture of the csck problem for smooth kahler metrics by chencheng to the setting of csck cone metrics one applications of our main results is that we introduce and construct singular csck metrics with possible degeneration in big cohomology class as another application we also prove both openness and approximation property for the path of csck cone metrics which are paralleling to donaldsons continuity method through kahlereinstein cone metrics in the resolution of yautiandonaldson conjecture for fano kahlereinstein metrics
|
[['we', 'show', 'that', 'the', 'existence', 'of', 'constant', 'scalar', 'curvature', 'kahler', 'csck', 'metrics', 'with', 'cone', 'singularities', 'is', 'equivalent', 'to', 'the', 'properness', 'of', 'log', 'kenergy', 'we', 'also', 'prove', 'their', 'equivalence', 'to', 'the', 'geodesic', 'stability', 'they', 'are', 'extensions', 'of', 'the', 'solution', 'of', 'the', 'properness', 'conjecture', 'and', 'donaldsons', 'geodesic', 'stability', 'conjecture', 'of', 'the', 'csck', 'problem', 'for', 'smooth', 'kahler', 'metrics', 'by', 'chencheng', 'to', 'the', 'setting', 'of', 'csck', 'cone', 'metrics', 'one', 'applications', 'of', 'our', 'main', 'results', 'is', 'that', 'we', 'introduce', 'and', 'construct', 'singular', 'csck', 'metrics', 'with', 'possible', 'degeneration', 'in', 'big', 'cohomology', 'class', 'as', 'another', 'application', 'we', 'also', 'prove', 'both', 'openness', 'and', 'approximation', 'property', 'for', 'the', 'path', 'of', 'csck', 'cone', 'metrics', 'which', 'are', 'paralleling', 'to', 'donaldsons', 'continuity', 'method', 'through', 'kahlereinstein', 'cone', 'metrics', 'in', 'the', 'resolution', 'of', 'yautiandonaldson', 'conjecture', 'for', 'fano', 'kahlereinstein', 'metrics']]
|
[-0.23594366329535843, -0.05473870079219341, -0.11320041262451559, 0.13502427654154597, -0.1308798474818468, -0.17488137893378736, -0.03627194178313948, 0.3703618403151631, -0.2888687746450305, -0.19295501281693578, 0.12445600832626223, -0.2908665977809578, -0.21587134148180484, 0.18017014651373028, -0.20184556540101767, 0.07090343714132905, 0.09705711217969656, 0.017335774529725314, -0.12536486145248638, -0.341555575793609, 0.5410482353568077, -0.026214540295302867, 0.25323221457190814, 0.22721563773602246, 0.11903262678533792, -0.04776021872088313, 0.048676327351480725, 0.04216906851530075, -0.18905353443941567, 0.13790548536088318, 0.25213685252144935, 0.15171161913499237, 0.21782892555370928, -0.2829557017683983, -0.18640856189094485, 0.17545801554992796, 0.0674531464278698, 0.025661051926203073, -0.03750794212892652, -0.30095167142897844, 0.17393614099919796, -0.04803288313373923, -0.27105384450778364, -0.12604974710568786, -0.039909096661023796, 0.02734935972467065, -0.16022926346410532, 0.011060894641559571, 0.11712585469335318, 0.010952759616076946, -0.11166388370469213, -0.05578920616954565, -0.07503514641337097, 0.03412351323664188, 0.12369286887929774, 0.06813286471739412, 0.08634076953306793, -0.06722283602738753, -0.1279572180788964, 0.36505212203599513, -0.15572475031763316, -0.2700289307460189, 0.07278747833520174, -0.10109828969463706, -0.121277709254995, 0.09893836375325918, 0.10615168033074587, 0.2521685747504234, -0.019234048575162886, 0.16235888523096217, -0.05354092359729111, 0.027973704496398567, 0.17860194662958384, -0.0028454942405223846, 0.09025478406791808, 0.07610458099469543, 0.2018468226492405, 0.09698853467218578, 0.022450482469052076, -0.0850451503363438, -0.38629833816736936, -0.26834699721261857, -0.08457431858032942, 0.21497295327484608, -0.195054168496863, -0.2286109841503203, 0.3857796784779057, 0.028806151941418646, 0.1763998330105096, 0.18006132318917661, 0.24994189803302289, -0.005088866299018264, -0.0064153152592480184, 0.09899054418131709, 0.25485909094288944, 0.20805019684135914, 0.027855653945356607, -0.12683040137775242, -0.049764637537300586, 0.20653761783987284]
|
1,803.09507
|
Wavelet spectral testing: application to nonstationary circadian rhythms
|
Rhythmic data are ubiquitous in the life sciences. Biologists need reliable
statistical tests to identify whether a particular experimental treatment has
caused a significant change in a rhythmic signal. When these signals display
nonstationary behaviour, as is common in many biological systems, the
established methodologies may be misleading. Therefore, there is a real need
for new methodology that enables the formal comparison of nonstationary
processes. As circadian behaviour is best understood in the spectral domain,
here we develop novel hypothesis testing procedures in the (wavelet) spectral
domain, embedding replicate information when available. The data are modelled
as realisations of locally stationary wavelet processes, allowing us to define
and rigorously estimate their evolutionary wavelet spectra. Motivated by three
complementary applications in circadian biology, our new methodology allows the
identification of three specific types of spectral difference. We demonstrate
the advantages of our methodology over alternative approaches, by means of a
comprehensive simulation study and real data applications, using both published
and newly generated circadian datasets. In contrast to the current standard
methodologies, our method successfully identifies differences within the
motivating circadian datasets, and facilitates wider ranging analyses of
rhythmic biological data in general.
|
stat.AP
|
rhythmic data are ubiquitous in the life sciences biologists need reliable statistical tests to identify whether a particular experimental treatment has caused a significant change in a rhythmic signal when these signals display nonstationary behaviour as is common in many biological systems the established methodologies may be misleading therefore there is a real need for new methodology that enables the formal comparison of nonstationary processes as circadian behaviour is best understood in the spectral domain here we develop novel hypothesis testing procedures in the wavelet spectral domain embedding replicate information when available the data are modelled as realisations of locally stationary wavelet processes allowing us to define and rigorously estimate their evolutionary wavelet spectra motivated by three complementary applications in circadian biology our new methodology allows the identification of three specific types of spectral difference we demonstrate the advantages of our methodology over alternative approaches by means of a comprehensive simulation study and real data applications using both published and newly generated circadian datasets in contrast to the current standard methodologies our method successfully identifies differences within the motivating circadian datasets and facilitates wider ranging analyses of rhythmic biological data in general
|
[['rhythmic', 'data', 'are', 'ubiquitous', 'in', 'the', 'life', 'sciences', 'biologists', 'need', 'reliable', 'statistical', 'tests', 'to', 'identify', 'whether', 'a', 'particular', 'experimental', 'treatment', 'has', 'caused', 'a', 'significant', 'change', 'in', 'a', 'rhythmic', 'signal', 'when', 'these', 'signals', 'display', 'nonstationary', 'behaviour', 'as', 'is', 'common', 'in', 'many', 'biological', 'systems', 'the', 'established', 'methodologies', 'may', 'be', 'misleading', 'therefore', 'there', 'is', 'a', 'real', 'need', 'for', 'new', 'methodology', 'that', 'enables', 'the', 'formal', 'comparison', 'of', 'nonstationary', 'processes', 'as', 'circadian', 'behaviour', 'is', 'best', 'understood', 'in', 'the', 'spectral', 'domain', 'here', 'we', 'develop', 'novel', 'hypothesis', 'testing', 'procedures', 'in', 'the', 'wavelet', 'spectral', 'domain', 'embedding', 'replicate', 'information', 'when', 'available', 'the', 'data', 'are', 'modelled', 'as', 'realisations', 'of', 'locally', 'stationary', 'wavelet', 'processes', 'allowing', 'us', 'to', 'define', 'and', 'rigorously', 'estimate', 'their', 'evolutionary', 'wavelet', 'spectra', 'motivated', 'by', 'three', 'complementary', 'applications', 'in', 'circadian', 'biology', 'our', 'new', 'methodology', 'allows', 'the', 'identification', 'of', 'three', 'specific', 'types', 'of', 'spectral', 'difference', 'we', 'demonstrate', 'the', 'advantages', 'of', 'our', 'methodology', 'over', 'alternative', 'approaches', 'by', 'means', 'of', 'a', 'comprehensive', 'simulation', 'study', 'and', 'real', 'data', 'applications', 'using', 'both', 'published', 'and', 'newly', 'generated', 'circadian', 'datasets', 'in', 'contrast', 'to', 'the', 'current', 'standard', 'methodologies', 'our', 'method', 'successfully', 'identifies', 'differences', 'within', 'the', 'motivating', 'circadian', 'datasets', 'and', 'facilitates', 'wider', 'ranging', 'analyses', 'of', 'rhythmic', 'biological', 'data', 'in', 'general']]
|
[-0.0458858586785027, 0.049897372814787865, -0.10103832459814537, 0.10266389943414349, -0.0964824750359791, -0.12524217056973916, 0.05385014433219718, 0.39927924673005083, -0.26427436445889424, -0.3118742381144936, 0.11453253173143214, -0.24049310984635971, -0.21774268663072385, 0.2748685605811261, -0.10617992343948875, 0.07675521611721099, 0.08197701877603929, -0.017109565713326447, -0.0027036345018132124, -0.19674719369989666, 0.26649624657996657, 0.023729294409956008, 0.3394363705374417, -0.01748263699846575, 0.03946598199703052, -0.03042426308911672, -0.12194962351774545, -0.007841704226545213, -0.10533339318396884, 0.13287261479126755, 0.3287094041261298, 0.21407255527446978, 0.31217295728614164, -0.42474852605179575, -0.28155639388326864, 0.11321728602464039, 0.1523675572486051, 0.09875669468253061, -0.04498879716387213, -0.28434348186904873, 0.05609410391540829, -0.13992106643915272, -0.09594734191099026, -0.15677190601612287, 0.0170037790837038, 0.030594980092776797, -0.27650037840673275, 0.10632934402777512, 0.03404641500674188, 0.1323983564749748, -0.06469908889236346, -0.08995667956029745, 0.021127821660532693, 0.18868829258675154, 0.04522170060833256, -0.04013171939550375, 0.14022775500294907, -0.060555362004379276, -0.17887985740041282, 0.3777952539239777, -0.05078787753912669, -0.1867084020001736, 0.24795518601483005, -0.10143415661150357, -0.1787178138984018, 0.09864016493277934, 0.18250779757060323, 0.0769261323681955, -0.2163494343411306, 0.03774519161258164, 0.015367648695246316, 0.17470470856157286, 0.036498560897901676, 0.0018520983785492717, 0.19086564206615245, 0.21947970254526203, -0.021147547930316552, 0.10485483159512417, -0.07562618398636307, -0.10403539236964814, -0.2599297350834604, -0.11072766532500584, -0.16504008516858448, -0.011332008496538037, -0.10203840682667457, -0.1666972520276128, 0.4314300171584667, 0.21009357468763787, 0.14453986299304233, 0.024911082239365594, 0.3018105700551435, 0.047486676630796865, 0.0540719424013029, -0.0013602673971035983, 0.18030689651580664, 0.09094124917707329, 0.1310012541331768, -0.17197196752507202, 0.08337131029960194, -0.048781737830722705]
|
1,803.09508
|
Finite-key security analysis for quantum key distribution with leaky
sources
|
Security proofs of quantum key distribution (QKD) typically assume that the
devices of the legitimate users are perfectly shielded from the eavesdropper.
This assumption is, however, very hard to meet in practice, and thus the
security of current QKD implementations is not guaranteed. Here, we fill this
gap by providing a finite-key security analysis for QKD which is valid against
arbitrary information leakage from the state preparation process of the
legitimate users. For this, we extend the techniques introduced in (New J.
Phys. 18, 065008, (2016)) to the finite-key regime, and we evaluate the
security of a leaky decoy-state BB84 protocol with biased basis choice, which
is one of the most implemented QKD schemes today. Our simulation results
demonstrate the practicability of QKD over long distances and within a
reasonable time frame given that the legitimate users' devices are sufficiently
isolated.
|
quant-ph
|
security proofs of quantum key distribution qkd typically assume that the devices of the legitimate users are perfectly shielded from the eavesdropper this assumption is however very hard to meet in practice and thus the security of current qkd implementations is not guaranteed here we fill this gap by providing a finitekey security analysis for qkd which is valid against arbitrary information leakage from the state preparation process of the legitimate users for this we extend the techniques introduced in new j phys 18 065008 2016 to the finitekey regime and we evaluate the security of a leaky decoystate bb84 protocol with biased basis choice which is one of the most implemented qkd schemes today our simulation results demonstrate the practicability of qkd over long distances and within a reasonable time frame given that the legitimate users devices are sufficiently isolated
|
[['security', 'proofs', 'of', 'quantum', 'key', 'distribution', 'qkd', 'typically', 'assume', 'that', 'the', 'devices', 'of', 'the', 'legitimate', 'users', 'are', 'perfectly', 'shielded', 'from', 'the', 'eavesdropper', 'this', 'assumption', 'is', 'however', 'very', 'hard', 'to', 'meet', 'in', 'practice', 'and', 'thus', 'the', 'security', 'of', 'current', 'qkd', 'implementations', 'is', 'not', 'guaranteed', 'here', 'we', 'fill', 'this', 'gap', 'by', 'providing', 'a', 'finitekey', 'security', 'analysis', 'for', 'qkd', 'which', 'is', 'valid', 'against', 'arbitrary', 'information', 'leakage', 'from', 'the', 'state', 'preparation', 'process', 'of', 'the', 'legitimate', 'users', 'for', 'this', 'we', 'extend', 'the', 'techniques', 'introduced', 'in', 'new', 'j', 'phys', '18', '065008', '2016', 'to', 'the', 'finitekey', 'regime', 'and', 'we', 'evaluate', 'the', 'security', 'of', 'a', 'leaky', 'decoystate', 'bb84', 'protocol', 'with', 'biased', 'basis', 'choice', 'which', 'is', 'one', 'of', 'the', 'most', 'implemented', 'qkd', 'schemes', 'today', 'our', 'simulation', 'results', 'demonstrate', 'the', 'practicability', 'of', 'qkd', 'over', 'long', 'distances', 'and', 'within', 'a', 'reasonable', 'time', 'frame', 'given', 'that', 'the', 'legitimate', 'users', 'devices', 'are', 'sufficiently', 'isolated']]
|
[-0.19075252045340613, 0.03778534887626054, -0.10673109066287875, 0.04839499724799189, -0.0059832158954219615, -0.265234885238613, 0.11375031262761683, 0.36042541338804557, -0.19447221355066893, -0.28936778787021517, 0.08302586161901394, -0.2351936995520765, -0.07170264429828906, 0.22355899022535441, -0.16359628012555763, 0.11341139692433364, 0.04158105651999936, -0.034644342688117044, -0.005336784829710881, -0.3103712109307237, 0.3076184584754222, 0.08382178349536018, 0.35056982434735345, 0.05983183529980956, 0.05859066195726553, 0.020505796411200195, -0.013951003085821867, -0.07443409655507363, -0.11480003394773114, 0.08404912190439166, 0.3446931036598716, 0.14886104042067172, 0.33080244819957316, -0.3923097271208011, -0.18185536755440454, 0.07527983398011602, 0.13389876107718293, 0.1494235118829599, -0.046183666343146815, -0.3379073086828786, 0.11254833602009619, -0.25387413544639786, -0.09895061552569977, -0.039157255229058, -0.043447538193130325, 0.02514345790606309, -0.25927704117584527, 0.0028345391892411922, 0.050693416844967566, 0.04424034672003266, 0.05289785167535087, -0.042890223908958074, 0.04304529752430394, 0.15922375019236817, 0.004567977950655598, -0.016423662188165683, 0.159813213631088, -0.09991280742748995, -0.11902744021821529, 0.3226444123359067, -0.0005988042970049254, -0.18318686157081884, 0.1582859599771282, -0.0855426902895965, -0.11110760990517042, 0.09745868152099932, 0.14018164998488436, 0.0759470245622574, -0.1710335146966027, 0.047392439753137505, -0.04684086214934297, 0.24282556852154064, 0.06275930077478237, 0.13580739794543395, 0.1491556577912882, 0.14349530964878435, 0.07767542560934915, 0.06716141661675316, -0.0747812841300595, -0.1508149190381473, -0.3151116987941324, -0.17722041881643236, -0.2805719480301577, 0.07650349480820348, -0.03452420816890951, -0.09216645389385786, 0.3665054303986939, 0.25006103191148255, 0.10236355162007695, 0.0687042517002989, 0.4371045472856664, 0.04277433491731393, 0.04991984567505882, 0.18362402614100393, 0.2662030248514687, 0.09009387404393696, 0.11991160166373886, -0.11357174945684771, 0.15357390705806515, -0.061549777478798695]
|
1,803.09509
|
A comparative study above two self-tuning controllers with application
to the control of synchronous generator excitation system
|
This paper presents two self-tuning control structures synthesized through
the minimization of two criterion functions. It is described the computation
methodology of the control laws, both being particularized for the case of the
synchronous generator's excitation control. The parameters estimator is
considered the recursive least square error (RLSE) algorithm. In order to
validate the considered control structures, two comparative study cases by
computer simulation are presented.
|
cs.SY
|
this paper presents two selftuning control structures synthesized through the minimization of two criterion functions it is described the computation methodology of the control laws both being particularized for the case of the synchronous generators excitation control the parameters estimator is considered the recursive least square error rlse algorithm in order to validate the considered control structures two comparative study cases by computer simulation are presented
|
[['this', 'paper', 'presents', 'two', 'selftuning', 'control', 'structures', 'synthesized', 'through', 'the', 'minimization', 'of', 'two', 'criterion', 'functions', 'it', 'is', 'described', 'the', 'computation', 'methodology', 'of', 'the', 'control', 'laws', 'both', 'being', 'particularized', 'for', 'the', 'case', 'of', 'the', 'synchronous', 'generators', 'excitation', 'control', 'the', 'parameters', 'estimator', 'is', 'considered', 'the', 'recursive', 'least', 'square', 'error', 'rlse', 'algorithm', 'in', 'order', 'to', 'validate', 'the', 'considered', 'control', 'structures', 'two', 'comparative', 'study', 'cases', 'by', 'computer', 'simulation', 'are', 'presented']]
|
[-0.17957263376394456, 0.02441180477652586, -0.05885502927456841, 0.07289603143087306, -0.025139168970230403, -0.1734736478379504, -0.009364131624655178, 0.37677604885715427, -0.2927790003137268, -0.3188974948769266, 0.14774435488189655, -0.2147518659970074, -0.17975474752937304, 0.22173427170932744, -0.039518798556386944, 0.12336800853496022, 0.022533788264616196, -0.020115546374158425, -0.05487194090065631, -0.27127064397615014, 0.2476697085622811, 0.051144374308712555, 0.3115372439056183, -0.051210352745274024, 0.10620620045941023, 0.007108763826898102, -0.04450432420090885, 0.0008025527139938222, -0.1598164797054999, 0.1085440687708218, 0.2479908409048662, 0.11823692730148182, 0.30845539249253995, -0.37628372153267264, -0.19485847872089257, 0.07776676692689459, 0.13450330170047836, 0.0855629269146558, -0.04777466670864008, -0.2213990666063954, 0.10527762098266094, -0.18589517218766338, -0.10668137500937463, -0.08188449722630056, -0.072814213321897, 0.04016378044616431, -0.2905505040914498, 0.033955214164135133, 0.042506295002319595, 0.07192900151395323, -0.07821796692653814, -0.11968903089026836, 0.006649679751276519, 0.10962256623492012, 0.03131103584768646, -0.05032790229641691, 0.12230200321187801, -0.06484258027084058, -0.18860029113112073, 0.36092198319789587, 0.0376920965553092, -0.2624199427152758, 0.14380994175603104, -0.0812418208330531, -0.08849242609523406, 0.10464985805535407, 0.18344694761220703, 0.1317727441730147, -0.2099006695559982, 0.05393836693849263, -0.012685289084346909, 0.14108719443725987, 0.018185619116676124, -0.01303562352603132, 0.10056110498297846, 0.20036043705080042, 0.07960564501505966, 0.19676555951379918, -0.04463227356036165, -0.1748384674164382, -0.3376423606409155, -0.11377160791589906, -0.1825246928316174, -0.06135281063898495, -0.064189433282467, -0.14480882627663738, 0.4169342555105686, 0.14175063909638222, 0.10989760052920743, 0.07025907984511419, 0.3390647114226312, 0.14039908588694577, 0.021640186649606083, 0.07907596888077079, 0.2485615084737991, 0.17180620828488222, 0.04919484004406541, -0.24118633267018152, 0.07204999448202382, 0.0909398205888768]
|
1,803.0951
|
Asymptotic expansions of the Witten-Reshetikhin-Turaev Invariants of
Mapping Tori I
|
In this paper we engage in a general study of the asymptotic expansion of the
Witten-Reshetikhin-Turaev invariants of mapping tori of surface mapping class
group elements. We use the geometric construction of the
Witten-Reshetikhin-Turaev TQFT via the geometric quantization of moduli spaces
of flat connections on surfaces. We identify assumptions on the mapping class
group elements that allow us to provide a full asymptotic expansion. In
particular, we show that our results apply to all pseudo-Anosov mapping classes
on a punctured torus and show by example that our assumptions on the mapping
class group elements are strictly weaker than hitherto successfully considered
assumptions in this context. The proof of our main theorem relies on our new
results regarding asymptotic expansions of oscillatory integrals, which allows
us to go significantly beyond the standard transversely cut out assumption on
the fixed point set. This makes use of Picard-Lefschetz theory for Laplace
integrals.
|
math.DG
|
in this paper we engage in a general study of the asymptotic expansion of the wittenreshetikhinturaev invariants of mapping tori of surface mapping class group elements we use the geometric construction of the wittenreshetikhinturaev tqft via the geometric quantization of moduli spaces of flat connections on surfaces we identify assumptions on the mapping class group elements that allow us to provide a full asymptotic expansion in particular we show that our results apply to all pseudoanosov mapping classes on a punctured torus and show by example that our assumptions on the mapping class group elements are strictly weaker than hitherto successfully considered assumptions in this context the proof of our main theorem relies on our new results regarding asymptotic expansions of oscillatory integrals which allows us to go significantly beyond the standard transversely cut out assumption on the fixed point set this makes use of picardlefschetz theory for laplace integrals
|
[['in', 'this', 'paper', 'we', 'engage', 'in', 'a', 'general', 'study', 'of', 'the', 'asymptotic', 'expansion', 'of', 'the', 'wittenreshetikhinturaev', 'invariants', 'of', 'mapping', 'tori', 'of', 'surface', 'mapping', 'class', 'group', 'elements', 'we', 'use', 'the', 'geometric', 'construction', 'of', 'the', 'wittenreshetikhinturaev', 'tqft', 'via', 'the', 'geometric', 'quantization', 'of', 'moduli', 'spaces', 'of', 'flat', 'connections', 'on', 'surfaces', 'we', 'identify', 'assumptions', 'on', 'the', 'mapping', 'class', 'group', 'elements', 'that', 'allow', 'us', 'to', 'provide', 'a', 'full', 'asymptotic', 'expansion', 'in', 'particular', 'we', 'show', 'that', 'our', 'results', 'apply', 'to', 'all', 'pseudoanosov', 'mapping', 'classes', 'on', 'a', 'punctured', 'torus', 'and', 'show', 'by', 'example', 'that', 'our', 'assumptions', 'on', 'the', 'mapping', 'class', 'group', 'elements', 'are', 'strictly', 'weaker', 'than', 'hitherto', 'successfully', 'considered', 'assumptions', 'in', 'this', 'context', 'the', 'proof', 'of', 'our', 'main', 'theorem', 'relies', 'on', 'our', 'new', 'results', 'regarding', 'asymptotic', 'expansions', 'of', 'oscillatory', 'integrals', 'which', 'allows', 'us', 'to', 'go', 'significantly', 'beyond', 'the', 'standard', 'transversely', 'cut', 'out', 'assumption', 'on', 'the', 'fixed', 'point', 'set', 'this', 'makes', 'use', 'of', 'picardlefschetz', 'theory', 'for', 'laplace', 'integrals']]
|
[-0.1236150198088338, 0.02847261693328619, -0.14179606466864547, 0.07429722796582307, -0.11296046068426221, -0.08229515301374098, 0.07565390951621036, 0.3366127336894472, -0.2565575276811918, -0.23278994232338543, 0.10992158442270011, -0.23000701313692842, -0.20552778687948983, 0.23788970006164165, -0.11028107004240155, 0.005294702971975008, 0.05991360336386909, 0.01938548558411033, -0.12675382539164276, -0.24685375418514013, 0.41750028912288445, -0.020390373502935592, 0.2630129154678434, 0.02651762337574231, 0.08076584817841649, 0.04274528237971632, -0.06764619146784147, -0.029023777482410272, -0.1801003463433881, 0.1873232398244242, 0.21838836694757144, 0.054129451715076965, 0.20348497938364743, -0.4082519751538833, -0.21128409637584505, 0.11096376937503616, 0.11270348673375945, 0.0817237876316843, -0.017097871668326357, -0.26845970189819734, 0.08713981760665775, -0.13494992589578034, -0.18092268164851702, -0.12132446086034179, -0.015619963606198628, 0.016466670469380915, -0.23415398006637891, -0.017527447361499072, 0.1105015743089219, 0.07039109279712041, -0.03294256041175686, -0.07695755921847497, 0.021614989956530432, 0.13419104863268633, 0.05300761318881996, 0.010497181656149527, 0.12153291324153542, -0.07870353629657378, -0.07889826260351886, 0.3492067774757743, -0.0822608997382728, -0.23573528790070364, 0.19633861963171512, -0.168833031905815, -0.2238483005979409, 0.11185083339611689, 0.14628961720503866, 0.17733543769456447, -0.09324124007175366, 0.15286483058046238, -0.10727897302790855, 0.12376383771596011, 0.0828200766723603, 0.009231913942300404, 0.13862554458901286, 0.09644613046664745, 0.095657987271746, 0.15110298116070528, -0.024407823014383514, -0.11105729411472566, -0.38326652778623005, -0.19595150386468352, -0.14001308334137624, 0.10817052552786967, -0.12375045399482285, -0.18623419350323578, 0.41905874576419594, 0.14716150572213033, 0.16125706776976587, 0.13873669448522075, 0.22616776241610448, 0.06310641546665768, 0.07132610597647726, 0.061981287306795516, 0.18583737099853656, 0.16729372361209244, -0.013164214926461379, -0.1683353709631289, 0.005132967798660199, 0.18550124036458632]
|
1,803.09511
|
Left-eigenvectors are certificates of the Orbit Problem
|
This paper investigates the connexion between the Kannan-Lipton Orbit Problem
and the polynomial invariant generator algorithm PILA based on eigenvectors
computation. Namely, we reduce the problem of generating linear and polynomial
certificates of non-reachability for the Orbit Problem for linear
transformations with rational coefficients to the generalized eigenvector
problem. Also, we prove the existence of such certificates for any
transformation with integer coefficients, which is not the case with rational
coefficients.
|
cs.LO
|
this paper investigates the connexion between the kannanlipton orbit problem and the polynomial invariant generator algorithm pila based on eigenvectors computation namely we reduce the problem of generating linear and polynomial certificates of nonreachability for the orbit problem for linear transformations with rational coefficients to the generalized eigenvector problem also we prove the existence of such certificates for any transformation with integer coefficients which is not the case with rational coefficients
|
[['this', 'paper', 'investigates', 'the', 'connexion', 'between', 'the', 'kannanlipton', 'orbit', 'problem', 'and', 'the', 'polynomial', 'invariant', 'generator', 'algorithm', 'pila', 'based', 'on', 'eigenvectors', 'computation', 'namely', 'we', 'reduce', 'the', 'problem', 'of', 'generating', 'linear', 'and', 'polynomial', 'certificates', 'of', 'nonreachability', 'for', 'the', 'orbit', 'problem', 'for', 'linear', 'transformations', 'with', 'rational', 'coefficients', 'to', 'the', 'generalized', 'eigenvector', 'problem', 'also', 'we', 'prove', 'the', 'existence', 'of', 'such', 'certificates', 'for', 'any', 'transformation', 'with', 'integer', 'coefficients', 'which', 'is', 'not', 'the', 'case', 'with', 'rational', 'coefficients']]
|
[-0.17208673473713654, 0.004733269335702062, -0.05451407141185233, 0.036881857671375785, -0.1302006764869605, -0.14836220592925592, -0.0018438635377346405, 0.3006657427176833, -0.38870518423084705, -0.23330618893128952, 0.14643775425585254, -0.24767338155901858, -0.23076993418591363, 0.20108544482583446, -0.0537989750500336, 0.1445293979187097, 0.05355904890623476, 0.03654462826837387, -0.12591474306370531, -0.2943638209519642, 0.3602419918136937, 0.0032476366414422434, 0.18687677845092757, 0.06211371024006179, 0.20536112140065857, 0.08377974508995456, -0.017932243718366537, -0.04434374204969832, -0.12365527306018131, 0.13662289583922496, 0.2849346115386912, 0.11900349344858634, 0.2450800887708153, -0.37636223297033994, -0.07387932860957724, 0.21429014304386718, 0.10163151925163609, 0.08944377882040239, -0.020195132845713358, -0.21661548205717865, 0.159184924872326, -0.13495170495339803, -0.16181469352117606, -0.04403447096369096, 0.030654474507485117, 0.030862568691372872, -0.35326308603398504, 0.052133705912430224, 0.1015112894853311, 0.09326144124913428, -0.05307285892777145, -0.10008307549038103, 0.03863953336008957, 0.06774073355565113, 0.034050376004805524, -0.03507581959877695, 0.03787269337501909, -0.048898999642447705, -0.15208291159942747, 0.3696174634354455, -0.04496857138084514, -0.29674469591783625, 0.09386806754461889, -0.08320954791935427, -0.1833201766080622, 0.058875744171174506, 0.1722964140453509, 0.14959172192029654, -0.06585918099486403, 0.15499049653798075, -0.1121952162789447, 0.1379305180893945, 0.11711838973153915, -0.004671022962689416, 0.1315000211420868, 0.005947083820189748, 0.13776755025610327, 0.15560897660574743, 0.03689574054109731, -0.09510395899415017, -0.27789747965122974, -0.16644631875678897, -0.18020755469665994, 0.009707598538079764, -0.12213559762666201, -0.21031470632712757, 0.41398170132722173, 0.09404582377880745, 0.1697800216797207, 0.16682159532959173, 0.2504536749262895, 0.19977803005437766, -0.005105466714927128, 0.10051641409019274, 0.13228321131318807, 0.1438879827569638, 0.0421986888628453, -0.24756335776432284, 0.10350404339842498, 0.2334021832527859]
|
1,803.09512
|
Domain-wall-assisted giant magnetoimpedance of thin-wall ferromagnetic
nanotubes
|
We study the effciency of the magnetoimpedance (MI) of thin-wall
circumferentially ordered nanotubes in sub-GHz and GHz frequency regimes using
micromagnetic simulations. We consider empty ferromagnetic tubes as well as
tubes filled with non-magnetic conductors of circular cross-section (nanowire
coverings) focusing on the low-field regime of MI (below the characteristic
field of the low-frequency ferromagnetic resonance). In this field area, the
effcient mechanism of MI is related to oscillations of the positions of
(perpendicular to the tube axis) domain walls (DWs). Two mechanisms of driving
the DW motion by the ac current are taken into account; the driving via the
Oersted field and via the spintransfer torque. The simulations are performed
for Co nanotubes of the diameter of 300nm. Achievable low-field MI exceeds
100%, while the field region of a high sensitivity of that DW-based giant MI is
of the width of tens of kA/m. The later is widely adjustable with changing the
density of the driving ac current, its frequency, and the nanotube length. Of
particular interest is the resonant motion of DW due to the interaction with
the nanotube ends the conditions of whom are discussed.
|
cond-mat.mes-hall
|
we study the effciency of the magnetoimpedance mi of thinwall circumferentially ordered nanotubes in subghz and ghz frequency regimes using micromagnetic simulations we consider empty ferromagnetic tubes as well as tubes filled with nonmagnetic conductors of circular crosssection nanowire coverings focusing on the lowfield regime of mi below the characteristic field of the lowfrequency ferromagnetic resonance in this field area the effcient mechanism of mi is related to oscillations of the positions of perpendicular to the tube axis domain walls dws two mechanisms of driving the dw motion by the ac current are taken into account the driving via the oersted field and via the spintransfer torque the simulations are performed for co nanotubes of the diameter of 300nm achievable lowfield mi exceeds 100 while the field region of a high sensitivity of that dwbased giant mi is of the width of tens of kam the later is widely adjustable with changing the density of the driving ac current its frequency and the nanotube length of particular interest is the resonant motion of dw due to the interaction with the nanotube ends the conditions of whom are discussed
|
[['we', 'study', 'the', 'effciency', 'of', 'the', 'magnetoimpedance', 'mi', 'of', 'thinwall', 'circumferentially', 'ordered', 'nanotubes', 'in', 'subghz', 'and', 'ghz', 'frequency', 'regimes', 'using', 'micromagnetic', 'simulations', 'we', 'consider', 'empty', 'ferromagnetic', 'tubes', 'as', 'well', 'as', 'tubes', 'filled', 'with', 'nonmagnetic', 'conductors', 'of', 'circular', 'crosssection', 'nanowire', 'coverings', 'focusing', 'on', 'the', 'lowfield', 'regime', 'of', 'mi', 'below', 'the', 'characteristic', 'field', 'of', 'the', 'lowfrequency', 'ferromagnetic', 'resonance', 'in', 'this', 'field', 'area', 'the', 'effcient', 'mechanism', 'of', 'mi', 'is', 'related', 'to', 'oscillations', 'of', 'the', 'positions', 'of', 'perpendicular', 'to', 'the', 'tube', 'axis', 'domain', 'walls', 'dws', 'two', 'mechanisms', 'of', 'driving', 'the', 'dw', 'motion', 'by', 'the', 'ac', 'current', 'are', 'taken', 'into', 'account', 'the', 'driving', 'via', 'the', 'oersted', 'field', 'and', 'via', 'the', 'spintransfer', 'torque', 'the', 'simulations', 'are', 'performed', 'for', 'co', 'nanotubes', 'of', 'the', 'diameter', 'of', '300nm', 'achievable', 'lowfield', 'mi', 'exceeds', '100', 'while', 'the', 'field', 'region', 'of', 'a', 'high', 'sensitivity', 'of', 'that', 'dwbased', 'giant', 'mi', 'is', 'of', 'the', 'width', 'of', 'tens', 'of', 'kam', 'the', 'later', 'is', 'widely', 'adjustable', 'with', 'changing', 'the', 'density', 'of', 'the', 'driving', 'ac', 'current', 'its', 'frequency', 'and', 'the', 'nanotube', 'length', 'of', 'particular', 'interest', 'is', 'the', 'resonant', 'motion', 'of', 'dw', 'due', 'to', 'the', 'interaction', 'with', 'the', 'nanotube', 'ends', 'the', 'conditions', 'of', 'whom', 'are', 'discussed']]
|
[-0.21514480941720862, 0.18609625481049272, 0.010375319123069974, -0.019142491535526364, -0.05521399436885134, -0.10881664517132486, 0.03882873885858645, 0.41546979899260594, -0.23908636931508304, -0.26576759129703204, 0.09050380526868468, -0.23966488661368357, -0.05692339937222448, 0.22571374986944917, 0.030775352232244875, -0.004517896030596061, 0.009270788536981699, 0.018208771456092437, 0.0008776488248258829, -0.16965251737720075, 0.27527427402983834, 0.009362088214170108, 0.3396729480913602, 0.07843512466098083, 0.05197808740814117, -0.008056357909152483, 0.07718837589887466, 0.04369463410941844, -0.18023523127134894, 0.06838905650511151, 0.19255542945261658, -0.06815322150694246, 0.21823260545274836, -0.47136167805404106, -0.17288281060377522, 0.014254932407524432, 0.14945573926447553, 0.11085803774210248, 0.007677261434629203, -0.3045623578091568, 0.07844212054933837, -0.11789253060805037, -0.13072515151740866, 0.008526034876109754, 0.02131569116039479, 0.07854394373289518, -0.2444020537659526, 0.10452981949554746, 0.09422987063249395, 0.0862157325869664, -0.08614988348253587, -0.11084644730757684, -0.05286176803774458, 0.0854783690413163, 0.07349602340539779, 0.049334444482117254, 0.2219204639525529, -0.15539811621791624, -0.11111503976714263, 0.3118147044102017, -0.060446533641995905, -0.12271933627631912, 0.14869553917781153, -0.22279821741741468, 0.03141834007506754, 0.1752020885246469, 0.11707925776693415, 0.09595671979068937, -0.11181240275061313, 0.06285614078273709, 0.024752194546732775, 0.14437943393800487, 0.10037703826736183, 0.0284763427607299, 0.27156954409277184, 0.21902193999514877, 0.030166957527399063, 0.18093274939468407, -0.19190378960821422, -0.07714547699891981, -0.24840430063851912, -0.12551167488167497, -0.19279773537307343, 0.03328822998260643, -0.06338837078967233, -0.1875001914623352, 0.4206300704799434, 0.14070512651109157, 0.15451907608014076, -0.045084828426665134, 0.32176863235679076, 0.12174557555996951, 0.08358900242626291, 0.004267373885166772, 0.2978737521124013, 0.2231868242521701, 0.12453683275367787, -0.2962213267715886, 0.01305565324195839, -0.03161288652831609]
|
1,803.09513
|
Enabling Aloha-NOMA for Massive M2M Communication in IoT Networks
|
The Internet of things (IoT), which is the network of physical devices
embedded with sensors, actuators, and connec- tivity, is being accelerated into
the mainstream by the emergence of 5G wireless networking. This paper presents
an uncoordinated non-orthogonal random access protocol, an enhancement to the
recently introduced Aloha-NOMA protocol, which provides high throughput, while
being matched to the low complexity requirements and the sporadic traffic
pattern of IoT devices. Under ideal conditions it has been shown that
Aloha-NOMA, using power-domain orthogonality, can significantly increase the
throughput using SIC (Successive Interference Cancellation) to enable correct
reception of multiple simultaneous transmitted signals. For this ideal
performance, the enhanced Aloha-NOMA receiver adaptively learns the number of
active devices (which is not known a priori) using a form of multi-hypothesis
testing. For small numbers of simultaneous transmissions, it is shown that
there can be substantial throughput gain of 6.9 dB relative to pure Aloha for
0.25 probability of transmission and up to 3 active transmitters.
|
eess.SP
|
the internet of things iot which is the network of physical devices embedded with sensors actuators and connec tivity is being accelerated into the mainstream by the emergence of 5g wireless networking this paper presents an uncoordinated nonorthogonal random access protocol an enhancement to the recently introduced alohanoma protocol which provides high throughput while being matched to the low complexity requirements and the sporadic traffic pattern of iot devices under ideal conditions it has been shown that alohanoma using powerdomain orthogonality can significantly increase the throughput using sic successive interference cancellation to enable correct reception of multiple simultaneous transmitted signals for this ideal performance the enhanced alohanoma receiver adaptively learns the number of active devices which is not known a priori using a form of multihypothesis testing for small numbers of simultaneous transmissions it is shown that there can be substantial throughput gain of 69 db relative to pure aloha for 025 probability of transmission and up to 3 active transmitters
|
[['the', 'internet', 'of', 'things', 'iot', 'which', 'is', 'the', 'network', 'of', 'physical', 'devices', 'embedded', 'with', 'sensors', 'actuators', 'and', 'connec', 'tivity', 'is', 'being', 'accelerated', 'into', 'the', 'mainstream', 'by', 'the', 'emergence', 'of', '5g', 'wireless', 'networking', 'this', 'paper', 'presents', 'an', 'uncoordinated', 'nonorthogonal', 'random', 'access', 'protocol', 'an', 'enhancement', 'to', 'the', 'recently', 'introduced', 'alohanoma', 'protocol', 'which', 'provides', 'high', 'throughput', 'while', 'being', 'matched', 'to', 'the', 'low', 'complexity', 'requirements', 'and', 'the', 'sporadic', 'traffic', 'pattern', 'of', 'iot', 'devices', 'under', 'ideal', 'conditions', 'it', 'has', 'been', 'shown', 'that', 'alohanoma', 'using', 'powerdomain', 'orthogonality', 'can', 'significantly', 'increase', 'the', 'throughput', 'using', 'sic', 'successive', 'interference', 'cancellation', 'to', 'enable', 'correct', 'reception', 'of', 'multiple', 'simultaneous', 'transmitted', 'signals', 'for', 'this', 'ideal', 'performance', 'the', 'enhanced', 'alohanoma', 'receiver', 'adaptively', 'learns', 'the', 'number', 'of', 'active', 'devices', 'which', 'is', 'not', 'known', 'a', 'priori', 'using', 'a', 'form', 'of', 'multihypothesis', 'testing', 'for', 'small', 'numbers', 'of', 'simultaneous', 'transmissions', 'it', 'is', 'shown', 'that', 'there', 'can', 'be', 'substantial', 'throughput', 'gain', 'of', '69', 'db', 'relative', 'to', 'pure', 'aloha', 'for', '025', 'probability', 'of', 'transmission', 'and', 'up', 'to', '3', 'active', 'transmitters']]
|
[-0.24603931485351338, 0.07534596147988229, -0.028864198709948, -0.02714634804569925, -0.059918675566618534, -0.23177252201506612, 0.09644644849525869, 0.3858806080653431, -0.25628733039133667, -0.30425378588253854, 0.06326684150671275, -0.2320494360452437, -0.1725330715304854, 0.15755970915779471, -0.15251016841842707, 0.06783691258314326, 0.028261163873563273, 0.01804455861402965, -0.004810131619169568, -0.2802349290382464, 0.2280613973603717, 0.1439811431033456, 0.3891594844656239, 0.03304312720436383, 0.09512899996841512, -0.0013007566915616763, 0.007170754556416864, -0.03340967722679633, -0.036896589681125094, 0.09880986686012135, 0.3238357649479779, 0.18827066338991294, 0.2760739946139178, -0.4319984879466179, -0.24150565113895428, 0.09293407504374497, 0.18173788465495852, 0.03670371884678242, -0.06231998258070754, -0.2899899679967867, 0.18178185935693314, -0.2392314461678822, -0.05829745362578206, -0.0015539732105127589, -0.034678383987767174, 0.05237763952691634, -0.3313884450880498, -0.016107572514494385, -0.010547543851424063, 0.03192142602374418, -0.0026196656575656397, -0.06521489701424696, 0.014661510531379847, 0.16731247625759113, 0.008625672006493678, -0.008142988301628495, 0.11166725834970426, -0.08428833847402693, -0.124427805715443, 0.36636354272186566, 0.02994040669352742, -0.15107223739694248, 0.17758897004346436, -0.06674556304868426, -0.07516471097413566, 0.20837154721563556, 0.1836752783104355, 0.0402617110864994, -0.19354449032360446, 0.013542892440816573, 0.011326874033634707, 0.17292428341323962, 0.11129285028545614, 0.150491121300259, 0.1466803327448643, 0.18256727249436774, 0.13665274268027788, 0.11230045983998788, -0.10656142446519055, -0.0746294811726996, -0.19406270991247263, -0.15624820261106173, -0.20682300595850076, 0.06739705629360801, -0.0984831504486335, -0.10260994755048362, 0.35009011689368175, 0.1384299980036868, 0.12347220412530699, 0.05443587199486908, 0.4019161575077599, 0.0887572974868998, 0.11471918945472619, 0.11328017416334948, 0.22256074156843542, 0.10394113629576258, 0.14271170856625093, -0.16759579713739778, 0.09762439492985792, -0.02601284986095769]
|
1,803.09514
|
Cluster analysis of stocks using price movements of high frequency data
from National Stock Exchange
|
This paper aims to develop new techniques to describe joint behavior of
stocks, beyond regression and correlation. For example, we want to identify the
clusters of the stocks that move together. Our work is based on applying Kernel
Principal Component Analysis(KPCA) and Functional Principal Component
Analysis(FPCA) to high frequency data from NSE. Since we dealt with high
frequency data with a tick size of 30 seconds, FPCA seems to be an ideal
choice. FPCA is a functional variant of PCA where each sample point is
considered to be a function in Hilbert space L^2. On the other hand, KPCA is an
extension of PCA using kernel methods. Results obtained from FPCA and Gaussian
Kernel PCA seems to be in synergy but with a lag. There were two prominent
clusters that showed up in our analysis, one corresponding to the banking
sector and another corresponding to the IT sector. The other smaller clusters
were seen from the automobile industry and the energy sector. IT sector was
seen interacting with these small clusters. The learning gained from these
interactions is substantial as one can use it significantly to develop trading
strategies for intraday traders.
|
q-fin.ST stat.CO
|
this paper aims to develop new techniques to describe joint behavior of stocks beyond regression and correlation for example we want to identify the clusters of the stocks that move together our work is based on applying kernel principal component analysiskpca and functional principal component analysisfpca to high frequency data from nse since we dealt with high frequency data with a tick size of 30 seconds fpca seems to be an ideal choice fpca is a functional variant of pca where each sample point is considered to be a function in hilbert space l2 on the other hand kpca is an extension of pca using kernel methods results obtained from fpca and gaussian kernel pca seems to be in synergy but with a lag there were two prominent clusters that showed up in our analysis one corresponding to the banking sector and another corresponding to the it sector the other smaller clusters were seen from the automobile industry and the energy sector it sector was seen interacting with these small clusters the learning gained from these interactions is substantial as one can use it significantly to develop trading strategies for intraday traders
|
[['this', 'paper', 'aims', 'to', 'develop', 'new', 'techniques', 'to', 'describe', 'joint', 'behavior', 'of', 'stocks', 'beyond', 'regression', 'and', 'correlation', 'for', 'example', 'we', 'want', 'to', 'identify', 'the', 'clusters', 'of', 'the', 'stocks', 'that', 'move', 'together', 'our', 'work', 'is', 'based', 'on', 'applying', 'kernel', 'principal', 'component', 'analysiskpca', 'and', 'functional', 'principal', 'component', 'analysisfpca', 'to', 'high', 'frequency', 'data', 'from', 'nse', 'since', 'we', 'dealt', 'with', 'high', 'frequency', 'data', 'with', 'a', 'tick', 'size', 'of', '30', 'seconds', 'fpca', 'seems', 'to', 'be', 'an', 'ideal', 'choice', 'fpca', 'is', 'a', 'functional', 'variant', 'of', 'pca', 'where', 'each', 'sample', 'point', 'is', 'considered', 'to', 'be', 'a', 'function', 'in', 'hilbert', 'space', 'l2', 'on', 'the', 'other', 'hand', 'kpca', 'is', 'an', 'extension', 'of', 'pca', 'using', 'kernel', 'methods', 'results', 'obtained', 'from', 'fpca', 'and', 'gaussian', 'kernel', 'pca', 'seems', 'to', 'be', 'in', 'synergy', 'but', 'with', 'a', 'lag', 'there', 'were', 'two', 'prominent', 'clusters', 'that', 'showed', 'up', 'in', 'our', 'analysis', 'one', 'corresponding', 'to', 'the', 'banking', 'sector', 'and', 'another', 'corresponding', 'to', 'the', 'it', 'sector', 'the', 'other', 'smaller', 'clusters', 'were', 'seen', 'from', 'the', 'automobile', 'industry', 'and', 'the', 'energy', 'sector', 'it', 'sector', 'was', 'seen', 'interacting', 'with', 'these', 'small', 'clusters', 'the', 'learning', 'gained', 'from', 'these', 'interactions', 'is', 'substantial', 'as', 'one', 'can', 'use', 'it', 'significantly', 'to', 'develop', 'trading', 'strategies', 'for', 'intraday', 'traders']]
|
[-0.03810652848700748, 0.056480887154956645, -0.14117725245611693, 0.08647117989235803, -0.11131038193983075, -0.14690139835308258, 0.0430484415908148, 0.40833582476173574, -0.2836975915578047, -0.2794028398433798, 0.1406580897981736, -0.32681238844892696, -0.1187957927020953, 0.1908780917108647, -0.06130748104279567, 0.020670955901426313, 0.05890745434444398, 0.038919123306282256, 0.006436339496193748, -0.25473009037883265, 0.30486978402630865, 0.06350125866562226, 0.2729632123226398, -0.022800056246648492, 0.07799007460646527, 0.005542807929266832, -0.06097125727805848, 0.007127305024493436, -0.05413424591327049, 0.157346265736085, 0.3027089027626636, 0.11764664423014773, 0.3031074768226398, -0.3995950733456611, -0.2007178230119232, 0.1244029869374476, 0.12548348173180496, 0.052361813876287716, 0.022862186679910673, -0.2524905967979545, 0.05627144668251276, -0.18300525746032548, -0.1311511419198819, -0.11224799674788588, 0.00032531386241316793, -0.015228989709315724, -0.2726904987970269, 0.07730077624713119, 0.025302007318915506, 0.03950898274656777, -0.04891091865413871, -0.14889528490848056, 0.013195656406644144, 0.11012659824061158, 0.11246089861746632, 0.037989801848552336, 0.1396304145743335, -0.08339013346519909, -0.10209903512119414, 0.36518848213599997, -0.08247226807227555, -0.15833960654900261, 0.21665526580580166, -0.11521989686267549, -0.17144995394751036, 0.09263274433875554, 0.16891550777026598, 0.04714294514177661, -0.16023383876676425, 0.03666257207177726, -0.029077886093689716, 0.22752608630245577, 0.021543821245186816, -0.028828677314480668, 0.145845210042439, 0.1751087351064933, 0.09163673436269164, 0.13679348573235697, -0.11729722112466238, -0.08811039235933046, -0.24721993564836386, -0.12737693883919796, -0.1821842636153298, 0.011698073128507914, -0.11704853983974317, -0.14535179442088855, 0.3834476053004006, 0.14586158899550547, 0.1974768209736794, 0.03999246084253843, 0.28408049663626833, 0.11605335055470564, 0.11788215668332812, 0.09977093501702736, 0.2211809035470268, 0.08765190955815151, 0.09351262024260665, -0.16471809464764145, 0.05033683426629164, 0.01635006529671189]
|
1,803.09515
|
A Low-Resolution ADC Module Assisted Hybrid Beamforming Architecture for
mmWave Communications
|
We propose a low-resolution analog-to-digital converter (ADC) module assisted
hybrid beamforming architecture for millimeter-wave (mmWave) communications. We
prove that the proposed low-cost and flexible architecture can reduce the beam
training time and complexity dramatically without degradation in the data
transmission performance. In addition, we design a fast beam training method
which is suitable for the proposed system architecture. The proposed beam
training method requires only L + 1 (where L is the number of paths) time slots
which is smaller compared to the state-of-the-art.
|
cs.IT math.IT
|
we propose a lowresolution analogtodigital converter adc module assisted hybrid beamforming architecture for millimeterwave mmwave communications we prove that the proposed lowcost and flexible architecture can reduce the beam training time and complexity dramatically without degradation in the data transmission performance in addition we design a fast beam training method which is suitable for the proposed system architecture the proposed beam training method requires only l 1 where l is the number of paths time slots which is smaller compared to the stateoftheart
|
[['we', 'propose', 'a', 'lowresolution', 'analogtodigital', 'converter', 'adc', 'module', 'assisted', 'hybrid', 'beamforming', 'architecture', 'for', 'millimeterwave', 'mmwave', 'communications', 'we', 'prove', 'that', 'the', 'proposed', 'lowcost', 'and', 'flexible', 'architecture', 'can', 'reduce', 'the', 'beam', 'training', 'time', 'and', 'complexity', 'dramatically', 'without', 'degradation', 'in', 'the', 'data', 'transmission', 'performance', 'in', 'addition', 'we', 'design', 'a', 'fast', 'beam', 'training', 'method', 'which', 'is', 'suitable', 'for', 'the', 'proposed', 'system', 'architecture', 'the', 'proposed', 'beam', 'training', 'method', 'requires', 'only', 'l', '1', 'where', 'l', 'is', 'the', 'number', 'of', 'paths', 'time', 'slots', 'which', 'is', 'smaller', 'compared', 'to', 'the', 'stateoftheart']]
|
[-0.20056629864252115, 0.027639271568013244, -0.0026358059124953776, -0.022644102502914414, -0.1008507642868334, -0.2619548971282251, 0.0564758682971349, 0.45908688376825973, -0.25144583274082966, -0.3202919343778168, 0.058738723085879026, -0.17785036741020943, -0.1572213529283742, 0.22242799563423157, -0.14351971065401134, 0.12802274639617248, 0.14936606821054257, -0.03755306642424001, -0.0390873189695763, -0.2489781500687486, 0.2155904175212406, 0.1487567264317389, 0.4118703710566084, -0.04933867872838514, 0.15279412625430444, -0.025613512986911887, 0.013074158511337745, -0.0852995100711663, -0.05235161650576979, 0.09944796774267073, 0.30136047869202603, 0.1986418130992721, 0.30087638018001994, -0.42929479823144806, -0.23379447436695133, 0.0709113835704973, 0.18374065769813866, 0.06737194025990026, -0.06932249570164425, -0.24271231046485076, 0.12571294101920114, -0.20744211098785142, -0.0008732084050235978, -0.0464080535352275, -0.06505856384713966, 0.013253680127392331, -0.3638234733637557, -0.03727783450677273, 0.031852577442684805, 0.008633718040423939, -0.012882924403052732, -0.12814712603380118, 0.030741230337824447, 0.06373696563855173, -0.05076571202455425, 0.03434224711472999, 0.09338325650588307, -0.0712819830682802, -0.0586798800357494, 0.34567265142967185, -0.01660822609899543, -0.2337649112499981, 0.13381101886169558, -0.06688588492976255, -0.06425884148352835, 0.1839104911350331, 0.24692560018724705, 0.08418602352759924, -0.16383205007492418, 0.03242011487915977, 0.0390154063275241, 0.2212503401181066, 0.07679033669620662, 0.08065079123971153, 0.08291364951811013, 0.3042439769543932, 0.10432836640042713, 0.15401249468685632, -0.22424222470586558, -0.002484784080052232, -0.22643596710811134, -0.18103372268042112, -0.2348618537344667, -0.01779411902583866, -0.07402094312717701, -0.05684202707496034, 0.3777319735409804, 0.19549253773707223, 0.11807619032999837, 0.13491116407192705, 0.4543441639068615, 0.0808725845438978, 0.14643385558647204, 0.12560315549665366, 0.1616301677941558, 0.016987530290182816, 0.19230130392250167, -0.24432854814432473, 0.010457072749240211, 0.01670583440776331]
|
1,803.09516
|
Role of salt valency in the switch of H-NS proteins between DNA-bridging
and DNA-stiffening modes
|
This work investigates the interactions of H-NS proteins and bacterial
genomic DNA through computer simulations performed with a coarse-grained model.
The model was developed specifically to study the switch of H-NS proteins from
the DNA-stiffening to the DNA-bridging mode, which has been observed repeatedly
upon addition of multivalent cations to the buffer, but is still not
understood. Unravelling the corresponding mechanism is all the more crucial, as
the regulation properties of H-NS proteins, as well as other nucleoid proteins,
are linked to their DNA-binding properties. The simulations reported here
support a mechanism, according to which the primary role of multivalent cations
consists in decreasing the strength of H-NS/DNA interactions compared to
H-NS/H-NS interactions, with the latter ones becoming energetically favored
with respect to the former ones above a certain threshold of the effective
valency of the cations of the buffer. Below the threshold, H-NS dimers form
filaments, which stretch along the DNA molecule but are quite inefficient in
bridging genomically distant DNA sites (DNA-stiffening mode). In contrast, just
above the threshold, H-NS dimers form 3-dimensional clusters, which are able to
connect DNA sites that are distant from the genomic point of view (DNA-bridging
mode). The model provides clear rationales for the experimental observations
that the switch between the two modes is a threshold effect and that the
ability of H-NS dimers to form higher order oligomers is crucial for their
bridging capabilities.
|
physics.bio-ph q-bio.BM q-bio.GN
|
this work investigates the interactions of hns proteins and bacterial genomic dna through computer simulations performed with a coarsegrained model the model was developed specifically to study the switch of hns proteins from the dnastiffening to the dnabridging mode which has been observed repeatedly upon addition of multivalent cations to the buffer but is still not understood unravelling the corresponding mechanism is all the more crucial as the regulation properties of hns proteins as well as other nucleoid proteins are linked to their dnabinding properties the simulations reported here support a mechanism according to which the primary role of multivalent cations consists in decreasing the strength of hnsdna interactions compared to hnshns interactions with the latter ones becoming energetically favored with respect to the former ones above a certain threshold of the effective valency of the cations of the buffer below the threshold hns dimers form filaments which stretch along the dna molecule but are quite inefficient in bridging genomically distant dna sites dnastiffening mode in contrast just above the threshold hns dimers form 3dimensional clusters which are able to connect dna sites that are distant from the genomic point of view dnabridging mode the model provides clear rationales for the experimental observations that the switch between the two modes is a threshold effect and that the ability of hns dimers to form higher order oligomers is crucial for their bridging capabilities
|
[['this', 'work', 'investigates', 'the', 'interactions', 'of', 'hns', 'proteins', 'and', 'bacterial', 'genomic', 'dna', 'through', 'computer', 'simulations', 'performed', 'with', 'a', 'coarsegrained', 'model', 'the', 'model', 'was', 'developed', 'specifically', 'to', 'study', 'the', 'switch', 'of', 'hns', 'proteins', 'from', 'the', 'dnastiffening', 'to', 'the', 'dnabridging', 'mode', 'which', 'has', 'been', 'observed', 'repeatedly', 'upon', 'addition', 'of', 'multivalent', 'cations', 'to', 'the', 'buffer', 'but', 'is', 'still', 'not', 'understood', 'unravelling', 'the', 'corresponding', 'mechanism', 'is', 'all', 'the', 'more', 'crucial', 'as', 'the', 'regulation', 'properties', 'of', 'hns', 'proteins', 'as', 'well', 'as', 'other', 'nucleoid', 'proteins', 'are', 'linked', 'to', 'their', 'dnabinding', 'properties', 'the', 'simulations', 'reported', 'here', 'support', 'a', 'mechanism', 'according', 'to', 'which', 'the', 'primary', 'role', 'of', 'multivalent', 'cations', 'consists', 'in', 'decreasing', 'the', 'strength', 'of', 'hnsdna', 'interactions', 'compared', 'to', 'hnshns', 'interactions', 'with', 'the', 'latter', 'ones', 'becoming', 'energetically', 'favored', 'with', 'respect', 'to', 'the', 'former', 'ones', 'above', 'a', 'certain', 'threshold', 'of', 'the', 'effective', 'valency', 'of', 'the', 'cations', 'of', 'the', 'buffer', 'below', 'the', 'threshold', 'hns', 'dimers', 'form', 'filaments', 'which', 'stretch', 'along', 'the', 'dna', 'molecule', 'but', 'are', 'quite', 'inefficient', 'in', 'bridging', 'genomically', 'distant', 'dna', 'sites', 'dnastiffening', 'mode', 'in', 'contrast', 'just', 'above', 'the', 'threshold', 'hns', 'dimers', 'form', '3dimensional', 'clusters', 'which', 'are', 'able', 'to', 'connect', 'dna', 'sites', 'that', 'are', 'distant', 'from', 'the', 'genomic', 'point', 'of', 'view', 'dnabridging', 'mode', 'the', 'model', 'provides', 'clear', 'rationales', 'for', 'the', 'experimental', 'observations', 'that', 'the', 'switch', 'between', 'the', 'two', 'modes', 'is', 'a', 'threshold', 'effect', 'and', 'that', 'the', 'ability', 'of', 'hns', 'dimers', 'to', 'form', 'higher', 'order', 'oligomers', 'is', 'crucial', 'for', 'their', 'bridging', 'capabilities']]
|
[-0.12375127352731254, 0.16192927087091416, 0.005444162835932761, 0.07031805912112377, -0.02838280763662943, -0.16303937030310758, 0.0860132217660481, 0.38943052449541393, -0.26170917265329063, -0.277738806022905, 0.014296825061472574, -0.298293457944518, -0.17327525331475363, 0.13310150389244021, 0.017992690142260438, -0.019505456413179145, 0.047742383387613746, 0.038123441593549946, 0.05052335199230073, -0.1770995951961244, 0.25427697701971946, 0.13100306088055827, 0.29172043475167203, 0.06678934189850431, 0.04727319176482413, -0.058101800581888505, 0.044241219080919235, -0.012872744918671455, -0.15515055876832712, 0.1529014940579624, 0.2577730390210554, 0.04972835160534535, 0.24589344992081782, -0.4682698688600539, -0.20784092738227755, 0.09883233562638787, 0.19645496087736988, 0.15000752855312863, -0.041761303389201906, -0.24025059349450953, 0.07754344511174663, -0.11242207583742575, -0.1114086703082808, -0.04443169907634065, 0.00010665213350173936, 0.08061136031347703, -0.2087708938169383, 0.1027864644863273, 0.060293574334967785, 0.05981980668525865, -0.08537100512675304, -0.12425459392180895, -0.08591843107786733, 0.1716477324534616, 0.07611783209160836, 0.03859705662072979, 0.22587767380632853, -0.12823859429121703, -0.0915513099033361, 0.3913021824371658, 0.01602211713600953, -0.16605485200457143, 0.24457470829222808, -0.10883116956775714, -0.12461802988566392, 0.159956531648181, 0.09496296173586559, 0.10651520287348448, -0.18420144655586532, 0.012872270612238106, 0.007052102377903729, 0.20641136164902077, 0.08720701804646012, 0.0256482078938892, 0.21350649813304476, 0.19217787552910873, 0.015329801910475158, 0.1678201551510842, -0.061567719406938476, -0.14796260550614088, -0.19031682445487955, -0.1523176212468299, -0.15126832255548817, -0.008697337272774587, -0.0363922789865204, -0.16580880233576814, 0.353361705343623, 0.07776731306997438, 0.2105032103687623, 0.034695915498958674, 0.22494788119863524, -0.010798315363915702, 0.13801437333173103, -0.035160341062133706, 0.2153814291191418, 0.10918781812417142, 0.05908825957183644, -0.2517190010699427, 0.134181281700812, 0.018034264187965738]
|
1,803.09517
|
On the Approximation Ratio of Ordered Parsings
|
Shannon's entropy is a clear lower bound for statistical compression. The
situation is not so well understood for dictionary-based compression. A
plausible lower bound is $b$, the least number of phrases of a general
bidirectional parse of a text, where phrases can be copied from anywhere else
in the text. Since computing $b$ is NP-complete, a popular gold standard is
$z$, the number of phrases in the Lempel-Ziv parse of the text, which is the
optimal one when phrases can be copied only from the left. While $z$ can be
computed in linear time with a greedy algorithm, almost nothing has been known
for decades about its approximation ratio with respect to $b$. In this paper we
prove that $z=O(b\log(n/b))$, where $n$ is the text length. We also show that
the bound is tight as a function of $n$, by exhibiting a text family where $z =
\Omega(b\log n)$. Our upper bound is obtained by building a run-length
context-free grammar based on a locally consistent parsing of the text. Our
lower bound is obtained by relating $b$ with $r$, the number of equal-letter
runs in the Burrows-Wheeler transform of the text. We proceed by observing that
Lempel-Ziv is just one particular case of greedy parses, meaning that the
optimal value of $z$ is obtained by scanning the text and maximizing the phrase
length at each step, and of ordered parses, meaning that there is an increasing
order between phrases and their sources. As a new example of ordered greedy
parses, we introduce {\em lexicographical} parses, where phrases can only be
copied from lexicographically smaller text locations. We prove that the size
$v$ of the optimal lexicographical parse is also obtained greedily in $O(n)$
time, that $v=O(b\log(n/b))$, and that there exists a text family where $v =
\Omega(b\log n)$.
|
cs.DS
|
shannons entropy is a clear lower bound for statistical compression the situation is not so well understood for dictionarybased compression a plausible lower bound is b the least number of phrases of a general bidirectional parse of a text where phrases can be copied from anywhere else in the text since computing b is npcomplete a popular gold standard is z the number of phrases in the lempelziv parse of the text which is the optimal one when phrases can be copied only from the left while z can be computed in linear time with a greedy algorithm almost nothing has been known for decades about its approximation ratio with respect to b in this paper we prove that zoblognb where n is the text length we also show that the bound is tight as a function of n by exhibiting a text family where z omegablog n our upper bound is obtained by building a runlength contextfree grammar based on a locally consistent parsing of the text our lower bound is obtained by relating b with r the number of equalletter runs in the burrowswheeler transform of the text we proceed by observing that lempelziv is just one particular case of greedy parses meaning that the optimal value of z is obtained by scanning the text and maximizing the phrase length at each step and of ordered parses meaning that there is an increasing order between phrases and their sources as a new example of ordered greedy parses we introduce em lexicographical parses where phrases can only be copied from lexicographically smaller text locations we prove that the size v of the optimal lexicographical parse is also obtained greedily in on time that voblognb and that there exists a text family where v omegablog n
|
[['shannons', 'entropy', 'is', 'a', 'clear', 'lower', 'bound', 'for', 'statistical', 'compression', 'the', 'situation', 'is', 'not', 'so', 'well', 'understood', 'for', 'dictionarybased', 'compression', 'a', 'plausible', 'lower', 'bound', 'is', 'b', 'the', 'least', 'number', 'of', 'phrases', 'of', 'a', 'general', 'bidirectional', 'parse', 'of', 'a', 'text', 'where', 'phrases', 'can', 'be', 'copied', 'from', 'anywhere', 'else', 'in', 'the', 'text', 'since', 'computing', 'b', 'is', 'npcomplete', 'a', 'popular', 'gold', 'standard', 'is', 'z', 'the', 'number', 'of', 'phrases', 'in', 'the', 'lempelziv', 'parse', 'of', 'the', 'text', 'which', 'is', 'the', 'optimal', 'one', 'when', 'phrases', 'can', 'be', 'copied', 'only', 'from', 'the', 'left', 'while', 'z', 'can', 'be', 'computed', 'in', 'linear', 'time', 'with', 'a', 'greedy', 'algorithm', 'almost', 'nothing', 'has', 'been', 'known', 'for', 'decades', 'about', 'its', 'approximation', 'ratio', 'with', 'respect', 'to', 'b', 'in', 'this', 'paper', 'we', 'prove', 'that', 'zoblognb', 'where', 'n', 'is', 'the', 'text', 'length', 'we', 'also', 'show', 'that', 'the', 'bound', 'is', 'tight', 'as', 'a', 'function', 'of', 'n', 'by', 'exhibiting', 'a', 'text', 'family', 'where', 'z', 'omegablog', 'n', 'our', 'upper', 'bound', 'is', 'obtained', 'by', 'building', 'a', 'runlength', 'contextfree', 'grammar', 'based', 'on', 'a', 'locally', 'consistent', 'parsing', 'of', 'the', 'text', 'our', 'lower', 'bound', 'is', 'obtained', 'by', 'relating', 'b', 'with', 'r', 'the', 'number', 'of', 'equalletter', 'runs', 'in', 'the', 'burrowswheeler', 'transform', 'of', 'the', 'text', 'we', 'proceed', 'by', 'observing', 'that', 'lempelziv', 'is', 'just', 'one', 'particular', 'case', 'of', 'greedy', 'parses', 'meaning', 'that', 'the', 'optimal', 'value', 'of', 'z', 'is', 'obtained', 'by', 'scanning', 'the', 'text', 'and', 'maximizing', 'the', 'phrase', 'length', 'at', 'each', 'step', 'and', 'of', 'ordered', 'parses', 'meaning', 'that', 'there', 'is', 'an', 'increasing', 'order', 'between', 'phrases', 'and', 'their', 'sources', 'as', 'a', 'new', 'example', 'of', 'ordered', 'greedy', 'parses', 'we', 'introduce', 'em', 'lexicographical', 'parses', 'where', 'phrases', 'can', 'only', 'be', 'copied', 'from', 'lexicographically', 'smaller', 'text', 'locations', 'we', 'prove', 'that', 'the', 'size', 'v', 'of', 'the', 'optimal', 'lexicographical', 'parse', 'is', 'also', 'obtained', 'greedily', 'in', 'on', 'time', 'that', 'voblognb', 'and', 'that', 'there', 'exists', 'a', 'text', 'family', 'where', 'v', 'omegablog', 'n']]
|
[-0.09653442964050599, 0.14270730543433796, -0.05938053554839285, 0.08212309462599188, -0.10987290422051274, -0.16397794561230183, 0.1058652814818927, 0.37792864967060763, -0.31858865931840963, -0.29445166350042296, 0.06442089156644527, -0.3055873750388955, -0.10273525620253814, 0.18005001410994761, -0.055614821516822295, 0.01435777557756963, 0.051000732726887946, 0.12839332859382302, -0.04349177157804586, -0.283484160224027, 0.2757694746129202, 0.011641637994119693, 0.25221901548357484, 0.0008879835554158565, 0.09551787524183258, -0.028203481102611908, -0.02114600243360521, 0.0191933866374233, -0.10951895430052806, 0.11840816378942291, 0.30091560157367964, 0.22238097380593905, 0.26242490158387527, -0.35945293305864195, -0.13548927580870934, 0.08951618868251142, 0.1825946451795265, 0.09872224243138548, -0.023365165096150768, -0.2671727176317209, 0.1708282408499738, -0.11974334377952278, 0.02692359143826483, -0.012474682728545516, 0.0894845594696803, 0.004119720472994219, -0.28600537487648947, 0.041468862163925486, 0.13410689155979216, 0.029396447244950785, 0.024228991456953904, -0.13132740024123596, -0.004235862953511556, 0.11652097566170487, 0.03593571416720031, 0.13363478644338958, 0.06727378179808867, -0.12416355141368135, -0.12776918880660662, 0.4004034529615328, -0.07077107398372297, -0.21697415202164771, 0.11150487598921477, -0.09092140024451097, -0.13219233573561603, 0.1166414630957767, 0.13366534288883006, 0.13381270973869563, -0.11622852369563061, 0.11806844990889308, -0.1310715915961671, 0.2391709787667092, 0.14767400731886274, 0.01908415248413503, 0.15047844587041134, 0.1761047028763623, 0.06404165745491988, 0.14842926683960503, -0.05623176823853422, -0.008159519478845126, -0.2884309348615072, -0.1675712217441184, -0.23530565188034305, 0.02165511324670673, -0.12727182612596785, -0.1602774673216349, 0.32953718972562, 0.143789517202757, 0.22943512708127908, 0.13029060117409108, 0.2828499134609962, 0.09701803598482533, 0.060349748007428296, 0.11718817269733604, 0.12730263950002357, 0.029486529544296695, 0.04810385308804509, -0.11851208545091559, 0.12171733091646146, 0.13327916677804388]
|
1,803.09518
|
Fr\'echet ChemNet Distance: A metric for generative models for molecules
in drug discovery
|
The new wave of successful generative models in machine learning has
increased the interest in deep learning driven de novo drug design. However,
assessing the performance of such generative models is notoriously difficult.
Metrics that are typically used to assess the performance of such generative
models are the percentage of chemically valid molecules or the similarity to
real molecules in terms of particular descriptors, such as the partition
coefficient (logP) or druglikeness. However, method comparison is difficult
because of the inconsistent use of evaluation metrics, the necessity for
multiple metrics, and the fact that some of these measures can easily be
tricked by simple rule-based systems. We propose a novel distance measure
between two sets of molecules, called Fr\'echet ChemNet distance (FCD), that
can be used as an evaluation metric for generative models. The FCD is similar
to a recently established performance metric for comparing image generation
methods, the Fr\'echet Inception Distance (FID). Whereas the FID uses one of
the hidden layers of InceptionNet, the FCD utilizes the penultimate layer of a
deep neural network called ChemNet, which was trained to predict drug
activities. Thus, the FCD metric takes into account chemically and biologically
relevant information about molecules, and also measures the diversity of the
set via the distribution of generated molecules. The FCD's advantage over
previous metrics is that it can detect if generated molecules are a) diverse
and have similar b) chemical and c) biological properties as real molecules. We
further provide an easy-to-use implementation that only requires the SMILES
representation of the generated molecules as input to calculate the FCD.
Implementations are available at: https://www.github.com/bioinf-jku/FCD
|
cs.LG q-bio.QM stat.ML
|
the new wave of successful generative models in machine learning has increased the interest in deep learning driven de novo drug design however assessing the performance of such generative models is notoriously difficult metrics that are typically used to assess the performance of such generative models are the percentage of chemically valid molecules or the similarity to real molecules in terms of particular descriptors such as the partition coefficient logp or druglikeness however method comparison is difficult because of the inconsistent use of evaluation metrics the necessity for multiple metrics and the fact that some of these measures can easily be tricked by simple rulebased systems we propose a novel distance measure between two sets of molecules called frechet chemnet distance fcd that can be used as an evaluation metric for generative models the fcd is similar to a recently established performance metric for comparing image generation methods the frechet inception distance fid whereas the fid uses one of the hidden layers of inceptionnet the fcd utilizes the penultimate layer of a deep neural network called chemnet which was trained to predict drug activities thus the fcd metric takes into account chemically and biologically relevant information about molecules and also measures the diversity of the set via the distribution of generated molecules the fcds advantage over previous metrics is that it can detect if generated molecules are a diverse and have similar b chemical and c biological properties as real molecules we further provide an easytouse implementation that only requires the smiles representation of the generated molecules as input to calculate the fcd implementations are available at httpswwwgithubcombioinfjkufcd
|
[['the', 'new', 'wave', 'of', 'successful', 'generative', 'models', 'in', 'machine', 'learning', 'has', 'increased', 'the', 'interest', 'in', 'deep', 'learning', 'driven', 'de', 'novo', 'drug', 'design', 'however', 'assessing', 'the', 'performance', 'of', 'such', 'generative', 'models', 'is', 'notoriously', 'difficult', 'metrics', 'that', 'are', 'typically', 'used', 'to', 'assess', 'the', 'performance', 'of', 'such', 'generative', 'models', 'are', 'the', 'percentage', 'of', 'chemically', 'valid', 'molecules', 'or', 'the', 'similarity', 'to', 'real', 'molecules', 'in', 'terms', 'of', 'particular', 'descriptors', 'such', 'as', 'the', 'partition', 'coefficient', 'logp', 'or', 'druglikeness', 'however', 'method', 'comparison', 'is', 'difficult', 'because', 'of', 'the', 'inconsistent', 'use', 'of', 'evaluation', 'metrics', 'the', 'necessity', 'for', 'multiple', 'metrics', 'and', 'the', 'fact', 'that', 'some', 'of', 'these', 'measures', 'can', 'easily', 'be', 'tricked', 'by', 'simple', 'rulebased', 'systems', 'we', 'propose', 'a', 'novel', 'distance', 'measure', 'between', 'two', 'sets', 'of', 'molecules', 'called', 'frechet', 'chemnet', 'distance', 'fcd', 'that', 'can', 'be', 'used', 'as', 'an', 'evaluation', 'metric', 'for', 'generative', 'models', 'the', 'fcd', 'is', 'similar', 'to', 'a', 'recently', 'established', 'performance', 'metric', 'for', 'comparing', 'image', 'generation', 'methods', 'the', 'frechet', 'inception', 'distance', 'fid', 'whereas', 'the', 'fid', 'uses', 'one', 'of', 'the', 'hidden', 'layers', 'of', 'inceptionnet', 'the', 'fcd', 'utilizes', 'the', 'penultimate', 'layer', 'of', 'a', 'deep', 'neural', 'network', 'called', 'chemnet', 'which', 'was', 'trained', 'to', 'predict', 'drug', 'activities', 'thus', 'the', 'fcd', 'metric', 'takes', 'into', 'account', 'chemically', 'and', 'biologically', 'relevant', 'information', 'about', 'molecules', 'and', 'also', 'measures', 'the', 'diversity', 'of', 'the', 'set', 'via', 'the', 'distribution', 'of', 'generated', 'molecules', 'the', 'fcds', 'advantage', 'over', 'previous', 'metrics', 'is', 'that', 'it', 'can', 'detect', 'if', 'generated', 'molecules', 'are', 'a', 'diverse', 'and', 'have', 'similar', 'b', 'chemical', 'and', 'c', 'biological', 'properties', 'as', 'real', 'molecules', 'we', 'further', 'provide', 'an', 'easytouse', 'implementation', 'that', 'only', 'requires', 'the', 'smiles', 'representation', 'of', 'the', 'generated', 'molecules', 'as', 'input', 'to', 'calculate', 'the', 'fcd', 'implementations', 'are', 'available', 'at', 'httpswwwgithubcombioinfjkufcd']]
|
[-0.049651683139992346, 0.053684668047445185, -0.07341836315792487, 0.08990093474607733, -0.07015499240659484, -0.14562524782235592, 0.013288977589939585, 0.42631563181511023, -0.27401639103596465, -0.29112405796476015, 0.057894239238766805, -0.2691891404829766, -0.18929945145932475, 0.2030070001357113, -0.07948573121508018, 0.07561572388421452, 0.07311477285569136, 0.05019510995994727, -0.046804347906997674, -0.2475350544603074, 0.3028765809669923, 0.05629182489975164, 0.31318239119141067, 0.043004894798293655, 0.135524825405762, -0.06158800108496916, -0.008853227058809237, 0.009250090180631127, -0.07857706264681763, 0.1760163159817736, 0.26827045712753655, 0.19936563435607077, 0.27817576837792213, -0.40995441592378673, -0.24499095860198977, 0.12676069073637158, 0.12767587694224347, 0.09099070672495185, -0.01994197319866915, -0.30423711809549436, 0.0920787030850164, -0.1447285109222256, -0.028506756918888525, -0.14488342664316156, 0.011308708703424432, 0.036670970544742235, -0.2623898499969686, 0.0270278604792942, 0.038760113907011735, 0.051094487751572486, -0.042774308553970096, -0.13894165654000495, -0.028921839039884368, 0.17284757834911513, 0.03344193639491828, 0.06840259886271763, 0.1579634623193489, -0.13864468169583474, -0.10772750454855393, 0.38309023503828027, -0.08129461769848252, -0.2132232707335107, 0.22180377544437566, -0.030294000329833464, -0.12120586480603052, 0.10052252407900794, 0.19994614000060712, 0.13690631006136258, -0.1862559166112531, 0.025209417172283814, -0.009714254825094746, 0.16779944317743237, 0.06586403149347543, 0.01994351577362541, 0.19158361976127375, 0.19355776016460907, 0.008501712660992358, 0.12938833422348434, -0.10958944641625724, -0.08153375034039136, -0.21654030107496278, -0.17137881224340157, -0.20374823577461368, 0.0017928015098977687, -0.10619365241114104, -0.17670294432159625, 0.3821798799723415, 0.15997819483370873, 0.20093524822797837, 0.07729601550433952, 0.29401082473664025, 0.046414643314665736, 0.12869132213553497, 0.05323561622799559, 0.20163185938537445, 0.07092954762095117, 0.06341550591068643, -0.1534144147866046, 0.1616532983239182, 0.0394864567374106]
|
1,803.09519
|
Self-Attentional Acoustic Models
|
Self-attention is a method of encoding sequences of vectors by relating these
vectors to each-other based on pairwise similarities. These models have
recently shown promising results for modeling discrete sequences, but they are
non-trivial to apply to acoustic modeling due to computational and modeling
issues. In this paper, we apply self-attention to acoustic modeling, proposing
several improvements to mitigate these issues: First, self-attention memory
grows quadratically in the sequence length, which we address through a
downsampling technique. Second, we find that previous approaches to incorporate
position information into the model are unsuitable and explore other
representations and hybrid models to this end. Third, to stress the importance
of local context in the acoustic signal, we propose a Gaussian biasing approach
that allows explicit control over the context range. Experiments find that our
model approaches a strong baseline based on LSTMs with network-in-network
connections while being much faster to compute. Besides speed, we find that
interpretability is a strength of self-attentional acoustic models, and
demonstrate that self-attention heads learn a linguistically plausible division
of labor.
|
cs.CL
|
selfattention is a method of encoding sequences of vectors by relating these vectors to eachother based on pairwise similarities these models have recently shown promising results for modeling discrete sequences but they are nontrivial to apply to acoustic modeling due to computational and modeling issues in this paper we apply selfattention to acoustic modeling proposing several improvements to mitigate these issues first selfattention memory grows quadratically in the sequence length which we address through a downsampling technique second we find that previous approaches to incorporate position information into the model are unsuitable and explore other representations and hybrid models to this end third to stress the importance of local context in the acoustic signal we propose a gaussian biasing approach that allows explicit control over the context range experiments find that our model approaches a strong baseline based on lstms with networkinnetwork connections while being much faster to compute besides speed we find that interpretability is a strength of selfattentional acoustic models and demonstrate that selfattention heads learn a linguistically plausible division of labor
|
[['selfattention', 'is', 'a', 'method', 'of', 'encoding', 'sequences', 'of', 'vectors', 'by', 'relating', 'these', 'vectors', 'to', 'eachother', 'based', 'on', 'pairwise', 'similarities', 'these', 'models', 'have', 'recently', 'shown', 'promising', 'results', 'for', 'modeling', 'discrete', 'sequences', 'but', 'they', 'are', 'nontrivial', 'to', 'apply', 'to', 'acoustic', 'modeling', 'due', 'to', 'computational', 'and', 'modeling', 'issues', 'in', 'this', 'paper', 'we', 'apply', 'selfattention', 'to', 'acoustic', 'modeling', 'proposing', 'several', 'improvements', 'to', 'mitigate', 'these', 'issues', 'first', 'selfattention', 'memory', 'grows', 'quadratically', 'in', 'the', 'sequence', 'length', 'which', 'we', 'address', 'through', 'a', 'downsampling', 'technique', 'second', 'we', 'find', 'that', 'previous', 'approaches', 'to', 'incorporate', 'position', 'information', 'into', 'the', 'model', 'are', 'unsuitable', 'and', 'explore', 'other', 'representations', 'and', 'hybrid', 'models', 'to', 'this', 'end', 'third', 'to', 'stress', 'the', 'importance', 'of', 'local', 'context', 'in', 'the', 'acoustic', 'signal', 'we', 'propose', 'a', 'gaussian', 'biasing', 'approach', 'that', 'allows', 'explicit', 'control', 'over', 'the', 'context', 'range', 'experiments', 'find', 'that', 'our', 'model', 'approaches', 'a', 'strong', 'baseline', 'based', 'on', 'lstms', 'with', 'networkinnetwork', 'connections', 'while', 'being', 'much', 'faster', 'to', 'compute', 'besides', 'speed', 'we', 'find', 'that', 'interpretability', 'is', 'a', 'strength', 'of', 'selfattentional', 'acoustic', 'models', 'and', 'demonstrate', 'that', 'selfattention', 'heads', 'learn', 'a', 'linguistically', 'plausible', 'division', 'of', 'labor']]
|
[-0.06728869967427555, 0.07049123403059597, -0.06434472336904841, 0.08324950446167977, -0.14866322288610812, -0.15910433829111723, 0.03623409422439652, 0.44267294505723465, -0.3033910490647386, -0.2887332111907502, 0.05867440942688256, -0.2579761799920823, -0.2174458039654205, 0.19548794881162374, -0.09127188673050239, 0.04288241147109168, 0.07088088495228653, 0.020831391614749385, -0.07526793241187738, -0.24163178471318478, 0.27724488128656416, 0.0667574863035189, 0.3425619559490989, 0.01398588242486819, 0.13279214928772343, -0.029711341492071663, -0.07170261668701035, -0.014126548027397594, -0.08770597675764544, 0.18106313378097832, 0.2496594779847861, 0.1429308974050285, 0.33656489174550763, -0.4474648952687523, -0.2852424367962555, 0.09989423192796651, 0.1586793504291396, 0.14707124224213627, -0.0307766928032426, -0.25993497300379237, 0.12150467935970974, -0.17647219874197617, -0.011857445482579434, -0.14902137789939499, -0.0034766609957120544, 0.020682007218537125, -0.26516006835174327, 0.06133994338204335, 0.09558264089844606, -0.010563162312007927, -0.05089937262243763, -0.09338234870389489, 0.04493291181480062, 0.11720751304896655, 0.06163025254667362, 0.025125984374792368, 0.07983254251102435, -0.11468783089751913, -0.1455980147791748, 0.3431159482690795, -0.06105225178247168, -0.22832786551029047, 0.22856196402518572, -0.04780578677510393, -0.14046945377927403, 0.051061665484060846, 0.23118614401914522, 0.08811765935689468, -0.14931191036466981, 0.0011437089241313181, -0.01019962964279727, 0.19570462245236292, 0.06311976501916203, 0.03146175956473975, 0.1999661978815907, 0.1915803732318354, 0.024936656763338238, 0.14027508402185718, -0.10352839151164517, -0.08461981272357035, -0.22418391080466152, -0.08724135151079417, -0.13671021588312612, -0.029966456826305252, -0.06626204612909752, -0.14420902360678617, 0.4151236835583488, 0.2751053104273461, 0.24513851078869453, 0.13163901482047727, 0.34776216598720044, 0.059780014813315636, 0.12324411458544561, 0.06886622083277025, 0.18905671260951237, 0.08066150717284723, 0.0798180148162044, -0.17783550603061662, 0.05197708399688033, 0.06458406178708906]
|
1,803.0952
|
Universal Compressed Text Indexing
|
The rise of repetitive datasets has lately generated a lot of interest in
compressed self-indexes based on dictionary compression, a rich and
heterogeneous family that exploits text repetitions in different ways. For each
such compression scheme, several different indexing solutions have been
proposed in the last two decades. To date, the fastest indexes for repetitive
texts are based on the run-length compressed Burrows-Wheeler transform and on
the Compact Directed Acyclic Word Graph. The most space-efficient indexes, on
the other hand, are based on the Lempel-Ziv parsing and on grammar compression.
Indexes for more universal schemes such as collage systems and macro schemes
have not yet been proposed. Very recently, Kempa and Prezza [STOC 2018] showed
that all dictionary compressors can be interpreted as approximation algorithms
for the smallest string attractor, that is, a set of text positions capturing
all distinct substrings. Starting from this observation, in this paper we
develop the first universal compressed self-index, that is, the first indexing
data structure based on string attractors, which can therefore be built on top
of any dictionary-compressed text representation. Let $\gamma$ be the size of a
string attractor for a text of length $n$. Our index takes
$O(\gamma\log(n/\gamma))$ words of space and supports locating the $occ$
occurrences of any pattern of length $m$ in $O(m\log n + occ\log^{\epsilon}n)$
time, for any constant $\epsilon>0$. This is, in particular, the first index
for general macro schemes and collage systems. Our result shows that the
relation between indexing and compression is much deeper than what was
previously thought: the simple property standing at the core of all dictionary
compressors is sufficient to support fast indexed queries.
|
cs.DS
|
the rise of repetitive datasets has lately generated a lot of interest in compressed selfindexes based on dictionary compression a rich and heterogeneous family that exploits text repetitions in different ways for each such compression scheme several different indexing solutions have been proposed in the last two decades to date the fastest indexes for repetitive texts are based on the runlength compressed burrowswheeler transform and on the compact directed acyclic word graph the most spaceefficient indexes on the other hand are based on the lempelziv parsing and on grammar compression indexes for more universal schemes such as collage systems and macro schemes have not yet been proposed very recently kempa and prezza stoc 2018 showed that all dictionary compressors can be interpreted as approximation algorithms for the smallest string attractor that is a set of text positions capturing all distinct substrings starting from this observation in this paper we develop the first universal compressed selfindex that is the first indexing data structure based on string attractors which can therefore be built on top of any dictionarycompressed text representation let gamma be the size of a string attractor for a text of length n our index takes ogammalogngamma words of space and supports locating the occ occurrences of any pattern of length m in omlog n occlogepsilonn time for any constant epsilon0 this is in particular the first index for general macro schemes and collage systems our result shows that the relation between indexing and compression is much deeper than what was previously thought the simple property standing at the core of all dictionary compressors is sufficient to support fast indexed queries
|
[['the', 'rise', 'of', 'repetitive', 'datasets', 'has', 'lately', 'generated', 'a', 'lot', 'of', 'interest', 'in', 'compressed', 'selfindexes', 'based', 'on', 'dictionary', 'compression', 'a', 'rich', 'and', 'heterogeneous', 'family', 'that', 'exploits', 'text', 'repetitions', 'in', 'different', 'ways', 'for', 'each', 'such', 'compression', 'scheme', 'several', 'different', 'indexing', 'solutions', 'have', 'been', 'proposed', 'in', 'the', 'last', 'two', 'decades', 'to', 'date', 'the', 'fastest', 'indexes', 'for', 'repetitive', 'texts', 'are', 'based', 'on', 'the', 'runlength', 'compressed', 'burrowswheeler', 'transform', 'and', 'on', 'the', 'compact', 'directed', 'acyclic', 'word', 'graph', 'the', 'most', 'spaceefficient', 'indexes', 'on', 'the', 'other', 'hand', 'are', 'based', 'on', 'the', 'lempelziv', 'parsing', 'and', 'on', 'grammar', 'compression', 'indexes', 'for', 'more', 'universal', 'schemes', 'such', 'as', 'collage', 'systems', 'and', 'macro', 'schemes', 'have', 'not', 'yet', 'been', 'proposed', 'very', 'recently', 'kempa', 'and', 'prezza', 'stoc', '2018', 'showed', 'that', 'all', 'dictionary', 'compressors', 'can', 'be', 'interpreted', 'as', 'approximation', 'algorithms', 'for', 'the', 'smallest', 'string', 'attractor', 'that', 'is', 'a', 'set', 'of', 'text', 'positions', 'capturing', 'all', 'distinct', 'substrings', 'starting', 'from', 'this', 'observation', 'in', 'this', 'paper', 'we', 'develop', 'the', 'first', 'universal', 'compressed', 'selfindex', 'that', 'is', 'the', 'first', 'indexing', 'data', 'structure', 'based', 'on', 'string', 'attractors', 'which', 'can', 'therefore', 'be', 'built', 'on', 'top', 'of', 'any', 'dictionarycompressed', 'text', 'representation', 'let', 'gamma', 'be', 'the', 'size', 'of', 'a', 'string', 'attractor', 'for', 'a', 'text', 'of', 'length', 'n', 'our', 'index', 'takes', 'ogammalogngamma', 'words', 'of', 'space', 'and', 'supports', 'locating', 'the', 'occ', 'occurrences', 'of', 'any', 'pattern', 'of', 'length', 'm', 'in', 'omlog', 'n', 'occlogepsilonn', 'time', 'for', 'any', 'constant', 'epsilon0', 'this', 'is', 'in', 'particular', 'the', 'first', 'index', 'for', 'general', 'macro', 'schemes', 'and', 'collage', 'systems', 'our', 'result', 'shows', 'that', 'the', 'relation', 'between', 'indexing', 'and', 'compression', 'is', 'much', 'deeper', 'than', 'what', 'was', 'previously', 'thought', 'the', 'simple', 'property', 'standing', 'at', 'the', 'core', 'of', 'all', 'dictionary', 'compressors', 'is', 'sufficient', 'to', 'support', 'fast', 'indexed', 'queries']]
|
[-0.10698426812335751, 0.11631142301484942, -0.08271529205923348, 0.06016072092483282, -0.11764243949546926, -0.14034571654261335, 0.045290933137223884, 0.38845936944218057, -0.2852612493469562, -0.27430599496377756, 0.11074916675557292, -0.2623680935388333, -0.13016182922975236, 0.22970844521926878, -0.0778449470697223, 0.06567409287111202, 0.056119380172174, 0.08818471892316707, -0.03743587422475247, -0.2634530886496755, 0.2949004259115414, 0.027446380531051216, 0.3365232276982327, -0.006988392463584144, 0.07929863235291752, -0.0350112111808354, -0.06620002739110444, 0.015905901746665955, -0.07669972032079359, 0.13419180644739112, 0.28390826349920434, 0.22028051348380337, 0.2239228776118655, -0.4208787909141721, -0.21817206070212214, 0.0923236106203771, 0.17085778031365148, 0.11326661974344188, -0.04472030569823096, -0.2632373660431713, 0.16891048986226656, -0.13826576682136751, 0.03589971595062153, -0.061645593986097244, 0.13002131091556826, 0.020989327066528955, -0.2559359440025506, -0.005681432862380953, 0.09190409170477686, 0.02810924349674829, -0.01770092337742392, -0.12131518469309378, 0.08548618567305707, 0.1246814650493933, 0.021331945394824043, 0.07752767005319097, 0.0625837764237076, -0.09247972654910493, -0.16173256819243229, 0.4022719642343052, -0.03720829077267405, -0.18183864050026619, 0.182224364301778, -0.07523457858802512, -0.18833369337708541, 0.11600062899340532, 0.1752021866552952, 0.11886405433822227, -0.10076668442518422, 0.10125959529677105, -0.10416722021597837, 0.24388574456964107, 0.17770424407479682, 0.04296200661775586, 0.1611501596188803, 0.19962634216587907, 0.04568063979793368, 0.11834771814996804, -0.05617983087624206, -0.043746332944321786, -0.23974844015595553, -0.130116144161281, -0.2129108959899102, -0.02672018586211318, -0.14772663734497896, -0.1999208302888319, 0.38625234713619194, 0.12653502766603142, 0.21178410320955895, 0.06970753810933925, 0.2768826935286249, 0.0565823425578336, 0.0906561710302809, 0.13312288998150007, 0.11773293302613276, 0.05039078610532574, 0.08694065684111886, -0.13136016893029018, 0.09805592028879301, 0.1444309854414314]
|
1,803.09521
|
On the Tits cone of a Weyl groupoid
|
We translate the axioms of a Weyl groupoid with (not necessarily finite) root
system in terms of arrangements. The result is a correspondence between Weyl
groupoids permitting a root system and Tits arrangements satisfying an
integrality condition which we call the crystallographic property.
|
math.CO
|
we translate the axioms of a weyl groupoid with not necessarily finite root system in terms of arrangements the result is a correspondence between weyl groupoids permitting a root system and tits arrangements satisfying an integrality condition which we call the crystallographic property
|
[['we', 'translate', 'the', 'axioms', 'of', 'a', 'weyl', 'groupoid', 'with', 'not', 'necessarily', 'finite', 'root', 'system', 'in', 'terms', 'of', 'arrangements', 'the', 'result', 'is', 'a', 'correspondence', 'between', 'weyl', 'groupoids', 'permitting', 'a', 'root', 'system', 'and', 'tits', 'arrangements', 'satisfying', 'an', 'integrality', 'condition', 'which', 'we', 'call', 'the', 'crystallographic', 'property']]
|
[-0.26348209968053327, 0.09602800778520759, -0.10737608004967834, 0.009850539930359743, -0.1837692039390636, -0.181910817847089, 0.035336778730663015, 0.32450409467483676, -0.35985964558325534, -0.21914991654109123, 0.03606059332648942, -0.25147211993503016, -0.14541080221533775, 0.1464959430226753, -0.16919867739861094, -0.025553787646945134, 0.05542665425428124, 0.09492213548117773, -0.1678359359719379, -0.24871029895405436, 0.3912529943640842, 0.004086898986336796, 0.29776174731032795, 0.08578323720152987, 0.1278699589676635, 0.018836977989087966, 0.10786400436488695, 0.06039695727617242, -0.15261507059209223, 0.07717180327880521, 0.27014547577777576, 0.05353243571034698, 0.20016843597079778, -0.3599006381578917, -0.03842186752360228, 0.1645999675031838, 0.09638263345804325, 0.023389720431052495, -0.0015047032922116477, -0.28438431804263314, 0.10687455840322167, -0.18149983241807582, -0.19115641609180806, -0.004246862172040828, -0.021530739529881368, -0.034766372899676476, -0.21780100938062683, -0.0003964209625887316, 0.2041286088006441, 0.1842509171990461, -0.12866770084622467, -0.015009612002041798, -0.0406270001820007, 0.06893918534394267, -0.03569902027523968, -0.035205535406550005, 0.061248168944879326, -0.048573017206995986, -0.1714976929956614, 0.4520242667302143, 0.06911242509607313, -0.27800099031869757, 0.15825898197024715, -0.13760280702263117, -0.15543326425777618, 0.10027343462502887, 0.036610563588870125, 0.06943461709374259, -0.07428934271339067, 0.14584818620879073, -0.1731341922179211, 0.0674763322959459, 0.10591219770613798, 0.05175385754122291, 0.17385721585691669, 0.047140042243395436, 0.14243510605897322, 0.14686945799824802, 0.03974908053181892, -0.011177920119100532, -0.4048865358453504, -0.27804483046625245, -0.1570351941640987, 0.09894344858997123, -0.11273248156845342, -0.2618875134909569, 0.3712607800749369, 0.08622602301887995, 0.19339879775463148, 0.13252188622962338, 0.166218432662792, 0.0947567105163322, 0.13848014188887076, 0.006507403260573398, 0.10068652083620776, 0.2559991152307322, 0.0172756482132299, -0.13317507614793125, 0.007228080123706266, 0.259882619886031]
|
1,803.09522
|
A Provably Correct Algorithm for Deep Learning that Actually Works
|
We describe a layer-by-layer algorithm for training deep convolutional
networks, where each step involves gradient updates for a two layer network
followed by a simple clustering algorithm. Our algorithm stems from a deep
generative model that generates mages level by level, where lower resolution
images correspond to latent semantic classes. We analyze the convergence rate
of our algorithm assuming that the data is indeed generated according to this
model (as well as additional assumptions). While we do not pretend to claim
that the assumptions are realistic for natural images, we do believe that they
capture some true properties of real data. Furthermore, we show that our
algorithm actually works in practice (on the CIFAR dataset), achieving results
in the same ballpark as that of vanilla convolutional neural networks that are
being trained by stochastic gradient descent. Finally, our proof techniques may
be of independent interest.
|
cs.LG stat.ML
|
we describe a layerbylayer algorithm for training deep convolutional networks where each step involves gradient updates for a two layer network followed by a simple clustering algorithm our algorithm stems from a deep generative model that generates mages level by level where lower resolution images correspond to latent semantic classes we analyze the convergence rate of our algorithm assuming that the data is indeed generated according to this model as well as additional assumptions while we do not pretend to claim that the assumptions are realistic for natural images we do believe that they capture some true properties of real data furthermore we show that our algorithm actually works in practice on the cifar dataset achieving results in the same ballpark as that of vanilla convolutional neural networks that are being trained by stochastic gradient descent finally our proof techniques may be of independent interest
|
[['we', 'describe', 'a', 'layerbylayer', 'algorithm', 'for', 'training', 'deep', 'convolutional', 'networks', 'where', 'each', 'step', 'involves', 'gradient', 'updates', 'for', 'a', 'two', 'layer', 'network', 'followed', 'by', 'a', 'simple', 'clustering', 'algorithm', 'our', 'algorithm', 'stems', 'from', 'a', 'deep', 'generative', 'model', 'that', 'generates', 'mages', 'level', 'by', 'level', 'where', 'lower', 'resolution', 'images', 'correspond', 'to', 'latent', 'semantic', 'classes', 'we', 'analyze', 'the', 'convergence', 'rate', 'of', 'our', 'algorithm', 'assuming', 'that', 'the', 'data', 'is', 'indeed', 'generated', 'according', 'to', 'this', 'model', 'as', 'well', 'as', 'additional', 'assumptions', 'while', 'we', 'do', 'not', 'pretend', 'to', 'claim', 'that', 'the', 'assumptions', 'are', 'realistic', 'for', 'natural', 'images', 'we', 'do', 'believe', 'that', 'they', 'capture', 'some', 'true', 'properties', 'of', 'real', 'data', 'furthermore', 'we', 'show', 'that', 'our', 'algorithm', 'actually', 'works', 'in', 'practice', 'on', 'the', 'cifar', 'dataset', 'achieving', 'results', 'in', 'the', 'same', 'ballpark', 'as', 'that', 'of', 'vanilla', 'convolutional', 'neural', 'networks', 'that', 'are', 'being', 'trained', 'by', 'stochastic', 'gradient', 'descent', 'finally', 'our', 'proof', 'techniques', 'may', 'be', 'of', 'independent', 'interest']]
|
[-0.02949043429488766, 0.02397191531891967, -0.0963401084830021, 0.09559894875976546, -0.09621925825766962, -0.17440311680066176, 0.050701596318133944, 0.47649655604156954, -0.28442622597232975, -0.3210997588161765, 0.08923109383322299, -0.22959384344646644, -0.22487391032888715, 0.20987593760746048, -0.11867054648183543, 0.035184405573868545, 0.1420684484508017, 0.03775578869570946, -0.044237894204380956, -0.31951331929143134, 0.31384106066463324, 0.051471938953558304, 0.3137689299239167, -0.006387996307477869, 0.138008508331881, -0.06396939718758624, 0.006602271302233868, 0.007793512786608109, -0.06177497825255128, 0.13979663085995306, 0.261496749720215, 0.2019320175456634, 0.3118897262446839, -0.44530681142430945, -0.2234845514409244, 0.10222489230238416, 0.15209546620327305, 0.14245715300745235, -0.040046687299738926, -0.2851310007852213, 0.15014096610408662, -0.12351098069278844, -0.00860734129131868, -0.14733221082594888, -0.06486990340856899, 0.02888512612473027, -0.3136331868743331, 0.05111040395909342, 0.12324362170224175, 0.018848563165500248, -0.044892104055154425, -0.11431087978537484, -0.012846987917698149, 0.11536642843857407, 0.041037930917508646, 0.047770751067758375, 0.13178060143214554, -0.16228341434375737, -0.13493414879776539, 0.32360738651377374, -0.098383362053749, -0.19393271654201993, 0.16649161131795623, -0.04767045869074505, -0.19359034674547226, 0.099723783201249, 0.20944491468755336, 0.11179649732878495, -0.14463985691746248, 0.025398171616011652, -0.11243048113096377, 0.17825987772325633, 0.03426303902624882, -0.022763616217557212, 0.12395832103532578, 0.2113299793210523, 0.06059143269306113, 0.10364983544909749, -0.10335838704626879, -0.08868269736974918, -0.28395200100052975, -0.09064417429075673, -0.2191647525459271, 0.0016906420829713924, -0.11025269315818903, -0.13486358008732827, 0.3807289018456278, 0.23827455150814533, 0.26086786938188916, 0.15261090296995022, 0.3221482023918913, 0.04346581517863248, 0.12215037887980199, 0.11156788518780779, 0.19530493842040444, 0.026326145327264634, 0.0899313512788122, -0.12319875900505174, 0.12172236985302178, 0.07133571353002355]
|
1,803.09523
|
White dwarf-main sequence binaries from LAMOST: the DR5 catalogue
|
We present the data release (DR) 5 catalogue of white dwarf-main sequence
(WDMS) binaries from the Large Area Multi-Object fiber Spectroscopic Telescope
(LAMOST). The catalogue contains 876 WDMS binaries, of which 757 are additions
to our previous LAMOST DR1 sample and 357 are systems that have not been
published before. We also describe a LAMOST-dedicated survey that aims at
obtaining spectra of photometrically-selected WDMS binaries from the Sloan
Digital Sky Survey (SDSS) that are expected to contain cool white dwarfs and/or
early type M dwarf companions. This is a population under-represented in
previous SDSS WDMS binary catalogues. We determine the stellar parameters
(white dwarf effective temperatures, surface gravities and masses, and M dwarf
spectral types) of the LAMOST DR5 WDMS binaries and make use of the parameter
distributions to analyse the properties of the sample. We find that, despite
our efforts, systems containing cool white dwarfs remain under-represented.
Moreover, we make use of LAMOST DR5 and SDSS DR14 (when available) spectra to
measure the Na I {\lambda}{\lambda} 8183.27, 8194.81 absorption doublet and/or
H{\alpha} emission radial velocities of our systems. This allows identifying
128 binaries displaying significant radial velocity variations, 76 of which are
new. Finally, we cross-match our catalogue with the Catalina Surveys and
identify 57 systems displaying light curve variations. These include 16
eclipsing systems, two of which are new, and nine binaries that are new
eclipsing candidates. We calculate periodograms from the photometric data and
measure (estimate) the orbital periods of 30 (15) WDMS binaries.
|
astro-ph.SR
|
we present the data release dr 5 catalogue of white dwarfmain sequence wdms binaries from the large area multiobject fiber spectroscopic telescope lamost the catalogue contains 876 wdms binaries of which 757 are additions to our previous lamost dr1 sample and 357 are systems that have not been published before we also describe a lamostdedicated survey that aims at obtaining spectra of photometricallyselected wdms binaries from the sloan digital sky survey sdss that are expected to contain cool white dwarfs andor early type m dwarf companions this is a population underrepresented in previous sdss wdms binary catalogues we determine the stellar parameters white dwarf effective temperatures surface gravities and masses and m dwarf spectral types of the lamost dr5 wdms binaries and make use of the parameter distributions to analyse the properties of the sample we find that despite our efforts systems containing cool white dwarfs remain underrepresented moreover we make use of lamost dr5 and sdss dr14 when available spectra to measure the na i lambdalambda 818327 819481 absorption doublet andor halpha emission radial velocities of our systems this allows identifying 128 binaries displaying significant radial velocity variations 76 of which are new finally we crossmatch our catalogue with the catalina surveys and identify 57 systems displaying light curve variations these include 16 eclipsing systems two of which are new and nine binaries that are new eclipsing candidates we calculate periodograms from the photometric data and measure estimate the orbital periods of 30 15 wdms binaries
|
[['we', 'present', 'the', 'data', 'release', 'dr', '5', 'catalogue', 'of', 'white', 'dwarfmain', 'sequence', 'wdms', 'binaries', 'from', 'the', 'large', 'area', 'multiobject', 'fiber', 'spectroscopic', 'telescope', 'lamost', 'the', 'catalogue', 'contains', '876', 'wdms', 'binaries', 'of', 'which', '757', 'are', 'additions', 'to', 'our', 'previous', 'lamost', 'dr1', 'sample', 'and', '357', 'are', 'systems', 'that', 'have', 'not', 'been', 'published', 'before', 'we', 'also', 'describe', 'a', 'lamostdedicated', 'survey', 'that', 'aims', 'at', 'obtaining', 'spectra', 'of', 'photometricallyselected', 'wdms', 'binaries', 'from', 'the', 'sloan', 'digital', 'sky', 'survey', 'sdss', 'that', 'are', 'expected', 'to', 'contain', 'cool', 'white', 'dwarfs', 'andor', 'early', 'type', 'm', 'dwarf', 'companions', 'this', 'is', 'a', 'population', 'underrepresented', 'in', 'previous', 'sdss', 'wdms', 'binary', 'catalogues', 'we', 'determine', 'the', 'stellar', 'parameters', 'white', 'dwarf', 'effective', 'temperatures', 'surface', 'gravities', 'and', 'masses', 'and', 'm', 'dwarf', 'spectral', 'types', 'of', 'the', 'lamost', 'dr5', 'wdms', 'binaries', 'and', 'make', 'use', 'of', 'the', 'parameter', 'distributions', 'to', 'analyse', 'the', 'properties', 'of', 'the', 'sample', 'we', 'find', 'that', 'despite', 'our', 'efforts', 'systems', 'containing', 'cool', 'white', 'dwarfs', 'remain', 'underrepresented', 'moreover', 'we', 'make', 'use', 'of', 'lamost', 'dr5', 'and', 'sdss', 'dr14', 'when', 'available', 'spectra', 'to', 'measure', 'the', 'na', 'i', 'lambdalambda', '818327', '819481', 'absorption', 'doublet', 'andor', 'halpha', 'emission', 'radial', 'velocities', 'of', 'our', 'systems', 'this', 'allows', 'identifying', '128', 'binaries', 'displaying', 'significant', 'radial', 'velocity', 'variations', '76', 'of', 'which', 'are', 'new', 'finally', 'we', 'crossmatch', 'our', 'catalogue', 'with', 'the', 'catalina', 'surveys', 'and', 'identify', '57', 'systems', 'displaying', 'light', 'curve', 'variations', 'these', 'include', '16', 'eclipsing', 'systems', 'two', 'of', 'which', 'are', 'new', 'and', 'nine', 'binaries', 'that', 'are', 'new', 'eclipsing', 'candidates', 'we', 'calculate', 'periodograms', 'from', 'the', 'photometric', 'data', 'and', 'measure', 'estimate', 'the', 'orbital', 'periods', 'of', '30', '15', 'wdms', 'binaries']]
|
[-0.07687562180503622, 0.09036897853103688, -0.05954327729156577, 0.10687883396882976, -0.17987100989557803, -0.08164199444724889, 0.11831838430380678, 0.400738013908267, -0.1047865837988001, -0.3982132523946586, 0.06051786148111473, -0.42355668344161596, -0.044619744305058044, 0.2658075180236769, -0.1080329981527566, -0.027016578800880854, 0.1811112417661982, -0.1414783916812577, -0.01780672868251892, -0.3993827105942564, 0.32539936192486374, -0.005950928717225668, 0.10886387835012475, -0.1933302062666893, 0.05672326705754414, -0.08293375180228843, -0.16641302290563395, -0.0748159118697093, -0.19070551355739032, 0.01651755191832323, 0.2919708105914875, 0.15863475679958117, 0.18417503934002435, -0.19646948752284277, -0.18729194083449538, 0.05572536957190662, 0.19597772681383324, 0.09527398850034052, -0.07497918424311048, -0.2734615029981856, 0.13419485413903545, -0.23320918148965575, -0.1527497077047764, -0.011201941045611853, 0.08998084443022085, 0.13337792058811201, -0.18941659288582025, 0.08921951620642012, 0.03444010871185799, 0.17197711762712628, -0.1914049251108587, -0.18865471917727475, -0.08657045277516877, 0.11528095958115567, -0.03603414398785986, 0.04161568227859565, 0.10664869860181066, -0.06458458101793649, 0.013552894344415943, 0.3864425918112173, -0.1039930682280578, 0.05853842299805618, 0.2048005006566155, -0.16266733268275857, -0.20182623575941552, 0.12664986830720007, 0.2183132836829917, 0.15476141737957225, -0.2738587537422689, -0.011911476952249, 0.025940374709803184, 0.2703302202547794, 0.019620623745856287, 0.11633071786204933, 0.3319091266822681, 0.06015412752362938, -0.011811687258934816, 0.06288913628620812, -0.36934074211567947, 0.0023536920398626415, -0.21793973736405817, -0.06370902758976253, -0.1201310996242921, 0.07712986152367447, -0.09079842088833741, -0.15325442699288003, 0.34793228164962187, 0.13399007185992068, 0.1793421746019778, 0.057367407614231626, 0.29465594555377256, 0.00754743587172239, 0.12344598733403979, 0.10148689896154568, 0.31129623560586056, 0.1898581360001117, 0.11876101776209401, -0.18923921733388493, -0.007767205097956858, -0.022358309760972184]
|
1,803.09524
|
Ordinary lines in space
|
We prove that if a finite point set in real space does not have too many
points on a plane, then it spans a quadratic number of ordinary lines. This
answers the real case of a question of Basit, Dvir, Saraf, and Wolf. It shows
that there is a significant difference in terms of ordinary lines between
planar point sets, which may span a linear number of ordinary lines, and truly
three-dimensional point sets. Our proof uses a projection argument of Kelly
combined with a theorem of Beck on the number of spanned lines of a planar
point set.
|
math.CO
|
we prove that if a finite point set in real space does not have too many points on a plane then it spans a quadratic number of ordinary lines this answers the real case of a question of basit dvir saraf and wolf it shows that there is a significant difference in terms of ordinary lines between planar point sets which may span a linear number of ordinary lines and truly threedimensional point sets our proof uses a projection argument of kelly combined with a theorem of beck on the number of spanned lines of a planar point set
|
[['we', 'prove', 'that', 'if', 'a', 'finite', 'point', 'set', 'in', 'real', 'space', 'does', 'not', 'have', 'too', 'many', 'points', 'on', 'a', 'plane', 'then', 'it', 'spans', 'a', 'quadratic', 'number', 'of', 'ordinary', 'lines', 'this', 'answers', 'the', 'real', 'case', 'of', 'a', 'question', 'of', 'basit', 'dvir', 'saraf', 'and', 'wolf', 'it', 'shows', 'that', 'there', 'is', 'a', 'significant', 'difference', 'in', 'terms', 'of', 'ordinary', 'lines', 'between', 'planar', 'point', 'sets', 'which', 'may', 'span', 'a', 'linear', 'number', 'of', 'ordinary', 'lines', 'and', 'truly', 'threedimensional', 'point', 'sets', 'our', 'proof', 'uses', 'a', 'projection', 'argument', 'of', 'kelly', 'combined', 'with', 'a', 'theorem', 'of', 'beck', 'on', 'the', 'number', 'of', 'spanned', 'lines', 'of', 'a', 'planar', 'point', 'set']]
|
[-0.15805724573948857, 0.055275346827218116, -0.08752607852481875, 0.01893817984061886, -0.0656197832918688, -0.08974371338738318, 0.1261725744840746, 0.3103907666720298, -0.2432162454161717, -0.2704476718885862, 0.0763909700778028, -0.2945087868479741, -0.15376139713489279, 0.258846318016627, -0.0820034385506748, -0.006331325085757643, 0.07296040661785068, 0.023622789021049227, -0.042267553669837664, -0.292188945901105, 0.3443082301468797, -0.07938561385155332, 0.22720568131047245, 0.02110808707621633, 0.12632758513435113, 0.025678235818917046, -0.042635633581679086, 0.09686560360732611, -0.05985528522017246, 0.10692912759081157, 0.26903299858071367, 0.15007437016501338, 0.28334126883775607, -0.33054347368128295, -0.17889253598666388, 0.18717532082251748, 0.11567192739445945, 0.08130549982888624, -0.0367888563113021, -0.2065018805347345, 0.10037099210455139, -0.09784201386726785, -0.1660667402498728, -0.011006339225081764, 0.07910556849377344, 0.011466856361651907, -0.2627166377960191, -0.020677870828468278, 0.11803967624959745, 0.1134296633322172, 0.010276174985290485, -0.0839318448905738, -0.04690763438168001, 0.048647541695331434, -0.024023659786266485, 0.06613738828175939, 0.047477557662427804, -0.0617106816118431, -0.1177180219888307, 0.37520385984027266, -0.03542889054028355, -0.20374558856520725, 0.22093057308384045, -0.15385562811065845, -0.12183290149907258, 0.1619003611635797, 0.12405927096284469, 0.1317947852444284, -0.05241093726363033, 0.1544592700297564, -0.18308467127154676, 0.17556290186547238, 0.11759492978263571, -0.029820282534905235, 0.19953432156495293, 0.08133024850632159, 0.10771832390087277, 0.10685696350458097, -0.05766299613561405, -0.09412961582444151, -0.34662936892056345, -0.16831097964729583, -0.20553253461697082, 0.09144332823572247, -0.0899011683742378, -0.2516890278903349, 0.3624770674445875, 0.08230708273512559, 0.2553449879324406, 0.03956337575919508, 0.24087985443445492, 0.11329166579199242, 0.02859222486482135, 0.08895815375774187, 0.17985540695431435, 0.12427997814339338, 0.049580947595781515, -0.13657018030775064, 0.004663318590432101, 0.15368648184159275]
|
1,803.09525
|
Strong coupling in conserved surface roughening: A new universality
class?
|
The Kardar-Parisi-Zhang (KPZ) equation defines the main universality class
for nonlinear growth and roughening of surfaces. But under certain conditions,
a conserved KPZ equation (cKPZ) is thought to set the universality class
instead. This has non-mean-field behavior only in spatial dimension $d<2$. We
point out here that cKPZ is incomplete: it omits a symmetry-allowed nonlinear
gradient term of the same order as the one retained. Adding this term, we find
a parameter regime where the $1$-loop renormalization group flow diverges. This
suggests a phase transition to a new growth phase, possibly ruled by a strong
coupling fixed point and thus described by a new universality class, for any
$d>1$. In this phase, numerical integration of the model in $d=2$ gives clear
evidence of non mean-field behavior.
|
cond-mat.stat-mech
|
the kardarparisizhang kpz equation defines the main universality class for nonlinear growth and roughening of surfaces but under certain conditions a conserved kpz equation ckpz is thought to set the universality class instead this has nonmeanfield behavior only in spatial dimension d2 we point out here that ckpz is incomplete it omits a symmetryallowed nonlinear gradient term of the same order as the one retained adding this term we find a parameter regime where the 1loop renormalization group flow diverges this suggests a phase transition to a new growth phase possibly ruled by a strong coupling fixed point and thus described by a new universality class for any d1 in this phase numerical integration of the model in d2 gives clear evidence of non meanfield behavior
|
[['the', 'kardarparisizhang', 'kpz', 'equation', 'defines', 'the', 'main', 'universality', 'class', 'for', 'nonlinear', 'growth', 'and', 'roughening', 'of', 'surfaces', 'but', 'under', 'certain', 'conditions', 'a', 'conserved', 'kpz', 'equation', 'ckpz', 'is', 'thought', 'to', 'set', 'the', 'universality', 'class', 'instead', 'this', 'has', 'nonmeanfield', 'behavior', 'only', 'in', 'spatial', 'dimension', 'd2', 'we', 'point', 'out', 'here', 'that', 'ckpz', 'is', 'incomplete', 'it', 'omits', 'a', 'symmetryallowed', 'nonlinear', 'gradient', 'term', 'of', 'the', 'same', 'order', 'as', 'the', 'one', 'retained', 'adding', 'this', 'term', 'we', 'find', 'a', 'parameter', 'regime', 'where', 'the', '1loop', 'renormalization', 'group', 'flow', 'diverges', 'this', 'suggests', 'a', 'phase', 'transition', 'to', 'a', 'new', 'growth', 'phase', 'possibly', 'ruled', 'by', 'a', 'strong', 'coupling', 'fixed', 'point', 'and', 'thus', 'described', 'by', 'a', 'new', 'universality', 'class', 'for', 'any', 'd1', 'in', 'this', 'phase', 'numerical', 'integration', 'of', 'the', 'model', 'in', 'd2', 'gives', 'clear', 'evidence', 'of', 'non', 'meanfield', 'behavior']]
|
[-0.1571510981659465, 0.15347155622927652, -0.08980080000436565, 0.07146699646968514, -0.07434439596733183, -0.19298030415009107, 0.05055866267667302, 0.28539027304448666, -0.26379220849518, -0.19574264521830745, 0.07496315850632175, -0.2638065202402011, -0.17501378048872274, 0.12062570188126917, 0.009495186735875905, 0.04963840827610599, -0.024338738072753673, -0.017951119405728196, -0.09531493049918584, -0.2050218603502388, 0.3545048253145069, -0.014683582370766559, 0.2699283135101019, 0.054707585039244395, 0.0997349193484913, -0.05861473233333879, 0.04725057124761083, 0.04859999600317209, -0.16971608026230364, 0.007010733096620008, 0.21374901842641375, -0.00671917426065662, 0.2672528481606634, -0.337518826112031, -0.28858796631797184, 0.11927183422132305, 0.15141886118198594, 0.1496952355749184, -0.06143320785298373, -0.251213944246692, 0.0424556948822893, -0.13623409495771593, -0.21453869681534987, -0.05702456246100126, 0.026894996483479778, -0.04629738629521472, -0.27406501171043923, 0.12418403428408407, 0.12366635134563811, 0.06267920895404513, -0.02580115635552624, -0.05279426140365221, -0.028228151951841408, 0.08794758467645865, 0.059102259612935144, 0.047565789728034887, 0.07367398978526433, -0.15499987277848226, -0.05868258119200266, 0.3788036552009984, -0.08090294045095722, -0.2112744538894584, 0.20147517144927876, -0.19162565935403109, -0.17379102614828415, 0.16574620828595793, 0.10495618415711026, 0.10401452045827624, -0.16832718790148296, 0.13756788347294083, -0.022451128878240145, 0.18947079988250945, 0.02690676802528962, -0.0326527277187955, 0.1719643738150837, 0.16872231513749988, 0.07666887098833197, 0.17034690312650655, -0.024393002814312857, -0.162619725776641, -0.40289404910177956, -0.15615407014716295, -0.18820899973938904, 0.1133750969611649, -0.13960240816208347, -0.21083669213487977, 0.38017200546023705, 0.14302639272664824, 0.1951192340009936, 0.0828641491534654, 0.17101869305911205, 0.16748873739807976, 0.06779295329244868, 0.05912886278688787, 0.22521093635136383, 0.08790755339319847, 0.11173162032144084, -0.22345389017549855, 0.0735094710703819, 0.14255243876663548]
|
1,803.09526
|
Circulant matrices: norm, powers, and positivity
|
In their recent paper "The spectral norm of a Horadam circulant matrix",
Merikoski, Haukkanen, Mattila and Tossavainen study under which conditions the
spectral norm of a general real circulant matrix ${\bf C}$ equals the modulus
of its row/column sum. We improve on their sufficient condition until we have a
necessary one. Our results connect the above problem to positivity of
sufficiently high powers of the matrix ${\bf C^\top C}$. We then generalize the
result to complex circulant matrices.
|
math.FA
|
in their recent paper the spectral norm of a horadam circulant matrix merikoski haukkanen mattila and tossavainen study under which conditions the spectral norm of a general real circulant matrix bf c equals the modulus of its rowcolumn sum we improve on their sufficient condition until we have a necessary one our results connect the above problem to positivity of sufficiently high powers of the matrix bf ctop c we then generalize the result to complex circulant matrices
|
[['in', 'their', 'recent', 'paper', 'the', 'spectral', 'norm', 'of', 'a', 'horadam', 'circulant', 'matrix', 'merikoski', 'haukkanen', 'mattila', 'and', 'tossavainen', 'study', 'under', 'which', 'conditions', 'the', 'spectral', 'norm', 'of', 'a', 'general', 'real', 'circulant', 'matrix', 'bf', 'c', 'equals', 'the', 'modulus', 'of', 'its', 'rowcolumn', 'sum', 'we', 'improve', 'on', 'their', 'sufficient', 'condition', 'until', 'we', 'have', 'a', 'necessary', 'one', 'our', 'results', 'connect', 'the', 'above', 'problem', 'to', 'positivity', 'of', 'sufficiently', 'high', 'powers', 'of', 'the', 'matrix', 'bf', 'ctop', 'c', 'we', 'then', 'generalize', 'the', 'result', 'to', 'complex', 'circulant', 'matrices']]
|
[-0.13180611369510492, 0.08085152020677924, -0.017684892919690658, 0.01883031786729892, -0.0603549085278064, -0.11390002422034741, 0.042007581341701246, 0.36795574257771174, -0.302173609683911, -0.22766822481527924, 0.16010330132984868, -0.23015169988075893, -0.20103964249913892, 0.11061190052578847, -0.10269686299065749, 0.079622863685557, 0.08034645666678747, 0.07448391457398733, -0.1676169354841113, -0.29965707237521805, 0.34556846936543784, 0.04029063291847706, 0.2076811349298805, 0.12129967755870893, 0.08032013681406776, 0.0012187179550528526, -0.021241757109140356, -0.061334530214468636, -0.1565432830620557, 0.12968489749512324, 0.2009270692508047, 0.1951179708602528, 0.24195849036177, -0.409728650636971, -0.13030582222466666, 0.20615494859094421, 0.07167794222633043, 0.004086387249020239, 0.03336501551636805, -0.22538776385287443, 0.18729922347391645, -0.15854699763158958, -0.13903827980471153, -0.08411511726366977, 0.030366206814845403, 0.02444214795716107, -0.35647662185132506, 0.06100588689247767, 0.1126314111209164, 0.01589240594456593, -0.046162169890788696, -0.17869453475344926, 0.04469949956672887, 0.07911510976031423, 0.010060760950048764, -0.00433194103029867, 0.046779423200835786, -0.06011371292173862, -0.06235606721912821, 0.3345894181231658, -0.03455045101543268, -0.20245989471673964, 0.12448779600361982, -0.13523212088271974, -0.14051598598559698, 0.08807172073051334, 0.15190489287177722, 0.15963728565722704, -0.05744546255717675, 0.14751483720960096, -0.1236025229220589, 0.09242301076650619, 0.09950451978792747, 0.032929471617098895, 0.06890433255427827, 0.023595458616813024, 0.12107072276684146, 0.14297129611329487, -0.0017466354711602131, -0.02359374417962196, -0.3151667755842209, -0.1631683021473388, -0.2778839329009255, 0.10050686575472355, -0.15172647091851105, -0.17279268151770036, 0.44327063392847776, 0.09125220693647862, 0.2168153674714267, 0.0993240657215938, 0.2151956735427181, 0.10832966675749049, 0.04449450454674661, 0.07128722336143255, 0.15329546773495772, 0.3251353168487549, 0.10100615617508689, -0.19056554195160666, 0.0002902391195918123, 0.11583611384655039]
|
1,803.09527
|
On the utility of Metropolis-Hastings with asymmetric acceptance ratio
|
The Metropolis-Hastings algorithm allows one to sample asymptotically from
any probability distribution $\pi$. There has been recently much work devoted
to the development of variants of the MH update which can handle scenarios
where such an evaluation is impossible, and yet are guaranteed to sample from
$\pi$ asymptotically. The most popular approach to have emerged is arguably the
pseudo-marginal MH algorithm which substitutes an unbiased estimate of an
unnormalised version of $\pi$ for $\pi$. Alternative pseudo-marginal algorithms
relying instead on unbiased estimates of the MH acceptance ratio have also been
proposed. These algorithms can have better properties than standard PM
algorithms. Convergence properties of both classes of algorithms are known to
depend on the variability of the estimators involved and reduced variability is
guaranteed to decrease the asymptotic variance of ergodic averages and will
shorten the burn-in period, or convergence to equilibrium, in most scenarios of
interest. A simple approach to reduce variability, amenable to parallel
computations, consists of averaging independent estimators. However, while
averaging estimators of $\pi$ in a pseudo-marginal algorithm retains the
guarantee of sampling from $\pi$ asymptotically, naive averaging of acceptance
ratio estimates breaks detailed balance, leading to incorrect results. We
propose an original methodology which allows for a correct implementation of
this idea. We establish theoretical properties which parallel those available
for standard PM algorithms and discussed above. We demonstrate the interest of
the approach on various inference problems. In particular we show that
convergence to equilibrium can be significantly shortened, therefore offering
the possibility to reduce a user's waiting time in a generic fashion when a
parallel computing architecture is available.
|
stat.CO
|
the metropolishastings algorithm allows one to sample asymptotically from any probability distribution pi there has been recently much work devoted to the development of variants of the mh update which can handle scenarios where such an evaluation is impossible and yet are guaranteed to sample from pi asymptotically the most popular approach to have emerged is arguably the pseudomarginal mh algorithm which substitutes an unbiased estimate of an unnormalised version of pi for pi alternative pseudomarginal algorithms relying instead on unbiased estimates of the mh acceptance ratio have also been proposed these algorithms can have better properties than standard pm algorithms convergence properties of both classes of algorithms are known to depend on the variability of the estimators involved and reduced variability is guaranteed to decrease the asymptotic variance of ergodic averages and will shorten the burnin period or convergence to equilibrium in most scenarios of interest a simple approach to reduce variability amenable to parallel computations consists of averaging independent estimators however while averaging estimators of pi in a pseudomarginal algorithm retains the guarantee of sampling from pi asymptotically naive averaging of acceptance ratio estimates breaks detailed balance leading to incorrect results we propose an original methodology which allows for a correct implementation of this idea we establish theoretical properties which parallel those available for standard pm algorithms and discussed above we demonstrate the interest of the approach on various inference problems in particular we show that convergence to equilibrium can be significantly shortened therefore offering the possibility to reduce a users waiting time in a generic fashion when a parallel computing architecture is available
|
[['the', 'metropolishastings', 'algorithm', 'allows', 'one', 'to', 'sample', 'asymptotically', 'from', 'any', 'probability', 'distribution', 'pi', 'there', 'has', 'been', 'recently', 'much', 'work', 'devoted', 'to', 'the', 'development', 'of', 'variants', 'of', 'the', 'mh', 'update', 'which', 'can', 'handle', 'scenarios', 'where', 'such', 'an', 'evaluation', 'is', 'impossible', 'and', 'yet', 'are', 'guaranteed', 'to', 'sample', 'from', 'pi', 'asymptotically', 'the', 'most', 'popular', 'approach', 'to', 'have', 'emerged', 'is', 'arguably', 'the', 'pseudomarginal', 'mh', 'algorithm', 'which', 'substitutes', 'an', 'unbiased', 'estimate', 'of', 'an', 'unnormalised', 'version', 'of', 'pi', 'for', 'pi', 'alternative', 'pseudomarginal', 'algorithms', 'relying', 'instead', 'on', 'unbiased', 'estimates', 'of', 'the', 'mh', 'acceptance', 'ratio', 'have', 'also', 'been', 'proposed', 'these', 'algorithms', 'can', 'have', 'better', 'properties', 'than', 'standard', 'pm', 'algorithms', 'convergence', 'properties', 'of', 'both', 'classes', 'of', 'algorithms', 'are', 'known', 'to', 'depend', 'on', 'the', 'variability', 'of', 'the', 'estimators', 'involved', 'and', 'reduced', 'variability', 'is', 'guaranteed', 'to', 'decrease', 'the', 'asymptotic', 'variance', 'of', 'ergodic', 'averages', 'and', 'will', 'shorten', 'the', 'burnin', 'period', 'or', 'convergence', 'to', 'equilibrium', 'in', 'most', 'scenarios', 'of', 'interest', 'a', 'simple', 'approach', 'to', 'reduce', 'variability', 'amenable', 'to', 'parallel', 'computations', 'consists', 'of', 'averaging', 'independent', 'estimators', 'however', 'while', 'averaging', 'estimators', 'of', 'pi', 'in', 'a', 'pseudomarginal', 'algorithm', 'retains', 'the', 'guarantee', 'of', 'sampling', 'from', 'pi', 'asymptotically', 'naive', 'averaging', 'of', 'acceptance', 'ratio', 'estimates', 'breaks', 'detailed', 'balance', 'leading', 'to', 'incorrect', 'results', 'we', 'propose', 'an', 'original', 'methodology', 'which', 'allows', 'for', 'a', 'correct', 'implementation', 'of', 'this', 'idea', 'we', 'establish', 'theoretical', 'properties', 'which', 'parallel', 'those', 'available', 'for', 'standard', 'pm', 'algorithms', 'and', 'discussed', 'above', 'we', 'demonstrate', 'the', 'interest', 'of', 'the', 'approach', 'on', 'various', 'inference', 'problems', 'in', 'particular', 'we', 'show', 'that', 'convergence', 'to', 'equilibrium', 'can', 'be', 'significantly', 'shortened', 'therefore', 'offering', 'the', 'possibility', 'to', 'reduce', 'a', 'users', 'waiting', 'time', 'in', 'a', 'generic', 'fashion', 'when', 'a', 'parallel', 'computing', 'architecture', 'is', 'available']]
|
[-0.06691142603846029, 0.05996321397505287, -0.1416081522129252, 0.09400347558058504, -0.07726651994219134, -0.1573465830555424, 0.08279823110030993, 0.40913960279868844, -0.22994836929509824, -0.32220888568116424, 0.10647645341827625, -0.24054636645379837, -0.09853006914171349, 0.2209079477654182, -0.10863006231550099, 0.09888271885290321, 0.07383625257998369, 0.022446074770318535, -0.09183591608871895, -0.29511261247212234, 0.20173316456016882, 0.08586682714311812, 0.3174169143605837, -0.02039235837747084, 0.0775585054683401, -0.00518231493371882, -0.038090327346397224, 0.016110181676957377, -0.13353277702349842, 0.12188391532500352, 0.23177745077703008, 0.15790497557072672, 0.30282752243871974, -0.3638609305049421, -0.14928690232931727, 0.14996748901877371, 0.21360308321672528, 0.10534159013829929, -0.017768967879631493, -0.24742462672118126, 0.12588780289655901, -0.14910145823430634, -0.08164314966634813, -0.1200550485111745, -0.01235872073141907, 0.006099279455908861, -0.31909176240906234, 0.05591438294296885, 0.06032353596887866, 0.03871220324006408, -0.0011311541832248239, -0.16918013500652795, 0.05288433194067679, 0.09671777647386455, 0.09965328108192718, 0.018909594948277493, 0.12199764153254884, -0.06294989931008506, -0.1448369098729209, 0.3468203327576525, -0.03973482226778069, -0.20398111050402312, 0.18195585923223875, -0.07246927207482881, -0.15793797339459784, 0.1642537601187097, 0.17766916530234808, 0.1498883945157986, -0.16936315121804232, 0.08120342623442411, 0.0002838062399059982, 0.15466477605601758, 0.011308770434216674, 0.02559672442830082, 0.1315159876638309, 0.16653208865471625, 0.13488933377543857, 0.1183369017045952, -0.07030977660096846, -0.1454878129718013, -0.26131017414390817, -0.14759745475393196, -0.16903181630536857, 0.035200347418413686, -0.10091462563631419, -0.17775678462734013, 0.36579921952828665, 0.20319441305928604, 0.18253032228195185, 0.10472627408728984, 0.32176176205809626, 0.11943146965599485, 0.05608025345741465, 0.1245019491254247, 0.20785273061942702, 0.12183212264855847, 0.06237950935501157, -0.18730295401616232, 0.15216264578240707, 0.04856073281542167]
|
1,803.09528
|
Topological footprints of the 1D Kitaev chain with long range
superconducting pairings at a finite temperature
|
We study the 1D Kitaev chain with long range superconductive pairing terms at
a finite temperature where the system is prepared in a mixed state in
equilibrium with a heat reservoir maintained at a constant temperature $T$. In
order to probe the footprint of the ground state topological behavior of the
model at finite temperature, we look at two global quantities extracted out of
two geometrical constructions: the Uhlmann and the interferometric phase.
Interestingly, when the long-range effect dominates, the Uhlmann phase approach
fails to reproduce the topological aspects of the model in the pure state
limit; on the other hand, the interferometric phase, though has a proper pure
state reduction, shows a behaviour independent of the ambient temperature.
|
cond-mat.stat-mech cond-mat.str-el
|
we study the 1d kitaev chain with long range superconductive pairing terms at a finite temperature where the system is prepared in a mixed state in equilibrium with a heat reservoir maintained at a constant temperature t in order to probe the footprint of the ground state topological behavior of the model at finite temperature we look at two global quantities extracted out of two geometrical constructions the uhlmann and the interferometric phase interestingly when the longrange effect dominates the uhlmann phase approach fails to reproduce the topological aspects of the model in the pure state limit on the other hand the interferometric phase though has a proper pure state reduction shows a behaviour independent of the ambient temperature
|
[['we', 'study', 'the', '1d', 'kitaev', 'chain', 'with', 'long', 'range', 'superconductive', 'pairing', 'terms', 'at', 'a', 'finite', 'temperature', 'where', 'the', 'system', 'is', 'prepared', 'in', 'a', 'mixed', 'state', 'in', 'equilibrium', 'with', 'a', 'heat', 'reservoir', 'maintained', 'at', 'a', 'constant', 'temperature', 't', 'in', 'order', 'to', 'probe', 'the', 'footprint', 'of', 'the', 'ground', 'state', 'topological', 'behavior', 'of', 'the', 'model', 'at', 'finite', 'temperature', 'we', 'look', 'at', 'two', 'global', 'quantities', 'extracted', 'out', 'of', 'two', 'geometrical', 'constructions', 'the', 'uhlmann', 'and', 'the', 'interferometric', 'phase', 'interestingly', 'when', 'the', 'longrange', 'effect', 'dominates', 'the', 'uhlmann', 'phase', 'approach', 'fails', 'to', 'reproduce', 'the', 'topological', 'aspects', 'of', 'the', 'model', 'in', 'the', 'pure', 'state', 'limit', 'on', 'the', 'other', 'hand', 'the', 'interferometric', 'phase', 'though', 'has', 'a', 'proper', 'pure', 'state', 'reduction', 'shows', 'a', 'behaviour', 'independent', 'of', 'the', 'ambient', 'temperature']]
|
[-0.1571197140523616, 0.20911346979345344, -0.11722457330642629, 0.016782625477581026, -7.454998118161154e-05, -0.12931329261574173, 0.07333884058136712, 0.31548397881644114, -0.2550237890481636, -0.26475696390330355, 0.09178935600632504, -0.29812780550892365, -0.04132773960577842, 0.14710979245430908, 0.03385278210435219, 0.027612163267536637, -0.008076556500423104, 0.056437899967060744, -0.13738882689572432, -0.20825956688270347, 0.3086689922708173, 0.02825233921753008, 0.32386145111517745, 0.054664589245529735, 0.0976264599745921, -0.027235421055180467, 0.0624349592488353, 0.05014241748184216, -0.14031961444420976, -0.01953272522278443, 0.24381860259122082, -0.02092537202266047, 0.18604159459839537, -0.3967325074300796, -0.2576179445228156, 0.11204656964058385, 0.062336291217816475, 0.15739169133780131, 0.026571496539483114, -0.2588528713657513, 0.029469351601168637, -0.17056907085748782, -0.16238045379785554, -0.06384005071839881, 0.0009165360678394302, -0.04469263522705736, -0.22020892913946333, 0.0765757705114328, 0.07482610694563188, 0.07218627845320631, -0.0685985297993796, -0.1128997052892526, -0.05977350997762019, 0.11701954198544336, -0.008563741920281108, 0.04340131653417997, 0.10720540605829794, -0.1419413534047849, -0.05652584645803235, 0.3369537844878285, -0.13353488149665327, -0.12534670108350135, 0.20406236889881685, -0.1661749281568312, -0.1102067059191617, 0.13546503136451005, 0.08827530160671522, 0.09546305349844061, -0.10144247706970219, 0.08256434432393284, 0.006210216528446484, 0.20187460743829982, 0.0037498555905303033, 0.0754899108438056, 0.22528618613567142, 0.17849525672133168, 0.0603527877198047, 0.2133613527060815, -0.09821227576719116, -0.14839997716999354, -0.29383141013300595, -0.1442687765738199, -0.2138155997092953, 0.0461906944753743, -0.08043777505941044, -0.17816811521780215, 0.4149107516531934, 0.14834845842507713, 0.20611766351684302, -0.009935898616315187, 0.2813616293568571, 0.09799540992200124, 0.0061435776023084625, 0.06177306847799444, 0.2398870138514067, 0.15093087299703425, 0.1457907438176457, -0.30338339870130376, 0.07044199528172612, 0.06685609375165791]
|
1,803.09529
|
Poster: Communication in Open-Source Projects--End of the E-mail Era?
|
Communication is essential in software engineering. Especially in distributed
open-source teams, communication needs to be supported by channels including
mailing lists, forums, issue trackers, and chat systems. Yet, we do not have a
clear understanding of which communication channels stakeholders in open-source
projects use. In this study, we fill the knowledge gap by investigating a
statistically representative sample of 400 GitHub projects. We discover the
used communication channels by regular expressions on project data. We show
that (1) half of the GitHub projects use observable communication channels; (2)
GitHub Issues, e-mail addresses, and the modern chat system Gitter are the most
common channels; (3) mailing lists are only in place five and have a lower
market share than all modern chat systems combined.
|
cs.SE
|
communication is essential in software engineering especially in distributed opensource teams communication needs to be supported by channels including mailing lists forums issue trackers and chat systems yet we do not have a clear understanding of which communication channels stakeholders in opensource projects use in this study we fill the knowledge gap by investigating a statistically representative sample of 400 github projects we discover the used communication channels by regular expressions on project data we show that 1 half of the github projects use observable communication channels 2 github issues email addresses and the modern chat system gitter are the most common channels 3 mailing lists are only in place five and have a lower market share than all modern chat systems combined
|
[['communication', 'is', 'essential', 'in', 'software', 'engineering', 'especially', 'in', 'distributed', 'opensource', 'teams', 'communication', 'needs', 'to', 'be', 'supported', 'by', 'channels', 'including', 'mailing', 'lists', 'forums', 'issue', 'trackers', 'and', 'chat', 'systems', 'yet', 'we', 'do', 'not', 'have', 'a', 'clear', 'understanding', 'of', 'which', 'communication', 'channels', 'stakeholders', 'in', 'opensource', 'projects', 'use', 'in', 'this', 'study', 'we', 'fill', 'the', 'knowledge', 'gap', 'by', 'investigating', 'a', 'statistically', 'representative', 'sample', 'of', '400', 'github', 'projects', 'we', 'discover', 'the', 'used', 'communication', 'channels', 'by', 'regular', 'expressions', 'on', 'project', 'data', 'we', 'show', 'that', '1', 'half', 'of', 'the', 'github', 'projects', 'use', 'observable', 'communication', 'channels', '2', 'github', 'issues', 'email', 'addresses', 'and', 'the', 'modern', 'chat', 'system', 'gitter', 'are', 'the', 'most', 'common', 'channels', '3', 'mailing', 'lists', 'are', 'only', 'in', 'place', 'five', 'and', 'have', 'a', 'lower', 'market', 'share', 'than', 'all', 'modern', 'chat', 'systems', 'combined']]
|
[-0.21017146488383495, 0.04470686547431454, -0.037172233036978815, 0.10750885337560637, -0.08395190894809841, -0.21779279268850557, 0.0917784069344157, 0.4456686040111741, -0.21626653595799847, -0.3448695605468066, 0.1539293384231001, -0.3677531559111886, -0.11311474107406255, 0.20344789356058157, -0.05175345008200431, 0.008893941205613255, 0.14820671205210392, -0.0009811061728348743, 0.009364413374225746, -0.3074984066503229, 0.31052812690880977, 0.04234915144825507, 0.2888795658068151, 0.05976365273818374, -0.01855358840934894, -0.017993094386212282, -0.14096091279271442, -0.07314335503214665, -0.1148670875359652, 0.13203537623783512, 0.38859397982109767, 0.25877191811097694, 0.330015686050546, -0.4036528549595907, -0.15999498954290892, 0.04482782000416249, 0.17598419954435382, 0.06623488353836335, -0.04274241435131608, -0.2996908974181097, 0.07484662546547222, -0.2382826955004244, -0.04737700940683278, -0.023318733775713404, 0.004455764945901808, 0.022889035826426794, -0.17341463173525867, -0.038024824448540565, -0.004169003289864689, 0.1434246637499662, 0.009361044631614426, -0.14576210821196284, 0.019958979276497466, 0.22792082437272107, 0.012678603074879797, -0.0048823685358568535, 0.15754091172940937, -0.13033524279856717, -0.14952037505591748, 0.39250544681534416, -0.020784065112701547, -0.13524880292291036, 0.2130804194870298, -0.0537808854505038, -0.16240675338986713, 0.08183034983049452, 0.2826495877329688, 0.051279641126786346, -0.2828902211803638, 0.048703079831836076, -0.020343774326573142, 0.23435830447362874, 0.03985431817451828, 0.046754271849287585, 0.1974038732711409, 0.19959936512359341, 0.029924721953260604, 0.09186857185597516, -0.008879673778896266, -0.09786874364458452, -0.2110524610234577, -0.15236033709170144, -0.15030406605257637, -0.00388188330543926, -0.00520806180536995, -0.09253561782238424, 0.3534538900159055, 0.1973317203066144, 0.06379430259474873, 0.0202880609469473, 0.3199105017864313, -0.042314956430345774, 0.14993714972321168, 0.20718289251805697, 0.16198190388300257, -0.008004434103314138, 0.16524887125038343, -0.0894854844043978, 0.08298325012285324, -0.07688756282517656]
|
1,803.0953
|
Merger estimates for rotating Kerr black holes in modified gravity
|
In this paper, we explore the signatures of non-rotating and rotating black
hole mergers in the matter-free modified gravity. First, we solve the unstable
circular null orbits and the innermost stable circular timelike orbits via the
geodesic motion. The characteristic quantities of these orbits are
systematically analyzed by varying the black hole spin and the scalar field
parameter of the gravity. Then based on it, we study the ringdown modes from
the light ring/quasinormal modes correspondence. The final spins of the merged
black holes are also estimated with the Buonanno-Kidder-Lehner recipe. Several
black hole merging cases are investigated in detail. All these results show
that the black hole mergers are closely dependent of the scalar field parameter
of the gravity.
|
gr-qc hep-th
|
in this paper we explore the signatures of nonrotating and rotating black hole mergers in the matterfree modified gravity first we solve the unstable circular null orbits and the innermost stable circular timelike orbits via the geodesic motion the characteristic quantities of these orbits are systematically analyzed by varying the black hole spin and the scalar field parameter of the gravity then based on it we study the ringdown modes from the light ringquasinormal modes correspondence the final spins of the merged black holes are also estimated with the buonannokidderlehner recipe several black hole merging cases are investigated in detail all these results show that the black hole mergers are closely dependent of the scalar field parameter of the gravity
|
[['in', 'this', 'paper', 'we', 'explore', 'the', 'signatures', 'of', 'nonrotating', 'and', 'rotating', 'black', 'hole', 'mergers', 'in', 'the', 'matterfree', 'modified', 'gravity', 'first', 'we', 'solve', 'the', 'unstable', 'circular', 'null', 'orbits', 'and', 'the', 'innermost', 'stable', 'circular', 'timelike', 'orbits', 'via', 'the', 'geodesic', 'motion', 'the', 'characteristic', 'quantities', 'of', 'these', 'orbits', 'are', 'systematically', 'analyzed', 'by', 'varying', 'the', 'black', 'hole', 'spin', 'and', 'the', 'scalar', 'field', 'parameter', 'of', 'the', 'gravity', 'then', 'based', 'on', 'it', 'we', 'study', 'the', 'ringdown', 'modes', 'from', 'the', 'light', 'ringquasinormal', 'modes', 'correspondence', 'the', 'final', 'spins', 'of', 'the', 'merged', 'black', 'holes', 'are', 'also', 'estimated', 'with', 'the', 'buonannokidderlehner', 'recipe', 'several', 'black', 'hole', 'merging', 'cases', 'are', 'investigated', 'in', 'detail', 'all', 'these', 'results', 'show', 'that', 'the', 'black', 'hole', 'mergers', 'are', 'closely', 'dependent', 'of', 'the', 'scalar', 'field', 'parameter', 'of', 'the', 'gravity']]
|
[-0.17926691609466353, 0.15643772735039435, -0.07542038443821415, 0.13728720530910984, -0.06577352893349352, -0.10535251357103304, -0.039017286995165365, 0.3195967598171052, -0.1712117815780911, -0.2731155209416934, 0.09278627914688313, -0.29590250719022954, -0.10159881693366284, 0.21616150176752422, -0.010859696802256976, 0.060710782161519185, 0.0450141623426797, 0.0397207385503245, -0.12066552906999585, -0.24659452393209025, 0.41741981356929087, 0.0503244217982421, 0.17703727184463355, -0.07725595845446243, 0.06746722476051772, 0.0071647227268224044, 0.005773494026023831, 0.06207289539339646, -0.20821942247173372, 0.057371980869763736, 0.1763994409347553, 0.10228201115535478, 0.1753110538781384, -0.41340969064099303, -0.19449308568659096, 0.032133706356004134, 0.17135076302151053, 0.1765997848173572, -0.11205923023571505, -0.29185957799397283, 0.0769117068404616, -0.2168559166208162, -0.14761070598122047, -0.027311719875088184, 0.05891405276646364, -0.0060391751121950605, -0.17170960211463399, 0.12571242808978966, 0.08338082697779192, -0.0814558089694987, -0.12896597625735073, -0.030718691497094046, -0.10061645026366084, 0.07722779889383859, 0.17296537696147116, -0.007101827042603518, 0.21187861629572333, -0.06335880621375864, -0.11632124602723615, 0.34439835066796615, -0.05693506592316395, -0.19467434623294463, 0.17509218365135523, -0.2857752852339171, -0.10808217153347777, 0.09397735269898075, 0.1745341729641087, 0.2515016094213194, -0.13702812627099958, 0.08915503130351604, 0.012680340929240998, 0.12047601412287202, 0.13919627215018718, 0.036067904159624006, 0.43717530308985864, 0.07770939504380449, -0.035082159403088044, 0.14559375482287762, -0.11461553285963896, -0.07992028958022089, -0.28158095261176763, -0.13603988830473715, -0.10844540447726751, 0.018197884088603115, -0.17146441707808338, -0.15253653727329763, 0.3723152041971936, 0.10063510518807176, 0.1868042479332347, -0.004243649329232462, 0.25897236479514985, 0.07869832940652209, 0.004197540312662121, 0.12625513363913712, 0.3896335224478932, 0.16978828010141409, 0.06243998494780607, -0.29521695828515154, -0.09134099548840421, 0.061345294552018585]
|
1,803.09531
|
Projective geometry of Sasaki-Einstein structures and their
compactification
|
We show that the standard definitions of Sasaki structures have elegant and
simplifying interpretations in terms of projective differential geometry. For
Sasaki-Einstein structures we use projective geometry to provide a resolution
of such structures into geometrically less rigid components; the latter
elemental components are separately, complex, orthogonal, and symplectic
holonomy reductions of the canonical projective tractor/Cartan connection. This
leads to a characterisation of Sasaki-Einstein structures as projective
structures with certain unitary holonomy reductions. As an immediate
application, this is used to describe the projective compactification of
indefinite (suitably) complete non-compact Sasaki-Einstein structures and to
prove that the boundary at infinity is a Fefferman conformal manifold that thus
fibres over a nondegenerate CR manifold (of hypersurface type). We prove that
this CR manifold coincides with the boundary at infinity for the c-projective
compactification of the K\"ahler-Einstein manifold that arises, in the usual
way, as a leaf space for the defining Killing field of the given
Sasaki-Einstein manifold. A procedure for constructing examples is given. The
discussion of symplectic holonomy reductions of projective structures leads us
moreover to a new and simplifying approach to contact projective geometry. This
is of independent interest and is treated in some detail.
|
math.DG
|
we show that the standard definitions of sasaki structures have elegant and simplifying interpretations in terms of projective differential geometry for sasakieinstein structures we use projective geometry to provide a resolution of such structures into geometrically less rigid components the latter elemental components are separately complex orthogonal and symplectic holonomy reductions of the canonical projective tractorcartan connection this leads to a characterisation of sasakieinstein structures as projective structures with certain unitary holonomy reductions as an immediate application this is used to describe the projective compactification of indefinite suitably complete noncompact sasakieinstein structures and to prove that the boundary at infinity is a fefferman conformal manifold that thus fibres over a nondegenerate cr manifold of hypersurface type we prove that this cr manifold coincides with the boundary at infinity for the cprojective compactification of the kahlereinstein manifold that arises in the usual way as a leaf space for the defining killing field of the given sasakieinstein manifold a procedure for constructing examples is given the discussion of symplectic holonomy reductions of projective structures leads us moreover to a new and simplifying approach to contact projective geometry this is of independent interest and is treated in some detail
|
[['we', 'show', 'that', 'the', 'standard', 'definitions', 'of', 'sasaki', 'structures', 'have', 'elegant', 'and', 'simplifying', 'interpretations', 'in', 'terms', 'of', 'projective', 'differential', 'geometry', 'for', 'sasakieinstein', 'structures', 'we', 'use', 'projective', 'geometry', 'to', 'provide', 'a', 'resolution', 'of', 'such', 'structures', 'into', 'geometrically', 'less', 'rigid', 'components', 'the', 'latter', 'elemental', 'components', 'are', 'separately', 'complex', 'orthogonal', 'and', 'symplectic', 'holonomy', 'reductions', 'of', 'the', 'canonical', 'projective', 'tractorcartan', 'connection', 'this', 'leads', 'to', 'a', 'characterisation', 'of', 'sasakieinstein', 'structures', 'as', 'projective', 'structures', 'with', 'certain', 'unitary', 'holonomy', 'reductions', 'as', 'an', 'immediate', 'application', 'this', 'is', 'used', 'to', 'describe', 'the', 'projective', 'compactification', 'of', 'indefinite', 'suitably', 'complete', 'noncompact', 'sasakieinstein', 'structures', 'and', 'to', 'prove', 'that', 'the', 'boundary', 'at', 'infinity', 'is', 'a', 'fefferman', 'conformal', 'manifold', 'that', 'thus', 'fibres', 'over', 'a', 'nondegenerate', 'cr', 'manifold', 'of', 'hypersurface', 'type', 'we', 'prove', 'that', 'this', 'cr', 'manifold', 'coincides', 'with', 'the', 'boundary', 'at', 'infinity', 'for', 'the', 'cprojective', 'compactification', 'of', 'the', 'kahlereinstein', 'manifold', 'that', 'arises', 'in', 'the', 'usual', 'way', 'as', 'a', 'leaf', 'space', 'for', 'the', 'defining', 'killing', 'field', 'of', 'the', 'given', 'sasakieinstein', 'manifold', 'a', 'procedure', 'for', 'constructing', 'examples', 'is', 'given', 'the', 'discussion', 'of', 'symplectic', 'holonomy', 'reductions', 'of', 'projective', 'structures', 'leads', 'us', 'moreover', 'to', 'a', 'new', 'and', 'simplifying', 'approach', 'to', 'contact', 'projective', 'geometry', 'this', 'is', 'of', 'independent', 'interest', 'and', 'is', 'treated', 'in', 'some', 'detail']]
|
[-0.19503802319463248, 0.031343172281123814, -0.08232802807902678, 0.07783076944163976, -0.14869130659275331, -0.13726204590012248, -0.04324184069290566, 0.3692826211165923, -0.25483636329046044, -0.20645379398782285, 0.10343025142061285, -0.21969275873345442, -0.17633091233527431, 0.18024366444979723, -0.15224916535931138, 0.0012261811787119279, 0.07466518186773054, 0.06742063186098583, -0.16674919528767276, -0.27697462804424455, 0.46251547923490693, 0.021279821111462437, 0.2563557569319621, 0.029264803679707723, 0.17266297954409263, -0.017898175239754028, 0.01497961740510968, 0.036587937677559704, -0.1297415958141732, 0.1443888748745219, 0.3000762952348361, 0.10407071847327573, 0.13100760805492218, -0.40972899409631885, -0.23088831616959607, 0.14379164435160466, 0.1379905089449424, 0.06976594308224053, 0.021333128303432695, -0.2819441359394636, 0.08318660740303294, -0.10017849981235578, -0.22054983956787066, -0.11529740547427, 0.013668249598226677, -0.044500499868538615, -0.18171388071316938, -0.015346950125426818, 0.11057767573839579, 0.09212918118693125, -0.05409632270009472, -0.04629973535849832, -0.08049545902758837, 0.05739168633635228, 0.021437717670909105, 0.04868039341452412, 0.11420323206111789, -0.06709256789360482, -0.12106042662157844, 0.3554395508212157, -0.045272980071604255, -0.297817474976182, 0.13904171785315833, -0.12643100719254177, -0.16005335402651094, 0.14974191148216143, 0.11458002816503629, 0.15698055640483896, -0.04948227057854335, 0.18345856480151176, -0.06112516899712575, 0.045034053386786045, 0.12646334887338945, -0.001507588726683305, 0.1330986859324651, 0.13144435415235467, 0.15428489907338724, 0.11891738631499883, -0.014863777392281171, -0.09476528846037885, -0.3931432323387036, -0.2465557741920631, -0.08903009061498615, 0.20830491692042694, -0.1690470974291645, -0.20574550522157015, 0.3748021462382988, 0.013120841285891425, 0.2522941753029441, 0.06259470441992819, 0.23639138910728388, 0.008248137021795488, 0.0481583355125995, 0.055635298248858024, 0.18034927644722093, 0.24183047348872208, 0.015288200779841879, -0.1274016633319358, -0.06159065017858759, 0.13500944276411947]
|
1,803.09532
|
Gaussian kernel quadrature at scaled Gauss-Hermite nodes
|
This article derives an accurate, explicit, and numerically stable
approximation to the kernel quadrature weights in one dimension and on tensor
product grids when the kernel and integration measure are Gaussian. The
approximation is based on use of scaled Gauss-Hermite nodes and truncation of
the Mercer eigendecomposition of the Gaussian kernel. Numerical evidence
indicates that both the kernel quadrature and the approximate weights at these
nodes are positive. An exponential rate of convergence for functions in the
reproducing kernel Hilbert space induced by the Gaussian kernel is proved under
an assumption on growth of the sum of absolute values of the approximate
weights.
|
math.NA
|
this article derives an accurate explicit and numerically stable approximation to the kernel quadrature weights in one dimension and on tensor product grids when the kernel and integration measure are gaussian the approximation is based on use of scaled gausshermite nodes and truncation of the mercer eigendecomposition of the gaussian kernel numerical evidence indicates that both the kernel quadrature and the approximate weights at these nodes are positive an exponential rate of convergence for functions in the reproducing kernel hilbert space induced by the gaussian kernel is proved under an assumption on growth of the sum of absolute values of the approximate weights
|
[['this', 'article', 'derives', 'an', 'accurate', 'explicit', 'and', 'numerically', 'stable', 'approximation', 'to', 'the', 'kernel', 'quadrature', 'weights', 'in', 'one', 'dimension', 'and', 'on', 'tensor', 'product', 'grids', 'when', 'the', 'kernel', 'and', 'integration', 'measure', 'are', 'gaussian', 'the', 'approximation', 'is', 'based', 'on', 'use', 'of', 'scaled', 'gausshermite', 'nodes', 'and', 'truncation', 'of', 'the', 'mercer', 'eigendecomposition', 'of', 'the', 'gaussian', 'kernel', 'numerical', 'evidence', 'indicates', 'that', 'both', 'the', 'kernel', 'quadrature', 'and', 'the', 'approximate', 'weights', 'at', 'these', 'nodes', 'are', 'positive', 'an', 'exponential', 'rate', 'of', 'convergence', 'for', 'functions', 'in', 'the', 'reproducing', 'kernel', 'hilbert', 'space', 'induced', 'by', 'the', 'gaussian', 'kernel', 'is', 'proved', 'under', 'an', 'assumption', 'on', 'growth', 'of', 'the', 'sum', 'of', 'absolute', 'values', 'of', 'the', 'approximate', 'weights']]
|
[-0.08111358524098974, 0.04124017449441136, -0.08470355829413871, 0.07464960378988023, -0.05426479245364232, -0.08428068072489887, 0.049769846148318746, 0.41771782174688377, -0.277063951474949, -0.17610930537497535, 0.13001131158077964, -0.25984579859554624, -0.1453384116509007, 0.18576644573505352, -0.015871529277522587, 0.10846501378948886, 0.07671821604537081, 0.06342547140943194, -0.10161082228437716, -0.2891190942304516, 0.3867653380645421, 0.08782994695622655, 0.2765945021280097, 0.013369867530113393, 0.14694808338891976, -0.0053761240097160625, -0.08473721403827511, -0.08008388582265538, -0.10078253204522042, 0.149659359199221, 0.18026632763156034, 0.07975901538298184, 0.3109204698607181, -0.38959815294382355, -0.1694690972765528, 0.15918674555073664, 0.13790602439526214, 0.017220315645512158, 0.038423130958955914, -0.2498157546376285, 0.07723244913916999, -0.13640469209137326, -0.1270819618547498, -0.15243693097557837, -0.00321398837745045, 0.04955106129410939, -0.375788945315894, 0.09833203755246783, 0.06708601754140651, 0.0336418893375859, -0.07039026998987113, -0.17923913266762947, 0.04166525449983559, 0.04889395019040642, -0.020111648551215534, 0.0037632544775882248, 0.06685175545580314, -0.1124933369941467, -0.058166082225088934, 0.2724082715746051, -0.07127316320457415, -0.28556990010428773, 0.1268299272469272, -0.12293112493635526, -0.06596776332199863, 0.10761555988178814, 0.16175597304821882, 0.10630699539629435, -0.10033993519578713, 0.1309996250789676, -0.022994487040034196, 0.10844403200611039, 0.10026422678266914, 0.0011874875279812558, 0.07271073592229954, 0.07168847070871265, 0.1190584770503264, 0.12505436459899816, -0.09264344540062966, -0.16019789598321596, -0.3325734692037974, -0.154829176894284, -0.3019654234120785, 0.014841141662949208, -0.22827397493882334, -0.23297799766533872, 0.37589341197253284, 0.0707271611091943, 0.22328039138968944, 0.12313040364895342, 0.3088424078921236, 0.22820047480935793, 0.05038173835909952, 0.14027918121929775, 0.17498943498312922, 0.17984762590025885, 0.0020502098209848538, -0.20182672354112408, 0.10264362799889833, 0.1447614888814323]
|
1,803.09533
|
Deep Representation for Patient Visits from Electronic Health Records
|
We show how to learn low-dimensional representations (embeddings) of patient
visits from the corresponding electronic health record (EHR) where
International Classification of Diseases (ICD) diagnosis codes are removed. We
expect that these embeddings will be useful for the construction of predictive
statistical models anticipated to drive personalized medicine and improve
healthcare quality. These embeddings are learned using a deep neural network
trained to predict ICD diagnosis categories. We show that our embeddings
capture relevant clinical informations and can be used directly as input to
standard machine learning algorithms like multi-output classifiers for ICD code
prediction. We also show that important medical informations correspond to
particular directions in our embedding space.
|
cs.CY cs.LG stat.ML
|
we show how to learn lowdimensional representations embeddings of patient visits from the corresponding electronic health record ehr where international classification of diseases icd diagnosis codes are removed we expect that these embeddings will be useful for the construction of predictive statistical models anticipated to drive personalized medicine and improve healthcare quality these embeddings are learned using a deep neural network trained to predict icd diagnosis categories we show that our embeddings capture relevant clinical informations and can be used directly as input to standard machine learning algorithms like multioutput classifiers for icd code prediction we also show that important medical informations correspond to particular directions in our embedding space
|
[['we', 'show', 'how', 'to', 'learn', 'lowdimensional', 'representations', 'embeddings', 'of', 'patient', 'visits', 'from', 'the', 'corresponding', 'electronic', 'health', 'record', 'ehr', 'where', 'international', 'classification', 'of', 'diseases', 'icd', 'diagnosis', 'codes', 'are', 'removed', 'we', 'expect', 'that', 'these', 'embeddings', 'will', 'be', 'useful', 'for', 'the', 'construction', 'of', 'predictive', 'statistical', 'models', 'anticipated', 'to', 'drive', 'personalized', 'medicine', 'and', 'improve', 'healthcare', 'quality', 'these', 'embeddings', 'are', 'learned', 'using', 'a', 'deep', 'neural', 'network', 'trained', 'to', 'predict', 'icd', 'diagnosis', 'categories', 'we', 'show', 'that', 'our', 'embeddings', 'capture', 'relevant', 'clinical', 'informations', 'and', 'can', 'be', 'used', 'directly', 'as', 'input', 'to', 'standard', 'machine', 'learning', 'algorithms', 'like', 'multioutput', 'classifiers', 'for', 'icd', 'code', 'prediction', 'we', 'also', 'show', 'that', 'important', 'medical', 'informations', 'correspond', 'to', 'particular', 'directions', 'in', 'our', 'embedding', 'space']]
|
[0.049593109883029354, 0.033807261689269744, -0.05973404316358607, 0.17586996059187435, -0.1086707266047597, -0.20156874764625998, 0.014510300023142587, 0.4736254491589286, -0.32661491600288584, -0.27685379871505905, 0.08908162269786275, -0.32245909816331486, -0.21011827686293558, 0.2445162752770226, -0.15528820743784308, 0.06318545730953867, 0.18190601486289365, 0.11294655482369391, -0.0640099080850963, -0.3457032525996593, 0.27239207735454496, 0.037840849869958636, 0.36569459090347994, 0.010221212417606942, 0.059775346405380826, 0.020786987566812472, -0.01888266622766175, -0.026491581679544074, -0.1124183749758231, 0.22700604402714156, 0.4692470213815382, 0.2673508360177617, 0.2966156330954453, -0.4069857225414704, -0.27299166956508997, 0.13343574036209083, 0.16562408640642057, 0.1330634729598056, 0.00019546337849037215, -0.34733797964555296, 0.0631375792753798, -0.18092387977733532, 0.015886111318303104, -0.2217627786607905, -0.06354211382991211, 0.003560718554283746, -0.3020707096481188, -0.0015617923750224608, 0.03567454703522592, 0.06360333688472482, -0.09988683672113852, -0.1266036656103097, -0.019672059458257122, 0.2463571994861757, 0.026565181235359475, 0.08402932155454024, 0.18164175157858567, -0.1628242838069458, -0.1703254545615478, 0.3408685940910469, -0.012663057082417337, -0.18719563619233667, 0.18449002188122407, -0.03317282133820382, -0.18795126984504432, 0.05796278880655088, 0.347947655770589, 0.030358426592482085, -0.16965922511008102, -0.05391953730722889, 0.013151712338863449, 0.1782538711125116, 0.057148772351105104, 0.032606990902091966, 0.18646070164395495, 0.2103718154280531, -0.021750405845655636, 0.1012426892612976, -0.10315795006569137, -0.0027209286324002525, -0.19793594115710056, -0.12338929335740183, -0.10528635634744371, 0.04239521421153437, -0.10295160445464055, -0.1593239284645692, 0.38911261664788155, 0.2709482935807583, 0.16287399868650193, 0.057995344353416425, 0.2674017250029878, -0.010545994018585506, 0.1270065813748674, 0.07779202419544824, 0.1454138804332946, 0.010041353495960886, 0.07461839387701316, -0.13492428278338842, 0.11094709502490745, 0.056455670737407426]
|
1,803.09534
|
Tidal Love numbers of neutron stars in $f(R)$ gravity
|
The recent detection of gravitational waves from a neutron star merger was a
significant step towards constraining the nuclear matter equation of state by
using the tidal Love numbers (TLNs) of the merging neutron stars. Measuring or
constraining the neutron star TLNs allows us in principle to exclude or
constraint many equations of state. This approach, however, has the drawback
that many modified theories of gravity could produce deviations from General
Relativity similar to the deviations coming from the uncertainties in the
equation of state. The first and the most natural step in resolving the
mentioned problem is to quantify the effects on the TLNs from the modifications
of General Relativity. With this motivation in mind, in the present paper we
calculate the TLNs of (non-rotating) neutron stars in $f(R)$ gravity. For this
purpose, we first derived the equations describing both the polar and the axial
stationary perturbations of neutron stars in a particular class of $f(R)$
gravity, the so-called $R^2$-gravity. Then, by solving numerically the
perturbation equations, we calculate explicitly the polar and the axial $l=2$
TLNs of the neutron stars in $R^2$-gravity for three characteristic realistic
equations of state. Our results show that while the polar TLNs are slightly
influenced by the $R^2$ modification of General Relativity, the axial TLNs can
be several times larger (in terms of the absolute value) compared to the
general relativistic case.
|
gr-qc astro-ph.HE
|
the recent detection of gravitational waves from a neutron star merger was a significant step towards constraining the nuclear matter equation of state by using the tidal love numbers tlns of the merging neutron stars measuring or constraining the neutron star tlns allows us in principle to exclude or constraint many equations of state this approach however has the drawback that many modified theories of gravity could produce deviations from general relativity similar to the deviations coming from the uncertainties in the equation of state the first and the most natural step in resolving the mentioned problem is to quantify the effects on the tlns from the modifications of general relativity with this motivation in mind in the present paper we calculate the tlns of nonrotating neutron stars in fr gravity for this purpose we first derived the equations describing both the polar and the axial stationary perturbations of neutron stars in a particular class of fr gravity the socalled r2gravity then by solving numerically the perturbation equations we calculate explicitly the polar and the axial l2 tlns of the neutron stars in r2gravity for three characteristic realistic equations of state our results show that while the polar tlns are slightly influenced by the r2 modification of general relativity the axial tlns can be several times larger in terms of the absolute value compared to the general relativistic case
|
[['the', 'recent', 'detection', 'of', 'gravitational', 'waves', 'from', 'a', 'neutron', 'star', 'merger', 'was', 'a', 'significant', 'step', 'towards', 'constraining', 'the', 'nuclear', 'matter', 'equation', 'of', 'state', 'by', 'using', 'the', 'tidal', 'love', 'numbers', 'tlns', 'of', 'the', 'merging', 'neutron', 'stars', 'measuring', 'or', 'constraining', 'the', 'neutron', 'star', 'tlns', 'allows', 'us', 'in', 'principle', 'to', 'exclude', 'or', 'constraint', 'many', 'equations', 'of', 'state', 'this', 'approach', 'however', 'has', 'the', 'drawback', 'that', 'many', 'modified', 'theories', 'of', 'gravity', 'could', 'produce', 'deviations', 'from', 'general', 'relativity', 'similar', 'to', 'the', 'deviations', 'coming', 'from', 'the', 'uncertainties', 'in', 'the', 'equation', 'of', 'state', 'the', 'first', 'and', 'the', 'most', 'natural', 'step', 'in', 'resolving', 'the', 'mentioned', 'problem', 'is', 'to', 'quantify', 'the', 'effects', 'on', 'the', 'tlns', 'from', 'the', 'modifications', 'of', 'general', 'relativity', 'with', 'this', 'motivation', 'in', 'mind', 'in', 'the', 'present', 'paper', 'we', 'calculate', 'the', 'tlns', 'of', 'nonrotating', 'neutron', 'stars', 'in', 'fr', 'gravity', 'for', 'this', 'purpose', 'we', 'first', 'derived', 'the', 'equations', 'describing', 'both', 'the', 'polar', 'and', 'the', 'axial', 'stationary', 'perturbations', 'of', 'neutron', 'stars', 'in', 'a', 'particular', 'class', 'of', 'fr', 'gravity', 'the', 'socalled', 'r2gravity', 'then', 'by', 'solving', 'numerically', 'the', 'perturbation', 'equations', 'we', 'calculate', 'explicitly', 'the', 'polar', 'and', 'the', 'axial', 'l2', 'tlns', 'of', 'the', 'neutron', 'stars', 'in', 'r2gravity', 'for', 'three', 'characteristic', 'realistic', 'equations', 'of', 'state', 'our', 'results', 'show', 'that', 'while', 'the', 'polar', 'tlns', 'are', 'slightly', 'influenced', 'by', 'the', 'r2', 'modification', 'of', 'general', 'relativity', 'the', 'axial', 'tlns', 'can', 'be', 'several', 'times', 'larger', 'in', 'terms', 'of', 'the', 'absolute', 'value', 'compared', 'to', 'the', 'general', 'relativistic', 'case']]
|
[-0.10465119192661416, 0.11505371831585226, -0.08927862001298296, 0.11539112868938416, -0.10145053434222286, -0.051893045310354, -0.015859021197732002, 0.24566510095826338, -0.2141616858443343, -0.30956410264848494, 0.054043275670668994, -0.26400587714373036, -0.08564037565288325, 0.20440911625890168, -0.03908285041267158, 0.03730064804216351, 0.049333326977588174, 0.057085917998251696, -0.12786596421331298, -0.1995168123038396, 0.3837963211712098, 0.055223746158133816, 0.18966071643585983, -0.010295174588900726, 0.06869272227850479, -0.03933067299073814, -0.029539247089691915, 0.027141646331574718, -0.14545351745161444, 0.0773174554652506, 0.22154528581999663, 0.12792319169381886, 0.21201359542233128, -0.4492443262733617, -0.23273069134559562, 0.08506178327197592, 0.11056687811381431, 0.17946867174143583, -0.07150798686525854, -0.2838211204494679, 0.07180854727655922, -0.2118384322714809, -0.16271717400456814, -0.03016837121406367, 0.029128662371544337, 0.026856468871742176, -0.230228060014611, 0.09695800618719977, 0.07412784628155254, -0.03625351672152802, -0.11636805353105661, -0.11894130248497098, 0.014253695036882461, 0.06588874610067716, 0.11451989664557882, 0.05705473351792542, 0.10633991162321128, -0.1674917966847239, -0.061740787368619564, 0.44536343465791, -0.10627202044686457, -0.17860790488907993, 0.12647249099318605, -0.21230803698394854, -0.16743942775954715, 0.08767912227418437, 0.16929215815032153, 0.19373337668671747, -0.14710095114843294, 0.05390530274942005, 0.006047277800803882, 0.1343114418526664, 0.10688378052037681, 0.004048365748824966, 0.27706696544229925, 0.11984869020108507, -0.004918435727262373, 0.11384064248558663, -0.13842298588146126, -0.09284432193337569, -0.3058243566497705, -0.12204623883630772, -0.12259719371144949, 0.05455230182650861, -0.12674955936438784, -0.11055931627677193, 0.3723401880404184, 0.12892153234257644, 0.10474617599599129, 0.04553006343567931, 0.27913613325416, 0.11244932058324232, 0.05009312192628803, 0.07018258306096149, 0.3553567935415751, 0.19534047963260368, 0.07961400470586583, -0.28351246686265946, 0.05151434146187077, 0.047111865551938914]
|
1,803.09535
|
Connectionist Recommendation in the Wild: On the utility and
scrutability of neural networks for personalized course guidance
|
The aggregate behaviors of users can collectively encode deep semantic
information about the objects with which they interact. In this paper, we
demonstrate novel ways in which the synthesis of these data can illuminate the
terrain of users' environment and support them in their decision making and
wayfinding. A novel application of Recurrent Neural Networks and skip-gram
models, approaches popularized by their application to modeling language, are
brought to bear on student university enrollment sequences to create vector
representations of courses and map out traversals across them. We present
demonstrations of how scrutability from these neural networks can be gained and
how the combination of these techniques can be seen as an evolution of content
tagging and a means for a recommender to balance user preferences inferred from
data with those explicitly specified. From validation of the models to the
development of a UI, we discuss additional requisite functionality informed by
the results of a usability study leading to the ultimate deployment of the
system at a university.
|
cs.AI cs.CY
|
the aggregate behaviors of users can collectively encode deep semantic information about the objects with which they interact in this paper we demonstrate novel ways in which the synthesis of these data can illuminate the terrain of users environment and support them in their decision making and wayfinding a novel application of recurrent neural networks and skipgram models approaches popularized by their application to modeling language are brought to bear on student university enrollment sequences to create vector representations of courses and map out traversals across them we present demonstrations of how scrutability from these neural networks can be gained and how the combination of these techniques can be seen as an evolution of content tagging and a means for a recommender to balance user preferences inferred from data with those explicitly specified from validation of the models to the development of a ui we discuss additional requisite functionality informed by the results of a usability study leading to the ultimate deployment of the system at a university
|
[['the', 'aggregate', 'behaviors', 'of', 'users', 'can', 'collectively', 'encode', 'deep', 'semantic', 'information', 'about', 'the', 'objects', 'with', 'which', 'they', 'interact', 'in', 'this', 'paper', 'we', 'demonstrate', 'novel', 'ways', 'in', 'which', 'the', 'synthesis', 'of', 'these', 'data', 'can', 'illuminate', 'the', 'terrain', 'of', 'users', 'environment', 'and', 'support', 'them', 'in', 'their', 'decision', 'making', 'and', 'wayfinding', 'a', 'novel', 'application', 'of', 'recurrent', 'neural', 'networks', 'and', 'skipgram', 'models', 'approaches', 'popularized', 'by', 'their', 'application', 'to', 'modeling', 'language', 'are', 'brought', 'to', 'bear', 'on', 'student', 'university', 'enrollment', 'sequences', 'to', 'create', 'vector', 'representations', 'of', 'courses', 'and', 'map', 'out', 'traversals', 'across', 'them', 'we', 'present', 'demonstrations', 'of', 'how', 'scrutability', 'from', 'these', 'neural', 'networks', 'can', 'be', 'gained', 'and', 'how', 'the', 'combination', 'of', 'these', 'techniques', 'can', 'be', 'seen', 'as', 'an', 'evolution', 'of', 'content', 'tagging', 'and', 'a', 'means', 'for', 'a', 'recommender', 'to', 'balance', 'user', 'preferences', 'inferred', 'from', 'data', 'with', 'those', 'explicitly', 'specified', 'from', 'validation', 'of', 'the', 'models', 'to', 'the', 'development', 'of', 'a', 'ui', 'we', 'discuss', 'additional', 'requisite', 'functionality', 'informed', 'by', 'the', 'results', 'of', 'a', 'usability', 'study', 'leading', 'to', 'the', 'ultimate', 'deployment', 'of', 'the', 'system', 'at', 'a', 'university']]
|
[-0.057929876901615066, 0.045650806044549734, -0.10590738853896985, 0.06457461789494358, -0.1356656684032725, -0.13035539695769996, 0.08762717028286149, 0.42466744257717165, -0.2995639709688857, -0.3705701905297127, 0.08552195538116987, -0.291449197322621, -0.19109101490881628, 0.17160002230304086, -0.10330073463501865, 0.050231205048541464, 0.08973522601972618, 0.04061206592341696, -0.04594459129611733, -0.27281746476844043, 0.3322935285113618, 0.06604796922525173, 0.28351334924670213, 0.023342312763941414, 0.108644771701963, -0.02106679302380939, -0.05829144931191991, -0.011687461668792778, -0.07149566092645515, 0.19589728384082133, 0.33718983053347734, 0.24057994336503263, 0.31803022200258413, -0.4544069369596814, -0.21314036121179245, 0.04878993635004857, 0.13776911437388756, 0.09441755324864236, -0.0347085041753825, -0.3631581301092655, 0.08794201117198536, -0.1916706960196579, -0.0556771212458209, -0.12560312137632312, -0.05812878258844202, 0.05548066078841374, -0.2505783994513436, -0.05521277510031255, 0.06893474380464801, 0.08777496432132662, -0.04512552950324903, -0.08922042450825768, -0.018214011734942654, 0.22830392824608586, 0.033846328535513164, -0.0019507701780568964, 0.14714629139226978, -0.19701955219992845, -0.16621967827556877, 0.3673389486879289, -0.01993065565534516, -0.1849689766218116, 0.23847044478407586, -0.0586423105588127, -0.1298188164517908, 0.05457123270269461, 0.27488256209602435, 0.06246295681712636, -0.1865997295715138, -0.005895172024820513, -0.011732316785073745, 0.17418078650667437, 0.035895828133264925, 0.007731127895660207, 0.2647822855101776, 0.196092211468491, -0.007898713682337613, 0.12217817923422167, -0.04217004343138138, -0.07037372129249894, -0.22170899267598407, -0.15419443513540004, -0.14258935686875648, 0.024547340353939705, -0.06689109675977295, -0.11093322687202362, 0.3997133372387776, 0.2234152456087445, 0.19604382857200717, 0.06577726487543652, 0.288121195090377, 0.05756824331924119, 0.11590927592576286, 0.06200920397270761, 0.153363105562839, 0.047084022001056616, 0.16454446477492055, -0.14843391520068785, 0.10411398264322944, -0.001277134355023771]
|
1,803.09536
|
SEAT: A Taxonomy to Characterize Automation in Software Engineering
|
Reducing cost and time required to build high quality software is a major
goal for software developers. Building tools and techniques that can help
achieve such a goal is the chief aim for Automated Software Engineering (ASE)
researchers. However, in order to be effective an ASE researcher or
professional must understand the characteristics of both successful and
not-so-successful ASE tools, and the constituent techniques employed by such
ASE tools. In this paper we present such a characterization of ASE tools and
major constituent techniques from different areas of computer science and
engineering that have been employed by such ASE tools. To develop the
characterization we carried out an extensive systematic literature review over
about 1175 ASE research articles. One of our key goal was to identify useful
relationships among ASE tools, their constituent techniques and the software
development life cycle activities that these tools targeted. In terms of
changes in popularity of constituent techniques with time we did not observe
any clear trend. We organized the results of our characterization as a taxonomy
called SEAT (Software Engineering Automation Taxonomy). A salient feature of
SEAT is that it focuses on automation of activities from all phases of SDLC.
Such a taxonomy, among other applications, shall enable synthesizing new
automation tools for different SDLC activities. Recomposing existing systems to
achieve better features will also be possible. Further, the taxonomy has been
realized as a graph database using neo4j(an open source graph database), which
can be queried using an SQL like language. The graph database allowed us to
uncover hidden relationships by way of exhaustive search for connections and
paths between different nodes (i.e. concepts). We demonstrate the efficacy of
SEAT by discussing few practical use cases.
|
cs.SE
|
reducing cost and time required to build high quality software is a major goal for software developers building tools and techniques that can help achieve such a goal is the chief aim for automated software engineering ase researchers however in order to be effective an ase researcher or professional must understand the characteristics of both successful and notsosuccessful ase tools and the constituent techniques employed by such ase tools in this paper we present such a characterization of ase tools and major constituent techniques from different areas of computer science and engineering that have been employed by such ase tools to develop the characterization we carried out an extensive systematic literature review over about 1175 ase research articles one of our key goal was to identify useful relationships among ase tools their constituent techniques and the software development life cycle activities that these tools targeted in terms of changes in popularity of constituent techniques with time we did not observe any clear trend we organized the results of our characterization as a taxonomy called seat software engineering automation taxonomy a salient feature of seat is that it focuses on automation of activities from all phases of sdlc such a taxonomy among other applications shall enable synthesizing new automation tools for different sdlc activities recomposing existing systems to achieve better features will also be possible further the taxonomy has been realized as a graph database using neo4jan open source graph database which can be queried using an sql like language the graph database allowed us to uncover hidden relationships by way of exhaustive search for connections and paths between different nodes ie concepts we demonstrate the efficacy of seat by discussing few practical use cases
|
[['reducing', 'cost', 'and', 'time', 'required', 'to', 'build', 'high', 'quality', 'software', 'is', 'a', 'major', 'goal', 'for', 'software', 'developers', 'building', 'tools', 'and', 'techniques', 'that', 'can', 'help', 'achieve', 'such', 'a', 'goal', 'is', 'the', 'chief', 'aim', 'for', 'automated', 'software', 'engineering', 'ase', 'researchers', 'however', 'in', 'order', 'to', 'be', 'effective', 'an', 'ase', 'researcher', 'or', 'professional', 'must', 'understand', 'the', 'characteristics', 'of', 'both', 'successful', 'and', 'notsosuccessful', 'ase', 'tools', 'and', 'the', 'constituent', 'techniques', 'employed', 'by', 'such', 'ase', 'tools', 'in', 'this', 'paper', 'we', 'present', 'such', 'a', 'characterization', 'of', 'ase', 'tools', 'and', 'major', 'constituent', 'techniques', 'from', 'different', 'areas', 'of', 'computer', 'science', 'and', 'engineering', 'that', 'have', 'been', 'employed', 'by', 'such', 'ase', 'tools', 'to', 'develop', 'the', 'characterization', 'we', 'carried', 'out', 'an', 'extensive', 'systematic', 'literature', 'review', 'over', 'about', '1175', 'ase', 'research', 'articles', 'one', 'of', 'our', 'key', 'goal', 'was', 'to', 'identify', 'useful', 'relationships', 'among', 'ase', 'tools', 'their', 'constituent', 'techniques', 'and', 'the', 'software', 'development', 'life', 'cycle', 'activities', 'that', 'these', 'tools', 'targeted', 'in', 'terms', 'of', 'changes', 'in', 'popularity', 'of', 'constituent', 'techniques', 'with', 'time', 'we', 'did', 'not', 'observe', 'any', 'clear', 'trend', 'we', 'organized', 'the', 'results', 'of', 'our', 'characterization', 'as', 'a', 'taxonomy', 'called', 'seat', 'software', 'engineering', 'automation', 'taxonomy', 'a', 'salient', 'feature', 'of', 'seat', 'is', 'that', 'it', 'focuses', 'on', 'automation', 'of', 'activities', 'from', 'all', 'phases', 'of', 'sdlc', 'such', 'a', 'taxonomy', 'among', 'other', 'applications', 'shall', 'enable', 'synthesizing', 'new', 'automation', 'tools', 'for', 'different', 'sdlc', 'activities', 'recomposing', 'existing', 'systems', 'to', 'achieve', 'better', 'features', 'will', 'also', 'be', 'possible', 'further', 'the', 'taxonomy', 'has', 'been', 'realized', 'as', 'a', 'graph', 'database', 'using', 'neo4jan', 'open', 'source', 'graph', 'database', 'which', 'can', 'be', 'queried', 'using', 'an', 'sql', 'like', 'language', 'the', 'graph', 'database', 'allowed', 'us', 'to', 'uncover', 'hidden', 'relationships', 'by', 'way', 'of', 'exhaustive', 'search', 'for', 'connections', 'and', 'paths', 'between', 'different', 'nodes', 'ie', 'concepts', 'we', 'demonstrate', 'the', 'efficacy', 'of', 'seat', 'by', 'discussing', 'few', 'practical', 'use', 'cases']]
|
[-0.059725804914925115, 0.02899328911781653, -0.07250233187508631, 0.06865854916436902, -0.1241102747665388, -0.13091209341758692, 0.08248597102327246, 0.43250235176731083, -0.25328833503053766, -0.37251475344392215, 0.1113535780736232, -0.26199380333654265, -0.1925133655932633, 0.23342301195044837, -0.10814976984600319, 0.07005140246783799, 0.07232464142705163, 0.004356198561466992, -0.010388149943034303, -0.2508606794256187, 0.26778257636484754, 0.062294820867683606, 0.345397151124842, 0.0634036557633066, 0.01851944101715117, -0.00820636303751921, -0.10103072466308925, 0.0035862634487320395, -0.12638897601036597, 0.1788985831941924, 0.39003484689379575, 0.26030098590735634, 0.33692759494066027, -0.43566660389489104, -0.20545656063283482, 0.07743407869860133, 0.16236544797132585, 0.07246573789479502, -0.03466984017212142, -0.27208038412219454, 0.09770182824152, -0.21238475661321893, -0.11141650992960021, -0.1158587779669778, 0.0017082781947039543, 0.02432335961398715, -0.1930260667556745, -0.07189237634822271, 0.06356738547853141, 0.12199688363400889, 0.017474151007147467, -0.12043177759471344, 0.010688434500931593, 0.2508572731868873, 0.04246881066372367, 0.017919464618073287, 0.15512429251408216, -0.1331058768856881, -0.19424477766878104, 0.37518622987104433, -0.0064218563794700015, -0.14649020445740332, 0.22339242558467287, -0.02228833814049412, -0.1937581298341116, 0.11325525722122942, 0.2063994747157215, 0.06768400982725731, -0.20932077200866986, 0.02544640587908645, 0.05299809105786766, 0.1973720880382998, 0.031982330343453214, 0.04094353626013225, 0.22613514313500718, 0.21899942988001392, 0.0455433056241476, 0.13089908158273686, -0.03271459218639722, -0.060116752184777196, -0.22866771153524412, -0.165341911804433, -0.15316607557891054, 0.00576321701920659, -0.05237000073918888, -0.11719076002696992, 0.4213967873708259, 0.19471168975182312, 0.08230564075337181, -0.0014373755428431464, 0.317925153980494, 0.021446540750272518, 0.11189318905740973, 0.07398020523659726, 0.17197180654174907, 0.05293721534932653, 0.13813998816982373, -0.13403642520841857, 0.09429421666382105, 0.006400527013135506]
|
1,803.09537
|
Nucleon internal degrees of freedom and the uniqueness of the
Gamow-Teller state
|
The Gamow-Teller strength in nuclei can be strongly affected by the internal
degrees of freedom of the nucleon. It is demonstrated that this feature is
unique to the Gamow-Teller. Excitation modes that involve spatial degrees of
freedom are much less influenced by the internal excitation of nucleons. The
fact that the observed Gamow-Teller strength is quenched by 30-40 percent in
all nuclei suggests that indeed this is due to the nucleon excitation in
nuclei.
|
nucl-th nucl-ex
|
the gamowteller strength in nuclei can be strongly affected by the internal degrees of freedom of the nucleon it is demonstrated that this feature is unique to the gamowteller excitation modes that involve spatial degrees of freedom are much less influenced by the internal excitation of nucleons the fact that the observed gamowteller strength is quenched by 3040 percent in all nuclei suggests that indeed this is due to the nucleon excitation in nuclei
|
[['the', 'gamowteller', 'strength', 'in', 'nuclei', 'can', 'be', 'strongly', 'affected', 'by', 'the', 'internal', 'degrees', 'of', 'freedom', 'of', 'the', 'nucleon', 'it', 'is', 'demonstrated', 'that', 'this', 'feature', 'is', 'unique', 'to', 'the', 'gamowteller', 'excitation', 'modes', 'that', 'involve', 'spatial', 'degrees', 'of', 'freedom', 'are', 'much', 'less', 'influenced', 'by', 'the', 'internal', 'excitation', 'of', 'nucleons', 'the', 'fact', 'that', 'the', 'observed', 'gamowteller', 'strength', 'is', 'quenched', 'by', '3040', 'percent', 'in', 'all', 'nuclei', 'suggests', 'that', 'indeed', 'this', 'is', 'due', 'to', 'the', 'nucleon', 'excitation', 'in', 'nuclei']]
|
[-0.09666933562304522, 0.31281378908347135, -0.04614254545319725, 0.08909628809920538, -0.01227271171739778, -0.047985621753173904, 0.03335269052862517, 0.3716284369898809, -0.19565060865637418, -0.27844811628597815, -0.07779579873848078, -0.2630767739705137, -0.0887072692165856, 0.10748817728882706, 0.03569981171371969, -0.08276223168138892, 0.03167593845078168, 0.052733061904389714, -0.00786985214044516, -0.18747987627756554, 0.34262900073332964, 0.1201035122550722, 0.23448366549721844, 0.13119791020840607, 0.03159743799148379, 0.0022865400202824056, 0.032350431146049824, -0.040364551302863635, -0.040518626987987603, 0.0983581770891072, 0.26807027414277496, 0.06009222048403997, 0.22333135007805116, -0.3855806556152734, -0.213033782620285, 0.10423513866860319, 0.20679586658229096, 0.14794451302873926, 0.016969050340530638, -0.27855249792589126, 0.03272955790413795, -0.1881842263596686, -0.2055510721874197, -0.12120759195169888, 0.03493651536268157, 0.0704970635297532, -0.24586283131125006, 0.10267709829920046, 0.047933162819292094, 0.06596344200944579, -0.039429729357613505, -0.18641078421166418, -0.11153045289747014, 0.05201603317431904, 0.15493794121131352, 0.07080322565712235, 0.2288209117093199, -0.15720575761578576, -0.026579615505840128, 0.3979808505926583, 0.04060733883415122, -0.16985748255172292, 0.13770004885422216, -0.21099004010367836, -0.12199910093142928, 0.23785920441150665, 0.11839652518313881, 0.10784632002154516, -0.15143282641027425, 0.04180321660887047, -0.023768440203590167, 0.26646901959100283, 0.04919698594666615, 0.11319621716550476, 0.17872782617908073, 0.14104925081561748, 0.02189729704420913, 0.0765357437202191, -0.1001055158448179, -0.10883376393089625, -0.2642314557892245, -0.04850535041249886, -0.21372198265807302, 0.0377749081235379, -0.050668222227171565, -0.04794825063750928, 0.4371403754764312, 0.08008360308028657, 0.17267710031198993, -0.07681864607336654, 0.2534949254949351, 0.11757487770975442, 0.1446678937488311, 0.07898074310474298, 0.4126027757050218, 0.2183904553656592, -0.0017618417135767035, -0.3202686383061715, 0.09276853763573878, -0.00958562410763792]
|
1,803.09538
|
Determining a fractional Helmholtz system with unknown source and medium
parameter
|
We are concerned with an inverse problem associated with the fractional
Helmholtz system that arises from the study of viscoacoustics in geophysics and
thermoviscous modelling of lossy media. We are particularly interested in the
case that both the medium parameter and the internal source of the wave
equation are unknown. Moreover, we consider a general class of source functions
which can be frequency-dependent. We establish several general uniqueness
results in simultaneously recovering both the medium parameter and the internal
source by the corresponding exterior measurements. In sharp contrast, these
unique determination results are unknown in the local case, which would be of
significant importance in thermo- and photo-acoustic tomography.
|
math.AP math-ph math.MP
|
we are concerned with an inverse problem associated with the fractional helmholtz system that arises from the study of viscoacoustics in geophysics and thermoviscous modelling of lossy media we are particularly interested in the case that both the medium parameter and the internal source of the wave equation are unknown moreover we consider a general class of source functions which can be frequencydependent we establish several general uniqueness results in simultaneously recovering both the medium parameter and the internal source by the corresponding exterior measurements in sharp contrast these unique determination results are unknown in the local case which would be of significant importance in thermo and photoacoustic tomography
|
[['we', 'are', 'concerned', 'with', 'an', 'inverse', 'problem', 'associated', 'with', 'the', 'fractional', 'helmholtz', 'system', 'that', 'arises', 'from', 'the', 'study', 'of', 'viscoacoustics', 'in', 'geophysics', 'and', 'thermoviscous', 'modelling', 'of', 'lossy', 'media', 'we', 'are', 'particularly', 'interested', 'in', 'the', 'case', 'that', 'both', 'the', 'medium', 'parameter', 'and', 'the', 'internal', 'source', 'of', 'the', 'wave', 'equation', 'are', 'unknown', 'moreover', 'we', 'consider', 'a', 'general', 'class', 'of', 'source', 'functions', 'which', 'can', 'be', 'frequencydependent', 'we', 'establish', 'several', 'general', 'uniqueness', 'results', 'in', 'simultaneously', 'recovering', 'both', 'the', 'medium', 'parameter', 'and', 'the', 'internal', 'source', 'by', 'the', 'corresponding', 'exterior', 'measurements', 'in', 'sharp', 'contrast', 'these', 'unique', 'determination', 'results', 'are', 'unknown', 'in', 'the', 'local', 'case', 'which', 'would', 'be', 'of', 'significant', 'importance', 'in', 'thermo', 'and', 'photoacoustic', 'tomography']]
|
[-0.1042129760715869, 0.10306440569749814, -0.01855215774116072, 0.043949032952595085, -0.08391755417041066, -0.08675207097204057, -0.03439509907426933, 0.3750706023226182, -0.3100017849959571, -0.2780163487402239, 0.1606733194176168, -0.2824736044578323, -0.16018099317982518, 0.2265315430963205, -0.0395418391821699, 0.07232917210570088, 0.025150885827046027, 0.022170627789347672, -0.05521902780445224, -0.12975386751996767, 0.3681512009266212, 0.018824494668041116, 0.24892991801930797, 0.04570878688590946, 0.07914309610647184, 0.019389547131679678, -0.08248515606047241, 0.03842730429972074, -0.12656686937339987, 0.10845486842057046, 0.27325645759399914, 0.08776763257467085, 0.2580269321247383, -0.4286112811554361, -0.2592857367557439, 0.11634320098285873, 0.11310745278131906, 0.13574309095835174, -0.0695350253803621, -0.26989435973249515, 0.05705481063341722, -0.11081953789969837, -0.1556439936135171, -0.024737901468243863, -0.02028461112813265, 0.04883149232827472, -0.2655334249138832, 0.14095821333359237, 0.0542609406316101, 0.01029466334471686, -0.14803427769112643, -0.08455868517975668, 0.035368594582434056, 0.12638805331921, 0.031072276181981176, 0.004021910518295718, 0.07805400769467707, -0.200400380331471, -0.05950915543534965, 0.39291828985463967, -0.06932999090834831, -0.23913691243096427, 0.17676004649277915, -0.17180464568082243, -0.10680561483820418, 0.11879841343465226, 0.20419788110518344, 0.13851253648667974, -0.17338249641815545, 0.09007197561354756, -0.07422540308376753, 0.14284613524580858, 0.06542152450075028, 0.05185855424928444, 0.13879597088951548, 0.11034354158349473, 0.04244979117626186, 0.18685421517498238, -0.08720870095755716, -0.06954492833810272, -0.3207439898892685, -0.14709490170719586, -0.16595875895237205, 0.022583564573492535, -0.10427427551379272, -0.14448643905214137, 0.3602983516951402, 0.15847544059916227, 0.1586964100047394, -0.012411838130059617, 0.2631060079826663, 0.1717558831258901, -0.038804908438275255, 0.07456317098155894, 0.25879937574198403, 0.14873210478280843, 0.10837717768218783, -0.22646270533463125, 0.0696165466517279, -0.0021731327287852764]
|
1,803.09539
|
On Matching Pursuit and Coordinate Descent
|
Two popular examples of first-order optimization methods over linear spaces
are coordinate descent and matching pursuit algorithms, with their randomized
variants. While the former targets the optimization by moving along
coordinates, the latter considers a generalized notion of directions.
Exploiting the connection between the two algorithms, we present a unified
analysis of both, providing affine invariant sublinear $\mathcal{O}(1/t)$ rates
on smooth objectives and linear convergence on strongly convex objectives. As a
byproduct of our affine invariant analysis of matching pursuit, our rates for
steepest coordinate descent are the tightest known. Furthermore, we show the
first accelerated convergence rate $\mathcal{O}(1/t^2)$ for matching pursuit
and steepest coordinate descent on convex objectives.
|
stat.ML cs.LG math.OC
|
two popular examples of firstorder optimization methods over linear spaces are coordinate descent and matching pursuit algorithms with their randomized variants while the former targets the optimization by moving along coordinates the latter considers a generalized notion of directions exploiting the connection between the two algorithms we present a unified analysis of both providing affine invariant sublinear mathcalo1t rates on smooth objectives and linear convergence on strongly convex objectives as a byproduct of our affine invariant analysis of matching pursuit our rates for steepest coordinate descent are the tightest known furthermore we show the first accelerated convergence rate mathcalo1t2 for matching pursuit and steepest coordinate descent on convex objectives
|
[['two', 'popular', 'examples', 'of', 'firstorder', 'optimization', 'methods', 'over', 'linear', 'spaces', 'are', 'coordinate', 'descent', 'and', 'matching', 'pursuit', 'algorithms', 'with', 'their', 'randomized', 'variants', 'while', 'the', 'former', 'targets', 'the', 'optimization', 'by', 'moving', 'along', 'coordinates', 'the', 'latter', 'considers', 'a', 'generalized', 'notion', 'of', 'directions', 'exploiting', 'the', 'connection', 'between', 'the', 'two', 'algorithms', 'we', 'present', 'a', 'unified', 'analysis', 'of', 'both', 'providing', 'affine', 'invariant', 'sublinear', 'mathcalo1t', 'rates', 'on', 'smooth', 'objectives', 'and', 'linear', 'convergence', 'on', 'strongly', 'convex', 'objectives', 'as', 'a', 'byproduct', 'of', 'our', 'affine', 'invariant', 'analysis', 'of', 'matching', 'pursuit', 'our', 'rates', 'for', 'steepest', 'coordinate', 'descent', 'are', 'the', 'tightest', 'known', 'furthermore', 'we', 'show', 'the', 'first', 'accelerated', 'convergence', 'rate', 'mathcalo1t2', 'for', 'matching', 'pursuit', 'and', 'steepest', 'coordinate', 'descent', 'on', 'convex', 'objectives']]
|
[-0.12529304289523888, -0.010555241000624972, -0.09663150725253952, 0.08089935451045359, -0.07767958731663951, -0.16685431371784742, 0.017682945764561638, 0.4307481916535885, -0.33684029629231865, -0.22840890346453824, 0.1305772321567862, -0.2244869447270528, -0.1677459197593084, 0.20303525089568228, -0.10466520016619918, 0.10078264086789221, 0.045490312204192127, 0.00050844913433998, -0.17805434345618026, -0.30459404056849076, 0.25498491694826053, 0.04101564195284774, 0.31739481956347687, -0.03922871756153779, 0.16167831557179127, 0.05781844655829354, -0.04649972784495272, 0.04320467493300317, -0.09142430876638022, 0.15717466681375417, 0.27134081198398124, 0.2192620909623289, 0.3245667334423836, -0.3685080841730494, -0.11189471463108897, 0.13196913572989508, 0.1688137185042126, 0.06292595148060916, -0.0988084258599241, -0.24859020683418856, 0.031192825897810382, -0.03740587233300876, -0.07133767799978409, -0.10159440840158714, -0.08072686702474405, 0.10592727789413953, -0.29332666604890734, 0.05023771168134355, 0.0850673831161966, 0.06347146474781933, -0.07588697893869713, -0.15597063075289677, 0.04356643696178879, 0.015464466599183619, 0.07905653077647637, 0.05596441306908606, 0.12126328638186593, -0.05192018428885745, -0.1995385578927507, 0.35644965972580495, -0.07357488145385313, -0.22500331079295768, 0.19878455097658917, -0.031136768917049015, -0.17420053847322087, 0.09055495092115544, 0.23623069526986518, 0.2251902868076219, -0.1268935056463089, 0.08651622105443235, -0.05610537500795695, 0.05436961030012954, 0.0715650964032756, -0.008702271771745398, 0.10461461530793287, 0.11290224308336, 0.24499094297408786, 0.12842077230436538, -0.016653863860533462, -0.1806479014062169, -0.30988457018013943, -0.11115468353238128, -0.121022441479967, -0.044004782241846035, -0.1733133953205927, -0.13484058708567684, 0.4113458443535577, 0.02675552193476998, 0.19256931463034327, 0.18432374133668636, 0.3477476406158931, 0.07054939477409689, 0.0010444420846948109, 0.138469230469077, 0.23987804557871792, 0.15664714607495575, 0.03943491459785696, -0.2593294641690824, 0.07843849203899639, 0.20213167109727484]
|
1,803.0954
|
Considerations Regarding the Flux Estimation in Induction Generator with
Application at the Control of Unconventional Energetic Conversion Systems
|
The paper presents issues regarding the flux estimation of induction
machines. The electrical machines variables estimation represents a major
problem in the actual context of modern control approaches, especially of
sensorless control strategies. There are considered several implementations of
induction machine flux estimators by using the Matlab-Simulink environment and
there are drawn the afferent conclusions.
|
cs.SY
|
the paper presents issues regarding the flux estimation of induction machines the electrical machines variables estimation represents a major problem in the actual context of modern control approaches especially of sensorless control strategies there are considered several implementations of induction machine flux estimators by using the matlabsimulink environment and there are drawn the afferent conclusions
|
[['the', 'paper', 'presents', 'issues', 'regarding', 'the', 'flux', 'estimation', 'of', 'induction', 'machines', 'the', 'electrical', 'machines', 'variables', 'estimation', 'represents', 'a', 'major', 'problem', 'in', 'the', 'actual', 'context', 'of', 'modern', 'control', 'approaches', 'especially', 'of', 'sensorless', 'control', 'strategies', 'there', 'are', 'considered', 'several', 'implementations', 'of', 'induction', 'machine', 'flux', 'estimators', 'by', 'using', 'the', 'matlabsimulink', 'environment', 'and', 'there', 'are', 'drawn', 'the', 'afferent', 'conclusions']]
|
[-0.15515989041463896, 0.05486139917576855, -0.03862280437553471, 0.04661414184480567, -0.04880620498972183, -0.16127144236286933, 0.07128521415870637, 0.3922831109978936, -0.2604447471655228, -0.32835642715746705, 0.165818745479919, -0.23336070811545306, -0.11806759207763455, 0.25754959132861005, -0.14466847528449514, 0.12543549667197196, 0.08998339679092168, -0.015431644394993782, -0.02210364615206014, -0.23292278989472173, 0.3065368348393928, 0.019038607806644656, 0.3522048198363998, -0.030959395962682636, 0.13527723494652574, 0.0035121450878002427, -0.0948501905426383, 0.027132866768674418, -0.0835843919522383, 0.15322701238222758, 0.3104139698288319, 0.20113685131919654, 0.3730019437995824, -0.4348287529566071, -0.2157458058135076, 0.12266944312405857, 0.13372412032278425, 0.07260072367604484, -0.052273873866281725, -0.2323401016267863, 0.026209591832858595, -0.12544154709374364, -0.05489643506589346, -0.05269324203783816, -0.025912039899280485, 0.054000544719482686, -0.23388268646191468, 0.03680788742547685, 0.07238950544163923, 0.12064273784106427, -0.08422153158621355, -0.1884497516534545, 0.07559466839513995, 0.15069314487786456, 0.09080947664651004, 0.005711306275969202, 0.22240739546462215, -0.19304681054570458, -0.23145210905508562, 0.3523316148329865, 0.059221254526214163, -0.21426461031448774, 0.1770266897299073, -0.019355742032216353, -0.1479065434329889, 0.055970911046659404, 0.1699330402368849, 0.03683688617099754, -0.20107491768219254, 0.0621292679306035, 0.0017702595923434605, 0.13892560069533913, -0.013384026813913475, -0.026652404191819103, 0.19099172534082423, 0.2346338302405043, 0.018937258879569444, 0.12151013650846752, -0.089858650657433, -0.11500941853631627, -0.2767668971283869, -0.09754449957135049, -0.14163011121140284, -0.007429163987663659, -0.04694145280333363, -0.18007263446396046, 0.3679983910173178, 0.2170768860050223, 0.11292508261447604, 0.0272938196124001, 0.37454213046214796, 0.12136234846812757, 0.044993518242104485, 0.1312930788506161, 0.22521554068238897, 0.18378985372202641, 0.1635531748264012, -0.20956905637867748, 0.1473998137961396, -0.012918341363018209]
|
1,803.09541
|
Schmidt decomposition of mixed-pure states for (d,infinity ) systems and
some applications
|
Summary. A simple derivation of finite Schmidt decomposition of pure states
describing finite dimensional systems interacting with the infinite dimensional
ones is presented. In particular, maximally entangled pure states in such
systems are being characterized. The concept of mixed-pure states has been
introduced and some criterions for checking separability and entanglement of
them are presented .The notion of LOCC equivalence and LOCC semi-order on the
space of pure states of systems analyzed has been adopted suitably. In
particular a Nielsen -like theorem has been extended to the pure (d, infinity
)- states case. The notion of spin-orbit entanglement in the context of atomic
physics is being discussed from a mathematical perspective.
Keywords: quantum entanglement, Schmidt decomposition, mixed-pure states,
LOCC semi-order, spin-orbit entanglement
|
quant-ph
|
summary a simple derivation of finite schmidt decomposition of pure states describing finite dimensional systems interacting with the infinite dimensional ones is presented in particular maximally entangled pure states in such systems are being characterized the concept of mixedpure states has been introduced and some criterions for checking separability and entanglement of them are presented the notion of locc equivalence and locc semiorder on the space of pure states of systems analyzed has been adopted suitably in particular a nielsen like theorem has been extended to the pure d infinity states case the notion of spinorbit entanglement in the context of atomic physics is being discussed from a mathematical perspective keywords quantum entanglement schmidt decomposition mixedpure states locc semiorder spinorbit entanglement
|
[['summary', 'a', 'simple', 'derivation', 'of', 'finite', 'schmidt', 'decomposition', 'of', 'pure', 'states', 'describing', 'finite', 'dimensional', 'systems', 'interacting', 'with', 'the', 'infinite', 'dimensional', 'ones', 'is', 'presented', 'in', 'particular', 'maximally', 'entangled', 'pure', 'states', 'in', 'such', 'systems', 'are', 'being', 'characterized', 'the', 'concept', 'of', 'mixedpure', 'states', 'has', 'been', 'introduced', 'and', 'some', 'criterions', 'for', 'checking', 'separability', 'and', 'entanglement', 'of', 'them', 'are', 'presented', 'the', 'notion', 'of', 'locc', 'equivalence', 'and', 'locc', 'semiorder', 'on', 'the', 'space', 'of', 'pure', 'states', 'of', 'systems', 'analyzed', 'has', 'been', 'adopted', 'suitably', 'in', 'particular', 'a', 'nielsen', 'like', 'theorem', 'has', 'been', 'extended', 'to', 'the', 'pure', 'd', 'infinity', 'states', 'case', 'the', 'notion', 'of', 'spinorbit', 'entanglement', 'in', 'the', 'context', 'of', 'atomic', 'physics', 'is', 'being', 'discussed', 'from', 'a', 'mathematical', 'perspective', 'keywords', 'quantum', 'entanglement', 'schmidt', 'decomposition', 'mixedpure', 'states', 'locc', 'semiorder', 'spinorbit', 'entanglement']]
|
[-0.1482487183510318, 0.21808146429443812, -0.11804162336810797, 0.07093462115740638, 0.015130468174627348, -0.21972393424899764, 0.024142382759405223, 0.2990611203312248, -0.2244032207062515, -0.21927547904060168, 0.08902843452074385, -0.26848117285212425, -0.08619323974287435, 0.1364586854963994, -0.08168319833832753, 0.12058063169174335, 0.04177102219595128, 0.031093337937031222, -0.0647027804946699, -0.24770185788075963, 0.3514849535686535, -0.01216181110250255, 0.3249620224482247, 0.019223273442197247, 0.0815070049055586, 0.02268230725283257, -0.020130059446067307, 0.046625747411666404, -0.12011557465278301, 0.10262931372379462, 0.30897734102112157, 0.15978643563654304, 0.242997879268085, -0.37454326942312616, -0.2021755278501816, 0.1440964563467986, 0.08274068583209976, 0.173398977524147, -0.010572584820402582, -0.34897626624755684, -0.0033272451275036113, -0.2224858369318252, -0.142829577884629, -0.10984832637047223, 0.06484749412727582, -0.06917499495717157, -0.2160671043225384, 0.06629586085958891, 0.1032043961698518, 0.10969395681060341, -0.019855948971161823, -0.08788060697437335, -0.06459303144287287, 0.08238921285912144, -0.0642498557523339, -0.05550445671615919, 0.08220968310948179, -0.08694198810724843, -0.19467911394234716, 0.3530704677496262, -0.01729549642871408, -0.222348360391725, 0.24328670020708265, -0.10823601132117901, -0.1443408498982703, 0.03637963776797557, 0.08269264269228868, 0.11787101756507422, -0.11228323762281602, 0.17233635439633338, -0.10454486750708032, 0.10604927943385511, 0.0956900812012433, 0.1554080200217226, 0.15435768520271703, 0.08860214811773236, 0.08727521395326412, 0.23180312837841882, 0.02581021174990979, -0.16350207347892412, -0.2898045066477997, -0.2142954221760322, -0.267762761312623, 0.08367258207794248, -0.03268016285046313, -0.13182295778934539, 0.38993154987771095, 0.015604325929194876, 0.07847554397871014, -0.005235332666951067, 0.21419157148651904, 0.11609428674726113, 0.038576406696733054, 0.04732526534730021, 0.2618784350394408, 0.25475616336745377, 0.03535748940761428, -0.19802230870265106, 0.03150117380481934, 0.12074047943553691]
|
1,803.09542
|
\b{eta}-KMS Green functions generating functionals - the convexity based
approach
|
The notion of the stochastically positive \b{eta}-KMS (Euclidean time ) Green
functionals on ( the abelian sectors of ) the CCR-algebras in Weyl form has
been introduced .The main observation is that the essential properties of such
functionals are stable against taking convex superpositions of them. Starting
from the free Bose matter describing functionals( the condensed state situation
is included as well) a constructive approach to the constructions of a new ,of
such type functionals is presented. In particular , starting from the free Bose
matter Green functionals a class of not quasi-free thermal functionals,
together with the corresponding modular structures have been constructed. Some
elementary properties of models constructed are being presented.
|
quant-ph
|
the notion of the stochastically positive betakms euclidean time green functionals on the abelian sectors of the ccralgebras in weyl form has been introduced the main observation is that the essential properties of such functionals are stable against taking convex superpositions of them starting from the free bose matter describing functionals the condensed state situation is included as well a constructive approach to the constructions of a new of such type functionals is presented in particular starting from the free bose matter green functionals a class of not quasifree thermal functionals together with the corresponding modular structures have been constructed some elementary properties of models constructed are being presented
|
[['the', 'notion', 'of', 'the', 'stochastically', 'positive', 'betakms', 'euclidean', 'time', 'green', 'functionals', 'on', 'the', 'abelian', 'sectors', 'of', 'the', 'ccralgebras', 'in', 'weyl', 'form', 'has', 'been', 'introduced', 'the', 'main', 'observation', 'is', 'that', 'the', 'essential', 'properties', 'of', 'such', 'functionals', 'are', 'stable', 'against', 'taking', 'convex', 'superpositions', 'of', 'them', 'starting', 'from', 'the', 'free', 'bose', 'matter', 'describing', 'functionals', 'the', 'condensed', 'state', 'situation', 'is', 'included', 'as', 'well', 'a', 'constructive', 'approach', 'to', 'the', 'constructions', 'of', 'a', 'new', 'of', 'such', 'type', 'functionals', 'is', 'presented', 'in', 'particular', 'starting', 'from', 'the', 'free', 'bose', 'matter', 'green', 'functionals', 'a', 'class', 'of', 'not', 'quasifree', 'thermal', 'functionals', 'together', 'with', 'the', 'corresponding', 'modular', 'structures', 'have', 'been', 'constructed', 'some', 'elementary', 'properties', 'of', 'models', 'constructed', 'are', 'being', 'presented']]
|
[-0.11458473584045553, 0.15902553220102736, -0.13984235973718265, 0.1009458326163305, -0.021051426185294986, -0.09717614262330311, -0.027738924817337345, 0.33358996552932596, -0.25247457785600863, -0.2356232614773843, 0.06130024174624985, -0.2936122195570971, -0.12361246852809994, 0.196456053621929, -0.03312773058294422, 0.07114366595892029, -0.0008332118094484839, 0.057903064729611355, -0.07643149205897418, -0.2494559449195448, 0.36507602170415876, 0.005933086620643735, 0.25469718378520123, 0.014710586371452169, 0.08432825792287649, 0.008848192545378374, -0.03982525839765677, 0.022523589906524175, -0.13333894159135257, 0.12460123397910071, 0.25475668312305466, 0.06283877893777874, 0.2559857492990516, -0.41828839134217966, -0.23472852041811199, 0.1283722137256215, 0.06116083404911613, 0.11064753104518685, -0.05701460111002369, -0.30519029841309897, 0.05243798015915133, -0.18171112570497724, -0.16119078166472414, -0.10133883613161743, 0.009028216720455222, 0.07257874804997334, -0.18908343641346115, 0.05733235159250735, 0.06515752283006872, 0.0074810721742795535, -0.11689122873617129, -0.16800295491271686, -0.054323896606176814, 0.08352306712832716, 0.026376886023812135, -0.0011167469427972618, 0.11431237083808002, -0.12015004839782638, -0.110339287944414, 0.3859754767079182, -0.048553684872954535, -0.20793523936084024, 0.2166301999758515, -0.10194551466675303, -0.13335391480682623, 0.12187489932747902, 0.10961042124674553, 0.13302053953520954, -0.17495892661692644, 0.1921441808377427, -0.059442503188081364, 0.0639770852813618, 0.05566027718251226, 0.08642745513417241, 0.19979939107886618, 0.12441216622418896, 0.05866068679434075, 0.13503118939007874, 0.0002453916108438366, -0.15772003617948266, -0.36635586964311423, -0.14431606880141232, -0.21727492116581373, 0.07414556825245165, -0.012013102487091802, -0.23068171123870546, 0.39193606751548404, 0.04889889249440144, 0.13994951312606982, 0.03775154077447951, 0.21709090644812765, 0.13371613737156926, 0.06771140649086899, 0.027756887440638686, 0.1939791120447033, 0.1894599854239021, 0.02290054770290024, -0.14538112444979898, 0.02642401063780266, 0.12204822788825603]
|
1,803.09543
|
Adaptive Fuzzy Controller for Synchronous Generator
|
This paper describes a PI fuzzy adaptive control structure. Based on
classical PI fuzzy control structure (with integration on controller output)
the authors have developed, implemented and validated an on-line self-tuning
mechanism of regulator parameter. A study case for validation of proposed
tuning mechanism is presented and analyzed with application to control of
synchronous generator excitation system.
|
cs.SY
|
this paper describes a pi fuzzy adaptive control structure based on classical pi fuzzy control structure with integration on controller output the authors have developed implemented and validated an online selftuning mechanism of regulator parameter a study case for validation of proposed tuning mechanism is presented and analyzed with application to control of synchronous generator excitation system
|
[['this', 'paper', 'describes', 'a', 'pi', 'fuzzy', 'adaptive', 'control', 'structure', 'based', 'on', 'classical', 'pi', 'fuzzy', 'control', 'structure', 'with', 'integration', 'on', 'controller', 'output', 'the', 'authors', 'have', 'developed', 'implemented', 'and', 'validated', 'an', 'online', 'selftuning', 'mechanism', 'of', 'regulator', 'parameter', 'a', 'study', 'case', 'for', 'validation', 'of', 'proposed', 'tuning', 'mechanism', 'is', 'presented', 'and', 'analyzed', 'with', 'application', 'to', 'control', 'of', 'synchronous', 'generator', 'excitation', 'system']]
|
[-0.15229370935182823, 0.005836721846942071, -0.09125081452504291, 0.001693281394086386, -0.1125444555328342, -0.18906446681929784, 0.061889393003902546, 0.38022121434148987, -0.25071136133843347, -0.2985816215932892, 0.11987259475261039, -0.1794623173283119, -0.19829840597026704, 0.2092696371929426, -0.08698644763544987, 0.12531248290549246, 0.024645666138416056, 0.01956356423416812, 0.025425506847105886, -0.18767101918102094, 0.2882464553000765, 0.0953777332447077, 0.32174094031940687, -0.055507523473352194, 0.18627159786002154, 0.07718295387907378, -0.051123585176180326, -0.01903952697390004, -0.1509651487586987, 0.12588063993781248, 0.239590856720481, 0.09789320028370671, 0.2846211106761506, -0.3700384440456043, -0.1897509666323139, 0.03461511168432863, 0.1269464931826581, 0.03492077674487965, -0.12154071054650112, -0.28103506306529435, 0.13497757821817669, -0.24018597585688295, -0.10741346911118742, -0.12907645572385376, 0.003985677300462205, -0.003026291936341869, -0.3345034161292572, -0.07196420448293027, 0.024590492530382778, 0.12273928581884033, -0.11273389030247927, -0.07583393559080402, 0.015894516420207526, 0.0819377084589449, -0.01938276967082761, 0.01823212731253813, 0.1899892461420805, -0.03499035628332773, -0.23607529203097025, 0.2848883444083887, -0.007679968161443085, -0.254446296642224, 0.1361564120171559, -0.007211957273906783, -0.10138873012711931, 0.08020369365419212, 0.22294883763319567, 0.10752010417350552, -0.1617232497736583, 0.09734598879922966, 0.01917159997065666, 0.25762868460202426, 0.027481245759286378, -0.016459448981964796, 0.0790266398577379, 0.28417047868041617, 0.03907825010665284, 0.1776305572293176, -0.01130414275777232, -0.19960382219461167, -0.3012728774675021, -0.08919728655172021, -0.11756893064369235, -0.037472698069586044, -0.0073249710048753115, -0.16881085298301882, 0.4205952327240977, 0.14432453183077373, 0.15831399462267495, 0.02276302459077877, 0.35045658280713515, 0.15121524601259775, 0.05237513718505701, 0.049232030883758215, 0.22326960741427906, 0.11125945097260308, 0.10391983211759412, -0.27922795798727557, 0.06844935880712512, 0.09196597285438002]
|
1,803.09544
|
A General Path-Based Representation for Predicting Program Properties
|
Predicting program properties such as names or expression types has a wide
range of applications. It can ease the task of programming and increase
programmer productivity. A major challenge when learning from programs is
$\textit{how to represent programs in a way that facilitates effective
learning}$.
We present a $\textit{general path-based representation}$ for learning from
programs. Our representation is purely syntactic and extracted automatically.
The main idea is to represent a program using paths in its abstract syntax tree
(AST). This allows a learning model to leverage the structured nature of code
rather than treating it as a flat sequence of tokens.
We show that this representation is general and can: (i) cover different
prediction tasks, (ii) drive different learning algorithms (for both generative
and discriminative models), and (iii) work across different programming
languages.
We evaluate our approach on the tasks of predicting variable names, method
names, and full types. We use our representation to drive both CRF-based and
word2vec-based learning, for programs of four languages: JavaScript, Java,
Python and C\#. Our evaluation shows that our approach obtains better results
than task-specific handcrafted representations across different tasks and
programming languages.
|
cs.PL cs.LG
|
predicting program properties such as names or expression types has a wide range of applications it can ease the task of programming and increase programmer productivity a major challenge when learning from programs is textithow to represent programs in a way that facilitates effective learning we present a textitgeneral pathbased representation for learning from programs our representation is purely syntactic and extracted automatically the main idea is to represent a program using paths in its abstract syntax tree ast this allows a learning model to leverage the structured nature of code rather than treating it as a flat sequence of tokens we show that this representation is general and can i cover different prediction tasks ii drive different learning algorithms for both generative and discriminative models and iii work across different programming languages we evaluate our approach on the tasks of predicting variable names method names and full types we use our representation to drive both crfbased and word2vecbased learning for programs of four languages javascript java python and c our evaluation shows that our approach obtains better results than taskspecific handcrafted representations across different tasks and programming languages
|
[['predicting', 'program', 'properties', 'such', 'as', 'names', 'or', 'expression', 'types', 'has', 'a', 'wide', 'range', 'of', 'applications', 'it', 'can', 'ease', 'the', 'task', 'of', 'programming', 'and', 'increase', 'programmer', 'productivity', 'a', 'major', 'challenge', 'when', 'learning', 'from', 'programs', 'is', 'textithow', 'to', 'represent', 'programs', 'in', 'a', 'way', 'that', 'facilitates', 'effective', 'learning', 'we', 'present', 'a', 'textitgeneral', 'pathbased', 'representation', 'for', 'learning', 'from', 'programs', 'our', 'representation', 'is', 'purely', 'syntactic', 'and', 'extracted', 'automatically', 'the', 'main', 'idea', 'is', 'to', 'represent', 'a', 'program', 'using', 'paths', 'in', 'its', 'abstract', 'syntax', 'tree', 'ast', 'this', 'allows', 'a', 'learning', 'model', 'to', 'leverage', 'the', 'structured', 'nature', 'of', 'code', 'rather', 'than', 'treating', 'it', 'as', 'a', 'flat', 'sequence', 'of', 'tokens', 'we', 'show', 'that', 'this', 'representation', 'is', 'general', 'and', 'can', 'i', 'cover', 'different', 'prediction', 'tasks', 'ii', 'drive', 'different', 'learning', 'algorithms', 'for', 'both', 'generative', 'and', 'discriminative', 'models', 'and', 'iii', 'work', 'across', 'different', 'programming', 'languages', 'we', 'evaluate', 'our', 'approach', 'on', 'the', 'tasks', 'of', 'predicting', 'variable', 'names', 'method', 'names', 'and', 'full', 'types', 'we', 'use', 'our', 'representation', 'to', 'drive', 'both', 'crfbased', 'and', 'word2vecbased', 'learning', 'for', 'programs', 'of', 'four', 'languages', 'javascript', 'java', 'python', 'and', 'c', 'our', 'evaluation', 'shows', 'that', 'our', 'approach', 'obtains', 'better', 'results', 'than', 'taskspecific', 'handcrafted', 'representations', 'across', 'different', 'tasks', 'and', 'programming', 'languages']]
|
[-0.03397363061627383, -0.02556409944765388, -0.09935709842106219, 0.10291441127417052, -0.17704747228947265, -0.18750653426759142, 0.05737616415394263, 0.4395668307151744, -0.30732410756634576, -0.36262155317506756, 0.04329582187100733, -0.24331350738520516, -0.1644237571674345, 0.22329736388382063, -0.10040285276919209, 0.041855968895587556, 0.1230564138743652, 0.012703797203444299, -0.07795060252913683, -0.22468682623433847, 0.30375589562581373, -0.02833123057440081, 0.29287169468786234, 0.0160410928000356, 0.1149741056690574, 0.003492125021737246, -0.02818230611996518, -0.0023999773163013356, -0.041375346828543734, 0.19208875741987003, 0.3822471565814609, 0.29276338896206605, 0.32860443948906054, -0.3625911290932289, -0.17992594142360663, 0.04241443427757572, 0.11193532631630891, 0.1455128385904664, 0.013819583611582559, -0.305113391595937, 0.08837671286707359, -0.20191869276351537, 0.043095607133138744, -0.15567849510627746, 0.016280347653837117, -0.019198470012895843, -0.27101414896567505, -0.037634559407326386, 0.10689425001305247, 0.09991951312293254, -0.052756345456049694, -0.14956362582385915, 0.00133684250555696, 0.16736542084208128, 0.032166214508285364, 0.07226930433950786, 0.1494252157666124, -0.14738773335988367, -0.184126148329279, 0.37602384767874525, -0.051453464492821635, -0.19349952583649643, 0.26649402631397445, -0.010612476560430078, -0.18931358479820784, 0.05913586417094819, 0.24087906387639502, 0.1428941412676106, -0.1610417196961525, 0.06176745948454405, -0.033223709525175824, 0.2062709929918003, 0.061069279850002316, -0.022687745688017458, 0.2057426315171782, 0.2448776396442323, -0.010829854921669399, 0.15174765043606164, -0.01625427294389478, -0.06374850417807619, -0.2488746082055427, -0.15082529429888364, -0.1306384707130886, -0.059927477099730696, -0.11562569917322238, -0.175405634936714, 0.4212363786778595, 0.21912557804444557, 0.11124108005413617, 0.17886158637671667, 0.32735716749140353, 0.0462941539630284, 0.15241887841790067, 0.13812336293769822, 0.07789123226474556, 0.0016068003569093962, 0.1479474921296868, -0.1561835441201255, 0.13012635610780862, 0.03558591105753467]
|
1,803.09545
|
Infinitesimal Weak Rigidity, Formation Control of Three Agents, and
Extension to 3-dimensional Space
|
In this paper, we introduce new concepts of weak rigidity matrix and
infinitesimal weak rigidity for planar frameworks. The weak rigidity matrix is
used to directly check if a framework is infinitesimally weakly rigid while
previous work can check a weak rigidity of a framework indirectly. An
infinitesimal weak rigidity framework can be uniquely determined up to a
translation and a rotation (and a scaling also when the framework does not
include any edge) by its inter-neighbor distances and angles. We apply the new
concepts to a three-agent formation control problem with a gradient control
law, and prove instability of the control system at any incorrect equilibrium
point and convergence to a desired target formation. Also, we propose a
modified Henneberg construction, which is a technique to generate minimally
rigid (or weakly rigid) graphs. Finally, we extend the concept of the weak
rigidity in R^2 to the concept in R^3.
|
cs.SY
|
in this paper we introduce new concepts of weak rigidity matrix and infinitesimal weak rigidity for planar frameworks the weak rigidity matrix is used to directly check if a framework is infinitesimally weakly rigid while previous work can check a weak rigidity of a framework indirectly an infinitesimal weak rigidity framework can be uniquely determined up to a translation and a rotation and a scaling also when the framework does not include any edge by its interneighbor distances and angles we apply the new concepts to a threeagent formation control problem with a gradient control law and prove instability of the control system at any incorrect equilibrium point and convergence to a desired target formation also we propose a modified henneberg construction which is a technique to generate minimally rigid or weakly rigid graphs finally we extend the concept of the weak rigidity in r2 to the concept in r3
|
[['in', 'this', 'paper', 'we', 'introduce', 'new', 'concepts', 'of', 'weak', 'rigidity', 'matrix', 'and', 'infinitesimal', 'weak', 'rigidity', 'for', 'planar', 'frameworks', 'the', 'weak', 'rigidity', 'matrix', 'is', 'used', 'to', 'directly', 'check', 'if', 'a', 'framework', 'is', 'infinitesimally', 'weakly', 'rigid', 'while', 'previous', 'work', 'can', 'check', 'a', 'weak', 'rigidity', 'of', 'a', 'framework', 'indirectly', 'an', 'infinitesimal', 'weak', 'rigidity', 'framework', 'can', 'be', 'uniquely', 'determined', 'up', 'to', 'a', 'translation', 'and', 'a', 'rotation', 'and', 'a', 'scaling', 'also', 'when', 'the', 'framework', 'does', 'not', 'include', 'any', 'edge', 'by', 'its', 'interneighbor', 'distances', 'and', 'angles', 'we', 'apply', 'the', 'new', 'concepts', 'to', 'a', 'threeagent', 'formation', 'control', 'problem', 'with', 'a', 'gradient', 'control', 'law', 'and', 'prove', 'instability', 'of', 'the', 'control', 'system', 'at', 'any', 'incorrect', 'equilibrium', 'point', 'and', 'convergence', 'to', 'a', 'desired', 'target', 'formation', 'also', 'we', 'propose', 'a', 'modified', 'henneberg', 'construction', 'which', 'is', 'a', 'technique', 'to', 'generate', 'minimally', 'rigid', 'or', 'weakly', 'rigid', 'graphs', 'finally', 'we', 'extend', 'the', 'concept', 'of', 'the', 'weak', 'rigidity', 'in', 'r2', 'to', 'the', 'concept', 'in', 'r3']]
|
[-0.12677220275004705, 0.12040786569094053, -0.1061846549405406, 0.06083131418408205, -0.1051490443572402, -0.1633187254021565, 0.03693163788023715, 0.3633855162685116, -0.3321213346688698, -0.2522692865350594, 0.0994091659768795, -0.2011118238947044, -0.17872332072040686, 0.13484809726321448, -0.11410154681963225, 0.06720468902921614, 0.04656942958012223, 0.04027630565843234, -0.0878768247521172, -0.1743529882701114, 0.3193769816091905, 0.023611301388591528, 0.2703833902208135, 0.09648188893217594, 0.10362938063840071, 0.029029262545033515, 0.04305517389749487, 0.0980734870924304, -0.1647927212699627, 0.15022894931879516, 0.19511865381073829, 0.08847992963312815, 0.2669397418325146, -0.38372280983875195, -0.1992457453268192, 0.10982770702180764, 0.08760385508959492, 0.14870034339449678, -0.035353717897087335, -0.2811688148075094, 0.1508563967809702, -0.16526920037654538, -0.1901174876295651, -0.09257649608422071, 0.005516154874737064, 0.026109831955594322, -0.28808576485452553, 0.043068740687255434, 0.1470895359913508, 0.02485044565051794, -0.05091080791549757, 0.012337831338712324, 0.005203894358128309, 0.12759578678853964, 0.019184288412022094, 0.05310873375274241, 0.13443782415551445, -0.07531413430930116, -0.09115378510284548, 0.3849476274351279, -0.07214704218359354, -0.24397101937540963, 0.2112322332089146, -0.10722582475903134, -0.16131178586588552, 0.09048595419541622, 0.17650638201894858, 0.15977544190949022, -0.17360652516489306, 0.1020289244945161, -0.042029396935055655, 0.16566045681577332, 0.05288692776113749, -0.04621600347881516, 0.186123551564912, 0.12005519957436869, 0.14639570678894717, 0.1538830463363168, -0.03438598903206488, -0.03566721367028852, -0.32951567699511847, -0.13541937424665473, -0.128769537184077, 0.05824562269350281, -0.07610958014556672, -0.17997089021063098, 0.34882545165717604, 0.11084333742658298, 0.20706721313938034, 0.11819809744833037, 0.27913074895739554, 0.06765573826618493, 0.04936377285203586, 0.06487252930877731, 0.2652830875540773, 0.16385249676958968, 0.055586765028225876, -0.165387911501651, 0.03655896124740442, 0.1320830431083838]
|
1,803.09546
|
Calibrated Prediction Intervals for Neural Network Regressors
|
Ongoing developments in neural network models are continually advancing the
state of the art in terms of system accuracy. However, the predicted labels
should not be regarded as the only core output; also important is a
well-calibrated estimate of the prediction uncertainty. Such estimates and
their calibration are critical in many practical applications. Despite their
obvious aforementioned advantage in relation to accuracy, contemporary neural
networks can, generally, be regarded as poorly calibrated and as such do not
produce reliable output probability estimates. Further, while post-processing
calibration solutions can be found in the relevant literature, these tend to be
for systems performing classification. In this regard, we herein present two
novel methods for acquiring calibrated predictions intervals for neural network
regressors: empirical calibration and temperature scaling. In experiments using
different regression tasks from the audio and computer vision domains, we find
that both our proposed methods are indeed capable of producing calibrated
prediction intervals for neural network regressors with any desired confidence
level, a finding that is consistent across all datasets and neural network
architectures we experimented with. In addition, we derive an additional
practical recommendation for producing more accurate calibrated prediction
intervals. We release the source code implementing our proposed methods for
computing calibrated predicted intervals. The code for computing calibrated
predicted intervals is publicly available.
|
stat.ML cs.LG
|
ongoing developments in neural network models are continually advancing the state of the art in terms of system accuracy however the predicted labels should not be regarded as the only core output also important is a wellcalibrated estimate of the prediction uncertainty such estimates and their calibration are critical in many practical applications despite their obvious aforementioned advantage in relation to accuracy contemporary neural networks can generally be regarded as poorly calibrated and as such do not produce reliable output probability estimates further while postprocessing calibration solutions can be found in the relevant literature these tend to be for systems performing classification in this regard we herein present two novel methods for acquiring calibrated predictions intervals for neural network regressors empirical calibration and temperature scaling in experiments using different regression tasks from the audio and computer vision domains we find that both our proposed methods are indeed capable of producing calibrated prediction intervals for neural network regressors with any desired confidence level a finding that is consistent across all datasets and neural network architectures we experimented with in addition we derive an additional practical recommendation for producing more accurate calibrated prediction intervals we release the source code implementing our proposed methods for computing calibrated predicted intervals the code for computing calibrated predicted intervals is publicly available
|
[['ongoing', 'developments', 'in', 'neural', 'network', 'models', 'are', 'continually', 'advancing', 'the', 'state', 'of', 'the', 'art', 'in', 'terms', 'of', 'system', 'accuracy', 'however', 'the', 'predicted', 'labels', 'should', 'not', 'be', 'regarded', 'as', 'the', 'only', 'core', 'output', 'also', 'important', 'is', 'a', 'wellcalibrated', 'estimate', 'of', 'the', 'prediction', 'uncertainty', 'such', 'estimates', 'and', 'their', 'calibration', 'are', 'critical', 'in', 'many', 'practical', 'applications', 'despite', 'their', 'obvious', 'aforementioned', 'advantage', 'in', 'relation', 'to', 'accuracy', 'contemporary', 'neural', 'networks', 'can', 'generally', 'be', 'regarded', 'as', 'poorly', 'calibrated', 'and', 'as', 'such', 'do', 'not', 'produce', 'reliable', 'output', 'probability', 'estimates', 'further', 'while', 'postprocessing', 'calibration', 'solutions', 'can', 'be', 'found', 'in', 'the', 'relevant', 'literature', 'these', 'tend', 'to', 'be', 'for', 'systems', 'performing', 'classification', 'in', 'this', 'regard', 'we', 'herein', 'present', 'two', 'novel', 'methods', 'for', 'acquiring', 'calibrated', 'predictions', 'intervals', 'for', 'neural', 'network', 'regressors', 'empirical', 'calibration', 'and', 'temperature', 'scaling', 'in', 'experiments', 'using', 'different', 'regression', 'tasks', 'from', 'the', 'audio', 'and', 'computer', 'vision', 'domains', 'we', 'find', 'that', 'both', 'our', 'proposed', 'methods', 'are', 'indeed', 'capable', 'of', 'producing', 'calibrated', 'prediction', 'intervals', 'for', 'neural', 'network', 'regressors', 'with', 'any', 'desired', 'confidence', 'level', 'a', 'finding', 'that', 'is', 'consistent', 'across', 'all', 'datasets', 'and', 'neural', 'network', 'architectures', 'we', 'experimented', 'with', 'in', 'addition', 'we', 'derive', 'an', 'additional', 'practical', 'recommendation', 'for', 'producing', 'more', 'accurate', 'calibrated', 'prediction', 'intervals', 'we', 'release', 'the', 'source', 'code', 'implementing', 'our', 'proposed', 'methods', 'for', 'computing', 'calibrated', 'predicted', 'intervals', 'the', 'code', 'for', 'computing', 'calibrated', 'predicted', 'intervals', 'is', 'publicly', 'available']]
|
[-0.04460319349083067, 0.017501355442382866, -0.04675781140125495, 0.1281582615349045, -0.058647707027072705, -0.1859970260627085, 0.02627619563632093, 0.47060105913422173, -0.2223571866213913, -0.3497568123102947, 0.12813822090996568, -0.2593727067406117, -0.13868167550713728, 0.28500554704536357, -0.10904736313279029, 0.1317283871790601, 0.162796790573608, 0.014388387402976622, -0.07514807197946573, -0.2700156352991514, 0.23993026159479525, 0.06867246425503658, 0.3188585989431616, 0.002691597567819473, 0.09466084726456622, -0.059204782070756426, -0.0719287616590952, 0.023189651115831954, -0.08907160847761757, 0.15481421994088493, 0.33491201728444747, 0.17326122776311995, 0.28471388435422407, -0.40311434858961515, -0.26379785129123506, 0.11342023244058644, 0.18654467829630314, 0.12671739374524837, -0.027327959845394986, -0.2833823564589558, 0.08272985520738142, -0.19127754790867954, -0.03298879930904756, -0.1577107756467605, -0.009447780323508024, 0.028419801627967024, -0.28977471151759987, 0.053794590374578816, 0.02045237230319159, 0.07074851396976521, -0.06513189017358753, -0.15192904471822893, -0.00682427659328958, 0.21111854902658336, 0.015251732130612558, 0.05180365138288902, 0.11755804477056868, -0.1580157032262327, -0.12829540297173447, 0.3546830511531206, -0.06214318966764646, -0.2096274691435543, 0.18092899945461088, -0.05623676448724129, -0.17229482235766394, 0.07146980248809862, 0.19993022041820008, 0.06526596154974497, -0.17544280207194216, -0.028907083942074138, 0.016175199086622644, 0.19288849032859112, 0.014208178565173445, 0.009511131865481191, 0.22319200397814037, 0.22624919725219822, 0.006978500117838848, 0.07178812009213423, -0.11552412340744114, -0.06335752967990832, -0.2723615333368933, -0.09129958570075461, -0.18988842170101297, -0.025100826297501853, -0.09991527890108248, -0.16058690411349139, 0.37012833634098236, 0.2469865176309314, 0.18160673957889364, 0.12712584354920653, 0.3388738888121831, 0.08767717329114762, 0.10541652413990556, 0.1107772482102047, 0.2332291948195133, 0.03880885558276161, 0.0772523612432889, -0.12776808408886642, 0.13645168715932718, 0.010916001082174867]
|
1,803.09547
|
A new probabilistic interpretation of Bramble-Hilbert lemma
|
The aim of this paper is to provide new perspectives on relative finite
element accuracy which is usually based on the asymptotic speed of convergence
comparison when the mesh size $h$ goes to zero. Starting from a geometrical
reading of the error estimate due to Bramble-Hilbert lemma, we derive two
probability distributions that estimate the relative accuracy, considered as a
random variable, between two Lagrange finite elements $P_k$ and $P_m$, ($k <
m$). We establish mathematical properties of these probabilistic distributions
and we get new insights which, among others, show that $P_k$ or $P_m$ is more
likely accurate than the other, depending on the value of the mesh size $h$.
|
math.NA
|
the aim of this paper is to provide new perspectives on relative finite element accuracy which is usually based on the asymptotic speed of convergence comparison when the mesh size h goes to zero starting from a geometrical reading of the error estimate due to bramblehilbert lemma we derive two probability distributions that estimate the relative accuracy considered as a random variable between two lagrange finite elements p_k and p_m k m we establish mathematical properties of these probabilistic distributions and we get new insights which among others show that p_k or p_m is more likely accurate than the other depending on the value of the mesh size h
|
[['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'provide', 'new', 'perspectives', 'on', 'relative', 'finite', 'element', 'accuracy', 'which', 'is', 'usually', 'based', 'on', 'the', 'asymptotic', 'speed', 'of', 'convergence', 'comparison', 'when', 'the', 'mesh', 'size', 'h', 'goes', 'to', 'zero', 'starting', 'from', 'a', 'geometrical', 'reading', 'of', 'the', 'error', 'estimate', 'due', 'to', 'bramblehilbert', 'lemma', 'we', 'derive', 'two', 'probability', 'distributions', 'that', 'estimate', 'the', 'relative', 'accuracy', 'considered', 'as', 'a', 'random', 'variable', 'between', 'two', 'lagrange', 'finite', 'elements', 'p_k', 'and', 'p_m', 'k', 'm', 'we', 'establish', 'mathematical', 'properties', 'of', 'these', 'probabilistic', 'distributions', 'and', 'we', 'get', 'new', 'insights', 'which', 'among', 'others', 'show', 'that', 'p_k', 'or', 'p_m', 'is', 'more', 'likely', 'accurate', 'than', 'the', 'other', 'depending', 'on', 'the', 'value', 'of', 'the', 'mesh', 'size', 'h']]
|
[-0.09395134341668064, 0.10686692555323926, -0.11453053656401574, 0.05637172878070504, -0.08332585793740432, -0.1368790364849868, 0.10274735493948597, 0.33909796214226734, -0.2828406695289315, -0.30677310830204313, 0.08827227272452154, -0.2607078818249764, -0.07506566695813431, 0.17945059827836488, -0.09471844721995636, 0.02440674290052453, 0.06470529282136624, 0.09378871738683986, -0.09507918556930002, -0.2418791733451461, 0.29915693770333646, 0.03263898025514609, 0.2512293545392538, 0.014030057266183676, 0.09831919698386428, -0.03262724461826419, -0.06042190173794643, 0.02160583410856374, -0.1915899431339621, 0.1407160320481576, 0.1976341190192541, 0.10769338384612438, 0.3041736933257465, -0.3755809895442201, -0.15223050378946537, 0.10333458935722299, 0.1415655732949461, 0.05594080970024502, -0.014883660016727735, -0.22664706565764384, 0.13493607040396421, -0.11898954922905824, -0.13208444748039638, -0.056025606742419236, 0.047461904175237775, 0.07566176779534019, -0.3107097817824111, 0.048023339235458797, 0.08733738696166857, 0.08508924209435872, 0.007272664152102869, -0.21501071544347006, -0.0031946185643041353, 0.14711342672224653, 0.05097237534590339, 0.02851157698036949, 0.08060996521076341, -0.07985712109996569, -0.06911613906673882, 0.37150212320063364, -0.052475045027810474, -0.23736542993045728, 0.19548572765859784, -0.15660248607089486, -0.09599947921265292, 0.1204083534534337, 0.18276590753961866, 0.14308774900203997, -0.10708929514451009, 0.05331676402834133, -0.02678118334279968, 0.15805752744573517, 0.09374689877272473, 0.05467856084979182, 0.11646164310327091, 0.12915071802974226, 0.13433496019196348, 0.12052969731136284, -0.10488312151667517, -0.07787915989073045, -0.3295597819218395, -0.17094234218316284, -0.20470379318597667, 0.07728269069942587, -0.16866614542225453, -0.15880911560609526, 0.34995575471345436, 0.18230879490067242, 0.2208439610522548, 0.09175355614476982, 0.2656735681817619, 0.11292464266330379, -0.018812673730314325, 0.08255299076506305, 0.1743469055760182, 0.15565379268122376, 0.030460968447011818, -0.20503884661566774, 0.0878994251214771, 0.13260352984070778]
|
1,803.09548
|
Reaction kinetics in open reactors and serial transfers between closed
reactors
|
Kinetic theory and thermodynamics of reaction networks are extended to the
out-of-equilibrium dynamics of continuous-flow stirred tank reactors (CSTR) and
serial transfers. On the basis of their stoichiometry matrix, the conservation
laws and the cycles of the network are determined for both dynamics. It is
shown that the CSTR and serial transfer dynamics are equivalent in the limit
where the time interval between the transfers tends to zero proportionally to
the ratio of the fractions of fresh to transferred solutions. These results are
illustrated with finite cross-catalytic reaction network and an infinite
reaction network describing mass exchange between polymers. Serial transfer
dynamics is typically used in molecular evolution experiments in the context of
research on the origins of life. The present study is shedding a new light on
the role played by serial transfer parameters in these experiments.
|
cond-mat.stat-mech
|
kinetic theory and thermodynamics of reaction networks are extended to the outofequilibrium dynamics of continuousflow stirred tank reactors cstr and serial transfers on the basis of their stoichiometry matrix the conservation laws and the cycles of the network are determined for both dynamics it is shown that the cstr and serial transfer dynamics are equivalent in the limit where the time interval between the transfers tends to zero proportionally to the ratio of the fractions of fresh to transferred solutions these results are illustrated with finite crosscatalytic reaction network and an infinite reaction network describing mass exchange between polymers serial transfer dynamics is typically used in molecular evolution experiments in the context of research on the origins of life the present study is shedding a new light on the role played by serial transfer parameters in these experiments
|
[['kinetic', 'theory', 'and', 'thermodynamics', 'of', 'reaction', 'networks', 'are', 'extended', 'to', 'the', 'outofequilibrium', 'dynamics', 'of', 'continuousflow', 'stirred', 'tank', 'reactors', 'cstr', 'and', 'serial', 'transfers', 'on', 'the', 'basis', 'of', 'their', 'stoichiometry', 'matrix', 'the', 'conservation', 'laws', 'and', 'the', 'cycles', 'of', 'the', 'network', 'are', 'determined', 'for', 'both', 'dynamics', 'it', 'is', 'shown', 'that', 'the', 'cstr', 'and', 'serial', 'transfer', 'dynamics', 'are', 'equivalent', 'in', 'the', 'limit', 'where', 'the', 'time', 'interval', 'between', 'the', 'transfers', 'tends', 'to', 'zero', 'proportionally', 'to', 'the', 'ratio', 'of', 'the', 'fractions', 'of', 'fresh', 'to', 'transferred', 'solutions', 'these', 'results', 'are', 'illustrated', 'with', 'finite', 'crosscatalytic', 'reaction', 'network', 'and', 'an', 'infinite', 'reaction', 'network', 'describing', 'mass', 'exchange', 'between', 'polymers', 'serial', 'transfer', 'dynamics', 'is', 'typically', 'used', 'in', 'molecular', 'evolution', 'experiments', 'in', 'the', 'context', 'of', 'research', 'on', 'the', 'origins', 'of', 'life', 'the', 'present', 'study', 'is', 'shedding', 'a', 'new', 'light', 'on', 'the', 'role', 'played', 'by', 'serial', 'transfer', 'parameters', 'in', 'these', 'experiments']]
|
[-0.1312666009596624, 0.16687531459383603, -0.06109698030338827, 0.04885492383342671, 0.013879621867090464, -0.09780115541410599, 0.013209756688949019, 0.3472335237574621, -0.29871766361659463, -0.28060590863622126, 0.08468801434233404, -0.2854887709075952, -0.1147563405994353, 0.19103348980501403, 0.011039600578429055, 0.05383404004039161, 0.07248867924128027, 0.018422153333106834, -0.025476613706980497, -0.20526354435498206, 0.2990311325636495, 0.10114603807782604, 0.30244293611116, 0.07686071393222813, 0.12008020916722552, -0.03668990408335507, -0.033819104040068756, -0.013132116409786806, -0.13015965250836742, 0.1150218919548376, 0.23461405972331545, 0.10221644382529559, 0.23214456853014928, -0.4865830762678907, -0.2150372663227311, 0.08749883179722802, 0.11474182953068945, 0.07502320074360735, -0.040503353810950736, -0.21265542092495157, 0.042719731213572525, -0.1659419139112978, -0.06812198312925923, -0.06458255821281542, 0.03737554014541453, 0.0805530926046118, -0.24084341104896942, 0.062529965099899, 0.028463229863950303, 0.05552492992180046, -0.05880311941795976, -0.10311496776467474, -0.058531920432391825, 0.17656675285326628, 0.05932495194636192, -0.03572632902132748, 0.18238086655844737, -0.1238050824779011, -0.08963395133410601, 0.3916476377265623, -0.04249540347789489, -0.20696926116667191, 0.19743046542140144, -0.13659614195748077, -0.08562289457768202, 0.11548651231921883, 0.19326232902596902, 0.10790189245484606, -0.1594703008019685, 0.04784354748481368, -0.01067308904807063, 0.1472709699479496, 0.05379312337600511, -0.025760603040443177, 0.18874949133907357, 0.226833255512871, 0.01276299397522298, 0.1238752789744414, -0.060771630310460276, -0.22621053546313605, -0.25945610366336813, -0.13892050939833026, -0.16095182210815404, 0.08058795081383556, -0.058874411395743294, -0.12003716035558244, 0.3600304536521435, 0.09695224457481591, 0.182470670404137, 0.043881872600882596, 0.2655718553383039, 0.10245227848390376, 0.0635973646868034, 0.051518168599501146, 0.22839625387785645, 0.19448147351296116, 0.14802510618320563, -0.28448436701887825, 0.08881660803717419, 0.042435490561948314]
|
1,803.09549
|
Comparative Study Regarding Control of Wind Energy Conversion Systems
Based on the Usage of Classical and Adaptive Neuro Fuzzy Controllers
|
The paper presents a comparative study regarding the control (using an
adaptive neuro-fuzzy controller and a PD controller) based on the simulation of
wind energy conversion systems functioning. There are considered several
simulations based on asynchronous generator usage, by using the dedicated
MATLAB-PSB (Power System Blockset) toolbox implementations.
|
cs.SY
|
the paper presents a comparative study regarding the control using an adaptive neurofuzzy controller and a pd controller based on the simulation of wind energy conversion systems functioning there are considered several simulations based on asynchronous generator usage by using the dedicated matlabpsb power system blockset toolbox implementations
|
[['the', 'paper', 'presents', 'a', 'comparative', 'study', 'regarding', 'the', 'control', 'using', 'an', 'adaptive', 'neurofuzzy', 'controller', 'and', 'a', 'pd', 'controller', 'based', 'on', 'the', 'simulation', 'of', 'wind', 'energy', 'conversion', 'systems', 'functioning', 'there', 'are', 'considered', 'several', 'simulations', 'based', 'on', 'asynchronous', 'generator', 'usage', 'by', 'using', 'the', 'dedicated', 'matlabpsb', 'power', 'system', 'blockset', 'toolbox', 'implementations']]
|
[-0.16362729911570964, -0.055096254169968786, -0.06673198314788549, -0.030257416667629277, -0.02966077049748729, -0.16937420715618393, 0.032012811763232334, 0.39377528914938803, -0.22605989784326241, -0.30996630838869704, 0.15639009473480933, -0.23061640383473234, -0.16672169311862925, 0.30814084021941474, -0.07483173473535673, 0.13000178390749448, 0.11115903186652323, -0.019393664802444855, -0.0067385978713307695, -0.15054170484654605, 0.29376356100218126, 0.15864027431234717, 0.32393147486626456, -0.05302935026322856, 0.16201694149766926, 0.024024226530657514, -0.03355493742729659, -0.014722718411813612, -0.10192551688574579, 0.11704163703784022, 0.20617464560326998, 0.16957948859983488, 0.34893197096560313, -0.4690220961752145, -0.186279962507441, 0.029819921053865033, 0.12043787290990028, 0.033479320189065256, -0.1699050769827369, -0.2476566403132418, 0.08373372498697237, -0.25940288720733445, -0.02705495556533013, -0.0978605209586575, -0.0749235090840122, 0.09120281230476078, -0.2881101303652901, -0.04231598197846957, 0.010551956120331812, 0.17337591508808342, -0.07390985216783441, -0.09443878875184886, 0.006898852166436289, 0.10376653166072768, -0.05370955612591427, -0.03156484823937163, 0.190722838530074, -0.029309298175022654, -0.19784258524684803, 0.3422800198845241, 0.017712883575333526, -0.2479849725470716, 0.18562127326858108, 0.001931475222353702, -0.11486161425304801, 0.07776820675834366, 0.2519480224860751, 0.08675312754475391, -0.21879439823248464, 0.053031399075458154, 0.03296609840396306, 0.2568147834390402, -0.04100931981456992, -0.017236035681613113, 0.16524357275794382, 0.3252500164039109, 0.02489654744124931, 0.156012309178629, -0.058234677887926606, -0.16363026890093865, -0.2791519179413824, -0.1088906166791592, -0.1474822119647718, -0.014999486607215975, -0.02314121916899002, -0.11116336962289136, 0.43010056763887405, 0.2082455583807567, 0.08169579696234154, 0.06344124743127791, 0.41376447677612305, 0.11552690059634978, 0.03298593916849274, 0.13613752067170065, 0.1969462363049388, 0.11137064391258046, 0.1794155827804428, -0.2922226615482941, 0.09256471885347982, 0.04312816021316077]
|
1,803.0955
|
Hyperuniformity in amorphous speckle patterns
|
Hyperuniform structures possess the ability to confine and drive light,
although their fabrication is extremely challenging. Here we demonstrate that
speckle patters obtained by a superposition of randomly arranged sources of
Bessel beams can be used to generate hyperunifrom scalar fields. By exploiting
laser light tailored with a spatial filter, we experimentally produce (without
requiring any computational power) a speckle pattern possessing maxima at
locations corresponding to a hyperuniform distribution. By properly filtering
out intensity fluctuation from the same speckle pattern, it is possible to
retrieve an intensity profile satisfying the hyperuniformity requirements. Our
findings are supported by extensive numerical simulations.
|
physics.optics
|
hyperuniform structures possess the ability to confine and drive light although their fabrication is extremely challenging here we demonstrate that speckle patters obtained by a superposition of randomly arranged sources of bessel beams can be used to generate hyperunifrom scalar fields by exploiting laser light tailored with a spatial filter we experimentally produce without requiring any computational power a speckle pattern possessing maxima at locations corresponding to a hyperuniform distribution by properly filtering out intensity fluctuation from the same speckle pattern it is possible to retrieve an intensity profile satisfying the hyperuniformity requirements our findings are supported by extensive numerical simulations
|
[['hyperuniform', 'structures', 'possess', 'the', 'ability', 'to', 'confine', 'and', 'drive', 'light', 'although', 'their', 'fabrication', 'is', 'extremely', 'challenging', 'here', 'we', 'demonstrate', 'that', 'speckle', 'patters', 'obtained', 'by', 'a', 'superposition', 'of', 'randomly', 'arranged', 'sources', 'of', 'bessel', 'beams', 'can', 'be', 'used', 'to', 'generate', 'hyperunifrom', 'scalar', 'fields', 'by', 'exploiting', 'laser', 'light', 'tailored', 'with', 'a', 'spatial', 'filter', 'we', 'experimentally', 'produce', 'without', 'requiring', 'any', 'computational', 'power', 'a', 'speckle', 'pattern', 'possessing', 'maxima', 'at', 'locations', 'corresponding', 'to', 'a', 'hyperuniform', 'distribution', 'by', 'properly', 'filtering', 'out', 'intensity', 'fluctuation', 'from', 'the', 'same', 'speckle', 'pattern', 'it', 'is', 'possible', 'to', 'retrieve', 'an', 'intensity', 'profile', 'satisfying', 'the', 'hyperuniformity', 'requirements', 'our', 'findings', 'are', 'supported', 'by', 'extensive', 'numerical', 'simulations']]
|
[-0.09011935451999306, 0.17789446043185309, -0.14150453955400735, 0.04693377721356228, -0.06968506227713078, -0.16276823986787348, 0.019562995815649627, 0.49993851030245423, -0.26390405304729936, -0.3250025856681168, 0.0590069084521383, -0.26599585828371347, -0.15633809197694062, 0.18324025623500348, -0.029241603212431074, 0.09716047661670019, 0.0288626741617918, -0.06842268971144222, -0.01189787756986334, -0.21578620442422106, 0.266803504829295, 0.09734697729349136, 0.3207659318344668, -0.044360742890276014, 0.09441110152285546, 0.0012239958718419076, -0.045806141203502196, 0.022260509561747313, -0.05819521440695098, 0.08899417710490524, 0.23446922410279514, 0.07067281754571013, 0.2186417177505791, -0.4442789177969098, -0.26059892258839684, 0.10649764914996922, 0.15718899205792694, 0.11497339375782759, -0.11363168642274105, -0.32582991698756814, 0.09134608784224837, -0.04569989708950743, -0.1959215287398547, -0.12854205139912664, -0.03217474604491145, 0.10969860979821533, -0.3036214938480407, 0.02420852248556912, 0.028006549564306624, 0.05481555653735995, 0.008322673193179071, -0.035546087792608885, -0.030163032815326004, 0.07150354999816046, -0.016942292978055776, -0.0033049333578674123, 0.15581446810392663, -0.12575441859371495, -0.09789107442717068, 0.3945373944658786, -0.0423118189536035, -0.22961864572949708, 0.15009780356893315, -0.15461936878040433, -0.03502378799021244, 0.2231673716637306, 0.16181274074595423, 0.07119842399843038, -0.12600085764745017, -0.02470361866580788, -0.022613446819595994, 0.24667236310429871, 0.16342598556657323, 0.07911588702350855, 0.28791987415403125, 0.13240721582667903, 0.040377526782103816, 0.1855153716530185, -0.13872611706145108, -0.05676660006807652, -0.24103507857769726, -0.0447949960688129, -0.22719422177411616, 0.03646213901694864, -0.05956612273104838, -0.13842619991337415, 0.3843287044111639, 0.18910560118500144, 0.17166702505666762, 0.02874437125399709, 0.28771224729716777, 0.110030242173234, 0.10308558949036524, 0.045937138183508065, 0.19899254595860838, 0.12431259739678353, 0.11818783467169851, -0.19329647296341135, 0.03349101271713153, -0.05905597904114984]
|
1,803.09551
|
Collaborative Filtering with Topic and Social Latent Factors
Incorporating Implicit Feedback
|
Recommender systems (RSs) provide an effective way of alleviating the
information overload problem by selecting personalized items for different
users. Latent factors based collaborative filtering (CF) has become the popular
approaches for RSs due to its accuracy and scalability. Recently, online social
networks and user-generated content provide diverse sources for recommendation
beyond ratings. Although {\em social matrix factorization} (Social MF) and {\em
topic matrix factorization} (Topic MF) successfully exploit social relations
and item reviews, respectively, both of them ignore some useful information. In
this paper, we investigate the effective data fusion by combining the
aforementioned approaches. First, we propose a novel model {\em \mbox{MR3}} to
jointly model three sources of information (i.e., ratings, item reviews, and
social relations) effectively for rating prediction by aligning the latent
factors and hidden topics. Second, we incorporate the implicit feedback from
ratings into the proposed model to enhance its capability and to demonstrate
its flexibility. We achieve more accurate rating prediction on real-life
datasets over various state-of-the-art methods. Furthermore, we measure the
contribution from each of the three data sources and the impact of implicit
feedback from ratings, followed by the sensitivity analysis of hyperparameters.
Empirical studies demonstrate the effectiveness and efficacy of our proposed
model and its extension.
|
cs.IR cs.AI cs.CL cs.LG
|
recommender systems rss provide an effective way of alleviating the information overload problem by selecting personalized items for different users latent factors based collaborative filtering cf has become the popular approaches for rss due to its accuracy and scalability recently online social networks and usergenerated content provide diverse sources for recommendation beyond ratings although em social matrix factorization social mf and em topic matrix factorization topic mf successfully exploit social relations and item reviews respectively both of them ignore some useful information in this paper we investigate the effective data fusion by combining the aforementioned approaches first we propose a novel model em mboxmr3 to jointly model three sources of information ie ratings item reviews and social relations effectively for rating prediction by aligning the latent factors and hidden topics second we incorporate the implicit feedback from ratings into the proposed model to enhance its capability and to demonstrate its flexibility we achieve more accurate rating prediction on reallife datasets over various stateoftheart methods furthermore we measure the contribution from each of the three data sources and the impact of implicit feedback from ratings followed by the sensitivity analysis of hyperparameters empirical studies demonstrate the effectiveness and efficacy of our proposed model and its extension
|
[['recommender', 'systems', 'rss', 'provide', 'an', 'effective', 'way', 'of', 'alleviating', 'the', 'information', 'overload', 'problem', 'by', 'selecting', 'personalized', 'items', 'for', 'different', 'users', 'latent', 'factors', 'based', 'collaborative', 'filtering', 'cf', 'has', 'become', 'the', 'popular', 'approaches', 'for', 'rss', 'due', 'to', 'its', 'accuracy', 'and', 'scalability', 'recently', 'online', 'social', 'networks', 'and', 'usergenerated', 'content', 'provide', 'diverse', 'sources', 'for', 'recommendation', 'beyond', 'ratings', 'although', 'em', 'social', 'matrix', 'factorization', 'social', 'mf', 'and', 'em', 'topic', 'matrix', 'factorization', 'topic', 'mf', 'successfully', 'exploit', 'social', 'relations', 'and', 'item', 'reviews', 'respectively', 'both', 'of', 'them', 'ignore', 'some', 'useful', 'information', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'effective', 'data', 'fusion', 'by', 'combining', 'the', 'aforementioned', 'approaches', 'first', 'we', 'propose', 'a', 'novel', 'model', 'em', 'mboxmr3', 'to', 'jointly', 'model', 'three', 'sources', 'of', 'information', 'ie', 'ratings', 'item', 'reviews', 'and', 'social', 'relations', 'effectively', 'for', 'rating', 'prediction', 'by', 'aligning', 'the', 'latent', 'factors', 'and', 'hidden', 'topics', 'second', 'we', 'incorporate', 'the', 'implicit', 'feedback', 'from', 'ratings', 'into', 'the', 'proposed', 'model', 'to', 'enhance', 'its', 'capability', 'and', 'to', 'demonstrate', 'its', 'flexibility', 'we', 'achieve', 'more', 'accurate', 'rating', 'prediction', 'on', 'reallife', 'datasets', 'over', 'various', 'stateoftheart', 'methods', 'furthermore', 'we', 'measure', 'the', 'contribution', 'from', 'each', 'of', 'the', 'three', 'data', 'sources', 'and', 'the', 'impact', 'of', 'implicit', 'feedback', 'from', 'ratings', 'followed', 'by', 'the', 'sensitivity', 'analysis', 'of', 'hyperparameters', 'empirical', 'studies', 'demonstrate', 'the', 'effectiveness', 'and', 'efficacy', 'of', 'our', 'proposed', 'model', 'and', 'its', 'extension']]
|
[-0.025887006192408756, -0.02995426623045419, -0.04186831689302755, 0.10315360184376557, -0.16888270617060946, -0.15615248732387507, 0.10220776434917021, 0.4421894647838438, -0.2637370730585912, -0.33843721213348793, 0.06629065106989954, -0.34523520811789615, -0.20890671828779958, 0.12161652853726135, -0.06435146062536731, 0.051596205574848376, 0.08423211762918999, 0.061984834106303476, -0.04911516684817387, -0.3036054351239228, 0.3459673388073604, 0.08689819038936905, 0.3679398723521872, 0.05378177246380159, 0.13902028640914782, 0.03008100161255867, -0.1578352419721127, 0.013154491335929682, -0.07904172159603559, 0.18920557000206364, 0.3454622127818784, 0.2456307813420198, 0.37253498811247376, -0.3951747066240904, -0.23569434913167475, 0.05681685412156524, 0.13361856525686258, 0.06912293073365422, -0.06394274929042178, -0.3493946414148691, 0.08381484347160485, -0.24710455474754175, 0.02708694352494443, -0.14235525383264758, -0.03048091298471406, 0.01600918684842184, -0.3067236592258126, 0.04863250448097995, 0.0402416125834148, 0.04521112505565671, -0.03879305328397701, -0.1653659073835668, 0.05961601627481572, 0.20546928118211308, 0.101715013962045, -0.04816915282429488, 0.1570757489866011, -0.19225467469625393, -0.17689120980532036, 0.392165898028122, -0.04523458103672145, -0.186780694563626, 0.17218574895820232, -0.00811193616919256, -0.14012814108875818, 0.08284501224418409, 0.2621949896371613, 0.059534380219274145, -0.1967500516592397, -0.005687071356863039, -0.03946611410755591, 0.19234998768889436, -0.004886660085735368, 0.018033768155374656, 0.1572194801798711, 0.21013445037476464, 0.04037946783115759, 0.07234905446952611, -0.06129366393197058, -0.06428440064694002, -0.1378346175758862, -0.10049522446984067, -0.16526478895342306, -0.022842195571523487, -0.17043108201295243, -0.10076310469993782, 0.41532586423187134, 0.26006612480234576, 0.1867620028833877, 0.054187605653971654, 0.36117776257314665, 0.040594677753830966, 0.05959257776289722, 0.08983899883505907, 0.15145911117653277, 0.05379411861227423, 0.14019651957913118, -0.17522507219808747, 0.13029197832642525, 0.041544870719971025]
|
1,803.09552
|
A new mixed functional-probabilistic approach for finite element
accuracy
|
The aim of this paper is to provide a new perspective on finite element
accuracy. Starting from a geometrical reading of the Bramble-Hilbert lemma, we
recall the two probabilistic laws we got in previous works that estimate the
relative accuracy, considered as a random variable, between two finite elements
$P_k$ and $P_m$, ($k < m$). Then, we analyze the asymptotic relation between
these two probabilistic laws when the difference $m-k$ goes to infinity. New
insights which qualified the relative accuracy in the case of high order finite
elements are correspondingly obtained.
|
math.NA
|
the aim of this paper is to provide a new perspective on finite element accuracy starting from a geometrical reading of the bramblehilbert lemma we recall the two probabilistic laws we got in previous works that estimate the relative accuracy considered as a random variable between two finite elements p_k and p_m k m then we analyze the asymptotic relation between these two probabilistic laws when the difference mk goes to infinity new insights which qualified the relative accuracy in the case of high order finite elements are correspondingly obtained
|
[['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'provide', 'a', 'new', 'perspective', 'on', 'finite', 'element', 'accuracy', 'starting', 'from', 'a', 'geometrical', 'reading', 'of', 'the', 'bramblehilbert', 'lemma', 'we', 'recall', 'the', 'two', 'probabilistic', 'laws', 'we', 'got', 'in', 'previous', 'works', 'that', 'estimate', 'the', 'relative', 'accuracy', 'considered', 'as', 'a', 'random', 'variable', 'between', 'two', 'finite', 'elements', 'p_k', 'and', 'p_m', 'k', 'm', 'then', 'we', 'analyze', 'the', 'asymptotic', 'relation', 'between', 'these', 'two', 'probabilistic', 'laws', 'when', 'the', 'difference', 'mk', 'goes', 'to', 'infinity', 'new', 'insights', 'which', 'qualified', 'the', 'relative', 'accuracy', 'in', 'the', 'case', 'of', 'high', 'order', 'finite', 'elements', 'are', 'correspondingly', 'obtained']]
|
[-0.10712020704264028, 0.12522020678346354, -0.11473690237229069, 0.062493221347944605, -0.07034335872158408, -0.12531869782445332, 0.11897637445815942, 0.3367526344075385, -0.2751532415962882, -0.29695293627058467, 0.06042270055558119, -0.28606923196413037, -0.09388754008557751, 0.17237460422588305, -0.109343072389149, 0.043208722340770896, 0.035447522775373524, 0.0877742385676053, -0.1132110209747528, -0.2599155117861099, 0.2929797350209103, -0.00030531098859177695, 0.2626724138442013, 0.014105896713833015, 0.13567504195509375, -0.04772106630520688, -0.05260044366328253, 0.05746149812928504, -0.16432398004342555, 0.14131541688693688, 0.25688679288658833, 0.10473660460362831, 0.2945917667614089, -0.3700258343299437, -0.15493747568171884, 0.08897643517702818, 0.11846231870198001, 0.07926834599606486, -0.012122764082677248, -0.22366327971168276, 0.14203299801770805, -0.16815907245294914, -0.13292848617873257, -0.04298516743712955, 0.01754152603033516, 0.0441045422727863, -0.2584408384023441, 0.022333417988071837, 0.1248048467931868, 0.09962771237931317, -0.009348612767644227, -0.16465260898694395, 0.03432741961441934, 0.1866284915184628, 0.039044297059687476, 0.007442912330023117, 0.04397449189176162, -0.06370053211899682, -0.09153327017556875, 0.35995041703184444, -0.08561796370195225, -0.20602317162685924, 0.19152694041323332, -0.15995633114750188, -0.12396956742223766, 0.09228068854038914, 0.16595579784156547, 0.11878744435703589, -0.12144198130845325, 0.07522295545721944, -0.031525855775301655, 0.13986000996600423, 0.10501108716448976, 0.03390562266835736, 0.1302029852134486, 0.11857113716865166, 0.06091139094076223, 0.13337124803413947, -0.06802335274793829, -0.0763883196024431, -0.35414365163693823, -0.1765553355630901, -0.17068986422382296, 0.06739684432331058, -0.15092869403548928, -0.11251037053556906, 0.35488751774860755, 0.15756356349835793, 0.22338721697322197, 0.09187451445937364, 0.2743719519012504, 0.12466123337831556, -0.04808335570204589, 0.04182855928213232, 0.19571885675217748, 0.17101931998299227, 0.08871225347845918, -0.20197340494746135, 0.027673749407080728, 0.12946274677589018]
|
1,803.09553
|
Local verification of global proofs
|
In this work we study the cost of local and global proofs on distributed
verification. In this setting the nodes of a distributed system are provided
with a nondeterministic proof for the correctness of the state of the system,
and the nodes need to verify this proof by looking at only their local
neighborhood in the system.
Previous works have studied the model where each node is given its own,
possibly unique, part of the proof as input. The cost of a proof is the maximum
size of an individual label. We compare this model to a model where each node
has access to the same global proof, and the cost is the size of this global
proof.
It is easy to see that a global proof can always include all of the local
proofs, and every local proof can be a copy of the global proof. We show that
there exists properties that exhibit these relative proof sizes, and also
properties that are somewhere in between. In addition, we introduce a new lower
bound technique and use it to prove a tight lower bound on the complexity of
reversing distributed decision and establish a link between communication
complexity and distributed proof complexity.
|
cs.DC cs.LO
|
in this work we study the cost of local and global proofs on distributed verification in this setting the nodes of a distributed system are provided with a nondeterministic proof for the correctness of the state of the system and the nodes need to verify this proof by looking at only their local neighborhood in the system previous works have studied the model where each node is given its own possibly unique part of the proof as input the cost of a proof is the maximum size of an individual label we compare this model to a model where each node has access to the same global proof and the cost is the size of this global proof it is easy to see that a global proof can always include all of the local proofs and every local proof can be a copy of the global proof we show that there exists properties that exhibit these relative proof sizes and also properties that are somewhere in between in addition we introduce a new lower bound technique and use it to prove a tight lower bound on the complexity of reversing distributed decision and establish a link between communication complexity and distributed proof complexity
|
[['in', 'this', 'work', 'we', 'study', 'the', 'cost', 'of', 'local', 'and', 'global', 'proofs', 'on', 'distributed', 'verification', 'in', 'this', 'setting', 'the', 'nodes', 'of', 'a', 'distributed', 'system', 'are', 'provided', 'with', 'a', 'nondeterministic', 'proof', 'for', 'the', 'correctness', 'of', 'the', 'state', 'of', 'the', 'system', 'and', 'the', 'nodes', 'need', 'to', 'verify', 'this', 'proof', 'by', 'looking', 'at', 'only', 'their', 'local', 'neighborhood', 'in', 'the', 'system', 'previous', 'works', 'have', 'studied', 'the', 'model', 'where', 'each', 'node', 'is', 'given', 'its', 'own', 'possibly', 'unique', 'part', 'of', 'the', 'proof', 'as', 'input', 'the', 'cost', 'of', 'a', 'proof', 'is', 'the', 'maximum', 'size', 'of', 'an', 'individual', 'label', 'we', 'compare', 'this', 'model', 'to', 'a', 'model', 'where', 'each', 'node', 'has', 'access', 'to', 'the', 'same', 'global', 'proof', 'and', 'the', 'cost', 'is', 'the', 'size', 'of', 'this', 'global', 'proof', 'it', 'is', 'easy', 'to', 'see', 'that', 'a', 'global', 'proof', 'can', 'always', 'include', 'all', 'of', 'the', 'local', 'proofs', 'and', 'every', 'local', 'proof', 'can', 'be', 'a', 'copy', 'of', 'the', 'global', 'proof', 'we', 'show', 'that', 'there', 'exists', 'properties', 'that', 'exhibit', 'these', 'relative', 'proof', 'sizes', 'and', 'also', 'properties', 'that', 'are', 'somewhere', 'in', 'between', 'in', 'addition', 'we', 'introduce', 'a', 'new', 'lower', 'bound', 'technique', 'and', 'use', 'it', 'to', 'prove', 'a', 'tight', 'lower', 'bound', 'on', 'the', 'complexity', 'of', 'reversing', 'distributed', 'decision', 'and', 'establish', 'a', 'link', 'between', 'communication', 'complexity', 'and', 'distributed', 'proof', 'complexity']]
|
[-0.14255520378828984, 0.037208901295679844, -0.11521288063698287, 0.033632992770811866, -0.06122913982563198, -0.14424790998489545, 0.10979494083158929, 0.3352078203790881, -0.28543218900334877, -0.3099889682394824, 0.11925292363203374, -0.2347590849904591, -0.13517348667414025, 0.16932832877601273, -0.0969026285806313, 0.003757108635730179, 0.051032354243173095, 0.076061897604896, -0.03545652311312475, -0.269744191147855, 0.2929222877154567, 0.026328885202924607, 0.25661253561082253, 0.0784448083361675, 0.09606767264011275, 0.018374182037284296, -0.027843549193841924, 0.013657643390920363, -0.12283845999225942, 0.1375736512147404, 0.21823943843216329, 0.16966440279628586, 0.30549421760579343, -0.40234399053971787, -0.14060464142615278, 0.13883208292662602, 0.12537728355373967, 0.1334380462313796, -0.039423401271947316, -0.24887950984179616, 0.1485964755373984, -0.13942831603745962, -0.1191358872324577, -0.047705374015529586, 0.014655629145394405, 0.04236652750264982, -0.24650943807780448, 0.006834317605312812, 0.13587632834163105, 0.05888279448515676, -0.04584098616305261, -0.06920017005492626, -0.02975157470777264, 0.13944254911692786, 0.025590219106548122, 0.030081011287253257, 0.08256223828048936, -0.09812056539199439, -0.12017899227736913, 0.33093163432562583, -0.00907712368514811, -0.19466871097959174, 0.22331501317056804, -0.09374622468666857, -0.16614275153157454, 0.0694939651024147, 0.1745177400963647, 0.10684175195695438, -0.13227781688730264, 0.1032896053408424, -0.10741458539369292, 0.20914298482468635, 0.05550105634874898, 0.07763213349111708, 0.13000929574917983, 0.16548910513841386, 0.16273310280799536, 0.15922105244849463, -0.0057570733272773325, -0.08650880380134497, -0.33032628161640004, -0.2060426204457301, -0.22790375315031414, 0.021056401963102555, -0.10207344987257636, -0.16086924445397896, 0.4010432837026313, 0.14531473410912224, 0.21842528711729156, 0.1343938291039584, 0.3246731562924163, 0.1212408360835908, 0.05732014843290259, 0.12849113339182044, 0.2135034301616435, 0.09524061251087619, 0.07672781296065215, -0.1629261170110202, 0.11880547394792508, 0.10815744872062738]
|
1,803.09554
|
Determinants, Choices and Combinatorics
|
We prove a formula which generalizes both Onn's colorful determinantal
formula, related to Rota's basis conjecture, and Svrtan's $n!$ formula, related
to the Atiyah-Sutcliffe problem. In some cases, our formula allows us to prove
some results similar in spirit to the statement of Rota's basis conjecture. We
prove such a result using Svrtan's $n!$ formula, generalizing one of Svrtan's
arguments to a combinatorial setting.
|
math.CO
|
we prove a formula which generalizes both onns colorful determinantal formula related to rotas basis conjecture and svrtans n formula related to the atiyahsutcliffe problem in some cases our formula allows us to prove some results similar in spirit to the statement of rotas basis conjecture we prove such a result using svrtans n formula generalizing one of svrtans arguments to a combinatorial setting
|
[['we', 'prove', 'a', 'formula', 'which', 'generalizes', 'both', 'onns', 'colorful', 'determinantal', 'formula', 'related', 'to', 'rotas', 'basis', 'conjecture', 'and', 'svrtans', 'n', 'formula', 'related', 'to', 'the', 'atiyahsutcliffe', 'problem', 'in', 'some', 'cases', 'our', 'formula', 'allows', 'us', 'to', 'prove', 'some', 'results', 'similar', 'in', 'spirit', 'to', 'the', 'statement', 'of', 'rotas', 'basis', 'conjecture', 'we', 'prove', 'such', 'a', 'result', 'using', 'svrtans', 'n', 'formula', 'generalizing', 'one', 'of', 'svrtans', 'arguments', 'to', 'a', 'combinatorial', 'setting']]
|
[-0.10401172730480394, -0.022062841056299114, -0.1628996469967422, 0.13949477648924266, -0.12458212404615349, -0.19654547051334428, 0.06823009548206178, 0.22768294970904077, -0.2474969548897611, -0.25922960773228654, 0.05567912710460997, -0.2280879767488278, -0.2140194973021391, 0.2659887158208423, -0.16642619288777785, 0.05142780458406797, 0.0313610545237593, 0.011692655568439809, -0.06744255480854976, -0.28977350139665226, 0.28342723432514405, -0.055770404902952056, 0.22937818415581235, 0.16385859965036312, 0.0627590355034622, 0.07176517232483814, -0.03904907256808309, -0.024249396173983105, -0.20471153274134157, 0.16692513805289294, 0.28772960122423397, 0.14304107286050796, 0.23462084609837758, -0.3786538862992847, -0.099959709541133, 0.1654665994842256, 0.12172580035846858, 0.13896482144223732, 0.02413918804155574, -0.2182740383589315, 0.09971236200293615, -0.174145921369985, -0.26970449270355323, -0.07627993357175636, 0.014072434784519293, -0.030245384290104822, -0.29833710844081546, 0.02621779635932947, 0.2001442101429261, 0.022707493997932898, -0.08461979473941028, -0.14523737390510857, 0.0602624740281571, 0.04050403474904005, 0.06518879042021812, 0.06226839650688427, 0.006486326493027192, -0.04498311646637462, -0.1562932396662377, 0.3222799912568123, -0.030427548280429272, -0.2238658939798673, 0.09619136037866748, -0.1476849086789621, -0.2431380290774599, 0.04534281538392875, 0.03027226050875874, 0.21281655001202746, -0.04154177735899649, 0.12095306240048052, -0.21369597667621243, 0.0279595353197129, 0.18805509243929197, 0.013765918330237683, 0.04797164028480885, 0.008492449719813607, 0.07474730451894362, 0.2299439184375048, 0.0516719159537128, -0.09680702152942854, -0.29585259537848213, -0.21572239968984847, -0.18947320330947165, 0.13977511249305236, -0.13095460769268574, -0.16331429498284936, 0.28594796335886397, 0.15575316126850094, 0.2009564885307872, 0.18771661769428719, 0.18662751093506813, 0.1351757034278726, 0.02339538511758234, 0.03707854749841823, 0.05452799268661895, 0.2599628988121237, 0.03933653605007936, -0.08907526565183486, 0.04093512539042249, 0.28822858525174005]
|
1,803.09555
|
Radiation-reaction electromagnetic fields in metasurfaces, a complete
description of their optical properties
|
This paper derives the macroscopic electric and magnetic fields and the
surface susceptibilities for a metasurface, starting from the microscopic
scatterer distribution. It is assumed that these scatterers behave as electric
and magnetic dipoles under the influence of the incident radiation.
Interestingly not only the retarded electromagnetic fields from oscillating
dipoles are relevant to pass from the microscopic to the macroscopic
representation, but the advanced fields must be considered too. It is found
that the macroscopic fields are the sum of the incident fields plus the
radiation-reaction fields acting on a single scatterer. Both the local fields
and the radiation-reaction fields are necessary to fix the electric and
magnetic surface susceptibilities.
|
physics.optics cond-mat.mes-hall cond-mat.mtrl-sci
|
this paper derives the macroscopic electric and magnetic fields and the surface susceptibilities for a metasurface starting from the microscopic scatterer distribution it is assumed that these scatterers behave as electric and magnetic dipoles under the influence of the incident radiation interestingly not only the retarded electromagnetic fields from oscillating dipoles are relevant to pass from the microscopic to the macroscopic representation but the advanced fields must be considered too it is found that the macroscopic fields are the sum of the incident fields plus the radiationreaction fields acting on a single scatterer both the local fields and the radiationreaction fields are necessary to fix the electric and magnetic surface susceptibilities
|
[['this', 'paper', 'derives', 'the', 'macroscopic', 'electric', 'and', 'magnetic', 'fields', 'and', 'the', 'surface', 'susceptibilities', 'for', 'a', 'metasurface', 'starting', 'from', 'the', 'microscopic', 'scatterer', 'distribution', 'it', 'is', 'assumed', 'that', 'these', 'scatterers', 'behave', 'as', 'electric', 'and', 'magnetic', 'dipoles', 'under', 'the', 'influence', 'of', 'the', 'incident', 'radiation', 'interestingly', 'not', 'only', 'the', 'retarded', 'electromagnetic', 'fields', 'from', 'oscillating', 'dipoles', 'are', 'relevant', 'to', 'pass', 'from', 'the', 'microscopic', 'to', 'the', 'macroscopic', 'representation', 'but', 'the', 'advanced', 'fields', 'must', 'be', 'considered', 'too', 'it', 'is', 'found', 'that', 'the', 'macroscopic', 'fields', 'are', 'the', 'sum', 'of', 'the', 'incident', 'fields', 'plus', 'the', 'radiationreaction', 'fields', 'acting', 'on', 'a', 'single', 'scatterer', 'both', 'the', 'local', 'fields', 'and', 'the', 'radiationreaction', 'fields', 'are', 'necessary', 'to', 'fix', 'the', 'electric', 'and', 'magnetic', 'surface', 'susceptibilities']]
|
[-0.1856425131255811, 0.2444594150224516, -0.08679137521985548, 0.06758894726554318, -0.10873954922699176, -0.08481337009249507, -0.034500270764142076, 0.3757897032810761, -0.2470473215688725, -0.317010502305788, 0.011998765044719787, -0.28277336342914683, -0.11578795298732616, 0.17624551811263905, 0.0567073037403191, -0.02338377983720453, -0.05436699449814655, 0.08167857633114935, 0.0046634761121560325, -0.18533430664657471, 0.3243497734268506, 0.003645251244977788, 0.28774469181358275, 0.05567221374299192, 0.10686381602542358, 0.04028554002309705, 0.05934110012006115, 0.07676562947128807, -0.03357305213966856, 0.05190766495358837, 0.1795441689591662, 0.0071348483644862164, 0.17547654578470634, -0.5200822422247346, -0.2042358902173939, 0.06298671651061054, 0.09794972737257888, 0.16404882664079065, -0.041139961206689814, -0.262142229502232, 0.004721001524746687, -0.05687477117454683, -0.15083744549737857, -0.08346991081562666, 0.01330888244482848, 0.10704760795442371, -0.3104902227526648, 0.04881652325458892, 0.05249580424614586, 0.0529012140725647, -0.12976883827532465, -0.10653588367072311, -0.05413251032482262, 0.1266933842813848, 0.10189422829546504, 0.07360463747167373, 0.2568170812551503, -0.1742024038570119, -0.03347062156745442, 0.3994180877265093, -0.03533676741560837, -0.217118583302861, 0.1630857945965217, -0.1989976230606034, -0.010831153783779423, 0.17014150252683205, 0.1711981925140093, 0.12953703511959394, -0.18207133876008763, 0.08699345442955173, -0.0011868027525509263, 0.11658253673430499, 0.09988470741774182, 0.03711383757894641, 0.2919692677856834, 0.06242541538400424, 0.03684190710951985, 0.11293839652202436, -0.09770972537388606, -0.028597665648605372, -0.36799714096763114, -0.09872030260603505, -0.22804953180555557, 0.07830585596617835, -0.05941851421596004, -0.21899544640637195, 0.38116642685925906, 0.18361749800408747, 0.09546226025181445, -0.02280343698677481, 0.3238971255518295, 0.15070825992550635, 0.10521414696851426, 0.07014612384509665, 0.32039520998804216, 0.22262535963064847, 0.12506467434116178, -0.215552754217742, -0.004233702620793436, -0.010838301038487]
|
1,803.09556
|
Local well-posedness for the Hall-MHD system in optimal Sobolev Spaces
|
We show that the viscous resistive magneto-hydrodynamics system with Hall
effect is locally well-posed in $H^s(\mathbb R^n)\times
H^{s+1-\varepsilon}(\mathbb R^n)$ with $s>\frac{n}2-1$ and any small enough
$\varepsilon>0$ such that $s+1-\varepsilon>\frac{n}2$. This space is to date
the largest local well-posedness space in the class of Sobolev spaces for the
system. It is also optimal according to the predominant scalings of the two
equations in the system.
|
math.AP
|
we show that the viscous resistive magnetohydrodynamics system with hall effect is locally wellposed in hsmathbb rntimes hs1varepsilonmathbb rn with sfracn21 and any small enough varepsilon0 such that s1varepsilonfracn2 this space is to date the largest local wellposedness space in the class of sobolev spaces for the system it is also optimal according to the predominant scalings of the two equations in the system
|
[['we', 'show', 'that', 'the', 'viscous', 'resistive', 'magnetohydrodynamics', 'system', 'with', 'hall', 'effect', 'is', 'locally', 'wellposed', 'in', 'hsmathbb', 'rntimes', 'hs1varepsilonmathbb', 'rn', 'with', 'sfracn21', 'and', 'any', 'small', 'enough', 'varepsilon0', 'such', 'that', 's1varepsilonfracn2', 'this', 'space', 'is', 'to', 'date', 'the', 'largest', 'local', 'wellposedness', 'space', 'in', 'the', 'class', 'of', 'sobolev', 'spaces', 'for', 'the', 'system', 'it', 'is', 'also', 'optimal', 'according', 'to', 'the', 'predominant', 'scalings', 'of', 'the', 'two', 'equations', 'in', 'the', 'system']]
|
[-0.17023075633351842, 0.11034075636228907, -0.03559284323766347, 0.05114410652764021, -0.0588645082335138, -0.10342118886089133, -0.06612347980450478, 0.30239652337566497, -0.32036590702351064, -0.20366137432715586, 0.16017890005229762, -0.28934675404020854, -0.11748692599095163, 0.20960026656675543, -0.07034912368192547, 0.11065937182795624, 0.024752788486019257, 0.00037480200145153267, -0.05132307296228265, -0.26586917907960955, 0.4137843741656041, -0.03219202935935989, 0.24243931518867612, -0.028104913518613866, 0.11629934443326126, -0.06501394932744123, 0.07529467169285542, 0.06146027773584431, -0.18924304074725143, 0.022662244977489594, 0.2515806138004747, 0.015984845618086475, 0.30083864362489793, -0.3909481294272888, -0.19293758958097426, 0.13915327502294414, 0.11313504036591057, 0.07859101275643034, -0.002178191526552602, -0.2769489781743276, 0.13874615974453908, -0.1331042974526363, -0.13307706983534678, -0.06828209101372669, 0.10985445571432431, 0.026153147265675566, -0.3294487683733384, 0.06860623239763006, 0.09768176422784886, -0.03628513051737701, -0.205875871988434, -0.04198793835765231, -0.0471611367838998, 0.07865826123123688, 0.026752035131662962, 0.11029752143358271, 0.051506423038400466, -0.0813269978501804, -0.031212106887851993, 0.389195348226255, -0.0766311104807462, -0.28027719824439695, 0.18084685516453558, -0.2540846329572941, -0.10205027411481546, 0.11728087518244021, 0.14584718407281944, 0.13020257859100257, -0.10887875793982417, 0.16634309182089993, -0.10365687360266043, 0.17109156688374857, -0.012524917785589012, 0.03943231758931952, 0.07023169623026924, 0.18468910662247048, 0.17074072644895605, 0.1021052982898489, -0.060406690001752486, -0.05939785942656829, -0.36923831284436726, -0.19155083979750354, -0.19600600042876096, 0.09138087644391964, -0.12645145015947842, -0.1805827167455948, 0.27599533287537914, 0.16104127848220448, 0.14112317581631004, 0.044449453842976404, 0.23068026568920863, 0.10908733765714831, 0.03455587115979964, 0.17646054167210334, 0.22909023734410444, 0.09248802086879168, 0.16356834982551874, -0.25943265159073614, 0.0536610605345378, 0.1417228760528228]
|
1,803.09557
|
RELICS: Strong Lensing analysis of the galaxy clusters Abell S295, Abell
697, MACS J0025.4-1222, and MACS J0159.8-0849
|
We present a strong-lensing analysis of four massive galaxy clusters imaged
with the Hubble Space Telescope in the Reionization Lensing Cluster Survey. We
use a Light-Traces-Mass technique to uncover sets of multiply images and
constrain the mass distribution of the clusters. These mass models are the
first published for Abell S295 and MACS J0159.8-0849, and are improvements over
previous models for Abell 697 and MACS J0025.4-1222. Our analysis for MACS
J0025.4-1222 and Abell S295 shows a bimodal mass distribution supporting the
merger scenarios proposed for these clusters. The updated model for MACS
J0025.4-1222 suggests a substantially smaller critical area than previously
estimated. For MACS J0159.8-0849 and Abell 697 we find a single peak and
relatively regular morphology, revealing fairly relaxed clusters. Despite being
less prominent lenses, three of these clusters seem to have lensing strengths,
i.e. cumulative area above certain magnification, similar to the Hubble
Frontier Fields clusters (e.g., A($\mu>5$) $\sim 1-3$ arcmin$^2$, A($\mu>10$)
$\sim 0.5-1.5$ arcmin$^2$), which in part can be attributed to their merging
configurations. We make our lens models publicly available through the Mikulski
Archive for Space Telescopes. Finally, using Gemini-N/GMOS spectroscopic
observations we detect a single emission line from a high-redshift
$J_{125}\simeq25.7$ galaxy candidate lensed by Abell 697. While we cannot rule
out a lower-redshift solution, we interpret the line as Ly$\alpha$ at
$z=5.800\pm 0.001$, in agreement with its photometric redshift and dropout
nature. Within this scenario we measure a Ly$\alpha$ rest-frame equivalent
width of $52\pm22$ \AA, and an observed Gaussian width of $117\pm 15$ km/s.
|
astro-ph.CO astro-ph.GA
|
we present a stronglensing analysis of four massive galaxy clusters imaged with the hubble space telescope in the reionization lensing cluster survey we use a lighttracesmass technique to uncover sets of multiply images and constrain the mass distribution of the clusters these mass models are the first published for abell s295 and macs j015980849 and are improvements over previous models for abell 697 and macs j002541222 our analysis for macs j002541222 and abell s295 shows a bimodal mass distribution supporting the merger scenarios proposed for these clusters the updated model for macs j002541222 suggests a substantially smaller critical area than previously estimated for macs j015980849 and abell 697 we find a single peak and relatively regular morphology revealing fairly relaxed clusters despite being less prominent lenses three of these clusters seem to have lensing strengths ie cumulative area above certain magnification similar to the hubble frontier fields clusters eg amu5 sim 13 arcmin2 amu10 sim 0515 arcmin2 which in part can be attributed to their merging configurations we make our lens models publicly available through the mikulski archive for space telescopes finally using geminingmos spectroscopic observations we detect a single emission line from a highredshift j_125simeq257 galaxy candidate lensed by abell 697 while we cannot rule out a lowerredshift solution we interpret the line as lyalpha at z5800pm 0001 in agreement with its photometric redshift and dropout nature within this scenario we measure a lyalpha restframe equivalent width of 52pm22 aa and an observed gaussian width of 117pm 15 kms
|
[['we', 'present', 'a', 'stronglensing', 'analysis', 'of', 'four', 'massive', 'galaxy', 'clusters', 'imaged', 'with', 'the', 'hubble', 'space', 'telescope', 'in', 'the', 'reionization', 'lensing', 'cluster', 'survey', 'we', 'use', 'a', 'lighttracesmass', 'technique', 'to', 'uncover', 'sets', 'of', 'multiply', 'images', 'and', 'constrain', 'the', 'mass', 'distribution', 'of', 'the', 'clusters', 'these', 'mass', 'models', 'are', 'the', 'first', 'published', 'for', 'abell', 's295', 'and', 'macs', 'j015980849', 'and', 'are', 'improvements', 'over', 'previous', 'models', 'for', 'abell', '697', 'and', 'macs', 'j002541222', 'our', 'analysis', 'for', 'macs', 'j002541222', 'and', 'abell', 's295', 'shows', 'a', 'bimodal', 'mass', 'distribution', 'supporting', 'the', 'merger', 'scenarios', 'proposed', 'for', 'these', 'clusters', 'the', 'updated', 'model', 'for', 'macs', 'j002541222', 'suggests', 'a', 'substantially', 'smaller', 'critical', 'area', 'than', 'previously', 'estimated', 'for', 'macs', 'j015980849', 'and', 'abell', '697', 'we', 'find', 'a', 'single', 'peak', 'and', 'relatively', 'regular', 'morphology', 'revealing', 'fairly', 'relaxed', 'clusters', 'despite', 'being', 'less', 'prominent', 'lenses', 'three', 'of', 'these', 'clusters', 'seem', 'to', 'have', 'lensing', 'strengths', 'ie', 'cumulative', 'area', 'above', 'certain', 'magnification', 'similar', 'to', 'the', 'hubble', 'frontier', 'fields', 'clusters', 'eg', 'amu5', 'sim', '13', 'arcmin2', 'amu10', 'sim', '0515', 'arcmin2', 'which', 'in', 'part', 'can', 'be', 'attributed', 'to', 'their', 'merging', 'configurations', 'we', 'make', 'our', 'lens', 'models', 'publicly', 'available', 'through', 'the', 'mikulski', 'archive', 'for', 'space', 'telescopes', 'finally', 'using', 'geminingmos', 'spectroscopic', 'observations', 'we', 'detect', 'a', 'single', 'emission', 'line', 'from', 'a', 'highredshift', 'j_125simeq257', 'galaxy', 'candidate', 'lensed', 'by', 'abell', '697', 'while', 'we', 'can', 'not', 'rule', 'out', 'a', 'lowerredshift', 'solution', 'we', 'interpret', 'the', 'line', 'as', 'lyalpha', 'at', 'z5800pm', '0001', 'in', 'agreement', 'with', 'its', 'photometric', 'redshift', 'and', 'dropout', 'nature', 'within', 'this', 'scenario', 'we', 'measure', 'a', 'lyalpha', 'restframe', 'equivalent', 'width', 'of', '52pm22', 'aa', 'and', 'an', 'observed', 'gaussian', 'width', 'of', '117pm', '15', 'kms']]
|
[-0.05780597299942073, 0.025338210780589652, -0.07664452286240883, 0.10535563607190251, -0.10704016131118002, -0.09450302556761317, 0.04625617946913727, 0.4605819621885365, -0.12386761067535206, -0.3635357733785121, 0.042676348430162284, -0.3070940379888466, -0.030375501006256696, 0.2186034196470133, 0.04848887249760037, -0.006594392457786439, 0.08935311755592634, -0.10098114306076376, -0.029965960247428175, -0.34807752851158197, 0.27343407032380174, 0.08661441906443836, 0.2040955671099638, -0.03258636810389647, 0.0894452002407475, -0.054164324105863484, -0.10746757785163336, 0.014722604956622197, -0.17455585979979701, 0.04105354778416655, 0.2363972749258097, 0.15368313118401714, 0.2357016182658532, -0.2583818131579617, -0.1938195804605806, 0.07105560599218223, 0.255318158902389, 0.05018968230319279, -0.0355902259095672, -0.36760137285575395, 0.0821684972099981, -0.16406128794331998, -0.1199468051695288, 0.06738788935294267, -0.01995389518825422, 0.026939895542094115, -0.2110819798294832, 0.18990481009491342, -0.07344797929009993, 0.06023636486858499, -0.12746192965596867, -0.12717208529876406, -0.014924878890006533, 0.04049327397865266, -0.06347985234985143, 0.08715339999238014, 0.15827529913214736, -0.1558549912131203, -0.029681766475935675, 0.39082606302089373, -0.03442166034525024, 0.027698518354291757, 0.19257154987659786, -0.18497588156822545, -0.2495047915707658, 0.1252854670141054, 0.17381600624509347, 0.05911958220026125, -0.1623649603286989, 0.0011806208079907859, -0.04846397984180261, 0.2675960643100552, 0.042537628050531795, 0.04077215625746113, 0.32198250553308994, 0.0938914781277576, 0.04264333482142846, 0.12516768004654807, -0.2798709295832452, -0.011603208447321633, -0.22498739333746354, -0.07267387981179232, -0.112968402181575, 0.06894393123029433, -0.1528825112516883, -0.1417147476983272, 0.3180058166781086, 0.13092885886726435, 0.22895488284204987, 0.13044317032129712, 0.279761373457953, 0.04078141846434283, 0.15502107872248605, 0.07411415426999576, 0.29778447531333024, 0.18056531109239074, 0.05668480098122454, -0.1416873056277987, 0.01313068103122194, -0.05158452993830808]
|
1,803.09558
|
Notes on the motivic McKay correspondence for the group scheme
$\alpha_{p}$
|
We formulate a conjecture on the motivic McKay correspondence for the group
scheme $ \alpha_{p}$ in characteristic $p>0$ and give a few evidences. The
conjecture especially claims that there would be a close relation between
quotient varieties by $\alpha_{p}$ and ones by the cyclic group of order $p$.
|
math.AG
|
we formulate a conjecture on the motivic mckay correspondence for the group scheme alpha_p in characteristic p0 and give a few evidences the conjecture especially claims that there would be a close relation between quotient varieties by alpha_p and ones by the cyclic group of order p
|
[['we', 'formulate', 'a', 'conjecture', 'on', 'the', 'motivic', 'mckay', 'correspondence', 'for', 'the', 'group', 'scheme', 'alpha_p', 'in', 'characteristic', 'p0', 'and', 'give', 'a', 'few', 'evidences', 'the', 'conjecture', 'especially', 'claims', 'that', 'there', 'would', 'be', 'a', 'close', 'relation', 'between', 'quotient', 'varieties', 'by', 'alpha_p', 'and', 'ones', 'by', 'the', 'cyclic', 'group', 'of', 'order', 'p']]
|
[-0.2382037054469928, 0.05768360076670317, -0.17865483843265695, 0.10842884908568987, -0.04380152446336727, -0.1981661827501623, 0.09041307128450655, 0.32243003268191156, -0.2951719954292825, -0.27734979075637267, 0.06414508515166396, -0.21192697545592773, -0.15270231430359343, 0.21598033884421308, -0.14234177710765855, -0.06407149167771035, 0.019386514545755185, 0.08501689397591225, -0.09341033559510524, -0.27706125489574795, 0.36610276038025286, -0.030380112763018684, 0.256029583315583, 0.09561079435367534, 0.03769419829737633, 0.017323314073555012, -0.004662000831771404, -0.03481028153699763, -0.18396914939156442, 0.09565878282499282, 0.329297310811408, 0.05175045404107647, 0.2364096294474253, -0.35351038755888636, -0.1396249398153196, 0.18461222060896615, 0.09964091460557377, 0.030153393567084, -0.04553571130654358, -0.2357920588766958, 0.1698144917138555, -0.19582591665552018, -0.16089643670823128, -0.05711656687979368, 0.09527278177321274, -0.04154975549813281, -0.23563970403468354, 0.05166522615609017, 0.07116078498198632, 0.1497945308962718, -0.057826695146356175, -0.07222345088945424, 0.008645120948711608, 0.059430971751584016, 0.06692994374068494, 0.0517734595118685, 0.010493895207393043, -0.10014961116967049, -0.13509349834094656, 0.38688433526995336, -0.04998749534926437, -0.14364924592936926, 0.10237991938644901, -0.16094453511957793, -0.16255363685257257, 0.1272265414132717, 0.014034859756840037, 0.14766942353007642, 0.05854633264243603, 0.12202582894477676, -0.17757823762107403, 0.08697599373718208, 0.11952933080573665, -0.04669163172985328, 0.1829442478954158, 0.014775783893592815, 0.024164346819545362, 0.08880918724412852, 0.004178253582064459, -0.014035376462530582, -0.3625203649255824, -0.17665572914275082, -0.09166207497424268, 0.14207400746167975, -0.14088216185151164, -0.07524946248505582, 0.33267072994196034, 0.08086598997420454, 0.20750681491212009, 0.15055898276771953, 0.1884452456687676, 0.08324466952855916, 0.03544150093852721, 0.03060876340308088, 0.14084968145223373, 0.2652515525176646, -0.04130732271067323, -0.16275130386682266, 0.042017576928706245, 0.19908771386488955]
|
1,803.09559
|
On Expansion and Resolution in CEGAR Based QBF Solving
|
A quantified Boolean formula (QBF) is a propositional formula extended with
universal and existential quantification over propositions. There are two
methodologies in CEGAR based QBF solving techniques, one that is based on a
refinement loop that builds partial expansions and a more recent one that is
based on the communication of satisfied clauses. Despite their algorithmic
similarity, their performance characteristics in experimental evaluations are
very different and in many cases orthogonal. We compare those CEGAR approaches
using proof theory developed around QBF solving and present a unified calculus
that combines the strength of both approaches. Lastly, we implement the new
calculus and confirm experimentally that the theoretical improvements lead to
improved performance.
|
cs.LO
|
a quantified boolean formula qbf is a propositional formula extended with universal and existential quantification over propositions there are two methodologies in cegar based qbf solving techniques one that is based on a refinement loop that builds partial expansions and a more recent one that is based on the communication of satisfied clauses despite their algorithmic similarity their performance characteristics in experimental evaluations are very different and in many cases orthogonal we compare those cegar approaches using proof theory developed around qbf solving and present a unified calculus that combines the strength of both approaches lastly we implement the new calculus and confirm experimentally that the theoretical improvements lead to improved performance
|
[['a', 'quantified', 'boolean', 'formula', 'qbf', 'is', 'a', 'propositional', 'formula', 'extended', 'with', 'universal', 'and', 'existential', 'quantification', 'over', 'propositions', 'there', 'are', 'two', 'methodologies', 'in', 'cegar', 'based', 'qbf', 'solving', 'techniques', 'one', 'that', 'is', 'based', 'on', 'a', 'refinement', 'loop', 'that', 'builds', 'partial', 'expansions', 'and', 'a', 'more', 'recent', 'one', 'that', 'is', 'based', 'on', 'the', 'communication', 'of', 'satisfied', 'clauses', 'despite', 'their', 'algorithmic', 'similarity', 'their', 'performance', 'characteristics', 'in', 'experimental', 'evaluations', 'are', 'very', 'different', 'and', 'in', 'many', 'cases', 'orthogonal', 'we', 'compare', 'those', 'cegar', 'approaches', 'using', 'proof', 'theory', 'developed', 'around', 'qbf', 'solving', 'and', 'present', 'a', 'unified', 'calculus', 'that', 'combines', 'the', 'strength', 'of', 'both', 'approaches', 'lastly', 'we', 'implement', 'the', 'new', 'calculus', 'and', 'confirm', 'experimentally', 'that', 'the', 'theoretical', 'improvements', 'lead', 'to', 'improved', 'performance']]
|
[-0.09415744451793476, 0.0061842229624744505, -0.1345065644418355, 0.07179392241336505, -0.13674555965865562, -0.171806006945969, 0.07748191679482781, 0.36916775246416883, -0.22048695013342826, -0.28309268141830607, 0.09489571558515308, -0.23982479662767478, -0.17089151097960503, 0.28221059031784534, -0.09568440267217479, 0.09838292563966076, 0.06186083526699804, -0.006904592018275123, -0.11259126333295301, -0.2497398253929402, 0.2980473070438003, -0.027466689269723638, 0.27392865172753644, 0.09070545566334788, 0.10103215244349226, -0.021143693568384542, -0.05256299566826783, 0.08625490378210543, -0.1035027206729475, 0.1964275051338648, 0.3031765715464384, 0.23029496563581883, 0.3032438717117267, -0.45064614525264396, -0.1414675029684856, 0.03718101387494244, 0.12767119972600735, 0.09086531744105741, -0.055002129109327925, -0.2663351129075246, 0.07735942750670281, -0.2009044436604849, -0.04923726271122827, -0.15481804983989736, 0.017845914154479812, 0.023662210192664394, -0.2479215159962353, 0.014176831368656297, 0.1059992269126399, 0.09978802898591052, -0.042347634558349716, -0.16486959588447853, 0.08601904659631796, 0.06497192234798733, -0.004218326679879932, 0.011203683027166076, 0.0997332063187579, -0.0891077370844349, -0.24986489933715866, 0.32053279862572837, -0.03042116803616019, -0.23217701590952597, 0.18604131708707428, -0.03516986036473619, -0.20378408233435558, 0.10021115817029827, 0.09363252596501427, 0.1450608840428426, -0.11527123936684802, 0.09337130559132285, -0.05750380939155418, 0.20103686850883865, 0.10783279144171891, 0.029344325577507595, 0.12489909662898364, 0.18043250146521522, -0.0010671502319122997, 0.13822777708160824, 0.0018250858702231199, -0.16703606432253895, -0.2581676371462111, -0.1359853152186718, -0.12530495011846401, -0.0613765993007941, -0.09693476855279316, -0.16169353258114175, 0.36844522722198497, 0.22814601289740363, 0.1521087139512279, 0.1530789438111242, 0.34771076793133815, 0.14911165590248338, 0.09097919745337484, 0.043999272860154245, 0.19676237621648138, 0.146030812981605, 0.08644839667977067, -0.18474578396230104, 0.10916810897366044, 0.12889565948691079]
|
1,803.0956
|
Forecasting Cyber Attacks with Imbalanced Data Sets and Different Time
Granularities
|
If cyber incidents are predicted a reasonable amount of time before they
occur, defensive actions to prevent their destructive effects could be planned.
Unfortunately, most of the time we do not have enough observables of the
malicious activities before they are already under way. Therefore, this work
suggests to use unconventional signals extracted from various data sources with
different time granularities to predict cyber incidents for target entities. A
Bayesian network is used to predict cyber attacks where the unconventional
signals are used as indicative random variables. This work also develops a
novel minority class over sampling technique to improve cyber attack prediction
on imbalanced data sets. The results show that depending on the selected time
granularity, the unconventional signals are able to predict cyber attacks for
the anonimyzed target organization even though the signals are not explicitly
related to that organization. Furthermore, the minority over sampling approach
developed achieves better performance compared to the existing filtering
techniques in the literature.
|
cs.CR
|
if cyber incidents are predicted a reasonable amount of time before they occur defensive actions to prevent their destructive effects could be planned unfortunately most of the time we do not have enough observables of the malicious activities before they are already under way therefore this work suggests to use unconventional signals extracted from various data sources with different time granularities to predict cyber incidents for target entities a bayesian network is used to predict cyber attacks where the unconventional signals are used as indicative random variables this work also develops a novel minority class over sampling technique to improve cyber attack prediction on imbalanced data sets the results show that depending on the selected time granularity the unconventional signals are able to predict cyber attacks for the anonimyzed target organization even though the signals are not explicitly related to that organization furthermore the minority over sampling approach developed achieves better performance compared to the existing filtering techniques in the literature
|
[['if', 'cyber', 'incidents', 'are', 'predicted', 'a', 'reasonable', 'amount', 'of', 'time', 'before', 'they', 'occur', 'defensive', 'actions', 'to', 'prevent', 'their', 'destructive', 'effects', 'could', 'be', 'planned', 'unfortunately', 'most', 'of', 'the', 'time', 'we', 'do', 'not', 'have', 'enough', 'observables', 'of', 'the', 'malicious', 'activities', 'before', 'they', 'are', 'already', 'under', 'way', 'therefore', 'this', 'work', 'suggests', 'to', 'use', 'unconventional', 'signals', 'extracted', 'from', 'various', 'data', 'sources', 'with', 'different', 'time', 'granularities', 'to', 'predict', 'cyber', 'incidents', 'for', 'target', 'entities', 'a', 'bayesian', 'network', 'is', 'used', 'to', 'predict', 'cyber', 'attacks', 'where', 'the', 'unconventional', 'signals', 'are', 'used', 'as', 'indicative', 'random', 'variables', 'this', 'work', 'also', 'develops', 'a', 'novel', 'minority', 'class', 'over', 'sampling', 'technique', 'to', 'improve', 'cyber', 'attack', 'prediction', 'on', 'imbalanced', 'data', 'sets', 'the', 'results', 'show', 'that', 'depending', 'on', 'the', 'selected', 'time', 'granularity', 'the', 'unconventional', 'signals', 'are', 'able', 'to', 'predict', 'cyber', 'attacks', 'for', 'the', 'anonimyzed', 'target', 'organization', 'even', 'though', 'the', 'signals', 'are', 'not', 'explicitly', 'related', 'to', 'that', 'organization', 'furthermore', 'the', 'minority', 'over', 'sampling', 'approach', 'developed', 'achieves', 'better', 'performance', 'compared', 'to', 'the', 'existing', 'filtering', 'techniques', 'in', 'the', 'literature']]
|
[-0.09785625378135591, 0.10682489004539093, -0.10076110596564831, 0.13562840330923792, -0.11549388667044695, -0.17207646079768893, 0.09084093720302917, 0.3868061563873198, -0.23803669868866564, -0.33479940772231204, 0.10395489303118666, -0.3025942055508494, -0.15149480464460793, 0.19920808776587365, -0.11566760167479515, 0.07167156935465754, 0.04183913301822031, 0.03543523337575607, -0.029379015482845716, -0.3046669075352838, 0.29290419928947814, 0.06424468007753603, 0.336678356473567, 0.027273420655910742, 0.040149463384295814, -0.031104518542269942, -0.04769321470084833, 0.005388599370053271, -0.0592309690696311, 0.06045686287325225, 0.3854391692439094, 0.1848280399140549, 0.3073058683599811, -0.464082115853671, -0.2442868471611291, 0.15286882344516925, 0.12666600075463066, 0.1359833786438685, -0.02082275513384957, -0.34077611700049604, 0.12266802503727377, -0.20038389715191443, -0.06720532681210897, -0.13548039990564575, -0.033931163384113464, 0.024507051766704535, -0.23956400450551882, 0.0183458130208237, 0.035681923570518845, 0.043583548458991574, -0.027485614189936315, -0.10050034021769534, -0.009902648442221107, 0.17694549943844323, 0.09322486146556912, -0.009717244670173385, 0.19671758326003327, -0.11220212113548769, -0.16548655277911167, 0.3559654995973688, 0.001963305048411712, -0.17121408585226164, 0.21802939029585106, -0.07694468340778257, -0.16036199229129125, 0.14997731527982977, 0.24624917026849288, 0.09675791968475096, -0.15878365152384505, -0.0416384408948943, 0.00845698430784978, 0.2013204808055889, 0.03665037676400971, 0.05330701218917966, 0.18641179216938325, 0.1661529044416966, 0.07473651936161332, 0.07849127542940551, -0.11378114312828984, -0.0826113957882626, -0.21038839399334391, -0.06456453695718664, -0.16098767083021812, -0.001544815779016062, -0.031838315376080575, -0.13405919748729503, 0.3863109488738701, 0.26725059843738563, 0.19876598881091923, 0.04310183447378222, 0.3226231000415282, 0.02186195763279102, 0.11401894964365056, 0.083209590203478, 0.20608474462424056, -0.007134980258706491, 0.12089701421609789, -0.14149837904333254, 0.19484229422232602, -0.02945217761443928]
|
1,803.09561
|
The Yagita invariant of symplectic groups of large rank
|
Fix a prime $p$, and let $R$ be any subring of the complex numbers that is
either integrally closed or contains a primitive $p$th root of 1. For each
$n\geq p-1$ we compute the Yagita invariant at the prime $p$ for the symplectic
group $Sp(2n,R)$.
|
math.GR
|
fix a prime p and let r be any subring of the complex numbers that is either integrally closed or contains a primitive pth root of 1 for each ngeq p1 we compute the yagita invariant at the prime p for the symplectic group sp2nr
|
[['fix', 'a', 'prime', 'p', 'and', 'let', 'r', 'be', 'any', 'subring', 'of', 'the', 'complex', 'numbers', 'that', 'is', 'either', 'integrally', 'closed', 'or', 'contains', 'a', 'primitive', 'pth', 'root', 'of', '1', 'for', 'each', 'ngeq', 'p1', 'we', 'compute', 'the', 'yagita', 'invariant', 'at', 'the', 'prime', 'p', 'for', 'the', 'symplectic', 'group', 'sp2nr']]
|
[-0.28803518662850064, 0.11669041038775403, -0.09031131564536028, 0.03675918437592271, -0.06028709568911129, -0.23546939767483208, -0.057062046871417096, 0.25457218711574875, -0.3638373381147782, -0.1679983947840002, 0.06833893343185385, -0.2906187646504905, -0.05371861624945369, 0.18177791574659447, -0.08345207758247852, -0.06905289142289095, -0.01987433733108143, 0.23468655010478365, -0.05953742950223386, -0.2778258694128858, 0.358496303194099, -0.11124614819677339, 0.07177420513083538, -0.02014054356970721, 0.08598465489016639, 0.03932017359054751, 0.042141754056016605, -0.025522409881361657, -0.18532561730777766, 0.08084438650144471, 0.3046660292479727, 0.08984359270996517, 0.2585287712022869, -0.3448550063081913, -0.09228614119605885, 0.31839964319434433, 0.18143812995404004, -0.09838421841462454, -0.010081185017608935, -0.15557748721912504, 0.28091215954886545, -0.13988826399048168, -0.21583012762582965, -0.06918696202337742, 0.17014780883780783, 0.018648153677996663, -0.36699329995446733, -0.04365440242820316, 0.08788677230477333, 0.2267754053283069, -0.032752661313861606, -0.1957125885412097, -0.0060668016369971964, 0.08083411228015192, -0.08183921884434918, 0.12710564713149022, 0.07527181202959683, -0.030376826241586566, -0.0928456000569794, 0.4133083568678962, -0.02970984363928437, -0.2440556383277807, 0.042893264815211295, -0.2476054545181493, -0.18040775880217552, 0.18022429529163572, 0.08097581839602855, 0.14527076482772827, 0.06262810714025464, 0.24679357544907057, -0.13573755383905436, 0.10188400687442886, 0.10994648885809713, -0.07963067292132311, 0.1493848508844773, 0.012868199295674761, 0.06267230273483114, 0.08356202871590439, -0.02505084052681923, 0.11151802995138699, -0.4100016893612014, -0.2383447882408897, -0.20075381301964323, 0.2095112957370778, -0.12023940098750042, -0.13410209185547298, 0.352777861783074, -0.004071499262419012, 0.10838644961929983, 0.12760910164150926, 0.23436817011485497, 0.05786592842131439, 0.09047104180273083, 0.11965057749508155, -0.031516679500540094, 0.16033960744324657, -0.11614751000371244, -0.15390122562853825, -0.024489791981048056, 0.16425059576415355]
|
1,803.09562
|
On maximum and comparison principles for parabolic problems with the
$p$-Laplacian
|
We investigate strong and weak versions of maximum and comparison principles
for a class of quasilinear parabolic equations with the $p$-Laplacian $$
\partial_t u - \Delta_p u = \lambda |u|^{p-2} u + f(x,t) $$ under zero boundary
and nonnegative initial conditions on a bounded cylindrical domain $\Omega
\times (0, T)$, $\lambda \in \mathbb{R}$, and $f \in L^\infty(\Omega \times (0,
T))$. Several related counterexamples are given.
|
math.AP
|
we investigate strong and weak versions of maximum and comparison principles for a class of quasilinear parabolic equations with the plaplacian partial_t u delta_p u lambda up2 u fxt under zero boundary and nonnegative initial conditions on a bounded cylindrical domain omega times 0 t lambda in mathbbr and f in linftyomega times 0 t several related counterexamples are given
|
[['we', 'investigate', 'strong', 'and', 'weak', 'versions', 'of', 'maximum', 'and', 'comparison', 'principles', 'for', 'a', 'class', 'of', 'quasilinear', 'parabolic', 'equations', 'with', 'the', 'plaplacian', 'partial_t', 'u', 'delta_p', 'u', 'lambda', 'up2', 'u', 'fxt', 'under', 'zero', 'boundary', 'and', 'nonnegative', 'initial', 'conditions', 'on', 'a', 'bounded', 'cylindrical', 'domain', 'omega', 'times', '0', 't', 'lambda', 'in', 'mathbbr', 'and', 'f', 'in', 'linftyomega', 'times', '0', 't', 'several', 'related', 'counterexamples', 'are', 'given']]
|
[-0.22587530381667117, 0.08442031553325553, 0.06213894994774213, 0.01880964763307323, -0.09071432600030675, -0.24108420399328073, -0.03507659003759424, 0.3339441879031559, -0.3510013489673535, -0.11250016367994249, 0.12026282212076088, -0.37461993809168537, -0.00474083824083209, 0.12514096667485622, -0.016615303481618562, 0.09924061049241573, 0.06369567333410184, 0.07216583636278907, -0.11396936422291522, -0.1521963186057595, 0.3691171184182167, -0.25106420745141805, 0.13860668203172585, 0.07923285170594076, 0.10521930907561909, -0.07850375166453886, 0.07459386378662505, 0.007520942483097315, -0.34784484254196285, -0.0225887167674955, 0.18508459866667787, 0.029329306453776856, 0.3860899172645683, -0.3772767746200164, -0.15855642358462016, 0.19099331316538154, 0.0650223054389547, -0.08077915521959464, 0.02183094364978994, -0.35389544527667266, 0.17166389722260647, -0.0354456671513617, -0.21119547470783193, 0.009683103704204162, 0.16430520008628566, 0.11963204319278399, -0.40969054110658665, 0.14337296335046024, 0.13314690339805868, 0.022854233641798297, -0.1273184503506248, -0.2283736863794426, -0.043891207625468574, -0.022858498563679556, 0.03283640863373875, 0.1631513047264889, -0.0069446102327977615, -0.122228732968991, 0.018247038475237787, 0.36185806021094324, -0.1951604136886696, -0.26931753202031056, 0.13046567897933226, -0.19620907828211784, -0.11064966537524015, 0.04657623500873645, 0.1264959562647467, 0.23238982545832793, -0.0976724331267178, 0.3285722309529471, -0.048691461330357316, 0.12964436340456206, 0.17673555431732288, -0.02613172878821691, 0.005783970293123275, 0.0730476587312296, 0.1694947850657627, 0.07304079812020063, 0.004718007407306383, -0.025038373086135834, -0.4374786969895164, -0.07766207978129387, -0.10529647131140034, 0.20967168789356946, -0.10551257784536575, -0.1634338774718344, 0.2928650490862007, 0.04225769997574389, 0.18481352886495492, 0.07882195551258822, 0.10194666947548588, 0.1795145705497513, -0.06650133271080752, 0.09626643886391927, 0.027730363638450703, 0.18688846953834096, 0.1646997886748674, -0.26473301559841883, -0.004409346962347627, 0.11640379170494271]
|
1,803.09563
|
Computational modeling of multiphase viscoelastic and elastoviscoplastic
flows
|
In this paper, a three-dimensional numerical solver is developed for
suspensions of rigid and soft particles and droplets in viscoelastic and
elastoviscoplastic (EVP) fluids. The presented algorithm is designed to allow
for the first time three-dimensional simulations of inertial and turbulent EVP
fluids with a large number particles and droplets. This is achieved by
combining fast and highly scalable methods such as an FFT-based pressure
solver, with the evolution equation for non-Newtonian (including
elastoviscoplastic) stresses. In this flexible computational framework, the
fluid can be modelled by either Oldroyd-B, neo-Hookean, FENE-P, and Saramito
EVP models, and the additional equations for the non-Newtonian stresses are
fully coupled with the flow. The rigid particles are discretized on a moving
Lagrangian grid while the flow equations are solved on a fixed Eulerian grid.
The solid particles are represented by an Immersed Boundary method (IBM) with a
computationally efficient direct forcing method allowing simulations of a large
numbers of particles. The immersed boundary force is computed at the particle
surface and then included in the momentum equations as a body force. The
droplets and soft particles on the other hand are simulated in a fully Eulerian
framework, the former with a level-set method to capture the moving interface
and the latter with an indicator function. The solver is first validated for
various benchmark single-phase and two-phase elastoviscoplastic flow problems
through comparison with data from the literature. Finally, we present new
results on the dynamics of a buoyancy-driven drop in an elastoviscoplastic
fluid.
|
physics.flu-dyn
|
in this paper a threedimensional numerical solver is developed for suspensions of rigid and soft particles and droplets in viscoelastic and elastoviscoplastic evp fluids the presented algorithm is designed to allow for the first time threedimensional simulations of inertial and turbulent evp fluids with a large number particles and droplets this is achieved by combining fast and highly scalable methods such as an fftbased pressure solver with the evolution equation for nonnewtonian including elastoviscoplastic stresses in this flexible computational framework the fluid can be modelled by either oldroydb neohookean fenep and saramito evp models and the additional equations for the nonnewtonian stresses are fully coupled with the flow the rigid particles are discretized on a moving lagrangian grid while the flow equations are solved on a fixed eulerian grid the solid particles are represented by an immersed boundary method ibm with a computationally efficient direct forcing method allowing simulations of a large numbers of particles the immersed boundary force is computed at the particle surface and then included in the momentum equations as a body force the droplets and soft particles on the other hand are simulated in a fully eulerian framework the former with a levelset method to capture the moving interface and the latter with an indicator function the solver is first validated for various benchmark singlephase and twophase elastoviscoplastic flow problems through comparison with data from the literature finally we present new results on the dynamics of a buoyancydriven drop in an elastoviscoplastic fluid
|
[['in', 'this', 'paper', 'a', 'threedimensional', 'numerical', 'solver', 'is', 'developed', 'for', 'suspensions', 'of', 'rigid', 'and', 'soft', 'particles', 'and', 'droplets', 'in', 'viscoelastic', 'and', 'elastoviscoplastic', 'evp', 'fluids', 'the', 'presented', 'algorithm', 'is', 'designed', 'to', 'allow', 'for', 'the', 'first', 'time', 'threedimensional', 'simulations', 'of', 'inertial', 'and', 'turbulent', 'evp', 'fluids', 'with', 'a', 'large', 'number', 'particles', 'and', 'droplets', 'this', 'is', 'achieved', 'by', 'combining', 'fast', 'and', 'highly', 'scalable', 'methods', 'such', 'as', 'an', 'fftbased', 'pressure', 'solver', 'with', 'the', 'evolution', 'equation', 'for', 'nonnewtonian', 'including', 'elastoviscoplastic', 'stresses', 'in', 'this', 'flexible', 'computational', 'framework', 'the', 'fluid', 'can', 'be', 'modelled', 'by', 'either', 'oldroydb', 'neohookean', 'fenep', 'and', 'saramito', 'evp', 'models', 'and', 'the', 'additional', 'equations', 'for', 'the', 'nonnewtonian', 'stresses', 'are', 'fully', 'coupled', 'with', 'the', 'flow', 'the', 'rigid', 'particles', 'are', 'discretized', 'on', 'a', 'moving', 'lagrangian', 'grid', 'while', 'the', 'flow', 'equations', 'are', 'solved', 'on', 'a', 'fixed', 'eulerian', 'grid', 'the', 'solid', 'particles', 'are', 'represented', 'by', 'an', 'immersed', 'boundary', 'method', 'ibm', 'with', 'a', 'computationally', 'efficient', 'direct', 'forcing', 'method', 'allowing', 'simulations', 'of', 'a', 'large', 'numbers', 'of', 'particles', 'the', 'immersed', 'boundary', 'force', 'is', 'computed', 'at', 'the', 'particle', 'surface', 'and', 'then', 'included', 'in', 'the', 'momentum', 'equations', 'as', 'a', 'body', 'force', 'the', 'droplets', 'and', 'soft', 'particles', 'on', 'the', 'other', 'hand', 'are', 'simulated', 'in', 'a', 'fully', 'eulerian', 'framework', 'the', 'former', 'with', 'a', 'levelset', 'method', 'to', 'capture', 'the', 'moving', 'interface', 'and', 'the', 'latter', 'with', 'an', 'indicator', 'function', 'the', 'solver', 'is', 'first', 'validated', 'for', 'various', 'benchmark', 'singlephase', 'and', 'twophase', 'elastoviscoplastic', 'flow', 'problems', 'through', 'comparison', 'with', 'data', 'from', 'the', 'literature', 'finally', 'we', 'present', 'new', 'results', 'on', 'the', 'dynamics', 'of', 'a', 'buoyancydriven', 'drop', 'in', 'an', 'elastoviscoplastic', 'fluid']]
|
[-0.09771620742768443, 0.15406144496902438, -0.11275572759431514, -0.01768074449193399, -0.04426083707807177, -0.14023678162990788, -0.05881949313476159, 0.33612578017334266, -0.27167340923797306, -0.3210188693790962, 0.0975210393009503, -0.2511171172316209, -0.1151531909550332, 0.19265669390438048, -0.02372864904961117, 0.11698160477065883, 0.0805261465645115, -0.038784126536277067, -0.016603064848719602, -0.16366605733462603, 0.26607978482904837, 0.035501742783774874, 0.24290472072950467, 0.04148947001374289, 0.15310758241022582, -0.03364037163437314, -0.02586388867253786, 0.12985542208823278, -0.17083325066387925, 0.08043599176425033, 0.1908932430619532, -0.00870315827111282, 0.22971229848349695, -0.5101545394390701, -0.25125287852545336, 0.03836348279553458, 0.12721963751515963, 0.11520626181944811, -0.07872752118212117, -0.26810461647687406, 0.04524904289765556, -0.17127691445554175, -0.12908778753324707, -0.0870736993894708, 0.004672201990142343, 0.07278784110596048, -0.28219518607966904, 0.11761423534495052, 0.034122683377595754, 0.06226996315181316, -0.10354378070053834, -0.06828528019785124, -0.02070822183286953, 0.06723593012036398, 0.038282556610269004, 0.013831580358716409, 0.1529800504757417, -0.1554064024533183, -0.04788524840061167, 0.44465087800347286, -0.054882337528752254, -0.31380698859797623, 0.2459111866177764, -0.05365272309835546, -0.055009366393589026, 0.17873491638868183, 0.2246764374317647, 0.16961388390821716, -0.15506886387985896, 0.04137072589994234, -0.06976199858657244, 0.1540937735453036, 0.021933791148135574, -0.14645319022768274, 0.18235833464356943, 0.23423640881248606, 0.030864542812285036, 0.14650123706726334, -0.07978523996369005, -0.12460890403055261, -0.2999367433471408, -0.19041454360812782, -0.18550015535826483, -0.04094841904328697, -0.11808155333432577, -0.18996039608387444, 0.3135637285351579, 0.09271468861005837, 0.11937256674547263, 0.06239645561578161, 0.34566759362029353, 0.0856700549877014, 0.017106977631186505, 0.12593217888597127, 0.24443833796474024, 0.14332534978923395, 0.1408538617964122, -0.2199358568399978, 0.01425278705840067, 0.12885532008362857]
|
1,803.09564
|
Absence of ballistic charge transport in the half-filled 1D Hubbard
model
|
Whether in the thermodynamic limit of lattice length infinite, hole
concentration tending to zero, nonzero temperature, and U/t > 0 the charge
stiffness of the 1D Hubbard model with first neighbor transfer integral t and
on-site repulsion U is finite or vanishes and thus whether there is or there is
no ballistic charge transport, respectively, remains an unsolved and
controversial issue, as different approaches yield contradictory results. In
this paper we provide an upper bound on the charge stiffness and show that
(similarly as at zero temperature), for T >0 and U/t>0 it vanishes in the limit
of zero hole concentration within the canonical ensemble in the thermodynamic
limit. Moreover, we show that at high temperature the charge stiffness vanishes
as well within the grand-canonical ensemble in the infinite lattice length
limit and chemical potential approaching half the Mott-Hubbard gap. The lack of
charge ballistic transport indicates that charge transport at finite
temperatures is dominated by a diffusive contribution. Our scheme uses a
suitable exact representation of the electrons in terms of rotated electrons
for which the numbers of singly occupied and doubly occupied lattice sites are
good quantum numbers for U/t>0. In contrast to often less controllable
numerical studies, the use of such a representation reveals the carriers that
couple to the charge probes and provides useful physical information on the
microscopic processes behind the exotic charge transport properties of the 1D
electronic correlated system under study.
|
cond-mat.str-el
|
whether in the thermodynamic limit of lattice length infinite hole concentration tending to zero nonzero temperature and ut 0 the charge stiffness of the 1d hubbard model with first neighbor transfer integral t and onsite repulsion u is finite or vanishes and thus whether there is or there is no ballistic charge transport respectively remains an unsolved and controversial issue as different approaches yield contradictory results in this paper we provide an upper bound on the charge stiffness and show that similarly as at zero temperature for t 0 and ut0 it vanishes in the limit of zero hole concentration within the canonical ensemble in the thermodynamic limit moreover we show that at high temperature the charge stiffness vanishes as well within the grandcanonical ensemble in the infinite lattice length limit and chemical potential approaching half the motthubbard gap the lack of charge ballistic transport indicates that charge transport at finite temperatures is dominated by a diffusive contribution our scheme uses a suitable exact representation of the electrons in terms of rotated electrons for which the numbers of singly occupied and doubly occupied lattice sites are good quantum numbers for ut0 in contrast to often less controllable numerical studies the use of such a representation reveals the carriers that couple to the charge probes and provides useful physical information on the microscopic processes behind the exotic charge transport properties of the 1d electronic correlated system under study
|
[['whether', 'in', 'the', 'thermodynamic', 'limit', 'of', 'lattice', 'length', 'infinite', 'hole', 'concentration', 'tending', 'to', 'zero', 'nonzero', 'temperature', 'and', 'ut', '0', 'the', 'charge', 'stiffness', 'of', 'the', '1d', 'hubbard', 'model', 'with', 'first', 'neighbor', 'transfer', 'integral', 't', 'and', 'onsite', 'repulsion', 'u', 'is', 'finite', 'or', 'vanishes', 'and', 'thus', 'whether', 'there', 'is', 'or', 'there', 'is', 'no', 'ballistic', 'charge', 'transport', 'respectively', 'remains', 'an', 'unsolved', 'and', 'controversial', 'issue', 'as', 'different', 'approaches', 'yield', 'contradictory', 'results', 'in', 'this', 'paper', 'we', 'provide', 'an', 'upper', 'bound', 'on', 'the', 'charge', 'stiffness', 'and', 'show', 'that', 'similarly', 'as', 'at', 'zero', 'temperature', 'for', 't', '0', 'and', 'ut0', 'it', 'vanishes', 'in', 'the', 'limit', 'of', 'zero', 'hole', 'concentration', 'within', 'the', 'canonical', 'ensemble', 'in', 'the', 'thermodynamic', 'limit', 'moreover', 'we', 'show', 'that', 'at', 'high', 'temperature', 'the', 'charge', 'stiffness', 'vanishes', 'as', 'well', 'within', 'the', 'grandcanonical', 'ensemble', 'in', 'the', 'infinite', 'lattice', 'length', 'limit', 'and', 'chemical', 'potential', 'approaching', 'half', 'the', 'motthubbard', 'gap', 'the', 'lack', 'of', 'charge', 'ballistic', 'transport', 'indicates', 'that', 'charge', 'transport', 'at', 'finite', 'temperatures', 'is', 'dominated', 'by', 'a', 'diffusive', 'contribution', 'our', 'scheme', 'uses', 'a', 'suitable', 'exact', 'representation', 'of', 'the', 'electrons', 'in', 'terms', 'of', 'rotated', 'electrons', 'for', 'which', 'the', 'numbers', 'of', 'singly', 'occupied', 'and', 'doubly', 'occupied', 'lattice', 'sites', 'are', 'good', 'quantum', 'numbers', 'for', 'ut0', 'in', 'contrast', 'to', 'often', 'less', 'controllable', 'numerical', 'studies', 'the', 'use', 'of', 'such', 'a', 'representation', 'reveals', 'the', 'carriers', 'that', 'couple', 'to', 'the', 'charge', 'probes', 'and', 'provides', 'useful', 'physical', 'information', 'on', 'the', 'microscopic', 'processes', 'behind', 'the', 'exotic', 'charge', 'transport', 'properties', 'of', 'the', '1d', 'electronic', 'correlated', 'system', 'under', 'study']]
|
[-0.14414631852090265, 0.21487057214479535, -0.036686030018068694, 0.05696531601263925, 0.01441577583048414, -0.16372115952886232, 0.10224239745340408, 0.3447204256776076, -0.266655981295078, -0.24123436736752463, 0.042912918583584266, -0.342670595886398, -0.08048762490320557, 0.14352282560391172, 0.02593426887370363, 0.010506901394905923, 0.0009212339206555473, 0.052155821402296854, -0.1022500389418663, -0.19114510245416863, 0.28081905286177555, 0.043643255005315545, 0.28706049396683964, 0.13820669315986234, 0.08796843900915062, 0.02027424536979431, 0.0651091752880359, 0.028286890005928617, -0.16228927747223168, 0.03265715438723004, 0.23349149933847194, -0.036884039662039604, 0.23131023700651615, -0.4225615901314508, -0.20027439908482103, 0.06724376094680798, 0.17033165106785636, 0.12281444832586333, -0.05094899065750317, -0.1973832210698774, 0.05970910606597096, -0.15538701456224838, -0.17822671611498617, -0.07586479894541802, 0.04597085504203186, 0.014596632945072298, -0.24269889040068107, 0.1548567112527379, 0.07041876326597056, 0.051058016629876836, -0.07267249745752992, -0.14750114279133092, -0.06249838338316053, 0.13270976007346236, 0.058962450228643284, 0.031613942384543015, 0.1344217931388048, -0.11836257740120376, -0.06720435372966377, 0.34908102727829154, -0.07856886756934524, -0.1929005368608777, 0.19544838783861715, -0.1751434767111853, -0.08640534004377287, 0.15062848207939175, 0.08121863276890984, 0.10777796506056492, -0.12195503891677545, 0.12422750140653278, -0.027669504385064297, 0.16353529261794522, 0.045184175715976264, 0.08125737858376218, 0.2508339148706399, 0.1767331029795393, 0.08927163057999866, 0.10737599114266534, -0.08599073451183312, -0.11838338653879232, -0.28723928412886235, -0.15275510112467156, -0.24945199779698524, 0.09854278161253324, -0.08693249615537786, -0.1967143797893313, 0.3419046275458614, 0.1727528577603651, 0.20098308194625164, 0.0004337462601507326, 0.2523903501365444, 0.1315983367805322, 0.01697762990527578, 0.0857732952159794, 0.19813430162720413, 0.1609146281239824, 0.10394340797763647, -0.28114782220129914, 0.027789471422436055, 0.0677402717442515]
|
1,803.09565
|
SIG-DB: leveraging homomorphic encryption to Securely Interrogate
privately held Genomic DataBases
|
Genomic data are becoming increasingly valuable as we develop methods to
utilize the information at scale and gain a greater understanding of how
genetic information relates to biological function. Advances in synthetic
biology and the decreased cost of sequencing are increasing the amount of
privately held genomic data. As the quantity and value of private genomic data
grows, so does the incentive to acquire and protect such data, which creates a
need to store and process these data securely. We present an algorithm for the
Secure Interrogation of Genomic DataBases (SIG-DB). The SIG-DB algorithm
enables databases of genomic sequences to be searched with an encrypted query
sequence without revealing the query sequence to the Database Owner or any of
the database sequences to the Querier. SIG-DB is the first application of its
kind to take advantage of locality-sensitive hashing and homomorphic encryption
to allow generalized sequence-to-sequence comparisons of genomic data.
|
q-bio.QM cs.CR cs.DB q-bio.GN
|
genomic data are becoming increasingly valuable as we develop methods to utilize the information at scale and gain a greater understanding of how genetic information relates to biological function advances in synthetic biology and the decreased cost of sequencing are increasing the amount of privately held genomic data as the quantity and value of private genomic data grows so does the incentive to acquire and protect such data which creates a need to store and process these data securely we present an algorithm for the secure interrogation of genomic databases sigdb the sigdb algorithm enables databases of genomic sequences to be searched with an encrypted query sequence without revealing the query sequence to the database owner or any of the database sequences to the querier sigdb is the first application of its kind to take advantage of localitysensitive hashing and homomorphic encryption to allow generalized sequencetosequence comparisons of genomic data
|
[['genomic', 'data', 'are', 'becoming', 'increasingly', 'valuable', 'as', 'we', 'develop', 'methods', 'to', 'utilize', 'the', 'information', 'at', 'scale', 'and', 'gain', 'a', 'greater', 'understanding', 'of', 'how', 'genetic', 'information', 'relates', 'to', 'biological', 'function', 'advances', 'in', 'synthetic', 'biology', 'and', 'the', 'decreased', 'cost', 'of', 'sequencing', 'are', 'increasing', 'the', 'amount', 'of', 'privately', 'held', 'genomic', 'data', 'as', 'the', 'quantity', 'and', 'value', 'of', 'private', 'genomic', 'data', 'grows', 'so', 'does', 'the', 'incentive', 'to', 'acquire', 'and', 'protect', 'such', 'data', 'which', 'creates', 'a', 'need', 'to', 'store', 'and', 'process', 'these', 'data', 'securely', 'we', 'present', 'an', 'algorithm', 'for', 'the', 'secure', 'interrogation', 'of', 'genomic', 'databases', 'sigdb', 'the', 'sigdb', 'algorithm', 'enables', 'databases', 'of', 'genomic', 'sequences', 'to', 'be', 'searched', 'with', 'an', 'encrypted', 'query', 'sequence', 'without', 'revealing', 'the', 'query', 'sequence', 'to', 'the', 'database', 'owner', 'or', 'any', 'of', 'the', 'database', 'sequences', 'to', 'the', 'querier', 'sigdb', 'is', 'the', 'first', 'application', 'of', 'its', 'kind', 'to', 'take', 'advantage', 'of', 'localitysensitive', 'hashing', 'and', 'homomorphic', 'encryption', 'to', 'allow', 'generalized', 'sequencetosequence', 'comparisons', 'of', 'genomic', 'data']]
|
[-0.09976907738786395, 0.018098243085551077, -0.07286663823140165, 0.09261493887409111, -0.12015389058738947, -0.17158764292641232, 0.1054425960034132, 0.3835988926390807, -0.36253994847647847, -0.3347493918527228, 0.11831194025386746, -0.32326733416877684, -0.09768915493196498, 0.19411373093569032, -0.12414976293531557, 0.08583333331587104, 0.08511315448209643, 0.047934830364150305, 0.0439974137810835, -0.3030101330531761, 0.28913895898576203, 0.08246118024534856, 0.30420903319027276, 0.014851841752727827, 0.07805015185071776, 0.0011471001151949168, -0.09711085676836471, -0.07689516432583332, -0.09409330122793715, 0.20412082575882476, 0.3459278241917491, 0.3070414644386619, 0.3233716994151473, -0.4405244657956064, -0.14293003796172948, 0.15939810778790464, 0.17169130163888136, 0.17159832950914278, -0.08056738990359008, -0.2779807503769795, 0.10671374831581489, -0.12923902058042586, -0.020070043934198718, -0.14597798799009373, 0.00955553348059766, 0.021098539077987272, -0.32070138308452445, 0.013962535647054514, -0.013902905738602082, 0.11636094466627886, -0.022293601654625187, -0.08108863538752, -0.02475545653452476, 0.2314425623556599, 0.0487336093224197, 0.08188451561921586, 0.15130436060329278, -0.0978143955891331, -0.14234125696821137, 0.3588816715994229, -0.01227235017499576, -0.14276913395151497, 0.13392979435700303, -0.07005495422209303, -0.15807070363002518, 0.11752824599980764, 0.19295051970829566, 0.055670529982695977, -0.17372317399829626, 0.038279392082088935, 0.022747067060942452, 0.26249986759076516, 0.06142566616569335, 0.09713523276732303, 0.17301703717714798, 0.1679062641784549, 0.038874224165144064, 0.1365926496211129, -0.11766677860170603, -0.0926826178903381, -0.1621578769874759, -0.17961201641087732, -0.2161208875104785, 0.00011672149412333965, -0.12201086965331343, -0.19720713634354373, 0.3143415082680682, 0.21105834241956473, 0.18670933065004647, 0.06948802732940142, 0.3333448222031196, -0.011122907017124817, 0.1732719884708058, 0.05554629254154861, 0.07579185123555363, 0.021794402135225634, 0.15031917704967782, -0.17385013833797228, 0.14676293657471737, -0.017592542755107084]
|
1,803.09566
|
BoSy: An Experimentation Framework for Bounded Synthesis
|
We present BoSy, a reactive synthesis tool based on the bounded synthesis
approach. Bounded synthesis ensures the minimality of the synthesized
implementation by incrementally increasing a bound on the size of the solutions
it considers. For each bound, the existence of a solution is encoded as a
logical constraint solving problem that is solved by an appropriate solver.
BoSy constructs bounded synthesis encodings into SAT, QBF, DQBF, EPR, and SMT,
and interfaces to solvers of the corresponding type. When supported by the
solver, BoSy extracts solutions as circuits, which can, if desired, be verified
with standard hardware model checkers. BoSy won the LTL synthesis track at
SYNTCOMP 2016. In addition to its use as a synthesis tool, BoSy can also be
used as an experimentation and performance evaluation framework for various
types of satisfiability solvers.
|
cs.LO
|
we present bosy a reactive synthesis tool based on the bounded synthesis approach bounded synthesis ensures the minimality of the synthesized implementation by incrementally increasing a bound on the size of the solutions it considers for each bound the existence of a solution is encoded as a logical constraint solving problem that is solved by an appropriate solver bosy constructs bounded synthesis encodings into sat qbf dqbf epr and smt and interfaces to solvers of the corresponding type when supported by the solver bosy extracts solutions as circuits which can if desired be verified with standard hardware model checkers bosy won the ltl synthesis track at syntcomp 2016 in addition to its use as a synthesis tool bosy can also be used as an experimentation and performance evaluation framework for various types of satisfiability solvers
|
[['we', 'present', 'bosy', 'a', 'reactive', 'synthesis', 'tool', 'based', 'on', 'the', 'bounded', 'synthesis', 'approach', 'bounded', 'synthesis', 'ensures', 'the', 'minimality', 'of', 'the', 'synthesized', 'implementation', 'by', 'incrementally', 'increasing', 'a', 'bound', 'on', 'the', 'size', 'of', 'the', 'solutions', 'it', 'considers', 'for', 'each', 'bound', 'the', 'existence', 'of', 'a', 'solution', 'is', 'encoded', 'as', 'a', 'logical', 'constraint', 'solving', 'problem', 'that', 'is', 'solved', 'by', 'an', 'appropriate', 'solver', 'bosy', 'constructs', 'bounded', 'synthesis', 'encodings', 'into', 'sat', 'qbf', 'dqbf', 'epr', 'and', 'smt', 'and', 'interfaces', 'to', 'solvers', 'of', 'the', 'corresponding', 'type', 'when', 'supported', 'by', 'the', 'solver', 'bosy', 'extracts', 'solutions', 'as', 'circuits', 'which', 'can', 'if', 'desired', 'be', 'verified', 'with', 'standard', 'hardware', 'model', 'checkers', 'bosy', 'won', 'the', 'ltl', 'synthesis', 'track', 'at', 'syntcomp', '2016', 'in', 'addition', 'to', 'its', 'use', 'as', 'a', 'synthesis', 'tool', 'bosy', 'can', 'also', 'be', 'used', 'as', 'an', 'experimentation', 'and', 'performance', 'evaluation', 'framework', 'for', 'various', 'types', 'of', 'satisfiability', 'solvers']]
|
[-0.05478579391621881, 0.015100784262823354, -0.075340129647197, 0.0470062214622481, -0.09923223998328602, -0.2004767025579457, 0.04168439206529271, 0.3513060223794094, -0.30540261689909837, -0.36185323900922584, 0.16232133134423446, -0.2230938259581173, -0.10068242395710614, 0.24219359777074445, -0.03718302006384841, 0.1292948473516541, 0.0832215907914495, -0.0250228152644855, -0.0722766079681201, -0.2250341467714558, 0.2470895986386663, 0.0007845094341232821, 0.25878089449230446, 0.04433092451136973, 0.11522414438702443, -0.006874523883258613, 0.05267211518043445, 0.04299359986282609, -0.0640771406946846, 0.13862202536676907, 0.29657517390118704, 0.26603426882928166, 0.28551925528380606, -0.4477272236788714, -0.14090228778896507, 0.04532338708501171, 0.12195198975882872, 0.11936837239880804, -0.08562124291676339, -0.309404450704999, 0.11609982038261714, -0.15333757110078025, -0.06957481378620421, -0.09804569408987407, -0.005830622802454013, 0.013062309191553613, -0.2594050850995161, -0.06987039722282336, 0.11848761312387608, 0.04150915951640518, -0.09491814052151447, -0.13356725328981325, -0.00958671458841612, 0.08730290871204084, -0.05234587707608524, 0.013092960734610205, 0.10851760748601347, -0.08819401638789309, -0.17697851088380925, 0.364940033963433, -0.07353114566110351, -0.24058168527014828, 0.14558928586042452, 0.048604108296610694, -0.146578456847756, 0.09662499027326703, 0.16252740306124366, 0.17588186902511452, -0.1417975212263021, 0.1263198127922671, -0.054907723721461715, 0.29222259798121675, 0.07434411638726791, -0.028805779301802868, 0.17091469338370693, 0.23845504935382417, 0.07048611281508649, 0.21021656039239908, 0.02723741916663669, -0.07159242890430269, -0.2622209820482466, -0.1451442877770643, -0.1610512415188606, -0.018770830364276965, -0.054893011373523794, -0.1825647096598038, 0.3705089333294718, 0.15948981691013883, 0.08691746653919971, 0.1472312137424187, 0.332971083248655, 0.15775748815870397, 0.0816637759545335, 0.07551538160208751, 0.14246851859131346, 0.0960205510534622, 0.10273328239995021, -0.24156770321919963, 0.15007930331415048, 0.12641318656118258]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.