Miracle-dz/UniFAR-FTUs huggingface dataset:
Parallel SFSD MIMO detection with SOFT-HARD combination enumeration

A novel soft-extension of fixed-complexity sphere decoding (FSD) algorithm is proposed, taking Soft FSD (SFSD)1 algorithm as a starting point, which suffers from the multiple-tree-search problem, and the so called iteration problem, that is, its performance degrades as the number of the receiver iteration increases. The proposed parallel SFSD (PSFSD) performs a single tree search by taking partial best nodes to generate counter-hypotheses. To make use of priori information in tree search to overcome the iteration problem, soft-hard combination (SHC) enumeration method is presented as a low complexity algorithm to find the best child with prior term added. The proposed scheme is suitable for hardware implementations and can be easily extended to other tree search schemes.
Eat. Lift. Thrive

Eat healthy. Exercise. Be happy. It sounds easy enough, so why is it so difficult? Because, as millions of women know, it's not easy. There are challenges and obstacles, and health programs are not one size fits all. Sohee Lee understands, because she's faced the challenges and overcome them. As a trainer, presenter, and author, she's shared her experiences and helped others establish healthy relationships with food and exercise for long-term results. In the book Eat. Lift. Thrive. she empowers you with tools and strategies to make your own change. You will learn how to identify issues that are holding you back and what you can do to get back on track. You'll find motivation, exercise, and advice. And you'll learn how to • incorporate Lee's Living Lean Guidelines to make your diet work around your life, rather than the other way around; • perform her Primary Strength Movements and integrate them into an effective workout program; and • adjust your routine to maintain the results you've achieved. Eat. Lift. Thrive. also provides you with a structured, easy-to-follow 12-week training program. The program can be scaled according to your training experience, time commitment, and goals; it's completely customizable to ensure that your changes are lasting. This book is designed to be different. By the time you're finished, you'll be an expert at moderation and will say goodbye to extremes in dieting. You can have your cake and eat it too'and enjoy it!
Mobility and handoff management in vehicular networks: a survey

Mobility management is one of the most challenging research issues for vehicular networks to support a variety of intelligent transportation system (ITS) applications. The traditional mobility management schemes for Internet and mobile ad hoc network (MANET) cannot meet the requirements of vehicular networks, and the performance degrades severely due to the unique characteristics of vehicular networks (e.g., high mobility). Therefore, mobility management solutions developed specifically for vehicular networks would be required. This paper presents a comprehensive survey on mobility management for vehicular networks. First, the requirements of mobility management for vehicular networks are identified. Then, classified based on two communication scenarios in vehicular networks, namely, vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications, the existing mobility management schemes are reviewed. The differences between host-based and network-based mobility management are discussed. To this end, several open research issues in mobility management for vehicular networks are outlined. Copyright © 2009 John Wiley & Sons, Ltd.
Computational geometry: a retrospective

BERNARD CHAZELLE Department of Computer Science Princeton University Princetoq NJ08544, USA Computational geometry is at a crossroads. New challenges and opportunities are likely to reshape the field rather drastically in the years ahead. I will survey some of its principal accomplishments, and in light of recent developments, I will discuss the profound transformations the field has begun to undergo. There are reasons to believe that computational geometry will emerge from this transition far richer and stronger but barely recognizable from what it was ten years ago. Over the last two decades the field has enjoyed tremendous successes. Some of them might be dismissed as the cheap payoffs to be expected from any field lacking maturity. But others are the products of indisputable creativity and should be held as genuirle scientific achievements. More important, the field is now able to claim a broad, solid foundation upon which its future can be securely built. To mature fully as an original subfield of computer science, however, computational geometry must broaden its connections to applied mathematics while at the same time pay more than lip service to the applications areas that it purports to serve. Happily, active efforts to meet these challenges are underway. Three recent developments are particular encouraging: one is the building of a theory of geometric sampiing and its revolutionary impact on the design of geometric algorithms. Another is the maturing of computational real-algebraic geometry and computational topology both subjects are being revitalized by the introduction of geometric (as opposed to purely algebraic) methods. On the practical end of the spectrum, the emergence of a sub-area concerned specifically with issues of This work was supported in part by NSF Grant CCR-9301254 and The Geometry Center, University of Minnesota, an STC funded by NSF, DOE, and Mimesota Technology, Inc. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Asmciation of Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. finite precision and degeneracy in geometric computing is a most welcome development.
Fatigue warning system for driver nodding off using depth image from Kinect

