Miracle-dz/UniFAR-FTUs huggingface dataset:
Japanese Unknown Word Identification by Character-based Chunking

We introduce a character-based chunking for unknown word identification in Japanese text. A major advantage of our method is an ability to detect low frequency unknown words of unrestricted character type patterns. The method is built upon SVM-based chunking, by use of character n-gram and surrounding context of n-best word segmentation candidates from statistical morphological analysis as features. It is applied to newspapers and patent texts, achieving 95% precision and 55-70% recall for newspapers and more than 85% precision for patent texts.
Doing Without Schema Hierarchies : A Recurrent Connectionist Approach to Routine Sequential Action and Its Pathologies

In everyday tasks, selecting actions in the proper sequence requires a continuously updated representation of temporal context. Many existing models address this problem by positing a hierarchy of processing units, mirroring the roughly hierarchical structure of naturalistic tasks themselves. Although intuitive, such an approach has led to a number of difficulties, including a reliance on overly rigid sequencing mechanisms and a limited ability to address both learning and context sensitivity in behavior. We consider here an alternative framework in which the representation of temporal context depends on learned, recurrent connections within a network that maps from environmental inputs to actions. Applying this approach to the specific, and in many ways prototypical, everyday task of coffee-making, we examine its ability to account for several central characteristics of normal and impaired human performance. The model learns to deal flexibly with a complex set of sequencing constraints, encoding contextual information at multiple time-scales within a single, distributed internal representation. Mildly degrading this context representation leads to errors resembling the everyday “slips of action” that normal individuals commit under distraction. More severe degradation leads to a pattern of disorganization resembling that observed in action disorganization syndrome, a variety of apraxia. Analysis of the model’s function yields novel, testable predictions relevant to both normal and apraxic performance. Taken together, the results indicate that recurrent connectionist models offer a useful framework for understanding routine sequential action.
Ontological Approach for Extracting and Structuring Information on the Web "

The World Wide Web has become an important medium for the dissemination of information related to a wide range of topics. The majority of human information is becoming available on the web very rapidly. In the medical domain, the number of documents related to healthcare is already large and continues to grow at an exponential rate. Most information on the web is buried inside HTML documents which are designed for human consumption. Restructuring information automatically into machine understandable form and making it available to web search agents would bring the web to its full potential. In this work we have downloaded a set of 100 diabetes-related websites, over 12000 HTML files, which have been carefully analyzed. Our intention is first to learn the general structure of these websites which would increase the efficiency of information extraction and structuring. Every website has a purpose mainly providing services or products (or both). Our study resulted in the construction of an ontology covering a set of general services and products that these websites offer. The main goal of such ontology is to provide guidance in the process of extracting and structuring information. We incorporated the Unified Medical Language System (UMLS) Semantic Net which serves as an upper level ontology for medicine. We used the MetaMap Transfer (MMTx) API developed by the US National Library of Medicine (NLM) for mapping text into concepts from the UMLS Semantic Net. Pinpointing concepts in web pages provides an efficient way to determine the attributes and therefore facilitates more efficient extraction and restructuring of information. This paper describes the first part of our work and findings.
Problem of diffraction on nonlinear dielectric layered structure. Generation of the third harmonic

The problem of diffraction of a plane electromagnetic wave on transverse non-homogeneous, isotropic, not magnetic, linearly polarized, nonlinear dielectric layer (Kerr-like nonlinearity) in resonant area of frequencies is considered. The analysis of a problem of diffraction on nonlinear layer taking into account the multiple frequencies generated in considered open nonlinear structure is carried out.
Prototyping Navigation in Web-Based Information Systems Using WebML

This paper describes an approach to prototyping navigation in web- based information systems. The WebML language is used as a tool for modeling navigation aspects of such applications. As the information systems are intended to support user tasks, proper navigation mechanisms are crucial to make the user access to information efficient. Our approach is intended to support prototyping of navigation as a mean for communicating design decisions and model evolution. It is based on extracting a state machine from the WebML hypertext model.
Integrate-and-fire and Hodgkin-Huxley models with current inputs

