Miracle-dz/UniFAR-FTUs huggingface dataset:
Fractures After Stroke: Frequency, Types, and Associations

Background and Purpose— Stroke patients may have an increased risk of fractures because of weak bones or an increased risk of falling. Our goal was to estimate the frequency of fracture after stroke and to identify those at greatest risk. Methods— This study incorporated 2 complementary strategies: a prospective, single-center, cohort study and an analysis of Scottish routine hospital discharge data. Results— Eighty-eight fractures (30% hip) occurred in 2696 hospital-referred stroke patients. The proportions sustaining any fracture or hip fracture within 2 years were 4% and 1.1%, respectively, 1.4 (95% CI, 0.92 to 2.07) times the rate of hip fracture in the general population (ie, observed number divided by expected number or standardized morbidity ratio). Female sex, older age, low abbreviated mental test score, and prestroke dependence were associated with an increased hip fracture rate. Routine data identified 129 935 acute stroke patients admitted to Scottish hospitals. During 363 447 patient-years, 4528 patients had hip fractures, 2.0% had fractures by 1 year, and 10.6% had fractures by 10 years. This is 1.7 times the rate of hip fracture in the general population and 2.3 times that in patients with myocardial infarction. Older patients predictably had the highest rate of poststroke hip fractures but a lower standardized morbidity ratio than younger patients. Conclusions— Fractures after stroke are probably frequent and serious enough to justify the development of preventive strategies, but the modest event rate would mean that randomized, controlled trials to test these strategies specifically in stroke patients would need to enroll thousands of patients.
Comparative Effects of Nitrogen Fertigation and Granular Fertilizer Application on Growth and Availability of Soil Nitrogen during Establishment of Highbush Blueberry

A 2-year study was done to compare the effects of nitrogen (N) fertigation and granular fertilizer application on growth and availability of soil N during establishment of highbush blueberry (Vaccinium corymbosum L. “Bluecrop”). Treatments included four methods of N application (weekly fertigation, split fertigation, and two non-fertigated controls) and four levels of N fertilizer (0, 50, 100, and 150 kg·ha−1 N). Fertigation treatments were irrigated by drip and injected with a liquid urea solution; weekly fertigation was applied once a week from leaf emergence to 60 d prior to the end of the season while split fertigation was applied as a triple-split from April to June. Non-fertigated controls were fertilized with granular ammonium sulfate, also applied as a triple-split, and irrigated by drip or microsprinklers. Weekly fertigation produced the smallest plants among the four fertilizer application methods at 50 kg·ha−1 N during the first year after planting but the largest plants at 150 kg·ha−1 N in both the first and second year. The other application methods required less N to maximize growth but were less responsive than weekly fertigation to additional N fertilizer applications. In fact, 44–50% of the plants died when granular fertilizer was applied at 150 kg·ha−1 N. By comparison, none of the plants died with weekly fertigation. Plant death with granular fertilizer was associated with high ammonium ion concentrations (up to 650 mg·L−1) and electrical conductivity (>3 dS·m−1) in the soil solution. Early results indicate that fertigation may be less efficient (i.e., less plant growth per unit of N applied) at lower N rates than granular fertilizer application but is also safer (i.e., less plant death) and promotes more growth when high amounts of N fertilizer is applied.
Can GPGPU Programming Be Liberated from the Data-Parallel Bottleneck?

With the growth in transistor counts in modern hardware, heterogeneous systems are becoming commonplace. Core counts are increasing such that GPU and CPU designs are reaching deep into the tens of cores. For performance reasons, different cores in a heterogeneous platform follow different design choices. Based on throughput computing goals, GPU cores tend to support wide vectors and substantial register files. Current designs optimize CPU cores for latency, dedicating logic to caches and out-of-order dependence control. Heterogeneous parallel primitives (HPP) addresses two major shortcomings in current GPGPU programming models: it supports full composability by defining abstractions and increases flexibility in execution by introducing braided parallelism. Heterogeneous parallel primitives is an object-oriented, C++11-based programming model that addresses these shortcomings on both CPUs and massively multithreaded GPUs: it supports full composability by defining abstractions using distributed arrays and barrier objects, and it increases flexibility in execution by introducing braided parallelism. This paper implemented a feature-complete version of HPP, including all syntactic constructs, that runs on top of a task-parallel runtime executing on the CPU. They continue to develop and improve the model, including reducing overhead due to channel management, and plan to make a public version available sometime in the future.
Current-tunable current-mode universal filter using minimum elements

In this paper, a new electronically tunable current-mode universal filter with three inputs and single output employing only two translinear current conveyors and two grounded capacitors is presented. The proposed configuration provides lowpass, bandpass, highpass, bandstop and allpass current responses by choosing appropriate input signals without any component matching conditions, all at a high impedance output which enables easy cascading in the current-mode operation. The filter also offers independent electronic control of the natural frequency (ωo) and the quality factor (Q) through adjusting of the bias current and the current gain of the CCCII. The parameter sensitivities are all very low and the structure is very suitable for IC implementation. The characteristics of the proposed circuit are simulated using PSPICE to confirm the theory.
Inferring and Negotiating User Goals: Adaptive Dialogue Planning Using Abduction

An electrical connector which is capable of being used to interconnect insulated conductors (21-21) the field or in a factory during in-line processing includes a base (22) and contact element (24). The contact element which is used to establish an electrical connection between the conductors includes a center (24) portion and two opposed bifurcated beams. A portion of each beam is upstanding from the plane of the contact element. Furcations of each beam define a slot (47) for receiving one of the conductors to be interconnected. The contact element is attached to the base which includes at least one deformable tang (31) at each end. End portions of conductors to be connected are each positioned across an end of the base. The tangs are wrapped about the conductors, the conductors are moved into the slots of the beams, and excess portions of the lengths severed. The tang at each end cooperates with an offset portion (33) of the base which is interposed between the tang and the upstanding portion of the adjacent bifurcated beam to mechanically secure the conductor at that end and provide strain therefor.
Feedforward SDL Constructions of Output-Buffered Multiplexers and Switches with Variable Length Bursts

In this paper, we study the problem of exact emulation of two types of optical queues: (i) N-to-1 output-buffered multiplexers with variable length bursts, and (ii) N times N output-buffered switches with variable length bursts. For both queues, the delay of a packet (in a burst) is known upon its arrival. As such, one can emulate such queues by finding a delay path that yields the exact delay for each packet. For emulating the delay of a packet in such queues, in this paper we consider a multistage feedforward network with optical crossbar switches and fiber delay lines (SDL). For any fixed delay d, there exist multiple delay paths in such a network. A delay path is feasible if it satisfies the following three constraints: (i) conflict constraint: no more than one packet can be scheduled at the same input/output ports of each crossbar switch at the same time, (ii) causality constraint: no packet can be scheduled before its arrival, and (iii) strong contiguity constraint: packets in the same burst should be routed through any fiber delay lines contiguously. By the worst case analysis, we find sufficient conditions for the numbers of delay lines needed in each stage of such a feedforward network to achieve exact emulation of both queues. For N-to-1 output-buffered multiplexers, our sufficient conditions are also necessary when each burst contains exactly one packet. By computer simulation, we also show that the number of delay lines in each stage can be greatly reduced due to statistical multiplexing gain.
C Server Pages: An Architecture for Dynamic Web Content Generation

This paper introduces C Server Pages (CSP), a highly efficient architecture for the creation and implementation of dynamic web pages. The CSP scripting language allows dynamic web contents to be expressed using a combination of C code and HTML. A novel feature of CSP is that the C portions of the CSP source file are compiled into dynamic load libraries that become part of the running web server, thus avoiding both the overhead of interpreted languages such as Perl, Java and PHP, as well as the need to create a separate process. We present an overview of the architecture and implementation, and provide results of performance benchmarks showing that CSP outperforms similar mainstream technologies, including PHP, mod perl, and FastCGI.
Crowd Simulation : Implementation on Geometry , Animation and Behavior

Crowd simulations are becoming more popular in entertainment industry and interactive applications. However, the task of rendering and animating crowds of virtual humans in real-time is challenging. In this paper, we describe recent progress on crowd simulation research on three different levels, namely, geometry, animation and behavior. These three levels deal with implementation issues from low level to high level, equivalently, from rendering to controlling of the avatars. At the geometric rendering level, three acceleration techniques are introduced: culling, geometric level of detail and image-based impostor. Culling algorithm basically discards invisible parts of objects in the screen. But it is not sufficient since one of its limitations to displaying numerous virtual humans lies in the number of polygons that can be processed by the rendering pipeline. Thus, geometric level of detail (LOD) seems to be the most common answer to this problem. Each simulated human has multiple different resolutions ranging from million polygons down to only dozen polygons in the application. Another solution relying on the intrinsic temporal coherence of the animation, termed image-based impostors, can visualize thousands of virtual avatars within the view of the observer. At the animation level, animation LOD and fast collision detection techniques, required to deal with crowds of virtual humans, are presented. Animation LOD can be employed to reduce the computational cost of updating the behavior of characters that are less important. Consequently, a scalable but less accurate method for collision detection, " height map " , is used when the interference between objects might not be noticeable, while the hierarchal collision detection is introduced to decide for the inter-human collision and easily adapted into different detail levels. For behavior, Reynolds' Boids pioneered the behavioral animation work, Bouvier, Brogan and Hodgins have used particle systems and dynamics for modeling the motion of groups with significant physics, and rule-based behavioral systems are also exploited to simulate human behaviors. Then, ViCrowd, a flocking systems-based hierarchical model is presented in detail to exemplify a behavioral system to simulate crowd behaviors. Finally, the paper closes on a summary of these three implementation levels, and we describe a viable framework for future work.
Replica analysis of the p-spin interaction Ising spin-glass model

The thermodynamics of the infinite-range Ising spin glass with p-spin interactions in the presence of an external magnetic field h is investigated analytically using the replica method. We give emphasis to the analysis of the transition between the replica symmetric and the one-step replica symmetry breaking regimes. In particular, we derive analytical conditions for the onset of the continuous transition, as well as for the location of the tricritical point at which the transition between those two regimes becomes discontinuous.
Syzygies of toric varieties by Milena Hering

Syzygies of toric varieties by Milena Hering Chair: William Fulton Studying the equations defining the embedding of a projective variety and the higher relations (syzygies) between them is a classical problem in algebraic geometry. We give criteria for ample line bundles on toric varieties to give rise to a projectively normal embedding whose ideal is generated by quadratic equations and whose first q syzygies are linear. We illustrate the interactions with the combinatorics of lattice polytopes, and we study the related question of when the homogeneous coordinate ring of the embedding is Koszul. We obtain these results by exploiting the connection between the regularity of an ample line bundle L on a projective variety and the syzygies of embeddings induced by powers of L. Much of this has also appeared in a preprint with H. Schenck and G. Smith.
Integration Wavelet Neural Network for Steady Convection Dominated Diffusion Problem

In this paper, we first propose an Integration Wavelet Neural Network(I_WNN) based on spline wavelet functions for solving differential equations. Then the proposed method is verified successfully by solving two steady convection dominated diffusion problems and the numerical perturbation doesn’t happen when the ratio of convective coefficient to diffusive coefficient is as high as 100. Moreover, once the I_WNN is trained and the parameters are stored, it allows instantaneous evaluation of solution at any desired point spending negligible computing time and memory and the maximum relative error is 1.13%.
Accelerated Evolution of Conserved Noncoding Sequences in Humans

Changes in gene regulation likely influenced the profound phenotypic divergence of humans from other mammals, but the extent of adaptive substitution in human regulatory sequences remains unknown. We identified 992 conserved noncoding sequences (CNSs) with a significant excess of human-specific substitutions. These accelerated elements were disproportionately found near genes involved in neuronal cell adhesion. To assess the uniqueness of human noncoding evolution, we examined CNSs accelerated in chimpanzee and mouse. Although we observed a similar enrichment near neuronal adhesion genes in chimpanzee, the accelerated CNSs themselves exhibited almost no overlap with those in human, suggesting independent evolution toward different neuronal phenotypes in each species. CNSs accelerated in mouse showed no bias toward neuronal cell adhesion. Our results indicate that widespread cis-regulatory changes in human evolution may have contributed to uniquely human features of brain development and function.
On the Error Modeling of a Novel Mobile Hybrid Parallel Robot

This paper presents a method for the kinematic analysis and error modeling of a newly developed hybrid redundant robot IWR (intersector welding robot), which possesses ten degrees of freedom (DOF) where 6-DOF in parallel and additional 4-DOF in serial. In this article, the problem of kinematic modeling and error modeling of the proposed IWR robot are discussed. Based on the vector arithmetic method, the kinematic model and the sensitivity model of the end-effector subject to the structure parameters is derived and analyzed. The relations between the pose (position and orientation) accuracy and manufacturing tolerances, actuation errors, and connection errors are formulated. Simulation is performed to examine the validity and effectiveness of the evolutionary algorithm for the application.
Key generation research of RSA public cryptosystem and Matlab implement

RSA is the asymmetric cryptography system. The security of RSA public key cryptosystem is based on the assumption that factoring of a large modulus is difficult. In RSA if someone can factor modulus into a product of two prime numbers, then the private key is also detected and hence the security of the cryptosystem is broken. So it is quite important to research the selection of prime and derive private key from public key. This paper introduces the basic number theories of RSA cryptosystem and applies t to key algorithm of RSA cryptosystem, such as Euclidean and its extension theorem, square-multiply algorithm and prime number testing. At last, provides a description of Matlab simulation of key algorithm and RSA encryption and decryption. The result shows that the whole simulation took 0.140176s, and solves the problem of key transmission.
IMPROVING MOUSE POINTING WITH EYE-GAZE TARGETING : APPLICATION IN RADIOLOGY

In current radiology workstations, a scroll mouse is typically used as the primary input device for navigating image slices and conducting operations on an image. Radiological analysis and diagnosis rely on careful observation and annotation of medical images. During analysis of 3D MRI and CT volumes thousands of mouse clicks are performed every day, which can cause wrist fatigue. This thesis presents a dynamic Control-to-Display (C-D) gain mouse movement method, controlled by an eye-gaze tracker as the target predictor. By adjusting the C-D gain according to the distance to the target, the target width in motor space is effectively enlarged, thus reducing the index of difficulty of the mouse movement. Results indicate that using eye-gaze to predict the target position, the dynamic C-D gain method can improve pointing performance and increase the accuracy over traditional mouse movement.
Mining compressed frequent itemsets over data stream in sliding windows

Recent studies have shown mining compressed frequent itemset patterns provides more benefits than mining the closed frequent patterns, since mining compressed frequent itemset patterns leads to more compact and representative result sets. Especially, it is quite meaningful in the environment of data stream where limited memory space and computation quality are major challenges. In this paper, the problem of mining compressed frequent itemset patterns over a data stream sliding windows is presented and studied. Firstly, a novel data structure CP-Tree (Compressed Pattern Tree) is designed to maintain a dynamically selected set of compressed frequent itemset patterns over sliding window. Secondly, an efficient algorithm CFPStream (Compressing Frequent Patterns over Stream) is developed to discover compressed frequent itemset patterns in data stream sliding windows incrementally. Finally, some optimization techniques are adopted in CFPStream to speed up the algorithm and prune search space. Experiments on both real and synthetic data sets show that CFPStream outperforms representative algorithms for the state-of-the-art approaches.
Path-dependent Routines in the Evaluation of Novelty: The Effects of Innovators’ New Knowledge Use on Brokerage Firms’ Coverage

This paper examines how path dependencies in evaluation routines affect a brokerage firm’s decision to provide coverage to a company that builds on new knowledge. Companies depend on brokerage firms to gain access to external resources, as a brokerage firm’s coverage is a valuable form of recognition that may lower a company’s cost of capital and increase its value. Yet path dependencies in a brokerage firm’s evaluation routines may make it less likely to cover a company whose inventive activities build on different knowledge than it used in the past. Using data on 183 U.S. publicly traded medical device companies from 1993 to 2006, we examine how a company’s use of new knowledge affects a brokerage firm’s decision to cover the company. Our results suggest that a company may face a tension between exploration and resource dependence, as after it overcomes internal path dependencies that hinder exploration and successfully uses new knowledge, it may still fail to gain the attention of outside organizations on which it depends to access relevant resources due to externally borne path dependencies in the routines these outside organizations use to evaluate novelty. Also, in contrast with existing literature suggesting that brokerage firms have homogenous expectations for which strategies are appropriate for different types of companies, our results highlight that brokerage firms differ in how they respond to companies’ inventive activities based on factors such as their prior exposure to new knowledge, prior evaluation of the companies’ downstream product markets, and scope of technological expertise.
Implementation of Integrated Project Delivery and Building Information Modeling on a Small Commercial Project

Integrated Project Delivery (IPD) seeks to improve project outcomes through a collaborative approach of aligning the incentives and goals of the project team through shared risk and reward, early involvement of all parties, and a multi-party agreement. The coupling of Building Information Modeling (BIM) with IPD enables a level of collaboration that not only improves efficiency and reduces errors but also enables exploration of alternative approaches and expansions of market opportunities. Although several professional organizations are supporting the advancement of IPD, the amount of projects using IPD still remains relatively small. This paper summarizes a successful example of IPD implementation supported by BIM on a small commercial project.
Sleep curtailment is accompanied by increased intake of calories from snacks.

BACKGROUND Short sleep is associated with obesity and may alter the endocrine regulation of hunger and appetite. OBJECTIVE We tested the hypothesis that the curtailment of human sleep could promote excessive energy intake. DESIGN Eleven healthy volunteers [5 women, 6 men; mean +/- SD age: 39 +/- 5 y; mean +/- SD body mass index (in kg/m(2)): 26.5 +/- 1.5] completed in random order two 14-d stays in a sleep laboratory with ad libitum access to palatable food and 5.5-h or 8.5-h bedtimes. The primary endpoints were calories from meals and snacks consumed during each bedtime condition. Additional measures included total energy expenditure and 24-h profiles of serum leptin and ghrelin. RESULTS Sleep was reduced by 122 +/- 25 min per night during the 5.5-h bedtime condition. Although meal intake remained similar (P = 0.51), sleep restriction was accompanied by increased consumption of calories from snacks (1087 +/- 541 compared with 866 +/- 365 kcal/d; P = 0.026), with higher carbohydrate content (65% compared with 61%; P = 0.04), particularly during the period from 1900 to 0700. These changes were not associated with a significant increase in energy expenditure (2526 +/- 537 and 2390 +/- 369 kcal/d during the 5.5-h and 8.5-h bedtime periods, respectively; P = 0.58), and we found no significant differences in serum leptin and ghrelin between the 2 sleep conditions. CONCLUSIONS Recurrent bedtime restriction can modify the amount, composition, and distribution of human food intake, and sleeping short hours in an obesity-promoting environment may facilitate the excessive consumption of energy from snacks but not meals.
Post-Cartel Pricing During Litigation

Standard methods in the U.S. for calculating antitrust damages in price-fixing cases are shown to create a strategic incentive for firms to price above the non-collusive price after the cartel has been dissolved. This results in an overestimate of the but for price and an underestimate of the level of damages. The extent of this upward bias in the but for price is greater, the longer the cartel was in place and the more concentrated the industry.