Miracle-dz/UniFAR-FTUs huggingface dataset:
An Efficient Approach for Assessing Parameter Importance in Bayesian Optimization

We describe a method for quantifying the importance of a blackbox function’s input parameters and their interactions, based on function evaluations obtained by running a Bayesian optimization procedure. We focus on high-dimensional functions with mixed discrete/continuous as well as conditional inputs, and therefore employ random forest models. We derive the first exact and efficient approach for computing efficient marginal predictions over subsets of inputs in random forests, enabling an exact quantification of parameter importance in the functional ANOVA framework. We demonstrate these techniques by assessing the importance of parameters in several recent applications of Bayesian optimization.
Verification of code generators via higher-order model checking

Dynamic code generation is useful for optimizing code with respect to information available only at run-time. Writing a code generator is, however, difficult and error prone. We consider a simple language for writing code generators and propose an automated method for verifying code generators. Our method is based on higher-order model checking, and can check that a given code generator can generate only closed, well-typed programs. Compared with typed multi-stage programming languages, our approach is less conservative on the typability of generated programs (i.e., can accept valid code generators that would be rejected by typical multi-stage languages) and can check a wider range of properties of code generators. We have implemented the proposed method and confirmed its effectiveness through experiments.
Effects of Dietary Potential Acid Production Value on Productivity in Dairy Cows

This study was conducted to estimate the potential acid production value (PAPV) of major diets and to determine the relationship between dietary PAPV and dairy production traits. Estimation of PAPV of major cattle feeds was based on an in vitro technique, which determined the degree of Ca dissociation from CaCO3. Data on feeds and production traits were collected on 744 multiparous lactating Holstein dairy cows from five different farms. Grains had high PAPV with variable protein sources and by-products. High PAPV feedstuffs had a higher total gas production and lower pH compared to those with low PAPV. Dietary PAPV had a positive correlation with intake of dry matter, NDF, ADF, milk yield and milk solid production but a negative correlation with milk protein and milk fat concentration. Current results indicate that dietary PAPV can be utilized in predicting dairy production traits.
Computational Stylometic Approach Based on Frequent Word and Frequent Pair in the Text Mining Authorship Attribution

Summary Stylometric Authorship attribution is one of the new approaches in the text mining field that has been showing recently because of its delicateness. This approach is concerned about analyzing texts, e.g. Novels and plays that famous authors wrote, trying to measure the author style, by choosing some attributes that shows the author style of writing, assuming that these writers have a special way of writing, that no other writer has. To achieve that, this paper discusses several algorithms which are used frequently and skipping the one time, ad-hoc adventures in this field. This paper is also opens the way for future works to merge and improve these techniques by showing experimentally the accuracy level of using both frequent words and frequent word pair depending on the computational approach.
On the development and application of EMMIE: insights from the What Works Centre for Crime Reduction

ABSTRACT The What Works Centre for Crime Reduction was established in September 2013 with the aim of increasing the use of research evidence by decision-makers in policing and crime reduction. The EMMIE framework was developed to meet this aim. It encapsulates five broad categories of research evidence that are considered relevant to crime reduction, namely Effect size, Mechanism, Moderator (or context), Implementation and Economics. In this paper, we chart the origins and development of EMMIE. We also reflect on our experience of applying EMMIE both as a coding system to appraise systematic review evidence and as a framework to inform the design and conduct of systematic reviews in crime reduction. We conclude with a critique of EMMIE and with suggestions on how it might be developed and refined in the future.
Social Area Analysis Using SOM and GIS : A Preliminary Research

Social area analysis, pioneered in the 1950s concerns a city’s discrete divisions with distinctive social traits. It is a useful tool in modeling a city’s socio-spatial attributes. However, its applications in urban planning and policy-making are rare. The reasons for this being 1) the use of linear correlation methods tends to oversimplify the complexity involved and often produce patterns irrelevant to real world scenarios and 2) the vast amount of labor required for visualizing spatial patterns makes the task almost impossible in many cases. In this paper, a non-linear correlation method using Self Organizing Map (SOM) techniques and GIS, to investigate a city’s social areas within Beppu City, Japan is outlined as there are not many studies on social areas in Japan. This could be expanded to other larger cities as well. 1. Social Area Analysis Even though the so-called “social area analysis” itself was not termed until the 1950s, the study of the spatial divisions in cities can be traced back to the early 1920s’ efforts by the human ecologists of Chicago School. Burgess (1925) studied the residential distribution of cities and generated the well-known concentric zone model. In this model the author classified residential areas into several types, each forming a concentric band surrounding the city center and characterized by residents of increasingly high socio-economic status. In the investigation of Chicago city, Park and Burgess (1928) revealed that the significant processes underlying the spatial division of the then growing American industrial city as similar to those found in nature. Competition among land users resulted in the invasion of the most desired parts of a city and eventually the succession of existing land use by a more dominant activity. Under free-market conditions, certain parts of the city would be occupied by the function that could maximize the use of the site,
Analysis of command frequency and command sequence grammar in IDS

