Miracle-dz/UniFAR-FTUs huggingface dataset:
Fuzzy Neural Network for Malware Detect

The current commercial anti-virus software detects a virus only after the virus has appeared and caused damage. Motivated by the inference technique for detecting viruses, and a recent successful classification method, we explore a system (Radux: Reverse Analysis for Detecting Unsafe eXecutables) for automatically detecting malicious code using the collected dataset of the benign and malicious code. Our system rests on fuzzy inference based on behavior hidden in malicious code. Decompile technique is applied to characterize behavioral and structural properties of binary code, which creates more abstract descriptions of malware. The proposed method can acquire the fuzzy subsets and its membership function in an automatic way with the GD-FNN learning algorithm. The experimental data give support to the validity of this method. Moreover, our system is resilient to common obfuscations used by hackers.
Performance analysis of two-way multi-user with balance transmitted power of relay in LTE-A cellular networks

Wireless multi-hop relay systems have become very important technologies in mobile communications. These systems ensure high-speed data transfer and extended coverage area at a low cost. In this paper, we proposed two scenarios. In the first scenario we studied the performance of a two-way multi-hop relay network and proposed a half-duplex mode amplify-and-forward relay with two cases. In the first case, we studied a fixed relay node (FRN) with (q th ) users for two-way performance keeping user equipment (UE) is fixed and is moving at different velocities toward FRN. In second case, we proposed a new connection between the (k th ) moving relay nodes (MRN) and users had the same the velocities and times, in which users are independently moving between them. In the second scenario the balanced power algorithm for MRN is proposed, this algorithm is control of the transmitted power over cell radius to achieve the required SNR and throughput at the users with reducing the consumption transmitted relay power. Is has been shown from the simulation results that there is saving nearly 75% from transmitted power after using proposed algorithm.
Boosting the basic counting on distributed streams

We revisit the classic basic counting problem in the distributed streaming model that was studied by Gibbons and Tirthapura (GT). In the solution for maintaining an (ε,Δ)-estimate, as what GT's method does, we make the following new contributions: (1) For a bit stream of size n, where each bit has a probability at least γ to be 1, we exponentially reduced the average total processing time from GT's Θ(n log(1/Δ)) to O((1/(γε2))(log2 n)log(1/Δ)), thus providing the first sublinear-time streaming algorithm for this problem. (2) In addition to an overall much faster processing speed, our method provides a new tradeoff that a lower accuracy demand (a larger value for ε) promises a faster processing speed, whereas GT's processing speed is Θ(n log(1/Δ)) in any case and for any ε. (3) The worst-case total time cost of our method matches GT's Θ(n log(1/Δ)), which is necessary but rarely occurs in our method. (4) The space usage overhead in our method is a lower order term compared with GT's space usage and occurs only O(log n) times during the stream processing and is too negligible to be detected by the OS in practice. We further validate these solid theoretical results with experiments on both real-world and synthetic data, showing that our method is faster than GT's by a factor of several to several hundreds depending on the stream size and accuracy demands, without any detectable space usage overhead. Our method is based on a faster sampling technique that we design for boosting GT's method and we believe this technique can be of other independent interest.
Learning with options : Just deliberate and relax

Bounded rationality is a very important framework for understanding rationality in both natural and artificial systems. In this paper, we aim to bridge the gap between bounded rationality and reinforcement learning, which has also proven very fruitful in both types of intelligent systems. A lot of reinforcement learning work has focused on Markov Decision Processes, where optimal policies can be obtained under certain assumptions. However, optimality does not take into account possible resource limitations of the agent, which is assumed to have access to a lot of data and computation time. One approach for reducing the costs of such agents has been to provide them with temporally extended actions and models, which allow policies to be computed faster, cf. [Dietterich, 2000; Precup, 2000]. However, the problem of automatically finding good temporal abstractions has proven very difficult. Part of this difficulty stems from the fact that from the point of view of absolute optimality, temporal abstractions are not necessary: the optimal policy is achieved by primitive actions. Therefore, it has been difficult to formalize in what precise theoretical sense temporally abstract actions are helpful.
Can Echocardiographic Findings Predict Falls in Older Persons?

