Miracle-dz/UniFAR-FTUs huggingface dataset:
Threshold Password-based Authenticated Key Exchange using Matrix

Authentication protocols rely on the possession of keys by the parties to be authenticated. For security, keys must be chosen randomly and have to have a long length from 100 bits to thousands of bits. But such keys are difficult to memorize for humans. Password-based authenticated key exchange protocols offer an efficient method to achieve an authentication and a secure communication between two parties who share a secret key. For past decade, many protocols were proposed. Some of the properties of the most dominant protocols are based on the Diffie-Hellman messages or RSA assumption. Hence it has a computational overhead, especially in the client side. In this paper, we present two new protocols: client-server protocol and three-party protocol. Our protocols don’t require the RSA assumption or Diffie-Hellman messages. Proposed protocols are based on the Blom’s scheme [1]. Even though, our protocols have a threshold property and have to use two secret values, we reduced a computational overhead in the both sides and have the forward secrecy.
Unfolding network communities by combining defensive and offensive label propagation

Label propagation has proven to be a fast method for detecting communities in complex networks. Recent work has also improved the accuracy and stability of the basic algorithm, however, a general approach is still an open issue. We propose different label propagation algorithms that convey two unique strategies of community formation, namely, defensive preservation and offensive expansion of communities. Furthermore, the strategies are combined in an advanced label propagation algorithm that retains the advantages of both approaches; and are enhanced with hierarchical community extraction, prominent for the use on larger networks. The proposed algorithms were empirically evaluated on different benchmarks networks with planted partition and on over 30 real-world networks of various types and sizes. The results confirm the adequacy of the propositions and give promising grounds for future analysis of (large) complex networks. Nevertheless, the main contribution of this work is in showing that different types of networks (with different topological properties) favor different strategies of community formation.
The Design of the {OpenBSD} Cryptographic Framework

Cryptographic transformations are a fundamental building block in many security applications and protocols. To improve performance, several vendors market hardware accelerator cards. However, until now no operating system provided a mechanism that allowed both uniform and efficient use of this new type of resource. We present the OpenBSD Cryptographic Framework (OCF), a service virtualization layer implemented inside the kernel, that provides uniform access to accelerator functionality by hiding card-specific details behind a carefully-designed API. We evaluate the impact of the OCF in a variety of benchmarks, measuring overall system performance, application throughput and latency, and aggregate throughput when multiple applications make use of it. We conclude that the OCF is extremely efficient in utilizing cryptographic accelerator functionality, attaining 95% of the theoretical peak device performance, and over 800 Mbit/sec aggregate throughput using 3DES. We believe that this validates our decision to opt for ease of use by applications and kernel components through a uniform API, and for seamless support for new accelerators. Furthermore, our evaluation points to several bottlenecks in system and operating system design: data copying between user and kernel modes, PCI bus signaling inefficiency, protocols that use small data units, and single-threaded applications. We offer several suggestions for improvements and directions for future work.
Automated Watershed Evaluation of Flat Terrain

Catchment area and watershed delineation is a common task in hydrology. The determination of the catchment is still as a challenge considered being crucial key issues particular in flat terrains. Three concepts could be briefly identified through: the manual delineation of a catchment based on a topographic map with contour lines which is a difficult task for flat terrains, by combination of field survey or evaluation of satellite images. The present research is focus on evaluating the possibility to delineate catchments from flat and arid areas by means of DTM avoiding hard techniques like river burning or other manual hydrological DTM corrections. Three GIS packages were used (Arc Hydrotools, TNTmips and RiverTools) within two DEM: the 90 m and 30 m SRTM in addition to the ASTER 30 m, the application sample presented by western Iraq desert—Ubaiydh wadi. A brief review is given how the delineation algorithms have been developed since the 1980’s. Where result shows that automated watershed analysis of flat terrains is cannot be done without manual evaluation and correction either by using several seeding points or river burning technique.
Duplicate Detection for Protein Data Using Simple Close Algorithm

Due to the exploratory nature of biological database commercial and publicly, they are invited some drawback such as inaccurate, incomplete, duplicate and outdated of the genome data. Some work must be done to maintain quality data in genome data. Our objective in this paper is to provide a duplicate detection framework which focus on duplicate records in a real world Mice data protein database using simple close algorithm (SCA). SCA is an enhancement of work where they used a priori algorithm to generate the rule. In our approach we used matrix structure to represent data in a database. We implement SCA using Java programming language on 1.4 GHz Pentium 4 PC machine. As a result we show SCA can produces less duplicate rule (non-redundant) than a priori without loss of information and also improves the execution time
Performance evaluation of effect of nonlinear distortion in SC-FDMA system

