Miracle-dz/UniFAR-FTUs huggingface dataset:
A Fault-Tolerant Deadlock-Free Routing Algorithm in a Meshed Network

Since components faults occurring at arbitrary places (primarily on the links) affect seriously network performance and reliability, the multicomputers operating in harsh environments should be designed to guarantee normal networkmissions in presence of those faults. One solution to the end is a fault-tolerant routing scheme, which enables messages to safely reach their destinations avoiding failed links when transmission of messages is blocked by certain faults. In the paper, we develop a fault-tolerant routing algorithm with deadlock freedom in an n-dimensional meshed network, and validate its efficiency and effectiveness through proper simulations. The aspects of faulttolerance is adopted by appending partial-adaptiveness and detouring to the e-cube algorithm, while using a wormhole routing for the backbone routing method. The phenomenon of deadlock incurred due to its adaptiveness is eliminated by classifying a physical channel into a couple of virtual channels. key words: link faults, fault-tolerant routing, n-dimensional mesh, deadlock freedom, virtual channels
Answering Imprecise Structured Search Queries

Humans are increasingly becoming the primary consumer of structured data. As the volume and heterogeneity of data produced in the world increases, the existing paradigm of using an application layer to query and search for information in data is becoming infeasible. The human end-user is overwhelmed with a barrage of diverse query and data models. Due to the lack of familiarity with the data sources, search queries issued by the user are typically found to be imprecise. To solve this problem, this dissertation introduces the notion of a "queried unit", or qunit, which is the semantic unit of information returned in response to a user's search query. In a qunits-based system, the user comes in with an information need, and is guided to the qunit that is an appropriate response for that need. The qunits-based paradigm aids the user by systematically shrinking both the query and result spaces. On one end, the query space is reduced by enriching the user's imprecise information need. This is done by extracting information from the user during query input by providing schema and data suggestions. On the other end, the result space is reduced by modeling the structured data into a collection of qunits. This is done using qunit derivation methods that use various sources of information such as query logs. This dissertation describes the design and implementation of a autocompletion-style system that performs both query and result space reduction by interacting with the user in real time, providing suggestions and pruning candidate qunit results. It enables the user to search through databases without any knowledge of the data, schema or the query language.
Corpus pour la TA : types, tailles et problèmes associés, selon leur usage et le type de système

Les corpus utilises en TA de l’ecrit et de l’oral ont evolue, depuis les suites de test et les corpus d’essai des debuts, vers des corpus paralleles bilingues ou multilingues, bruts ou enrichis par des metadonnees et une grande variete d’annotations linguistiques. Ils sont assez petits et peuvent avoir une « granularite » importante en TA « experte », classique, mais sont enormes et de granularite faible en TA « empirique »,, statistique ou fondee sur les exemples. La representation des textes et l’interface avec le traitement de la parole posent des problemes specifiques, ainsi que la segmentation et la structuration des segments et des corpus. Un defi actuel est d’unifier et de mutualiser leur construction et leur gestion.
COMPETITIVE GOAL-SEEKING THROUGH EVOLUTIONARY?PROGRAMMING.

Abstract : The investigation was to examine various ways in which finite-state machines and related mathematical techniques can be used to increase the likelihood of successful game-playing. More specifically, evolutionary programming offers a means for modeling the 'strategy' of the opponent, thus permitting the improvement of play against an intelligent adversary. Mathematical experiments performed in computer simulation were used to demonstrate this capability. Additional experiments concerned pursuit/evasion games similar to those which arise in tactical situations. (Author)
Learner difference in independent language learning contexts

This contribution briefly discusses learner difference with respect to those learning outside the classroom, for all or part of their learning, whether through open or distance modes or as an integral part of a taught programme (referred to throughout as independent learners). It addresses aspects of interrelationships between variables, and investigates the implications for course writers and teachers.
Computing similarity between RNA secondary structures

The primary structure of a ribonucleic acid (RNA) molecule is a sequence of nucleotides (bases) over the four-letter alphabet {A,C,G,U}. The secondary structure of an RNA is a set of base-pairs (nucleotide pairs) which formed bonds between A-U and C-G. These bonds have been traditional assumed to be non-crossing in the secondary structure. This implies a tree representation of the secondary structure of RNA molecule. This paper considers several notions of similarity between two RNA molecule structures taking into account both the primary and the secondary structures. We consider a natural tree representation with both primary and secondary structure data. We present efficient algorithms for comparing such tree representation. We then show that some of these similarity notions can be used to solve the structure prediction problem when the structure of a closely related RNA is known.
Text-independent speaker identification using binary-pair partitioned neural networks

