Miracle-dz/UniFAR-FTUs huggingface dataset:
A New Method for the Structural Optimization of Product Families

This paper discusses the problem of structural optimization of product families subjected to multiple load cases, evaluated by computationally costly finite element analysis. Product families generally have a complex composition of shared components that makes individual product optimization difficult as the relation between the shared variables is not always intuitive. More optimal is to treat the problem as a product family optimization problem. For product families subjected to multiple and computationally costly crash loads, however, the optimization problem takes too long time to solve with traditional methods. Therefore, a new optimization algorithm is presented that decomposes the family problem into sub-problems and iteratively reduces the number of sub-problems, decouple and solve them.
A Study of Gaps in CBMIR using Different Methods and Prospective

hardware in the field of information technology along with a digital imaging revolution in the medical domain facilitate the generation and storage of large collections of images by hospitals and clinics. To search these large image collections effectively and efficiently poses significant technical challenges, and it raises the necessity of constructing intelligent retrieval systems. Content-based Image Retrieval (CBIR) consists of retrieving the most visually similar images to a given query image from a database of images[5]. Medical CBIR (content-based image retrieval) applications pose unique challenges but at the same time offer many new opportunities. On one hand, while one can easily understand news or sports videos, a medical image is often completely incomprehensible to untrained eyes.
Overleaf Example

We propose a novel method for autonomous legged robot navigation in densely vegetated environments with a variety of pliable/traversable and non-pliable/untraversable vegetation. We present a novel few-shot learning classifier that can be trained on a few hundred RGB images to differentiate flora that can be navigated through, from the ones that must be circumvented. Using the vegetation classification and 2D lidar scans, our method constructs a vegetation-aware traversability cost map that accurately represents the pliable and non-pliable obstacles with lower, and higher traversability costs, respectively. Our cost map construction accounts for misclassifications of the vegetation and further lowers the risk of collisions, freezing and entrapment in vegetation during navigation. Furthermore, we propose holonomic recovery behaviors for the robot for scenarios where it freezes, or gets physically entrapped in dense, pliable vegetation. We demonstrate our method on a Boston Dynamics Spot robot in real-world unstructured environments with sparse and dense tall grass, bushes, trees, etc. We observe an increase of 25-90% in success rates, 10-90% decrease in freezing rate, and up to 65% decrease in the false positive rate compared to existing methods.
What makes Paris look like Paris?

Given a large repository of geotagged imagery, we seek to automatically find visual elements, e. g. windows, balconies, and street signs, that are most distinctive for a certain geo-spatial area, for example the city of Paris. This is a tremendously difficult task as the visual features distinguishing architectural elements of different places can be very subtle. In addition, we face a hard search problem: given all possible patches in all images, which of them are both frequently occurring and geographically informative? To address these issues, we propose to use a discriminative clustering approach able to take into account the weak geographic supervision. We show that geographically representative image elements can be discovered automatically from Google Street View imagery in a discriminative manner. We demonstrate that these elements are visually interpretable and perceptually geo-informative. The discovered visual elements can also support a variety of computational geography tasks, such as mapping architectural correspondences and influences within and across cities, finding representative elements at different geo-spatial scales, and geographically-informed image retrieval.
Support Vector Machine for Persian Font Recognition

— In this paper we examine the use of global texture analysis based approaches for the purpose of Persian font recognition in machine-printed document images. Most existing methods for font recognition make use of local typographical features and connected component analysis. However derivation of such features is not an easy task. Gabor filters are appropriate tools for texture analysis and are motivated by human visual system. Here we consider document images as textures and use Gabor filter responses for identifying the fonts. The method is content independent and involves no local feature analysis. Two different classifiers Weighted Euclidean Distance and SVM are used for the purpose of classification. Experiments on seven different type faces and four font styles show average accuracy of 85% with WED and 82% with SVM classifier over typefaces
Best Management Practices (BMPs) for Nitrogen Fertilizer in Forage Grasses

There is a concern about the growing population and limitation in natural resources which are taking the population to direct its agricultural systems into a more productive and efficient activity, looking to avoid a negative impact on the surrounding environment. The industry energy expended to produce nitrogen (N)-fertilizer is considered an indirect consumption of energy in agriculture, which is higher with an increasing forage yield. Nitrogen is the key nutrient associated with high-yielding production in forage grass and grain crops. The aim of this chapter is to introduce the best management practices (BMPs) for N-fertilizer application in forage grasses to improve N-use efficiency, since the most economical way to feed livestock is forage plants where its potential biomass production is not well explored. The BMPs basically follow three management practices: (1) soil nutrient availability and forage requirement, (2) fertilizer application, and (3) decrease in nutrient losses from soil. In order to take a decision on applying N-fertilizer to accomplish forage grasses production with social, economic, and environmental benefits, the N-fertilizer use in forage grasses is going to follow the ? Right rate, Right source, Right place, and Right time (4R) nutrient stewardship. The application of the 4R? s nutrients stewardship is directly associated with economic, social, and environmental impact. The capacity of the 4R? s implementation worldwide turns into a best guide to improve the striving of better N-use efficiency in forage grass. The 4R? s are interrelated; thus, the recommendation of N-fertilizer rates cannot be prescribed without the combination of the 4R? s where a whole system to be followed should be considered to decide about N-fertilizer in pasture. Consequently, any decision in one of the 4R? s is going to affect the expected N-fertilizer results and dry matter production.
des publications du CNRC

