Miracle-dz/UniFAR-FTUs huggingface dataset:
On the impact of using optimization search method in large speaker database based on hybrid modeling over experimental investigation

Speaker recognition from speech signal is still an ongoing research in forensics and biometrics area. Speaker recognition is the process to enable machine to recognize speaker's identity from their speech. Recent development on classify speaker data from a group of speaker is still insufficient to provide a satisfied result in achieving high performance pattern classification engine. There are two main difficulties in this field: how to maintain accuracy rate under incremental amounts of training data and how to reduce the time processing in the case embedded systems need to consider about efficient and simplicity of calculation. Recently we have proposed three difference hybrid pattern classification approach for text independent speaker identification system; in these approaches, we combined a hybrid GMMNQ and decision Tree model. The aim of this paper is to show the progress of the development of a high impact hybrid modeling. Besides, via this paper, an evaluation is done to verify the impact of using optimization search method on large speaker database.
DEVELOPING AND IMPLEMENTING THE MAIL CHECKERFOR ELECTRONIC MAIL CONTROL

Mail Checker is an email-checking tool written by JAVA program (SDK 1.3.1 and SWING). Mail Checker has the following functions: retrieving the header information (i.e., “From,” ”Subject,” ”Date”) of e-mail messages from POP3 servers, sending e-mails using SMTP server, and maintaining the user’s e-mail accounts. In virtue of portability, one of JAVA properties, Mail Checker can run on Unix-based platforms as well as windows-based platforms. In addition, the tool enables a user to select an e-mail account at his/her disposal if he/she has more than two e-mail accounts. To efficiently integrate all of user’s e-mail accounts, this tool provides an integrated repository to efficiently maintain all of the user’s e-mail accounts. Through this repository Mail Checker can navigate POP3 servers registered by a user.
Java Programming For The Absolute Beginner

1. Getting Started 2. Variables, Data Types, and Simple I/O 3. The Fortune Teller: Random Numbers, Conditionals, and Arrays 4. The Number Guesser: Using Loops and Exception Handling 5. Blackjack: Object Oriented Programming 6. Making Your Life Easier: The java.util Package and Generics 7. Learning to Read and Write: The java.io Package 8. Creating a GUI Using the Abstract Windowing Toolkit 9. Advanced GUI, Layout Managers, and Event Handling 10. Writing Applets 11. Rendering 2D Graphics 12. Animation, Sounds, and Threads 13. Putting it All Together: The Block Game
Knowledge organization systems, network standards and semantic Web

Aimed at students of library and information science, this paper is introductory in nature and provides basic information about the relationship between knowledge organization systems, ontologies and the World Wide Web architecture known as the Semantic Web. The Web is expected to be gradually populated by content with formalized semantics that will enable the automation of content organization and its retrieval. As implied by its name, the Semantic Web will assume a higher level of connectivity which is going to be based on resource content and meaning while the information organization will predominantly be automatic i.e. based on machine to machine (m2m) information services. This is the reason why the Semantic idea is closely related to the development of ontologies (a simple explanation of an ontology and ontology languages is given based on relevant literature). Traditional knowledge organization systems (KOS) such as classifications and thesauri have been deployed for resource organization and discovery on the Internet and have become de facto standards in resource discovery. KOS tools are likely to become even more important with the Semantic Web, providing they can be exposed and shared using ontologically orientated standards.
Model-Based Tracking Control of Nonlinear Systems