The N-way speaker identification task is partitioned into N*(N-1)/2 binary-pair classifications. The binary-pair classifications are performed with small neural nets, each trained to make independent binary decisions on small fragments of speech data. Three issues were investigated concerning optimally combining a large number of fragmentary binary decisions into a single N-way decision: (1) incorporating speech energy and phonetic content information to compute an improved probability measure at the individual speech frame level; (2) combining binary frame-level decisions into a binary segment-level decision; and (3) combining the binary segment-level decisions into a single N-way segment level decision. It was shown that the two-way classifiers can be combined to achieve 100% speaker identification performance for large speaker populations. <<ETX>>
Generation and load uncertainties incorporated in load flow studies

A fuzzy AC load flow model is presented in which fuzzy data are used to obtain possibility distributions of voltages, active and reactive flows and losses, currents, and generated powers. These distributions are compared with the ones obtained through a Monte Carlo based simulation in order to evaluate the errors inherent to the fuzzy AC load flow. <<ETX>>
Implementation of Persuasive Cued Click-Points Techniques for Folder Security using Secure Hash Algorithm

A typical computer user has passwords for many purposes: logging into accounts, retrieving e-mail, accessing applications, databases, networks, web sites, and even reading the morning newspaper online. Password provides security mechanism for authentication and services against unwanted access to resource. User often create memorable text password that are easy for attackers to guess, but strong–assigned password are difficult for user to remember. A graphical based password is one promising alternative of textual passwords. Cued click points is a click-based graphical password scheme, a cued-recall graphical password technique. This scheme use images instead of textual password as psychology studies have revealed that the human brain is better at recognizing and recalling images than text. In CCP users click on one point per image for a sequence of images. The next image is based on the previous click-point. User testing and analysis showed no evidence of patterns in ccp, so pattern-based attacks seem ineffective. Although result showed that Hotspots remain a problem. Hotspots[17]-[20] are areas of the images that have higher likelihood of being selected by user. By adding Persuasive feature to CCP, encourages users in selecting the password in random manner rather than using a particular sequence. This paper presents the design, implementation, and evaluation of a knowledgedge-based authentication mechanism that is of Persuasive cued click points (PCCP) password scheme with folder Cryptography. In this paper I have proposed a new hybrid graphical password based system, which is a combination of recognition and recall based techniques with the implementation of SHA(secure hash algorithm) Algorithm for encrypting the folder . It’s tough to encrypt the folder. Now a day any hacker can decrypt the folder security, but the SHA algorithm provides more security to folder. It will work for any Operating System. An important goal of the PCCP is to provide support to user in selecting better password thus increasing security by expanding password space. Keywords— Graphical passwords, hotspots, persuasive technology, usable security, folder security.
Linguistics and Aphasia: Psycholinguistic and Pragmatic Aspects of Intervention

General Editor's Preface Transcription conventions Part I: Background 1. Introduction 2. Aphasia - the clinical background Part II: Models and Methods 3. Applying linguistics in aphasia research and therapy 4. Psycholinguistic models, lexical processing 5. Psycholinguistic models, sentence processing 6. Pragmatics, theoretical issues 7. Coherence in discourse 8. The structure of conversation 9. Conversation as a collaborative achievement: some conversational management procedures Part III: Implications and Applications 10. Applying psycholinguistics to intervention: some preliminary considerations 11. Applying psycholinguistics to intervention: some clinical studies 12. Applying pragmatics in intervention 13. Contrast and complement: some concluding remarks References Index
Sentiment Analysis: An Overview from Linguistics

Sentiment analysis is a growing field at the intersection of linguistics and computer science that attempts to automatically determine the sentiment contained in text. Sentiment can be characterized as positive or negative evaluation expressed through language. Common applications of sentiment analysis include the automatic determination of whether a review posted online (of a movie, a book, or a consumer product) is positive or negative toward the item being reviewed. Sentiment analysis is now a common tool in the repertoire of social media analysis carried out by companies, marketers, and political analysts. Research on sentiment analysis extracts information from positive and negative words in text, from the context of those words, and from the linguistic structure of the text. This brief review examines in particular the contributions that linguistic knowledge can make to the task of automatically determining sentiment.
Approximating shortest paths in large networks

In the classroom students are introduced to shortest route calculation using small datasets (those that can be hand-drawn.) For demonstrating the application of an algorithm a small dataset is typically sufficient. However, real-world applications of shortest path calculations seem to be useful only when applied to large datasets. This paper presents research on a computer based implementation of a modified Dijkstra algorithm as applied to large datasets including tens of thousands of arcs. In an attempt to improve the performance of calculating paths two heuristics are also examined. The intuition behind the heuristics is to remove the arcs that will likely not be traversed by the optimal path from the set of arcs that can possibly be traversed by the optimal path. By reducing this number less labeling is required, resulting in fewer CPU cycles being used to generate a route. This paper compares the results of the optimal against those of the two heuristics.
Random-grid stereology applied to MR head scans