Masquerader is someone who impersonates another user and operates computer system with privileged access. It's difficult to detect out by conventional techniques as firewall or misuse-based intrusion detection. Anomaly detection has been considered as a promising approach for masquerade detection, which is based on the idea that significant departures from normal behavior could be considered due to a masquerade. However, for low detection accuracy and high false alarm rate, it is still in research stage. Till now, many methods have been proposed from different viewpoints, such as Hidden Markov Model, Naive Bayes, SVM, and so on. Compared with other methods that with well theoretical backgrounds, two intuitive determined statistical methods: the Customized Grammars method and the Self Signature approach combined with Uniqueness, reported the much better detection efficiency. Especially, both methods based on the intuitive notion that the more frequently a usage pattern was employed by current user previously, the more indicative of normal. In other hand, the statistics of usage pattern in the Customized Grammars method was based on sequential grammars, and that of the Self Signature approach combined with Uniqueness was on commands and 2-grams. In this paper, these two methods are compared and evaluated on two benchmark data sets of Unix command sequence: the Schonlau data and the Greenberg data. As a result, contributions of command frequency and command sequence grammar in IDS were analyzed and clarified.
Alternative evolutionary algorithms for evolving programs: evolution strategies and steady state GP

In contrast with the diverse array of genetic algorithms, the Genetic Programming (GP) paradigm is usually applied in a relatively uniform manner. Heuristics have developed over time as to which replacement strategies and selection methods are best. The question addressed in this paper is relatively simple: since there are so many variants of evolutionary algorithm, how well do some of the other well known forms of evolutionary algorithm perform when used to evolve programs trees using s-expressions as the representation? Our results suggest a wide range of evolutionary algorithms are all equally good at evolving programs, including the simplest evolution strategies.
A New Fast Mode Decision Method for H.264/AVC Intra Coding

In this paper a new fast mode decision method for H.264 /AVC intra coding is developed, which is based on the analysis of edge filter and more efficient mode selection. We analysis the edge detection algorithm from the perspective of edge filters and make it more efficient at mode selecting. In the proposed edge filters, differ from those existing methods which select several neighbor modes only by one filter, we set filters for each directional mode to eliminate the defect of dependency among them. Then the filters are applied to some pixels distributed in the block. The resultant results along with prediction residuals of these pixels are summed for fast mode decision. Besides this, local information has been taken into account by using Most Probable Mode (MPM) from neighbor coded blocks which can significantly mitigate the coding bits increase. Experimental results demonstrate that the proposed method is able to provide a better coding performance than the existing algorithms.
Proximity structures in the fixed orientation metrics

We present algorithms computing two types of proximity structures in the plane with a fixed orientation metric. Proximity structures have proven useful for Steiner tree heuristics in the Euclidean plane and may play a similar role for the fixed orientation metrics where Steiner trees are important in the area of VLSI design. We show how to find an all nearest neighbour graph NNG(Z) of a set Z of n points in O(anlogn) time using O(n) space where a is the number of fixed orientations. The algorithm does not use the Voronoi diagram of Z. We present an algorithm that computes the Gabriel graph GG(Z) of Z in O(anlogn) time using O(an) space under the assumption that no three points of Z are on a line parallel to one of the
Migrating large object-oriented Applications into component-based ones: instantiation and inheritance transformation

Large object-oriented applications have complex and numerous dependencies, and usually do not have explicit software architectures. Therefore they are hard to maintain, and parts of them are difficult to reuse. Component-based development paradigm emerged for improving these aspects and for supporting effective maintainability and reuse. It provides better understandability through a high-level architecture view of the application. Thereby migrating object-oriented applications to component-based ones will contribute to improve these characteristics (maintainability and reuse). In this paper, we propose an approach to automatically transform object-oriented applications to component-based ones. More particularly, the input of the approach is the result provided by software architecture recovery: a component-based architecture description. Then, our approach transforms the object-oriented source code in order to produce deployable components. We focus in this paper on the transformation of source code related to instantiation and inheritance dependencies between classes that are in different components. We experimented the proposed solution in the transformation of a collection of Java applications into the OSGi framework. The experimental results are discussed in this paper.
Levels of religious thinking in young children and religious practices of their families

