Change search
Refine search result
1234567 101 - 150 of 18210
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the 'Create feeds' function.
  • 101.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Holík, Lukás
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Jonsson, Bengt
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Lengál, Ondrej
    Trinh, Cong Quy
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Vojnar, Tomás
    Verification of heap manipulating programs with ordered data by extended forest automata2016In: Acta Informatica, ISSN 0001-5903, E-ISSN 1432-0525, Vol. 53, no 4, p. 357-385Article in journal (Refereed)
    Abstract [en]

    We present a general framework for verifying programs with complex dynamic linked data structures whose correctness depends on ordering relations between stored data values. The underlying formalism of our framework is that of forest automata (FA), which has previously been developed for verification of heap-manipulating programs. We extend FA with constraints between data elements associated with nodes of the heaps represented by FA, and we present extended versions of all operations needed for using the extended FA in a fully-automated verification approach, based on abstract interpretation. We have implemented our approach as an extension of the Forester tool and successfully applied it to a number of programs dealing with data structures such as various forms of singly- and doubly-linked lists, binary search trees, as well as skip lists.

  • 102.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Holík, Lukás
    Jonsson, Bengt
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Lengál, Ondrej
    Trinh, Cong Quy
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Vojnar, Tomás
    Verification of heap manipulating programs with ordered data by extended forest automata2013In: Automated Technology for Verification and Analysis: ATVA 2013, Springer Berlin/Heidelberg, 2013, p. 224-239Conference paper (Refereed)
  • 103.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Holík, Lukás
    Kaati, Lisa
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Vojnar, Tomás
    A uniform (bi-)simulation-based framework for reducing tree automata2009In: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 251, p. 27-48Article in journal (Refereed)
  • 104.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Högberg, Johanna
    Kaati, Lisa
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Bisimulation minimization of tree automata2007In: International Journal of Foundations of Computer Science, ISSN 0129-0541, Vol. 18, no 4, p. 699-713Article in journal (Refereed)
  • 105.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Jonsson, Bengt
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Model checking of systems with many identical timed processes2003In: Theoretical Computer Science, ISSN 0304-3975, Vol. 290, no 1, p. 241-264Article in journal (Refereed)
  • 106.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Jonsson, Bengt
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Nilsson, Marcus
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    D'Orso, Julien
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Regular Model Checking made Simple and Efficient2002In: CONCUR 2002: Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings, 2002, p. 116-130Conference paper (Refereed)
  • 107.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Kaati, Lisa
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Högberg, Johanna
    Bisimulation Minimization of Tree Automata2006In: Implementation and Application of Automata, Berlin: Springer-Verlag , 2006, p. 173-185Conference paper (Refereed)
  • 108.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Krcal, Pavel
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    R-automata2008In: CONCUR 2008 - Concurrency Theory / [ed] VanBreugel F; Chechik M, Berlin: Springer-Verlag , 2008, p. 67-81Conference paper (Refereed)
    Abstract [en]

    We introduce R-automata - finite state machines which operate on a finite number of unbounded counters. The values of the counters can be incremented, reset to zero, or left unchanged along the transitions. R-automata can be, for example, used to model systems with resources (modeled by the counters) which are consumed in small parts but which can be replenished at once. We define the language accepted by an R-automaton relative to a natural number D as the set of words allowing a run along which no counter value exceeds D. As the main result, we show decidability of the universality problem, i.e., the problem whether there is a number D such that the corresponding language is universal. We present a proof based on finite monoids and the factorization forest theorem. This theorem was applied for distance automata in [12] - a special case of R-automata with one counter which is never reset. As a second technical contribution, we extend the decidability result to R-automata with Buchi acceptance conditions.

  • 109.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Krcal, Pavel
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Sampled semantics of timed automata2010In: Logical Methods in Computer Science, ISSN 1860-5974, E-ISSN 1860-5974, Vol. 6, no 3, p. 14:1-37Article in journal (Refereed)
  • 110.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Krcal, Pavel
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Sampled universality of timed automata2007In: Foundations of Software Science and Computational Structures, Proceedings / [ed] Seidl, H, 2007, p. 2-16Conference paper (Refereed)
    Abstract [en]

    Timed automata can be studied in not only a dense-time setting but also a discrete-time setting. The most common example of discrete-time semantics is the so called sampled semantics (i.e., discrete semantics with a fixed time granularity epsilon). In the real-time setting, the universality problem is known to be undecidable for timed automata. In this work, we study the universality question for the languages accepted by timed automata with sampled semantics. On the negative side, we show that deciding whether for all sampling periods epsilon a timed automaton accepts all timed words in epsilon-sampled semantics is as hard as in the real-time case, i.e., undecidable. On the positive side, we show that checking whether there is a sampling period such that a timed automaton accepts all untimed words in epsilon-sampled semantics is decidable. Our proof uses clock difference relations, developed to characterize the reachability relation for timed automata in connection with sampled semantics.

  • 111.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Krcal, Pavel
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Universality of R-automata with value copying2009In: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 239, p. 131-141Article in journal (Refereed)
  • 112.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Leino, K. Rustan M.
    Tools for software verification: Introduction to the special section from the seventeenth international conference on tools and algorithms for the construction and analysis of systems2013In: International Journal on Software Tools for Technology Transfer (STTT), ISSN 1385-4879, E-ISSN 1571-8115, Vol. 15, no 2, p. 85-88Article, review/survey (Refereed)
  • 113. Abdulla, Parosh Aziz
    et al.
    Leino, Rustan
    TACAS'2011, 17th International ConferenceTools and Algorithms for the Construction and Analysis of Systems.2011Conference proceedings (editor) (Refereed)
  • 114.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Mayr, Richard
    Priced timed Petri nets2013In: Logical Methods in Computer Science, ISSN 1860-5974, E-ISSN 1860-5974, Vol. 9, no 4, p. 10:1-51Article in journal (Refereed)
  • 115.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Mayr, Richard
    Sangnier, Arnaud
    Sproston, Jeremy
    Solving parity games on integer vectors2013In: CONCUR 2013 – Concurrency Theory, Springer Berlin/Heidelberg, 2013, p. 106-120Conference paper (Refereed)
  • 116.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Richard, Mayr
    Computing Optimal Coverability Costs in Priced Timed Petri Nets2011In: LICS'2011, Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011, p. 399-408Conference paper (Refereed)
    Abstract [en]

    We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on the ages of tokens. Our cost model assigns token storage costs per time unit to places, and firing costs to transitions. We study the cost to reach a given control-state. In general, a cost-optimal run may not exist. However, we show that the infimum of the costs is computable.

  • 117.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Richard, Mayr
    Petri Nets with Time and Cost2012Conference paper (Refereed)
  • 118.
    Abdulla, Parosh
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    Ben Henda, Noomene
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    Mayr, Richard
    Sandberg, Sven
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datalogi.
    Eager Markov Chains: Eager Markov Chains2006In: Proceedings of the fourth international symposium on Automated Technology for Verification and Analysis (ATVA), 2006, p. 24-38Conference paper (Refereed)
    Abstract [en]

    We consider infinite-state discrete Markov chains which are eager:

    the probability of avoiding a defined set of final states for more than n steps is bounded by some exponentially decreasing function f(n).

    We prove that eager Markov chains include those induced by Probabilistic Lossy Channel Systems, Probabilistic Vector Addition Systems with States, and Noisy Turing Machines, and that the bounding function f(n) can be effectively constructed for them.

    Furthermore, we study the problem of computing the expected reward (or cost) of runs until reaching the final states, where rewards are assigned to individual runs by computable reward functions.

    For eager Markov chains, an effective path exploration scheme,

    based on forward reachability analysis, can be used to approximate the expected reward up-to an arbitrarily small error.

  • 119.
    Abdulla, Parosh
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Deneux, Johann
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Mahata, Pritha
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Multi-Clock Timed Networks2004In: LICS'2004, 18th IEEE Int. Symp. on Logic in Computer Science, 2004Conference paper (Refereed)
  • 120.
    Abdulla, Parosh
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Deneux, Johann
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Mahata, Pritha
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Open, Closed and Robust Timed Networks.2004In: CONCUR 2004 -- Concurrency Theory: 15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings, 2004, p. 529-Conference paper (Refereed)
  • 121.
    Abdulla, Parosh
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Iyer, Purushothaman
    Nylén, Aletta
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    SAT-solving the Coverability Problem for Unbounded Petri Nets2004In: Formal methods in system design, ISSN 0925-9856, E-ISSN 1572-8102, Vol. 24, no 1, p. 25-43Article in journal (Refereed)
  • 122.
    Abdulla, Parosh
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Jonsson, Bengt
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Nilsson, Marcus
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    d'Orso, Julien
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Saksena, Mayank
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Regular model checking for LTL(MSO)2012In: International Journal on Software Tools for Technology Transfer (STTT), ISSN 1385-4879, E-ISSN 1571-8115, Vol. 14, no 2, p. 223-241Article in journal (Refereed)
    Abstract [en]

    Regular model checking is a form of symbolic model checking for parameterized and infinite-state systems whose states can be represented as words of arbitrary length over a finite alphabet, in which regular sets of words are used to represent sets of states. We present LTL(MSO), a combination of the logics MSO and LTL as a natural logic for expressing temporal properties to be verified in regular model checking. In other words, LTL(MSO) is a natural specification language for both the system and the property under consideration. LTL(MSO) is a two-dimensional modal logic, where MSO is used for specifying properties of system states and transitions, and LTL is used for specifying temporal properties.  In addition, the first-order quantification in MSO can be used to express properties parameterized on a position or process.  We give a technique for model checking LTL(MSO), which is adapted from the automata-theoretic approach: a formula is translated to a Buechi regular transition system with a regular set of accepting states, and regular model checking techniques are used to search for models. We have implemented the technique, and show its application to a number of parameterized algorithms from the literature.

  • 123.
    Abdulla, Parosh
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Mahata, Pritha
    Datorteknik.
    Mayr, Richard
    Decidability of Zenoness, Token Liveness, and Boundedness for Dense-Timed Petri Nets.2004In: FSTTCS' 04: 24th Conference on Foundations of Software Technology and Theoretical Computer Science, 2004Conference paper (Refereed)
  • 124.
    Abdullah, Jakaria
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Mohaqeqi, Morteza
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Synthesis of Ada code from graph-based task models2017In: Proc. 32nd ACM Symposium on Applied Computing, New York: ACM Press, 2017, p. 1467-1472Conference paper (Refereed)
  • 125.
    Abdullah, Syed Md Jakaria
    Mälardalen University, School of Innovation, Design and Engineering.
    Virtual Clustered-based Multiprocessor Scheduling in Linux Kernel2013Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Recent advancements of multiprocessor architectures have led to increasing use of multiprocessors in real-time embedded systems. The two most popular real-time scheduling approaches in multiprocessors are global and partitioned scheduling. Cluster based multiprocessor scheduling can be seen as a hybrid approach combining benefits of both partitioned and global scheduling. Virtual clustering further enhances it by providing dynamic cluster resource allocation duringrun-time and applying hierarchical scheduling to ensure temporal isolation between different software components. Over the years, the study of virtual clustered-based multiprocessor scheduling has been limited to theoretical analysis. In this thesis, we implemented a Virtual-Clustered Hierarchical Scheduling Framework (VC-HSF) in Linux without modifying the base Linux kernel. This work includes complete design, implementation and experimentation of this framework in a multiprocessor platform. Our main contributions are twofold: (i) to the best of our knowledge, our work is the first implementation of any virtual-clustered real-time multiprocessor scheduling in an operating system, (ii) our design and implementation gives practical insights about challenges of implementing any virtual-clustered algorithms for real-time scheduling.

  • 126.
    Abdullah, Syed Md Jakaria
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Lampka, Kai
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Improving performance by monitoring while maintaining worst-case guarantees2016In: Proc. 19th Conference on Design, Automation and Test in Europe, Piscataway, NJ: IEEE, 2016, p. 257-260Conference paper (Refereed)
  • 127.
    Abdullahi, Abdille
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Component-based Software development2008Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Component-based Software development is a promising way to improve quality, time to market and handle the increasing complexity of software management. However, The component-based development is still a process with many problems, it is not well de_ned either from theoretical or practical point of view. This thesis gives a brief overview of Component-Based Software development and starts with brief historical evolution followed by a general explanation of the method. A detailed discussion of the underlying principles like components, component framework and compent system architecture are then presented. Some real world component stadards such as .net framework, CORBA CCM and EJB are given in detail. Finally, simple fille-sharing-program based on Apache's Avalon framework and another one based on .net framework are developed as a case study.

  • 128.
    Abedan Kondori, Farid
    et al.
    Umeå University, Faculty of Science and Technology, Department of Applied Physics and Electronics.
    Yousefi, Shahrouz
    KTH Royal Institute of Technology, Department of Media Technology and Interaction Design.
    Liu, Li
    Umeå University, Faculty of Science and Technology, Department of Applied Physics and Electronics.
    Li, Haibo
    KTH Royal Institute of Technology, Department of Media Technology and Interaction Design.
    Head operated electric wheelchair2014In: IEEE Southwest Symposium on Image Analysis and Interpretation (SSIAI 2014), IEEE , 2014, p. 53-56Conference paper (Refereed)
    Abstract [en]

    Currently, the most common way to control an electric wheelchair is to use joystick. However, there are some individuals unable to operate joystick-driven electric wheelchairs due to sever physical disabilities, like quadriplegia patients. This paper proposes a novel head pose estimation method to assist such patients. Head motion parameters are employed to control and drive an electric wheelchair. We introduce a direct method for estimating user head motion, based on a sequence of range images captured by Kinect. In this work, we derive new version of the optical flow constraint equation for range images. We show how the new equation can be used to estimate head motion directly. Experimental results reveal that the proposed system works with high accuracy in real-time. We also show simulation results for navigating the electric wheelchair by recovering user head motion.

  • 129.
    Abedin, Md Reaz Ashraful
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Bensch, Suna
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Hellström, Thomas
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Self-supervised language grounding by active sensing combined with Internet acquired images and text2017In: Proceedings of the Fourth International Workshop on Recognition and Action for Scene Understanding (REACTS2017) / [ed] Jorge Dias George Azzopardi, Rebeca Marf, Málaga: REACTS , 2017, p. 71-83Conference paper (Refereed)
    Abstract [en]

    For natural and efficient verbal communication between a robot and humans, the robot should be able to learn names and appearances of new objects it encounters. In this paper we present a solution combining active sensing of images with text based and image based search on the Internet. The approach allows the robot to learn both object name and how to recognise similar objects in the future, all self-supervised without human assistance. One part of the solution is a novel iterative method to determine the object name using image classi- fication, acquisition of images from additional viewpoints, and Internet search. In this paper, the algorithmic part of the proposed solution is presented together with evaluations using manually acquired camera images, while Internet data was acquired through direct and reverse image search with Google, Bing, and Yandex. Classification with multi-classSVM and with five different features settings were evaluated. With five object classes, the best performing classifier used a combination of Pyramid of Histogram of Visual Words (PHOW) and Pyramid of Histogram of Oriented Gradient (PHOG) features, and reached a precision of 80% and a recall of 78%.

  • 130.
    Abedin, Md. Zainal
    et al.
    University of Science and Technology Chittagong.
    Chowdhury, Abu Sayeed
    University of Science and Technology Chittagong.
    Hossain, Mohammad Shahadat
    University of Chittagong, Bangladesh.
    Andersson, Karl
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Karim, Razuan
    University of Science and Technology Chittagong.
    An Interoperable IP based WSN for Smart Irrigation Systems2017Conference paper (Refereed)
    Abstract [en]

    Wireless Sensor Networks (WSN) have been highly developed which can be used in agriculture to enable optimal irrigation scheduling. Since there is an absence of widely used available methods to support effective agriculture practice in different weather conditions, WSN technology can be used to optimise irrigation in the crop fields. This paper presents architecture of an irrigation system by incorporating interoperable IP based WSN, which uses the protocol stacks and standard of the Internet of Things paradigm. The performance of fundamental issues of this network is emulated in Tmote Sky for 6LoWPAN over IEEE 802.15.4 radio link using the Contiki OS and the Cooja simulator. The simulated results of the performance of the WSN architecture presents the Round Trip Time (RTT) as well as the packet loss of different packet size. In addition, the average power consumption and the radio duty cycle of the sensors are studied. This will facilitate the deployment of a scalable and interoperable multi hop WSN, positioning of border router and to manage power consumption of the sensors.

  • 131.
    Abedin, Md. Zainal
    et al.
    University of Science and Technology, Chittagong.
    Paul, Sukanta
    University of Science and Technology, Chittagong.
    Akhter, Sharmin
    University of Science and Technology, Chittagong.
    Siddiquee, Kazy Noor E Alam
    University of Science and Technology, Chittagong.
    Hossain, Mohammad Shahadat
    University of Chittagong, Bangladesh.
    Andersson, Karl
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Selection of Energy Efficient Routing Protocol for Irrigation Enabled by Wireless Sensor Networks2017In: Proceedings of 2017 IEEE 42nd Conference on Local Computer Networks Workshops, Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2017, p. 75-81Conference paper (Refereed)
    Abstract [en]

    Wireless Sensor Networks (WSNs) are playing remarkable contribution in real time decision making by actuating the surroundings of environment. As a consequence, the contemporary agriculture is now using WSNs technology for better crop production, such as irrigation scheduling based on moisture level data sensed by the sensors. Since WSNs are deployed in constraints environments, the life time of sensors is very crucial for normal operation of the networks. In this regard routing protocol is a prime factor for the prolonged life time of sensors. This research focuses the performances analysis of some clustering based routing protocols to select the best routing protocol. Four algorithms are considered, namely Low Energy Adaptive Clustering Hierarchy (LEACH), Threshold Sensitive Energy Efficient sensor Network (TEEN), Stable Election Protocol (SEP) and Energy Aware Multi Hop Multi Path (EAMMH). The simulation is carried out in Matlab framework by using the mathematical models of those algortihms in heterogeneous environment. The performance metrics which are considered are stability period, network lifetime, number of dead nodes per round, number of cluster heads (CH) per round, throughput and average residual energy of node. The experimental results illustrate that TEEN provides greater stable region and lifetime than the others while SEP ensures more througput.

  • 132.
    Abenius, Erik
    KTH, Superseded Departments, Numerical Analysis and Computer Science, NADA.
    Time-Domain Inverse Electromagnetic Scattering using FDTD and Gradient-based Minimization2004Licentiate thesis, monograph (Other scientific)
    Abstract [en]

    The thesis addresses time-domain inverse electromagneticscattering for determining unknown characteristics of an objectfrom observations of the scattered .eld. Applications includenon-destructive characterization of media and optimization ofmaterial properties, for example the design of radar absorbingmaterials.A nother interesting application is the parameteroptimization of subcell models to avoid detailed modeling ofcomplex geometries.

    The inverse problem is formulated as an optimal controlproblem where the cost function to be minimized is thedi.erence between the estimated and observed .elds, and thecontrol parameters are the unknown object characteristics. Theproblem is solved in a deterministic gradient-basedoptimization algorithm using a parallel 2D FDTD scheme for thedirect problem.This approach is computationally intensive sincethe direct problem needs to be solved in every optimizationiteration in order to compute an estimated .eld.H ighlyaccurate analytical gradients are computed from the adjointformulation.In addition to giving better accuracy than .nitedi.erences, the analytical gradients also have the advantage ofonly requiring one direct and one adjoint problem to be solvedregardless of the number of parameters.

    When absorbing boundary conditions are used to truncate thecomputational domain, the equations are non-reversible and theentire time-history of the direct solution needs to be storedfor the gradient computation.Ho wever, using an additionaldirect simulation and a restart procedure it is possible tokeep the storage at an acceptable level.

    The inverse method has been successfully applied to a widerange of industrial problems within the European project,IMPACT (Inverse Methods for Wave Propagation Applications inTime-Domain).T he results presented here includecharacterization of layered dispersive media, determination ofparameters in subcell models for thin sheets and narrow slotsand optimization problems where the observed .eld is given bydesign objectives.

  • 133. Abenius, Erik
    et al.
    Andersson, Ulf
    Edelvik, Fredrik
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Numerical Analysis.
    Eriksson, Lasse
    Ledfelt, Gunnar
    Hybrid time domain solvers for the Maxwell equations in 2D2002In: International Journal for Numerical Methods in Engineering, ISSN 0029-5981, E-ISSN 1097-0207, Vol. 53, p. 2185-2199Article in journal (Refereed)
  • 134.
    Abenius, Erik
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Numerical Analysis.
    Edelvik, Fredrik
    Thin Sheet Modeling Using Shell Elements in the Finite-Element Time-Domain Method2006In: IEEE Transactions on Antennas and Propagation, ISSN 0018-926X, E-ISSN 1558-2221, Vol. 54, p. 28-34Article in journal (Refereed)
  • 135.
    Abenius, Erik
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Numerical Analysis.
    Johansson, Christer
    A General Approach for Time-Domain Simulation of Waveguides in 3D2004In: Proc. EMB 04, Computational Electromagnetics: Methods and Applications, Göteborg, Sweden: Department of Electromagnetics, Chalmers University of Technology , 2004, p. 220-226Conference paper (Other academic)
  • 136.
    Abenius, Erik
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Numerical Analysis.
    Johansson, Christer
    Modeling of inhomogeneous waveguides using hybrid methods2005Manuscript (preprint) (Other academic)
  • 137.
    Abenius, Erik
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Numerical Analysis.
    Strand, Bo
    Solving inverse electromagnetic problems using FDTD and gradient-based minimization2006In: International Journal for Numerical Methods in Engineering, ISSN 0029-5981, E-ISSN 1097-0207, Vol. 68, p. 650-673Article in journal (Refereed)
  • 138. Abenius, Erik
    et al.
    Strand, Bo
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Numerical Analysis.
    Alestra, Stephane
    Inverse Electromagnetic Scattering Using the Finite-Difference Time-Domain Method2000In: Proc. Millennium Conference on Antennas and Propagation, Noordwijk, The Netherlands: ESA Publications , 2000, p. 4-Conference paper (Refereed)
  • 139.
    Abensour Sellström, Gabriel
    et al.
    KTH, School of Computer Science and Communication (CSC).
    Runefelt Tõnisson, Meidi
    KTH, School of Computer Science and Communication (CSC).
    Analysis of Voting Algorithms: a comparative study of the Single Transferable Vote.2012Independent thesis Advanced level (professional degree), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    A voting system is defined as a procedure through which political power is distributed among candidates - from the ballot box to the parliament. This essay specifically seeks to contrast the Single Transferable Vote system with two other voting algorithms (Modified Sainte-Laguë and First-Past-The-Post), by constructing Java implementations of the algorithms and running example data through them. Thus, the suitability of a possible real-life implementation of the Single Transferable Vote method in a Swedish parliament context is evaluated. Furthermore, an alternative version of the original STV method which has been modified to fit these conditions is suggested. The effects of such an implementation on election outcomes are not entirely conclusive, and the conclusion is that more research is needed before a definite evaluation can be made.

  • 140.
    Abghari, Shahrooz
    et al.
    Blekinge Institute of Technology, School of Computing.
    Kazemi, Samira
    Blekinge Institute of Technology, School of Computing.
    Open Data for Anomaly Detection in Maritime Surveillance2012Independent thesis Advanced level (degree of Master (Two Years))Student thesis
    Abstract [en]

    Context: Maritime Surveillance (MS) has received increased attention from a civilian perspective in recent years. Anomaly detection (AD) is one of the many techniques available for improving the safety and security in the MS domain. Maritime authorities utilize various confidential data sources for monitoring the maritime activities; however, a paradigm shift on the Internet has created new sources of data for MS. These newly identified data sources, which provide publicly accessible data, are the open data sources. Taking advantage of the open data sources in addition to the traditional sources of data in the AD process will increase the accuracy of the MS systems. Objectives: The goal is to investigate the potential open data as a complementary resource for AD in the MS domain. To achieve this goal, the first step is to identify the applicable open data sources for AD. Then, a framework for AD based on the integration of open and closed data sources is proposed. Finally, according to the proposed framework, an AD system with the ability of using open data sources is developed and the accuracy of the system and the validity of its results are evaluated. Methods: In order to measure the system accuracy, an experiment is performed by means of a two stage random sampling on the vessel traffic data and the number of true/false positive and negative alarms in the system is verified. To evaluate the validity of the system results, the system is used for a period of time by the subject matter experts from the Swedish Coastguard. The experts check the detected anomalies against the available data at the Coastguard in order to obtain the number of true and false alarms. Results: The experimental outcomes indicate that the accuracy of the system is 99%. In addition, the Coastguard validation results show that among the evaluated anomalies, 64.47% are true alarms, 26.32% are false and 9.21% belong to the vessels that remain unchecked due to the lack of corresponding data in the Coastguard data sources. Conclusions: This thesis concludes that using open data as a complementary resource for detecting anomalous behavior in the MS domain is not only feasible but also will improve the efficiency of the surveillance systems by increasing the accuracy and covering some unseen aspects of maritime activities.

  • 141.
    Abi-Haidar, Layal
    University of Skövde, School of Informatics.
    Realtidsgenomsökning efter säkerhetsrisker i JavaScript-kod2015Independent thesis Basic level (degree of Bachelor), 15 credits / 22,5 HE creditsStudent thesis
    Abstract [sv]

    Syftet med detta arbete är att undersöka om det är möjligt att kunna i realtid undersöka kod på en webbsida för att rekommendera uppdatering av en befintlig webbläsare vid behov, utan att användarupplevelsen påverkas negativt. För att undersöka detta implementerades ett program i JavaScript. Sex olika JavaScript-bibliotek användes som testfall. Programmet söker igenom koden som finns i ett JavaScript-bibliotek och gör en rekommendation med hänsyn till några kända säkerhetsrisker och försvar mot dem. Dessutom beräknar programmet svarstiden med hjälp av klockan på klientsidan.

    Enligt Tolia, Andersen och Satyanarayanan (2006) visar undersökningar som har gjorts att användare föredrar svarstider som är under en sekund, och att svarstider som är över en sekund kan få användarna att bli missnöjda. För att användarupplevelsen inte skall påverkas negativt, bör svarstiden inte överstiga en sekund.

    Resultaten från undersökningen visar att svarstiderna inte blir tillräckligt långa för att kunna påverka användarupplevelsen negativt.

  • 142.
    Aboode, Adam
    KTH, School of Electrical Engineering and Computer Science (EECS).
    Anomaly Detection in Time Series Data Based on Holt-Winters Method2018Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    In today's world the amount of collected data increases every day, this is a trend which is likely to continue. At the same time the potential value of the data does also increase due to the constant development and improvement of hardware and software. However, in order to gain insights, make decisions or train accurate machine learning models we want to ensure that the data we collect is of good quality. There are many definitions of data quality, in this thesis we focus on the accuracy aspect.

    One method which can be used to ensure accurate data is to monitor for and alert on anomalies. In this thesis we therefore suggest a method which, based on historic values, is able to detect anomalies in time series as new values arrive. The method consists of two parts, forecasting the next value in the time series using Holt-Winters method and comparing the residual to an estimated Gaussian distribution.

    The suggested method is evaluated in two steps. First, we evaluate the forecast accuracy for Holt-Winters method using different input sizes. In the second step we evaluate the performance of the anomaly detector when using different methods to estimate the variance of the distribution of the residuals. The results indicate that the suggested method works well most of the time for detection of point anomalies in seasonal and trending time series data. The thesis also discusses some potential next steps which are likely to further improve the performance of this method.

  • 143.
    Abou Zliekha, M.
    et al.
    Damascus University/Faculty of Information Technology.
    Al Moubayed, Samer
    Damascus University/Faculty of Information Technology.
    Al Dakkak, O.
    Higher Institute of Applied Science and Technology (HIAST).
    Ghneim, N.
    Higher Institute of Applied Science and Technology (HIAST).
    Emotional Audio-Visual Arabic Text to Speech2006In: Proceedings of the XIV European Signal Processing Conference (EUSIPCO), Florence, Italy, 2006Conference paper (Refereed)
    Abstract [en]

    The goal of this paper is to present an emotional audio-visual. Text to speech system for the Arabic Language. The system is based on two entities: un emotional audio text to speech system which generates speech depending on the input text and the desired emotion type, and un emotional Visual model which generates the talking heads, by forming the corresponding visemes. The phonemes to visemes mapping, and the emotion shaping use a 3-paramertic face model, based on the Abstract Muscle Model. We have thirteen viseme models and five emotions as parameters to the face model. The TTS produces the phonemes corresponding to the input text, the speech with the suitable prosody to include the prescribed emotion. In parallel the system generates the visemes and sends the controls to the facial model to get the animation of the talking head in real time.

  • 144.
    Abrahamsson, Charlotte
    et al.
    Blekinge Institute of Technology, School of Engineering, Department of Systems and Software Engineering.
    Wessman, Mattias
    Blekinge Institute of Technology, School of Engineering, Department of Systems and Software Engineering.
    WLAN Security: IEEE 802.11b or Bluetooth - which standard provides best security methods for companies?2004Independent thesis Basic level (degree of Bachelor)Student thesis
    Abstract [en]

    Which security holes and security methods do IEEE 802.11b and Bluetooth offer? Which standard provides best security methods for companies? These are two interesting questions that this thesis will be about. The purpose is to give companies more information of the security aspects that come with using WLANs. An introduction to the subject of WLAN is presented in order to give an overview before the description of the two WLAN standards; IEEE 802.11b and Bluetooth. The thesis will give an overview of how IEEE 802.11b and Bluetooth works, a in depth description about the security issues of the two standards will be presented, security methods available for companies, the security flaws and what can be done in order to create a secure WLAN are all important aspects to this thesis. In order to give a guidance of which WLAN standard to choose, a comparison of the two standards with the security issues in mind, from a company's point of view is described. We will present our conclusion which entails a recommendation to companies to use Bluetooth over IEEE 802.11b, since it offers better security methods.

  • 145.
    Abrahamsson, Claes
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Videokompression och användarnytta2007Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [sv]

    Digital video är ett område som expanderat kraftigt senaste åren. På grund av avancerade videokompressionsmetoder kan numera en hel långfilm rymmas på mobiltelefonen eller den handhållna videospelaren. Men hur fungerar videokompression och hur hårt kan man komprimera en viss filmsekvens med bibehållen användarnytta? I denna uppsats görs en genomgång för grunderna inom videokompression. Dess förhållande till användarnyttan undersöks genom ett experiment. I detta experiment testas tre videosekvenser komprimerade med tre olika kodekar i tre olika datahastigheter för tre olika experimentgrupper. Slutsatsen av

    denna studie är att det är svårt att hitta en exakt brytpunkt där användaren finner videokvaliteten oacceptabel. Dock kan det konstateras att den högsta datahastigheten(256 kbit/s) genererar hög användarnytta medan den lägsta datahastigheten genererar låg användarnytta. Mellanhastigheten 128 kbit/s får knappt godkänt av testpersonerna.

  • 146.
    Abrahamsson, Emil
    University of Gävle, Department of Mathematics, Natural and Computer Sciences.
    Digitalt arkiv2008Student paper second term, 10 points / 15 hpStudent thesis
    Abstract [sv]

    Grunden för detta arbete har varit att förenkla hantering och sökning bland ritningar och förteckningar i ett ritningsarkiv. Lösningen har blivit ett webbaserat datasystem som bygger på en databas där all information lagras och är sökbar. Resultatet har blivit ett system som man oavsett var man befinner sig inom företagets nätverk ha tillgång till alla ritningar och förteckningar på ett snabbt och effektivt sätt.

  • 147.
    Abrahamsson, Jimmy
    Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
    Nätverksoptimering: Bästa möjliga tillgänglighet till lägsta möjliga länkkostnad2012Independent thesis Basic level (university diploma), 5 credits / 7,5 HE creditsStudent thesis
    Abstract [sv]

    Denna uppsats behandlar nätverksoptimering, med fokus på att få fram den bästa möjliga tillgängligheten till lägsta möjliga kostnad, i form av länkar. I studien tas en teoretiskt grundad hypotes om en metod fram för att lösa detta problemet. Samt genomförs ett test där metoden appliceras på ett studieobjekt för att bekräfta huruvida metoden verkar fungerar eller inte.

    Resultatet blir slutligen en metod som genom att analysera tillgängligheten, länk redundansen samt beräkna antal oberoende vägar mellan noder i ett nätverk. Kan genom att jämföra resultat från före en förändring med resultat från efter en förändring lyfta fram de förändringar som medför förbättringar. Varpå ett nätverk kan optimeras till bästa möjliga tillgänglighet till lägsta möjliga kostnad, i form av länkar.

  • 148. Abrahamsson, M.
    et al.
    Sundberg, Johan
    KTH, School of Computer Science and Communication (CSC), Speech, Music and Hearing, TMH, Music Acoustics.
    Subglottal pressure variation in actors’ stage speech2007In: Voice and Gender Journal for the Voice and Speech Trainers Association / [ed] Rees, M., VASTA Publishing , 2007, p. 343-347Chapter in book (Refereed)
  • 149.
    Abrishambaf, Reza
    et al.
    Department of Engineering Technology, Miami University, Hamilton, OH.
    Bal, Mert
    Department of Engineering Technology, Miami University, Hamilton, OH.
    Vyatkin, Valeriy
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Distributed home automation system based on IEC61499 function blocks and wireless sensor networks2017In: Proceedings of the IEEE International Conference on Industrial Technology, Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2017, p. 1354-1359, article id 7915561Conference paper (Refereed)
    Abstract [en]

    In this paper, a distributed home automation system will be demonstrated. Traditional systems are based on a central controller where all the decisions are made. The proposed control architecture is a solution to overcome the problems such as the lack of flexibility and re-configurability that most of the conventional systems have. This has been achieved by employing a method based on the new IEC 61499 function block standard, which is proposed for distributed control systems. This paper also proposes a wireless sensor network as the system infrastructure in addition to the function blocks in order to implement the Internet-of-Things technology into the area of home automation as a solution for distributed monitoring and control. The proposed system has been implemented in both Cyber (nxtControl) and Physical (Contiki-OS) level to show the applicability of the solution

  • 150. Abu Bakar, Sakhinah
    et al.
    Taheri, Javid
    The University of Sydney, Australia.
    Zomaya, Albert
    The University of Sydney, Sydney, Australia.
    Characterization of essential proteins in proteins interaction networks2013In: Journal of Quality Measurement and Analysis, ISSN 1823-5670, Vol. 9, no 2, p. 11-26Article in journal (Refereed)
1234567 101 - 150 of 18210
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf