uu.seUppsala universitets publikasjoner
Endre søk
Begrens søket
1234567 151 - 200 of 5630
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.
    Ahlbom, Viktoria
    et al.
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Språkvetenskapliga fakulteten, Institutionen för lingvistik.
    Sågvall Hein, Anna
    Test Suites Covering the Functional Specifications of the Sub-components of the Swedish Prototype1999Inngår i: Working Papers in Computational Linguistics & Language Engineering;13, ISSN 1401-923X, nr 13, s. 28-Artikkel i tidsskrift (Annet vitenskapelig)
  • 152.
    Ahlgren, Bengt
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för datorteknik. Swedish Institute of Computer Science.
    Improving Computer Communication Performance by Reducing Memory Bandwidth Consumption1997Doktoravhandling, med artikler (Annet vitenskapelig)
  • 153.
    Ahlgren, Bengt
    et al.
    SICS .
    Björkman, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Gunningberg, Per
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Towards predictable ILP performance controlling communication buffer cache effects1996Inngår i: Australian Computer Journal, ISSN 0004-8917, Vol. 28, nr 2, s. 66-71Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Cache memory behaviour is becoming more and more important as the speed of CPUs is increasing faster than the speed of memories. The operation of caches are statistical which means that the system level performance becomes unpredictable. In this paper we

  • 154. Ahlin, Anders
    et al.
    Bark, Carina
    Jansson, Anders
    Malmlöf, Peter
    Knutsson, B
    Persson, L
    Carlqvist, B
    Kjebon, J
    GMMS 3.0: Handbok för utformning av användargränssnitt1997Bok (Annet vitenskapelig)
  • 155. Ahmed, Laeeq
    et al.
    Georgiev, Valentin
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Farmaceutiska fakulteten, Institutionen för farmaceutisk biovetenskap.
    Capuccini, Marco
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Farmaceutiska fakulteten, Institutionen för farmaceutisk biovetenskap. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Tillämpad beräkningsvetenskap.
    Toor, Salman
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Tillämpad beräkningsvetenskap.
    Schaal, Wesley
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Farmaceutiska fakulteten, Institutionen för farmaceutisk biovetenskap.
    Laure, Erwin
    Spjuth, Ola
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Farmaceutiska fakulteten, Institutionen för farmaceutisk biovetenskap.
    Efficient iterative virtual screening with Apache Spark and conformal prediction2018Inngår i: Journal of Cheminformatics, ISSN 1758-2946, E-ISSN 1758-2946, Vol. 10, artikkel-id 8Artikkel i tidsskrift (Fagfellevurdert)
  • 156.
    Aho, Milja
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap.
    Optimisation of Ad-hoc analysis of an OLAP cube using SparkSQL2017Independent thesis Advanced level (professional degree), 20 poäng / 30 hpOppgave
    Abstract [en]

    An Online Analytical Processing (OLAP) cube is a way to represent a multidimensional database. The multidimensional database often uses a star schema and populates it with the data from a relational database. The purpose of using an OLAP cube is usually to find valuable insights in the data like trends or unexpected data and is therefore often used within Business intelligence (BI). Mondrian is a tool that handles OLAP cubes that uses the query language MultiDimensional eXpressions (MDX) and translates it to SQL queries. Apache Kylin is an engine that can be used with Apache Hadoop to create and query OLAP cubes with an SQL interface. This thesis investigates whether the engine Apache Spark running on a Hadoop cluster is suitable for analysing OLAP cubes and what performance that can be expected. The Star Schema Benchmark (SSB) has been used to provide Ad-Hoc queries and to create a large database containing over 1.2 billion rows. This database was created in a cluster in the Omicron office consisting of five worker nodes and one master node. Queries were then sent to the database using Mondrian integrated into the BI platform Pentaho. Amazon Web Services (AWS) has also been used to create clusters with 3, 6 and 15 slaves to see how the performance scales. Creating a cube in Apache Kylin on the Omicron cluster was also tried, but was not possible due to the cluster running out of memory. The results show that it took between 8.2 to 11.9 minutes to run the MDX queries on the Omicron cluster. On both the Omicron cluster and the AWS cluster, the SQL queries ran faster than the MDX queries. The AWS cluster ran the queries faster than the Omicron cluster, even though fewer nodes were used. It was also noted that the AWS cluster did not scale linearly, neither for the MDX nor the SQL queries.

    Fulltekst (pdf)
    fulltext
  • 157.
    Ahrenberg, Lars and Merkel, Magnus and Ridings, Daniel and Sågvall Hein, Anna and Tiedemann, Jörg
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Språkvetenskapliga fakulteten, Institutionen för lingvistik.
    Automatic processing of parallel corpora: A Swedish perspective.1999Rapport (Annet vitenskapelig)
    Abstract [en]

    As empirical methods have come to the fore in language technology and translation studies, the processing of parallel texts and parallel corpora have become a major issue. In this article we review the state of the art in alignment and data extraction tec

  • 158.
    Ahrenberg, Lars
    et al.
    Linköping University, Sweden.
    Megyesi, BeátaUppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Språkvetenskapliga fakulteten, Institutionen för lingvistik och filologi.
    Proceedings of the Workshop on NLP and Pseudonymisation2019Konferanseproceedings (Fagfellevurdert)
    Fulltekst (pdf)
    fulltext
  • 159. Ahrenberg, Lars
    et al.
    Merkel, Magnus
    Sågvall Hein, Anna
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Språkvetenskapliga fakulteten, Institutionen för lingvistik.
    Tiedemann, Jörg
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Språkvetenskapliga fakulteten, Institutionen för lingvistik.
    Evaluation of LWA and UWA1999Rapport (Annet vitenskapelig)
  • 160.
    Aiesh, Basel
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Centrum för bildanalys.
    Measurement of dispersion barriers through SEM images2015Independent thesis Advanced level (professional degree), 20 poäng / 30 hpOppgave
    Abstract [en]

    In this thesis digital image analysis is applied to Scanning Electron Microscope imagesof dispersion barriers to measure specific properties. The thin barriers are used asprotection for paperboard packaging and are made of polymers and fillers. The orientation, area, length and density distributions of the fillers determine the functionality and quality of the barrier. Methods built on image analysis tools are developed with the objective to measure these quantities. Input for the methods are Scanning Electron Microscope images showing the cross-section of the barriers. To make the images relevant for the methods they are preprocessed by reducing noise and distinguishing fillers from the background.

    For measuring the orientation distribution of the fillers two different methods are implemented and compared. The first one is based on a structure tensor and the other one applies a covariance matrix. The structure tensor is preferable because of its flexibility and better performance for complex images. The area and length distributions are measured by applying mathematical morphology together withsoft-clipping. The density distribution is obtained by filtering the underlying image twice with a uniform filter which creates a heat map.

    The developed methods are evaluated by applying them on fabricated binary test images with known properties. The methods are very accurate when applied on simple test images but for more complex test images with greater variation the accuracy decreases. However, for most applications the results are still on an acceptable level.

    Fulltekst (pdf)
    fulltext
  • 161.
    Ajawatanawong, Pravech
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Biologiska sektionen, Institutionen för organismbiologi, Systematisk biologi.
    Atkinson, Gemma C.
    Watson-Haigh, Nathan S.
    MacKenzie, Bryony
    Baldauf, Sandra L.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Biologiska sektionen, Institutionen för organismbiologi, Systematisk biologi.
    SeqFIRE: a web application for automated extraction of indel regions and conserved blocks from protein multiple sequence alignments2012Inngår i: Nucleic Acids Research, ISSN 0305-1048, E-ISSN 1362-4962, Vol. 40, nr W1, s. W340-W347Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Analyses of multiple sequence alignments generally focus on well-defined conserved sequence blocks, while the rest of the alignment is largely ignored or discarded. This is especially true in phylogenomics, where large multigene datasets are produced through automated pipelines. However, some of the most powerful phylogenetic markers have been found in the variable length regions of multiple alignments, particularly insertions/deletions (indels) in protein sequences. We have developed Sequence Feature and Indel Region Extractor (SeqFIRE) to enable the automated identification and extraction of indels from protein sequence alignments. The program can also extract conserved blocks and identify fast evolving sites using a combination of conservation and entropy. All major variables can be adjusted by the user, allowing them to identify the sets of variables most suited to a particular analysis or dataset. Thus, all major tasks in preparing an alignment for further analysis are combined in a single flexible and user-friendly program. The output includes a numbered list of indels, alignments in NEXUS format with indels annotated or removed and indel-only matrices. SeqFIRE is a user-friendly web application, freely available online at www.seqfire.org/.

    Fulltekst (pdf)
    fulltext
  • 162.
    Akbarian Tari, Saman
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi.
    Svensson, Therése
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi.
    Investigation of a method to extend the use of output data from Scania's Hardware-In-the-Loop simulations: Development of database and search algorithm2014Independent thesis Advanced level (professional degree), 20 poäng / 30 hpOppgave
    Abstract [en]

    In the automotive industry, Hardware-In-the-Loop (HIL) laboratories are used for testing vehicle functions and systems. Swedish heavy truck manufacturer Scania recently upgraded its HIL lab resulting in an opportunity to save all data generated by simulations in the HIL lab for post analysis. Thus, Scania wished to investigate the possibility to extend the use of output data by examining a new test method. The new test method was intended to be used for disclosing a type of error that had not been possible to detect prior to the upgraded HIL lab. The proposed test method was to store tests in a database and to run the tests upon output data generated in the HIL lab. The tests which were to be stored in the database existed as scripts written in the programming language Python. In order to insert tests into the database the data had to be extracted from the Python test scripts. The investigation showed the database test method to be feasible in small scale for some test scripts but the results also indicated weaknesses with the method’s setup. Insertion of data, extracted from test scripts, into a relational database showed to be problematic as the data was highly heterogeneous and did not fit easily into relational tables. For future implementations it is suggested that the method incorporates other information sources complementing the test scripts.

    Fulltekst (pdf)
    fulltext
  • 163.
    Al Nahas, Beshr
    et al.
    Swedish Institute of Computer Science.
    Duquennoy, Simon
    Swedish Institute of Computer Science.
    Iyer, Venkatraman
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Voigt, Thiemo
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Low-Power Listening Goes Multi-Channel2014Inngår i: 2014 IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING IN SENSOR SYSTEMS (IEEE DCOSS 2014), 2014, s. 2-9Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Exploiting multiple radio channels for communicationhas been long known as a practical way to mitigateinterference in wireless settings. In Wireless Sensor Networks,however, multichannel solutions have not reached their fullpotential: the MAC layers included in TinyOS or the ContikiOS for example are mostly single-channel. The literature offersa number of interesting solutions, but experimental results wereoften too few to build confidence. We propose a practical extensionof low-power listening, MiCMAC, that performs channel hopping,operates in a distributed way, and is independent of upper layersof the protocol stack. The above properties make it easy todeploy in a variety of scenarios, without any extra configuration/scheduling/channelselection hassle. We implement our solutionin Contiki and evaluate it in a 97-node testbed while runninga complete, out-of-the-box low-power IPv6 communication stack(UDP/RPL/6LoWPAN). Our experimental results demonstrateincreased resilience to emulated WiFi interference (e.g., data yieldkept above 90% when ContikiMAC drops in the 40% range). In noiseless environments, MiCMAC keeps the overhead low incomparison to ContikiMAC, achieving performance as high as 99% data yield along with sub-percent duty cycle and sub-secondlatency for a 1-minute inter-packet interval data collection.

  • 164.
    Alaya, Cheikh Faouzi
    et al.
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informationsvetenskap.
    Cramariuc, Bogdan
    Reynaud, Carole
    Quinghong, Meng
    Dragos-Adrian, Badea
    Hnich, Brahim
    Gabbouj, Moncef
    Kerminen, Petteri
    Makinen, Timo
    MUVIS: A System for Content-Based Indexing and Retrieval in Large Image1999Inngår i: Proceedings of the Conference on Storage and Retrieval for Image and Video Databases VII, SPIE PRESS, USA , 1999, Vol. 3656, nr VII, s. 98-106Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Until recently, collections of digital images were stored in classical databases and indexed by keywords entered by a human operator. This is not longer practical, due to the growing size of these collections. Moreover, the keywords associated with an ima

  • 165.
    Albert, Michael
    et al.
    Univ Otago, Dept Comp Sci, Dunedin, New Zealand.
    Holmgren, Cecilia
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Analys och sannolikhetsteori.
    Johansson, Tony
    Stockholm Univ, Dept Math, Stockholm, Sweden.
    Skerman, Fiona
    Masaryk Univ, Fac Informat, Brno, Czech Republic.
    Embedding Small Digraphs and Permutations in Binary Trees and Split Trees2020Inngår i: Algorithmica, ISSN 0178-4617, E-ISSN 1432-0541, Vol. 82, nr 3, s. 589-615Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of inversions in randomly labelled trees (Cai et al. in Combin Probab Comput 28(3):335-364, 2019). We consider complete binary trees as well as random split trees a large class of random trees of logarithmic height introduced by Devroye (SIAM J Comput 28(2):409-432, 1998. 10.1137/s0097539795283954). Split trees consist of nodes (bags) which can contain balls and are generated by a random trickle down process of balls through the nodes. For complete binary trees we show that asymptotically the cumulants of the number of occurrences of a fixed permutation in the random node labelling have explicit formulas. Our other main theorem is to show that for a random split tree, with probability tending to one as the number of balls increases, the cumulants of the number of occurrences are asymptotically an explicit parameter of the split tree. For the proof of the second theorem we show some results on the number of embeddings of digraphs into split trees which may be of independent interest.

    Fulltekst (pdf)
    FULLTEXT01
  • 166.
    Al-Chalabi, Mustafa
    et al.
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informatik och media.
    Bahram, Lawand
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informatik och media.
    The Digital Transformation of the Swedish Banking Industry: A study on the digitalisation of Swedish banks and how it affects their perspective on customer experience2018Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    Abstract [en]

    The Swedish banking industry has long been at the forefront when it comes to digital leadership. Currently, this industry is starting to fall behind other industries, and a closer look at the industry reveals that niche banks are having less trouble with adapting new technologies than bigger banks. There are a lot of studies on specific digitalisation areas within banking but nothing comprehensive about the strategies required for digital transformation within the banking industry. As the research area is new, there is little previous research on digital transformation by today’s standards. Therefore, the centralquestion in this thesis is “What do respondents in the Swedish banking industry think that the most important factors of digitalisation for customer experience are and what the consequences of digitalisation might be?” to find out what affects the digital strategies of a sample of Swedish banks. To answer the research question, semi-structured interviews with relevant profiles in the banking industry dealing with digitalisation and strategy at a management level were conducted.

    The interviews were conducted with five respondents from four different banks. In combination of this research method, the research strategy Case Study was implemented. The results revealed that digitalisation is in high focus amongst all the responding banks, for various reasons. The reasons can be seen as roughly divided into two categories, internal reasons and external reasons. The internal reasons have to do with streamlining current internal processes and creating more available resources for other projects. The external reasons were all towards improving customer experience. To improve customer experience, personalisation of the digital products and services is a key factor. However, personalisation is not without risk, as it may fail to be personalised enough for the banks’ customers if the personalisation is attempted towards a too wide customer segment.

    Some of the banks are operating 100% digitally, meaning that they do not have any physical bank offices for customers to visit, and thus all their work then becomes in one way or another digital work. The banking and finance industry is continually changing, and legal factors play a significant role. Not only do these legal factors affect how banks work internally, they also affect the competitiveness of the various actors and with it, how much digitalisation can affect. The thesis concludes that digital transformation is heavily influencing the strategies of banks in the Swedish banking industry through customer needs, competition and legal factors.

    Fulltekst (pdf)
    fulltext
  • 167.
    Aldmour, Ismat
    et al.
    Al Baha University, Saudi Arabia.
    Nylén, Aletta
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Impact of cultural and language background on learning Computer Science concepts2014Inngår i: Proc. 2nd International Conference on Learning and Teaching in Computing and Engineering, Los Alamitos, CA: IEEE Computer Society, 2014, s. 37-40Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Computer science terminology is generally based on words that have a related original meaning in English and rooted in western tradition. Hence, students from other cultures and students that are not native English speakers, will not be helped by language and culture in understanding computer science concepts. In this work, the authors review the interrelationship between language, cultural background, and the learning of computer science. A comparative study is under preparation in which this relationship is to be examined. The study will compare the intuitive understanding of computer science concepts between Saudi student groups of different English language proficiency levels and of different maturity levels. A test has been designed in order to reveal differences in the perception of computer science concepts that can be attributed to such background differences. The study will serve as a starting point for further work on how computer science education can be enhanced for students that are non-native English speakers.

  • 168.
    Alemayehu, Brook
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för systemteknik.
    Johnsons, Fredrik
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för systemteknik.
    Maskininlärning inom kommersiella fastigheter: Prediktion av framtida hyresvakanser2018Independent thesis Advanced level (professional degree), 20 poäng / 30 hpOppgave
    Abstract [en]

    The purpose of this thesis is to investigate the possibilities of predicting vacancies in the real estate market by using machine learning models in terms of classification. These models were mainly based on data from contracts between a Swedish real estate company and their tenants. Attributes such as annual renting cost and rental area for each contract were supplemented with additional data regarding financial and geographical information about the tenants. The data was stored in three different formats with the first having binary classes which aim is to predict if the tenant is moving out within a year or more. The format of the second and third version were both multi classification problems that aims to classify if the tenants might terminate their contract within a specific interval with the length of three and six months.

    Based on the results from Microsoft Azure Machine Learning Studio, it is discovered that the multi classification problems perform rather poorly due to the classes being unbalanced. Regarding the  performance of the binary model, a more satisfying result was obtained but not to the extend to say that the model can be used to determine a vacancy with high accuracy. It should rather be used as a risk analysis tool to detect if a tenant is showing tendencies that could result in a future vacancy. A major pitfall of this thesis was the lack of data and the financial information not being specific enough. The performance of the models will likely increase with a larger dataset and more accurate financial information. 

    Fulltekst (pdf)
    fulltext
  • 169. Alemu, Atelach
    et al.
    Hulth, Anette
    Megyesi, Beata
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Språkvetenskapliga fakulteten, Institutionen för lingvistik och filologi. Datorlingvistik.
    General-Purpose Text Categorization Applied to the Medical Domain.2007Rapport (Annet vitenskapelig)
    Abstract [en]

    This paper presents work where a general-purpose text categorization method was applied to categorize medical free-texts. The purpose of the experiments was to examine how such a method performs without any domain-specific knowledge, hand-crafting or tuning. Additionally, we compare the results from the general-purpose method with results from runs in which a medical thesaurus as well as automatically extracted keywords were used when building the classifiers. We show that standard text categorization techniques using stemmed unigrams as the basis for learning can be applied directly to categorize medical reports, yielding an F-measure of 83.9, and outperforming the more sophisticated methods.

  • 170. Alenljung, Beatrice
    et al.
    Lindblom, Jessica
    Andreasson, Rebecca
    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.
    Ziemke, Tom
    User experience in social human–robot interaction2017Inngår i: International Journal of Ambient Computing and Intelligence (IJACI), ISSN 1941-6237, E-ISSN 1941-6245, Vol. 8, nr 2, s. 12-31Artikkel i tidsskrift (Fagfellevurdert)
  • 171.
    Alex, Johan
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för människa-datorinteraktion.
    Business Navigator: Användarcentrerad utveckling av framtidens internetbank2010Independent thesis Advanced level (professional degree), 20 poäng / 30 hpOppgave
    Abstract [en]

    This thesis deals with an iterative user-centered IT-development project in a bank setting. The aim is to present a solution for deployment of future Internet banking for small businesses. The project features a design of IT-related concepts and ideas with a strong emphasis on scenario-based design and the usage of patterns as a documentation tool.

    The project plan featured an iterative framework and was carried out by a group of designers in collaboration with a reference group representing the future users of the system. This group consisted of company managers and bank employees, all from the small town of Åtvidaberg in Sweden.

    The method used in the development process was Scrum. A total of three sprints were completed with user meetings at the end of every sprint. In these meetings, focus groups were utilized to obtain information from the users. Throughout the process patterns were used to document important concepts and ideas as well as to create project outlines. In meetings with the reference group there was extensive usage of scenario based design.

    The outcome of the project was a prototype demonstrating some of the desired functions in the future software as well as a large pattern map showing the entire project as a whole with all the concepts and ideas that were discovered during the process.

    Patterns were successfully used for documentation as well as development and helped to enhance the communication within the group of designers. Also, scenario based design worked well in the context to bridge the gap between developers and users throughout the project.

    Fulltekst (pdf)
    BusinessNavigator
  • 172. Alexander, Perry
    et al.
    Flener, PierreUppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Teknisk-naturvetenskapliga fakulteten, Biologiska sektionen, Institutionen för ekologi och evolution, Datalogi. CSD.
    Special Issue on ASE'002003Collection/Antologi (Annet vitenskapelig)
  • 173. Alexander, Sylvia
    et al.
    Amillo, June
    Roger, Boyle
    Martyn, Clark
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Datorteknik.
    Laxer, Cary
    Loose, Ken
    Case studies in admission to and early performance in computer science degrees2003Inngår i: ACM SIGCSE Bulletin, ISSN 0097-8418, Vol. 35, nr 4, s. 149-153Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Changing conditions for teaching increase our motivation to understand the teaching and learning process. First time investigators of educational settings often feel uncertain about what aspects are involved and how to design a meaningful investigation. This paper develops and describes an applied research model with the ob jective of providing computer science (CS) academics of with a structured overview of the inter-disciplinary research components of CS education research.

    The paper argues that adopting such a model has the potential to enhance the maturity, significance and applicability of CS education research studies by placing them in a more complete research context. This helps to make the outcomes more readily transportable to other teaching and learning situations.

    One aim of publicizing the model is to help inspire the growing numbers of people who are becoming interested in CS education research. In addition we hope to simplify the task of gaining a rapid understanding of the research design issues and options that are typically involved.

  • 174.
    Alghamdi, Fayiq
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi. Al-Baha University .
    Why Computer Science teachers in Saudi Arabia Learn on Their Own: Impulse for Self-Directed Professional Development in CS teachingManuskript (preprint) (Annet vitenskapelig)
    Abstract [en]

    The research investigates the self-directed learning of CS teaching among Computer Science (CS) teachers in Saudi Arabia schools as a way of their professional development. The researchers developed a questionnaire with a 42-items inspiring from the previous literature and the purpose of the research question: How CS teachers were influenced by self-directed professional development in CS teaching? The questionnaires evaluated by the virtual honesty, Factor analysis and Alpha-Cronbach. Then, it distributed to 16 education offices and responses were received from 352 participants. The data shows that CS female teachers are more engaged in self-directed learning than CS male teachers. Also, the participants agreed on the total of average scores of the survey on learners’ self-directedness in the workplaces and self- reflection, planning, reasons and professional development for CS teachers. The recommendation made supported the CS teaching internet material recourses and make them easy and accessibility for all CS teachers community.

  • 175.
    Alghamdi, Fayiq
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi. Al-Baha University, Al Baha, Saudi Arabia.
    Why do female students choose to study CS in the Kingdom of Saudi Arabia?2017Inngår i: Proc. 5th International Conference on Learning and Teaching in Computing and Engineering, IEEE Computer Society, 2017, s. 49-53Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We know that female students in computer science, CS, are fewer than male students in Western countries. What is not well understood is the high rate of Saudi female students in CS. This article explores why female students choose to study CS in the Kingdom of Saudi Arabia, KSA. Data was collected through structured interviews with ten female students in three different universities in the KSA. The content analysis approach was used. This study determines the students' experiences in studying CS. The findings of this study are a first step in paying more attention to the system of women's education in the KSA. Motivation and expectation regarding CS were investigated. Results showed that the reasons behind the engagement of Saudi female students in CS are government support, family influence, and a stable workplace. The results could help to improve the CS curriculum and program of preparation for CS teachers in the KSA.

    Fulltekst (pdf)
    fulltext
  • 176.
    Alghamdi, Fayiq
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Women in computing in Saudi Arabia2016Inngår i: Proc. 3rd ACM-W Europe Celebration of Women in Computing, 2016, , s. 4s. 1-3Konferansepaper (Annet vitenskapelig)
    Fulltekst (pdf)
    fulltext
  • 177.
    Alghamdi, Fayiq
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Nylén, Aletta
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Pears, Arnold
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Changing the Educational Epistemologies of Computer Science Teachers: A Case Study of the Kingdom of Saudi Arabia2018Inngår i: 2018 IEEE Frontiers in Education Conference (FIE), Piscataway, NJ: IEEE, 2018Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper explores the attitudes of Computer Sci- ence (CS) teachers in the Kingdom of Saudi Arabia (KSA) who are confronted by the Saudi Teaching Competencies Standards (STCS). The STCS is a response to a substantial need to develop both subject-specific pedagogical ability as well as teachers subject area knowledge. The Ministry of Education in the KSA is encouraging teachers to improve their practices to achieve the new quality requirements for education. This paper presents the results of an investigation of CS teachers’ views on educational belief changes in the KSA schools. The paper addresses how and why CS teachers adopt new educational beliefs in their teaching. The paper presents the results of the investigation of the CS teachers views on educational belief changes in the KSA schools and the STCS policy document guidelines. Research in the area of changing educational epistemology in teaching CS identifies six factors that influence teachers, these are personal pedagogical beliefs, peer learning, curriculum, self-directed learning, student feedback and the STCS. A mixed method study approach was adopted in this work. Content analysis has been applied to the interview transcript and thematic coding analysis to the government policy document (STCS). The results provide a valuable case study in the KSA and emphasize the weak relationship between educational epistemology change and the STCS norms. The findings show that the STCS should provide stronger guidance for CS teachers to keep changing beliefs in teaching CS. The STCS should offer supporting official resources to CS teachers to help them in changing their beliefs in regard to teaching CS.

  • 178.
    Alghamdi, Fayiq
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Nylén, Aletta
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Pears, Arnold
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Teachers’ Awards - an Incentive for Pedagogical Development in Saudi Arabia2019Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This work-in-progress paper presents a study on

    how K-12 Computer Science teachers in Saudi Arabia have

    changed their pedagogy as a result of engaging in one year of

    professional development leading up to applying for a teacher’s

    award. The results are based on thematic analysis of fourteen

    interviews with teachers that have been awarded either the

    ’Education Excellence Award’ or the ’Microsoft Expert in Education’.

    The study focuses on how preparing for and getting

    the teaching award has influenced them focusing on changes

    in their pedagogical development and subsequent practices. The

    work provides an in-depth description of several aspects of

    the Saudi Arabian teaching culture. It explores and discusses

    the affordances of mechanisms used to strengthen pedagogical

    competence in a teacher community, paying extra attention to

    awards. This study identifies four main factors that motivate

    teachers to engage in pedagogical development in teaching

    Computer Science. The research suggests that awards can be an

    efficient motivator in establishing a culture of excellence among

    Computer Science teachers.

    Fulltekst (pdf)
    fulltext
  • 179.
    Alghamdi, Fayiq
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Pears, Arnold
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Nylén, Aletta
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Computer science teachers perspectives on competencies: A case study in the Kingdom of Saudi Arabia2018Inngår i: Informatics in Schools. Fundamentals of Computer Science and Software Engineering, Springer, 2018, s. 129-140Konferansepaper (Fagfellevurdert)
    Abstract [en]

    The Kingdom of Saudi Arabia (KSA) has recently adopted the Saudi Teaching Competencies Standard (STCS). This paper tries to answer how these competencies are achieved, how they are maintained, and what support exists to support teaching CS competently in the KSA. This paper presents the results of an investigation of teacher awareness of, and attitudes to, the STCS in the Kingdom. Through the study reported here, we address an urgent need in the Kingdom to understand teacher preparedness in terms of CS teaching competencies. The study draws on interviews with ten CS teachers in five different cities in the KSA. A thematic coding analysis approach was used. This study explores the CS teaching competencies held by teachers in three areas of CS teaching, focusing on connection to society, professional practice and professional development. The results of the study highlight the CS teaching competencies that CS teachers feel they currently grasp well in the KSA. By enhancing awareness of what teachers currently do well we contribute to the adjustment and improvement of the STCS and help to build a program which addresses the current in-service training needs of CS teachers. The outcomes also help to raise awareness of the challenges of implementing the Computer Education curriculum in KSA schools.

  • 180.
    Alhalaweh, Amjad
    et al.
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Farmaceutiska fakulteten, Institutionen för farmaci.
    Alzghoul, Ahmad
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Kaialy, Waseem
    Mahlin, Denny
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Farmaceutiska fakulteten, Institutionen för farmaci.
    Bergström, Christel A. S.
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Farmaceutiska fakulteten, Institutionen för farmaci.
    Computational predictions of glass-forming ability and crystallization tendency of drug molecules2014Inngår i: Molecular Pharmaceutics, ISSN 1543-8384, E-ISSN 1543-8392, Vol. 11, nr 9, s. 3123-3132Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Amorphization is an attractive formulation technique for drugs suffering from poor aqueous solubility as a result of their high lattice energy. Computational models that can predict the material properties associated with amorphization, such as glass-forming ability (GFA) and crystallization behavior in the dry state, would be a time-saving, cost-effective, and material-sparing approach compared to traditional experimental procedures. This article presents predictive models of these properties developed using support vector machine (SVM) algorithm. The GFA and crystallization tendency were investigated by melt-quenching 131 drug molecules in situ using differential scanning calorimetry. The SVM algorithm was used to develop computational models based on calculated molecular descriptors. The analyses confirmed the previously suggested cutoff molecular weight (MW) of 300 for glass-formers, and also clarified the extent to which MW can be used to predict the GFA of compounds with MW < 300. The topological equivalent of Grav3_3D, which is related to molecular size and shape, was a better descriptor than MW for GFA; it was able to accurately predict 86% of the data set regardless of MW. The potential for crystallization was predicted using molecular descriptors reflecting Hückel pi atomic charges and the number of hydrogen bond acceptors. The models developed could be used in the early drug development stage to indicate whether amorphization would be a suitable formulation strategy for improving the dissolution and/or apparent solubility of poorly soluble compounds.

  • 181.
    ALI, SHUJAT
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informatik och media.
    DESIGN AN INTERFACE PROTOTYPE FOR ELSKIFT.DK: DESIGN A WEBSITE USING ITERATIVE DESIGN PROCESS2011Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    Abstract [en]

     

    Now a day the revolution in computer technology has changed the trend of human life. Congenital methods are a being replaced by new technique. The purpose of this study was to make an interface design prototype of Elskift company website. Another aim was to find out  the  prototype  should  concentrate  on  usability  and  user  interface design  heuristic.  Main  goals  were  that  the  prototype  was  easy  to learn,  efficient  of  use  and  subjective  satisfaction.  Both Quantitative and Qualitative approaches were used in this study.  Interviews were performed with the management and developer of Elskift. Survey was conducted to collect data from the participant.  Iterative  design  was used  in  this  design  process  its  include  evaluation,  design  and prototype. Usability testing was performed in the final design option. The Elskift design prototype is not an abundant and the complete web-based prototype but it contain maximum attribute

    Fulltekst (pdf)
    Autumn 2011 Master two years Shujat Ali Elskift design prototype_12032012
  • 182.
    Alipour, Mehdi
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datorteknik.
    Rethinking Dynamic Instruction Scheduling and Retirement for Efficient Microarchitectures2020Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    Out-of-order execution is one of the main micro-architectural techniques used to improve the performance of both single- and multi-threaded processors. The application of such a processor varies from mobile devices to server computers. This technique achieves higher performance by finding independent instructions and hiding execution latency and uses the cycles which otherwise would be wasted or caused a CPU stall. To accomplish this, it uses scheduling resources including the ROB, IQ, LSQ and physical registers, to store and prioritize instructions.

    The pipeline of an out-of-order processor has three macro-stages: the front-end, the scheduler, and the back-end. The front-end fetches instructions, places them in the out-of-order resources, and analyzes them to prepare for their execution. The scheduler identifies which instructions are ready for execution and prioritizes them for scheduling. The back-end updates the processor state with the results of the oldest completed instructions, deallocates the resources and commits the instructions in the program order to maintain correct execution.

    Since out-of-order execution needs to be able to choose any available instructions for execution, its scheduling resources must have complex circuits for identifying and prioritizing instructions, which makes them very expansive, therefore, limited. Due to their cost, the scheduling resources are constrained in size. This limited size leads to two stall points respectively at the front-end and the back-end of the pipeline. The front-end can stall due to fully allocated resources and therefore no more new instructions can be placed in the scheduler. The back-end can stall due to the unfinished execution of an instruction at the head of the ROB which prevents other resources from being deallocated, preventing new instructions from being inserted into the pipeline.

    To address these two stalls, this thesis focuses on reducing the time instructions occupy the scheduling resources. Our front-end technique tackles IQ pressure while our back-end approach considers the rest of the resources. To reduce front-end stalls we reduce the pressure on the IQ for both storing (depth) and issuing (width) instructions by bypassing them to cheaper storage structures. To reduce back-end stalls, we explore how we can retire instructions earlier, and out-of-order, to reduce the pressure on the out-of-order resource.

    Delarbeid
    1. A Taxonomy of Out-of-Order Instruction Commit
    Åpne denne publikasjonen i ny fane eller vindu >>A Taxonomy of Out-of-Order Instruction Commit
    2017 (engelsk)Inngår i: 2017 Ieee International Symposium On Performance Analysis Of Systems And Software (Ispass), Los Alamitos: IEEE Computer Society, 2017, s. 135-136Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    While in-order instruction commit has its advantages, such as providing precise interrupts and avoiding complications with the memory consistency model, it requires the core to hold on to resources (reorder buffer entries, load/store queue entries, registers) until they are released in program order. In contrast, out-of-order commit releases resources much earlier, yielding improved performance without the need for additional hardware resources. In this paper, we revisit out-of-order commit from a different perspective, not by proposing another hardware technique, but by introducing a taxonomy and evaluating three different micro-architectures that have this technique enabled. We show how smaller processors can benefit from simple out-oforder commit strategies, but that larger, aggressive cores require more aggressive strategies to improve performance.

    sted, utgiver, år, opplag, sider
    Los Alamitos: IEEE Computer Society, 2017
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-352938 (URN)10.1109/ISPASS.2017.7975283 (DOI)000426905600020 ()978-1-5386-3890-3 (ISBN)978-1-5386-3891-0 (ISBN)978-1-5386-3889-7 (ISBN)
    Konferanse
    2017 Ieee International Symposium On Performance Analysis Of Systems And Software (Ispass), Santa Rosa, CA, USA.
    Tilgjengelig fra: 2018-06-12 Laget: 2018-06-12 Sist oppdatert: 2020-02-02bibliografisk kontrollert
    2. Exploring the performance limits of out-of-order commit
    Åpne denne publikasjonen i ny fane eller vindu >>Exploring the performance limits of out-of-order commit
    2017 (engelsk)Inngår i: Proc. 14th Computing Frontiers Conference, New York: ACM Press, 2017, s. 211-220Konferansepaper, Publicerat paper (Fagfellevurdert)
    sted, utgiver, år, opplag, sider
    New York: ACM Press, 2017
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-334601 (URN)10.1145/3075564.3075581 (DOI)978-1-4503-4487-6 (ISBN)
    Konferanse
    CF 2017, May 15–17, Siena, Italy
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2017-05-15 Laget: 2017-11-24 Sist oppdatert: 2020-02-02bibliografisk kontrollert
    3. Maximizing limited resources: A limit-based study and taxonomy of out-of-order commit
    Åpne denne publikasjonen i ny fane eller vindu >>Maximizing limited resources: A limit-based study and taxonomy of out-of-order commit
    2019 (engelsk)Inngår i: Journal of Signal Processing Systems, ISSN 1939-8018, E-ISSN 1939-8115, Vol. 91, nr 3-4, s. 379-397Artikkel i tidsskrift (Fagfellevurdert) Published
    Abstract [en]

    Out-of-order execution is essential for high performance, general-purpose computation, as it can find and execute useful work instead of stalling. However, it is typically limited by the requirement of visibly sequential, atomic instruction executionin other words, in-order instruction commit. While in-order commit has a number of advantages, such as providing precise interrupts and avoiding complications with the memory consistency model, it requires the core to hold on to resources (reorder buffer entries, load/store queue entries, physical registers) until they are released in program order. In contrast, out-of-order commit can release some resources much earlier, yielding improved performance and/or lower resource requirements. Non-speculative out-of-order commit is limited in terms of correctness by the conditions described in the work of Bell and Lipasti (2004). In this paper we revisit out-of-order commit by examining the potential performance benefits of lifting these conditions one by one and in combination, for both non-speculative and speculative out-of-order commit. While correctly handling recovery for all out-of-order commit conditions currently requires complex tracking and expensive checkpointing, this work aims to demonstrate the potential for selective, speculative out-of-order commit using an oracle implementation without speculative rollback costs. Through this analysis of the potential of out-of-order commit, we learn that: a) there is significant untapped potential for aggressive variants of out-of-order commit; b) it is important to optimize the out-of-order commit depth for a balanced design, as smaller cores benefit from reduced depth while larger cores continue to benefit from deeper designs; c) the focus on implementing only a subset of the out-of-order commit conditions could lead to efficient implementations; d) the benefits of out-of-order commit increases with higher memory latency and in conjunction with prefetching; e) out-of-order commit exposes additional parallelism in the memory hierarchy.

    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-365899 (URN)10.1007/s11265-018-1369-4 (DOI)000459428200012 ()
    Tilgjengelig fra: 2018-04-26 Laget: 2018-11-14 Sist oppdatert: 2020-02-02bibliografisk kontrollert
    4. FIFOrder MicroArchitecture: Ready-Aware Instruction Scheduling for OoO Processors
    Åpne denne publikasjonen i ny fane eller vindu >>FIFOrder MicroArchitecture: Ready-Aware Instruction Scheduling for OoO Processors
    2019 (engelsk)Inngår i: 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE), IEEE, 2019, s. 716-721Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    The number of instructions a processor's instruction queue can examine (depth) and the number it can issue together (width) determine its ability to take advantage of the ILP in an application. Unfortunately, increasing either the width or depth of the instruction queue is very costly due to the content-addressable logic needed to wakeup and select instructions out-of-order. This work makes the observation that a large number of instructions have both operands ready at dispatch, and therefore do not benefit from out-of-order scheduling. We leverage this to place such ready-at-dispatch instructions in separate, simpler, in-order FIFO queues for scheduling. With such additional queues, we can reduce the size and width of the expensive out-of-order instruction queue, without reducing the processor's overall issue width and depth. Our design, FIFOrder, is able to steer more than 60% of instructions to the cheaper FIFO queues, providing a 50% energy savings over a traditional out-of-order instruction queue design, while delivering 8% higher performance.

    sted, utgiver, år, opplag, sider
    IEEE, 2019
    Serie
    Design Automation and Test in Europe Conference and Exhibition, ISSN 1530-1591
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-389930 (URN)10.23919/DATE.2019.8715034 (DOI)000470666100132 ()978-3-9819263-2-3 (ISBN)
    Konferanse
    Design, Automation & Test in Europe Conference & Exhibition (DATE), MAR 25-29, 2019, Florence, ITALY
    Forskningsfinansiär
    Knut and Alice Wallenberg Foundation
    Tilgjengelig fra: 2019-08-01 Laget: 2019-08-01 Sist oppdatert: 2020-02-02bibliografisk kontrollert
    5. Delay and Bypass: Ready and Criticality Aware Instruction Scheduling in Out-of-Order Processors
    Åpne denne publikasjonen i ny fane eller vindu >>Delay and Bypass: Ready and Criticality Aware Instruction Scheduling in Out-of-Order Processors
    2020 (engelsk)Inngår i: The 26th IEEE International Symposium on High-Performance Computer Architecture (HPCA) / [ed] IEEE, 2020Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    Flexible instruction scheduling is essential for performance in out-of-order processors. This is typically achieved by using CAM-based Instruction Queues (IQs) that provide complete flexibility in choosing ready instructions for execution, but at the cost of significant scheduling energy.

    In this work we seek to reduce the instruction scheduling energy by reducing the depth and width of the IQ. We do so by classifying instructions based on their readiness and criticality, and using this information to bypass the IQ for instructions that will not benefit from its expensive scheduling structures and delay instructions that will not harm performance. Combined, these approaches allow us to offload a significant portion of the instructions from the IQ to much cheaper FIFO-based scheduling structures without hurting performance. As a result we can reduce the IQ depth and width by half, thereby saving energy.

    Our design, Delay and Bypass (DNB), is the first design to explicitly address both readiness and criticality to reduce scheduling energy. By handling both classes we are able to achieve 95% of the baseline out-of-order performance while only using 33% of the scheduling energy. This represents a significant improvement over previous designs which addressed only criticality or readiness (91%/89% performance at 74%/53% energy).

    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-403674 (URN)
    Konferanse
    The 26th IEEE International Symposium on High-Performance Computer Architecture (HPCA), Feb. 22-26, 2020, San Diego, CA, USA
    Tilgjengelig fra: 2020-02-02 Laget: 2020-02-02 Sist oppdatert: 2020-03-24bibliografisk kontrollert
    Fulltekst (pdf)
    fulltext
    Download (jpg)
    presentationsbild
  • 183.
    Alipour, Mehdi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Carlson, Trevor E.
    Black-Schaffer, David
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Kaxiras, Stefanos
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Maximizing limited resources: A limit-based study and taxonomy of out-of-order commit2019Inngår i: Journal of Signal Processing Systems, ISSN 1939-8018, E-ISSN 1939-8115, Vol. 91, nr 3-4, s. 379-397Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Out-of-order execution is essential for high performance, general-purpose computation, as it can find and execute useful work instead of stalling. However, it is typically limited by the requirement of visibly sequential, atomic instruction executionin other words, in-order instruction commit. While in-order commit has a number of advantages, such as providing precise interrupts and avoiding complications with the memory consistency model, it requires the core to hold on to resources (reorder buffer entries, load/store queue entries, physical registers) until they are released in program order. In contrast, out-of-order commit can release some resources much earlier, yielding improved performance and/or lower resource requirements. Non-speculative out-of-order commit is limited in terms of correctness by the conditions described in the work of Bell and Lipasti (2004). In this paper we revisit out-of-order commit by examining the potential performance benefits of lifting these conditions one by one and in combination, for both non-speculative and speculative out-of-order commit. While correctly handling recovery for all out-of-order commit conditions currently requires complex tracking and expensive checkpointing, this work aims to demonstrate the potential for selective, speculative out-of-order commit using an oracle implementation without speculative rollback costs. Through this analysis of the potential of out-of-order commit, we learn that: a) there is significant untapped potential for aggressive variants of out-of-order commit; b) it is important to optimize the out-of-order commit depth for a balanced design, as smaller cores benefit from reduced depth while larger cores continue to benefit from deeper designs; c) the focus on implementing only a subset of the out-of-order commit conditions could lead to efficient implementations; d) the benefits of out-of-order commit increases with higher memory latency and in conjunction with prefetching; e) out-of-order commit exposes additional parallelism in the memory hierarchy.

    Fulltekst (pdf)
    fulltext
  • 184.
    Alipour, Mehdi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Carlson, Trevor E.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Kaxiras, Stefanos
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    A Taxonomy of Out-of-Order Instruction Commit2017Inngår i: 2017 Ieee International Symposium On Performance Analysis Of Systems And Software (Ispass), Los Alamitos: IEEE Computer Society, 2017, s. 135-136Konferansepaper (Fagfellevurdert)
    Abstract [en]

    While in-order instruction commit has its advantages, such as providing precise interrupts and avoiding complications with the memory consistency model, it requires the core to hold on to resources (reorder buffer entries, load/store queue entries, registers) until they are released in program order. In contrast, out-of-order commit releases resources much earlier, yielding improved performance without the need for additional hardware resources. In this paper, we revisit out-of-order commit from a different perspective, not by proposing another hardware technique, but by introducing a taxonomy and evaluating three different micro-architectures that have this technique enabled. We show how smaller processors can benefit from simple out-oforder commit strategies, but that larger, aggressive cores require more aggressive strategies to improve performance.

  • 185.
    Alipour, Mehdi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Carlson, Trevor E.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Kaxiras, Stefanos
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Exploring the performance limits of out-of-order commit2017Inngår i: Proc. 14th Computing Frontiers Conference, New York: ACM Press, 2017, s. 211-220Konferansepaper (Fagfellevurdert)
    Download (pdf)
    bilaga
  • 186.
    Alipour, Mehdi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Kumar, Rakesh
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Kaxiras, Stefanos
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Black-Schaffer, David
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Delay and Bypass: Ready and Criticality Aware Instruction Scheduling in Out-of-Order Processors2020Inngår i: The 26th IEEE International Symposium on High-Performance Computer Architecture (HPCA) / [ed] IEEE, 2020Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Flexible instruction scheduling is essential for performance in out-of-order processors. This is typically achieved by using CAM-based Instruction Queues (IQs) that provide complete flexibility in choosing ready instructions for execution, but at the cost of significant scheduling energy.

    In this work we seek to reduce the instruction scheduling energy by reducing the depth and width of the IQ. We do so by classifying instructions based on their readiness and criticality, and using this information to bypass the IQ for instructions that will not benefit from its expensive scheduling structures and delay instructions that will not harm performance. Combined, these approaches allow us to offload a significant portion of the instructions from the IQ to much cheaper FIFO-based scheduling structures without hurting performance. As a result we can reduce the IQ depth and width by half, thereby saving energy.

    Our design, Delay and Bypass (DNB), is the first design to explicitly address both readiness and criticality to reduce scheduling energy. By handling both classes we are able to achieve 95% of the baseline out-of-order performance while only using 33% of the scheduling energy. This represents a significant improvement over previous designs which addressed only criticality or readiness (91%/89% performance at 74%/53% energy).

  • 187.
    Alipour, Mehdi
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Kumar, Rakesh
    Norwegian Univ Sci & Technol, Dept Comp Sci, Trondheim, Norway.
    Kaxiras, Stefanos
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Black-Schaffer, David
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    FIFOrder MicroArchitecture: Ready-Aware Instruction Scheduling for OoO Processors2019Inngår i: 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE), IEEE, 2019, s. 716-721Konferansepaper (Fagfellevurdert)
    Abstract [en]

    The number of instructions a processor's instruction queue can examine (depth) and the number it can issue together (width) determine its ability to take advantage of the ILP in an application. Unfortunately, increasing either the width or depth of the instruction queue is very costly due to the content-addressable logic needed to wakeup and select instructions out-of-order. This work makes the observation that a large number of instructions have both operands ready at dispatch, and therefore do not benefit from out-of-order scheduling. We leverage this to place such ready-at-dispatch instructions in separate, simpler, in-order FIFO queues for scheduling. With such additional queues, we can reduce the size and width of the expensive out-of-order instruction queue, without reducing the processor's overall issue width and depth. Our design, FIFOrder, is able to steer more than 60% of instructions to the cheaper FIFO queues, providing a 50% energy savings over a traditional out-of-order instruction queue design, while delivering 8% higher performance.

    Fulltekst (pdf)
    Fiforder
  • 188.
    Alirezaie, Marjan
    et al.
    Örebro University.
    Renoux, Jennifer
    Örebro University.
    Köckemann, Uwe
    Örebro University.
    Kristoffersson, Annica
    Örebro University.
    Karlsson, Lars
    Örebro University.
    Blomqvist, Eva
    SICS East.
    Tsiftes, Nicolas
    SICS.
    Voigt, Thiemo
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation. SICS.
    Loutfi, Amy
    Örebro University.
    An Ontology-based Context-aware System for Smart Homes: E-care@ home2017Inngår i: Sensors, ISSN 1424-8220, E-ISSN 1424-8220, Vol. 17, nr 7Artikkel i tidsskrift (Fagfellevurdert)
  • 189.
    Al-Jaff, Mohammed
    et al.
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinsk biokemi och mikrobiologi.
    Sandström, Eric
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinsk biokemi och mikrobiologi.
    Grabherr, Manfred
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinsk biokemi och mikrobiologi. Uppsala Univ, Bioinformat Infrastruct Life Sci, S-75123 Uppsala, Sweden..
    microTaboo: a general and practical solution to the k-disjoint problem2017Inngår i: BMC Bioinformatics, ISSN 1471-2105, E-ISSN 1471-2105, Vol. 18, artikkel-id 228Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Background: A common challenge in bioinformatics is to identify short sub-sequences that are unique in a set of genomes or reference sequences, which can efficiently be achieved by k-mer (k consecutive nucleotides) counting. However, there are several areas that would benefit from a more stringent definition of "unique", requiring that these sub-sequences of length W differ by more than k mismatches (i.e. a Hamming distance greater than k) from any other sub-sequence, which we term the k-disjoint problem. Examples include finding sequences unique to a pathogen for probe-based infection diagnostics; reducing off-target hits for re-sequencing or genome editing; detecting sequence (e.g. phage or viral) insertions; and multiple substitution mutations. Since both sensitivity and specificity are critical, an exhaustive, yet efficient solution is desirable.

    Results: We present microTaboo, a method that allows for efficient and extensive sequence mining of unique (k-disjoint) sequences of up to 100 nucleotides in length. On a number of simulated and real data sets ranging from microbe-to mammalian-size genomes, we show that microTaboo is able to efficiently find all sub-sequences of a specified length W that do not occur within a threshold of k mismatches in any other sub-sequence. We exemplify that microTaboo has many practical applications, including point substitution detection, sequence insertion detection, padlock probe target search, and candidate CRISPR target mining.

    Conclusions: microTaboo implements a solution to the k-disjoint problem in an alignment-and assembly free manner. microTaboo is available for Windows, Mac OS X, and Linux, running Java 7 and higher, under the GNU GPLv3 license, at:https://MohammedAlJaff.github.io/microTaboo

    Fulltekst (pdf)
    fulltext
  • 190.
    Allalou, Amin
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Curic, Vladimir
    Pardo-Martin, Carlos
    Massachusetts Institute of Technology, USA.
    Yanik, Mehmet Fatih
    Massachusetts Institute of Technology, USA.
    Wählby, Carolina
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Approaches for increasing throughput andinformation content of image-based zebrafishscreens2011Inngår i: Proceeding of SSBA 2011, 2011Konferansepaper (Annet vitenskapelig)
    Abstract [en]

    Microscopy in combination with image analysis has emerged as one of the most powerful and informativeways to analyze cell-based high-throughput screening (HTS) samples in experiments designed to uncover novel drugs and drug targets. However, many diseases and biological pathways can be better studied in whole animals, particularly diseases and pathways that involve organ systems and multicellular interactions, such as organ development, neuronal degeneration and regeneration, cancer metastasis, infectious disease progression and pathogenesis. The zebrafish is a wide-spread and popular vertebrate model of human organfunction and development, and it is unique in the sense that large-scale in vivo genetic and chemical studies are feasible due in part to its small size, optical transparency,and aquatic habitat. To improve the throughput and complexity of zebrafish screens, a high-throughput platform for cellular-resolution in vivo chemical and genetic screens on zebrafish larvae has been developed at Yanik lab at Research Laboratory of Electronics, MIT, USA. The system loads live zebrafish from reservoirs or multiwell plates, positions and rotates them for high-speed confocal imaging of organs,and dispenses the animals without damage. We present two improvements to the described system, including automation of positioning of the animals and a novel approach for brightfield microscopy tomographic imaging of living animals.

  • 191.
    Allalou, Amin
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    van de Rijke, Frans
    Jahangir Tafrechi, Roos
    Raap, Anton
    Wählby, Carolina
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Image based measurements of single cell mtDNA mutation load MTD 20072007Inngår i: Medicinteknikdagarna 2007, 2007Konferansepaper (Annet (populærvitenskap, debatt, mm))
    Abstract [en]

    Cell cultures as well as cells in tissue always display a certain degree of variability,and measurements based on cell averages will miss important information contained in a heterogeneous population. These differences among cells in a population may be essential to quantify when looking at, e.g., protein expression and mutations in tumor cells which often show high degree of heterogeneity.

    Single nucleotide mutations in the mithochondrial DNA (mtDNA) can accumulate and later be present in large proportions of the mithocondria causing devastating diseases. To study mtDNA accumulation and segregation one needs to measure the amount of mtDNA mutations in each cell in multiple serial cell culture passages. The different degrees of mutation in a cell culture can be quantified by making measurements on individual cells as an alternative to looking at an average of a population. Fluorescence microscopy in combination with automated digital image analysis provides an efficient approach to this type of single cell analysis.

    Image analysis software for these types of applications are often complicated and not easy to use for persons lacking extensive knowledge in image analysis, e.g., laboratory personnel. This paper presents a user friendly implementation of an automated method for image based measurements of mtDNA mutations in individual cells detected with padlock probes and rolling-circle amplification (RCA). The mitochondria are present in the cell’s cytoplasm, and here each cytoplasm has to be delineated without the presence of a cytoplasmic stain. Three different methods for segmentation of cytoplasms are compared and it is shown that automated cytoplasmic delineation can be performed 30 times faster than manual delineation, with an accuracy as high as 87%. The final image based measurements of mitochondrial mutation load are also compared to, and show high agreement with, measurements made using biochemical techniques.

  • 192.
    Allalou, Amin
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    van de Rijke, Frans M.
    Jahangir Tafrechi, Roos
    Raap, Anton K.
    Wählby, Carolina
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Centrum för bildanalys.
    Image Based Measurements of Single Cell mtDNA Mutation Load2007Inngår i: Image Analysis, Proceedings / [ed] Ersboll BK, Pedersen KS, 2007, s. 631-640Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Cell cultures as well as cells in tissue always display a certain degree of variability, and measurements based on cell averages will miss important information contained in a heterogeneous population. This paper presents automated methods for image based measurements of mitochondiral DNA (mtDNA) mutations in individual cells. The mitochondria are present in the cell’s cytoplasm, and each cytoplasm has to be delineated. Three different methods for segmentation of cytoplasms are compared and it is shown that automated cytoplasmic delineation can be performed 30 times faster than manual delineation, with an accuracy as high as 87%. The final image based measurements of mitochondrial mutation load are also compared to, and show high agreement with, measurements made using biochemical techniques.

  • 193.
    Allalou, Amin
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Wählby, Carolina
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    BlobFinder, a tool for fluorescence microscopy image cytometry2009Inngår i: Computer Methods and Programs in Biomedicine, ISSN 0169-2607, E-ISSN 1872-7565, Vol. 94, nr 1, s. 58-65Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Images can be acquired at high rates with modern fluorescence microscopy hardware, giving rise to a demand for high-speed analysis of image data. Digital image cytometry, i.e., automated measurements and extraction of quantitative data from images of cells, provides valuable information for many types of biomedical analysis. There exists a number of different image analysis software packages that can be programmed to perform a wide array of useful measurements. However, the multi-application capability often compromises the simplicity of the tool. Also, the gain in speed of analysis is often compromised by time spent learning complicated software. We provide a free software called BlobFinder that is intended for a limited type of application, making it easy to use, easy to learn and optimized for its particular task. BlobFinder can perform batch processing of image data and quantify as well as localize cells and point like source signals in fluorescence microscopy images, e.g., from FISH, in situ PLA and padlock probing, in a fast and easy way.

    Fulltekst (pdf)
    FULLTEXT01
  • 194.
    Allalou, Amin
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Wählby, Carolina
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Signal Detection in 3D by Stable Wave Signal Verification2009Inngår i: Proceedings of SSBA 2009, 2009Konferansepaper (Annet vitenskapelig)
    Abstract [en]

    Detection and localization of point-source signals is an important task in many image analysis applications. These types of signals can commonly be seen in fluorescent microscopy when studying functions of biomolecules. Visual detection and localization of point-source signals in 3D is limited and time consuming, making automated methods an important task. The 3D Stable Wave Detector (3DSWD) is a new method that combines signal enhancement with a verifier/separator. The verifier/separator examines the intensity gradient around a signal, making the detection less sensitive to noise and better at separating spatially close signals. Conventional methods such as; TopHat, Difference of Gaussian, and Multiscale Product consist only of signal enhancement. In this paper we compare the 3DSWD to these conventional methods with and without the addition of a verifier/separator. We can see that the 3DSWD has the highest robustness to noise among all the methods and that the other methods are improved when a verifier/separator is added.

  • 195.
    Allalou, Amin
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Wählby, Carolina
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Centrum för bildanalys.
    van de Rijke, Frans
    Jahangir Tafrechi, Roos
    Raap, Anton
    Segmentation of Cytoplasms of Cultured Cells2007Inngår i: In Proceedings SSBA 2007, Symposium on image analysis, Linköping, 2007Konferansepaper (Annet vitenskapelig)
    Abstract [en]

    Cell cultures as well as cells in tissue always display a certain degree of variability, and measurements based on cell averages will miss important information contained in a heterogeneous population. This paper presents automated methods for segmentation of cells and cytoplasms. The segmentation results are applied to image based measurements of mitochondiral DNA (mtDNA) mutations in individual cells. Three different methods for segmentation of cytoplasms are compared and it is shown that automated cytoplasmic delineation can be performed 30 times faster than manual delineation, with an accuracy as high as 87%, compared to an inter observer variability of 79% at manual delineation.

  • 196. Allignol, Cyril
    et al.
    Barnier, Nicolas
    Flener, Pierre
    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, Datorteknik.
    Constraint programming for air traffic management: a survey2012Inngår i: Knowledge engineering review (Print), ISSN 0269-8889, E-ISSN 1469-8005, Vol. 27, nr 3, s. 361-392Artikkel, forskningsoversikt (Fagfellevurdert)
  • 197.
    Almayali, Rafaa
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informatik och media.
    Improving Learning Results through LMS2014Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    Fulltekst (pdf)
    fulltext
  • 198. Almeida, Juliana
    et al.
    Martins da Silva, Margarida
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för systemteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Reglerteknik.
    Wigren, Torbjörn
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för systemteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Reglerteknik.
    Mendonça, Teresa
    Contributions to the initialization of online identification algorithms for anæsthesia: the NeuroMuscular Blockade case study2010Inngår i: Proc. 18th Mediterranean Conference on Control and Automation, Piscataway, NJ: IEEE , 2010, s. 1341-1346Konferansepaper (Fagfellevurdert)
  • 199.
    Almgren, K.M
    et al.
    STFI-Packforsk AB.
    Gamstedt, E.K.
    Department of Polymer and Fibre Technology, Royal Institute of Technology .
    Nygård, P.
    PFI Paper and Fibre Research Institute.
    Malmberg, Filip
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Lindblad, Joakim
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Centrum för bildanalys. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Lindström, M.
    STFI-Packforsk AB.
    Role of fibre–fibre and fibre–matrix adhesion in stress transfer in composites made from resin-impregnated paper sheets2009Inngår i: International Journal of Adhesion and Adhesives, ISSN 0143-7496, E-ISSN 1879-0127, Vol. 29, nr 5, s. 551-557Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Paper-reinforced plastics are gaining increased interest as packaging materials, where mechanical properties are of great importance. Strength and stress transfer in paper sheets are controlled by fibre–fibre bonds. In paper-reinforced plastics, where the sheet is impregnated with a polymer resin, other stress-transfer mechanisms may be more important. The influence of fibre–fibre bonds on the strength of paper-reinforced plastics was therefore investigated. Paper sheets with different degrees of fibre–fibre bonding were manufactured and used as reinforcement in a polymeric matrix. Image analysis tools were used to verify that the difference in the degree of fibre–fibre bonding had been preserved in the composite materials. Strength and stiffness of the composites were experimentally determined and showed no correlation to the degree of fibre–fibre bonding, in contrast to the behaviour of unimpregnated paper sheets. The degree of fibre–fibre bonding is therefore believed to have little importance in this type of material, where stress is mainly transferred through the fibre–matrix interface.

  • 200.
    Almquist, Martin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap.
    Numerical wave propagation in large-scale 3-D environments2012Independent thesis Advanced level (professional degree), 20 poäng / 30 hpOppgave
    Abstract [en]

    High-order accurate finite difference methods have been applied to the acoustic wave equation in discontinuous media and curvilinear geometries, using the SBP-SAT method. Strict stability is shown for the 2-D wave equation with general boundary conditions. The fourth-order accurate method for the 3-D wave equation has been implemented in C and parallelized using MPI. The implementation has been verified against an analytical solution and runs efficiently on a large number of processors.

    Fulltekst (pdf)
    Numerical wave propagation in large-scale 3-D environments
1234567 151 - 200 of 5630
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