Miracle-dz/UniFAR-FTUs huggingface dataset:
A survey on content based image retrieval using various operators

Retrieval of images plays a major role in different domains including medical diagnosis, biometrics, industry inspection, geographical information satellite systems, web searching and historical research and so on. When size of the database increases continuously, the applications involving images face new challenges and crucial problems such as storage management, indexing, knowledge management and retrieval presentation. We need an efficient retrieval mechanism to retrieve images from the multimedia database. CBIR - Content-based image retrieval is an image retrieval technique used to retrieve images efficiently by using low level image features texture, shape and color. In CBIR system, an image query is characterised by primitive, logical features and abstract attributes. Queries with primitive features are directly derivable from the images but logical and abstract features require logical inference and objects semantic reasoning. This survey paper focuses on different features descriptors for image retrieval and analysis of various retrieval operators like LBP-Local Binary patterns, LTP-Local Ternary patterns, LDP-Local Derivative Patterns and LTrP-Local Tetra patterns using high level features to improve the performance and accuracy in CBIR system.
Weakly Nonlinear Analysis of Vortex Formation in a Dissipative Variant of the Gross-Pitaevskii Equation

For a dissipative variant of the two-dimensional Gross--Pitaevskii equation with a parabolic trap under rotation, we study a symmetry breaking process that leads to the formation of vortices. The first symmetry breaking leads to the formation of many small vortices distributed uniformly near the Thomas--Fermi radius. The instability occurs as a result of a linear instability of a vortex-free steady state as the rotation is increased above a critical threshold. We focus on the second subsequent symmetry breaking, which occurs in the weakly nonlinear regime. At slightly above threshold, we derive a one-dimensional amplitude equation that describes the slow evolution of the envelope of the initial instability. We show that the mechanism responsible for initiating vortex formation is a modulational instability of the amplitude equation. We also illustrate the role of dissipation in the symmetry breaking process. All analyses are confirmed by detailed numerical computations.
Complete Algorithms

Complete SAT algorithms form an important part of the SAT literature. From a theoretical perspective, complete algorithms can be used as tools for studying the complexities of different proof systems. From a practical point of view, these algorithms form the basis for tackling SAT problems arising from real-world applications. The practicality of modern, complete SAT solvers undoubtedly contributes to the growing interest in the class of complete SAT algorithms. We review these algorithms in this chapter, including Davis-Putnum resolution, Stalmarck’s algorithm, symbolic SAT solving, the DPLL algorithm, and modern clause-learning SAT solvers. We also discuss the issue of certifying the answers of modern complete SAT solvers.
On The Detection of Artefacts in Spectro-Astrometry

We demonstrate that artificial bipolar structure can be detected using spectroastrometry when the point spread function (PSF) of a point source suffers distortion in a relatively wide slit. Spectro-Astrometry is a technique which allows us to probe the spatial structure of astronomical sources on milliarcseond (mas) scales making it possible to detect close binaries and to study the geometry and kinematics of outflowing gas on scales much smaller than the seeing or the diffraction limit of the telescope. It is demonstrated that distortion of the PSF, caused by tracking errors of the telescope or unstable active optics during an exposure can induce artificial signals which may be misinterpreted as a real spectro-astrometric signal. Using simulations we show that these may be minimised by using a narrow slit relative to the seeing. Spectra should be obtained at anti-parallel slit position angles (e.g., 0 ◦ and 180 ◦ ) for comparison in order to allow artificial signatures to be identified.
Obesity paradox and mortality in adults with and without incident type 2 diabetes: a matched population-level cohort study

