Miracle-dz/UniFAR-FTUs huggingface dataset:
Inducing Optimal Scheduling with Selfish Users

It is well known that scheduling jobs according to the Shortest-Remaining-Processing-Time (SRPT) policy is optimal for minimizing mean response time in a single-server system with online arrivals. Unfortunately, SRPT scheduling requires users to reveal their job size (service requirement), which is not always realistic. This may be because some users are informed, but selfish (or rational): they know their job size but are willing to lie about it if that is to their advantage. Alternatively, users may be uninformed – they may genuinely not know their size. Complicating matters further, the system administrator may not be able to differentiate between users of these two types. This adds significant complications to the management of such systems, as threats that are credible to force informed users to reveal their size may be unfair to uninformed users. This situation is common in supercomputing environments, for example. To cope with such a situation we develop a novel approach for inducing the informed users into selfscheduling themselves according to (an approximation of) SRPT while not, unfairly, penalizing the uninformed users. We achieve this by defining a game that users play, applying priority-boosting tokens to portions of their job. For the informed users, we characterize the features of a unique equilibrium self-scheduling policy. We prove that the equilibrium policy is a dominant strategy, i.e. no user has any incentive to follow any other strategy, regardless of other users’ behavior. We show that the optimal strategy of uninformed users is highly complex and may lead to multiple, potentially unstable, equilibria. Then, via queueing-theoretic analysis, we evaluate the effectiveness of our game as a function of job size variability, load, and other system parameters. We find that our game results in a near approximation of SRPT scheduling for informed users when the appropriate number of tokens (which we can determine) is distributed.
Unclassified cases of behavioral variant of major frontotemporal neurocognitive disorder in the Diagnostic and Statistical Manual of Mental Disorders, 5th edition

In the Diagnostic and Statistical Manual of Mental Disorders, 5th edition (DSM‐5), the behavioral variant of major frontotemporal neurocognitive disorder (bvFT‐NCD) is subclassified into “probable bvFT‐NCD” or “possible bvFT‐NCD. ” When genetic evidence is unavailable, cases without clinical neuroimaging are subclassified into “possible bvFT‐NCD,” whereas cases whose clinical images show the typical characteristics are subclassified into “probable bvFT‐NCD. ” Thus, the cases that meet the diagnostic criteria of bvFT‐NCD based on their symptoms, but lack the neuroimaging characteristics, fall between the two categories of probable and possible bvFT‐NCD. These cases herein are defined as “unclassified bvFT‐NCD,” and the present study aims at considering an appropriate diagnostic approach to such cases, that is, whether unclassified bvFT‐NCD should be included in bvFT‐NCD as a third subcategory, or whether it should be classified into diseases other than bvFT‐NCD.
Leveraging design rules to improve software architecture recovery

In order to recover software architecture, various clustering techniques have been created to automatically partition a software system into meaningful subsystems. While these techniques have demonstrated their effectiveness, we observe that a key feature within most software systems has not been fully exploited: most well-designed systems follow strong architectural design rules that split the overall system into modules. These design rules are often manifested as special program constructs, such as shared data structures or abstract interfaces, which should not belong to any of the subordinate modules. We contribute a new perspective of architecture recovery based on this rationale, which enables the combination of design-rule-based clustering with other clustering techniques, as well as enabling the splitting of a large system into subsystems. We evaluated our approach both quantitatively and qualitatively, using both open source and real industrial software projects.
Implications of the US Cholesterol Guidelines on Eligibility for Statin Therapy in the Community: Comparison of Observed and Predicted Risks in the Framingham Heart Study Offspring Cohort

