SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "hsv:(NATURVETENSKAP) hsv:(Data och informationsvetenskap) hsv:(Annan data och informationsvetenskap) ;lar1:(cth)"

Sökning: hsv:(NATURVETENSKAP) hsv:(Data och informationsvetenskap) hsv:(Annan data och informationsvetenskap) > Chalmers tekniska högskola

  • Resultat 1-10 av 757
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Chatterjee, Bapi, 1982 (författare)
  • Lock-free Concurrent Search
  • 2017
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. On the other hand, though many celebrated books on data structure and algorithm provide a comprehensive study of sequential search data structures, unfortunately, we do not have such a luxury if concurrency comes in the setting. The present dissertation aims to address this paucity. We describe novel lock-free algorithms for concurrent data structures that target a variety of search problems. (i) Point search (membership query, predecessor query, nearest neighbour query) for 1-dimensional data: Lock-free linked-list; lock-free internal and external binary search trees (BST). (ii) Range search for 1-dimensional data: A range search method for lock-free ordered set data structures - linked-list, skip-list and BST. (iii) Point search for multi-dimensional data: Lock-free kD-tree, specially, a generic method for nearest neighbour search. We prove that the presented algorithms are linearizable i.e. the concurrent data structure operations intuitively display their sequential behaviour to an observer of the concurrent system. The lock-freedom in the introduced algorithms guarantee overall progress in an asynchronous shared memory system. We present the amortized analysis of lock-free data structures to show their efficiency. Moreover, we provide sample implementations of the algorithms and test them over extensive micro-benchmarks. Our experiments demonstrate that the implementations are scalable and perform well when compared to related existing alternative implementations on common multi-core computers. Our focus is on propounding the generic methodologies for efficient lock-free concurrent search. In this direction, we present the notion of help-optimality, which captures the optimization of amortized step complexity of the operations. In addition to that, we explore the language-portable design of lock-free data structures that aims to simplify an implementation from programmer’s point of view. Finally, our techniques to implement lock-free linearizable range search and nearest neighbour search are independent of the underlying data structures and thus are adaptive to similar data structures.
  •  
2.
  • Norlund, Tobias, 1991, et al. (författare)
  • Transferring Knowledge from Vision to Language: How to Achieve it and how to Measure it?
  • 2021
  • Ingår i: Proceedings of the Fourth BlackboxNLP Workshop on Analyzing and Interpreting Neural Networks for NLP, pp. 149-162, Punta Cana, Dominican Republic. - : Association for Computational Linguistics.
  • Konferensbidrag (refereegranskat)abstract
    • Large language models are known to suffer from the hallucination problem in that they are prone to output statements that are false or inconsistent, indicating a lack of knowledge. A proposed solution to this is to provide the model with additional data modalities that complements the knowledge obtained through text. We investigate the use of visual data to complement the knowledge of large language models by proposing a method for evaluating visual knowledge transfer to text for uni- or multimodal language models. The method is based on two steps, 1) a novel task querying for knowledge of memory colors, i.e. typical colors of well-known objects, and 2) filtering of model training data to clearly separate knowledge contributions. Additionally, we introduce a model architecture that involves a visual imagination step and evaluate it with our proposed method. We find that our method can successfully be used to measure visual knowledge transfer capabilities in models and that our novel model architecture shows promising results for leveraging multimodal knowledge in a unimodal setting.
  •  
3.
  • Scheuner, Joel, 1991, et al. (författare)
  • Performance Benchmarking of Infrastructure-as-a-Service (IaaS) Clouds with CloudWorkBench
  • 2019
  • Ingår i: ICPE 2019 - Companion of the 2019 ACM/SPEC International Conference on Performance Engineering. - New York, NY, USA : ACM. ; , s. 53-56
  • Konferensbidrag (refereegranskat)abstract
    • The continuing growth of the cloud computing market has led to an unprecedented diversity of cloud services with different performance characteristics. To support service selection, researchers and practitioners conduct cloud performance benchmarking by measuring and objectively comparing the performance of different providers and configurations (e.g., instance types in different data center regions). In this tutorial, we demonstrate how to write performance tests for IaaS clouds using the Web-based benchmarking tool Cloud WorkBench (CWB). We will motivate and introduce benchmarking of IaaS cloud in general, demonstrate the execution of a simple benchmark in a public cloud environment, summarize the CWB tool architecture, and interactively develop and deploy a more advanced benchmark together with the participants.
  •  