Objective Among adults with type 2 diabetes (T2D), several (but not all) studies show that being overweight (body mass index (BMI): 25.0–29.9 kg/m2) or obese I (BMI: 30.0–34.9 kg/m2) near the time of diagnosis, is unexpectedly associated with reduced all-cause mortality compared with normal weight—the obesity paradox. We addressed whether this observation is causal (eg, a true protective effect); due to confounding (including effect modification); or due to selection (‘collider’) bias. Research design and methods We performed a matched population-level cohort study using primary care records from Salford, UK (1995–2012) in 10 464 patients with incident T2D paired (1:3) with 31 020 individuals who never developed T2D. We estimated HRs for associations of BMI with all-cause mortality using Cox models, stratified by smoking status. Results Median follow-up was 8.7 years. For never smokers, the hazard of all-cause mortality increased from 25 kg/m2, in a linear manner, with increasing BMI in the T2D cohort (HR per 5 kg/m2: 1.23, ptrend<0.001) and in the non-diabetes cohort (HR per 5 kg/m2: 1.34, ptrend<0.001). In contrast, among ever smokers, BMI-mortality relationships were U-shaped in the T2D and non-diabetes cohorts. Evidence of the obesity paradox in ever smokers, with and without T2D, argued against a selection bias, but supported a contribution of effect modification by smoking (pinteraction=0.009). Results were stable to various sensitivity analyses. Conclusions In this cohort, the obesity paradox is mainly explained by smoking as an effect modifier. These findings indicate that the obesity paradox does not challenge standard weight management recommendations among T2D patients.
Analysis and Design of High gain Low Power Fully Differential Gain-Boosted Folded-Cascode Op-amp with Settling time optimization

This paper presents the analysis and design of high speed, high gain fully differential operational amplifier (opamp). Both the main op-amp and the boosting op-amp are fully differential folded-cascode. The main op-amp has a switched capacitor common mode feedback circuit. Two fully differential folded-cascode op amps with continuoustime CMFBs are used as auxiliary op amps to increase the open-loop gain of the main op amp. Common mode feedback (CMFB) is used to stable the designed op-amp against temperature. This design has been implemented in 0. 18μm UMC mixed signal CMOS Technology using Cadence. Spectre simulation shows that the op-amp has the DC gain of 112dB and the unity gain bandwidth of 1.15GHz.
Exploiting material properties to select a suitable wavelet basis for efficient rendering

Nearly-orthogonal spherical wavelet bases can be used to perform rendering at higher quality and with significantly less coefficients for certain spherical functions, e.g. BRDF data. This basis avoids parameterisation artifacts from previous 2D methods, while at the same time retaining high-frequency details in the lighting. This paper demonstrates the efficiency of this representation for rendering purposes. Regular 2D Haar wavelets can still occasionally perform better, however. This is due to their property of being fully orthogonal. An important novelty of this paper lies in the introduction of a technique to select an appropriate wavelet basis on-the-fly, by utilising prior knowledge of materials in the scene. To show the influence of different bases on rendering quality, we perform a comparison of their parameterisation error and the compression performance.
Retrieval of stratospheric ozone profiles from MIPAS/ENVISAT limb emission spectra: a sensitivity study

We report on the dependence of ozone volume mixing ratio profiles, retrieved from limb emission infrared spectra of the Michelson Interferometer for Passive Atmospheric Sounding (MIPAS), on different retrieval setups such as the treatment of the background continuum, cloud filtering, spectral regions used for analysis and a series of further more technical parameter choices. The purpose of this investigation is to better understand the error sources of the ozone retrieval, to optimize the current retrieval setup and to document changes in the data versions. It was shown that the cloud clearing technique used so far (cloud index 1.8) does not reliably exclude all cloud-contaminated spectra from analysis. Through analysis of spectra calculated for cloudy atmospheres we found that the cloud index should be increased to a value of 3.0 or higher. Further, it was found that assignment of a common background continuum to adjacent microwindows within 5 cm −1 is advantageous, because it sufficiently represents the continuum emission by aerosols, clouds and gases as reported in the literature, and is computationally more efficient. For ozone retrieval we use ozone lines from MIPAS band A (685–970 cm −1 ) and band AB (1020–1170 cm −1 ) as well. Therefore we checked ozone retrievals with lines from bands A or AB only for a systematic difference. Such a difference was indeed found and could, to a major part, be attributed to the spectroscopic data used in these two bands, and to a minor part to neglection of modelling of non-local thermodynamic (non-LTE) emissions. Another potential explanation, a bias in the radiance calibration of level-1B spectra of bands A and AB, could largely be ruled out by correlation analysis and inspection of broadband spectra. Further upgrades in the ozone retrieval consist of application of an all-zero a-priori profile and a weaker regularization. Finally, the ozone distribution obtained with the new retrieval setup (data versions V3o_O3_7) was compared to the data version used before (V2_O3_2). Differences are smaller than $\pm$0.4 ppmv in the altitude region 15–50 km. Further, differences to ozone measured by the HALogen Occultation Experiment (HALOE) on the Upper Atmospheric Research Satellite (UARS) are partly reduced with the new MIPAS data version.
Semantic-security capacity for wiretap channels of type II

