Miracle-dz/UniFAR-FTUs huggingface dataset:
Real-world route planning

Computing driving directions in road networks is a fundamental problem. Although it can be solved in essentially linear time by Dijkstra's algorithm [6], this is not fast enough to enable interactive queries on large-scale inputs. Instead, modern algorithms typically work in two stages: first an offline preprocessing routine computes some auxiliary data, which is then used to answer exact queries in real time. The past decade has seen a surprisingly diverse set of techniques that follow this approach [1, 2, 7, 8, 9], mostly relying on the fact that road networks tend to have a strong hierarchy. These methods work very well when minimizing driving times, but are much less efficient with other cost functions. I will present a practical algorithm that has no such draw-backs, and can compute shortest paths on continental road networks with arbitrary metrics (cost functions). Our customizable route planning approach [3] uses very little space per metric, supports real-time queries, and can incorporate a new metric in a few seconds, thus enabling real-time traffic updates and personalized cost functions. Instead of relying on a strong hierarchy (which is metric-dependent), we use the fact that road networks can be efficiently partitioned into loosely connected regions. To find such partitions, we use a recent algorithm [4] based on the notion of natural cuts, which are sparse regions separating much denser areas. Our routing algorithm can be naturally extended to handle more elaborate queries, such as building distance tables, finding nearby points of interest, or suggesting alternative paths. This makes it ideal to implement a flexible, general-purpose journey planner, especially when combined with algorithms for public transportation networks [5]. In fact, our system is currently in use by Bing Maps. This is joint work with Daniel Delling, Andrew Goldberg, Thomas Pajor, and Ilya Razenshteyn.
The psychological contract and the transition from full to part‐time police work

The cognitive-perceptual conceptualisation of the psychological contract has dominated research in this field. In this paper, it is argued that locating the psychological contract at the level of the individual-organisational relationship can offer rich insights into psychological contract dynamics. Using qualitative interview data from a research study exploring how managers and part-timers deal with the transition from full to part-time police work in the UK, it is argued that a multi-perspective conceptualisation of the sources of the psychological contract is critical for understanding processes that lead to non-mutuality of understandings. Specifically, it is argued that the institutional and organisational context, embedded in the actions of third parties and in management practices, can undermine the extent to which the manager and the employee can reach agreement about mutual obligations. The theoretical and policy implications of this position are developed. Copyright © 2006 John Wiley & Sons, Ltd.
Diversification in Adelomyia hummingbirds follows Andean uplift

The Andes are known to have influenced speciation patterns in many taxa, yet whether species diversification occurred simultaneously with their uplift or only after uplift was complete remains unknown. We examined both the phylogenetic pattern and dates of branching in Adelomyia hummingbirds in relation to Andean uplift to determine whether diversification coincides with the chronological phases of the uplift or with recent climatic fluctuations after Andean formation. Results suggest that the genus Adelomyia originated in the central Andes in the Miocene and was found to be comprised of six deeply divergent phylogroups dating between 3.5 and 6 Ma. The most basal splits in the tree, corresponding to the most southerly distributed of the six phylogroups, diverged in the late Miocene, whereas the northern phylogroups originated during the early‐to‐mid‐Pliocene, when the northern Andes reached heights sufficient to support Adelomyia populations. Although we provide evidence for a southern origin for the group, the subsequent diversification of the northern phylogroups did not strictly follow the hypothesized south‐to‐north orogeny of the Andes. Further genetic structure within phylogroups may have resulted from Pleistocene climate fluctuations after the onset of the six lineages during the Mio‐Pliocene. We explore the processes that promoted diversification in the Andes and suggest that in at least some groups, divergence was coupled to Andean orogeny.
Applying Feature Selection to Gene Expression Data : Cell-type Classification & Gene Signature Identification

DNA microarrays allow biologists to capture the expression of tens of thousands of genes in a single tissue sample. In this paper, we explore the possibility of using this gene expression data to identify gene signatures that allow for accurate classification of cells. We describe our work on two datasets, one derived from cancerous and normal breast tissue, and one derived from blood cells. For the first dataset, we attempted to use feature selection to find the genes that indicate cancerous breast tissue. This problem turned out to be easy in the sense that many sets of genes result in high classifier performance, so we concluded that we needed a more difficult classification problem in order to find a gene signature of biological significance. In the second dataset, cells were labeled by flow cytometry according to their stage in hematopoietic differentiation. For this multiclass classification problem, we identified gene signatures that give reasonably good classification results. We also report our classifier’s results when run on test datasets with early progenitors and AML (Acute Myeloid Leukemia) cells, where the classification of cancerous cells is of particular interest because accurate classification would allow us to determine which types of normal cells cancerous cells developed from.
Insecure attachment and personality disorder: a twin study of adults

This study used 239 twin pairs from a volunteer community sample to investigate how anxious and avoidant attachment are related to personality disorder (PD). Factor analysis showed that self‐reported anxious attachment and 11 PD scales from the Dimensional Assessment of Personality Problems loaded onto one factor (emotional dysregulation), and avoidant attachment and four PD scales loaded onto a second factor (inhibitedness). Biometric models indicated that 40% of the variance in anxious attachment was heritable, and 63% of its association with corresponding PD dimensions was attributable to common genetic effects. Avoidant attachment was influenced by the shared environment instead of genes. Correlations between avoidance and corresponding PD dimensions were attributable to experiences in the nonshared environment that influenced both variables. Copyright © 2006 John Wiley & Sons, Ltd.
An Efficient Multiversion Access STructure

An efficient multiversion access structure for a transaction-time database is presented. Our method requires optimal storage and query times for several important queries and logarithmic update times. Three version operations-inserts, updates, and deletes-are allowed on the current database, while queries are allowed on any version, present or past. The following query operations are performed in optimal query time: key range search, key history search, and time range view. The key-range query retrieves all records having keys in a specified key range at a specified time; the key history query retrieves all records with a given key in a specified time range; and the time range view query retrieves all records that were current during a specified time interval. Special cases of these queries include the key search query, which retrieves a particular version of a record, and the snapshot query which reconstructs the database at some past time. To the best of our knowledge no previous multiversion access structure simultaneously supports all these query and version operations within these time and space bounds. The bounds on query operations are worst case per operation, while those for storage space and version operations are (worst-case) amortized over a sequence of version operations. Simulation results show that good storage utilization and query performance is obtained.
LMgr: A low-M emory global router with dynamic topology update and bending-aware optimum path search

Global routing remains a fundamental physical design problem. We observe that large circuits cause high memory cost1, and modern routers could not optimize the routing path of each two-pin subnet. In this paper, (1) we develop a dynamic topology update technique to improve routing quality (2) we improve the memory efficiency with negligible performance overhead (3) we prove the non-optimality of traditional maze routing algorithm (4) we develop a novel routing algorithm and prove that it is optimum (5) we design a new global router, LMgr, which integrates all the above techniques. The experimental results on the ISPD 2008 benchmark suite show that LMgr could outperform NTHU2.0, NTUgr, FastRoute3.0 and FGR1.1 on solution quality in 13 out of 16 benchmarks and peak memory cost in 15 out of 16 benchmarks, the average memory reduction over all the benchmarks is up to 77%.
The State of Population Theory: Forward from Malthus

Most of these papers were presented at the FORWARD FROM MALTHUS: THE STATE OF POPULATION THEORY IN 1984 conference held by the British Society for Population Studies at Gonville and Caius College Cambridge on 17-19 September 1984. The topics include the current state of population theory discussions of Malthuss writings and views and discussions on demographic regimes hunter-gatherer populations family roles Sub-Saharan reproduction systems fertility determinants shifts reproduction in contemporary Europe and mortality since Malthus.
Does Home- and Community-Based Care Affect Nursing Home Use?

A study was conducted to assess change in numbers, expenditures, and case mix of nursing home residents as Medicaid investment in home- and community-based services (HCBS) 1915(c) waivers increased in seven states. The seven states provided Medicaid expenditure and utilization data from 2001 to 2005, including waiver and state plan utilization. The Minimum Data Set was used for nursing home residents. For three states, community assessment data were also used. In six states, the number of nursing home clients decreased as the numbers of HCBS clients grew. However, in most states, the number of additional waiver clients often greatly exceeded reductions in nursing home residents. Nursing home payments decreased moderately, but this decrease was offset by increases in HCBS waiver and state plan expenditures, leading to a net increase in long-term support services (LTSS) expenditures from 2001 to 2005. Increases in waiver expenditures outpaced increases in waiver clients, indicating expansion of services on top of expansion in clients. States that showed substantial increases in HCBS showed only modest increases in nursing home case mix. The case mix for nursing home residents was more acute than that for HCBS users. The expectation that greater HCBS use would siphon off less severe LTSS users and hence lead to a higher case mix in nursing homes was partially met. The more acute case mix in nursing homes suggests that HCBS serves some individuals who were previously cared for in nursing homes but many who were not. Efforts to promote substitution of HCBS for institutional care will require more proactive strategies such as diversion.
Implementation of March Algorithm Based MBIST Architecture for SRAM

– This paper presents the implementation of March Algorithm based Memory Built-In Self Test (MBIST) architecture for Static Random Access Memory (SRAM). A Finite State Machine (FSM) is designed to implement March – based Test algorithm. Also SRAM block and the interfacing modules are presented. There is a standard March Test Algorithm with 22N where N is the number of memory words, read/write operations is discussed. The proposed March test algorithm with 13N can achieve full diagnosis for SRAM. This digital system is described in Verilog HDL and is simulated and synthesized using Xilinx Spartan 3 FPGA. The proposed scheme greatly simplifies the testing process. Besides, the proposed scheme is more efficient in terms of circuit size and test data to be applied, and it requires less time to test SRAM chip. Power consumption of a digital system is nearly fifteen times more in test mode when compared with normal mode. Power consumption is greatly reduced in this proposed architecture by reducing number of read/write operations. Experimental results show that the proposed method achieves a good flexibility with smaller circuit size.
Hardness of the Pricing Problem for Chains in Barter Exchanges

Kidney exchange is a barter market where patients trade willing but medically incompatible donors. These trades occur via cycles, where each patient-donor pair both gives and receives a kidney, and via chains, which begin with an altruistic donor who does not require a kidney in return. For logistical reasons, the maximum length of a cycle is typically limited to a small constant, while chains can be much longer. Given a compatibility graph of patient-donor pairs, altruists, and feasible potential transplants between them, finding even a maximum-cardinality set of vertex-disjoint cycles and chains is NP-hard. There has been much work on developing provably optimal solvers that are efficient in practice. One of the leading techniques has been branch and price, where column generation is used to incrementally bring cycles and chains into the optimization model on an as-needed basis. In particular, only positive-price columns need to be brought into the model. We prove that finding a positive-price chain is NP-complete. This shows incorrectness of two leading branch-and-price solvers that suggested polynomial-time chain pricing algorithms.
Throughput analysis of multiple access system with hybrid ARQ in wireless networks

Channel throughput of multiple access system with RAKE receiver and hybrid ARQ in wireless networks with imperfect channel estimation is considered. In this paper, general multi-path intensity Nakagami fading and multiple-access near/far interference channel are assumed. A dedicated pilot channel for coherent demodulation is used for the purpose of channel estimation in wireless fading channel. Pilot channel estimation error, due to multiple-access interference and multi-path fading is studied. The analysis for system performance shows that the error of channel estimation significantly degrades throughput performance and can be effectively suppressed by Rake receiver and hybrid ARQ scheme. Also, an attempt for comparing the system throughput on different performance improvement schemes and parameters has been made. In particular, the channel throughput of multiple access BCH coded system is compared with uncoded system. From the results, we can say that the proposed multiple access system with hybrid ARQ gives good performance and can be used very efficiently for packet transmission in wireless networks.
On Throughput Limit of Multi-Rate IEEE 802.11 WLANs: Basic Access vs. RTS/CTS Access

Today's IEEE 802.11 Wireless LANs (WLANs) usually support multiple transmission rates, where mobile stations adapt their data rates based on their link adaptation strategies. In this paper we analyze the throughput performance of multi-rate WLANs with link adaptation. Specifically, an analytical model is developed to derive the system throughput of both the basic access and RTS/CTS mechanisms. The proposed model is applicable to general multi-rate WLANs and independent of specific link adaptation strategies adopted. The accuracy of the model is validated by simulations in various network settings. Using the proposed model, we further derive the theoretical throughput limit of common multi-rate IEEE 802.11 WLANs. Interestingly, it is observed that for typical WLAN configurations, standard RTS/CTS mechanism performs closely to the throughput limit. Therefore, in multi-rate WLANs simply using standard RTS/CTS mechanism is preferred for its low complexity and close-to-optimal performance.
Experimental investigation on a vertical sectorization system with active antenna

Cell splitting is an effective way of implementing network densification in order to boost the capacity of a mobile system. Traditionally, the cell splitting procedure has been carried out in the azimuth dimension. However, another approach known as vertical sectorization has been gaining momentum recently, where the sectors of a conventional cellular system are split vertically instead, creating inner and outer cells by using AAS technology. Then vertical sectorization can use the same communication resources in both inner and outer parts of the cells. Performance of vertical sectorization has been extensively studied in the literature using advanced system simulations. However, field measurements to characterize the actual performance of vertical sectorization with AAS have been scarce so far. In this article, we first identify key issues that may hinder the smooth implementation of commercial cellular systems using vertical sectorization. Then we present the results of a measurement campaign that was carried out to study these limitations and to identify the actual vertical radiation patterns when AAS technology is used. Finally, we reflect on some problems that remain open to make future cellular systems using vertical sectorization with AAS commercially viable.
Improving accuracy in estimation of artery-wall displacement by referring to center frequency of RF echo

Noninvasive measurement of mechanical properties, such as elasticity, of the arterial wall, is useful for diagnosis of atherosclerosis. The elasticity of the arterial wall can be estimated by combining measurement of displacement of the arterial wall with that of blood pressure. In general, the displacement of the arterial wall is estimated from the phase shift of radio frequency (RF) echoes between two consecutive frames using a correlation estimator with quadrature demodulated complex signals. Recently, digitized data of broadband RF echoes are available in modern diagnostic equipment. The Fourier transform can be used to estimate the phase of the RF echo at each frequency within the RF frequency bandwidth. Therefore, the phase shifts between RF echoes of two consecutive frames can be estimated at multiple frequencies. In this estimation, due to object displacement, the RF echo is time shifted in comparison with that of the previous frame. However, the position of the time window for the Fourier transform is not changed between two consecutive frames. This change in relative position between the RF echo and the time window has a strong influence on the estimation of the artery-wall displacement, resulting in error. To suppress this error, the phase shift should be estimated at the actual RF center frequency. In this paper, this error suppression was investigated through simulation experiments and in vivo experiments on the human carotid artery.
Methods and Concepts in Classroom Research

It is-beyond the scope of this chapter to provide a detailed review of all empirical studies of classroom interaction. Excellent recent reviews have been provided by Kliebard (1966), Medley and Mitzel (1963), Weick (in press), and Withall (1960). Two additional reviews have also been prepared by the author and others (Biddle and Adams, in press b; Biddle, Fraser, and Jellison, 1965). Instead, this chapter deals with five specific problems of classroom research as they are handled in recent programs of investigation: coverage, methods of data collection, unit of analysis, conceptual posture, and concepts used. The reader is cautioned that this brief treatment must of necessity do some violence to the studies cited; for instance, no summary of findings is attempted.
A novel role for the Pol I transcription factor UBTF in maintaining genome stability through the regulation of highly transcribed Pol II genes

Mechanisms to coordinate programs of highly transcribed genes required for cellular homeostasis and growth are unclear. Upstream binding transcription factor (UBTF, also called UBF) is thought to function exclusively in RNA polymerase I (Pol I)-specific transcription of the ribosomal genes. Here, we report that the two isoforms of UBTF (UBTF1/2) are also enriched at highly expressed Pol II-transcribed genes throughout the mouse genome. Further analysis of UBTF1/2 DNA binding in immortalized human epithelial cells and their isogenically matched transformed counterparts reveals an additional repertoire of UBTF1/2-bound genes involved in the regulation of cell cycle checkpoints and DNA damage response. As proof of a functional role for UBTF1/2 in regulating Pol II transcription, we demonstrate that UBTF1/2 is required for recruiting Pol II to the highly transcribed histone gene clusters and for their optimal expression. Intriguingly, lack of UBTF1/2 does not affect chromatin marks or nucleosome density at histone genes. Instead, it results in increased accessibility of the histone promoters and transcribed regions to micrococcal nuclease, implicating UBTF1/2 in mediating DNA accessibility. Unexpectedly, UBTF2, which does not function in Pol I transcription, is sufficient to regulate histone gene expression in the absence of UBTF1. Moreover, depletion of UBTF1/2 and subsequent reduction in histone gene expression is associated with DNA damage and genomic instability independent of Pol I transcription. Thus, we have uncovered a novel role for UBTF1 and UBTF2 in maintaining genome stability through coordinating the expression of highly transcribed Pol I (UBTF1 activity) and Pol II genes (UBTF2 activity).
Robust Adaptive Fusion Tracking Based on Complex Cells and Keypoints

Although many successful algorithms have been proposed for visual tracking, it is still a challenging task due to occlusion, scale variation, fast motion, and deformation. To handle these challenges, we propose a collaborative model and focus on three key factors: 1) an effective representation to consider appearance variations; 2) an effective application of the keypoints; and 3) an incorporation of contextual information. In this paper, we propose a novel algorithm that takes into account the three key factors based on complex cells and keypoints. The complex cells can effectively explore the contextual information at multiple scales. Meanwhile, a keypoint is an ideal local representation. Keypoints-based tracking method is used to make coarse tracking. A precise tracking-by-detection whose samples come from keypoints-based tracking is followed by considering the scale information. In addition, measurement of appearance variation is measured by matching the current inner cell with template’s individualistically. In the basis of the measurement, an adaptive learning rate parameter is estimated for updating the object appearance model to avoid noises. Experimental results demonstrate that our tracker is able to handle appearance variations and recover from drifts. In conjunction with tracking acceleration modules, the proposed method performs in real time and outperforms favorably many state-of-the-art algorithms for object tracking.