Miracle-dz/UniFAR-FTUs huggingface dataset:
On Teaching Method

The theory of teaching is becoming scienclization under the pattern of science.It gives birth to teaching-method.From the philosophy of teaching-method,it is technology that is denoted by its purpose and its procedure.The aim is to operate on teaching and its belief is what its procedure is able to guarantee its purpose.In fact,teaching-method has an internality paradox and an externality paradox.The practice of teaching-method shows that the paradoxes exist.The internality paradox is represented between the procedure and the purpose which is to cultivate individual;the externality paradox is manifested between the teaching-method which is simple and its object which is complex.So we must de-structure the teaching-method from life-world,because every one lives and shapes in life-world.In life-world,one communicates other,and communication is basic way of life,so dialogue is a basic mechanism as teaching way in systemlized classroom.
A new application of random matrices: Ext(C^*_{red}(F_2)) is not a group

In the process of developing the theory of free probability and free entropy, Voiculescu introduced in 1991 a random matrix model for a free semicircular system. Since then, random matrices have played a key role in von Neumann algebra theory (cf. [V8], [V9]). The main result of this paper is the following extension of Voiculescui¯s random matrix result: Let (X(n) 1 , . , X(n) r ) be a system of r stochastically independent n i? n Gaussian self-adjoint random matrices as in Voiculescui¯s random matrix paper [V4], and let (x1, . . . , xr) be a semi-circular system in a C. -probability space. Then for every polynomial p in r noncommuting variables lim niaeiApX(n) 1 (¥o), . , X(n) r (¥o) = p(x1, . . . , xr), for almost all ¥o in the underlying probability space. We use the result to show that the Ext-invariant for the reduced C. -algebra of the free group on 2 generators is not a group but only a semi-group. This problem has been open since Anderson in 1978 found the first example of a C. -algebra A for which Ext(A) is not a group.
New Lexical Entries for Unknown Words

The following paper presents an approach for simulating the acquisition of new lexical entries for unknown words, an issue that is central to natural language processing since no lexicon can ever be complete. Acquisition involves two main tasks. First, the appropriate information about an unknown word in a given linguistic context (i.e. sentence) is identified. It is shown that this task requires new general considerations about shared information in unificationbased representations. Second, the collected information is formulated in a new lexical entry according to a comprehensive theory of the lexicon which defines the form of lexical entries and the relations between them. This task is solved by a general algorithm that depends only on the form of the collected information and is independent of the content, i.e. treats all unknown words in the same way.
Spectrum sharing networks with imperfect channel state information

Cognitive Radio (CR) systems utilizes the underutilized spectrum in two ways i.e. overlay and underlay mode. In overlay CR, a secondary user (SU) opportunistically access primary user's spectrum when it is unused as decided based on spectrum sensing. In contrast, a SU in underlay CR system accesses the spectrum at any time as long as the interfering power received at a primary receiver is below a certain limit. For use in underlay a SU needs to control its transmit power based on channel state information (CSI) between its transmitter and primary receiver. Furthermore a cognitive relay helps to improve the performance of SU The present paper discusses the research challenges associated with underlay CR system. The imperfection associated with CSI and its impact on performance of SU is discussed. Schemes of selection of cognitive relay in underlay are discussed. Some interesting performance results based on our work are also presented. The results show the effects of imperfect CSI and primary network on the performance of SU.
SIGACT news complexity theory column 34

