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) "

Sökning: hsv:(NATURVETENSKAP) hsv:(Data och informationsvetenskap) hsv:(Annan data och informationsvetenskap)

  • Resultat 41-50 av 2150
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
41.
  • Torra, Vicenç, et al. (författare)
  • Data privacy
  • 2019
  • Ingår i: Data science in Practice. - Cham : Springer. - 9783319975566 - 9783319975559 ; , s. 121-132
  • Bokkapitel (refereegranskat)abstract
    • In this chapter we present an overview of the topic data privacy. We review privacy models and measures of disclosure risk. These models and measures provide computational definitions of what privacy means, and of how to evaluate the privacy level of a data set. Then, we give a summary of data protection mechanisms. We provide a classification of these methods according to three dimensions: whose privacy is being sought, the computations to be done, and the number of data sources. Finally, we describe masking methods. Such methods are the data protection mechanisms used for databases when the data use is undefined and the protected database is required to be useful for several data uses. We also provide a definition of information loss (or data utility) for this type of data protection mechanism. The chapter finishes with a summary.
  •  
42.
  • Tossou, Aristide, 1989 (författare)
  • Privacy in the Age of Artificial Intelligence
  • 2017
  • Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • An increasing number of people are using the Internet in their daily life. Indeed, more than 40% of the world population have access to the Internet, while Facebook (one of the top social network on the web) is actively used by more than 1.3 billion users each day (Statista 2017). This huge amount of customers creates an abundance of user data containing personal information. These data are becoming valuable to companies and used in various way to enrich user experience or increase revenue. This has led many citizens and politicians to be concerned about their privacy on the Internet to such an extent that the European Union issued a "Right to be Forgotten" ruling, reflecting the desire of many individuals to restrict the use of their information. As a result, many online companies pledged to collect or share user data anonymously. However, anonymisation is not enough and makes no sense in many cases. For example, an MIT graduate was able to easily re-identify the private medical data of Governor William Weld of Massachusetts from supposedly anonymous records released by the Group Insurance Commission. All she did was to link the insurance data with the publicly available voter registration list and some background knowledge (Ohm 2009). Those shortcomings have led to the development of a more rigorous mathematical framework for privacy: Differential privacy. Its main characteristic is to bound the information one can gain from released data, no matter what side information they have available. In this thesis, we present differentially private algorithms for the multi-armed bandit problem. This is a well known multi round game, that originally stemmed from clinical trials applications and is now one promising solution to enrich user experience in the booming online advertising and recommendation systems. However, as recommendation systems are inherently based on user data, there is always some private information leakage. In our work, we show how to minimise this privacy loss, while maintaining the effectiveness of such algorithms. In addition, we show how one can take advantage of the correlation structure inherent in a user graph such as the one arising from a social network.
  •  
43.
  • Wiqvist, Samuel, et al. (författare)
  • Partially Exchangeable Networks and architectures for learning summary statistics in Approximate Bayesian Computation
  • 2019
  • Ingår i: Proceedings of the 36th International Conference on Machine Learning. - : PMLR. ; 2019-June, s. 11795-11804
  • Konferensbidrag (refereegranskat)abstract
    • We present a novel family of deep neural architectures, named partially exchangeable networks (PENs) that leverage probabilistic symmetries. By design, PENs are invariant to block-switch transformations, which characterize the partial exchangeability properties of conditionally Markovian processes. Moreover, we show that any block-switch invariant function has a PEN-like representation. The DeepSets architecture is a special case of PEN and we can therefore also target fully exchangeable data. We employ PENs to learn summary statistics in approximate Bayesian computation (ABC). When comparing PENs to previous deep learning methods for learning summary statistics, our results are highly competitive, both considering time series and static models. Indeed, PENs provide more reliable posterior samples even when using less training data.
  •  
44.
  • Frid, Emma, et al. (författare)
  • An Exploratory Study On The Effect Of Auditory Feedback On Gaze Behavior In a Virtual Throwing Task With and Without Haptic Feedback
  • 2017
  • Ingår i: Proceedings of the 14th Sound and Music Computing Conference. - Espoo, Finland : Aalto University. - 9789526037295 ; , s. 242-249
  • Konferensbidrag (refereegranskat)abstract
    • This paper presents findings from an exploratory study on the effect of auditory feedback on gaze behavior. A total of 20 participants took part in an experiment where the task was to throw a virtual ball into a goal in different conditions: visual only, audiovisual, visuohaptic and audio- visuohaptic. Two different sound models were compared in the audio conditions. Analysis of eye tracking metrics indicated large inter-subject variability; difference between subjects was greater than difference between feedback conditions. No significant effect of condition could be observed, but clusters of similar behaviors were identified. Some of the participants’ gaze behaviors appeared to have been affected by the presence of auditory feedback, but the effect of sound model was not consistent across subjects. We discuss individual behaviors and illustrate gaze behavior through sonification of gaze trajectories. Findings from this study raise intriguing questions that motivate future large-scale studies on the effect of auditory feedback on gaze behavior. 
  •  
