Miracle-dz/UniFAR-FTUs huggingface dataset:
General Security Definition and Composability for Quantum & Classical Protocols

We generalize the universally composable definition of Canetti to the Quantum World. The basic idea is the same as in the classical world. The main contribution is that we unfold the result in a new model which is well adapted to quantum protocols. We also simplify some aspects of the classical case. In particular, the case of protocols with an arbitrary number of layers of sub-protocols is naturally covered in the proposed model.
Using software metrics in the evaluation of a conceptual component model

Every interactive system has a functional part and an interactive part. However the software engineering and the human-computer-interaction communities work separately in terms of methods, models and tools, which induces a work overhead for integrating the results of these efforts, as well as increased inconsistency risks. We endeavour to treat this problem by proposing a design method, which couples the functional kernel and the interaction design. In particular, this method proposes a specific way of structuring the interaction and the business spaces. The structure is based on components called Symphony Objects. In this article, we attempt to evaluate the technical aspect of a Symphony Object model issued from the method by measuring its implementations with software metrics.
INFRARED STUDIES OF EPSILON AURIGAE IN ECLIPSE

We report here on a series of medium resolution spectro-photometric observations of the enigmatic long period eclipsing binary epsilon Aurigae, during its eclipse interval of 2009–2011, using near-infrared spectra obtained with SpeX on the Infrared Telescope Facility (IRTF), mid-infrared spectra obtained with BASS on AOES and IRTF, MIRSI on IRTF, and MIRAC4 on the MMT, along with mid-infrared photometry using MIRSI on IRTF and MIRAC4 on the MMT, plus 1995–2000 timeframe published photometry and data obtained with Denver's TNTCAM2 at WIRO. The goals of these observations included: (1) comparing eclipse depths with prior eclipse data, (2) confirming the re-appearance of CO absorption bands at and after mid-eclipse, associated with sublimation in the disk, (3) seeking evidence for any mid-infrared solid state spectral features from particles in the disk, and (4) providing evidence that the externally irradiated disk has azimuthal temperature differences. IR eclipse depths appear similar to those observed during the most recent (1983) eclipse, although evidence for post-mid-eclipse disk temperature increase is present, due to F star heated portions of the disk coming into view. Molecular CO absorption returned 57 days after nominal mid-eclipse, but was not detected at mid-eclipse plus 34 days, narrowing the association with differentially heated sub-regions in the disk. Transient He i 10830A absorption was detected at mid-eclipse, persisting for at least 90 days thereafter, providing a diagnostic for the hot central region. The lack of solid-state features in Spitzer Infrared Spectrograph, BASS, and MIRAC spectra to date suggests the dominance of large particles (micron-sized) in the disk. Based on these observations, mid-infrared studies out of eclipse can directly monitor and map the disk thermal changes, and better constrain disk opacity and thermal conductivity.
The Multidimensional Scaling and Barycentric Coordinates Based Distributed Localization in Wireless Sensor Networks

Position information is vital for wireless sensor networks in many applications. In this paper, based on the barycentric coordinate system, we incorporate a term constrains sensors to remain the intrinsic structure revealed by range measurements between neighboring nodes into the STRESS function, which is the cost function optimized by the distributed weighted-multidimensional scaling algorithm (dwMDS). By minimizing the modified cost function, we derive a distributed localization algorithm called the Multidimensional Scaling and Barycentric Coordinates based Distributed Localization Algorithm (MDS_BC_DLA). Experimental results on four different types of WSNs show MDS_BC_DLA outperforms dwMDS.
BIASES IN C O M P U T E D RETURNS An Application to the Size Effect *

Previous estimates of a 'size effect' based on daily returns data are biased. The use of quoted closing prices in computing returns on individual stocks imparts an upward bias. Returns computed for buy-and-hold portfolios largely avoid the bias induced by closing prices. Based on such buy-and-hold returns, the full-year size effect is half as large as previously reported, and all of the full-year effect is, on average, due to the month of January.
Differentiated Typology of Sex Work and Implication for HIV Prevention Programs among Female Sex Workers in Nepal

Background: Sex work in exchange for kind and cash has long been practiced in Nepal. The HIV prevention program in Nepal is focused mainly on these two typologies of sex work. There might be more typologies of sex work beyond streets and establishments seeking research and programmatic attention. The objective of the study is to explore the differentiated typologies of sex work. Methods: This is a cross-sectional study conducted using a qualitative technique. Researchers carried out eight Focus Group Discussions with female sex workers (FSWs) (n = 50) in different places of Tanahu district. Data were analyzed using a deductive thematic analysis approach. Results: We identified a more differentiated typology of sex work. Private contact-based sex work and the covert sex work on the cruising areas along the major highways were common. Sex work has become easier to operate with the advent of new technologies such as cell phone. With limited role of facilitation by brokers and pimps, now FSWs are better off and have longer duration of relationship with clients. Soft prostitution was common, as FSWs complemented their income through sex work. Conclusion: The conventional mode of peer and outreach educational approach needs to be further strengthened and modified according to the changing typology of sex work. HIV testing sites need to be further expanded to cruising areas along the highways.
Bio-inspired Systems in Speech Perception: An overview and a study case