The secrecy capacity of the type II wiretap channel (WTC II) with a noisy main channel is currently an open problem. Herein its secrecy-capacity is derived and shown to be equal to its semantic-security (SS) capacity. In this setting, the legitimate users communicate via a discrete-memoryless (DM) channel in the presence of an eavesdropper that has perfect access to a subset of its choosing of the transmitted symbols, constrained to a fixed fraction of the blocklength. The secrecy criterion is achieved simultaneously for all possible eavesdropper subset choices. On top of that, SS requires negligible mutual information between the message and the eavesdropper's observations even when maximized over all message distributions. A key tool for the achievability proof is a novel and stronger version of Wyner's soft covering lemma. Specifically, the lemma shows that a random codebook achieves the soft-covering phenomenon with high probability. The probability of failure is doubly-exponentially small in the blocklength. Since the combined number of messages and subsets grows only exponentially with the blocklength, SS for the WTC II is established by using the union bound and invoking the stronger soft-covering lemma. The direct proof shows that rates up to the weak-secrecy capacity of the classic WTC with a DM erasure channel (EC) to the eavesdropper are achievable. The converse follows by establishing the capacity of this DM wiretap EC as an upper bound for the WTC II.
A Facial Expression Model for Human-Like Agent

A major unsolved problem in human-like agent is the construction and application of realistic human facial expression models. Human-like agents should interact with human by recognizing human facial expression and synthesizing facial expressions to show their emotional states. However there is no a uniform model for both recognition and synthesis of facial expression. In this paper, we present a model for solving this challenging task. First, we setup a muscle-based facial model and use muscles' contraction as controlling factors because all the facial actions are driven by the muscles. An orthogonal facial expression space is constructed by regarding each controlling factor as a dimension. Then muscles' contractions are calculated from facial images to construct the facial vector. Thus the facial vector can be used on the facial expression synthesis system of human-like agent. In this paper, we also present a facial function to describe the dynamic procedure of facial expressions. Last, this paper points out the direction of future work
Redundancy Removing by Adaptive Acceleration and Event Clustering for Video Summarization

In this paper, we propose a novel approach to summarize rushes. Our processing is composed of several steps. First, we remove unusable content and we dynamically accelerate video according to motion activity to maximize the content per time unit. Then, one-second video segments are clustered into similarity clusters. The most important nonredundant pieces of shot are selected such that they maximize the coverage of those similarity clusters. The produced summaries have been evaluated by an automatic method with a strong positive correlation with the TRECVID campaign evaluation.
Application-aware video coding architecture using camera and object motion-models

The proliferation of video consumption, especially over mobile devices, has created a demand for efficient interactive video applications and high-level video analysis. This is particularly significant in real-time applications and resource-limited scenarios. Pixel-domain video processing is often inefficient for many of these applications due to its complexity, whereas compressed domain processing offer fast but unreliable results. In order to achieve fast and effective video processing, this paper proposes a novel video encoding architecture that facilitate efficient compressed domain processing, while maintaining compliance with the mainstream coding standards. This is achieved by optimizing the accuracy of motion information embedded in the compressed video, in addition to compression efficiency. In a motion detection application, we demonstrate that the motion estimated by the proposed encoder can be directly used to extract object information, as opposed to conventionally coded video. The incurred rate distortion overheads can be weighed against the reduced processing required for video analysis targeting a wide spectrum of computer vision applications.
Advancing Trace Recovery Evaluation - Applied Information Retrieval in a Software Engineering Context

