Miracle-dz/UniFAR-FTUs huggingface dataset:
CHINESE-MINING PREPROCESSING TECHNOLOGY BASED ON TEXT TRAIT OPTIMIZING

How to get the target text quickly becomes a technical limitation with the using of massive data. While obtaining the Chinese target information, the segmentation of the sentence is supposed to be the key according to research. To mine the segmentation of English text is relatively simple for the space is used as a interval, meanwhile the Chinese segmentation is much more difficult. So in this paper the reciprocal crossing segmentation algorithm and the trait-optimizing vector model are designed to improve the mining efficiency of Chinese information. Based on dictionary, an improved segmentation algorithm is adopted in text pretreatment processing, which is based on vector space module, to do experiments on the segmentation algorithm and to analyze the segmentation results. And that segmentation algorithm is already proved to be very effective in the text mining of text trait vector module.
Frame Information Transfer from English to Italian

We describe an automatic projection algorithm for transferring frame-semantic information from English to Italian texts as a first sep towards the creation of Italian FrameNet. Given an English text with frame information and its Italian translation, we project the annotation in four steps: first the Italian text is parsed, then English-Italian alignment is automatically carried out at word level, then we extract the semantic head for every annotated constituent on the English corpus side and finally we project annotation from English to Italian using aligned semantic heads as bridge. With our work, we point out typical features of the Italian language as regards frame-semantic annotation, in particular we describe peculiarities of Italian that at the moment make the projection task more difficult than in the above-mentioned examples. Besides, we created a gold standard with 987 manually annotated sentences to evaluate the algorithm.
The Medial Ganglionic Eminence Gives Rise to a Population of Early Neurons in the Developing Cerebral Cortex

During development of the neocortex, the marginal zone (layer I) and the subplate (layer VII) are the first layers to form from a primordial plexiform neoropil. The cortical plate (layers II–VI) is subsequently established between these superficial and deep components of the primordial plexiform neuropil. Neurons in the early zones are thought to play important roles in the formation of the cortex: the Cajal-Retzius cells of the marginal zone are instrumental in neuronal migration and laminar formation, and cells of the subplate are involved in the formation of cortical connections. Using the fluorescent tracer 1,1′-dioctodecyl-3,3,3′,3′-tetramethylindocarbocyanine (DiI), we have shown here that a substantial proportion of neurons of the marginal zone, including cells with features of Cajal-Retzius cells, and of the subplate and lower intermediate zone are not born in the ventricular neuroepithelium but instead originate in the medial ganglionic eminence (MGE), the pallidal primordium. These neurons follow a tangential migratory route to their positions in the developing cortex. They express the neurotransmitter GABA but seem to lack the calcium binding protein calretinin; some migrating cells found in the marginal zone express reelin. In addition, migrating cells express the LIM-homeobox gene Lhx6, a characteristic marker of the MGE. It is suggested that this gene uniquely or in combination with other transcription factors may be involved in the decision of MGE cells to differentiate in situ or migrate to the neocortex.
Stock Option Vesting Conditions, CEO Turnover, and Myopic Investment

Corporations have been criticized for providing executives with excessive incentives to focus on short-term performance. This paper shows that investment in short-term projects has beneficial effects in that it provides early feedback about Chief Executive Officer (CEO) talent, which leads to more efficient replacement decisions. Due to the threat of CEO turnover, the optimal design of stock option vesting conditions in executive compensation is more subtle than conventional views suggest. For example, I show that long vesting periods can backfire and induce excessive short-term investments. The study generates new empirical predictions regarding the determinants and impacts of stock option vesting terms in optimal contracting.
A Categorization of Benefits From IS/IT Investments

s the dependence of IS/IT has grown in modern organizations, IT investments have soared in the last couple of decades. Large amounts of money are spent with the hope that the investments will generate value for the business organizations using the systems. It is hence easy to understand the needs for methods to assess the business value of IT-investments. The investment decision is basically about selecting the best IT-system or the best combination of IT-systems, i.e. the system(s) that provides the most business value in dimensions that are important business-wise. However, a problem with many of the avail-able methods is that they often fail to concretely explain what technical characteristics the IT systems(s) should have to achieve the business value desired. A complicating aspect of IT-investment evaluations is also that the evaluations usually include a high degree of un-certainty. In this thesis, an IT investment evaluation method is presented that indicatively assesses the differences in contribution to business value from IT-investment alternatives. The method provides, at a relatively low cost of investigation, indications of not only the technical differences between the IT-investment alternatives in a specific investment situation, but also an assessment of the differences in types and amounts of their business value. The presented method has been applied in a large case study at an electric power company. Furthermore, it also incorporates concepts found within Enterprise architecture (EA), particularly in how the information used in the evaluation is collected. The presented thesis is a composite thesis that, besides an introduction, includes five papers (paper A-E). Paper A presents an outline of the method as well as its application in the case study. It also presents the theoretical fundaments for the criteria used for the technical evaluation and the business value assessment including the method’s applications in relation to Enterprise architecture. The following two papers primarily present necessary steps in the development of the method. First, paper B presents the process to develop a functional reference model (used for the functional assessments in the method), including its application in the case study. Second, a breakdown of the term business value into a set of IS/IT-affected value dimension is presented in paper C. The last two papers present the final steps, i.e. the technical evaluation of the investment alternatives (paper D) and the final business value assessment (paper E). The papers include the methods to perform these analyses as well as the application of the method in the case study and the results of the case study.
Vernacular Mathematics, Discourse Representation, and Arbitrary Objects