Background The European and American guidelines state the need for echocardiography in patients with syncope. 50% of older adults with syncope present with a fall. Nonetheless, up to now no data have been published addressing echocardiographic abnormalities in older fallers. Method and Findings In order to determine the association between echocardiographic abnormalities and falls in older adults, we performed a prospective cohort study, in which 215 new consecutive referrals (age 77.4, SD 6.0) of a geriatric outpatient clinic of a Dutch university hospital were included. During the previous year, 139 had experienced a fall. At baseline, all patients underwent routine two-dimensional and Doppler echocardiography. Falls were recorded during a three-month follow-up. Multivariate adjustment for confounders was performed with a Cox proportional hazards model. 55 patients (26%) fell at least once during follow-up. The adjusted hazard ratio of a fall during follow-up was 1.35 (95% CI, 1.08–1.71) for pulmonary hypertension, 1.66 (95% CI, 1.01 to 2.89) for mitral regurgitation, 2.41 (95% CI, 1.32 to 4.37) for tricuspid regurgitation and 1.76 (95% CI, 1.03 to 3.01) for pulmonary regurgitation. For aortic regurgitation the risk of a fall was also increased, but non-significantly (hazard ratio, 1.57 [95% CI, 0.85 to 2.92]). Trend analysis of the severity of the different regurgitations showed a significant relationship for mitral, tricuspid and pulmonary valve regurgitation and pulmonary hypertension. Conclusions Echo(Doppler)cardiography can be useful in order to identify risk indicators for falling. Presence of pulmonary hypertension or regurgitation of mitral, tricuspid or pulmonary valves was associated with a higher fall risk. Our study indicates that the diagnostic work-up for falls in older adults might be improved by adding an echo(Doppler)cardiogram in selected groups.
Face recognition approach based on wavelet transform

The paper presented describes a biometric face identification method based on frontal face images that combines the wavelets theory with the probabilistic neural nets structure. We will use the wavelet transformed domain in order to reduce the dimensionality of the input image, and a radial basis neural net classifier that will perform the identification process. The method developed will be compared against the classical method of Turk and Pentland [1], based on the Karhunen-Loeve transform. Experimental results show better recognition accuracies and reduced computational cost.
Topic Models to Interpret MeSH – MEDLINE’s Medical Subject Headings

We show how topic models are useful for interpreting and understanding MeSH, the Medical Subject Headings applied to articles in MEDLINE. We show how our resampled author model captures some of the advantages of both the topic model and the author-topic model. We demonstrate how the topic modeling approach can provide an alternative and complementary view of the relationship between MeSH headings that could be informative and helpful for people searching MEDLINE.
Measuring 'Orthorexia': Development of the Eating Habits Questionnaire

As a preliminary step in researching “orthorexia nervosa,” an alleged syndrome characterized by a pathological fixation on healthy eating, we designed the 21-item Eating Habits Questionnaire (EHQ) to assess the cognitions, behaviors, and feelings related to an extreme focus on healthy eating. Study 1 (n = 174) examined the factor structure of the EHQ and refined the instrument with exploratory factor analysis. Results suggested a 3factor solution with the following subscales: knowledge of healthy eating, problems associated with healthy eating, and feeling positively about healthy eating. The subscales displayed good internal consistency (α = .87 to .91) and test-retest reliability (r =.74 to .87). Study 2 examined the fit of the 3-factor model in a new sample (n = 213) with confirmatory factor analysis. After eliminating poorly fitting items, model fit was adequate with good internal consistency (α = .82 to .90) and test-retest reliability (r = .72 to .81) of the subscales. Examination of correlations between the EHQ subscales and a variety of other measures, and comparisons of nutrition students with non-nutrition students on EHQ subscales provided preliminary evidence for convergent,discriminant, and criterion-related validity.
Topology-constrained synthesis of vector patterns

Decorative patterns are observed in many forms of art, typically enriching the visual aspect of otherwise simple shapes. Such patterns are especially difficult to create, as they often exhibit intricate structural details and at the same time have to precisely match the size and shape of the underlying geometry. In the field of Computer Graphics, several approaches have been proposed to automatically synthesize a decorative pattern along a curve, from an example. This empowers non expert users with a simple brush metaphor, allowing them to easily paint complex structured decorations. We extend this idea to the space of design and fabrication. The major challenge is to properly account for the topology of the produced patterns. In particular, our technique ensures that synthesized patterns will be made of exactly one connected component, so that once printed they form a single object. To achieve this goal we propose a two steps synthesis process, first synthesizing the topology of the pattern and later synthesizing its exact geometry. We introduce topology descriptors that efficiently capture the topology of the pattern synthesized so far. We propose several applications of our method, from designing objects using synthesized patterns along curves and within rectangles, to the decoration of surfaces with a dedicated smooth frame interpolation. Using our technique, designers paint structured patterns that can be fabricated into solid, tangible objects, creating unusual and surprising designs of lamps, chairs and laces from examples.
Plagiarism detection using free-text fingerprint analysis