For the integrate-and-fire model and the Hodgkin-Huxley model, we consider how current inputs including α-wave and square-wave affect their outputs. Firstly the usual approximation is employed to approximate the models with current inputs which quantitatively reveals the difference between instantaneous and noninstantaneous (current) inputs. When the rising time of α-wave inputs is long or the ratio between the inhibitory and excitatory inputs is close to one, the usual approximation fails to approximate the α-wave inputs in the integrate-and-fire model. For the Hodgkin-Huxley model, the usual approximation in general gives an unsatisfying approximation. A novel approach based upon a superposition of `coloured' and `white' noise is then proposed to replace the usual approximation. Numerical results show that the novel approach substantially improves the approximation within widely physiologically reasonable regions of the rising time of α-wave inputs.
Analysis of Metadiscourse Markers in Academic Written Discourse Produced by Turkish Researchers.

This study aims at examining the frequency of interpersonal metadiscourse markers in academic written discourse and investigating the way Turkish writers use interpersonal metadiscourse, namely in MA dissertations from one major academic field; English language teaching (ELT). A corpus based research is applied by examining a total of 20 dissertations written recently by Turkish writers writing in a second language. The dissertations were searched for all these expressions and further analysis was made by examining three sections of dissertations -methodology, results, and discussion. In-depth analysis based on the use of interpersonal metadiscourse markers showed that while ‘hedges’, ‘empathics (boosters)’ and ‘attitude markers’ are all used by Turkish writers to a certain extent, ‘attitude markers’ are found to be the most frequent ones . On the other hand, with respect to the use of personal markers, differences were found among the writers. The analysis of dissertation sections revealed common results. Keywords: Metadiscourse; interpersonal metadiscourse markers; academic writing; second language acquisition; rhetoric
IMPLEMENTASI CROSS METHOD LATENT SEMANTIC ANALYSIS UNTUK MERINGKAS DOKUMEN BERITA BERBAHASA INDONESIA

Penelitian mengenai peringkasan teks secara otomatis sampai saat ini masih terus dilakukan dengan harapan hasil ringkasan yang dihasilkan oleh mesin dapat mendekati ringkasan yang dihasilkan oleh manusia. Salah satu metode yang digunakan untuk menghasilkan ringkasan dengan bantuan mesin adalah metode Latent Semantic Analysis (LSA) yang menerapkan konsep Singular Value Decomposition untuk pemilihan ringkasan yang dihasilkan, tetapi dari beberapa hasil pengujian yang telah dilakukan terhadap metode ini dapat diketahui bahwa tingkat akurasi dari ringkasan yang dihasilkan masih dapat ditingkatkan kembali. Cross Method Latent Semantic Analysis (CMLSA) merupakan pengembangan dari metode LSA yang dianggap dapat menghasilkan ringkasan dengan tingkat akurasi yang lebih tinggi dari metode LSA. Untuk menguji seberapa baik ringkasan yang dihasilkan maka dibuatlah simulator peringkas teks otomatis dengan menggunakan CMLSA sebagai metode peringkasan sedangkan teks yag digunakan sebagai masukan adalah teks berita yang diambil dari portal berita viva.co.id. Dari hasil penelitian ini dapat diketahui bahwa rata â€“ rata nilai performansi dari ringkasan yang dihasilkan dengan menggunakan metoede pengujian Precision, Recall dan F-Measure adalah nilai Precision sebesar 72,25%, nilai Recall sebesar 66,7% dan nilai F-Measure sebesar 69,6%, hasil ringkasan dengan menggunakan metode ini dengan akurasi ringkasan sebesar 69,6% dianggap cukup baik. Kata Kunci: cross method latent semantic analysis, TF-IDF, automatic text summarization, natural language processing. Â
Color image processing from the physical, psychological, and biological viewpoints

