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 |
|---|---|---|---|---|---|---|
710.4753 | Verifying Safety-Critical Timing and Memory-Usage Properties of Embedded
Software by Abstract Interpretation | Static program analysis by abstract interpretation is an efficient method to
determine properties of embedded software. One example is value analysis, which
determines the values stored in the processor registers. Its results are used
as input to more advanced analyses, which ultimately yield information about
the stack usage and the timing behavior of embedded software.
| cs.LO | static program analysis by abstract interpretation is an efficient method to determine properties of embedded software one example is value analysis which determines the values stored in the processor registers its results are used as input to more advanced analyses which ultimately yield information about the stack usage and the timing behavior of embedded software | [['static', 'program', 'analysis', 'by', 'abstract', 'interpretation', 'is', 'an', 'efficient', 'method', 'to', 'determine', 'properties', 'of', 'embedded', 'software', 'one', 'example', 'is', 'value', 'analysis', 'which', 'determines', 'the', 'values', 'stored', 'in', 'the', 'processor', 'registers', 'its', 'results', 'are', 'used', 'as', 'input', 'to', 'more', 'advanced', 'analyses', 'which', 'ultimately', 'yield', 'information', 'about', 'the', 'stack', 'usage', 'and', 'the', 'timing', 'behavior', 'of', 'embedded', 'software']] | [-0.12137309796049853, 0.010990788773051463, -0.12843050426718863, 0.08476812535134906, -0.11384805877777664, -0.15024283748299985, 0.007929559475318952, 0.3787312115457925, -0.26278509365564046, -0.40239742618392815, 0.19363591107751496, -0.25870270236310633, -0.10248214171522042, 0.26021450643681665, -0.03030882315202193, 0.041187033350632354, 0.1081380160017447, 0.06589029873297973, -0.04873133673628961, -0.21256964245641774, 0.2385886947201057, 0.08862830301408063, 0.29290692415511743, -0.009595899673348124, 0.018565206839279695, 0.044768254171040925, -0.04229584683410146, -0.009339173815467141, -0.10585214724256234, 0.17977363478223032, 0.3087179138621485, 0.24156741672618823, 0.24409589644690807, -0.4248011990026994, -0.16551292338831858, 0.054818554476580836, 0.11015858875418251, 0.07904478562149135, -0.003235641720080325, -0.2529630651528185, 0.11813786432824351, -0.14495636855082755, -0.15174660813063384, -0.10161991992076351, 0.003747824528677897, -0.005072101734747941, -0.2026039041240107, -0.0331613865850324, 0.05213344134390354, 0.03997094942764803, -0.054966373134150426, -0.09276348288932984, -0.023878111123022707, 0.1809496961872686, -0.015542628309181468, 0.024588167419741777, 0.22317769369957122, -0.11019533665173432, -0.12116326838731765, 0.33670993240719493, -0.01781992039389231, -0.18005484720184045, 0.13558870146728375, -0.031302663760090416, -0.12445497207174247, 0.14410706366073678, 0.18510743625123394, 0.0776668005707589, -0.16880201610990547, 0.035128335052550856, 0.03248880143192681, 0.293744455921379, 0.025473269913345576, 0.07759077821604231, 0.20227901124480097, 0.20168779192661698, 0.017447452027012002, 0.17039189781062306, -0.014849492585794492, -0.11875277068465948, -0.279691327160055, -0.1659137825396928, -0.14391834971240974, 0.025894405146722088, -0.08106851769076787, -0.18481899797916412, 0.3628498299216682, 0.18018586073409426, 0.13500935624099591, -0.01147898137146099, 0.366490984369408, 0.11086755038281394, 0.10928817339749498, 0.10151424981992353, 0.1381642494012009, 0.09629470201801847, 0.1305342258292843, -0.18626351439478722, 0.11808316180990501, 0.040351858752017675] |
710.4754 | Design of a Virtual Component Neutral Network-on-Chip Transaction Layer | Research studies have demonstrated the feasibility and advantages of
Network-on-Chip (NoC) over traditional bus-based architectures but have not
focused on compatibility communication standards. This paper describes a number
of issues faced when designing a VC-neutral NoC, i.e. compatible with standards
such as AHB 2.0, AXI, VCI, OCP, and various other proprietary protocols, and
how a layered approach to communication helps solve these issues.
| cs.AR | research studies have demonstrated the feasibility and advantages of networkonchip noc over traditional busbased architectures but have not focused on compatibility communication standards this paper describes a number of issues faced when designing a vcneutral noc ie compatible with standards such as ahb 20 axi vci ocp and various other proprietary protocols and how a layered approach to communication helps solve these issues | [['research', 'studies', 'have', 'demonstrated', 'the', 'feasibility', 'and', 'advantages', 'of', 'networkonchip', 'noc', 'over', 'traditional', 'busbased', 'architectures', 'but', 'have', 'not', 'focused', 'on', 'compatibility', 'communication', 'standards', 'this', 'paper', 'describes', 'a', 'number', 'of', 'issues', 'faced', 'when', 'designing', 'a', 'vcneutral', 'noc', 'ie', 'compatible', 'with', 'standards', 'such', 'as', 'ahb', '20', 'axi', 'vci', 'ocp', 'and', 'various', 'other', 'proprietary', 'protocols', 'and', 'how', 'a', 'layered', 'approach', 'to', 'communication', 'helps', 'solve', 'these', 'issues']] | [-0.2002977900199532, -0.008009659336699594, 0.006721903431049037, -0.007127575578183056, -0.1122735969181503, -0.263763852755449, 0.06417133083995132, 0.41971635214623904, -0.26308728409029786, -0.35728585987441963, 0.12926181093338998, -0.24994298163801432, -0.16903272733813332, 0.2660845488970799, -0.1299700542379381, 0.13730531214405933, 0.06789575790565822, -0.05636609442186572, -0.05634878849941156, -0.26783943263393256, 0.2912598844737776, 0.05950223168944039, 0.3931119021388792, 0.07803864472155128, 0.06406839962507929, -0.05340351792983711, -0.026552965023344564, 0.020009082696971395, -0.08258117935169608, 0.15201890615055397, 0.33815138961278624, 0.20556737181370058, 0.36846531331989796, -0.46362501442913084, -0.25069507339128083, 0.04145116262858914, 0.17385186198272654, 0.028462489811523307, -0.07954242417221277, -0.2317816684803655, 0.09827684779320994, -0.2487062911593145, -0.07902081430168642, -0.061187768212309285, -0.04370327137650982, 0.04864692375544579, -0.17593474095056374, -0.10016376329886337, 0.00016084610815009763, 0.09231782292256192, 0.006698511582198402, -0.1307445830860806, 0.06633769493782893, 0.11975317993511131, 0.004777984949009073, 0.004071748327283609, 0.11599768285128859, -0.1214303747833436, -0.19164159123958538, 0.40349123273195037, 0.037070451552168496, -0.19654276973057178, 0.1954109001409022, 0.060729768217330976, -0.16620995433280064, 0.01601411372933897, 0.16841386779842357, 0.04373097657826879, -0.16283363395585534, 0.08837218888783677, 0.03626329939429378, 0.19159443123686698, 0.06648896627068039, 0.08886893461608598, 0.1818570722224972, 0.246340028937876, 0.05207800286100997, 0.08198908536278102, -0.027680699214068873, -0.1276037238853713, -0.15194275757418044, -0.1225915084716924, -0.10431619036582208, -0.012896249832861471, 0.0015127587725029088, -0.16065123471085943, 0.37512225818429745, 0.20978571786995856, 0.10342318841045903, 0.05833874226382543, 0.4065020312404921, -0.018093439316632407, 0.1494656202745729, 0.11214923389977025, 0.17916404849459086, 0.07183842285866698, 0.1917420859700219, -0.16785241429123185, 0.0812854804549246, -0.05561045666916236] |
710.4755 | Model Reuse through Hardware Design Patterns | Increasing reuse opportunities is a well-known problem for software designers
as well as for hardware designers. Nonetheless, current software and hardware
engineering practices have embraced different approaches to this problem.
Software designs are usually modelled after a set of proven solutions to
recurrent problems called design patterns. This approach differs from the
component-based reuse usually found in hardware designs: design patterns do not
specify unnecessary implementation details. Several authors have already
proposed translating structural design patterns concepts to hardware design. In
this paper we extend the discussion to behavioural design patterns.
Specifically, we describe how the hardware version of the Iterator can be used
to enhance model reuse.
| cs.SE | increasing reuse opportunities is a wellknown problem for software designers as well as for hardware designers nonetheless current software and hardware engineering practices have embraced different approaches to this problem software designs are usually modelled after a set of proven solutions to recurrent problems called design patterns this approach differs from the componentbased reuse usually found in hardware designs design patterns do not specify unnecessary implementation details several authors have already proposed translating structural design patterns concepts to hardware design in this paper we extend the discussion to behavioural design patterns specifically we describe how the hardware version of the iterator can be used to enhance model reuse | [['increasing', 'reuse', 'opportunities', 'is', 'a', 'wellknown', 'problem', 'for', 'software', 'designers', 'as', 'well', 'as', 'for', 'hardware', 'designers', 'nonetheless', 'current', 'software', 'and', 'hardware', 'engineering', 'practices', 'have', 'embraced', 'different', 'approaches', 'to', 'this', 'problem', 'software', 'designs', 'are', 'usually', 'modelled', 'after', 'a', 'set', 'of', 'proven', 'solutions', 'to', 'recurrent', 'problems', 'called', 'design', 'patterns', 'this', 'approach', 'differs', 'from', 'the', 'componentbased', 'reuse', 'usually', 'found', 'in', 'hardware', 'designs', 'design', 'patterns', 'do', 'not', 'specify', 'unnecessary', 'implementation', 'details', 'several', 'authors', 'have', 'already', 'proposed', 'translating', 'structural', 'design', 'patterns', 'concepts', 'to', 'hardware', 'design', 'in', 'this', 'paper', 'we', 'extend', 'the', 'discussion', 'to', 'behavioural', 'design', 'patterns', 'specifically', 'we', 'describe', 'how', 'the', 'hardware', 'version', 'of', 'the', 'iterator', 'can', 'be', 'used', 'to', 'enhance', 'model', 'reuse']] | [-0.11177044894753231, 0.00866239352358712, -0.0695279133053393, 0.07332322892465594, -0.19194450060388557, -0.21361063780528233, 0.013811008669479095, 0.4354912330637927, -0.29481811907694294, -0.34623074459118974, 0.1251475769979017, -0.1928658155138018, -0.23922232598178433, 0.2287064260119762, -0.16896512211490147, 0.10027453883473451, 0.06359148412054681, -0.07542617287469545, -0.08647707962706962, -0.24656719107318809, 0.2544869952576442, 0.08756272783244236, 0.3573104289049904, 0.025768625912153058, 0.005910528503052235, -0.039775501940985794, -0.03397650916250078, -0.023755557938582368, -0.10380762525730663, 0.1319228353052124, 0.3909100365859491, 0.28199376314478286, 0.3450508879635621, -0.4657458017970418, -0.20435589961535125, 0.06487262246405913, 0.17563462676049243, 0.09860380720002232, -0.018461100916654146, -0.26339556914064344, 0.1030134949574454, -0.23457871684675208, -0.12442528147302154, -0.1118325715042711, -0.06899481582351857, 0.015689519007326926, -0.20497302273051227, -0.12951005879720603, 0.06597012311707388, 0.08292544725420023, -0.009157945916134244, -0.12751764492390472, 0.055022362222964014, 0.16498682319393587, 0.034919701453031006, -0.00555404801680534, 0.17005492843842754, -0.07577879614136354, -0.2012156380083912, 0.3759961389695053, 0.08868468560588856, -0.26447620344589706, 0.19640775976693947, 0.020153508323279244, -0.18056207325275023, 0.07871888198510364, 0.23223037766810092, 0.015505436100755577, -0.2408654038725352, 0.0504257023605061, 0.0636520325033753, 0.2171011396545779, 0.08094066507355482, 0.029580760913193917, 0.1789457048030777, 0.23147207552015228, 0.04902991128835344, 0.16699843910518447, 0.039789223940008216, -0.08638295427792603, -0.21873822979331534, -0.09037107506473721, -0.11953637106516571, -0.01778432624875374, -0.014033781329931959, -0.1808164966755107, 0.4028391980445357, 0.23200978956581955, 0.07146164682624792, 0.07128378509164408, 0.3673330841799422, 0.024658838775428227, 0.1456100458895822, 0.09434831584588176, 0.15297172306088247, 0.00028323350232784396, 0.2119956485133756, -0.1577186799215808, 0.12234032766126027, 0.0004969854442741187] |
710.4756 | Design Method for Constant Power Consumption of Differential Logic
Circuits | Side channel attacks are a major security concern for smart cards and other
embedded devices. They analyze the variations on the power consumption to find
the secret key of the encryption algorithm implemented within the security IC.
To address this issue, logic gates that have a constant power dissipation
independent of the input signals, are used in security ICs. This paper presents
a design methodology to create fully connected differential pull down networks.
Fully connected differential pull down networks are transistor networks that
for any complementary input combination connect all the internal nodes of the
network to one of the external nodes of the network. They are memoryless and
for that reason have a constant load capacitance and power consumption. This
type of networks is used in specialized logic gates to guarantee a constant
contribution of the internal nodes into the total power consumption of the
logic gate.
| cs.CR | side channel attacks are a major security concern for smart cards and other embedded devices they analyze the variations on the power consumption to find the secret key of the encryption algorithm implemented within the security ic to address this issue logic gates that have a constant power dissipation independent of the input signals are used in security ics this paper presents a design methodology to create fully connected differential pull down networks fully connected differential pull down networks are transistor networks that for any complementary input combination connect all the internal nodes of the network to one of the external nodes of the network they are memoryless and for that reason have a constant load capacitance and power consumption this type of networks is used in specialized logic gates to guarantee a constant contribution of the internal nodes into the total power consumption of the logic gate | [['side', 'channel', 'attacks', 'are', 'a', 'major', 'security', 'concern', 'for', 'smart', 'cards', 'and', 'other', 'embedded', 'devices', 'they', 'analyze', 'the', 'variations', 'on', 'the', 'power', 'consumption', 'to', 'find', 'the', 'secret', 'key', 'of', 'the', 'encryption', 'algorithm', 'implemented', 'within', 'the', 'security', 'ic', 'to', 'address', 'this', 'issue', 'logic', 'gates', 'that', 'have', 'a', 'constant', 'power', 'dissipation', 'independent', 'of', 'the', 'input', 'signals', 'are', 'used', 'in', 'security', 'ics', 'this', 'paper', 'presents', 'a', 'design', 'methodology', 'to', 'create', 'fully', 'connected', 'differential', 'pull', 'down', 'networks', 'fully', 'connected', 'differential', 'pull', 'down', 'networks', 'are', 'transistor', 'networks', 'that', 'for', 'any', 'complementary', 'input', 'combination', 'connect', 'all', 'the', 'internal', 'nodes', 'of', 'the', 'network', 'to', 'one', 'of', 'the', 'external', 'nodes', 'of', 'the', 'network', 'they', 'are', 'memoryless', 'and', 'for', 'that', 'reason', 'have', 'a', 'constant', 'load', 'capacitance', 'and', 'power', 'consumption', 'this', 'type', 'of', 'networks', 'is', 'used', 'in', 'specialized', 'logic', 'gates', 'to', 'guarantee', 'a', 'constant', 'contribution', 'of', 'the', 'internal', 'nodes', 'into', 'the', 'total', 'power', 'consumption', 'of', 'the', 'logic', 'gate']] | [-0.22475555034808978, 0.020980021161203448, -0.020835137133159348, 0.03822447176915719, -0.07183984636228431, -0.2474309100008041, 0.08395867670234922, 0.3709475238574669, -0.31684844876715057, -0.31608793781315153, 0.08862910832976922, -0.26372708326104927, -0.11501224782645099, 0.18903703032678143, -0.1277489514118438, 0.07151669371759871, 0.010009389203922773, 0.029821246472262853, 0.03856238444092702, -0.2856798755835641, 0.3118015192952511, 0.041522914801749425, 0.32000626592166925, 0.019122987003946625, 0.08417391926962631, -0.04527752937566539, -0.007569832141303482, -0.0037586487238956113, -0.05861724534686898, 0.1269823073683231, 0.3053382464332154, 0.13170129993832724, 0.29636915345405657, -0.4993354126282439, -0.21436060877592378, 0.09010484472319887, 0.10766199662828364, 0.09438216851118046, -0.02296639114659204, -0.23709809718452193, 0.12314777778511918, -0.22478240105241687, -0.04285230820302811, -0.0503986814827029, 0.002063882675625988, 0.06354580403343346, -0.22283373040625373, -0.026123888180213602, 0.0631519526689993, 0.00017364521359873784, 0.013476358410706461, -0.07275481294522793, -0.015420044067542295, 0.18556376689780704, -0.04550051638176916, -0.0037344818481722395, 0.1968464242558725, -0.12662316444235527, -0.15250725234776885, 0.3252530767192208, 0.021469801536924835, -0.19174508037080207, 0.09567842995032128, -0.03044931309901782, -0.1437362413774748, 0.10254338369201366, 0.256636671252341, 0.03636060138484715, -0.1860869761015213, 0.03555334972357692, 0.030412139081572358, 0.23032082184343725, 0.060792649687091645, 0.07892868030703047, 0.1835702347153848, 0.1848895741230179, 0.10647875669324217, 0.1411020690579175, -0.06104174320353195, -0.09198884260400224, -0.28594529981893246, -0.15023307129111443, -0.16443224211075544, 0.04477321971962984, -0.07678748868263052, -0.13233524251641152, 0.3981363198663284, 0.1579764092929435, 0.15239526983350515, 0.09352805877003718, 0.41294120403157697, 0.10002125489385484, 0.15144606279303646, 0.13495531445683762, 0.20745163793499405, 0.1465118864985384, 0.1546664184519417, -0.17592671144804037, 0.12056827199695683, -0.03012496858640146] |
710.4757 | Techniques for Fast Transient Fault Grading Based on Autonomous
Emulation | Very deep submicron and nanometer technologies have increased notably
integrated circuit (IC) sensitiveness to radiation. Soft errors are currently
appearing into ICs working at earth surface. Hardened circuits are currently
required in many applications where Fault Tolerance (FT) was not a requirement
in the very near past. The use of platform FPGAs for the emulation of
single-event upset effects (SEU) is gaining attention in order to speed up the
FT evaluation. In this work, a new emulation system for FT evaluation with
respect to SEU effects is proposed, providing shorter evaluation times by
performing all the evaluation process in the FPGA and avoiding emulator-host
communication bottlenecks.
| cs.AR | very deep submicron and nanometer technologies have increased notably integrated circuit ic sensitiveness to radiation soft errors are currently appearing into ics working at earth surface hardened circuits are currently required in many applications where fault tolerance ft was not a requirement in the very near past the use of platform fpgas for the emulation of singleevent upset effects seu is gaining attention in order to speed up the ft evaluation in this work a new emulation system for ft evaluation with respect to seu effects is proposed providing shorter evaluation times by performing all the evaluation process in the fpga and avoiding emulatorhost communication bottlenecks | [['very', 'deep', 'submicron', 'and', 'nanometer', 'technologies', 'have', 'increased', 'notably', 'integrated', 'circuit', 'ic', 'sensitiveness', 'to', 'radiation', 'soft', 'errors', 'are', 'currently', 'appearing', 'into', 'ics', 'working', 'at', 'earth', 'surface', 'hardened', 'circuits', 'are', 'currently', 'required', 'in', 'many', 'applications', 'where', 'fault', 'tolerance', 'ft', 'was', 'not', 'a', 'requirement', 'in', 'the', 'very', 'near', 'past', 'the', 'use', 'of', 'platform', 'fpgas', 'for', 'the', 'emulation', 'of', 'singleevent', 'upset', 'effects', 'seu', 'is', 'gaining', 'attention', 'in', 'order', 'to', 'speed', 'up', 'the', 'ft', 'evaluation', 'in', 'this', 'work', 'a', 'new', 'emulation', 'system', 'for', 'ft', 'evaluation', 'with', 'respect', 'to', 'seu', 'effects', 'is', 'proposed', 'providing', 'shorter', 'evaluation', 'times', 'by', 'performing', 'all', 'the', 'evaluation', 'process', 'in', 'the', 'fpga', 'and', 'avoiding', 'emulatorhost', 'communication', 'bottlenecks']] | [-0.14110845589034615, 0.09890361911218082, -0.027972398986596436, 0.031264213259263283, -0.053229554423264096, -0.17619556397909208, 0.02457586456799791, 0.402015620062039, -0.18526529482166681, -0.34848367969028743, 0.12363120463588054, -0.25635331333614886, -0.10798074790232239, 0.27515191669088035, -0.08882169363399346, 0.13074004222594557, 0.051285698019672143, -0.012792248644733004, -0.040691460822043675, -0.2550085651189355, 0.18908043299313812, 0.1363415273413661, 0.29620881823911555, 0.05598536827823236, 0.06562532236622202, -0.04271733608939463, -0.0022769383110460783, -0.04115106970337885, -0.0642011669575281, 0.09208977906299488, 0.2928914274754269, 0.12004036672768138, 0.2746983305340455, -0.4891575864028363, -0.22011134240421512, 0.07600263122336141, 0.12633422321773002, 0.06688709871932155, -0.04402566915821461, -0.2713850946032575, 0.10501800818989675, -0.2022285479431351, -0.06313330277889258, -0.04619939087493722, 0.04167972886103338, -0.02316158108768009, -0.23816262925753282, -0.01290524463124928, 0.03138605926686155, 0.07627155021542595, 0.005433192880203327, -0.09535605391886617, 0.07077072680085188, 0.11518583452062947, 0.013145755004924944, 0.05810410279359314, 0.20006586483546665, -0.14042904908946227, -0.11738893563548723, 0.3707374432789428, -0.017568127388533736, -0.15667051639230478, 0.17014918793436318, -0.09761082202839177, -0.12358145351033835, 0.1533231992097128, 0.18530707126926807, 0.03582175651653891, -0.19956300342233763, 0.09489408674361628, 0.13898216208354347, 0.17256912621004242, 0.11340759704443848, 0.08557478373958952, 0.19621808629128196, 0.2653734174157892, 0.018758771029145766, 0.1266710613188999, -0.08937625512480736, -0.09279276655454721, -0.27309003408466065, -0.15870222490990446, -0.13610100909025363, 0.012462051807198718, -0.05138925524467292, -0.15677502282584707, 0.3357198697381786, 0.20205193663769888, 0.10840998582896733, 0.0587730099682674, 0.3685700024123348, 0.0705482680794029, 0.1614406807215086, 0.07967985047559653, 0.23110919684792558, 0.045177060660595694, 0.13964703076829513, -0.18070207518037587, 0.10507553259265565, -0.05575553819182373] |
710.4758 | Exploiting Dynamic Workload Variation in Low Energy Preemptive Task
Scheduling | A novel energy reduction strategy to maximally exploit the dynamic workload
variation is proposed for the offline voltage scheduling of preemptive systems.
The idea is to construct a fully-preemptive schedule that leads to minimum
energy consumption when the tasks take on approximately the average execution
cycles yet still guarantees no deadline violation during the worst-case
scenario. End-time for each sub-instance of the tasks obtained from the
schedule is used for the on-line dynamic voltage scaling (DVS) of the tasks.
For the tasks that normally require a small number of cycles but occasionally a
large number of cycles to complete, such a schedule provides more opportunities
for slack utilization and hence results in larger energy saving. The concept is
realized by formulating the problem as a Non-Linear Programming (NLP)
optimization problem. Experimental results show that, by using the proposed
scheme, the total energy consumption at runtime is reduced by as high as 60%
for randomly generated task sets when comparing with the static scheduling
approach only using worst case workload.
| cs.OH | a novel energy reduction strategy to maximally exploit the dynamic workload variation is proposed for the offline voltage scheduling of preemptive systems the idea is to construct a fullypreemptive schedule that leads to minimum energy consumption when the tasks take on approximately the average execution cycles yet still guarantees no deadline violation during the worstcase scenario endtime for each subinstance of the tasks obtained from the schedule is used for the online dynamic voltage scaling dvs of the tasks for the tasks that normally require a small number of cycles but occasionally a large number of cycles to complete such a schedule provides more opportunities for slack utilization and hence results in larger energy saving the concept is realized by formulating the problem as a nonlinear programming nlp optimization problem experimental results show that by using the proposed scheme the total energy consumption at runtime is reduced by as high as 60 for randomly generated task sets when comparing with the static scheduling approach only using worst case workload | [['a', 'novel', 'energy', 'reduction', 'strategy', 'to', 'maximally', 'exploit', 'the', 'dynamic', 'workload', 'variation', 'is', 'proposed', 'for', 'the', 'offline', 'voltage', 'scheduling', 'of', 'preemptive', 'systems', 'the', 'idea', 'is', 'to', 'construct', 'a', 'fullypreemptive', 'schedule', 'that', 'leads', 'to', 'minimum', 'energy', 'consumption', 'when', 'the', 'tasks', 'take', 'on', 'approximately', 'the', 'average', 'execution', 'cycles', 'yet', 'still', 'guarantees', 'no', 'deadline', 'violation', 'during', 'the', 'worstcase', 'scenario', 'endtime', 'for', 'each', 'subinstance', 'of', 'the', 'tasks', 'obtained', 'from', 'the', 'schedule', 'is', 'used', 'for', 'the', 'online', 'dynamic', 'voltage', 'scaling', 'dvs', 'of', 'the', 'tasks', 'for', 'the', 'tasks', 'that', 'normally', 'require', 'a', 'small', 'number', 'of', 'cycles', 'but', 'occasionally', 'a', 'large', 'number', 'of', 'cycles', 'to', 'complete', 'such', 'a', 'schedule', 'provides', 'more', 'opportunities', 'for', 'slack', 'utilization', 'and', 'hence', 'results', 'in', 'larger', 'energy', 'saving', 'the', 'concept', 'is', 'realized', 'by', 'formulating', 'the', 'problem', 'as', 'a', 'nonlinear', 'programming', 'nlp', 'optimization', 'problem', 'experimental', 'results', 'show', 'that', 'by', 'using', 'the', 'proposed', 'scheme', 'the', 'total', 'energy', 'consumption', 'at', 'runtime', 'is', 'reduced', 'by', 'as', 'high', 'as', '60', 'for', 'randomly', 'generated', 'task', 'sets', 'when', 'comparing', 'with', 'the', 'static', 'scheduling', 'approach', 'only', 'using', 'worst', 'case', 'workload']] | [-0.16187347939003735, 0.07142902556197009, -0.04686061722445413, 0.0503850591506177, -0.06318967520547587, -0.16379264310290592, 0.1353984558296534, 0.37947656782316264, -0.26873010050483226, -0.395427886094521, 0.11212414736136063, -0.2175672587292779, -0.11320322037222684, 0.24374498994577498, -0.12886185025230848, 0.09991628079608615, 0.11655489805742122, 0.05286582329011123, -0.022676858618589386, -0.29442901175380465, 0.23252469832576544, 0.08928994187070723, 0.31971877009519156, 0.049563668543539406, 0.10410979635170883, 0.021387279249860773, 0.021093717502870795, 0.029349382889146607, -0.038805378580816195, 0.0856778104723725, 0.30607318269002937, 0.18057214456244505, 0.3340408742910118, -0.4246989066596143, -0.19938014565767453, 0.12720365129089692, 0.08444273556510563, 0.0700137780291871, -0.01695634558676656, -0.19828770407115198, 0.13126358820313944, -0.17180743218272082, -0.03812805250206674, -0.0807925122852404, 0.01789422508140671, -0.007573427402392207, -0.31069966211050215, 0.03701870295307821, 0.011453130119618782, 0.026329456379504075, -0.06480663319927685, -0.0948331767022388, 0.002753134417746748, 0.11846264007770169, 0.05703638090995983, 0.025273475161243585, 0.14401937819950814, -0.11980092169306729, -0.182134652756975, 0.41152461973528953, -0.0029917397436552812, -0.18290337383881533, 0.1282703358530333, -0.02440704990710531, -0.13048756343362453, 0.1606262006749776, 0.1984325836529024, 0.10589886311208829, -0.17059959351570883, 0.03213033571228152, -0.014158702433286678, 0.18848303613430334, 0.07272416492508325, 0.01760465985128013, 0.15223663344763086, 0.23148585359532653, 0.17972611606403785, 0.171623709057236, -0.03269880298120413, -0.09396988101763695, -0.25737218272184864, -0.10397286097993076, -0.2047328939993999, 0.012395043382033085, -0.10904990421000721, -0.10701873939528707, 0.38967761046389915, 0.12441906275316364, 0.17633240362851038, 0.148674793922553, 0.37138688553767724, 0.12682573684322138, 0.08700737374324706, 0.1592049510353328, 0.15862847530903915, -0.0077592743729751204, 0.17552208818129397, -0.26336346369879765, 0.07852659146079705, 0.030415003532349754] |
710.4759 | A Fast Concurrent Power-Thermal Model for Sub-100nm Digital ICs | As technology scales down, the static power is expected to become a
significant fraction of the total power. The exponential dependence of static
power with the operating temperature makes the thermal profile estimation of
high-performance ICs a key issue to compute the total power dissipated in
next-generations. In this paper we present accurate and compact analytical
models to estimate the static power dissipation and the temperature of
operation of CMOS gates. The models are the fundamentals of a performance
estimation tool in which numerical procedures are avoided for any computation
to set a faster estimation and optimization. The models developed are compared
to measurements and SPICE simulations for a 0.12mm technology showing excellent
results.
| cs.AR | as technology scales down the static power is expected to become a significant fraction of the total power the exponential dependence of static power with the operating temperature makes the thermal profile estimation of highperformance ics a key issue to compute the total power dissipated in nextgenerations in this paper we present accurate and compact analytical models to estimate the static power dissipation and the temperature of operation of cmos gates the models are the fundamentals of a performance estimation tool in which numerical procedures are avoided for any computation to set a faster estimation and optimization the models developed are compared to measurements and spice simulations for a 012mm technology showing excellent results | [['as', 'technology', 'scales', 'down', 'the', 'static', 'power', 'is', 'expected', 'to', 'become', 'a', 'significant', 'fraction', 'of', 'the', 'total', 'power', 'the', 'exponential', 'dependence', 'of', 'static', 'power', 'with', 'the', 'operating', 'temperature', 'makes', 'the', 'thermal', 'profile', 'estimation', 'of', 'highperformance', 'ics', 'a', 'key', 'issue', 'to', 'compute', 'the', 'total', 'power', 'dissipated', 'in', 'nextgenerations', 'in', 'this', 'paper', 'we', 'present', 'accurate', 'and', 'compact', 'analytical', 'models', 'to', 'estimate', 'the', 'static', 'power', 'dissipation', 'and', 'the', 'temperature', 'of', 'operation', 'of', 'cmos', 'gates', 'the', 'models', 'are', 'the', 'fundamentals', 'of', 'a', 'performance', 'estimation', 'tool', 'in', 'which', 'numerical', 'procedures', 'are', 'avoided', 'for', 'any', 'computation', 'to', 'set', 'a', 'faster', 'estimation', 'and', 'optimization', 'the', 'models', 'developed', 'are', 'compared', 'to', 'measurements', 'and', 'spice', 'simulations', 'for', 'a', '012mm', 'technology', 'showing', 'excellent', 'results']] | [-0.11966843761287496, 0.04656297129362689, -0.08009168348507956, 0.04273560070370357, -0.03646352235227823, -0.13665631479982818, 0.0391114052690682, 0.3587100561375597, -0.22853322375366197, -0.3624098307586142, 0.13604916811475828, -0.2741249699985409, -0.0956589318837879, 0.2739798186313627, -0.04741539291795301, 0.12124153445412438, 0.02596394848660566, 0.001439248344727925, -0.0903306059501899, -0.2021633042396778, 0.21416824194602668, 0.1569607704628392, 0.32298501994020107, 0.05296917360309245, 0.09338583210150578, -0.05471946079134276, -0.04573294922010973, 0.02900540442871196, -0.11682821630633303, 0.12173232527233527, 0.25707423299922993, 0.09584508358966559, 0.2758046865055803, -0.43284970573482234, -0.22165090725424566, 0.10765300786442822, 0.12239861406020022, 0.09433766706726081, -0.058801024819591215, -0.1690083471226639, 0.10701597960931915, -0.20420114136400766, -0.10682907586929755, -0.09019356815510296, 0.01942066400105042, 0.027242265999250646, -0.30928534713374184, 0.06476493087497406, 0.03888841593496701, 0.02119937029783614, -0.04862604585858727, -0.1033804141282287, 0.013649355705378443, 0.12681917908256374, 0.0036205348670981558, -0.004970536114082539, 0.17883008763393654, -0.1574010593238719, -0.10375005398028796, 0.35374292955800357, -0.057275972222019585, -0.17371282156299067, 0.15544881560656773, -0.10487288954235348, -0.08645467434793577, 0.12497310966760519, 0.2152223087198633, 0.09100314307579538, -0.15202171128476039, 0.05055031090783554, 0.057470386931007464, 0.20104902112715145, -0.004772747530036473, 0.038324978751396496, 0.21328186307385164, 0.20412364385057508, 0.057383001915046146, 0.1487181364936987, -0.09621842752676457, -0.10383739032217168, -0.2655064473011797, -0.13457180479898462, -0.15529478451519804, 0.03896806485967578, -0.10521660675658495, -0.16361691061423958, 0.4064649883657694, 0.18335517175728455, 0.15662435183600923, 0.09870989450324227, 0.42445800519947496, 0.1558902027714534, 0.06882569457021807, 0.11170657181894837, 0.23688057414256036, 0.1344760969181412, 0.12434530515020015, -0.22910695717187732, 0.04466526931251532, -0.025641250584158115] |
710.476 | Low Power Oriented CMOS Circuit Optimization Protocol | Low power oriented circuit optimization consists in selecting the best
alternative between gate sizing, buffer insertion and logic structure
transformation, for satisfying a delay constraint at minimum area cost. In this
paper we used a closed form model of delay in CMOS structures to define metrics
for a deterministic selection of the optimization alternative. The target is
delay constraint satisfaction with minimum area cost. We validate the design
space exploration method, defining maximum and minimum delay bounds on logical
paths. Then we adapt this method to a "constant sensitivity method" allowing to
size a circuit at minimum area under a delay constraint. An optimisation
protocol is finally defined to manage the trade-off performance constraint -
circuit structure. These methods are implemented in an optimization tool (POPS)
and validated by comparing on a 0.25$\mu$m process, the optimization efficiency
obtained on various benchmarks (ISCAS?85) to that resulting from an industrial
tool.
| cs.AR | low power oriented circuit optimization consists in selecting the best alternative between gate sizing buffer insertion and logic structure transformation for satisfying a delay constraint at minimum area cost in this paper we used a closed form model of delay in cmos structures to define metrics for a deterministic selection of the optimization alternative the target is delay constraint satisfaction with minimum area cost we validate the design space exploration method defining maximum and minimum delay bounds on logical paths then we adapt this method to a constant sensitivity method allowing to size a circuit at minimum area under a delay constraint an optimisation protocol is finally defined to manage the tradeoff performance constraint circuit structure these methods are implemented in an optimization tool pops and validated by comparing on a 025mum process the optimization efficiency obtained on various benchmarks iscas85 to that resulting from an industrial tool | [['low', 'power', 'oriented', 'circuit', 'optimization', 'consists', 'in', 'selecting', 'the', 'best', 'alternative', 'between', 'gate', 'sizing', 'buffer', 'insertion', 'and', 'logic', 'structure', 'transformation', 'for', 'satisfying', 'a', 'delay', 'constraint', 'at', 'minimum', 'area', 'cost', 'in', 'this', 'paper', 'we', 'used', 'a', 'closed', 'form', 'model', 'of', 'delay', 'in', 'cmos', 'structures', 'to', 'define', 'metrics', 'for', 'a', 'deterministic', 'selection', 'of', 'the', 'optimization', 'alternative', 'the', 'target', 'is', 'delay', 'constraint', 'satisfaction', 'with', 'minimum', 'area', 'cost', 'we', 'validate', 'the', 'design', 'space', 'exploration', 'method', 'defining', 'maximum', 'and', 'minimum', 'delay', 'bounds', 'on', 'logical', 'paths', 'then', 'we', 'adapt', 'this', 'method', 'to', 'a', 'constant', 'sensitivity', 'method', 'allowing', 'to', 'size', 'a', 'circuit', 'at', 'minimum', 'area', 'under', 'a', 'delay', 'constraint', 'an', 'optimisation', 'protocol', 'is', 'finally', 'defined', 'to', 'manage', 'the', 'tradeoff', 'performance', 'constraint', 'circuit', 'structure', 'these', 'methods', 'are', 'implemented', 'in', 'an', 'optimization', 'tool', 'pops', 'and', 'validated', 'by', 'comparing', 'on', 'a', '025mum', 'process', 'the', 'optimization', 'efficiency', 'obtained', 'on', 'various', 'benchmarks', 'iscas85', 'to', 'that', 'resulting', 'from', 'an', 'industrial', 'tool']] | [-0.14906277493070308, -0.012732130255588689, -0.056771802361598366, 0.044702758917070685, -0.08859432492612836, -0.18623888014022866, 0.13842110426992657, 0.42074661754147225, -0.28147809887053193, -0.3941635107432769, 0.09673363570048399, -0.21819700061255512, -0.14043188776908996, 0.23749148948715898, -0.1323290883981925, 0.1342238646623603, 0.05038101466787929, -0.004523617803823907, -0.08962144394034702, -0.25779327198727736, 0.22545546510598405, 0.10757056828210684, 0.31818208916465174, 0.0393484150184589, 0.1235307328205562, -0.009026568213074997, 0.023642959307589743, 0.06185891908397615, -0.144818480877999, 0.13661986086958064, 0.2549991049344425, 0.21583464752089837, 0.2860300617034522, -0.413139986981814, -0.17257803037284394, 0.08513284653324533, 0.07668074917730976, 0.038840092542405065, -0.049228905856678565, -0.21185486024163813, 0.08413086556577803, -0.15109081207353753, -0.048925962959057524, -0.019881416094879544, 0.006163005553487991, 0.003461767271211421, -0.307231190196723, -0.04992227367199883, -0.0015598914422396872, 0.024081814124853024, -0.04667822114267462, -0.0988355926190805, 0.03403173728666671, 0.10213733872090391, -0.03281800184383944, 0.030481774739864458, 0.15384028466556826, -0.0848802160137377, -0.1499686503752978, 0.3447120640980634, -0.04900667279198879, -0.23980048827935527, 0.10929031287496155, 0.011172577707298301, -0.133254795019024, 0.13922696635819268, 0.2307373522025709, 0.09184541689024332, -0.2018716758993341, 0.08037892189030252, 0.025447664050089597, 0.2037608752804305, 0.09303733298863359, 0.02333086378230537, 0.14803551525236233, 0.25929355456311304, 0.1820237685964015, 0.19128792530013802, -0.049203992753629446, -0.10547877068480326, -0.29464730737271494, -0.14936797227867804, -0.16443098421881883, 0.014096037917329956, -0.11328235512406241, -0.1301575917506754, 0.36829653995998857, 0.12501845397904665, 0.15071257981597572, 0.14171497074484424, 0.35774809695195053, 0.14374800003762986, 0.06325765905706715, 0.09116230051133882, 0.15930856698557633, 0.10383298409932822, 0.07735860449060597, -0.25448697402827897, 0.08417213271447532, 0.05953666366750022] |
710.4761 | Low-Cost Multi-Gigahertz Test Systems Using CMOS FPGAs and PECL | This paper describes two research projects that develop new low-cost
techniques for testing devices with multiple high-speed (2 to 5 Gbps) signals.
Each project uses commercially available components to keep costs low, yet
achieves performance characteristics comparable to (and in some ways exceeding)
more expensive ATE. A common CMOS FPGA-based logic core provides flexibility,
adaptability, and communication with controlling computers while customized
positive emitter-coupled logic (PECL) achieves multi-gigahertz data rates with
about $\pm$25ps timing accuracy.
| cs.AR | this paper describes two research projects that develop new lowcost techniques for testing devices with multiple highspeed 2 to 5 gbps signals each project uses commercially available components to keep costs low yet achieves performance characteristics comparable to and in some ways exceeding more expensive ate a common cmos fpgabased logic core provides flexibility adaptability and communication with controlling computers while customized positive emittercoupled logic pecl achieves multigigahertz data rates with about pm25ps timing accuracy | [['this', 'paper', 'describes', 'two', 'research', 'projects', 'that', 'develop', 'new', 'lowcost', 'techniques', 'for', 'testing', 'devices', 'with', 'multiple', 'highspeed', '2', 'to', '5', 'gbps', 'signals', 'each', 'project', 'uses', 'commercially', 'available', 'components', 'to', 'keep', 'costs', 'low', 'yet', 'achieves', 'performance', 'characteristics', 'comparable', 'to', 'and', 'in', 'some', 'ways', 'exceeding', 'more', 'expensive', 'ate', 'a', 'common', 'cmos', 'fpgabased', 'logic', 'core', 'provides', 'flexibility', 'adaptability', 'and', 'communication', 'with', 'controlling', 'computers', 'while', 'customized', 'positive', 'emittercoupled', 'logic', 'pecl', 'achieves', 'multigigahertz', 'data', 'rates', 'with', 'about', 'pm25ps', 'timing', 'accuracy']] | [-0.1583303773061036, 0.023301894440212183, 0.001723626926023927, -0.005887088102301479, -0.14309438961208798, -0.30740080539059517, 0.05241904484218038, 0.4546199464756582, -0.1948252785950899, -0.3795960393941237, 0.10753571699185865, -0.263686068679413, -0.08868068731600134, 0.3027871250039122, -0.17623502185516474, 0.08698674292665803, 0.11743856689685749, -0.02995650706321208, -0.06120520079113905, -0.2746777223267903, 0.14574226939779086, 0.10616134104525878, 0.3634041363062958, 0.0010031772673957879, 0.15904545927090416, -0.03407826590571656, -0.007399660056560404, -0.07605895763521807, -0.05890688347072784, 0.19703538459725678, 0.36822854360151624, 0.2041006618593302, 0.353334607278359, -0.45950296288356185, -0.1470457735316207, 0.039027742802217186, 0.12203620779069348, 0.04200487160576611, -0.0763215167270472, -0.22872173919717576, 0.1524140495651712, -0.2330782038366629, -0.08737490303833005, -0.12481325641015752, -0.010197926222139763, 0.033303752165617574, -0.25442520442528704, -0.023440125792856432, -0.004044719577197813, 0.08090136447248773, 0.019050214462873152, -0.14341125845546937, 0.07530636738778816, 0.15902319825868794, -0.04360324980613465, 0.02675957825623401, 0.16080299579900587, -0.11240844538163704, -0.19888042505934006, 0.329972672703055, -0.025202778426723346, -0.15862765684465152, 0.23035430727436002, -0.08443368169375592, -0.13646068162698713, 0.14391285123484623, 0.199020098351563, 0.017217997345142066, -0.20913968601800864, -0.010583571014043022, 0.150614319408002, 0.2875477071437571, 0.08045736503037107, 0.10890439389428745, 0.181204156328426, 0.2948663896208422, 0.0603338874602236, 0.1109998330163459, -0.07983105832439226, -0.04158341614917541, -0.1788977119673897, -0.15271164948353544, -0.12349447448246388, -0.018087170225852687, -0.08699134558062521, -0.09378747079366197, 0.3563087103345121, 0.21877838253405774, 0.0855739942320118, 0.16020484326872975, 0.4469330738195115, -0.017073797734661236, 0.14554400282213464, 0.12801640643091458, 0.1513409189166042, 0.02907310380639198, 0.1788067794712131, -0.12986143986765658, 0.10247877491120663, -0.07432421050665046] |
710.4762 | Area-Efficient Selective Multi-Threshold CMOS Design Methodology for
Standby Leakage Power Reduction | This paper presents a design flow for an improved selective
multi-threshold(Selective-MT) circuit. The Selective-MT circuit is improved so
that plural MT-cells can share one switch transistor. We propose the design
methodology from RTL(Register Transfer Level) to final layout with optimizing
switch transistor structure.
| cs.AR | this paper presents a design flow for an improved selective multithresholdselectivemt circuit the selectivemt circuit is improved so that plural mtcells can share one switch transistor we propose the design methodology from rtlregister transfer level to final layout with optimizing switch transistor structure | [['this', 'paper', 'presents', 'a', 'design', 'flow', 'for', 'an', 'improved', 'selective', 'multithresholdselectivemt', 'circuit', 'the', 'selectivemt', 'circuit', 'is', 'improved', 'so', 'that', 'plural', 'mtcells', 'can', 'share', 'one', 'switch', 'transistor', 'we', 'propose', 'the', 'design', 'methodology', 'from', 'rtlregister', 'transfer', 'level', 'to', 'final', 'layout', 'with', 'optimizing', 'switch', 'transistor', 'structure']] | [-0.16778538808919108, 0.05225553866572833, -0.0836457001666228, -0.05124069253603617, -0.09861044690777095, -0.2881950309428458, 0.09234614360134284, 0.46000038211544353, -0.28936881858568925, -0.3249135131541735, 0.0041991592002793765, -0.20390614561545542, -0.23114117722098643, 0.19341995747974858, -0.12871420443153533, 0.045374802445085384, 0.09561332755942996, -0.05845328875315877, -0.04895976256841841, -0.1735057369984973, 0.26095760862032574, 0.10968486840526263, 0.3860587092737357, 0.007302380811709624, 0.12994698614168626, -0.016328006123120967, 0.10025514664653784, -0.012881921938596627, -0.0855455307645547, 0.18511747655410987, 0.25708239001389116, 0.15343363544879815, 0.24521029356699914, -0.47404742589554727, -0.18604162306142732, -0.0005003248269741351, 0.1447264342688215, 0.15970206074416637, -0.04927573357828152, -0.17554679775658327, 0.10670117378975146, -0.23739097157540995, -0.03979953686491801, -0.08458830036509496, -0.059476700014410876, -0.04198592005727383, -0.26918964801529327, -0.09942200830062994, 0.052560936325253584, 0.010832387118194347, 0.01777301191423948, -0.1453702753314223, 0.05110548899914974, 0.1765661200341315, -0.10978251358327003, 0.03331182284940345, 0.21113395368537077, -0.079280962015335, -0.1917879764133921, 0.29948820546269417, -0.01892118631169582, -0.21148180642511505, 0.0936147444941199, -0.0551101514735283, -0.08271557480717699, 0.10230566494357891, 0.22878014403753555, 0.03850996718765833, -0.2056640299434105, -0.00789885215747815, -0.002770524352597885, 0.23187807550988135, 0.055822103773840726, 0.030033801258422244, 0.19753640976089698, 0.3044849588559606, 0.12633724579921898, 0.24014484625644025, -0.060538675242032, -0.02538192542031025, -0.27679401440307116, -0.1519164846589168, -0.12213406083771051, 0.1047956033442647, 0.00837142137476267, -0.18237853972002482, 0.4445541166724303, 0.2159858667769302, 0.15251745551060408, 0.007346608878996892, 0.38691613192741686, 0.16586366378200743, 0.09108360087833343, 0.047462588952233396, 0.18087051778983992, 0.04524032812183484, 0.12226676601821031, -0.2707005175940979, 0.10807499399360938, 0.001771343633150443] |
710.4763 | Logic Design for On-Chip Test Clock Generation - Implementation Details
and Impact on Delay Test Quality | This paper addresses delay test for SOC devices with high frequency clock
domains. A logic design for on-chip high-speed clock generation, implemented to
avoid expensive test equipment, is described in detail. Techniques for on-chip
clock generation, meant to reduce test vector count and to increase test
quality, are discussed. ATPG results for the proposed techniques are given.
| cs.AR | this paper addresses delay test for soc devices with high frequency clock domains a logic design for onchip highspeed clock generation implemented to avoid expensive test equipment is described in detail techniques for onchip clock generation meant to reduce test vector count and to increase test quality are discussed atpg results for the proposed techniques are given | [['this', 'paper', 'addresses', 'delay', 'test', 'for', 'soc', 'devices', 'with', 'high', 'frequency', 'clock', 'domains', 'a', 'logic', 'design', 'for', 'onchip', 'highspeed', 'clock', 'generation', 'implemented', 'to', 'avoid', 'expensive', 'test', 'equipment', 'is', 'described', 'in', 'detail', 'techniques', 'for', 'onchip', 'clock', 'generation', 'meant', 'to', 'reduce', 'test', 'vector', 'count', 'and', 'to', 'increase', 'test', 'quality', 'are', 'discussed', 'atpg', 'results', 'for', 'the', 'proposed', 'techniques', 'are', 'given']] | [-0.15372889113138644, 0.06946673485238039, 0.07862338998504065, 0.05118909233102673, -0.099635058474776, -0.24874471829746636, 0.0834389996098093, 0.4516733773706252, -0.20289540186262967, -0.3318785054511146, 0.1009601462497621, -0.17567252836663994, -0.09097796395470045, 0.3172927209944056, -0.1631494903418219, 0.1421764318814926, 0.08327851841111847, -0.0308716978485647, -0.02038542930243063, -0.2553664208634904, 0.15335480106602373, 0.12842365599384434, 0.41259224750428347, 0.004340337050196372, 0.10398001113514367, -0.0264301452532476, -0.06368163734543741, -0.04530586776519684, -0.06419981476287112, 0.12818164997652434, 0.34241237393335294, 0.16719387074638353, 0.28787231829278825, -0.45944734796750963, -0.19712142977994263, 0.07186061934682361, 0.07461817567073331, 0.11138441928319241, -0.06866352119801664, -0.2801245325980218, 0.13582475949078798, -0.20262018560121456, -0.14485621391443265, -0.15225453805505185, 0.01188382638716384, 0.060117218643426895, -0.29450249562464786, -0.03713918240381438, 0.000728933402059371, 0.07407471254925456, 0.004471415511624512, -0.041718509701783195, 0.11840125273815111, 0.09532124334292714, -0.056758044275308124, 0.01817175411831653, 0.14116368906596968, -0.06877769395431275, -0.22479452702559924, 0.40750315772336826, -0.04049239023343513, -0.21953102442223513, 0.16014872524241933, -0.037627087513867175, -0.13636582274512762, 0.058670274978666975, 0.24873216301529555, 0.027832510309261187, -0.15827840872787005, 0.004675585857368883, 0.15152352113734213, 0.23182252611507448, 0.14302172892106077, 0.07903074912661523, 0.17509380675721586, 0.2540938178110018, 0.04097953522904662, 0.16626060079668828, -0.08419187603060875, -0.04615504039745582, -0.27678754991083815, -0.16687268131461583, -0.21489115958020352, -0.04730965144393083, -0.003166170868146429, -0.1105934594872228, 0.34004191354962815, 0.23573935595586112, 0.08271719175472594, 0.04550230584777238, 0.40500264670373054, 0.13816461530759147, 0.11247665020065349, 0.015335677379513519, 0.1968594921728302, 0.07571306797724806, 0.1821094828478077, -0.20801405435869177, 0.02659185805047552, 0.037209768060660155] |
710.4764 | Hotspot Prevention Through Runtime Reconfiguration in Network-On-Chip | Many existing thermal management techniques focus on reducing the overall
power consumption of the chip, and do not address location-specific temperature
problems referred to as hotspots. We propose the use of dynamic runtime
reconfiguration to shift the hotspot-inducing computation periodically and make
the thermal profile more uniform. Our analysis shows that dynamic
reconfiguration is an effective technique in reducing hotspots for NoCs.
| cs.AR | many existing thermal management techniques focus on reducing the overall power consumption of the chip and do not address locationspecific temperature problems referred to as hotspots we propose the use of dynamic runtime reconfiguration to shift the hotspotinducing computation periodically and make the thermal profile more uniform our analysis shows that dynamic reconfiguration is an effective technique in reducing hotspots for nocs | [['many', 'existing', 'thermal', 'management', 'techniques', 'focus', 'on', 'reducing', 'the', 'overall', 'power', 'consumption', 'of', 'the', 'chip', 'and', 'do', 'not', 'address', 'locationspecific', 'temperature', 'problems', 'referred', 'to', 'as', 'hotspots', 'we', 'propose', 'the', 'use', 'of', 'dynamic', 'runtime', 'reconfiguration', 'to', 'shift', 'the', 'hotspotinducing', 'computation', 'periodically', 'and', 'make', 'the', 'thermal', 'profile', 'more', 'uniform', 'our', 'analysis', 'shows', 'that', 'dynamic', 'reconfiguration', 'is', 'an', 'effective', 'technique', 'in', 'reducing', 'hotspots', 'for', 'nocs']] | [-0.16404086252727898, 0.08306918579719572, -0.04523508855309643, 0.027185235737410725, -0.11183019408376002, -0.14056137170581545, 0.08982804109628426, 0.40833163969829434, -0.2759424654125679, -0.3422486698293112, 0.1253820158232034, -0.239058147138748, -0.1310800447388262, 0.2294020052926737, -0.13275110037552695, 0.08354725465789194, 0.023501710470032987, -0.020134447539438965, -0.03616279346265326, -0.19949435247261016, 0.2424947815779291, 0.12843166164992775, 0.38797445476177284, 0.11590504921117767, 0.015443808406774626, 0.02966936190658417, -0.07560815291143343, 0.018509853600722846, -0.07198791832295265, 0.12490584915809211, 0.27284016557892815, 0.14288701778888457, 0.2931321846534971, -0.49902808192934167, -0.2579408462357814, 0.0902662978156424, 0.1469544426644923, 0.079028366377852, -0.014692481759158878, -0.16946904161242676, 0.09269269624511238, -0.1954118226822771, -0.10281206504060109, -0.10423617022203617, -0.02402982907369733, 0.021805174480818333, -0.21518565123503813, 0.020190706046691285, 0.05629465328987505, 0.035806016553742964, -0.05669994254550729, -0.08831194350037908, 0.028965178201524694, 0.1512232749402279, -0.0017550451887130248, -0.017970243430711696, 0.204758487069277, -0.1322109114882521, -0.143756383094845, 0.3675869787264554, -0.018416593217703163, -0.14275385066103496, 0.17432748788937194, -0.011743648023512519, -0.14819366722291366, 0.13117681304756246, 0.22324103770441697, 0.11126088254062123, -0.16056154480539872, 0.023018833534166096, 0.06088681647279223, 0.23584622971438726, 0.03965003012877996, 0.04181320393519079, 0.16737371032721685, 0.21982475379329236, 0.16054647265013583, 0.19975535078432227, -0.09517721561180642, -0.08364941775951473, -0.17955693449886118, -0.10123495869033161, -0.12927967889738254, -0.020755810565534657, -0.08961676979450829, -0.2040521964720893, 0.379429099516424, 0.21857850784893895, 0.1755688569096268, 0.07351423256465646, 0.4124137110641745, 0.13022660682374826, 0.10509203592712274, 0.14713130667652996, 0.16462101734273868, 0.02813078423381829, 0.21783675055676063, -0.2956817974470037, 0.08857256955024405, -0.026578004853647263] |
710.4765 | Robust control of uncertain multi-inventory systems via Linear Matrix
Inequality | We consider a continuous time linear multi inventory system with unknown
demands bounded within ellipsoids and controls bounded within ellipsoids or
polytopes. We address the problem of "-stabilizing the inventory since this
implies some reduction of the inventory costs. The main results are certain
conditions under which "-stabilizability is possible through a saturated linear
state feedback control. All the results are based on a Linear Matrix
Inequalities (LMIs) approach and on some recent techniques for the modeling and
analysis of polytopic systems with saturations.
| math.OC math.DS | we consider a continuous time linear multi inventory system with unknown demands bounded within ellipsoids and controls bounded within ellipsoids or polytopes we address the problem of stabilizing the inventory since this implies some reduction of the inventory costs the main results are certain conditions under which stabilizability is possible through a saturated linear state feedback control all the results are based on a linear matrix inequalities lmis approach and on some recent techniques for the modeling and analysis of polytopic systems with saturations | [['we', 'consider', 'a', 'continuous', 'time', 'linear', 'multi', 'inventory', 'system', 'with', 'unknown', 'demands', 'bounded', 'within', 'ellipsoids', 'and', 'controls', 'bounded', 'within', 'ellipsoids', 'or', 'polytopes', 'we', 'address', 'the', 'problem', 'of', 'stabilizing', 'the', 'inventory', 'since', 'this', 'implies', 'some', 'reduction', 'of', 'the', 'inventory', 'costs', 'the', 'main', 'results', 'are', 'certain', 'conditions', 'under', 'which', 'stabilizability', 'is', 'possible', 'through', 'a', 'saturated', 'linear', 'state', 'feedback', 'control', 'all', 'the', 'results', 'are', 'based', 'on', 'a', 'linear', 'matrix', 'inequalities', 'lmis', 'approach', 'and', 'on', 'some', 'recent', 'techniques', 'for', 'the', 'modeling', 'and', 'analysis', 'of', 'polytopic', 'systems', 'with', 'saturations']] | [-0.14659180069741393, 0.0821915562375493, -0.019952630042098463, 0.009418273239307814, -0.05102145333131332, -0.14738611910780447, 0.07336157010424704, 0.3418101430205362, -0.30998952806528124, -0.25219118038547184, 0.2285719466329153, -0.2455123408220797, -0.14049510907525906, 0.19980163077845992, -0.12245349174121484, 0.15486818461933927, 0.049771902905333607, 0.02069630249336894, -0.0901198769438668, -0.27388289262862164, 0.3488820028391534, -0.02447712075497423, 0.21832558362456483, 0.03398308744640201, 0.14052496245130897, 0.0205389643559188, -0.022535341991377727, 0.05749323146024142, -0.1382035018163844, 0.14147383413260936, 0.2643318583168799, 0.15322141168594716, 0.34124018828428926, -0.4407707773193362, -0.20646399979124821, 0.12219699703910876, 0.04920225551662346, 0.0847235336675242, -0.05772663916771611, -0.24210165814119614, 0.06150295072334951, -0.12006919054935376, -0.11635828151788917, -0.05393355869455263, -0.022397520358762926, 0.06731348518531463, -0.31572142158014077, 0.05944317371384906, 0.10626062120233352, 0.052234773320378736, -0.17694315039608183, -0.12328979769206073, -0.001313995991256975, 0.08391924936690234, -0.007362378083468814, -0.04770404862938449, 0.13084773239236147, -0.09681997771674235, -0.1320137642213099, 0.3854733826370821, -0.028632317134733534, -0.2713303516973697, 0.17561568474186406, -0.12073844820926231, -0.15438930125362407, 0.11289105348155967, 0.2204270733609086, 0.1323611538945919, -0.15934586182369717, 0.1122834079024393, -0.08170729118310624, 0.18247604914774587, 0.02166247587939281, 0.030006738972761446, 0.14608134900308437, 0.17977982881434618, 0.1627699656500703, 0.1463858717830763, 0.010587014246820695, -0.14940536277814923, -0.3033182972576469, -0.09984645031259529, -0.12353202443531093, 0.001028390425268472, -0.09001585963085831, -0.14935172135232105, 0.34042367891275455, 0.08591762550834876, 0.1839324228550097, 0.12453705119939211, 0.2906125639787033, 0.1350641053341817, 0.017870016174302214, 0.07431320053902232, 0.19861499465090068, 0.13150869121420242, 0.0762495112804962, -0.21574695364411345, 0.12498869987099342, 0.06460067234105996] |
710.4766 | Gravitational Anomaly and Hawking Radiation of Brane World Black Holes | We apply Wilczek and his collaborators' anomaly cancellation approach to the
3-dimensional Schwarzschild- and BTZ-like brane world black holes induced by
the generalized C metrics in the Randall-Sundrum scenario. Based on the fact
that the horizon of brane world black hole will extend into the bulk spacetime,
we do the calculation from the bulk generalized C metrics side and show that
this approach also reproduces the correct Hawking radiation for these brane
world black holes. Besides, since this approach does not involve the dynamical
equation, it also shows that the Hawking radiation is only a kinematic effect.
| hep-th | we apply wilczek and his collaborators anomaly cancellation approach to the 3dimensional schwarzschild and btzlike brane world black holes induced by the generalized c metrics in the randallsundrum scenario based on the fact that the horizon of brane world black hole will extend into the bulk spacetime we do the calculation from the bulk generalized c metrics side and show that this approach also reproduces the correct hawking radiation for these brane world black holes besides since this approach does not involve the dynamical equation it also shows that the hawking radiation is only a kinematic effect | [['we', 'apply', 'wilczek', 'and', 'his', 'collaborators', 'anomaly', 'cancellation', 'approach', 'to', 'the', '3dimensional', 'schwarzschild', 'and', 'btzlike', 'brane', 'world', 'black', 'holes', 'induced', 'by', 'the', 'generalized', 'c', 'metrics', 'in', 'the', 'randallsundrum', 'scenario', 'based', 'on', 'the', 'fact', 'that', 'the', 'horizon', 'of', 'brane', 'world', 'black', 'hole', 'will', 'extend', 'into', 'the', 'bulk', 'spacetime', 'we', 'do', 'the', 'calculation', 'from', 'the', 'bulk', 'generalized', 'c', 'metrics', 'side', 'and', 'show', 'that', 'this', 'approach', 'also', 'reproduces', 'the', 'correct', 'hawking', 'radiation', 'for', 'these', 'brane', 'world', 'black', 'holes', 'besides', 'since', 'this', 'approach', 'does', 'not', 'involve', 'the', 'dynamical', 'equation', 'it', 'also', 'shows', 'that', 'the', 'hawking', 'radiation', 'is', 'only', 'a', 'kinematic', 'effect']] | [-0.10647553897741222, 0.07791862563834977, -0.11600524921524674, 0.15536307389415877, -0.13665416287546306, -0.1516608565520092, 0.010892153952808417, 0.28695051914522635, -0.1325279704784763, -0.2775264969143594, 0.05127289397017934, -0.3188353054724711, -0.18835887397860282, 0.18688565402018079, -0.10941577401281018, -0.010680083243041923, 0.00932665003137183, 0.0391464203010438, -0.07759041482457872, -0.2610147068056172, 0.4119437878817013, 0.08648106587100197, 0.29270546921749707, 0.09289014622204236, 0.10459591621129784, -0.002240298171863728, -0.007394720503781951, 0.08083685520513118, -0.14585928712392732, 0.043722583071002255, 0.1694591669269751, 0.1652937952342645, 0.1322066647087022, -0.39890602643880035, -0.2772727709301968, 0.06535675040609443, 0.15430921814452433, 0.19278599297839036, -0.05852549092618499, -0.28411798676495087, 0.08027472882291552, -0.2200407919944408, -0.11779531940203353, -0.020322387490767178, 0.02749554650646817, -0.14131553233937197, -0.16397087033069932, 0.09298448391275518, 0.1057319772875623, -0.10336840870915, -0.11456428794670351, -0.0508524658321643, -0.0648273969280351, 0.06956893807641931, 0.13905021800544382, -0.006514042008610577, 0.20238498334302424, -0.04462441676488319, -0.14207886500744937, 0.35692273007379366, -0.08219883532729, -0.20824811441977462, 0.14507722708194987, -0.23117672088892036, -0.0891447203946732, 0.09420745758598997, 0.1117678647164793, 0.2135367626324296, -0.15158204941232642, 0.19809968554301993, -0.016724940110958115, 0.13531519019419386, 0.1175264701602462, 0.023459148329212188, 0.33182521236426743, 0.041443098336458206, -0.016703379587702377, 0.12998098140755265, -0.031528434598549586, -0.11143750528392103, -0.36284578188332084, -0.17130140091542193, -0.1711095309619475, 0.0999070185252535, -0.16022001937486005, -0.18997650566875704, 0.3009077023676376, 0.16724451982368807, 0.1576789617058389, 0.020112038165158063, 0.2754892050328373, 0.03495959808435483, 0.04791818590133844, 0.12324317698798996, 0.33660474870133106, 0.06841705275037009, 0.19912496368473062, -0.26488159375850917, -0.06453651703111635, 0.11717812566221067] |
710.4767 | Relativistic hydrodynamics with strangeness production | The relativistic hydrodynamic approach is used to describe production of
strangeness and/or heavy quarks in ultrarelativistic heavy ion reactions.
Production processes are important ingredients of dissipative effects in the
hadronic liquid. Beyond viscosity also chemo- and thermo-diffusion processes
are considered. This also allows to specify chemical and thermal freeze-out
conditions.
| hep-ph | the relativistic hydrodynamic approach is used to describe production of strangeness andor heavy quarks in ultrarelativistic heavy ion reactions production processes are important ingredients of dissipative effects in the hadronic liquid beyond viscosity also chemo and thermodiffusion processes are considered this also allows to specify chemical and thermal freezeout conditions | [['the', 'relativistic', 'hydrodynamic', 'approach', 'is', 'used', 'to', 'describe', 'production', 'of', 'strangeness', 'andor', 'heavy', 'quarks', 'in', 'ultrarelativistic', 'heavy', 'ion', 'reactions', 'production', 'processes', 'are', 'important', 'ingredients', 'of', 'dissipative', 'effects', 'in', 'the', 'hadronic', 'liquid', 'beyond', 'viscosity', 'also', 'chemo', 'and', 'thermodiffusion', 'processes', 'are', 'considered', 'this', 'also', 'allows', 'to', 'specify', 'chemical', 'and', 'thermal', 'freezeout', 'conditions']] | [-0.041074420595541596, 0.3235975194722414, -0.13958200212568045, 0.15342819698154928, -0.002521982945036143, -0.15387134157121182, -0.0410245355963707, 0.2796522252820432, -0.23364749785512687, -0.2174361589923501, -0.0530661161756143, -0.29069192454713627, 0.06623122520744801, 0.09352286448513042, 0.05127473243512213, 0.10246510468423367, 0.05197185974568128, -0.03953760806471109, 0.01823605742305517, -0.17171823408454656, 0.32111763992346826, 0.09242049276828766, 0.16257889121770858, 0.2478259478881955, 0.03636715278029442, -0.03889666015282273, -0.044955956700723616, -0.05609452102333307, -0.1394394451007247, -0.0005846547149121761, 0.2600481219217181, 0.00935924903023988, 0.11571328492835165, -0.5000437732413411, -0.24922482637688517, 0.09228222811594605, 0.14692487750202418, 0.1721836463548243, -0.08008289748802781, -0.16944822074845434, 0.009113572305068374, -0.23034579068422317, -0.19480256404727697, -0.12536025162786246, 0.008270576167851686, 0.04407462634088006, -0.35434496603906157, 0.1242162786598783, 0.01530783255584538, 0.009569050455465912, -0.03400051237200387, -0.17521935074590148, -0.0767033676058054, 0.03359370132908225, 0.09613582632387989, -0.03357756232842803, 0.30735591910779475, -0.15914955503772943, -0.09818663250654935, 0.4926848775148392, -0.059356145281344655, -0.19353246208280325, 0.2810775792552158, -0.1507182720117271, -0.1860362761467695, 0.16507336247712373, 0.2701709622517228, 0.12107799124903977, -0.29745026242919265, 0.0402704713284038, 0.06599346427246928, 0.06746857785074098, 0.04810908168088645, 0.08678162705153226, 0.1954138526134193, 0.2393159721791744, -0.09653413573279977, 0.0786646895625745, -0.03709828653372824, -0.12483095314353704, -0.381974025554955, -0.17126700015272944, -0.030476022134535014, 0.032561276368796827, -0.06905321512313094, -0.11286421278491617, 0.31000164890661835, 0.1895139319077134, 0.13241423308849334, -0.12085780538618565, 0.3076893166266382, 0.07382936875335872, 0.005140806473791599, 0.09237330519594251, 0.28155690725892785, 0.2291902530938387, 0.19660716539248824, -0.3140948509471491, 0.1179438471980393, 0.09460645036771893] |
710.4768 | A Conversation with Dorothy Gilford | In 1946, Public Law 588 of the 79th Congress established the Office of Naval
Research (ONR). Its mission was to plan, foster and encourage scientific
research in support of Naval problems. The establishment of ONR predates the
National Science Foundation and initiated the refocusing of scientific
infrastructure in the United States following World War II. At the time, ONR
was the only source for federal support of basic research in the United States.
Dorothy Gilford was one of the first Heads of the Probability and Statistics
program at the Office of Naval Research (1955 to 1962), and she went on to
serve as Director of the Mathematical Sciences Division (1962 to 1968). During
her time at ONR, Dorothy influenced many areas of statistics and mathematics
and was ahead of her time in promoting interdisciplinary projects. Dorothy
continued her career at the National Center for Education Statistics (1969 to
1974). She was active in starting international comparisons of education
outcomes in different countries, which has influenced educational policy in the
United States. Dorothy went on to serve in many capacities at the National
Academy of Sciences, including Director of Human Resources Studies (1975 to
1978), Senior Statistician on the Committee on National Statistics (1978 to
1988) and Director of the Board on International Comparative Studies in
Education (1988 to 1994). The following is a conversation we had with Dorothy
Gilford in March of 2004. We found her to be an interesting person and a
remarkable statistician. We hope you agree.
| stat.ME | in 1946 public law 588 of the 79th congress established the office of naval research onr its mission was to plan foster and encourage scientific research in support of naval problems the establishment of onr predates the national science foundation and initiated the refocusing of scientific infrastructure in the united states following world war ii at the time onr was the only source for federal support of basic research in the united states dorothy gilford was one of the first heads of the probability and statistics program at the office of naval research 1955 to 1962 and she went on to serve as director of the mathematical sciences division 1962 to 1968 during her time at onr dorothy influenced many areas of statistics and mathematics and was ahead of her time in promoting interdisciplinary projects dorothy continued her career at the national center for education statistics 1969 to 1974 she was active in starting international comparisons of education outcomes in different countries which has influenced educational policy in the united states dorothy went on to serve in many capacities at the national academy of sciences including director of human resources studies 1975 to 1978 senior statistician on the committee on national statistics 1978 to 1988 and director of the board on international comparative studies in education 1988 to 1994 the following is a conversation we had with dorothy gilford in march of 2004 we found her to be an interesting person and a remarkable statistician we hope you agree | [['in', '1946', 'public', 'law', '588', 'of', 'the', '79th', 'congress', 'established', 'the', 'office', 'of', 'naval', 'research', 'onr', 'its', 'mission', 'was', 'to', 'plan', 'foster', 'and', 'encourage', 'scientific', 'research', 'in', 'support', 'of', 'naval', 'problems', 'the', 'establishment', 'of', 'onr', 'predates', 'the', 'national', 'science', 'foundation', 'and', 'initiated', 'the', 'refocusing', 'of', 'scientific', 'infrastructure', 'in', 'the', 'united', 'states', 'following', 'world', 'war', 'ii', 'at', 'the', 'time', 'onr', 'was', 'the', 'only', 'source', 'for', 'federal', 'support', 'of', 'basic', 'research', 'in', 'the', 'united', 'states', 'dorothy', 'gilford', 'was', 'one', 'of', 'the', 'first', 'heads', 'of', 'the', 'probability', 'and', 'statistics', 'program', 'at', 'the', 'office', 'of', 'naval', 'research', '1955', 'to', '1962', 'and', 'she', 'went', 'on', 'to', 'serve', 'as', 'director', 'of', 'the', 'mathematical', 'sciences', 'division', '1962', 'to', '1968', 'during', 'her', 'time', 'at', 'onr', 'dorothy', 'influenced', 'many', 'areas', 'of', 'statistics', 'and', 'mathematics', 'and', 'was', 'ahead', 'of', 'her', 'time', 'in', 'promoting', 'interdisciplinary', 'projects', 'dorothy', 'continued', 'her', 'career', 'at', 'the', 'national', 'center', 'for', 'education', 'statistics', '1969', 'to', '1974', 'she', 'was', 'active', 'in', 'starting', 'international', 'comparisons', 'of', 'education', 'outcomes', 'in', 'different', 'countries', 'which', 'has', 'influenced', 'educational', 'policy', 'in', 'the', 'united', 'states', 'dorothy', 'went', 'on', 'to', 'serve', 'in', 'many', 'capacities', 'at', 'the', 'national', 'academy', 'of', 'sciences', 'including', 'director', 'of', 'human', 'resources', 'studies', '1975', 'to', '1978', 'senior', 'statistician', 'on', 'the', 'committee', 'on', 'national', 'statistics', '1978', 'to', '1988', 'and', 'director', 'of', 'the', 'board', 'on', 'international', 'comparative', 'studies', 'in', 'education', '1988', 'to', '1994', 'the', 'following', 'is', 'a', 'conversation', 'we', 'had', 'with', 'dorothy', 'gilford', 'in', 'march', 'of', '2004', 'we', 'found', 'her', 'to', 'be', 'an', 'interesting', 'person', 'and', 'a', 'remarkable', 'statistician', 'we', 'hope', 'you', 'agree']] | [-0.04339142688038963, 0.08435429876715908, -0.1337455697622665, 0.03015509427348114, -0.1216887898035196, -0.1263956897248461, 0.1300517155058167, 0.300424463967452, -0.18411898952094854, -0.3613383785056753, 0.11869737192963788, -0.3335623466901905, -0.08776696266727597, 0.21298390150077762, -0.17883247025765298, 0.008231268142969006, 0.06918975733489374, 0.0318957385796357, 0.05174111691682138, -0.3565945401111035, 0.19185148207262553, 0.16069588612204766, 0.35541370642519127, 0.04641406045662527, 0.05351362687562085, 0.04114567488053344, -0.10147390038776401, -0.06545915947734886, -0.09907118962865656, 0.11473752048488411, 0.38618504756122707, 0.23444279037393267, 0.4400018451345433, -0.426106073772459, -0.12431638546636313, 0.02127768344632009, 0.002965717616195722, 0.04174905487445535, 0.04412197335424447, -0.35849884525698616, -0.051432083907908176, -0.19932696627210675, -0.16745888417950128, 0.05652597218343034, 0.1113225419608577, 0.00366168141902644, -0.1942426756183367, 0.004360944898212253, -0.014212336822799066, 0.1926374239903852, -0.06090388564455391, -0.17358021369313714, -0.03252780569028261, 0.25458591223612276, 0.05314097610658141, 0.07487684399139409, 0.11029178569920559, -0.13312642473625247, -0.18217579759581665, 0.35709375933634224, 0.019102002261206508, 0.014281082533042484, 0.18564015651136878, -0.17572496617137173, -0.19020213891526805, 0.015341744275313587, 0.2567306204956419, 0.026351667996842604, -0.12507071847103657, 0.0747575599045258, -0.06262519035670089, 0.10679573724159926, 0.15438752883394075, -0.08613922054182768, 0.21046334169464323, 0.134574826324086, 0.029261387013394872, 0.07184925440952515, -0.07128961809732898, -0.15092369329138863, -0.22118193749527681, -0.20219944236606996, -0.15373051571527238, 0.02238710475158007, 0.08448160674122003, -0.07896749881982076, 0.4101025427737069, 0.10088533105146957, 0.00724832570119723, -0.06555140218309437, 0.17545373140591977, -0.007288640806530943, 0.04566118762661832, 0.12610867855752386, 0.24592624436668784, 0.053049370628493894, 0.26320238687226744, -0.14591273332461413, 0.10815357121570808, 0.02937657600746687] |
710.4769 | Chiral behavior of pseudo-Goldstone boson masses and decay constants in
2+1 flavor QCD | We present preliminary results for the chiral behavior of charged
pseudo-Goldstone-boson masses and decay constants. These are obtained in
simulations with N_f=2+1 flavors of tree-level, O(a)-improved Wilson sea
quarks. In these simulations, mesons are composed of either valence quarks
discretized in the same way as the sea quarks (unitary simulations) or of
overlap valence quarks (mixed-action simulations). We find that the chiral
behavior of the pseudoscalar meson masses in the mixed-action calculations
cannot be explained with continuum, partially-quenched chiral perturbation
theory. We show that the inclusion of O(a^2) unitarity violations in the chiral
expansion resolves this discrepancy and that the size of the unitarity
violations required are consistent with those which we observe in the
zero-momentum, scalar-isotriplet-meson propagator.
| hep-lat hep-ph | we present preliminary results for the chiral behavior of charged pseudogoldstoneboson masses and decay constants these are obtained in simulations with n_f21 flavors of treelevel oaimproved wilson sea quarks in these simulations mesons are composed of either valence quarks discretized in the same way as the sea quarks unitary simulations or of overlap valence quarks mixedaction simulations we find that the chiral behavior of the pseudoscalar meson masses in the mixedaction calculations cannot be explained with continuum partiallyquenched chiral perturbation theory we show that the inclusion of oa2 unitarity violations in the chiral expansion resolves this discrepancy and that the size of the unitarity violations required are consistent with those which we observe in the zeromomentum scalarisotripletmeson propagator | [['we', 'present', 'preliminary', 'results', 'for', 'the', 'chiral', 'behavior', 'of', 'charged', 'pseudogoldstoneboson', 'masses', 'and', 'decay', 'constants', 'these', 'are', 'obtained', 'in', 'simulations', 'with', 'n_f21', 'flavors', 'of', 'treelevel', 'oaimproved', 'wilson', 'sea', 'quarks', 'in', 'these', 'simulations', 'mesons', 'are', 'composed', 'of', 'either', 'valence', 'quarks', 'discretized', 'in', 'the', 'same', 'way', 'as', 'the', 'sea', 'quarks', 'unitary', 'simulations', 'or', 'of', 'overlap', 'valence', 'quarks', 'mixedaction', 'simulations', 'we', 'find', 'that', 'the', 'chiral', 'behavior', 'of', 'the', 'pseudoscalar', 'meson', 'masses', 'in', 'the', 'mixedaction', 'calculations', 'can', 'not', 'be', 'explained', 'with', 'continuum', 'partiallyquenched', 'chiral', 'perturbation', 'theory', 'we', 'show', 'that', 'the', 'inclusion', 'of', 'oa2', 'unitarity', 'violations', 'in', 'the', 'chiral', 'expansion', 'resolves', 'this', 'discrepancy', 'and', 'that', 'the', 'size', 'of', 'the', 'unitarity', 'violations', 'required', 'are', 'consistent', 'with', 'those', 'which', 'we', 'observe', 'in', 'the', 'zeromomentum', 'scalarisotripletmeson', 'propagator']] | [-0.1104237308833175, 0.34563049746072316, -0.10918633012960736, 0.10002024928167558, 0.014238168716303304, -0.05968754571408798, 0.07617133924972393, 0.3781000029009122, -0.13325238575697199, -0.23017979365510818, -0.006239518587891426, -0.3499857392321285, -0.06212788924145011, 0.02239776532858228, 0.05599836906434125, 0.11561347358724755, 0.10685691760721593, -0.017543541601835154, -0.12455599776540811, -0.21924455544680485, 0.31603734171551323, -0.058703148220148355, 0.1941277846120871, 0.18191950564853784, -0.03360022370440838, -0.012025945943294682, -0.02230198146441044, -0.016739467724075176, -0.07250876599641937, 0.03220260901074124, 0.15833622354886726, 0.001916441083368328, 0.07906476575403641, -0.42823054036523545, -0.17107467312946853, 0.034696258337865785, 0.17897006921454245, 0.14801097753095543, -0.026774279307574034, -0.3135542753809251, 0.07805666155838527, -0.181798573400284, -0.23477593397833088, -0.17230028370952505, -0.11264266451804811, -0.07949255763863523, -0.3383682862871414, 0.11657756828090064, -0.07716690550426929, 0.04075249764240202, -0.00682851186611204, -0.23067310542409492, -0.06392224868520713, 0.08975189077890773, 0.14134361773617884, 0.05247230298068915, 0.10730561460389479, -0.1807243694505519, -0.16262990871492106, 0.4572911922716432, -0.09589210278394385, -0.1937509894084472, 0.14780606033328253, -0.20949632588487405, -0.15230264640055025, 0.09027885350827317, 0.15725106574419853, 0.07448715439591652, -0.16302080661790747, 0.10974392639851181, -0.11709994175988767, 0.19836164007568333, 0.11950507054391962, 0.03675219462388474, 0.244230353514242, 0.13671137637888583, -0.056838460179029875, 0.042722338757827945, -0.006758705525794345, -0.159346852499323, -0.3976345770379417, -0.0554875909553793, -0.14515234407387737, 0.06959541314134761, -0.13220548883262567, -0.1537178085806469, 0.3624119963019322, 0.1543751802876528, 0.18679943424251536, 0.05627571935785345, 0.2725541015020293, 0.09251238657141693, 0.12294183058552763, 0.10263546470266122, 0.3079995984832446, 0.1666734137882789, 0.0891951829330343, -0.36393919556887233, -0.11795370298453695, 0.13750098927471882] |
710.477 | Constructing Spin Interference Devices from Nanometric Rings | The study of nanospintronic devices utilizing coherent transport through
molecular scale multiply-connected geometries in the presence of moderate
magnetic fields is presented. It is shown how two types of simple devices, spin
filters and spin splitters (or Stern-Gerlach devices) may be constructed from
molecular nanometric rings utilizing the Aharonov-Bohm effect. The current is
calculated within a single electron approximation and within a many-body master
equation approach where charging effects are accounted for in the Coulomb
Blockade regime. We provide rules and tools to develop and analyze efficient
spintronic devices based on nanometric interferometers.
| cond-mat.str-el cond-mat.mtrl-sci | the study of nanospintronic devices utilizing coherent transport through molecular scale multiplyconnected geometries in the presence of moderate magnetic fields is presented it is shown how two types of simple devices spin filters and spin splitters or sterngerlach devices may be constructed from molecular nanometric rings utilizing the aharonovbohm effect the current is calculated within a single electron approximation and within a manybody master equation approach where charging effects are accounted for in the coulomb blockade regime we provide rules and tools to develop and analyze efficient spintronic devices based on nanometric interferometers | [['the', 'study', 'of', 'nanospintronic', 'devices', 'utilizing', 'coherent', 'transport', 'through', 'molecular', 'scale', 'multiplyconnected', 'geometries', 'in', 'the', 'presence', 'of', 'moderate', 'magnetic', 'fields', 'is', 'presented', 'it', 'is', 'shown', 'how', 'two', 'types', 'of', 'simple', 'devices', 'spin', 'filters', 'and', 'spin', 'splitters', 'or', 'sterngerlach', 'devices', 'may', 'be', 'constructed', 'from', 'molecular', 'nanometric', 'rings', 'utilizing', 'the', 'aharonovbohm', 'effect', 'the', 'current', 'is', 'calculated', 'within', 'a', 'single', 'electron', 'approximation', 'and', 'within', 'a', 'manybody', 'master', 'equation', 'approach', 'where', 'charging', 'effects', 'are', 'accounted', 'for', 'in', 'the', 'coulomb', 'blockade', 'regime', 'we', 'provide', 'rules', 'and', 'tools', 'to', 'develop', 'and', 'analyze', 'efficient', 'spintronic', 'devices', 'based', 'on', 'nanometric', 'interferometers']] | [-0.1887511571115684, 0.16587008021130997, -0.0734100288521218, 0.06485545376731303, -0.031603140901694055, -0.19823556915376214, 0.02402239478123124, 0.4098142016558878, -0.2524042341016954, -0.2929181826691474, 0.021580097883919715, -0.23711613802018985, -0.15665074660923453, 0.24554863994470447, 0.0204120937494501, 0.009260236150434902, 0.02548492257232948, -0.09123826269479719, -0.04690122041070173, -0.15301953826940828, 0.25639459723105995, 0.016671837343814312, 0.32765136688186597, 0.08634757026729564, 0.09941272293117338, 0.03426568438949924, 0.04226476871859162, 0.045670645922342296, -0.11113927447267118, 0.09587475915829982, 0.2627345915603381, -0.04000431257650577, 0.23083632705878387, -0.5604202983079738, -0.2143839265029597, 0.01079438296922793, 0.1400079675752955, 0.1922177616506815, -0.0679503564925624, -0.2897177250525083, 0.05127216717328436, -0.1882469298478256, -0.1261845638728901, -0.11903881927030863, -0.0014893340087065133, 0.06537315509562451, -0.24525122474678743, 0.05070980087483442, -0.010222274408255133, 0.03925208518812333, -0.03409663990693247, -0.08965754296420322, 0.03270746307117083, 0.07069326340100698, -0.07838434289129431, -0.04298526823205526, 0.22675357893690146, -0.1333327694665841, -0.17760240681148987, 0.3753346585698666, -0.016360811563709412, -0.1972395351096507, 0.13995282625609268, -0.1592447795774988, -0.03547546178758425, 0.09185111229257878, 0.13945781580242578, 0.14274847459658901, -0.19941432683438223, 0.07539248373109086, 0.030720233256297726, 0.13376351032325978, 0.04074392244420064, 0.12679701261422646, 0.2614360488951206, 0.22073670570808712, 0.04322549237579267, 0.12586416408634915, -0.14460342552923466, -0.08886846456856977, -0.2505110877576054, -0.1147763956643601, -0.22264390851881716, 0.09060285314516996, -0.03189455528470678, -0.14293180553396534, 0.345867661012259, 0.18175716000303666, 0.09624132699544682, -0.08176957868960916, 0.33463773527933705, 0.13069832279917695, 0.11659204296927939, 0.03344306204548125, 0.23164162783813413, 0.1935538148547533, 0.09186316282558506, -0.27077978509240436, 0.02983423697471779, 0.02542718567995615] |
710.4771 | Non-equilibrium nanothermodynamics | Entropy production for a system not in the thermodynamic limit is formulated
using Hill's nanothermodynamics, in which a macroscopic ensemble of such
systems is considered. External influence of the environment on the average
nanosystem is connected to irreversible work with an explicit formula based on
Jarzynsky equality. Entropy production retains its usual form as a sum of
products of fluxes and forces and Onsager's symmetry principle is proven to
hold for the average nanosystem if it is valid for the macroscopic ensemble, by
two methods. The first one provides expressions that relate the coefficients of
the two systems. The second gives a general condition for a system under a
external force to preserve Onsager's symmetry.
| cond-mat.stat-mech | entropy production for a system not in the thermodynamic limit is formulated using hills nanothermodynamics in which a macroscopic ensemble of such systems is considered external influence of the environment on the average nanosystem is connected to irreversible work with an explicit formula based on jarzynsky equality entropy production retains its usual form as a sum of products of fluxes and forces and onsagers symmetry principle is proven to hold for the average nanosystem if it is valid for the macroscopic ensemble by two methods the first one provides expressions that relate the coefficients of the two systems the second gives a general condition for a system under a external force to preserve onsagers symmetry | [['entropy', 'production', 'for', 'a', 'system', 'not', 'in', 'the', 'thermodynamic', 'limit', 'is', 'formulated', 'using', 'hills', 'nanothermodynamics', 'in', 'which', 'a', 'macroscopic', 'ensemble', 'of', 'such', 'systems', 'is', 'considered', 'external', 'influence', 'of', 'the', 'environment', 'on', 'the', 'average', 'nanosystem', 'is', 'connected', 'to', 'irreversible', 'work', 'with', 'an', 'explicit', 'formula', 'based', 'on', 'jarzynsky', 'equality', 'entropy', 'production', 'retains', 'its', 'usual', 'form', 'as', 'a', 'sum', 'of', 'products', 'of', 'fluxes', 'and', 'forces', 'and', 'onsagers', 'symmetry', 'principle', 'is', 'proven', 'to', 'hold', 'for', 'the', 'average', 'nanosystem', 'if', 'it', 'is', 'valid', 'for', 'the', 'macroscopic', 'ensemble', 'by', 'two', 'methods', 'the', 'first', 'one', 'provides', 'expressions', 'that', 'relate', 'the', 'coefficients', 'of', 'the', 'two', 'systems', 'the', 'second', 'gives', 'a', 'general', 'condition', 'for', 'a', 'system', 'under', 'a', 'external', 'force', 'to', 'preserve', 'onsagers', 'symmetry']] | [-0.1657674023840707, 0.10673907169321115, -0.12335090172526084, 0.07043997731811383, -0.018996781718574073, -0.12888457141244752, 0.03551959019285022, 0.2959921501920019, -0.23446184821149105, -0.25623957218863724, 0.07671288188277303, -0.2603889981636026, -0.11806167503655479, 0.21659595763572215, -0.026991236677164573, 0.051996860633248855, 0.007862054207770709, 0.10423228473467916, -0.041181520902012526, -0.20930549017104663, 0.3149897652318734, 0.031213712943881228, 0.3210862987254044, 0.09279289273208154, 0.16439214639627098, 0.03032423629784924, 0.05802761508548109, 0.04664746114142697, -0.10083397604320087, 0.12569987165267793, 0.16193494434966788, 0.0795804665693523, 0.2200909212411365, -0.42788946325482247, -0.2181853750687942, 0.08938160658764996, 0.08892334377589195, 0.11659043578925264, -0.0028724740851637826, -0.20987921717919802, 0.050869045826083606, -0.18721394711419156, -0.14331669289733104, -0.0976120398968066, 0.04025325276725517, 0.01897280991869864, -0.3113701652384183, 0.11946682692423724, 0.10922428644507338, 0.05760871997642282, -0.10703190291002229, -0.06624871368720114, -0.01295923325743755, 0.12779774922844872, 0.040782422805613464, -0.014468127685974826, 0.16856647428153737, -0.09894407359196951, -0.09042847511080797, 0.42397016402448345, -0.060097142725313905, -0.2541266003411198, 0.16969345962647103, -0.09127174755313287, -0.14260885512390942, 0.09783968619038269, 0.11316074912942815, 0.11517187598439162, -0.21508329588789166, 0.07475609886929752, -0.02528601933041947, 0.13303774060975565, 0.04873696060263013, 0.022292783053432543, 0.20299667743312425, 0.13855225255451442, 0.08526109752098196, 0.18493638079503158, -0.0037331100831037027, -0.142676487801956, -0.336854592668252, -0.20126441832664504, -0.2086080536001215, 0.07887217249088663, -0.06846934134981048, -0.17012281464657894, 0.3135103762227421, 0.12351220918884664, 0.15721667529770025, 0.07236090932029153, 0.2832686891289134, 0.1659767156571003, 0.06681329392819878, 0.04199183935283177, 0.2609185241918455, 0.18741117329786025, 0.07117633140858329, -0.21366047206883146, 0.07869233155067552, 0.12319807952531335] |
710.4772 | One-dimensional Model of a Gamma Klystron | A new scheme for amplification of coherent gamma rays is proposed. The key
elements are crystalline undulators - single crystals with periodically bent
crystallographic planes exposed to a high energy beam of charged particles
undergoing channeling inside the crystals. The scheme consists of two such
crystals separated by a vacuum gap. The beam passes the crystals successively.
The particles perform undulator motion inside the crystals following the
periodic shape of the crystallographic planes. Gamma rays passing the crystals
parallel to the beam get amplified due to interaction with the particles inside
the crystals. The term `gamma klystron' is proposed for the scheme because its
operational principles are similar to those of the optical klystron. A more
simple one-crystal scheme is considered as well for the sake of comparison. It
is shown that the gamma ray amplification in the klystron scheme can be reached
at considerably lower particle densities than in the one-crystal scheme,
provided that the gap between the crystals is sufficiently large.
| physics.acc-ph physics.optics | a new scheme for amplification of coherent gamma rays is proposed the key elements are crystalline undulators single crystals with periodically bent crystallographic planes exposed to a high energy beam of charged particles undergoing channeling inside the crystals the scheme consists of two such crystals separated by a vacuum gap the beam passes the crystals successively the particles perform undulator motion inside the crystals following the periodic shape of the crystallographic planes gamma rays passing the crystals parallel to the beam get amplified due to interaction with the particles inside the crystals the term gamma klystron is proposed for the scheme because its operational principles are similar to those of the optical klystron a more simple onecrystal scheme is considered as well for the sake of comparison it is shown that the gamma ray amplification in the klystron scheme can be reached at considerably lower particle densities than in the onecrystal scheme provided that the gap between the crystals is sufficiently large | [['a', 'new', 'scheme', 'for', 'amplification', 'of', 'coherent', 'gamma', 'rays', 'is', 'proposed', 'the', 'key', 'elements', 'are', 'crystalline', 'undulators', 'single', 'crystals', 'with', 'periodically', 'bent', 'crystallographic', 'planes', 'exposed', 'to', 'a', 'high', 'energy', 'beam', 'of', 'charged', 'particles', 'undergoing', 'channeling', 'inside', 'the', 'crystals', 'the', 'scheme', 'consists', 'of', 'two', 'such', 'crystals', 'separated', 'by', 'a', 'vacuum', 'gap', 'the', 'beam', 'passes', 'the', 'crystals', 'successively', 'the', 'particles', 'perform', 'undulator', 'motion', 'inside', 'the', 'crystals', 'following', 'the', 'periodic', 'shape', 'of', 'the', 'crystallographic', 'planes', 'gamma', 'rays', 'passing', 'the', 'crystals', 'parallel', 'to', 'the', 'beam', 'get', 'amplified', 'due', 'to', 'interaction', 'with', 'the', 'particles', 'inside', 'the', 'crystals', 'the', 'term', 'gamma', 'klystron', 'is', 'proposed', 'for', 'the', 'scheme', 'because', 'its', 'operational', 'principles', 'are', 'similar', 'to', 'those', 'of', 'the', 'optical', 'klystron', 'a', 'more', 'simple', 'onecrystal', 'scheme', 'is', 'considered', 'as', 'well', 'for', 'the', 'sake', 'of', 'comparison', 'it', 'is', 'shown', 'that', 'the', 'gamma', 'ray', 'amplification', 'in', 'the', 'klystron', 'scheme', 'can', 'be', 'reached', 'at', 'considerably', 'lower', 'particle', 'densities', 'than', 'in', 'the', 'onecrystal', 'scheme', 'provided', 'that', 'the', 'gap', 'between', 'the', 'crystals', 'is', 'sufficiently', 'large']] | [-0.1432398872973863, 0.22542896180675598, -0.07029832050029654, 0.006772899247152964, -0.027965743344975636, -0.15201376939367037, 0.03521285571187036, 0.42729593322146686, -0.27648317365092223, -0.28315790329652374, 0.016849589737830684, -0.2821263370278757, -0.013997452493640594, 0.24496930456152768, 0.020434280201152434, 0.056118778805466715, 0.04290257901375298, -0.008419546531513333, -0.037228183521801836, -0.19739651031632094, 0.25190735473588577, 0.1179437097569462, 0.3287832418238395, 0.008107256368384696, 0.13334615376079456, 0.014243272669045837, 0.05195520239576581, -0.016444947820855305, -0.11725256060353786, 0.08409797369677108, 0.20543991027261654, -0.01199682017104351, 0.1840969834534917, -0.4231271023279987, -0.2185931649291888, 0.06644855396007188, 0.13295614019170898, 0.10569304179807659, -0.09122264338557215, -0.24775507365411614, 0.10099357694925856, -0.13712698508170434, -0.16017818665422964, 0.008701278927037492, -0.0596354381297715, 0.06480518755852245, -0.22972245726850815, 0.003463559331794386, 0.058387155059608634, 0.010514590577804484, -0.028398532701248768, -0.06666752703604288, -0.0041329500003485006, 0.03594362073636148, 0.04563346200011438, 0.03778803710301872, 0.17120848332997413, -0.10624405249836855, -0.09764203447848559, 0.45432534803549063, 0.005101712264422531, -0.17195209690835328, 0.14546486213512252, -0.17087907811801414, -0.04205370413765195, 0.25271390010602773, 0.13457632091231062, 0.10810279791185166, -0.11326781250536441, 0.0454509102855809, -0.015314184653107077, 0.1742351594264619, 0.1383936872764025, 0.015613606030819937, 0.20875448896258603, 0.16409285600238946, 0.06108430674648844, 0.15134280841957662, -0.12578863524104236, -0.020588304923148826, -0.30459154872660293, -0.18958416889799992, -0.19049413090397138, -0.0030988256126875057, -0.06006376681471011, -0.1463212327222209, 0.3772642957356311, 0.04002334417309612, 0.1325639522576239, -0.05901662827236578, 0.28119155022723136, 0.08682186594160157, 0.07826328777300659, 0.03137174097646493, 0.28364161573990715, 0.1500806056370493, 0.10203890995544498, -0.21758963616011898, 0.027588245997321792, 0.036394373422081114] |
710.4773 | The ground state phases of orbitally degenerate spinel oxides | I review the microscopic spin-orbital Hamiltonian and ground state properties
of spin one-half spinel oxides with threefold $t_{2g}$ orbital degeneracy. It
is shown that for any orbital configuration a ground state of corresponding
spin only Hamiltonian is infinitely degenerate in the classical limit. The
extensive classical degeneracy is lifted by the quantum nature of the spins, an
effect similar to order-out-of-disorder phenomenon by quantum fluctuations.
This drives the system to a non-magnetic spin-singlet dimer manifold with a
residual degeneracy due to relative orientation of dimers. The magneto-elastic
mechanism of lifting the ``orientational'' degeneracy is also briefly reviewed.
| cond-mat.str-el cond-mat.mtrl-sci | i review the microscopic spinorbital hamiltonian and ground state properties of spin onehalf spinel oxides with threefold t_2g orbital degeneracy it is shown that for any orbital configuration a ground state of corresponding spin only hamiltonian is infinitely degenerate in the classical limit the extensive classical degeneracy is lifted by the quantum nature of the spins an effect similar to orderoutofdisorder phenomenon by quantum fluctuations this drives the system to a nonmagnetic spinsinglet dimer manifold with a residual degeneracy due to relative orientation of dimers the magnetoelastic mechanism of lifting the orientational degeneracy is also briefly reviewed | [['i', 'review', 'the', 'microscopic', 'spinorbital', 'hamiltonian', 'and', 'ground', 'state', 'properties', 'of', 'spin', 'onehalf', 'spinel', 'oxides', 'with', 'threefold', 't_2g', 'orbital', 'degeneracy', 'it', 'is', 'shown', 'that', 'for', 'any', 'orbital', 'configuration', 'a', 'ground', 'state', 'of', 'corresponding', 'spin', 'only', 'hamiltonian', 'is', 'infinitely', 'degenerate', 'in', 'the', 'classical', 'limit', 'the', 'extensive', 'classical', 'degeneracy', 'is', 'lifted', 'by', 'the', 'quantum', 'nature', 'of', 'the', 'spins', 'an', 'effect', 'similar', 'to', 'orderoutofdisorder', 'phenomenon', 'by', 'quantum', 'fluctuations', 'this', 'drives', 'the', 'system', 'to', 'a', 'nonmagnetic', 'spinsinglet', 'dimer', 'manifold', 'with', 'a', 'residual', 'degeneracy', 'due', 'to', 'relative', 'orientation', 'of', 'dimers', 'the', 'magnetoelastic', 'mechanism', 'of', 'lifting', 'the', 'orientational', 'degeneracy', 'is', 'also', 'briefly', 'reviewed']] | [-0.21246726176347389, 0.24645705078137325, -0.022171416475127142, 0.07453939650319323, -0.056467091601613596, -0.1373029138194397, 0.03714200395188527, 0.3311755518661812, -0.29008990006695967, -0.271689121669624, 0.011903565353956461, -0.2970384889631532, -0.1285230509044292, 0.07524935687251855, 0.019909148293663748, -0.005698255845345557, 0.04913961696001934, -0.01835698093661146, -0.13693522750327247, -0.22883824084541024, 0.3337329226728798, 0.017368633282179264, 0.2778862280101748, 0.051439931376080494, 0.10607604394317605, 0.01313694770942675, 0.19630373094696552, -0.04796960395469796, -0.13466550583727135, 0.08743085972188662, 0.22088931146815108, -0.052569637045962736, 0.1679884939076146, -0.3999904718172426, -0.16720910639196518, 0.05600814657130589, 0.12059610555570544, 0.2297197673081731, 0.0007335410870534057, -0.30440306960372254, -0.017001301831138942, -0.1995280640257988, -0.1923335324487804, -0.11888796811884579, 0.016315057742758654, -0.04362538096999439, -0.18568660560413264, 0.08412016087792533, 0.169910069577251, 0.09117142135316196, -0.08631647611400695, -0.1319594600390701, -0.15462096245998205, 0.045287138942512684, 0.08043014841314289, 0.0668401037263114, 0.07984962418170956, -0.10146496010565897, -0.1517879457290595, 0.38420655807324994, -0.01621509478475976, -0.17911709036995185, 0.14653943226827928, -0.13637683289319588, -0.10686214738719475, 0.17539278521144297, 0.03958821759927863, 0.0897375415127802, -0.10658167334622703, 0.13140209593439067, 0.002346055213517199, 0.2059120451740455, -0.04598663283589607, 0.09543657479904748, 0.28605149428282556, 0.1279671013665696, 0.11603360420364577, 0.16944191790147065, -0.12414580189700548, -0.18910295516252518, -0.2242016396485269, -0.15191242680884898, -0.27750255492477055, 0.13147317683615256, -0.032072790364660854, -0.1605529733506046, 0.3912206432626893, 0.11865169814821759, 0.16187072387159182, -0.09419788462400902, 0.23178533747947463, 0.09073717447851475, 0.006046486219929648, -0.009039109573980872, 0.26519394303128746, 0.22242793273471761, 0.019524351567573223, -0.3686495665218293, 0.04895353319686061, 0.06892766597835968] |
710.4774 | On the integrability of holomorphic vector fields | We determine topological and algebraic conditions for a germ of holomorphic
foliation $\mathcal F(X)$ induced by a generic vector field $X$ on
$(\mathbb{C}^{3},0)$ to have a holomorphic first integral, i.e., a germ of
holomorphic map $F \colon(\mathbb{C}^{3},0)\longrightarrow(\mathbb{C}^{2},0)$
such that the leaves of $\mathcal F(X)$ are contained in the level curves of
$F$.
| math.CV | we determine topological and algebraic conditions for a germ of holomorphic foliation mathcal fx induced by a generic vector field x on mathbbc30 to have a holomorphic first integral ie a germ of holomorphic map f colonmathbbc30longrightarrowmathbbc20 such that the leaves of mathcal fx are contained in the level curves of f | [['we', 'determine', 'topological', 'and', 'algebraic', 'conditions', 'for', 'a', 'germ', 'of', 'holomorphic', 'foliation', 'mathcal', 'fx', 'induced', 'by', 'a', 'generic', 'vector', 'field', 'x', 'on', 'mathbbc30', 'to', 'have', 'a', 'holomorphic', 'first', 'integral', 'ie', 'a', 'germ', 'of', 'holomorphic', 'map', 'f', 'colonmathbbc30longrightarrowmathbbc20', 'such', 'that', 'the', 'leaves', 'of', 'mathcal', 'fx', 'are', 'contained', 'in', 'the', 'level', 'curves', 'of', 'f']] | [-0.3030345614122994, 0.01379521214403212, -0.07890011713493104, 0.021138239505828594, -0.07868166223588381, -0.11691835011337318, -0.020085333426501237, 0.31921208235343884, -0.3446229276996033, -0.09787693137631696, 0.05427563998291232, -0.27731739707729397, -0.16111725758688122, 0.19822109803813054, -0.09250539974720381, 0.043809578206171006, 0.003566781889793335, 0.14938867909779005, -0.11937821508093062, -0.225588822079932, 0.47243502648437724, -0.1202289288242658, 0.13138253090209237, 0.054233433076125735, 0.1994817363025219, -0.033474609064047825, 0.046673965156443564, -0.04111941366949502, -0.1864874726031535, 0.11908693765016164, 0.2844796706283209, 0.11009761569656286, 0.22223508876620554, -0.3862949741602528, -0.16263259565183782, 0.27346854675195964, 0.10219943946154386, -0.1361218042187758, -0.0025682604127545273, -0.24544566760168357, 0.13580305176768817, -0.04474947944867844, -0.18341629436312645, -0.12637867019785679, 0.11508610930668153, 0.031248655480643112, -0.2830254794920192, -0.03539571673700623, 0.10399224565309637, 0.16710902350571225, -0.04827272343248421, -0.05494818808830471, -0.19810347883578608, 0.03613958047593341, -0.03986242203516703, 0.26166541110461705, 0.15026824841933215, -0.12236794891456763, -0.035287348297881146, 0.313413383256571, -0.164838343950025, -0.25571345888516483, 0.0619050362238697, -0.21945537583829433, -0.2010425049355071, 0.16899559204923173, 0.13570174543807903, 0.19481736027142582, -0.07328450900739898, 0.28137009731361495, -0.08734716626578103, 0.05509648322328633, 0.09335047049520939, -0.041179372079889566, 0.18386237422807836, 0.06172940832581006, 0.05701641826525185, 0.09047442382685475, -0.012467238335304108, 0.03725652303546667, -0.41314220019415315, -0.218304886423307, -0.0990874436866565, 0.22177227063323646, -0.0700052219129729, -0.21961746627793594, 0.447860184107341, 0.025809563659861975, 0.2525876672828899, 0.08723223349992551, 0.19181761848648973, 0.111030471255528, 0.044124688496630565, 0.045193900390729014, 0.10003903737364739, 0.14768728588744268, -0.08681117884778217, -0.12062909917942449, 0.007174061319115115, 0.17896804726664342] |
710.4775 | Two-Loop Heavy-Flavor Contribution to Bhabha Scattering | We evaluate the two-loop QED corrections to the Bhabha scattering cross
section which involve the vacuum polarization by heavy fermions of arbitrary
mass m_f >> m_e. The results are valid for generic values of the Mandelstam
invariants s,t,u >> m_e^2.
| hep-ph | we evaluate the twoloop qed corrections to the bhabha scattering cross section which involve the vacuum polarization by heavy fermions of arbitrary mass m_f m_e the results are valid for generic values of the mandelstam invariants stu m_e2 | [['we', 'evaluate', 'the', 'twoloop', 'qed', 'corrections', 'to', 'the', 'bhabha', 'scattering', 'cross', 'section', 'which', 'involve', 'the', 'vacuum', 'polarization', 'by', 'heavy', 'fermions', 'of', 'arbitrary', 'mass', 'm_f', 'm_e', 'the', 'results', 'are', 'valid', 'for', 'generic', 'values', 'of', 'the', 'mandelstam', 'invariants', 'stu', 'm_e2']] | [-0.14627757019020224, 0.2814711140542242, 0.0326103757282621, 0.158124126052778, -0.012227101190211741, -0.12154333597343218, -0.012218753709212729, 0.24314365357062534, -0.08824596130044053, -0.2609968188427095, -0.03669599854191275, -0.33855570078288255, -0.009202729248882909, 0.18445163215265462, 0.05743734641490798, 0.1407987469731444, 0.004647367462319763, 0.004478133614420106, -0.12371123523304337, -0.26199271638363014, 0.39651720457416223, -0.010140845613358053, 0.1664259836420809, 0.20405801586610706, 0.05109791320405508, 0.1024449172209164, -0.017195796348938818, -0.11497698194886509, -0.12075137481779645, 0.05610457609260553, 0.24341918669003798, -0.019798816549346634, 0.006418941150370397, -0.3672976101699628, -0.06695118222973849, 0.06160982798686937, 0.10435046857884644, 0.13146416593869953, 0.02461853211647586, -0.2745435469244656, 0.011278694287236584, -0.2554795956974359, -0.21255790497372418, -0.12465321531176175, 0.012525440732899466, -0.12558635005629376, -0.3382586223122321, 0.05576587098307515, -0.09499046527535508, -0.05469260391730227, -0.03640047689948819, -0.2001652357131733, -0.05561489450108064, 0.06209194562152812, 0.15005638754289402, 0.0069293787482341655, 0.18724322571468197, -0.15726666692717117, -0.15900344869710112, 0.39702819621092394, -0.07213219215995387, -0.23518831662735656, 0.03357511209814172, -0.22449842103953033, -0.10996479623473103, 0.18951980152020328, 0.1485318877048006, 0.1754806596896072, -0.1657078713056092, 0.25155234910351665, 0.006298971435937442, 0.12072451848928865, 0.1383380720661463, 0.03757319854278313, 0.2087398928135946, 0.03290359058883041, -0.09923714763288827, 0.05655918648392942, -0.07669019687455148, -0.07692252347049744, -0.459172890472569, -0.14211305907290234, -0.07403565933437724, 0.1002386980935147, -0.14508435180361726, -0.17209043814555594, 0.3237508148396094, 0.1584687829507809, 0.21624544118285963, 0.09375037017927848, 0.3305642238180888, 0.18635652314773515, 0.1257446684359916, 0.04650817854378961, 0.3261973055839342, 0.18989897662111999, 0.06984225453465785, -0.29751726519316435, -0.05611698491204726, 0.15046984538141833] |
710.4776 | Small-scale structure and dynamics of the lower solar atmosphere | The chromosphere of the quiet Sun is a highly intermittent and dynamic
phenomenon. Three-dimensional radiation (magneto-)hydrodynamic simulations
exhibit a mesh-like pattern of hot shock fronts and cool expanding post-shock
regions in the sub-canopy part of the inter-network. This domain might be
called "fluctosphere". The pattern is produced by propagating shock waves,
which are excited at the top of the convection zone and in the photospheric
overshoot layer. New high-resolution observations reveal a ubiquitous
small-scale pattern of bright structures and dark regions in-between. Although
it qualitatively resembles the picture seen in models, more observations - e.g.
with the future ALMA - are needed for thorough comparisons with present and
future models. Quantitative comparisons demand for synthetic intensity maps and
spectra for the three-dimensional (magneto-)hydrodynamic simulations. The
necessary radiative transfer calculations, which have to take into account
deviations from local thermodynamic equilibrium, are computationally very
involved so that no reliable results have been produced so far. Until this task
becomes feasible, we have to rely on careful qualitative comparisons of
simulations and observations. Here we discuss what effects have to be
considered for such a comparison. Nevertheless we are now on the verge of
assembling a comprehensive picture of the solar chromosphere in inter-network
regions as dynamic interplay of shock waves and structuring and guiding
magnetic fields.
| astro-ph | the chromosphere of the quiet sun is a highly intermittent and dynamic phenomenon threedimensional radiation magnetohydrodynamic simulations exhibit a meshlike pattern of hot shock fronts and cool expanding postshock regions in the subcanopy part of the internetwork this domain might be called fluctosphere the pattern is produced by propagating shock waves which are excited at the top of the convection zone and in the photospheric overshoot layer new highresolution observations reveal a ubiquitous smallscale pattern of bright structures and dark regions inbetween although it qualitatively resembles the picture seen in models more observations eg with the future alma are needed for thorough comparisons with present and future models quantitative comparisons demand for synthetic intensity maps and spectra for the threedimensional magnetohydrodynamic simulations the necessary radiative transfer calculations which have to take into account deviations from local thermodynamic equilibrium are computationally very involved so that no reliable results have been produced so far until this task becomes feasible we have to rely on careful qualitative comparisons of simulations and observations here we discuss what effects have to be considered for such a comparison nevertheless we are now on the verge of assembling a comprehensive picture of the solar chromosphere in internetwork regions as dynamic interplay of shock waves and structuring and guiding magnetic fields | [['the', 'chromosphere', 'of', 'the', 'quiet', 'sun', 'is', 'a', 'highly', 'intermittent', 'and', 'dynamic', 'phenomenon', 'threedimensional', 'radiation', 'magnetohydrodynamic', 'simulations', 'exhibit', 'a', 'meshlike', 'pattern', 'of', 'hot', 'shock', 'fronts', 'and', 'cool', 'expanding', 'postshock', 'regions', 'in', 'the', 'subcanopy', 'part', 'of', 'the', 'internetwork', 'this', 'domain', 'might', 'be', 'called', 'fluctosphere', 'the', 'pattern', 'is', 'produced', 'by', 'propagating', 'shock', 'waves', 'which', 'are', 'excited', 'at', 'the', 'top', 'of', 'the', 'convection', 'zone', 'and', 'in', 'the', 'photospheric', 'overshoot', 'layer', 'new', 'highresolution', 'observations', 'reveal', 'a', 'ubiquitous', 'smallscale', 'pattern', 'of', 'bright', 'structures', 'and', 'dark', 'regions', 'inbetween', 'although', 'it', 'qualitatively', 'resembles', 'the', 'picture', 'seen', 'in', 'models', 'more', 'observations', 'eg', 'with', 'the', 'future', 'alma', 'are', 'needed', 'for', 'thorough', 'comparisons', 'with', 'present', 'and', 'future', 'models', 'quantitative', 'comparisons', 'demand', 'for', 'synthetic', 'intensity', 'maps', 'and', 'spectra', 'for', 'the', 'threedimensional', 'magnetohydrodynamic', 'simulations', 'the', 'necessary', 'radiative', 'transfer', 'calculations', 'which', 'have', 'to', 'take', 'into', 'account', 'deviations', 'from', 'local', 'thermodynamic', 'equilibrium', 'are', 'computationally', 'very', 'involved', 'so', 'that', 'no', 'reliable', 'results', 'have', 'been', 'produced', 'so', 'far', 'until', 'this', 'task', 'becomes', 'feasible', 'we', 'have', 'to', 'rely', 'on', 'careful', 'qualitative', 'comparisons', 'of', 'simulations', 'and', 'observations', 'here', 'we', 'discuss', 'what', 'effects', 'have', 'to', 'be', 'considered', 'for', 'such', 'a', 'comparison', 'nevertheless', 'we', 'are', 'now', 'on', 'the', 'verge', 'of', 'assembling', 'a', 'comprehensive', 'picture', 'of', 'the', 'solar', 'chromosphere', 'in', 'internetwork', 'regions', 'as', 'dynamic', 'interplay', 'of', 'shock', 'waves', 'and', 'structuring', 'and', 'guiding', 'magnetic', 'fields']] | [-0.102421210158918, 0.16025216755907581, -0.05700985124060598, 0.11252182049888837, -0.0887866512972844, -0.07101498004005338, 0.02362953726270022, 0.42334866408311145, -0.2206017056751549, -0.31853820194223537, 0.10086730898668368, -0.2689273071993457, -0.1192227902881224, 0.202922228590406, 0.035651263461706224, 0.0072804177223656655, 0.10556193748314126, -0.06896597467157378, -0.009386170459823779, -0.13424778692631303, 0.2794419359612528, 0.11203890960806207, 0.22742796482894342, 0.023995992800815494, 0.018172646767761504, -0.12804400734685387, -0.06606944439661615, 0.045428475522449316, -0.1327049562208064, 0.04898694382014164, 0.23505249063467565, 0.11054332090537348, 0.23825948464273183, -0.540168819660452, -0.2995482524703891, 0.03457158190491194, 0.18762617732911696, 0.09879298856408945, -0.0683367097171099, -0.2607757198173955, 0.06914300270140293, -0.10811670149918078, -0.09684666828361685, -0.05407373252993738, 0.011701377912122808, 0.015313349687166408, -0.2751599165923596, 0.07289946625395044, 0.03414822756006719, 0.11280662459596645, -0.07468116752029409, -0.056872732798512064, -0.07034057586622193, 0.1288679814525823, 0.046330679748032434, 0.02116089617230103, 0.14203000672603192, -0.15538021302541516, -0.053402014679008736, 0.40282775177139385, -0.032849878990944, -0.11029073669586906, 0.2328266134253865, -0.1926803881228145, -0.13105766315170578, 0.18049227588468705, 0.16745870212801325, 0.11956542561884462, -0.09557134556057185, -0.00557990832431373, -0.07516400275769437, 0.13304389191752064, 0.044329173237679986, 0.04647945614090023, 0.30798393731036094, 0.18380032928918483, 0.013484555398258316, 0.11007199510101212, -0.15864288030813137, -0.10701210700640096, -0.2631763623745351, -0.10438770945555588, -0.10858437769604681, 0.01657616854820208, -0.057736504067021355, -0.17837075271726774, 0.3747567291764494, 0.1758013975329942, 0.1789812914827104, -0.014835279276419623, 0.31730413677372005, 0.08112841051021599, 0.049565089540774696, 0.11955400693592147, 0.31318012613392143, 0.1552063625725642, 0.16907654480326553, -0.1922895796072315, 0.078287891811853, 0.009225502949068104] |
710.4777 | Periodicity-dependence of the ferroelectric properties in BiFeO3/SrTiO3
multiferroic superlattices | Artificial superlattices of (BiFeO3)m(SrTiO3)m (m= 1 to 10 unit cells)
consisting of multiferroic BiFeO3 and insulating SrTiO3 layers were fabricated
on (100)-oriented SrTiO3 substrates by pulsed laser ablation. The remnant
polarization and leakage current behavior were studied varying the periodicity
(8-80A) of the superlattice. The leakage current was reduced by few orders of
magnitude on increase of periodicity compared to single layer BiFeO3 thin
films. Reduced leakage and intrinsic polarization hysteresis was observed and
was confirmed by PUND analysis for periodicities in the range 20-60A. The
leakage current was observed to be dominated by space charge limited conduction
| cond-mat.mtrl-sci cond-mat.str-el | artificial superlattices of bifeo3msrtio3m m 1 to 10 unit cells consisting of multiferroic bifeo3 and insulating srtio3 layers were fabricated on 100oriented srtio3 substrates by pulsed laser ablation the remnant polarization and leakage current behavior were studied varying the periodicity 880a of the superlattice the leakage current was reduced by few orders of magnitude on increase of periodicity compared to single layer bifeo3 thin films reduced leakage and intrinsic polarization hysteresis was observed and was confirmed by pund analysis for periodicities in the range 2060a the leakage current was observed to be dominated by space charge limited conduction | [['artificial', 'superlattices', 'of', 'bifeo3msrtio3m', 'm', '1', 'to', '10', 'unit', 'cells', 'consisting', 'of', 'multiferroic', 'bifeo3', 'and', 'insulating', 'srtio3', 'layers', 'were', 'fabricated', 'on', '100oriented', 'srtio3', 'substrates', 'by', 'pulsed', 'laser', 'ablation', 'the', 'remnant', 'polarization', 'and', 'leakage', 'current', 'behavior', 'were', 'studied', 'varying', 'the', 'periodicity', '880a', 'of', 'the', 'superlattice', 'the', 'leakage', 'current', 'was', 'reduced', 'by', 'few', 'orders', 'of', 'magnitude', 'on', 'increase', 'of', 'periodicity', 'compared', 'to', 'single', 'layer', 'bifeo3', 'thin', 'films', 'reduced', 'leakage', 'and', 'intrinsic', 'polarization', 'hysteresis', 'was', 'observed', 'and', 'was', 'confirmed', 'by', 'pund', 'analysis', 'for', 'periodicities', 'in', 'the', 'range', '2060a', 'the', 'leakage', 'current', 'was', 'observed', 'to', 'be', 'dominated', 'by', 'space', 'charge', 'limited', 'conduction']] | [-0.15072619988253186, 0.19658864685334265, 0.07634675013832748, -0.023205237385506432, -0.014800203837997591, -0.13177725639737523, 0.11152113893573794, 0.4773906678892672, -0.25948761822655797, -0.37073377061945695, 0.07017380674248368, -0.31779050297336653, -0.05187720538621458, 0.2359065923349893, -0.02831796061946079, 0.0409405693547645, -0.058415824227267876, -0.1685759084939491, -0.0693314355739858, -0.25140397885115817, 0.20605214619475495, 0.03226529748159616, 0.3475395976032208, 0.033975400273144864, 0.07043127664170849, -0.05205328594699191, 0.09851005145416518, 0.011383001859636957, -0.12740464262985066, 0.04116584705479909, 0.19342858239057628, -0.12929234792985275, 0.1435860588438421, -0.5045688680838794, -0.2732383420613284, -0.056239801488118246, 0.11292229025275446, 0.05491818940906038, -0.05630442878828035, -0.26205791828397196, 0.1270193542659399, -0.10776563769225807, -0.05858128193358425, -0.02325337581472316, 0.001007402897812426, -0.0005143293619767064, -0.20216736559147344, 0.07796917676265973, 0.04107049709030738, 0.14508213900990086, -0.11174089741931918, -0.15732814006817838, -0.10958857108683635, 0.03507372615664887, 0.06533852210850455, 0.09909340387093835, 0.26206228003138676, -0.04307450676181664, -0.13731226818830086, 0.2558657154731918, -0.052051267033675686, -0.04619162588884743, 0.11304965968398999, -0.22445904184132814, 0.033783753807559457, 0.2266576493299605, 0.08537532135414949, 0.09020242638265093, -0.14317025041479306, 0.04395435042533791, 0.04206940359047925, 0.28372373786987737, 0.1968202842156946, 0.04141541776334634, 0.223632837277061, 0.25392337067751214, -0.03129058280804505, 0.18705537929660446, -0.16830399866739754, 0.03177819231253428, -0.1495402692235075, -0.11833364264748525, -0.1899968126648067, 0.11246419136417292, -0.05868468020768584, -0.1498663802728212, 0.41707860248182743, 0.0825330644195977, 0.09792266659981881, -0.12007747870666208, 0.2677035176990709, 0.09138777905415434, 0.12098059231357183, -0.030285364443746705, 0.301778159494764, 0.18564787605040087, 0.17207192315026987, -0.25719637990308303, 0.16590383648872375, -0.05801702636138847] |
710.4778 | The Hasse principle for pairs of diagonal cubic forms | By means of the Hardy-Littlewood method, we apply a new mean value theorem
for exponential sums to confirm the truth, over the rational numbers, of the
Hasse principle for pairs of diagonal cubic forms in thirteen or more
variables.
| math.NT | by means of the hardylittlewood method we apply a new mean value theorem for exponential sums to confirm the truth over the rational numbers of the hasse principle for pairs of diagonal cubic forms in thirteen or more variables | [['by', 'means', 'of', 'the', 'hardylittlewood', 'method', 'we', 'apply', 'a', 'new', 'mean', 'value', 'theorem', 'for', 'exponential', 'sums', 'to', 'confirm', 'the', 'truth', 'over', 'the', 'rational', 'numbers', 'of', 'the', 'hasse', 'principle', 'for', 'pairs', 'of', 'diagonal', 'cubic', 'forms', 'in', 'thirteen', 'or', 'more', 'variables']] | [-0.16660151206246482, 0.054036273764303096, -0.1142893410884799, 0.10634661852740325, -0.0752733980711454, -0.07830753620379628, 0.11695435036642429, 0.2844688867529233, -0.29134851082777363, -0.26750069556948847, 0.08080865502154502, -0.25583733783031887, -0.12404577396451853, 0.2685042731404209, -0.05421660176645487, 0.044200763679467715, 0.020788026985545188, 0.09038498338598472, -0.10101274113194683, -0.3605658065718718, 0.3444005253079992, -0.09726988930159654, 0.2025678023122824, 0.018126963001962464, 0.10444676298170517, 0.09117101729871371, 0.007288234929243724, -0.0006354353271233729, -0.11514753411309077, 0.17991510955378032, 0.20811656615338647, 0.1158159736257333, 0.3148433286219071, -0.3627059578131407, -0.12465272368624425, 0.20672600787992662, 0.08522744080386101, 0.05699199891816347, 0.018705616589823667, -0.25859521014186054, 0.08352569830962099, -0.13917114230422065, -0.2405401216700482, -0.1246672637330798, -0.017252458928105157, 0.1005393572581502, -0.3244302542641377, 0.11220548541929859, 0.05913408438507945, 0.14731145388661668, -0.06747280916151328, -0.17749628873589712, 0.008854441631298799, 0.032296243380420864, 0.030797566967801407, -0.034060303217325456, -0.009675853993170537, -0.08399778382422832, -0.1519363321340046, 0.3372250510713993, -0.07349862864252944, -0.19141970646496004, 0.05610637997205441, -0.14172693306150344, -0.1507759311546882, 0.1590083599424897, 0.11070860767116149, 0.16834368790762547, -0.09213648238577522, 0.06490348872895806, -0.11470942545491151, 0.13013779677044696, 0.14399963247183806, -0.02252221322254254, 0.17269746042214906, 0.02407293437192073, 0.09459673842558494, 0.13796788568680102, -0.07199913299141023, -0.11202791440658845, -0.32696156432995427, -0.2198811254153649, -0.22220592683133406, 0.07662570240119329, -0.14839578497235495, -0.19128060617890114, 0.35256792404330695, 0.103155131248805, 0.14787423543823072, 0.16234351804432195, 0.20500405519627607, 0.09665657840191554, 0.1090668828632587, 0.010070414709797403, 0.1703611804315677, 0.23030632582063285, 0.007866399073137496, -0.1251677809856259, 0.05896933225150674, 0.22841582448484424] |
710.4779 | Leading Pollicott-Ruelle Resonances for Chaotic Area-Preserving Maps | Recent investigations in nonlinear sciences show that not only hyperbolic but
also mixed dynamical systems may exhibit exponential relaxation in the chaotic
regime. The relaxation rates, which lead the decay of probability distributions
and correlation functions, are related to the classical evolution resolvent
(Perron-Frobenius operator) pole logarithm, the so called Pollicott-Ruelle
resonances. In this Brief Report, the leading Pollicott-Ruelle resonances are
calculated analytically for a general class of area-preserving maps. Besides
the leading resonances related to the diffusive modes of momentum dynamics
(slow rate), we also calculate the leading faster rate, related to the angular
correlations. The analytical results are compared to the existing results in
the literature.
| nlin.CD | recent investigations in nonlinear sciences show that not only hyperbolic but also mixed dynamical systems may exhibit exponential relaxation in the chaotic regime the relaxation rates which lead the decay of probability distributions and correlation functions are related to the classical evolution resolvent perronfrobenius operator pole logarithm the so called pollicottruelle resonances in this brief report the leading pollicottruelle resonances are calculated analytically for a general class of areapreserving maps besides the leading resonances related to the diffusive modes of momentum dynamics slow rate we also calculate the leading faster rate related to the angular correlations the analytical results are compared to the existing results in the literature | [['recent', 'investigations', 'in', 'nonlinear', 'sciences', 'show', 'that', 'not', 'only', 'hyperbolic', 'but', 'also', 'mixed', 'dynamical', 'systems', 'may', 'exhibit', 'exponential', 'relaxation', 'in', 'the', 'chaotic', 'regime', 'the', 'relaxation', 'rates', 'which', 'lead', 'the', 'decay', 'of', 'probability', 'distributions', 'and', 'correlation', 'functions', 'are', 'related', 'to', 'the', 'classical', 'evolution', 'resolvent', 'perronfrobenius', 'operator', 'pole', 'logarithm', 'the', 'so', 'called', 'pollicottruelle', 'resonances', 'in', 'this', 'brief', 'report', 'the', 'leading', 'pollicottruelle', 'resonances', 'are', 'calculated', 'analytically', 'for', 'a', 'general', 'class', 'of', 'areapreserving', 'maps', 'besides', 'the', 'leading', 'resonances', 'related', 'to', 'the', 'diffusive', 'modes', 'of', 'momentum', 'dynamics', 'slow', 'rate', 'we', 'also', 'calculate', 'the', 'leading', 'faster', 'rate', 'related', 'to', 'the', 'angular', 'correlations', 'the', 'analytical', 'results', 'are', 'compared', 'to', 'the', 'existing', 'results', 'in', 'the', 'literature']] | [-0.13617698893735738, 0.1481499293025721, -0.11270006126034315, 0.1397221332030043, -0.05071220393465073, -0.1032465922557835, -0.01322273497417983, 0.3115663900454011, -0.2809607818964179, -0.20538456059215673, 0.09195325875986816, -0.2884119581722189, -0.18416746007278562, 0.210283766431665, -0.010897022775477834, 0.09379883482621086, 0.07077457410869775, 0.03355291420248924, -0.07587981729173204, -0.18676982035847484, 0.29672389546478234, 0.05375306586803937, 0.2549021001646502, 0.07245738198549521, 0.021763503974027657, -0.04875091264559025, -0.02376521877616782, -0.04760021233448276, -0.17986970376127662, 0.06537788784209153, 0.22963956588689513, 0.03712645084683404, 0.22266413969703502, -0.40890731866023056, -0.17911052332190727, 0.08527594806488466, 0.2025537646625674, 0.12176151322179336, -0.04611593289990668, -0.24656897972346525, 0.01962150692836278, -0.14068705156980152, -0.16793305338015435, -0.11745027667428884, 0.030857624630529986, 0.053443230962363523, -0.27836161012399113, 0.16678545788238774, 0.08962192493183668, 0.006131014877205921, -0.05980770700154136, -0.1300242684719032, -0.0028585842314728157, 0.08867551061255788, 0.09067337200836105, -0.0031553590454644074, 0.13447625892823217, -0.1054296195916659, -0.13878421362918475, 0.32536028013392176, -0.08874114942887833, -0.2147374196857628, 0.2088405378885067, -0.23567508226605477, -0.12034903646498504, 0.1939217677960793, 0.2044181314650578, 0.1339440227866699, -0.15211310402352224, 0.07069118537334294, 0.004222155630554038, 0.12197954164326398, 0.05810420546697936, 0.1134108977712458, 0.15400157870586823, 0.0780546092643851, 0.03168996081997951, 0.1296739614594521, -0.0445529684053596, -0.20239047307728064, -0.2763163290090031, -0.0914647628012096, -0.1337022877263802, 0.04333726174418526, -0.061185130340567814, -0.15595575033997497, 0.4176004981466879, 0.11772198028726659, 0.22273748005843824, 0.09214458949497419, 0.23398695843018316, 0.1910266916012107, 0.07348140193735836, 0.08098884818004821, 0.29148190708710225, 0.1651283173252725, 0.09665063631945048, -0.30112747201713286, 0.05194843930938212, 0.06524754451432575] |
710.478 | Querying XML Documents in Logic Programming | Extensible Markup Language (XML) is a simple, very flexible text format
derived from SGML. Originally designed to meet the challenges of large-scale
electronic publishing, XML is also playing an increasingly important role in
the exchange of a wide variety of data on the Web and elsewhere. XPath language
is the result of an effort to provide address parts of an XML document. In
support of this primary purpose, it becomes in a query language against an XML
document. In this paper we present a proposal for the implementation of the
XPath language in logic programming. With this aim we will describe the
representation of XML documents by means of a logic program. Rules and facts
can be used for representing the document schema and the XML document itself.
In particular, we will present how to index XML documents in logic programs:
rules are supposed to be stored in main memory, however facts are stored in
secondary memory by using two kind of indexes: one for each XML tag, and other
for each group of terminal items. In addition, we will study how to query by
means of the XPath language against a logic program representing an XML
document. It evolves the specialization of the logic program with regard to the
XPath expression. Finally, we will also explain how to combine the indexing and
the top-down evaluation of the logic program. To appear in Theory and Practice
of Logic Programming (TPLP)"
| cs.PL cs.DB | extensible markup language xml is a simple very flexible text format derived from sgml originally designed to meet the challenges of largescale electronic publishing xml is also playing an increasingly important role in the exchange of a wide variety of data on the web and elsewhere xpath language is the result of an effort to provide address parts of an xml document in support of this primary purpose it becomes in a query language against an xml document in this paper we present a proposal for the implementation of the xpath language in logic programming with this aim we will describe the representation of xml documents by means of a logic program rules and facts can be used for representing the document schema and the xml document itself in particular we will present how to index xml documents in logic programs rules are supposed to be stored in main memory however facts are stored in secondary memory by using two kind of indexes one for each xml tag and other for each group of terminal items in addition we will study how to query by means of the xpath language against a logic program representing an xml document it evolves the specialization of the logic program with regard to the xpath expression finally we will also explain how to combine the indexing and the topdown evaluation of the logic program to appear in theory and practice of logic programming tplp | [['extensible', 'markup', 'language', 'xml', 'is', 'a', 'simple', 'very', 'flexible', 'text', 'format', 'derived', 'from', 'sgml', 'originally', 'designed', 'to', 'meet', 'the', 'challenges', 'of', 'largescale', 'electronic', 'publishing', 'xml', 'is', 'also', 'playing', 'an', 'increasingly', 'important', 'role', 'in', 'the', 'exchange', 'of', 'a', 'wide', 'variety', 'of', 'data', 'on', 'the', 'web', 'and', 'elsewhere', 'xpath', 'language', 'is', 'the', 'result', 'of', 'an', 'effort', 'to', 'provide', 'address', 'parts', 'of', 'an', 'xml', 'document', 'in', 'support', 'of', 'this', 'primary', 'purpose', 'it', 'becomes', 'in', 'a', 'query', 'language', 'against', 'an', 'xml', 'document', 'in', 'this', 'paper', 'we', 'present', 'a', 'proposal', 'for', 'the', 'implementation', 'of', 'the', 'xpath', 'language', 'in', 'logic', 'programming', 'with', 'this', 'aim', 'we', 'will', 'describe', 'the', 'representation', 'of', 'xml', 'documents', 'by', 'means', 'of', 'a', 'logic', 'program', 'rules', 'and', 'facts', 'can', 'be', 'used', 'for', 'representing', 'the', 'document', 'schema', 'and', 'the', 'xml', 'document', 'itself', 'in', 'particular', 'we', 'will', 'present', 'how', 'to', 'index', 'xml', 'documents', 'in', 'logic', 'programs', 'rules', 'are', 'supposed', 'to', 'be', 'stored', 'in', 'main', 'memory', 'however', 'facts', 'are', 'stored', 'in', 'secondary', 'memory', 'by', 'using', 'two', 'kind', 'of', 'indexes', 'one', 'for', 'each', 'xml', 'tag', 'and', 'other', 'for', 'each', 'group', 'of', 'terminal', 'items', 'in', 'addition', 'we', 'will', 'study', 'how', 'to', 'query', 'by', 'means', 'of', 'the', 'xpath', 'language', 'against', 'a', 'logic', 'program', 'representing', 'an', 'xml', 'document', 'it', 'evolves', 'the', 'specialization', 'of', 'the', 'logic', 'program', 'with', 'regard', 'to', 'the', 'xpath', 'expression', 'finally', 'we', 'will', 'also', 'explain', 'how', 'to', 'combine', 'the', 'indexing', 'and', 'the', 'topdown', 'evaluation', 'of', 'the', 'logic', 'program', 'to', 'appear', 'in', 'theory', 'and', 'practice', 'of', 'logic', 'programming', 'tplp']] | [-0.10887386813802669, 0.01622055242088707, -0.06542292613317902, 0.11713567034781727, -0.17543981956886945, -0.12315856434295741, 0.05347422552860057, 0.39879827326062334, -0.33313594195235785, -0.3320930586215966, 0.08816130383285523, -0.27188261002803876, -0.08941048460576106, 0.1795246641241232, -0.12538382137159204, 0.03602802594461202, 0.04448141621242601, 0.06637048129507177, -0.002451365255403905, -0.26373900200345524, 0.31814124377709363, 0.05888978073911188, 0.27652247585979717, 0.02607161328235493, 0.03839378743617558, 0.02242203985796813, -0.06902562164035178, 0.0009107890595617669, -0.06904795559544007, 0.1843474558827362, 0.4305500314233895, 0.3012868625298922, 0.2760618977583789, -0.4586802152955757, -0.07710048993932528, 0.006841562481823077, 0.12310250658565298, 0.1281421206829189, -0.03378658632128733, -0.2852442583038031, 0.09595609041638127, -0.23937322680982587, -0.023348589075113564, -0.11590533269467962, 0.0619355383597969, -0.01572538156863146, -0.21327327144435493, -0.07959694847407084, 0.11649902232739466, 0.08402720207950513, -0.023836344978323976, -0.07436006165998033, 0.01663389060038403, 0.10839430779358956, 0.020511552037780316, 0.06365038275136126, 0.11669386980010812, -0.10723734352733769, -0.18449181598069528, 0.40657362027023625, -0.025553832261454874, -0.20145575443056712, 0.1359120939369216, -0.02604465786597563, -0.20738726048866699, 0.05887928286325732, 0.19007031051013384, 0.07224882118770205, -0.21454892995685465, 0.10532796824649054, -0.02043484278592168, 0.2600389531088767, 0.08202181122398246, 0.03195078570539888, 0.2373778381342045, 0.24166348478347688, -0.021355071116509656, 0.2055803796495155, 0.01253317203080461, -0.06495850965591093, -0.2838270345617039, -0.19458436447285335, -0.12602206335060112, -0.08835028754897946, -0.08131480485064009, -0.20765731139615115, 0.3886655722374572, 0.22275684771510854, 0.12172774861927903, 0.07434211499310998, 0.31928164418202254, 0.05321879981345766, 0.11711644947871754, 0.05679187174715008, 0.07066856611229744, 0.0241583065007069, 0.22109867996929766, -0.12462988691151174, 0.1286892145411813, 0.04198847441723625] |
710.4781 | Distributions for Higgs + jet at hadron colliders: MSSM vs SM | We present pseudorapidity and transverse momentum distributions for the cross
section for the production of the lightest neutral Higgs boson in association
with a high-p_T hadronic jet, calculated in the framework of the minimal
supersymmetric standard model. We discuss the theoretical predictions for the
differential cross sections at the Large Hadron Collider and the Tevatron. In
particular, we present the differences in the distributions compared to the
Standard Model.
| hep-ph hep-ex | we present pseudorapidity and transverse momentum distributions for the cross section for the production of the lightest neutral higgs boson in association with a highp_t hadronic jet calculated in the framework of the minimal supersymmetric standard model we discuss the theoretical predictions for the differential cross sections at the large hadron collider and the tevatron in particular we present the differences in the distributions compared to the standard model | [['we', 'present', 'pseudorapidity', 'and', 'transverse', 'momentum', 'distributions', 'for', 'the', 'cross', 'section', 'for', 'the', 'production', 'of', 'the', 'lightest', 'neutral', 'higgs', 'boson', 'in', 'association', 'with', 'a', 'highp_t', 'hadronic', 'jet', 'calculated', 'in', 'the', 'framework', 'of', 'the', 'minimal', 'supersymmetric', 'standard', 'model', 'we', 'discuss', 'the', 'theoretical', 'predictions', 'for', 'the', 'differential', 'cross', 'sections', 'at', 'the', 'large', 'hadron', 'collider', 'and', 'the', 'tevatron', 'in', 'particular', 'we', 'present', 'the', 'differences', 'in', 'the', 'distributions', 'compared', 'to', 'the', 'standard', 'model']] | [-0.020225248151067375, 0.1663049362140937, -0.07931441997947253, 0.19313048965473106, 0.011329780778159266, -0.09549755291959298, -0.035459956727867975, 0.3450979571485811, -0.19225401118856625, -0.25561297817857587, -0.06428949816651858, -0.34857853508783854, 0.0793228090227838, 0.13582258372554096, 0.06783100121749053, 0.16442185748989382, 0.12467568257040736, 0.004200388414218374, -0.05074523830705363, -0.19287469688519512, 0.3206998612731695, 0.07502427494720272, 0.22005751544096763, 0.1629229682646152, 0.08897218367159096, 0.08425137524803479, -0.0695686823835232, -0.04168301450925461, -0.16999986703656073, 0.14189540046820606, 0.2171472274374379, 0.05781667131215226, 0.08268474356905706, -0.33573338821314386, -0.08957941607450662, 0.14239119321269833, 0.13028068559757178, 0.09605866793435121, -0.09329376612668452, -0.26201651820346067, 0.10065026905900543, -0.29097707529275585, -0.10469827872525522, -0.027403310789942632, -0.031361396903631045, -0.046001905629384346, -0.2952988884155301, 0.11340217782940337, -0.09060439900697573, 0.04164002450567711, -0.010881611642063312, -0.2082782608382674, -0.08648456604071501, -0.024096081795953753, 0.1526414554235458, -0.005612587347032799, 0.1722390736196784, -0.23322655624993469, -0.22414562405775423, 0.3933642225852911, -0.10552200009587451, -0.22847273942602772, 0.14466345595006924, -0.2720567566221175, -0.1572644725860353, 0.13191140664444453, 0.3045780207030475, 0.08847288845066467, -0.16768269567493943, 0.14356264185693546, -0.041864526741530586, 0.11813093719841994, 0.014629008410417515, 0.02608357927006116, 0.19597833115013613, 0.2317068955246899, -0.037672813151679606, 0.07057274826734826, -0.17559748958202376, -0.14128058826199907, -0.5221692521287047, -0.18707479058724383, 0.0062305079570606995, -0.017031241409089147, -0.058682586300520874, -0.09539001279820998, 0.41640297830968664, 0.11972579835792599, 0.34030555526091566, 0.05075176417881596, 0.34163675516290404, 0.10353106530248254, 0.060313649872483256, 0.05713546786021165, 0.3570794780144765, 0.17585294294184534, 0.178931738310696, -0.21025879008938436, 0.028907316223974678, 0.06305679780147645] |
710.4782 | q-Dependence of the giant bond-stretching phonon anomaly in the stripe
compound La1.48Nd0.4Sr0.12CuO4 measured by IXS | Inelastic x-ray scattering (IXS) was used to study the Cu-O bond-stretching
vibrations in the static stripe phase compound La1.48Nd0.4Sr0.12CuO4. It was
found that the intrinsic width in Q-space of the previously reported huge
anomalous phonon softening and broadening is approximately 0.08r.l.u HWHM. A
detailed comparison was also made to inelastic neutron scattering (INS)
studies, which indicate a two-peak lineshape (with superimposed broad and
narrow peaks) in the vicinity of the anomaly. The high resolution IXS data show
that the narrow peak is mostly an artifact of the poor transverse Q-resolution
of INS. Otherwise the agreement between the INS and IXS was excellent.
| cond-mat.supr-con | inelastic xray scattering ixs was used to study the cuo bondstretching vibrations in the static stripe phase compound la148nd04sr012cuo4 it was found that the intrinsic width in qspace of the previously reported huge anomalous phonon softening and broadening is approximately 008rlu hwhm a detailed comparison was also made to inelastic neutron scattering ins studies which indicate a twopeak lineshape with superimposed broad and narrow peaks in the vicinity of the anomaly the high resolution ixs data show that the narrow peak is mostly an artifact of the poor transverse qresolution of ins otherwise the agreement between the ins and ixs was excellent | [['inelastic', 'xray', 'scattering', 'ixs', 'was', 'used', 'to', 'study', 'the', 'cuo', 'bondstretching', 'vibrations', 'in', 'the', 'static', 'stripe', 'phase', 'compound', 'la148nd04sr012cuo4', 'it', 'was', 'found', 'that', 'the', 'intrinsic', 'width', 'in', 'qspace', 'of', 'the', 'previously', 'reported', 'huge', 'anomalous', 'phonon', 'softening', 'and', 'broadening', 'is', 'approximately', '008rlu', 'hwhm', 'a', 'detailed', 'comparison', 'was', 'also', 'made', 'to', 'inelastic', 'neutron', 'scattering', 'ins', 'studies', 'which', 'indicate', 'a', 'twopeak', 'lineshape', 'with', 'superimposed', 'broad', 'and', 'narrow', 'peaks', 'in', 'the', 'vicinity', 'of', 'the', 'anomaly', 'the', 'high', 'resolution', 'ixs', 'data', 'show', 'that', 'the', 'narrow', 'peak', 'is', 'mostly', 'an', 'artifact', 'of', 'the', 'poor', 'transverse', 'qresolution', 'of', 'ins', 'otherwise', 'the', 'agreement', 'between', 'the', 'ins', 'and', 'ixs', 'was', 'excellent']] | [-0.1275604215293424, 0.10431135601902497, -0.0835602520260727, 0.09826460380339995, -0.11336265690624714, -0.0941239049192518, 0.06299025736749173, 0.4609985303133726, -0.23890135392546655, -0.2960271902941167, -0.0024968331574928017, -0.39320906963199376, -0.08291608165483921, 0.1880201258510351, 0.06077184582129121, 0.05187333599897102, 0.047484371807076965, -0.0002100146608427167, -0.060497693349607286, -0.15243631945573724, 0.25540568760596216, 0.13340541681740434, 0.3618987564742565, 0.12594555878546088, 0.03078985376865603, 0.07914048065722454, 0.011397029254585505, -0.002228823786135763, -0.10554360440539312, 0.03158943088725209, 0.30505389512516556, -0.0973587787989527, 0.11585788005497306, -0.3596142747998238, -0.23331026558415033, 0.0007627743668854237, 0.199179057511501, 0.10971922420314513, -0.020490900231525302, -0.2744494827091694, 0.04478401723434217, -0.1011458301357925, -0.13850270945578813, -0.050118823684751984, -0.0017613639310002328, 0.01337253771489486, -0.1910847333353013, 0.14597291766229317, 0.05040549362078309, 0.10570677416399121, -0.1477605092898011, -0.13789455959107727, -0.009784138267859817, 0.007031465284526348, 0.08038305326830596, 0.06071232264162973, 0.09757726598996669, -0.07183001922090625, -0.09856822044588626, 0.3253680912964046, -0.054494308913126586, 0.0024680516496300695, 0.1577174675860442, -0.25091263349168, -0.09030422294512391, 0.29661262361099944, 0.05047189088742016, 0.06671404995024205, -0.1638752823881805, 0.005779516359907575, -0.05434914002718869, 0.2509437445551157, 0.09016985565889626, 0.05679428593190096, 0.20556788159068673, 0.20702335131005384, -0.06910731974756346, 0.11197766127064825, -0.23341479446738958, -0.005151652740314603, -0.2004311118228361, -0.0682020770246163, -0.15483407798688859, 0.0275270594866015, -0.05141915018160944, -0.16881941977888346, 0.31533142418018545, 0.09058910130523146, 0.23912311285501345, -0.106107298679417, 0.280045957043767, 0.13564159899018705, 0.09173657428473234, 0.02726224237587303, 0.3263716203439981, 0.20634771225973964, 0.1752040284126997, -0.3481938117882237, 0.06760658206883818, -0.10587598188780248] |
710.4783 | The ANTARES Detector: Electronics and Readout | In this paper, we illustrate the main features of the electronics and data
acquisition systems of the ANTARES apparatus, a large volume, deep-sea neutrino
telescope under construction in the Mediterranean Sea off the coast of Toulon,
France. The apparatus consists of an array of 900 large-area photomultipliers
arranged on 12 detection lines, 5 of which are in data acquisition since
January 2007. The schedule is to complete the apparatus construction in early
2008.
| astro-ph | in this paper we illustrate the main features of the electronics and data acquisition systems of the antares apparatus a large volume deepsea neutrino telescope under construction in the mediterranean sea off the coast of toulon france the apparatus consists of an array of 900 largearea photomultipliers arranged on 12 detection lines 5 of which are in data acquisition since january 2007 the schedule is to complete the apparatus construction in early 2008 | [['in', 'this', 'paper', 'we', 'illustrate', 'the', 'main', 'features', 'of', 'the', 'electronics', 'and', 'data', 'acquisition', 'systems', 'of', 'the', 'antares', 'apparatus', 'a', 'large', 'volume', 'deepsea', 'neutrino', 'telescope', 'under', 'construction', 'in', 'the', 'mediterranean', 'sea', 'off', 'the', 'coast', 'of', 'toulon', 'france', 'the', 'apparatus', 'consists', 'of', 'an', 'array', 'of', '900', 'largearea', 'photomultipliers', 'arranged', 'on', '12', 'detection', 'lines', '5', 'of', 'which', 'are', 'in', 'data', 'acquisition', 'since', 'january', '2007', 'the', 'schedule', 'is', 'to', 'complete', 'the', 'apparatus', 'construction', 'in', 'early', '2008']] | [-0.10169483531563071, 0.16328447904259968, -0.04572836569931409, -0.008912224998723154, -0.011298451904360561, -0.07755775700565683, 0.011713262381070382, 0.31633613916904957, -0.1349517050173695, -0.38265407996328726, 0.1912238650049453, -0.34258414062428966, -0.09071508842864878, 0.2397100542455095, -0.11426645635359295, 0.006281262480539002, 0.16444558534158826, -0.06482422853379881, -0.012628803670738046, -0.2891640403540805, 0.2244929928995975, 0.1738729678757795, 0.3474693522877889, 0.037155273953318746, 0.18429846132544112, -0.023888616644050162, -0.09450574961733328, -0.13198969097272173, -0.04839911060535336, 0.08572944143965636, 0.31423492987372287, 0.1626175648201104, 0.17145082452780988, -0.4486999057794679, -0.0907090521945414, 0.06795127539933749, 0.05351409101731157, 0.020908605350398343, -0.00757063011326253, -0.3465482370915172, 0.007931692882964057, -0.16758445206366174, -0.18374741312167417, 0.07287503322203683, 0.016365021543755923, 0.0013448996086643167, -0.19407968031727288, -0.04496456651425321, -0.001759893732936415, 0.1289037251781213, -0.0606879488539512, -0.13654343276093267, 0.025105369154504207, 0.12373982378192348, -0.03001940683206569, 0.005717907659071562, 0.13077889980225224, -0.06540298877500814, -0.03457167296198337, 0.3175875052350433, -0.030925464730276023, -0.031351145714113154, 0.14542593215018101, -0.18927509844150037, -0.13196046782453377, 0.1829640726648169, 0.24577678042011056, 0.05294106186890643, -0.24852423585492045, 0.08109475390216948, -0.054610055093079396, 0.17318401345345255, 0.12742454045107715, -0.054170859457720835, 0.25095497168702624, 0.2985851758810347, 0.10475079906619575, 0.11090494667766743, -0.23285786339005277, -0.03717247716929406, -0.32759602970048174, -0.15874665273331132, -0.14747509707326759, 0.029751640428750687, 0.00296442046118039, -0.13791716037547752, 0.41766427661458105, 0.1063309297705554, 0.12539873528932158, -0.033056584966675163, 0.31880315712155544, -0.05573632388873256, 0.08371006343386149, 0.03723848178625515, 0.24323244579136372, 0.10190328634152673, 0.22022130289944272, -0.1833089734810366, -0.030723175735608357, 0.01633060660870261] |
710.4784 | Linearization of fourth-order ordinary differential equations by point
transformations | We present here the solution of the problem on linearization of fourth-order
equations by means of point transformations. We show that all fourth-order
equations that are linearizable by point transformations are contained in the
class of equations which is linear in the third-order derivative. We provide
the linearization test and describe the procedure for obtaining the linearizing
transformations as well as the linearized equation.
| math.CA | we present here the solution of the problem on linearization of fourthorder equations by means of point transformations we show that all fourthorder equations that are linearizable by point transformations are contained in the class of equations which is linear in the thirdorder derivative we provide the linearization test and describe the procedure for obtaining the linearizing transformations as well as the linearized equation | [['we', 'present', 'here', 'the', 'solution', 'of', 'the', 'problem', 'on', 'linearization', 'of', 'fourthorder', 'equations', 'by', 'means', 'of', 'point', 'transformations', 'we', 'show', 'that', 'all', 'fourthorder', 'equations', 'that', 'are', 'linearizable', 'by', 'point', 'transformations', 'are', 'contained', 'in', 'the', 'class', 'of', 'equations', 'which', 'is', 'linear', 'in', 'the', 'thirdorder', 'derivative', 'we', 'provide', 'the', 'linearization', 'test', 'and', 'describe', 'the', 'procedure', 'for', 'obtaining', 'the', 'linearizing', 'transformations', 'as', 'well', 'as', 'the', 'linearized', 'equation']] | [-0.13375363197565093, 0.020856140308751492, -0.07014931840785721, 0.015083531974596553, -0.09321087187709054, -0.09009984685690142, -0.026805344106833218, 0.29736408158714767, -0.3039494805270806, -0.2518415624508634, 0.14950341154326452, -0.30434039543615654, -0.22544742637546733, 0.18899359509669011, 0.0015239301792462356, 0.11766636023094179, 0.03523211579886265, 0.011000523777056515, -0.15951309388765367, -0.2421227073064074, 0.38356884958921, -0.03093001361412462, 0.20957784174970584, -0.032430217805085704, 0.20480026715085842, -0.012474018541979603, -0.025243991709430702, 0.024632948050566483, -0.10701211591117499, 0.044007534668708104, 0.2506886448027217, 0.10160816634743242, 0.24231876583507983, -0.40142156431102194, -0.18074929625436198, 0.03186938911312609, 0.1010313806909835, 0.17489490649859363, -0.067128288847357, -0.27330123605497647, 0.11242003906227183, -0.08654037115047686, -0.18972560121619608, -0.16789996391162276, -0.04202627280028537, 0.07686356281192275, -0.2315850053273607, 0.128646895987913, 0.10714501654911146, 0.03139418458158616, -0.1252497766399756, -0.04348202675464563, -0.036998141895310255, 0.038893112156074494, 0.019918916797905695, -0.042517675858107395, 0.04238529842405114, -0.10263741745438892, -0.06793563422252191, 0.45104109460953623, -0.09687974359258078, -0.3218437749892473, 0.09412664483534172, -0.09927312847867142, -0.13551279443709063, 0.0795902375408275, 0.16199918572965544, 0.20863012158224592, -0.22027756612806115, 0.13917943322212523, -0.04389416842604987, 0.1190126974879604, 0.08736007960033021, -0.030564770255296025, 0.11215224731131457, 0.09941362952667987, 0.09576659262529574, 0.15479648720065597, -0.002916843481216347, -0.14202927555743372, -0.4171295806299895, -0.16079264803556725, -0.12538308861076075, 0.043993912724545226, -0.09476410689762815, -0.1849482473480748, 0.3945954803493805, 0.1673203336831648, 0.14136483368929476, 0.0750785443760833, 0.24985032055701595, 0.2825075871187437, 0.03784755523520289, 0.08811830089689465, 0.2627250985970022, 0.1127995006427227, 0.06511425216012867, -0.23938955320772948, 0.002280390603118576, 0.2251800388621632] |
710.4785 | Influence of surface diffusion on catalytic reactivity of spatially
inhomogeneous surfaces mean field modeling | Kinetics of model catalytic processes proceeding on inhomogeneous surfaces is
studied. We employ an extended mean-field model that takes into account surface
inhomogeneities. The influence of surface diffusion of adsorbent on the
kinetics of the catalytic process is investigated. It is shown that diffusion
is responsible for differences in the reaction rate of systems with different
arrangements of active sites. The presence of cooperative effects between
inactive and active sites is demonstrated and the conditions when these effects
are important are discussed. We show that basic catalytic phenomena on
nonuniform surfaces can be studied with mean-field modeling methods.
| cond-mat.mtrl-sci | kinetics of model catalytic processes proceeding on inhomogeneous surfaces is studied we employ an extended meanfield model that takes into account surface inhomogeneities the influence of surface diffusion of adsorbent on the kinetics of the catalytic process is investigated it is shown that diffusion is responsible for differences in the reaction rate of systems with different arrangements of active sites the presence of cooperative effects between inactive and active sites is demonstrated and the conditions when these effects are important are discussed we show that basic catalytic phenomena on nonuniform surfaces can be studied with meanfield modeling methods | [['kinetics', 'of', 'model', 'catalytic', 'processes', 'proceeding', 'on', 'inhomogeneous', 'surfaces', 'is', 'studied', 'we', 'employ', 'an', 'extended', 'meanfield', 'model', 'that', 'takes', 'into', 'account', 'surface', 'inhomogeneities', 'the', 'influence', 'of', 'surface', 'diffusion', 'of', 'adsorbent', 'on', 'the', 'kinetics', 'of', 'the', 'catalytic', 'process', 'is', 'investigated', 'it', 'is', 'shown', 'that', 'diffusion', 'is', 'responsible', 'for', 'differences', 'in', 'the', 'reaction', 'rate', 'of', 'systems', 'with', 'different', 'arrangements', 'of', 'active', 'sites', 'the', 'presence', 'of', 'cooperative', 'effects', 'between', 'inactive', 'and', 'active', 'sites', 'is', 'demonstrated', 'and', 'the', 'conditions', 'when', 'these', 'effects', 'are', 'important', 'are', 'discussed', 'we', 'show', 'that', 'basic', 'catalytic', 'phenomena', 'on', 'nonuniform', 'surfaces', 'can', 'be', 'studied', 'with', 'meanfield', 'modeling', 'methods']] | [-0.12400287999747778, 0.18420086414876932, -0.04257207420655783, 0.08570550062776587, 0.02629688401392908, -0.1358159433347078, 0.024176064313256314, 0.4221273090082164, -0.25071983460374936, -0.2528293957097494, 0.04301676785511592, -0.257073443335462, -0.2099877979739436, 0.17490704701168044, -0.002097760519602013, -0.030034668130648076, 0.021563131930021455, -0.015896223903614646, 0.010151018870861403, -0.24040662793784726, 0.30853131305122256, 0.0789713670537636, 0.3097967433420067, 0.108327107774854, 0.09045617484691915, -0.026411062101738488, -0.012071677578651175, 0.0517579695704032, -0.14736701199677665, 0.08193266366778312, 0.19745690290987186, 0.022596229157619635, 0.21311144327402723, -0.5066776486037641, -0.32480400015733074, 0.06064019770342476, 0.14130390308113122, 0.1374530541263307, -0.09823945370070371, -0.24533300291822882, 0.03769995357689201, -0.08833395447035568, -0.10511358277111942, -0.04747002308580036, 0.04734109317389678, 0.08073761186809564, -0.24757956838881484, 0.095477562644804, 0.10230867428781122, 0.06344942336103745, -0.12361035134871395, -0.13310848677302806, -0.08448149540879744, 0.15657410340066477, 0.05808510235481069, -0.07101183419670597, 0.2162330120692638, -0.08918909743732335, -0.09514699423951763, 0.41793360317848166, -0.029991183928879245, -0.2040646804724725, 0.2496358926446006, -0.13426275664883458, -0.11694851786620458, 0.1734488315082022, 0.22142563517946673, 0.15113030764635424, -0.1873930255695049, 0.07857266964500162, 0.020166682488075932, 0.12884493459168136, -0.005270292155672701, -0.017118187103306457, 0.16622149704941264, 0.2485831835466361, 0.021913375981076032, 0.1438752990869368, -0.092261705093789, -0.17505576330408149, -0.23633105258400344, -0.145822868643243, -0.12598275472124926, 0.03164677954592495, -0.0532293299599717, -0.12972604571360552, 0.3245023636251916, 0.11773399850448632, 0.17012999011488744, -0.06788330780085633, 0.2187328340286123, 0.1097274646495602, 0.0400917749490817, 0.00921937710681588, 0.23274224396909074, 0.14821086216679946, 0.030133872563779657, -0.2645713831250537, 0.177251527157175, 0.07347005179712587] |
710.4786 | Proper motions of field L and T dwarfs | The proper motion measurements for 143 previously known L and T dwarfs are
presented. From this sample we identify and discuss 8 high velocity L dwarfs.
We also find 4 new wide common proper motion binaries/multiple systems. Using
the moving cluster methods we have also identified a number of L dwarfs that
may be members of the Ursa Major (age ~400 Myr), the Hyades (age ~625 Myr) and
the Pleiades (age ~125 Myr) moving groups.
| astro-ph | the proper motion measurements for 143 previously known l and t dwarfs are presented from this sample we identify and discuss 8 high velocity l dwarfs we also find 4 new wide common proper motion binariesmultiple systems using the moving cluster methods we have also identified a number of l dwarfs that may be members of the ursa major age 400 myr the hyades age 625 myr and the pleiades age 125 myr moving groups | [['the', 'proper', 'motion', 'measurements', 'for', '143', 'previously', 'known', 'l', 'and', 't', 'dwarfs', 'are', 'presented', 'from', 'this', 'sample', 'we', 'identify', 'and', 'discuss', '8', 'high', 'velocity', 'l', 'dwarfs', 'we', 'also', 'find', '4', 'new', 'wide', 'common', 'proper', 'motion', 'binariesmultiple', 'systems', 'using', 'the', 'moving', 'cluster', 'methods', 'we', 'have', 'also', 'identified', 'a', 'number', 'of', 'l', 'dwarfs', 'that', 'may', 'be', 'members', 'of', 'the', 'ursa', 'major', 'age', '400', 'myr', 'the', 'hyades', 'age', '625', 'myr', 'and', 'the', 'pleiades', 'age', '125', 'myr', 'moving', 'groups']] | [-0.08708747553739797, 0.194714607922612, -0.06666918317913204, 0.08019413601928013, -0.1409543619642185, -0.09157815164685049, 0.12635752136073378, 0.4588893952376738, -0.20465651707648225, -0.42315038973213853, 0.04462409391999245, -0.25721429367675575, 0.010482374339591007, 0.20875856555004074, -0.10343899042030948, -0.0421896009655619, 0.15440913681192575, 0.04778036263746184, -0.03280053188004908, -0.3255424193685522, 0.24519681890268583, -0.03686963405296508, 0.07348128936624758, -0.08836098446988978, 0.04702918174852793, -0.08831606160950016, -0.10744855822240179, -0.03533497185924569, -0.2287310987332013, -0.021210806173700338, 0.2147216655257334, 0.09196525089744781, 0.28351956963337754, -0.20613631394617432, -0.17954332643578685, 0.03806996382804386, 0.21609551720698741, 0.014291034275162462, -0.09305962423693288, -0.32193126295366, 0.1649911168559983, -0.22022253831194058, -0.19665789507279122, 0.09750673834335159, 0.14671046242143052, 0.017221689891271496, -0.1749828698780589, 0.1750875066429364, 0.004643672715394279, 0.19659541294331084, -0.16495677646929147, -0.2542445022688323, 0.02674571279990109, 0.12522458757047314, -0.030311892023058357, 0.08136541527740003, 0.16568823165348354, -0.04601238208281732, -0.07846644548447551, 0.3780094418372657, -0.07899786098986059, -0.0004163218058041624, 0.3157225574643628, -0.1671719579655375, -0.1585978128871805, 0.08341458850112315, 0.1403646179525232, 0.14204949588590376, -0.23484478715958224, 0.007335285792234228, -0.025957457305913843, 0.17313395682218913, 0.0625336131622159, 0.033618557336110924, 0.2457106119097286, 0.11795154312229086, 0.03830390455943809, 0.011707876914344426, -0.29939016589668355, -0.029584521792728354, -0.258923709990356, -0.16510915558634176, -0.048339045933775, 0.050912118479106074, -0.1592245269560875, -0.085570165022226, 0.2760175036618838, 0.1503042854239686, 0.19956393200727934, 0.06027668762033352, 0.20401796625574697, 0.04215299812416118, 0.18691640863245404, 0.1889144777370667, 0.2128948128555675, 0.21893390382614894, 0.044072239156309014, -0.22246852667288025, 0.004425145440256676, -0.02869906953875781] |
710.4787 | SUSY sensitivity in final states with leptons, jets, and missing
transverse energy | Final states with leptons, jets and missing transverse energy are a promising
way to detect Supersymmetry at the Large Hadron Collider. Results of simulation
studies performed by the CMS and ATLAS collaborations are presented. The
discovery of new physics is shown to be possible within the first fb^-1 of
collected integrated luminosity.
| hep-ph | final states with leptons jets and missing transverse energy are a promising way to detect supersymmetry at the large hadron collider results of simulation studies performed by the cms and atlas collaborations are presented the discovery of new physics is shown to be possible within the first fb1 of collected integrated luminosity | [['final', 'states', 'with', 'leptons', 'jets', 'and', 'missing', 'transverse', 'energy', 'are', 'a', 'promising', 'way', 'to', 'detect', 'supersymmetry', 'at', 'the', 'large', 'hadron', 'collider', 'results', 'of', 'simulation', 'studies', 'performed', 'by', 'the', 'cms', 'and', 'atlas', 'collaborations', 'are', 'presented', 'the', 'discovery', 'of', 'new', 'physics', 'is', 'shown', 'to', 'be', 'possible', 'within', 'the', 'first', 'fb1', 'of', 'collected', 'integrated', 'luminosity']] | [-0.04442971560918242, 0.18823874993428874, -0.09523235003535564, 0.13703163678851873, -0.09480686199206573, -0.11245731186444083, -0.05833153412319147, 0.35400756366121083, -0.17585403705015779, -0.3927713409782602, 0.04677124193179994, -0.36316138088631517, 0.07054862714945696, 0.17094979354610237, 0.07836323741447324, 0.1737478214960832, 0.19481040146918252, -0.0895708529636837, -0.021929517890944574, -0.26715932668258363, 0.24563455052870828, 0.1515664467946268, 0.2390585214150353, 0.07019230236227696, 0.09331225413076866, -0.040195642840654515, -0.10247568804054306, -0.03262695423864688, -0.08367155203953959, 0.11363674774922682, 0.319476013430036, 0.09889474645471917, 0.15426801089639552, -0.37616062346989143, -0.05985357529985217, 0.11388727741387601, 0.14972595369013456, 0.056527153302270636, -0.13455733278085694, -0.377300107672524, 0.1663888295252736, -0.23712597117544368, -0.1444522311212495, -0.04952796078466166, 0.006563910211508091, -0.09283860446885228, -0.29171638805061006, 0.10164642625470431, -0.1254590477866049, 0.05915727896186022, -0.004665804668687857, -0.2074915673583746, -0.11148088952848831, -0.0034975862721554362, 0.09463467770882954, 0.0391413893241686, 0.16682352781152496, -0.15846214004201242, -0.29343724630486506, 0.2672710608726797, 0.03688620217144489, -0.11237868792019211, 0.27185755201543754, -0.21407066361727908, -0.13832382570343235, 0.1432692759598677, 0.3137318189434994, 0.03128170188014897, -0.256126405881682, 0.08075759088611588, -0.015652318825372137, 0.15913269883738115, 0.01838033850967454, 0.056074568728665605, 0.23958983520816007, 0.27796769249611175, 0.0180210132832424, 0.10158884980438206, -0.13259384172180524, -0.01865134506526654, -0.4839589854415793, -0.09681733869589292, -0.14859841423682296, 0.013484526660669452, 0.0559119358843488, -0.011872419193633296, 0.3926800869118709, 0.12346049211023805, 0.3055688481634626, -0.03984501977594426, 0.2807560579206508, 0.059278781669071086, 0.12401610807473144, 0.08059281649939994, 0.35716917992641145, 0.10392576834419742, 0.18823156520151174, -0.1911303928354755, -0.016489127315043543, 0.006614642477451036] |
710.4788 | A Bayesian Hierarchical Model for the Analysis of a Longitudinal Dynamic
Contrast-Enhanced MRI Cancer Study | Imaging in clinical oncology trials provides a wealth of information that
contributes to the drug development process, especially in early phase studies.
This paper focuses on kinetic modeling in DCE-MRI, inspired by mixed-effects
models that are frequently used in the analysis of clinical trials. Instead of
summarizing each scanning session as a single kinetic parameter -- such as
median $\ktrans$ across all voxels in the tumor ROI -- we propose to analyze
all voxel time courses from all scans and across all subjects simultaneously in
a single model. The kinetic parameters from the usual non-linear regression
model are decomposed into unique components associated with factors from the
longitudinal study; e.g., treatment, patient and voxel effects. A Bayesian
hierarchical model provides the framework in order to construct a data model, a
parameter model, as well as prior distributions. The posterior distribution of
the kinetic parameters is estimated using Markov chain Monte Carlo (MCMC)
methods. Hypothesis testing at the study level for an overall treatment effect
is straightforward and the patient- and voxel-level parameters capture random
effects that provide additional information at various levels of resolution to
allow a thorough evaluation of the clinical trial. The proposed method is
validated with a breast cancer study, where the subjects were imaged before and
after two cycles of chemotherapy, demonstrating the clinical potential of this
method to longitudinal oncology studies.
| stat.AP physics.med-ph | imaging in clinical oncology trials provides a wealth of information that contributes to the drug development process especially in early phase studies this paper focuses on kinetic modeling in dcemri inspired by mixedeffects models that are frequently used in the analysis of clinical trials instead of summarizing each scanning session as a single kinetic parameter such as median ktrans across all voxels in the tumor roi we propose to analyze all voxel time courses from all scans and across all subjects simultaneously in a single model the kinetic parameters from the usual nonlinear regression model are decomposed into unique components associated with factors from the longitudinal study eg treatment patient and voxel effects a bayesian hierarchical model provides the framework in order to construct a data model a parameter model as well as prior distributions the posterior distribution of the kinetic parameters is estimated using markov chain monte carlo mcmc methods hypothesis testing at the study level for an overall treatment effect is straightforward and the patient and voxellevel parameters capture random effects that provide additional information at various levels of resolution to allow a thorough evaluation of the clinical trial the proposed method is validated with a breast cancer study where the subjects were imaged before and after two cycles of chemotherapy demonstrating the clinical potential of this method to longitudinal oncology studies | [['imaging', 'in', 'clinical', 'oncology', 'trials', 'provides', 'a', 'wealth', 'of', 'information', 'that', 'contributes', 'to', 'the', 'drug', 'development', 'process', 'especially', 'in', 'early', 'phase', 'studies', 'this', 'paper', 'focuses', 'on', 'kinetic', 'modeling', 'in', 'dcemri', 'inspired', 'by', 'mixedeffects', 'models', 'that', 'are', 'frequently', 'used', 'in', 'the', 'analysis', 'of', 'clinical', 'trials', 'instead', 'of', 'summarizing', 'each', 'scanning', 'session', 'as', 'a', 'single', 'kinetic', 'parameter', 'such', 'as', 'median', 'ktrans', 'across', 'all', 'voxels', 'in', 'the', 'tumor', 'roi', 'we', 'propose', 'to', 'analyze', 'all', 'voxel', 'time', 'courses', 'from', 'all', 'scans', 'and', 'across', 'all', 'subjects', 'simultaneously', 'in', 'a', 'single', 'model', 'the', 'kinetic', 'parameters', 'from', 'the', 'usual', 'nonlinear', 'regression', 'model', 'are', 'decomposed', 'into', 'unique', 'components', 'associated', 'with', 'factors', 'from', 'the', 'longitudinal', 'study', 'eg', 'treatment', 'patient', 'and', 'voxel', 'effects', 'a', 'bayesian', 'hierarchical', 'model', 'provides', 'the', 'framework', 'in', 'order', 'to', 'construct', 'a', 'data', 'model', 'a', 'parameter', 'model', 'as', 'well', 'as', 'prior', 'distributions', 'the', 'posterior', 'distribution', 'of', 'the', 'kinetic', 'parameters', 'is', 'estimated', 'using', 'markov', 'chain', 'monte', 'carlo', 'mcmc', 'methods', 'hypothesis', 'testing', 'at', 'the', 'study', 'level', 'for', 'an', 'overall', 'treatment', 'effect', 'is', 'straightforward', 'and', 'the', 'patient', 'and', 'voxellevel', 'parameters', 'capture', 'random', 'effects', 'that', 'provide', 'additional', 'information', 'at', 'various', 'levels', 'of', 'resolution', 'to', 'allow', 'a', 'thorough', 'evaluation', 'of', 'the', 'clinical', 'trial', 'the', 'proposed', 'method', 'is', 'validated', 'with', 'a', 'breast', 'cancer', 'study', 'where', 'the', 'subjects', 'were', 'imaged', 'before', 'and', 'after', 'two', 'cycles', 'of', 'chemotherapy', 'demonstrating', 'the', 'clinical', 'potential', 'of', 'this', 'method', 'to', 'longitudinal', 'oncology', 'studies']] | [-0.007374024052055962, 0.06946517703821099, -0.07581630548239882, 0.07195311393504113, -0.05310189057947575, -0.1362186919839326, 0.05198353551998484, 0.39870062534960465, -0.22266051565367945, -0.32561440876112924, 0.09674727195882209, -0.2693552070364122, -0.12880907457889865, 0.19010897878152339, -0.0536188438739377, 0.06310663772579868, 0.10179108744194823, 0.015553639445901794, -0.025890978693235416, -0.2246945826044398, 0.258251778643595, 0.07757302261721928, 0.32448763733587727, -0.016901927995975778, 0.12319094918860382, 0.041053541401409516, -0.08186122382502385, 0.005985588541112406, -0.13101442747134293, 0.09272797112123447, 0.3165878822737836, 0.19231137669866596, 0.3610043664663328, -0.4303751957139226, -0.27839832457780606, 0.0880969485232498, 0.11888673261241024, 0.10831077108180542, -0.0059090591742627895, -0.27139259705679164, 0.029868499868687226, -0.14965764043180296, -0.05416917481217972, -0.08207078748946434, -0.05527192475315969, 0.0013246588479944677, -0.33445434302411087, 0.13911407298278983, -0.02354336030219552, 0.12663867819695127, -0.08597758351699887, -0.13724009062668868, -0.015231937334471854, 0.16318161407226672, 0.08628239805772045, 0.029371774985769247, 0.15177940061282483, -0.15507771712706964, -0.13570203459320482, 0.3380965457899254, 0.0023079550325987453, -0.19298821494751714, 0.1517584272869132, -0.1357743470917034, -0.13736623656129957, 0.13452236518063354, 0.21633616223463564, 0.11956451985579936, -0.22680358237883436, 0.005850263577604023, 0.031796855962680726, 0.16800819341126713, -0.004622305155577214, -0.05700668381660709, 0.17428344024257575, 0.23468893617725692, -0.03924896511395547, 0.13838577671957958, -0.15886210515440521, -0.09765651663285033, -0.2793427935186481, -0.15649816041474018, -0.12299706602903425, -0.013054725478587029, -0.09701763710492309, -0.18721175703090603, 0.42928244267494287, 0.20196091150049678, 0.18468805287668122, 0.033962620862586335, 0.31643498685595167, 0.04449857327243472, 0.0805365068821295, -0.018366888756425257, 0.13991932051398295, 0.07035337427668607, 0.06781726948825033, -0.20258347869165777, 0.12550450081732376, 0.006919929362006585] |
710.4789 | Sinh-Gordon Boundary TBA and Boundary Liouville Reflection Amplitude | The ground state energy of the sinh-Gordon model defined on the strip is
studied using the boundary thermodynamic Bethe ansatz equation. Its ultraviolet
(small width of the strip) behavior is compared with the one obtained from the
boundary Liouville reflection amplitude. The results are in perfect agreement
in the allowable range of the parameters and provide convincing support for
both approaches. We also describe how the ultraviolet limit of the effective
central charge can exceed one in the parameter range when the Liouville zero
mode forms a bound state.
| hep-th | the ground state energy of the sinhgordon model defined on the strip is studied using the boundary thermodynamic bethe ansatz equation its ultraviolet small width of the strip behavior is compared with the one obtained from the boundary liouville reflection amplitude the results are in perfect agreement in the allowable range of the parameters and provide convincing support for both approaches we also describe how the ultraviolet limit of the effective central charge can exceed one in the parameter range when the liouville zero mode forms a bound state | [['the', 'ground', 'state', 'energy', 'of', 'the', 'sinhgordon', 'model', 'defined', 'on', 'the', 'strip', 'is', 'studied', 'using', 'the', 'boundary', 'thermodynamic', 'bethe', 'ansatz', 'equation', 'its', 'ultraviolet', 'small', 'width', 'of', 'the', 'strip', 'behavior', 'is', 'compared', 'with', 'the', 'one', 'obtained', 'from', 'the', 'boundary', 'liouville', 'reflection', 'amplitude', 'the', 'results', 'are', 'in', 'perfect', 'agreement', 'in', 'the', 'allowable', 'range', 'of', 'the', 'parameters', 'and', 'provide', 'convincing', 'support', 'for', 'both', 'approaches', 'we', 'also', 'describe', 'how', 'the', 'ultraviolet', 'limit', 'of', 'the', 'effective', 'central', 'charge', 'can', 'exceed', 'one', 'in', 'the', 'parameter', 'range', 'when', 'the', 'liouville', 'zero', 'mode', 'forms', 'a', 'bound', 'state']] | [-0.12801291431520093, 0.11859193560928943, -0.06627637745938107, 0.07869740579999314, -0.05390158643046122, -0.11951652383745721, 0.05677424066208219, 0.30865549645648244, -0.21016425409176376, -0.2722246404318662, 0.12128625117540569, -0.28282280691135464, -0.059593712908393714, 0.20669523571889972, 0.005813303136716733, 0.08450177454146336, 0.06579456307789248, 0.10442579029359478, -0.0852035694661435, -0.17515410820880298, 0.339483786635938, 0.003735718359187078, 0.3060932517433644, 0.06381461545406433, 0.05152070828389083, 0.015069419740479482, 0.04673035226741366, 0.018236960525090776, -0.21063689239260353, 0.05897291929767143, 0.20633030521390394, 0.03536079312789808, 0.19489761844298312, -0.41062064950218363, -0.22282627125511342, 0.07253926753830374, 0.14958349752090766, 0.10198191994489851, 0.019706418082442428, -0.2564276490318641, 0.04637500831041108, -0.15843614379174253, -0.2226852484968271, -0.026382964125342582, -0.019967503594548516, 0.01747597820711521, -0.23596339039713815, 0.09926457194090832, 0.015822626038171937, 0.019560996327925934, -0.12121800382051282, -0.12302432130771072, -0.07208382708721617, 0.13563310330782055, 0.04225280151958839, 0.0223979295513938, 0.10694991016048896, -0.17747009350143875, -0.06119023984967825, 0.32862080640965297, -0.09647028832016198, -0.20600664081690268, 0.16697973028359034, -0.1603529764799757, -0.05184982952483919, 0.15939082675142568, 0.06733007799164298, 0.10487071837016036, -0.11619835633479106, 0.1733425896859393, -0.0552838645807436, 0.17537442344669882, 0.0683139876352644, 0.05838218534270791, 0.18252715265399286, 0.1333052833025668, 0.028116134429622568, 0.14454671550343295, -0.09366522111218381, -0.14451065022247225, -0.3504543787475382, -0.11340154610440825, -0.18529608427367716, 0.03326554376673832, -0.12288096736514224, -0.17498499489378896, 0.388800643677457, 0.1550179862710281, 0.20561700988707415, 0.05044219763217012, 0.25516919102101177, 0.20733866440864762, 0.039737018562978906, 0.06163066894919978, 0.3000624897612489, 0.16354753927254442, 0.0895205563865602, -0.2637942250833711, -0.003926869761721974, 0.0865719571468954] |
710.479 | Variational principle for Hamiltonians with degenerate bottom | We consider perturbations of Hamiltonians whose Fourier symbol attains its
minimum along a hypersurface. Such operators arise in several domains, like
spintronics, theory of supercondictivity, or theory of superfluidity.
Variational estimates for the number of eigenvalues below the essential
spectrum in terms of the perturbation potential are provided. In particular, we
provide an elementary proof that negative potentials lead to an infinite
discrete spectrum.
| math-ph math.MP | we consider perturbations of hamiltonians whose fourier symbol attains its minimum along a hypersurface such operators arise in several domains like spintronics theory of supercondictivity or theory of superfluidity variational estimates for the number of eigenvalues below the essential spectrum in terms of the perturbation potential are provided in particular we provide an elementary proof that negative potentials lead to an infinite discrete spectrum | [['we', 'consider', 'perturbations', 'of', 'hamiltonians', 'whose', 'fourier', 'symbol', 'attains', 'its', 'minimum', 'along', 'a', 'hypersurface', 'such', 'operators', 'arise', 'in', 'several', 'domains', 'like', 'spintronics', 'theory', 'of', 'supercondictivity', 'or', 'theory', 'of', 'superfluidity', 'variational', 'estimates', 'for', 'the', 'number', 'of', 'eigenvalues', 'below', 'the', 'essential', 'spectrum', 'in', 'terms', 'of', 'the', 'perturbation', 'potential', 'are', 'provided', 'in', 'particular', 'we', 'provide', 'an', 'elementary', 'proof', 'that', 'negative', 'potentials', 'lead', 'to', 'an', 'infinite', 'discrete', 'spectrum']] | [-0.19007527704040209, 0.12834617055422212, -0.08479270254749627, 0.08821585174605605, -0.04702221123605139, -0.11759753340470885, -0.0181747334953841, 0.3113103354431038, -0.2838496156332512, -0.24443986438333043, 0.11588064670037951, -0.32374891496839975, -0.1763360380492587, 0.19314333639432868, -0.0619133603611281, 0.05163222840998233, 0.027926125282806063, 0.11643904355578198, -0.07870731360485984, -0.18843174281175293, 0.33899367846075507, -0.0008052404644706893, 0.1990323310333585, 0.10337420225527788, 0.05818005683757956, 0.01996905344080121, 0.033365719486027956, -0.038382679623152526, -0.1320798534093589, 0.1495083343710691, 0.24063778112135228, 0.09111958212913975, 0.26862192232280024, -0.4677994964082563, -0.2336719055190712, 0.15780852479298438, 0.16784812730278761, 0.11110382317195809, -0.06874053139564773, -0.24885935528529068, 0.08666565247427022, -0.17161622888127726, -0.21025030479012502, -0.12764098287914835, -0.0076461100862139746, 0.032859303648509676, -0.24843350737281736, 0.10499165841333923, 0.09521533699617499, 0.0993764070823552, -0.11537410845307426, -0.1323966732958243, -0.0072414714802381775, 0.08241764057634605, 0.042388322192155534, -0.016785732706979153, 0.07254514248952978, -0.12295965176992237, -0.11472783064735788, 0.36015223614161923, -0.08254339220741438, -0.2203064283563031, 0.12930816360231903, -0.12390716235145986, -0.1157994073933907, 0.09736627069050593, 0.161691446064247, 0.14838184019373285, -0.07681542796836723, 0.16449192630511428, 0.011278513124183057, 0.10569134106238683, 0.06807682201236723, 0.1183889496716715, 0.17280002316785237, 0.0643144968660578, 0.1602471860288273, 0.1199538747203492, -0.005197622696869075, -0.12443584262851685, -0.3753040397894524, -0.13251932193007734, -0.2401155825142586, 0.043804938771895, -0.11440301076730802, -0.2804720822706937, 0.4239518601329081, 0.10689597901341225, 0.2053436997202447, 0.05305648272827504, 0.21212663188103645, 0.19054132300828183, 0.0400184620363963, 0.026874857311624856, 0.1896992663793739, 0.19665263970899913, 0.055801110031704106, -0.1689548239533213, -0.02861940964967722, 0.10140619858626336] |
710.4791 | Test vectors for trilinear forms, when two representations are
unramified | Let F be a finite extension of Qp and G be GL(2,F). When V is the tensor
product of three infinite dimensional, irreducible, admissible representations
of G, the space of G-invariant linear forms has dimension 0 or 1. When a
non-zero linear form exists, one wants to find an element of V which is not in
its kernel : this is a test vector. Gross and Prasad found explicit test
vectors when the three representations are unramified principal series, and
when the three representations are unramified twists of the Steinberg
representation. In this paper, we find an explicit test vector when two of the
representations are unramified principal series and the third one has
ramification at least 1.
| math.NT | let f be a finite extension of qp and g be gl2f when v is the tensor product of three infinite dimensional irreducible admissible representations of g the space of ginvariant linear forms has dimension 0 or 1 when a nonzero linear form exists one wants to find an element of v which is not in its kernel this is a test vector gross and prasad found explicit test vectors when the three representations are unramified principal series and when the three representations are unramified twists of the steinberg representation in this paper we find an explicit test vector when two of the representations are unramified principal series and the third one has ramification at least 1 | [['let', 'f', 'be', 'a', 'finite', 'extension', 'of', 'qp', 'and', 'g', 'be', 'gl2f', 'when', 'v', 'is', 'the', 'tensor', 'product', 'of', 'three', 'infinite', 'dimensional', 'irreducible', 'admissible', 'representations', 'of', 'g', 'the', 'space', 'of', 'ginvariant', 'linear', 'forms', 'has', 'dimension', '0', 'or', '1', 'when', 'a', 'nonzero', 'linear', 'form', 'exists', 'one', 'wants', 'to', 'find', 'an', 'element', 'of', 'v', 'which', 'is', 'not', 'in', 'its', 'kernel', 'this', 'is', 'a', 'test', 'vector', 'gross', 'and', 'prasad', 'found', 'explicit', 'test', 'vectors', 'when', 'the', 'three', 'representations', 'are', 'unramified', 'principal', 'series', 'and', 'when', 'the', 'three', 'representations', 'are', 'unramified', 'twists', 'of', 'the', 'steinberg', 'representation', 'in', 'this', 'paper', 'we', 'find', 'an', 'explicit', 'test', 'vector', 'when', 'two', 'of', 'the', 'representations', 'are', 'unramified', 'principal', 'series', 'and', 'the', 'third', 'one', 'has', 'ramification', 'at', 'least', '1']] | [-0.1778670399187085, 0.10079889676287873, -0.10995263340843157, 0.0036277996891568233, -0.10910649153276578, -0.17033992642108908, -0.07248488411359075, 0.3236947999232345, -0.3268392601201677, -0.1860731369855567, 0.10922880108770715, -0.29477633722126484, -0.11559716041566023, 0.15435141739515093, -0.03426741361896643, -0.018476658310187966, 0.021222106298495434, 0.18661782276840547, -0.09238798835545652, -0.332944639138559, 0.37908736473888666, -0.08462840127639282, 0.22147618101424196, 0.0007524892695757569, 0.13491669309158355, -0.006385944339916365, -0.0006380555514469106, -0.06430770370648561, -0.056427183951068126, 0.12387265524086662, 0.34852599158373654, 0.07471924564307635, 0.2954597138425606, -0.35899705255929476, -0.1389314752852178, 0.2382704838155172, 0.1345859470570253, 0.005760628709163613, 0.05421779658565791, -0.23537180044998726, 0.13533541192022017, -0.19931395421934944, -0.11422858836575069, -0.10000695470465809, 0.11109428056794354, -0.02338386667319215, -0.32148102233504766, 0.006609940296436986, 0.09650188913712135, 0.14195424584576335, -0.08138706456396219, -0.15711776703659797, -0.05005314528671467, 0.07041772692708068, 0.029800144957505867, 0.0697145566989023, 0.03709915231387967, -0.11812958855891618, -0.08836453346710683, 0.36994876820418954, -0.08221116076167832, -0.24026481765839788, 0.14011384724265236, -0.19000632310302085, -0.12652680991042373, 0.09426073716061874, 0.11204844510230498, 0.12527573249167484, -0.034104801496639095, 0.20382152882038465, -0.133358934838484, 0.08569980555604029, 0.07429959925496553, -0.08417167845699522, 0.145538795267781, 0.05182675349637548, 0.06809076237786785, 0.12744397735501775, -0.03964476632829915, 0.0550478331060109, -0.38384888274993145, -0.20346719173029956, -0.16279129586859137, 0.07986472180308714, -0.12920572396126997, -0.1544842409192879, 0.4305857186360906, 0.05561407202900523, 0.20755939493721956, 0.08654605763721575, 0.23612865563143745, 0.1360395619741235, 0.04742236854508519, 0.11341309052310948, 0.11484149150932446, 0.18774093612013623, -0.10650870651325099, -0.1357373945797101, -0.0074051615849742266, 0.15652770303890237] |
710.4792 | Sur une conjecture de Dehornoy | Let M_n be the n! * n! matrix indexed by permutations of S_n, defined by
M_n(sigma,tau)=1 if every descent of tau^{-1} is also a descent of sigma, and
M_n(sigma,tau)=0 otherwise. We prove the following result, conjectured by P.
Dehornoy: the characteristic polynomial P_n(x)=|xI-M_n| of M_n divides
P_{n+1}(x) in Z[x].
| math.CO math.GR | let m_n be the n n matrix indexed by permutations of s_n defined by m_nsigmatau1 if every descent of tau1 is also a descent of sigma and m_nsigmatau0 otherwise we prove the following result conjectured by p dehornoy the characteristic polynomial p_nxxim_n of m_n divides p_n1x in zx | [['let', 'm_n', 'be', 'the', 'n', 'n', 'matrix', 'indexed', 'by', 'permutations', 'of', 's_n', 'defined', 'by', 'm_nsigmatau1', 'if', 'every', 'descent', 'of', 'tau1', 'is', 'also', 'a', 'descent', 'of', 'sigma', 'and', 'm_nsigmatau0', 'otherwise', 'we', 'prove', 'the', 'following', 'result', 'conjectured', 'by', 'p', 'dehornoy', 'the', 'characteristic', 'polynomial', 'p_nxxim_n', 'of', 'm_n', 'divides', 'p_n1x', 'in', 'zx']] | [-0.18925268571409914, 0.22018110687947937, -0.09147533596389823, 0.014690263830642734, 0.03983982998049922, -0.2000805358816352, 0.0050037447777059344, 0.28364893396695456, -0.38034917463858925, -0.23629135438758467, 0.028273888498855135, -0.24541909524963962, -0.1359613642924362, 0.13685407078721457, -0.0958474807234274, -0.05390700926590297, 0.017691233816246193, 0.12861230378556582, -0.0890320439512531, -0.35856245222191013, 0.2852884516119957, -0.06933464838398827, 0.11637369164576133, -0.043906314422686894, 0.10160183023868335, 0.05171517476232516, -0.005491896335863404, -0.025097557307324474, -0.14420132113413678, 0.04993460946716368, 0.2650488959418403, 0.1811662535027911, 0.23963324866361088, -0.334572100439497, -0.06274469269232617, 0.2994497244867186, 0.25960952755477695, -0.08496395931061772, 0.030896051512617203, -0.2627755997495519, 0.21244059405806992, -0.11571182848678695, -0.15043841266176766, 0.024690711648306912, 0.15686351698305873, 0.05272317634274562, -0.3496696198980013, -0.014554894431623527, 0.16849481254402135, 0.0995416609570384, 0.07946325014345348, -0.21061613221342365, -0.033326838206913734, -0.005303568010114961, -0.003310427675023675, 0.08240578272897336, 0.049351404792267003, -0.018766953547795614, -0.10028901501662202, 0.3576532170176506, -0.059101853664550515, -0.17360427921844854, -0.053935967551337345, -0.2121053078625765, -0.16025580027037198, 0.13144334020713966, 0.02850666267072989, 0.16545619889059002, -0.0038835341007345254, 0.26978570110966554, -0.19004561908336148, 0.1091144607298904, 0.14584280406642292, -0.11334208423892657, 0.08453356514995297, 0.0502778046971394, 0.11864576863331927, 0.12863605301568493, 0.026948749046358796, 0.06351248774056634, -0.33570128089437884, -0.15608172288371458, -0.26475016067011486, 0.19873340736246772, -0.17177545472740247, -0.08752435443715917, 0.3232644020683236, 0.0405079233356648, 0.24873924139537848, 0.16249812324013974, 0.13022800682940416, 0.1084669714483122, -0.00521873827609751, 0.11658589961007237, -0.021317466762330796, 0.23801327175460757, -0.058401074653698336, -0.1981630098592076, 0.06746225530902544, 0.24290175971885522] |
710.4793 | Unified Modeling of Complex Real-Time Control Systems | Complex real-time control system is a software dense and algorithms dense
system, which needs modern software engineering techniques to design. UML is an
object-oriented industrial standard modeling language, used more and more in
real-time domain. This paper first analyses the advantages and problems of
using UML for real-time control systems design. Then, it proposes an extension
of UML-RT to support time-continuous subsystems modeling. So we can unify
modeling of complex real-time control systems on UML-RT platform, from
requirement analysis, model design, simulation, until generation code.
| cs.SE | complex realtime control system is a software dense and algorithms dense system which needs modern software engineering techniques to design uml is an objectoriented industrial standard modeling language used more and more in realtime domain this paper first analyses the advantages and problems of using uml for realtime control systems design then it proposes an extension of umlrt to support timecontinuous subsystems modeling so we can unify modeling of complex realtime control systems on umlrt platform from requirement analysis model design simulation until generation code | [['complex', 'realtime', 'control', 'system', 'is', 'a', 'software', 'dense', 'and', 'algorithms', 'dense', 'system', 'which', 'needs', 'modern', 'software', 'engineering', 'techniques', 'to', 'design', 'uml', 'is', 'an', 'objectoriented', 'industrial', 'standard', 'modeling', 'language', 'used', 'more', 'and', 'more', 'in', 'realtime', 'domain', 'this', 'paper', 'first', 'analyses', 'the', 'advantages', 'and', 'problems', 'of', 'using', 'uml', 'for', 'realtime', 'control', 'systems', 'design', 'then', 'it', 'proposes', 'an', 'extension', 'of', 'umlrt', 'to', 'support', 'timecontinuous', 'subsystems', 'modeling', 'so', 'we', 'can', 'unify', 'modeling', 'of', 'complex', 'realtime', 'control', 'systems', 'on', 'umlrt', 'platform', 'from', 'requirement', 'analysis', 'model', 'design', 'simulation', 'until', 'generation', 'code']] | [-0.10196146989953431, -0.023954242585322767, -0.08858176812748698, 0.02397582503172624, -0.11908117351943956, -0.20351049029542242, -0.006175311401431613, 0.42507985044709024, -0.2831102399703334, -0.3207073091474526, 0.14422346822342233, -0.20180079567739193, -0.20377916911726487, 0.27155845894697395, -0.11028561059878592, 0.16930669072796317, 0.11427649737280958, -0.07350913577110452, -0.050714450083015596, -0.18874775962356258, 0.23438548585399985, 0.05332358870655298, 0.3201364275944584, -0.003992820229819592, 0.06978974379427895, 0.043894872578847055, -0.034043638045242165, -0.03587590087314739, -0.06814129044685294, 0.1844586689956486, 0.3578985429286738, 0.2698964816298993, 0.32392709418199955, -0.4405077858334955, -0.26082692940116803, 0.05646125435390893, 0.14791524880291784, 0.0586365687647177, -0.023402367323048085, -0.28819646034115814, 0.09355791871271589, -0.2561139016960035, -0.09053004384040833, -0.13416301164337818, -0.024483858574839198, -0.011895617864587728, -0.2690350881709224, -0.08191491703995887, 0.04440703341627822, 0.11760758754304226, -0.04534828231176909, -0.018403777526691555, 0.021225003969362555, 0.1553211166852099, -0.07948845396612716, 0.023154685142285684, 0.17985141704009627, -0.11570499628946623, -0.1691686157739776, 0.41870389937916225, 0.02431935453787446, -0.20606471861110015, 0.25306828660506975, 0.027243872437461774, -0.19449946943889646, 0.0824095892274807, 0.2878152561319225, 0.08791654875830693, -0.2539055322022999, 0.07918148542932399, 0.05423440339372439, 0.2673265658949009, -0.052603626674424635, -0.023300370552084025, 0.21742632539175888, 0.31425931541358726, 0.07145768467556028, 0.13146516734405475, 0.03612043812377926, -0.12906112359727132, -0.24669417596750837, -0.15516027012730346, -0.09595416132360697, -0.049520355078172595, -0.03477934958937112, -0.1646297564949183, 0.35944410731248994, 0.24096778356744086, 0.02072901324752499, 0.0473312018562437, 0.4293691863908487, 0.09342482342549106, 0.07665612893726896, 0.10132342776941027, 0.09814014211160076, 0.06793606950189261, 0.20840387452284204, -0.15621512324741, 0.047788817881990006, 0.01772367861121893] |
710.4794 | Power-Performance Trade-Offs in Nanometer-Scale Multi-Level Caches
Considering Total Leakage | In this paper, we investigate the impact of T_{ox} and Vth on power
performance trade-offs for on-chip caches. We start by examining the
optimization of the various components of a single level cache and then extend
this to two level cache systems. In addition to leakage, our studies also
account for the dynamic power expanded as a result of cache misses. Our results
show that one can often reduce overall power by increasing the size of the L2
cache if we only allow one pair of Vth/T_{ox} in L2. However, if we allow the
memory cells and the peripherals to have their own Vth's and T_{ox}'s, we show
that a two-level cache system with smaller L2's will yield less total leakage.
We further show that two Vth's and two T_{ox}'s are sufficient to get close to
an optimal solution, and that Vth is generally a better design knob than T_{ox}
for leakage optimization, thus it is better to restrict the number of T_{ox}'s
rather than Vth's if cost is a concern.
| cs.AR | in this paper we investigate the impact of t_ox and vth on power performance tradeoffs for onchip caches we start by examining the optimization of the various components of a single level cache and then extend this to two level cache systems in addition to leakage our studies also account for the dynamic power expanded as a result of cache misses our results show that one can often reduce overall power by increasing the size of the l2 cache if we only allow one pair of vtht_ox in l2 however if we allow the memory cells and the peripherals to have their own vths and t_oxs we show that a twolevel cache system with smaller l2s will yield less total leakage we further show that two vths and two t_oxs are sufficient to get close to an optimal solution and that vth is generally a better design knob than t_ox for leakage optimization thus it is better to restrict the number of t_oxs rather than vths if cost is a concern | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'impact', 'of', 't_ox', 'and', 'vth', 'on', 'power', 'performance', 'tradeoffs', 'for', 'onchip', 'caches', 'we', 'start', 'by', 'examining', 'the', 'optimization', 'of', 'the', 'various', 'components', 'of', 'a', 'single', 'level', 'cache', 'and', 'then', 'extend', 'this', 'to', 'two', 'level', 'cache', 'systems', 'in', 'addition', 'to', 'leakage', 'our', 'studies', 'also', 'account', 'for', 'the', 'dynamic', 'power', 'expanded', 'as', 'a', 'result', 'of', 'cache', 'misses', 'our', 'results', 'show', 'that', 'one', 'can', 'often', 'reduce', 'overall', 'power', 'by', 'increasing', 'the', 'size', 'of', 'the', 'l2', 'cache', 'if', 'we', 'only', 'allow', 'one', 'pair', 'of', 'vtht_ox', 'in', 'l2', 'however', 'if', 'we', 'allow', 'the', 'memory', 'cells', 'and', 'the', 'peripherals', 'to', 'have', 'their', 'own', 'vths', 'and', 't_oxs', 'we', 'show', 'that', 'a', 'twolevel', 'cache', 'system', 'with', 'smaller', 'l2s', 'will', 'yield', 'less', 'total', 'leakage', 'we', 'further', 'show', 'that', 'two', 'vths', 'and', 'two', 't_oxs', 'are', 'sufficient', 'to', 'get', 'close', 'to', 'an', 'optimal', 'solution', 'and', 'that', 'vth', 'is', 'generally', 'a', 'better', 'design', 'knob', 'than', 't_ox', 'for', 'leakage', 'optimization', 'thus', 'it', 'is', 'better', 'to', 'restrict', 'the', 'number', 'of', 't_oxs', 'rather', 'than', 'vths', 'if', 'cost', 'is', 'a', 'concern']] | [-0.13235900844173396, 0.06652810694726854, -0.04686713968129719, 0.07314085082822096, -0.060689393415882746, -0.15997594639809584, 0.10608032036312472, 0.37827870279331416, -0.24349134166670197, -0.3061155784820371, 0.12626394106088865, -0.2722818996428567, -0.12388385435675874, 0.19877144612426706, -0.11652454246273812, 0.019471636970582254, 0.059647195360572794, 0.03202455705716548, -0.04391946180840023, -0.28431498249992726, 0.29997425524120713, 0.09198591178283096, 0.26612374624785257, 0.07182335795163561, 0.052834963579388224, -0.030527298720827437, 0.0061985681833261076, 0.0311994718552074, -0.08959500048230813, 0.12068345873507068, 0.23484756218488603, 0.15664849144077914, 0.30737716029672063, -0.45330748907564317, -0.1579701365375727, 0.11624650905757923, 0.1509823781972313, 0.08029205786913414, -0.024230883328709752, -0.19575411012971444, 0.16820017653243508, -0.19525862218510798, -0.05801552556564703, -0.08863845901865074, 0.006980543130296556, 0.0423437174224733, -0.27686841694966835, -0.013511319246369086, 0.08057425431907177, -0.022105223455411546, -0.034403232478207965, -0.11946978802614681, -0.013991434423609034, 0.1336028623230317, 0.035376081933431766, 0.007083806465722292, 0.11927428483990404, -0.11365733174607158, -0.08116072792395511, 0.357232091575861, -0.027488952802035355, -0.2273865546688766, 0.15409129639977917, -0.12786929298411398, -0.10740566172308344, 0.10930868518703124, 0.18418288458385232, 0.06954532367560794, -0.12237112994086655, 0.021542928919113954, -0.0186246291597319, 0.24094002844820567, 0.07155367750811445, 0.10196734458783313, 0.13902103517286699, 0.19208543515791568, 0.14819133558052913, 0.1639103200793376, -0.07781520320294315, -0.06400356566232136, -0.23876825652961783, -0.17676616951426052, -0.1558709236108424, 0.04636888165739091, -0.07725401868827997, -0.08677075847106822, 0.3698245871702538, 0.18110342446769423, 0.1929475421743358, 0.10483807128689746, 0.35538088324863243, 0.1116763916294611, 0.09156697764307918, 0.11436131953754845, 0.21435420514796585, 0.030024793685194763, 0.09427914039560539, -0.2371393349432551, 0.054532630974426864, -0.001837595259113347] |
710.4795 | Test Time Reduction Reusing Multiple Processors in a Network-on-Chip
Based Architecture | The increasing complexity and the short life cycles of embedded systems are
pushing the current system-on-chip designs towards a rapid increasing on the
number of programmable processing units, while decreasing the gate count for
custom logic. Considering this trend, this work proposes a test planning method
capable of reusing available processors as test sources and sinks, and the
on-chip network as the test access mechanism. Experimental results are based on
ITC'02 benchmarks and on two open core processors compliant with MIPS and SPARC
instruction set. The results show that the cooperative use of both the on-chip
network and the embedded processors can increase the test parallelism and
reduce the test time without additional cost in area and pins.
| cs.AR | the increasing complexity and the short life cycles of embedded systems are pushing the current systemonchip designs towards a rapid increasing on the number of programmable processing units while decreasing the gate count for custom logic considering this trend this work proposes a test planning method capable of reusing available processors as test sources and sinks and the onchip network as the test access mechanism experimental results are based on itc02 benchmarks and on two open core processors compliant with mips and sparc instruction set the results show that the cooperative use of both the onchip network and the embedded processors can increase the test parallelism and reduce the test time without additional cost in area and pins | [['the', 'increasing', 'complexity', 'and', 'the', 'short', 'life', 'cycles', 'of', 'embedded', 'systems', 'are', 'pushing', 'the', 'current', 'systemonchip', 'designs', 'towards', 'a', 'rapid', 'increasing', 'on', 'the', 'number', 'of', 'programmable', 'processing', 'units', 'while', 'decreasing', 'the', 'gate', 'count', 'for', 'custom', 'logic', 'considering', 'this', 'trend', 'this', 'work', 'proposes', 'a', 'test', 'planning', 'method', 'capable', 'of', 'reusing', 'available', 'processors', 'as', 'test', 'sources', 'and', 'sinks', 'and', 'the', 'onchip', 'network', 'as', 'the', 'test', 'access', 'mechanism', 'experimental', 'results', 'are', 'based', 'on', 'itc02', 'benchmarks', 'and', 'on', 'two', 'open', 'core', 'processors', 'compliant', 'with', 'mips', 'and', 'sparc', 'instruction', 'set', 'the', 'results', 'show', 'that', 'the', 'cooperative', 'use', 'of', 'both', 'the', 'onchip', 'network', 'and', 'the', 'embedded', 'processors', 'can', 'increase', 'the', 'test', 'parallelism', 'and', 'reduce', 'the', 'test', 'time', 'without', 'additional', 'cost', 'in', 'area', 'and', 'pins']] | [-0.1723217494900228, 0.0696373701695416, 0.003280136536933103, 0.006255434429415075, -0.05564801609617168, -0.1852334778582267, 0.11909462790541603, 0.40314879543069054, -0.22068435059844563, -0.39236280839827103, 0.12610984388324512, -0.2629222878002388, -0.10060914553765019, 0.2711178953285818, -0.0704597376392084, 0.09751983002712161, 0.10704144779434902, -0.02013414743024919, -0.023910338785676916, -0.2698194067471392, 0.22669130867303713, 0.08729964249641083, 0.3467683872144859, 0.04298944892638, 0.09429014521903532, -0.01949144590465856, -0.05287842020408203, -0.005153795489173193, -0.01781522697144853, 0.16704169365624755, 0.24586768827195896, 0.18415129755552606, 0.29987220749874616, -0.5012815788514533, -0.17224458507183243, 0.056419802888817455, 0.12164535291563972, 0.058215018722891684, -0.06167452526673422, -0.25095578704534444, 0.08840604251945171, -0.17467112042072971, -0.05197096421478032, -0.05490705573717251, 0.010776032003084733, 0.0724726699414008, -0.2220089847608706, -0.03559237961081188, 0.04526673339038961, 0.06773470757308148, -0.04163194244916914, -0.09280703102348972, 0.02046512796788208, 0.13617083272833566, -0.044805730424695094, 0.06536016381992879, 0.18169258219205728, -0.12598401568119683, -0.17652996449526084, 0.34360343552494454, -0.001195162368969897, -0.15659041688935357, 0.20637031494032088, -0.033060441442796865, -0.13583887193225702, 0.06007391556118757, 0.24029749461402328, 0.03644693170090096, -0.12277413942551209, 0.06824969404408614, 0.032373356913074344, 0.23156987576473156, 0.0719306646388466, 0.04475851280030684, 0.21949955528716447, 0.26107070018079576, 0.0678462420227164, 0.18419180776612137, -0.0967251644489529, -0.09154269736954722, -0.26620479504640954, -0.19218548236146443, -0.19025586288169785, -0.02490352001041174, -0.11089850816050924, -0.13168551465368167, 0.36068268493607136, 0.18010752559126497, 0.14482731728861897, 0.1449802591903451, 0.38329408895540035, 0.04960348010292549, 0.17749563080132386, 0.12078059088217757, 0.13451097544156393, 0.03879870907640306, 0.13775697864899886, -0.2412402813236024, 0.054208575609787285, -0.058503150819579804] |
710.4796 | A Hybrid Prefetch Scheduling Heuristic to Minimize at Run-Time the
Reconfiguration Overhead of Dynamically Reconfigurable Hardware | Due to the emergence of highly dynamic multimedia applications there is a
need for flexible platforms and run-time scheduling support for embedded
systems. Dynamic Reconfigurable Hardware (DRHW) is a promising candidate to
provide this flexibility but, currently, not sufficient run-time scheduling
support to deal with the run-time reconfigurations exists. Moreover, executing
at run-time a complex scheduling heuristic to provide this support may generate
an excessive run-time penalty. Hence, we have developed a hybrid
design/run-time prefetch heuristic that schedules the reconfigurations at
run-time, but carries out the scheduling computations at design-time by
carefully identifying a set of near-optimal schedules that can be selected at
run-time. This approach provides run-time flexibility with a negligible
penalty.
| cs.AR | due to the emergence of highly dynamic multimedia applications there is a need for flexible platforms and runtime scheduling support for embedded systems dynamic reconfigurable hardware drhw is a promising candidate to provide this flexibility but currently not sufficient runtime scheduling support to deal with the runtime reconfigurations exists moreover executing at runtime a complex scheduling heuristic to provide this support may generate an excessive runtime penalty hence we have developed a hybrid designruntime prefetch heuristic that schedules the reconfigurations at runtime but carries out the scheduling computations at designtime by carefully identifying a set of nearoptimal schedules that can be selected at runtime this approach provides runtime flexibility with a negligible penalty | [['due', 'to', 'the', 'emergence', 'of', 'highly', 'dynamic', 'multimedia', 'applications', 'there', 'is', 'a', 'need', 'for', 'flexible', 'platforms', 'and', 'runtime', 'scheduling', 'support', 'for', 'embedded', 'systems', 'dynamic', 'reconfigurable', 'hardware', 'drhw', 'is', 'a', 'promising', 'candidate', 'to', 'provide', 'this', 'flexibility', 'but', 'currently', 'not', 'sufficient', 'runtime', 'scheduling', 'support', 'to', 'deal', 'with', 'the', 'runtime', 'reconfigurations', 'exists', 'moreover', 'executing', 'at', 'runtime', 'a', 'complex', 'scheduling', 'heuristic', 'to', 'provide', 'this', 'support', 'may', 'generate', 'an', 'excessive', 'runtime', 'penalty', 'hence', 'we', 'have', 'developed', 'a', 'hybrid', 'designruntime', 'prefetch', 'heuristic', 'that', 'schedules', 'the', 'reconfigurations', 'at', 'runtime', 'but', 'carries', 'out', 'the', 'scheduling', 'computations', 'at', 'designtime', 'by', 'carefully', 'identifying', 'a', 'set', 'of', 'nearoptimal', 'schedules', 'that', 'can', 'be', 'selected', 'at', 'runtime', 'this', 'approach', 'provides', 'runtime', 'flexibility', 'with', 'a', 'negligible', 'penalty']] | [-0.20718909076389833, 0.04293653112744413, -0.11027166966416009, 0.037239265816678455, -0.18243647195600174, -0.24804939142520632, 0.12701345821171328, 0.4459745974221208, -0.24312311300152056, -0.35223686761382195, 0.11847344708318512, -0.15929978418893911, -0.12081675553644025, 0.19487587565153436, -0.14163546762555032, 0.10165003017807665, 0.102153292156521, -0.016946246381324657, -0.021283955680307887, -0.2895037171615472, 0.18599809000980705, 0.11485163624155091, 0.263102003238961, 0.06748362833441042, 0.062169201663686884, -0.03167874644602741, 0.029776050560260274, 0.02459488825889321, -0.031660655149083526, 0.11652231318792244, 0.37433566851121886, 0.21723336700417167, 0.3712775279360882, -0.44246442612629755, -0.18134690407529339, 0.08786039261634017, 0.1298395996149797, 0.045723405054157916, -0.08600705470218584, -0.21207989130571886, 0.18760165512385601, -0.19785759948731005, -0.08381351739638024, -0.18407383438636055, -0.0024175356721153132, -0.005388669340833518, -0.325662662002451, -0.07514385648096937, 0.011435978754364827, 0.045694215298705806, -0.02082271116726973, -0.08422764561449488, 0.022620040352817054, 0.10754487424384097, 0.003333991135379849, 0.04268843426289423, 0.13531953678256622, -0.0688656660102031, -0.1983584479663756, 0.38405753007611715, 0.08057017972575384, -0.216279035752958, 0.23793628991912916, 0.02776873373082495, -0.1808106125844223, 0.2127012430379788, 0.2517746790471646, 0.07323612286583395, -0.18440587109642792, 0.050652726578026976, 0.06578757883645259, 0.23317996110937028, 0.0503066039165935, 0.06071718892938382, 0.18405744727063286, 0.26487724520769473, 0.14985549127130332, 0.1666232779263393, 0.003366291791469127, -0.0659115184266288, -0.23724671523925756, -0.14011064257791583, -0.1646316090498019, -0.021506525550288282, -0.11750209549227457, -0.18642571557581694, 0.3567501303177696, 0.19133651382730318, 0.12364554936317979, 0.16971372851371966, 0.39887375152262916, 0.08462431801229753, 0.139002164137793, 0.20993011722860067, 0.11562068290748373, -0.05841996358615254, 0.1716235363772055, -0.23491071829958274, 0.14629269539386974, -0.036572885355568144] |
710.4797 | Rapid Generation of Thermal-Safe Test Schedules | Overheating has been acknowledged as a major issue in testing complex SOCs.
Several power constrained system-level DFT solutions (power constrained test
scheduling) have recently been proposed to tackle this problem. However, as it
will be shown in this paper, imposing a chip-level maximum power constraint
doesn't necessarily avoid local overheating due to the non-uniform distribution
of power across the chip. This paper proposes a new approach for dealing with
overheating during test, by embedding thermal awareness into test scheduling.
The proposed approach facilitates rapid generation of thermal-safer test
schedules without requiring time-consuming thermal simulations. This is
achieved by employing a low-complexity test session thermal model used to guide
the test schedule generation algorithm. This approach reduces the chances of a
design re-spin due to potential overheating during test.
| cs.OH | overheating has been acknowledged as a major issue in testing complex socs several power constrained systemlevel dft solutions power constrained test scheduling have recently been proposed to tackle this problem however as it will be shown in this paper imposing a chiplevel maximum power constraint doesnt necessarily avoid local overheating due to the nonuniform distribution of power across the chip this paper proposes a new approach for dealing with overheating during test by embedding thermal awareness into test scheduling the proposed approach facilitates rapid generation of thermalsafer test schedules without requiring timeconsuming thermal simulations this is achieved by employing a lowcomplexity test session thermal model used to guide the test schedule generation algorithm this approach reduces the chances of a design respin due to potential overheating during test | [['overheating', 'has', 'been', 'acknowledged', 'as', 'a', 'major', 'issue', 'in', 'testing', 'complex', 'socs', 'several', 'power', 'constrained', 'systemlevel', 'dft', 'solutions', 'power', 'constrained', 'test', 'scheduling', 'have', 'recently', 'been', 'proposed', 'to', 'tackle', 'this', 'problem', 'however', 'as', 'it', 'will', 'be', 'shown', 'in', 'this', 'paper', 'imposing', 'a', 'chiplevel', 'maximum', 'power', 'constraint', 'doesnt', 'necessarily', 'avoid', 'local', 'overheating', 'due', 'to', 'the', 'nonuniform', 'distribution', 'of', 'power', 'across', 'the', 'chip', 'this', 'paper', 'proposes', 'a', 'new', 'approach', 'for', 'dealing', 'with', 'overheating', 'during', 'test', 'by', 'embedding', 'thermal', 'awareness', 'into', 'test', 'scheduling', 'the', 'proposed', 'approach', 'facilitates', 'rapid', 'generation', 'of', 'thermalsafer', 'test', 'schedules', 'without', 'requiring', 'timeconsuming', 'thermal', 'simulations', 'this', 'is', 'achieved', 'by', 'employing', 'a', 'lowcomplexity', 'test', 'session', 'thermal', 'model', 'used', 'to', 'guide', 'the', 'test', 'schedule', 'generation', 'algorithm', 'this', 'approach', 'reduces', 'the', 'chances', 'of', 'a', 'design', 'respin', 'due', 'to', 'potential', 'overheating', 'during', 'test']] | [-0.11983163998783788, 0.03782760819775008, -0.07296257892564412, 0.018629412643522733, -0.10208932283733572, -0.20627099201304927, 0.08416381686563706, 0.3580738092284827, -0.25844056343304966, -0.3804995250252504, 0.11071313184589916, -0.17333641130151967, -0.14445243083265802, 0.20671969152329164, -0.13782612518924806, 0.14850928345584266, 0.08950050249843607, -0.04895713461178636, -0.03146153509927293, -0.26400046066255384, 0.22990063973332917, 0.15920087775780953, 0.37441183952614665, 0.07430158934319421, 0.08379266873770763, -0.018486388197671327, -0.05553627353058093, 0.03086108515512139, -0.05273587281893318, 0.0645168736227788, 0.27312445278382963, 0.17337030776598977, 0.39346752204148777, -0.47705908502555555, -0.2599868070156801, 0.1363809832135245, 0.13304256304862008, 0.07527656088923178, -0.08608893684336975, -0.21246472961964116, 0.11338041232721437, -0.2283150638390835, -0.10241387905700812, -0.09477875718019074, -0.04819331606036969, -0.01601204273590286, -0.3079879255078378, 0.03698753488309208, 0.04766548803401372, -0.0013054317927786282, -0.03310848686600193, -0.04862090565877715, 0.055887064438254114, 0.07372489248287849, 0.065378324791146, 0.03068361850085831, 0.11589831117603425, -0.09338824673267525, -0.1329381161291773, 0.41726374567028074, 0.020659346783918047, -0.19034929126538042, 0.14559516103176903, -0.014860622800095745, -0.15177928534842702, 0.12672620357960343, 0.2233289426990918, 0.09847226273453248, -0.21350183581105536, 0.04508483281270379, 0.04484508338103455, 0.17549030270080068, 0.08197184894344814, -0.021474210700641077, 0.23384699497431044, 0.24607036689606807, 0.09231366129362926, 0.1791567241159519, -0.08741640661739641, -0.08734477713837155, -0.20960037006408952, -0.12814204275815022, -0.19948742078203294, 0.030467363510517372, -0.01672043327966498, -0.11762546954952764, 0.3979694575795697, 0.21480984845390869, 0.10896250236749885, 0.052674150644821886, 0.3919145767650907, 0.12276009991691107, 0.09921897488409682, 0.07410280607892053, 0.21492230866311324, 0.06205793694659535, 0.13200175108033277, -0.2568469536749439, 0.10472319892141968, 0.006064307158036779] |
710.4798 | System Synthesis for Networks of Programmable Blocks | The advent of sensor networks presents untapped opportunities for synthesis.
We examine the problem of synthesis of behavioral specifications into networks
of programmable sensor blocks. The particular behavioral specification we
consider is an intuitive user-created network diagram of sensor blocks, each
block having a pre-defined combinational or sequential behavior. We synthesize
this specification to a new network that utilizes a minimum number of
programmable blocks in place of the pre-defined blocks, thus reducing network
size and hence network cost and power. We focus on the main task of this
synthesis problem, namely partitioning pre-defined blocks onto a minimum number
of programmable blocks, introducing the efficient but effective PareDown
decomposition algorithm for the task. We describe the synthesis and simulation
tools we developed. We provide results showing excellent network size
reductions through such synthesis, and significant speedups of our algorithm
over exhaustive search while obtaining near-optimal results for 15 real network
designs as well as nearly 10,000 randomly generated designs.
| cs.OH | the advent of sensor networks presents untapped opportunities for synthesis we examine the problem of synthesis of behavioral specifications into networks of programmable sensor blocks the particular behavioral specification we consider is an intuitive usercreated network diagram of sensor blocks each block having a predefined combinational or sequential behavior we synthesize this specification to a new network that utilizes a minimum number of programmable blocks in place of the predefined blocks thus reducing network size and hence network cost and power we focus on the main task of this synthesis problem namely partitioning predefined blocks onto a minimum number of programmable blocks introducing the efficient but effective paredown decomposition algorithm for the task we describe the synthesis and simulation tools we developed we provide results showing excellent network size reductions through such synthesis and significant speedups of our algorithm over exhaustive search while obtaining nearoptimal results for 15 real network designs as well as nearly 10000 randomly generated designs | [['the', 'advent', 'of', 'sensor', 'networks', 'presents', 'untapped', 'opportunities', 'for', 'synthesis', 'we', 'examine', 'the', 'problem', 'of', 'synthesis', 'of', 'behavioral', 'specifications', 'into', 'networks', 'of', 'programmable', 'sensor', 'blocks', 'the', 'particular', 'behavioral', 'specification', 'we', 'consider', 'is', 'an', 'intuitive', 'usercreated', 'network', 'diagram', 'of', 'sensor', 'blocks', 'each', 'block', 'having', 'a', 'predefined', 'combinational', 'or', 'sequential', 'behavior', 'we', 'synthesize', 'this', 'specification', 'to', 'a', 'new', 'network', 'that', 'utilizes', 'a', 'minimum', 'number', 'of', 'programmable', 'blocks', 'in', 'place', 'of', 'the', 'predefined', 'blocks', 'thus', 'reducing', 'network', 'size', 'and', 'hence', 'network', 'cost', 'and', 'power', 'we', 'focus', 'on', 'the', 'main', 'task', 'of', 'this', 'synthesis', 'problem', 'namely', 'partitioning', 'predefined', 'blocks', 'onto', 'a', 'minimum', 'number', 'of', 'programmable', 'blocks', 'introducing', 'the', 'efficient', 'but', 'effective', 'paredown', 'decomposition', 'algorithm', 'for', 'the', 'task', 'we', 'describe', 'the', 'synthesis', 'and', 'simulation', 'tools', 'we', 'developed', 'we', 'provide', 'results', 'showing', 'excellent', 'network', 'size', 'reductions', 'through', 'such', 'synthesis', 'and', 'significant', 'speedups', 'of', 'our', 'algorithm', 'over', 'exhaustive', 'search', 'while', 'obtaining', 'nearoptimal', 'results', 'for', '15', 'real', 'network', 'designs', 'as', 'well', 'as', 'nearly', '10000', 'randomly', 'generated', 'designs']] | [-0.14139642005438527, 0.02228761200663778, -0.015490393755556662, -0.0034207918370272256, -0.08453165396275825, -0.16339577706177025, 0.08863374953971634, 0.4318962251926666, -0.26901881035440894, -0.36962315030513876, 0.11417473688989854, -0.20272809313462836, -0.19879875397987523, 0.2005678721293925, -0.08213140078101165, 0.11242233512958488, 0.08275425914362591, -0.00995900554569951, -0.05349017097946268, -0.24738112205633586, 0.2456350259997151, 0.056647152153633626, 0.3469588646394071, -0.028563406798823535, 0.1269853044849455, 0.042580072859396474, -0.034084542410571975, 0.010934524773030625, -0.08487727465219479, 0.17271828383967705, 0.2836475906881822, 0.2503728703860948, 0.29454864555663324, -0.4649500718010189, -0.18397634542183183, 0.10459063478592265, 0.1378101656519914, 0.1375662767066019, -0.07845224920568894, -0.23882128250832327, 0.14116966090890096, -0.1773188517420093, -0.03945387439519356, -0.06261009157486437, -0.01946333227266522, 0.01199781212364795, -0.28554405099889146, -0.06946282394475722, 0.043717272471359495, 0.05680757962002218, -0.04584600243428604, -0.1440242897509892, 0.03533630402275373, 0.1929414503326451, -0.0613173714277476, -0.023948263966395884, 0.16995516989698423, -0.11634635947397144, -0.14226639902372432, 0.34192443158053143, 0.007991286843449255, -0.1580058835274422, 0.15393190461216802, -0.00032676797790476416, -0.17542601280397724, 0.10479134877353813, 0.2442167008213133, 0.09653816186775795, -0.15090157647169183, 0.04704538981954838, -0.03603094787914542, 0.222263351184481, 0.04210217858670586, 0.04977679327189262, 0.20909998963197954, 0.29882704638551827, 0.10936310529212255, 0.2031158464102375, -0.0406164046276738, -0.0785847818611567, -0.25785815934473766, -0.13899268882195878, -0.1770319016517694, 0.01542027382315667, -0.12757084561663656, -0.18480609463751788, 0.44276365415558594, 0.16132793276087393, 0.19210555411498004, 0.15645510340227356, 0.3411216846478608, 0.034331172904371036, 0.12544666532474227, 0.07113161845400906, 0.12380183511708356, 0.06772286052332271, 0.09867217984194926, -0.18013555188427527, 0.07966373354060977, 0.040190094586791875] |
710.4799 | Access Pattern-Based Code Compression for Memory-Constrained Embedded
Systems | As compared to a large spectrum of performance optimizations, relatively
little effort has been dedicated to optimize other aspects of embedded
applications such as memory space requirements, power, real-time
predictability, and reliability. In particular, many modern embedded systems
operate under tight memory space constraints. One way of satisfying these
constraints is to compress executable code and data as much as possible. While
research on code compression have studied efficient hardware and software based
code strategies, many of these techniques do not take application behavior into
account, that is, the same compression/decompression strategy is used
irrespective of the application being optimized. This paper presents a code
compression strategy based on control flow graph (CFG) representation of the
embedded program. The idea is to start with a memory image wherein all basic
blocks are compressed, and decompress only the blocks that are predicted to be
needed in the near future. When the current access to a basic block is over,
our approach also decides the point at which the block could be compressed. We
propose several compression and decompression strategies that try to reduce
memory requirements without excessively increasing the original instruction
cycle counts.
| cs.OH | as compared to a large spectrum of performance optimizations relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space requirements power realtime predictability and reliability in particular many modern embedded systems operate under tight memory space constraints one way of satisfying these constraints is to compress executable code and data as much as possible while research on code compression have studied efficient hardware and software based code strategies many of these techniques do not take application behavior into account that is the same compressiondecompression strategy is used irrespective of the application being optimized this paper presents a code compression strategy based on control flow graph cfg representation of the embedded program the idea is to start with a memory image wherein all basic blocks are compressed and decompress only the blocks that are predicted to be needed in the near future when the current access to a basic block is over our approach also decides the point at which the block could be compressed we propose several compression and decompression strategies that try to reduce memory requirements without excessively increasing the original instruction cycle counts | [['as', 'compared', 'to', 'a', 'large', 'spectrum', 'of', 'performance', 'optimizations', 'relatively', 'little', 'effort', 'has', 'been', 'dedicated', 'to', 'optimize', 'other', 'aspects', 'of', 'embedded', 'applications', 'such', 'as', 'memory', 'space', 'requirements', 'power', 'realtime', 'predictability', 'and', 'reliability', 'in', 'particular', 'many', 'modern', 'embedded', 'systems', 'operate', 'under', 'tight', 'memory', 'space', 'constraints', 'one', 'way', 'of', 'satisfying', 'these', 'constraints', 'is', 'to', 'compress', 'executable', 'code', 'and', 'data', 'as', 'much', 'as', 'possible', 'while', 'research', 'on', 'code', 'compression', 'have', 'studied', 'efficient', 'hardware', 'and', 'software', 'based', 'code', 'strategies', 'many', 'of', 'these', 'techniques', 'do', 'not', 'take', 'application', 'behavior', 'into', 'account', 'that', 'is', 'the', 'same', 'compressiondecompression', 'strategy', 'is', 'used', 'irrespective', 'of', 'the', 'application', 'being', 'optimized', 'this', 'paper', 'presents', 'a', 'code', 'compression', 'strategy', 'based', 'on', 'control', 'flow', 'graph', 'cfg', 'representation', 'of', 'the', 'embedded', 'program', 'the', 'idea', 'is', 'to', 'start', 'with', 'a', 'memory', 'image', 'wherein', 'all', 'basic', 'blocks', 'are', 'compressed', 'and', 'decompress', 'only', 'the', 'blocks', 'that', 'are', 'predicted', 'to', 'be', 'needed', 'in', 'the', 'near', 'future', 'when', 'the', 'current', 'access', 'to', 'a', 'basic', 'block', 'is', 'over', 'our', 'approach', 'also', 'decides', 'the', 'point', 'at', 'which', 'the', 'block', 'could', 'be', 'compressed', 'we', 'propose', 'several', 'compression', 'and', 'decompression', 'strategies', 'that', 'try', 'to', 'reduce', 'memory', 'requirements', 'without', 'excessively', 'increasing', 'the', 'original', 'instruction', 'cycle', 'counts']] | [-0.11356289647058777, 0.06064239130015873, -0.07174945074136001, 0.06317651586141437, -0.11580196933937259, -0.19130668092596656, 0.05411137792361842, 0.41562564789395157, -0.29093327387818135, -0.3387611997532076, 0.19062153802102935, -0.21109188529104964, -0.11378861897901515, 0.212299170708017, -0.09581356090347981, 0.09779259005881613, 0.08393090817541331, 0.046988790320028784, -0.05982361586605597, -0.2944238537646318, 0.2529559143076767, 0.11001480430422816, 0.31561236183915753, 0.00781432410379542, 0.05878203573456631, -0.009904499633800393, -0.025374179701429966, 0.01657941613029834, -0.0743248689994213, 0.12761569460902442, 0.2824588912553736, 0.21404044890247556, 0.2866659739435515, -0.5039972473071733, -0.23069160106388154, 0.08659504049137468, 0.15615551508866096, 0.10414398826317968, -0.04374117464006607, -0.1875207459476466, 0.13600934704148435, -0.1893502881672854, -0.04123171353057842, -0.09061168710468337, -0.007038296258542687, 0.014764080647182709, -0.24770946425269358, -0.06480853113938186, 0.06516158668576584, 0.009806151831677804, -0.016669700208391685, -0.10611215217431891, 0.017782407519916887, 0.16182613224570255, 0.01745790876884712, 0.059205040827691846, 0.15824613714479105, -0.101466332981848, -0.11268452122142965, 0.4112731489003636, -0.008321273974919071, -0.1858539461009059, 0.19576041661881996, -0.035336148105367705, -0.165963917975508, 0.1224034724230781, 0.2278349938254299, 0.05290982990118209, -0.15049904381377624, 0.08608139374549258, 0.013750312180491164, 0.20592977984915706, 0.06604451253103132, 0.08828719738206321, 0.19837136823116452, 0.20818962586872658, 0.06275519556766085, 0.15025107895932402, -0.05134811559764785, -0.08676792057697942, -0.2532282960649657, -0.15044245073174048, -0.17428575042322336, -0.013469726037556029, -0.05609787745038375, -0.12935076415124058, 0.37616342480275006, 0.17943825712184966, 0.16042815707138894, 0.07327079893184418, 0.3746204718105825, 0.05984633851342854, 0.150972851211615, 0.11466946179765121, 0.14322438407604446, 0.044614778075621565, 0.11339801305499957, -0.17565643550339397, 0.08690635826739405, 0.024164075148291886] |
710.48 | An Improved FPGA Implementation of the Modified Hybrid Hiding Encryption
Algorithm (MHHEA) for Data Communication Security | The hybrid hiding encryption algorithm, as its name implies, embraces
concepts from both steganography and cryptography. In this exertion, an
improved micro-architecture Field Programmable Gate Array (FPGA) implementation
of this algorithm is presented. This design overcomes the observed limitations
of a previously-designed micro-architecture. These observed limitations are: no
exploitation of the possibility of parallel bit replacement, and the fact that
the input plaintext was encrypted serially, which caused a dependency between
the throughput and the nature of the used secret key. This dependency can be
viewed by some as vulnerability in the security of the implemented
micro-architecture. The proposed modified micro-architecture is constructed
using five basic modules. These modules are; the message cache, the message
alignment module, the key cache, the comparator, and at last the encryption
module. In this work, we provide comprehensive simulation and implementation
results. These are: the timing diagrams, the post-implementation timing and
routing reports, and finally the floor plan. Moreover, a detailed comparison
with other FPGA implementations is made available and discussed.
| cs.CR | the hybrid hiding encryption algorithm as its name implies embraces concepts from both steganography and cryptography in this exertion an improved microarchitecture field programmable gate array fpga implementation of this algorithm is presented this design overcomes the observed limitations of a previouslydesigned microarchitecture these observed limitations are no exploitation of the possibility of parallel bit replacement and the fact that the input plaintext was encrypted serially which caused a dependency between the throughput and the nature of the used secret key this dependency can be viewed by some as vulnerability in the security of the implemented microarchitecture the proposed modified microarchitecture is constructed using five basic modules these modules are the message cache the message alignment module the key cache the comparator and at last the encryption module in this work we provide comprehensive simulation and implementation results these are the timing diagrams the postimplementation timing and routing reports and finally the floor plan moreover a detailed comparison with other fpga implementations is made available and discussed | [['the', 'hybrid', 'hiding', 'encryption', 'algorithm', 'as', 'its', 'name', 'implies', 'embraces', 'concepts', 'from', 'both', 'steganography', 'and', 'cryptography', 'in', 'this', 'exertion', 'an', 'improved', 'microarchitecture', 'field', 'programmable', 'gate', 'array', 'fpga', 'implementation', 'of', 'this', 'algorithm', 'is', 'presented', 'this', 'design', 'overcomes', 'the', 'observed', 'limitations', 'of', 'a', 'previouslydesigned', 'microarchitecture', 'these', 'observed', 'limitations', 'are', 'no', 'exploitation', 'of', 'the', 'possibility', 'of', 'parallel', 'bit', 'replacement', 'and', 'the', 'fact', 'that', 'the', 'input', 'plaintext', 'was', 'encrypted', 'serially', 'which', 'caused', 'a', 'dependency', 'between', 'the', 'throughput', 'and', 'the', 'nature', 'of', 'the', 'used', 'secret', 'key', 'this', 'dependency', 'can', 'be', 'viewed', 'by', 'some', 'as', 'vulnerability', 'in', 'the', 'security', 'of', 'the', 'implemented', 'microarchitecture', 'the', 'proposed', 'modified', 'microarchitecture', 'is', 'constructed', 'using', 'five', 'basic', 'modules', 'these', 'modules', 'are', 'the', 'message', 'cache', 'the', 'message', 'alignment', 'module', 'the', 'key', 'cache', 'the', 'comparator', 'and', 'at', 'last', 'the', 'encryption', 'module', 'in', 'this', 'work', 'we', 'provide', 'comprehensive', 'simulation', 'and', 'implementation', 'results', 'these', 'are', 'the', 'timing', 'diagrams', 'the', 'postimplementation', 'timing', 'and', 'routing', 'reports', 'and', 'finally', 'the', 'floor', 'plan', 'moreover', 'a', 'detailed', 'comparison', 'with', 'other', 'fpga', 'implementations', 'is', 'made', 'available', 'and', 'discussed']] | [-0.19689053074936524, 0.002525641998561861, -0.06852191612688881, 0.04616278874578491, -0.05678298916441925, -0.21246368312700228, 0.06829572349899646, 0.39712948161318445, -0.2943796182531073, -0.3277670679557504, 0.13543597077809727, -0.21136136900802904, -0.15869365192272447, 0.209297453327048, -0.12599830910930354, 0.08523666333710549, 0.0688917017390574, -0.0006836782588806906, -0.053617963492058954, -0.3002698692408475, 0.25180228753579836, 0.11434659891987614, 0.3336868351480613, 0.04331448859478714, 0.09708810759087404, -0.009680172031618316, -0.06131828527220271, -0.052398690071210945, -0.07594268215616466, 0.12616845039707242, 0.2696041428272358, 0.1981855941541267, 0.2398566019897716, -0.43671003816592874, -0.1360505304835511, 0.03763311332317464, 0.12989264540444834, 0.09752887525211201, -0.10175731759518385, -0.2873545939328544, 0.114305330886308, -0.22326104678778033, -0.025568087497782527, -0.03955448943924046, -0.054447932566064554, 0.06221877725964243, -0.20335159095173533, -0.057322537193117154, 0.05463891103369833, 0.05266506564521203, 0.013299797861272413, -0.1200690619887389, 0.028363959618251434, 0.1456132694069917, -0.027875825152450212, 0.0333364513335806, 0.1637732439730881, -0.08389525171228204, -0.17516708031974054, 0.33954890471967786, 0.007045455021205161, -0.17491383790602963, 0.12445635610457623, -0.012328383758325468, -0.12265307579020207, 0.08916552418588915, 0.1341884386415283, 0.03314367678637306, -0.17026245601362353, 0.05639562003145164, -0.008352631434911129, 0.23848470929784304, 0.08277317210044148, 0.10255242849940038, 0.1736308993602341, 0.22103692610945666, 0.004251158979693146, 0.17586561838538867, -0.10752609596361942, -0.10972054073812836, -0.29902078711681745, -0.16567457539424527, -0.16760405263101513, -0.04000607331029393, -0.09489536296618595, -0.1311164480267149, 0.41132441955533894, 0.2160225965223755, 0.10753668799597742, 0.05803355624066722, 0.4167126941071315, 0.039600114096802745, 0.1365648630300932, 0.13221618942210847, 0.17981567656758918, 0.07845149949954992, 0.1395490201472333, -0.18909058898976638, 0.13928044896121278, 0.016341665185367067] |
710.4801 | Behavioural Transformation to Improve Circuit Performance in High-Level
Synthesis | Early scheduling algorithms usually adjusted the clock cycle duration to the
execution time of the slowest operation. This resulted in large slack times
wasted in those cycles executing faster operations. To reduce the wasted times
multi-cycle and chaining techniques have been employed. While these techniques
have produced successful designs, its effectiveness is often limited due to the
area increment that may derive from chaining, and the extra latencies that may
derive from multicycling. In this paper we present an optimization method that
solves the time-constrained scheduling problem by transforming behavioural
specifications into new ones whose subsequent synthesis substantially improves
circuit performance. Our proposal breaks up some of the specification
operations, allowing their execution during several possibly unconsecutive
cycles, and also the calculation of several data-dependent operation fragments
in the same cycle. To do so, it takes into account the circuit latency and the
execution time of every specification operation. The experimental results
carried out show that circuits obtained from the optimized specification are on
average 60% faster than those synthesized from the original specification, with
only slight increments in the circuit area.
| cs.AR | early scheduling algorithms usually adjusted the clock cycle duration to the execution time of the slowest operation this resulted in large slack times wasted in those cycles executing faster operations to reduce the wasted times multicycle and chaining techniques have been employed while these techniques have produced successful designs its effectiveness is often limited due to the area increment that may derive from chaining and the extra latencies that may derive from multicycling in this paper we present an optimization method that solves the timeconstrained scheduling problem by transforming behavioural specifications into new ones whose subsequent synthesis substantially improves circuit performance our proposal breaks up some of the specification operations allowing their execution during several possibly unconsecutive cycles and also the calculation of several datadependent operation fragments in the same cycle to do so it takes into account the circuit latency and the execution time of every specification operation the experimental results carried out show that circuits obtained from the optimized specification are on average 60 faster than those synthesized from the original specification with only slight increments in the circuit area | [['early', 'scheduling', 'algorithms', 'usually', 'adjusted', 'the', 'clock', 'cycle', 'duration', 'to', 'the', 'execution', 'time', 'of', 'the', 'slowest', 'operation', 'this', 'resulted', 'in', 'large', 'slack', 'times', 'wasted', 'in', 'those', 'cycles', 'executing', 'faster', 'operations', 'to', 'reduce', 'the', 'wasted', 'times', 'multicycle', 'and', 'chaining', 'techniques', 'have', 'been', 'employed', 'while', 'these', 'techniques', 'have', 'produced', 'successful', 'designs', 'its', 'effectiveness', 'is', 'often', 'limited', 'due', 'to', 'the', 'area', 'increment', 'that', 'may', 'derive', 'from', 'chaining', 'and', 'the', 'extra', 'latencies', 'that', 'may', 'derive', 'from', 'multicycling', 'in', 'this', 'paper', 'we', 'present', 'an', 'optimization', 'method', 'that', 'solves', 'the', 'timeconstrained', 'scheduling', 'problem', 'by', 'transforming', 'behavioural', 'specifications', 'into', 'new', 'ones', 'whose', 'subsequent', 'synthesis', 'substantially', 'improves', 'circuit', 'performance', 'our', 'proposal', 'breaks', 'up', 'some', 'of', 'the', 'specification', 'operations', 'allowing', 'their', 'execution', 'during', 'several', 'possibly', 'unconsecutive', 'cycles', 'and', 'also', 'the', 'calculation', 'of', 'several', 'datadependent', 'operation', 'fragments', 'in', 'the', 'same', 'cycle', 'to', 'do', 'so', 'it', 'takes', 'into', 'account', 'the', 'circuit', 'latency', 'and', 'the', 'execution', 'time', 'of', 'every', 'specification', 'operation', 'the', 'experimental', 'results', 'carried', 'out', 'show', 'that', 'circuits', 'obtained', 'from', 'the', 'optimized', 'specification', 'are', 'on', 'average', '60', 'faster', 'than', 'those', 'synthesized', 'from', 'the', 'original', 'specification', 'with', 'only', 'slight', 'increments', 'in', 'the', 'circuit', 'area']] | [-0.14474299629994977, 0.08079487515052379, -0.07208465031969051, 0.02610460954343176, -0.04250050420200245, -0.14584448918596737, 0.11796976130507472, 0.4083818193938997, -0.2605177246629157, -0.3628955095592472, 0.14131825307267717, -0.1915511910105124, -0.09969581204673482, 0.24256782722982784, -0.12619954378137158, 0.10103438249174765, 0.10658836734752791, 0.0010969043204871317, -0.06683343714620504, -0.3035630255497785, 0.1756545733440564, 0.09134713839998262, 0.2925371463423491, -0.018946111519148365, 0.06551246365480538, -0.0021049149541391265, -0.049357102174932756, -0.001939040826012691, -0.05356459365591743, 0.09580218693849424, 0.24073214469632756, 0.21562961345512627, 0.28686750760664126, -0.5268913774354991, -0.17585860836940506, 0.1068079015362956, 0.12323395261515138, 0.08583570734675353, 0.007441227851409672, -0.24895671969279648, 0.08099301328054732, -0.1751483800407085, -0.024248834901178875, -0.0786712269329453, 0.018713885693189998, 0.012460668216549998, -0.22645968664696234, -0.03471415736081932, 0.09562678523329346, 0.015871289384732437, -0.012543399348053047, -0.13535340331080886, -0.006125530244834307, 0.13248401127186502, 0.06823360254962205, 0.014526270046674956, 0.17442944399695584, -0.06432849660567526, -0.15688948293552837, 0.36451660560237037, -0.005635421556669623, -0.1144417387019429, 0.155563085273348, -0.07998245929678281, -0.16832463503297831, 0.20186952085932716, 0.17139016085841124, 0.07183211834894286, -0.18261070919947492, 0.04022312043622757, 0.043599813252997895, 0.2095817093352606, 0.11010110689482341, 0.033060139744904724, 0.12916383201308135, 0.1727964731356931, 0.09205667409761291, 0.1832935629477207, -0.033668968420372244, -0.1077232792818298, -0.26142232900989865, -0.1189157330431044, -0.1324209497646532, 0.022334288948655336, -0.09475500016932427, -0.10075635863920777, 0.4124224287716465, 0.1831253671540051, 0.15515958046049086, 0.13952871558398733, 0.3639744123443961, 0.11618287604522064, 0.15690477240386827, 0.11639151515361543, 0.185660745757923, 0.02969498122563689, 0.14692731630445147, -0.23390417084641132, 0.13148310486641196, 0.03756356366340899] |
710.4802 | Mutation Sampling Technique for the Generation of Structural Test Data | Our goal is to produce validation data that can be used as an efficient (pre)
test set for structural stuck-at faults. In this paper, we detail an original
test-oriented mutation sampling technique used for generating such data and we
present a first evaluation on these validation data with regard to a structural
test.
| cs.OH | our goal is to produce validation data that can be used as an efficient pre test set for structural stuckat faults in this paper we detail an original testoriented mutation sampling technique used for generating such data and we present a first evaluation on these validation data with regard to a structural test | [['our', 'goal', 'is', 'to', 'produce', 'validation', 'data', 'that', 'can', 'be', 'used', 'as', 'an', 'efficient', 'pre', 'test', 'set', 'for', 'structural', 'stuckat', 'faults', 'in', 'this', 'paper', 'we', 'detail', 'an', 'original', 'testoriented', 'mutation', 'sampling', 'technique', 'used', 'for', 'generating', 'such', 'data', 'and', 'we', 'present', 'a', 'first', 'evaluation', 'on', 'these', 'validation', 'data', 'with', 'regard', 'to', 'a', 'structural', 'test']] | [-0.034558546801026054, -0.004726824470988224, -0.07906965592589515, 0.09033808696012084, -0.0808445680886507, -0.07366685289889574, 0.06608644183143042, 0.4427371211349964, -0.23659822373436049, -0.3469807966254078, 0.1390360782724411, -0.22480282144477734, -0.1686468800673118, 0.2404042460884039, -0.12488878793262231, 0.12245166638436225, 0.12922875688841137, 0.0023136647382321265, -0.022576055932754222, -0.2813315135068618, 0.29166761454409706, 0.0947543392674281, 0.284850529806975, -0.019236681329158064, 0.04843785556239219, 0.00746586315262203, -0.02038269682536618, 0.03375762860433987, -0.1420269063412259, 0.12738246885083543, 0.3087448821528457, 0.22920906455076945, 0.26341534425647783, -0.4191428007056507, -0.13067666808358178, 0.10148254853601639, 0.10285645615658723, 0.15593776400559223, -0.10740375714242244, -0.2593779220389059, 0.12803867858691284, -0.16119711813875115, -0.07347751662242584, -0.19218841476294285, -0.0254544723026741, 0.000494468670624953, -0.3472685938557753, -0.004438814062338609, 0.05028339212115567, 0.0855388308588702, -0.04322321880429696, -0.07301623300792506, 0.02630404092801305, 0.173944780889612, 0.006214556046940673, 0.05475296642488012, 0.08689998366977446, -0.03926966605761733, -0.15502559880349928, 0.36949542705686045, -0.05602548049333004, -0.21469192984155738, 0.21041267447603437, 0.003606130342142513, -0.21131887736443716, 0.07463526886959489, 0.23820556610679397, 0.10146447762739487, -0.2263511054468556, -0.05165748387830368, 0.0001862802399465671, 0.1993346790281626, 0.042174921765063815, -0.048601825354405895, 0.13636295751740152, 0.23896745857760274, 0.0283760883164807, 0.20106767163423894, -0.1465686059762867, 0.005219560689651049, -0.3367045215832499, -0.20235631365973789, -0.2056720003915521, 0.013302974134253768, -0.06626731253093637, -0.1852722241041752, 0.38906460570601314, 0.25890058072176403, 0.20586303659141636, 0.06290536556536189, 0.29749670566973063, 0.06742609041332169, 0.04847944232684453, 0.03114697427596324, 0.16020258917258337, 0.0342787725206178, 0.05215209368795443, -0.16321559008569098, 0.10969070130242752, -0.012473790548168696] |
710.4803 | Hardware Engines for Bus Encryption: A Survey of Existing Techniques | The widening spectrum of applications and services provided by portable and
embedded devices bring a new dimension of concerns in security. Most of those
embedded systems (pay-TV, PDAs, mobile phones, etc...) make use of external
memory. As a result, the main problem is that data and instructions are
constantly exchanged between memory (RAM) and CPU in clear form on the bus.
This memory may contain confidential data like commercial software or private
contents, which either the end-user or the content provider is willing to
protect. The goal of this paper is to clearly describe the problem of
processor-memory bus communications in this regard and the existing techniques
applied to secure the communication channel through encryption - Performance
overheads implied by those solutions will be extensively discussed in this
paper.
| cs.CR | the widening spectrum of applications and services provided by portable and embedded devices bring a new dimension of concerns in security most of those embedded systems paytv pdas mobile phones etc make use of external memory as a result the main problem is that data and instructions are constantly exchanged between memory ram and cpu in clear form on the bus this memory may contain confidential data like commercial software or private contents which either the enduser or the content provider is willing to protect the goal of this paper is to clearly describe the problem of processormemory bus communications in this regard and the existing techniques applied to secure the communication channel through encryption performance overheads implied by those solutions will be extensively discussed in this paper | [['the', 'widening', 'spectrum', 'of', 'applications', 'and', 'services', 'provided', 'by', 'portable', 'and', 'embedded', 'devices', 'bring', 'a', 'new', 'dimension', 'of', 'concerns', 'in', 'security', 'most', 'of', 'those', 'embedded', 'systems', 'paytv', 'pdas', 'mobile', 'phones', 'etc', 'make', 'use', 'of', 'external', 'memory', 'as', 'a', 'result', 'the', 'main', 'problem', 'is', 'that', 'data', 'and', 'instructions', 'are', 'constantly', 'exchanged', 'between', 'memory', 'ram', 'and', 'cpu', 'in', 'clear', 'form', 'on', 'the', 'bus', 'this', 'memory', 'may', 'contain', 'confidential', 'data', 'like', 'commercial', 'software', 'or', 'private', 'contents', 'which', 'either', 'the', 'enduser', 'or', 'the', 'content', 'provider', 'is', 'willing', 'to', 'protect', 'the', 'goal', 'of', 'this', 'paper', 'is', 'to', 'clearly', 'describe', 'the', 'problem', 'of', 'processormemory', 'bus', 'communications', 'in', 'this', 'regard', 'and', 'the', 'existing', 'techniques', 'applied', 'to', 'secure', 'the', 'communication', 'channel', 'through', 'encryption', 'performance', 'overheads', 'implied', 'by', 'those', 'solutions', 'will', 'be', 'extensively', 'discussed', 'in', 'this', 'paper']] | [-0.1997541332821129, 0.029841383498933283, -0.026797375102432852, 0.04478047630527726, -0.09553843945468543, -0.21867651892534923, 0.09379218439971737, 0.38969759753672406, -0.3078892324908793, -0.33335212375823176, 0.1636561396117031, -0.30371528064642916, -0.108038973409748, 0.21024384703559917, -0.1737219838105375, 0.05533697898954415, 0.06308180560699839, 0.03798232779809041, 0.01397632618636635, -0.29930172881722683, 0.296557013731217, 0.04320571631251369, 0.3203210725259851, 0.06661289931435022, -0.011897253670213104, -0.013093620053041377, -0.04808255405805539, -0.054665909985487815, -0.040021743209138094, 0.15593381555481756, 0.3121161050075898, 0.18725492479097738, 0.2860162332399341, -0.4870818219424109, -0.17797769226308446, 0.06186595935650985, 0.15937666609079315, 0.05280206049337721, -0.09078896946175519, -0.28718188402126543, 0.11228003157384592, -0.2524289357388625, -0.09022048086615087, -0.049940947275899816, -0.012357961284578778, 0.029258969847433036, -0.22858943190658465, -0.025706252057716483, 0.013889558864320861, 0.0534256357805134, -0.007575686242148549, -0.054867279173777206, 0.008330526699865004, 0.19405364249087143, 0.033755654355445586, 0.008827613787616428, 0.1625624748194241, -0.13269883543762262, -0.13865068223822163, 0.413345868288161, 0.01574768182763364, -0.18760021179332398, 0.1870379652232259, -0.01217468414324685, -0.12655806694965577, 0.06462385797931347, 0.24372503982158378, 0.035547343586586067, -0.21242136017099256, 0.0619238876693089, 0.03943855646502925, 0.22103362233792723, 0.06226075167978706, 0.10714949364410131, 0.1716544399769191, 0.1699401607947948, 0.059117547381902114, 0.14426284138517076, -0.016079907434686902, -0.09909864322617068, -0.2044382605517967, -0.19786981472134357, -0.1926604210111691, 0.028389954208250856, -0.02611951287087777, -0.10903238733953913, 0.33024207320158894, 0.21034025741118967, 0.11040456173577695, 0.01558038673192641, 0.4331129036072525, 0.030004380237187434, 0.15856959795200964, 0.15428660576071707, 0.15370268300193857, 0.026715766354755033, 0.22862298723339336, -0.13279678922390303, 0.11179194768192247, -0.03855911586560978] |
710.4804 | Singular polarimetry: Evolution of polarization singularities in
electromagnetic waves propagating through a weakly anisotropic medium | We describe the evolution of a paraxial electromagnetic wave characterizing
by a non-uniform polarization distribution with singularities and propagating
in a weakly anisotropic medium. Our approach is based on the Stokes vector
evolution equation applied to a non-uniform initial polarization field. In the
case of a homogeneous medium, this equation is integrated analytically. This
yields a 3-dimensional distribution of the polarization parameters containing
singularities, i.e. C-lines of circular polarization and L-surfaces of linear
polarization. The general theory is applied to specific examples of the
unfolding of a vectorial vortex in birefringent and dichroic media.
| physics.optics | we describe the evolution of a paraxial electromagnetic wave characterizing by a nonuniform polarization distribution with singularities and propagating in a weakly anisotropic medium our approach is based on the stokes vector evolution equation applied to a nonuniform initial polarization field in the case of a homogeneous medium this equation is integrated analytically this yields a 3dimensional distribution of the polarization parameters containing singularities ie clines of circular polarization and lsurfaces of linear polarization the general theory is applied to specific examples of the unfolding of a vectorial vortex in birefringent and dichroic media | [['we', 'describe', 'the', 'evolution', 'of', 'a', 'paraxial', 'electromagnetic', 'wave', 'characterizing', 'by', 'a', 'nonuniform', 'polarization', 'distribution', 'with', 'singularities', 'and', 'propagating', 'in', 'a', 'weakly', 'anisotropic', 'medium', 'our', 'approach', 'is', 'based', 'on', 'the', 'stokes', 'vector', 'evolution', 'equation', 'applied', 'to', 'a', 'nonuniform', 'initial', 'polarization', 'field', 'in', 'the', 'case', 'of', 'a', 'homogeneous', 'medium', 'this', 'equation', 'is', 'integrated', 'analytically', 'this', 'yields', 'a', '3dimensional', 'distribution', 'of', 'the', 'polarization', 'parameters', 'containing', 'singularities', 'ie', 'clines', 'of', 'circular', 'polarization', 'and', 'lsurfaces', 'of', 'linear', 'polarization', 'the', 'general', 'theory', 'is', 'applied', 'to', 'specific', 'examples', 'of', 'the', 'unfolding', 'of', 'a', 'vectorial', 'vortex', 'in', 'birefringent', 'and', 'dichroic', 'media']] | [-0.16586417200604595, 0.1280010535772289, -0.11168215701216332, 0.02682919618147876, -0.11163431818857389, -0.06659543266900445, -0.05463729324745595, 0.3893648778759344, -0.2696039212607248, -0.20794656584339757, 0.04833263528448159, -0.24664887413758063, -0.12614132501986078, 0.15159420667075982, 0.04238662564431027, 0.07462237670677163, -0.0017399863009491274, -0.019250165270541304, -0.05987662065433719, -0.17641756445249562, 0.3737600789385377, 0.009841405313401934, 0.31347748785409874, 0.0002734969765628858, 0.14751673532369478, 0.07558963025709795, -0.03571421233436433, 0.07375343537999578, -0.09173775738686003, 0.10459393422840343, 0.1951571312803094, 0.048436012522127196, 0.17006346132726438, -0.40388507458070916, -0.2576148642166968, 0.05063955907920195, 0.11816306101779143, 0.18278547075967636, -0.06635713421799723, -0.25002531700026526, 0.014469675309154936, -0.09446521298409069, -0.24111941521887176, -0.021832282179265573, 0.04216224259211211, 0.08130249252632982, -0.29342022326885053, 0.0990868454438544, 0.05926283389600294, 0.03766287906315698, -0.06946000827836894, -0.04237987358349636, -0.05223470586552335, 0.015273976940861952, -0.013056446619024213, 0.0448079189944071, 0.0922166046796627, -0.1700888500994532, -0.06134229758253661, 0.40794111932477645, -0.12059951195573454, -0.26283278616686023, 0.09738882473089121, -0.1937758392273819, -0.03544877634023226, 0.16961808672915862, 0.22926937146813317, 0.1676308141009862, -0.12880030053577596, 0.07209230239705873, -0.060014780260145575, 0.14894320025679567, 0.10579163410640773, -0.001066106673885858, 0.21390272908273242, 0.1517174962797873, 0.01626320856232797, 0.1805325607939433, -0.08103195724818575, -0.0712680601519883, -0.3262627100151393, -0.13301306676810548, -0.1638275523775167, 0.10933494543383193, -0.10839312857640307, -0.213165307057, 0.4571930954973864, 0.09767704971540865, 0.15274555972866183, -0.030306358931846515, 0.30740158090628283, 0.1354891662898984, -0.004568899671236674, 0.06432878136414513, 0.2710111393488102, 0.22661859950962004, 0.13667765627765366, -0.23745367212861937, 0.02183310033112604, -0.0033853604928940854] |
710.4805 | Modeling of a Reconfigurable OFDM IP Block Family For an RF System
Simulator | The idea of design domain specific Mother Model of IP block family as a base
of modeling of system integration is presented here. A common reconfigurable
Mother Model for ten different standardized digital OFDM transmitters has been
developed. By means of a set of parameters, the mother model can be
reconfigured to any of the ten selected standards. So far the applicability of
the proposed reconfiguration and analog-digital co-modeling methods have been
proved by modeling the function of the digital parts of three, 802.11a, ADSL
and DRM, transmitters in an RF system simulator. The model is intended to be
used as signal source template in RF system simulations. The concept is not
restricted to signal sources, it can be applied to any IP block development.
The idea of the Mother Model will be applied in other design domains to prove
that in certain application areas, OFDM transceivers in this case, the design
process can progress simultaneously in different design domains - mixed signal,
system and RTL-architectural - without the need of high-level synthesis. Only
the Mother Models of three design domains are needed to be formally proved to
function as specified.
| cs.AR | the idea of design domain specific mother model of ip block family as a base of modeling of system integration is presented here a common reconfigurable mother model for ten different standardized digital ofdm transmitters has been developed by means of a set of parameters the mother model can be reconfigured to any of the ten selected standards so far the applicability of the proposed reconfiguration and analogdigital comodeling methods have been proved by modeling the function of the digital parts of three 80211a adsl and drm transmitters in an rf system simulator the model is intended to be used as signal source template in rf system simulations the concept is not restricted to signal sources it can be applied to any ip block development the idea of the mother model will be applied in other design domains to prove that in certain application areas ofdm transceivers in this case the design process can progress simultaneously in different design domains mixed signal system and rtlarchitectural without the need of highlevel synthesis only the mother models of three design domains are needed to be formally proved to function as specified | [['the', 'idea', 'of', 'design', 'domain', 'specific', 'mother', 'model', 'of', 'ip', 'block', 'family', 'as', 'a', 'base', 'of', 'modeling', 'of', 'system', 'integration', 'is', 'presented', 'here', 'a', 'common', 'reconfigurable', 'mother', 'model', 'for', 'ten', 'different', 'standardized', 'digital', 'ofdm', 'transmitters', 'has', 'been', 'developed', 'by', 'means', 'of', 'a', 'set', 'of', 'parameters', 'the', 'mother', 'model', 'can', 'be', 'reconfigured', 'to', 'any', 'of', 'the', 'ten', 'selected', 'standards', 'so', 'far', 'the', 'applicability', 'of', 'the', 'proposed', 'reconfiguration', 'and', 'analogdigital', 'comodeling', 'methods', 'have', 'been', 'proved', 'by', 'modeling', 'the', 'function', 'of', 'the', 'digital', 'parts', 'of', 'three', '80211a', 'adsl', 'and', 'drm', 'transmitters', 'in', 'an', 'rf', 'system', 'simulator', 'the', 'model', 'is', 'intended', 'to', 'be', 'used', 'as', 'signal', 'source', 'template', 'in', 'rf', 'system', 'simulations', 'the', 'concept', 'is', 'not', 'restricted', 'to', 'signal', 'sources', 'it', 'can', 'be', 'applied', 'to', 'any', 'ip', 'block', 'development', 'the', 'idea', 'of', 'the', 'mother', 'model', 'will', 'be', 'applied', 'in', 'other', 'design', 'domains', 'to', 'prove', 'that', 'in', 'certain', 'application', 'areas', 'ofdm', 'transceivers', 'in', 'this', 'case', 'the', 'design', 'process', 'can', 'progress', 'simultaneously', 'in', 'different', 'design', 'domains', 'mixed', 'signal', 'system', 'and', 'rtlarchitectural', 'without', 'the', 'need', 'of', 'highlevel', 'synthesis', 'only', 'the', 'mother', 'models', 'of', 'three', 'design', 'domains', 'are', 'needed', 'to', 'be', 'formally', 'proved', 'to', 'function', 'as', 'specified']] | [-0.14090446498258075, 0.05627653735167195, -0.0642991337855471, 0.003614280230033334, -0.09911750088430901, -0.17846665209916265, 0.02601066456838725, 0.39548769937877987, -0.30055881745336366, -0.3021462776742995, 0.14987023544428063, -0.21070567687306016, -0.14690913129498295, 0.19901571335036924, -0.07851322322715333, 0.09340518688095763, 0.013231954890935817, 0.01751976746836687, -0.03738652308780282, -0.2286253990866941, 0.25416923389131363, 0.0544311816848934, 0.3437206395553116, -0.027000188536165072, 0.06925899556708487, -0.013148047540456375, -0.005712205237823533, -0.023937367255809434, -0.05902819432223117, 0.08614896999032082, 0.3202750781873519, 0.21767604788441589, 0.26530002408914943, -0.4265393901038616, -0.2658747166972906, 0.10539446119654844, 0.163380810520288, 0.08649469050703282, -0.039923749238446875, -0.2611858937609194, 0.14252728425006178, -0.23145029650513024, -0.11195273750914848, -0.014366387923118623, -0.026472402158825792, 0.060107561261617246, -0.27118420332451076, -0.054510058159068384, 0.04618239660129788, 0.040188731461325115, -0.043315865487896184, -0.13147296505995135, 0.009204793827269565, 0.16986710627570767, -0.001966884351779961, 0.02630856259848006, 0.12311336709146592, -0.056294447327789696, -0.1291238636968727, 0.37657503721542046, -0.011493576640751273, -0.24683912474049485, 0.1739407731280824, -0.07662376560479961, -0.1033526741809904, 0.1070540800869943, 0.22036423444010836, 0.08471252194999214, -0.22775527410879035, 0.04929930910394641, 0.015619051323974516, 0.20734854047510395, 0.04406093677909258, 0.020440988045902973, 0.19733244777479045, 0.20021760798393087, 0.04872801577557814, 0.15302355855599545, -0.08275592424981495, -0.06458434994073516, -0.25977297040589037, -0.1400386542903588, -0.21888808948411184, -0.019554843189724582, -0.03111977026747094, -0.11970118239097406, 0.40922234151362974, 0.16300128450759446, 0.12262042386975279, 0.0006010100048752552, 0.3338750073696203, 0.09024353918283592, 0.14160507706237987, 0.018277588815871566, 0.1914490610535411, 0.09140795952750042, 0.11847027507735128, -0.1402774298971987, 0.08099344730586372, 0.022728400583812258] |
710.4806 | A VLSI Design Flow for Secure Side-Channel Attack Resistant ICs | This paper presents a digital VLSI design flow to create secure, side-channel
attack (SCA) resistant integrated circuits. The design flow starts from a
normal design in a hardware description language such as VHDL or Verilog and
provides a direct path to a SCA resistant layout. Instead of a full custom
layout or an iterative design process with extensive simulations, a few key
modifications are incorporated in a regular synchronous CMOS standard cell
design flow. We discuss the basis for side-channel attack resistance and adjust
the library databases and constraints files of the synthesis and place & route
procedures accordingly. Experimental results show that a DPA attack on a
regular single ended CMOS standard cell implementation of a module of the DES
algorithm discloses the secret key after 200 measurements. The same attack on a
secure version still does not disclose the secret key after more than 2000
measurements.
| cs.AR | this paper presents a digital vlsi design flow to create secure sidechannel attack sca resistant integrated circuits the design flow starts from a normal design in a hardware description language such as vhdl or verilog and provides a direct path to a sca resistant layout instead of a full custom layout or an iterative design process with extensive simulations a few key modifications are incorporated in a regular synchronous cmos standard cell design flow we discuss the basis for sidechannel attack resistance and adjust the library databases and constraints files of the synthesis and place route procedures accordingly experimental results show that a dpa attack on a regular single ended cmos standard cell implementation of a module of the des algorithm discloses the secret key after 200 measurements the same attack on a secure version still does not disclose the secret key after more than 2000 measurements | [['this', 'paper', 'presents', 'a', 'digital', 'vlsi', 'design', 'flow', 'to', 'create', 'secure', 'sidechannel', 'attack', 'sca', 'resistant', 'integrated', 'circuits', 'the', 'design', 'flow', 'starts', 'from', 'a', 'normal', 'design', 'in', 'a', 'hardware', 'description', 'language', 'such', 'as', 'vhdl', 'or', 'verilog', 'and', 'provides', 'a', 'direct', 'path', 'to', 'a', 'sca', 'resistant', 'layout', 'instead', 'of', 'a', 'full', 'custom', 'layout', 'or', 'an', 'iterative', 'design', 'process', 'with', 'extensive', 'simulations', 'a', 'few', 'key', 'modifications', 'are', 'incorporated', 'in', 'a', 'regular', 'synchronous', 'cmos', 'standard', 'cell', 'design', 'flow', 'we', 'discuss', 'the', 'basis', 'for', 'sidechannel', 'attack', 'resistance', 'and', 'adjust', 'the', 'library', 'databases', 'and', 'constraints', 'files', 'of', 'the', 'synthesis', 'and', 'place', 'route', 'procedures', 'accordingly', 'experimental', 'results', 'show', 'that', 'a', 'dpa', 'attack', 'on', 'a', 'regular', 'single', 'ended', 'cmos', 'standard', 'cell', 'implementation', 'of', 'a', 'module', 'of', 'the', 'des', 'algorithm', 'discloses', 'the', 'secret', 'key', 'after', '200', 'measurements', 'the', 'same', 'attack', 'on', 'a', 'secure', 'version', 'still', 'does', 'not', 'disclose', 'the', 'secret', 'key', 'after', 'more', 'than', '2000', 'measurements']] | [-0.1423843382615406, -0.0012048117959591541, -0.09572275117796776, 0.017194401154904504, -0.07577242219795277, -0.2605323056931145, 0.0991283768010294, 0.37397347167641126, -0.26224587787082104, -0.29339794529487895, 0.14297870840706237, -0.23811916856817444, -0.1529600240866698, 0.24744426557591476, -0.14087147674630998, 0.10208021809796797, 0.07845875738999572, -0.016466466896077555, -0.05347053425982087, -0.2294050500123147, 0.21090074043347165, 0.09863232398646421, 0.3409921455444122, -0.008268817606679841, 0.11369283102154985, 0.025318777758856208, -0.04418089803701051, -0.032718812726868864, -0.1066018160970404, 0.10015445487252214, 0.26568948263049025, 0.20189058384699685, 0.28674838338744174, -0.4588328461435174, -0.15767168930294562, 0.020893926063843934, 0.10525390942625347, 0.14793504963369192, -0.11388267107914933, -0.23449341306418536, 0.132915218026325, -0.23146586312728673, -0.06207834083118102, -0.05362537500074729, -0.044136327295405724, -0.01435897670698916, -0.26089630514893325, -0.05474820188848543, 0.05695076490163195, 0.070151320191379, 0.03859317754110207, -0.08704647495328975, 0.00703933688045359, 0.10474315670645182, -0.09417484166614591, 0.018459077014549807, 0.2279152333168994, -0.07675048416055942, -0.16069318907696525, 0.38179869574863307, 0.009141497743505268, -0.1434379791813985, 0.1299488976103615, 0.002641367694350327, -0.115456677536119, 0.14188946875249397, 0.2053038020282477, 0.06867225036709285, -0.1850701021854164, -0.00019155263577644923, -0.0006519389294442677, 0.27872693210485433, 0.05421058303473809, 0.02284083603152714, 0.19048917753968211, 0.2530299228280276, 0.06571855399675262, 0.14539168028637678, -0.08502460025935149, -0.08253465446193708, -0.2944457577319727, -0.17164228114831662, -0.1336934452885952, 0.029738903292838872, -0.07236163745191562, -0.17522671432899578, 0.39086900814277986, 0.1603499651683786, 0.14232144283200457, 0.07246141123655093, 0.43523655532776906, -0.025283630074914163, 0.12786224812624, 0.10727494278428507, 0.16504219407532492, 0.058779913494933625, 0.14979679173580845, -0.15828573308587326, 0.1156131666293051, 0.011261281734775929] |
710.4807 | A Constraint Network Based Approach to Memory Layout Optimization | While loop restructuring based code optimization for array intensive
applications has been successful in the past, it has several problems such as
the requirement of checking dependences (legality issues) and transformation of
all of the array references within the loop body indiscriminately (while some
of the references can benefit from the transformation, others may not). As a
result, data transformations, i.e., transformations that modify memory layout
of array data instead of loop structure have been proposed. One of the problems
associated with data transformations is the difficulty of selecting a memory
layout for an array that is acceptable to the entire program (not just to a
single loop). In this paper, we formulate the problem of determining the memory
layouts of arrays as a constraint network, and explore several methods of
solution in a systematic way. Our experiments provide strong support in favor
of employing constraint processing, and point out future research directions.
| cs.PL | while loop restructuring based code optimization for array intensive applications has been successful in the past it has several problems such as the requirement of checking dependences legality issues and transformation of all of the array references within the loop body indiscriminately while some of the references can benefit from the transformation others may not as a result data transformations ie transformations that modify memory layout of array data instead of loop structure have been proposed one of the problems associated with data transformations is the difficulty of selecting a memory layout for an array that is acceptable to the entire program not just to a single loop in this paper we formulate the problem of determining the memory layouts of arrays as a constraint network and explore several methods of solution in a systematic way our experiments provide strong support in favor of employing constraint processing and point out future research directions | [['while', 'loop', 'restructuring', 'based', 'code', 'optimization', 'for', 'array', 'intensive', 'applications', 'has', 'been', 'successful', 'in', 'the', 'past', 'it', 'has', 'several', 'problems', 'such', 'as', 'the', 'requirement', 'of', 'checking', 'dependences', 'legality', 'issues', 'and', 'transformation', 'of', 'all', 'of', 'the', 'array', 'references', 'within', 'the', 'loop', 'body', 'indiscriminately', 'while', 'some', 'of', 'the', 'references', 'can', 'benefit', 'from', 'the', 'transformation', 'others', 'may', 'not', 'as', 'a', 'result', 'data', 'transformations', 'ie', 'transformations', 'that', 'modify', 'memory', 'layout', 'of', 'array', 'data', 'instead', 'of', 'loop', 'structure', 'have', 'been', 'proposed', 'one', 'of', 'the', 'problems', 'associated', 'with', 'data', 'transformations', 'is', 'the', 'difficulty', 'of', 'selecting', 'a', 'memory', 'layout', 'for', 'an', 'array', 'that', 'is', 'acceptable', 'to', 'the', 'entire', 'program', 'not', 'just', 'to', 'a', 'single', 'loop', 'in', 'this', 'paper', 'we', 'formulate', 'the', 'problem', 'of', 'determining', 'the', 'memory', 'layouts', 'of', 'arrays', 'as', 'a', 'constraint', 'network', 'and', 'explore', 'several', 'methods', 'of', 'solution', 'in', 'a', 'systematic', 'way', 'our', 'experiments', 'provide', 'strong', 'support', 'in', 'favor', 'of', 'employing', 'constraint', 'processing', 'and', 'point', 'out', 'future', 'research', 'directions']] | [-0.13161875360517525, 0.039541021695613916, -0.06192283458502513, 0.03156201854984282, -0.11901703144855846, -0.13506290206710012, 0.06249443890627328, 0.4036295169513989, -0.26904351112061464, -0.3569092769814911, 0.18750064204647846, -0.25457105799304214, -0.1382483768161216, 0.20781422088080956, -0.05137781503768577, 0.08959841918241342, 0.10257630709353191, 0.017402105692513836, -0.09099613239583894, -0.22641376579740372, 0.27700070104275654, 0.10201317393920975, 0.2923400378816463, 0.03187263560986597, 0.10982033056039607, -0.00913912712845927, -0.03613021034744319, 0.05310572303292871, -0.030140683860985982, 0.11107330688874974, 0.2734918587908051, 0.19550940746538878, 0.2952643276170943, -0.45843898100790637, -0.24137519173372804, 0.07732281762363961, 0.132021800097492, 0.12319672406733635, -0.05743868783225908, -0.23875029852044666, 0.06182945227087627, -0.14835973567286737, -0.09460389906741387, -0.07425997208718674, 0.015334126734314791, 0.007994635900318185, -0.24479988860947938, -0.022291373240685752, 0.07441673806070136, 0.031507050673313, -0.023299779642519412, -0.11493194985410406, 0.03447223548606963, 0.1661061187993029, 0.04782355808671199, 0.038161473284822466, 0.11185823639343474, -0.13491880652963434, -0.15369386578989186, 0.406425312356232, -0.0017506651682292226, -0.1988206296090913, 0.13465730724795386, -0.07888156758184588, -0.1939036753911257, 0.10970985573515588, 0.16937275233623736, 0.07766220625642127, -0.1915352307263841, 0.08906928839936573, -0.03691460361728579, 0.16725425486201026, 0.06994771740773656, 0.05093480385512759, 0.22041749492671123, 0.19245064238792445, 0.08022241764154066, 0.1705209478748098, -0.07227575000766603, -0.08339888229966164, -0.2939754080626919, -0.13796999976244373, -0.14526093525437675, -0.026605036421458304, -0.058500807291506245, -0.16253399894591056, 0.3966594347882456, 0.1635777348587046, 0.1777416408865475, 0.020949917776567947, 0.2956384777645367, 0.0561898290955772, 0.153692491583867, 0.046368086260128644, 0.19569037775938958, 0.07150430594619632, 0.1230163908433443, -0.1975928717795029, 0.06235016869941081, 0.013527275510497537] |
710.4808 | Fast and Accurate Transaction Level Modeling of an Extended AMBA2.0 Bus
Architecture | Transaction Level Modeling (TLM) approach is used to meet the simulation
speed as well as cycle accuracy for large scale SoC performance analysis. We
implemented a transaction-level model of a proprietary bus called AHB+ which
supports an extended AMBA2.0 protocol. The AHB+ transaction-level model shows
353 times faster than pin-accurate RTL model while maintaining 97% of accuracy
on average. We also present the development procedure of TLM of a bus
architecture.
| cs.AR | transaction level modeling tlm approach is used to meet the simulation speed as well as cycle accuracy for large scale soc performance analysis we implemented a transactionlevel model of a proprietary bus called ahb which supports an extended amba20 protocol the ahb transactionlevel model shows 353 times faster than pinaccurate rtl model while maintaining 97 of accuracy on average we also present the development procedure of tlm of a bus architecture | [['transaction', 'level', 'modeling', 'tlm', 'approach', 'is', 'used', 'to', 'meet', 'the', 'simulation', 'speed', 'as', 'well', 'as', 'cycle', 'accuracy', 'for', 'large', 'scale', 'soc', 'performance', 'analysis', 'we', 'implemented', 'a', 'transactionlevel', 'model', 'of', 'a', 'proprietary', 'bus', 'called', 'ahb', 'which', 'supports', 'an', 'extended', 'amba20', 'protocol', 'the', 'ahb', 'transactionlevel', 'model', 'shows', '353', 'times', 'faster', 'than', 'pinaccurate', 'rtl', 'model', 'while', 'maintaining', '97', 'of', 'accuracy', 'on', 'average', 'we', 'also', 'present', 'the', 'development', 'procedure', 'of', 'tlm', 'of', 'a', 'bus', 'architecture']] | [-0.15152580069674962, -0.029335534623343214, -0.03506293158431578, 0.03157408524851274, 0.00428025612094696, -0.22939042812820687, 0.11325333635592698, 0.4008881053954795, -0.19532603253542946, -0.36828013744367205, 0.11240861973171865, -0.21786468297890996, -0.08992494294500869, 0.2574330889451169, -0.05899232726685865, 0.10101228183054406, 0.09630131888189826, -0.022259998553688976, 0.008854520447683804, -0.2393375186762516, 0.12942131221348394, 0.1465933494998709, 0.3574596930808131, 0.03528465218572081, 0.14469074317510577, -0.0018575926027868104, 0.003517776565707248, -0.007989454197872808, -0.031396731643168176, 0.1183699511423491, 0.19679971379430397, 0.15661899292625595, 0.2792307172726462, -0.40119585122211254, -0.17032233911458458, 0.003725174321806517, 0.10988045778746407, 0.08662774432889199, 0.042846821591028594, -0.2714682636053666, 0.08971148131388253, -0.2734905061433497, -0.09813330093047758, -0.06432547705059034, -0.015322506508749464, -0.03424953391346945, -0.28482604021395463, 0.05169460465212056, 0.03248734255422554, 0.12039082348211735, -0.006474774209377559, -0.09745907673504257, -0.05453841140210305, 0.09184706158112681, -0.04888416751982995, 0.04563492515665965, 0.17187510777696752, -0.06406431006726579, -0.17129767016656156, 0.38826519304859464, -0.10498750831807822, -0.15006082564376402, 0.17524647303735433, 0.007308690842457007, -0.1082704615023365, 0.08648623595776819, 0.243814495054708, 0.04314368173642003, -0.15259894327786955, 0.033400153845845576, 0.012856548220135164, 0.2814384846259718, 0.01388836735724539, -0.022838344918968884, 0.13379323945812666, 0.31987523843628773, 0.06049368726224571, 0.14792128483616357, -0.09171487064357253, -0.12325480655915495, -0.2442148538927237, -0.16548365207247273, -0.12444210420295164, -0.013305743041016378, -0.08233387069439219, -0.15785993789525135, 0.43122552536373987, 0.24133305039013858, 0.147245305887275, 0.1290000847429442, 0.349954456259645, 0.07987929212158897, 0.11531332750177092, 0.16623990245136447, 0.1703853411262558, 0.0006960704652727514, 0.12225646757439751, -0.19477083837019576, 0.07655219410114206, 0.046879811590348465] |
710.4809 | C Based Hardware Design for Wireless Applications | The algorithms used in wireless applications are increasingly more
sophisticated and consequently more challenging to implement in hardware.
Traditional design flows require developing the micro architecture, coding the
RTL, and verifying the generated RTL against the original functional C or
MATLAB specification. This paper describes a C-based design flow that is well
suited for the hardware implementation of DSP algorithms commonly found in
wireless applications. The C design flow relies on guided synthesis to generate
the RTL directly from the untimed C algorithm. The specifics of the C-based
design flow are described using a simple DSP filtering algorithm consisting of
a forward adaptive equalizer, a 64-QAM slicer and an adaptive decision feedback
equalizer. The example illustrates some of the capabilities and advantages
offered by this flow.
| cs.AR | the algorithms used in wireless applications are increasingly more sophisticated and consequently more challenging to implement in hardware traditional design flows require developing the micro architecture coding the rtl and verifying the generated rtl against the original functional c or matlab specification this paper describes a cbased design flow that is well suited for the hardware implementation of dsp algorithms commonly found in wireless applications the c design flow relies on guided synthesis to generate the rtl directly from the untimed c algorithm the specifics of the cbased design flow are described using a simple dsp filtering algorithm consisting of a forward adaptive equalizer a 64qam slicer and an adaptive decision feedback equalizer the example illustrates some of the capabilities and advantages offered by this flow | [['the', 'algorithms', 'used', 'in', 'wireless', 'applications', 'are', 'increasingly', 'more', 'sophisticated', 'and', 'consequently', 'more', 'challenging', 'to', 'implement', 'in', 'hardware', 'traditional', 'design', 'flows', 'require', 'developing', 'the', 'micro', 'architecture', 'coding', 'the', 'rtl', 'and', 'verifying', 'the', 'generated', 'rtl', 'against', 'the', 'original', 'functional', 'c', 'or', 'matlab', 'specification', 'this', 'paper', 'describes', 'a', 'cbased', 'design', 'flow', 'that', 'is', 'well', 'suited', 'for', 'the', 'hardware', 'implementation', 'of', 'dsp', 'algorithms', 'commonly', 'found', 'in', 'wireless', 'applications', 'the', 'c', 'design', 'flow', 'relies', 'on', 'guided', 'synthesis', 'to', 'generate', 'the', 'rtl', 'directly', 'from', 'the', 'untimed', 'c', 'algorithm', 'the', 'specifics', 'of', 'the', 'cbased', 'design', 'flow', 'are', 'described', 'using', 'a', 'simple', 'dsp', 'filtering', 'algorithm', 'consisting', 'of', 'a', 'forward', 'adaptive', 'equalizer', 'a', '64qam', 'slicer', 'and', 'an', 'adaptive', 'decision', 'feedback', 'equalizer', 'the', 'example', 'illustrates', 'some', 'of', 'the', 'capabilities', 'and', 'advantages', 'offered', 'by', 'this', 'flow']] | [-0.12813987743501212, -0.009325970565629494, -0.05918875704371622, 0.020874675465858587, -0.09295339785361041, -0.25422622315171695, -0.002784130066478004, 0.42517020606568884, -0.2669312785317685, -0.29463751222346984, 0.1434137184876904, -0.17397743292034618, -0.20618083546056398, 0.2690646272311578, -0.1095971460306337, 0.13660986034110897, 0.06566872555644267, -0.0117145541645143, -0.041040747058725666, -0.2243650378585453, 0.21634519275181766, 0.10978907283898147, 0.3381823678870523, -0.011196461101506083, 0.09520497239120435, 0.026176901378979284, -0.06990850399736137, -0.031247701506511058, -0.06564402110471126, 0.17170164160548695, 0.3186848300586765, 0.23340079547201711, 0.31739530170572894, -0.43199311061448137, -0.1939059108484625, 0.007954696851176403, 0.11643147105646748, 0.0786306413097514, -0.09430336015551195, -0.2681645062485976, 0.10971577104092353, -0.20439645323887587, -0.04829021755398975, -0.07024521871455132, -0.07031039750602629, 0.03987959282683675, -0.30156088743676684, -0.05959368708159124, 0.05492260658998959, 0.07353374879393312, 0.019631280497248684, -0.11499870204115434, 0.025108386147102073, 0.10843899082355497, -0.0732645348226282, 0.014327889500511072, 0.19422870328176825, -0.10887690030993702, -0.16128624431855446, 0.408478879051963, 0.0094521108512131, -0.2155788810849781, 0.18674486520744504, 0.04024429642595351, -0.10175006142226121, 0.1268033524005053, 0.21578350511660416, 0.06743360659669316, -0.1614606316600527, 0.06775697921445484, 0.05882450692089541, 0.20293447010159965, 0.029063779058762722, -0.0053831729113996505, 0.1389628058624646, 0.2692592243810872, 0.06489518718675726, 0.1538159521111834, -0.05655768110660747, -0.10237293969952416, -0.2546132532990582, -0.14092669661511623, -0.1569239683079696, -0.04723738498675326, -0.059547229166907654, -0.1768975739518831, 0.3893277252699056, 0.18769807566238184, 0.0880756527628927, 0.08749033382997685, 0.44341705545842175, 0.057862543310168095, 0.09999825486900388, 0.1679192375546942, 0.14887166317549555, 0.06497794540140718, 0.18351836993621426, -0.2161879712985533, 0.07284581255803388, 0.04453767223412075] |
710.481 | Area Efficient Hardware Implementation of Elliptic Curve Cryptography by
Iteratively Applying Karatsuba's Method | Securing communication channels is especially needed in wireless
environments. But applying cipher mechanisms in software is limited by the
calculation and energy resources of the mobile devices. If hardware is applied
to realize cryptographic operations cost becomes an issue. In this paper we
describe an approach which tackles all these three points. We implemented a
hardware accelerator for polynomial multiplication in extended Galois fields
(GF) applying Karatsuba's method iteratively. With this approach the area
consumption is reduced to 2.1 mm^2 in comparison to. 6.2 mm^2 for the standard
application of Karatsuba's method i.e. for recursive application. Our approach
also reduces the energy consumption to 60 per cent of the original approach.
The price we have to pay for these achievement is the increased execution time.
In our implementation a polynomial multiplication takes 3 clock cycles whereas
the recurisve Karatsuba approach needs only one clock cycle. But considering
area, energy and calculation speed we are convinced that the benefits of our
approach outweigh its drawback.
| cs.CR | securing communication channels is especially needed in wireless environments but applying cipher mechanisms in software is limited by the calculation and energy resources of the mobile devices if hardware is applied to realize cryptographic operations cost becomes an issue in this paper we describe an approach which tackles all these three points we implemented a hardware accelerator for polynomial multiplication in extended galois fields gf applying karatsubas method iteratively with this approach the area consumption is reduced to 21 mm2 in comparison to 62 mm2 for the standard application of karatsubas method ie for recursive application our approach also reduces the energy consumption to 60 per cent of the original approach the price we have to pay for these achievement is the increased execution time in our implementation a polynomial multiplication takes 3 clock cycles whereas the recurisve karatsuba approach needs only one clock cycle but considering area energy and calculation speed we are convinced that the benefits of our approach outweigh its drawback | [['securing', 'communication', 'channels', 'is', 'especially', 'needed', 'in', 'wireless', 'environments', 'but', 'applying', 'cipher', 'mechanisms', 'in', 'software', 'is', 'limited', 'by', 'the', 'calculation', 'and', 'energy', 'resources', 'of', 'the', 'mobile', 'devices', 'if', 'hardware', 'is', 'applied', 'to', 'realize', 'cryptographic', 'operations', 'cost', 'becomes', 'an', 'issue', 'in', 'this', 'paper', 'we', 'describe', 'an', 'approach', 'which', 'tackles', 'all', 'these', 'three', 'points', 'we', 'implemented', 'a', 'hardware', 'accelerator', 'for', 'polynomial', 'multiplication', 'in', 'extended', 'galois', 'fields', 'gf', 'applying', 'karatsubas', 'method', 'iteratively', 'with', 'this', 'approach', 'the', 'area', 'consumption', 'is', 'reduced', 'to', '21', 'mm2', 'in', 'comparison', 'to', '62', 'mm2', 'for', 'the', 'standard', 'application', 'of', 'karatsubas', 'method', 'ie', 'for', 'recursive', 'application', 'our', 'approach', 'also', 'reduces', 'the', 'energy', 'consumption', 'to', '60', 'per', 'cent', 'of', 'the', 'original', 'approach', 'the', 'price', 'we', 'have', 'to', 'pay', 'for', 'these', 'achievement', 'is', 'the', 'increased', 'execution', 'time', 'in', 'our', 'implementation', 'a', 'polynomial', 'multiplication', 'takes', '3', 'clock', 'cycles', 'whereas', 'the', 'recurisve', 'karatsuba', 'approach', 'needs', 'only', 'one', 'clock', 'cycle', 'but', 'considering', 'area', 'energy', 'and', 'calculation', 'speed', 'we', 'are', 'convinced', 'that', 'the', 'benefits', 'of', 'our', 'approach', 'outweigh', 'its', 'drawback']] | [-0.15752554199504065, 0.04356551650883716, -0.03905501791441733, 0.026594847467145168, -0.036356034081577795, -0.17016969963713932, 0.08627354165473439, 0.38889877481008966, -0.272014520719556, -0.34303884491027314, 0.10323727333581109, -0.23272896430614415, -0.13147157871027254, 0.2450263040551653, -0.13969094443857738, 0.048586259909942635, 0.06727670544781293, 0.0154759185988616, -0.02939913479273459, -0.3205792638501781, 0.22961701498941112, 0.08336789227245044, 0.29352601645142984, 0.06278555350595273, 0.08600648683981478, -0.02069347014649274, -0.03441304916321683, -0.048741375256124084, -0.03567635780794045, 0.14165180706436192, 0.29076693867236103, 0.1537570186684971, 0.31295688930853194, -0.4422070289522044, -0.16633917759258324, 0.11385648035435571, 0.1334981415620748, 0.0953541966090893, -0.038679318913927105, -0.2032048198683016, 0.11141340079805899, -0.2377131403355282, -0.11693874189062001, -0.06777126117940832, -5.608691656790628e-05, -0.02081521743897097, -0.24711926143753565, 0.004069752502862216, 0.03196765136465064, 0.05648222764485453, -0.025354516448648046, -0.11056872494118802, 0.05525145478020965, 0.09171740579750229, 0.004019983911292593, 0.040721143001656225, 0.16732591810276262, -0.10120597793977776, -0.12511993184302894, 0.39357491555206614, 0.004869125269216262, -0.18607814107775872, 0.13271188798811903, -0.06418504220136424, -0.15261835982291702, 0.13754576584002848, 0.15980349879596165, 0.07373597061810044, -0.1433736907348231, 0.09544843631765114, 0.042802408651843024, 0.21048305264782685, 0.08843143353884343, 0.027693207755662, 0.11927926609509744, 0.2084772962790434, 0.09498719249114942, 0.14090221592059438, -0.08343052882929704, -0.1166506718881314, -0.25653719941748343, -0.17852269013289454, -0.19353030056712658, 0.018067778685227312, -0.08080474055137206, -0.08390459806538342, 0.4037948154495812, 0.20792708391655076, 0.09660742314178154, 0.0954134364739529, 0.3945468644828656, 0.12244703272069045, 0.13084235342763695, 0.1355163426069897, 0.18345974248432573, 0.06923790977399316, 0.1389723527502337, -0.18178761891800727, 0.04134918337950677, 0.059283852394373136] |
710.4811 | System Level Analysis of the Bluetooth Standard | The SystemC modules of the Link Manager Layer and Baseband Layer have been
designed in this work at behavioral level to analyze the performances of the
Bluetooth standard. In particular the probability of the creation of a piconet
in presence of noise in the channel and the power reduction using the sniff and
hold mode have been investigated.
| cs.OH | the systemc modules of the link manager layer and baseband layer have been designed in this work at behavioral level to analyze the performances of the bluetooth standard in particular the probability of the creation of a piconet in presence of noise in the channel and the power reduction using the sniff and hold mode have been investigated | [['the', 'systemc', 'modules', 'of', 'the', 'link', 'manager', 'layer', 'and', 'baseband', 'layer', 'have', 'been', 'designed', 'in', 'this', 'work', 'at', 'behavioral', 'level', 'to', 'analyze', 'the', 'performances', 'of', 'the', 'bluetooth', 'standard', 'in', 'particular', 'the', 'probability', 'of', 'the', 'creation', 'of', 'a', 'piconet', 'in', 'presence', 'of', 'noise', 'in', 'the', 'channel', 'and', 'the', 'power', 'reduction', 'using', 'the', 'sniff', 'and', 'hold', 'mode', 'have', 'been', 'investigated']] | [-0.13301826011919385, 0.02510935162065615, -0.043695654647810195, -0.004269130120519549, 0.0019300124359092322, -0.1341612612876784, 0.07031293129066712, 0.37772615613608523, -0.2513647303547196, -0.2760577402559334, 0.12069642241112888, -0.24776768130410848, -0.1358532439917326, 0.14562890544565843, -0.07774925127561236, 0.06837175593205631, 0.029702500568638587, 0.07363633448579188, 0.009222056467792597, -0.2349227130220368, 0.31493846108687334, 0.12302718693711634, 0.3614363416644006, 0.04274106862280389, 0.10334323552148096, -0.02462460828848697, -0.028015246149152517, -0.024987130747016133, -0.07492036936033902, 0.10419979366345396, 0.268101701541033, 0.07548636316064873, 0.27368371617370124, -0.4626273424204054, -0.22485062217837648, 0.0798618135459978, 0.10071100663907569, 0.05296313364444108, -0.04680423642878003, -0.2694987277339759, 0.16858273323882242, -0.24277181473785434, -0.025863610537208873, 0.009097125670262452, -0.04572995088930274, 0.04100076107565185, -0.251720508207278, 0.007972291172963792, 0.05843865961350243, 0.09303804474144146, -0.022310566269503587, -0.08222457642891798, -0.024496961609813673, 0.20727498726598148, 0.027156950066925895, -0.027824939968734818, 0.1286859000422831, -0.16675931789735654, -0.13293799160626427, 0.3294858269329215, -0.06309317635243823, -0.19229934136543808, 0.17851363793055625, -0.11994180648692017, -0.1166397466801974, 0.09778445827421443, 0.2180535234189753, 0.02569743942726275, -0.17217449553246642, 0.1077769384689324, 0.004410570959062797, 0.16414248706483892, 0.10399380764634959, 0.08755506347094116, 0.1518498930020322, 0.21589376683876818, 0.015419331211636871, 0.15340034043865985, -0.1593379808975191, -0.06699882927832418, -0.22865812811029046, -0.1958960540399983, -0.14983607214576453, -0.02527439831113764, -0.004278901779014569, -0.10926434929996472, 0.43795552518989506, 0.14684921458106617, 0.1538559755647619, 0.05842791117952559, 0.31942781818837956, 0.1338095771437832, 0.1151134052699239, 0.05548668711381997, 0.2707043949048966, 0.10277995849349375, 0.1496485678061586, -0.2010082957366931, 0.08055113936003683, -0.00914788153825392] |
710.4812 | Area and Throughput Trade-Offs in the Design of Pipelined Discrete
Wavelet Transform Architectures | The JPEG2000 standard defines the discrete wavelet transform (DWT) as a
linear space-to-frequency transform of the image domain in an irreversible
compression. This irreversible discrete wavelet transform is implemented by FIR
filter using 9/7 Daubechies coefficients or a lifting scheme of factorizated
coefficients from 9/7 Daubechies coefficients. This work investigates the
tradeoffs between area, power and data throughput (or operating frequency) of
several implementations of the Discrete Wavelet Transform using the lifting
scheme in various pipeline designs. This paper shows the results of five
different architectures synthesized and simulated in FPGAs. It concludes that
the descriptions with pipelined operators provide the best area-power-operating
frequency trade-off over non-pipelined operators descriptions. Those
descriptions require around 40% more hardware to increase the maximum operating
frequency up to 100% and reduce power consumption to less than 50%. Starting
from behavioral HDL descriptions provide the best area-power-operating
frequency trade-off, improving hardware cost and maximum operating frequency
around 30% in comparison to structural descriptions for the same power
requirement.
| cs.AR | the jpeg2000 standard defines the discrete wavelet transform dwt as a linear spacetofrequency transform of the image domain in an irreversible compression this irreversible discrete wavelet transform is implemented by fir filter using 97 daubechies coefficients or a lifting scheme of factorizated coefficients from 97 daubechies coefficients this work investigates the tradeoffs between area power and data throughput or operating frequency of several implementations of the discrete wavelet transform using the lifting scheme in various pipeline designs this paper shows the results of five different architectures synthesized and simulated in fpgas it concludes that the descriptions with pipelined operators provide the best areapoweroperating frequency tradeoff over nonpipelined operators descriptions those descriptions require around 40 more hardware to increase the maximum operating frequency up to 100 and reduce power consumption to less than 50 starting from behavioral hdl descriptions provide the best areapoweroperating frequency tradeoff improving hardware cost and maximum operating frequency around 30 in comparison to structural descriptions for the same power requirement | [['the', 'jpeg2000', 'standard', 'defines', 'the', 'discrete', 'wavelet', 'transform', 'dwt', 'as', 'a', 'linear', 'spacetofrequency', 'transform', 'of', 'the', 'image', 'domain', 'in', 'an', 'irreversible', 'compression', 'this', 'irreversible', 'discrete', 'wavelet', 'transform', 'is', 'implemented', 'by', 'fir', 'filter', 'using', '97', 'daubechies', 'coefficients', 'or', 'a', 'lifting', 'scheme', 'of', 'factorizated', 'coefficients', 'from', '97', 'daubechies', 'coefficients', 'this', 'work', 'investigates', 'the', 'tradeoffs', 'between', 'area', 'power', 'and', 'data', 'throughput', 'or', 'operating', 'frequency', 'of', 'several', 'implementations', 'of', 'the', 'discrete', 'wavelet', 'transform', 'using', 'the', 'lifting', 'scheme', 'in', 'various', 'pipeline', 'designs', 'this', 'paper', 'shows', 'the', 'results', 'of', 'five', 'different', 'architectures', 'synthesized', 'and', 'simulated', 'in', 'fpgas', 'it', 'concludes', 'that', 'the', 'descriptions', 'with', 'pipelined', 'operators', 'provide', 'the', 'best', 'areapoweroperating', 'frequency', 'tradeoff', 'over', 'nonpipelined', 'operators', 'descriptions', 'those', 'descriptions', 'require', 'around', '40', 'more', 'hardware', 'to', 'increase', 'the', 'maximum', 'operating', 'frequency', 'up', 'to', '100', 'and', 'reduce', 'power', 'consumption', 'to', 'less', 'than', '50', 'starting', 'from', 'behavioral', 'hdl', 'descriptions', 'provide', 'the', 'best', 'areapoweroperating', 'frequency', 'tradeoff', 'improving', 'hardware', 'cost', 'and', 'maximum', 'operating', 'frequency', 'around', '30', 'in', 'comparison', 'to', 'structural', 'descriptions', 'for', 'the', 'same', 'power', 'requirement']] | [-0.10711894247642588, 0.015374663205691348, -0.07268566516805676, 0.03349433580997011, -0.07953808034764297, -0.13975011935837778, 0.07452584401766263, 0.40800244414212206, -0.2903381970952725, -0.3114393793777386, 0.1171540083876469, -0.25835792396417995, -0.12384329839680297, 0.25686444726454305, -0.08678286839748107, 0.11355265692654479, 0.02132644593020123, -0.016687255157850377, -0.11831526445866639, -0.23480738741876203, 0.18674251701037364, 0.12686431818181956, 0.3703938309881317, -0.04144580724436931, 0.10084361575700083, -0.034429045958087864, -0.08216429549590626, -0.09567954632913388, -0.06593297501530276, 0.12204369296956383, 0.30753175659942195, 0.15759542324768874, 0.2742184305510519, -0.4268191676303933, -0.186883231837161, 0.07413766045076182, 0.09838864914748724, 0.01634396708281593, -0.009851004905233166, -0.22721457129485811, 0.09121840998686591, -0.17718996644267648, -0.031402364010698625, -0.05736199288634153, -0.023809395126314668, 0.014750638351881807, -0.2709835848971447, 0.052739039121292935, 0.0764045400959086, 0.12968466080477625, -0.07079226676009218, -0.13246639667939442, 0.03096673253826396, 0.08283310723373125, -0.026703216983196974, 0.02601152345467406, 0.14828006267441507, -0.06623938568437449, -0.12364548224737702, 0.38195339406404316, -0.05728842171774426, -0.21790102890786964, 0.1840027550860202, -0.10570994783576013, -0.08182398244426173, 0.16653581074758764, 0.18475300443205464, 0.03005694058028203, -0.17745771360085522, 0.059246973280464826, 0.04989505743407467, 0.23074587869835145, 0.1785697645715532, 0.09339476538869211, 0.12060901110614591, 0.1664084424264729, 0.05963081096098581, 0.1813393153627462, -0.08477782716170024, -0.07045876522345139, -0.2381569420619679, -0.1257430937824936, -0.18820049864375563, -0.011220030916878317, -0.13665094851446927, -0.09700771242002898, 0.4355982800142429, 0.1589640336335177, 0.1774425655780242, 0.1206190522960564, 0.3564161060435426, 0.12272612067290192, 0.10482879093689018, 0.09223370372518143, 0.1631896768275153, 0.06657147015551035, 0.13694902873801398, -0.19240829629729253, -0.029867266584777192, 0.044271460970085635] |
710.4813 | Queue Management in Network Processors | One of the main bottlenecks when designing a network processing system is
very often its memory subsystem. This is mainly due to the state-of-the-art
network links operating at very high speeds and to the fact that in order to
support advanced Quality of Service (QoS), a large number of independent queues
is desirable. In this paper we analyze the performance bottlenecks of various
data memory managers integrated in typical Network Processing Units (NPUs). We
expose the performance limitations of software implementations utilizing the
RISC processing cores typically found in most NPU architectures and we identify
the requirements for hardware assisted memory management in order to achieve
wire-speed operation at gigabit per second rates. Furthermore, we describe the
architecture and performance of a hardware memory manager that fulfills those
requirements. This memory manager, although it is implemented in a
reconfigurable technology, it can provide up to 6.2Gbps of aggregate
throughput, while handling 32K independent queues.
| cs.AR | one of the main bottlenecks when designing a network processing system is very often its memory subsystem this is mainly due to the stateoftheart network links operating at very high speeds and to the fact that in order to support advanced quality of service qos a large number of independent queues is desirable in this paper we analyze the performance bottlenecks of various data memory managers integrated in typical network processing units npus we expose the performance limitations of software implementations utilizing the risc processing cores typically found in most npu architectures and we identify the requirements for hardware assisted memory management in order to achieve wirespeed operation at gigabit per second rates furthermore we describe the architecture and performance of a hardware memory manager that fulfills those requirements this memory manager although it is implemented in a reconfigurable technology it can provide up to 62gbps of aggregate throughput while handling 32k independent queues | [['one', 'of', 'the', 'main', 'bottlenecks', 'when', 'designing', 'a', 'network', 'processing', 'system', 'is', 'very', 'often', 'its', 'memory', 'subsystem', 'this', 'is', 'mainly', 'due', 'to', 'the', 'stateoftheart', 'network', 'links', 'operating', 'at', 'very', 'high', 'speeds', 'and', 'to', 'the', 'fact', 'that', 'in', 'order', 'to', 'support', 'advanced', 'quality', 'of', 'service', 'qos', 'a', 'large', 'number', 'of', 'independent', 'queues', 'is', 'desirable', 'in', 'this', 'paper', 'we', 'analyze', 'the', 'performance', 'bottlenecks', 'of', 'various', 'data', 'memory', 'managers', 'integrated', 'in', 'typical', 'network', 'processing', 'units', 'npus', 'we', 'expose', 'the', 'performance', 'limitations', 'of', 'software', 'implementations', 'utilizing', 'the', 'risc', 'processing', 'cores', 'typically', 'found', 'in', 'most', 'npu', 'architectures', 'and', 'we', 'identify', 'the', 'requirements', 'for', 'hardware', 'assisted', 'memory', 'management', 'in', 'order', 'to', 'achieve', 'wirespeed', 'operation', 'at', 'gigabit', 'per', 'second', 'rates', 'furthermore', 'we', 'describe', 'the', 'architecture', 'and', 'performance', 'of', 'a', 'hardware', 'memory', 'manager', 'that', 'fulfills', 'those', 'requirements', 'this', 'memory', 'manager', 'although', 'it', 'is', 'implemented', 'in', 'a', 'reconfigurable', 'technology', 'it', 'can', 'provide', 'up', 'to', '62gbps', 'of', 'aggregate', 'throughput', 'while', 'handling', '32k', 'independent', 'queues']] | [-0.22586779546806748, 0.021623921591406133, -0.02048173356517557, 0.016470572218107712, -0.07330780558400658, -0.18598275332841158, 0.06509933685220852, 0.42068334424017084, -0.27133265566713, -0.344404113429617, 0.13595310868757055, -0.22009465353415403, -0.11063690422201491, 0.21086212078615135, -0.1494608824788932, 0.08513400533016068, 0.11522677019916919, 0.03653513583750156, -0.025358867152503056, -0.30376960640304435, 0.22596883825458192, 0.11567490174441247, 0.3650888029982441, 0.03813657946021154, 0.08233037329855566, -0.07022279947656916, 0.018896459438375486, -0.048292842221797895, -0.03473868005377447, 0.15001161551312697, 0.32618857823953723, 0.1692280319791298, 0.32426250519520844, -0.48385052059758576, -0.1699701397809268, 0.04827477204203236, 0.12526449317649155, 0.035653736826266776, -0.004650971690919065, -0.21817833564046846, 0.14328097898069003, -0.23069183278014724, -0.05141346803280395, -0.08594423029818479, -0.01072212994185011, 0.033489091771682536, -0.2531494962618939, -0.053132632994000485, 0.02965162957275274, 0.014459144256219563, 0.008959472232609247, -0.09072842142646453, 0.03267495695806867, 0.16448482123395544, -0.01257037173413875, 0.009615722765362766, 0.1640186276971455, -0.15400744120849433, -0.12007211565058555, 0.3943928865567837, 0.004891276411983549, -0.1632206557281562, 0.21558167999810754, -0.04299494830293223, -0.20414453137986707, 0.10576037897972007, 0.24382793120053037, 0.002117809116383953, -0.21517158080008428, 0.022207063552229633, 0.09592190084189472, 0.2243317196651405, 0.07114940354853425, 0.12635273588142845, 0.15989836162751825, 0.3040445956913446, 0.06791990974436928, 0.17196113976267544, -0.07813786261018045, -0.09518377442184268, -0.2342755174239641, -0.17952197021958943, -0.19693277388447217, -0.005347314372424357, -0.08085348659369629, -0.1123499424684028, 0.3599903506615403, 0.21814618837273378, 0.11549950059231938, 0.1128805052945452, 0.40823787770585607, 0.0672562201168166, 0.18207384612324912, 0.1737722255033595, 0.13780922986048932, 0.014269658857771497, 0.21125322001344765, -0.20608591455029515, 0.09105720082667983, -0.05025358935386337] |
710.4814 | picoArray Technology: The Tool's Story | This paper briefly describes the picoArray? architecture, and in particular
the deterministic internal communication fabric. The methods that have been
developed for debugging and verifying systems using devices from the picoArray
family are explained. In order to maximize the computational ability of these
devices, hardware debugging support has been kept to a minimum and the methods
and tools developed to take this into account.
| cs.AR | this paper briefly describes the picoarray architecture and in particular the deterministic internal communication fabric the methods that have been developed for debugging and verifying systems using devices from the picoarray family are explained in order to maximize the computational ability of these devices hardware debugging support has been kept to a minimum and the methods and tools developed to take this into account | [['this', 'paper', 'briefly', 'describes', 'the', 'picoarray', 'architecture', 'and', 'in', 'particular', 'the', 'deterministic', 'internal', 'communication', 'fabric', 'the', 'methods', 'that', 'have', 'been', 'developed', 'for', 'debugging', 'and', 'verifying', 'systems', 'using', 'devices', 'from', 'the', 'picoarray', 'family', 'are', 'explained', 'in', 'order', 'to', 'maximize', 'the', 'computational', 'ability', 'of', 'these', 'devices', 'hardware', 'debugging', 'support', 'has', 'been', 'kept', 'to', 'a', 'minimum', 'and', 'the', 'methods', 'and', 'tools', 'developed', 'to', 'take', 'this', 'into', 'account']] | [-0.1197615309558328, 0.032004810479139126, -0.0801821920172041, 0.04167396636424406, -0.07186266746852667, -0.15920290841360488, 0.014064003580114654, 0.3946134044991566, -0.2444940652217596, -0.33641359309155133, 0.13179924983095617, -0.22427849903807887, -0.17382905388911885, 0.20823914287311415, -0.10876105183495148, 0.13725995361023852, 0.028163436454750838, -0.009332642244595674, -0.026469737325134055, -0.2661859268367651, 0.2716274409584941, 0.05843379654951634, 0.30804146880344035, 0.07973726246986658, 0.09450433149393048, -0.01097492354869422, -0.03073597116576087, 0.04228461150365371, -0.11407659401529893, 0.16714211111708033, 0.3006898183788684, 0.19678893534376496, 0.31526826207165515, -0.5106226502647323, -0.2334893761923717, 0.08934328772292863, 0.16544630403269925, 0.11960674882415802, -0.041081549284318765, -0.2701968981794292, 0.14573496682268958, -0.21197673107587522, -0.07970072862066914, -0.1300975981679174, -0.01630801392058211, 0.016056628176762212, -0.1956592784413407, -0.08515682854809828, 0.07206213936179635, 0.05260130911765079, -0.04462667601605532, -0.11262014285556131, 0.03322509459159788, 0.17932514432862762, 0.020970794642644543, -0.008301195027607103, 0.10608302058667064, -0.07871619954464897, -0.16619517630146396, 0.3897182412563838, 0.02453298087704987, -0.1836281984203285, 0.2145122454695088, -0.0549061223601682, -0.1572491203194424, 0.08582417531720092, 0.25270035482882974, 0.0478576157662657, -0.21326863315076597, 0.11080678546380612, 0.09611095578950499, 0.15701177401558286, 0.023323823904408323, 0.05127793773558111, 0.2041083923691223, 0.22239879072238242, 0.0008845746201733428, 0.13892830281533422, -0.03532821650526697, -0.0881794386152779, -0.22165496082555863, -0.19729040168796577, -0.17828767323836445, -0.040337643541035154, 0.012428607976612365, -0.12272353815816102, 0.38517992150398994, 0.21783178999659517, 0.12023767158989945, 0.07679942976908698, 0.38164408312689874, 0.10333435380110337, 0.1375090817530309, 0.115858648227708, 0.22693357376321668, 0.09364026241781821, 0.15587972239741393, -0.19785297464864748, 0.13597409325771995, 0.0193607177840726] |
710.4815 | Direct Conversion Pulsed UWB Transceiver Architecture | Ultra-wideband (UWB) communication is an emerging wireless technology that
promises high data rates over short distances and precise locationing. The
large available bandwidth and the constraint of a maximum power spectral
density drives a unique set of system challenges. This paper addresses these
challenges using two UWB transceivers and a discrete prototype platform.
| cs.NI | ultrawideband uwb communication is an emerging wireless technology that promises high data rates over short distances and precise locationing the large available bandwidth and the constraint of a maximum power spectral density drives a unique set of system challenges this paper addresses these challenges using two uwb transceivers and a discrete prototype platform | [['ultrawideband', 'uwb', 'communication', 'is', 'an', 'emerging', 'wireless', 'technology', 'that', 'promises', 'high', 'data', 'rates', 'over', 'short', 'distances', 'and', 'precise', 'locationing', 'the', 'large', 'available', 'bandwidth', 'and', 'the', 'constraint', 'of', 'a', 'maximum', 'power', 'spectral', 'density', 'drives', 'a', 'unique', 'set', 'of', 'system', 'challenges', 'this', 'paper', 'addresses', 'these', 'challenges', 'using', 'two', 'uwb', 'transceivers', 'and', 'a', 'discrete', 'prototype', 'platform']] | [-0.2853018089882889, 0.022668578238325316, 0.013779469923871869, -0.027181266692800903, -0.08942382698351482, -0.21584373767891862, 0.043920276952327565, 0.40153604211672295, -0.3098232361382611, -0.30673523869295166, 0.1306057792093236, -0.2597862186332075, -0.13670810818109871, 0.25593156042456067, -0.13362378509328612, 0.13107328320730408, 0.09524541968514896, -0.028239709540393274, -0.06419142719604215, -0.14668329488837495, 0.22608088462982537, 0.11253641756638041, 0.4107565629243288, 0.09366937745626103, 0.13652671000454575, -0.013089320802498819, -0.03068092081449785, -0.05881347995743437, -0.09460974273445932, 0.19752654188119298, 0.3467558550967984, 0.18445246886321395, 0.3525979849861337, -0.40662543226103737, -0.23661564647457298, 0.06587556066026665, 0.12375798634086507, 0.03991030450066868, -0.08668792502568015, -0.27198881649341927, 0.1050820189071292, -0.2653607828718311, -0.10326153617176526, 0.031087646243285458, -0.007845231841476459, 0.09706762039436484, -0.3123167295114331, -0.015342582544347024, -0.04437429507104856, 0.07714118479030593, -0.03370176635260852, -0.05545540516624965, 0.08760104597686737, 0.16765877227562498, -0.022650713531546435, -0.009132227403515915, 0.06760977496797184, -0.11791980853040684, -0.08666890803373085, 0.36930195328269927, -0.022888061038069077, -0.08671619722900807, 0.18694959916525855, -0.05965575057450893, -0.10246685101597938, 0.16339631633446464, 0.25612913760936484, 0.05886947700999818, -0.24048043371020061, 0.09074847299697862, 0.055239792744066776, 0.23400493959000088, 0.002848634250321478, 0.1768531070776143, 0.2439090798626531, 0.24933426420397634, 0.1423279640071516, 0.06891349274313675, -0.17607229987800754, -0.028153932802730573, -0.243657845459035, -0.09993871434960726, -0.2480294771914212, 0.04243207055600887, -0.07995588649509097, -0.08616312375327326, 0.39030115646837316, 0.16051242659571316, 0.09611616851234774, 0.07466074105633318, 0.41639687317722246, 0.08816273285340702, 0.0616888351615448, 0.11022927358149076, 0.15610978049489688, 0.09208500660288166, 0.18773996823616676, -0.16047456011808706, -0.029283832503869286, -0.08492479775153663] |
710.4816 | Power Saving Techniques for Wireless LANs | Fast wireless access has rapidly become commonplace. Wireless access points
and Hotspot servers are sprouting everywhere. Battery lifetime continues to be
a critical issue in mobile computing. This paper first gives an overview of
WLAN energy saving strategies, followed by an illustration of a system-level
methodology for saving power in heterogeneous wireless environments.
| cs.NI | fast wireless access has rapidly become commonplace wireless access points and hotspot servers are sprouting everywhere battery lifetime continues to be a critical issue in mobile computing this paper first gives an overview of wlan energy saving strategies followed by an illustration of a systemlevel methodology for saving power in heterogeneous wireless environments | [['fast', 'wireless', 'access', 'has', 'rapidly', 'become', 'commonplace', 'wireless', 'access', 'points', 'and', 'hotspot', 'servers', 'are', 'sprouting', 'everywhere', 'battery', 'lifetime', 'continues', 'to', 'be', 'a', 'critical', 'issue', 'in', 'mobile', 'computing', 'this', 'paper', 'first', 'gives', 'an', 'overview', 'of', 'wlan', 'energy', 'saving', 'strategies', 'followed', 'by', 'an', 'illustration', 'of', 'a', 'systemlevel', 'methodology', 'for', 'saving', 'power', 'in', 'heterogeneous', 'wireless', 'environments']] | [-0.2983590640689967, 0.03657560776710458, -0.015077460724157546, -0.02931690635379263, -0.04282271405154804, -0.21488212716748128, 0.11452268179778431, 0.3869267096918709, -0.23343886566822822, -0.26643176123781026, 0.09082367799666552, -0.25557677897642245, -0.12667897041395026, 0.21751113183234097, -0.18672217652728818, 0.06009368208359997, 0.041294387875581685, 0.012737345864187996, 0.07012904226287918, -0.24407230101894797, 0.22612329435376627, 0.16953327157095355, 0.4026421569287777, 0.10379388374891484, -0.02376231155797558, -0.03845905450629598, -0.07233795393609775, -0.07484235273638987, -0.09199743789954568, 0.09239078936044057, 0.3958679621441747, 0.14574676638750253, 0.38815083976764725, -0.5310380444774088, -0.275670199180549, 0.1056450203517979, 0.24780558303595995, 0.035084161138654035, -0.10855099165214682, -0.23930154424512162, 0.14163585977611254, -0.35095621550561124, -0.13680940812875358, -0.02856488715646402, 0.03354338133918508, 0.03533310209453668, -0.3039154984443536, -0.033109133307523325, -0.0642519410840183, 0.11136454122387013, -0.07796425037613174, -0.03666085074216409, 0.10361627953232459, 0.18236998899154505, 0.05544126256070328, 0.00140857791422673, 0.17035956619272255, -0.12221475639204793, -0.11181395157802639, 0.36461415570580735, 0.08362814172540071, -0.11328032432686326, 0.15572595113080065, 0.02239098490373987, -0.11968900093738481, 0.16112491372480708, 0.2743503305674443, 0.04577370394759302, -0.23463420929246634, 0.07175542482609842, 0.098424767231885, 0.12400986602143296, 0.053079073080125286, 0.0826400536209134, 0.23379234939743326, 0.3057266573931249, 0.20419007523934235, 0.105636883175598, -0.06682617609160689, -0.14295647954041102, -0.14951836857241843, -0.16650134094832642, -0.25141811867262115, 0.12187709743684193, -0.0923695838392409, -0.1384180981560417, 0.3815861932300734, 0.12551334248152826, 0.11866764356997216, 0.06660848838400166, 0.44173162859284654, 0.07359604642919775, 0.05323898093774915, 0.22290772635419415, 0.1085907004527607, -0.008351658624684755, 0.3034628004116832, -0.10826025333888126, 0.04502207919832249, -0.05743361327726886] |
710.4817 | Performance Considerations for an Embedded Implementation of OMA DRM 2 | As digital content services gain importance in the mobile world, Digital
Rights Management (DRM) applications will become a key component of mobile
terminals. This paper examines the effect dedicated hardware macros for
specific cryptographic functions have on the performance of a mobile terminal
that supports version 2 of the open standard for Digital Rights Management
defined by the Open Mobile Alliance (OMA). Following a general description of
the standard, the paper contains a detailed analysis of the cryptographic
operations that have to be carried out before protected content can be
accessed. The combination of this analysis with data on execution times for
specific algorithms realized in hardware and software has made it possible to
build a model which has allowed us to assert that hardware acceleration for
specific cryptographic algorithms can significantly reduce the impact DRM has
on a mobile terminal's processing performance and battery life.
| cs.CR | as digital content services gain importance in the mobile world digital rights management drm applications will become a key component of mobile terminals this paper examines the effect dedicated hardware macros for specific cryptographic functions have on the performance of a mobile terminal that supports version 2 of the open standard for digital rights management defined by the open mobile alliance oma following a general description of the standard the paper contains a detailed analysis of the cryptographic operations that have to be carried out before protected content can be accessed the combination of this analysis with data on execution times for specific algorithms realized in hardware and software has made it possible to build a model which has allowed us to assert that hardware acceleration for specific cryptographic algorithms can significantly reduce the impact drm has on a mobile terminals processing performance and battery life | [['as', 'digital', 'content', 'services', 'gain', 'importance', 'in', 'the', 'mobile', 'world', 'digital', 'rights', 'management', 'drm', 'applications', 'will', 'become', 'a', 'key', 'component', 'of', 'mobile', 'terminals', 'this', 'paper', 'examines', 'the', 'effect', 'dedicated', 'hardware', 'macros', 'for', 'specific', 'cryptographic', 'functions', 'have', 'on', 'the', 'performance', 'of', 'a', 'mobile', 'terminal', 'that', 'supports', 'version', '2', 'of', 'the', 'open', 'standard', 'for', 'digital', 'rights', 'management', 'defined', 'by', 'the', 'open', 'mobile', 'alliance', 'oma', 'following', 'a', 'general', 'description', 'of', 'the', 'standard', 'the', 'paper', 'contains', 'a', 'detailed', 'analysis', 'of', 'the', 'cryptographic', 'operations', 'that', 'have', 'to', 'be', 'carried', 'out', 'before', 'protected', 'content', 'can', 'be', 'accessed', 'the', 'combination', 'of', 'this', 'analysis', 'with', 'data', 'on', 'execution', 'times', 'for', 'specific', 'algorithms', 'realized', 'in', 'hardware', 'and', 'software', 'has', 'made', 'it', 'possible', 'to', 'build', 'a', 'model', 'which', 'has', 'allowed', 'us', 'to', 'assert', 'that', 'hardware', 'acceleration', 'for', 'specific', 'cryptographic', 'algorithms', 'can', 'significantly', 'reduce', 'the', 'impact', 'drm', 'has', 'on', 'a', 'mobile', 'terminals', 'processing', 'performance', 'and', 'battery', 'life']] | [-0.18694550445190095, 0.009051641238429137, -0.060253928078989154, 0.014852926847907677, -0.09524120889246872, -0.2043360882719392, 0.09843824517096661, 0.36128258545666114, -0.2504363056010733, -0.31131156375759267, 0.14190952265985973, -0.25746802116540096, -0.08951073470334076, 0.25641284472698167, -0.1310078888646748, 0.046656840391559144, 0.06347952829673886, 0.02938615314802793, -0.021287000261658598, -0.2952649471388288, 0.26569001293702893, 0.06898741994040368, 0.33788254138158813, 0.05842730555721648, 0.027610480542970845, 0.014847933152078153, -0.06229720155513935, -0.018510346961118383, -0.07607577312397826, 0.12757243672768548, 0.3093522537263646, 0.22908493167440064, 0.2976654195226729, -0.45738081856031126, -0.18918688812178291, 0.09362814489318287, 0.16480852402300153, 0.03587166245704619, -0.09215281779275034, -0.2756961355087896, 0.13270284816916164, -0.26005859499516554, -0.09856263395360582, -0.06721821438827336, 0.023326422961760466, 0.02104474969323061, -0.24587548314593732, -0.06241243509639514, -0.00862486639350321, 0.08672650168053424, 0.016670481359254415, -0.08975375689604409, 0.008399688594094287, 0.18821374591031712, 0.00498973662815095, 0.013080458508402568, 0.16923343877257038, -0.1220084253827362, -0.1638769798350763, 0.4053870693346715, 0.023124589490678724, -0.16628156319158535, 0.15966872839824844, -0.022688020806925446, -0.16110061774387546, 0.0677540742916578, 0.2302465732129648, 0.022037444942413945, -0.21732903003998816, 0.10402296542760929, 0.00034156171222255653, 0.2021245663293497, 0.04592700821207198, 0.07191278212839317, 0.20657927114899233, 0.2270670764735096, 0.07090062418735701, 0.11084088401020543, -0.025767301134318625, -0.09869490000331609, -0.228694122839617, -0.20131549186851472, -0.17379768780107316, 0.050742634969176595, -0.03871680719579398, -0.13126286407549903, 0.398594938103773, 0.19222831817482175, 0.08558380914762719, 0.017352915199135416, 0.4015757108604765, 0.051063681530849114, 0.16760950547017872, 0.10178262987875775, 0.15207033395473782, -0.010354482604532379, 0.20951030368291557, -0.15356510525492773, 0.11070564663522456, -0.0029811297371115995] |
710.4818 | Wireless LAN: Past, Present, and Future | This paper retraces the historical development of wireless LAN technology in
the context of the pursuit of ever higher data rate, describes the significant
technical breakthroughs that are now occurring, and speculates on future
directions that the technology may take over the remainder of the decade. The
challenges that these developments have created for low power operation are
considered, as well as some of the opportunities that are presented to mitigate
them. The importance of MIMO as an emerging technology for 802.11 is
specifically highlighted, both in terms of the significant increase in data
rate and range that it enables as well as the considerable challenge that it
presents for the development of low power wireless LAN products.
| cs.NI | this paper retraces the historical development of wireless lan technology in the context of the pursuit of ever higher data rate describes the significant technical breakthroughs that are now occurring and speculates on future directions that the technology may take over the remainder of the decade the challenges that these developments have created for low power operation are considered as well as some of the opportunities that are presented to mitigate them the importance of mimo as an emerging technology for 80211 is specifically highlighted both in terms of the significant increase in data rate and range that it enables as well as the considerable challenge that it presents for the development of low power wireless lan products | [['this', 'paper', 'retraces', 'the', 'historical', 'development', 'of', 'wireless', 'lan', 'technology', 'in', 'the', 'context', 'of', 'the', 'pursuit', 'of', 'ever', 'higher', 'data', 'rate', 'describes', 'the', 'significant', 'technical', 'breakthroughs', 'that', 'are', 'now', 'occurring', 'and', 'speculates', 'on', 'future', 'directions', 'that', 'the', 'technology', 'may', 'take', 'over', 'the', 'remainder', 'of', 'the', 'decade', 'the', 'challenges', 'that', 'these', 'developments', 'have', 'created', 'for', 'low', 'power', 'operation', 'are', 'considered', 'as', 'well', 'as', 'some', 'of', 'the', 'opportunities', 'that', 'are', 'presented', 'to', 'mitigate', 'them', 'the', 'importance', 'of', 'mimo', 'as', 'an', 'emerging', 'technology', 'for', '80211', 'is', 'specifically', 'highlighted', 'both', 'in', 'terms', 'of', 'the', 'significant', 'increase', 'in', 'data', 'rate', 'and', 'range', 'that', 'it', 'enables', 'as', 'well', 'as', 'the', 'considerable', 'challenge', 'that', 'it', 'presents', 'for', 'the', 'development', 'of', 'low', 'power', 'wireless', 'lan', 'products']] | [-0.15368186931078465, 0.0698212238998691, 0.004936874307439489, 0.00880991413368512, -0.04597919619389636, -0.09510529515633391, 0.013793651184256552, 0.3502474253428942, -0.26364477850117923, -0.30698038017677176, 0.1864000197857129, -0.2737498521564086, -0.17977988285849156, 0.27252358936909904, -0.11084723641496089, 0.06459199851457724, 0.06305390945241107, 0.004210493503675117, -0.01708801076116072, -0.2528398812637996, 0.27398971414540785, 0.13425723351617108, 0.37003928928051966, 0.10184112109117589, 0.061568704222613096, 0.00010200218550103195, -0.05967210211112338, -0.037476145276124986, -0.07097774735906939, 0.1521893475299417, 0.3419047015387628, 0.19595657742061354, 0.34559629853988477, -0.4648084729688905, -0.25418230782310336, 0.08046035788720474, 0.1712504115894879, 0.05592053948301759, -0.11681670967244812, -0.21942013532901972, 0.1291953237126463, -0.24832316688498704, -0.12585742894749521, -0.058974181664949755, 0.02011776724988121, 0.054505484604860766, -0.20305960744193172, 0.016131303273141384, 0.04773258729403744, 0.03706566064807949, -0.020587821203970617, -0.13487272266045972, 0.03367275900061448, 0.1908541263635586, 0.09864241457189102, 0.039198728791295975, 0.07997823126961366, -0.17495396340826241, -0.12325285795890584, 0.39279679609936174, -0.038813294929657446, -0.09794433940679498, 0.17744756943814582, -0.12264892121113963, -0.13585623523015214, 0.07993120791674671, 0.2195182246002132, 0.025916186712832207, -0.1722592746333803, 0.06357394656811652, 0.028851635501546374, 0.07557354655937623, 0.04558988491475772, 0.1282445367828201, 0.2120427159450443, 0.21641846512586382, 0.08314658450830917, 0.08388739386257732, -0.10217725713439488, -0.11600818849855371, -0.2758973493493336, -0.17103783248023965, -0.1576698082499206, 0.010340980632956756, -0.05449659928607447, -0.11276105335140127, 0.38151754150009254, 0.18469989562300587, 0.15833170301186206, 0.013499570304085896, 0.3366095485655054, 0.08221674996518956, 0.1175771769199331, 0.031106522725105792, 0.25816917738811135, 0.0694768933137342, 0.19973946002734258, -0.1395307322806221, 0.08836354340142491, -0.0528203131299529] |
710.4819 | A High Quality/Low Computational Cost Technique for Block Matching
Motion Estimation | Motion estimation is the most critical process in video coding systems. First
of all, it has a definitive impact on the rate-distortion performance given by
the video encoder. Secondly, it is the most computationally intensive process
within the encoding loop. For these reasons, the design of high-performance
low-cost motion estimators is a crucial task in the video compression field. An
adaptive cost block matching (ACBM) motion estimation technique is presented in
this paper, featuring an excellent tradeoff between the quality of the
reconstructed video sequences and the computational effort. Simulation results
demonstrate that the ACBM algorithm achieves a slight better rate-distortion
performance than the one given by the well-known full search algorithm block
matching algorithm with reductions of up to 95% in the computational load.
| cs.MM | motion estimation is the most critical process in video coding systems first of all it has a definitive impact on the ratedistortion performance given by the video encoder secondly it is the most computationally intensive process within the encoding loop for these reasons the design of highperformance lowcost motion estimators is a crucial task in the video compression field an adaptive cost block matching acbm motion estimation technique is presented in this paper featuring an excellent tradeoff between the quality of the reconstructed video sequences and the computational effort simulation results demonstrate that the acbm algorithm achieves a slight better ratedistortion performance than the one given by the wellknown full search algorithm block matching algorithm with reductions of up to 95 in the computational load | [['motion', 'estimation', 'is', 'the', 'most', 'critical', 'process', 'in', 'video', 'coding', 'systems', 'first', 'of', 'all', 'it', 'has', 'a', 'definitive', 'impact', 'on', 'the', 'ratedistortion', 'performance', 'given', 'by', 'the', 'video', 'encoder', 'secondly', 'it', 'is', 'the', 'most', 'computationally', 'intensive', 'process', 'within', 'the', 'encoding', 'loop', 'for', 'these', 'reasons', 'the', 'design', 'of', 'highperformance', 'lowcost', 'motion', 'estimators', 'is', 'a', 'crucial', 'task', 'in', 'the', 'video', 'compression', 'field', 'an', 'adaptive', 'cost', 'block', 'matching', 'acbm', 'motion', 'estimation', 'technique', 'is', 'presented', 'in', 'this', 'paper', 'featuring', 'an', 'excellent', 'tradeoff', 'between', 'the', 'quality', 'of', 'the', 'reconstructed', 'video', 'sequences', 'and', 'the', 'computational', 'effort', 'simulation', 'results', 'demonstrate', 'that', 'the', 'acbm', 'algorithm', 'achieves', 'a', 'slight', 'better', 'ratedistortion', 'performance', 'than', 'the', 'one', 'given', 'by', 'the', 'wellknown', 'full', 'search', 'algorithm', 'block', 'matching', 'algorithm', 'with', 'reductions', 'of', 'up', 'to', '95', 'in', 'the', 'computational', 'load']] | [-0.1254610370232239, -0.01339443839070902, -0.09069210195126451, 0.033753066015297525, -0.04800733593027524, -0.15708259197436575, 0.0519576048510664, 0.43160419141858575, -0.25372489350393596, -0.3433682758633683, 0.11455352665341603, -0.22344659526673397, -0.19251164059510562, 0.2161528870820189, -0.15842067075673702, 0.13938767940177, 0.1266523209983498, 0.06477022279296221, -0.05156305028036676, -0.3136280221879725, 0.21568895249941758, 0.13971307180912756, 0.34961606481877283, -0.0013059215938172688, 0.1242839674109487, 0.001867407001554966, -0.03231540788722232, -0.02479291463089062, -0.0984444704110383, 0.15745854887229246, 0.2719807303018444, 0.19387778345631754, 0.3149302179008965, -0.3516487925033259, -0.1778201324509351, 0.05896837725417643, 0.16260252629474894, 0.09695244601708118, -0.09494397946447891, -0.253433447974787, 0.09605933528046154, -0.14404952964306303, 0.027487096096563145, -0.05739003105744023, -0.019642771020100067, -0.035478014634293696, -0.3051933017639799, 0.040197149774710825, 0.038102554990266393, 0.03478582020909563, -0.02362876270549387, -0.09921749494212671, 0.05962234180102625, 0.16574589190701763, 0.029964786382085395, 0.08810012185628094, 0.10751549946522809, -0.16809014916113327, -0.15631234663069188, 0.41585879247423596, -0.03099604442630936, -0.22369700605504034, 0.15714592056545784, -0.07684542815678003, -0.12325922301137532, 0.2168169318796779, 0.20064817114574154, 0.09300121441481131, -0.17907890882645924, 0.038302438668206304, -0.017488333154318293, 0.2059205330726577, 0.07472859918919762, 0.03365790261271811, 0.15752963141379198, 0.2934624395537667, 0.09732504100046628, 0.15846294197405317, -0.09721286744030753, -0.08534715613880293, -0.25618459324057147, -0.1487976639241461, -0.20330330012347247, -0.0696489796945371, -0.1771739910363089, -0.13467322710931787, 0.3688443340285401, 0.2088842740570142, 0.13799080390074267, 0.0960981342846876, 0.4020714176424999, 0.07815349892130107, 0.03913078771059863, 0.13547750325387012, 0.18708234351522068, 0.0554204901104899, 0.10692077386051008, -0.22683380352904853, 0.08424455270254455, 0.0749895931827283] |
710.482 | ISEGEN: Generation of High-Quality Instruction Set Extensions by
Iterative Improvement | Customization of processor architectures through Instruction Set Extensions
(ISEs) is an effective way to meet the growing performance demands of embedded
applications. A high-quality ISE generation approach needs to obtain results
close to those achieved by experienced designers, particularly for complex
applications that exhibit regularity: expert designers are able to exploit
manually such regularity in the data flow graphs to generate high-quality ISEs.
In this paper, we present ISEGEN, an approach that identifies high-quality ISEs
by iterative improvement following the basic principles of the well-known
Kernighan-Lin (K-L) min-cut heuristic. Experimental results on a number of
MediaBench, EEMBC and cryptographic applications show that our approach matches
the quality of the optimal solution obtained by exhaustive search. We also show
that our ISEGEN technique is on average 20x faster than a genetic formulation
that generates equivalent solutions. Furthermore, the ISEs identified by our
technique exhibit 35% more speedup than the genetic solution on a large
cryptographic application (AES) by effectively exploiting its regular
structure.
| cs.AR | customization of processor architectures through instruction set extensions ises is an effective way to meet the growing performance demands of embedded applications a highquality ise generation approach needs to obtain results close to those achieved by experienced designers particularly for complex applications that exhibit regularity expert designers are able to exploit manually such regularity in the data flow graphs to generate highquality ises in this paper we present isegen an approach that identifies highquality ises by iterative improvement following the basic principles of the wellknown kernighanlin kl mincut heuristic experimental results on a number of mediabench eembc and cryptographic applications show that our approach matches the quality of the optimal solution obtained by exhaustive search we also show that our isegen technique is on average 20x faster than a genetic formulation that generates equivalent solutions furthermore the ises identified by our technique exhibit 35 more speedup than the genetic solution on a large cryptographic application aes by effectively exploiting its regular structure | [['customization', 'of', 'processor', 'architectures', 'through', 'instruction', 'set', 'extensions', 'ises', 'is', 'an', 'effective', 'way', 'to', 'meet', 'the', 'growing', 'performance', 'demands', 'of', 'embedded', 'applications', 'a', 'highquality', 'ise', 'generation', 'approach', 'needs', 'to', 'obtain', 'results', 'close', 'to', 'those', 'achieved', 'by', 'experienced', 'designers', 'particularly', 'for', 'complex', 'applications', 'that', 'exhibit', 'regularity', 'expert', 'designers', 'are', 'able', 'to', 'exploit', 'manually', 'such', 'regularity', 'in', 'the', 'data', 'flow', 'graphs', 'to', 'generate', 'highquality', 'ises', 'in', 'this', 'paper', 'we', 'present', 'isegen', 'an', 'approach', 'that', 'identifies', 'highquality', 'ises', 'by', 'iterative', 'improvement', 'following', 'the', 'basic', 'principles', 'of', 'the', 'wellknown', 'kernighanlin', 'kl', 'mincut', 'heuristic', 'experimental', 'results', 'on', 'a', 'number', 'of', 'mediabench', 'eembc', 'and', 'cryptographic', 'applications', 'show', 'that', 'our', 'approach', 'matches', 'the', 'quality', 'of', 'the', 'optimal', 'solution', 'obtained', 'by', 'exhaustive', 'search', 'we', 'also', 'show', 'that', 'our', 'isegen', 'technique', 'is', 'on', 'average', '20x', 'faster', 'than', 'a', 'genetic', 'formulation', 'that', 'generates', 'equivalent', 'solutions', 'furthermore', 'the', 'ises', 'identified', 'by', 'our', 'technique', 'exhibit', '35', 'more', 'speedup', 'than', 'the', 'genetic', 'solution', 'on', 'a', 'large', 'cryptographic', 'application', 'aes', 'by', 'effectively', 'exploiting', 'its', 'regular', 'structure']] | [-0.09601162040954656, -0.013399103830485025, -0.08241187501698732, 0.06434432936776664, -0.1168240528003131, -0.15375594665302234, 0.0781510592981552, 0.40627292744685756, -0.2451840841076659, -0.3646841690020413, 0.09124341147143464, -0.26012695089287163, -0.18796958997201338, 0.28937926583150225, -0.10126169833190646, 0.09146838145785958, 0.12978369231209885, 0.00909032216939911, -0.03665578011613714, -0.29896779187790956, 0.2566778835395363, 0.05475477007973307, 0.32145403054507693, 0.0018056045131136973, 0.07555335128179066, -0.038170293925341756, -0.004103153592573022, 0.012841451508959508, -0.11353998605288022, 0.19799038682589834, 0.26431744453444517, 0.19473415277546868, 0.2965431614521211, -0.414110392894385, -0.17746225104274801, 0.038424930550266384, 0.14365743258792274, 0.08916968541895626, -0.11732957295536389, -0.26360923382043605, 0.1554728411335744, -0.1546843419738887, -0.09307872800086185, -0.1439820440462644, -0.033628163674008685, 0.0083653145852651, -0.28538294574546, -0.016142032556924032, 0.05509199825285366, 0.048067061710845, -0.019557219618820124, -0.1053898132921624, 0.03899407778491717, 0.10493071963161277, -0.0020807832991997215, 0.054353678566784414, 0.11977098044410711, -0.12365227106939591, -0.16895209332494615, 0.35506463831044593, -0.04008931732013874, -0.19515666562138395, 0.18716557005584333, -0.026950176238556795, -0.13041831738661108, 0.14654423750654366, 0.17865220408259933, 0.11972037507748266, -0.15571326358608445, 0.04774558138206261, -0.03592394366450374, 0.2094179706826642, 0.08174284723178782, 0.023387417973329622, 0.11269512135277754, 0.19400672966309782, 0.1051853219129192, 0.17095945195921655, -0.01195818908459876, -0.0877854946719588, -0.21902809982882146, -0.13836295756679057, -0.17330177707902197, 0.04552275371450767, -0.11192337584631655, -0.1414097514378387, 0.3819441269239727, 0.22401372518730145, 0.14794346095654387, 0.10331746335463517, 0.3298519399227961, 0.0674141261591349, 0.11611743980971803, 0.11306806422957459, 0.18231270957222712, 0.02879770399867879, 0.11568998272454589, -0.19205515196769493, 0.08163856413601986, 0.053152651345187436] |
710.4821 | Multimedia Applications of Multiprocessor Systems-on-Chips | This paper surveys the characteristics of multimedia systems. Multimedia
applications today are dominated by compression and decompression, but
multimedia devices must also implement many other functions such as security
and file management. We introduce some basic concepts of multimedia algorithms
and the larger set of functions that multimedia systems-on-chips must
implement.
| cs.MM | this paper surveys the characteristics of multimedia systems multimedia applications today are dominated by compression and decompression but multimedia devices must also implement many other functions such as security and file management we introduce some basic concepts of multimedia algorithms and the larger set of functions that multimedia systemsonchips must implement | [['this', 'paper', 'surveys', 'the', 'characteristics', 'of', 'multimedia', 'systems', 'multimedia', 'applications', 'today', 'are', 'dominated', 'by', 'compression', 'and', 'decompression', 'but', 'multimedia', 'devices', 'must', 'also', 'implement', 'many', 'other', 'functions', 'such', 'as', 'security', 'and', 'file', 'management', 'we', 'introduce', 'some', 'basic', 'concepts', 'of', 'multimedia', 'algorithms', 'and', 'the', 'larger', 'set', 'of', 'functions', 'that', 'multimedia', 'systemsonchips', 'must', 'implement']] | [-0.18493698155233526, 0.09119574457187862, -0.018201474556882008, 0.08980382243673518, -0.10229714550808364, -0.195956430416189, -0.038883888525614405, 0.38920311994996726, -0.3228953501173094, -0.31175638297024894, 0.15772302434140562, -0.28815031467991714, -0.18708474419134505, 0.2795239907561564, -0.14639237401641758, 0.11659165217961166, 0.05562893487513065, 0.007522273406970734, -0.08493514181406912, -0.33304139323003007, 0.32286477748158515, 0.022066707878063124, 0.3547481478228435, 0.09236567648237243, 0.032160355517750275, 0.0071003040134468495, -0.079394097339508, -0.036496108233490414, -0.11620855766565963, 0.1506916482330245, 0.4062884028991867, 0.30979581326976713, 0.3414702627113929, -0.4558028161123979, -0.2135836218173305, 0.09211917141196775, 0.21123389102628126, 0.07388706696756166, -0.09178845272125567, -0.2363267854842193, 0.15260370295750453, -0.2707579723906283, -0.027344921293072675, -0.10683191211565453, 0.042733790695338565, 0.08905268122222931, -0.20715723493519952, -0.07606789928589326, -0.010454562151982613, 0.10943375872995924, -0.02134138785728354, -0.07999168064755698, 0.019354706452063778, 0.14170785304889374, 0.012839430541955117, -0.0006802991836094388, 0.19730449348286377, -0.180539833961566, -0.12228268399542454, 0.45784746282094835, 0.08221790574344934, -0.13440689273799458, 0.21903418146493828, 0.023915760109529775, -0.18798876728168598, 0.04481865441901427, 0.2598838848153166, 0.055808255284586376, -0.2103967447308641, 0.021377327268733187, 0.02187587609331982, 0.1797521505870071, 0.0713290092535317, 0.18693293741557235, 0.1432687881603545, 0.15014693115417863, 0.06371067804809404, 0.12994979349462607, 0.009498516225493421, -0.04583530752536129, -0.20850894304321094, -0.15824579004673103, -0.16601020713135892, -0.02500601470762608, -0.08327696769065726, -0.17869884407549513, 0.29624410147103025, 0.2102957149310147, 0.08244968527087979, 0.02585569861819785, 0.4335296380461431, 0.03377151256912233, 0.13697226356495829, 0.14612562144540397, 0.0502921785530406, -0.0035976202126738487, 0.2650006884234209, -0.06276497566689025, 0.10830346188124489, 0.018071543026998566] |
710.4822 | Testing Bell inequalities with photon-subtracted Gaussian states | Recently, photon subtracted Gaussian states (PSGSs) were generated by several
experimental groups. Those states were called "Schr\"odinger kittens" due to
their similarities to superpositions of coherent states (SCSs) with small
amplitudes. We compare the ideal SCSs and the PSGSs for experimental tests of
certain types of Bell inequalities. In particular, we analyze the effects of
the key experimental components used to generate PSGSs: mixedness of the
Gaussian states, limited transmittivity of the beam splitter and the avalanche
photodetector which cannot resolve photon numbers. As a result of this
analysis, the degrees of mixedness and the beam splitter transmittivity that
can be allowed for successful tests of Bell inequalities are revealed.
| quant-ph | recently photon subtracted gaussian states psgss were generated by several experimental groups those states were called schrodinger kittens due to their similarities to superpositions of coherent states scss with small amplitudes we compare the ideal scss and the psgss for experimental tests of certain types of bell inequalities in particular we analyze the effects of the key experimental components used to generate psgss mixedness of the gaussian states limited transmittivity of the beam splitter and the avalanche photodetector which cannot resolve photon numbers as a result of this analysis the degrees of mixedness and the beam splitter transmittivity that can be allowed for successful tests of bell inequalities are revealed | [['recently', 'photon', 'subtracted', 'gaussian', 'states', 'psgss', 'were', 'generated', 'by', 'several', 'experimental', 'groups', 'those', 'states', 'were', 'called', 'schrodinger', 'kittens', 'due', 'to', 'their', 'similarities', 'to', 'superpositions', 'of', 'coherent', 'states', 'scss', 'with', 'small', 'amplitudes', 'we', 'compare', 'the', 'ideal', 'scss', 'and', 'the', 'psgss', 'for', 'experimental', 'tests', 'of', 'certain', 'types', 'of', 'bell', 'inequalities', 'in', 'particular', 'we', 'analyze', 'the', 'effects', 'of', 'the', 'key', 'experimental', 'components', 'used', 'to', 'generate', 'psgss', 'mixedness', 'of', 'the', 'gaussian', 'states', 'limited', 'transmittivity', 'of', 'the', 'beam', 'splitter', 'and', 'the', 'avalanche', 'photodetector', 'which', 'can', 'not', 'resolve', 'photon', 'numbers', 'as', 'a', 'result', 'of', 'this', 'analysis', 'the', 'degrees', 'of', 'mixedness', 'and', 'the', 'beam', 'splitter', 'transmittivity', 'that', 'can', 'be', 'allowed', 'for', 'successful', 'tests', 'of', 'bell', 'inequalities', 'are', 'revealed']] | [-0.11434031038352095, 0.20747259761278122, -0.09650956174811802, 0.08391217282776058, 0.0007389013462506973, -0.1930463998956052, 0.048357415419944504, 0.36447976083234623, -0.21068865169395026, -0.2982928617983251, 0.047785573251973336, -0.29551549584747433, -0.05917764250776387, 0.2298776391088157, -0.04638353599705272, 0.1548830924916442, 0.06257752274993707, -0.03964359820442828, -0.027699627793972958, -0.21504101277589127, 0.32758041390066817, 0.04051530052412738, 0.30918034983312226, 0.035387695213226045, 0.08892818728277276, 0.006117447470272849, -0.017619672038399422, -0.0032352292658509433, -0.07478949703048833, 0.11488821009081696, 0.25389905403124857, 0.13120393632614338, 0.22152599548031618, -0.4398119176679232, -0.16088987370483107, 0.12349254505783278, 0.09454357419147257, 0.14477289121845519, -0.010157212573061656, -0.3457556871680526, 0.014500874161787398, -0.14820288943949048, -0.13623771637359317, -0.10302433892581109, -0.02429676461998407, 0.06798894414290164, -0.2639012924177354, 0.05370115471148008, 0.017329922503884043, 0.01109132317717078, 0.01195978553260903, -0.11264963307090707, -0.024705425884390064, 0.09255076639421352, -0.01768664930116486, -0.055053388955793134, 0.12309096722553174, -0.11647858322432332, -0.18061850289604417, 0.31756711876867255, -0.0063519950312151165, -0.1958432565569072, 0.1491817616278658, -0.16569475136143533, -0.0933492359378048, 0.09522994077000935, 0.15066587879177737, 0.07457871266288331, -0.09125246529924674, -0.021319058834394725, -0.0785038979191266, 0.17768161809323607, 0.15430529598935364, 0.14821797353844787, 0.15015300532786158, 0.050649222030581253, 0.012534267518096205, 0.1938227870835092, -0.1186573536613503, -0.06469427979171595, -0.339705679246837, -0.14402833068323834, -0.21444535020084396, 0.05563256310140148, -0.031396275031331064, -0.10324265582377913, 0.4271150944116819, 0.09268141680329971, 0.14957291118565713, -0.014252737289302991, 0.26403877023305444, 0.09979480822037838, 0.06769615951044536, 0.0049580878049537945, 0.2695759133444176, 0.21824043731389753, 0.046660572911302246, -0.20965925971180335, 0.061259209962880555, -0.0283999002983307] |
710.4823 | A Coprocessor for Accelerating Visual Information Processing | Visual information processing will play an increasingly important role in
future electronics systems. In many applications, e.g. video surveillance
cameras, data throughput of microprocessors is not sufficient and power
consumption is too high. Instruction profiling on a typical test algorithm has
shown that pixel address calculations are the dominant operations to be
optimized. Therefore AddressLib, a structured scheme for pixel addressing was
developed, that can be accelerated by AddressEngine, a coprocessor for visual
information processing. In this paper, the architectural design of
AddressEngine is described, which in the first step supports a subset of the
AddressLib. Dataflow and memory organization are optimized during architectural
design. AddressEngine was implemented in a FPGA and was tested with MPEG-7
Global Motion Estimation algorithm. Results on processing speed and circuit
complexity are given and compared to a pure software implementation. The next
step will be the support for the full AddressLib, including segment addressing.
An outlook on further investigations on dynamic reconfiguration capabilities is
given.
| cs.MM | visual information processing will play an increasingly important role in future electronics systems in many applications eg video surveillance cameras data throughput of microprocessors is not sufficient and power consumption is too high instruction profiling on a typical test algorithm has shown that pixel address calculations are the dominant operations to be optimized therefore addresslib a structured scheme for pixel addressing was developed that can be accelerated by addressengine a coprocessor for visual information processing in this paper the architectural design of addressengine is described which in the first step supports a subset of the addresslib dataflow and memory organization are optimized during architectural design addressengine was implemented in a fpga and was tested with mpeg7 global motion estimation algorithm results on processing speed and circuit complexity are given and compared to a pure software implementation the next step will be the support for the full addresslib including segment addressing an outlook on further investigations on dynamic reconfiguration capabilities is given | [['visual', 'information', 'processing', 'will', 'play', 'an', 'increasingly', 'important', 'role', 'in', 'future', 'electronics', 'systems', 'in', 'many', 'applications', 'eg', 'video', 'surveillance', 'cameras', 'data', 'throughput', 'of', 'microprocessors', 'is', 'not', 'sufficient', 'and', 'power', 'consumption', 'is', 'too', 'high', 'instruction', 'profiling', 'on', 'a', 'typical', 'test', 'algorithm', 'has', 'shown', 'that', 'pixel', 'address', 'calculations', 'are', 'the', 'dominant', 'operations', 'to', 'be', 'optimized', 'therefore', 'addresslib', 'a', 'structured', 'scheme', 'for', 'pixel', 'addressing', 'was', 'developed', 'that', 'can', 'be', 'accelerated', 'by', 'addressengine', 'a', 'coprocessor', 'for', 'visual', 'information', 'processing', 'in', 'this', 'paper', 'the', 'architectural', 'design', 'of', 'addressengine', 'is', 'described', 'which', 'in', 'the', 'first', 'step', 'supports', 'a', 'subset', 'of', 'the', 'addresslib', 'dataflow', 'and', 'memory', 'organization', 'are', 'optimized', 'during', 'architectural', 'design', 'addressengine', 'was', 'implemented', 'in', 'a', 'fpga', 'and', 'was', 'tested', 'with', 'mpeg7', 'global', 'motion', 'estimation', 'algorithm', 'results', 'on', 'processing', 'speed', 'and', 'circuit', 'complexity', 'are', 'given', 'and', 'compared', 'to', 'a', 'pure', 'software', 'implementation', 'the', 'next', 'step', 'will', 'be', 'the', 'support', 'for', 'the', 'full', 'addresslib', 'including', 'segment', 'addressing', 'an', 'outlook', 'on', 'further', 'investigations', 'on', 'dynamic', 'reconfiguration', 'capabilities', 'is', 'given']] | [-0.13926119643613488, 0.049065476224319546, -0.06650930177998839, 0.02079362903073754, -0.08123991976243368, -0.18980395416758075, -0.01732055529856603, 0.4510635915241256, -0.23221470316096862, -0.33086787556697217, 0.16739249501199469, -0.2212238818354997, -0.14621724493466087, 0.24722266961207254, -0.13567067420121676, 0.10860703733058427, 0.1229383208794716, 0.02921169756778649, -0.03062942504585628, -0.262247450439323, 0.19382466882559823, 0.12729881207244645, 0.3122788644656076, 0.043736427206754316, 0.08550561105280027, -0.01842160058144179, -0.05480265844561252, 0.006546712295377847, -0.04914755429318739, 0.13784280188997824, 0.33041521650015937, 0.22165004603611016, 0.31281037530312256, -0.4630587937206215, -0.18688376363575088, 0.03792365485663462, 0.1571823566730289, 0.06575039012852177, -0.08653301836760796, -0.2660960113421453, 0.11294870880997873, -0.16145077227435498, -0.03663400916660332, -0.09705783287352472, 0.019912282007844735, 0.02117177128924855, -0.2715863293956572, -0.05235844917352433, 0.03954116363542571, 0.06838197963161688, -0.043822750871457296, -0.09306896778448305, 0.030576430556150325, 0.14419156344468642, -0.06728181562831868, 0.0770290540430047, 0.18618031850038386, -0.13295973361735897, -0.15880858858972094, 0.38693602322976783, 0.006409934030625946, -0.18029552471378577, 0.14149865080596682, -0.022624538241023694, -0.1825012561535428, 0.10416451798786658, 0.2273513436005075, 0.029143528268030433, -0.19441326519601648, 0.0666962971709548, 0.0469150670271899, 0.22533380710780157, 0.058995050875620444, 0.039554175993092126, 0.21224959798284476, 0.291685389921717, 0.05991543772715716, 0.14229817265537653, -0.08711662844021556, -0.06802609414426228, -0.24227772595762906, -0.18041436996322519, -0.176930310449025, -0.035793028129514175, -0.06300546509394153, -0.09669007419992487, 0.3798162784039067, 0.1876976056420678, 0.1239002094378475, 0.02874929630212046, 0.37460243898611634, 0.06882194512753649, 0.13297334505441766, 0.08743165522923704, 0.15289581655264364, 0.02554912098845386, 0.17095302543978882, -0.17986617648036954, 0.10292954258447201, 0.01927750407803445] |
710.4824 | FPGA based Agile Algorithm-On-Demand Co-Processor | With growing computational needs of many real-world applications, frequently
changing specifications of standards, and the high design and NRE costs of
ASICs, an algorithm-agile FPGA based co-processor has become a viable
alternative. In this article, we report about the general design of an
algorith-agile co-processor and the proof-of-concept implementation.
| cs.AR | with growing computational needs of many realworld applications frequently changing specifications of standards and the high design and nre costs of asics an algorithmagile fpga based coprocessor has become a viable alternative in this article we report about the general design of an algorithagile coprocessor and the proofofconcept implementation | [['with', 'growing', 'computational', 'needs', 'of', 'many', 'realworld', 'applications', 'frequently', 'changing', 'specifications', 'of', 'standards', 'and', 'the', 'high', 'design', 'and', 'nre', 'costs', 'of', 'asics', 'an', 'algorithmagile', 'fpga', 'based', 'coprocessor', 'has', 'become', 'a', 'viable', 'alternative', 'in', 'this', 'article', 'we', 'report', 'about', 'the', 'general', 'design', 'of', 'an', 'algorithagile', 'coprocessor', 'and', 'the', 'proofofconcept', 'implementation']] | [-0.13026834345680285, 0.01848691870877024, -0.034119153400248986, -0.053209177963931036, -0.12941641324853642, -0.18086689238020398, 0.008398562669754028, 0.418595168961861, -0.22738064500562688, -0.3631895860617465, 0.1798525436340455, -0.21324148258947312, -0.18432872185602467, 0.2714154147988859, -0.13716827406290363, 0.13247917782753071, 0.05865362334527085, -0.018415202327231144, -0.07062085608931933, -0.26315549384564796, 0.21430239795231598, 0.13230269312105597, 0.30673541921250363, 0.09842032592426589, 0.09907737939043883, -0.06174760863700129, -0.006103955154762941, -0.056501004091919736, -0.07374622343861043, 0.1824233032109097, 0.28408645438228514, 0.21883018736905874, 0.34372127361278587, -0.5169628352877942, -0.10709072538512818, 0.06391135771124762, 0.12945884866441817, 0.06086929134548979, -0.14044728830327935, -0.23704523178550632, 0.08997620707575946, -0.25691650453657705, -0.08338132722580686, -0.06952832252817585, 0.043139055054238505, 0.0472707072708835, -0.23462534095457893, -0.10878856418693954, -0.019037620382423095, 0.11092097330045828, 0.01933783872370073, -0.16562312166454232, 0.06827740158211995, 0.0981934737968952, -0.009965194409039426, 0.029259376688563127, 0.1824786923726664, -0.11354942551932912, -0.19365750879366347, 0.39210538966383074, 0.016159257712833424, -0.15597961026620358, 0.20457905267880477, 0.0009633619486889306, -0.21249354775360924, 0.04087127960024481, 0.22454591576961128, 0.0703568588347828, -0.1767786206043464, 0.08450868362783791, 0.04627966314078646, 0.24998578797788062, 0.027487426540477478, 0.07820975758318612, 0.17497566033233988, 0.32431919113831953, 0.058450219933528134, 0.16670807744277286, -0.04193954371867028, -0.05878181602964376, -0.2767363421301893, -0.24407804614685952, -0.13156774845172434, -0.005149052062250198, -0.07233907632000913, -0.1954161577085231, 0.38599142761148036, 0.20557621454304836, 0.08880233422957083, 0.04079770191790576, 0.41894757089779733, 0.08420909033652316, 0.11689988075894245, 0.11010990085753988, 0.16036754284807025, 0.012281121309608855, 0.2133631295861399, -0.1304780941337664, 0.044715290928774694, -0.12024412665298169] |
710.4825 | Meeting the Embedded Design Needs of Automotive Applications | The importance of embedded systems in driving innovation in automotive
applications continues to grow. Understanding the specific needs of developers
targeting this market is also helping to drive innovation in RISC core design.
This paper describes how a RISC instruction set architecture has evolved to
better meet those needs, and the key implementation features in two very
different RISC cores are used to demonstrate the challenges of designing for
real-time automotive systems.
| cs.AR | the importance of embedded systems in driving innovation in automotive applications continues to grow understanding the specific needs of developers targeting this market is also helping to drive innovation in risc core design this paper describes how a risc instruction set architecture has evolved to better meet those needs and the key implementation features in two very different risc cores are used to demonstrate the challenges of designing for realtime automotive systems | [['the', 'importance', 'of', 'embedded', 'systems', 'in', 'driving', 'innovation', 'in', 'automotive', 'applications', 'continues', 'to', 'grow', 'understanding', 'the', 'specific', 'needs', 'of', 'developers', 'targeting', 'this', 'market', 'is', 'also', 'helping', 'to', 'drive', 'innovation', 'in', 'risc', 'core', 'design', 'this', 'paper', 'describes', 'how', 'a', 'risc', 'instruction', 'set', 'architecture', 'has', 'evolved', 'to', 'better', 'meet', 'those', 'needs', 'and', 'the', 'key', 'implementation', 'features', 'in', 'two', 'very', 'different', 'risc', 'cores', 'are', 'used', 'to', 'demonstrate', 'the', 'challenges', 'of', 'designing', 'for', 'realtime', 'automotive', 'systems']] | [-0.1501596225425601, 0.040829669076225, -0.02900416292767558, 0.039027487825175435, -0.1208301800975783, -0.1831834334298037, 0.006203868848388083, 0.4002960256249126, -0.23345455431586337, -0.3394319026523994, 0.12720295150777222, -0.21160369158800071, -0.16304302703873771, 0.24136696303159827, -0.13598659152113315, 0.07893884757908785, 0.07661546421069135, -0.039912704333093844, 0.005308339307602081, -0.26001862216637367, 0.2809458171703025, 0.05891401716507971, 0.32928672449715024, 0.04304113827594039, -0.0018454884023716052, -0.10013898028733416, 0.0038618386153959567, -0.086141804090908, -0.05045688833989617, 0.1895772443838521, 0.3797093687268595, 0.23202476758484003, 0.407518371807075, -0.4821428168409814, -0.16011662672584256, 0.05644693292237611, 0.197709094260871, 0.0485764602975299, -0.06189022075462466, -0.2217036183186186, 0.0981887625142311, -0.2206306079816487, -0.1508911162446667, -0.09161070762719545, 0.010817200818564743, 0.045490398325556375, -0.2061729229365786, -0.10652350303563354, 0.053029760446709893, 0.013388270867936727, -0.02695489717007149, -0.10758318432555017, 0.028653348508265078, 0.23024480490615437, -0.03847702498508928, 0.042654519693719015, 0.21665674494579434, -0.16026684877902475, -0.1224501048758005, 0.44718738215871984, 0.025509929258583322, -0.1608836803611161, 0.2538209632556472, -0.06111154504792972, -0.2091941602152979, 0.046296446556678146, 0.2768297705721731, -0.0025510917572925487, -0.20348427438996927, 0.019543651661984365, 0.11512504061425312, 0.1984474131734007, 0.007713837875700038, 0.016612105097414717, 0.25025912998333094, 0.301272894643868, 0.02369996030918426, 0.1684256471020894, -0.010284257871616218, -0.15282767319068727, -0.21252624955700916, -0.17387452534684497, -0.09979709942773399, -0.008133161476709776, -0.022168386397525965, -0.1264430647036837, 0.40953648783680463, 0.2405388764877393, 0.07539623691182998, 0.0036392189601125815, 0.3513176429292394, 0.03018623371725779, 0.15892997840678114, 0.10581678677893554, 0.15127171907160017, 0.018886687059421092, 0.21841397289083236, -0.17227347172512156, 0.09870652360970983, -0.03744967342613058] |
710.4826 | The Integration of On-Line Monitoring and Reconfiguration Functions
using EDAA - European design and Automation Association1149.4 Into a Safety
Critical Automotive Electronic Control Unit | This paper presents an innovative application of EDAA - European design and
Automation Association 1149.4 and the Integrated Diagnostic Reconfiguration
(IDR) as tools for the implementation of an embedded test solution for an
Automotive Electronic Control Unit implemented as a fully integrated mixed
signal system. The paper described how the test architecture can be used for
fault avoidance with results from a hardware prototype presented. The paper
concludes that fault avoidance can be integrated into mixed signal electronic
systems to handle key failure modes.
| cs.AR | this paper presents an innovative application of edaa european design and automation association 11494 and the integrated diagnostic reconfiguration idr as tools for the implementation of an embedded test solution for an automotive electronic control unit implemented as a fully integrated mixed signal system the paper described how the test architecture can be used for fault avoidance with results from a hardware prototype presented the paper concludes that fault avoidance can be integrated into mixed signal electronic systems to handle key failure modes | [['this', 'paper', 'presents', 'an', 'innovative', 'application', 'of', 'edaa', 'european', 'design', 'and', 'automation', 'association', '11494', 'and', 'the', 'integrated', 'diagnostic', 'reconfiguration', 'idr', 'as', 'tools', 'for', 'the', 'implementation', 'of', 'an', 'embedded', 'test', 'solution', 'for', 'an', 'automotive', 'electronic', 'control', 'unit', 'implemented', 'as', 'a', 'fully', 'integrated', 'mixed', 'signal', 'system', 'the', 'paper', 'described', 'how', 'the', 'test', 'architecture', 'can', 'be', 'used', 'for', 'fault', 'avoidance', 'with', 'results', 'from', 'a', 'hardware', 'prototype', 'presented', 'the', 'paper', 'concludes', 'that', 'fault', 'avoidance', 'can', 'be', 'integrated', 'into', 'mixed', 'signal', 'electronic', 'systems', 'to', 'handle', 'key', 'failure', 'modes']] | [-0.14004074595868587, -0.01941515194772453, -0.07216447205339535, 0.015540222244098692, -0.06493689853516293, -0.16354516040670072, -0.016414709225944357, 0.35717572058301145, -0.2628951556753458, -0.30205402580067153, 0.17177408315786502, -0.197345793996824, -0.16295394571725189, 0.24522663813606813, -0.11671159976366453, 0.12770951021939697, 0.08805568544328973, -0.051000635443459744, 0.013773623948686801, -0.18029223836776687, 0.25238725709410886, 0.12400866085209133, 0.32120509467246694, 0.042992085888527515, 0.08730494809087093, 0.024419647184336875, 0.007031202350356956, 0.014015383087098598, -0.05212221153851715, 0.15135989480129466, 0.36402225536975735, 0.19708787125149152, 0.2713305905046759, -0.47747143525978064, -0.1467860764823854, 0.05744743543654317, 0.19916317848170675, 0.036472637660619686, -0.09970558674937886, -0.29749892942789125, 0.09163521083707853, -0.27052363849858324, -0.16752697901073388, -0.06576348333505959, -0.03558598203221109, -0.00957267706725383, -0.27859329558318346, -0.0492313526820664, 0.019477019052407365, 0.07362424283538287, -0.06870000657239338, -0.08013750090712408, 0.04100912504988473, 0.1331247292152356, -0.08222354319948907, 0.030587651092479597, 0.17253041068069275, -0.06561572200948054, -0.2183186207875246, 0.377466998085743, 0.009826089246993566, -0.1939261107018399, 0.16873963140859838, 0.02842272982773621, -0.14410059433998312, 0.07731166598954942, 0.29327267976250593, 0.022917077569972452, -0.2453636667384516, 0.014533017928198848, 0.07263035692342716, 0.20771499718652991, 0.009812238577912311, 0.018779371640603795, 0.18794218239249524, 0.2758078148315956, 0.07101938795729927, 0.19428033774105333, -0.0859998440165527, -0.0587835083261314, -0.33354036337355286, -0.20996138821469573, -0.13596173366191003, -0.019517466093686115, -0.030531918493357894, -0.18038099838375318, 0.40629064641529467, 0.19636876510865078, 0.0979319719325115, 0.016081552188729913, 0.3675619136604549, 0.1250330694672856, 0.07408283882144066, 0.049907848000435566, 0.18449519570099143, 0.06583632890805148, 0.131170307124238, -0.19810568734083506, 0.08359878360316521, -0.021387292617341368] |
710.4827 | Debug Support, Calibration and Emulation for Multiple Processor and
Powertrain Control SoCs | The introduction of complex SoCs with multiple processor cores presents new
development challenges, such that development support is now a decisive factor
when choosing a System-on-Chip (SoC). The presented developments support
strategy addresses the challenges using both architecture and technology
approaches. The Multi-Core Debug Support (MCDS) architecture provides flexible
triggering using cross triggers and a multiple core break and suspend switch.
Temporal trace ordering is guaranteed down to cycle level by on-chip time
stamping. The Package Sized-ICE (PSI) approach is a novel method of including
trace buffers, overlay memories, processing resources and communication
interfaces without changing device behavior. PSI requires no external emulation
box, as the debug host interfaces directly with the SoC using a standard
interface.
| cs.AR | the introduction of complex socs with multiple processor cores presents new development challenges such that development support is now a decisive factor when choosing a systemonchip soc the presented developments support strategy addresses the challenges using both architecture and technology approaches the multicore debug support mcds architecture provides flexible triggering using cross triggers and a multiple core break and suspend switch temporal trace ordering is guaranteed down to cycle level by onchip time stamping the package sizedice psi approach is a novel method of including trace buffers overlay memories processing resources and communication interfaces without changing device behavior psi requires no external emulation box as the debug host interfaces directly with the soc using a standard interface | [['the', 'introduction', 'of', 'complex', 'socs', 'with', 'multiple', 'processor', 'cores', 'presents', 'new', 'development', 'challenges', 'such', 'that', 'development', 'support', 'is', 'now', 'a', 'decisive', 'factor', 'when', 'choosing', 'a', 'systemonchip', 'soc', 'the', 'presented', 'developments', 'support', 'strategy', 'addresses', 'the', 'challenges', 'using', 'both', 'architecture', 'and', 'technology', 'approaches', 'the', 'multicore', 'debug', 'support', 'mcds', 'architecture', 'provides', 'flexible', 'triggering', 'using', 'cross', 'triggers', 'and', 'a', 'multiple', 'core', 'break', 'and', 'suspend', 'switch', 'temporal', 'trace', 'ordering', 'is', 'guaranteed', 'down', 'to', 'cycle', 'level', 'by', 'onchip', 'time', 'stamping', 'the', 'package', 'sizedice', 'psi', 'approach', 'is', 'a', 'novel', 'method', 'of', 'including', 'trace', 'buffers', 'overlay', 'memories', 'processing', 'resources', 'and', 'communication', 'interfaces', 'without', 'changing', 'device', 'behavior', 'psi', 'requires', 'no', 'external', 'emulation', 'box', 'as', 'the', 'debug', 'host', 'interfaces', 'directly', 'with', 'the', 'soc', 'using', 'a', 'standard', 'interface']] | [-0.204303764681942, 0.06000610140096075, -0.032060536628203656, 0.0037518350020099176, -0.12104876402058992, -0.26035940882364483, 0.07568438776672401, 0.4181742663655815, -0.27014700087301174, -0.3450071955549306, 0.10397036899491374, -0.20289195000579388, -0.14165482024565854, 0.19296455380892188, -0.01881318993200066, 0.08637577547804164, 0.09374573974115454, -0.07525613952572618, -0.017104870065693455, -0.18909355707703449, 0.2276686506535545, 0.08696014220738013, 0.351674838312741, 0.06730193426985101, 0.07267161770643474, 0.012841526639712011, -0.011780481837721991, -0.05519582652326288, -0.030244787286172706, 0.13394305982691204, 0.26974552548851755, 0.16142398108535544, 0.3318961280084954, -0.514990811926666, -0.18123182742495153, 0.007873378278575194, 0.1194642734571344, 0.06457994657905837, -0.07424899055682734, -0.2713232391136538, 0.08020498471109774, -0.21362278379644428, -0.11442329778721363, -0.09948584868508423, -0.009934568458541843, 0.012523380307890153, -0.26271817607580333, -0.03458897089826521, 0.03481135052098925, 0.07367426529125279, 0.005271677378161634, -0.06580895727002543, 0.02804996501172668, 0.1342803092649837, -0.07087210742234863, 0.07167164621004586, 0.22500152775921442, -0.11040411342802489, -0.1780452569625501, 0.3548935549975983, -0.01190796018887215, -0.16714805962843018, 0.20508447380190523, -0.013962669340203163, -0.12149268528446555, 0.10258090444679918, 0.18839489654156155, 0.009347067045947087, -0.17320061707329748, 0.08521347019845492, 0.10884238247647239, 0.24768586409406673, 0.03042339765394492, 0.038270885922648976, 0.24757244750247176, 0.2638938194602439, 0.04950219851211998, 0.1459484220932013, -0.06740664655306569, -0.08949459818641431, -0.25103276177281353, -0.2084113790474005, -0.15758491714749934, -0.00891140442951743, -0.04639930741666768, -0.156863921877912, 0.34924218421882214, 0.15874524131529674, 0.1256666373188511, 0.055078272346471405, 0.379781575022458, 0.058003461718005286, 0.1922462189811932, 0.14919654709078242, 0.11893648160862383, 0.05779053045412654, 0.18579941693340138, -0.19311621439530804, 0.10310376500750988, -0.006219411650190836] |
710.4828 | Bounds for Visual Cryptography Schemes | In this paper, we investigate the best pixel expansion of the various models
of visual cryptography schemes. In this regard, we consider visual cryptography
schemes introduced by Tzeng and Hu [13]. In such a model, only minimal
qualified sets can recover the secret image and that the recovered secret image
can be darker or lighter than the background. Blundo et al. [4] introduced a
lower bound for the best pixel expansion of this scheme in terms of minimal
qualified sets. We present another lower bound for the best pixel expansion of
the scheme. As a corollary, we introduce a lower bound, based on an induced
matching of hypergraph of qualified sets, for the best pixel expansion of the
aforementioned model and the traditional model of visual cryptography realized
by basis matrices. Finally, we study access structures based on graphs and we
present an upper bound for the smallest pixel expansion in terms of strong
chromatic index.
| cs.CR | in this paper we investigate the best pixel expansion of the various models of visual cryptography schemes in this regard we consider visual cryptography schemes introduced by tzeng and hu 13 in such a model only minimal qualified sets can recover the secret image and that the recovered secret image can be darker or lighter than the background blundo et al 4 introduced a lower bound for the best pixel expansion of this scheme in terms of minimal qualified sets we present another lower bound for the best pixel expansion of the scheme as a corollary we introduce a lower bound based on an induced matching of hypergraph of qualified sets for the best pixel expansion of the aforementioned model and the traditional model of visual cryptography realized by basis matrices finally we study access structures based on graphs and we present an upper bound for the smallest pixel expansion in terms of strong chromatic index | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'best', 'pixel', 'expansion', 'of', 'the', 'various', 'models', 'of', 'visual', 'cryptography', 'schemes', 'in', 'this', 'regard', 'we', 'consider', 'visual', 'cryptography', 'schemes', 'introduced', 'by', 'tzeng', 'and', 'hu', '13', 'in', 'such', 'a', 'model', 'only', 'minimal', 'qualified', 'sets', 'can', 'recover', 'the', 'secret', 'image', 'and', 'that', 'the', 'recovered', 'secret', 'image', 'can', 'be', 'darker', 'or', 'lighter', 'than', 'the', 'background', 'blundo', 'et', 'al', '4', 'introduced', 'a', 'lower', 'bound', 'for', 'the', 'best', 'pixel', 'expansion', 'of', 'this', 'scheme', 'in', 'terms', 'of', 'minimal', 'qualified', 'sets', 'we', 'present', 'another', 'lower', 'bound', 'for', 'the', 'best', 'pixel', 'expansion', 'of', 'the', 'scheme', 'as', 'a', 'corollary', 'we', 'introduce', 'a', 'lower', 'bound', 'based', 'on', 'an', 'induced', 'matching', 'of', 'hypergraph', 'of', 'qualified', 'sets', 'for', 'the', 'best', 'pixel', 'expansion', 'of', 'the', 'aforementioned', 'model', 'and', 'the', 'traditional', 'model', 'of', 'visual', 'cryptography', 'realized', 'by', 'basis', 'matrices', 'finally', 'we', 'study', 'access', 'structures', 'based', 'on', 'graphs', 'and', 'we', 'present', 'an', 'upper', 'bound', 'for', 'the', 'smallest', 'pixel', 'expansion', 'in', 'terms', 'of', 'strong', 'chromatic', 'index']] | [-0.10195402256757408, 0.05299091930731726, -0.06312105529215913, 0.0767473827135846, -0.024265161703352803, -0.13441135517666236, 0.08502842049800803, 0.34671085544365954, -0.23550488042657253, -0.3493364248485244, 0.09758895879245497, -0.2422247761134784, -0.15185142558993311, 0.1864188150759762, -0.15295791150488008, 0.07476738471441068, 0.02399311259437304, 0.04552966369582074, -0.04799571507171933, -0.30246030407286456, 0.3089101009090528, 0.07579483321638077, 0.26729340830064896, 0.03436521405970992, 0.1010619413531718, -0.010421700291819387, -0.06261392251298122, -0.015084375760384969, -0.16134012558418304, 0.19291335126300427, 0.21571261020386823, 0.16164978398252036, 0.22756389397281138, -0.38776795045992773, -0.1814686471668931, 0.1147094920954921, 0.15412097966885074, 0.10339672902036555, -0.04959036585989759, -0.2622422359780977, 0.11438361762693249, -0.20299156723761713, -0.06441248799281123, -0.03917932447330276, -0.0082944639680254, -0.023977959669170927, -0.2966881460606955, 0.04053710060883555, 0.08880519917138018, 0.056175814788635856, -0.035237554708713446, -0.12642307866020008, 0.035391392457667835, 0.11005063330930016, -0.05562791956419295, 0.03167112967356217, 0.056506062313527256, -0.15772272246532965, -0.15697248048427237, 0.37791759846127265, -0.10564360026258433, -0.16913730304615646, 0.1192537562335031, -0.12810309886835614, -0.11427548724867694, 0.061216990043130984, 0.18402438505564805, 0.15460208322937516, -0.11970261659158708, 0.09480802478214315, -0.09659788034275754, 0.1944180478995013, 0.12366329492130257, 0.07526859504098145, 0.12731435914318284, 0.15258910651197777, 0.10118370355022224, 0.1703844255119163, -0.07238604427865622, -0.02079393991530728, -0.30289827616788545, -0.1420739106909529, -0.21165180786258794, -0.040003666637598405, -0.15019518576597177, -0.17146845828354745, 0.39690894115421965, 0.1630763620222834, 0.2243896520503059, 0.03011581642317356, 0.33103891315283374, 0.107997168810258, 0.05149159138393286, 0.09925561736023368, 0.21515645553636087, 0.09572492399277141, 0.025563986636335394, -0.12455776019638719, 0.08235970592464913, 0.14763880141575325] |
710.4829 | AutoMoDe - Model-Based Development of Automotive Software | This paper describes first results from the AutoMoDe (Automotive Model-Based
Development) project. The overall goal of the project is to develop an
integrated methodology for model-based development of automotive control
software, based on problem-specific design notations with an explicit formal
foundation. Based on the existing AutoFOCUS framework, a tool prototype is
being developed in order to illustrate and validate the key elements of our
approach.
| cs.SE | this paper describes first results from the automode automotive modelbased development project the overall goal of the project is to develop an integrated methodology for modelbased development of automotive control software based on problemspecific design notations with an explicit formal foundation based on the existing autofocus framework a tool prototype is being developed in order to illustrate and validate the key elements of our approach | [['this', 'paper', 'describes', 'first', 'results', 'from', 'the', 'automode', 'automotive', 'modelbased', 'development', 'project', 'the', 'overall', 'goal', 'of', 'the', 'project', 'is', 'to', 'develop', 'an', 'integrated', 'methodology', 'for', 'modelbased', 'development', 'of', 'automotive', 'control', 'software', 'based', 'on', 'problemspecific', 'design', 'notations', 'with', 'an', 'explicit', 'formal', 'foundation', 'based', 'on', 'the', 'existing', 'autofocus', 'framework', 'a', 'tool', 'prototype', 'is', 'being', 'developed', 'in', 'order', 'to', 'illustrate', 'and', 'validate', 'the', 'key', 'elements', 'of', 'our', 'approach']] | [-0.017669230312682114, -0.07564725389014572, -0.11214112537698104, -0.032670555133014346, -0.1298253057954403, -0.09110471376289542, -0.028379640597491883, 0.36610688211826176, -0.18200803679915575, -0.3275951847577324, 0.13158607214080312, -0.2006805735711868, -0.20767905921496163, 0.2668791693277084, -0.12662788381656775, 0.1365267289372591, 0.03412414900958538, -0.031583686631459454, -0.022374221295691454, -0.19634507931768894, 0.29697671607853127, 0.08737826167534177, 0.3878958942798468, 0.033617406281141134, 0.08612124088148658, -0.0011086026134972389, -0.11404770774713073, -0.0689638033365974, -0.12681401761678548, 0.24097401837889965, 0.35002447710587425, 0.22892236216710163, 0.35387226032236446, -0.4507518740227589, -0.12779357919039636, -0.007313175026613932, 0.12964792963511382, 0.062675251525182, -0.08030944598767047, -0.30606430935171935, 0.09099019582454974, -0.25158079331024336, -0.16531946796637315, -0.10519205821821323, -0.03564465788121407, 0.0038438877950494107, -0.2743927541690377, -0.09940754938870669, 0.057289094245061276, 0.10675614887418655, -0.04970218173156564, -0.13616554176148313, 0.08229682770951723, 0.15761899842809027, -0.0050901369908108165, 0.04730234995591812, 0.14041728926822544, -0.04499014569088244, -0.1710231749340892, 0.3767587159688656, -0.018406494859104547, -0.1653113637262812, 0.16312368312277473, 0.00781958713554419, -0.17510789898582377, 0.06073802186606022, 0.25883100876727927, 0.09454368278384209, -0.24607035756970827, 0.07195560811714341, 0.06995708784804894, 0.21282325339181205, -0.09769893482399102, -0.06879479025598043, 0.1671910187516075, 0.3584680960728572, 0.05579934887444744, 0.13868693435349716, -0.014411476877732919, -0.10920522245578468, -0.33550807054226217, -0.20661162196730193, -0.1180014101931682, -0.05492353621297158, -0.04246812313772702, -0.16271600665954444, 0.4013310997818525, 0.25827159269784505, 0.06586647744362172, 0.06954440652177885, 0.41540046328535446, 0.045968960306177344, 0.05702036276746255, 0.0474549168577561, 0.18397385515272618, 0.0734462804805774, 0.12748953776004224, -0.18470821797202985, 0.09254199584874397, 0.0713136241842921] |
710.483 | Violation of Generalized Bose-Einstein symmetry and quantum entanglement
of pi(-)pi(+) isospin states in pion pair production piN->pi(-)pi(+)N | Generalized Bose-Einstein symmetry requires that J+I=even for two-pion
angular states of spin J and total isospin I. We show that the symmetry
predicts three linearly independent constraints on partial wave intensities
with even spin for pi(-)p->pi(-)pi(+)n, pi(-)p->pi(0)pi(0)n and
pi(+)p->pi(+)pi(+)n. Available data violate all three constraints for S, D^0,
D^U and D^N partial waves. The violations of the symmetry imply a presence of
the symmetry violating contributions to transversity amplitudes in
pi(-)p->pi(-)pi(+)n and predict quantum entanglement of pi(-)pi(+) isospin
states which is excluded by the symmetry. We derive approximate lower and upper
bounds on entanglement amplitudes |a_S| and |a_A|. The bounds provide a clear
evidence for entanglement of pi(-)pi(+) isospin states below 840 MeV and
suggest the entanglement at higher dipion masses. The small values of |a_S|
\sim 0.10-0.20 below 840 MeV explain the puzzling differences between the
S-wave intensities in pi(-)p->pi(-)pi(+)n and pi(-)p->pi(0)pi(0)n and reveal a
suppression of isospin I=0,2 contribution in the S-wave amplitudes in
pi(-)p->pi(-)pi(+)n. The large isospin I=1 contribution of rho^0(770) to both
S- and P-wave amplitudes is due to large entanglement amplitude |a_A| \sim
0.98-0.99. These findings confirm the predictions of a model of non-unitary
dynamics of the pion creation processes arising from a CPT violating
interaction of these processes with a quantum environment.
| hep-ph hep-th | generalized boseeinstein symmetry requires that jieven for twopion angular states of spin j and total isospin i we show that the symmetry predicts three linearly independent constraints on partial wave intensities with even spin for pippipin pippi0pi0n and pippipin available data violate all three constraints for s d0 du and dn partial waves the violations of the symmetry imply a presence of the symmetry violating contributions to transversity amplitudes in pippipin and predict quantum entanglement of pipi isospin states which is excluded by the symmetry we derive approximate lower and upper bounds on entanglement amplitudes a_s and a_a the bounds provide a clear evidence for entanglement of pipi isospin states below 840 mev and suggest the entanglement at higher dipion masses the small values of a_s sim 010020 below 840 mev explain the puzzling differences between the swave intensities in pippipin and pippi0pi0n and reveal a suppression of isospin i02 contribution in the swave amplitudes in pippipin the large isospin i1 contribution of rho0770 to both s and pwave amplitudes is due to large entanglement amplitude a_a sim 098099 these findings confirm the predictions of a model of nonunitary dynamics of the pion creation processes arising from a cpt violating interaction of these processes with a quantum environment | [['generalized', 'boseeinstein', 'symmetry', 'requires', 'that', 'jieven', 'for', 'twopion', 'angular', 'states', 'of', 'spin', 'j', 'and', 'total', 'isospin', 'i', 'we', 'show', 'that', 'the', 'symmetry', 'predicts', 'three', 'linearly', 'independent', 'constraints', 'on', 'partial', 'wave', 'intensities', 'with', 'even', 'spin', 'for', 'pippipin', 'pippi0pi0n', 'and', 'pippipin', 'available', 'data', 'violate', 'all', 'three', 'constraints', 'for', 's', 'd0', 'du', 'and', 'dn', 'partial', 'waves', 'the', 'violations', 'of', 'the', 'symmetry', 'imply', 'a', 'presence', 'of', 'the', 'symmetry', 'violating', 'contributions', 'to', 'transversity', 'amplitudes', 'in', 'pippipin', 'and', 'predict', 'quantum', 'entanglement', 'of', 'pipi', 'isospin', 'states', 'which', 'is', 'excluded', 'by', 'the', 'symmetry', 'we', 'derive', 'approximate', 'lower', 'and', 'upper', 'bounds', 'on', 'entanglement', 'amplitudes', 'a_s', 'and', 'a_a', 'the', 'bounds', 'provide', 'a', 'clear', 'evidence', 'for', 'entanglement', 'of', 'pipi', 'isospin', 'states', 'below', '840', 'mev', 'and', 'suggest', 'the', 'entanglement', 'at', 'higher', 'dipion', 'masses', 'the', 'small', 'values', 'of', 'a_s', 'sim', '010020', 'below', '840', 'mev', 'explain', 'the', 'puzzling', 'differences', 'between', 'the', 'swave', 'intensities', 'in', 'pippipin', 'and', 'pippi0pi0n', 'and', 'reveal', 'a', 'suppression', 'of', 'isospin', 'i02', 'contribution', 'in', 'the', 'swave', 'amplitudes', 'in', 'pippipin', 'the', 'large', 'isospin', 'i1', 'contribution', 'of', 'rho0770', 'to', 'both', 's', 'and', 'pwave', 'amplitudes', 'is', 'due', 'to', 'large', 'entanglement', 'amplitude', 'a_a', 'sim', '098099', 'these', 'findings', 'confirm', 'the', 'predictions', 'of', 'a', 'model', 'of', 'nonunitary', 'dynamics', 'of', 'the', 'pion', 'creation', 'processes', 'arising', 'from', 'a', 'cpt', 'violating', 'interaction', 'of', 'these', 'processes', 'with', 'a', 'quantum', 'environment']] | [-0.17356920689208777, 0.28526451850979073, -0.059506608702206205, 0.12671177557644714, -0.01374911702236893, -0.1540293364957409, 0.09148258756556847, 0.2712140926024289, -0.1519944639875072, -0.27039813500765747, -0.010333019618433222, -0.3461529720095393, -0.023815189567349345, 0.11985373051466366, 0.09559174495052944, 0.06436995871867182, 0.02206284480589867, 0.002188535301083726, -0.08941050380970197, -0.1548411246549575, 0.3184648271993671, -0.042101081689024, 0.25061519167036184, 0.19104464698890314, 0.033204113592131476, 0.014875114789160275, -0.023661400234435224, -0.09932692048763767, -0.15275894346212102, 0.054244987580143095, 0.24268534603032502, 0.050500194839611864, 0.061999984389772576, -0.3919678376535478, -0.13284745815863327, 0.1175275720264288, 0.12763573971319292, 0.1581305531164387, 0.029208798507382207, -0.35078062327777587, 0.045612998870461365, -0.1753735524173871, -0.1549413596716194, -0.09411214550649658, 0.08078085006049662, -0.06532790528771974, -0.3206095329702841, 0.15831039780615241, 0.030229576969591592, 0.06516593466476125, -0.0191950350971576, -0.21563418487197655, -0.06688278902195466, 0.02206023944794987, 0.09093619947371444, 0.031124908552794418, 0.09696896222377087, -0.12693952912017162, -0.14085352434369836, 0.35067203077623277, -0.0618778775418991, -0.12769272574449628, 0.1111417762568962, -0.18439744607583863, -0.14771067229262327, 0.14503662307629162, 0.15003243144386838, 0.03531416195449849, -0.10947461248583441, 0.09183737594867125, -0.013798321401392385, 0.2071322860666415, 0.10657095701605515, 0.1327261643696721, 0.20060340591335615, 0.0733945493685823, 0.0285814420220632, 0.06474888847476251, -0.12473226711606082, -0.08948818359507624, -0.3713910839660545, -0.08793579715810426, -0.1450425113254064, 0.0880754768140744, -0.09780880058643711, -0.0481967842330686, 0.33073884630756617, 0.09990645574577586, 0.25794639564978267, 0.045086565821372805, 0.24102360757239596, 0.1042543179508145, 0.07462394610951537, 0.06115646097013383, 0.2659618923106023, 0.21925967335542754, 0.07357447083985198, -0.3383761296665875, 0.028509179792520635, -0.003802081013948304] |
710.4831 | LC Oscillator Driver for Safety Critical Applications | A CMOS harmonic signal LC oscillator driver for automotive applications
working in a harsh environment with high safety critical requirements is
described. The driver can be used with a wide range of external components
parameters (LC resonance network of a sensor). Quality factor of the external
LC network can vary two decades. Amplitude regulation of the driver is
digitally controlled and the DAC is constructed as exponential with
piece-wise-linear (PWL) approximation. Low current consumption for high quality
resonance networks is achieved. Realized oscillator is robust, used in safety
critical application and has low EMC emissions.
| cs.OH | a cmos harmonic signal lc oscillator driver for automotive applications working in a harsh environment with high safety critical requirements is described the driver can be used with a wide range of external components parameters lc resonance network of a sensor quality factor of the external lc network can vary two decades amplitude regulation of the driver is digitally controlled and the dac is constructed as exponential with piecewiselinear pwl approximation low current consumption for high quality resonance networks is achieved realized oscillator is robust used in safety critical application and has low emc emissions | [['a', 'cmos', 'harmonic', 'signal', 'lc', 'oscillator', 'driver', 'for', 'automotive', 'applications', 'working', 'in', 'a', 'harsh', 'environment', 'with', 'high', 'safety', 'critical', 'requirements', 'is', 'described', 'the', 'driver', 'can', 'be', 'used', 'with', 'a', 'wide', 'range', 'of', 'external', 'components', 'parameters', 'lc', 'resonance', 'network', 'of', 'a', 'sensor', 'quality', 'factor', 'of', 'the', 'external', 'lc', 'network', 'can', 'vary', 'two', 'decades', 'amplitude', 'regulation', 'of', 'the', 'driver', 'is', 'digitally', 'controlled', 'and', 'the', 'dac', 'is', 'constructed', 'as', 'exponential', 'with', 'piecewiselinear', 'pwl', 'approximation', 'low', 'current', 'consumption', 'for', 'high', 'quality', 'resonance', 'networks', 'is', 'achieved', 'realized', 'oscillator', 'is', 'robust', 'used', 'in', 'safety', 'critical', 'application', 'and', 'has', 'low', 'emc', 'emissions']] | [-0.18335238140272467, 0.12169022264057085, 0.004263286743509142, 0.02953707229248003, -0.04953129864542892, -0.2141628568452832, -0.0008444150787239011, 0.4369967112415715, -0.21367001698205346, -0.3308408446398588, 0.12297406844353598, -0.1985132406343167, -0.13051729915957702, 0.24358467638100448, -0.10785428358143882, 0.13655496079866825, 0.028830109894471732, 0.008908604913832326, 0.0009140452823454612, -0.17511961347864646, 0.20350354523643066, 0.07625135501454536, 0.3584630522582876, 0.024578837677836418, 0.1252253854647279, -0.02070511553289467, 0.08534467779099941, -0.012940410399613411, -0.03637965197282794, 0.09850783289416301, 0.3087003191638934, 0.10638181037318549, 0.2835292109141224, -0.4149662207419935, -0.25412660829330747, 0.09832389044918512, 0.12705353642568776, 0.02587400572864633, -0.035484311680652594, -0.22884339877453289, 0.07781426086041489, -0.22150443269331987, -0.1582327685662006, -0.04451772353663967, 0.0004937365160960901, 0.11116021748043989, -0.30789678045793584, 0.019335289431833907, 0.01087567568672392, 0.11588604509291288, -0.021098153089712326, -0.0720200360997727, -0.0024134106738002677, 0.1454240939334819, -0.04609169926935513, 0.08125408068176751, 0.2851271845792469, -0.17071379563207492, -0.08385153124844165, 0.36032168745602433, -0.09219152620552402, -0.1754877424651855, 0.18534263287131725, -0.1030801376916076, -0.08562683725827619, 0.1369418269856588, 0.19832239980368238, -0.001377439161296934, -0.16961712149020872, 0.05119669846646598, 0.12402668390423059, 0.21327639755449798, 0.07417898216823998, 0.02325862626496114, 0.16490250861419267, 0.283450050995146, 0.056385866652386825, 0.16432383775000314, -0.06790218693939479, -0.030255725569287805, -0.24532075036121043, -0.05866312690471348, -0.1564783029944489, 0.02937387036845872, -0.1029218950011694, -0.1306057804754298, 0.40548876619064494, 0.09197831469538965, 0.148298630686967, -0.01732129169670914, 0.35310465889541726, 0.20650933526431847, 0.11411355263308474, 0.009694561836735565, 0.2817134127020836, 0.1184475716693621, 0.15216279365612487, -0.20572115478510233, 0.09859585113039142, -0.03380146777551425] |
710.4832 | SystemC Analysis of a New Dynamic Power Management Architecture | This paper presents a new dynamic power management architecture of a System
on Chip. The Power State Machine describing the status of the core follows the
recommendations of the ACPI standard. The algorithm controls the power states
of each block on the basis of battery status, chip temperature and a user
defined task priority.
| cs.AR | this paper presents a new dynamic power management architecture of a system on chip the power state machine describing the status of the core follows the recommendations of the acpi standard the algorithm controls the power states of each block on the basis of battery status chip temperature and a user defined task priority | [['this', 'paper', 'presents', 'a', 'new', 'dynamic', 'power', 'management', 'architecture', 'of', 'a', 'system', 'on', 'chip', 'the', 'power', 'state', 'machine', 'describing', 'the', 'status', 'of', 'the', 'core', 'follows', 'the', 'recommendations', 'of', 'the', 'acpi', 'standard', 'the', 'algorithm', 'controls', 'the', 'power', 'states', 'of', 'each', 'block', 'on', 'the', 'basis', 'of', 'battery', 'status', 'chip', 'temperature', 'and', 'a', 'user', 'defined', 'task', 'priority']] | [-0.1965096798848431, 0.05432663037318666, -0.03684186821205998, -0.06357605587734999, -0.0810696820614262, -0.17651344312987519, 0.12693622692725356, 0.31115977019774466, -0.2607373739329149, -0.299036739148059, 0.0972122950303667, -0.2378755803659277, -0.10117760219804521, 0.18656087350451722, -0.10187239535504354, 0.10090631621292317, 0.06597530884879096, 0.1154293147363823, -0.01845088957826484, -0.21027717472247356, 0.3213384296780206, 0.13603250018127686, 0.3823752298529418, 0.050576609243058936, 0.12696678699257802, -0.006663759058903692, -0.026391711086034775, -0.02245347209731644, -0.07588230344062706, 0.14256596511102476, 0.24243318588244464, 0.22369565359615493, 0.31710858165093186, -0.42279084771871567, -0.14688106700075124, 0.03260191269043201, 0.06471495552621079, 0.037592632186440926, -0.04490445625862845, -0.2433630578694338, 0.04840531384238517, -0.25961473508614974, -0.09431076515465975, -0.004553443348070361, -0.038605919116580824, 0.04377208077260908, -0.25756208823536925, -0.022981047920250106, 0.0592585356141669, 0.04832859026907311, -0.08010780089095516, -0.15072033785169348, 0.005668282183765803, 0.14940313046868398, -0.039012051398321146, 0.001607496221110506, 0.20915443126885397, -0.15765368460044968, -0.16520030555789764, 0.37083344277486485, 0.002754143461198458, -0.1346495778559057, 0.09180622652419052, -0.034295465586320406, -0.13252148376602046, 0.03721352178989997, 0.25674839704385344, 0.07691138740332429, -0.1839685408960817, 0.06332421413829269, -0.008601429397767445, 0.23479950976259303, -0.014128031296971834, 0.017488663831620285, 0.2282347423112336, 0.3034251217361329, 0.08169633962811446, 0.13705563626058823, -0.07556199102293489, -0.09740313397333869, -0.3019451339957568, -0.18471168791699522, -0.19400742667604168, 0.00581322765012957, -0.06375932727719631, -0.16386358721076316, 0.5230546059473505, 0.1266630140269386, 0.14058786360019782, 0.09558754282529061, 0.3742367845239504, 0.12792373284310946, 0.05880766748538557, 0.10534253203252963, 0.12152944830298987, 0.06680508369123037, 0.2067124092125527, -0.2683262749100631, 0.09609135316755131, 0.03207050377221884] |
710.4833 | Exploiting Real-Time FPGA Based Adaptive Systems Technology for
Real-Time Sensor Fusion in Next Generation Automotive Safety Systems | We present a system for the boresighting of sensors using inertial
measurement devices as the basis for developing a range of dynamic real-time
sensor fusion applications. The proof of concept utilizes a COTS FPGA platform
for sensor fusion and real-time correction of a misaligned video sensor. We
exploit a custom-designed 32-bit soft processor core and C-based design &
synthesis for rapid, platform-neutral development. Kalman filter and sensor
fusion techniques established in advanced aviation systems are applied to
automotive vehicles with results exceeding typical industry requirements for
sensor alignment. Results of the static and the dynamic tests demonstrate that
using inexpensive accelerometers mounted on (or during assembly of) a sensor
and an Inertial Measurement Unit (IMU) fixed to a vehicle can be used to
compute the misalignment of the sensor to the IMU and thus vehicle. In some
cases the model predications and test results exceeded the requirements by an
order of magnitude with a 3-sigma or 99% confidence.
| cs.AR | we present a system for the boresighting of sensors using inertial measurement devices as the basis for developing a range of dynamic realtime sensor fusion applications the proof of concept utilizes a cots fpga platform for sensor fusion and realtime correction of a misaligned video sensor we exploit a customdesigned 32bit soft processor core and cbased design synthesis for rapid platformneutral development kalman filter and sensor fusion techniques established in advanced aviation systems are applied to automotive vehicles with results exceeding typical industry requirements for sensor alignment results of the static and the dynamic tests demonstrate that using inexpensive accelerometers mounted on or during assembly of a sensor and an inertial measurement unit imu fixed to a vehicle can be used to compute the misalignment of the sensor to the imu and thus vehicle in some cases the model predications and test results exceeded the requirements by an order of magnitude with a 3sigma or 99 confidence | [['we', 'present', 'a', 'system', 'for', 'the', 'boresighting', 'of', 'sensors', 'using', 'inertial', 'measurement', 'devices', 'as', 'the', 'basis', 'for', 'developing', 'a', 'range', 'of', 'dynamic', 'realtime', 'sensor', 'fusion', 'applications', 'the', 'proof', 'of', 'concept', 'utilizes', 'a', 'cots', 'fpga', 'platform', 'for', 'sensor', 'fusion', 'and', 'realtime', 'correction', 'of', 'a', 'misaligned', 'video', 'sensor', 'we', 'exploit', 'a', 'customdesigned', '32bit', 'soft', 'processor', 'core', 'and', 'cbased', 'design', 'synthesis', 'for', 'rapid', 'platformneutral', 'development', 'kalman', 'filter', 'and', 'sensor', 'fusion', 'techniques', 'established', 'in', 'advanced', 'aviation', 'systems', 'are', 'applied', 'to', 'automotive', 'vehicles', 'with', 'results', 'exceeding', 'typical', 'industry', 'requirements', 'for', 'sensor', 'alignment', 'results', 'of', 'the', 'static', 'and', 'the', 'dynamic', 'tests', 'demonstrate', 'that', 'using', 'inexpensive', 'accelerometers', 'mounted', 'on', 'or', 'during', 'assembly', 'of', 'a', 'sensor', 'and', 'an', 'inertial', 'measurement', 'unit', 'imu', 'fixed', 'to', 'a', 'vehicle', 'can', 'be', 'used', 'to', 'compute', 'the', 'misalignment', 'of', 'the', 'sensor', 'to', 'the', 'imu', 'and', 'thus', 'vehicle', 'in', 'some', 'cases', 'the', 'model', 'predications', 'and', 'test', 'results', 'exceeded', 'the', 'requirements', 'by', 'an', 'order', 'of', 'magnitude', 'with', 'a', '3sigma', 'or', '99', 'confidence']] | [-0.13606189717299855, 0.06473030956952314, -0.02847597459390855, -0.04903542548000144, -0.05187055329905632, -0.19269007192447019, 0.03398622714956172, 0.4190524185124116, -0.2185539071036216, -0.35020099031046414, 0.15266758517380088, -0.24177302707446358, -0.10799499435159259, 0.26031076652147117, -0.14321011984243226, 0.14564661610007207, 0.11992276275458817, 0.03642003873187022, -0.027584319007403862, -0.1665476422306547, 0.18958870949557957, 0.08376487055554604, 0.3221811044495553, 0.02508749522549363, 0.17857916102198382, 0.046815764073891424, -0.01195573517216895, -0.0022151601279475496, -0.06968811012153217, 0.15511091648696515, 0.28772578790533143, 0.14212228577190006, 0.2777989626957629, -0.45866601477162194, -0.1659682645008732, 0.04475421385947042, 0.09234806371088593, 0.04025334018903474, -0.0939379832729733, -0.33519242111390507, 0.1464036809047684, -0.2507064318812739, -0.07308424872677186, -0.043428924516774714, 0.008808175943648586, 0.04936745464100312, -0.3319272211602089, -0.024078113038857013, -0.00551319370070138, 0.08726179757370399, -0.11069484403066245, -0.06328183462625393, 0.05771660457890576, 0.1594599416712299, -0.04932369446704307, -0.003873884725647095, 0.26257831105687773, -0.1392339990199663, -0.14584144448431638, 0.39104997417411935, -0.014148874000499908, -0.17635686722440788, 0.17287835463708362, -0.04668073646145132, -0.10750478500454054, 0.07043151824417201, 0.23193039308087185, 0.08729228223614299, -0.17678400969061142, 0.0017708608800790105, 0.06496999194869438, 0.20781761308152896, 0.04438921602484651, 0.018257045845250383, 0.19584678694343147, 0.23603133776654991, 0.11814973627229054, 0.11239649597570324, -0.18672358536740574, -0.03860151401246325, -0.26526356478466484, -0.13975633528547732, -0.16317197539580938, -0.01995848761184905, -0.07729763505043453, -0.13438069882492223, 0.35796316986521465, 0.22317014764195894, 0.1427188126507621, 0.03705526213609399, 0.42005959445706165, 0.05560349050285414, 0.13225700645946348, 0.02967754313692403, 0.24794495883655215, 0.0655425303400709, 0.17091190165135628, -0.15096509027017208, 0.037645199383871675, 0.021772836060382616] |
710.4834 | Platform Based Design for Automotive Sensor Conditioning | In this paper a general architecture suitable to interface several kinds of
sensors for automotive applications is presented. A platform based design
approach is pursued to improve system performance while minimizing
time-to-market.. The platform is composed by an analog front-end and a digital
section. The latter is based on a microcontroller core (8051 IP by Oregano)
plus a set of dedicated hardware dedicated to the complex signal processing
required for sensor conditioning. The microcontroller handles also the
communication with external devices (as a PC) for data output and fast
prototyping. A case study is presented concerning the conditioning of a Gyro
yaw rate sensor for automotive applications. Measured performance results
outperform current state-of-the-art commercial devices.
| cs.AR | in this paper a general architecture suitable to interface several kinds of sensors for automotive applications is presented a platform based design approach is pursued to improve system performance while minimizing timetomarket the platform is composed by an analog frontend and a digital section the latter is based on a microcontroller core 8051 ip by oregano plus a set of dedicated hardware dedicated to the complex signal processing required for sensor conditioning the microcontroller handles also the communication with external devices as a pc for data output and fast prototyping a case study is presented concerning the conditioning of a gyro yaw rate sensor for automotive applications measured performance results outperform current stateoftheart commercial devices | [['in', 'this', 'paper', 'a', 'general', 'architecture', 'suitable', 'to', 'interface', 'several', 'kinds', 'of', 'sensors', 'for', 'automotive', 'applications', 'is', 'presented', 'a', 'platform', 'based', 'design', 'approach', 'is', 'pursued', 'to', 'improve', 'system', 'performance', 'while', 'minimizing', 'timetomarket', 'the', 'platform', 'is', 'composed', 'by', 'an', 'analog', 'frontend', 'and', 'a', 'digital', 'section', 'the', 'latter', 'is', 'based', 'on', 'a', 'microcontroller', 'core', '8051', 'ip', 'by', 'oregano', 'plus', 'a', 'set', 'of', 'dedicated', 'hardware', 'dedicated', 'to', 'the', 'complex', 'signal', 'processing', 'required', 'for', 'sensor', 'conditioning', 'the', 'microcontroller', 'handles', 'also', 'the', 'communication', 'with', 'external', 'devices', 'as', 'a', 'pc', 'for', 'data', 'output', 'and', 'fast', 'prototyping', 'a', 'case', 'study', 'is', 'presented', 'concerning', 'the', 'conditioning', 'of', 'a', 'gyro', 'yaw', 'rate', 'sensor', 'for', 'automotive', 'applications', 'measured', 'performance', 'results', 'outperform', 'current', 'stateoftheart', 'commercial', 'devices']] | [-0.17663550437346362, -0.0032994215234474836, -0.017547097537062017, -0.03853719237897741, -0.11213358922600093, -0.20065464714966846, 0.019506010787537026, 0.3771596727708943, -0.23255447461678272, -0.3229390207285944, 0.15439851510362992, -0.25655187579819505, -0.13585391993585386, 0.3244445468084642, -0.12075351417603854, 0.12093414955878663, 0.10417010844583019, 0.013770611962842705, -0.024836457193535017, -0.20112032796462523, 0.21201272043522054, 0.09297136555981349, 0.34775394557468725, 0.02655609812191279, 0.12278203319925651, 0.008310983490541969, -0.009033712550278818, -0.038244082143105436, -0.0366695943500912, 0.15709392681489126, 0.2934944837827954, 0.1532803143603368, 0.2949652863797127, -0.45080215178364724, -0.19086100528702923, 0.03709897350340167, 0.08074379687017777, 0.01401199285847772, -0.11507785063453443, -0.29590154865045887, 0.12973917614599167, -0.23537177438112467, -0.08162320671544876, -0.01902713954219954, 0.01348517172185606, 0.05177660216730529, -0.30300737950918183, -0.040007117186242044, 0.01433920980177885, 0.07645771944928065, -0.019638211526877346, -0.10088565938068521, 0.0667206979164723, 0.13010236361929983, -0.04699892974907957, 0.039222207831284196, 0.22866128934057137, -0.11311731776151103, -0.14743938600938572, 0.3769795819300047, -0.013094351502347803, -0.20891222089790462, 0.17515468924804672, 0.0015811730388617306, -0.09833934381114025, 0.09243867014485754, 0.2327575243339596, 0.0634789695501687, -0.21685038259448974, 0.053596682708430626, 0.0730396984798605, 0.22139932082867936, 0.02364425863580484, 0.027923034004184923, 0.1700022071865469, 0.3075045853303827, 0.09626749959333163, 0.1750392290496006, -0.0963112338062625, -0.045325567010430654, -0.266724795247954, -0.18449971579391053, -0.19619966375135017, -0.008501899420496142, -0.025459190940621244, -0.12080981133080888, 0.36695922042341217, 0.18904302836183393, 0.11668425472453237, 0.03631894895296315, 0.4773678469814752, 0.04572843220056823, 0.12584409813331277, 0.06374081637171146, 0.1753414240584039, 0.07870544274089952, 0.19708518486004323, -0.1613183846296906, 0.06922139492311735, 0.003032822758286146] |
710.4835 | A CMOS-Based Tactile Sensor for Continuous Blood Pressure Monitoring | A monolithic integrated tactile sensor array is presented, which is used to
perform non-invasive blood pressure monitoring of a patient. The advantage of
this device compared to a hand cuff based approach is the capability of
recording continuous blood pressure data. The capacitive, membrane-based sensor
device is fabricated in an industrial CMOS-technology combined with post-CMOS
micromachining. The capacitance change is detected by a S?-modulator. The
modulator is operated at a sampling rate of 128kS/s and achieves a resolution
of 12bit with an external decimation filter and an OSR of 128.
| cs.OH | a monolithic integrated tactile sensor array is presented which is used to perform noninvasive blood pressure monitoring of a patient the advantage of this device compared to a hand cuff based approach is the capability of recording continuous blood pressure data the capacitive membranebased sensor device is fabricated in an industrial cmostechnology combined with postcmos micromachining the capacitance change is detected by a smodulator the modulator is operated at a sampling rate of 128kss and achieves a resolution of 12bit with an external decimation filter and an osr of 128 | [['a', 'monolithic', 'integrated', 'tactile', 'sensor', 'array', 'is', 'presented', 'which', 'is', 'used', 'to', 'perform', 'noninvasive', 'blood', 'pressure', 'monitoring', 'of', 'a', 'patient', 'the', 'advantage', 'of', 'this', 'device', 'compared', 'to', 'a', 'hand', 'cuff', 'based', 'approach', 'is', 'the', 'capability', 'of', 'recording', 'continuous', 'blood', 'pressure', 'data', 'the', 'capacitive', 'membranebased', 'sensor', 'device', 'is', 'fabricated', 'in', 'an', 'industrial', 'cmostechnology', 'combined', 'with', 'postcmos', 'micromachining', 'the', 'capacitance', 'change', 'is', 'detected', 'by', 'a', 'smodulator', 'the', 'modulator', 'is', 'operated', 'at', 'a', 'sampling', 'rate', 'of', '128kss', 'and', 'achieves', 'a', 'resolution', 'of', '12bit', 'with', 'an', 'external', 'decimation', 'filter', 'and', 'an', 'osr', 'of', '128']] | [-0.13011327733810263, 0.07730202123053752, -0.09034708945144868, -0.12060004206583032, -0.07155791980524857, -0.20616387589781107, 0.02055434489504959, 0.4363913204221205, -0.2043104508260115, -0.30672063509366293, 0.1317722691455856, -0.27583117254249667, -0.10565587035754974, 0.26492069383290995, -0.14655262308901754, 0.08603808449731133, 0.06115678107986847, 0.01160696792234292, 0.008656395074708024, -0.15298204203189789, 0.16560757945923285, 0.12641098705687742, 0.361326362552314, 0.013685688847440413, 0.21696271583700188, -0.014277042224253902, -0.022481678208957117, 0.00806671514272176, -0.039425678667612374, 0.10323124081859815, 0.27997611698576774, 0.059357165144863486, 0.29854369807945585, -0.4313837295804901, -0.22063606437937966, 0.024053689145921976, 0.08422285695653944, 0.06015352574953189, -0.09766651673915518, -0.3043644518173974, 0.11535691923258462, -0.17122456921403692, -0.08080004889989036, -0.009998451061974997, -0.03293376825428728, 0.008632598123673734, -0.32731553477612485, 0.01089257840602391, -0.011826919894879577, 0.10965217427275646, -0.03659738251275715, -0.050139953323436535, 0.0028946482597839557, 0.12988018357441172, -0.1007975341869925, 0.06024982264110198, 0.2921614366297171, -0.09661602137621021, -0.09349751828409646, 0.3156304339177093, -0.03850246232602446, -0.1599230551021709, 0.14219184381748154, -0.06264066582160263, -0.024470457914231837, 0.17228256315581672, 0.16559751431093733, 0.08489879400565706, -0.21269515168521252, -0.00966550066301749, 0.05820240406854742, 0.27881639150784876, 0.08797447201421206, 0.004508898154586211, 0.15028747999719505, 0.32840720857440053, 0.0739572640379955, 0.16414560872697453, -0.1942818620798831, 0.05793814914670355, -0.21677255817560542, -0.19867359083841674, -0.22416063736396274, 0.028321508275366378, -0.07976000196663074, -0.16891389534990678, 0.37198978745453487, 0.172503342659309, 0.1342017011631323, -0.01033713318402183, 0.3810879538884793, 0.07642123038912642, 0.14310400798146067, -0.009482562745353956, 0.2039328392423775, 0.13119958764231154, 0.1945963700886698, -0.2517641175420548, 0.04304449217950647, -0.028087214521271574] |
710.4836 | A Tool and Methodology for AC-Stability Analysis of Continuous-Time
Closed-Loop Systems | Presented are a methodology and a DFII-based tool for AC-stability analysis
of a wide variety of closed-loop continuous-time (operational amplifiers and
other linear circuits). The methodology used allows for easy identification and
diagnostics of ac-stability problems including not only main-loop effects but
also local-instability loops in current mirrors, bias circuits and emitter or
source followers without breaking the loop. The results of the analysis are
easy to interpret. Estimated phase margin is readily available. Instability
nodes and loops along with their respective oscillation frequencies are
immediately identified and mapped to the existing circuit nodes thus offering
significant advantages compared to traditional "black-box" methods of stability
analysis (Transient Overshoot, Bode and Phase margin plots etc.). The tool for
AC-Stability analysis is written in SKILL? and is fully integrated in DFII?
environment. Its "push-button" graphical user interface (GUI) is easy to use
and understand. The tool can be invoked directly from Composer? schematic and
does not require active Analog Artist? session. The tool is not dependent on
the use of a specific fabrication technology or Process Design Kit
customization. It requires OCEAN?, Spectre? and Waveform calculator
capabilities to run.
| cs.OH | presented are a methodology and a dfiibased tool for acstability analysis of a wide variety of closedloop continuoustime operational amplifiers and other linear circuits the methodology used allows for easy identification and diagnostics of acstability problems including not only mainloop effects but also localinstability loops in current mirrors bias circuits and emitter or source followers without breaking the loop the results of the analysis are easy to interpret estimated phase margin is readily available instability nodes and loops along with their respective oscillation frequencies are immediately identified and mapped to the existing circuit nodes thus offering significant advantages compared to traditional blackbox methods of stability analysis transient overshoot bode and phase margin plots etc the tool for acstability analysis is written in skill and is fully integrated in dfii environment its pushbutton graphical user interface gui is easy to use and understand the tool can be invoked directly from composer schematic and does not require active analog artist session the tool is not dependent on the use of a specific fabrication technology or process design kit customization it requires ocean spectre and waveform calculator capabilities to run | [['presented', 'are', 'a', 'methodology', 'and', 'a', 'dfiibased', 'tool', 'for', 'acstability', 'analysis', 'of', 'a', 'wide', 'variety', 'of', 'closedloop', 'continuoustime', 'operational', 'amplifiers', 'and', 'other', 'linear', 'circuits', 'the', 'methodology', 'used', 'allows', 'for', 'easy', 'identification', 'and', 'diagnostics', 'of', 'acstability', 'problems', 'including', 'not', 'only', 'mainloop', 'effects', 'but', 'also', 'localinstability', 'loops', 'in', 'current', 'mirrors', 'bias', 'circuits', 'and', 'emitter', 'or', 'source', 'followers', 'without', 'breaking', 'the', 'loop', 'the', 'results', 'of', 'the', 'analysis', 'are', 'easy', 'to', 'interpret', 'estimated', 'phase', 'margin', 'is', 'readily', 'available', 'instability', 'nodes', 'and', 'loops', 'along', 'with', 'their', 'respective', 'oscillation', 'frequencies', 'are', 'immediately', 'identified', 'and', 'mapped', 'to', 'the', 'existing', 'circuit', 'nodes', 'thus', 'offering', 'significant', 'advantages', 'compared', 'to', 'traditional', 'blackbox', 'methods', 'of', 'stability', 'analysis', 'transient', 'overshoot', 'bode', 'and', 'phase', 'margin', 'plots', 'etc', 'the', 'tool', 'for', 'acstability', 'analysis', 'is', 'written', 'in', 'skill', 'and', 'is', 'fully', 'integrated', 'in', 'dfii', 'environment', 'its', 'pushbutton', 'graphical', 'user', 'interface', 'gui', 'is', 'easy', 'to', 'use', 'and', 'understand', 'the', 'tool', 'can', 'be', 'invoked', 'directly', 'from', 'composer', 'schematic', 'and', 'does', 'not', 'require', 'active', 'analog', 'artist', 'session', 'the', 'tool', 'is', 'not', 'dependent', 'on', 'the', 'use', 'of', 'a', 'specific', 'fabrication', 'technology', 'or', 'process', 'design', 'kit', 'customization', 'it', 'requires', 'ocean', 'spectre', 'and', 'waveform', 'calculator', 'capabilities', 'to', 'run']] | [-0.08523636719318808, 0.04141691589188543, -0.0821981984941299, 0.08466674160386464, -0.1651850651766433, -0.22837738195800636, 0.07299171282930167, 0.4294978882392227, -0.23465281294383963, -0.34652538231289004, 0.1594096875394557, -0.23156510213718565, -0.1245032449894142, 0.26952429539415873, -0.07001870255561067, 0.08073698172232523, 0.07679159293597554, -0.02265852604244576, -0.006021592491866176, -0.18762422074077784, 0.20830850312842533, 0.07690309865980363, 0.3113017885301954, 0.034625449058818605, 0.07864607913200769, 0.0001544348779929639, -0.05679322137431206, -0.00047602779817222895, -0.07504311094920614, 0.07852838291911296, 0.317221270726556, 0.18348194363582981, 0.2358987935121512, -0.4327191800754416, -0.18053270518923525, 0.056663584939962444, 0.15197908213932088, 0.10198788714844509, -0.028570011639178737, -0.2804291223206359, 0.060892533457486846, -0.18931088612645183, -0.10930067007913372, -0.10860780484737736, -0.027709987337695932, 0.010719935480337285, -0.2629277477552351, 0.006735061871522753, 0.05604814483066563, 0.08847964437146635, 0.01359165262565611, -0.1047956669051709, -0.021856862608892996, 0.16935912102347628, -0.00785222664539692, 0.01789538248167297, 0.18893155042855628, -0.09978006590320601, -0.12480947473773459, 0.3420789667450991, -0.015930349237534926, -0.17873523924296184, 0.21333485955749054, -0.07118938244685856, -0.09057521984831028, 0.12669660686388043, 0.19235066486817728, 0.06386413880308348, -0.17474411025419423, 0.042037104563393164, 0.08943087266391662, 0.2019367075431074, 0.0024410671353482646, 0.002237052928982048, 0.20686437477118494, 0.18050840985134264, 0.027839123029668962, 0.13755915148401265, -0.06097602133754936, -0.07652520268895953, -0.2833294149264286, -0.15331820102377994, -0.1332972970348401, -0.034221842752459784, -0.05566827341180379, -0.1882769852517875, 0.3944080350615206, 0.16866926417968814, 0.10502752639312561, 0.026025934943858065, 0.3426571573090073, 0.06740329982019462, 0.1200839887167037, 0.060659254785968106, 0.1966385486194752, 0.11040379054452512, 0.15981120611235622, -0.18384552011495364, 0.13000166802946986, 0.006531351271385703] |
710.4837 | Color transparency and short-range correlations in exclusive pion photo-
and electroproduction from nuclei | A relativistic and quantum mechanical framework to compute nuclear
transparencies for pion photo- and electroproduction reactions is presented.
Final-state interactions for the ejected pions and nucleons are implemented in
a relativistic eikonal approach. At sufficiently large ejectile energies, a
relativistic Glauber model can be adopted. At lower energies, the framework
possesses the flexibility to use relativistic optical potentials. The proposed
model can account for the color-transparency (CT) phenomenon and short-range
correlations (SRC) in the nucleus. Results are presented for kinematics
corresponding to completed and planned experiments at Jefferson Lab. The
influence of CT and SRC on the nuclear transparency is studied. Both the SRC
and CT mechanisms increase the nuclear transparency. The two mechanisms can be
clearly separated, though, as they exhibit a completely different dependence on
the hard scale parameter. The nucleon and pion transparencies as computed in
the relativistic Glauber approach are compared with optical-potential and
semi-classical calculations. The similarities in the trends and magnitudes of
the nuclear transparencies indicate that they are not subject to strong model
dependencies.
| nucl-th | a relativistic and quantum mechanical framework to compute nuclear transparencies for pion photo and electroproduction reactions is presented finalstate interactions for the ejected pions and nucleons are implemented in a relativistic eikonal approach at sufficiently large ejectile energies a relativistic glauber model can be adopted at lower energies the framework possesses the flexibility to use relativistic optical potentials the proposed model can account for the colortransparency ct phenomenon and shortrange correlations src in the nucleus results are presented for kinematics corresponding to completed and planned experiments at jefferson lab the influence of ct and src on the nuclear transparency is studied both the src and ct mechanisms increase the nuclear transparency the two mechanisms can be clearly separated though as they exhibit a completely different dependence on the hard scale parameter the nucleon and pion transparencies as computed in the relativistic glauber approach are compared with opticalpotential and semiclassical calculations the similarities in the trends and magnitudes of the nuclear transparencies indicate that they are not subject to strong model dependencies | [['a', 'relativistic', 'and', 'quantum', 'mechanical', 'framework', 'to', 'compute', 'nuclear', 'transparencies', 'for', 'pion', 'photo', 'and', 'electroproduction', 'reactions', 'is', 'presented', 'finalstate', 'interactions', 'for', 'the', 'ejected', 'pions', 'and', 'nucleons', 'are', 'implemented', 'in', 'a', 'relativistic', 'eikonal', 'approach', 'at', 'sufficiently', 'large', 'ejectile', 'energies', 'a', 'relativistic', 'glauber', 'model', 'can', 'be', 'adopted', 'at', 'lower', 'energies', 'the', 'framework', 'possesses', 'the', 'flexibility', 'to', 'use', 'relativistic', 'optical', 'potentials', 'the', 'proposed', 'model', 'can', 'account', 'for', 'the', 'colortransparency', 'ct', 'phenomenon', 'and', 'shortrange', 'correlations', 'src', 'in', 'the', 'nucleus', 'results', 'are', 'presented', 'for', 'kinematics', 'corresponding', 'to', 'completed', 'and', 'planned', 'experiments', 'at', 'jefferson', 'lab', 'the', 'influence', 'of', 'ct', 'and', 'src', 'on', 'the', 'nuclear', 'transparency', 'is', 'studied', 'both', 'the', 'src', 'and', 'ct', 'mechanisms', 'increase', 'the', 'nuclear', 'transparency', 'the', 'two', 'mechanisms', 'can', 'be', 'clearly', 'separated', 'though', 'as', 'they', 'exhibit', 'a', 'completely', 'different', 'dependence', 'on', 'the', 'hard', 'scale', 'parameter', 'the', 'nucleon', 'and', 'pion', 'transparencies', 'as', 'computed', 'in', 'the', 'relativistic', 'glauber', 'approach', 'are', 'compared', 'with', 'opticalpotential', 'and', 'semiclassical', 'calculations', 'the', 'similarities', 'in', 'the', 'trends', 'and', 'magnitudes', 'of', 'the', 'nuclear', 'transparencies', 'indicate', 'that', 'they', 'are', 'not', 'subject', 'to', 'strong', 'model', 'dependencies']] | [-0.023246658760346255, 0.1781078006599741, -0.14319744853647318, 0.17254677400869803, -0.005477481524389215, -0.13453408769789366, -0.02278079381158129, 0.4247308716787929, -0.20003678655654888, -0.27683741120044253, -0.038152587241275314, -0.32451233867969775, -0.019995222238507884, 0.1712994310590956, 0.07061929945774072, 0.047166917050987134, 0.051838992659155037, 0.0052042954127516665, -0.06332400300603344, -0.1776121295648164, 0.30974954332372073, 0.0922442252806603, 0.2506263260818114, 0.18490345752189563, 0.08763611083850265, 0.04881507776982603, 0.006166527219312756, 0.02791435163936507, -0.06164955290202739, 0.0450864225184839, 0.28223649854635635, 0.04113224152698895, 0.1795367904127254, -0.43975772706475874, -0.1877863017838089, 0.053445845062174556, 0.11730007461288519, 0.12685734329320358, -0.052329779341844136, -0.2864250408605351, 0.0490656587818082, -0.2185548861941312, -0.11820325567400661, -0.12719891168863365, -0.0009293016049689586, 0.038349773598649696, -0.27773694823256406, 0.08329218787778365, 0.012292040443205825, 0.02508602542519312, -0.10713598343723438, -0.17080999160871693, 0.02183058405600009, 0.0946370602547251, 0.03746341810798632, 0.06174376154010734, 0.19441795331828993, -0.1683785414475708, -0.11206632829543574, 0.42567796573827144, 0.029358027328611813, -0.16930017042494916, 0.17109152798459876, -0.18186230863831196, -0.09427863200418433, 0.15648419755832318, 0.19674489387087743, 0.09121571239410785, -0.1825616521357793, 0.042761787469226493, -0.012663254819331114, 0.1569557485854177, 0.03559029434415463, 0.05578603185658828, 0.15041260247538138, 0.1450215486363012, -0.07175693591261467, 0.06548022024339605, -0.14360610970530158, -0.11025648192115868, -0.31562005867364634, -0.03880638104444097, -0.13744348449883056, 0.00885537350477109, -0.06239103012202901, -0.06373413425886579, 0.36433995364517063, 0.09574128075214157, 0.20837374872593373, -0.029163555465420786, 0.2983886606512014, 0.09327529348318644, 0.10622903925219648, 0.0701361401115506, 0.3062328102328537, 0.15190638078932175, 0.11876671354978056, -0.29182682117060565, 0.06180756627745403, 0.0395398359386283] |
710.4838 | A 6bit, 1.2GSps Low-Power Flash-ADC in 0.13$\mu$m Digital CMOS | A 6bit flash-ADC with 1.2GSps, wide analog bandwidth and low power, realized
in a standard digital 0.13 $\mu$m CMOS copper technology is presented.
Employing capacitive interpolation gives various advantages when designing for
low power: no need for a reference resistor ladder, implicit sample-and-hold
operation, no edge effects in the interpolation network (as compared to
resistive interpolation), and a very low input capacitance of only 400fF, which
leads to an easily drivable analog converter interface. Operating at 1.2GSps
the ADC achieves an effective resolution bandwidth (ERBW) of 700MHz, while
consuming 160mW of power. At 600MSps we achieve an ERBW of 600MHz with only
90mW power consumption, both from a 1.5V supply. This corresponds to
outstanding Figure-of-Merit numbers (FoM) of 2.2 and 1.5pJ/convstep,
respectively. The module area is 0.12mm^2.
| cs.AR | a 6bit flashadc with 12gsps wide analog bandwidth and low power realized in a standard digital 013 mum cmos copper technology is presented employing capacitive interpolation gives various advantages when designing for low power no need for a reference resistor ladder implicit sampleandhold operation no edge effects in the interpolation network as compared to resistive interpolation and a very low input capacitance of only 400ff which leads to an easily drivable analog converter interface operating at 12gsps the adc achieves an effective resolution bandwidth erbw of 700mhz while consuming 160mw of power at 600msps we achieve an erbw of 600mhz with only 90mw power consumption both from a 15v supply this corresponds to outstanding figureofmerit numbers fom of 22 and 15pjconvstep respectively the module area is 012mm2 | [['a', '6bit', 'flashadc', 'with', '12gsps', 'wide', 'analog', 'bandwidth', 'and', 'low', 'power', 'realized', 'in', 'a', 'standard', 'digital', '013', 'mum', 'cmos', 'copper', 'technology', 'is', 'presented', 'employing', 'capacitive', 'interpolation', 'gives', 'various', 'advantages', 'when', 'designing', 'for', 'low', 'power', 'no', 'need', 'for', 'a', 'reference', 'resistor', 'ladder', 'implicit', 'sampleandhold', 'operation', 'no', 'edge', 'effects', 'in', 'the', 'interpolation', 'network', 'as', 'compared', 'to', 'resistive', 'interpolation', 'and', 'a', 'very', 'low', 'input', 'capacitance', 'of', 'only', '400ff', 'which', 'leads', 'to', 'an', 'easily', 'drivable', 'analog', 'converter', 'interface', 'operating', 'at', '12gsps', 'the', 'adc', 'achieves', 'an', 'effective', 'resolution', 'bandwidth', 'erbw', 'of', '700mhz', 'while', 'consuming', '160mw', 'of', 'power', 'at', '600msps', 'we', 'achieve', 'an', 'erbw', 'of', '600mhz', 'with', 'only', '90mw', 'power', 'consumption', 'both', 'from', 'a', '15v', 'supply', 'this', 'corresponds', 'to', 'outstanding', 'figureofmerit', 'numbers', 'fom', 'of', '22', 'and', '15pjconvstep', 'respectively', 'the', 'module', 'area', 'is', '012mm2']] | [-0.14060656596296306, 0.03426099788326798, -0.009106144469616741, -0.019709146859581937, -0.05329703031998963, -0.23305483510444774, 0.06811135930936495, 0.3952185152186852, -0.24792781296378835, -0.34718620146580587, 0.11217141574738419, -0.25642304509428554, -0.059874909664985945, 0.27815874598534973, -0.13156433812350612, 0.048195299391377844, 0.012069575635090085, -0.015272706393794766, -0.05864381430779006, -0.17372445013887924, 0.16924278472614443, 0.16488697652399925, 0.35081514354859444, 0.025407278292073773, 0.1669278886763315, -0.04655751488813809, 0.030115578227258962, -0.00389245693302906, -0.05455008861588732, 0.09769055046992184, 0.31548201138603277, 0.012252767935620043, 0.2634587534061023, -0.4084290263788967, -0.16718510716575488, 0.06184153979258303, 0.0986082687560501, 0.04125576393763085, -0.09031222509882605, -0.15794818994492807, 0.13483687356949367, -0.2344932456095382, -0.053691511632521345, -0.03238371535653955, -0.00355164576642986, 0.007372102394583635, -0.3089381476446729, 0.030238348266846453, 0.02740143335791674, 0.08241579091128219, -0.005708195915413571, -0.14707674695668613, -0.00044461555331383413, 0.09871027482485856, -0.0963477990790752, 0.04048667597114751, 0.13482034014505817, -0.14298075330965543, -0.0823703958745243, 0.348645127089373, -0.04994838973426999, -0.17335939314417093, 0.15896478928986874, -0.08668291100485508, -0.023848159416329822, 0.17459700241331652, 0.13333900538669569, -0.00610119370723059, -0.13810976109217055, 0.07029634639184223, 0.07652789581133503, 0.26290367795796743, 0.12596679214942108, 0.08373457163467939, 0.1919069536961615, 0.24510929197000725, 0.10111363863989968, 0.15274444835838571, -0.13588709410597122, -0.03333960995399233, -0.25568989006770326, -0.1434888069212822, -0.1991779739799877, 0.06509535247460008, -0.12371458380108254, -0.12241084929475368, 0.36749503323968885, 0.12497929041273892, 0.17202008668240962, 0.06903137815895426, 0.39345840107778024, 0.14428776974593097, 0.12181520614580348, 0.07001903266816577, 0.2049665084542257, 0.10845477565177636, 0.18804255612686294, -0.18796872583434693, -0.008171830213917741, -0.005118613886036749] |
710.4839 | A 97mW 110MS/s 12b Pipeline ADC Implemented in 0.18$\mu$m Digital CMOS | A 12 bit Pipeline ADC fabricated in a 0.18 $\mu$m pure digital CMOS
technology is presented. Its nominal conversion rate is 110MS/s and the nominal
supply voltage is 1.8V. The effective number of bits is 10.4 when a 10MHz input
signal with 2V_{P-P} signal swing is applied. The occupied silicon area is
0.86mm^2 and the power consumption equals 97mW. A switched capacitor bias
current circuit scale the bias current automatically with the conversion rate,
which gives scaleable power consumption and full performance of the ADC from 20
to 140MS/s.
| cs.AR | a 12 bit pipeline adc fabricated in a 018 mum pure digital cmos technology is presented its nominal conversion rate is 110mss and the nominal supply voltage is 18v the effective number of bits is 104 when a 10mhz input signal with 2v_pp signal swing is applied the occupied silicon area is 086mm2 and the power consumption equals 97mw a switched capacitor bias current circuit scale the bias current automatically with the conversion rate which gives scaleable power consumption and full performance of the adc from 20 to 140mss | [['a', '12', 'bit', 'pipeline', 'adc', 'fabricated', 'in', 'a', '018', 'mum', 'pure', 'digital', 'cmos', 'technology', 'is', 'presented', 'its', 'nominal', 'conversion', 'rate', 'is', '110mss', 'and', 'the', 'nominal', 'supply', 'voltage', 'is', '18v', 'the', 'effective', 'number', 'of', 'bits', 'is', '104', 'when', 'a', '10mhz', 'input', 'signal', 'with', '2v_pp', 'signal', 'swing', 'is', 'applied', 'the', 'occupied', 'silicon', 'area', 'is', '086mm2', 'and', 'the', 'power', 'consumption', 'equals', '97mw', 'a', 'switched', 'capacitor', 'bias', 'current', 'circuit', 'scale', 'the', 'bias', 'current', 'automatically', 'with', 'the', 'conversion', 'rate', 'which', 'gives', 'scaleable', 'power', 'consumption', 'and', 'full', 'performance', 'of', 'the', 'adc', 'from', '20', 'to', '140mss']] | [-0.16217405129490153, 0.09728774220621701, 0.02877281811310067, -0.025412842783095715, -0.03762560027341048, -0.2101967917904923, 0.11411071307070199, 0.346791789235015, -0.26879445242784206, -0.37313948815599796, 0.13833868900352778, -0.2990434394617166, 0.0013040458739158652, 0.25669317915924783, -0.1257514709404426, 0.040535589285788036, -0.015155335497443698, 0.012735077077412001, -0.003657241755198421, -0.22921065119139494, 0.13442910298527705, 0.1471234648488462, 0.39183469171292107, -0.020241803201358943, 0.176319746771783, -0.08946579282859429, 0.028781535148265817, -0.048519072599620336, -0.08107736035959706, 0.054679056441056584, 0.267554265580007, 0.09199934602448982, 0.2444043554631727, -0.38388435269839, -0.11005615095408368, 0.042958471519384714, 0.0803802648581387, 0.07069642104103141, -0.09900654322423395, -0.15327774558127635, 0.13630875415678712, -0.2286716142469751, -0.005849080093737159, 0.07577307667538878, 0.04022395129903175, 0.022982808456401386, -0.3039884625690147, 0.06278621304296567, 0.03792656010427024, 0.039960549980778956, -0.012735985672666825, -0.14552868235235414, -0.04417093525019785, 0.09134963756757013, -0.08297931892420388, 0.09115862674523323, 0.28090656806515263, -0.11009323517126697, -0.07950865217467903, 0.31017968911189764, -0.03999809911918072, -0.16514647881766514, 0.05439411679149738, -0.14646203670140712, 0.025461860605338144, 0.19889666273957118, 0.13701960173923344, -0.03131536407107931, -0.17669719146994925, 0.08945403591427575, 0.10910376502821843, 0.32427483637418064, 0.08432106891026099, 0.04479829934869139, 0.22096623526608927, 0.2905850698811091, 0.08351428939273492, 0.16104822477791458, -0.18947765579269754, -0.012351045238444516, -0.23663093096443585, -0.12157695343263358, -0.15950072575859459, 0.11741580454898733, -0.11001743350148206, -0.07880146971659824, 0.4195687784148114, 0.14079580845178238, 0.1323432640305587, 0.09722815985220395, 0.4373551697159807, 0.21519383262576802, 0.1177971012324893, 0.039146323704959025, 0.22512377253622703, 0.1301425907634742, 0.18841147980475353, -0.21035477177273215, 0.024694795480042688, -0.04333638749085367] |
710.484 | Testing Logic Cores using a BIST P1500 Compliant Approach: A Case of
Study | In this paper we describe how we applied a BIST-based approach to the test of
a logic core to be included in System-on-a-chip (SoC) environments. The
approach advantages are the ability to protect the core IP, the simple test
interface (thanks also to the adoption of the P1500 standard), the possibility
to run the test at-speed, the reduced test time, and the good diagnostic
capabilities. The paper reports figures about the achieved fault coverage, the
required area overhead, and the performance slowdown, and compares the figures
with those for alternative approaches, such as those based on full scan and
sequential ATPG.
| cs.AR | in this paper we describe how we applied a bistbased approach to the test of a logic core to be included in systemonachip soc environments the approach advantages are the ability to protect the core ip the simple test interface thanks also to the adoption of the p1500 standard the possibility to run the test atspeed the reduced test time and the good diagnostic capabilities the paper reports figures about the achieved fault coverage the required area overhead and the performance slowdown and compares the figures with those for alternative approaches such as those based on full scan and sequential atpg | [['in', 'this', 'paper', 'we', 'describe', 'how', 'we', 'applied', 'a', 'bistbased', 'approach', 'to', 'the', 'test', 'of', 'a', 'logic', 'core', 'to', 'be', 'included', 'in', 'systemonachip', 'soc', 'environments', 'the', 'approach', 'advantages', 'are', 'the', 'ability', 'to', 'protect', 'the', 'core', 'ip', 'the', 'simple', 'test', 'interface', 'thanks', 'also', 'to', 'the', 'adoption', 'of', 'the', 'p1500', 'standard', 'the', 'possibility', 'to', 'run', 'the', 'test', 'atspeed', 'the', 'reduced', 'test', 'time', 'and', 'the', 'good', 'diagnostic', 'capabilities', 'the', 'paper', 'reports', 'figures', 'about', 'the', 'achieved', 'fault', 'coverage', 'the', 'required', 'area', 'overhead', 'and', 'the', 'performance', 'slowdown', 'and', 'compares', 'the', 'figures', 'with', 'those', 'for', 'alternative', 'approaches', 'such', 'as', 'those', 'based', 'on', 'full', 'scan', 'and', 'sequential', 'atpg']] | [-0.06591964047872509, -0.019581294350438948, -0.06651559229375738, 0.07390323529993607, -0.06940810727143679, -0.12330466528620684, 0.09629365037703379, 0.36504858999390793, -0.2347775227907631, -0.3577106406140809, 0.1116841207223126, -0.2351263692470813, -0.11794579032375807, 0.21992884828436254, -0.091534597395844, 0.10242279442121284, 0.06892425418614452, 0.0013841447806117511, -0.0632408703653838, -0.2887085562364923, 0.23837554084861445, 0.12261680483046655, 0.345258588611026, 0.05671865145106696, 0.05311936074444516, -0.02396384696240979, -0.023033678432870092, 0.04713763861042081, -0.10699161237124542, 0.13780315850645003, 0.25136518703227995, 0.17920494652023972, 0.25553084727414327, -0.4366808836198426, -0.14503660085469935, 0.057805443681174455, 0.09657116089900485, 0.09255660646548024, -0.0299853534035554, -0.27174667704079036, 0.1046152642147258, -0.22234889816466633, -0.1154199798939505, -0.0704465240188357, -0.02480604855174368, 0.02151714282279665, -0.2372053512607259, 0.010391209544696271, 0.049362347677651075, 0.04891225719598658, -0.009531924590430778, -0.09309186170235126, 0.04770537256028014, 0.1431128150369558, 0.03081545222437743, 0.023648602878580793, 0.14332352210814603, -0.11006956898626129, -0.15090041617260813, 0.4032095829495276, -0.05064228273730612, -0.18724609691311012, 0.23526997083675755, -0.0726828012765959, -0.09584643404385207, 0.08779614248472933, 0.20025889344061865, 0.07675039819488773, -0.14005875353456823, 0.04563092281148214, 0.0506800129877949, 0.17778981501481148, 0.034223633759532766, 0.006420955522870174, 0.16010431189682672, 0.21209723810956935, 0.017562741968743127, 0.15723222969076361, -0.12721476072887655, -0.09350436186591972, -0.27827106841435334, -0.1997491144528142, -0.14481579861603677, -0.033576508388958044, -0.035384834853984, -0.12715972991980085, 0.44845631289662735, 0.25647695203584553, 0.1516279559300253, 0.07634843587216855, 0.34353931256654585, 0.05013119364321947, 0.093716017545596, 0.0622565271709152, 0.23756672460068431, 0.05304666691356235, 0.12601962993674057, -0.2157993188805201, 0.08367859653780481, -0.011277446525954556] |
710.4841 | Electronic structure of the c(4 x 2) reconstructed Ge(001) surface | We investigate the electronic structure of the c(4 x 2) reconstructed Ge(001)
surface using band structure calculations based on density functional theory
and the generalized gradient approximation. In particular, we take into account
the details of surface reconstruction by means of well relaxed crystal
structures. The surface electronic states are identified and the local density
of states is compared to recent data from scanning tunneling spectroscopy. We
obtain almost perfect agreement between theory and experiment for both the
occupied and unoccupied states, which allows us to clarify the interpretation
of the experimental data.
| cond-mat.mtrl-sci | we investigate the electronic structure of the c4 x 2 reconstructed ge001 surface using band structure calculations based on density functional theory and the generalized gradient approximation in particular we take into account the details of surface reconstruction by means of well relaxed crystal structures the surface electronic states are identified and the local density of states is compared to recent data from scanning tunneling spectroscopy we obtain almost perfect agreement between theory and experiment for both the occupied and unoccupied states which allows us to clarify the interpretation of the experimental data | [['we', 'investigate', 'the', 'electronic', 'structure', 'of', 'the', 'c4', 'x', '2', 'reconstructed', 'ge001', 'surface', 'using', 'band', 'structure', 'calculations', 'based', 'on', 'density', 'functional', 'theory', 'and', 'the', 'generalized', 'gradient', 'approximation', 'in', 'particular', 'we', 'take', 'into', 'account', 'the', 'details', 'of', 'surface', 'reconstruction', 'by', 'means', 'of', 'well', 'relaxed', 'crystal', 'structures', 'the', 'surface', 'electronic', 'states', 'are', 'identified', 'and', 'the', 'local', 'density', 'of', 'states', 'is', 'compared', 'to', 'recent', 'data', 'from', 'scanning', 'tunneling', 'spectroscopy', 'we', 'obtain', 'almost', 'perfect', 'agreement', 'between', 'theory', 'and', 'experiment', 'for', 'both', 'the', 'occupied', 'and', 'unoccupied', 'states', 'which', 'allows', 'us', 'to', 'clarify', 'the', 'interpretation', 'of', 'the', 'experimental', 'data']] | [-0.09991060504696071, 0.0834511971021051, -0.12571651201134407, 0.07932804989182861, -0.013477954132262097, -0.07905920890537942, 0.09389924887637859, 0.3816610157329549, -0.27296228941169476, -0.3415837539259785, 0.025705117490693367, -0.3117556795078863, -0.1430281429246108, 0.13097660947260598, 0.03620280363466791, 0.047531960101457695, 0.04542269092053175, -0.028792205386825146, -0.12052219935382406, -0.18712712855889432, 0.3118961866123862, 0.07314219333166357, 0.3240048442716881, 0.0800464573536589, 0.06464235536924373, 0.05961006810207681, -0.008998836240460795, 0.05592119479451769, -0.19634146007498907, 0.16433467803164936, 0.2349910016787509, 0.02994371988179703, 0.1756334265503752, -0.5324761725671749, -0.21221303817645837, -0.013022242194061638, 0.07450529117317449, 0.14120144455478356, -0.06041085920221503, -0.3069163542341, 0.06966490183346054, -0.10279901162470861, -0.1150303449762124, -0.1316807147075412, -0.056695396391054, -0.01317400155595126, -0.20506246951008114, 0.11268417662390137, -0.03749212932958197, 0.03965153386095045, -0.15462752864808746, -0.11928885615110317, -0.11072776950545289, 0.11183954156955243, -0.018638495191861625, 0.03425262445804252, 0.12027526887444158, -0.09476919875790675, -0.07813689295923518, 0.35288812808932796, -0.05550354068237607, -0.13082959446104703, 0.1647669784799819, -0.18491160786981065, -0.10493113373916957, 0.13330888107258787, 0.11199444316024641, 0.10412870209303594, -0.08746743554835237, 0.12954304043844503, -0.016120299018458815, 0.17227797636822348, 0.06648858019491277, 0.06787468695201627, 0.16679376080351813, 0.14891463788276318, 0.04957148276760133, 0.09952918978743455, -0.15374634561869965, -0.07438169183930562, -0.26685406117429655, -0.16719779658621997, -0.19841840851961845, 0.04013154887023472, -0.004716806427290243, -0.15676800898083496, 0.42844176689984015, 0.07728232114866215, 0.22284700551260544, -0.03363599125370984, 0.25207161594943334, 0.09489237838950489, 0.03900415678658793, 0.03410001010984503, 0.20892744043701758, 0.20483477533574626, 0.01475978108944111, -0.2333624492955184, 0.05921526241331532, 0.02106026023556228] |
710.4842 | Using Mobilize Power Management IP for Dynamic & Static Power Reduction
in SoC at 130 nm | At 130 nm and 90 nm, power consumption (both dynamic and static) has become a
barrier in the roadmap for SoC designs targeting battery powered, mobile
applications. This paper presents the results of dynamic and static power
reduction achieved implementing Tensilica's 32-bit Xtensa microprocessor core,
using Virtual Silicon's Power Management IP. Independent voltage islands are
created using Virtual Silicon's VIP PowerSaver standard cells by using voltage
level shifting cells and voltage isolation cells to implement power islands.
The VIP PowerSaver standard cells are characterized at 1.2V, 1.0V and 0.8V, to
accommodate voltage scaling. Power islands can also be turned off completely.
Designers can significantly lower both the dynamic power and the quiescent or
leakage power of their SoC designs, with very little impact on speed or area
using Virtual Silicon's VIP Gate Bias standard cells.
| cs.AR | at 130 nm and 90 nm power consumption both dynamic and static has become a barrier in the roadmap for soc designs targeting battery powered mobile applications this paper presents the results of dynamic and static power reduction achieved implementing tensilicas 32bit xtensa microprocessor core using virtual silicons power management ip independent voltage islands are created using virtual silicons vip powersaver standard cells by using voltage level shifting cells and voltage isolation cells to implement power islands the vip powersaver standard cells are characterized at 12v 10v and 08v to accommodate voltage scaling power islands can also be turned off completely designers can significantly lower both the dynamic power and the quiescent or leakage power of their soc designs with very little impact on speed or area using virtual silicons vip gate bias standard cells | [['at', '130', 'nm', 'and', '90', 'nm', 'power', 'consumption', 'both', 'dynamic', 'and', 'static', 'has', 'become', 'a', 'barrier', 'in', 'the', 'roadmap', 'for', 'soc', 'designs', 'targeting', 'battery', 'powered', 'mobile', 'applications', 'this', 'paper', 'presents', 'the', 'results', 'of', 'dynamic', 'and', 'static', 'power', 'reduction', 'achieved', 'implementing', 'tensilicas', '32bit', 'xtensa', 'microprocessor', 'core', 'using', 'virtual', 'silicons', 'power', 'management', 'ip', 'independent', 'voltage', 'islands', 'are', 'created', 'using', 'virtual', 'silicons', 'vip', 'powersaver', 'standard', 'cells', 'by', 'using', 'voltage', 'level', 'shifting', 'cells', 'and', 'voltage', 'isolation', 'cells', 'to', 'implement', 'power', 'islands', 'the', 'vip', 'powersaver', 'standard', 'cells', 'are', 'characterized', 'at', '12v', '10v', 'and', '08v', 'to', 'accommodate', 'voltage', 'scaling', 'power', 'islands', 'can', 'also', 'be', 'turned', 'off', 'completely', 'designers', 'can', 'significantly', 'lower', 'both', 'the', 'dynamic', 'power', 'and', 'the', 'quiescent', 'or', 'leakage', 'power', 'of', 'their', 'soc', 'designs', 'with', 'very', 'little', 'impact', 'on', 'speed', 'or', 'area', 'using', 'virtual', 'silicons', 'vip', 'gate', 'bias', 'standard', 'cells']] | [-0.15105629731005213, 0.13080810919005909, 0.04160933121541188, -0.001690967510568106, -0.02263209098622999, -0.23254068879204454, 0.16945464903300358, 0.3803578550920232, -0.25487752935586083, -0.36716216893596504, 0.08361727029053168, -0.2449234274059591, -0.07353575193884833, 0.28168109181258855, -0.11265356048678567, 0.027360105674664084, -0.0024149305854110005, -0.0895341963565887, 0.022627587160468813, -0.21545796070375856, 0.17707942095265247, 0.13025941595947013, 0.39120009739150985, 0.06663422140058216, 0.06050104071307956, -0.036490059866505956, 0.030997953992621362, 0.0794425071501493, -0.012737378396292907, 0.085063363123287, 0.2500518861623083, 0.06331768970555965, 0.2518858548666116, -0.5115514420371019, -0.14097717562725923, 0.04640614802998896, 0.12698408687586776, 0.03831466229788902, -0.08945613949762245, -0.24073510656830008, 0.1645981956394176, -0.23365268004233486, -0.08576998996854056, -0.04356378575970014, -0.018212851243118493, 0.049572538420956096, -0.25016463539413825, -0.007584125001049238, -0.0009168843447252084, 0.10136667366729665, -0.007919873597939279, -0.1415091380174805, -0.02001780878667158, 0.1367170894722888, -0.05376486562437712, -0.031687595795098875, 0.26604896670079414, -0.1015990323521275, -0.13078748528447487, 0.324293501248569, 0.02842139267853198, -0.1384882531813097, 0.14923448981992715, -0.10045010303342644, -0.0125370787333107, 0.13991938672519025, 0.20743907278560045, 0.008560696107590658, -0.17248924868536814, 0.09017975415895828, 0.11586740245431207, 0.22208357827012776, 0.1458515429776873, 0.014222043367344459, 0.21489893704766536, 0.22535198789715538, 0.0700932149704233, 0.1260454851631004, -0.13046035321942243, -0.07073301417159471, -0.1743193660784541, -0.097155257917315, -0.12590724456955799, 0.053049409299918256, -0.07774401026647289, -0.13634595485361478, 0.4205075401744698, 0.06822252258985438, 0.09981913025889062, 0.06814947933356726, 0.3844575211974501, 0.15318783339226746, 0.14963724636046202, 0.100075421456731, 0.2090935750388121, 0.06417343190174464, 0.22031963053905895, -0.2146943236344835, 0.03632705736521433, -0.023079718320269692] |
710.4843 | MultiNoC: A Multiprocessing System Enabled by a Network on Chip | The MultiNoC system implements a programmable on-chip multiprocessing
platform built on top of an efficient, low area overhead intra-chip
interconnection scheme. The employed interconnection structure is a Network on
Chip, or NoC. NoCs are emerging as a viable alternative to increasing demands
on interconnection architectures, due to the following characteristics: (i)
energy efficiency and reliability; (ii) scalability of bandwidth, when compared
to traditional bus architectures; (iii) reusability; (iv) distributed routing
decisions. An external host computer feeds MultiNoC with application
instructions and data. After this initialization procedure, MultiNoC executes
some algorithm. After finishing execution of the algorithm, output data can be
read back by the host. Sequential or parallel algorithms conveniently adapted
to the MultiNoC structure can be executed. The main motivation to propose this
design is to enable the investigation of current trends to increase the number
of embedded processors in SoCs, leading to the concept of "sea of processors"
systems.
| cs.AR | the multinoc system implements a programmable onchip multiprocessing platform built on top of an efficient low area overhead intrachip interconnection scheme the employed interconnection structure is a network on chip or noc nocs are emerging as a viable alternative to increasing demands on interconnection architectures due to the following characteristics i energy efficiency and reliability ii scalability of bandwidth when compared to traditional bus architectures iii reusability iv distributed routing decisions an external host computer feeds multinoc with application instructions and data after this initialization procedure multinoc executes some algorithm after finishing execution of the algorithm output data can be read back by the host sequential or parallel algorithms conveniently adapted to the multinoc structure can be executed the main motivation to propose this design is to enable the investigation of current trends to increase the number of embedded processors in socs leading to the concept of sea of processors systems | [['the', 'multinoc', 'system', 'implements', 'a', 'programmable', 'onchip', 'multiprocessing', 'platform', 'built', 'on', 'top', 'of', 'an', 'efficient', 'low', 'area', 'overhead', 'intrachip', 'interconnection', 'scheme', 'the', 'employed', 'interconnection', 'structure', 'is', 'a', 'network', 'on', 'chip', 'or', 'noc', 'nocs', 'are', 'emerging', 'as', 'a', 'viable', 'alternative', 'to', 'increasing', 'demands', 'on', 'interconnection', 'architectures', 'due', 'to', 'the', 'following', 'characteristics', 'i', 'energy', 'efficiency', 'and', 'reliability', 'ii', 'scalability', 'of', 'bandwidth', 'when', 'compared', 'to', 'traditional', 'bus', 'architectures', 'iii', 'reusability', 'iv', 'distributed', 'routing', 'decisions', 'an', 'external', 'host', 'computer', 'feeds', 'multinoc', 'with', 'application', 'instructions', 'and', 'data', 'after', 'this', 'initialization', 'procedure', 'multinoc', 'executes', 'some', 'algorithm', 'after', 'finishing', 'execution', 'of', 'the', 'algorithm', 'output', 'data', 'can', 'be', 'read', 'back', 'by', 'the', 'host', 'sequential', 'or', 'parallel', 'algorithms', 'conveniently', 'adapted', 'to', 'the', 'multinoc', 'structure', 'can', 'be', 'executed', 'the', 'main', 'motivation', 'to', 'propose', 'this', 'design', 'is', 'to', 'enable', 'the', 'investigation', 'of', 'current', 'trends', 'to', 'increase', 'the', 'number', 'of', 'embedded', 'processors', 'in', 'socs', 'leading', 'to', 'the', 'concept', 'of', 'sea', 'of', 'processors', 'systems']] | [-0.18741538819382028, 0.034068591900621635, -0.0254326005780835, -0.00954067702744378, -0.10304687915382203, -0.22959472302853173, 0.09114777299706378, 0.4285205870200664, -0.2774285666693915, -0.3751235876158373, 0.1316095338509856, -0.206936879231539, -0.12166497031757176, 0.21300108112789543, -0.10629594130194839, 0.08339922235575535, 0.10029004779582633, -0.019670854157626334, -0.03052004380614207, -0.2949486520104357, 0.2197117852594469, 0.1237468543918865, 0.3497663846560168, 0.02110662738120319, 0.08411565262805794, -0.012482533524343312, -0.003530118450991168, -0.028287767024790956, -0.011312595355811696, 0.140281037099055, 0.27318603903153876, 0.1948822620232275, 0.30654645279907183, -0.48877620891920776, -0.12634197327413207, 0.037852005049314914, 0.14007997029346864, 0.07149997548453066, -0.024791261374746874, -0.2629965898821389, 0.09767528564595179, -0.21273394128838122, -0.08473419697202791, -0.0669599781437339, -0.015290215299989017, 0.03638358519794974, -0.24396816423141232, -0.06155398740920405, 0.005682178978832895, 0.019998519135552725, 0.010505558554366823, -0.0736420155519817, -0.000652389039612369, 0.1250760776234794, -0.05066776332685983, 0.03688450795074074, 0.22003825767496168, -0.0865647953700595, -0.18476197689105542, 0.35130160329061627, 0.00010272498945674755, -0.16321217062241639, 0.1692770861446956, 0.030872550108377507, -0.12341923910248655, 0.09408281314871367, 0.25235359433464805, 0.02723429428177596, -0.14865396879214426, 0.05390384575195567, 0.09741358027873648, 0.21079180690780627, 0.02189934738627974, 0.05729647431158714, 0.20826615409660368, 0.2684490793609733, 0.07943200681124203, 0.16235661006240415, -0.056252448939655086, -0.11198302757670325, -0.2101598611002825, -0.1699402388771194, -0.16473722932181808, 0.017376515441512478, -0.07432101480026779, -0.15078399259449038, 0.3830898823857179, 0.17966366728262, 0.14116982208096132, 0.06639930882663866, 0.40663712309513067, 0.05159766208118333, 0.18026427577699947, 0.14231340604717072, 0.13669227842501339, 0.06997959350161748, 0.19361684981745897, -0.2082598416029864, 0.07848612226804855, -0.009039587432222551] |
710.4844 | A Partitioning Methodology for Accelerating Applications in Hybrid
Reconfigurable Platforms | In this paper, we propose a methodology for partitioning and mapping
computational intensive applications in reconfigurable hardware blocks of
different granularity. A generic hybrid reconfigurable architecture is
considered so as the methodology can be applicable to a large number of
heterogeneous reconfigurable platforms. The methodology mainly consists of two
stages, the analysis and the mapping of the application onto fine and
coarse-grain hardware resources. A prototype framework consisting of analysis,
partitioning and mapping tools has been also developed. For the coarse-grain
reconfigurable hardware, we use our previous-developed high-performance
coarse-grain data-path. In this work, the methodology is validated using two
real-world applications, an OFDM transmitter and a JPEG encoder. In the case of
the OFDM transmitter, a maximum clock cycles decrease of 82% relative to the
ones in an all fine-grain mapping solution is achieved. The corresponding
performance improvement for the JPEG is 43%.
| cs.AR | in this paper we propose a methodology for partitioning and mapping computational intensive applications in reconfigurable hardware blocks of different granularity a generic hybrid reconfigurable architecture is considered so as the methodology can be applicable to a large number of heterogeneous reconfigurable platforms the methodology mainly consists of two stages the analysis and the mapping of the application onto fine and coarsegrain hardware resources a prototype framework consisting of analysis partitioning and mapping tools has been also developed for the coarsegrain reconfigurable hardware we use our previousdeveloped highperformance coarsegrain datapath in this work the methodology is validated using two realworld applications an ofdm transmitter and a jpeg encoder in the case of the ofdm transmitter a maximum clock cycles decrease of 82 relative to the ones in an all finegrain mapping solution is achieved the corresponding performance improvement for the jpeg is 43 | [['in', 'this', 'paper', 'we', 'propose', 'a', 'methodology', 'for', 'partitioning', 'and', 'mapping', 'computational', 'intensive', 'applications', 'in', 'reconfigurable', 'hardware', 'blocks', 'of', 'different', 'granularity', 'a', 'generic', 'hybrid', 'reconfigurable', 'architecture', 'is', 'considered', 'so', 'as', 'the', 'methodology', 'can', 'be', 'applicable', 'to', 'a', 'large', 'number', 'of', 'heterogeneous', 'reconfigurable', 'platforms', 'the', 'methodology', 'mainly', 'consists', 'of', 'two', 'stages', 'the', 'analysis', 'and', 'the', 'mapping', 'of', 'the', 'application', 'onto', 'fine', 'and', 'coarsegrain', 'hardware', 'resources', 'a', 'prototype', 'framework', 'consisting', 'of', 'analysis', 'partitioning', 'and', 'mapping', 'tools', 'has', 'been', 'also', 'developed', 'for', 'the', 'coarsegrain', 'reconfigurable', 'hardware', 'we', 'use', 'our', 'previousdeveloped', 'highperformance', 'coarsegrain', 'datapath', 'in', 'this', 'work', 'the', 'methodology', 'is', 'validated', 'using', 'two', 'realworld', 'applications', 'an', 'ofdm', 'transmitter', 'and', 'a', 'jpeg', 'encoder', 'in', 'the', 'case', 'of', 'the', 'ofdm', 'transmitter', 'a', 'maximum', 'clock', 'cycles', 'decrease', 'of', '82', 'relative', 'to', 'the', 'ones', 'in', 'an', 'all', 'finegrain', 'mapping', 'solution', 'is', 'achieved', 'the', 'corresponding', 'performance', 'improvement', 'for', 'the', 'jpeg', 'is', '43']] | [-0.18335377220326746, 0.013765853729048205, -0.04451108195541859, -0.033617534640886244, -0.05897415319824932, -0.1810371962139829, 0.025175294539609164, 0.42085246095748646, -0.2618759117961507, -0.3124363485094107, 0.12590381166566506, -0.19699097886799613, -0.18953965023294433, 0.22447417546916282, -0.08805743075618652, 0.09211532458085829, 0.07450361606750218, -0.04458806690641902, -0.04799947371168561, -0.22830623102417005, 0.21759343549976468, 0.06672508729306954, 0.37333424873387727, 0.008097122469261078, 0.11226330279753031, -0.022620854656618665, -0.029599658323412523, -0.020883652437347133, -0.05767107895627933, 0.15843643480583922, 0.3165262786615771, 0.19758455313801188, 0.2927357402177606, -0.4177291674906729, -0.20591788384145204, 0.056552667295786514, 0.1405047400580706, 0.10082716635152908, -0.05688466876745224, -0.2471434051502155, 0.11680107148164148, -0.2334039110664121, -0.05458448179931918, -0.0699996675535197, -0.024892323110974064, 0.015695876523878584, -0.26686717379628355, -0.04193258015164272, 0.03491948533199218, 0.07926224777475, -0.028178887687702204, -0.10822900402700712, 0.05405467125738014, 0.14711828778733985, -0.06703065475940861, 0.020969240204759047, 0.1320055056802771, -0.07563688470588499, -0.13279934803312513, 0.38390046124294086, -0.022951224963115135, -0.2222048207612472, 0.19651486432019122, -0.012298147761407243, -0.1662784884224685, 0.1277312130772207, 0.23359221687645348, 0.10566534214443199, -0.20808595115922288, 0.07610402774339554, 0.015860236309711416, 0.22087499756090553, 0.06873504077346707, 0.031112772943435604, 0.1654805380385369, 0.29017621772298197, 0.0586580237452413, 0.20815073811157253, -0.10342838155420524, -0.09144542506948428, -0.2353069836119662, -0.19368894143738377, -0.2298710987760528, -0.030018488902756026, -0.09738647539287881, -0.12797070174514066, 0.41724706854356425, 0.1703545379511435, 0.1319575492017181, 0.0534339138851042, 0.40542329744186617, 0.059344532155156345, 0.11842572864827136, 0.07245841234738767, 0.13764033164881484, 0.07296472323999385, 0.13386359086758653, -0.1840931374094331, 0.023903157627603536, 0.0039062222636396617] |
710.4845 | Evaluation of SystemC Modelling of Reconfigurable Embedded Systems | This paper evaluates the use of pin and cycle accurate SystemC models for
embedded system design exploration and early software development. The target
system is MicroBlaze VanillaNet Platform running MicroBlaze uClinux operating
system. The paper compares Register Transfer Level (RTL) Hardware Description
Language (HDL) simulation speed to the simulation speed of several different
SystemC models. It is shown that simulation speed of pin and cycle accurate
models can go up to 150 kHz, compared to 100 Hz range of HDL simulation.
Furthermore, utilising techniques that temporarily compromise cycle accuracy,
effective simulation speed of up to 500 kHz can be obtained.
| cs.AR | this paper evaluates the use of pin and cycle accurate systemc models for embedded system design exploration and early software development the target system is microblaze vanillanet platform running microblaze uclinux operating system the paper compares register transfer level rtl hardware description language hdl simulation speed to the simulation speed of several different systemc models it is shown that simulation speed of pin and cycle accurate models can go up to 150 khz compared to 100 hz range of hdl simulation furthermore utilising techniques that temporarily compromise cycle accuracy effective simulation speed of up to 500 khz can be obtained | [['this', 'paper', 'evaluates', 'the', 'use', 'of', 'pin', 'and', 'cycle', 'accurate', 'systemc', 'models', 'for', 'embedded', 'system', 'design', 'exploration', 'and', 'early', 'software', 'development', 'the', 'target', 'system', 'is', 'microblaze', 'vanillanet', 'platform', 'running', 'microblaze', 'uclinux', 'operating', 'system', 'the', 'paper', 'compares', 'register', 'transfer', 'level', 'rtl', 'hardware', 'description', 'language', 'hdl', 'simulation', 'speed', 'to', 'the', 'simulation', 'speed', 'of', 'several', 'different', 'systemc', 'models', 'it', 'is', 'shown', 'that', 'simulation', 'speed', 'of', 'pin', 'and', 'cycle', 'accurate', 'models', 'can', 'go', 'up', 'to', '150', 'khz', 'compared', 'to', '100', 'hz', 'range', 'of', 'hdl', 'simulation', 'furthermore', 'utilising', 'techniques', 'that', 'temporarily', 'compromise', 'cycle', 'accuracy', 'effective', 'simulation', 'speed', 'of', 'up', 'to', '500', 'khz', 'can', 'be', 'obtained']] | [-0.12952771961655735, 0.0678136183272059, -0.030100575113688046, 0.01954955386819926, -0.03762755816688343, -0.1912039108859489, 0.05424867715087852, 0.4127359211977039, -0.26037788694743447, -0.39974105962533124, 0.1218217499316575, -0.22579337559089216, -0.06619561679319155, 0.2842192444902826, -0.04872693411283651, 0.10264424523528741, 0.16044602370155708, -0.006956249596646094, -0.038504862796743304, -0.2148218166691308, 0.14912352431565523, 0.1528038029768029, 0.3101954719678936, 0.027813813843935425, 0.12819393141651336, -0.09610394419560551, 0.04066507895572149, -0.06372851870801984, -0.10672222907082962, 0.10258828376761961, 0.270253635282717, 0.18749253944094693, 0.23675534790809438, -0.43673277137877076, -0.20971519618570728, 0.03653734460549087, 0.14113772032801442, 0.06396974093869937, 0.008373269295719053, -0.2262529002844679, 0.14392784735834113, -0.2723232948278286, -0.10986571897258413, -0.10072796374597416, -0.009907350248220016, 0.0019137609182210754, -0.2407459765470739, -0.0053880021432818545, 0.005432526571486069, 0.08586898486472058, -0.02001883095244364, -0.09729903064102732, 0.0209578950414244, 0.15550049369660568, -0.05322233623140776, 0.10889034455657547, 0.21637782861231541, -0.05970862810143593, -0.13043550945514318, 0.3571206474040008, -0.07404079584984527, -0.12668937973069902, 0.2664413204635208, -0.07261105202974713, -0.05239445706758154, 0.14159328252913392, 0.23226545371913485, 0.043457561153538375, -0.15985915958121114, 0.05868596324937095, 0.10080213065743826, 0.28068523112760513, 0.09811056745286119, -0.03213566958034715, 0.16587869233299732, 0.2918996634817093, 1.0409382913185626e-05, 0.10974968600975425, -0.06774690154493235, -0.10483277130073734, -0.24967453691500183, -0.14231578296030234, -0.09793549230350751, -0.015207695784237312, -0.08465639664271814, -0.08536640963872315, 0.4103391727774727, 0.2623522322891014, 0.059543250375712405, 0.13287451066913045, 0.37452455343944685, 0.07323123198192642, 0.06602843720062009, 0.09415875420649061, 0.1869720112335184, 0.043100790809649896, 0.14076623283516693, -0.20167134244503376, 0.03770099978238268, -0.015026778286817123] |
710.4846 | An Integrated Design and Verification Methodology for Reconfigurable
Multimedia Systems | Recently a lot of multimedia applications are emerging on portable
appliances. They require both the flexibility of upgradeable devices
(traditionally software based) and a powerful computing engine (typically
hardware). In this context, programmable HW and dynamic reconfiguration allow
novel approaches to the migration of algorithms from SW to HW. Thus, in the
frame of the Symbad project, we propose an industrial design flow for
reconfigurable SoC's. The goal of Symbad consists of developing a system level
design platform for hardware and software SoC systems including formal and
semi-formal verification techniques.
| cs.MM cs.LO | recently a lot of multimedia applications are emerging on portable appliances they require both the flexibility of upgradeable devices traditionally software based and a powerful computing engine typically hardware in this context programmable hw and dynamic reconfiguration allow novel approaches to the migration of algorithms from sw to hw thus in the frame of the symbad project we propose an industrial design flow for reconfigurable socs the goal of symbad consists of developing a system level design platform for hardware and software soc systems including formal and semiformal verification techniques | [['recently', 'a', 'lot', 'of', 'multimedia', 'applications', 'are', 'emerging', 'on', 'portable', 'appliances', 'they', 'require', 'both', 'the', 'flexibility', 'of', 'upgradeable', 'devices', 'traditionally', 'software', 'based', 'and', 'a', 'powerful', 'computing', 'engine', 'typically', 'hardware', 'in', 'this', 'context', 'programmable', 'hw', 'and', 'dynamic', 'reconfiguration', 'allow', 'novel', 'approaches', 'to', 'the', 'migration', 'of', 'algorithms', 'from', 'sw', 'to', 'hw', 'thus', 'in', 'the', 'frame', 'of', 'the', 'symbad', 'project', 'we', 'propose', 'an', 'industrial', 'design', 'flow', 'for', 'reconfigurable', 'socs', 'the', 'goal', 'of', 'symbad', 'consists', 'of', 'developing', 'a', 'system', 'level', 'design', 'platform', 'for', 'hardware', 'and', 'software', 'soc', 'systems', 'including', 'formal', 'and', 'semiformal', 'verification', 'techniques']] | [-0.17161899151026525, -0.002152171561233858, -0.054571850296104625, -0.03779517633930399, -0.10423278386323628, -0.21021001322978092, 0.01603107435353608, 0.4015500664033673, -0.2508381696693091, -0.3630646964831447, 0.12656678240587513, -0.17110666364897043, -0.1670420795939704, 0.2916355738416314, -0.1067545541670618, 0.15232606293548914, 0.0602481676350263, -0.0413562832651554, -0.04873443678661715, -0.18269891137606464, 0.24871494267559188, 0.07340695792696682, 0.3547339305620302, 0.03967421530978754, 0.07543825518231725, 0.010129739035619423, -0.024204804027580063, -0.038284849216738207, -0.04781038604480934, 0.2226886997443878, 0.327804433462337, 0.21461192960321734, 0.34301887414502824, -0.4881486404390836, -0.15969758007982324, 0.021507470049651933, 0.1314086343733255, 0.056665754612450575, -0.07400802905083931, -0.27178894032576034, 0.10680130562567766, -0.2773284020817796, -0.07249881534302073, -0.10375410437964919, 0.04843823144487529, 0.05692733182645911, -0.2428751077545299, -0.09419185252309861, 0.031226700637489557, 0.11506874710109762, -0.021560075589150074, -0.08885846976376012, 0.053584590121648616, 0.1455172496075234, -0.044912355924183925, -0.00433490743208412, 0.1924139177585444, -0.14743902111711743, -0.1902749256696552, 0.403253353708847, 0.041411867873235184, -0.15749345656315034, 0.24301461342044853, 0.026045430123552003, -0.20205726054370066, 0.07753531804138963, 0.2878126532516696, 0.08042855182429776, -0.2203587588896467, 0.09431241594244387, 0.11424694470637901, 0.19783358612171884, -0.025438267409547487, 0.04294524785258214, 0.2685470571318133, 0.2680346934569322, 0.06067757852460173, 0.13990953770751896, -0.0335488013939043, -0.09025496083301153, -0.22460864175015807, -0.20462408823236314, -0.13654477708835408, -0.020593459453349085, -0.028519744468212593, -0.18105972147102214, 0.3809265054508366, 0.17883871800520204, 0.056535703955556856, 0.030954710534636186, 0.385987399907952, 0.05169949136589738, 0.15966440371068363, 0.13359611526935955, 0.15815163395150608, 0.021340241698040205, 0.23101593062429773, -0.16114131797406694, 0.06276125717241401, -0.009885417572645978] |
710.4847 | Bayesian sequential change diagnosis | Sequential change diagnosis is the joint problem of detection and
identification of a sudden and unobservable change in the distribution of a
random sequence. In this problem, the common probability law of a sequence of
i.i.d. random variables suddenly changes at some disorder time to one of
finitely many alternatives. This disorder time marks the start of a new regime,
whose fingerprint is the new law of observations. Both the disorder time and
the identity of the new regime are unknown and unobservable. The objective is
to detect the regime-change as soon as possible, and, at the same time, to
determine its identity as accurately as possible. Prompt and correct diagnosis
is crucial for quick execution of the most appropriate measures in response to
the new regime, as in fault detection and isolation in industrial processes,
and target detection and identification in national defense. The problem is
formulated in a Bayesian framework. An optimal sequential decision strategy is
found, and an accurate numerical scheme is described for its implementation.
Geometrical properties of the optimal strategy are illustrated via numerical
examples. The traditional problems of Bayesian change-detection and Bayesian
sequential multi-hypothesis testing are solved as special cases. In addition, a
solution is obtained for the problem of detection and identification of
component failure(s) in a system with suspended animation.
| math.PR cs.IT math.IT math.ST stat.TH | sequential change diagnosis is the joint problem of detection and identification of a sudden and unobservable change in the distribution of a random sequence in this problem the common probability law of a sequence of iid random variables suddenly changes at some disorder time to one of finitely many alternatives this disorder time marks the start of a new regime whose fingerprint is the new law of observations both the disorder time and the identity of the new regime are unknown and unobservable the objective is to detect the regimechange as soon as possible and at the same time to determine its identity as accurately as possible prompt and correct diagnosis is crucial for quick execution of the most appropriate measures in response to the new regime as in fault detection and isolation in industrial processes and target detection and identification in national defense the problem is formulated in a bayesian framework an optimal sequential decision strategy is found and an accurate numerical scheme is described for its implementation geometrical properties of the optimal strategy are illustrated via numerical examples the traditional problems of bayesian changedetection and bayesian sequential multihypothesis testing are solved as special cases in addition a solution is obtained for the problem of detection and identification of component failures in a system with suspended animation | [['sequential', 'change', 'diagnosis', 'is', 'the', 'joint', 'problem', 'of', 'detection', 'and', 'identification', 'of', 'a', 'sudden', 'and', 'unobservable', 'change', 'in', 'the', 'distribution', 'of', 'a', 'random', 'sequence', 'in', 'this', 'problem', 'the', 'common', 'probability', 'law', 'of', 'a', 'sequence', 'of', 'iid', 'random', 'variables', 'suddenly', 'changes', 'at', 'some', 'disorder', 'time', 'to', 'one', 'of', 'finitely', 'many', 'alternatives', 'this', 'disorder', 'time', 'marks', 'the', 'start', 'of', 'a', 'new', 'regime', 'whose', 'fingerprint', 'is', 'the', 'new', 'law', 'of', 'observations', 'both', 'the', 'disorder', 'time', 'and', 'the', 'identity', 'of', 'the', 'new', 'regime', 'are', 'unknown', 'and', 'unobservable', 'the', 'objective', 'is', 'to', 'detect', 'the', 'regimechange', 'as', 'soon', 'as', 'possible', 'and', 'at', 'the', 'same', 'time', 'to', 'determine', 'its', 'identity', 'as', 'accurately', 'as', 'possible', 'prompt', 'and', 'correct', 'diagnosis', 'is', 'crucial', 'for', 'quick', 'execution', 'of', 'the', 'most', 'appropriate', 'measures', 'in', 'response', 'to', 'the', 'new', 'regime', 'as', 'in', 'fault', 'detection', 'and', 'isolation', 'in', 'industrial', 'processes', 'and', 'target', 'detection', 'and', 'identification', 'in', 'national', 'defense', 'the', 'problem', 'is', 'formulated', 'in', 'a', 'bayesian', 'framework', 'an', 'optimal', 'sequential', 'decision', 'strategy', 'is', 'found', 'and', 'an', 'accurate', 'numerical', 'scheme', 'is', 'described', 'for', 'its', 'implementation', 'geometrical', 'properties', 'of', 'the', 'optimal', 'strategy', 'are', 'illustrated', 'via', 'numerical', 'examples', 'the', 'traditional', 'problems', 'of', 'bayesian', 'changedetection', 'and', 'bayesian', 'sequential', 'multihypothesis', 'testing', 'are', 'solved', 'as', 'special', 'cases', 'in', 'addition', 'a', 'solution', 'is', 'obtained', 'for', 'the', 'problem', 'of', 'detection', 'and', 'identification', 'of', 'component', 'failures', 'in', 'a', 'system', 'with', 'suspended', 'animation']] | [-0.11029826603040704, 0.06668211420912677, -0.07381947490511127, 0.06226441195590877, -0.04484890719386427, -0.17213219674389965, 0.07329244857432947, 0.35840157567081365, -0.29481223774998777, -0.30373665811880257, 0.1556074291951568, -0.25014741419308095, -0.14042610017859597, 0.18737182459120172, -0.08917089327440215, 0.10606831276664845, 0.04338143440976059, 0.05923565892901804, -0.02047142691637737, -0.218410558543653, 0.27313748413207617, 0.0923784661025221, 0.2881280101668347, 0.023752437770358084, 0.10261420248889618, 0.03859491348330979, -0.05079272333832999, -0.0024226598429211554, -0.05556188078708775, 0.053355573057198374, 0.29191638936164194, 0.170755720435543, 0.3227754421231727, -0.3771900934712266, -0.19470963619374734, 0.10689862844564262, 0.13645871658058417, 0.10140655896613537, -0.033923512140143025, -0.2829100154554858, 0.07092900558327613, -0.15546794636454003, -0.1321075556108788, -0.04314386464166133, 0.03471496928921012, 0.004704889732473079, -0.31123114354325854, 0.08577982061499652, 0.05670342203562281, 0.04536558197776912, -0.061299531337534706, -0.0639822443578771, 0.03251784176175152, 0.165184503564963, 0.06024570443800518, 0.012954167451404791, 0.14212465147683095, -0.15269640060077305, -0.1528047308248515, 0.39018855423748083, -0.02411102876281752, -0.173131684935759, 0.18205850897142278, -0.06657594486144007, -0.17192101810011617, 0.13870508448180016, 0.18238044842167797, 0.1538058772250878, -0.1740032242962979, 0.0325118756095875, -0.00653051645258948, 0.12360413290864963, 0.0234812447921403, 0.009131355927870845, 0.17895233424483425, 0.20790259793190466, 0.07368433632279536, 0.14472225824293727, -0.10357462692241859, -0.09167318671785106, -0.30482829274922985, -0.16085077812384185, -0.19333867291374826, -0.008501378104760213, -0.09703036226801068, -0.1964550712639423, 0.3945773112720107, 0.15854804274038098, 0.1736092412874343, 0.0587523904959521, 0.3059921462457919, 0.12368667377523804, 0.00490664246959895, 0.025570434262795795, 0.20581460526936757, 0.08901330639344258, 0.08250436270909925, -0.20105076702697897, 0.150936859290755, 0.017308831954168904] |
710.4848 | A Formal Verification Methodology for Checking Data Integrity | Formal verification techniques have been playing an important role in
pre-silicon validation processes. One of the most important points considered
in performing formal verification is to define good verification scopes; we
should define clearly what to be verified formally upon designs under tests. We
considered the following three practical requirements when we defined the scope
of formal verification. They are (a) hard to verify (b) small to handle, and
(c) easy to understand. Our novel approach is to break down generic properties
for system into stereotype properties in block level and to define requirements
for Verifiable RTL. Consequently, each designer instead of verification experts
can describe properties of the design easily, and formal model checking can be
applied systematically and thoroughly to all the leaf modules. During the
development of a component chip for server platforms, we focused on RAS
(Reliability, Availability, and Serviceability) features and described more
than 2000 properties in PSL. As a result of the formal verification, we found
several critical logic bugs in a short time with limited resources, and
successfully verified all of them. This paper presents a study of the
functional verification methodology.
| cs.LO | formal verification techniques have been playing an important role in presilicon validation processes one of the most important points considered in performing formal verification is to define good verification scopes we should define clearly what to be verified formally upon designs under tests we considered the following three practical requirements when we defined the scope of formal verification they are a hard to verify b small to handle and c easy to understand our novel approach is to break down generic properties for system into stereotype properties in block level and to define requirements for verifiable rtl consequently each designer instead of verification experts can describe properties of the design easily and formal model checking can be applied systematically and thoroughly to all the leaf modules during the development of a component chip for server platforms we focused on ras reliability availability and serviceability features and described more than 2000 properties in psl as a result of the formal verification we found several critical logic bugs in a short time with limited resources and successfully verified all of them this paper presents a study of the functional verification methodology | [['formal', 'verification', 'techniques', 'have', 'been', 'playing', 'an', 'important', 'role', 'in', 'presilicon', 'validation', 'processes', 'one', 'of', 'the', 'most', 'important', 'points', 'considered', 'in', 'performing', 'formal', 'verification', 'is', 'to', 'define', 'good', 'verification', 'scopes', 'we', 'should', 'define', 'clearly', 'what', 'to', 'be', 'verified', 'formally', 'upon', 'designs', 'under', 'tests', 'we', 'considered', 'the', 'following', 'three', 'practical', 'requirements', 'when', 'we', 'defined', 'the', 'scope', 'of', 'formal', 'verification', 'they', 'are', 'a', 'hard', 'to', 'verify', 'b', 'small', 'to', 'handle', 'and', 'c', 'easy', 'to', 'understand', 'our', 'novel', 'approach', 'is', 'to', 'break', 'down', 'generic', 'properties', 'for', 'system', 'into', 'stereotype', 'properties', 'in', 'block', 'level', 'and', 'to', 'define', 'requirements', 'for', 'verifiable', 'rtl', 'consequently', 'each', 'designer', 'instead', 'of', 'verification', 'experts', 'can', 'describe', 'properties', 'of', 'the', 'design', 'easily', 'and', 'formal', 'model', 'checking', 'can', 'be', 'applied', 'systematically', 'and', 'thoroughly', 'to', 'all', 'the', 'leaf', 'modules', 'during', 'the', 'development', 'of', 'a', 'component', 'chip', 'for', 'server', 'platforms', 'we', 'focused', 'on', 'ras', 'reliability', 'availability', 'and', 'serviceability', 'features', 'and', 'described', 'more', 'than', '2000', 'properties', 'in', 'psl', 'as', 'a', 'result', 'of', 'the', 'formal', 'verification', 'we', 'found', 'several', 'critical', 'logic', 'bugs', 'in', 'a', 'short', 'time', 'with', 'limited', 'resources', 'and', 'successfully', 'verified', 'all', 'of', 'them', 'this', 'paper', 'presents', 'a', 'study', 'of', 'the', 'functional', 'verification', 'methodology']] | [-0.1156557288640499, 0.0022571543127664234, -0.0943918418651693, 0.0699524649599981, -0.09044481254744506, -0.18621953109170866, 0.05282018833643407, 0.3828643543507766, -0.26054166801946443, -0.32271432622074686, 0.1420709695525359, -0.20397993207973225, -0.10772122062309078, 0.2259206764027969, -0.10062633005892316, 0.10993966999557361, 0.033247047806129096, -0.003753588915551229, -0.03171247584195857, -0.2596559065477873, 0.26490284553384064, 0.06703754056925101, 0.29805743377951405, 0.057457672255594165, 0.04480916348083632, 0.008875260182543011, -0.024540925865362165, 0.029742245954737342, -0.11541846901961854, 0.11796745267991104, 0.32905080863249997, 0.18972627602138178, 0.3049295561427556, -0.432774917577349, -0.1576623703887755, 0.058784649546612944, 0.126952764935417, 0.07260009579399906, 0.0004234984371578321, -0.2763354795191575, 0.1432970183040385, -0.19630252296923015, -0.11638840787093002, -0.1307060945982042, 0.01561821052538497, 0.006910265732566437, -0.22062905752666728, -0.05874012968941498, 0.07879879806565229, 0.10426173609972157, -0.014561326039718494, -0.08735497157082021, 0.005978224149205421, 0.15942604692419374, 0.02040456215636657, -0.03191220150350731, 0.14408591855563735, -0.09552436099121613, -0.12907745161896975, 0.39570151337929976, -0.01406322833757032, -0.19226856067192755, 0.21797255266497217, -0.05422371373605476, -0.22541980425181685, 0.0701000126492646, 0.16509939869711787, 0.09040927261153542, -0.18883990440938053, 0.041945343150083705, 0.03455086937913346, 0.22237210053329667, 0.036014488659227496, 0.01433100418066643, 0.19675078282931022, 0.2012552068665471, 0.003502588892828614, 0.166425193609453, -0.0023713181574185867, -0.076820438747447, -0.2843428631263869, -0.19627884662803755, -0.12178848508533544, -0.01254698509108965, -0.01837189135792426, -0.1400336809111414, 0.4036625033840734, 0.21551246776013935, 0.1558644201793762, 0.057956654474967055, 0.3120055528488207, 0.0943214236093419, 0.09802060762005144, 0.05608767501655079, 0.20152372454734097, 0.06909273395304957, 0.09100111611846529, -0.1479612783936626, 0.1169888785000516, 0.029929902117512133] |
710.4849 | Laser-to-proton energy transfer efficiency in laser-plasma interactions | It is shown that the energy of protons accelerated in laser-matter
interaction experiments may be significantly increased through the process of
splitting the incoming laser pulse into multiple interaction stages of equal
intensity. From a thermodynamic point of view, the splitting procedure can be
viewed as an effective way of increasing the efficiency of energy transfer from
the laser light to protons, which peaks for processes having the least amount
of entropy gain. It is predicted that it should be possible to achieve $\apprge
100%$ increase in the energy efficiency in a six-stage laser proton accelerator
compared to a single laser-target interaction scheme.
| physics.plasm-ph physics.acc-ph | it is shown that the energy of protons accelerated in lasermatter interaction experiments may be significantly increased through the process of splitting the incoming laser pulse into multiple interaction stages of equal intensity from a thermodynamic point of view the splitting procedure can be viewed as an effective way of increasing the efficiency of energy transfer from the laser light to protons which peaks for processes having the least amount of entropy gain it is predicted that it should be possible to achieve apprge 100 increase in the energy efficiency in a sixstage laser proton accelerator compared to a single lasertarget interaction scheme | [['it', 'is', 'shown', 'that', 'the', 'energy', 'of', 'protons', 'accelerated', 'in', 'lasermatter', 'interaction', 'experiments', 'may', 'be', 'significantly', 'increased', 'through', 'the', 'process', 'of', 'splitting', 'the', 'incoming', 'laser', 'pulse', 'into', 'multiple', 'interaction', 'stages', 'of', 'equal', 'intensity', 'from', 'a', 'thermodynamic', 'point', 'of', 'view', 'the', 'splitting', 'procedure', 'can', 'be', 'viewed', 'as', 'an', 'effective', 'way', 'of', 'increasing', 'the', 'efficiency', 'of', 'energy', 'transfer', 'from', 'the', 'laser', 'light', 'to', 'protons', 'which', 'peaks', 'for', 'processes', 'having', 'the', 'least', 'amount', 'of', 'entropy', 'gain', 'it', 'is', 'predicted', 'that', 'it', 'should', 'be', 'possible', 'to', 'achieve', 'apprge', '100', 'increase', 'in', 'the', 'energy', 'efficiency', 'in', 'a', 'sixstage', 'laser', 'proton', 'accelerator', 'compared', 'to', 'a', 'single', 'lasertarget', 'interaction', 'scheme']] | [-0.08381164401866459, 0.20157927083497576, -0.12000556563091751, 0.06750518582265443, 0.003370287745158271, -0.11533940455929312, 0.051564101959661685, 0.41209771380861204, -0.3021226280212107, -0.3556444157320674, -0.005534918000230031, -0.28071679278751743, -0.021185777740239508, 0.2300555257145131, 0.024846141235810696, 0.0018865463259344053, 0.09381327536510359, 0.016450347849121777, -0.0012640354948551718, -0.19487609054275448, 0.2683064219090018, 0.1780059340658902, 0.313804419310118, 0.09838925145732441, 0.11288693687408277, -0.012045836433454757, 0.05553034814950632, -0.007066760770054442, -0.012899880760405812, 0.08195851364007017, 0.2546136491847833, 0.09619837114126376, 0.25893795155542026, -0.4219067106300061, -0.26065185201345104, 0.09534395335064648, 0.17494611159234427, 0.09745033415573842, -0.06721367256941808, -0.21337151076497124, 0.03936482990814124, -0.20519427138168622, -0.1278999314993841, -0.016613268855922292, -0.022630521045573573, 0.06939279911394167, -0.29949999673494904, 0.0212805618743509, 0.03420661653087723, -0.01606156911221471, -0.04536275210615137, -0.08148883923076757, -0.052460048587457966, 0.0760047015143872, 0.08338882555547723, 0.09369749810989245, 0.17469838979460373, -0.1199942842600775, -0.08518920756765816, 0.38895142940564614, -0.06967320204205295, -0.14438990990419198, 0.16539904621826246, -0.12877918606494912, -0.012814793154818586, 0.2436744297098479, 0.17555673133194594, 0.1087073552154816, -0.12690669766599588, 0.0049729973335962485, 0.05495039460313792, 0.20094119431306884, 0.11311248944159413, 0.04089746561758958, 0.2114249154196886, 0.19017905930038725, 0.06812238064825092, 0.14561351361606123, -0.09599786035550556, -0.0827086859268579, -0.2606649409644167, -0.15140103717740294, -0.1754893784798534, 0.07772466388420377, -0.07137238942455537, -0.054928708647200286, 0.39051292591743686, 0.15950243849201257, 0.17617196941951124, -0.055604287680229264, 0.32910654292266706, 0.17725218187828576, 0.09430739821146915, 0.02168024421697206, 0.2934632833198746, 0.09410719204887674, 0.10140781751879961, -0.24187655277126055, 0.031157515311410817, 0.0004878242656883627] |
710.485 | Hardware Support for QoS-based Function Allocation in Reconfigurable
Systems | This contribution presents a new approach for allocating suitable
function-implementation variants depending on given quality-of-service
function-requirements for run-time reconfigurable multi-device systems. Our
approach adapts methodologies from the domain of knowledge-based systems which
can be used for doing run-time hardware/software resource usage optimizations.
| cs.AR | this contribution presents a new approach for allocating suitable functionimplementation variants depending on given qualityofservice functionrequirements for runtime reconfigurable multidevice systems our approach adapts methodologies from the domain of knowledgebased systems which can be used for doing runtime hardwaresoftware resource usage optimizations | [['this', 'contribution', 'presents', 'a', 'new', 'approach', 'for', 'allocating', 'suitable', 'functionimplementation', 'variants', 'depending', 'on', 'given', 'qualityofservice', 'functionrequirements', 'for', 'runtime', 'reconfigurable', 'multidevice', 'systems', 'our', 'approach', 'adapts', 'methodologies', 'from', 'the', 'domain', 'of', 'knowledgebased', 'systems', 'which', 'can', 'be', 'used', 'for', 'doing', 'runtime', 'hardwaresoftware', 'resource', 'usage', 'optimizations']] | [-0.15393465461093, -0.02447958358679898, -0.07549272996839136, 0.022150115398108027, -0.16161551075056196, -0.243191541347187, 0.1137298917012231, 0.40453250436112287, -0.2697904551401734, -0.34835596051998435, 0.07163112134439871, -0.12779038846492768, -0.16013788572745397, 0.2754459598567337, -0.17294590619858355, 0.11890766640426591, 0.0886714496766217, -0.06331449691206217, -0.021120040351524948, -0.27525552646256984, 0.28858292256481943, 0.034086666721850636, 0.3374850262189284, 0.049956612987443805, 0.06174307361943647, 0.006746167258825153, 0.02744555629324168, -0.027786447387188672, -0.06320781339891254, 0.21519396713702008, 0.36328689344227316, 0.3021342557738535, 0.3532506747171283, -0.4246786193922162, -0.19254813904408366, 0.009490427724085749, 0.16553950391244143, 0.07276995676511433, -0.050862913916353135, -0.28319113272009416, 0.10188366523943841, -0.2533263796009123, -0.03726498081814498, -0.179326694914198, -0.06474541160278022, 0.03537903166434262, -0.30343752540647984, -0.03465540459146723, 0.009058897057548166, 0.05750435965601355, -0.07833945941529237, -0.1691903207451105, 0.08912688638665714, 0.14809305109083654, -0.022066542925313116, -0.006915620981999382, 0.21800236572744325, -0.05910075671272352, -0.2011042293335777, 0.40108032897114754, 0.03158316381741315, -0.26042179284559097, 0.19268127426039428, 0.08729482667986303, -0.22815928921918385, 0.0829928022401873, 0.28620319564361124, 0.12651150405872613, -0.23485125310253352, 0.10010041543282569, 0.09411932295188308, 0.24148163204081358, 0.05350453632418066, 0.0779917815933004, 0.1811356475809589, 0.3397063204552978, 0.13221008273540064, 0.1943870144634275, 0.016262565209763123, -0.09187129803467542, -0.24463751462171784, -0.1498985587619245, -0.20054562399163842, -0.05116648809053004, -0.08084360713837668, -0.10903459979745093, 0.41548951268196105, 0.21575263541890308, 0.04875331893563271, 0.16162287742336048, 0.4030051486101002, 0.07634427321754629, 0.13313832645071672, 0.13989527991507203, 0.055809719022363424, -0.075133663485758, 0.2047668373794295, -0.20749386471579784, 0.11134804093162529, -0.0014955878374166786] |
710.4851 | Common Reusable Verification Environment for BCA and RTL Models | This paper deals with a common verification methodology and environment for
SystemC BCA and RTL models. The aim is to save effort by avoiding the same work
done twice by different people and to reuse the same environment for the two
design views. Applying this methodology the verification task starts as soon as
the functional specification is signed off and it runs in parallel to the
models and design development. The verification environment is modeled with the
aid of dedicated verification languages and it is applied to both the models.
The test suite is exactly the same and thus it's possible to verify the
alignment between the two models. In fact the final step is to check the
cycle-by-cycle match of the interface behavior. A regression tool and a bus
analyzer have been developed to help the verification and the alignment
process. The former is used to automate the testbench generation and to run the
two test suites. The latter is used to verify the alignment between the two
models comparing the waveforms obtained in each run. The quality metrics used
to validate the flow are full functional coverage and full alignment at each IP
port.
| cs.LO | this paper deals with a common verification methodology and environment for systemc bca and rtl models the aim is to save effort by avoiding the same work done twice by different people and to reuse the same environment for the two design views applying this methodology the verification task starts as soon as the functional specification is signed off and it runs in parallel to the models and design development the verification environment is modeled with the aid of dedicated verification languages and it is applied to both the models the test suite is exactly the same and thus its possible to verify the alignment between the two models in fact the final step is to check the cyclebycycle match of the interface behavior a regression tool and a bus analyzer have been developed to help the verification and the alignment process the former is used to automate the testbench generation and to run the two test suites the latter is used to verify the alignment between the two models comparing the waveforms obtained in each run the quality metrics used to validate the flow are full functional coverage and full alignment at each ip port | [['this', 'paper', 'deals', 'with', 'a', 'common', 'verification', 'methodology', 'and', 'environment', 'for', 'systemc', 'bca', 'and', 'rtl', 'models', 'the', 'aim', 'is', 'to', 'save', 'effort', 'by', 'avoiding', 'the', 'same', 'work', 'done', 'twice', 'by', 'different', 'people', 'and', 'to', 'reuse', 'the', 'same', 'environment', 'for', 'the', 'two', 'design', 'views', 'applying', 'this', 'methodology', 'the', 'verification', 'task', 'starts', 'as', 'soon', 'as', 'the', 'functional', 'specification', 'is', 'signed', 'off', 'and', 'it', 'runs', 'in', 'parallel', 'to', 'the', 'models', 'and', 'design', 'development', 'the', 'verification', 'environment', 'is', 'modeled', 'with', 'the', 'aid', 'of', 'dedicated', 'verification', 'languages', 'and', 'it', 'is', 'applied', 'to', 'both', 'the', 'models', 'the', 'test', 'suite', 'is', 'exactly', 'the', 'same', 'and', 'thus', 'its', 'possible', 'to', 'verify', 'the', 'alignment', 'between', 'the', 'two', 'models', 'in', 'fact', 'the', 'final', 'step', 'is', 'to', 'check', 'the', 'cyclebycycle', 'match', 'of', 'the', 'interface', 'behavior', 'a', 'regression', 'tool', 'and', 'a', 'bus', 'analyzer', 'have', 'been', 'developed', 'to', 'help', 'the', 'verification', 'and', 'the', 'alignment', 'process', 'the', 'former', 'is', 'used', 'to', 'automate', 'the', 'testbench', 'generation', 'and', 'to', 'run', 'the', 'two', 'test', 'suites', 'the', 'latter', 'is', 'used', 'to', 'verify', 'the', 'alignment', 'between', 'the', 'two', 'models', 'comparing', 'the', 'waveforms', 'obtained', 'in', 'each', 'run', 'the', 'quality', 'metrics', 'used', 'to', 'validate', 'the', 'flow', 'are', 'full', 'functional', 'coverage', 'and', 'full', 'alignment', 'at', 'each', 'ip', 'port']] | [-0.08292862275444275, -0.006933786854033871, -0.0889320572652873, 0.07581181153843819, -0.0708263033112435, -0.15205109792248328, 0.015553288473581364, 0.3790513918335949, -0.2576255240140255, -0.36057414186700265, 0.13463917470178377, -0.24111425568948366, -0.08894275347060733, 0.18761819180538308, -0.03387950952354895, 0.11388325993531759, 0.08068704944607631, -0.0005872765061806659, -0.031088034851935085, -0.26103853402547633, 0.26008084404035187, 0.10363319939553585, 0.3344099867331073, 0.012297659366372593, 0.07432380667887628, 0.015977500878483514, -0.05853421781069542, -0.004834902642071437, -0.07044058148416557, 0.11294359248250305, 0.2706457611371958, 0.18750851837162652, 0.2788913525279839, -0.4167233547736292, -0.15317270603762673, 0.05800376614681635, 0.10274968683192202, 0.10525942708580037, 0.008630001698905716, -0.2822553201778127, 0.11400470120015041, -0.18452669435765176, -0.09743761112058193, -0.0310315047390759, -0.028606804156656927, 0.0045472607313541274, -0.2694011671131249, -0.04690329789787493, 0.04197700950435876, 0.047128042999693025, -0.024761098246351455, -0.06425115917605878, -0.02075276576809357, 0.21793374689343403, 0.044502901583191305, 0.048923622581594606, 0.10543960989993398, -0.09979037323827637, -0.14073715871912712, 0.4038935995527676, -0.0368297325912863, -0.2186378729675198, 0.24719240456078279, -0.05965032893095203, -0.1215148525982525, 0.06343065775641031, 0.1749275445163592, 0.08999774015200626, -0.17160200162752703, 0.039062244351062335, 0.04527795793220154, 0.19959442660792218, 0.04212119577842175, -0.08348000814249663, 0.2052732857457381, 0.19850689322421594, 0.019864210895766333, 0.16932622358269458, -0.0721726712678103, -0.0779373762004757, -0.2759186506879573, -0.17924953769293747, -0.1709914178924863, -0.06121751558563045, -0.03652771545387864, -0.11875899384577511, 0.4149866230757337, 0.19824023896885312, 0.1593856313479684, 0.08126444101086533, 0.36507243032054026, 0.07977439656886938, 0.09682249939259217, 0.054128729481409225, 0.21388432122671938, 0.08418041412380485, 0.1220247374838028, -0.21380534296266127, 0.1166467966573617, 0.026781748918512344] |
710.4852 | An Assembler Driven Verification Methodology (ADVM) | This paper presents an overview of an assembler driven verification
methodology (ADVM) that was created and implemented for a chip card project at
Infineon Technologies AG. The primary advantage of this methodology is that it
enables rapid porting of directed tests to new targets and derivatives, with
only a minimum amount of code refactoring. As a consequence, considerable
verification development time and effort was saved.
| cs.OH | this paper presents an overview of an assembler driven verification methodology advm that was created and implemented for a chip card project at infineon technologies ag the primary advantage of this methodology is that it enables rapid porting of directed tests to new targets and derivatives with only a minimum amount of code refactoring as a consequence considerable verification development time and effort was saved | [['this', 'paper', 'presents', 'an', 'overview', 'of', 'an', 'assembler', 'driven', 'verification', 'methodology', 'advm', 'that', 'was', 'created', 'and', 'implemented', 'for', 'a', 'chip', 'card', 'project', 'at', 'infineon', 'technologies', 'ag', 'the', 'primary', 'advantage', 'of', 'this', 'methodology', 'is', 'that', 'it', 'enables', 'rapid', 'porting', 'of', 'directed', 'tests', 'to', 'new', 'targets', 'and', 'derivatives', 'with', 'only', 'a', 'minimum', 'amount', 'of', 'code', 'refactoring', 'as', 'a', 'consequence', 'considerable', 'verification', 'development', 'time', 'and', 'effort', 'was', 'saved']] | [-0.11093990339173211, 0.03682122800530614, -0.08522401880916386, -0.03127741069525539, -0.09343875978615075, -0.15453332799324204, 0.038557226712342414, 0.38579752634368125, -0.24069931652278653, -0.38188896277948975, 0.14062958037746803, -0.2327587218097751, -0.1163502522709129, 0.24657718056724184, -0.10995508840174548, 0.0746698097532822, 0.1519338417916544, -0.047591669248446586, -0.020506883748263743, -0.2638140258985379, 0.22299171256877126, 0.170174697059251, 0.3027037321811631, 0.08238986498373191, 0.10023107656115104, 0.0020913642254613693, -0.06473717906527103, -0.02256694779036537, -0.08654020122914863, 0.15039715139816204, 0.2748020040019164, 0.2327838082842174, 0.35807505983208854, -0.4377832862415484, -0.1460609474914178, 0.05473565130997154, 0.11636816542447796, 0.11942306474324256, -0.1375785005308451, -0.24732500799591578, 0.09088732353189871, -0.26897031258022974, -0.12075669004300994, -0.058869184109397114, 0.0616325092694116, -0.026825081939542934, -0.25633912882398047, -0.08576789963251305, 0.05978000636345574, 0.13955886626527422, 0.004848768579817954, -0.08072719328282844, -0.0005903534428586089, 0.13273912834535753, 0.014809689539972515, 0.0905136753923245, 0.12438223679505643, -0.06877108511795836, -0.13858203903313668, 0.35368457146816784, -0.03998705395589775, -0.1015682220773121, 0.18028596427942079, -0.033167382436139245, -0.1605370102213725, 0.13489686345888507, 0.21257377186021398, 0.08895506402329793, -0.21966131396650795, 0.04278519169874637, 0.04790630803576538, 0.2568125980832274, 0.029994002706001676, -0.02172857964973128, 0.19968559249999032, 0.2577397109615424, 0.044723662954296854, 0.19578329220946347, -0.050063957995238495, -0.04041618668282079, -0.3065062646887132, -0.24922608325464857, -0.17431124784643687, -0.011449665976836094, 0.0069371536676679545, -0.14249945597516167, 0.39823020206734777, 0.16967557540666017, 0.06464627673405976, 0.024882006887642163, 0.3509138917461747, 0.046100805940416954, 0.1381499090098909, 0.061679967686474796, 0.12471902414801575, 0.059955909855604644, 0.16203352953824732, -0.1702949475046129, 0.12602133748845923, 0.030320129675110653] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.