In up-link wireless access communication, the transmitter needs good linearity but low power efficiency power amplifier. If the nonlinear power amplifier is used for improving the power usage efficiency, the higher peak-to-average power ratio (PAPR) signal suffers from nonlinear distortion. The effect of nonlinear distortion to Single Carrier-Frequency Division Multiple Access (SC-FDMA) has not been evaluated yet. In this paper, the performance of effect of nonlinear distortion to SC-FDMA is evaluated in terms of PAPR, out-of-band radiation and bit error rate with computer simulation, where there are two types of access scheme in SC-FDMA, first one is interleaved frequency division multiple access (IFDMA) and second one is localized frequency division multiple access (LFDMA). From the simulation results, we clarify IFDMA or LFDMA has the higher robustness for nonlinear distortion.
Part-of-speech Tagging 1.1 Introduction

Part-of-speech (POS) tagging is the task of determining the correct parts of speech for a sequence of words. Words are often ambiguous wrt. part of speech. The word back e.g. is a noun in the sentence They stabbed him in the back, a finite verb in the sentence The senators back the tax reduction, an infinitive verb in the sentence They will back the proposal, an adjective in the sentence The charity owes $400,000 in back taxes, and an adverb in the sentence It's too late to put the genie back in the bottle. POS tagging is useful for a large number of applications: It is the first analysis step in many syntactic parsers. It is required for the correct lemmatization of words like saw which is ambiguous between the noun saw and the past tense form of the verb to see, and it is used in information extraction, speech synthesis, lexicographic research, term extraction, and many other applications. The set of tags assigned by a part of speech tagger may contain just a dozen tags or many hundred tags. A typical tagset size is somewhere between 50 and 150 tags. Larger tagsets with several hundred tags are sometimes used with morphologically rich languages like German where the number, gender and case features of nouns, adjectives, and determiners lead to an explosion in the number of tags. However, POS tagging with such large tagsets is difficult for most taggers due to sparse data problems and because some ambiguities are hard to resolve without global context. Compare the two German sentences Er hat seine Frau gesprochen. (He has his wife talked. – He has talked to his wife.) and Dann hat seine Frau gesprochen. (Then has his wife talked. – Then, his wife has talked.). The noun phrase die Frau is the accusative object in the first sentence, but the nominative subject in the second sentence. The disambiguation of the case is hardly feasible without a complete analysis of the sentence, which is the task of a parser (see chapter ? of this book). POS tags only represent morphosyntactic distinctions. A POS tagger is therefore able to distinguish between the noun reading and the verb reading of the word accent, but 1
Functional Size Measurement Patterns: A Proposed Approach

This paper introduces the concepts of functional size measurement (FSM) patterns. These FSM patterns apply to the COSMIC FSM method and may help in solving several issues, such as being able to do an early sizing for estimation, helping inexperienced measurers in learning how to apply the COSMIC method by establishing the relationship between the method rules and the measurement results, avoiding measurement errors, and reducing measurement effort. The approach used to define FSM patterns is Design Science Research. This paper explores the motivation factors, defines the objectives of the solution, and describes the design and development of FSM patterns. FSM patterns can be defined for a portion of a functional process, a single functional process type, a set of functional process types having a main data group - or object of interest - as their common starting point, or a large set of functional processes handling multiple data groups. These types of FSM patterns have been defined as "micro FSM pattern", "basic FSM pattern", "composite FSM pattern", and "multi-composite FSM pattern" respectively. FSM patterns examples are given to demonstrate their applicability in information systems for all four FSM pattern types. Application of FSM pattern with embedded real-time systems is discussed, along with other potential usage benefits for the industry.
Rapid Focused Sequencing: A Multiplexed Assay for Simultaneous Detection and Strain Typing of Bacillus anthracis, Francisella tularensis, and Yersinia pestis

Background The intentional release of Bacillus anthracis in the United States in 2001 has heightened concern about the use of pathogenic microorganisms in bioterrorism attacks. Many of the deadliest bacteria, including the Class A Select Agents Bacillus anthracis, Francisella tularensis, and Yersinia pestis, are highly infectious via the pulmonary route when released in aerosolized form. Hence, rapid, sensitive, and reliable methods for detection of these biothreats and characterization of their potential impact on the exposed population are of critical importance to initiate and support rapid military, public health, and clinical responses. Methodology/Principal Findings We have developed microfluidic multiplexed PCR and sequencing assays based on the simultaneous interrogation of three pathogens per assay and ten loci per pathogen. Microfluidic separation of amplified fluorescently labeled fragments generated characteristic electrophoretic signatures for identification of each agent. The three sets of primers allowed significant strain typing and discrimination from non-pathogenic closely-related species and environmental background strains based on amplicon sizes alone. Furthermore, sequencing of the 10 amplicons per pathogen, termed “Rapid Focused Sequencing,” allowed an even greater degree of strain discrimination and, in some cases, can be used to determine virulence. Both amplification and sequencing assays were performed in microfluidic biochips developed for fast thermal cycling and requiring 7 µL per reaction. The 30-plex sequencing assay resulted in genotypic resolution of 84 representative strains belonging to each of the three biothreat species. Conclusions/Significance The microfluidic multiplexed assays allowed identification and strain differentiation of the biothreat agents Bacillus anthracis, Francisella tularensis, and Yersinia pestis and clear discrimination from closely-related species and several environmental background strains. The assays may be extended to detect a large number of pathogens, are applicable to the evaluation of both environmental and clinical samples, and have the potential to be applied in military, public health, and clinical diagnostic settings.
Analysis of three-phase rectifiers with constant-voltage loads