Color image processing is necessary in various academic fields, but each field approaches it differently, and often incorrectly. It should really be done in a way that is meaningful from the physical, psychological, or biological point of view. In this paper, I introduce the database SOCS, which is a tool to combine the physical and psychological viewpoints, and two recent researches, one on the illumination estimation relating to the physical viewpoint, and the other on the genetic polymorphism relating to the biological viewpoint.
High Speed Piezo Force Microscopy: Nanoscale and nanosecond direct observations of domain switching

High Speed Piezo Force Microscopy (HSPFM) is a new variation of Atomic Force Miroscopy (AFM) for direct nanoscale measurements of domain switching dynamics. Image acquisition is accelerated from several minutes for standard piezo force microscopy to as fast as a fraction of a second for HSPFM. Movies of consecutive images during in-situ domain switching therefore allow high spatial and temporal resolution, with less than 500 nanosecond poling per pixel achieved. The influence of individual defects on domain nucleation, growth mechanisms, switching speed, and switching energy are therefore uniquely apparent.
Real-time Architecture of Stereo Vision for Robot Eye

We present a vision system of high speed rectification and real time stereo matching fit for robots. It has a small hardware architecture so that it can be embedded in a large system at a low cost. It uses the global matching method and the parallel architecture to perform high quality and real time stereo matching. This system is based on a trellis form with a parallel optical axis and composed of pre and main processing modules. We implement the stereo chip on Xilinx FPGA with 60 processing elements that can obtain disparity range of 60 levels
Earnings Restatements and Differential Timeliness of Accounting Conservatism

We examine whether Basu's (1997) differential timeliness metric and the related C-Score metric are effective in detecting predictable differences in conservatism surrounding corrections of overstated earnings. Cross-sectional and time-series analyses, employing 2132 firms making restatements during 1999–2005, suggest Basu-based metrics capture variation in conservatism. Further, we find that increases in conservatism following restatements are contingent on improvements in corporate governance. Collectively, these results provide evidence of the usefulness of the Basu-based metrics in the restatement setting.
A Tracking Clock Recovery Receiver for 4 Gb / s Signaling Extended

We have previously described a design for a 4Gb/s signaling system that uses transmitter equalization to overcome the frequency-dependent attenuation due to skin effect in transmission lines. We present here experimental results from an implementation of this idea in 0.5 μ CMOS, showing the effectiveness of a simple transition-filter equalization technique. Our experimental chips use a tracking clock recovery receiver, in which a 21-phase clock is servoed to center every other clock on the center of the data “eye”. This method is contrasted with the oversampling method of clock recovery. Oversampling clock recovery has the advantage that it can reject jitter up to the lesser of the minimum transition frequency or the data clock frequency, but it introduces quantization jitter of ± 1/2 k of the bit cell, where k is the number of samples per cell. Tracking recovery gives better performance when there is little jitter above the cutoff frequency of the tracking control loop, avoids quantization jitter entirely, and allows transmitter encoding with much longer run-lengths. Electrical measurements in very high-speed signaling systems are quite difficult to perform with conventional instrumentation, particularly for on-chip signals; this paper describes our design for simple CMOS analog samplers that enable observation of on-chip signals.
A dynamic load balancing approach for solution adaptive finite element graph applications on distributed systems

Load balancing is the key to the efficient operation of distributed systems. To efficiently utilize computing resources provided by distributed systems, an underlying dynamic load balancing (DLB) scheme must address both heterogeneous and dynamic features of distributed systems. In this paper, a DLB scheme for solution adaptive finite element graph applications on distributed systems is proposed. Experiments show that by using the proposed distributed DLB scheme, the execution time and the number of process migration is close to using condensed binary tree load balancing (CBTLB) scheme which does not consider the dynamic nature and diverse platform of distributed systems.
Transcription and processing: multilayer controls of RNA biogenesis by the Hippo pathway