This paper discusses some of the issues that have to be addressed for a systematic treatment of vernacular mathematics. In vernacular proofs, variable letters are introduced and used in a way that does not conform to the usual interpretation offered for referring expressions in the formal semantics of natural language (Kamp and Reyle, 1993; Kamp, 1981; Heim, 1982; Groenendijk and Stokhof, 1990; Groenendijk and Stokhof, 1991; Heim, 1982), although such phenomena do appear to arise in everyday language. These phenomena must be addressed if we wish to use computer aided reasoning systems to check the informal correctness proofs of computer programs, for example. Fine has developed the formal machinery for modelling such uses of variable letters (Fine, 1985), but gives no systematic interpretation that allows us to produce a formal proof from a vernacular one mechanically. A tentative proposal is made as to how the representation of context could be enriched to account for these problematic examples.
Optimal prefix codes for some families of two-dimensional geometric distributions

Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q /spl isin/ (0,1). Optimal prefix codes are described for q = 1/2/sup k/ (k > 1) and q = 1/k/spl radic/2 (k > 0). The codes described differ from previously characterized cases related to the geometric distribution in that their corresponding trees are of unbounded width, and in that an infinite set of distinct optimal codes is required to cover any interval (0, /spl epsi/), /spl epsi/ > 0, of values of q.
Time reversal with post-equalization for OFDM without CP in massive MIMO

This paper studies the possibility of eliminating the redundant cyclic prefix (CP) of orthogonal frequency division multiplexing (OFDM) in massive multiple-input multiple-output systems. The absence of the CP increases the bandwidth efficiency at the expense of intersymbol interference (ISI) and intercarrier interference (ICI). It is known that in massive MIMO, different types of interference fade away as the number of base station (BS) antennas tends to infinity. In this paper, we investigate if the channel distortions in the absence of the CP are averaged out in the large antenna regime. To this end, we analytically study the performance of the conventional maximum ratio combining (MRC) and realize that there always remains some residual interference leading to saturation of signal to interference (SIR). This saturation of SIR is quantified through mathematical equations. Moreover, to resolve the saturation problem, we propose a technique based on time-reversal MRC with zero forcing multiuser detection (TR-ZF). Thus, the SIR of our proposed TR-ZF does not saturate and is a linear function of the number of BS antennas. We also show that TR-ZF only needs one OFDM demodulator per user irrespective of the number of BS antennas; reducing the BS signal processing complexity significantly. Finally, we corroborate our claims, as well as analytical results, through simulations.
A Multipath Routing Algorithm Based on Parametric Probability for Wireless Sensor Networks

In wireless sensor networks, energy is scarce resource such that its conservation and efficient use is a major issue. Therefore, a key goal of routing design in WSNs is to save energy and at the mean time increase the network lifetime. In this paper, we propose an on-demand multipath routing algorithm from the viewpoint of probability, named MRAP. The goal of MRAP is to balance the energy consumption among nodes and increase the network lifetime. In MRAP, different data generated at the same sensor node may pick up different transmission paths according to a probability that depends on various parameters, such as the hop distance from intermediate node to sink, or residual energy of intermediate node. Furthermore, the balance among multipath, based on the energy usage at neighbors, is considered in the selection of the path. Simulation results show that the MRAP algorithm has great potential in efficiently using the relay nodes and evenly distributed energy consumption.
Alpha matte estimation of natural images using local and global template correspondence