Introduction Scope and Outline Mechanics and Nonlinear Control Role of Modeling in a Control Design Process Dynamics Modeling of Constrained Systems Introduction-Art of Modeling Constrained Systems Equations of Motion for Systems with First-Order Constraints Equations of Motion for Systems with High-Order Constraints Introduction to Nonlinear Control Theory Stability Properties of Nonlinear Systems Classification of Control Problems Control Properties of Nonlinear Systems Kinematic Control Models Dynamic Control Models Feedback Linearization of Nonlinear Systems Models-Based Control Design Methods Flatness-Based Control Design Methods Other Control Design Techniques for Nonlinear Systems Stabilization Strategies for Nonlinear Systems Model-Based Tracking Control of Nonlinear Systems A Unified Control-Oriented Model for Constrained Systems Tracking Control of Holonomic Systems Tracking Control of First-Order Nonholonomic Systems Tracking Control of Underactuated Systems Tracking Control Algorithms Specified in Quasi-Coordinates Path-Following Strategies for Nonlinear Systems Path-Following Strategies Based on Kinematic Control Models Path-Following Strategies Based on Dynamic Control Models Model Reference Tracking Control of High-Order Nonholonomic Systems Model Reference Tracking Control Strategy for Programmed Motion Nonadaptive Tracking Control Algorithms for Programmed Motions Adaptive Tracking Control Algorithms for Programmed Motions Learning Tracking Control Algorithms for Programmed Motions Tracking Control Algorithms for Programmed Motions Specified in Quasi-Coordinates Tracking Control Algorithms for Programmed Motions with the Velocity Observer Other Applications of the Model Reference Tracking Control Strategy for Programmed Motion Concluding Remarks Problems and References appear at the end of each chapter.
From Traditional Delivery to Distance Learning: Developing the Model

Today’s classrooms are no longer bound by geography. Distance learning has provided an attractive and increasingly highly regarded alternative to traditional face­to­face instruction. However, effective implementation requires a shift in thinking for both students and instructors. The purpose of this article is to describe a model for applying a traditional campus­based graduate course to a distance format.
A morphosyntactic description of Xamtanga : an Agaw (Central Cushitic) language of the northern Ethiopian highlands

Cette these propose une description de la morphologie et de la syntaxe du xamtanga, une langue membre de la famille agaw, c’est a dire la branche centrale du couchitique (afro-asiatique). Le xamtanga est parle par environ 200 000 locuteurs sur les hauts plateaux du nord de l’Ethiopie, dans la zone Wag Xɨmra de la region Amhara. Cette etude est basee sur des donnees (textes et elicitations) issues des dialectes d’Abɨrgalle et de Saqʷat’a collectees durant cinq sejours de terrain entre 2008 et 2013. Prenant appui sur les precedents travaux de David Appleyard (1987) et de Leo Reinisch (1884), elle a pour objectif d’offrir une description du xamtanga axee sur l’analyse de certains phenomenes interessants d’un point de vue typologique et/ou areal. Une attention particuliere est par exemple accordee au systeme de marquage casuel en partie gouverne par la hierarchie +/- anime/defini, a l’existence de causatifs multiples, a l’expression de l’applicatif via differents types de periphrases construites avec les operateurs verbaux ‘donner’, ‘dire’ ou ‘laisser’, aux categories relevant du Temps-Aspect-Mode qui mettent en jeu des formes identiques a des subordonnees de but, et aux diverses subordonnees relatives.
Computer networks as complex systems in nonextensive approach

Contemporary computer networks fit into the category of complex systems. However, many models still are based on an idealistic paradigm of simple systems based on thermodynamic equilibrium. In order to understand and optimize the design of real networks it is necessary to understand and describe their nonextensive operation aspects. Therefore, it is necessary to explain such concepts as self-organization, self-adaptation and matching load to finite resources.
MIRMaid: An interface for a content based Music Information Retrieval test-bed

