Miracle-dz/UniFAR-FTUs huggingface dataset:
AquaBrowser Library: Search, Discover, Refine

Purpose – To describe a new online library catalog browser and interface AquaBrowser, developed specifically to enhance the experience of the library patron.Design/methodology/approach – A summary of the main features of the AquaBrowser search engine.Findings – This article provides an overview of AquaBrowser search engine: what it does, how it works, and its benefits.Originality/value – This paper is useful for information management professionals who want to provide an alternative search and display functionality to an online library catalogues.
Introduction to Digital Signal Processing and Filter Design

Preface. 1. Introduction. 1.1 Introduction. 1.2 Application of DSP. 1.3 Discrete-Time Signals. 1.4 History of Filter Design. 1.5 Analog and Digital Signal Processing. 1.6 Summary. Problems. References. 2. Time-Domain Analysis and z Transform. 2.1 A Linear, Time-Invariant System. 2.2 z Transform Theory. 2.3 Using z Transform to Solve Difference Equations. 2.4 Solving Difference Equations Using the Classical Method. 2.5 z Transform Method Revisited. 2.6 Convolution Revisited. 2.7 A Model from Other Models. 2.8 Stability. 2.9 Solution Using MATLAB Functions. 2.10 Summary. Problems. References. 3. Frequency-Domain Analysis. 3.1 Introduction. 3.2 Theory of Sampling. 3.3 DTFT and IDTFT. 3.4 DTFT of Unit Step Sequence. 3.5 Use of MATLAB to Compute DTFT. 3.6 DTFS and DFT. 3.7 Fast Fourier Transform. 3.8 Use of MATLAB to Compute DFT and IDFT. 3.9 Summary/ Problems. References. 4. Infinite Impulse Response Filters. 4.1 Introduction. 4.2 Magnitude Approximation of Analog Filters. 4.3 Analog Frequency Transformations. 4.4 Digital Filters. 4.5 Impulse-Invariant Transformation. 4.6 Bilinear Transformation. 4.7 Digital Spectral Transformation. 4.8 Allpass Filters. 4.9 IIR Filter Design Using MATLAB. 4.10 Yule-Walker Approximation. 4.11 Summary. Problems. References. 5. Finite Impulse Response Filters. 5.1 Introduction. 5.2 Linear Phase Fir Filters. 5.3 Fourier Series Method Modified by Windows. 5.4 Design of Windowed FIR Filter Using MATLAB. 5.5 Equiripple Linear Phase FIR Filters. 5.6 Design of Equiripple FIR Filters Using MATLAB. 5.7 Frequency Sampling Method. 5.8 Summary. Problems. References. 6. Filter Realizations. 6.1 Introduction. 6.2 FIR Filter Realizations. 6.3 IIR Filter Realizations. 6.4 Allpass Filters in Parallel. 6.5 Realization of FIR and IIR Filters Using MATLAB. 6.6 Summary. Problems. References. 7. Quantized Filter Analysis. 7.1 Introduction. 7.2 Filter Design-Analysis Tool. 7.3 Quantized Filter Analysis. 7.4 Binary Numbers and Arithmetic. 7.5 Quantization Analysis of IIR Filters. 7.6 Quantization Analyis of FIR Filters. 7.7 Summary. Problems. References. 8. Hardware Design Using DSP Chips. 8.1 Introduction. 8.2 Simulink and Real-Time Workshop. 8.3 Design Preliminaries. 8.4 Code Generation. 8.5 Code Composer Studio. 8.6 Simulator and Emulator. 8.7 Conclusion. References. 9. MATLAB Primer. 9.1 Introduction. 9.2 Signal Processing Toolbox. References. Index.
Efficient modeling techniques for IR drop analysis in ASIC designs

In this paper, we propose efficient modeling techniques for analyzing power distribution in deep submicron (DSM) ASIC designs. VCCS (Voltage Controlled Current Source) and equivalent conductance modeling techniques are the key concepts in our approach, which provide the same analysis results as the original resistive network with two orders of magnitude speedup. In addition, soft-macro power consumption modeling is proposed to enable the analysis at the floorplan stage. Experimental results show that the power distribution analysis based on the proposed modeling techniques at the floorplan stage yields less than 5% error compared to the post-layout power analysis.
MindShare : knowledge sharing via personalized views on a composite ontology