45.
  • Porathe, Thomas, 1954 (författare)
  • e-Navigation in Arctic Conditions: Transmitting High Resolution Ice Routes in First-year Ice
  • 2012
  • Ingår i: Proceedings of Scandinavian Maritime Conference 2012.
  • Konferensbidrag (refereegranskat)abstract
    • A long time ago navigation was done solely by experience: the knowledge was in the head of local pilots. Through the centuries a symbolic system of buoys, cairns and charts developed: knowledge placed in the world, to paraphrase Donald Norman (1990). But Arctic navigation now poses a challenge that will need new solutions. Buoys cannot be stationed in ice as they will be swept away or pushed under. The ice sheet is a shifting, dynamic landscape with few landmarks. Further: in open water the buoy’s function is to warn for stationary shallows, in ice there is the additional need to guide trough passable leads or broken ice channels that move, open and close with the wind and currents. How can e-Navigation tools like Virtual AtoNs assist in Arctic navigation?In this paper findings from a study onboard a Swedish icebreaker in the one-year ice of the Bay of Bothnia are presented as well as proposals for new e-Navigation services to help improve efficiency of ice navigation. Dynamic “ice routes”, sent from icebreakers to other ships entering into the ice will facilitate traffic management in the ice. Transmitting fuel consumption as well as speed for ships in the ice sheet will create a useful indicator of ice conditions. Using updated satellite photos of the ice sheet as underlay in ECDIS, will facilitate ice navigation.
  •  
46.
  • Alahdab, Mohannad, et al. (författare)
  • Empirical Analysis of Hidden Technical Debt Patterns in Machine Learning Software
  • 2019
  • Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Cham : Springer International Publishing. - 1611-3349 .- 0302-9743. ; 11915 LNCS, s. 195-202
  • Konferensbidrag (refereegranskat)abstract
    • Context/Background Machine Learning (ML) software has special ability for increasing technical debt due to ML-specific issues besides having all the problems of regular code. The term “Hidden Technical Debt” (HTD) was coined by Sculley et al. to address maintainability issues in ML software as an analogy to technical debt in traditional software. Goal The aim of this paper is to empirically analyse how HTD patterns emerge during the early development phase of ML software, namely the prototyping phase.  Method Therefore, we conducted a case study with subject systems as ML models planned to be integrated into the software system owned by Västtrafik, the public transportation agency in the west area of Sweden. Results During our case study, we could detect HTD patterns, which have the potential to emerge in ML prototypes, except for “Legacy Features”, “Correlated features”, and “Plain Old Data Type Smell”. Conclusion Preliminary results indicate that emergence of significant amount of HTD patterns can occur during prototyping phase. However, generalizability of our results require analyses of further ML systems from various domains.
  •  
47.
  • Alshareef, Hanaa, 1985, et al. (författare)
  • Transforming data flow diagrams for privacy compliance
  • 2021
  • Ingår i: MODELSWARD 2021 - Proceedings of the 9th International Conference on Model-Driven Engineering and Software Development. - : SCITEPRESS - Science and Technology Publications. ; , s. 207-215
  • Konferensbidrag (refereegranskat)abstract
    • Most software design tools, as for instance Data Flow Diagrams (DFDs), are focused on functional aspects and cannot thus model non-functional aspects like privacy. In this paper, we provide an explicit algorithm and a proof-of-concept implementation to transform DFDs into so-called Privacy-Aware Data Flow Diagrams (PA-DFDs). Our tool systematically inserts privacy checks to a DFD, generating a PA-DFD. We apply our approach to two realistic applications from the construction and online retail sectors.
  •  