4.
  • Al Sabbagh, Khaled, 1987, et al. (författare)
  • Improving Data Quality for Regression Test Selection by Reducing Annotation Noise
  • 2020
  • Ingår i: Proceedings - 46th Euromicro Conference on Software Engineering and Advanced Applications, SEAA 2020. ; , s. 191-194
  • Konferensbidrag (refereegranskat)abstract
    • Big data and machine learning models have been increasingly used to support software engineering processes and practices. One example is the use of machine learning models to improve test case selection in continuous integration. However, one of the challenges in building such models is the identification and reduction of noise that often comes in large data. In this paper, we present a noise reduction approach that deals with the problem of contradictory training entries. We empirically evaluate the effectiveness of the approach in the context of selective regression testing. For this purpose, we use a curated training set as input to a tree-based machine learning ensemble and compare the classification precision, recall, and f-score against a non-curated set. Our study shows that using the noise reduction approach on the training instances gives better results in prediction with an improvement of 37% on precision, 70% on recall, and 59% on f-score.
  •  
5.
  • Fredriksson, Teodor, 1992, et al. (författare)
  • Machine learning models for automatic labeling: A systematic literature review
  • 2020
  • Ingår i: ICSOFT 2020 - Proceedings of the 15th International Conference on Software Technologies. - : SCITEPRESS - Science and Technology Publications. ; , s. 552-566
  • Konferensbidrag (refereegranskat)abstract
    • Automatic labeling is a type of classification problem. Classification has been studied with the help of statistical methods for a long time. With the explosion of new better computer processing units (CPUs) and graphical processing units (GPUs) the interest in machine learning has grown exponentially and we can use both statistical learning algorithms as well as deep neural networks (DNNs) to solve the classification tasks. Classification is a supervised machine learning problem and there exists a large amount of methodology for performing such task. However, it is very rare in industrial applications that data is fully labeled which is why we need good methodology to obtain error-free labels. The purpose of this paper is to examine the current literature on how to perform labeling using ML, we will compare these models in terms of popularity and on what datatypes they are used on. We performed a systematic literature review of empirical studies for machine learning for labeling. We identified 43 primary studies relevant to our search. From this we were able to determine the most common machine learning models for labeling. Lack of unlabeled instances is a major problem for industry as supervised learning is the most widely used. Obtaining labels is costly in terms of labor and financial costs. Based on our findings in this review we present alternate ways for labeling data for use in supervised learning tasks.
  •  
6.
  • Somanath, Sanjay, 1994, et al. (författare)
  • Towards Urban Digital Twins: A Workflow for Procedural Visualization Using Geospatial Data
  • 2024
  • Ingår i: Remote Sensing. - 2072-4292. ; 16:11
  • Tidskriftsartikel (refereegranskat)abstract
    • A key feature for urban digital twins (DTs) is an automatically generated detailed 3D representation of the built and unbuilt environment from aerial imagery, footprints, LiDAR, or a fusion of these. Such 3D models have applications in architecture, civil engineering, urban planning, construction, real estate, Geographical Information Systems (GIS), and many other areas. While the visualization of large-scale data in conjunction with the generated 3D models is often a recurring and resource-intensive task, an automated workflow is complex, requiring many steps to achieve a high-quality visualization. Methods for building reconstruction approaches have come a long way, from previously manual approaches to semi-automatic or automatic approaches. This paper aims to complement existing methods of 3D building generation. First, we present a literature review covering different options for procedural context generation and visualization methods, focusing on workflows and data pipelines. Next, we present a semi-automated workflow that extends the building reconstruction pipeline to include procedural context generation using Python and Unreal Engine. Finally, we propose a workflow for integrating various types of large-scale urban analysis data for visualization. We conclude with a series of challenges faced in achieving such pipelines and the limitations of the current approach. However, the steps for a complete, end-to-end solution involve further developing robust systems for building detection, rooftop recognition, and geometry generation and importing and visualizing data in the same 3D environment, highlighting a need for further research and development in this field.
  •  