One of the major road traffic accidents is from an exhausted driver such as drowsiness and a lack of attention over driving. This paper presents a driver fatigue warning system using Kinect depth image, which monitors a driver attention and alerts driver while nodding off. Our algorithm transforms Kinect depth images into gradient images to detect driver face and applies Discriminative Random Regression Forests to get angles of head rotation. The sensitivity result is 93.75% by measuring with a dataset that consists of 160 images of four head positions of 40 people. The system can handle many situations both in daytime and night time. For testing one passenger in real situations, the sensitivity results are 94.28% with 2,676 frames at daytime and 95.13% with 2,036 frames at night time.
Separation of Powers, Ecient Political Competition and Provision of Public Goods

In this paper we provide a political game where agents decide whether to become legislators or politicians. Legislators determine the political institutions constraining politicians’ behavior and politicians compete for gaining the power to make decisions about the level of the public good. We derive a number of interesting results: i) Political competition is a necessary but not a sucient condition for the elimination of political rents ii) Agents utilize the separation of powers in order to endogenously select institutions which restrict the power of politicians iii) In conjunction with political competition, these institutions implement the set of the Lindahl allocations in the economy as sub-game perfect Nash equilibria of the political game. iv) As a consequence of the previous result, political rents are zero in equilibrium, in the sense that the politician in government does not extract part of the social surplus because of his power. To the best of our knowledge, this in the only citizen-candidate model with this equilibrium property.
A Prototype of Comparison Tool for Android Applications Based on Difference of API Calling Sequences

For both users and developers, it is important to select an appropriate application from similar ones. There are some ways to know the diﬀerences in terms of features in several similar applications, but it is not easy. In this paper, we present a prototype of a comparison tool which identiﬁes features corresponding to diﬀerences between API calling sequences extracted from two Android applications. We conducted a case study to evaluate the prototype tool. The result shows that the proposed tool achieves comparing applications.
A Disulfide Bond between Conserved Extracellular Cysteines in the Thyrotropin-releasing Hormone Receptor Is Critical for Binding (*)

The assumption that a disulfide bond is present between two highly conserved cysteines in the extracellular loops of G protein-coupled receptors and is critical for receptor function has been cast in doubt. We undertook to determine whether a disulfide bond important for binding or activation is present in the thyrotropin-releasing hormone (TRH) receptor (TRH-R). Studies were performed with cells expressing wild-type (WT) and mutant receptors in the absence or presence of the reducing agent dithiothreitol (DTT). The affinity of WT TRH-R was 16-22-fold lower in the presence of DTT than in the absence of DTT. Mutant receptors were constructed in which Ala was substituted for conserved Cys-98 and Cys-179 of extracellular loops 1 and 2, respectively, and for the nonconserved Cys-100. C98A and C179A TRH-Rs did not exhibit high affinity binding. These mutant receptors were capable of stimulating inositol phosphate second messenger formation to the same extent as WT TRH-Rs but with a markedly lower potency. The affinities of C98A and C179A TRH-Rs, estimated from their potencies, were 4400- and 640-fold lower, respectively, than WT TRH-R. The estimated affinities of neither C98A nor C179A TRH-R were decreased by DTT. In contrast, the estimated affinity of C100A TRH-R was not different from WT TRH-R and was DTT sensitive. Moreover, the effect of mutating both Cys-98 and Cys-179 was not additive with the effects of the individual mutations. These data provide strong evidence that Cys-98 and Cys-179 form a disulfide bond. This interaction is not involved in receptor activation but is critical for maintaining the high affinity conformation of TRH-R.
Prefix-like Complexities of Finite and Infinite Sequences on Generalized Turing Machines.

