Miracle-dz/UniFAR-FTUs huggingface dataset:
Integrating Rules and Connectionism for Robust Reasoning

A connectionist model for robust reasoning, CONSYDERR, is proposed to account for some common reasoning patterns found in commonsense reasoning and to remedy the brittleness problem. A dual representational scheme is devised, which utilizes both localist representation and distributed representation with features. We explore the synergy resulted from the interaction between these two types of representations, which helps to deal with problems such as partial information, no exact match, property inheritance, rule interaction, etc. Because of this, the CONSYDERR system is capable of accounting for many diicult patterns in commonsense reasoning. This work also shows that connectionist models of reasoning are not just an \implementation" of their symbolic counterparts, but better computational models of common sense reasoning, taking into consideration of the approximate, evidential and adaptive nature of reasoning, and accounting for the spontaneity and parallelism in reasoning processes.
Caesar: A content router for high-speed forwarding on content names

Internet users are interested in content regardless of its location; however, the current client/server architecture still requires requests to be directed to a specific server. Information-centric networking (ICN) is a recent vein that relaxes this requirement through the use of name-based forwarding, where forwarding decisions are based on content names instead of IP addresses. Despite previous name-based forwarding strategies have been proposed, almost none have actually built a content router. To fill this gap, in this paper we design and prototype a content router called Caesar for high-speed forwarding on content names. Caesar introduces several innovative features, including (i) a longest-prefix matching algorithm based on a novel data structure called prefix Bloom filter; (ii) an incremental design which allows for easy integration with existing protocols and network equipment; (iii) a forwarding scheme where multiple line cards collaborate in a distributed fashion; and (iv) support for offloading packet processing to graphics processing units (GPUs). We build Caesar as an enterprise router, and show that every line card sustains up to 10 Gbps using a forwarding table with more than 10 million content prefixes. Distributed forwarding allows the forwarding table to grow even further, and to scale linearly with the number of line cards at the cost of only a few microseconds in the packet processing latency. GPU offloading, in turn, trades off a few milliseconds of latency for a large speedup in the forwarding rate.
Carbon balance of the oldest and most-shaded leaves in a vegetation: a litmus test for canopy models.

Canopy photosynthesis of terrestrial vegetation constitutes a major part of total global carbon uptake, and modelling this flux becomes increasingly important in global change research (Dewar et al., 2009). The C gain of vegetation is determined by its structural and physiological characteristics and includes, in essence, two features: the size of the canopy in terms of leaf area per unit soil area (LAI); and the photosynthetic rates of different canopy layers (Saeki, 1960). The latter is a declining function of canopy depth because leaves shade each other and because nitrogen (N), a key component of the photosynthetic machinery, is re-allocated to developing leaves higher up in the canopy. The C balance of leaves, shortly before being dropped from plants, provides an interesting test of vegetation C-gain models that combine both characteristics. In this issue of New Phytologist, Reich et al. (pp. 153–166) elegantly quantify the effects of leaf age and shading on leaf photosynthesis for 10 evergreen shrubs, and propose that plants drop their leaves when the daily net C gain (CLEAF(24)) of these leaves is no longer sufficient to provide the additional energy for the costs of the stem and root tissue that supports them.
Modeling knowledge logical organization with Intelligent Topic Map

Intelligent Topic Map we proposed extends the conventional topic map in structure and enhances the reasoning functions. It embodies the multi-level, multi-granularity and inherent relevant characteristics of knowledge, and establishes corresponding logical reasoning rules and grammar, then realizes knowledge representation and knowledge reasoning. With the Intelligent Topic Map as infrastructure, we present a new model of knowledge logical organization. It lays the foundation for high-quality knowledge value added services in the field of education. Furthermore, we introduce the working mechanism of knowledge logical organization based on Intelligent Topic Map, and give a demonstration in the end.
Persistent Sodium Currents Participate in Fictive Locomotion Generation in Neonatal Mouse Spinal Cord

The persistent sodium current (INa(P)) has been implicated in the regulation of synaptic integration, intrinsic membrane properties, and rhythm generation in many types of neurons. We characterized INa(P) in commissural interneurons (CINs) in the neonatal (postnatal days 0–3) mouse spinal cord; it is activated at subthreshold potentials, inactivates slowly, and can be blocked by low concentrations of riluzole. The role of INa(P) in locomotor pattern generation was examined by applying riluzole during fictive locomotion induced by NMDA, serotonin, and dopamine or by stimulation of the cauda equina. Blockade of INa(P) has marginal effects on the locomotion frequency but progressively weakens the rhythmic firing and locomotor-related membrane oscillation of CINs and motoneurons (MNs) and the locomotor-like bursts in ventral roots, until the motor pattern ceases. Riluzole directly affects the intrinsic firing properties of CINs and MNs, reducing their ability to fire repetitively during tonic depolarizations and raising their spike threshold. At the same time, riluzole has little effects on the strength of spike-evoked synaptic transmission onto CINs and MNs. Our results suggest that INa(P) is essential for the generation of the locomotor pattern and acts in part by regulating the frequency of interneuron firing in the central pattern generator for locomotion.
Peer-to-Peer Multipoint Video Conferencing Using Layered Video