Bio-inspired systems and methods have pervaded the life of modern technology during the last twenty years at a steady but faster stroll. Bio-inspiration dates from long, although it has been during the last fifty years with the better knowledge of the nervous systems functions, components and structures when it has come to a state where its influence in recent developments is more complex everyday. Nevertheless bio-inspiration is not free from controversy. Through this paper its fundamentals, characteristics and development is analyzed in relation with modern tendencies in cognitive audio processing
Exposure Maps: Removing Reliance on Attribution During Scan Detection

Current scanning detection algorithms are based on an underlying assumption that scanning activity can be attributed to a meaningful specific source (i.e. the root cause or scan controller). Sophisticated scanning activity including the use of botnets, idle scanning, and throwaway systems violates this assumption. We propose a class of scanning detection algorithms that focus on what is being scanned for instead of who is performing the scanning. We pursue this idea, introduce the concept of exposuremaps, and report on a preliminary proof-of-concept that allows one to: (1) estimate the information or exposures revealed to an adversary as a result of scanning activity; (2) detect sophisticated or targeted scanning activity with a footprint as low as a single packet or event; and (3) discover real-time changes in network exposures that may be indicative of a successful attack.
Auto-Label Threshold Generation for Multiple Relational Classifications based on SOM Network

and Association rule mining are two basic tasks of Data Mining. Classification rules mining finds rules that partition the data into disjoint sets. This paper is based on MrCAR (Multi-relational Classification Algorithm) and Kohonen's Self-Organizing Maps (SOM) approach. SOM is a class of typical artificial neural networks (ANN) with supervised learning which has been widely used in classification tasks. For small disjunction mining, we collocate with a new auto level threshold generation method in our algorithm to solve the problem of unclassified data of MrCAR. So, we optimize the classification rate of MrCAR with SOM network and improve the efficiency of classification. This approach is highly effective for classification of various kinds of databases and has better average classification accuracy in comparison with MrCAR. Finally the results convincingly demonstrated that our proposed algorithm has high accuracy.
The association between metabolic syndrome and vascular endothelial dysfunction in adolescents

The aim of this study was to investigate the association between metabolic syndrome (MS) and vascular endothelial cell dysfunction (ECD) in adolescents. Sixty obese pediatric inpatients at the General Hospital of Tianjin Medical University from February 2011 to February 2012 were included. Among these, 30 patients were obese and 30 patients were diagnosed with MS. Thirty healthy subjects were randomly selected as the control group. A series of indices, including height, body weight, waist circumference, hip circumference, waist/hip circumference and body mass index (BMI), as well as total cholesterol (TC), triglyceride (TG), low-density lipoprotein (LDL) and high-density lipoprotein (HDL) levels were evaluated. von Willebrand factor (vWF) and plasminogen activator inhibitor-1 (PAI-1) levels were determined using an enzyme linked immunosorbent assay (ELISA). Correlation analysis between height, body weight, waist circumference, hip circumference, waist/hip circumference, BMI, TC, TG, LDL, HDL and PAI-1, as well as vWF was performed. Significant increases of vWF and PAI-1 levels were observed in the MS group compared with the control group (P<0.05). For the adolescents in the obese group, a significant increase of PAI-1 level was observed compared with the control group (P<0.05). No significant difference was observed between the vWF levels in the obese and control groups. PAI-1 was positively associated with BMI, waist circumference, waist/hip circumference, TC, TG, LDL, fasting plasma glucose (FPG), fasting insulin (FINS), systolic blood pressure (SBP) and diastolic blood pressure (DBP), respectively (P<0.05). In addition, PAI-1 was negatively associated with HDL levels (P<0.05). PAI-1 and vWF may be used as biomarkers for the diagnosis of ECD. ECD in individuals with MS may be associated with obesity, blood fat, blood sugar and blood pressure. FPG, TC and TG may be risk factors for ECD.
On Optimal Cell Flashing for Reducing Delay and Saving Energy in Wireless Networks