This issue's guest columnists are angels. The column was faced with a last-minute cancellation, and they prepared on very short notice a wonderful column. And I'm sure that many readers of the column will want to learn even more by, for example, reading their monograph <i>Complexity Classifications of Boolean Constraint Satisfaction Problems</i> [7]. Future complexity columns include Holzer/McKenzie on a familiar complexity class turning up in a surprising context, Gasarch (and a host of contributors) on the future of NP, Schaeffer/Umans on completeness for higher levels of the polynomial hierarchy, Nickelsen/Tantau on partial information classes, and Paturi on the complexity of <i>k</i>-SAT,Regarding the Schaeffer/Umans column, their 2-part column will be in part a kind of Garey and Johnson for completeness results for ∑<inf><i>i</i></inf><sup><i>p</i></sup> and π<inf><i>i</i></inf><sup><i>p</i></sup>, <i>i</i> ≥ 2. You can help their project by, if you have proven natural sets complete for NP<sup>NP</sup>, coNP<sup>NP</sup>, NP<sup>NP<sup>NP</sup></sup>, coNP<sup>NP<sup>NP</sup></sup>, etc., letting them (MSchaefer@cti.depaul.edu and umans@microsoft.com) know of your result and its best citation location. Thanks!
Stanford at TAC KBP 2016: Sealing Pipeline Leaks and Understanding Chinese

We describe Stanford’s entries in the TAC KBP 2016 Cold Start Slot Filling and Knowledge Base Population challenge. Our biggest contribution is an entirely new Chinese entity detection and relation extraction system for the new Chinese and cross-lingual relation extraction tracks. This new system consists of several ruled-based relation extractors and a distantly supervised extractor. We also analyze errors produced by our existing mature English KBP system, which leads to several ﬁxes, notably improvements to our patterns-based extractor and neural network model, support for nested mentions and inferred relations. Stanford’s 2016 English, Chinese and cross-lingual submissions achieved an over-all (macro-averaged LDC-MEAN) F1 of 22.0, 14.2, and 11.2 respectively on the 2016 evaluation data, performing well above the median entries, at 7.5, 13.2 and 8.3 respectively.
UOY: A Hypergraph Model For Word Sense Induction \& Disambiguation

This paper is an outcome of ongoing research and presents an unsupervised method for automatic word sense induction (WSI) and disambiguation (WSD). The induction algorithm is based on modeling the cooccurrences of two or more words using hypergraphs. WSI takes place by detecting high-density components in the cooccurrence hypergraphs. WSD assigns to each induced cluster a score equal to the sum of weights of its hyperedges found in the local context of the target word. Our system participates in SemEval-2007 word sense induction and discrimination task.
Measurement of the baryonic acoustic oscillation scale in 21 cm intensity fluctuations during the reionization era

It has recently been suggested that the power spectrum of redshifted 21 cm fluctuations could be used to measure the scale of baryonic acoustic oscillations (BAOs) during the reionization era. The resulting measurements are potentially as precise as those offered by the next generation of galaxy redshift surveys at lower redshift. However, unlike galaxy redshift surveys, which in the linear regime are subject to a scale-independent galaxy bias, the growth of ionized regions during reionization is thought to introduce a strongly scale-dependent relationship between the 21 cm and mass power spectra. We use a seminumerical model for reionization to assess the impact of ionized regions on the precision and accuracy with which the BAO scale could be measured using redshifted 21 cm observations. For a model in which reionization is completed at z∼ 6, we find that the constraints on the BAO scale are not systematically biased at z≳ 6.5. In this scenario, and assuming the sensitivity attainable with a low-frequency array comprising 10 times the collecting area of the Murchison Widefield Array, the BAO scale could be measured to within 1.5 per cent in the range 6.5 ≲z≲ 7.5.
An Attention-Based Model of Learning a Function and a Category in Parallel

Minda and Ross (2004) described two experiments where subjects simultaneously learned both a category and a function. They showed that when both tasks were performed in parallel on the same stimuli, the inductive bias on the categorization task–to focus on a single attribute–spread to the function learning task. Here, we present a new computational model of this phenomenon, using the ALCOVE model of categorization, a new model of function learning, and a hypothesis for their interaction: shared selective attention. The model parsimoniously succeeds in learning the category and function, then in accounting for human generalization patterns on conflicting transfer stimuli. The novel function-learning component of the model, extending previous work in mixture-of-experts approaches (Kalish, Lewandowsky, & Kruschke, 2004; Harris & Minda, 2005), is also introduced.
2016 Fifth International Conference on Recent Trends in Information Technology Pedestrian Detection for Driver Assistance Systems

