Miracle-dz/UniFAR-FTUs huggingface dataset:
Do Chinese Stock Markets Share Common Information Arrival Processes

According to the Mixture of Distributions Hypothesis (MDH), returns volatility and trading volume are driven by a common news arrival variable. Consequently, these two variables should be correlated. This paper extends, and to some extent, globalises the concept of a common information arrival process by hypothesising that this variable drives daily price (returns) volatility and trading volume changes in different financial markets. An implication is that returns volatility in one stock market should show positive and contemporaneous correlation with returns volatility in another stock market. This paper tests this implication using data from three separate, but geographically close, stock markets (Shenzhen, Shanghai and Hong Kong). A problem in the usual testing procedure is the likelihood that the news arrival process has long memory. This means that both volatility and volume (or external volatility) will have long memory and consequently, contemporaneous correlation between these variables is likely to be incorrectly rejected in cases where the test equation does not account for long memory. This paper uses fractionally integrated GARCH (FIGARCH) to test and account for long memory. The analysis finds that there is contemporaneous correlation between returns volatility in these stock markets and confirms the presence of long memory effects.
The Effects of Zinc and Other Divalent Cations on M-Current in Ventral Tegmental Area Dopamine Neurons

Ventral tegmental area dopamine (DA VTA) neurons are important for the reinforcing effects of drugs of abuse such as ethanol and nicotine. We have previously shown that M-current (IM) regulates the excitability of DA VTA neurons. Zinc (Zn2+) contributes to the regulation of neuronal excitation as a neuromodulator. In the present study, we investigated zinc effect on the properties of IM and the spontaneous firing frequency of DA VTA neurons. The standard deactivation protocol was used to measure IM during voltage-clamp recording with a hyperpolarizing voltage step to ﹣40 mV from a holding potential (VH) of ﹣25 mV. Zn2+ (100 μM) inhibited IM amplitude and IM recovered completely from the inhibition after the washout of Zn2+. Zn2+ inhibited IM in a concentration-dependent manner (IC50: 5.8 μM). When hyperpolarizing voltage steps were given to ﹣65 mV (in 10 mV increments) from a VH of ﹣25 mV, Zn2+ (100 μM) reduced IM amplitude at each voltage and zinc inhibition of IM was not voltage-dependent. Zn2+ increased the spontaneous firing frequency of DA VTA neurons in a concentration-dependent manner, suggesting that Zn2+ causes excitation of DA VTA neurons through an action on IM. IM of DA VTA neurons was inhibited by 100 μM divalent cations in increasing order of potency: Ba2+ (16%) 2+ (25%) 2+ (40%) 2+ (59%) 2+ (67%). These results suggest that Zn2+ may exert physiologically significant regulation of neuronal excitability in DA VTA neurons.
The promises and challenges of pre-exposure prophylaxis as part of the emerging paradigm of combination HIV prevention

Towards the end of the twentieth century, significant success was achieved in reducing incidence in several global HIV epidemics through ongoing prevention strategies. However, further progress in risk reduction was uncertain. For one thing, it was clear that social vulnerability had to be addressed, through research on interventions addressing health systems and other structural barriers. As soon as antiretroviral treatment became available, researchers started to conceive that antiretrovirals might play a role in decreasing either susceptibility in uninfected people or infectiousness among people living with HIV. In this paper we focus on the origin, present status, and potential contribution of pre‐exposure prophylaxis (PrEP) within the combination HIV prevention framework.
Finding topological subgraphs is fixed-parameter tractable

We prove that for every fixed undirected graph <i>H</i>, there is an O(|V(G)|<sup>3</sup>) time algorithm that, given a graph <i>G</i>, tests if <i>G</i> contains <i>H</i> as a topological subgraph (that is, a subdivision of <i>H</i> is subgraph of <i>G</i>). This shows that topological subgraph testing is fixed-parameter tractable, resolving a longstanding open question of Downey and Fellows from 1992. As a corollary, for every <i>H</i> we obtain an O(|V(G)|<sup>3</sup>) time algorithm that tests if there is an immersion of <i>H</i> into a given graph <i>G</i>. This answers another open question raised by Downey and Fellows in 1992.
- 1-Test Automation-Automatic Test Generation Technology and Its Applications

Test development has been known as a tedious and time-consuming process. For complex designs, the process can sometime stretch over several months and become a bottleneck for product time-to-market. In the past two decades, various test development automation tools have been introduced and gradually accepted by designers and test engineers to automate dozens of tasks that are essential for developing adequate tests. The test development automation tools can generally be classified into four categories: design-for-testability (DFT) tools, test-pattern-generation tools, pattern-grading tools and test program development and debugging tools.
Improving Cache Management Policies Using Dynamic Reuse Distances

Cache management policies such as replacement, bypass, or shared cache partitioning have been relying on data reuse behavior to predict the future. This paper proposes a new way to use dynamic reuse distances to further improve such policies. A new replacement policy is proposed which prevents replacing a cache line until a certain number of accesses to its cache set, called a Protecting Distance (PD). The policy protects a cache line long enough for it to be reused, but not beyond that to avoid cache pollution. This can be combined with a bypass mechanism that also relies on dynamic reuse analysis to bypass lines with less expected reuse. A miss fetch is bypassed if there are no unprotected lines. A hit rate model based on dynamic reuse history is proposed and the PD that maximizes the hit rate is dynamically computed. The PD is recomputed periodically to track a program's memory access behavior and phases. Next, a new multi-core cache partitioning policy is proposed using the concept of protection. It manages lifetimes of lines from different cores (threads) in such a way that the overall hit rate is maximized. The average per-thread lifetime is reduced by decreasing the thread's PD. The single-core PD-based replacement policy with bypass achieves an average speedup of 4.2% over the DIP policy, while the average speedups over DIP are 1.5% for dynamic RRIP (DRRIP) and 1.6% for sampling dead-block prediction (SDP). The 16-core PD-based partitioning policy improves the average weighted IPC by 5.2%, throughput by 6.4% and fairness by 9.9% over thread-aware DRRIP (TA-DRRIP). The required hardware is evaluated and the overhead is shown to be manageable.
Symbiosism, Symbiomism and the Leiden definition of the meme

'When I use a word,' Humpty Dumpty said, in rather a scornful tone, 'it means just what I choose it to mean — neither more nor less. ' 'The question is,' said Alice, 'whether you can make words mean so many different things. ' 'The question is,' said Humpty Dumpty, 'which is to be master — that's all. ' Symbiosism is a Darwinian model of language and its emergence. Symbiosism is a variety of Symbiotic Theory, which treats linguistic forms as vehicles for the reproduction of meaningful elements in the hominid brain. The symbiotic view transcends the obsolete discord between the functionalist or European structuralist conception of language , whereby linguistic forms are seen as instruments used to convey meaningful elements , and the formalist or generative approach, whereby linguistic forms are treated as abstract structures which can be filled with meaningful elements. Symbiotic Theory shows naming and syntax to be two faces of the same phenomenon. Syntax arose from meaning. The first primaeval holistic utterances with a meaning in the linguistic sense inherently constituted a projection of reality with a temporal dimension. First-order predication arose when such a holistic utterance was split. This point of view was argued by Pierre de Maupertuis (1756, III: 444) and Hugo Schuchardt (1919a, 1919b) and contrasts with the naïve view that syntax arose from the concatenation of labels or names. The splitting of a signal for 'The baby has fallen out of the tree' could have yielded meanings such as 'That which has fallen out of the tree is our baby' and 'What the baby has done is to fall out of the tree'. Mária Ujhelyi (1998) has considered long-call structures in apes in this regard. Moreover, Symbiotic Theory operates not on the Oxonian conception of a meme as a 'unit of imitation', but on the Leiden definition of memes as isofunctional neuroana-tomical units corresponding to linguistic signs in the Saussurean sense, corresponding to single morphemes or monomorphemic words. The neuronal correlate of a meaning along with the neuronal representation of its associated phonological form or grammatical manifestation is a meme, whereas in Leiden school terminology a unit of imitation is a mime. The symbiotic model of the human mind is based on an understanding of lan
Sobolev inequalities in disguise

We present a simple and direct proof of the equivalence of various functional inequalities such as Sobolev or Nash inequalities. This proof applies in the context of Riemannian or sub-elliptic geometry, as well as on graphs and to certain non-local Sobolev norms. It only uses elementary cutoff arguments. This method has interesting consequences concerning Trudinger type inequalities.
VO2max Trainability and High Intensity Interval Training in Humans: A Meta-Analysis

Endurance exercise training studies frequently show modest changes in VO2max with training and very limited responses in some subjects. By contrast, studies using interval training (IT) or combined IT and continuous training (CT) have reported mean increases in VO2max of up to ∼1.0 L · min−1. This raises questions about the role of exercise intensity and the trainability of VO2max. To address this topic we analyzed IT and IT/CT studies published in English from 1965–2012. Inclusion criteria were: 1)≥3 healthy sedentary/recreationally active humans <45 yrs old, 2) training duration 6–13 weeks, 3) ≥3 days/week, 4) ≥10 minutes of high intensity work, 5) ≥1∶1 work/rest ratio, and 6) results reported as mean ± SD or SE, ranges of change, or individual data. Due to heterogeneity (I2 value of 70), statistical synthesis of the data used a random effects model. The summary statistic of interest was the change in VO2max. A total of 334 subjects (120 women) from 37 studies were identified. Participants were grouped into 40 distinct training groups, so the unit of analysis was 40 rather than 37. An increase in VO2max of 0.51 L ·min−1 (95% CI: 0.43 to 0.60 L · min−1) was observed. A subset of 9 studies, with 72 subjects, that featured longer intervals showed even larger (∼0.8–0.9 L · min−1) changes in VO2max with evidence of a marked response in all subjects. These results suggest that ideas about trainability and VO2max should be further evaluated with standardized IT or IT/CT training programs.
A Game-Theoretic Analysis of Strategic Clustering by Retailers

We develop and estimate a spatial game-theoretic model of entry and location choices to examine firms’ strategic clustering decisions. The model identifies two contradictory effects that determine firms’ geographical location choices: a competition effect and a clustering effect. We also separate firm’s strategic clustering incentives from the observed clustering behavior due to exogenous factors such as population and topographic desirability or constraints. In particular, we examine two closely related industries that share similar location limitations but have different strategic incentives to cluster, jointly estimate the Bayesian Nash equilibrium of a two-industry entry/location game, and quantify the strategic clustering incentives. JEL Classifications: L13, L81, R12, R30 ∗Department of Economics, University of South Florida, Tampa, FL,USA. Email: ydeng@usf.edu. †Department of Economics, University of South Florida, Tampa, FL,USA. Email: gpicone@usf.edu.
Baldrige Assessment and Organizational Learning: The Need for Change Management

Self-assessment using the Malcolm Baldrige Award Criteria for Performance Excellence (CPE) has become a widespread practice among all types of organizations. Empirical evidence suggests that Baldrige Award-based assessment typically results in improvements to managerial processes. Although the notion of process change is embedded within the CPE framework, the criteria do not explicitly address how an organization manages such change. In this article, the linkage between the criteria and change management is described. It is suggested that an effective process change management model can be derived from the framework of the criteria for performance excellence. Using concepts from the literatures on organizational change, assessment, and learning, a model for managing change in the context of the criteria is generated. The change process model parallels the model of strategic change that has been historically well specified by the CPE and refines the criteria notion of learning. These two models are linked by the exchange of information between the organizational performance review item and diagnostic self-assessment activities. Suggestions on how the organizational performance review item in the criteria can be expanded to incorporate change management as an explicit area to address are made.
On Joint Privacy and Reputation Assurance for Vehicular Ad Hoc Networks

In vehicular ad hoc networks (VANETs), privacy protection makes it challenging to maintain a long-term reputation of any node, while reputation management requires reputation manifestation at risk of easier vehicle tracking. Here, JPRA is proposed to reconcile these challenging conflicts and support the synergistic coexistence of both indispensible schemes in VANETs. JPRA adopts a localized reputation management model where the behavior evaluation, reputation aggregation, and reputation manifestation of each node are collectively performed by itself and its neighbors. In this model, novel algorithms are designed to support secure and efficient reputation management in face of node mobility and privacy protection. Furthermore, a conditional reputation discretization algorithm ensures privacy-preserving reputation manifestation for the honest nodes. Theoretical analysis and simulations show that JPRA can efficiently and synergistically support both schemes in VANETs.
Implicit motives predict affective responses to emotional expressions

We explored the influence of implicit motives and activity inhibition (AI) on subjectively experienced affect in response to the presentation of six different facial expressions of emotion (FEEs; anger, disgust, fear, happiness, sadness, and surprise) and neutral faces from the NimStim set of facial expressions (Tottenham et al., 2009). Implicit motives and AI were assessed using a Picture Story Exercise (PSE) (Schultheiss et al., 2009b). Ratings of subjectively experienced affect (arousal and valence) were assessed using Self-Assessment Manikins (SAM) (Bradley and Lang, 1994) in a sample of 84 participants. We found that people with either a strong implicit power or achievement motive experienced stronger arousal, while people with a strong affiliation motive experienced less arousal and less pleasurable affect across emotions. Additionally, we obtained significant power motive × AI interactions for arousal ratings in response to FEEs and neutral faces. Participants with a strong power motive and weak AI experienced stronger arousal after the presentation of neutral faces but no additional increase in arousal after the presentation of FEEs. Participants with a strong power motive and strong AI (inhibited power motive) did not feel aroused by neutral faces. However, their arousal increased in response to all FEEs with the exception of happy faces, for which their subjective arousal decreased. These differentiated reaction patterns of individuals with an inhibited power motive suggest that they engage in a more socially adaptive manner of responding to different FEEs. Our findings extend established links between implicit motives and affective processes found at the procedural level to declarative reactions to FEEs. Implications are discussed with respect to dual-process models of motivation and research in motive congruence.
AN FPGA IMPLEMENTATION BELIEF PROPAGATION DECODING ALGORITHM

Low Density Parity Check (LDPC) codes are one of the best error correcting codes that enable the future generations of wireless devices. In this paper we have presented an FPGA based self error checking & correction system with higher capability. We implemented the error correction algorithms such as belief propagation & bit flip algorithm. The number of error corrected is simulated using Xilinx High level Synthesis tool & Modelsim simulator. A complete self checking system is implemented on Xilinx Spartan 3E FPGA & synthesis is done using ISE13.2. The decoded codeword of the decoder is displayed on PC HyperTerminal using serial Rs232 interface. The system is capable of correcting large & different size of codeword. Self error detection & correction capability of the system is compared & verified in presence of noise.
High Speed OFDM Implementation in FPGA

— FPGA is one of the efficient & economic way to implement the circuit. Orthogonal Frequency Division Multiplexing (OFDM) is a multicarrier modulation technique. OFDM provides high bandwidth efficiency because the carriers are orthogonal to each other and multiple carriers share the data among themselves. The main advantage of this transmission technique is their robustness to channel fading in wireless communication environment. This paper illustrates how QAM modulation scheme give higher speed in implementing OFDM in FPGA.
Messina: A Novel Analysis Tool to Identify Biologically Relevant Molecules in Disease

Background Morphologically similar cancers display heterogeneous patterns of molecular aberrations and follow substantially different clinical courses. This diversity has become the basis for the definition of molecular phenotypes, with significant implications for therapy. Microarray or proteomic expression profiling is conventionally employed to identify disease-associated genes, however, traditional approaches for the analysis of profiling experiments may miss molecular aberrations which define biologically relevant subtypes. Methodology/Principal Findings Here we present Messina, a method that can identify those genes that only sometimes show aberrant expression in cancer. We demonstrate with simulated data that Messina is highly sensitive and specific when used to identify genes which are aberrantly expressed in only a proportion of cancers, and compare Messina to contemporary analysis techniques. We illustrate Messina by using it to detect the aberrant expression of a gene that may play an important role in pancreatic cancer. Conclusions/Significance Messina allows the detection of genes with profiles typical of markers of molecular subtype, and complements existing methods to assist the identification of such markers. Messina is applicable to any global expression profiling data, and to allow its easy application has been packaged into a freely-available stand-alone software package.
A Content-Based Method to Enhance Tag Recommendation

Tagging has become a primary tool for users to organize and share digital content on many social media sites. In addition, tag information has been shown to enhance capabilities of existing search engines. However, many resources on the web still lack tag information. This paper proposes a content-based approach to tag recommendation which can be applied to webpages with or without prior tag information. While social bookmarking service such as Delicious enables users to share annotated bookmarks, tag recommendation is available only for pages with tags specified by other users. Our proposed approach is motivated by the observation that similar webpages tend to have the same tags. Each webpage can therefore share the tags they own with similar webpages. The propagation of a tag depends on its weight in the originating webpage and the similarity between the sending and receiving webpages. The similarity metric between two webpages is defined as a linear combination of four cosine similarities, taking into account both tag information and page content. Experiments using data crawled from Delicious show that the proposed method is effective in populating untagged webpages with the correct tags.
Parallel Downloading Algorithm for Large-volume File Distribution

BitTorrent is a popular, open-source content distribution system that is conducive for distribution of large-volume files. In this paper, we first model the parallel downloading problem as directed graph and discuss possible improving directions. Then a smart connection management algorithm is proposed, which introduces the notion of content group and sub-tracker, and decentralizes the decision process performed at the tracker for transfer coordination. Simulations show that by increasing content availability to the clients from their immediate neighbors, it can significantly improve the efficiency of distribution.
On synthetic benchmark generation methods

In the process of designing complex chips and systems, the use of benchmark designs is often necessary. However, the existing benchmark suites are not sufficient for the evaluation of new architectures and EDA tools; synthetic benchmark circuits are a viable alternative. In this paper, a systematic approach for the generation and evaluation of synthetic benchmark circuits is presented. A number of existing benchmark generation methods are examined using direct validation of size and topological parameters. This exposes certain features and drawbacks of the different methods.
Robustness of Multiple High Speed TCP CUBIC Connections under Severe Operating Conditions

We study the adaptation capabilities and robustness of the high-speed TCP CUBIC algorithm. For this purpose we consider a network environment with variable and high random packet loss and a large Bandwidth-Delay product, shared by multiple heterogeneous TCP connections. The analysis is based on and supported by packet-level simulations. The results show that the aggressive nature of CUBIC's nonlinear congestion window control principle causes a degradation of the time-average throughput at the moderate level of random packet loss even under increasing Round-Trip-Time of the flow. However, this algorithmic scalability and loss-free-time-dependent window growth allows recovering transmission rate faster in the high packet loss region due to the statistically lower number of dropped packets, compared to the moderate loss level.
Linear Optimality Theory as a Model of Gradience in Grammar

This paper provides an overview of Linear Optimality Theory (LOT), a variant of Optimality Theory (OT) designed for the modeling of gradient acceptability judgment data. We summarize the empirical properties of gradient data that have been reported in the experimental literature, and use them to motivate the design of L OT. We discuss LOT’s notions of constraint competition and optimality, as well as a n ew formulation of ranking argumentation, which makes it possible to apply standard parameter estimation techniques to LOT. Then the LOT model is compared to Standard OT, to Harmonic Grammar, and to recently proposed probabilistic versions of OT.