There are many requirements for achieving the privacy needs as expressed in law. Currently there is no commonly accepted technical approach for meeting these privacy requirements. An often-fruitful way for uncovering solutions to new challenges is to examine how current technologies used in quite different applications may be adopted to meet the specific challenges. In this paper, we examine the prospect of adapting systems designed for Digital Rights Management for the purpose of Privacy Rights Management for European Community application. We begin by outlining the legal requirements for privacy under the European Union Data Directive. After an overview of digital rights management systems, we describe adaptations for transforming a DRM system into a privacy rights management system. In the conclusions we detail the strengths and weaknesses of the approach.
Effective Blame for Information-Flow Violations

Security-typed languages provide information-ﬂow security guarantees to programs which compile successfully, ensuring that when run, protected data does not leak. However, when a program fails to compile, the reason for the error is often unclear as reasoning about the information ﬂows involved can be quite subtle. We present a general model for blame that answers queries regarding the potential sources of an error in a security-typed program. We prove that the model enables the retrieval of a minimal set of constraints that contributed to the error. We then apply this framework to the problem of retroﬁtting possibly-insecure Java programs into information-ﬂow secure programs. We ﬁnd that the use of our blame model improves error resolution and enables reasoning over possible resolutions at the code-level.
Response of surface runoff to rainfall and snowmelt in the Mt. Norikura alpine area

In this paper, we present the spatiotemporal variations in physical and chemical characteristics of surface runoff due to rainfall and snowmelt in the Mt. Norikura alpine region, northern Japanese Alps. This investigation was conducted from June 22, 2016 to October 13, 2016. In addition to a water quality investigation, rainfall investigation with a rain gauge was conducted. Despite discuss the potential of surface runoff generation. We used the method of API (antecedent precipitation index) for discuss the potential of surface runoff generation. Result from rain gauge data, we quantify tendency transition from base flow to direct flow. Consequently, we achieved quantitative assessments of surface runoff using API, and became able to grasp the presence of direct flow. During the late period of melting season, we were not able to observe the surface runoff at some of investigation points. Despite during a non-rainfall period, surface runoff is observed every time at one investigation point only (elevation 2550 m a.s.l). This observation suggest that snow patch stably supply below a ground water quality locally. From the results obtained in water quality investigation, it was found that HCO3 concentration of spring water is higher than that of melt water of snow patch. The pH, electric conductivity and HCO3 concentration surface runoff were changed during flow event following rain. After it started raining, immediately these values rose and declined within a few hours. Afterwards, these values tend to gradually rose with declining water level.
A ck n 5-Approximation Algorithm for Treewidth

We give an algorithm that for an input n-vertex graph G and integer k > 0, in time 2O(k)n, either outputs that the treewidth of G is larger than k, or gives a tree decomposition of G of width at most 5k + 4. This is the first algorithm providing a constant factor approximation for treewidth which runs in time single exponential in k and linear in n. Treewidth-based computations are subroutines of numerous algorithms. Our algorithm can be used to speed up many such algorithms to work in time which is single exponential in the treewidth and linear in the input size.
WHAT’S TECHNOLOGY GO T TO DO WITH IT? A DELPHI STUDY ON COLLABORATIVE LEARNING IN DISTANCE EDUCATION

Collabora t iv e L e arning (CL) i s in c r e a s ingly b e ing u s e d in Di st an ce Edu c a t ion (DE) , a s i t ha s b ee n id e n t i f i e d a s an e ff ec t iv e s olu t ion t o k nown w e a k n e ss e s s u c h a s high av e rag e ra t e s o f dropou t and low quali t y o f l e arning a tt ainm e n t . In f orma t ion T ec hnology i s a c or e c ompon e n t o f t hi s t yp e o f l e arning a s i t no t only provid e s t h e m e an s t o c ollabora t e ov e r di st an ce bu t al s o ha s t h e po t e n t ial t o e nabl e high e r l e arning ou t c om e s . Th e r e ar e a rapidly growing numb e r o f t ec hnologi e s in u s e t oday and t h e impor t an ce o f t h e s e t o c ollabora t iv e l e arning ini t ia t iv e s , and t h e rol e t h e y play , i s an ar e a o f a c t iv e r e s e ar c h in t h e In f orma t ion Sy st e m s (IS) c ommuni t y . IS e du c a t or s and pra c t i t ion e r s f a ce an in c r e a s ing c hall e ng e t h e r e f or e n ts s hould adap t t o pur e ly linguistic ones. This doesn’t mean we have to test and understand every student’s primary learning style, only t ha t w e hav e t o d e s ign e nvironm e n ts t ha t app e al t o mul t i ple styles in a variety of ways’.
Exponential Separation of Information and Communication for Boolean Functions