— Pedestrian detection is an important key problem in Advanced Driver Assistance Systems (ADAS). Un-signalized pedestrian crossing zone are dangerous places, where pedestrians enter the lane suddenly. This is the main factor for most of the accidents. For that, this paper illustrates a machine learning approach for detecting the pedestrian zone and also to detect the pedestrians crossing in that zone. This is implemented by two different stages. In the first stage, the system checks for the presence of the pedestrian zone by combining the advantages of extended Center Symmetric – Local Binary Pattern (XCS-LBP) method and Adaptive Background Mixture Model for Foreground detection. Then it employs the Histograms of Oriented Gradient (HOG) for the most accurate set of features and Linear Support Vector Machine (LinSVM) to classify whether the pedestrians present or not. The reason why the Linear SVM classifier is selected is because SVM provides the high generalization capacity and classifies more effectively. In the second stage, it analyzes the pedestrian crossing event for detecting the pedestrians whom crossing the zone suddenly. This second stage is performed, only if there is a presence of pedestrian is detected in the input video frames. So in this system, it processes only the video frames which contain the pedestrians. Thus, this approach processes the input video frames more rapidly and attains higher detection rates.
Is Formal Employment Discouraged by the Provision of Free. Health Services to the Uninsured ? Evidence From a Natural Experiment in Mexico

This article analyzes whether the large scale provision of non-contributory health services encourages workers to move away from jobs that pay contributions to social security (formal employment). Using a difference-in-differences design, that exploits the variation generated by the municipal level roll-out of an intervention of this kind in Mexico, this paper finds that contemporaneous program exposure has no impact on the ratio of formal to total employed and that lagged exposure leads only to a small (0.78 percentage points) decrease. Two proxies of spillover effects further reveal that this estimate is robust and that the upper-bound of program effect is only moderately larger (1.5 percentage points).
Direct Measurements of Gas Bulk Flows in the Intracluster Medium of the Centaurus Cluster with the Chandra Satellite

We present the analysis of the velocity structure of the intracluster gas near the core of Abell 3526 obtained with two off-center Chandra observations, specifically designed to eliminate errors due to spatial variations of the instrumental gain. We detected a significant velocity gradient along the northeast-southwest direction, roughly perpendicular to the direction of the incoming subgroup Cen 45, in agreement with previous ASCA SIS measurements. The presence of gas bulk velocities is observed both with and without the inclusion of the Fe K line complex in the spectral fittings. The configuration and magnitude of the velocity gradient is consistent with near transonic circulatory motion, either bulk or eddylike. The velocity difference obtained using the best calibrated central regions of ACIS-S3 is found to be (2.4 ± 1.0) × 103 km s-1 for rectangular regions 2. ′4 × 3′ roughly diametrically opposed around the cluster's core. There are also indications of a high-velocity zone toward the southern region with similar magnitudes. The detection of velocity gradients is significant at >99.4% confidence, and simulations show that intrachip gain fluctuations >1800 km s-1 are required to explain the velocity gradient by chance. The measurements suggest that >1% of the total merger energy can still be bulk kinetic 0.4 Gyr after the merging event. This is the first direct confirmation of velocity gradients in the intracluster gas with independent instruments and indicates that strong departure from hydrostatic equilibrium is possible even for cool clusters that do not show obvious signs of merging.
Insecure "Provably Secure Network Coding" and Homomorphic Authentication Schemes for Network Coding

Network coding allows the routers to mix the received information before forwarding them to the next nodes. Though this information mixing has been proven to maximize network throughput, it also introduces security challenges such as pollution attacks. A malicious node could insert a malicious packet into the system and this corrupted packet will propagate more quickly than in traditional copy-and-forward networks. Several authors have studied secure network coding from both information theoretic and probabilistic viewpoints. In this paper, we show that there are serious flaws in several of these schemes (the security “proofs” for these schemes were presented in these publications). Furthermore, we will propose a secure homomorphic authentication scheme for network coding.
Fast Reconstruction of Piecewise Smooth Signals from Incoherent Projections