Background Concerns have been raised that the 2013 atherosclerotic cardiovascular disease (ASCVD) risk estimator overpredicts risk in contemporary cohorts. Whether suboptimal calibration will lead to overtreatment with statins is unknown. We investigated the numbers of people eligible for statin treatment in the Framingham Heart Study Offspring Cohort, based on the 2013 cholesterol guidelines, and estimated the proportion that may be overtreated as a result of potential miscalibration of the ASCVD estimator. Methods and Results During a median follow‐up of 10 years, we observed 285 ASCVD events (8.4%; comprising ischemic stroke, myocardial infarction, and coronary artery disease death) among 3396 men and 112 events (2.9%) among 3838 women. Hosmer–Lemeshow chi‐square statistics were 16.3 in men (340 predicted versus 285 observed events) and 29.1 in women (166 predicted versus 112 observed events). Overprediction predominantly occurred among women in the highest risk decile and among men in the ≥7th risk deciles, for which observed ASCVD event rates were ≥7.5%. In total, 2615 participants (36%; 867 women) were eligible for statins based on the new guidelines. Of these, 171 women (20%) and 154 men (9%) were reclassified downward (as not eligible for statin therapy) using a recalibrated ASCVD estimator. In the latter group, 18 women (10.5%; 95% CI 5.9% to 15.2%) and 11 men (7.1%; 95% CI 3.0% to 11.3%) experienced ASCVD. Conclusions The risk estimator overpredicted ASCVD risk but did so mainly among high‐risk participants who would be considered eligible for statin use anyway. Our findings may mitigate concerns regarding the potential impact of miscalibration of the ASCVD estimator in contemporary cohorts.
Trainable table location in document images

We describe an approach for table location in document images. The documents are described by means of a hierarchical representation that is based on the MXY tree. The presence of a table is hypothesized by searching parallel lines in the MXY tree of the page. This hypothesis is afterwards verified by locating perpendicular lines or white spaces in the region included between the parallel lines. Lastly, located tables can be merged on the basis of proximity and similarity criteria. The use of an optimization method, that relies on the definition of an appropriate table location index, allows us to identify, the optimal values of thresholds involved in the algorithm. In this way the algorithm can be adapted to recognize tables with different features by maximizing the performance on an appropriate training set. The algorithm has been evaluated on two data-sets containing more than 1500 pages, and comparing its results with the tables identified by two commercial OCRs.
USE OF RHEOLOGICAL AND OTHER DATA IN ASPHALT ENGINEERING PROBLEMS

THE PERFORMANCE IN SERVICE OF ASPHALTS IN VARIOUS SYSTEMS DEPENDS BOTH ON THE INFLUENCE TO WHICH THE MATERIAL IS SUBJECTED AND THE INTRINSIC PROPERTIES OF THE ASPHALT ITSELF. A WIDE VARIETY OF ASPHALTS HAS BEEN INVESTIGATED WITH RESPECT TO (1) THEIR RHEOLOGICAL BEHAVIOR UNDER BOTH STATIC AND DYNAMIC LOAD, (2) THEIR BREAKING PROPERTIES, AND (3) OTHER PROPERTIES SUCH AS WATER PERMEABILITY, PHOTOCHEMICAL DECOMPOSITION, ETC. THE RHEOLOGICAL DATA ARE CONDENSED TO GENERALIZED CURVES OF BOTH THE DYNAMIC STORAGE AND LOSS MODULI VERSUS FREQUENCY, THE TEMPERATURE DEPENDENCE OF THESE CURVES, AND THE DEPENDENCE OF THE INITIAL VISCOSITY ON TEMPERATURE. BY THE USE OF THE SOFTENING POINT AND PENETRATION, IT IS SHOWN HOW, WITH THE AID OF THE STATED CURVES AND EMPIRICAL RELATIONSHIPS, TO FIND THE WHOLE RHEOLOGICAL BEHAVIOR OF AN ASPHALT. SEVERAL PROTOTYPE EXAMPLES OF ENGINEERING PROBLEMS ARE SOLVED, AND ARE EVIDENCE THAT ASPHALTS, NO LESS THAN METALS, CAN BE DEALT WITH AS ENGINEERING MATERIALS. A FLOW PROBLEM IS SOLVED WITH THE AID OF THE CURVES OF INITIAL VISCOSITY VERSUS TEMPERATURE. USE OF THE TWO RHEOLOGICAL MODULI IN SOLVING ENGINEERING PROBLEMS IS SHOWN FOR THE CASE OF THE ATTENUATION OF VIBRATIONS. ALSO THE METHOD OF EXTENDING CLASSICAL ELASTIC THEORY TO THESE VISCO-ELASTIC MATERIALS IS OUTLINED, WITH THE PARTICULAR CASE OF A BENDING BEAM GIVEN IN DETAIL. THE PROBLEM OF WHETHER THERMAL CHANGES WILL CAUSE CRACKING OF AN ASPHALT IS INVESTIGATED. /AUTHOR/
Word sense disambiguation criteria: a systematic study

This article describes the results of a systematic in-depth study of the criteria used for word sense disambiguation. Our study is based on 60 target words: 20 nouns, 20 adjectives and 20 verbs. Our results are not always in line with some practices in the field. For example, we show that omitting non-content words decreases performance and that bigrams yield better results than unigrams.
Application of rough set-based neuro-fuzzy system in NIRS-based BCI for assessing numerical cognition in classroom

Near-infrared spectroscopy (NIRS) studies have revealed that performing mental arithmetic tasks have associated event-related hemodynamic responses that are detectable. Thus NIRS-based Brain Computer Interface (BCI) has the potential for investigating how to best teach mathematics in a classroom setting. This paper presents a novel computational intelligent method of applying rough set-based neuro-fuzzy system (RNFS) in NIRS-based BCI for assessing numerical cognition. A study is performed on 20 healthy subjects to measure 32 channels of hemoglobin responses in performing three difficulty levels of mental arithmetic. The accuracy is then presented using 5×5-fold cross-validations on the data collected. The results of applying RNFS and its Mutual Information-based Rough Set Reduction (MIRSR) for feature selection is then compared against the Naïve Bayesian Parzen Window classifier and other MI-based feature selection algorithms. The results of applying RNFS yielded significantly better accuracy of 75.7% compared to the other methods, thus demonstrating the potential of RNFS in NIRS-based BCI for assessing numerical cognition.
A Corpus-based Approach to Tahltan Stress

According to the first paper on the subject, Cook 1972, stress assignment in Tahltan (Northern Athabaskan) is governed by both morphological and phonological principles. Cook’s report describes the language of a Tahltan elder from Lower Post (northern British Columbia) and claims that stress is assigned to the syllable containing the stem and on alternating syllables counting from that stem syllable. Stress is essentially predictable, therefore, and involves reference to both the morphological stem and a binary pairing of syllables. Nater 1989 is a multi-speaker study of Tahltan spoken in the community of Iskut, British Columbia. The description and analysis of Tahltan stress in Nater differs from that of Cook 1972 in some respects. First, Cook’s stress rule states that stress is predictable from morphological and phonological information. Nater, on the other hand, argues that stress is not predictable and is in fact a distinctive feature of the language. Second, Cook’s alternating stress rule entails that stress is iterative and rhythmic in Tahltan, falling on every other syllable. Nater’s transcriptions, however, imply that stress is noniterative, since only compounds have more than one stress per word. Even three-syllable words, like menedu ‘domestic sheep’, and four-syllable words, e.g., eskene e ‘my raft’, do not receive more than one stress in his system. These differences of opinion, listed below, raise the question of whether the two researchers used different methods to
Combining strategies for tagging and parsing Arabic

We describe a simple method for combining taggers which produces substantially better performance than any of the contributing tools. The method is very simple, but it leads to considerable improvements in performance: given three taggers for Arabic whose individual accuracies range from 0.956 to 0.967, the combined tagger scores 0.995‐a sevenfold reduction in the error rate when compared to the best of the contributing tools. Given the effectiveness of this approach to combining taggers, we have investigated its applicability to parsing. For parsing, it seems better to take pairs of similar parsers and back off to a third if they disagree.
Memory-aware Bounded Model Checking for Linear Hybrid Systems

Bounded Model Checking (BMC) is a successful method for refuting properties of erroneous systems. Initially applied to discrete systems only, BMC could be extended to more complex domains like linear hybrid automata. The increasing complexity coming along with these complex models, but also recent optimizations of SAT-based BMC, like excessive conflict learning, reveal a memory explosion problem especially for deep counterexamples. In this paper we introduce parametric data types for the internal solver structure that, taking advantage of the symmetry of BMC problems, remarkably reduce the memory requirements of the solver.
Species based evolutionary algorithms for multimodal optimization: A brief review