The purpose of the present study was to assess the levels of religious thinking of young children and to determine whether there was a significant relationship between the religious practices of the children and their families and the religious thinking levels of the children. The subjects included in the study were 60 children four, five, and six years of age and their parents selected randomly from the list of children attending three Seventh-day Adventist Churches and one large Baptist Church Kindergarten Day Care Center. Thirty children and their parents were selected from the Whitesburg Kindergarten, and 30 children and their parents were selected from the three Seventh-day Adventist Churches. A stratified random sample was selected from each group so that there were 20 children in each age group.
The Regulated Expression, Intracellular Trafficking, and Membrane Recycling of the P2Y-like Receptor GPR17 in Oli-neu Oligodendroglial Cells*

Background: GPR17 is a key player in oligodendrocyte differentiation. By regulating the availability of receptors at the cell surface, agonist-induced GPR17 trafficking may influence terminal cell fate. Results: UDP-glucose and LTD4 induce GPR17 endocytosis and distribution in lysosomes or recycling compartments. Conclusion: Agonist-activated GPR17 undergoes partial degradation and fast membrane recycling. Significance: Understanding GPR17 trafficking may increase our knowledge of oligodendrocyte differentiation and myelination. GPR17 is a G-protein-coupled receptor that is activated by two classes of molecules: uracil-nucleotides and cysteinyl-leukotrienes. GPR17 is required for initiating the differentiation of oligodendrocyte precursors but has to be down-regulated to allow cells to undergo terminal maturation. Although a great deal has been learned about GPR17 expression and signaling, no information is currently available about the trafficking of native receptors after the exposure of differentiating oligodendrocytes to endogenous agonists. Here, we demonstrate that neuron-conditioned medium induces the transcriptionally mediated, time-regulated expression of GPR17 in Oli-neu, an oligodendrocyte precursor cell line, making these cells suitable for studying the endocytic traffic of the native receptor. Agonist-induced internalization, intracellular trafficking, and membrane recycling of GPR17 were analyzed by biochemical and immunofluorescence assays using an ad hoc-developed antibody against the extracellular N-terminal of GPR17. Both UDP-glucose and LTD4 increased GPR17 internalization, although with different efficiency. At early time points, internalized GPR17 co-localized with transferrin receptor, whereas at later times it partially co-localized with the lysosomal marker Lamp1, suggesting that a portion of GPR17 is targeted to lysosomes upon ligand binding. An analysis of receptor recycling and degradation demonstrated that a significant aliquot of GPR17 is recycled to the cell surface. Furthermore, internalized GPR17 displayed a co-localization with the marker of the “short loop” recycling endosomes, Rab4, while showing very minor co-localization with the “long loop” recycling marker, Rab11. Our results provide the first data on the agonist-induced trafficking of native GPR17 in oligodendroglial cells and may have implications for both physiological and pathological myelination.
Privacy Risks in Publishing Mobile Device Trajectories

Growing availability of mobile devices capable of sensing and transmitting geospatial information has led to a wide range of location based services (LBSs). Sharing location data with others is an intrinsic feature of LBSs. However, publishing location may raise serious privacy concerns due to its close connection with users' sensitive information. This work identifies a new privacy threat called trajectory_matching. We show that available privacy protection techniques preserving spatial relations of location samples are likely vulnerable to trajectory_matching in existence of background information. We develop a matching algorithm, trajectory_finder, and analyze its effectiveness on a real-life privacy protected trajectory dataset.
Delaunay-based triangular surface reconstruction from points via Umbrella Facet Matching

This paper presents an effective algorithm to reconstruct a closed 3D triangular surface mesh from a set of unorganized points based on Delaunay triangles. The algorithm essentially seeks to construct an optimal local 2D manifold surface (umbrella) at each individual point in parallel. The underlying principle is that for any point, there always exists a cluster of triangular facets, selected from the Delaunay triangles at the point, to constitute the shape of an opened umbrella. If a triangular facet belongs to all three umbrellas of its three vertices, the triangular facet is considered as a matched facet. When all triangular facets of an umbrella are matched facets, the umbrella is regarded as a matched umbrella which fully overlaps with its neighboring umbrellas. A topologically correct triangular surface mesh is then constructed when the matched umbrella for every individual point is found. The proposed Umbrella Facet Matching (UFM) algorithm has been implemented and validated using many publicly available point cloud data sets. The algorithm is seen to be of good convergence and without the need for further hole-filling post-processing. And the reconstructed surface meshes only contain minor shape approximation errors, when compared to the original surfaces of the sampled points.
Dependence of mean effective gain of mobile terminal antennas on side of head