Natural image matting is an interesting and difficult problem of computer vision because of its under-constrained nature. It often requires a user interaction, a trimap, to aid the algorithm in identifying the initial definite foreground and background regions. Current techniques use local or global image statistics of these definite regions to estimate the alpha matte for the undefined region. In this paper we propose a novel non-parametric template correspondence approach to estimate the alpha matte. This technique alleviates the problem of previous parametric algorithms that rely solely on colour information and hence are unable to exploit the image structure to their advantage. The proposed technique uses global and local template correspondence, to the definite know regions, to construct the background and foreground layers. Once the foreground and background colours are estimated, the final alpha matte is computed. According to the quantitative analysis against the ground truth, the proposed algorithm outperforms the current state-of-the-art parametric matting techniques.
Accuracy Bugs

Parallel programming introduces notoriously difficult bugs, usually referred to as concurrency bugs. This article investigates the potential for deviating from the conventional wisdom of writing concurrency bug--free, parallel programs. It explores the benefit of accepting buggy but approximately correct parallel programs by leveraging the inherent tolerance of emerging parallel applications to inaccuracy in computations. Under algorithmic noise tolerance, a new class of concurrency bugs, accuracy bugs, degrade the accuracy of computation (often at acceptable levels) rather than causing catastrophic termination. This study demonstrates how embracing accuracy bugs affects the application output quality and performance and analyzes the impact on execution semantics.
Symbiotic evolutional models in multiagent systems

Multiagent systems with symbiotic learning and evolution (Masbiole) has been proposed as a new learning and evolutionary method for multiagent systems (MAS) recently, which is based on symbiotic phenomena among creatures. A symbiotic evolutional model of Masbiole is proposed using genetic network programming (GNP), which has been also proposed as one of the evolutionary computations. In the simulations, the proposal Masbiole is applied to the tile-world model and various characteristics of Masbiole have been clarified.
Integration of sound source localization and separation to improve Dialogue Management on a robot

To demonstrate the influence of an artificial audition system on speech recognition and dialogue management for a robot, this paper presents a case study involving soft coupling of ManyEars, a sound source localization, tracking and separation system, with the CSLU Dialogue Management system. Trials were conducted in a laboratory and a cafeteria. Results indicate that preprocessing of the audio signals by ManyEars improves speech recognition and dialogue management of the system, demonstrating the feasibility and the added flexibility provided by ManyEars for a robot to interact vocally with humans in a wide variety of contexts.
Advances in Learning Formal Languages

we present an overview in the advances related to the learning of formal languages i.e. development in the grammatical inference research. The problem of learning correct grammars for the unknown languages is known as grammatical inference. It is considered a main subject of inductive inference, and grammars are important representations to be investigated in machine learning from both theoretical and practical points of view. Application area of grammatical inference is increasing day by day, and it is still required to find a task where grammatical inference models have done much better than other machine learning or pattern recognition programs. However, it is known that making research in this area is a computationally hard problem. This paper mainly explores the area, its applications, various learning paradigms, the case of context-free grammars, challenges, recent trends etc., and cites the important literature on these.
An Automatic Power Estimation Methodology for FPGA-Based Digital Signal Processing Systems

With increasing design complexity of portable hand- held devices, decreasing system power and energy consumption has become a key design metric. It is crucial for the designers to accurately evaluate the system power consumption in detail during the development process, especially for the power hungry digital system processing (DSP) system. This paper presents an automatic power estimation methodology, which can provide accurate dynamic power consumption distributions of DSP com- ponents implemented on Xilinx FPGAs. Additionally, the de- pendences of power consumption on system level parameters, including clock frequency, area utilization ratio and activity rate, are investigated from sensitivity metric. According to the experi- mental results, several power optimizations can be performed at the early stages of design flow.
The “prince” technique: Fitts' law and selection using area cursors

In most GUIs, selection is effected by placing the point of the mouse-driven cursor over the area of the object to be selected. Fitts' law is commonly used to model such target acquisition, with the term A representing the amplitude, or distance, of the target from the cursor, and W the width of the target area. As the W term gets smaller, the index of difficulty of the task increases. The extreme case of this is when the target is a point. In this paper, we show that selection in such cases can be facilitated if the cursor is an area, rather than a point. Furthermore, we show that when the target is a point and the width of the cursor is W, that Fitts' law still holds. An experiment is presented and the implications of the technique are discussed for both 2D and 3D interfaces.
DoubleTake: Fast and Precise Error Detection via Evidence-Based Dynamic Analysis