This paper presents a quantitative analysis of the operating characteristics of three-phase bridge rectifiers with AC-side reactance and constant-voltage loads. We describe the operating characteristics of the three-phase diode bridge rectifier in continuous conduction mode. Simple approximate expressions are derived for the output current characteristic, as well as the input power factor. The output current control characteristic is also derived for the three-phase thyristor bridge converter with constant-voltage load. The derived analytical expressions are applied to a practical example and simulations are utilized to validate the analytical results.
ON THE RANK OF ELLIPTIC CURVES

Notation. K will always denote a number eld. xI. Ranks of Families of Elliptic Curves For our purposes, a family of elliptic curves will be given by an equation E : y 2 = x 3 + A(T)x + B(T); A(T); B(T) 2 KT]; (T) = 4A(T) 3 + 27B(T) 2 6 = 0: We will always assume that E is non-split (i.e., is not obtained by base extension from a curve deened over K). The rank Generic Rank = Rank E(K(T)) is the rank of the family as an elliptic curve over the function eld K(T), or equivalently the rank of its group of sections as an elliptic surface over P 1 K. It is diicult to produce families of high rank, especially for K = Q. Mestre has given a construction which allows one to construct families of at least moderately high rank.
Multichannel Dereverberation Theorems and Robustness Issues

Multichannel dereverberation amounts to the inversion of a multiple-input/multiple-output linear time-invariant system. In this paper, necessary and sufficient conditions for perfect dereverberation using stable and finite impulse response (FIR) filters are established. It is then shown that the inverse system given by the pseudoinverse of the original transfer function matrix exhibits a noise reduction property. A necessary and sufficient condition under which this pseudoinverse system is FIR is also given. Further, an FIR approximation to the pseudoinverse system is considered and the effects of the length of this approximation on the dereverberation accuracy are investigated. Finally, an analytical and numerical assessment of the dependence of the dereverberation accuracy on the accuracy of the acquisition of room impulse responses is provided.
Reliability and validity of the Chronic Liver Disease Questionnaire (CLDQ) in adults with non-alcoholic steatohepatitis (NASH)

Introduction Significant impairments in health-related quality of life (HRQL) in patients with non-alcoholic fatty liver disease have been previously described. The disease-specific HRQL among patients with non-alcoholic steatohepatitis (NASH), however, remains unknown. Aim To determine the degree of construct validity of the Chronic Liver Disease Questionnaire (CLDQ) in adults with NASH. Methods Participants referred for the evaluation of histology-proven NASH at Mayo Clinic, Rochester, between 1996 and 2000, were evaluated. HRQL assessment by the Short-Form 36 (SF-36) Health Survey and CLD) was performed. The primary outcome was to determine the level of correlation between overall and subscale scores for the CLDQ and SF-36 instruments. Results Among 79 participants (70%) with NASH completing both questionnaires (mean age, 51.2 years with 64% female gender), excellent reliability was noted for the CLDQ instrument. Significant reductions in all SF-36 domains (p<0.05 for all) including PCS and MCS scores (p<0.02 for both) among participants with NASH compared with normative data from an age-matched and sex-matched US general population sample was observed. Highly significant correlations were observed between overall CLDQ score with SF-36 PCS (r=0.82, p<0.0001) and SF-36 MCS (r=0.67, p<0.0001) scores. Similar degrees of correlation were observed between relevant subscales of the CLDQ and SF-36 as well. Discussion The CLDQ has excellent reliability and validity of construct for HRQL assessment in adults with NASH when compared with the SF-36. Future investigations among participants with NASH require assessing the responsiveness of the CLDQ to medical therapies and disease progression.
ILP-Based energy minimization techniques for banked memories

