uu.seUppsala universitets publikasjoner
Endre søk
Begrens søket
1234567 151 - 200 of 2077
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 151. Arafailova, Ekaterina
    et al.
    Beldiceanu, Nicolas
    Douence, Rémi
    Carlsson, Mats
    Flener, Pierre
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Francisco Rodríguez, María Andreína
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Pearson, Justin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Simonis, Helmut
    Global Constraint Catalog: Volume II, time-series constraints2016Rapport (Annet vitenskapelig)
  • 152. Arafailova, Ekaterina
    et al.
    Beldiceanu, Nicolas
    Douence, Rémi
    Flener, Pierre
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Francisco Rodríguez, María Andreína
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Pearson, Justin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Simonis, Helmut
    Time-series constraints: Improvements and application in CP and MIP contexts2016Inngår i: Integration of AI and OR Techniques in Constraint Programming, Springer, 2016, s. 18-34Konferansepaper (Fagfellevurdert)
  • 153.
    Arampatzis, Avi
    et al.
    Democritus University of Thrace, Department of Electrical and Computer Engineering.
    Kalamatianos, Georgios
    Democritus University of Thrace, Department of Electrical and Computer Engineering.
    Suggesting Points-of-Interest via Content-Based, Collaborative, and Hybrid Fusion Methods in Mobile Devices2018Inngår i: ACM Transactions on Information Systems, ISSN 1046-8188, E-ISSN 1558-2868, Vol. 36, nr 3Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Recommending venues or points-of-interest (POIs) is a hot topic in recent years, especially for tourism applications and mobile users. We propose and evaluate several suggestion methods, taking an effectiveness, feasibility, efficiency and privacy perspective. The task is addressed by two content-based methods (a Weighted kNN classifier and a Rated Rocchio personalized query), Collaborative Filtering methods, as well as several (rank-based or rating-based) methods of merging results of different systems. Effectiveness is evaluated on two standard benchmark datasets, provided and used by TREC’s Contextual Suggestion Tracks in 2015 and 2016. First, we enrich these datasets with more information on venues, collected from web services like Foursquare and Yelp; we make this extra data available for future experimentation. Then, we find that the content-based methods provide state-of-the-art effectiveness, the collaborative filtering variants mostly suffer from data sparsity problems in the current datasets, and the merging methods further improve results by mainly promoting the first relevant suggestion. Concerning mobile feasibility, efficiency, and user privacy, the content-based methods, especially Rated Rocchio, are the best. Collaborative filtering has the worst efficiency and privacy leaks. Our findings can be very useful for developing effective and efficient operational systems, respecting user privacy. Last, our experiments indicate that better benchmark datasets would be welcome, and the use of additional evaluation measures-more sensitive in recall-is recommended.

  • 154.
    Araujo, Hugo
    et al.
    Univ Fed Pernambuco, Recife, PE, Brazil.
    Carvalho, Gustavo
    Univ Fed Pernambuco, Recife, PE, Brazil.
    Mohaqeqi, Morteza
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Mousavi, Mohammad Reza
    Halmstad Univ, Halmstad, Sweden;Univ Leicester, Leicester, Leics, England.
    Sampaio, Augusto
    Univ Fed Pernambuco, Recife, PE, Brazil.
    Sound conformance testing for cyber-physical systems: Theory and implementation2018Inngår i: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 162, s. 35-54Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Conformance testing is a formal and structured approach to verifying system correctness. We propose a conformance testing algorithm for cyber-physical systems, based on the notion of hybrid conformance by Abbas and Fainekos. We show how the dynamics of system specification and the sampling rate play an essential role in making sound verdicts. We specify and prove error bounds that lead to sound test-suites for a given specification and a given sampling rate. We use reachability analysis to find such bounds and implement the proposed approach using the CORA toolbox in Matlab. We apply the implemented approach on a case study from the automotive domain.

  • 155.
    Arlt, Stephan
    et al.
    Universite du Luxembourg.
    Rubio-Gonzalez, Cindy
    University of California, Berkeley.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Schäf, Martin
    SRI International.
    Shankar, Natarajan
    SRI International.
    The Gradual Verifier2014Inngår i: NASA Formal Methods: 6th International Symposium, NFM 2014, Houston, TX, USA, April 29 – May 1, 2014. Proceedings, Switzerland, 2014, s. 313-327Konferansepaper (Fagfellevurdert)
  • 156. Arlt, Stephan
    et al.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Schäf, Martin
    A theory for control-flow graph exploration2013Inngår i: Automated Technology for Verification and Analysis: ATVA 2013, Springer Berlin/Heidelberg, 2013, s. 506-515Konferansepaper (Fagfellevurdert)
  • 157. Armstrong, Alasdair
    et al.
    Struth, Georg
    Weber, Tjark
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Kleene Algebra2013Inngår i: Archive of Formal Proofs, ISSN 2150-914xArtikkel i tidsskrift (Fagfellevurdert)
  • 158. Armstrong, Alasdair
    et al.
    Struth, Georg
    Weber, Tjark
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL2013Inngår i: Interactive Theorem Proving: ITP 2013, Springer Berlin/Heidelberg, 2013, s. 197-212Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Schematic Kleene algebra with tests (SKAT) supports the equational verification of flowchart scheme equivalence and captures simple while-programs with assignment statements. We formalise SKAT in Isabelle/HOL, using the quotient type package to reason equationally in this algebra. We apply this formalisation to a complex flowchart transformation proof from the literature. We extend SKAT with assertion statements and derive the inference rules of Hoare logic. We apply this extension in simple program verification examples and the derivation of additional Hoare-style rules. This shows that algebra can provide an abstract semantic layer from which different program analysis and verification tasks can be implemented in a simple lightweight way.

  • 159.
    Aronis, Stavros
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datalogi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Effective Techniques for Stateless Model Checking2018Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    Stateless model checking is a technique for testing and verifying concurrent programs, based on exploring the different ways in which operations executed by the processes of a concurrent program can be scheduled. The goal of the technique is to expose all behaviours that can be a result of scheduling non-determinism. As the number of possible schedulings is huge, however, techniques that reduce the number of schedulings that must be explored to achieve verification have been developed. Dynamic partial order reduction (DPOR) is a prominent such technique.

    This dissertation presents a number of improvements to dynamic partial order reduction that significantly increase the effectiveness of stateless model checking. Central among these improvements are the Source and Optimal DPOR algorithms (and the theoretical framework behind them) and a technique that allows the observability of the interference of operations to be used in dynamic partial order reduction. Each of these techniques can exponentially decrease the number of schedulings that need to be explored to verify a concurrent program. The dissertation also presents a simple bounding technique that is compatible with DPOR algorithms and effective for finding bugs in concurrent programs, if the number of schedulings is too big to make full verification possible in a reasonable amount of time, even when the improved algorithms are used.

    All improvements have been implemented in Concuerror, a tool for applying stateless model checking to Erlang programs. In order to increase the effectiveness of the tool, the interference of the high-level operations of the Erlang/OTP implementation is examined, classified and precisely characterized. Aspects of the implementation of the tool are also described. Finally, a use case is presented, showing how Concuerror was used to find bugs and verify key correctness properties in repair techniques for the CORFU chain replication protocol.

    Delarbeid
    1. Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction
    Åpne denne publikasjonen i ny fane eller vindu >>Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction
    2017 (engelsk)Inngår i: Journal of the ACM, ISSN 0004-5411, E-ISSN 1557-735X, Vol. 64, nr 4, artikkel-id 25Artikkel i tidsskrift (Fagfellevurdert) Published
    Abstract [en]

    Stateless model checking is a powerful method for program verification that, however, suffers from an exponential growth in the number of explored executions. A successful technique for reducing this number, while still maintaining complete coverage, is Dynamic Partial Order Reduction (DPOR), an algorithm originally introduced by Flanagan and Godefroid in 2005 and since then not only used as a point of reference but also extended by various researchers. In this article, we present a new DPOR algorithm, which is the first to be provably optimal in that it always explores the minimal number of executions. It is based on a novel class of sets, called source sets, that replace the role of persistent sets in previous algorithms. We begin by showing how to modify the original DPOR algorithm to work with source sets, resulting in an efficient and simple-to-implement algorithm, called source-DPOR. Subsequently, we enhance this algorithm with a novel mechanism, called wakeup trees, that allows the resulting algorithm, called optimal-DPOR, to achieve optimality. Both algorithms are then extended to computational models where processes may disable each other, for example, via locks. Finally, we discuss tradeoffs of the source-and optimal-DPOR algorithm and present programs that illustrate significant time and space performance differences between them. We have implemented both algorithms in a publicly available stateless model checking tool for Erlang programs, while the source-DPOR algorithm is at the core of a publicly available stateless model checking tool for C/pthread programs running on machines with relaxed memory models. Experiments show that source sets significantly increase the performance of stateless model checking compared to using the original DPOR algorithm and that wakeup trees incur only a small overhead in both time and space in practice.

    sted, utgiver, år, opplag, sider
    Association for Computing Machinery (ACM), 2017
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-331842 (URN)10.1145/3073408 (DOI)000410615900002 ()
    Prosjekter
    UPMARCRELEASE
    Forskningsfinansiär
    EU, FP7, Seventh Framework Programme, 287510Swedish Research Council
    Tilgjengelig fra: 2017-10-18 Laget: 2017-10-18 Sist oppdatert: 2018-01-13bibliografisk kontrollert
    2. The shared-memory interferences of Erlang/OTP built-ins
    Åpne denne publikasjonen i ny fane eller vindu >>The shared-memory interferences of Erlang/OTP built-ins
    2017 (engelsk)Inngår i: Proceedings Of The 16Th Acm Sigplan International Workshop On Erlang (Erlang '17) / [ed] Chechina, N.; Fritchie, SL., New York: Association for Computing Machinery (ACM), 2017, s. 43-54Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    Erlang is a concurrent functional language based on the actor modelof concurrency. In the purest form of this model, actors are realizedby processes that do not share memory and communicate witheach other exclusively via message passing. Erlang comes quiteclose to this model, as message passing is the primary form of interprocesscommunication and each process has its own memoryarea that is managed by the process itself. For this reason, Erlangis often referred to as implementing “shared nothing” concurrency.Although this is a convenient abstraction, in reality Erlang’s mainimplementation, the Erlang/OTP system, comes with a large numberof built-in operations that access memory which is shared byprocesses. In this paper, we categorize these built-ins, and characterizethe interferences between them that can result in observabledifferences of program behaviour when these built-ins are usedin a concurrent setting. The paper is complemented by a publiclyavailable suite of more than one hundred small Erlang programsthat demonstrate the racing behaviour of these built-ins.

    sted, utgiver, år, opplag, sider
    New York: Association for Computing Machinery (ACM), 2017
    Emneord
    Actors, BEAM, Concuerror, Erlang, Scheduling nondeterminism
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-331840 (URN)10.1145/3123569.3123573 (DOI)000426922100005 ()978-1-4503-5179-9 (ISBN)
    Konferanse
    16th ACM SIGPLAN International Workshop on Erlang (Erlang), Sep 08, 2017 , Oxford, England.
    Prosjekter
    UPMARC
    Forskningsfinansiär
    Swedish Research Council
    Tilgjengelig fra: 2017-10-18 Laget: 2017-10-18 Sist oppdatert: 2018-07-03bibliografisk kontrollert
    3. Testing And Verifying Chain Repair Methods For CORFU Using Stateless Model Checking
    Åpne denne publikasjonen i ny fane eller vindu >>Testing And Verifying Chain Repair Methods For CORFU Using Stateless Model Checking
    2017 (engelsk)Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    Corfu is a distributed shared log that is designed to be scalable and reliable in the presence of failures and asynchrony. Internally, Corfu is fully replicated for fault tolerance, without sharding data or sacrificing strong consistency. In this case study, we present the modeling approaches we followed to test and verify, using Concuerror, the correctness of repair methods for the Chain Replication protocol suitable for Corfu. In the first two methods we tried, Concuerror located bugs quite fast. In contrast, the tool did not manage to find bugs in the third method, but the time this took also motivated an improvement in the tool that reduces the number of traces explored. Besides more details about all the above, we present experiences and lessons learned from applying stateless model checking for verifying complex protocols suitable for distributed programming.

    sted, utgiver, år, opplag, sider
    Cham: Springer, 2017
    Serie
    Lecture Notes in Computer Science ; 10510
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-331836 (URN)10.1007/978-3-319-66845-1_15 (DOI)978-3-319-66844-4 (ISBN)978-3-319-66845-1 (ISBN)
    Konferanse
    Integrated Formal Methods. IFM 2017
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2017-10-18 Laget: 2017-10-18 Sist oppdatert: 2018-01-13bibliografisk kontrollert
    4. Optimal dynamic partial order reduction with observers
    Åpne denne publikasjonen i ny fane eller vindu >>Optimal dynamic partial order reduction with observers
    2018 (engelsk)Inngår i: Tools and Algorithms for the Construction and Analysis of Systems: Part II, Springer, 2018, Vol. 10806, s. 229-248Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    Dynamic partial order reduction (DPOR) algorithms are used in stateless model checking (SMC) to combat the combinatorial explosion in the number of schedulings that need to be explored to guarantee soundness. The most effective of them, the Optimal DPOR algorithm, is optimal in the sense that it explores only one scheduling per Mazurkiewicz trace. In this paper, we enhance DPOR with the notion of observability, which makes dependencies between operations conditional on the existence of future operations, called observers. Observers naturally lead to a lazy construction of dependencies. This requires significant changes in the core of POR algorithms (and Optimal DPOR in particular), but also makes the resulting algorithm, Optimal DPOR with Observers, super-optimal in the sense that it explores exponentially less schedulings than Mazurkiewicz traces in some cases. We argue that observers come naturally in many concurrency models, and demonstrate the performance benefits that Optimal DPOR with Observers achieves in both an SMC tool for shared memory concurrency and a tool for concurrency via message passing, using both synthetic and actual programs as benchmarks.

    sted, utgiver, år, opplag, sider
    Springer, 2018
    Serie
    Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 10806
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-333508 (URN)10.1007/978-3-319-89963-3 _ 14 (DOI)000445822600014 ()978-3-319-89962-6 (ISBN)978-3-319-89963-3 (ISBN)
    Konferanse
    TACAS 2018, April 14–20, Thessaloniki, Greece.
    Prosjekter
    UPMARC
    Forskningsfinansiär
    Swedish Research Council
    Tilgjengelig fra: 2018-04-14 Laget: 2017-11-21 Sist oppdatert: 2019-01-07bibliografisk kontrollert
  • 160.
    Aronis, Stavros
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Jonsson, Bengt
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Lång, Magnus
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Sagonas, Konstantinos
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Optimal dynamic partial order reduction with observers2018Inngår i: Tools and Algorithms for the Construction and Analysis of Systems: Part II, Springer, 2018, Vol. 10806, s. 229-248Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Dynamic partial order reduction (DPOR) algorithms are used in stateless model checking (SMC) to combat the combinatorial explosion in the number of schedulings that need to be explored to guarantee soundness. The most effective of them, the Optimal DPOR algorithm, is optimal in the sense that it explores only one scheduling per Mazurkiewicz trace. In this paper, we enhance DPOR with the notion of observability, which makes dependencies between operations conditional on the existence of future operations, called observers. Observers naturally lead to a lazy construction of dependencies. This requires significant changes in the core of POR algorithms (and Optimal DPOR in particular), but also makes the resulting algorithm, Optimal DPOR with Observers, super-optimal in the sense that it explores exponentially less schedulings than Mazurkiewicz traces in some cases. We argue that observers come naturally in many concurrency models, and demonstrate the performance benefits that Optimal DPOR with Observers achieves in both an SMC tool for shared memory concurrency and a tool for concurrency via message passing, using both synthetic and actual programs as benchmarks.

  • 161.
    Aronis, Stavros
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Sagonas, Konstantinos
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    On using Erlang for parallelization: Experience from parallelizing Dialyzer2013Inngår i: Trends in Functional Programming, Springer Berlin/Heidelberg, 2013, s. 295-310Konferansepaper (Fagfellevurdert)
  • 162.
    Artemov, Anton G.
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Tillämpad beräkningsvetenskap.
    Rudberg, Elias
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Tillämpad beräkningsvetenskap.
    Rubensson, Emanuel H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Tillämpad beräkningsvetenskap.
    Parallelization and scalability analysis of inverse factorization using the chunks and tasks programming model2019Inngår i: Parallel Computing, ISSN 0167-8191, E-ISSN 1872-7336, Vol. 89, artikkel-id 102548Artikkel i tidsskrift (Fagfellevurdert)
  • 163.
    Asai, Ryoko
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    ICT professionalism and gender2011Inngår i: Management quality science / [ed] Hiroshi Yamashita, Tokyo: Chuokeizaisha , 2011, s. 181-184Kapittel i bok, del av antologi (Fagfellevurdert)
  • 164.
    Asai, Ryoko
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Social media as a tool for change2011Inngår i: The social impact of social computing / [ed] A. Bisset et al., Sheffield, UK: Sheffield Hallam University , 2011, s. 44-50Konferansepaper (Fagfellevurdert)
  • 165.
    Asai, Ryoko
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Människa-datorinteraktion.
    Kavathatzopoulos, Iordanis
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Människa-datorinteraktion.
    Diversity in the construction of organization value2010Inngår i: Which values for which organisations / [ed] Rusconi et al., G., 2010Konferansepaper (Fagfellevurdert)
  • 166.
    Asai, Ryoko
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Kavathatzopoulos, Iordanis
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Laaksoharju, Mikael
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    The revival of natural and cultural identity through social media2011Inngår i: The computational turn: Past, presents, futures? / [ed] Charles Ess and Ruth Hagengruber, Münster: MV-Wissenschaft , 2011, s. 329-331Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Social media has played an important role as hub for information in political change. It can contribute to the development och psychological and social preconditions for dialog and democracy.

  • 167.
    Asan, Noor Badariah
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Tekniska sektionen, Institutionen för teknikvetenskaper, Fasta tillståndets elektronik.
    Hassan, Emadeldeen
    Umea Univ, Dept Comp Sci, S-90187 Umea, Sweden;Menoufia Univ, Dept Elect & Elect Commun, Menoufia 32952, Egypt.
    Velander, Jacob
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Tekniska sektionen, Institutionen för teknikvetenskaper, Fasta tillståndets elektronik.
    Redzwan, Syaiful
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Tekniska sektionen, Institutionen för teknikvetenskaper, Fasta tillståndets elektronik.
    Noreland, Daniel
    Umea Univ, Dept Comp Sci, S-90187 Umea, Sweden.
    Blokhuis, Taco J.
    Maastricht Univ, Med Ctr, Dept Surg, NL-6229 HX Maastricht, Netherlands.
    Wadbro, Eddie
    Umea Univ, Dept Comp Sci, S-90187 Umea, Sweden.
    Berggren, Martin
    Umea Univ, Dept Comp Sci, S-90187 Umea, Sweden.
    Voigt, Thiemo
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Augustine, Robin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Tekniska sektionen, Institutionen för teknikvetenskaper, Fasta tillståndets elektronik.
    Characterization of the Fat Channel for Intra-Body Communication at R-Band Frequencies2018Inngår i: Sensors, ISSN 1424-8220, E-ISSN 1424-8220, Vol. 18, nr 9, artikkel-id 2752Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In this paper, we investigate the use of fat tissue as a communication channel between in-body, implanted devices at R-band frequencies (1.7-2.6 GHz). The proposed fat channel is based on an anatomical model of the human body. We propose a novel probe that is optimized to efficiently radiate the R-band frequencies into the fat tissue. We use our probe to evaluate the path loss of the fat channel by studying the channel transmission coefficient over the R-band frequencies. We conduct extensive simulation studies and validate our results by experimentation on phantom and ex-vivo porcine tissue, with good agreement between simulations and experiments. We demonstrate a performance comparison between the fat channel and similar waveguide structures. Our characterization of the fat channel reveals propagation path loss of similar to 0.7 dB and similar to 1.9 dB per cm for phantom and ex-vivo porcine tissue, respectively. These results demonstrate that fat tissue can be used as a communication channel for high data rate intra-body networks.

  • 168.
    Asan, Noor Badariah
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Tekniska sektionen, Institutionen för teknikvetenskaper, Fasta tillståndets elektronik.
    Velander, Jacob
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Tekniska sektionen, Institutionen för teknikvetenskaper, Fasta tillståndets elektronik.
    Redzwan, Syaiful
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Tekniska sektionen, Institutionen för teknikvetenskaper, Fasta tillståndets elektronik.
    Augustine, Robin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Tekniska sektionen, Institutionen för teknikvetenskaper, Fasta tillståndets elektronik.
    Hassan, Emadeldeen
    Department of Computing Science, Umeå University, Umeå, Sweden.
    Noreland, Daniel
    Department of Computing Science, Umeå University, Umeå, Sweden.
    Voigt, Thiemo
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Blokhuis, Taco J.
    Department of Surgery, Maastricht University Medical Center+, Maastricht, The Netherland.
    Reliability of the fat tissue channel for intra-body microwave communication2017Inngår i: 2017 IEEE Conference on Antenna Measurements & Applications (CAMA), IEEE, 2017, s. 310-313Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Recently, the human fat tissue has been proposed as a microwave channel for intra-body sensor applications. In this work, we assess how disturbances can prevent reliable microwave propagation through the fat channel. Perturbants of different sizes are considered. The simulation and experimental results show that efficient communication through the fat channel is possible even in the presence of perturbants such as embedded muscle layers and blood vessels. We show that the communication channel is not affected by perturbants that are smaller than 15 mm cube.

  • 169.
    Ashcroft, Michael
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    An Introduction To Bayesian Networks in Systems and Control2012Konferansepaper (Fagfellevurdert)
  • 170.
    Ashcroft, Michael
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Bayesian Networks in Business Analytics2012Inngår i: 2012 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2012, s. 955-961Konferansepaper (Fagfellevurdert)
  • 171.
    Ashcroft, Michael
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Performing Decision-Theoretic Inference in Bayesian Network Ensemble Models2013Inngår i: Twelfth Scandinavian Conference on Artificial Intelligence / [ed] Jaeger, M; Nielsen, TD; Viappiani, P, 2013, Vol. 257, s. 25-34Konferansepaper (Fagfellevurdert)
    Abstract [en]

    The purpose of this paper is to present a simple extension to an existing inference algorithm on influence diagrams (i.e. decision theoretic extensions to Bayesian networks) that permits these algorithms to be applied to ensemble models. The extension, though simple, is important because of the power and robustness that such ensemble models provide [1]. This paper is intended principally as a 'recipe' that can be used even by those unfamiliar with the algorithms extended. Accordingly, I present the algorithms that the original contribution builds upon in full, though references are given to less concise renditions. Those familiar with these algorithms are invited to skip the elucidation. The consequence is a useful paper with more background and less original input than usual.

  • 172.
    Ashcroft, Michael
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Using Bayesian networks in business analytics: Overview and short case study2012Inngår i: Business Informatics, ISSN 1507-3858, Vol. 3, nr 25Artikkel i tidsskrift (Fagfellevurdert)
  • 173.
    Ashcroft, Michael
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Magnani, Matteo
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Vega, Davide
    Univ Bologna, Bologna, Italy..
    Montesi, Danilo
    Univ Bologna, Bologna, Italy..
    Rossi, Luca
    IT Univ Copenhagen, Copenhagen, Denmark..
    Multilayer Analysis of Online Illicit Marketplaces2016Inngår i: 2016 European Intelligence And Security Informatics Conference (EISIC) / [ed] Brynielsson, J Johansson, F, IEEE , 2016, s. 199-199Konferansepaper (Fagfellevurdert)
  • 174. Aspelund, Olav
    et al.
    Gustafsson, Bertil
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    Finite-geometry and polarized multiple-scattering corrections of experimental fast-neutron polarization data by means of Monte Carlo methods1967Inngår i: Nuclear Instruments and Methods, ISSN 0029-554X, Vol. 57, s. 197-218Artikkel i tidsskrift (Fagfellevurdert)
  • 175.
    Asplund, Teo
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Luengo, Cris
    Flagship Biosci Inc, Westminster, CO USA.
    Thurley, Matthew
    Lulea Univ Technol, Lulea, Sweden.
    Strand, Robin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    A New Approach to Mathematical Morphology on One Dimensional Sampled Signals2016Inngår i: IEEE Proceedings, International Conference on Pattern Recognition (ICPR 2016), Cancun, Mexico, 2016, 2016Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We present a new approach to approximate continuous-domain mathematical morphology operators. The approach is applicable to irregularly sampled signals. We define a dilation under this new approach, where samples are duplicated and shifted according to the flat, continuous structuring element. We define the erosion by adjunction, and the opening and closing by composition. These new operators will significantly increase precision in image measurements. Experiments show that these operators indeed approximate continuous-domain operators better than the standard operators on sampled one-dimensional signals, and that they may be applied to signals using structuring elements smaller than the distance between samples. We also show that we can apply the operators to scan lines of a two-dimensional image to filter horizontal and vertical linear structures.

  • 176.
    Asplund, Teo
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Luengo Hendriks, Cris L.
    Thurley, Matthew J.
    Strand, Robin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Mathematical morphology on irregularly sampled data in one dimension2017Inngår i: Mathematical Morphology - Theory and Applications, ISSN 2353-3390, Vol. 2, nr 1, s. 1-24Artikkel i tidsskrift (Fagfellevurdert)
  • 177.
    Asplund, Teo
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Luengo Hendriks, Cris L.
    Flagship Biosciences Inc., Westminster, USA.
    Thurley, Matthew
    Luleå University of Technology, Luleå, Sweden.
    Strand, Robin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Mathematical Morphology on Irregularly Sampled Signals2017Inngår i: Computer Vision – ACCV 2016 Workshops. ACCV 2016, Springer, 2017, Vol. 10117, s. 506-520Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper introduces a new operator that can be used to approximate continuous-domain mathematical morphology on irregularly sampled surfaces. We define a new way of approximating the continuous domain dilation by duplicating and shifting samples according to a flat continuous structuring element. We show that the proposed algorithm can better approximate continuous dilation, and that dilations may be sampled irregularly to achieve a smaller sampling without greatly compromising the accuracy of the result.

  • 178.
    Atig, Mohamed Faouzi
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    From multi to single stack automata2010Inngår i: CONCUR 2010 – Concurrency Theory, Berlin: Springer-Verlag , 2010, s. 117-131Konferansepaper (Fagfellevurdert)
  • 179.
    Atig, Mohamed Faouzi
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Global model checking of ordered multi-pushdown systems2010Inngår i: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2010, Dagstuhl, Germany: Leibniz-Zentrum für Informatik , 2010, s. 216-227Konferansepaper (Fagfellevurdert)
  • 180.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bensalem, SaddekBliudze, SimonMonsuez, Bruno
    Verification and Evaluation of Computer and Communication Systems2018Konferanseproceedings (Annet vitenskapelig)
  • 181.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bollig, Benedikt
    CNRS, LSV, Paris, France.;ENS Paris Saclay, Paris, France.
    Habermehl, Peter
    CNRS, IRIF, Paris, France.;Univ Paris Diderot, Paris, France..
    Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete2017Inngår i: International Journal of Foundations of Computer Science, ISSN 0129-0541, Vol. 28, nr 8, s. 945-975Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    We consider ordered multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-empty stack (which implies that we assume a linear ordering on the collection of stacks). We show that the emptiness problem for multi-pushdown automata is 2ETIME-complete. Containment in 2ETIME is shown by translating an automaton into a grammar for which we can check if the generated language is empty. The lower bound is established by simulating the behavior of an alternating Turing machine working in exponential space. We also compare ordered multi-pushdown automata with the model of bounded-phase (visibly) multi-stack pushdown automata, which do not impose an ordering on stacks, but restrict the number of alternations of pop operations on different stacks.

  • 182.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bouajjani, Ahmed
    Burckhardt, Sebastian
    Musuvathi, Madanlal
    On the verification problem for weak memory models2010Inngår i: Proc. 37th ACM Symposium on Principles of Programming Languages, New York: ACM Press , 2010, s. 7-18Konferansepaper (Fagfellevurdert)
  • 183.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bouajjani, Ahmed
    Emmi, Michael
    Lal, Akash
    Detecting fair non-termination in multithreaded programs2012Inngår i: Computer Aided Verification, Berlin: Springer-Verlag , 2012, s. 210-227Konferansepaper (Fagfellevurdert)
  • 184.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bouajjani, Ahmed
    Kumar, K. Narayan
    Saivasan, Prakash
    Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding2012Inngår i: Automated Technology for Verification and Analysis: ATVA 2012, Springer Berlin/Heidelberg, 2012, s. 152-166Konferansepaper (Fagfellevurdert)
  • 185.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bouajjani, Ahmed
    Narayan Kumar, K.
    Saivasan, Prakash
    Verifying quantitative temporal properties of procedural programs2018Inngår i: 29th International Conference on Concurrency Theory, Dagstuhl, Germany: Leibniz-Zentrum für Informatik , 2018, s. 15:1-17Konferansepaper (Fagfellevurdert)
  • 186.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bouajjani, Ahmed
    Parlato, Gennaro
    Getting rid of store-buffers in TSO analysis2011Inngår i: Computer Aided Verification: CAV 2011, Berlin: Springer-Verlag , 2011, s. 99-115Konferansepaper (Fagfellevurdert)
  • 187.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bouajjani, Ahmed
    Qadeer, Shaz
    Context-bounded analysis for concurrent programs with dynamic creation of threads2011Inngår i: Logical Methods in Computer Science, ISSN 1860-5974, E-ISSN 1860-5974, Vol. 7, nr 4, s. 4:1-48Artikkel i tidsskrift (Fagfellevurdert)
  • 188.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Cassel, Sofia
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Kaati, Lisa
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Shrestha, Amendra
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Activity profiles in online social media2014Inngår i: Proc. 6th International Conference on Advances in Social Networks Analysis and Mining, IEEE Computer Society, 2014, s. 850-855Konferansepaper (Fagfellevurdert)
  • 189.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Chistikov, Dmitry
    Max Planck Inst Software Syst MPI SWS, Kaiserslautern, Germany..
    Hofman, Piotr
    Univ Paris Saclay, CNRS, LSV, St Aubin, France.;Univ Paris Saclay, ENS Cachan, St Aubin, France..
    Kumar, K. Narayan
    Chennai Math Inst, Madras, Tamil Nadu, India..
    Saivasan, Prakash
    Chennai Math Inst, Madras, Tamil Nadu, India.;Univ Kaiserslautern, Kaiserslautern, Germany..
    Zetzsche, Georg
    Univ Paris Saclay, CNRS, LSV, St Aubin, France.;Univ Paris Saclay, ENS Cachan, St Aubin, France..
    The complexity of regular abstractions of one-counter languages2016Inngår i: Proceedings Of The 31St Annual ACM-IEEE Symposium On Logic In Computer Science (LICS 2016), 2016, s. 207-216Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We study the computational and descriptional complexity of the following transformation: Given a one-counter automaton (OCA) A, construct a nondeterministic finite automaton (NFA) B that recognizes an abstraction of the language L (A) : its (1) downward closure, (2) upward closure, or (3) Parikh image. For the Parikh image over a fixed alphabet and for the upward and downward closures, we find polynomial-time algorithms that compute such an NFA. For the Parikh image with the alphabet as part of the input, we find a quasi-polynomial time algorithm and prove a completeness result: we construct a sequence of OCA that admits a polynomial-time algorithm iff there is one for all OCA. For all three abstractions, it was previously unknown whether appropriate NFA of sub-exponential size exist.

  • 190.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Ganty, Pierre
    Approximating Petri net reachability along context-free traces2011Inngår i: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2011, Dagstuhl, Germany: Leibniz-Zentrum für Informatik , 2011, s. 152-163Konferansepaper (Fagfellevurdert)
  • 191.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Habermehl, Peter
    On Yen's path logic for Petri nets2011Inngår i: International Journal of Foundations of Computer Science, ISSN 0129-0541, Vol. 22, nr 4, s. 783-799Artikkel i tidsskrift (Fagfellevurdert)
  • 192.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Kumar, K. Narayan
    Saivasan, Prakash
    Adjacent ordered multi-pushdown systems2013Inngår i: Developments in Language Theory: DLT 2013, Springer Berlin/Heidelberg, 2013, s. 58-69Konferansepaper (Fagfellevurdert)
  • 193.
    Atig, Mohamed Faouzi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Meyer, Roland
    TU Braunschweig, Germany.
    Muskalla, Sebastian
    TU Braunschweig, Germany.
    Saivasan, Prakash
    TU Braunschweig, Germany.
    On the Upward/Downward Closures of Petri Nets∗2017Inngår i: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) / [ed] Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin, Dagstuhl, Germany, 2017, Vol. 83, s. 49:1-49:14Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We study the size and the complexity of computing finite state automata (FSA) representing and approximating the downward and the upward closure of Petri net languages with coverability as the acceptance condition. We show how to construct an FSA recognizing the upward closure of a Petri net language in doubly-exponential time, and therefore the size is at most doubly exponential. For downward closures, we prove that the size of the minimal automata can be non-primitive recursive. In the case of BPP nets, a well-known subclass of Petri nets, we show that an FSA accepting the downward/upward closure can be constructed in exponential time. Furthermore, we consider the problem of checking whether a simple regular language is included in the downward/upward closure of a Petri net/BPP net language. We show that this problem is EXPSPACE-complete (resp. NP-complete) in the case of Petri nets (resp. BPP nets). Finally, we show that it is decidable whether a Petri net language is upward/downward closed.

  • 194.
    Avenel, Christophe
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Fortin, Pierre
    Gouicem, Mourad
    Zaidi, Samia
    Solving the Table Maker's Dilemma on current SIMD architectures2016Inngår i: Scalable Computing: Practice and Experience, ISSN 1895-1767, E-ISSN 1895-1767, Vol. 17, nr 3, s. 237-250Artikkel i tidsskrift (Fagfellevurdert)
  • 195.
    Axel, Lindegren
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datalogi.
    Partitioning temporal networks: A study of finding the optimal partition of temporal networks using community detection2018Independent thesis Advanced level (professional degree), 20 poäng / 30 hpOppgave
    Abstract [en]

    Many of the algorithms used for community detection in temporal networks have been adapted from static network theory. A common approach in dealing with the temporal dimension is to create multiple static networks from one temporal, based on a time condition. In this thesis, focus lies on identifying the optimal partitioning of a few temporal networks. This is done by utilizing the popular community detection algorithm called Generalized Louvain. Output of the Generalized Louvain comes in two parts. First, the created community structure, i.e. how the network is connected. Secondly, a measure called modularity, which is a scalar value representing the quality of the identified community structure. The methodology used is aimed at creating a comparable result by normalizing modularity. The normalization process can be explained in two major steps: 1) study the effects on modularity when partitioning a temporal network in an increasing number of slices. 2) study the effects on modularity when varying the number of connections (edges) in each time slice. The results show that the created methodology yields comparable results on two out of the four here tested temporal networks, implying that it might be more suited for some networks than others. This can serve as an indication that there does not exist a general model for community detection in temporal networks. Instead, the type of network is key to choosing the method.

  • 196.
    Axelsson, Anton
    et al.
    Lund University Cognitive Science.
    Anderberg, Erik
    Lund University Cognitive Science.
    Haake, Magnus
    Lund University Cognitive Science.
    Can preschoolers profit from a teachable agent based play-and-learn game in mathematics?2013Inngår i: Artificial Intelligence in Education: 16th International Conference, AIED 2013, Memphis, TN, USA, July 9-13, 2013. Proceedings / [ed] H. C. Lane, K. Yacef, J. Mostow & P. Pavlik, Springer Berlin/Heidelberg, 2013, Vol. 7926 LNAI, s. 289-298Konferansepaper (Fagfellevurdert)
    Abstract [en]

    A large number of studies carried out on pupils aged 8-14 have shown that teachable agent (TA) based games are beneficial for learning. The present pioneering study aimed to initiate research looking at whether TA based games can be used as far down as preschool age. Around the age of four, theory of mind (ToM) is under development and it is not unlikely that a fully developed ToM is necessary to benefit from a TA’s socially engaging characteristics. 10 preschool children participated in an experiment of playing a mathematics game. The participants playing a TA-version of the game engaged socially with the TA and were not disturbed by his presence. Thus, this study unveils exciting possibilities for further research of the hypothesised educational benefits in store for preschoolers with regard to play-and-learn games employing TAs. 

  • 197.
    Axelsson, Owe
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    An additive matrix preconditioning method with application for domain decomposition and two-level matrix partitionings2010Inngår i: Large-Scale Scientific Computing, Berlin: Springer-Verlag , 2010, s. 76-83Konferansepaper (Fagfellevurdert)
  • 198.
    Axelsson, Owe
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    Blaheta, Radim
    Neytcheva, Maya
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    Preconditioning of boundary value problems using elementwise Schur complements2006Rapport (Annet vitenskapelig)
  • 199.
    Axelsson, Owe
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    Blaheta, Radim
    Neytcheva, Maya
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    Preconditioning of boundary value problems using elementwise Schur complements2009Inngår i: SIAM Journal on Matrix Analysis and Applications, ISSN 0895-4798, E-ISSN 1095-7162, Vol. 31, s. 767-789Artikkel i tidsskrift (Fagfellevurdert)
  • 200. Axelsson, Owe
    et al.
    Boyanova, Petia
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    Kronbichler, Martin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    Neytcheva, Maya
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    Wu, Xunxun
    Numerical and computational efficiency of solvers for two-phase problems2012Rapport (Annet vitenskapelig)
1234567 151 - 200 of 2077
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf