Miracle-dz/UniFAR-FTUs huggingface dataset:
Family Values: A Behavioral Notion of Subtyping

and all of CMU-CS-93-149. The document is a union of papers. Keywords: Subtype, object-oriented design, abstraction function, extensible types, mutable types, specifications, semantics 34 pages [FTP: CMU-CS-93-187.ps] The use of hierarchy is an important component of object-oriented design. Hierarchy allows the use of type families, in which higher level supertypes capture the behavior that all of their subtypes have in common. For this methodology to be effective, it is necessary to have a clear understanding of how subtypes and supertypes are related. This paper takes the position that the relationship should ensure that any property proved about supertype objects also holds for its subtype objects. It presents two ways of defining the subtype relation, each of which meets this criterion, and each of which is easy for programmers to use. The paper also discusses the ramifications of this notion of subtyping on the design of type families.
A Fast Optimization Method for General Binary Code Learning

Hashing or binary code learning has been recognized to accomplish efficient near neighbor search, and has thus attracted broad interests in recent retrieval, vision, and learning studies. One main challenge of learning to hash arises from the involvement of discrete variables in binary code optimization. While the widely used continuous relaxation may achieve high learning efficiency, the pursued codes are typically less effective due to accumulated quantization error. In this paper, we propose a novel binary code optimization method, dubbed discrete proximal linearized minimization (DPLM), which directly handles the discrete constraints during the learning process. Specifically, the discrete (thus nonsmooth nonconvex) problem is reformulated as minimizing the sum of a smooth loss term with a nonsmooth indicator function. The obtained problem is then efficiently solved by an iterative procedure with each iteration admitting an analytical discrete solution, which is thus shown to converge very fast. In addition, the proposed method supports a large family of empirical loss functions, which is particularly instantiated in this paper by both a supervised and an unsupervised hashing losses, together with the bits uncorrelation and balance constraints. In particular, the proposed DPLM with a supervised ℓ2 loss encodes the whole NUS-WIDE database into 64-b binary codes within 10 s on a standard desktop computer. The proposed approach is extensively evaluated on several large-scale data sets and the generated binary codes are shown to achieve very promising results on both retrieval and classification tasks.
Graphical Passwords

Computer security experts often tell us not to choose an easy to guess word as a password. For example, the user name or date of birth. The Graphical Passwords team have been working on a new password system that is more secure. Their tests suggest that the Background Draw A Secret (BDAS) graphical password are up to 40 percent stronger than a typical eight. Character password made up of letters, numbers and symbols. Just a simple smiley face password, can have a strength of 55 bits. For example, traditional passwords such as C4hjy! 89 would have a strength of about 53bits. The very simple smiley face would have a similar strength. But a slightly morecomplex picture would be much stronger. In earlier time where secure communication and code-breaking were vitally important. An American electrical engineer and mathematician called Claude Shannon published a groundbreaking book. The Mathematical theory of Communication established a new branch of applied mathematics now known as information theory which enabled mathematicians to quantify information. In particular, he came up with a way of measuring how much information there is in a message, called information entropy. Information entropy can measure how much redundancy there is in a message or conversely, how much information it carries. A high entropy means there is a lot of uncertainty, so the message carries a lot of new information. So the higher the entropy, the more difficult a password is to guess. For example, a message telling " You are at the 2008 Royal Society Summer Exhibition " doesn't tell you anything you don't know. You knew that would happen when you set out this morning. But telling you " You are at the Graphical Passwords stand " does give you new information. The overall entropy of an event X is calculated as the sum of each possible outcome x within X. Let's write the probability of a particular outcome as p(x). So if p(x) = 1, then we know that that particular outcome will definitely happen in information terms, this means a content of 0.Putting in some other conditions, it turns out that taking the logarithm-i.e. log(p(x)) is the best way to handle this measure of information. Logarithms can be calculated in any base but if the chosen base is 2 then we say that the information is in bits, ideal when you are talking about computer information. So the information entropy is …
A Load Balancing Procedure for Parallel Constraint Programming

In this paper, we design a parallel Constraint Programming (CP) method to solve Constraint Satisfaction Problems (CSP). We use some attributes induced by the CP model of a CSP to improve the load balancing procedure embedded in the parallel tree- based search algorithm. Load balancing is improved by using specialized branching heuristics and workload estimators based on the CP model. More precisely, solution counting is used as an approximation of the computational size of the tasks in the parallel CP solver. This approximation of the workload of a task improves the work decomposition or work splitting procedure as well as the distribution of the tasks in the parallel algorithm. Experimental results indicate that this information speeds up the parallel exploration of the search tree.
Confidence bounds for the reliability of a system from subsystem data

The paper is concerned with the construction of lower bounds for the reliability of a system when statistical data come from independent tests of its elements. The overview of results known from literature and obtained under the assumption that elements in a system are independent is given. It has been demonstrated using a Monte Carlo experiment that in case when these elements are dependent and when their dependence is described by Clayton and Gumbel copulas these confidence bounds are not satisfactory. New simple bounds have been proposed which in some practical cases perform better than the classical ones.
Effect of the PPARG2 Pro12Ala Polymorphism on Associations of Physical Activity and Sedentary Time with Markers of Insulin Sensitivity in Those with an Elevated Risk of Type 2 Diabetes

Background Peroxisome proliferator-activated receptor gamma (PPARγ) is an important regulator of metabolic health and a common polymorphism in the PPAR-γ2 gene (PPARG2) may modify associations between lifestyle behaviour and health. Objective To investigate whether the PPARG2 Pro12Ala genotype modifies the associations of sedentary behaviour and moderate-to-vigorous intensity physical activity (MVPA) with common measures of insulin sensitivity. Methods Participants with a high risk of impaired glucose regulation were recruited, United Kingdom, 2010-2011. Sedentary and MVPA time were objectively measured using accelerometers. Fasting and 2-hour post-challenge insulin and glucose were assessed; insulin sensitivity was calculated using Matsuda-ISI and HOMA-IS. DNA was extracted from whole blood. Linear regression examined associations of sedentary time and MVPA with insulin sensitivity and examined interactions by PPARG2 Pro12Ala genotype. Results 541 subjects were included (average age = 65 years, female = 33%); 18% carried the Ala12 allele. Both sedentary time and MVPA were strongly associated with HOMA-IS and Matsuda-ISI after adjustment for age, sex, ethnicity, medication, smoking status and accelerometer wear time. After further adjustment for each other and BMI, only associations with Matsuda-ISI were maintained. Every 30 minute difference in sedentary time was inversely associated with a 4% (0, 8%; p = 0.043) difference in Matsuda-ISI, whereas every 30 minutes in MVPA was positively associated with a 13% (0, 26%; p = 0.048) difference. The association of MVPA with Matsuda-ISI was modified by genotype (p = 0.005) and only maintained in Ala12 allele carriers. Conversely, sedentary time was not modified by genotype and remained inversely associated with insulin sensitivity in Pro12 allele homozygotes. Conclusion The association of MVPA with Matsuda-ISI was modified by PPARG2 Pro12Ala genotype with significant associations only observed in the 18% of the population who carried the Ala12 allele, whereas associations with sedentary time were unaffected.
A Power Optimized Continuous-Time $\Delta \Sigma $ ADC for Audio Applications

We present design considerations for low-power continuous-time modulators. Circuit design details and measurement results for a 15 bit audio modulator are given. The converter, designed in a 0.18 mum CMOS technology, achieves a dynamic range of 93.5 dB in a 24 kHz bandwidth and dissipates 90 muW from a 1.8 V supply. It features a third-order active-RC loop filter, a very low-power 4-bit flash quantizer, and an efficient excess-delay compensation scheme to reduce power dissipation.
Modulation classification of MQAM signals using particle swarm optimization and subtractive clustering

This paper proposes a novel algorithm for modulation recognition of MQAM signals which uses the combination of subtractive clustering (SC) and particle swarm optimization (PSO) (PSO-SC) to extract the discriminating features. The method uses PSO to search for the best clustering radius of SC in order to enable reconstructed constellation optimal. Then, the best clustering radius (CR) is used as classification feature. Compared with the classification methods available using subtractive clustering, the algorithm proposed by this paper has higher correct classification rate in modulation classification for MQAM signals. In addition, simulation results show that the modulation classification method performs robust in the low signal-noise ratio.
International Migration: A Panel Data Analysis of Economic and Non-Economic Determinants

In this paper I empirically investigate economic and non-economic determinants of migration inflows into fourteen OECD countries by country of origin, between 1980 and 1995. The annual panel data set used makes it possible to exploit both the time-series and cross-country variation in immigrant inflows. I focus on both supply and demand determinants of migration patterns and find results broadly consistent with the theoretical predictions of a standard international-migration model. Both first and second moments of the income distribution in the destination and origin countries shape international migration movements. In particular, I find evidence of robust and significant pull effects, that is the positive impact on immigrant inflows of improvements in the mean income opportunities in the host country. Inequality in the origin and destination economies affects the size of migration rates as predicted by Borjas (1987) selection model. Finally, among the non-economic determinants, I investigate the impact on emigration rates of geographical, cultural, and demographic factors as well as the role played by changes in destination countries' migration policies.
A real-world system for human motion detection and tracking

In this thesis we present an operational computer vision system for real-time detection and tracking of human motion. The system captures monocular video of a scene and identifies those moving objects which are characteristically human. This serves as both a proof-ofconcept and a verification of other existing algorithms for human motion detection. An approach to statistical modeling of motion developed by Y. Song is coupled with a preprocessing stage of image segmentation and point feature tracking. This design allows a system that is robust with respect to occlusion, clutter, and extraneous motion. The results of experiments with the system indicate the ability to minimize both false detections and missed detections.
Secure Wireless Network in Quadrilateral Region

According to circular range of antenna broadcasting, The usual shape of environment is circular, but most of companies and establishments have a quadrilateral region. In some applications like as military or research company, It is important that nobody out of region, can access to their network. In other word, network services must be valid only inside the region. There are some techniques to be in this situation. The novelty of this paper is: 1) distinguish the position of users at region, 2) making a quadrilateral region for wireless environment (rather than circular). Two basic techniques are used to reduce the cost of this feature, and both of them use snoopy method. This technique can reduce DoS and active search effect at security.
Explicit solutions of a convection-reaction equation and defects of difference schemes

We introduce two kinds of explicit solutions to the convection-reaction equation, u t + (|u| q /q) x = u, u, x ∈ R, t ∈ R? , q ＞ 1, and employ them to test properties of various computational schemes. From this test we observe that computed solutions using Lax-Friedrichs. MacCormack and Lax-Wendroff schemes break down in a finite time. On the other hand some other schemes including WENO, NT and Godunov show more stable behavior and the tests provide their detailed behaviors. It is discussed that if a numerical scheme is applied to this problem together with the splitting method, certain defects of the scheme can be magnified exponentially and observed easily. Sometimes such a behavior destroys the numerical solution completely and hence one need to pay extra caution to deal with reaction dominant systems.
PERFORMANCE ANALYSIS OF ADAPTIVE ALGORITHMS FOR NOISE CANCELLATION IN SPEECH PROCESSING

This paper is proposed to remove the noise from the spe ch signal in real time environment. The qualit y of audio signal can be improved by filtering the degra ded speech signal through adaptive filters. For Noi se cancellation widrow & hoff’s Least Mean Square (LMS ) algorithms are being used for simplicity in implementation. But LMS algorithm has limitation in selection of a certain values such as step size wh ich implies dilemma in fast convergence rate and Excess mean square error (EMSE) and results in computational complexity. This paper analyse the pe rformance of Variable Step Size Normalised LMS , Normalised Differential LMS with proposed VSSNDLMS with different input signals. Finally, through simulation results the proposed VSSNDLMS algorithm converges fastly with minimum mean square error and it is useful in predicting the adaptive filter performance of various algorithms and the implement ation indicate the improvement in quality of the speech s ignal.
Role of piRNAs in the Drosophila telomere homeostasis

Drosophila telomeres are maintained as a result of transpositions of specialized telomeric retrotransposons. The abundance of telomeric retroelement transcripts, as well as the frequency of their transpositions onto the chromosome ends, is controlled by a PIWI-interacting RNA (piRNA) pathway. In our recent report, we demonstrate strong evidence of piRNA-mediated transcriptional silencing of telomeric repeats in the Drosophila germline. Telomerase-generated repeats serve as a platform for recruiting specialized DNA-binding proteins which are involved in chromosome end protection and in the telomere length control. No specific proteins are known to bind to heterogeneous long sequences of the Drosophila telomeric retrotransposons. The importance of the piRNA silencing mechanism in the formation of telomeric chromatin along the region of the retrotransposon array will be discussed. We propose that Drosophila telomeric retrotransposon HeT-A serves as a template for the piRNA-mediated assembly of the specific protein complex, which is functionally similar to the recruiting of the DNA-binding telomeric proteins by the telomerase-generated repeats. The role of the piRNA pathway components in the assembly of the telomere capping complex was recently unveiled. Taken together, these data elucidate the importance of the piRNA pathway in the Drosophila telomere homeostasis.
Translamellar Disinhibition in the Rat Hippocampal Dentate Gyrus after Seizure-Induced Degeneration of Vulnerable Hilar Neurons

Longitudinally restricted axonal projections of hippocampal granule cells suggest that transverse segments of the granule cell layer may operate independently (the “lamellar” hypothesis). Longitudinal projections of excitatory hilar mossy cells could be viewed as antithetical to lamellar function, but only if longitudinal impulse flow effectively excites distant granule cells. We, therefore, determined the effect of focal granule cell discharges on granule cells located >2 mm along the longitudinal axis. During perforant pathway stimulation in urethane-anesthetized rats, passive diffusion of the GABAA receptor antagonist bicuculline methiodide from the tip of a glass recording electrode evoked granule cell discharges and c-Fos expression in granule cells, mossy cells, and inhibitory interneurons, within a ∼400 μm radius. This focally evoked activity powerfully suppressed distant granule cell-evoked responses recorded simultaneously ∼2.5–4.5 mm longitudinally. Three days after kainic acid-induced status epilepticus or prolonged perforant pathway stimulation, translamellar inhibition was intact in rats with <40% hilar neuron loss but was consistently abolished after extensive (>85%) hilar cell loss. Retrograde transport of Fluoro-Gold (FG) from the rostral dentate gyrus revealed that few inhibitory interneurons were among the many retrogradely labeled hilar neurons 2.5–4.5 mm longitudinally. Although many somatostatin-positive hilar interneurons effectively transported FG from the distant septum, few of these neurons transported detectable FG from much closer hippocampal injection sites. Inhibitory basket and chandelier cells also exhibited minimal longitudinal FG transport. These findings suggest that translamellar disinhibition may result from the loss of vulnerable, longitudinally projecting mossy cells and may represent a network-level mechanism underlying postinjury hippocampal dysfunction and epileptic network hyperexcitability.
SkyCube-tree based query processing in OLAP skyline cubes

Skyline Cube (SC) has been proposed as an extension of Data Cube by using the skyline operator. Although both range queries and group-by queries are useful for decision making support, they impose much burdens upon a query processing system. To cope with the difficulty, this paper presents efficient query processing methods for both type of queries. It is relied on SkyCube-tree, R-tree like hierarchical index structure, which organizes precomputed extended skyline information for processing queries efficiently. According to the performance evaluation, the query processing time for range queries and group-by queries is under 20% and 10% respectively compared with that of each corresponding materialized view based method, within allowable storage size of SkyCube-tree.
Analysis of two generic spatially extended predator-prey models

We present the analysis of two reaction-diusion systems modeling predator-prey interactions with the Holling Type II functional response and logistic growth of the prey. Initially we undertake the local analysis of the systems, deriving conditions on the parameters that guarantee a stable limit cycle in the reaction kinetics, and construct arbitrary large invariant regions in the equal diusion coecien t case. We then provide an a priori estimate that leads to the global well-posedness of the classical (nonnegative) solutions, given any nonnegative L 1 - initial data. In order to verify the biological wave phenomena of solutions and the theoretical results, numerical experiments are undertaken in two space dimensions using a Galerkin nite element method with piecewise linear continuous basis functions.
Optimizing the new formulation of the United Nations' human development index: An empirical view from data envelopment analysis.

In this paper, we propose a new way to simulate an optimal Human Development Index [HDI]. Indeed, the formulation of the original HDI established by the United Nations Development Programme [UNDP] relies on a major methodological shortcoming, namely the contestable assumption that all component indices have the same weights. So, we implement a new approach to determine the optimal weights of each sub-indicator in the light of Data Envelopment Analysis [DEA]. Accordingly, we follow the multiplicative optimization approach introduced by Zhou et al. (2010), to assess robustly the relative performance of a set of 169 economies around the world in terms of human development. Finally, the new world ranking is close to and highly correlated with the standard HDI one, giving then some support to the equal weighting method adopted by the UNDP.
Impaired Economy of Gait and Decreased Six-Minute Walk Distance in Parkinson's Disease

Changes in the biomechanics of gait may alter the energy requirements of walking in Parkinson's Disease (PD). This study investigated economy of gait during submaximal treadmill walking in 79 subjects with mild to moderate PD and the relationship between gait economy and 6-minute walk distance (6 MW). Oxygen consumption (VO2) at the self-selected treadmill walking speed averaged 64% of peak oxygen consumption (VO2 peak). Submaximal VO2 levels exceeded 70% of VO2 peak in 30% of the subjects. Overall the mean submaximal VO2 was 51% higher than VO2 levels expected for the speed and grade consistent with severe impairment in economy of gait. There was an inverse relationship between economy of gait and 6MW (r = −0.31, P < 0.01) and with the self-selected walking speed (r = −0.35, P < 0.01). Thus, the impairment in economy of gait and decreased physiologic reserve result in routine walking being performed at a high percentage of VO2 peak.
Global Priority Table for Last-Level Caches

Last-level caches (LLC) grow large with significant power consumption. As LLC's capacity increases, it becomes quite inefficient. As recent studies show, a large percent of cache blocks are dead during the cache time. There is a growing need for LLC management to reduce the number of dead block in the LLC. However, there is a significant power requirement for the dead block's in-placement and replacement operations. In this paper, we introduce a global priority table predictor, a technique which is used for determining a cache block's priority when it attempts to insert into the LLC. It is similar to previous predictors, such as reuse distance and dead block predictor. The global priority table is indexed by the hash value of the block address and stores the priority value of the associate cache block. The priority value can be used to drive a dead block replacement and bypass optimization. Through the priority table, a large number of dead blocks could be bypassed. It achieves an average reduction of 13.2% in the number of LLC miss for twenty single-thread workloads from the SPEC2006 suite and 29.9% for ten multi-programmed workloads. It also yields a geometric mean speedup of 8.6% for single-thread workloads and a geometric mean normalized weighted speedup of 39.1% for multi-programmed workloads.