To save energy from cellular networks or to increase user-perceived performance, studying base station (BS) switching on–off is actively ongoing. However, many studies focus on the tradeoff between energy efficiency and user-perceived performance. In this paper, we propose a simple technique called cell flashing. Cell flashing means that base stations are turned on and off periodically and rapidly so that, when one base station is turned on, the adjacent base stations which make interferences are always off. Thus, both energy efficiency and cell edge user performances can be improved. In general, switching off base stations to save energy can lead to longer file download time (or delay) to customers. Using flow-level dynamics, we analyze average delay and energy consumption of cellular networks when cell flashing is used. We show that both of total energy consumption and average flow-level delay decrease in the case of small cells. Extensive simulations confirm that cell flashing can significantly save the energy of the base stations, e.g., by up to 25% and, at the same time, reduce the average delay by up to 75%.
Tracing evolution changes of software artifacts through model synchronization

Software evolution encompasses all activities related to engineering software, from its inception to retirement. Propagating change across software models that are altered due to maintenance activities is a first step towards maintaining consistency between architectural design, and implementation models. Model synchronization techniques initially presented within the context of model driven architecture provide an instrument for achieving change trace-ability and consistency. We present a framework whereby software artifacts at different levels of abstraction such as architecture diagrams, object models, and abstract syntax trees are represented by graph-based MOF compliant models that can be synchronized using model transformations. In such a framework model dependencies are implicitly encoded using transformation rules and an equivalence relation is used to evaluate when two models become synchronized.
A stochastic dynamical system for optical flow estimation

So far, the research on optical flow has mainly concentrated on motion estimations using the observation of a small number of temporal consecutive frames of an image sequence. The dynamics of the flow field evolution is mostly neglected. Our main concern is to stress that visual motion is a dynamic feature of an image input stream and the more visual data has been observed the more precise and detailed we can estimate and predict the motion contained in the visual data. In this paper, we present a probabilistic dynamical system that is suitable to recurrently infer visual motion. The assumed flow dynamics fuses spatial smoothness constraints and smoothness constraints along time and scale. We propose a certain class of transition probability functions which satisfy a probability mixture model and allow for an efficient approximate inference based on Belief Propagation. We arrive at a compact and general algorithm for optical flow filtering and realize one instance using factored Gaussian belief representations.
A semantic similarity measure based on lexico-syntactic patterns

This paper presents a novel semantic similarity measure based on lexico-syntactic patterns such as those proposed by Hearst (1992). The measure achieves a correlation with human judgements up to 0.739. Additionally, we evaluate it on the tasks of semantic relation ranking and extraction. Our results show that the measure provides results comparable to the baselines without the need for any fine-grained semantic resource such as WordNet.
Security improvement for audio watermarking in image using BCH coding

In this paper, we present a novel algorithm for secure audio watermarking in image using BCH coding based on wavelet transform. In this context, the security is quantified from an information-theoretic point of view via the equivocation about the secret parameters. Firstly, the equivocation is estimated by means of tools from information theory for WOA scenario. Then, the audio watermark encoded by the BCH technique is embedded in the wavelet coefficients. The technique takes the promotes of error correcting coding to decreased the bit error rate (BER) of the extracted watermark. This algorithm improves the security via using BCH coding and security keys. The performance of the proposed watermarking method is analytically investigated and verified via several simulations. Experimental works have demonstrated that the watermark generated by the proposed technique is more secure in comparison with non BCH coding scheme and Golay coding scheme. The extracted watermark quality is shown by considering normalized correlation (NC) value between the original audio watermark and extracted watermark.
USING AIRBORNE SMALL-FOOTPRINT LASER SCANNER TO ASSESS THE QUANTITY OF SEEDLINGS IN AN UNEVEN-AGED SPRUCE FOREST

The relationships between measures of forest structure as derived from airborne laser scanner data and the variation in quantity of young trees established by natural regeneration in a size-diverse spruce forest were analyzed. A regeneration success rate (RSR) was regressed against 27 different laser-derived explanatory variables. The 27 different models were ranked according to their Akaike information criterion score. Each laser variable was then associated with two categories. These were return and type. Within the return and type categories, the variables were grouped according to if they originated from first or last return echoes and if they were canopy height or canopy density metrics. The results show that the laser variables strongest correlated to the quantity of small trees could be attributed to last return and density metrics.
Animation cartography—intrinsic reconstruction of shape and motion

In this article, we consider the problem of animation reconstruction, that is, the reconstruction of shape and motion of a deformable object from dynamic 3D scanner data, without using user-provided template models. Unlike previous work that addressed this problem, we do not rely on locally convergent optimization but present a system that can handle fast motion, temporally disrupted input, and can correctly match objects that disappear for extended time periods in acquisition holes due to occlusion. Our approach is motivated by cartography: We first estimate a few landmark correspondences, which are extended to a dense matching and then used to reconstruct geometry and motion. We propose a number of algorithmic building blocks: a scheme for tracking landmarks in temporally coherent and incoherent data, an algorithm for robust estimation of dense correspondences under topological noise, and the integration of local matching techniques to refine the result. We describe and evaluate the individual components and propose a complete animation reconstruction pipeline based on these ideas. We evaluate our method on a number of standard benchmark datasets and show that we can obtain correct reconstructions in situations where other techniques fail completely or require additional user guidance such as a template model.
Towards reusable and modular aspect-oriented concurrency control

