Miracle-dz/UniFAR-FTUs huggingface dataset:
00 DEPSKY : Dependable and Secure Storage in a Cloud-of-Clouds

storage cloud. Each generic data unit, or container, contains two types of files: a signed metadata file and the files that store the data. Metadata files contain the version number and the verification data, together with other information that applications may demand. Notice that a data unit (conceptual or generic) can store several versions of the data, i.e., the container can contain several data files. The name of the metadata file is simply metadata, while the data files are called value-〈Version〉, where 〈Version〉 is the version number of the data (e.g., value-1, value-2, etc.). Finally, in the third level (right) there is the data unit implementation, i.e., the container translated into the specific constructions supported by each cloud provider (Bucket, Folder, etc.). Notice that the one-container-per-data-unit policy may be difficult to implement in some clouds (e.g., Amazon S3 has a limit of 100 buckets per account, limiting the system to 100 data units). However, it is possible to store several data units on the same container as long as the data unit name is used as a prefix of their files names. Conceptual Data Unit Generic Data Unit Data Unit X Container X Version Number Verification Data Metadata Version Number Verification Data Other info Data Amazon S3 Windows Bucket X BlobContainer
Adversarial risk analysis: An overview

Adversarial risk analysis (ARA) is a relatively new area of research that informs decision‐making when facing intelligent opponents and uncertain outcomes. It is a decision‐theoretic alternative to game theory. ARA enables an analyst to express her Bayesian beliefs about an opponent's utilities, capabilities, probabilities, and the type of strategic calculations that the opponent is using to make his decision. Within that framework, the analyst then solves the problem from the perspective of the opponent. This calculation produces a distribution over the actions of the opponent that permits the analyst to maximize her expected utility. This review covers conceptual, modeling, computational, and applied issues in ARA as well as interesting open research issues.
GDP Festschrift ENTCS , to appear A Convenient Category of Domains Dedicated to Gordon Plotkin on the occasion of his 60 th birthday Ingo Battenfeld Matthias Schröder

We motivate and define a category of topological domains, whose objects are certain topological spaces, generalising the usual ω-continuous dcppos of domain theory. Our category supports all the standard constructions of domain theory, including the solution of recursive domain equations. It also supports the construction of free algebras for (in)equational theories, can be used as the basis for a theory of computability, and provides a model of parametric polymorphism.
A Multi-Objective Evolutionary Algorithm to Build Knowledge Classification Rules with Specific Properties

This work proposes the use of evolutionary algorithms to build individual knowledge rules with specific properties that are usually neglected when conducted by traditional supervised learning methods. The proposed evolutionary algorithm uses a rank-based, multi-objective fitness function that enables the arrangement of any set of measures. Experimental results that show the suitability of our proposal are also presented.
Descrip-A Metamorphic Relation-Based Approach to Testing Web Services Without Oracles

Service Oriented Architecture (SOA) has become a major application development paradigm. As a basic unit of SOA applications, Web services significantly affect the quality of the applications constructed from them. In the context of SOA, the specification and implementation of Web services are completely separated. The lack of source code and the restricted control of Web services limit the testability of Web services, and make the oracle problem prominent. In this context, can one alleviate the test oracle problem, or effectively and efficiently test such Web services even without oracles? It is an important issue which has not been yet adequately addressed. To address the challenge of testing Web services, the authors propose a metamorphic relation-based approach to testing Web services without oracles. The proposed approach leverages so-called metamorphic relations to generate test cases and evaluate test results. To make the proposed approach practical and effective, the authors proposed a framework taking into account the unique features of SOA, and developed a prototype which partially automates the framework. Three case studies are conducted to validate the feasibility and effectiveness of the proposed approach. The work presented in the paper not only alleviates the test oracle
InfoSys 2018 & BioSciencesWorld 2018

— An important and unresolved problem is the automatic quantification of voice quality. Many parameters affect the voice quality, but only subjective assessments are crucial. The article makes a proposal to create a solution for the prediction of subjective voice quality assessment. A neural network is used to evaluate the quality of Voice over IP (VoIP) solutions. Computational models of similarity, Musical Instrument Digital Interface (MIDI) analysis and Speech Processing Tools are used to assess intelligibility. Statistics techniques and algorithms are used for building neural networks. The end result is an analysis and an automated hypothesis about sound quality in the Mean Opinion Score (MOS) scale.
Geology and assessment of undiscovered oil and gas resources of the Northwest Laptev Sea Shelf Province, 2008