Ontologies, or ways of categorizing and describing things, have application to organizing information for human access and allowing software agents to exchange knowledge. The traditional approaches to ontology development involve dedicated effort by a small team of knowledge engineers in a slow and expensive process. We show that a composite ontology of information resources can be constructed from the personal ontologies of individuals in an organization via an ongoing process that combines normal personal organizing activites with low-impedence computer mediation. The MindShare approach is designed to facilitate this process within an organization of people who wish both to organize internal and public information for their personal benefit, and to leverage information previously discovered by others within the organization. MindShare software provides the user with an animated graphical ontology browser for organizing Web documents according to his or her personal ontology, and also for accessing the composite ontology as extensions of the personal ontology with an assisted bimodal browsing interface. The personal ontologies are mapped to the composite ontology by a process that includes MindShare term-based information retrieval methods to suggest existing topics when a user chooses to add a topic, and a variety of user interface affordances that encourage the user to add exposed pieces of the composite ontology to their personal ontology (and later build upon those pieces). We implemented the MindShare software and conducted an initial trial with a small group of users. The MindShare approach behaved as hoped, suggesting that the approach has promise and merits further investigation. Thesis supervisor: Henry Lieberman Title: Research Scientist, MIT Media Laboratory
Prediction of Generalization Ability in Learning Machines

Training a learning machine from examples is accomplished by minimizing a quantitative error measure, the training error defined over a training set. A low error on the training set does not, however, guarantee a low expected error on any future example presented to the learning machine--that is, a low generalization error. The main goal of the dissertation is to merge theory and practice: to develop theoretically based, but experimentally adapted tools that allow an accurate prediction of the generalization error of an arbitrarily complex classifier. This goal is reached through experimental and theoretical studies of the relationship between the training and generalization error for a variety of learning machines. The result is the introduction of a practical and principled method for predicting the generalization error. The power and accuracy of the predictive procedure is illustrated from application to real-life problems. Theoretical inspiration for the model arises from calculations of the expected difference between the training and generalization error for some simple learning machines. Novel computations of this character are included in the dissertation. Experimental studies yield experience with the performance ability of real-life classifiers, and result in new capacity measures for a set of classifiers. The dissertation also presents a new classification algorithm, the Soft Margin Classifier algorithm, for learning with errors on the training set. The algorithm is an extension of the Optimal Margin Classifier algorithm, and is consistently found to outperform its predecessor because it absorbs out-lying and erroneous patterns in flexible margins.
Effective library management: issues for managers and subordinates

The importance of effective management for a successful and productive organisation is stressed. Considers library and information services managers as having a centre stage role for leading their subordinates in the process of bringing an effective management and good work output for their organisations. Stresses the importance of managers and their subordinates working together through managerial roles and sharing a strategy for an effective management process. Points out self‐management, understanding individual’s behaviour, assertiveness, delegation, empowerment and good relationships as some aspects that could help to harness an effective management process to improve and strengthen productivity.
Performance analysis of wavelet-based MC-CDMA for FPLMTS/IMT-2000

This paper compares the performance of various multicarrier modulation (MCM) techniques with emphasis on the proposed wavelet-based multi-carrier CDMA (MC-CDMA) systems. With the all advantages of conventional MC-CDMA, wavelet-based MC-CDMA systems provide not only higher bandwidth efficiency than the conventional MC-CDMA systems, but new dimensions for anti-fading and interference immunity by a suitable choice of wavelet functions and wavelet frequency bands. From the results, wavelet-based MC-CDMA may be feasible for applications such as FPLMTS/IMT-2000 and mobile multimedia.
Corpus-Driven Cognitive Semantics. An introduction to the field