Plagiarism generally defined as using other people's ideas or work and representing it as one's own original work. Free-text plagiarism detection is an application based on analyzing the texts contained in researches, thesis, scientific reports and also literary products, these analyzed data will be used to compare a group of documents to find out how much these documents are similar. This paper proposes a Free Text Plagiarism Detection Software (FTPDS); which is a software tool that uses documents' fingerprints to detect the likelihood that the documents are plagiarized from each other. The system is able to detect plagiarism between two given documents, given document and group of local documents, and between given document and online available documents. Agile software methodology was used to develop the software and some open source libraries were manipulated and used to search the internet and read PDF documents respectively. The speed of the detection process, the inaccurate detection of the same file and the lag of online search and downloading are stated as future work aspects. Source in this paper means the suspected document which we want to detect the amount of plagiarized data contained in it. The target is the document which is probably the document where the author plagiarized the data from it and claimed that he\she owns that data.
Writing practical memory management code with a strictly typed assembly language ( Extended Version )

Memory management (e.g., malloc/free) cannot be implemented in traditional strictly typed programming languages because they do not allow programmers to reuse memory regions, in order to preserve memory safety. Therefore, they depend on external memory management facilities, such as garbage collection. Thus, many important programs that require explicit memory management (e.g., operating systems) have been written in weakly typed programming languages (e.g., C). To address the problem, we designed a new strictly and statically typed assembly language which is flexible and expressive enough to implement memory management. The key idea of our typed assembly language is that it supports variable-length arrays (the arrays whose size is not known until runtime) as language primitives, maintains integer constraints between variables, and keeps track of pointer aliases. Based on the idea, we implemented a prototype implementation of the language. We also implemented a small operating system kernel which provides a memory management facility with the language.
A Complete Guide to the Common Vulnerability Scoring System Version 2.0 | NIST

Acknowledgements: The authors sincerely wish to recognize the contributions of all of the CVSS Special Interest Group members, including and Tadashi Yamagishi as well as the authors of the CVSS v1.0 standard [1]. The Common Vulnerability Scoring System (CVSS) provides an open framework for communicating the characteristics and impacts of IT vulnerabilities. CVSS consists of three groups: Base, Temporal and Environmental. Each group produces a numeric score ranging from 0 to 10, and a Vector, a compressed textual representation that reflects the values used to derive the score. The Base group represents the intrinsic qualities of a vulnerability. The Temporal group reflects the characteristics of a vulnerability that change over time. The Environmental group represents the characteristics of a vulnerability that are unique to any user's environment. CVSS enables IT managers, vulnerability bulletin providers, security vendors, application vendors and researchers to all benefit by adopting this common language of scoring IT vulnerabilities.
Object Identification with Constraints

Object identification aims at identifying different representations of the same object based on noisy attributes such as descriptions of the same product in different online shops or references to the same paper in different publications. Numerous solutions have been proposed for solving this task, almost all of them based on similarity functions of a pair of objects. Although today the similarity functions are learned from a set of labeled training data, the structural information given by the labeled data is not used. By formulating a generic model for object identification we show how almost any proposed identification model can easily be extended for satisfying structural constraints. Therefore we propose a model that uses structural information given as pairwise constraints to guide collective decisions about object identification in addition to a learned similarity measure. We show with empirical experiments on public and on real-life data that combining both structural information and attribute-based similarity enormously increases the overall performance for object identification tasks.
Constraint-based Timetabling

Univerzita Karlova v Praze Matematicko-fyzikální fakulta Rozvrhování s omezujícími podmínkami Autoreferát doktorandské disertační práce k získání akademicko-vědeckého titulu doktor. Disertační práce byla vypracována v rámci doktorandského studia, které uchazeč absolvoval na katedře teoretické informatiky Univerzity Karlovy v letech 2001-2005. -1
A Voting Method for the Classification of Web Pages

This paper discusses Web page classification using hypertext features such as the text included in the Web page, the title, headings, URL, and anchor text. Five different classification approaches based on SVM that use individual features or combinations are investigated on the LookSmart dataset. The initial experimental results have shown that combining the features improves the performance of the classifier and that some features such as title and headings can be very useful for certain tasks. On the basis of this analysis, we propose a voting method that further improves the performance compared with the individual classifiers
Rheo-PIV Analysis of the Yielding and Flow of Model Waxy Crude Oils

Waxes are a commonly encountered precipitate that can result in the gelation of crude oils and cessation of flow in pipelines. In this work, we develop a model wax–oil system that exhibits rheological behavior similar to that of waxy crude oils encountered in production scenarios. To study the consequences of gelation on the rheology of the model system, we perform simultaneous measurements of the bulk flow behavior using rheometry and of the local shearing deformation using particle image velocimetry. The bulk rheological measurements are correlated to deviations from the linear velocity profile anticipated for a homogeneous sample undergoing simple shear—this provides new insights into the structural and rheological evolution of these wax–oil systems under representative shearing conditions. The restart of flow and breakdown of the gelled wax–oil structure is observed under two scenarios—a constant applied stress and a constant applied strain rate. In addition, the effect of varying surface roughness on.
Differential Modulation and Relay Selection With Detect-and-Forward Cooperative Relaying