The Compressed Sensing framework aims to recover a sparse signal from a small set of projections onto random vec tors; the problem reduces to searching for a sparse approximationof this measurement vector. Conventional solutions involve linea r programming or greedy algorithms and can be computationally expensive.These techniques are generic, however, and assume no structure in the signal aside from sparsity. In this paper, we design an algorithm that enables fast recovery of piecewise smooth signals, sparse signals that have a distinct “connected tree” structure in the wavelet domain. Our Tree Matching Pursuit (TMP) algorithm significantly reduces the search space of the traditional Matching Pursuit greedy algorithm, resulting i n a substantial decrease in computational complexity for recovering piece wise smooth signals. An additional advantage of TMP is that it performs animplicit regularization to combat noise in the reconstruction. TMP al so applies to the more general case of “incoherent” measurement vector s.
to SOCS ’ 09 1 A depth-first approach to target-value search

In this paper, we consider how to improve the scalability and efficiency of target-value-path search on directed acyclic graphs. To this end, we introduce a depth-first heuristic search algorithm and a dynamic-programming method to compute the heuristic’s pattern database in linear (in the number of edges) time. We show the benefits of the new approach over previous work on this problem (Kuhn et al. 2008b).
Low-Level Carotid Baroreceptor Stimulation Suppresses Ventricular Arrhythmias during Acute Ischemia

Background The autonomic imbalance during acute ischemia is involved in the occurrence of life-threatening arrhythmias. Objective To investigate the effect of autonomic nervous system (ANS) modulation by low-level carotid baroreceptor stimulation (LL-CBS) on ventricular ischemia arrhythmias. Methods Anesthetized dogs were received either sham treatment (SHAM group, n = 10) or LL-CBS treatment (LL-CBS group, n = 10). The voltage lowering the blood pressure was used as the threshold for setting LL-CBS at 80% below the threshold. Treatment started 1 hour before left anterior descending coronary (LAD) occlusion, and continued until the end of experience. Ventricular effective refractory periods (ERP), monophasic action potential duration at 90% (APD90), ventricular arrhythmias, indices of heart rate variability, left stellate ganglion nerve activity (LSGNA) and infarct sizes were measured and analyzed. Results Ventricular ischemia resulted in an acute reduction of blood pressure, which was not significantly affected by LL-CBS. After 1 hour of LL-CBS, there was a progressive and significant increase in ERP, increase in APD90, and decrease in LSGNA vs the SHAM group (all P<0.05). LL-CBS apparently reduced premature ventricular contractions (PVC, 264±165 in the SHAM group vs 60±37 in the LL-CBS group; P<0.01) during LAD occlusion. Number of episodes of ventricular fibrillation (VF) was 8 in the Control group versus 3 in the LL-CBS group (80% versus 30%, P<0.05). LL-CBS obviously increased high frequency (HF) component (P<0.05) and decreased low frequency/high frequency ratio (P<0.05) compared with the SHAM group. Ischemic size was not affected by LL-CBS between the two groups. Conclusions LL-CBS reduced the occurrences of ventricular arrhythmias during acute ischemia without affecting blood pressure. The procedure was associated with changes of electrophysiological characteristics, nerve activity and heart rate variability. Therefore, LL-CBS may protect from ventricular arrhythmias during acute ischemic events by modulating ANS.
Versatile SAT-based Remapping for Standard Cells

The paper describes a versatile framework for optimizing a mapped netlist according to user-specified requirements to reduce a combination of area, delay, and power. A variety of delay models is supported. The framework is based on a SAT-based engine enumerating gate-level implementations of a node while using the node’s full flexibility in the network. The enumeration favors considering low-cost alternatives early in the process. Full flexibility at a node is constructed as a Boolean circuit representing a Boolean relation, which is sampled by recursive cofactoring using different variable orders. Each variable order can result in an 8-input truth table of a function at the node, compatible with the relation. The computation is made efficient by reusing minterm samples of the relations at different nodes.
Higher-Order Program Generation

