Miracle-dz/UniFAR-FTUs huggingface dataset:
Multivariate methods for the statistical analysis of hyperdimensional high-content screening data

hyperdimensional high-content screening data by Jonathan Rameseder Diplom-Ingenieur (FH) Upper Austria University of Applied Sciences (2008) Submitted to the Computational and Systems Biology Program in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY September 2014 c © Massachusetts Institute of Technology 2014. All rights reserved.
Sparse Matrix-Vector Multiplication on GPU

Sparse Matrix-Vector multiplication (SpMV) is one of the key operations in linear algebra. Overcoming thread divergence, load imbalance and un-coalesced and indirect memory access due to sparsity and irregularity are challenges to optimizing SpMV on GPUs. This dissertation develops solutions that address these challenges effectively. The first part of this dissertation focuses on a new blocked row-column (BRC) storage format with a two-dimensional blocking mechanism. It reduces thread divergence by reordering and blocking rows of the input matrix with nearly equal number of non-zero elements onto the same execution units (i.e., warps). BRC improves load balance by partitioning rows into blocks with a constant number of non-zeros such that different warps perform the same amount of work. We also present an approach to optimize BRC performance by judicious selection of block size based on sparsity characteristics of the matrix. Themost commonly used format for a sparsematrix is CSR (Compressed Sparse Row), but a number of other representations have recently been developed that achieve higher SpMV performance. However, the alternative representations typically impose a significant preprocessing overhead. While a high preprocessing overhead can be amortized for applications requiring many iterative invocations
Algorithms for synthesis and verification of timed circuits and systems

In order to increase performance, circuit designers are beginning to move away from traditional, synchronous designs based on static logic. Recent design examples have shown that significant performance gains are realized when aggressive circuit styles are used. Circuit correctness in these aggressive circuit styles is highly timing dependent, and in industry they are typically designed by hand. In order to automate the process of designing and verifying timed circuits, algorithms to explore the reachable state space of the circuit under the timing constraints are necessary. This dissertation presents a new specification method for timed circuits, timed event/level (TEL) structures, and new algorithms for exploring a timed state space. The TEL structure specification allows the designer to specify behavior controlled by signal transitions, which is best for representing sequencing, and behavior controlled by signal levels, which is best for representing gate level circuits. This dissertation also presents algorithms based on partially ordered sets (POSETs) that explores the timed state space of the TEL structure. Results using the new specification method and algorithms show orders of magnitude improvement over previous techniques in both speed and memory performance. The algorithms have also been successfully applied to several circuit examples from the recently published experimental Gigahertz processor developed at IBM. The speed and memory performance improvements of the algorithm allow automatic synthesis and verification of complex timed circuits, making them an attractive design alternative.
Burst error recovery method for VF arithmetic codes

Compressed data are sensitive to any errors because they will spread on decompression. In order to overcome this in the case of arithmetic codes, some variable-to-fixed length (VF) arithmetic codes with error detecting capabilities were proposed by Cho and Kohno (1998), but no paper, up to now, has discussed the joint coding of data compression and error correction. This paper proposes an l-burst error recovery method for VF arithmetic codes. It divides the compressed data into fixed length words and inserts the internal states of the decompressor as well as the check parts of the interleaved parity code and the cyclic code into each word.
On-demand multicast routing protocol based on node classification in MANET

一改善按需多点传送路由协议(ODMRP ) ，节点分类按需多点传送路由协议(NC-ODMRP ) ，它在活动特定的网络基于节点分类被建议。 NC-ODMRP 分类节点进象平常的节点的如此的三个范畴，提交组(FG ) 节点， FG 节点的邻居节点根据他们提交信息的历史。 范畴在节点在一张重量桌子边与不同重量被区分。 NC-ODMRP 在提交组的安装期间与最高的重量选择节点为一个 FG 节点，它由分享在不同发送者和接收装置对之间的更多的 FG 节点减少很多冗余的 FG 节点。 模拟结果证明 NC-ODMRP 能减少 ODMRP 的超过 20% FG 数字，当时，因此提高提交效率和 12% 精力消费效率的将近 14% 数据数字多点传送发送者是超过 5。
IDDM: Intrusion Detection Using Data Mining Techniques

Abstract : The IDDM project aims to determine the feasibility and effectiveness of data mining techniques in real-time intrusion detection and produce solutions for this purpose. Traditionally, data mining is designed to operate on large off-line data sets. Previous attempts to apply the discipline in real-time environments met with varying success. In this paper, we overview earlier attempts to employ data mining principles in intrusion detection and present a possible system architecture for this purpose. As a consequence, we show that by combining data mining algorithms with agent technologies, near real-time operation may be attained.
Teaching techniques for computer-mediated communication

