<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/tag/stm"><title>BibSonomy bookmarks for /tag/stm</title><link>https://www.bibsonomy.org/tag/stm</link><description>BibSonomy RSS Feed for /tag/stm</description><items><rdf:Seq><rdf:li rdf:resource="https://www.aa.com.tr/en/economy/anadolu-agency-tours-state-of-the-art-turkish-uav-maker/1877808"/><rdf:li rdf:resource="https://www.forbes.com/sites/davidhambling/2020/06/17/turkish-military-to-receive-500-swarming-kamikaze-drones"/><rdf:li rdf:resource="http://www.mems-exchange.org/software/durus/"/><rdf:li rdf:resource="http://research.microsoft.com/Users/simonpj/papers/stm/beautiful.pdf"/><rdf:li rdf:resource="https://en.wikipedia.org/wiki/International_Association_of_Scientific,_Technical,_and_Medical_Publishers"/><rdf:li rdf:resource="http://www.stm-assoc.org/2013_11_11_Text_and_Data_Mining_Declaration.pdf"/><rdf:li rdf:resource="http://nbronson.github.com/scala-stm/intro.html"/><rdf:li rdf:resource="http://www.haskell.org/haskellwiki/Simple_STM_example"/><rdf:li rdf:resource="http://www.cs.otago.ac.nz/staffpriv/ok/santa/santa.erl"/><rdf:li rdf:resource="http://www.wagerlabs.com/blog/2005/12/why-i-love-hask.html"/><rdf:li rdf:resource="http://www.cs.washington.edu/homes/miker/atomcaml/"/><rdf:li rdf:resource="http://www.deepdyve.com/"/><rdf:li rdf:resource="http://jama.ama-assn.org/content/vol287/issue21/index.dtl"/><rdf:li rdf:resource="http://virtualmed.netfirms.com/internethealth/proposal0103.html"/></rdf:Seq></items></channel><item rdf:about="https://www.aa.com.tr/en/economy/anadolu-agency-tours-state-of-the-art-turkish-uav-maker/1877808"><title>Anadolu Agency tours state-of-the-art Turkish UAV maker</title><description>Turkish defense contractor STM, which produces upgraded unmanned aerial vehicles, also known as &#034;kamikaze drones,&#034; opened the doors of its manufacturing facility for the first time to Anadolu Agency. </description><link>https://www.aa.com.tr/en/economy/anadolu-agency-tours-state-of-the-art-turkish-uav-maker/1877808</link><dc:creator>grundlagen</dc:creator><dc:date>2020-06-19T18:58:24+02:00</dc:date><dc:subject>Alpagu Anadolu-Agency Kargu STM Togan Turkey kamikaze-drone swarm UAV Turkish-made </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Turkish defense contractor STM, which produces upgraded unmanned aerial vehicles, also known as &amp;#034;kamikaze drones,&amp;#034; opened the doors of its manufacturing facility for the first time to Anadolu Agency. &lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Alpagu"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Anadolu-Agency"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Kargu"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/STM"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Togan"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Turkey"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/kamikaze-drone"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/swarm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/UAV"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Turkish-made"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.forbes.com/sites/davidhambling/2020/06/17/turkish-military-to-receive-500-swarming-kamikaze-drones"><title>Turkish Military To Receive 500 Swarming Kamikaze Drones</title><description>Turkey is producing, and planning to export, advanced kamikaze drones that can operate in swarms and locate their own targets. Turkey is fast becoming leading a player in the military drone market, and Kargu could provide a significant boost.</description><link>https://www.forbes.com/sites/davidhambling/2020/06/17/turkish-military-to-receive-500-swarming-kamikaze-drones</link><dc:creator>grundlagen</dc:creator><dc:date>2020-06-19T18:19:56+02:00</dc:date><dc:subject>Forbes Kargu-2 STM Turkey face-recognition kamikaze-drone swarm UAV Turkish-made </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Turkey is producing, and planning to export, advanced kamikaze drones that can operate in swarms and locate their own targets. Turkey is fast becoming leading a player in the military drone market, and Kargu could provide a significant boost.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Forbes"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Kargu-2"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/STM"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Turkey"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/face-recognition"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/kamikaze-drone"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/swarm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/UAV"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Turkish-made"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.mems-exchange.org/software/durus/"><title>Durus</title><description></description><link>http://www.mems-exchange.org/software/durus/</link><dc:creator>bshanks</dc:creator><dc:date>2016-12-12T10:02:22+01:00</dc:date><dc:subject>Bookmarks concurrency python programming stm persistence database </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2016-12-12T10:02:22+01:00&#034; href=&#034;http://www.mems-exchange.org/software/durus/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.mems-exchange.org/software/durus/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Bookmarks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/concurrency"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/python"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/persistence"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/database"/></rdf:Bag></taxo:topics></item><item rdf:about="http://research.microsoft.com/Users/simonpj/papers/stm/beautiful.pdf"><title>Beautiful concurrency</title><description></description><link>http://research.microsoft.com/Users/simonpj/papers/stm/beautiful.pdf</link><dc:creator>bshanks</dc:creator><dc:date>2016-12-12T10:02:08+01:00</dc:date><dc:subject>Bookmarks haskell concurrent parallel stm filetype:pdf media:document </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2016-12-12T10:02:08+01:00&#034; href=&#034;http://research.microsoft.com/Users/simonpj/papers/stm/beautiful.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://research.microsoft.com/Users/simonpj/papers/stm/beautiful.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Bookmarks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/concurrent"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parallel"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/filetype:pdf"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/media:document"/></rdf:Bag></taxo:topics></item><item rdf:about="https://en.wikipedia.org/wiki/International_Association_of_Scientific,_Technical,_and_Medical_Publishers"><title>International Association of Scientific, Technical, and Medical Publishers - Wikipedia, the free encyclopedia</title><description></description><link>https://en.wikipedia.org/wiki/International_Association_of_Scientific,_Technical,_and_Medical_Publishers</link><dc:creator>droessler</dc:creator><dc:date>2015-08-29T11:35:29+02:00</dc:date><dc:subject>ngo publisher stm verlage </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2015-08-29T11:35:29+02:00&#034; href=&#034;https://en.wikipedia.org/wiki/International_Association_of_Scientific,_Technical,_and_Medical_Publishers&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://en.wikipedia.org/wiki/International_Association_of_Scientific,_Technical,_and_Medical_Publishers&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ngo"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/publisher"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/verlage"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.stm-assoc.org/2013_11_11_Text_and_Data_Mining_Declaration.pdf"><title>TEXT AND DATA MINING FOR NON-COMMERCIAL SCIENTIFIC RESEARCH</title><description>A STATEMENT OF COMMITMENT BY STM PUBLISHERS TO A ROADMAP TO ENABLE TEXT AND DATA MINING (TDM) FOR NON COMMERCIAL SCIENTIFIC RESEARCH IN THE EUROPEAN UNION
</description><link>http://www.stm-assoc.org/2013_11_11_Text_and_Data_Mining_Declaration.pdf</link><dc:creator>jaeschke</dc:creator><dc:date>2014-02-27T14:13:04+01:00</dc:date><dc:subject>data dataset publication publisher research science stm </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;A STATEMENT OF COMMITMENT BY STM PUBLISHERS TO A ROADMAP TO ENABLE TEXT AND DATA MINING (TDM) FOR NON COMMERCIAL SCIENTIFIC RESEARCH IN THE EUROPEAN UNION
&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dataset"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/publication"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/publisher"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/research"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/science"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stm"/></rdf:Bag></taxo:topics></item><item rdf:about="http://nbronson.github.com/scala-stm/intro.html"><title>ScalaSTM — Introduction</title><description></description><link>http://nbronson.github.com/scala-stm/intro.html</link><dc:creator>sac</dc:creator><dc:date>2012-08-24T11:14:12+02:00</dc:date><dc:subject>memory programming scala stm transaction </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2012-08-24T11:14:12+02:00&#034; href=&#034;http://nbronson.github.com/scala-stm/intro.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://nbronson.github.com/scala-stm/intro.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/memory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scala"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/transaction"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.haskell.org/haskellwiki/Simple_STM_example"><title>Simple STM example - HaskellWiki</title><description></description><link>http://www.haskell.org/haskellwiki/Simple_STM_example</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:11+02:00</dc:date><dc:subject>STM code concurrency haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:11+02:00&#034; href=&#034;http://www.haskell.org/haskellwiki/Simple_STM_example&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.haskell.org/haskellwiki/Simple_STM_example&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/STM"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/code"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/concurrency"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.otago.ac.nz/staffpriv/ok/santa/santa.erl"><title>totally awesome programming languages</title><description>This is an Erlang solution to &#034;The Santa Claus problem&#034;, %   as discussed by Simon Peyton Jones (with a Haskell solution using %   Software Transactional Memory) in &#034;Beautiful code&#034;. %   He quotes J.A.Trono &#034;A new exercise in concurrency&#034;, SIGCSE 26:8-10, 1994.</description><link>http://www.cs.otago.ac.nz/staffpriv/ok/santa/santa.erl</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:06+02:00</dc:date><dc:subject>0 concurrency erlang haskell pl stm </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;This is an Erlang solution to &amp;#034;The Santa Claus problem&amp;#034;, %   as discussed by Simon Peyton Jones (with a Haskell solution using %   Software Transactional Memory) in &amp;#034;Beautiful code&amp;#034;. %   He quotes J.A.Trono &amp;#034;A new exercise in concurrency&amp;#034;, SIGCSE 26:8-10, 1994.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/0"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/concurrency"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/erlang"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stm"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.wagerlabs.com/blog/2005/12/why-i-love-hask.html"><title>Tenerife Skunkworks: Why I love Haskell</title><description></description><link>http://www.wagerlabs.com/blog/2005/12/why-i-love-hask.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:43+02:00</dc:date><dc:subject>blogpost concurrency haskell stm </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:43+02:00&#034; href=&#034;http://www.wagerlabs.com/blog/2005/12/why-i-love-hask.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.wagerlabs.com/blog/2005/12/why-i-love-hask.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blogpost"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/concurrency"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stm"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.washington.edu/homes/miker/atomcaml/"><title>AtomCaml: First-Class Atomicity via Rollback</title><description>We have designed, implemented, and evaluated AtomCaml, an extension to Objective Caml that provides a synchronization primitive for atomic (transactional) execution of code. A first-class primitive function of type (unit-&gt;&#039;a)-&gt;&#039;a evaluates its argument (which may call other functions, even external C functions) as though no other thread has interleaved execution. Our design ensures fair scheduling and obstruction-freedom. Our implementation extends the Objective Caml bytecode compiler and run-time system to support atomicity. A logging-and-rollback approach lets us undo uncompleted atomic blocks upon thread pre-emption, and retry them when the thread is rescheduled. The mostly functional nature of the Caml language and the Objective Caml implementation&#039;s commitment to a uniprocessor execution model (i.e., threads are interleaved, not executed simultaneously) allow particularly efficient logging.</description><link>http://www.cs.washington.edu/homes/miker/atomcaml/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:12+02:00</dc:date><dc:subject>STM concurrency fp ocaml research transactions </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;We have designed, implemented, and evaluated AtomCaml, an extension to Objective Caml that provides a synchronization primitive for atomic (transactional) execution of code. A first-class primitive function of type (unit-&amp;gt;&amp;#039;a)-&amp;gt;&amp;#039;a evaluates its argument (which may call other functions, even external C functions) as though no other thread has interleaved execution. Our design ensures fair scheduling and obstruction-freedom. Our implementation extends the Objective Caml bytecode compiler and run-time system to support atomicity. A logging-and-rollback approach lets us undo uncompleted atomic blocks upon thread pre-emption, and retry them when the thread is rescheduled. The mostly functional nature of the Caml language and the Objective Caml implementation&amp;#039;s commitment to a uniprocessor execution model (i.e., threads are interleaved, not executed simultaneously) allow particularly efficient logging.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/STM"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/concurrency"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ocaml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/research"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/transactions"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.deepdyve.com/"><title>DeepDyve - Search for Research</title><description>DeepDyve delivers fast, easy access to the vast amounts of expert information hidden in the Deep Web. Today we&#039;re focusing in just a few subject areas including Medical and Life Sciences but we are rapidly expanding into additional markets.</description><link>http://www.deepdyve.com/</link><dc:creator>acka47</dc:creator><dc:date>2009-05-11T09:23:28+02:00</dc:date><dc:subject>STM deepweb searchengine </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;DeepDyve delivers fast, easy access to the vast amounts of expert information hidden in the Deep Web. Today we&amp;#039;re focusing in just a few subject areas including Medical and Life Sciences but we are rapidly expanding into additional markets.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/STM"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/deepweb"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/searchengine"/></rdf:Bag></taxo:topics></item><item rdf:about="http://jama.ama-assn.org/content/vol287/issue21/index.dtl"><title>JAMA -- Table of Contents (Vol. 287 No. 21, June 5, 2002)</title><description></description><link>http://jama.ama-assn.org/content/vol287/issue21/index.dtl</link><dc:creator>bibliothecaire</dc:creator><dc:date>2006-04-07T12:57:01+02:00</dc:date><dc:subject>STM recherche_validation system:imported </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-04-07T12:57:01+02:00&#034; href=&#034;http://jama.ama-assn.org/content/vol287/issue21/index.dtl&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://jama.ama-assn.org/content/vol287/issue21/index.dtl&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/STM"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recherche_validation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/system:imported"/></rdf:Bag></taxo:topics></item><item rdf:about="http://virtualmed.netfirms.com/internethealth/proposal0103.html"><title>Peer Review of Scholarly communication in health: perspectives in the Internet Age.:.Internet Health ::Journal of Research,Technology,Communication and Ethics</title><description></description><link>http://virtualmed.netfirms.com/internethealth/proposal0103.html</link><dc:creator>bibliothecaire</dc:creator><dc:date>2006-04-05T17:27:42+02:00</dc:date><dc:subject>STM recherche_validation system:imported </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-04-05T17:27:42+02:00&#034; href=&#034;http://virtualmed.netfirms.com/internethealth/proposal0103.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://virtualmed.netfirms.com/internethealth/proposal0103.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/STM"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recherche_validation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/system:imported"/></rdf:Bag></taxo:topics></item></rdf:RDF>