Fixed-grid 3D stereology uses a randomly placed 3D parallelepiped grid for sampling image space to generate test points. Though this is an efficient technique, the use of the fixed-grid introduces errors in the final estimate. Random-grid 3D stereology was introduced to improve the accuracy while maintaining a high efficiency (J.C. Rajapakse and K.K. Lee, 1998). The authors apply random-grid 3D stereology for volumetry of human brain and ventricles in MR head scans. They demonstrate superior efficiency and accuracy of random-grid stereology compared to fixed-grid stereology when applied to MR head scans. Also, the effects of grid sizes and the optimal directions of sectioning on volume estimates of the brain and ventricles are investigated.
Developing and validating thousands of executable finite state machines

In 1996, a project began at NASA's Kennedy Space Center to replace the legacy Launch Processing System with a state-of-the-art process control system called the Checkout and Launch Control System. Over 13 million lines of real time control software are being reengineered from a legacy language called Ground Operations Aerospace Language to a modern graphical programming language called ControlShell by Real Time Innovations. ControlShell combines a graphical language with a component-based design methodology. The ControlShell finite state machine component type is semantically similar to the statecharts of the Unified Modeling Language (UML). Thousands of executable finite state machines are being developed for the new launch system. The new system must deliver exceptionally reliable software to maintain safe operations and a high level of confidence by the end users. This paper discusses some of the development challenges of this project, the design approach, and the use of automated model checking for validation.
Research on High-Frequency Combination Coding-Based SSVEP-BCIs and Its Signal Processing Algorithms

This study presents a new steady-state visual evoked potential (SSVEP) paradigm for brain computer interface (BCI) systems. The new paradigm is High-Frequency Combination Coding-Based SSVEP (HFCC-SSVEP). The goal of this study is to increase the number of targets using fewer stimulation frequencies, with diminishing subject’s fatigue and reducing the risk of photosensitive epileptic seizures. This paper investigated the HFCC-SSVEP high-frequency response (beyond 25 Hz) for 3 frequencies (25 Hz, 33.33 Hz, and 40 Hz). HFCC-SSVEP produces with high stimulation frequencies through Time Series Combination Code. Furthermore, The Improved Hilbert-Huang Transform (IHHT) is adopted to extract time-frequency feature of the proposed SSVEP response. Lastly, the differentiation combination (DC) method is proposed to select the combination coding sequence in order to increase the recognition rate; as a result, IHHT algorithm and DC method for the proposed SSVEP paradigm in this study increase recognition efficiency so as to improve ITR and increase the stability of the BCI system. Furthermore, SSVEPs evoked by high-frequency stimuli (beyond 25 Hz) minimally diminish subject’s fatigue and prevent safety hazards linked to photo-induced epileptic seizures. This study tests five subjects in order to verify the feasibility of the proposed method.
Formal analysis of an online stock trading system by temporal Petri nets

Temporal Petri nets greatly enhance the modeling and analyzing power of Petri nets. The dynamic behavior of a given system and causality in events can be elegantly described by formulas containing temporal operators. We show how temporal Petri nets can be used for formal specification and verification of an online stock trading system. The functional correctness of the modeled system is formally analyzed by using the inference rules of temporal logic. Certain important properties of the temporal Petri net model are given. Finally; the further studying subjects are represented.
The combination of binaural processing with adaptive beamforming for dual microphones in speech communications

This paper proposes a new scheme to achieve both the array processing benefits and binaural listening benefits for many application fields of speech communications. In this proposed scheme, we mainly employ two adaptive spatial processing filters. These two adaptive spatial processing filters have the same reference signal which comes from two microphones but they have the different primary signals which correspond to the right microphone signal and the left microphone signal, respectively. Furthermore, these two adaptive spatial filters have the same structure and use the same adaptive algorithm. With this scheme, we can achieve better and more effective combination of binaural processing with spatial processing than some available schemes.
Source coding of stereoscopic television pictures

For the transmission of 3DTV (4:2:2 or HDTV), two solutions are conceivable. A separate 2D transmission channel could be used for each stereo channel or both stereo channels could be transmitted over one 2D channel. The second solution is definitely preferable, if the implied data reduction of the source signal by a factor of two can be realized without an essential impairment of the quality of the 3D picture. At the IRT, two basically different approaches to the problem of data reduction of 3DTV pictures (4:2:2 standard) were tried. One of the procedures under test was the separate coding of the stereoscopic channels. In the second approach, the disparities between left and right eye pictures were calculated and used to reconstruct the right eye picture at the receiver. In the article both methods are described in detail.
Quality-Driven Information Filtering- In the Context of Web-Based Information Systems

Web-based information systems, such as search engines, news portals, electronic markets and community sites, provide access to information originating from numerous information providers. The quality of provided information varies as information providers have different levels of knowledge and different intentions. Users of web-based systems are therefore confronted with the increasingly difficult task to select high quality information from the vast amount of Web-accessible information. How can information systems support users to distinguish high quality from low quality information? Which filtering mechanisms can be applied? How can filtering decisions be explained to the user? The book gives an overview about information quality assessment in context of web-based systems. Afterwards, a quality-driven information filtering framework is developed. The framework allows information consumers to apply a wide range of different filtering policies. In order to facilitate the information consumers' understanding of filtering decisions, the framework generates explanations why information satisfies a specific policy. The book targets Web developers who need to handle information quality problems within their applications as well as researchers working on the topic.
Teori dan Aplikasi Pengolahan Citra

Aplikasi pengolahan citra telah memberi sumbangan yang sangat berarti dalam berbagai aspek.Para perancang desain grafis telah merasakan betapa nikmatnya menggunakan software semacam Adobe Photoshop untuk mengerjakan berbagai tugas mereka. Pemakai Microsoft Word dapat memberikan ilustrasi gambar yang dipoles dengan teknik tertentu, misalnya memungkinkan gambar seolah-olah dibuat dengan goresan kapur. Robot seperti AIBO dapat membaca mimik si pemilik dan melakukan aksi menghibur.Mesin inspeksi mampu mendeteksi produk cacat. Perangkat presensi dapat mengenali sidik jari para mahasiswa yang akan mengikuti kuliah. Pintu pun terbuka setelah retina mata si pegawai dipindai oleh pembaca retina mata. Hal-hal tersebut menunjukkan beberapa contoh yang melibatkan pengolahan citra. Buku ini mengupas sejumlah pondasi dalam pengolahan citra hingga ke aplikasinya. Berbeda dengan buku lain yang umumnya hanya menekankan aspek teori, buku ini mengombinasikan teori dan praktik. Buku ini membahas berbagai rumus matematika sekaligus mewujudkannya ke dalam bentuk program. Dengan perkataan lain, buku ini menunjukkan bahwa rumus-rumus matematika yang kadang dirasa sulit dimengerti dapat diterjemahkan ke dalam program dengan cara mudah. Oleh karena itu, buku ini sangat berguna bagi mahasiswa Teknologi Informasi, Teknik Informatika, Teknik Elektro, atau jurusan lain yang sedang mengambil matakuliah Pengolahan Citra ataupun matakuliah lain yang memerlukan dasar pengolahan citra. Materi yang disampaikan tidak hanya terbatas pada pendekatan teori, tetapi sekaligus algoritma dan penyelesaian dalam bentuk program. Contoh program diwujudkan dengan menggunakan Octave. Octave adalah Free Software yang kompatibel dengan MATLAB.Perangkat lunak ini dapat diunduh secara gratis.Informasi pengunduhannya dapat dilihat di http://www.gnu. org/software/octave/download.html. Versi Octave yang digunakan untuk mengimplementasikan program adalah Octave 3.4. 3, sedangkan paket Image Processing yang digunakan adalah versi 1.0. 15.Paket ini dapat diunduh di http://octave.sourceforge. net/image/index.html.
Synthetic aperture radar target detection, feature extraction, and image formation techniques

This report presents new algorithms for target detection, feature extraction, and image formation with the synthetic aperture radar (SAR) technology. For target detection, we consider target detection with SAR and coherent subtraction. We also study how the image false alarm rates are related to the target template false alarm rates when target templates are used for target detection. For feature extraction from SAR images, we present a computationally efficient eigenstructure-based 2D-MODE algorithm for two-dimensional frequency estimation. For SAR image formation, we present a robust parametric data model for estimating high resolution range signatures of radar targets and for forming high resolution SAR images.
Research on Storage Strategy of Unstructured Small Files in HDFS

With the wide use of HDFS and increasing scale of small files, problems of HDFS in small files storage gradually exposed. Thus the article put forward a storage strategy of unstructured small file based on the type of file, and optimized the architecture of cluster to save memory and improve the efficiency of file access. Through experiment, the strategy is proved to be effective and reliable.
Proactive DSA application and implementation

Data authentication as provided by digital signatures is a well known technique for verifying data sent via untrusted network links. Recent work has extended digital signatures to allow jointly generated signatures using threshold techniques. In addition, new proactive mechanisms have been developed to protect the joint private key over long periods of time and to allow each of the parties involved to verify the actions of the other parties. In this paper, the authors describe an application in which proactive digital signature techniques are a particularly valuable tool. They describe the proactive DSA protocol and discuss the underlying software tools that they found valuable in developing an implementation. Finally, the authors briefly describe the protocol and note difficulties they experienced and continue to experience in implementing this complex cryptographic protocol.