This study identifies about 25 teaching techniques that have been used in computer-mediated communication (CMC) and analyzes the teachers' perceptions of teacher workload, student learning outcome, and recommendability. The research is conducted by literature reviews, a web questionnaire, e-mail interviews, and assignment analyses. The questionnaire yielded 150 responses from online teachers in 30 countries. About 40 interviews, primarily with teachers who highly recommended the actual techniques, were conducted and followed up with analyses of course assignments that the teachers made available via web or e-mail. The work is done within a theoretical framework for CMC-based teaching systems and their environments. The teaching system focuses on teachers, learners, course contents, learning resources, teaching methods, teaching techniques, and teaching devices. The system environment is discussed with regard to administrative constraints, demands, and choices. Special attention is given to choices regarding target groups, subject nature, enrollment scale, study location, communication mode, scheduling, and use of media. The framework has been applied to organize the literature review of teaching techniques and functions. An initial review of techniques described in adult education literature is followed by a comprehensive review of techniques applied in CMC courses. These techniques are organized as one-online, one-to-one, one-to-many, and many-to many techniques. Further, organizational, social, intellectual, and assessment functions for teachers are discussed and recommended facilitation techniques presented. The typical surveyed CMC teacher is a male in his forties with relatively little experience in CMC teaching. Further, nearly half of the teachers characterize themselves as key person. They teach small scale, higher education, credit courses, via standard Internet applications. The typical course is about computer and information sciences or about educational use of information technology, but a broad range of other subjects is available. It has asynchronous communication, fixed start date, and more than half of both course content and communication is provided via CMC. Individual pacing is used about as much as fixed pacing. Finally, the general perception found in the survey is that the techniques have high learning outcome, high recommendability, and high workload. The perception of workload varies, however, considerably with technique and context.
Basic study on rehabilitation training system using ER actuators

Robot and virtual reality technologies may be applied to rehabilitation training so that fewer human therapists are needed, training can be quantitatively evaluated for effectiveness, and training can be more enjoyable to patients. A training system to assist in rehabilitation can use robot or other virtual reality technologies, but it must be far safer than an ordinary industrial robot system. The authors have been studying actuators which are safe and easy to control, and have developed force display systems using such actuators. As an application of force display technology, they have developed a rehabilitation training system using ER actuators. The authors have also developed a computer program for the system which evaluates the physical capability of the upper limbs of patients and assists in their rehabilitation training. This paper is a summary of the basic experiments with the system as applied at a hospital to patients suffering from upper limb paralysis.
Comparative Analysis of a Wind Turbine’s Performances by Means of CFD Simulations

It is now possible to virtually assess performances and optimize the new wind turbines designs, due to the computer systems’ increased power and permanently development of the computational fluid analysis (CFD) software. There are various analysis methods, each with benefits and disadvantages. Generally, very accurate results mean a high consumption of computer resources and a significantly long period of calculus. This paper presents the results of the CFD simulation in case of a Savonius wind turbine. Two analyses are made by means of a commercial CFD software: first on a 2D model, and second on a 3D model. Even it is more pretentious from a computing resources point of view, the Shared Stress Transport theoretical model is used as it is more precise. All the results are compared with those from a real model tested in the wind tunnel. Final conclusions take into consideration the simulation time for both analysis and the closeness between the simulated and real results.
Linguistic constraints in hidden Markov model based speech recognition

A speaker-independent, continuous-speech, large-vocabulary speech recognition system, DECIPHER, has been developed. It provides state-of-the-art performance on the DARPA standard speaker-independent resource management training and testing materials. The approach is to integrate speech and linguistic knowledge into the HMM (hidden Markov model) framework. Performance improvements arising from detailed phonological modeling and from the incorporation of cross-word coarticulatory constraints are described. It is concluded that speech and linguistic knowledge sources can be used to improve the performance of HMM-based speech recognition systems provided that care is taken to incorporate these knowledge sources appropriately. <<ETX>>
A method for identifying crop diseases based on IAlexNet model

With the decrease of farmers and the urgent needs of agricultural modernization, deep learning becomes a novel and effective way to identify crop diseases in modern agriculture. For the problems about low accuracy and complexity of models, a light-weight disease recognition model based on AlexNet is proposed, which is called IAlexNet. The large convolution kernel is replaced by several small convolution kernels to reduce the network parameters, and the SE-Net is introduced to increase the weight of effective information. Besides, the dataset uses the pathological image datasets of apple leaves published on AI studio of the Paddlepaddle. The experiment results show that the recognition accuracy is 97.16%, which is 1.95% higher than AlexNet model. In addition, the parameters of IAlexNet model are reduced by 59.11%, and the training time is reduced by 20.33%, which is verify the new proposed model is feasible and effective.
Formal verification of implementations of Stateflow charts

Simulink diagrams are widely used in industry for specifying control systems, and a particular type of block used in them is a Stateflow chart. Often, the systems specified are safety-critical ones. Therefore, the issue of correctness of implementations of these systems is relevant. We are interested in the verification of implementations of Stateflow charts. In this thesis, we propose a formal model of Stateflow charts in the Circus notation. The proposed model makes a distinction between the general semantics of Stateflow charts and the specific aspects of each chart, and maintains the operational style used in the official informal description of the semantics of Stateflow. In this way, we support the comparison of our model to the informal description as an extra form of validation. Moreover, this separation allows us to obtain a translation from a Stateflow chart to a Circus model based mostly on the syntactic structure of the chart. We formalise in Z a translation strategy that supports the generation of the chart specific model which is composed with the model of the semantics of Stateflow charts to formalise the execution of the chart. The translation strategy is implemented in a tool that supports the automatic generation of the complete model of a chart. The style in which the translation strategy is specified supports a very direct implementation, thus, minimising this potential source of error. We identify an architecture of parallel implementations based on the sequential implementations automatically generated by a code generator, and propose a refinement strategy that applies the Circus refinement calculus to verify the correctness of the implementation with respect to the proposed formal model of Stateflow charts. The identification of the architecture allows us to specify the refinement strategy in a degree of detail that renders it suitable for formalisation in a tactical language, thus, potentially achieving a high degree of automation. Moreover, this strategy is a starting point for new strategies targeting different architectural patterns.
IMPLEMENTASI PENGENALAN WAJAH DENGAN METODE EIGENFACE PADA SISTEM ABSENSI

Sistem pengenalan wajah yang termasuk dalam bidang pengolahan citra dapat dipadukan dengan sistem absensi sehingga menjadi salah satu hal yang menarik untuk dilakukan, dimana nantinya sistem absensi juga dapat dilakukan dengan wajah. Proses pembuatan aplikasi absensi dengan pengenalan wajah ini menggunakan algoritma Eigenface yang terdapat pada OpenCv. Secara umum proses absensi menggunakan pengenalan wajah ini dilakukan dengan memasukkan data wajah terlebih dahulu beserta password dari masing-masing orang, setelah itu dilakukan proses pemindaian untuk proses absensi. Metode eigenface dari opencv ini mencari data wajah yang mendekati dengan data wajah yang ada di database. Pada pengujian penelitian ini hasil yang didapat berbeda-beda antara wajah satu dengan wajah yang lainnya, pada saat database berisi 10 data wajah, hasil rata-rata persentase kecocokan mencapai 88%, sedangkan pada saat database berjumlah 20 data wajah, hasil rata-rata persentase kecocokan mencapai 52%. Penyebab dari perbedaan hasil tersebut adalah karena faktor pencahayaan, jarak, bentuk wajah, serta jumlah data yang tersedia. Kata Kunci : Eigenface, OpenCv, Pengenalan Wajah.
A parallel distributed processing robotic system

This paper describes a real-time robotic system. It runs on a heterogeneous multiprocessor system and the system communicates with the robot via RS232 link or infrared link. The multiprocessing system is a IBM personal computer and a i860 add-on card. There are several tasks required for a high performance real-time robotics system: (1) An efficient decision-making task to fulfil the real-time requirement such as supervision, coordination and local control of the robot (2) A real-time graphics task to display the robot's location and its environment (3) A real-time alerting task to alert the system software to perform efficient recovery when the robot is not in its controlling environment (4) Other nonreal-time tasks such as auditing and scheduling (5) Tasks for communication between the robot and the host. In this paper, a multiprocessing distributed system is designed such that the tasks 1 to 4 is handled on the IBM, and the graphics display system is handled by the i860 because of its extremely good graphics performance. The software and hardware design for the system to have a good real-time performance is also discussed. <<ETX>>
New focused crawling algorithm

Focused carawling is a new research approach of search engine. It restricts information retrieval and provides search service in specific topic area. Focused crawling search algorithm is a key technique of focused crawler which directly affects the search quality. This paper first introduces several traditional topic-specific crawling algorithms, then an inverse link based topic-specific crawling algorithm is put forward. Comparison experiment proves that this algorithm has a good performance in recall, obviously better than traditional Breadth-First and Shark-Search algorithms. The experiment also proves that this algorithm has a good precision.
The zheng-seberry public key cryptosystem and signcryption

In 1993 Zheng-Seberry presented a public key cryptosystem that was considered efficient and secure in the sense of indistinguishability of encryptions (IND) against an adaptively chosen ciphertext adversary (CCA2). This thesis shows the Zheng-Seberry scheme is not secure as a CCA2 adversary can break the scheme in the sense of IND. In 1998 Cramer-Shoup presented a scheme that was secure against an IND-CCA2 adversary and whose proof relied only on standard assumptions. This thesis modifies this proof and applies it to a modified version of the El-Gamal scheme. This resulted in a provably secure scheme relying on the Random Oracle (RO) model, which is more efficient than the original Cramer-Shoup scheme. Although the RO model assumption is needed for security of this new El-Gamal variant, it only relies on it in a minimal way. In 1997 Zheng introduced a new notion called signcryption, a combination of signature and encryption. Zheng gave some details and properties of this new notion but did not include any formal definitions about the notions of security for a signcryption scheme. This thesis presents some formal notions of security for signcryption schemes, based on accepted notions of security for encryption and signature schemes. Three new signcryption schemes are presented that are based on provably secure encryption schemes. The security of these new schemes is presented in terms of the new notions of security for signcryption schemes. Strong arguments are made for the security of these new schemes, formal proofs are not given as that would be a bold claim for schemes based on such new theory. Some discussion is given about the possibilities of combining weak encryption with strong signatures to achieve stronger encryption. Intuitively the concept seems correct but proofs remain elusive. The idea of combining strong encryption and weak signatures is also discussed but appears less promising. Also, some minor properties of elliptic curves are given. The theorems most probably are not original, but have been rediscovered by the author. Where it was discovered that a theorem was previously known, it is referenced. The theorems presented, whilst interesting, are not significant contributions to the field.
The syntax-discourse interface: effects of the main-subordinate distinction on attention structure

The central claim of this thesis is that, unlike main clauses, adjunct subordinate clauses do not form independent processing units in the computation of entity-based topic continuity (attention structure) in discourse. This claim has two primary consequences. First, discourse entities in adjunct subordinate clauses are assigned lower salience than main clauses entities, especially subjects. Second, the process that selects antecedents for pronouns in main clauses is qualitatively different from the process of anaphoric interpretation in subordinate clauses. The former is affected by the mechanism responsible for directing attention in discourse. The latter depends heavily on verbs semantics and the effect of connectives. The claims of this thesis are empirically tested for English and Greek. Primary evidence for the low salience of entities in adjunct subordinate clauses comes from corpus studies, which show that entities in adjunct subordinate clauses (a) make poor competitors in the selection of antecedents for subject pronouns in main clauses, and (b) are unlikely to be referred to in the subsequent discourse with a pronoun (unless they are already old). Primary evidence for the two level anaphora resolution mechanism comes from psycholinguistic experiments designed to test if there is a consistent difference in the way we interpret pronouns in main and adjunct subordinate clauses. These findings form the basis for the specification of two new NLP models, a system for the automated evaluation of coherence in student essays and a two level anaphora resolution algorithm. They also make two significant contributions to the Centering Model, (a) Centering's “utterance” is formally defined on the basis of empirical evidence, and (b) Centering's Rough-Shift transition is for the first time validated as a reliable estimator of poor coherence, empirically tested on an operable essay scoring system.
Chapter XVIII Fostering Interactivity through Formative Peer Assessment in (Web-Based) Collaborative Learning Environments

Extant literature on collaborative learning shows that this instructional approach is widely used. In this chapter, the authors discuss the lack of alignment between collaborative learning and assessment practices. They will argue that peer assessment is a form of collaborative learning and a mode of assessment that perfectly fits the purpose of collaborative learning. As such, the authors purposefully depart from the more traditional application of assessment as a summative tool and advocate the consideration of formative peer assessment in collaborative learning. This shift towards formative assessment they believe has the potential to enhance learning. Their goal in this chapter is to review both shortcomings of current peer assessment practice as well as its potential for collaborative learning. Interactivity is central to foster the alignment between assessment and collaborative learning and the authors present a set of guidelines derived from research for increasing interactivity through formative peer assessment among peers in collaborative learning contexts.
Students’ Ability and Difficulties in Understanding English Text (A Study at English Program IAIN Padangsidimpuan)

This study deals with the ability of the students to understand English texts and types of their reading strategies. It is believed that reading strategies help students improve their reading comperehension. Based on this theory, then, the qualitative research was carried out to describe students’ reading ability and types of strategy they used. Data were collected through questionnaires that have been distributed to 34 students. They were also observed and tested. It was found that the students’ ability in understanding text was still low. They had many problems in understanding English texts because they did not apply appropriate reading strategies in their reading activities. Their low reading comprehension was due to their lack of reading strategies. Copyright © 2014 by Al-Ta'lim All right reserved
Databases in the 3rd Millennium: Trends and Research Directions

A database approach to data of arbitrary types has shown that the architecture of a universal database machine is restricting in a number of cases. There appear special-purpose data servers using now types of hardware devices. Data is moving toward the user, who exploits mobile devices equipped with database functionality. The goal of the paper is to present new trends in databases, particularly in their architectures and to show on cloud computing, data streams, mobile and embedded databases, and databases supporting Web.2. 0 some new ideas and possibilities of solution of associated problems. The other goal of the paper is also to point out on actual problems associated with database research.