We show an exponential gap between communication complexity and information complexity for boolean functions, by giving an explicit example of a partial function with information complexity ≤ O(k), and distributional communication complexity ≥ 2k. This shows that a communication protocol for a partial boolean function cannot always be compressed to its internal information. By a result of Braverman [Bra12], our gap is the largest possible. By a result of Braverman and Rao [BR11], our example shows a gap between communication complexity and amortized communication complexity, implying that a tight direct sum result for distributional communication complexity of boolean functions cannot hold, answering a long standing open problem. Our techniques build on [GKR14], that proved a similar result for relations with very long outputs (double exponentially long in k). In addition to the stronger result, the current work gives a simpler proof, benefiting from the short output length of boolean functions. Another (conceptual) contribution of our work is the relative discrepancy method, a new rectangle-based method for proving communication complexity lower bounds for boolean functions, powerful enough to separate information complexity and communication complexity.
Blind compressive sensing formulation incorporating metadata for recommender system design anupriya gogna and angshul majumdar

This is anOpenAccess article, distributed under the terms of theCreativeCommonsAttribution-NonCommercial-ShareAlike licence (http://creativecommons.org/licenses/bync-sa/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the same Creative Commons licence is included and the original work is properly cited. The written permission of Cambridge University Press must be obtained for commercial re-use. doi:10.1017/ATSIP.2015. 6
An online EEG-based brainâ€“computer interface for controlling hand grasp using an adaptive probabilistic neural network

This paper presents a new online single-trial EEG-based brain–computer interface (BCI) for controlling hand holding and sequence of hand grasping and opening in an interactive virtual reality environment. The goal of this research is to develop an interaction technique that will allow the BCI to be effective in real-world scenarios for hand grasp control. One of the major challenges in the BCI research is the subject training. Currently, in most online BCI systems, the classifier was trained offline using the data obtained during the experiments without feedback, and used in the next sessions in which the subjects receive feedback. We investigated whether the subject could achieve satisfactory online performance without offline training while the subjects receive feedback from the beginning of the experiments during hand movement imagination. Another important issue in designing an online BCI system is the machine learning to classify the brain signal which is characterized by significant day-to-day and subject-tosubject variations and time-varying probability distributions. Due to these variabilities, we introduce the use of an adaptive probabilistic neural network (APNN) working in a time-varying environment for classification of EEG signals. The experimental evaluation on ten naïve subjects demonstrated that an average classification accuracy of 75.4% was obtained during the first experiment session (day) after about 3 min of online training without offline training, and 81.4% during the second session (day). The average rates during third and eighth sessions are 79.0% and 84.0%, respectively, using previously calculated classifier during the first sessions, without online training and without the need to calibrate. The results obtained from more than 5000 trials on ten subjects showed that the method could provide a robust nt ex performance over differe
Mixed-Criticality Scheduling to Minimize Makespan ∗

In the mixed-criticality job model, each job is characterized by two execution time parameters, representing a smaller (less conservative) estimate and a larger (more conservative) estimate on its actual, unknown, execution time. Each job is further classified as being either less critical or more critical. The desired execution semantics are that all jobs should execute correctly provided all jobs complete upon being allowed to execute for up to the smaller of their execution time estimates, whereas if some jobs need to execute beyond their smaller execution time estimates (but not beyond their larger execution time estimates), then only the jobs classified as being more critical are required to execute correctly. The scheduling of collections of such mixed-criticality jobs upon identical multiprocessor platforms in order to minimize the makespan is considered here. 1998 ACM Subject Classification D.4. 1 Scheduling, D.4. 7 Real-time systems and embedded systems
RESEARCH ON THE INTELLIGENT RECONSTRUCTION METHOD OF HARMONIC SIGNAL UNDER MULTI-OBJECTIVE FAULT INTERFERENCE

: At present, most of the research on the intelligent reconstruction of harmonic signal of power grid focuses on the reconstruction of signal. However, many signal processing does not require accurate signal reconstruction. For example, in the problem of harmonic reconstruction of the power grid, if the harmonic signal of the power grid can be detected directly from the intelligent reconstruction data, there is no need to reconstruct the original harmonic signal. In order to use the network harmonic signal reconstruction algorithm to directly extract the required characteristic quantity from the sampling value to complete the signal detection task. Therefore, the research on the intelligent reconstruction method of harmonic signal under multi-objective fault interference is proposed. The sparse degree and reconstruction matrix of harmonic signals of the power grid are determined through the intelligent reconstruction framework of harmonic signals of the power grid, and an algorithm for the reconstruction of harmonic signals of the power grid is proposed to realize the reconstruction of harmonic signals of the power grid. Simulation results show that this method has high precision in detecting harmonic signal and high precision in detecting harmonic signal.
STRUCTURAL-STRATIGRAPHIC DEVELOPMENT OF THE GIDGEALPA-MERRIMELIA-INNAMINCKA TREND WITH IMPLICATIONS FOR PETROLEUM TRAP STYLES, COOPER BASIN, AUSTRALIA

A successful approach to basin analysis requires the broad-scale reconstruction of the three dimensional depositional systems in relation to concurrent structural development of the basin. The Gidgealpa-Merrimelia-lnnamincka (GMI) Trend is a prominent, asymmetric, mildly compressional anticlinal trend located in the Late Carboniferous to Triassic Cooper Basin. Its northwest flank is controlled by high angle thrust faults which were reactivated repeatedly throughout geological time. The present study addresses both the structural style and depositional character of the GMI Trend, focusing on selected areas. It is an integrated approach utilising wire-line logs, seismic interpretation, isopach and structural maps and detailed palynology. This approach has produced a detailed chronostratigraphic subdivision of the Permo-Triassic sequence, particularly the Patchawarra Formation, which points to evidence of synsedimentary tectonics. Evidence from crestal unconformities suggests that the GMI Trend was uplifted during at least four distinct structural episodes. These phases of uplift result from the rejuvenation of pre-Permian faults. Regional investigation of chronostratigraphic units incorporating palynological information, clearly demonstrates the palaeogeography and the presence of internal unconformities within the Patchawarra Formation. Subsurface distribution of hydrocarbon pools and improved definition of areas of prospectivity relate to the episodic uplifts. Although known hydrocarbon reserves have largely accumulated in structural traps, additional potential exploration targets in the Permian sequence exist in stratigraphic, combination, pinchout and downflank fault traps as well as onlap plays along the mid flank areas of the GMI Trend.
in the Proceedings of the Eighteenth Symposium on Usable Privacy and Security (SOUPS 2022)

We examined the policies of 120 of the most popular web-sites for when a user creates a new password for their account. Despite well-established advice that has emerged from the research community, we found that only 13% of websites followed all relevant best practices in their password policies. Speciﬁcally, 75% of websites do not stop users from choosing the most common passwords—like “ abc123456 ” and “ P@$$w0rd ”, while 45% burden users by requiring speciﬁc character classes in their passwords for minimal security ben-eﬁt. We found low adoption of password strength meters—a widely touted intervention to encourage stronger passwords, appearing on only 19% of websites. Even among those sites, we found nearly half misusing them to steer users to include certain character classes, and not for their intended purpose of encouraging freely-constructed strong passwords.
A universal probabilistic spike count model reveals ongoing modulation of neural variability Supplementary Material A Parametric count distributions

The Poisson distribution is characterized by the equality of its mean and variance, leading to a Fano factor V[n]/E[n] = 1. Another convenient property is that the sum of two independent Poisson processes is itself a Poisson process with λ = λ1 + λ2. This can be shown directly by considering P (n) = ∑n 0 P (k)P (n−k) or casting it as a limit of the sum of two Bernoulli processes, and follows intuitively from the fact that spike times are independent of each other. As a consequence, for the inhomogeneous case where we have a time-dependent rate λ(t) the count distribution over a longer interval is still Poisson with average ∫ T
The Role of Internet Service Providers in Botnet Mitigation an Empirical Analysis Based on Spam Data

Botnets – networks of machines infected with malicious software – are widely regarded as a critical security threat. Measures that directly address the end users who own the infected machines are useful, but have proven insufficient to reduce the overall problem. Recent studies have shifted attention to Internet Service Providers (ISPs), the providers of Internet access to end users, as possible control points for botnet activity….
Specifications are not (necessarily) executable

Specifications can be written in languages which have formal semantics. Their very formality, and the similarities with some aspects of implementation languages, invites the idea that specifications might be executed. This paper presents a number of arguments against that idea. The aim is to warn of the dangers of limiting specification languages to the point where all of their constructs can be executed. While conceding the difficulties of relating specifications to an understanding of the ‘requirements’ for a system, it is argued that other solutions should be sought than ‘executable specification languages’.