nouns (Eng.) counts sem Schmid 2000 Verbs of posture (Eng.) counts form Newman & Rice 2004a Concept of ANGER (Eng.) diach. counts sem Gevaert 2005 Verbs of eating (Eng.) counts form Newman & Rice 2006 Verbs of intention (Rus.) explor. HCA sem Divjak 2006 Verbs of attempting (Rus.) explor. HCA sem Divjak & Gries 2006 Verbs of becoming (Spanish) explor. MDS sem Bybee & Eddington 2006 Verbs of separation (Dch., Eng., Germ., Swed.) contr. explor. HCA sem Majd & Bowerman 2007 Verbs of cognition (Fin.) conf. LRA form Arppe 2009 Concepts POSITIVE, NEGATIVE (Hungarian) socio. explor. MCA sem Szelid & Geeraerts 2008 Verbs of starting (Eng., Rus.) contr. explor. HCA sem Divjak & Gries 2009 Verbs of reception (Dch.) diach. counts form Delorge 2009 Adverbs for ‘again’ (Mnd.) conf. CFA sem Jing-Schmidt & Gries 2009 Concepts HAPPY, SAD (Rus.) explor. HCA sem Janda & Solovyev 2009; in press Concepts LOVE, HATE (Pol.) contr. colloc. count form Dziwirek & Lewandowska 2009 Verbs of posture (Eng.) diach. colloc. count form Newman 2009 Terms for BOTHER (Eng.) socio. conf. LRA sem Glynn 2010 Terms for FOOTBALL (Port.) socio. conf. PBA sem Soares da Silva 2010 Verbs of causation (Dch.) socio. conf. LRA sem Speelman & Geeraerts 2010 Verbs come, go (Jap., Kor.) contr. counts sem Kabata & Lee 2010 Verbs of bothering (Eng.) socio. conf. MER sem Glynn in press a Verbs of cognition (Pol.) socio. conf. LRA sem Fabiszak et al. in press Verbs of causation (Dch.) socio. conf. MER form Levshina et al. in press Verbs of possibility (Eng., Fr.) contr. conf. LRA sem Deshors & Gries in press Concept LIBERTY (Eng.) socio. conf. LRA sem Glynn forthc. Lexical Semasiological Verb ask (Eng.) diach. counts sem Rudzka-Ostyn 1989 Verb need to (Eng.) socio. colloc. count sem Nokkonen 2006 Verb run (Eng.) explor. HCA sem Gries 2006a Verb, Noun hassle (Eng.) socio. explor. MCA sem Glynn 2009 Verb, Noun bother (Eng.) socio. conf. LRA sem Glynn this volume Adjective deep (Germ.) colloc. sem Zeschel this volume Verb annoy (Eng.) socio. explor. MCA sem Glynn submitted
PREVENTION AND REACTION BASED SECURE ROUTING IN MANETS

Mobile Ad hoc network can be set up anywhere, anytime without any predefined network infrastructure. Due to the infrastructure-less property, it becomes difficult to make use of the existing routing protocols for network services and it arises to a number of challenges in ensuring the security of the communication. Most of the ad hoc routing protocols that address security issues rely on trust relationships to route packets among participating nodes. These papers deal and analyze threats faced by ad hoc environments and provide corresponding security mechanisms. In this paper we present respective strengths and threats of the existing routing protocols and suggest an appropriate framework that can provide a trustful solution.
A Forgery Attack on Leaked-State Authenticated Encryption

The CAESAR competition is launched in 2013 which aims to find some authenticated encryption with good security and performance. Among these submissions, LAC is designed in a unique way with leaked-state structure. In this paper, based on birthday paradox,we find a forgery attack on LAC in nonce-misused case with time complexity 228. Moreover, we generalize the attack on normal version of leaked-state authenticated encryption and conclude some suggestions on how to use such structure. Keywords—CASESAR; LAC; birthday paradox; leaked-State authenticated encryption; forgery attack
A theoretical framework for knowledge management implementation

This paper outlines ongoing research in the area of knowledge management implementation strategies. An investigation of the literature reveals that when organisations initiate a knowledge management effort, most of them tend to over-emphasise the role of information technology at the expense of the human factor. A preliminary survey of local organisations using Duffy's Knowledge Management Benchmarking Questionnaire confirms these findings. This paper then proposes a framework that will address the shortcomings in current knowledge management implementation strategies. The framework consists of three main interlinked components: Knowledge Management of the Organisation, People, and Infrastructure and Processes. The framework focuses on the importance of aligning the knowledge management strategy of the organisation with the overall business strategy of the organisation. The culture and managing the culture change when implementing knowledge management are also dealt with. Furthermore, the framework recommends a holistic approach to managing knowledge.
Development of Reading Efficiency in First and Second Language.

Efficiency in basic reading processes can be discussed in terms of accuracy and speed. In this longitudinal study, the development of accurate and fast reading processes was studied in a group of 66 children learning to read simultaneously in English, their first language (L1), and Hebrew, their second language (L2). Children's speed and accuracy were compared in Grade 1 and Grade 2 on parallel L1 and L2 tasks of letter naming, reading isolated words and the same words in text. Results indicated that corresponding accuracy and speed across the two languages are highly correlated. Despite differences in language familiarity and different orthographies, accuracy and speed rates of isolated word reading in L1 and L2 were highly similar. Yet, in L1, children were more efficient (faster and more accurate) in reading text than isolated words, but in early stages of L2 reading acquisition, text reading was not more efficient than the reading of isolated words. In terms of efficiency components in L2 language, ac.
BIFAST-an algorithm for computing distance spectrum of trellis codes

Two efficient algorithms for evaluating the distance spectrum of trellis codes were recently published. The authors have constructed an efficient algorithm for computing the distance spectrum by combining the best features of the two. A comparison is made of the computational effort that these algorithms must make in order to produce the distance spectrum for a given distance. <<ETX>>
Czech WordNet 1.9 PDT

A slightly modified version of the Czech Wordnet. This is the version used to annotate "The Lexico-Semantic Annotation of PDT using Czech WordNet": http://hdl.handle. net/11858/00-097C-0000-0001-487A-4 The Czech WordNet was developed by the Centre of Natural Language Processing at the Faculty of Informatics, Masaryk University, Czech Republic. The Czech WordNet captures nouns, verbs, adjectives, and partly adverbs, and contains 23,094 word senses (synsets). 203 of these were created or modified by UFAL during correction of annotations. This version of WordNet was used to annotate word senses in PDT: http://hdl.handle. net/11858/00-097C-0000-0001-487A-4 A more recent version of Czech WordNet is distributed by ELRA: http://catalog.elra. info/product_info. php? products_id=1089
Delay-Sensitive Service Request Scheduling for Cloud Computing

OF THE DISSERTATION DELAY-SENSITIVE SERVICE REQUEST SCHEDULING FOR CLOUD COMPUTING by Shuo Liu Florida International University, 2014 Miami, Florida Professor Gang Quan, Major Professor Cloud computing realizes the long-held dream of converting computing capability into a type of utility. It has the potential to fundamentally change the landscape of the IT industry and our way of life. However, as cloud computing expanding substantially in both scale and scope, ensuring its sustainable growth is a critical problem. Service providers have long been suffering from high operational costs. Especially the costs associated with the skyrocketing power consumption of large data centers. In the meantime, while efficient power/energy utilization is indispensable for the sustainable growth of cloud computing, service providers must also satisfy a user’s quality of service (QoS) requirements. This problem becomes even more challenging considering the increasingly stringent power/energy and QoS constraints, as well as other factors such as the highly dynamic, heterogeneous, and distributed nature of the computing infrastructures, etc. In this dissertation, we study the problem of delay-sensitive cloud service scheduling for the sustainable development of cloud computing. We first focus our research on the development of scheduling methods for delay-sensitive cloud services on a single server with the goal of maximizing a service provider’s profit. We then extend our study to scheduling cloud services in distributed environments. In particular, we develop a queue-based model and derive efficient request dispatching and processing
PIM architectures to support petaflops level computation in the HTMT machine

