Miracle-dz/UniFAR-FTUs huggingface dataset:
What''s interesting?

Interestingness depends on the observer''s current knowledge and computational abilities. Things are boring if either too much or too little is known about them --- if they appear either trivial or random. Interesting are unexpected regularities that seem easy to figure out. I attempt to implement these ideas in a ``curious'''', ``creative'''' explorer with two co-evolving ``brains''''. It executes a lifelong sequence of instructions whose modifiable probabilities are conditioned on both brains --- both must {\em agree} on each instruction. There are special instructions for comparing computational results. The brains can predict outcomes of such comparisons. If their opinions differ, then the winner will get rewarded, the loser punished. Hence each brain wants to lure the other into agreeing upon instruction subsequences involving comparisons that surprise it. The surprised brain adapts. In turn, the other loses a source of reward --- an incentive to shift the focus of interest. Both brains deal with the complex credit assignment problem using the recent Incremental Self-Improvement paradigm. Extensive simulations include an example where curiosity helps to speed up external reward.
Automatic extraction of web data records containing user-generated content

In this paper, we are concerned with the problem of automatically extracting web data records that contain user-generated content (UGC). In previous work, web data records are usually assumed to be well-formed with a limited amount of UGC, and thus can be extracted by testing repetitive structure similarity. However, when a web data record includes a large portion of free-format UGC, the similarity test between records may fail, which in turn results in lower performance. In our work, we find that certain domain constraints (e.g., post-date) can be used to design better similarity measures capable of circumventing the influence of UGC. In addition, we also use anchor points provided by the domain constraints to improve the extraction process, which ends in an algorithm called MiBAT (Mining data records Based on Anchor Trees). We conduct extensive experiments on a dataset consisting of forum thread pages which are collected from 307 sites that cover 219 different forum software packages. Our approach achieves a precision of 98.9% and a recall of 97.3% with respect to post record extraction. On page level, it perfectly handles 91.7% of pages without extracting any wrong posts or missing any golden posts. We also apply our approach to comment extraction and achieve good results as well.
Analysis of Fused Ophthalmologic Image Data

-The contribution summarises the results of a long-term project concerning processing and analysis of multimodal retinal image data, run in cooperation between Brno University of Technology -Dept. of Biomedical Engineering and Erlangen University -Clinic of Ophthalmology. From the medical application point of view, the main stimulus is the improvement of diagnostics (primarily of glaucoma but other diseases as well) by making the image segmentation and following analysis reproducible and possibly independent on the evaluator. Concerning the methodology, different image processing approaches had to be combined and modified in order to achieve reliable clinically applicable procedures.
Intracellular and extracellular forces drive primary cilia movement

Significance A single primary cilium extends from the surface of many mammalian cells—often into an aqueous lumen, such as a kidney duct. In kidney epithelial cells, primary cilia are believed to sense fluid flow. This mechanosensory function is critical for proper organ function. Fluid flow is assumed to deflect cilia, leading to activation of transmembrane ion channels. This study defines the mechanical contributions of both bending and pivoting at the base to ciliary deflection. In addition, we report that active intracellular forces drive ciliary pivoting. This cell-directed cilia movement may be important for tuning ciliary mechanosensitivity. Primary cilia are ubiquitous, microtubule-based organelles that play diverse roles in sensory transduction in many eukaryotic cells. They interrogate the cellular environment through chemosensing, osmosensing, and mechanosensing using receptors and ion channels in the ciliary membrane. Little is known about the mechanical and structural properties of the cilium and how these properties contribute to ciliary perception. We probed the mechanical responses of primary cilia from kidney epithelial cells [Madin–Darby canine kidney-II (MDCK-II)], which sense fluid flow in renal ducts. We found that, on manipulation with an optical trap, cilia deflect by bending along their length and pivoting around an effective hinge located below the basal body. The calculated bending rigidity indicates weak microtubule doublet coupling. Primary cilia of MDCK cells lack interdoublet dynein motors. Nevertheless, we found that the organelles display active motility. 3D tracking showed correlated fluctuations of the cilium and basal body. These angular movements seemed random but were dependent on ATP and cytoplasmic myosin-II in the cell cortex. We conclude that force generation by the actin cytoskeleton surrounding the basal body results in active ciliary movement. We speculate that actin-driven ciliary movement might tune and calibrate ciliary sensory functions.
Optimal scheduling of networked energy storages

The penetration of renewable energy has been increasing rapidly through out the world. But its generation is intermittent unlike conventional sources. Energy storages provide an environmentally sustainable mechanism to reduce its variability. And given the geographically distributed nature of renewable energy sources, using a network of energy storages instead of using centralized ones can be helpful in avoiding congestion in transmission networks. In this paper we study a power system with such a network of storages. We provide a stochastic formulation to obtain the optimal scheduling policy for it. We show that the problem of calculating that policy is not convex in general and we find sufficient conditions for convexity. We also propose and numerically evaluate a heuristic algorithm which provides sub-optimal policies when the problem is non-convex.
Content Area Differences in Attitudes toward Teaching Reading.

Pennsylvania State University Changing teacher behavior is the goal of inservice education. A critical first step in changing behavior is changing attitudes. When the specific goal of an inservice training program is to help secondary school teachers integrate the teaching of reading into content areas, negative attitudes provide a serious obstacle. The Content Area Reading Project, from which this article was derived, was designed to change the behavior and attitudes of junior high school teachers through systematic inservice education. The Project's goals were, first, to positively change teacher attitudes toward teaching reading as part of their content area subjects, and, second, to effect a change in classroom practice.
Compositional Approach for Automatic Recognition of Fine-Grained Affect, Judgment, and Appreciation in Text

報告番号: 甲27290 ; 学位授与年月日: 2011-03-24 ; 学位の種別: 課程博士 ; 学位の種類: 博士(情報理工学) ; 学位記番号: 博情第328号 ; 研究科・専攻: 情報理工学系研究科電子情報学専攻
Relationship of High and Low Ankle Brachial Index to All-Cause and Cardiovascular Disease Mortality: The Strong Heart Study

Background—The associations of low (<0.90) and high (>1.40) ankle brachial index (ABI) with risk of all-cause and cardiovascular disease (CVD) mortality have not been examined in a population-based setting. Methods and Results—We examined all-cause and CVD mortality in relation to low and high ABI in 4393 American Indians in the Strong Heart Study. Participants had bilateral ABI measurements at baseline and were followed up for 8.3±2.2 years (36 589 person-years). Cox regression was used to quantify mortality rates among participants with high and low ABI relative to those with normal ABI (0.90 ≤ABI ≤1.40). Death from all causes occurred in 1022 participants (23.3%; 27.9 deaths per 1000 person-years), and of these, 272 (26.6%; 7.4 deaths per 1000 person-years) were attributable to CVD. Low ABI was present in 216 participants (4.9%), and high ABI occurred in 404 (9.2%). Diabetes, albuminuria, and hypertension occurred with greater frequency among persons with low (60.2%, 44.4%, and 50.1%) and high (67.8%, 49.9%, and 45.1%) ABI compared with those with normal ABI (44.4%, 26.9%, and 36.5%), respectively (P <0.0001). Adjusted risk estimates for all-cause mortality were 1.69 (1.34 to 2.14) for low and 1.77 (1.48 to 2.13) for high ABI, and estimates for CVD mortality were 2.52 (1.74 to 3.64) for low and 2.09 (1.49 to 2.94) for high ABI. Conclusions—The association between high ABI and mortality was similar to that of low ABI and mortality, highlighting a U-shaped association between this noninvasive measure of peripheral arterial disease and mortality risk. Our data suggest that the upper limit of normal ABI should not exceed 1.40.
Making the Paths: Constructing Multicultural Texts and Critical-Narrative Discourse in Literature-History Classes. Report Series 7.8.

Introduction.1 Methods.4 Results.12 Constructing “Integrated” Curricula: Blurring Literature-History Boundaries.13 Introducing a Problem-Posing Pedagogy--Day Twelve.18 Central Themes.26 Discussion.95 Acknowledgements.103 References.104
Conditional Independencies under the Algorithmic Independence of Conditionals

In this paper we analyze the relationship between faithfulness and the more recent condition of algorithmic Independence of Conditionals (IC) with respect to the Conditional Independencies (CIs) they allow. Both conditions have been extensively used for causal inference by refuting factorizations for which the condition does not hold. Violation of faithfulness happens when there are CIs that do not follow from the Markov condition. For those CIs, non-trivial constraints among some parameters of the Conditional Probability Distributions (CPDs) must hold. When such a constraint is defined over parameters of different CPDs, we prove that IC is also violated unless the parameters have a simple description. To understand which non-Markovian CIs are permitted we define a new condition closely related to IC: the Independence from Product Constraints (IPC). The condition reflects that CIs might be the result of specific parameterizations of individual CPDs but not from constraints on parameters of different CPDs. In that sense it is more restrictive than IC: parameters may have a simple description. On the other hand, IC also excludes other forms of algorithmic dependencies between CPDs. Finally, we prove that on top of the CIs permitted by the Markov condition (faithfulness), IPC allows non-minimality, deterministic relations and what we called proportional CPDs. These are the only cases in which a CI follows from a specific parameterization of a single CPD.
Adaptive signal processing in medical ultrasound beamforming

For over thirty years adaptive beamforming (AB) algorithms have been applied in RADAR and SONAR signal processing. Higher resolution and contrast is attainable using those algorithms at the price of an increased computational load. In this paper we consider four beamformers (BFs): Frost BF, Duvall BF, SSB, and SPOC. These algorithms are well know in the RADAR/SONAR literature. We have performed a series of simulations using ultrasound data to test the performance of those algorithms and compare them to the conventional, data independent, beamforming. Every algorithm was applied on single channel ultrasonic data that was generated using Field II. For a 32 element linear array operating at 5 MHz, beamplot results show that while the Duvall and SSB beamformers reduce sidelobes by roughly 20 dB, the sidelobes using the Frost algorithm rise by 23dB. The -6dB resolution is improved by 38%, 83%, and 43% in the case of Duvall, Frost, and SSB algorithms, respectively. In the case of SPOC, the beamplot shows a super-resolution peak with noise floor at -110 dB. Similar results were obtained for an array consisting of 64 elements.
On properties of rate-reliability-distortion functions

Some important properties of the rate-reliability-distortion function of discrete memoryless source (DMS) are established. For the binary source and Hamming distortion measure this function is derived and analyzed. Even that elementary case suffices to show the nonconvexity of the rate-reliability-distortion function in the reliability (error exponent) argument.
Prosodically-conditioned Sibilant Voicing in Balkan Judeo-Spanish

A balanced current amplifier mirrors either a fully differential or single ended input signal into common output circuits in a manner to generate a fully differential output signal without any d.c. bias. Input signal nodes are maintained at a desired voltage by circuit elements other than those of the current mirror circuits, thus freeing the current mirroring elements from having to be sized for this purpose. The sizes of the output transistors are adjustable in order to set the gain of the circuit. In addition to amplifier circuits, a full-wave rectifier, a comparator, and a filter, all operating with current signals, are described. A single circuit module may include all of these circuits with a user provided the capability to program the module to perform any one or more of these functions.
Boolean Combinations of Implicit Functions for Model Clipping in Computer-Assisted Surgical Planning

This paper proposes an interactive method of model clipping for computer-assisted surgical planning. The model is separated by a data filter that is defined by the implicit function of the clipping path. Being interactive to surgeons, the clipping path that is composed of the plane widgets can be manually repositioned along the desirable presurgical path, which means that surgeons can produce any accurate shape of the clipped model. The implicit function is acquired through a recursive algorithm based on the Boolean combinations (including Boolean union and Boolean intersection) of a series of plane widgets’ implicit functions. The algorithm is evaluated as highly efficient because the best time performance of the algorithm is linear, which applies to most of the cases in the computer-assisted surgical planning. Based on the above stated algorithm, a user-friendly module named SmartModelClip is developed on the basis of Slicer platform and VTK. A number of arbitrary clipping paths have been tested. Experimental results of presurgical planning for three types of Le Fort fractures and for tumor removal demonstrate the high reliability and efficiency of our recursive algorithm and robustness of the module.
Speaker adaptation using regression classes generated by phonetic decision tree-based successive state splitting

In this paper, we propose a new generation of regression classes for MLLR speaker adaptation method using the PDT-SSS algorithm so as to represent the characteristic of speaker effectively. This method extends the state splitting through clustering the context components of adaptation data into a tree structure. It enables to autonomously control a number of adaptation parameters (mean, variance) depending on the context information and the amount of adaptation utterances from a new speaker. Through the experiments, the phone and word recognition rates with adaptation have an average 34~37%, 9% higher accuracy than the speaker-independent acoustic models, respectively. The experimental results of Korean phone and word recognition confirmed the significant performance increase in small adaptation utterances compared with without any speaker adaptation.
Analysis of Insecticide Resistance-Related Genes of the Carmine Spider Mite Tetranychus cinnabarinus Based on a De Novo Assembled Transcriptome

The carmine spider mite (CSM), Tetranychus cinnabarinus, is an important pest mite in agriculture, because it can develop insecticide resistance easily. To gain valuable gene information and molecular basis for the future insecticide resistance study of CSM, the first transcriptome analysis of CSM was conducted. A total of 45,016 contigs and 25,519 unigenes were generated from the de novo transcriptome assembly, and 15,167 unigenes were annotated via BLAST querying against current databases, including nr, SwissProt, the Clusters of Orthologous Groups (COGs), Kyoto Encyclopedia of Genes and Genomes (KEGG) and Gene Ontology (GO). Aligning the transcript to Tetranychus urticae genome, the 19255 (75.45%) of the transcripts had significant (e-value <10−5) matches to T. urticae DNA genome, 19111 sequences matched to T. urticae proteome with an average protein length coverage of 42.55%. Core Eukaryotic Genes Mapping Approach (CEGMA) analysis identified 435 core eukaryotic genes (CEGs) in the CSM dataset corresponding to 95% coverage. Ten gene categories that relate to insecticide resistance in arthropod were generated from CSM transcriptome, including 53 P450-, 22 GSTs-, 23 CarEs-, 1 AChE-, 7 GluCls-, 9 nAChRs-, 8 GABA receptor-, 1 sodium channel-, 6 ATPase- and 12 Cyt b genes. We developed significant molecular resources for T. cinnabarinus putatively involved in insecticide resistance. The transcriptome assembly analysis will significantly facilitate our study on the mechanism of adapting environmental stress (including insecticide) in CSM at the molecular level, and will be very important for developing new control strategies against this pest mite.
Changes in Central Catecholaminergic Neurons in the Spontaneously (Genetic) Hypertensive Rat

Catecholamines and catecholamine-synthesizing enzymes have been examined in specific brain areas during the development of spontaneously (genetic) hypertensive (SH) rats. Changes in catecholamine metabolism were localized to regions of the brain implicated in the regulation of blood pressure. Norepinephrine levels and dopamine-β-hydroxylase (DBH) activities were decreased in specific nuclei of the hypothalamus and in the nucleus interstitialis striae terminalis ventralis, in both young and adult rats. The decrease in the formation of norepinephrine can result in a reduced activation of central α-adrenergic receptors which may be related causally to the onset of hypertension. The activity of the epinephrine-forming enzyme, phenylethanolamine-A+—methyltransferase (PNMT), was increased in the A, and A2 areas of the brainstem in young SH rats, but it was normal in adult hypertensive animals. These results implicate adrenergic neurons in the brainstem and noradrenergic neurons in the hypothalamus in the development of spontaneous (genetic) hypertension in rats.
DPS - dynamic parallel schedules

Dynamic Parallel Schedules (DPS) is a high-level framework for developing parallel applications on distributed memory computers (e.g. clusters of PCs). Its model relies on compositional customizable split-compute-merge graphs of operations (directed acyclic flow graphs). The graphs and the mapping of operations to processing nodes are specified dynamically at runtime. DPS applications are pipelined and multithreaded by construction, ensuring a maximal overlap of computations and communications. DPS applications can call parallel services exposed by other DPS applications, enabling the creation of reusable parallel components. The DPS framework relies on a C++ class library. Thanks to its dynamic nature, DPS offers new perspectives for the creation and deployment of parallel applications running on server clusters.
Proving Flow Security of Sequential Logic via Automatically-Synthesized Relational Invariants

Due to the proliferation of reprogrammable hardware, core designs built from modules drawn from a variety of sources execute with direct access to critical system resources. Expressing guarantees that such modules satisfy, in particular the dynamic conditions under which they release information about their unbounded streams of inputs, and automatically proving that they satisfy such guarantees, is an open and critical problem. ,,To address these challenges, we propose a domain-specific language, named STREAMS, for expressing information-flow policies with declassification over unbounded input streams. We also introduce a novel algorithm, named SIMAREL, that given a core design C and STREAMS policy P, automatically proves or falsifies that C satisfies P. The key technical insight behind the design of SIMAREL is a novel algorithm for efficiently synthesizing relational invariants over pairs of circuit executions. ,,We expressed expected behavior of cores designed independently for research and production as STREAMS policies and used SIMAREL to check if each core satisfies its policy. SIMAREL proved that half of the cores satisfied expected behavior, but found unexpected information leaks in six open-source designs: an Ethernet controller, a flash memory controller, an SD-card storage manager, a robotics controller, a digital-signal processing (DSP) module, and a debugging interface.
1 Self-Similar Blow-Up in Quasilinear Parabolic Equations

We discuss a new approach for the numerical computation of self-similar blow-up solutions of certain nonlinear partial differential equations. These solutions become unbounded in finite time at a single point at which there is a growing and increasingly narrow peak. Our main focus is on a quasilinear parabolic problem in one space dimension, but our approach can also be applied to other problems featuring blow-up solutions. For the model we consider here, the problem of the computation of the self-similar solution profile reduces to a nonlinear, second-order ordinary differential equation on an unbounded domain, which is given in implicit form. We demonstrate that a transformation of the independent variable to the interval [0, 1] yields a singular problem which facilitates a stable numerical solution. To this end, we implemented a collocation code which is designed especially for implicit second order problems. This approach is compared with the numerical solution by standard methods from the literature and by well-established numerical solvers for ODEs. It turns out that the new solution method compares favorably with previous approaches in its stability and efficiency. Finally, we comment on the applicability of our method to other classes of nonlinear PDEs with blow-up solutions.
Unsupervised Argument Identification for Semantic Role Labeling

The task of Semantic Role Labeling (SRL) is often divided into two sub-tasks: verb argument identification, and argument classification. Current SRL algorithms show lower results on the identification sub-task. Moreover, most SRL algorithms are supervised, relying on large amounts of manually created data. In this paper we present an unsupervised algorithm for identifying verb arguments, where the only type of annotation required is POS tagging. The algorithm makes use of a fully unsupervised syntactic parser, using its output in order to detect clauses and gather candidate argument collocation statistics. We evaluate our algorithm on PropBank10, achieving a precision of 56%, as opposed to 47% of a strong baseline. We also obtain an 8% increase in precision for a Spanish corpus. This is the first paper that tackles unsupervised verb argument identification without using manually encoded rules or extensive lexical or syntactic resources.
Reasoning about Concurrent Execution Prioritized Interrupts, and Exogenous Actions in the Situation Calculus

As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a programming language is presented and illustrated with a detailed example. The language includes facilities for prioritizing the concurrent execution, interrupting the execution when certain conditions become true, and dealing with exogenous actions. The language differs from other procedural formalisms for concurrency in that the initial state can be incompletely specified and the primitive actions can be user-defined by axioms in the situation calculus.