48.
  • Andersson, Niclas S, 1971, et al. (författare)
  • Feature-Based Response Classification in Nonlinear Structural Design Simulations
  • 2018
  • Ingår i: SAE International Journal of Vehicle Dynamics, Stability, and NVH. - : SAE International. - 2380-2162 .- 2380-2170. ; 2:3, s. 185-202
  • Tidskriftsartikel (refereegranskat)abstract
    • An applied system design analysis approach for automated processing and classification of simulated structural responses is presented. Deterministic and nonlinear dynamics are studied under ideal loading and low noise conditions to determine fundamental system properties, how they vary and possibly interact. Using powerful computer resources, large amounts of simulated raw data can be produced in a short period of time. Efficient tools for data processing and interpretation are then needed, but existing ones often require much manual preparation and direct human judgement. Thus, there is a need to develop techniques that help to treat more virtual prototype variants and efficiently extract useful information from them. For this, time signals are evaluated by methods commonly used within structural dynamics and statistical learning. A multi-level multi-frequency stimulus function is constructed and simulated response signals are combined into frequency domain functions. These are associated with qualitative system features, such as being periodic or aperiodic, linear or nonlinear and further into subcategories of nonlinear systems, such as fundamental, sub or super harmonic and even or odd order types. Appropriate classes are then determined from selected feature metrics and rules-of-thumb criteria. To automate the classification of large data sets, a support vector machine is trained on categorised responses to determine whether a single feature, or combinations of features, applies or not. The trained classifier can then efficiently process new sets of data and pick out cases that are associated with possible vibrational problems, which subsequently can be further analysed and understood. This article describes elements of the analysis, discuss the effectiveness of evaluated feature metrics, reports practical considerations and results from two separate training study examples.
  •  
49.
  • Atalar, Aras, 1985 (författare)
  • Throughput and energy efficiency of lock-free data structures: Execution Models and Analyses
  • 2018
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • Concurrent data structures are key program components to harness the available parallelism in multi-core processors. Lock-free algorithmic implementations of concurrent data structures offer high scalability and possess desirable properties such as immunity to deadlocks, convoying and priority inversion. In this thesis, we develop analytical tools to model and analyze the throughput and energy consumption of concurrent lock-free data structures. We start our study with a general class of lock-free data structures. Then, we target more specialized designs for lock-free queues. Finally, we focus on the search data structures that possess different characteristics compared to previously mentioned data structures. Performance of lock-free data structures: This thesis contributes to the problem of making ends meet between theoretical bounds and actual measured throughput. As the first step, we consider a general class of lock-free data structures and propose three analytical frameworks with different flavors. Analyses of this class also cover efficient implementations of a set of fundamental data structures that suffer from inherent sequential bottlenecks. We model the executions and examine the impact of contention on the throughput of these algorithms. Our analyses lead to optimization methods on memory management and back-off strategies. Performance and energy efficiency of lock-free queues: We take a step further to model the throughput of lock-free operations and their interaction. Considering shared queues, as a key paradigm for data sharing, operations (En- queue, Dequeue) access the opposite ends of a queue. Same type of operations might contend with each other on a non-empty queue. However, all types of operations are subject to interaction when the queue is empty. We first decorrelate the throughput of dequeuers’ and enqueuers’ into several uncorrelated basic throughputs, and reconstruct the main throughputs as a function of these basic throughputs. Besides, we model the power dissipation and integrate it with the throughput estimations to extract the energy consumption of applications that utilize lock-free queues. Performance of lock-free search data structures: Lock-free designs that utilize fine-grained synchronization have produced efficient implementations of search data structures. These designs reveal different characteristics compared to the previous set of lock-free data structures with inherent sequential bottlenecks. We introduce a new way of modeling and analyzing the throughput of search data structures under stationary and memoryless access patterns..
  •  
50.
  • Bender, Benedikt, et al. (författare)
  • Patterns in the Press Releases of Trade Unions: How toUse Structural Topic Models in the Field of Industrial Relations
  • 2022
  • Ingår i: Industrielle Beziehungen. - : Verlag Barbara Budrich GmbH. - 0943-2779 .- 1862-0035. ; 29:2, s. 91-116
  • Tidskriftsartikel (refereegranskat)abstract
    • Quantitative text analysis and the use of large data sets have received only limited attention in the field of Industrial Relations. This is unfortunate, given the variety of opportunities and possibilities these methods can address. We demonstrate the use of one promising technique of quantitative text analysis – the Structural Topic Model (STM) – to test the Insider-Outsider theory. This technique allowed us to find underlying topics in atext corpus of nearly 2,000 German trade union press releases (from 2000 to 2014). We provide astep-by-step overview of how to use STMsince we see this method as useful to the future of research in the field of Industrial Relations. Until now the methodological publications regarding STM mostly focus on the mathematics of the method and provide only aminimal discussion of their implementation. Instead, we provide apractical application of STM and apply this method to one of the most prominenttheories in the field of Industrial Relations. Contrary to the original Insider-Outsider arguments, but in line with thecurrent state of research, we show that unions do in fact use topics within their press releases which are relevant for both Insider and Outsider groups.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 41-50 av 2150