This dissertation addresses the challenges of embedding programming languages, specializing generic programs to specific parameters, and generating specialized instances of programs directly as executable code. Our main tools are higher-order programming techniques and automatic program generation. It is our thesis that they synergize well in the development of customizable software. Recent research on domain-specific languages propose to embed them into existing general-purpose languages. Typed higher-order languages have proven especially useful as meta languages because they provide a rich infrastructure of higher-order functions, types, and modules. Furthermore, it has been observed that embedded programs can be restricted to those having simple types using a technique called “phantom types. ” We prove, using an idealized higher-order language, that such an embedding is sound (i.e., when all objectlanguage terms that can be embedded into the meta language are simply typed) and that it is complete (i.e., when all simply typed object-language terms can be embedded into the meta language). The soundness proof is shown by induction over meta-language terms using a Kripke logical relation. The completeness proof is shown by induction over object-language terms. Furthermore, we address the use of Haskell and Standard ML as meta-languages. Normalization functions, as embodied in type-directed partial evaluation, map a simplytyped higher-order value into a representation of its long beta-eta normal form. However, being dynamically typed, the original Scheme implementation of type-directed partial evaluation does not restrict input values to be typed at all. Furthermore, neither the original Scheme implementation nor the original Haskell implementation of type-directed partial evaluation guarantee that type-directed partial evaluation preserves types. We present three implementations of type-directed partial evaluation in Haskell culminating with a version that restricts the input to typed values and for which the proofs of type-preservation and normalization are automated. Partial evaluation provides a solution to the disproportion between general programs that can be executed in several contexts and their specialized counterparts that can be executed efficiently. However, stand-alone partial evaluation is usually too costly when a program must be specialized at run time. We introduce a collection of byte-code combinators for OCaml, a dialect of ML, that provides run-time code generation for OCaml programs. We apply these byte-code combinators in semantics-directed compilation for an imperative language and in run-time specialization using type-directed partial evaluation. Finally, we present an approach to compiling goal-directed programs, i.e., programs that
Experiments close to the beta-limit in W7-AS

A major objective of the experimental program in the last phase of the W7-AS stellarator was to explore and demonstrate the high-β performance of advanced stellarators. MHD-quiescent discharges at low impurity radiation levels with volume averaged β-values of up to ⟨β⟩ = 3.4% have been achieved. A very important prerequisite was the attainment of the high density H-Mode (HDH) regime. This was made possible by the installation of extensive graphite plasma facing components designed for island divertor operation. The co-directed neutral beam injection provided increased absorbed heating power of up to 3.2 MW in high-β plasmas with B ⩽ 1.25 T. The anticipated improved features concerning equilibrium and stability at high plasma β could be verified experimentally by the comparison of x-ray data with free boundary equilibrium calculations. The maximum β found in configurations with a rotational transform around is determined by the available heating power. No evidence of a stability limit has been found in the accessible configuration space, and the discharges are remarkably quiescent at maximum β, most likely due the increase of the magnetic well depth. An increase in low m/n MHD activity is typically observed during the transition towards high β. The beneficial stability properties of net-current-free configurations could be demonstrated by comparison with configurations where a significant inductive current drive was involved. Current driven instabilities such as tearing modes and soft disruptions can prevent access to β-values as high as in the currentless case. The experimental results indicate that optimized stellarators such as W7-X can be considered as a viable option for an attractive stellarator fusion reactor.
MAKESPAN MINIMIZATION ON IDENTICAL PARALLEL MACHINES SUBJECT TO MINIMUM TOTAL FLOW-TIME

ABSTRACT We consider the problem of scheduling n jobs on m identical parallel machines. An optimal schedule to the proposed problem is defined as one that gives the smallest makespan (the completion time of the last job on any one of the parallel machines) among the set of all schedules with optimal total flowtime (the sum of the completion times of all jobs). We propose two new simple heuristic algorithms and empirically compare their effectiveness and efficiency with several existing algorithms.