Music Information Retrieval (MlR) is the interdisciplinary science of retrieving information from music and includes influences from different areas, like music perception and cognition, music analysis, signal processing, music indexing and information retrieval [Futrelle & Downie, 2003]. To produce the most efficient MlR systems, test-beds are commonly used to test different combinations of parameters against each other. The purpose of this dissertation was to investigate the composition of algorithms for MlR systems by constructing an interface that could form part of a test-bed. It differs from other interfaces and frameworks that are used in MlR test-beds because it is focused on small scale test-beds. MIRMaid is an acronym for Music Information Retrieval Modular aid and is an interface that allows different content based retrieval tasks to be compared against each other to find optimal combinations of retrieval parameters for specialised problem domains. The dissertation describes the process of how the MIRMaid interface was developed, modified and refined. A big challenge was to design the user experiments in a way that considered potential users of the interface while using the test subjects I had at my disposal. I decided to use the simplest queries to highlight basic similarities between novice and potential expert users. The performance of the interface was judged by user ratings on a questionnaire. The interface performed reasonably well with expert users and novice users. Despite these results there were a few interesting observations that were returned from the user experiments related to the experiment design and the task explanations. Some suggestions are also provided for extending the interface to allow it to be used with other types of data. The possibility is also investigated for using the interface as a tool for simplifying the process of integrating modules from different sources.
An Examination of Selected Commercial Software Testing Tools

Abstract : This paper reports on the examination of ten commercial tools identified for the static and dynamic analysis of Ada code. It provides software development managers with information that may help them gain an understanding of the types of tools that are commercially available, the functionality of these tools, and how they can aid the development of Ada software. During the course of the assessment, the tools were applied to a series of Ada programs in order to assess their functionality. Each tool was then described in terms of its functionality, ease of use, and documentation and support. Problems encountered during the examination and other pertinent observations were also recorded. Significant findings from this study include the following: (1) some of the examined tools could be brought into immediate use to improve the cost-effectiveness of testing for SDI software development efforts, (2) the coverage analyzers provide reporting data that can support the management of SDI testing efforts, and (3) many of the tools can be used in conjunction to overcome the limitations of particular tools.
Patrones melódicos de órdenes y peticiones a través de un análisis automático de la entonación

espanolEl siguiente trabajo analizo la entonacion de ordenes y peticiones del espanol de Chile a traves de un algoritmo completamente automatico programado en Matlab, que solo trabaja con los rasgos foneticos de la entonacion sin analizar su parte fonologica. Los resultados muestran tres rasgos que permiten caracterizar la entonacion de ordenes y peticiones: duracion, rango en semitonos y una secuencia de movimientos tonales. La duracion en peticiones es mayor que en ordenes, el rango en semitonos es mayor en las ordenes que en las peticiones y las ordenes presentan con mayor frecuencia un patron enunciativo mientras que las peticiones presentan una curva que comienza con un descenso y finaliza con una curva plana. El algoritmo y los resultados pueden ser aprovechados para, por ejemplo, la creacion de materiales didacticos para ensenar entonacion. EnglishThis paper analysed intonation in orders and petitions in Chilean Spanish through a completely automated algorithm programmed in Matlab, which works with intonation phonetic features without analysing it phonologically. The results show that three features allow to characterize the intonation of orders and petitions: duration, semitones range and a sequence of tonal movements. Duration in petitions is larger than in orders, the range in semitones is larger in orders than in petitions and orders more often present an affirmative pattern. Contrastively, petitions present a curve that begins with a fall and ends with a steady curve. The algorithm and the results can be used to, for example, create didactic material to teach intonation.
Adaptive Multiprocessor Real-Time Systems