The dependence of radiation pattern, polarization, and mean effective gain (MEG) characteristics of mobile terminal antennas on the side of the head on which the user holds the terminal is considered. For antenna designers and measurement standardization it is important to know if it is necessary to evaluate antenna performance of mobile terminals on both sides of a phantom head. If the measurement or simulation on only one side of the head was sufficient, it would mean a considerable save in testing times and costs. The question is investigated by performing FDTD simulations and measuring a commercial GSM terminal. The results indicate that for some antennas the MEG can be up to 4-5 dB different between the left and the right side of the user's head at 1800 MHz band and above. Contrary to that the difference in the total efficiency is typically in the order of 0.5 dB only. Thus, if the MEG is used as the antenna performance criterion of a mobile terminal it should be evaluated on both sides of a phantom head at 1800 MHz band and above. If the total efficiency or the total radiated power is the preferred performance criterion, the evaluation on only either side of the head is enough.
Existence results for a class of semi-linear evolution equations.

We consider system (1) as a Cauchy problem on a Banach space X, where A is the infinitesimal generator of an analytic semigroup of bounded linear operators (T (t))t≥0; f, g : [0, T ]× Ω → X are appropriate continuous functions and Ω is an open subset of X. The case g ≡ 0 has an extensive literature. The books of Pazy [14], Krein [10], Goldstein [5] and the references contained therein, give a good account of the more important results. Throughout this paper X will be a Banach space provided with norm ‖ · ‖ and the operator A : D(A) ⊂ X → X will be the infinitesimal generator of an analytic semigroup of bounded linear operators (T (t))t≥0 on X. For the theory of strongly continuous semigroups, refer to [14] and [5]. We mention here only some notations and properties essential to our purpose. In particular, it is well known that there exist M ≥ 1 and a real number w such that ‖ T (t) ‖≤ Me, t ≥ 0.
Video-Based In Situ Tagging on Mobile Phones

We propose a novel way to augment a real-world scene with minimal user intervention on a mobile phone; the user only has to point the phone camera to the desired location of the augmentation. Our method is valid for horizontal or vertical surfaces only, but this is not a restriction in practice in manmade environments, and it avoids going through any reconstruction of the 3-D scene, which is still a delicate process on a resource-limited system like a mobile phone. Our approach is inspired by recent work on perspective patch recognition, but we adapt it for better performances on mobile phones. We reduce user interaction with real scenes by exploiting the phone accelerometers to relax the need for fronto-parallel views. As a result, we can learn a planar target in situ from arbitrary viewpoints and augment it with virtual objects in real-time on a mobile phone.
Statistical Reliability Estimation of Microprocessor-Based Systems

What is the probability that the execution state of a given microprocessor running a given application is correct, in a certain working environment with a given soft-error rate? Trying to answer this question using fault injection can be very expensive and time consuming. This paper proposes the baseline for a new methodology, based on microprocessor error probability profiling, that aims at estimating fault injection results without the need of a typical fault injection setup. The proposed methodology is based on two main ideas: a one-time fault-injection analysis of the microprocessor architecture to characterize the probability of successful execution of each of its instructions in presence of a soft-error, and a static and very fast analysis of the control and data flow of the target software application to compute its probability of success. The presented work goes beyond the dependability evaluation problem; it also has the potential to become the backbone for new tools able to help engineers to choose the best hardware and software architecture to structurally maximize the probability of a correct execution of the target software.
Composability of bellare-rogaway key exchange protocols

In this paper we examine composability properties for the fundamental task of key exchange. Roughly speaking, we show that key exchange protocols secure in the prevalent model of Bellare and Rogaway can be composed with arbitrary protocols that require symmetrically distributed keys. This composition theorem holds if the key exchange protocol satisfies an additional technical requirement that our analysis brings to light: it should be possible to determine which sessions derive equal keys given only the publicly available information. What distinguishes our results from virtually all existing work is that we do not rely, neither directly nor indirectly, on the simulation paradigm. Instead, our security notions and composition theorems exclusively use a game-based formalism.We thus avoid several undesirable consequences of simulation-based security notions and support applicability to a broader class of protocols. In particular, we offer an abstract formalization of game-based security that should be of independent interest in other investigations using game-based formalisms.
Rate bounds for MIMO relay channels using precoding

Relay channels plays a central role in next-generation multihop wireless systems. This paper considers the MIMO relay channel where multiple antennas are employed by each terminal. New lower bounds on the capacity of a Gaussian MIMO relay channel are derived under the assumption that the transmitter employs either superposition coding or dirty-paper coding. The proposed lower bounds improve on a previously proposed lower bound that arises from a simple transmit strategy.
Tracking Ground Vehicles in Heavy-traffic Video by Grouping Tracks of Vehicle Corners

Tracking vehicles in heavy-traffic video is a challenging problem. It is hard for algorithms based on background extraction to work well. We propose an algorithm that does not need background information. In this algorithm, vehicle corners are detected and tracked, and then grouped into vehicles. Experiments show the effectiveness of the proposed algorithm under heavy congestion.