Main memories can consume a significant portion of overall energy in many data-intensive embedded applications. One way of reducing this energy consumption is banking, that is, dividing available memory space into multiple banks and placing unused (idle) memory banks into low-power operating modes. Prior work investigated code-restructuring- and data-layout-reorganization-based approaches for increasing the energy benefits that could be obtained from a banked memory architecture. This article explores different techniques that can potentially coexist within the same optimization framework for maximizing benefits of low-power operating modes. These techniques include employing nonuniform bank sizes, data migration, data compression, and data replication. By using these techniques, we try to increase the chances for utilizing low-power operating modes in a more effective manner, and achieve further energy savings over what could be achieved by exploiting low-power modes alone. Specifically, nonuniform banking tries to match bank sizes with application-data access patterns. The goal of data migration is to cluster data with similar access patterns in the same set of banks. Data compression reduces the size of the data used by an application, and thus helps reduce the number of memory banks occupied by data. Finally, data replication increases bank idleness by duplicating select read-only data blocks across banks. We formulate each of these techniques as an ILP (integer linear programming) problem, and solve them using a commercial solver. Our experimental analysis using several benchmarks indicates that all the techniques presented in this framework are successful in reducing memory energy consumption. Based on our experience with these techniques, we recommend to compiler writers for banked memories to consider data compression, replication, and migration.
Numerical Tests for the Recovery of the Gravity Field by Fast Boundary Element Methods

The purpose of this paper is to test the applicability of a fast boundary element method in the context of geoid computations of the gravity. The fast multipole method is the method of choice due to the its advantageous property of a fast evaluation in the post-processing. Several sets of trianglar meshes for the approximation of the unit sphere and several modifications of the prediscribed data have been tested. Also, adapted settings of the fast multipole method have been applied. Finally, the potential of fast boundary element method for this kind of applcations is shown. 1 The single layer potential ansatz and the fast multipole method First numerical tests have been executed to evaluate the potential use of fast approximation techniques like the fast multipole method [3], adaptive cross approximation [1] and hierarchical matrix arithmetics [4]. As test problem for geoid computations of the gravity, a single layer potential ansatz 1 4π ∫ Γ 1 |xl − y| t(y)dsy = f(xl) was chosen to recover the predescribed data f(xl) for l = 1, . , M by an unknown density function t. The surface Γ of the unit sphere is approximated by several sets of plane triangles. The unknown density function t(x) is approximated by a linear combination of piecewise constant trial functions,
049011 : Algorithms for Large Data Sets Spring 2005 Lecture

We will continue the study of the Distinct Elements problem in the data stream model [6, 1, 3]. Its goal is to find a number of distinct elements in a stream of input elements. The length of the input stream can be huge, so storing all the input elements in memory is not an option. According to the data stream model, the input elements arrive and have to be processed serially, not allowing random access to any ”past” or ”future” elements. We will use the following notation:
Performance measures for multilabel evaluation: a case study in the area of image classification

With the steadily increasing amount of multimedia documents on the web and at home, the need for reliable semantic indexing methods that assign multiple keywords to a document grows. The performance of existing approaches is often measured with standard evaluation measures of the information retrieval community. In a case study on image annotation, we show the behaviour of 13 different evaluation measures and point out their strengths and weaknesses. For the analysis, data from 19 research groups that participated in the ImageCLEF Photo Annotation Task are utilized together with several configurations based on random numbers. A recently proposed ontology-based measure was investigated that incorporates structure information, relationships from the ontology and the agreement between annotators for a concept and compared to a hierarchical variant. The results for the hierarchical measure are not competitive. The ontology-based results assign good scores to the systems that got also good ranks in the other measures like the example-based F-measure. For concept-based evaluation, stable results could be obtained for MAP concerning random numbers and the number of annotated labels. The AUC measure shows good evaluation characteristics in case all annotations contain confidence values.
Choice and Comparaison Where the User Wants Them: Subjunctive Interfaces for Computer-supported Exploration

There are many kinds of computer systemthat are intended to support users in performingan exploration among a range of possible results.However, such tools often allow only narrowprogress through the result space, forcing users totrade off the breadth of search they would like topursue against the time and effort required. Theaim of the ‘subjunctive interface’ concept is tomake broader searches more manageable, by lettingusers propose multiple alternative values for eachparameter where normally only a single value canbe supplied, and by supporting the viewing andcomparison of the various resulting outcomes.This paper clariﬁes the motivation andprinciples underlying the subjunctive interfaceconcept, describes implementation work thatillustrates the approach, and outlines directions forfurther pursuit of this research.Keywords: user interface, interaction styles,interaction techniques, cognitive dimensions,subjunctive interface, parameter exploration, medicalimage segmentation
A novel 2D filter design methodology for heterogeneous devices

In many image processing applications, fast convolution of an image with a large 2D filter is required. Field programable gate arrays (FPGAs) are often used to achieve this goal due to their fine grain parallelism and reconfigurability. However, the heterogeneous nature of modern reconfigurable devices is not usually considered during design optimization. This paper proposes an algorithm that explores the implementation architecture of 2D filters, targeting the minimization of the required area, by optimizing the usage of the different components in a heterogeneous device. Experiments show that the proposed algorithm can achieve a reduction in the required area in a range o to 70% when compared to current techniques.