Over the past few years, as multicore technology has become cost-effective, multiprocessor systems have become increasingly prevalent. The growing availability of such systems has spurred the development of computationally-intensive applications for which single-processor designs are insufficient. Many such applications have timing constraints; such timing constraints are often not static, but may change in response to both external and internal stimuli. Examples of such applications include tracking systems and many multimedia applications. Motivated by these observations, this dissertation proposes several different adaptive scheduling algorithms that are capable of guaranteeing flexible timing constraints on multiprocessor platforms. Under traditional task models (e.g., periodic, sporadic, etc.), the schedulability of a system is based on each task's worst-case execution time (WCET), which defines the maximum amount of time that each of its jobs can execute. The disadvantage of using WCETs is that systems may be deemed unschedulable even if they would function correctly most of the time when deployed. Adaptive real-time scheduling algorithms allow the timing constraints of applications to be adjusted based upon runtime conditions, instead of always using fixed timing constraints based upon WCETs. While there is a substantial body of prior work on scheduling applications with static timing constraints on multiprocessor systems, prior to this dissertation, no adaptive multiprocessor scheduling approach existed that is capable of ensuring bounded "error" (where error is measured by comparison to an ideal allocation). In this dissertation, this limitation is addressed by proposing five different multiprocessor scheduling algorithms that allow a task's timing constraints to change at runtime. The five proposed adaptive algorithms are based on different non-adaptive multiprocessor scheduling algorithms that place different restrictions on task migrations and preemptions. The relative advantages of these algorithms are compared by simulating both the Whisper human tracking system and the Virtual Exposure Camera (VEC), both of which were developed at The University of North Carolina at Chapel Hill. In addition, a feedback-based adaptive framework is proposed that not only allows timing constraints to adapt at runtime, but also detects which adaptions are needed. An implementation of this adaptive framework on a real-time multiprocessor testbed is discussed and its performance is evaluated by using the core operations of both Whisper and VEC. From this dissertation, it can be concluded that feedback and optimization techniques can be used to determine at runtime which adaptions are needed. Moreover, the accuracy of an adaptive algorithm can be improved by allowing more frequent task migrations and preemptions; however, this accuracy comes at the expense of higher migration and preemption costs, which impacts average-case performance. Thus, there is a tradeoff between accuracy and average-case performance that depends on the frequency of task migrations/preemptions and their cost.
New fault tolerant multicast routing techniques to enhance distributed-memory systems performance

Distributed-memory systems are a key to achieve high performance computing and the most favorable architectures used in advanced research problems. Mesh connected multicomputer are one of the most popular architectures that have been implemented in many distributed-memory systems. These systems must support communication operations efficiently to achieve good performance. The wormhole switching technique has been widely used in design of distributed-memory systems in which the packet is divided into small flits. Also, the multicast communication has been widely used in distributed-memory systems which is one source node sends the same message to several destination nodes. Fault tolerance refers to the ability of the system to operate correctly in the presence of faults. Development of fault tolerant multicast routing algorithms in 2D mesh networks is an important issue. This dissertation presents, new fault tolerant multicast routing algorithms for distributed-memory systems performance using wormhole routed 2D mesh. These algorithms are described for fault tolerant routing in 2D mesh networks, but it can also be extended to other topologies. These algorithms are a combination of a unicast-based multicast algorithm and tree-based multicast algorithms. These algorithms works effectively for the most commonly encountered faults in mesh networks, f-rings, f-chains and concave fault regions. It is shown that the proposed routing algorithms are effective even in the presence of a large number of fault regions and large size of fault region. These algorithms are proved to be deadlock-free. Also, the problem of fault regions overlap is solved. Four essential performance metrics in mesh networks will be considered and calculated; also these algorithms are a limited-global-information-based multicasting which is a compromise of local-information-based approach and global-information-based approach. Data mining is used to validate the results and to enlarge the sample. The proposed new multicast routing techniques are used to enhance the performance of distributed-memory systems. Simulation results are presented to demonstrate the efficiency of the proposed algorithms.
Software Configuration Management : A comparison of Chef, CFEngine and Puppet

Configuring services in an ad-hoc way is less than optimal as human error can result in services that fail. Even though scripting offers a solution it does not allow for a uniform deployment of configurations. A possible solution to this problem is the use of software configuration management systems (SCMS) that allow administrators to specify what should be done, and not necessarily how. An implementation is conducted that focuses on the first part of implementing an SCMS to see if a transition to a SCMS governed environment can be worthwhile. Three SCMS will be investigated; Chef, CFEngine and Puppet. The results show that administrators can receive good support from the documentation as documentation of the three SCMS are mostly accurate. The support from the community is affected by region and activity is declining in some cases. Overall it is easy to install an SCMS and special purpose languages are effective for specifying functionality of services.
Basic linear algebra subprograms for FORTRAN usage. [BLAS, in FORTRAN and assembly language for IBM 360/67, CDC 6600 and 7600, and Univac 1108]