Information systems based on the World Wide Web increased the impact of concurrent programs. Such increase demands the definition of methods for obtaining safe and efficient implementations of concurrent programs, since the complexity of implementation and tests in concurrent environments is bigger than in sequential environments. This work defined guidelines to restructure object-oriented software in order to modularize concurrency control using aspect-oriented programming. Those guidelines are supported by a concurrency control implementation that guarantees system correctness without redundant concurrency control, both increasing performance and guaranteeing safety. We define abstract aspects that constitute a simple aspect framework that can be reused to implement concurrency control in other applications. The achieved modularization makes the concurrency control easy to evolve and decreases the complexity of other parts of the software, such as business and data management modules, by decoupling concurrency control code from them.
ESTIMATION OF CAMERA PARAMETERS FROM STEREO PAIRS WITH NO EXTERNAL CONTROL INFORMATION

Leaving planar rectification aside, in most practical cases of architectural photogrammetry – where mostly non-metric cameras are now used – the camera interior orientation must be known. Of course, it is infeasible to anticipate every possible case and calibrate in advance all available (including auto-focus and zoom) lenses. Therefore, tools are required for the on-the-job estimation of interior orientation parameters. This paper focuses on the simplest instances, namely when no ground control is available. To this end, there exist both single-image methods (for images with clearly defined vanishing points) as well as a multi-image approaches (self-calibrating bundle adjustment which, in principle, also allows estimating the camera interior parameters without exterior information). Most applications, however, still rely on the stereo pair. Thus, the question of determining camera parameters solely from point correspondences on two images is addressed here. Indeed, it is known that simple point homologies in uncalibrated stereo pairs can impose the epipolar constraint, expressed by the ‘fundamental matrix’ (well documented in computer vision literature), and even permit partial self-calibration. For instance, the camera constant of normal cameras – even if different for the two images – may be recovered if the principal point is assumed to be known. Several non-iterative algorithms have also been presented for computing one or two camera constants (the principal point can, too, be localized for given camera constants). The pertinent critical configurations have also been studied. In this contribution, the specific question of estimating a common camera constant is treated. After using a linear algorithm for obtaining initial values, bundle adjustment of the stereo pair is performed for the estimation of relative orientation together with the camera constant as well as radial lens distortion. Relying on extensive real data, the performance of this approach for partial selfcalibration without external information is assessed against full self-calibrating bundle adjustment with control points. A comparison of the accuracy of 3D reconstructions with the two methods indicates that the investigated approach is capable of providing comparable results. Further tests are still needed, however, focusing on issues such as proximity to critical geometries or the effect of noise.
Supplementary Material B Connection to the Model in Fjs C Proof of Lemma 2 in the Main Paper

While our analysis of the proposed approach and algorithm largely tracks the methodology in [Ding et al., 2014], here we develop a set of new analysis tools that can handle more general settings. Specifically, our new analysis tools can handle any isotropically distributed random projection directions. In contrast, the work in [e.g., Ding et al., 2014] can only handle special types of random projections, e.g., spherical Gaussian. Our new refined analysis can not only handle more general settings, it also gives an overall improved sample complexity bound. We also analyse the post-processing step in Algorithm 4. This step accounts for the special constraints that a valid ranking representations must satisfy and guarantees a binary-valued estimate of σ. It should also satisfy the property that either σ k (i) > σ k (j) or σ k (i) < σ k (j) for all distinct i, j and all k. We note that the analysis framework that we present here for the solid angle can in fact be extended to handle other types distributions for the random projection directions. This is, however, beyond the scope this paper. A On the generative model Proposition 1. B = Pσ is column stochastic. Here we discuss in detail the connection to the probability model as well as the algorithm proposed in Jagabathula and Shah [2008]Farias et al. [2009] (denoted by FJS). First, the generative model proposed in FJS can be viewed as a special case of our generative model. If we consider the prior distribution of θ m to be a pmf on the vertices of the K-dimensional probability sim-plex (so that θ m has only one nonzero component with probability one), i.e., Pr(θ m = e k) = b k (1) where e k is the k-th standard basis vector and K k=1 b k = 1, then each user m is associated with only one of the K types with probability b k for the k-th type. We note that under this prior, a E(θ m) = b and R E(θ m θ ⊤ m) = diag(b) has full rank. Second, the algorithm proposed in FJS can certainly be applied to our more general setting. Since the algorithm FJS only uses the first order statistic which corresponds to pooling the comparisons from all the users together, it suffices to consider only the probabilities of p(w 1 = (i, j)) by marginalizing over θ: …