In this paper, we consider the bit error rate (BER) performance analysis of a cooperative relay communication system with differential modulation and selective relaying, where the best relay is selected to forward the signals from the source to the destination. The advantage of differential modulation is that it allows noncoherent detection without requiring the full channel-state information (CSI), as obtaining CSI in a cooperative communication system at each node is a complicated and costly task. We consider a simple detect-and-forward (DetF) relay system and take into account the effect of imperfect detection at the relay. We derive the average bit error probability of the DetF relay scheme by using the closed-form relay link signal-to-noise ratio (SNR). Based on the analysis, we show that the proposed system with N relay nodes and the simple relay selection can achieve a total diversity gain of N + 1. The BER performance of the system is also evaluated by simulation. It is shown that the analysis matches well with the simulation results.
Structural basis of thymosin-β4/profilin exchange leading to actin filament polymerization

Significance Thymosin-β4 (Tβ4) sequesters actin monomers to help maintain the high concentrations of unpolymerized actin in higher eukaryotic cells. Despite more than two decades of research investigating the Tβ4–actin interaction, the X-ray structure of the full-length Tβ4:actin complex remained unresolved. Here, we report two X-ray structures of Tβ4:actin complexes. The first structure reveals that Tβ4 has two helices that bind at the barbed and pointed faces of actin, whereas the second structure displays a more open actin nucleotide binding cleft and a disruption of the Tβ4 C-terminal helix interaction. These structures, combined with biochemical assays and molecular dynamics simulations, reveal how Tβ4 prevents monomeric actin from joining actin filaments but participates in the exchange of actin with profilin to ensure controlled actin polymerization. Thymosin-β4 (Tβ4) and profilin are the two major sequestering proteins that maintain the pool of monomeric actin (G-actin) within cells of higher eukaryotes. Tβ4 prevents G-actin from joining a filament, whereas profilin:actin only supports barbed-end elongation. Here, we report two Tβ4:actin structures. The first structure shows that Tβ4 has two helices that bind at the barbed and pointed faces of G-actin, preventing the incorporation of the bound G-actin into a filament. The second structure displays a more open nucleotide binding cleft on G-actin, which is typical of profilin:actin structures, with a concomitant disruption of the Tβ4 C-terminal helix interaction. These structures, combined with biochemical assays and molecular dynamics simulations, show that the exchange of bound actin between Tβ4 and profilin involves both steric and allosteric components. The sensitivity of profilin to the conformational state of actin indicates a similar allosteric mechanism for the dissociation of profilin during filament elongation.
The chemistry of transient microstructure in the diffuse interstellar medium

Transient microstructure in the diffuse interstellar medium (ISM) has been observed towards Galactic and extragalactic sources for decades, usually in lines of atoms and ions, and, more recently, in molecular lines. Evidently, there is a molecular component to the transient microstructure. In this paper, we explore the chemistry that may arise in such microstructure. We use a photodissociation region (PDR) code to model the conditions of relatively high density, low temperature, very low visual extinction and very short elapsed time that are appropriate for these objects. We find that there is a well-defined region of parameter space where detectable abundances of molecular species might be found. The best matching models are those where the interstellar microstructure is young ( 104 cm3).
A G-Super4PCS Registration Method for Photogrammetric and TLS Data in Geology

Photogrammetry and Terrestrial laser scanning (TLS) are the two primary non-contact active measurement techniques in geology. Integrating TLS data with digital images may achieve complementary advantages of spatial information as well as spectrum information, which would be very valuable for automatic rock surface extraction. In order to extract accurate and comprehensive geological information with both digital images and TLS point cloud, the registration problem for different sensor sources should be solved first. This paper presents a Generalized Super 4-points Congruent Sets (G-Super4PCS) algorithm to register the TLS point cloud as well as Structure from Motion (SfM) point cloud generated from disordered digital images. The G-Super4PCS algorithm mainly includes three stages: (1) key-scale rough estimation for point clouds; (2) extraction for the generalized super 4-points congruent base set and scale adaptive optimization; and (3) fine registration with Iterative Closest Point (ICP) algorithm. The developed method was tested with the columnar basalt data acquired in Guabushan National Geopark in Jiangsu Province, China. The results indicate that the proposed method could be used for indirect registration between digital images and TLS point cloud, and the result of which would be prepared for further integration research.
Combination of Static and Dynamic Analyses for the Certification of Avionics Software

This paper proposes a dynamic analysis approach developed for the verification of avionics software. The objective is to formally verify temporal properties on execution traces. The approach consists of three steps: computation of the necessary observation points in the program using static analysis, execution of the program and generation of the execution trace, verification of the temporal property on the trace. The approach has been implemented in a tool.