A package of 38 low-level subprograms for many of the basic operations of numerical linear algebra is presented. The package is intended to be used with FORTRAN. The operations in the package are dot products, elementary vector operations, Givens transformations, vector copy and swap, vector norms, vector scaling, and the indices of components of largest magnitude. The subprograms and a test driver are available in portable FORTRAN. Versions of the subprograms are also provided in assembly language for the IBM 360/67, the CDC 6600 and CDC 7600, and the Univac 1108.
The R Package JMbayes for Fitting Joint Models for Longitudinal and Time-to-Event Data using MCMC

Joint models for longitudinal and time-to-event data constitute an attractive modeling framework that has received a lot of interest in the recent years. This paper presents the capabilities of the R package JMbayes for fitting these models under a Bayesian approach using Markon chain Monte Carlo algorithms. JMbayes can fit a wide range of joint models, including among others joint models for continuous and categorical longitudinal responses, and provides several options for modeling the association structure between the two outcomes. In addition, this package can be used to derive dynamic predictions for both outcomes, and offers several tools to validate these predictions in terms of discrimination and calibration. All these features are illustrated using a real data example on patients with primary biliary cirrhosis.
Computers and the Arabic language

Impact of computers on the development of the third world, R.P.Jhunjhunuwala knowledge-based and expert systems in understanding problems, J-P.Haton a survey of bilingual peripherals, N.Harfouch and S.Kotob font design for computer-based documentation systems, P.MacKay Arabic character recognition, F.Haj-Hassan impact of linguistics on informatics, S.Attasi case study on the design of bilingual hardware and software, J.Karlson METAL - an operative machine translation system, T.Schneider.
Using Digital Image Elements To Produce Schematic Pictures.

There are two categories of representations: figurative and non-figurative. Within the category of figurative representations, there are two groups: visuals and graphic symbols. Graphic symbols include pictorial symbols, abstract symbols, and arbitrary symbols. Symbols can be used for identification, overview, supplying instructions, positipn, size, representation, and media. As there are so many uses for symbols, every situation and every context requires the consistent use and explanation of the symbols used. The variety of symbols sed in schematic pictures makes it hard for users to understand the communication. ELLEMTEL, a Swedish research and development company, has created a set of defined symbols to be used as image elements. This allows a standard set of symbols to be used ;n various schematic diagrams which makes it an easier and cost e2fective method for readers to understand the message. (Contains 11 references.) (JLB) *********************************************************************** Reproductions supplied by EDRS are the best that can be made from the original document. *********************************************************************** 1 U.S. DEPARTMENT OF EDUCATION ()lute of Educatronal Research and Improvement EDUCATIONAL RESOURCES INFORMATION CENTER IERICI 0 Tms document has been teoteduced as recerve0 from the person 0, organrzahon Ongrnatrng rt 0 Mirror changes have Deen made to emprove reproduchon duality Pomts of v,ev, or opmons stated . n ! Ns docu ment do not neCeSSanly represent oft.c. at OE RI posdon or pOIrCy Using Digital Image Elements to Produce Schematic Pictures
Automatic Fish Classification : Using Image Processing and Case-Based Reasoning

Counting and classifying fish moving upstream in rivers to spawn is a useful way of monitoring the population of different species. Today, there exist some commercial solutions, along with some research that addresses the area. Case-based reasoning is a process that can be used to solve new problems based on previous problems. This thesis studies the possibilities of combining image processing techniques and case-based reasoning to classify species of fish which are similar to each other in both shape, size and color. Methods for image preprocessing are discussed, and tested. Methods for feature extraction and a case-based reasoning prototype are proposed, implemented and tested with promising results.