| 51. |
- 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.
|
|
| 52. |
- 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.
|
|
| 53. |
- 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.
|
|
| 54. |
- 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.
|
|
| 55. |
- 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..
|
|
| 56. |
- 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.
|
|
| 57. |
- Bernhard, David, et al.
(författare)
-
Security proofs for Participation privacy, receipt-freeness and ballot privacy for the helios voting scheme
- 2017
-
Ingår i: ARES '17 Proceedings of the 12th International Conference on Availability, Reliability and Security. - New York : Association for Computing Machinery (ACM). - 9781450352574
-
Konferensbidrag (refereegranskat)abstract
- The Helios voting scheme is well studied including formal proofs for verifiability and ballot privacy. However, depending on its version, the scheme provides either participation privacy (hiding who participated in the election) or verifiability against malicious bulletin board (preventing election manipulation by ballot stuffing), but not both at the same time. It also does not provide receipt-freeness, thus enabling vote buying by letting the voters construct receipts proving how they voted. Recently, an extension to Helios, further referred to as KTV-Helios, has been proposed that claims to provide these additional security properties. However, the authors of KTV-Helios did not prove their claims. Our contribution is to provide formal definitions for participation privacy and receipt-freeness that we applied to KTV-Helios. In order to evaluate the fulfillment of participation privacy and receipt-freeness, we furthermore applied the existing definition of ballot privacy, which was also used for evaluating the security of Helios, in order to show that ballot privacy also holds for KTV-Helios
|
|
| 58. |
- Bonneau, Charlotte, et al.
(författare)
-
Deconstruction of Crystalline Networks into Underlying Nets: Relevance for Terminology Guidelines and Crystallographic Databases
- 2018
-
Ingår i: Crystal Growth & Design. - : American Chemical Society (ACS). - 1528-7505 .- 1528-7483. ; 18:6, s. 3411-3418
-
Tidskriftsartikel (refereegranskat)abstract
- This communication briefly reviews why network topology is an important tool (for understanding, comparing, communicating, designing, and solving crystal structures from powder diffraction data) and then discusses the terms of an IUPAC project dealing with various aspects of network topology. One is the ambiguity in node assignment, and this question is addressed in more detail. First, we define the most important approaches: the "all node" deconstruction considering all branch points of the linkers, the "single node" deconstruction considering only components mixed, and the ToposPro "standard representation" also considering linkers as one node but, if present, takes each metal atom as a separate node. These methods are applied to a number of metal-organic framework structures (MOFs, although this is just one example of materials this method is applicable on), and it is concluded that the "all node" method potentially yields more information on the structure in question but cannot be recommended as the only way of reporting the network topology. In addition, several terms needing definitions are discussed.
|
|
| 59. |
- Brunetta, Carlo, 1992
(författare)
-
Cryptographic Tools for Privacy Preservation and Verifiable Randomness
- 2018
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Our society revolves around communication. The Internet is the biggest, cheapest and fastest digital communication channel used nowadays. Due to the continuous increase of daily communication among people worldwide, more and more data might be stolen, misused or tampered. We require to protect our communications and data by achieving privacy and confidentiality. Despite the two terms, "privacy" and "confidentiality",are often used as synonymous, in cryptography they are modelled in very different ways. Intuitively, cryptography can be seen as a tool-box in which every scheme, protocol or primitive is a tool that can be used to solve specific problems and provide specific communication security guarantees such as confidentiality. Privacy is instead not easy to describe and capture since it often depends on "which" information is available, "how" are these data used and/or "who" has access to our data. This licentiate thesis raises research questions and proposes solutions related to: the possibility of defining encryption schemes that provide both strong security and privacy guarantees; the importance of designing cryptographic protocols that are compliant with real-life privacy-laws or regulations; and the necessity of defining a post-quantum mechanism to achieve the verifiability of randomness. In more details, the thesis achievements are: (a) defining a new class of encryption schemes, by weakening the correctness property, that achieves Differential Privacy (DP), i.e., a mathematically sound definition of privacy; (b) formalizing a security model for a subset of articles in the European General Data Protection Regulation (GDPR), designing and implementing a cryptographic protocol based on the proposed GDPR-oriented security model, and; (c) proposing a methodology to compile a post-quantum interactive protocol for proving the correct computation of a pseudorandom function into a non-interactive one, yielding a post-quantum mechanism for verifiable randomness.
|
|
| 60. |
- Camilleri, John J., 1986, et al.
(författare)
-
Modelling and analysis of normative documents
- 2017
-
Ingår i: Journal of Logical and Algebraic Methods in Programming. - : Elsevier BV. - 2352-2208 .- 2352-2216. ; 91, s. 33-59
-
Tidskriftsartikel (refereegranskat)abstract
- We are interested in using formal methods to analyse normative documents or contracts such as terms of use, privacy policies, and service agreements. We begin by modelling such documents in terms of obligations, permissions and prohibitions of agents over actions, restricted by timing constraints and including potential penalties resulting from the non-fulfilment of clauses. This is done using the C-O Diagram formalism, which we have extended syntactically and for which we have defined a new trace semantics. Models in this formalism can then be translated into networks of timed automata, and we have a complete working implementation of this translation. The network of automata is used as a specification of a normative document, making it amenable to verification against given properties. By applying this approach to a case study from a real-world contract, we show the kinds of analysis possible through both syntactic querying on the structure of the model, as well as verification of properties using UPPAAL.
|
|