The species conservation technique is a relatively new approach to finding multiple solutions of a multimodal optimization problem. When adopting such a technique, a species is defined as a group of individuals in a population that have similar characteristics and are dominated by the best individual, called the species seed. Species conservation techniques are used to identify species within a population and to conserve the identified species in the current generation. A ‘species-based evolutionary algorithm’ (SEA) is the combination of a species conservation technique with an evolutionary algorithm, such as genetic algorithms, particle swarm optimization, or differential evolution. These SEAs have been demonstrated to be effective in searching multiple solutions of a multimodal optimization problem. This paper will briefly review its principles and its variants developed to date. These methods had been used to solve engineering optimization problems and found some new solutions.
Alloy development by laser cladding: An overview

The ever increasing and often conflicting demands made on engineering materials for suitable physical, chemical, and mechanical properties, have led engineers to take an increased interest in surface coating techniques for material protection. Laser cladding has shown that high quality, distortion free, clad, or alloyed layers can be deposited successfully on base materials. The blown powder laser cladding technique has been established and is used to produce analogs of bulk high alloy materials as hardfacing wear resistant coatings on plane carbon steel substrates. This article shows that a small selection of cladding materials is used in a wide range of cladding applications. An overview is given on how the cladding process is used to generate alloys quickly from powder mixtures of metals and ceramics. Consideration is then given to the variable composition laser cladding technique.
Location Privacy Preserving of Mobile Users using Secured Homomorphism

In today’s highly interconnected world users are increasingly dependent on high end smartphones and mobile devices. Users arrange and plan their daily routines using such high end devices. These applications often rely on current locations of individual users or a group of users to provide the desired service. By means of such applications and services, majority of such user population reveal their current location details to the third party service providers. Knowingly or unknowingly mobile users compromise their privacy. Without efficient protection, even sharing location information has been shown to provide reliable information about a users’ private globe, which could have severe consequences on the users’ personal, social, and financial life Users, who are cautious about their whereabouts, do not necessarily want to reveal their current locations to the service provider or to untrusted users. This paper, proposes algorithms for location privacy preserving of mobile users. This is to provide practical privacy-preserving techniques to solve this problem, such that neither an untrusted user, nor participating users, can learn other users’ locations, legitimate users only learn the optimal location.
Title Time-efficient algorithms for BGP route configuration

Based on the concept of most popular prefix first, two efficient algorithms for BGP route configuration are proposed. The first algorithm MPPF_SES is designed for solving the single egress selection (SES) problem, and the second algorithm MPPF_MES is for multiple egress selection (MES). MPPF_MES has two variants, one aims at minimizing the total amount of resources consumed for carrying the transit traffic, and the other tries to minimize the egress link capacity required. Compared with the existing algorithms, a comparable performance in terms of network resources consumed can be obtained. In case of SES, our MPPF_SES can carry a given traffic load with much lower egress link capacity requirement. In case of MES, our MPPF_MES tends to provide a more stable performance. Last but not the least, our proposed algorithms have a much lower time complexity than the existing approach.
Molecular dynamics simulation of the processive endocellulase Cel48F from Clostridium cellulolyticum: a novel “water‐control mechanism” in enzymatic hydrolysis of cellulose

Glycoside hydrolase of Cel48F from Clostridium cellulolyticum is an important processive cellulose, which can hydrolyze cellulose into cellobiose. Molecular dynamics simulations were used to investigate the hydrolysis mechanism of cellulose. The two conformations of the Cel48F‐cellotetrose complex in which the cellotetroses are bound at different sites (known as the sliding conformation and the hydrolyzing conformation) were simulated. By comparing these two conformations, a water‐control mechanism is proposed, in which the hydrolysis proceeds by providing a water molecule for every other glucosidic linkage. The roles of certain key residues are determined: Glu55 and Asp230 are the most probable candidates for acid and base, respectively, in the mechanism of inverting anomeric carbon. Met414 and Trp417 constitute the water‐control system. Glu44 might keep the substrate at a certain location within the active site or help the substrate chain to move from the sliding conformation to the hydrolyzing conformation. The other hydrophobic residues around the substrate can decrease the sliding energy barrier or provide a hydrophobic environment to resist entry of the surrounding water molecules into the active site, except for those coming from a specific water channel. Copyright © 2014 John Wiley & Sons, Ltd.
Pelleting in Associated with Sodium Monensin Increases the Conjugated Linoleic Acids Concentration in the Milk of Dairy Cows Fed Canola Seeds