AbstractGeneralized Turing machines (GTMs) are a variant of non-halting Turing machines, bycomputational power similar to machines with the oracle for the halting problem. GTMs allowa deﬁnition of a kind of descriptive (Kolmogorov) complexity that is uniform for ﬁnite andinﬁnite sequences. There are several natural modiﬁcations of the deﬁnition (as there are sev-eral monotone complexities). This paper studies these deﬁnitions and compares complexitiesdeﬁned with the help of GTMs and complexities deﬁned with the help of oracle machines.Keywords: Kolmogorov complexity, generalized Turing machine, inﬁnite sequence, non-halting computation. 1 Introduction Recently, Schmidhuber [7, 6] introduced several modiﬁcations of Turing machines, in particular,generalized Turing machines (GTMs), and deﬁned appropriate complexities. GTMs are machinesthat never halt and are allowed to change their output with the only requirement being that eachbit eventually stabilizes. GTMs are a natural model for computability in the limit, and thus GTMsare closely related to Turing machines with the oracle for the halting problem. These two modelsare equivalent in the case of computing functions on naturals. However, the situation is diﬀerent inthe case of functions on binary sequences with additional requirements such as the self-delimitingproperty. Functions of this kind are used in algorithmic information theory for deﬁning preﬁx andmonotone complexity (see [2, 1], and for comprehensive presentation and more references [3]). Originally, Kolmogorov deﬁned the complexity of an object as the minimal size of its descriptionwith respect to some eﬀective specifying method (mode of description), i.e. mapping from the setof descriptions to the set of objects. For the specifying method, one can assume various computingdevices (as Turing machines, maybe, non-halting, supplied with an oracle, etc.), implementing thismethod. Every assumption leads to a variant of complexity. Restricting oneself to values deﬁnedup to a bounded additive term, one can speak about complexity with respect to a certain class ofmachines (containing a universal one). For a machine of a ﬁxed computational power, one can deal with the machine input and theinput size in various ways. To give an example, let us consider an abstract (Turing) machinethat has one (inﬁnite in one direction) input tape containing only zeros and ones, can read theinput tape bit by bit, and generates some object. There were studied at least three variants of‘description’ (actually, deﬁnitions of the machine input and its size) of a generated object withrespect to such a machine.
Maternal multiple micronutrient supplementation and pregnancy outcomes in developing countries: meta-analysis and meta-regression.

OBJECTIVE To systematically review randomized controlled trials comparing the effect of supplementation with multiple micronutrients versus iron and folic acid on pregnancy outcomes in developing countries. METHODS MEDLINE and EMBASE were searched. Outcomes of interest were birth weight, low birth weight, small size for gestational age, perinatal mortality and neonatal mortality. Pooled relative risks (RRs) were estimated by random effects models. Sources of heterogeneity were explored through subgroup meta-analyses and meta-regression. FINDINGS Multiple micronutrient supplementation was more effective than iron and folic acid supplementation at reducing the risk of low birth weight (RR: 0.86, 95% confidence interval, CI: 0.79-0.93) and of small size for gestational age (RR: 0.85; 95% CI: 0.78-0.93). Micronutrient supplementation had no overall effect on perinatal mortality (RR: 1.05; 95% CI: 0.90-1.22), although substantial heterogeneity was evident (I(2) = 58%; P for heterogeneity = 0.008). Subgroup and meta-regression analyses suggested that micronutrient supplementation was associated with a lower risk of perinatal mortality in trials in which > 50% of mothers had formal education (RR: 0.93; 95% CI: 0.82-1.06) or in which supplementation was initiated after a mean of 20 weeks of gestation (RR: 0.88; 95% CI: 0.80-0.97). CONCLUSION Maternal education or gestational age at initiation of supplementation may have contributed to the observed heterogeneous effects on perinatal mortality. The safety, efficacy and effective delivery of maternal micronutrient supplementation require further research.
Little Ben: The Ben Franklin Racing Team's entry in the 2007 DARPA Urban Challenge