Typ av publikation
konferensbidrag (981)
tidskriftsartikel (709)
bokkapitel (115)
doktorsavhandling (81)
rapport (79)
licentiatavhandling (71)
visa fler...
annan publikation (52)
forskningsöversikt (20)
bok (14)
samlingsverk (redaktörskap) (11)
proceedings (redaktörskap) (9)
patent (7)
konstnärligt arbete (3)
recension (1)
visa färre...
Typ av innehåll
refereegranskat (1597)
övrigt vetenskapligt/konstnärligt (510)
populärvet., debatt m.m. (42)
Författare/redaktör
Bosch, Jan, 1967 (29)
Daniels, Mats, Profe ... (20)
Bresin, Roberto, 196 ... (18)
Olsson, Helena Holms ... (17)
Harrie, Lars (16)
Hast, Anders, 1966- (16)
visa fler...
Tollmar, Konrad (14)
Johansson, Mikael, 1 ... (14)
Daniels, Mats, 1956- (14)
Roupé, Mattias, 1975 (14)
Ekenberg, Love (13)
Berglund, Anders, 19 ... (13)
Said, Alan (13)
Wittek, Peter (12)
Johansson, Richard, ... (12)
Dodig-Crnkovic, Gord ... (12)
Gulisano, Vincenzo M ... (12)
Papatriantafilou, Ma ... (12)
Seipel, Stefan (12)
Adamaki, Angeliki (11)
Wingkvist, Anna (11)
Wymeersch, Henk, 197 ... (10)
Sintorn, Ida-Maria (10)
Persson, Anna (10)
Magnani, Matteo (10)
Ban, Yifang (10)
Ljung, Patric, 1968- (10)
Ohlsson, Mattias (9)
Franzén, Stig, 1943 (9)
Ericsson, Morgan (9)
Gu, Irene Yu-Hua, 19 ... (9)
Malmqvist, Johan, 19 ... (9)
Linde, Peter, 1956- (9)
Wahde, Mattias, 1969 (9)
Herman, Pawel Andrze ... (9)
Munappy, Aiswarya Ra ... (9)
Mitrokotsa, Aikateri ... (8)
Feldt, Robert, 1972 (8)
Fjeld, Morten, 1965 (8)
Sjöqvist, Bengt-Arne ... (8)
Karlsson, MariAnne, ... (8)
Dahlstedt, Palle, 19 ... (8)
Karlsson, Alexander (8)
Haghir Chehreghani, ... (8)
Danielson, Mats (8)
Stahre, Johan, 1961 (8)
Gil, Jorge, 1972 (8)
Richter, Kai-Florian (8)
Coufalova, Eva (8)
Drsticka, Michal (8)
visa färre...
Lärosäte
Chalmers tekniska högskola (738)
Kungliga Tekniska Högskolan (347)
Göteborgs universitet (189)
Uppsala universitet (182)
Lunds universitet (137)
Linköpings universitet (127)
visa fler...
Stockholms universitet (96)
Umeå universitet (81)
Högskolan i Skövde (76)
Högskolan i Borås (64)
Blekinge Tekniska Högskola (61)
Högskolan i Halmstad (48)
Högskolan i Gävle (44)
Luleå tekniska universitet (35)
Mälardalens universitet (34)
Malmö universitet (34)
Linnéuniversitetet (33)
Mittuniversitetet (30)
RISE (29)
Sveriges Lantbruksuniversitet (27)
Örebro universitet (25)
Jönköping University (23)
Högskolan Dalarna (23)
Karlstads universitet (20)
Karolinska Institutet (8)
Kungl. Musikhögskolan (7)
Södertörns högskola (3)
Högskolan Väst (2)
Konstfack (2)
Handelshögskolan i Stockholm (2)
Försvarshögskolan (2)
VTI - Statens väg- och transportforskningsinstitut (2)
Naturvårdsverket (1)
Riksantikvarieämbetet (1)
Röda Korsets Högskola (1)
visa färre...
Språk
Engelska (2069)
Svenska (73)
Spanska (2)
Portugisiska (2)
Italienska (1)
Odefinierat språk (1)
visa fler...
Finska (1)
Mongoliskt språk (1)
visa färre...
Forskningsämne (UKÄ/SCB)
Naturvetenskap (2147)
Teknik (549)
Samhällsvetenskap (341)
Humaniora (120)
Medicin och hälsovetenskap (97)
Lantbruksvetenskap (16)

Å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