7.
  • Bergström, Gustav, et al. (författare)
  • Evaluating the layout quality of UML class diagrams using machine learning
  • 2022
  • Ingår i: Journal of Systems and Software. - : Elsevier BV. - 0164-1212. ; 192
  • Tidskriftsartikel (refereegranskat)abstract
    • UML is the de facto standard notation for graphically representing software. UML diagrams are used in the analysis, construction, and maintenance of software systems. Mostly, UML diagrams capture an abstract view of a (piece of a) software system. A key purpose of UML diagrams is to share knowledge about the system among developers. The quality of the layout of UML diagrams plays a crucial role in their comprehension. In this paper, we present an automated method for evaluating the layout quality of UML class diagrams. We use machine learning based on features extracted from the class diagram images using image processing. Such an automated evaluator has several uses: (1) From an industrial perspective, this tool could be used for automated quality assurance for class diagrams (e.g., as part of a quality monitor integrated into a DevOps toolchain). For example, automated feedback can be generated once a UML diagram is checked in the project repository. (2) In an educational setting, the evaluator can grade the layout aspect of student assignments in courses on software modeling, analysis, and design. (3) In the field of algorithm design for graph layouts, our evaluator can assess the layouts generated by such algorithms. In this way, this evaluator opens up the road for using machine learning to learn good layouting algorithms. Approach.: We use machine learning techniques to build (linear) regression models based on features extracted from the class diagram images using image processing. As ground truth, we use a dataset of 600+ UML Class Diagrams for which experts manually label the quality of the layout. Contributions.: This paper makes the following contributions: (1) We show the feasibility of the automatic evaluation of the layout quality of UML class diagrams. (2) We analyze which features of UML class diagrams are most strongly related to the quality of their layout. (3) We evaluate the performance of our layout evaluator. (4) We offer a dataset of labeled UML class diagrams. In this dataset, we supply for every diagram the following information: (a) a manually established ground truth of the quality of the layout, (b) an automatically established value for the layout-quality of the diagram (produced by our classifier), and (c) the values of key features of the layout of the diagram (obtained by image processing). This dataset can be used for replication of our study and others to build on and improve on this work. Editor's note: Open Science material was validated by the Journal of Systems and Software Open Science Board.
  •  
8.
  • Brunetta, Carlo, 1992 (författare)
  • Cryptographic Tools for Privacy Preservation
  • 2021
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • Data permeates every aspect of our daily life and it is the backbone of our digitalized society. Smartphones, smartwatches and many more smart devices measure, collect, modify and share data in what is known as the Internet of Things. Often, these devices don’t have enough computation power/storage space thus out-sourcing some aspects of the data management to the Cloud. Outsourcing computation/storage to a third party poses natural questions regarding the security and privacy of the shared sensitive data. Intuitively, Cryptography is a toolset of primitives/protocols of which security prop- erties are formally proven while Privacy typically captures additional social/legislative requirements that relate more to the concept of “trust” between people, “how” data is used and/or “who” has access to data. This thesis separates the concepts by introducing an abstract model that classifies data leaks into different types of breaches. Each class represents a specific requirement/goal related to cryptography, e.g. confidentiality or integrity, or related to privacy, e.g. liability, sensitive data management and more. The thesis contains cryptographic tools designed to provide privacy guarantees for different application scenarios. In more details, the thesis: (a) defines new encryption schemes that provide formal privacy guarantees such as theoretical privacy definitions like Differential Privacy (DP), or concrete privacy-oriented applications covered by existing regulations such as the European General Data Protection Regulation (GDPR); (b) proposes new tools and procedures for providing verifiable computation’s guarantees in concrete scenarios for post-quantum cryptography or generalisation of signature schemes; (c) proposes a methodology for utilising Machine Learning (ML) for analysing the effective security and privacy of a crypto-tool and, dually, proposes a secure primitive that allows computing specific ML algorithm in a privacy-preserving way; (d) provides an alternative protocol for secure communication between two parties, based on the idea of communicating in a periodically timed fashion.
  •  
9.
  • Dodig-Crnkovic, Gordana, 1955 (författare)
  • Cognitive Architectures Based on Natural Info-Computation
  • 2022
  • Ingår i: Studies in Applied Philosophy, Epistemology and Rational Ethics. - Cham : Springer. - 2192-6255 .- 2192-6263. ; , s. 3-13, s. 3-13
  • Bokkapitel (refereegranskat)abstract
    • At the time when the first models of cognitive architectures have been proposed, some forty years ago, understanding of cognition, embodiment and evolution was substantially different from today’s. So was the state of the art of information physics, information chemistry, bioinformatics, neuroinformatics, computational neuroscience, complexity theory, self-organization, theory of evolution, as well as the basic concepts of information and computation. Novel developments support a constructive interdisciplinary framework for cognitive architectures based on natural morphological computing, where interactions between constituents at different levels of organization of matter-energy and their corresponding time-dependent dynamics, lead to complexification of agency and increased cognitive capacities of living organisms that unfold through evolution. Proposed info-computational framework for naturalizing cognition considers present updates (generalizations) of the concepts of information, computation, cognition, and evolution in order to attain an alignment with the current state of the art in corresponding research fields. Some important open questions are suggested for future research with implications for further development of cognitive and intelligent technologies.
  •  