This paper describes “Little Ben,” an autonomous ground vehicle constructed by the Ben Franklin Racing Team for the 2007 DARPA Urban Challenge in under a year and for less than $250,000. The sensing, planning, navigation, and actuation systems for Little Ben were carefully designed to meet the performance demands required of an autonomous vehicle traveling in an uncertain urban environment. We incorporated an array of a global positioning system (GPS)/inertial navigation system, LIDARs, and stereo cameras to provide timely information about the surrounding environment at the appropriate ranges. This sensor information was integrated into a dynamic map that could robustly handle GPS dropouts and errors. Our planning algorithms consisted of a high‐level mission planner that used information from the provided route network definition and mission data files to select routes, whereas the lower level planner used the latest dynamic map information to optimize a feasible trajectory to the next waypoint. The vehicle was actuated by a cost‐based controller that efficiently handled steering, throttle, and braking maneuvers in both forward and reverse directions. Our software modules were integrated within a hierarchical architecture that allowed rapid development and testing of the system performance. The resulting vehicle was one of six to successfully finish the Urban Challenge. © 2008 Wiley Periodicals, Inc.
Drobs: Taking the Drag out of drag n Drop Web Pages 2. Drobs

graphics user interfaces in hypertext systems has been understood prior to the existence of the World Wide Web [6]. The current trend towards 'drag and drop' on a web page reflects the need for a level of interaction expected in other user interfaces. 'Drag and drop' can be achieved on web pages with a number of technologies [1][2][3][5]. These use different mechanisms based on an underlying pattern; first an event is generated indicating that dragging has started, events are generated while dragging proceeds, finally an event is generated when dragging stops, at the drop. A transfer operation implemented by the 'drag and drop' usually happens at the drop. While dragging, position and layout adjustments can also be made to the interface. How and where the dragging happens depends on the technology. In [1], for example, drag and drop is implemented by deriving objects from at least three classes: DragGestureListener, DragSourceListener and DropTargetListener. In Drobs ('DRaggable' OBjectS), development of 'drag and drop' interaction is undertaken by providing the maximum 'degrees of movement' for a draggable object. The idea that an aspect of a user interface can be described in terms of degrees of movement of components or data is not necessarily a new idea [8]. ABSTRACT 'Drag and drop' interaction on web pages can be achieved using a number of technologies, for example: Flash or Java embedded on the web page, and DHTML. In Drobs ('DRaggable' OBjectS), development of 'drag and drop' interaction is undertaken by providing the maximum " degrees of movement " for a draggable object. Adding constraints on the 'degrees of movement' then refines interaction. This approach is described using the development of 'drag and drop' into a scrolling window on a web page as an example. A version of a Drobs object library in DHTML is presented.
RVMAB: Using the Relevance Vector Machine Model Combined with Average Blocks to Predict the Interactions of Proteins from Protein Sequences