The HTMT project is an ambitions attempt to combine a variety of emerging technologies into a petaflops-level computing system available many years before an equivalent machine can be built from current technologies. One of the key problems in such an architecture is overcoming latencies between the main memory and the high performance CPUs, which can grow to literally tens of thousands of cycles. In HTMT the approach taken to overcoming this is a multi-level memory system, with most of the levels to be fabricated using Processing-In-Memory (PIM) technologies in architectures which actively manage the flow of data without centralized CPU control. This paper overviews the current architecture for such chips within the context of the HTMT system, and how this architecture supports the expected execution model.
Discussion on “Two-Step Spectral Clustering Controlled Islanding Algorithm”

The authors of [1] present a fast controlled islanding algorithm to split a large-scale power system into islands for avoiding a large-area blackout. The work represents an interesting contribution. The proposed algorithm is based on the two-step spectral clustering, and employed to identify a suitable islanding solution that satisfies the constraint of generator coherency and presents a minimal power-flow disruption. We would greatly appreciate the authors' responses on the following issues.
Design and Development of a Landmines Removal Robot

Humanitarian demining is a calamity of war affecting many third world countries. Mines are cheap weapons, built to sustain horrible injuries that target active people with a knock-on effect upon economic growth. The clearing is time consuming and expensive. Clearing is an engineering duty and the humanitarian goal is a technical challenge. Advanced robotics fulfils this task cleanly and reliably on the condition that upgrades and cost are met, meaning that they lose third-world appropriateness. The challenge is to turn local machines and awareness into effective robotic aids, willingly used by the local people, and to enhance the on-going outcomes. The solution to the demining problem shall be a low cost robotic outfit with resort to nearby available resources and competences (e.g., drawn from the local agricultural machinery and know-how). This paper discusses an ongoing project that aims to develop a low-cost robot with intelligent remote-command abilities, as a cheap productivity upgrading, assembled from standard farming devices, through the shared know-how and commitment of locally involved operators. During the study, the authors have developed a low-cost robot capable of removing mines. The robot consists of modified agricultural components including its mobile carrier and the mine effector.
3D temperature mapping of turboshaft components using thermal paints and color recognition

In order to enhance turboshaft lifespan and increase thermal efficiency, aeronautical manufacturers have to optimize the temperature of engine components in operation. Dedicated combustion tests are undertaken and specific techniques are developed to measure surface temperatures. Thermal paints have been used for several years, associated with skilled operator observations, as a valuable means to get peak temperature profiles. This article describes major advances in the analysis process based on color to temperature supervised classification and digitization of the outer shape of the components in order to get 3D temperature maps. A non-contact scanner enables to acquire both a color image and a 3D mesh of the component. The color image is processed with a classification algorithm to give a temperature image. Different colorimetric distances are tested to compare each pixel to the database and find the best matching temperature, which is then associated to a node of the 3D mesh. The relevance of the method is to increase temperature resolution and robustness and to allow more reliable comparisons between numerical simulation and bench test measurement. This system is currently implemented in the engine development process at Turbomeca.
Various Artificial Intelligence Techniques For Automated Melody Generation

Music Composition involves different steps like melody creation, adding variations, rhythm, basses, etc. Out of these, melody generation is the basis of the musical piece created. This paper discusses generating novel pieces of monophonic melodies using three different techniques, namely, Elman Recurrent Neural Networks, a hybrid approach of Genetic Algorithms with Neural Networks as fitness evaluator and Genetic Algorithms with fitness evaluation by musical rules.
Simulation on Task Scheduling for Multiprocessors Based on Improved Neural Network

This paper mainly discusses task scheduling for multiprocessors. Application requires higher performance of the multiprocessors task scheduling systems. The traditional algorithms majorly consider the accuracy and neglect the real-time performance. In order to improve the real-time performance while maintaining the accuracy, the paper proposes a task scheduling algorithm (GA-ACO) for multiprocessors based on improved neural network. It first builds mathematical models for task scheduling of multiprocessor systems, and then introduces genetic algorithms to quickly find feasible solutions. The simulation results show that the improved neural network algorithm not only has the global optimization ability of genetic algorithm, but also has both local search and the positive feedback capabilities of neural networks; compared with single optimization algorithm, it can quickly find the task scheduling solutions to meet real-time requirements, accelerate the speed of execution of the task, furthermore achieve reasonable, effective task allocation and scheduling for multi-processor.