Successful development of software systems involves efficient navigation among software artifacts. However, as artifacts continuously are produced and modified, engineers are typically plagued by challenging information landscapes. One state-of-practice approach to structure information is to establish trace links between artifacts, a practice that is also enforced by several development standards. Unfortunately, manually maintaining trace links in an evolving system is a tedious task. To tackle this issue, several researchers have proposed treating the capture and recovery of trace links as an Information Retrieval (IR) problem. The goal of this thesis is to contribute to the evaluation of IR-based trace recovery, both by presenting new empirical results and by suggesting how to increase the strength of evidence in future evaluative studies. This thesis is based on empirical software engineering research. The work contains a Systematic Literature Review (SLR) of previous evaluations of IR-based trace recovery. We show that a majority of previous evaluations have been technology-oriented, conducted in "the cave of IR evaluation", using small datasets as experimental input. Also, software artifacts originating from student projects have frequently been used in evaluations. We conducted a survey among traceability researchers, and found that a majority consider student artifacts to be only partly representative to industrial counterparts. Moreover, few traceability researchers had validated student artifacts for industrial representativeness before using them as experimental input. Our findings call for additional case studies to evaluate IR-based trace recovery within the full complexity of an industrial setting. Also, this thesis contributes to the body of empirical evidence of IR-based trace recovery in two experiments with industrial software artifacts. The technology-oriented experiment highlights the clear dependence between datasets and the accuracy of IR-based trace recovery, in line with findings from the SLR. The human-oriented experiment investigates how different quality levels of tool output affect the tracing accuracy of engineers. While the results are not conclusive, there are indications that it is worthwhile to investigate further into the actual value of improving tool support for IR-based trace recovery. Finally, we present how tools and methods are evaluated in the general field of IR research, and propose a taxonomy of evaluation contexts tailored for IR-based trace recovery. (Less)
A Simple and Unified Method of Proving Unpredictability

Recently Bernstein [4] has provided a simpler proof of unpredictability of CBC construction [3] which is giving insight of the construction. Unpredictability of any function intuitively means that the function behaves very closely to a uniform random function. In this paper we make a unifying and simple approach to prove unpredictability of many existing constructions. We flrst revisit Bernstein’s proof. Using this idea we can show a simpler proof of unpredictability of a class of DAG based construction [7], XCBC [5], TMAC [8], OMAC [9] and PMAC [6]. We also provide a simpler proof for stronger bound of CBC [1] and a simpler proof of security of on-line Hash-CBC [2]. We note that there is a ∞aw in the security proof of Hash-CBC in [2]. This paper will help to understand security analysis of unpredictability of many constructions in a simpler way.
Detecting Occurrences of Refactoring with Heuristic Search

This paper proposes a novel technique to detect the occurrences of refactoring from a version archive, in order to reduce the effort spent in understanding what modifications have been applied. In a real software development process, a refactoring operation may sometimes be performed together with other modifications at the same revision. This means that understanding the differences between two versions stored in the archive is not usually an easily process. In order to detect these impure refactorings, we model the detection within a graph search. Our technique considers a version of a program as a state and a refactoring as a transition. It then searches for the path that approaches from the initial to the final state. To improve the efficiency of the search, we use the source code differences between the current and the final state for choosing the candidates of refactoring to be applied next and estimating the heuristic distance to the final state. We have clearly demonstrated the feasibility of our approach through a case study.
Quality Perception of the 2012 World Indoor Athletics Championships