Protein-Protein Interactions (PPIs) play essential roles in most cellular processes. Knowledge of PPIs is becoming increasingly more important, which has prompted the development of technologies that are capable of discovering large-scale PPIs. Although many high-throughput biological technologies have been proposed to detect PPIs, there are unavoidable shortcomings, including cost, time intensity, and inherently high false positive and false negative rates. For the sake of these reasons, in silico methods are attracting much attention due to their good performances in predicting PPIs. In this paper, we propose a novel computational method known as RVM-AB that combines the Relevance Vector Machine (RVM) model and Average Blocks (AB) to predict PPIs from protein sequences. The main improvements are the results of representing protein sequences using the AB feature representation on a Position Specific Scoring Matrix (PSSM), reducing the influence of noise using a Principal Component Analysis (PCA), and using a Relevance Vector Machine (RVM) based classifier. We performed five-fold cross-validation experiments on yeast and Helicobacter pylori datasets, and achieved very high accuracies of 92.98% and 95.58% respectively, which is significantly better than previous works. In addition, we also obtained good prediction accuracies of 88.31%, 89.46%, 91.08%, 91.55%, and 94.81% on other five independent datasets C. elegans, M. musculus, H. sapiens, H. pylori, and E. coli for cross-species prediction. To further evaluate the proposed method, we compare it with the state-of-the-art support vector machine (SVM) classifier on the yeast dataset. The experimental results demonstrate that our RVM-AB method is obviously better than the SVM-based method. The promising experimental results show the efficiency and simplicity of the proposed method, which can be an automatic decision support tool. To facilitate extensive studies for future proteomics research, we developed a freely available web server called RVMAB-PPI in Hypertext Preprocessor (PHP) for predicting PPIs. The web server including source code and the datasets are available at http://219.219. 62.123:8888/ppi_ab/.
RegnANN : network inference using Artificial Neural Networks

Reconstructing the topology of a gene regulatory network is one of the key tasks in systems biology. Here we present a methodical comparison of the performance of a novel method (RegnANN) for gene network inference based on multilayer perceptrons with other three reference algorithms (ARACNE, CLR, KELLER). In order to account for the variability induced by both the network intrinsic structure (e.g.: its topology) and the available data, our analysis considers Barabasi and Erdös-Rényi synthetic networks together with two different methods for data generation. The extensive evaluation on both synthetic data and a selection of gene modules of Escherichia coli indicates that RegnANN shows MCC scores that compare very favorably with all the other inference methods tested. On the synthetic test-bed, RegnANN outperforms all the other methods in a number of setups. On the other hand, results on biological data are less consistent, indicating that other factors may influence the accuracy scores of the network reconstruction task.
Tax Capitalization in Stock Prices: Theory and Evidence on the Interaction between Distribution Policy and Tax Rates

This study develops and tests a model of tax capitalization in stock prices. The key innovation of the model is consideration of how distribution policy affects the extent to which dividend and capital gains taxes are impounded into stock prices. The key innovation of the empirical analysis is the use of data aggregated to the national level to reduce measurement error and to encompass a long time series (49 years) with a wide range of tax regimes. This study finds supporting evidence for the hypotheses that both dividend and capital gains taxes reduce stock prices, as well as the hypothesis that stock repurchase intensity shifts the capitalization effect from dividend taxes to capital gains taxes.
The Population Decline of Gyps Vultures in India and Nepal Has Slowed since Veterinary Use of Diclofenac was Banned

Populations of oriental white-backed vulture (Gyps bengalensis), long-billed vulture (Gyps indicus) and slender-billed vulture (Gyps tenuirostris) crashed during the mid-1990s throughout the Indian subcontinent. Surveys in India, initially conducted in 1991–1993 and repeated in 2000, 2002, 2003 and 2007, revealed that the population of Gyps bengalensis had fallen by 2007 to 0.1% of its numbers in the early 1990s, with the population of Gyps indicus and G. tenuirostris combined having fallen to 3.2% of its earlier level. A survey of G. bengalensis in western Nepal indicated that the size of the population in 2009 was 25% of that in 2002. In this paper, repeat surveys conducted in 2011 were analysed to estimate recent population trends. Populations of all three species of vulture remained at a low level, but the decline had slowed and may even have reversed for G. bengalensis, both in India and Nepal. However, estimates of the most recent population trends are imprecise, so it is possible that declines may be continuing, though at a significantly slower rate. The degree to which the decline of G. bengalensis in India has slowed is consistent with the expected effects on population trend of a measured change in the level of contamination of ungulate carcasses with the drug diclofenac, which is toxic to vultures, following a ban on its veterinary use in 2006. The most recent available information indicates that the elimination of diclofenac from the vultures’ food supply is incomplete, so further efforts are required to fully implement the ban.