Programs written in unsafe languages like C and C++ often suffer from errors like buffer overflows, dangling pointers, and memory leaks. Dynamic analysis tools like Valgrind can detect these errors, but their overhead — primarily due to the cost of instrumenting every memory read and write — makes them too heavyweight for use in deployed applications and makes testing with them painfully slow. The result is that much deployed software remains susceptible to these bugs, which are notoriously difficult to track down.This paper presents evidence-based dynamic analysis, an approach that enables these analyses while imposing minimal overhead (under 5%), making it practical for the first time to perform these analyses in deployed settings. The key insight of evidence-based dynamic analysis is that for a class of errors, it is possible to ensure that evidence that they happened at some point in the past remains for later detection. Evidence-based dynamic analysis allows execution to proceed at nearly full speed until the end of an epoch (e.g., a heavyweight system call). It then examines program state to check for evidence that an error occurred at some time during that epoch. If so, it rolls back execution and re-executes the code with instrumentation activated to pinpoint the error.We present DoubleTake, a prototype evidence-based dynamic analysis framework. DoubleTake is practical and easy to deploy, requiring neither custom hardware, compiler, nor operating system support. We demonstrate DoubleTake’s generality and efficiency by building dynamic analyses that find buffer overflows, memory use-after-free errors, and memory leaks. Our evaluation shows that DoubleTake is efficient, imposing under 5% overhead on average, making it the fastest such system to date. It is also precise: DoubleTake pinpoints the location of these errors to the exact line and memory addresses where they occur, providing valuable debugging information to programmers.
HAT-P-12b: A LOW-DENSITY SUB-SATURN MASS PLANET TRANSITING A METAL-POOR K DWARF

We report on the discovery of HAT-P-12b, a transiting extrasolar planet orbiting the moderately bright V ≈ 12.8 K4 dwarf GSC 03033 − 00706, with a period P = 3.2130598 ± 0.0000021 d, transit epoch Tc = 2454419.19556 ± 0.00020 (BJD), and transit duration 0.0974 ± 0.0006 d. The host star has a mass of 0.73 ± 0.02 M☉, radius of 0.70+0.02−0.01 R☉, effective temperature 4650 ± 60 K, and metallicity [Fe/H] = −0.29 ± 0.05. We find a slight correlation between the observed spectral line bisector spans and the radial velocity, so we consider, and rule out, various blend configurations including a blend with a background eclipsing binary, and hierarchical triple systems where the eclipsing body is a star or a planet. We conclude that a model consisting of a single star with a transiting planet best fits the observations, and show that a likely explanation for the apparent correlation is contamination from scattered moonlight. Based on this model, the planetary companion has a mass of 0.211 ± 0.012 MJ and radius of 0.959+0.029−0.021 RJ yielding a mean density of 0.295 ± 0.025 g cm−3. Comparing these observations with recent theoretical models, we find that HAT-P-12b is consistent with a ∼1–4.5 Gyr, mildly irradiated, H/He-dominated planet with a core mass MC ≲ 10 M⊕. HAT-P-12b is thus the least massive H/He-dominated gas giant planet found to date. This record was previously held by Saturn.
Adverse Childhood Experiences and Adult Depression: Resilience as a Moderator

Adverse childhood experiences (ACEs), such as childhood abuse and neglect, have been identified as salient risk factors for adult depression. However, not all individuals who experience ACEs go on to develop depression. To assess the extent to which resilienceor the ability to demonstrate stable levels of functioning despite adversitymoderates the association between ACEs and depression, 4,006 adult primary care patients completed self-report questionnaires on their childhood experiences and current depressive symptoms and resilience. Results indicated that resilience moderated the association between ACEs and depression, F(10, 3039) = 174.36, p < . 001, R = . 365. Specifically, the association between ACEs and depression was stronger among individuals with low resilience relative to those with high resilience. Findings have the potential to inform the development of a treatment program aimed to reduce symptoms of depression among primary care patients with a history of childhood adversity.
An Energy Efficient Predictive-Wakeup Tree-based Multi-Channel Protocol for WSNs

This paper introduces a PWTMCP (Predictive-Wakeup Tree-based Multi-Channel Protocol) which is a new pattern multi-channel protocol in combination with the traditional TMCP and duty cycling power control technology. Firstly, it divides the wireless sensor networks into several sub-trees based on the top of base station and allocates a channel to each sub-tree ,then information flows transmit along the corresponding sub-tree, which eliminates the interference between the tree and avoids the time synchronization problem. Secondly, it uses duty cycling mechanism, which makes the sender accurately predict the receiver’s wake up time, thereby reducing the energy consumption of sensor nodes. This paper also adopts the special prediction error correction mechanism that effectively addresses timing challenges such as unpredictable hardware and operating system delays and clock drift. Using prediction-based retransmission ensures the retransmission efficient. Finally, we compare the PWTMCP with the traditional TMCP in the aspect of energy consumption and efficiency of communication, in conclusion that PWTMCP performs better in the dense networks.