1 Northwest Laptev Sea Shelf Province . 1 Definition of Province Boundary . 1 Petroleum Occurrence.1 Tectonostratigraphic Evolution . 1 Precambrian . 4 Paleozoic . 4 Mesozoic and Cenozoic . 5 Petroleum-System Elements . 5 Source Rocks.5 Reservoir and Seal Rocks . 6 Traps and Timing . 6 Assessment Units . 6 Northwest Laptev Sea Shelf Assessment Unit . 6 Geological Analysis of Assessment Unit Probability . 6 Geologic Analogs for Assessment . 6 Assessment Results . 10 Acknowledgments . 11 References Cited.11 Appendix.13
Ocean Circulation in Three Dimensions

Physical oceanography extends well beyond the study of the general ocean circulation. Physical oceanographers investigate tides, wind-driven surface waves, air/sea interaction, sound in the ocean, light in the ocean, and physical processes at the sea bed, on beaches and on man-made structures like breakwaters and ships. Physical oceanography is also key to chemical and biological oceanography, and marine geophysics. Through its coupled interaction with the atmosphere, cryosphere, biosphere, and land, the physical state of the ocean also plays a critical part in climate dynamics and Earth system science. Nevertheless, study of the ocean general circulation is central to physical oceanography and is playing a central role in the development of the field. This development involves an interplay between physical observations of the ocean, theories of the fluid dynamics, and numerical models of the circulation. The focus in this book is on the timeaveraged, global ocean currents. In order to approach this topic we must set the stage by reviewing some preliminary ideas about physical oceanography. We are selective in the coverage, only discussing topics that recur later. For comprehensive discussions of empirical methods in physical oceanography, consult the books by Emery and Thompson (2001) or Wunsch (2015). For more details on dynamical oceanography consult Vallis (2006), Marshall and Plumb (2008), or Pedlosky (1996), among others. For reflections on the field’s history, Jochem and Murtugudde (2006) and Mills (2011) are good starting points .
An agent-based peer-to-peer grid computing architecture: convergence of grid and peer-to-peer computing

The conventional computing Grid has developed a service oriented computing architecture with a super-localresource management and scheduling strategy. This architecture is limited in modeling computer systems with highly dynamic and autonomous computing resources due to its server-based computing model. The super-local resource management and scheduling strategy also limits the utilization of the computing resources. In this paper, we propose a multi-agent based Peer-to-Peer Grid computing architecture.This novel architecture solves the above issues, while provides reasonable compatibility and interoperability with the conventional Grid systems and clients. The main characteristics of this architecture are highlighted by its promising performance and scalability, and its adaptive resource management and scheduling mechanisms. With this architecture, is promising to build large scale high performance commodity computing Grids at low cost.
Using A Relational System On Wall Street: The Good, The Bad, The Ugly, And The Ideal

Edgar H. Sibley Panel Editor Developers of a Wall Street financial application were able to exploit a relational DBMS to advantage for some data management tasks (the good). For others, the relational system was not helpful (the bad), or could be pressed in to service only by means of major or minor con tortions (the ugly). The authors identify database constructs that would have simplified developing the application (the ideal).
Cell Breathing Techniques for Load Balancing in Wireless LANs

Maximizing network throughput while providing fairness is one of the key challenges in wireless LANs (WLANs). This goal is typically achieved when the load of access points (APs) is balanced. Recent studies on operational WLANs, however, have shown that AP load is often substantially uneven. To alleviate such imbalance of load, several load balancing schemes have been proposed. These schemes commonly require proprietary software or hardware at the user side for controlling the user-AP association. In this paper we present a new load balancing technique by controlling the size of WLAN cells (i.e., AP’s coverage range), which is conceptually similar to cell breathing in cellular networks. The proposed scheme does not require any modification to the users neither the IEEE 802.11 standard. It only requires the ability of dynamically changing the transmission power of the AP beacon messages. We develop a set of polynomial time algorithms that find the optimal beacon power settings which minimize the load of the most congested AP. We also consider the problem of network-wide min-max load balancing. Simulation results show that the performance of the proposed method is comparable with or superior to the best existing association-based methods.
ScanMatch : A novel method for comparing fixation sequences