10.
  • Rafiq, Y., et al. (författare)
  • Learning to Share: Engineering Adaptive Decision-Support for Online Social Networks
  • 2017
  • Ingår i: PROCEEDINGS OF THE 2017 32ND IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING (ASE'17). - 1527-1366. - 9781538626849 ; , s. 280-285
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
    • Some online social networks (OSNs) allow users to define friendship-groups as reusable shortcuts for sharing information with multiple contacts. Posting exclusively to a friendship-group gives some privacy control, while supporting communication with (and within) this group. However, recipients of such posts may want to reuse content for their own social advantage, and can bypass existing controls by copy-pasting into a new post; this cross-posting poses privacy risks. This paper presents a learning to share approach that enables the incorporation of more nuanced privacy controls into OSNs. Specifically, we propose a reusable, adaptive software architecture that uses rigorous runtime analysis to help OSN users to make informed decisions about suitable audiences for their posts. This is achieved by supporting dynamic formation of recipient-groups that benefit social interactions while reducing privacy risks. We exemplify the use of our approach in the context of Facebook.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 757
Typ av publikation
konferensbidrag (367)
tidskriftsartikel (235)
licentiatavhandling (44)
doktorsavhandling (34)
rapport (28)
bokkapitel (26)
visa fler...
forskningsöversikt (11)
samlingsverk (redaktörskap) (5)
bok (5)
konstnärligt arbete (1)
annan publikation (1)
patent (1)
visa färre...
Typ av innehåll
refereegranskat (558)
övrigt vetenskapligt/konstnärligt (199)
Författare/redaktör
Bosch, Jan, 1967 (29)
Olsson, Helena Holms ... (18)
Dodig-Crnkovic, Gord ... (16)
Johansson, Mikael, 1 ... (14)
Gulisano, Vincenzo M ... (12)
Papatriantafilou, Ma ... (12)
visa fler...
Wymeersch, Henk, 197 ... (10)
Franzén, Stig, 1943 (9)
Gu, Irene Yu-Hua, 19 ... (9)
Malmqvist, Johan, 19 ... (9)
Wahde, Mattias, 1969 (9)
Mitrokotsa, Aikateri ... (8)
Feldt, Robert, 1972 (8)
Fjeld, Morten, 1965 (8)
Sjöqvist, Bengt-Arne ... (8)
Karlsson, MariAnne, ... (8)
Haghir Chehreghani, ... (8)
Stahre, Johan, 1961 (8)
Gil, Jorge, 1972 (8)
Lindecrantz, Kaj, 19 ... (7)
Skoogh, Anders, 1980 (7)
Ekman, Inger, 1952 (7)
Torgersson, Olof, 19 ... (7)
Chaudron, Michel, 19 ... (6)
Sabelfeld, Andrei, 1 ... (6)
Steghöfer, Jan-Phili ... (6)
Knauss, Eric, 1977 (6)
Almgren, Magnus, 197 ... (6)
Logg, Anders, 1976 (6)
Scandariato, Riccard ... (6)
Johansson, Björn, 19 ... (6)
Bekiroglu, Yasemin, ... (6)
Bergsjö, Dag Henrik, ... (6)
Jolak, Rodi, 1985 (6)
Najdataei, Hannaneh, ... (6)
Holmström Olsson, He ... (6)
Horkoff, Jennifer, 1 ... (5)
Torkar, Richard, 197 ... (5)
Qu, Xiaobo, 1983 (5)
Tsigas, Philippas, 1 ... (5)
Pelliccione, Patrizi ... (5)
Selpi, Selpi, 1977 (5)
Svensson, Lennart, 1 ... (5)
Chen, Fang, 1963 (5)
Engkvist, Ola, 1967 (5)
Yeh, Sonia, 1973 (5)
Fasth, Åsa, 1978 (5)
Stahre Wästberg, Bea ... (5)
Duvignau, Romaric, 1 ... (5)
Liebel, Grischa, 198 ... (5)
visa färre...
Lärosäte
Göteborgs universitet (121)
Malmö universitet (23)
Kungliga Tekniska Högskolan (17)
Mälardalens universitet (11)
Lunds universitet (11)
visa fler...
Högskolan i Borås (9)
RISE (8)
Linköpings universitet (7)
Högskolan i Skövde (7)
Blekinge Tekniska Högskola (6)
Linnéuniversitetet (5)
Stockholms universitet (4)
Jönköping University (4)
Karlstads universitet (4)
Högskolan i Halmstad (3)
Luleå tekniska universitet (2)
Högskolan Väst (2)
Karolinska Institutet (2)
Sveriges Lantbruksuniversitet (2)
VTI - Statens väg- och transportforskningsinstitut (2)
Umeå universitet (1)
Uppsala universitet (1)
Högskolan i Gävle (1)
IVL Svenska Miljöinstitutet (1)
visa färre...
Språk
Engelska (742)
Svenska (15)
Forskningsämne (UKÄ/SCB)
Naturvetenskap (755)
Teknik (411)
Samhällsvetenskap (138)
Medicin och hälsovetenskap (38)
Humaniora (38)
Lantbruksvetenskap (6)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy