Miracle-dz/UniFAR-FTUs huggingface dataset:
RUNX3 Inhibits the Expression of Vascular Endothelial Growth Factor and Reduces the Angiogenesis, Growth, and Metastasis of Human Gastric Cancer

Purpose: Recent studies indicated that RUNX3 exhibits potent antitumor activity. However, the underlying molecular mechanisms of this activity remain unclear. In the present study, we used a gastric cancer model to determine the effect of RUNX3 expression on tumor angiogenesis. Experimental Design: The effects of increased RUNX3 expression on vascular endothelial growth factor (VEGF) expression in and angiogenic potential of human gastric cancer cells were determined in vitro and in animal models. RUNX3 and VEGF expression was determined in 120 human gastric cancer specimens and their relationship was analyzed. Results:RUNX3 gene transfer suppressed VEGF expression in human gastric cancer cells. Down-regulation of VEGF expression correlated with a significantly impaired angiogenic potential of human gastric cancer cells. Furthermore, RUNX3 restoration inhibited tumor growth and metastasis in animal models, which was consistent with inhibition of angiogenesis as determined by evaluating VEGF expression and tumor microvessel formation. In gastric cancer specimens, loss or decrease in RUNX3 expression inversely associated with increased VEGF expression and elevated microvessel formation. Conclusions: Our clinical and experimental data provide a novel molecular mechanism for the antitumor activity of RUNX3 and may help design effective therapy targeting RUNX3 pathway to control gastric cancer growth and metastasis.
SEP formula for single relay selection in a multiple relay environment over rayleigh fading channels

In this paper, we analyze the performance of cooperative wireless networks with multiple-relays with single-relay selection using limited feed back, exploiting the concepts of Alamouti space-time coding. A two-stage protocol is used with the relay terminals operating in the amplify-and-forward mode (AF). The analysis uses the Rayleigh fading model to reduce the complexity in handling versatile Nakagami fading channels. Taking these effects into account, symbol error probability (SEP) for single relay selection in a multiple-relay environment is derived . The selection is based on the gain of the source-relay (SR) channel and we claim that this is the best achievable SEP for transmission of the Alamouti code using the described protocol, under the given selection criteria. Numerical results are provided to verify the accuracy of the formulation.
State of the art on defenses against wormhole attacks in wireless sensor networks

As pervasive interconnection of autonomous sensor devices gave birth to a broad class of exiting new applications, security emerges as a central requirement. Wireless sensor networks are vulnerable to attacks as they are frequently deployed in open and unattended environments. In this paper, we describe the wormhole attack, a severe routing attack against sensor networks that is particularly challenging to defend against. We detail its characteristics and study its effects on the successful operation of a sensor network. We present state-of-the-art research for addressing wormhole related problems in wireless sensor networks and discuss the relative strengths and shortcomings of the proposed solutions. To date, most of the proposed defenses focus on preventive mechanisms that can be applied to protect sensor networks from this kind of attacks. However, no work has been published regarding the possibility of using more sophisticated methods, like intrusion detection systems, to achieve a more complete and autonomic defense mechanism against wormhole attackers. We present our work on intrusion detection and introduce a lightweight IDS framework, called LIDeA, designed for wireless sensor networks. LIDeA is based on a distributed architecture, in which nodes overhear their neighboring nodes and collaborate with each other in order to successfully detect an intrusion. We conclude by highlighting how such a system can be used for defending against wormhole attackers.
Distributed Monitoring of Voltage Collapse Sensitivity Indices

The assessment of voltage stability margins is a promising direction for wide-area monitoring systems. Accurate monitoring architectures for long-term voltage instability are typically centralized and lack scalability, while completely decentralized approaches relying on local measurements tend toward inaccuracy. Here we present distributed linear algorithms for the online computation of voltage collapse sensitivity indices. The computations are collectively performed by processors embedded at each bus in the smart grid, using synchronized phasor measurements and communication of voltage phasors between neighboring buses. Our algorithms provably converge to the proper index values as would be calculated using centralized information, but do not require any central decision maker for coordination. Modifications of the algorithms to account for generator reactive power limits are discussed. We illustrate the effectiveness of our designs with a case study of the New England 39 bus system.
Informedia@TrecVID 2014: MED and MER

We report on our system used in the TRECVID 2014 Multimedia Event Detection (MED) and Multimedia Event Recounting (MER) tasks. On the MED task, the CMU team achieved leading performance in the Semantic Query (SQ), 000Ex, 010Ex and 100Ex settings. Furthermore, SQ and 000Ex runs are significantly better than the submissions from the other teams. We attribute the good performance to 4 main components: 1) our large-scale semantic concept detectors trained on video shots for SQ/000Ex systems, 2) better features such as improved trajectories and deep learning features for 010Ex/100Ex systems, 3) a novel Multistage Hybrid Late Fusion method for 010Ex/100Ex systems and 4) our developed reranking methods for Pseudo Relevance Feedback for 000Ex/010Ex systems. On the MER task, our system utilizes a subset of features and detection results from the MED system from which the recounting is then generated. Recounting evidence is presented by selecting the most likely concepts detected in the salient shots of a video. Salient shots are detected by searching for shots which have high response when predicted by the video level event detector.
Research on Technology of Process Hiding Based on VMM

Kernel-level Rootkit injects malicious code in the system kernel and realizes vicious function by modifying kernel code and data. The emergence of virtualization technology makes Rootkit hide itself and accesses system resources effectively. This paper proposes a kind of Rootkit based on VMM (VMRootkit) which can hide system process and system cannot find it. For realizing it, we firstly puts forward formal model of VMRootkit about cooperative concealment combined with Trojans thought about cooperative concealment, then researches the process switch and data structure of operating system and realized prototype of it, which can monitor system process and realize process depth hiding by modifying data structure related process view. Experiment shows that VMRootkit prototype meets the idea of cooperative concealment, can realize process depth hiding and has better hidden property than kernel-level Rootkit.
The Politics of Poverty: Left Political Institutions, the Welfare State, and Poverty

This study investigates the impact of left political institutions on a nation's amount of poverty. Specifically, the analysis tests three possible causal relationships: whether left political institutions affect poverty separately from the welfare state, channeled through the welfare state, or combined with the welfare state. These relationships are tested with an unbalanced panel analysis of 16 rich Western democracies from 1967 to 1997 (N = 73, 74), two measures of poverty, and eight measures of left political institutions. The results demonstrate that the strength of left political institutions has a significant, powerful negative impact on poverty. Specifically, left political institutions partially combine with and partially channel through the welfare state. Voter turnout and the cumulative historical power of left parties entirely channel through the welfare state to reduce poverty. The percent of votes for left parties, the percent of seats for left parties, wage coordination, neocorporatism, gross union density and employed union density partially combine with and partially channel through the welfare state to reduce poverty. While the welfare state remains a crucial determinant of poverty, left political institutions are essential to explanations of the comparative historical variation in poverty.
多語聲學單位分類之最佳化研究 (The Study of Acoustic Model Clustering in Multilingual Speech Recognition) [In Chinese]

由於全球化的形成,人與人之間的溝通不再限於同一種語言,因此多語的語音辨識也變 的格外的重要。 如何有效整合多語的聲學模型是一個關鍵議題,因為一組好的多語聲學 單位將影響辨識結果。 本論文提出了一套整合專家背景知識與實際語音分析的方法,來 產生一組新的聲學單位,並且對這組聲學單位的數目,使用差分貝式資訊法則來做最佳 的處理。 從訓練好的隱藏式馬可夫聲學模型中,計算其單位間的相似度矩陣,之後透過 語音學和音韻學的知識,限定了各個聲學單位能群化的上限,根據不同限定的群化上 限,使用聚合階層式分群法,來建立不同的結構樹。 之後,利用差分貝式資訊法則,將 每個結構樹中發音相近的聲學單位做合併,當差分貝式資訊法則的值小於零的時候,就 停止合併,而新合併成一群的聲學單位則為新的聲學單。 我們將用 ForSDAT01 華台雙語 語料庫來實驗評量,而實驗結果顯示,本論文所提出的新方法比只用專家知識所定義的 聲學單位所訓練出的辨識器有較高的辨識效果。
Correctly translating concurrency primitives

Motivated by the question of correctness of a specific implementation of concurrent buffers in the lambda calculus with futures underlying Alice ML, we prove that concurrent buffers and handled futures can correctly encode each other. Our translations map waiting on handled futures to queuing of concurrent buffers and vice versa. Correctness of translations means that they preserve and reflect the observations of may- and must-convergence. As a consequence of compositionality, they are also adequate with respect to a contextually defined notion of observational program semantics. We demonstrate that our approach to the correctness of implementations applies uniformly to the whole compilation process from high-level to low-level concurrent languages.
Human Condensin Function Is Essential for Centromeric Chromatin Assembly and Proper Sister Kinetochore Orientation

Condensins I and II in vertebrates are essential ATP-dependent complexes necessary for chromosome condensation in mitosis. Condensins depletion is known to perturb structure and function of centromeres, however the mechanism of this functional link remains elusive. Depletion of condensin activity is now shown to result in a significant loss of loading of CENP-A, the histone H3 variant found at active centromeres and the proposed epigenetic mark of centromere identity. Absence of condensins and/or CENP-A insufficiency produced a specific kinetochore defect, such that a functional mitotic checkpoint cannot prevent chromosome missegregation resulting from improper attachment of sister kinetochores to spindle microtubules. Spindle microtubule-dependent deformation of both inner kinetochores and the HEC1/Ndc80 microtubule-capturing module, then results in kinetochore separation from the Aurora B pool and ensuing reduced kinase activity at centromeres. Moreover, recovery from mitosis-inhibition by monastrol revealed a high incidence of merotelic attachment that was nearly identical with condensin depletion, Aurora B inactivation, or both, indicating that the Aurora B dysfunction is the key defect leading to chromosome missegregation in condensin-depleted cells. Thus, beyond a requirement for global chromosome condensation, condensins play a pivotal role in centromere assembly, proper spatial positioning of microtubule-capturing modules and positioning complexes of the inner centromere versus kinetochore plates.
Minimizing Implementation Costs with End-to-End Retiming

We introduce end-to-end retiming, a paradigm for efficiently evaluating a varied set of global r etiming possibilities. The result is a continuous curve of retiming solutions stretching between the extremes of minimu m delay and minimum register count. Any single retiming solution may be infeasible or unacceptably difficult to impl ement, but with an array of choices, a solution with the minimum implementation cost can be selected. Because the co ntour of the tradeoff between performance and cost is highly dependent upon circuit topology, it can not be easi ly predicted beforehand. We describe two application s for which end-to-end retiming is well suited: combined retiming/sizing and simultaneous retiming/clock ske w scheduling. The latter combination is particularly interesting, as the costs of pursuing retiming and skewing depend on the topology in often complementary ways; the combination of the two is shown to be much more eff icient than either in isolation. We examine the area and ynamic clock power consumption of a set of industry-suppli ed benchmarks and optimize the circuits to meet an agg ressive timing target. End-to-end retiming meets the target with an average reduction of over 131% in the additional ar ea required and 79% in the additional dynamic clock power consumed over the best of either retiming or skewin g alone. End-to-end retiming provides a solution approach that is scalable, applicable to different cost objectives, and not limited in its timing model.
BMI1, Stem Cell Factor Acting as Novel Serum-biomarker for Caucasian and African-American Prostate Cancer

Background Lack of reliable predictive biomarkers is a stumbling block in the management of prostate cancer (CaP). Prostate-specific antigen (PSA) widely used in clinics has several caveats as a CaP biomarker. African-American CaP patients have poor prognosis than Caucasians, and notably the serum-PSA does not perform well in this group. Further, some men with low serum-PSA remain unnoticed for CaP until they develop disease. Thus, there is a need to identify a reliable diagnostic and predictive biomarker of CaP. Here, we show that BMI1 stem-cell protein is secretory and could be explored for biomarker use in CaP patients. Methodology/Principal Findings Semi-quantitative analysis of BMI1 was performed in prostatic tissues of TRAMP (autochthonous transgenic mouse model), human CaP patients, and in cell-based models representing normal and different CaP phenotypes in African-American and Caucasian men, by employing immunohistochemistry, immunoblotting and Slot-blotting. Quantitative analysis of BMI1 and PSA were performed in blood and culture-media of siRNA-transfected and non-transfected cells by employing ELISA. BMI1 protein is (i) secreted by CaP cells, (ii) increased in the apical region of epithelial cells and stromal region in prostatic tumors, and (iii) detected in human blood. BMI1 is detectable in blood of CaP patients in an order of increasing tumor stage, exhibit a positive correlation with serum-PSA and importantly is detectable in patients which exhibit low serum-PSA. The clinical significance of BMI1 as a biomarker could be ascertained from observation that CaP cells secrete this protein in higher levels than cells representative of benign prostatic hyperplasia (BPH). Conclusions/Significance BMI1 could be developed as a dual bio-marker (serum and biopsy) for the diagnosis and prognosis of CaP in Caucasian and African-American men. Though compelling these data warrant further investigation in a cohort of African-American patients.
Clinical Features and Treatment of Ocular Toxoplasmosis

Ocular toxoplasmosis is a disease caused by the infection with Toxoplasma gondii through congenital or acquired routes. Once the parasite reaches the retina, it proliferates within host cells followed by rupture of the host cells and invasion into neighboring cells to make primary lesions. Sometimes the restricted parasite by the host immunity in the first scar is activated to infect another lesion nearby the scar. Blurred vision is the main complaint of ocular toxoplasmic patients and can be diagnosed by detection of antibodies or parasite DNA. Ocular toxoplasmosis needs therapy with several combinations of drugs to eliminate the parasite and accompanying inflammation; if not treated it sometimes leads to loss of vision. We describe here clinical features and currently available chemotherapy of ocular toxoplasmosis.
A compressed infrared motion sensing system for human-following robots

This paper develops a compressed infrared motion sensing system for mobile robots to detect and localize a moving human target in the vicinity. The proposed sensing system consists of three compressed infrared bearing sensor arrays for generating the bearing measurements of a human target from three perspectives. Then, human location is inferred by fusing these bearing measurements with least square method. The bearing sensor array is composed of pyroelectric infrared (PIR) sensors, and we employ the compressed sensing paradigm for the bearing sensor array design for reducing the number of required PIR sensors. A sensing system prototype is developed and evaluated in the context of human-following with mobile robots.
Analysis of Information Diffusion on Threshold Models in Arbitrary Social Networks

How information, new ideas, and rumors diffuse through a social network has been a fundamental question for many decades in various disciplines including computer science, social science, and economics [1, 5, 9, 14]. In recent decades, various models of information diffusion have been studied. In particular, Kempe et al. [10] proposed the general threshold model, a unified generalization of many diffusion models on networks, which is based on utility maximization of individuals in game theoretic consideration. In this model, each node v has its own threshold function fv : {0, 1}dv → [0, 1] that depends only on the decisions of its neighbors, where dv is the degree of v, and a threshold value θv ∈ [0, 1], which is drawn independently and randomly from a certain probability distribution μ. Despite the importance of such study, analysis on the threshold model has focused on special cases such as homogeneous thresholds [16], submodular influence [11], and locally tree-like networks [15]. In this work, we consider the general threshold model with arbitrary threshold distribution on an arbitrary network structure that may have many triangles and short cycles. First, we prove that, for any linear threshold model (i.e., fv’s are linear functions) with arbitrary threshold distribution when the initial adopters are chosen uniformly at random, only if (essentially) all nodes are of degrees ω(log n), then the final cascade size is sharply concentrated around its mean with high probability, where n is the total number of nodes. Furthermore, somewhat surprisingly we prove that the expectation of the cascade size is asymptotically independent of the network structure under the same condition. More precisely, we consider that the network structure is given and that each individual becomes an initial adopter independently with a given probability x ∈ [0, 1]. This process can be regarded as diffusion process initiated by public marketing that affects each individual to be an initial adopter independently with probability x. Let Z(= Zx) be the final cascade size if an initial adopter set is given by the above process, and let F be the cumulative density function of μ. Let α0 = x, the fraction of initial adopters, and let αt = F (αt−1) for t ∈ N. Let α∗ = limt→∞ αt. Then one can easily check that α∗ = min{α|F (α) = α} ≤ 1. We prove that the final cascade size is very close to α∗n with high probability and it is asymptotically independent of the network structure. Theorem 1 Suppose that μ is continuous and F is not tangential to y = α at α∗. If dv = ω(log n) for all v ∈ V and the weight of u’s influence on v is wuv = O ( 1 dv ) for every uv ∈ E, then for any > 0 and δ > 0, Pr[|Z − α∗n| > n ] = o(n−δ). The condition that y = F (α) is not tangential to the line of y = α at α∗ is a very mild assumption and it only requires that there exists γ > 0 such that F (α∗ + ∆) < α∗ + ∆ for all
Calculating End Game Databases for General Game Playing

The issue of end game database construction is known and well-studied in various specific gaming domains like the Chess and the Checkers. However with arrival of General Game Playing (GGP) challenge the automatic construction of end game databases attracted focus again. The current paper presents the sound and complete algorithm for automated construction of end game databases within the GGP setting. The theoretical base for the algorithm stands on the regression introduced in the Situation Calculus. Along with the theoretical base a sample implementation constructed on top of the FLUX (a Fluent Calculus implementation) is presented. Discussion of current open issues and future challenges concludes the writing.
YKL‐40 Level and Hypertension Incidence: A Population‐Based Nested Case‐Control Study in China

Background Human cartilage glycoprotein‐39 (YKL‐40) has been suggested to be a new marker of inflammation, atherosclerosis, and endothelial dysfunction. However, whether a higher level of YKL‐40 is an independent risk factor for hypertension incidence is still unknown. Methods and Results In a nested case‐control study within a prospective cohort of 12 423 initially healthy Chinese adults, we measured baseline plasma concentrations of YKL‐40 among 700 new‐onset hypertension cases and 700 age‐ and sex‐matched controls. Multiple conditional logistic regression analyses were used to calculate the odds ratios (95% CIs) of hypertension associated with higher levels of YKL‐40 both in the total population and in the age‐ (>55 and ≤55 years) and sex‐matched subgroups. Among the total population, YKL‐40 levels were not associated with hypertension risk. In the subgroup older than 55 years, odds ratios (95% CIs) of hypertension for those in the two higher tertiles of YKL‐40 were 1.23 (0.77–1.97) and 1.59 (0.99–2.55) (P for linear trend=0.05). In the male subgroup, odds ratios (95% CIs) of hypertension for those in the two higher tertiles of YKL‐40 were 1.55 (0.88–2.72) and 2.09 (1.14–3.82) (P for linear trend=0.02). An interaction effect was observed between YKL‐40 and sex (P for interaction <0.01) but not between YKL‐40 and age (P for interaction=0.21). High YKL‐40 level significantly increased hypertension risk in men but decreased hypertension risk with a trend although not significant in women. Conclusions This study suggests that YKL‐40 is associated with hypertension incidence only among men. The study findings need to be further verified by prospective cohort studies or clinical trials.
Projective Structure and Motion from Image Sequences Using Subspace Methods

In this paper a novel method to make reconstruction from any number of uncalibrated cameras is presented. The novelty lies in the fact that the algorithm relies only on subspace methods, which implies that it is independent of the chosen coordinate system in the images. Furthermore , it does not distinguish between the diierent points in each image and can deal with any number of images and points in a uniied manner. Finally, it is possible to obtain a result that is independent on the chosen ordering of the images. The performance of this iterative algorithm is shown on both simulated and real data. In general, for n points in m images, it is suucient to make only 10 iterations, where each iteration involves the calculation of the four eigenvectors corresponding to the largest eigenvalues to an nn matrix and calculations of the eigenvector corresponding to the smallest eigenvalue to m diierent n n matrices.