Abstract The objective of this study was to compare the views of spectators concerning the quality perception of the World Indoor Athletics Championships. The study group consisted of 568 spectators who watched the events. A measurement scale of event quality in spectator sports (SEQSS) developed by Ko et al. (2011) was used as a data collection tool in the study. In order to determine the views of the spectators concerning the quality of the Indoor Athletics Championships, the dimensions constituting the scale were compared according to the demographic features of the sample group. As a consequence, important differences in most of the dimensions of the scale were revealed with respect to the demographic data of the subjects. The most relevant finding of the study is that the dimension of “physical environment quality”, which is one of the dimensions constituting the event quality, differed significantly in all comparisons that were made according to demographic features.
Random-Walk Perturbations for Online Combinatorial Optimization

We study online combinatorial optimization problems that a learner is interested in minimizing its cumulative regret in the presence of switching costs. To solve such problems, we propose a version of the follow-the-perturbed-leader algorithm in which the cumulative losses are perturbed by independent symmetric random walks. In the general setting, our forecaster is shown to enjoy near-optimal guarantees on both quantities of interest, making it the best known efficient algorithm for the studied problem. In the special case of prediction with expert advice, we show that the forecaster achieves an expected regret of the optimal order O(n log N)1/2), where n is the time horizon and N is the number of experts, while guaranteeing that the predictions are switched at most O(n log N)1/2) times, in expectation.
Atomic and Molecular Clusters

electronic, magnetic, optical a g g r e g a t e s o f and chemical properties are atoms/molecules C found to be very different containing a few to several from their bulk form and t h o u s a n d s o f depend sensitively on their atoms/molecules. They s i z e , s h a p e a n d h ave ve r y d i f f e r e n t composition. Thus, as has properties from isolated been mentioned above, atoms/molecules or bulk clusters form a class of m a t e r i a l s a n d t h u s materials different from the constitute a new type of b u l k a n d i s o l a t e d material. Clusters have atoms/molecules. Looking been around for a long time at the mass distribution of and are a part of our clusters, some are found to everyday life. For example, be much more abundant AgBr clusters are used in than others. These clusters photography. However, are therefore more stable their scientific study received an impetus rather and are called magic clusters. They act like recently.This has been largely due to their superatoms and can be used as building blocks recently recognized technological potential or basis to form a cluster assembled solid. It is which was first anticipated by the legendary physicist Richard Feynman in 1960 in his famous speech entitled ‘There is plenty of room at the bottom'. In this speech he challenged scientists to develop a new field of study where devices and machines could be constructed from components consisting of small number of atoms.
A dual-rail LUT for reconfigurable logic using null convention logic

Both asynchronous and reconfigurable techniques are likely to become increasingly important in the future due to greater device unreliability and variability at nano-scale dimensions. One promising asynchronous technique, Null Convention Logic (NCL) is a symbolically complete quasi-delay insensitive logic system that is inherently self-determined, locally autonomous and self-synchronizing. As current FPGA devices are set up for clocked synchronous logic they are not well suited to reconfigurable asynchronous systems. A reconfigurable block supporting NCL that is intended to form one component of a FPGA organization is proposed and analyzed. Both single-rail and dual-rail LUTs are described. The block design and layout is described and analyzed using an advanced 45nm bulk CMOS fabrication process.
Bewährungskontrolle des A2-Verfahrens: Hintergründe, Ergebnisse und Konsequenzen

Die Testergebnisse von 51 Bewerberinnen und Bewerbern, die in den Jahren 2006 und 2007 das schriftliche A2-Verfahren der DGP durchlaufen haben, werden verwendet, um den Ausbildungsund Studienerfolg im gehobenen Verwaltungsdienst und vergleichbaren Laufbahnen vorherzusagen. Unkorrigierte Validitätskoeffizienten zwischen r = . 42 und r = . 52 verdeutlichen, dass der A2 in der Lage ist, den Ausbildungsund Studienerfolg über mehrere Jahre valide vorherzusagen.