692 PS The last 30 years has seen an explosion of interest in eye movements as both a topic of study and a research tool for probing perceptual, cognitive, and neural processes (Findlay & Gilchrist, 2003; Rayner, 2009). With an increase in the availability of eyetrackers and a reduction in their cost, eye movement studies have flourished not only in vision research (e.g., Parkhurst, Law, & Niebur, 2002; Tatler, Baddeley, & Gilchrist, 2005) but also in language (see Rayner, 1998, 2009), advertising (e.g., Maughan, Gutnikov, & Stevens, 2007; Pieters, Rosbergen, & Wedel, 1999), clinical (e.g., Mosimann et al., 2005), and animal (e.g., Kirchner & Thorpe, 2006) research. Although these fields differ widely in their aims and goals, one common denominator among them is the techniques used to study and analyze the eye movements. The majority of studies in this area are concerned with the saccadic eye movement response. Saccadic eye movements are the fast ballistic movements in which the eye moves rapidly from one location to another. Between saccades, the eye is stationary; these periods of time are referred to as fixations, and it is during these time intervals that useful visual information is gathered (see Carpenter, 1988, for more details). Despite the growing interest in saccades and fixations, most methods of analysis rely on saccade latencies (time to initiate a saccade; see, e.g., Zingale & Kowler, 1987) or the fixation locations as primary measures of behavior. In the vast majority of the literature on eye movements, saccade amplitude or duration, number of fixations, fixation durations, or other close derivatives have been used as the main measures. However, despite saccades being fundamentally sequential (one saccade is followed by the next one), very few methods are available for studying their sequential properties. Markov models (Markov, 1971) have been used rather successfully in some domains, such as eye movement modeling in reading (Engbert & Kliegl, 2001), but implementing them is complex. Another, more widely applied method, which takes into account fixation order, is Levenshtein distance (Levenshtein, 1966), more commonly referred to as the string edit method. Levenshtein distance measures the editing cost of transforming one string into another one, using, in its basic form, a set of three operations (insertion, deletion, and substitution), with a cost of one for each operation. The Levenshtein distance metric is given by the minimal score or minimum editing cost between two strings. More advanced versions can be found, either by using transposition as an extra operation (Wagner & Lowrance, 1975) or by assigning different weights to each operation (Okuda, Tanaka, & Kasai, 1976). Such methods have been successfully used by a number of authors to study saccade sequences (e.g., Brandt & Stark, 1997; Choi, Mosley, ScanMatch: A novel method for comparing fixation sequences
CODEIN – A NEW NOTATION FOR GOMS TO HANDLE EVALUATIONS OF REALITY BASED INTERACTION STYLE INTERFACES Corresponding

We propose a new diagrammatic notation system for GOMS, called Codein, with extensions to support the evaluation of Reality Based Interaction Styles (RBIs). The proposed notation gives added power to GOMS to model and evaluate the task completion time of parallel actions during the performance of a task, something that was previously only possible using CPM-GOMS, which is far more complicated to use. Codein's evaluative power is verified through an experiment. The first condition of the experiment compares the completion time predicted by a GOMSL model, a Codein model, and the actual completion time of participants in a direct manipulation task. The second compares the completion time of participants in a Tangible User Interface task with predictions by a GOMSL model and a Codein model. Predicted task times by Codein in both conditions come close to the actual experimental results.
MotionReader: Visual Acceleration Cues for Alleviating Passenger E-Reader Motion Sickness

We investigate alleviating the motion sickness experienced by passengers who read using tablet computers or phones, by displaying a visual cue of the acceleration that the passenger undergoes while traveling. This visual cue is meant to eliminate the sensory conﬂict between the perceived acceleration and the lack of visual indication of the acceleration. The acceleration is measured with sensors integrated in the e-reader. We investigate two visual acceleration cues, the text inertia cue, that displaces the text in the direction opposite to the acceleration, and Gizmo cue, that renders a ball-spring Gizmo adjacent to the text, and that reacts to the acceleration. We have conducted a user study that reveals that the Gizmo cue ex-acerbates motion sickness symptoms, and that the text inertia cue is effective at alleviating motion sickness symptoms.
Efficient Modular Reduction Algorithm in IF q [x] and Its Application to "Left to Right" Modular Multiplication in IF 2 [x].

This paper describes a new efficient method of modular re- duction in IFq(x) suited for both software and hardware implementations. This method is particularly well adapted to smart card implementations of elliptic curve cryptography over GF(2 p ) using a polynomial represen- tation. Many publications use the equivalent in IF2(x) of Montgomery's modular multiplication over integers. We show here an equivalent in IF q(x) to the generalized Barrett's modular reduction over integers. The attractive properties of the last method in IF2(x) allow nearly ideal imple- mentations in hardware as well as in software with minimum additional resources as compared to what is available on usual processor architec- ture. An implementation minimizing the memory accesses is described for both Montgomery's implementation and ours. This shows identical computing and memory access resources for both methods. The new method also avoids the need for the bulky normalization (denormalization) which is required by Montgomery's method to obtain a correct result.
Public space as a design factor in sharable technologies

This position paper reports on some very early collaboration between an interaction design research group at Huddersfield University (live:lab) and a not-for-profit organisation known as Blink Media, also based in Huddersfield. Blink Media are grant funded through bodies such as NESTA and The Arts Council. Collaboration with live:lab was formed through a common interest in the design of creative user experiences using emerging and innovative technologies with an appreciation that our respective approaches were very different. Blink Media create artefacts and user experiences that are purely novel, intriguing and engaging. In contrast live:lab’s approach is to build an empirical and theoretical understanding of interaction design in terms of novel interactive technologies and in particular pragmatic design techniques required to develop them. This paper reports on some initial interviews with Blink Media to understand their design and development approach to interactive technologies that employ sharable interfaces. There is a growing interest in providing sharable displays and developing an understanding of engagement. For example, studies have explored social engagement in closed public events
EcoCyc: Encyclopedia of Escherichia coli genes and metabolism

The encyclopedia of Escherichia coli genes and metabolism (EcoCyc) is a database that combines information about the genome and the intermediary metabolism of E.coli. The database describes 3030 genes of E.coli , 695 enzymes encoded by a subset of these genes, 595 metabolic reactions that occur in E.coli, and the organization of these reactions into 123 metabolic pathways. The EcoCyc graphical user interface allows scientists to query and explore the EcoCyc database using visualization tools such as genomic-map browsers and automatic layouts of metabolic pathways. EcoCyc can be thought of as an electronic review article because of its copious references to the primary literature, and as a (qualitative) computational model of E.coli metabolism. EcoCyc is available at URL http://ecocyc.PangeaSystems. com/ecocyc/
BULGARIAN ACADEMY OF SCIENCES

Internet of Things (IoT) is the predominant emerging technology that targets on facilitating interconnection of internet-enabled resources. IoT applications concentrate on automating different tasks that facilitate physical objects to act autonomously without any human interventions. The emerging and current IoT applications are determined to be highly significant for improving the degree of efficiency, comfort and automation for its users. Any kind of security breach on the system will directly influences the life of the humans In this paper, a comprehensive review on Privacy requirements and application layer Security in Internet of Things (IoT) is presented for exploring the possible security issues in IoT that could be launched over the individual layers of IoT architecture. This review explores different challenges of classical security solutions that are related to authentication, key management and cryptographic solutions.It also presents the details of existing access control and device authentication schemes with their pros and cons.
Economics of Education Review

We carry out a randomized experiment involving undergraduate students enrolled at an Italian University attending two introductory economics classes to evaluate the impact on achievement of examination frequency and interim feedback provision. Students in the treated group were allowed to undertake an intermediate exam and were informed about the results obtained, while students in the control group could only take the ﬁnal exam. The results show that students undertaking the intermediate exam perform better both in terms of the probability of passing the exams and of grades obtained. High ability students appear to beneﬁt more from the treatment. The experiment design allows us to disentangle “workload division or commitment” effects from “feedback provision” effects. We ﬁnd that the estimated treatment impact is due exclusively to the ﬁrst effect, while the feedback provision has no positive effect on performance. Finally, the better performance of treated students in targeted examinations seems not to be obtained at the expenses of results earned in other examinations.
Structure comparison and alignment.

Since the 1970s, after the seminal work of Rossmann and Argos (1978) comparing binding sites of known enzyme structures, the comparison and alignment of protein structures has come to be a fundamental and widely used task in computational structure biology. Three main steps are needed for comparing two protein structures: first, the detection of their common similarities; second, the alignment of the structures based on such similarities; and third, a statistical measure of the similarity. Considering the first two steps, structure comparison refers to the analysis of the similarities and differences between two or more structures, and structure alignment refers to establishing which amino acid residues are equivalent between them. The majority of commonly used methods do a reasonably good job in recognizing obvious similarities between protein structures. However, the alignment of two or more structures is a more difficult task, and its accuracy may depend on the method or program used as well as what the user is trying to accomplish, which will be discussed subsequently. All programs that are briefly described in this chapter perform both steps and are commonly known as protein structure alignment methods. It is also important to immediately clear up any confusion between structure alignment and structure superposition since such terms are often interchanged in the literature. As mentioned above, structure alignment tries to identify the equivalences between pairs of amino acid residues from the structures to superpose, while structure superposition requires the previous knowledge of such equivalences. Thus, structure superposition tries to solve the simpler geometrical task of minimizing the distance between already known equivalent residues of the superimposed structures by finding a transformation that produces either the lowest root-mean-square deviation (RMSD) or the maximal equivalences within an