To evaluate the effects of the pelleting and the addition of sodium monensin on production, the chemical and lipid composition of milk and butter physical characteristics, 4 Holstein dairy cows (135 days of lactation) with an average milk production of 14.7 kg/d, were supplemented with a concentrate containing ground canola seeds. The cows were assigned to a 4×4 Latin square design with a 2×2 factorial arrangement of treatments: i) ground maize, soybean meal, mineral and vitamin supplements, and ground canola seeds (CG); ii) CG concentrate with 31.5 mg of monensin added per kg of dry matter (DM); iii) CG pelleted concentrate; iv) CG concentrate with monensin addition pelleted. There was no difference in milk production and composition. The addition of monensin increased milk concentration of polyunsaturated fatty acids (PUFA), the PUFA/saturated fatty acids (SFA) ratio, and omega 6. The pelleting increased the concentration of monounsaturated fatty acids, the PUFA/SFA ratio, and the omega 6/omega 3 ratio, but decreased the concentration of SFA. The association between pelleting and the addition of monensin increased the concentration of conjugated linoleic acids by 46.9%. The physical characteristics of butter were not affected by the evaluated diets. We concluded that the concentrate with 31.5 mg of monensin added per kg DM basis combined with the pelleting improves the lipid composition of milk from Holstein cows that are on pasture and supplemented with ground canola seeds, without changing the production, milk composition, and spreadability of butter.
Demo Abstract : Lightweight Continuous Indoor Tracking System

Indoor tracking and navigation is a fundamental need for pervasive and context-aware smartphone applications. Although indoor maps are becoming increasingly available, there is no practical and reliable indoor map matching solution available at present. In this demo abstract, we describe a working prototype of a novel, robust and responsive tracking technique that is extremely computationally efficient (running in under 10 ms on an Android smartphone), does not require training in different sites, and tracks well even when presented with very noisy sensor data. The tracking system requires zero user effort (wardriving, fingerprinting, etc.) – only the floor plan is required. We also demonstrate how it is able to accurately track the position of a user from accelerometer and magnetometer measurements only (i.e. gyroand WiFi-free). We believe that such an energyefficient approach will enable always-on continuous background localisation, enabling a new era of location-aware applications to be developed.
Joint routing and resource control in software-defined sensor networks

Software-defined sensor networks (SDSN) has appeared as a new networking paradigm that allows centralized management and control of networking devices programmably to increase network reliability. In this paper, we propose a joint routing and resource management algorithm that maximizes the system throughput for SDSN. We show that the formulated optimization problem can be proved convexifiable through re-parameterization and can be decomposed into two sub-problems by adopting Lagrangian decomposition approach. Therefore, the proposed joint routing and resource management algorithm(JRRC) can be implemented in two phases, where the routing is realized distributedly using the improved C-SPMR, and the resource management is done for SDSN nodes under the control of the central controller. Simulation results show that JRRC can effectively schedule resource to maximise the throughput based on the network state.
OpinMiner: Extracting Feature-Opinion Pairs with Dependency Grammar from Chinese Product Reviews

With the flourish of the Web, online review is become a more and more useful and important information resource for people. As a result, automatic review mining has become a hot research topic recently. Traditional review mining based on feature extracts product feature and opinion word independently, and seldom considers their association information. In this paper, we only focus on Chinese product review. We propose a method based on Chinese dependency grammar to extract feature-opinion word pairs. Specifically, we use Chinese dependency grammar to set several rules, then we make use of these rules to extract candidate feature-opinion word pairs. Finally, we filter out mismatched feature-opinion words pairs by feature ranking and Named Entity Recognition (NER) system. Experiment shows that our method in Precision is rather high.