The Hippo pathway plays a critical role in organ size control and tumorigenesis. YAP (and also its homologue TAZ) is a transcription co‐activator that mediates the biological functions of the Hippo pathway. YAP activity is inhibited upon phosphorylation by the Lats kinases (reviewed in Yu & Guan, ). In a recent study in Cell, Mori et al ( ) uncover a new function of YAP in global microRNA (miRNA) biogenesis by the modulation of the Microprocessor machinery. The results also suggest that this novel YAP function may contribute to cell growth control and tumorigenesis.
A Theory for Record Linkage

Abstract A mathematical model is developed to provide a theoretical framework for a computer-oriented solution to the problem of recognizing those records in two files which represent identical persons, objects or events (said to be matched). A comparison is to be made between the recorded characteristics and values in two records (one from each file) and a decision made as to whether or not the members of the comparison-pair represent the same person or event, or whether there is insufficient evidence to justify either of these decisions at stipulated levels of error. These three decisions are referred to as link (A 1), a non-link (A 3), and a possible link (A 2). The first two decisions are called positive dispositions. The two types of error are defined as the error of the decision A 1 when the members of the comparison pair are in fact unmatched, and the error of the decision A 3 when the members of the comparison pair are, in fact matched. The probabilities of these errors are defined as and respecti.
Task scheduling

This article presents a new approach to the design of task scheduling algorithms, where system-theoretical methodologies are used throughout. The proposal implies a significant perspective shift with respect to mainstream design practices, but yields large payoffs in terms of simplicity, flexibility, solution uniformity for different problems, and possibility to formally assess the results also in the presence of unpredictable run-time situations. A complete implementation example is illustrated, together with various comparative tests, and a methodological treatise of the matter.
A More Multifactor Secure Authentication Scheme Based on Graphical Authentication

The Current authentication systems suffer from many drawbacks we generally use knowledge based technique e.g textual passwords. In this users choose a string (combination of letters numbers etc) from their known facts like birth day mobile number etc, which make textual passwords easy to break and vulnerable to dictionary based or brute force attacks because of the knowledge of some of the traits to other persons too, moreover the malicious person can also guess the password. Secondly, Inherence authentication like biometric requires hardware. Thirdly, ownership based authentication like cards etc also require hardware etc . Now Graphical Authentication mechanisms have been proposed but they are found vulnerable to shoulder surfing attacks. In this paper we propose a combined approach of graphic, knowledge based technique and also biometric form to make authentication system computationally secure.
Open Problems of the Lorentz Workshop \Enumeration Algorithms using Structure"

This is a collection of open problems presented at the Lorentz Workshop “Enumeration Algorithms using Structure” which took place at the Lorentz Center of the University of Leiden (The Netherlands), August 24 - 30, 2015. The workshop brought together researchers interested in various aspects of enumeration algorithms; in particular classical output-sensitive enumeration including output-polynomial and polynomial delay algorithms and the inputsensitive enumeration mainly dealing with exact exponential time enumeration algorithms and combinatorial bounds.
A Heuristic Approach to Fast NOVCA (Near Optimal Vertex Cover Algorithm)

This paper describes an extremely fast polynomial time algorithm, the NOVCA (Near Optimal Vertex Cover Algorithm) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E). NOVCA is based on the idea of (1) including the vertex having maximum degree in the vertex cover and (2) rendering the degree of a vertex to zero by including all its adjacent vertices. The three versions of algorithm, NOVCA-I, NOVCA-II, and NOVCA-random, have been developed. The results identifying bounds on the size of the minimum vertex cover as well as polynomial complexity of algorithm are given with experimental verification. Future research efforts will be directed at tuning the algorithm and providing proof for better approximation ratio with NOVCA compared to any available vertex cover algorithms.
Bandwidth provisioning for service overlay networks

In this paper we study the bandwidth provisioning problem for a service overlay network which buys bandwidth from the underlying network domains to provide end-to-end value-added QoS sensitive services such as VoIP and Video-on-Demand. A key problem in the SON deployment is the problem of bandwidth provisioning, which is critical to the cost recovery in deploying and operating value-added services over the SON. In this paper, we mathematically formulate the bandwidth provisioning problem, taking into account various factors such as SLA, service QoS, traffic demand distributions, and bandwidth costs. Analytical models and approximate solutions are developed for long-term static bandwidth provisioning. Numerical studies are also performed to illustrate the properties of the proposed solution and demonstrate the effect of traffic demand distributions and bandwidth costs on the bandwidth provisioning of a SON.
A Hyperbolic Model for Communication inLayered Parallel Processing

We introduce a model for communication costs in parallel processing environments, called the hyperbolic model, that generalizes two-parameter dedicated-link models in an analytically simple way. The communication system is modeled as a directed communication graph in which terminal nodes represent the application processes and internal nodes, called communication blocks (CBs), reeect the layered structure of the underlying communication architecture. A CB is characterized by a two-parameter hyperbolic function of the message size that represents the service time needed for processing the message. Rules are given for reducing a communication graph consisting of many CBs to an equivalent two-parameter form, while maintaining a good approximation for the service time. We demonstrate a tight t of the estimates of the cost of communication based on the model with actual measurements of the communication and synchronization time between end processes. We compare the hyperbolic model with other two-parameter models and, in appropriate limits, show its compatibility with the LogP model. Greek letter, symbol for micro d e \ceiling" symbols, meaning to round upwards to the nearest integer, see Eq. (1) \sum" symbol, see Eq. (8) ! \limit" symbol \binary associative operator" symbol iii List of Figures 1 Communication graph (CG) for three processes running on diierent workstations. Each terminal node (process) contains the list of messages it sends (node 1 sends m 1 to 2 and m 0 1 to 3, node 2 sends m 2 to 3, and node 3 sends m 3 to 2). Each edge is labeled with the list of messages that ow in that direction. 10 2 The total service time t(x; a, m, p) versus the continuous hyperbolic and linear functions (T(x; a, b) and l(x; a, b), respectively) used to approximate it (a = 1, m = 0.5 and p = 2). 3 The equivalence transformation for two serial interconnected independent CBs (right top) and dependent CBs 4 The equivalence transformation for two parallel interconnected dependent CBs (bottom left) and independent CBs 5 The equivalence transformation in the concurrent message processing case. : 20 6 Computing the estimated time for the message m 1 to be delivered to the process 4 by successive reductions of the communication 7 The communication graph for sending one message from process 1 to process 2. Observe that the CB L appears in the communication path only between communication network (CB C) and workstation communication block CB W. 29 8 a) …
Multi-Group Multi-Way Relaying: When Analog Network Coding Finds Its Transceive Beamforming

In this paper, we introduce non-regenerative multi-group multi-way relaying. A half-duplex non-regenerative multi-antenna relay station (RS) assists multiple communication groups. In each group, there are multiple nodes that want to communicate with each other. Each node has a message and wants to decode the messages only from other nodes in its group. The required number of communication phases for each group is equal to the number of nodes in the group. In the first phase, all nodes transmit simultaneously to the RS and in the following phases the RS applies transceive beamforming and transmits to all nodes. We derive the achievable sum rate of non-regenerative multi-group multi-way relaying for asymmetric and symmetric traffic and for two different cases, namely, with and without analog network coding (ANC). We specially design an ANC-aware transceive beamforming for non-regenerative multi-group multi-way relaying. The ANC-aware transceive beamforming is designed using two criteria, namely, matched filter (MF) and semidefinite relaxation (SDR) of a maximisation of minimum signal to noise ratio problem. From sum rate analysis, it is shown that applying ANC at the RS improves the performance. Regarding the ANC-aware transceive beamforming, the ANC-SDR outperforms ANC-MF at the cost of computational complexity and additional signaling from the nodes to the RS.