A new peer-to-peer architecture for multipoint video conferencing is presented. It targets end points with low bandwidth network connections (single video in and out), allowing them to create a multipoint conference without any additional networking and computing resources than what is needed for a point-to-point conference. The new architecture is based on use of layered video coding with two layers at the end points. It allows each conference participant to see any other participant at any given time under all multipoint configurations of any number of users with a caveat that some participants may have to receive only the base layer video. Layered encoding approaches usable within this architecture are described. A protocol for implementation of the new approach has been developed and simulated. Its performance is analyzed
Cell Surface Vimentin Is an Attachment Receptor for Enterovirus 71

ABSTRACT Enterovirus 71 (EV71) is a highly transmissible pathogenic agent that causes severe central nervous system diseases in infected infants and young children. Here, we reported that EV71 VP1 protein could bind to vimentin intermediate filaments expressed on the host cell surface. Soluble vimentin or an antibody against vimentin could inhibit the binding of EV71 to host cells. Accompanied with the reduction of vimentin expression on the cell surface, the binding of EV71 to cells was remarkably decreased. Further evidence showed that the N terminus of vimentin is responsible for the interaction between EV71 and vimentin. These results indicated that vimentin on the host cell surface may serve as an attachment site that mediated the initial binding and subsequently increased the infectivity of EV71. IMPORTANCE This study delivers important findings on the roles of vimentin filaments in relation to EV71 infection and provides information that not only improves our understanding of EV71 pathogenesis but also presents us with potentially new strategies for the treatment of diseases caused by EV71 infections.
Simultaneous PET/MR imaging: MR-based attenuation correction of local radiofrequency surface coils.

PURPOSE In simultaneous positron emission tomography/magnetic resonance (PET/MR) imaging, local receiver surface radiofrequency (RF) coils are positioned in the field-of-view (FOV) of the PET detector during PET/MR data acquisition and potentially attenuate the PET signal. For flexible body RF surface coils placed on top of the patient's body, MR-based attenuation correction (AC) is an unsolved problem since the RF coils are not inherently visible in MR images and their individual position in the FOV is patient specific and not known a priori. The aim of this work was to quantify the effect of local body RF coils used in the Biograph mMR hybrid PET/MR system on PET emission data and to present techniques for MR-based position determination of these specific local RF coils. METHODS Acquisitions of a homogeneous phantom were performed on a whole-body PET/MRI scanner. Two different PET emission scans were performed, with and without the local body matrix RF coil placed on the top of the phantom. For position determination of the coil, two methods were applied. First, cod liver oil capsules were attached to the surface of the coil and second, an ultrashort echo time (UTE) sequence was used. PET images were reconstructed in five different ways: (1) PET reference scan without the coil, (2) PET scan with the coil, but omitting the coil in AC (PET/MR scanning conditions), (3) AC of the coil using a CT scan of the same phantom setup and registration via capsules, (4) same setup as 3, but registration was done using UTE images, neglecting the capsules, and (5) registration using the capsules, but the CT was performed with the coil placed flat on the CT table and the outer regions of the coil were cropped. The activity concentrations were then compared to the reference scan. For clinical evaluation of the concept, the presented methods were also evaluated on a patient. RESULTS The oil capsules were visible in the MR and CT images and image registration was straightforward. The UTE images show only parts of the coil's plastic housing and image registration was more difficult. The overall loss of true counts due to the presence of the surface coil is 4.7%. However, a spatially dependent analysis shows larger deviation (10%-15% attenuation) of the activity concentration in the top part of the phantom close to the coil. When accounting for the RF coil for PET AC, attenuation due to the RF coil could mostly be corrected. These results of the phantom studies were confirmed by the patient measurements. CONCLUSIONS Disregarding local coils in PET AC can lead to a bias of the AC PET images that is regional dependent. The closer the analyzed region is located to the coil, the higher the bias. Cod liver oil capsules or the UTE sequence can be used for RF coil position determination. The middle part of the examined RF coil hosting the preamplifiers and electronic components provides the highest attenuating part. Consequently, emphasis should be put on correcting for this portion of the RF coils with the suggested methods.
Efficient simulations of small shared memories on bounded degree networks

The problem of simulating a parallel random-access machine (PRAM) with n processors and memory size m>or=n on an n-node bounded degree network (BDN) is considered. Since many of the more efficient PRAM algorithms use an amount of shared memory not much larger than the number of processors, the case in which m=o(n/sup 1+ epsilon /) is considered, and a deterministic solution to the simulation problem is presented. For m=n(log n)/sup /O/sup (1)/ the running time of O(log n log log n) is within a factor of O(log log n) of the lower bound imposed by the diameter of the network. <<ETX>>
Closed loop control of soft switched KY step up converter

This paper presents a novel voltage gain enhanced KY step up converter with soft switching. A KY converter is a voltage step up converter which always operates in continuous conduction mode. To further improve the voltage gain a coupled inductor can be employed. Soft switching is applied for reducing the switching losses and it improves the efficiency of the converter. Simulation is done with 12V input voltage. The obtained output voltage is 72V, output current is 0.8A, and output power is 60W.
Multi-target tracking with merged measurements using labelled random finite sets

In real world multi-target tracking problems, the presence of merged measurements is a frequently occurring phenomenon, however, the vast majority of tracking algorithms in the literature assume that each target generates independent measurements. Allowing for the possibility of measurement merging increases the computational complexity of the multi-target tracking problem, and limited computing power has been a major factor in the dominance of algorithms that assume independent measurements. In the presence of merged measurements, these algorithms suffer from performance degradation, usually due to premature track termination. In this paper, we develop a principled Bayesian solution to this problem based on the theory of random finite sets (RFS), and a tractable implementation based on the recently proposed generalised labelled multi-Bernoulli (GLMB) filter. The performance of the proposed technique is demonstrated by simulation of a multi-target bearings-only tracking scenario, where measurements become merged due to finite resolution effects.
Improved performance of multi area load frequency control in power systems via MOR

The large-scale power systems are liable to performance deterioration due to the presence of sudden small load perturbations, parameter uncertainties, structural variations, etc. Due to this, modern control aspects are extremely important in load frequency control (LFC) design of power systems. In this paper, the LFC problem is illustrated as a typical disturbance rejection as well as large-scale system control problem. For this purpose, simple approach to LFC design for the power systems having parameter uncertainty and load disturbance is proposed. The approach is based on two-degree-of-freedom, internal model control (IMC) scheme, which unifies the concept of model-order reduction like Routh and Pade approximations, and modified IMC filter design, recently developed. The beauty of this paper is that in place of taking the full-order system for internal-model of IMC, a lower-order, i.e., second-order reduced system model, has been considered. This scheme achieves improved closed-loop system performance to counteract load disturbances. The proposed approach is simulated in MATLAB environment for a single-area power system consisting of single generating unit with a non-reheated turbine and due to its appreciable performance in a single area power system we have employed it to two area and four area power system. The effectiveness of the proposed controller is validated by applying a wide range of robustness and optimality.
A burst-mode receiver for 1.25-Gb/s ethernet PON with AGC and internally created reset signal

This paper presents a burst-mode receiver for 1.25-Gb/s Ethernet PON system using mixed-mode CMOS 0.18-/spl mu/m technology. With the modified cell-based AGC function and differential feed-forward topology, the receiver achieves sensitivity of -26.4 dBm, overload of -5.4 dBm, and a loud/soft ratio of 21 dB while keeping the low-voltage positive emitter-coupled logic (LVPECL) differential output level fully compliant with the ethernet passive optical network (EPON) standard. Unlike other burst-mode receivers, the design obtains fast response even without a reset signal from the network layer by creating a reset signal internally based on the incoming signal. This setting allows for simple system design. The overall architecture and several blocks are optimized in accordance with internal reset creation. Minimum guard time and preamble time are 250 and 50 ns, respectively; all timing parameters are better than the current EPON standard. The prototype contains all components on-chip that occupies 0.9/spl times/1.9 mm/sup 2/ and consumes 160 mA current from a 3.3-V supply.
Ask for Information Retrieval: Part I. Background and Theory

We report the results of a British Library Research and Development Department‐funded design study for an interactive information retrieval system which will determine structural representations of the anomalous states of knowledge (ASKs) underlying information needs, and attempt to resolve the anomalies through a variety of retrieval strategies performed on a database of documents represented in compatible structural formats. Part I discusses the background to the project and the theory underlying it, Part II (next issue) presents our methods, results and conclusions. Basic premises of the project were: that information needs are not in principle precisely specifiable; that it is possible to elicit problem statements from information system users from which representations of the ASK underlying the need can be derived; that there are classes of ASKs; and, that all elements of information retrieval systems ought to be based on the user's ASK. We have developed a relatively freeform interview technique for eliciting problem statements, and a statistical word co‐occurrence analysis for deriving network representations of the problem statements and abstracts. Structural characteristics of the representations have been used to determine classes of ASKs, and both ASK and information structures have been evaluated by, respectively, users and authors. Some results are: that interviewing appears to be a satisfactory technique for eliciting problem statements from which ASKs can be determined; that the statistical analysis produces structures which are generally appropriate both for documents and problem statements; that ASKs thus represented can be usefully classified according to their structural characteristics; and, that of thirty‐five subjects, only two had ASKs for which traditional ‘best match’ retrieval would be intuitively appropriate. The results of the design study indicate that at least some of our premises are reasonable, and that an ASK‐based information retrieval system is at least feasible.
The method of lines for the numerical solution of partial differential equations (abstract)

The numerical solution of time dependent nonlinear partial differential equations is a complicated and nontrivial process. Generally speaking, the solution of slightly different types of partial differential equations has required the development of separate and different computer programs. This situation for partial differential equations is in direct contrast to that for ordinary differential equations. Recently, sophisticated and reliable computer programs for the automatic solution of nonlinear systems of ordinary differential equations have become available. The use of the <u>method of lines</u> approach for solving partial differential equations is an attempt to take advantage of these recent significant developments for ordinary differential equations. In this presentation we will compare the advantages and disadvantages of this approach. We will describe how the method of lines approach for solving PDE's allows one to be able to develope very general purpose computer software for solving broad classes of problems. The structure and use of this software will be described. Finally, numerical results obtained with this general purpose software will be presented and discussed.
Crawling the client-side hidden web

There is a great amount of information on the web that can not be accessed by conventional crawler engines. This portion of the web is usually called hidden web data. To be able to deal with this problem, it is necessary to solve two tasks: crawling the client-side and crawling the server-side hidden web. In this paper we present an architecture and a set of related techniques for assessing the information placed in the client-side hidden web, dealing with aspects such as JavaScript technology, non-standard session maintenance mechanisms, client redirections, pop-up menus, etc. Our approach leverages current browser APIs and implements novel crawling models and algorithms.
Pitch adaptive training for hmm-based singing voice synthesis

A statistical parametric approach to singing voice synthesis based on hidden Markov Models (HMMs) has been growing in popularity over the last few years. The spectrum, excitation, vibrato, and duration of singing voices in this approach are simultaneously modeled with context-dependent HMMs and waveforms are generated from the HMMs themselves. HMM-based singing voice synthesis systems are heavily based on the training data in performance because these systems are “corpus-based. ” Therefore, HMMs corresponding to contextual factors that hardly ever appear in the training data cannot be well-trained. Pitch should especially be correctly covered since generated F 0 trajectories have a great impact on the subjective quality of synthesized singing voices. We applied the method of “speaker adaptive training” (SAT) to “pitch adaptive training,” which is discussed in this paper. This technique made it possible to normalize pitch based on musical notes in the training process. The experimental results demonstrated that the proposed technique could alleviate the data sparseness problem.
Performance bound analysis of analog circuits considering process variations

In this paper, we propose a new performance bound analysis of analog circuits considering process variations. We model the variations of component values as intervals measured from tested chip and manufacture processes. The new method applies a graph-based symbolic analysis and affine interval arithmetic to derive the variational transfer functions of analog circuits (linearized) with variational coefficients in forms of intervals. Then the frequency response bounds (maximum and minimum) are obtained by performing analysis of a finite number of transfer functions given by the Kharitonov's polynomial functions. We show that symbolic de-cancellation is critical for the affine interval analysis. The response bound given by the Kharitonov's functions are conservative given the correlations among coefficient intervals in transfer functions. Experimental results demonstrate the effectiveness of the proposed compared to the Monte Carlo method.
The RWTH Aachen Machine Translation System for WMT 2013

This paper describes the statistical machine translation (SMT) systems developed at RWTH Aachen University for the translation task of the ACL 2013 Eighth Workshop on Statistical Machine Translation (WMT 2013). We participated in the evaluation campaign for the French-English and German-English language pairs in both translation directions. Both hierarchical and phrase-based SMT systems are applied. A number of different techniques are evaluated, including hierarchical phrase reordering, translation model interpolation, domain adaptation techniques, weighted phrase extraction, word class language model, continuous space language model and system combination. By application of these methods we achieve considerable improvements over the respective baseline systems.