Miracle-dz/UniFAR-FTUs huggingface dataset:
Speaker Recognition System using Gaussian Mixture Model

In this paper,features for text-independent speaker recognition has been evaluated. Speaker identification from a set of templates and analyzing speaker recognition rate by extracting several key features like Mel Frequency Cepstral Coefficients [MFCC] from the speech signals of those persons by using the process of feature extraction using MATLAB2013 . These features are effectively captured using feature matching technique like Gaussian Mixture Model [GMM] , with varying mixture components of mixture model and the analyzing its effect on recognition rate . Improve the speaker recognition rate by varying the input parameters of the classifier. The experiments are evaluated on TIMIT Database effectively for a speech signal sampled at 16kHz.
Evaluating A Positive Attribute Clustering Model for Data Mining

We outline and evaluate a binary-positive clustering model. It is based on a binary representation of data records in rows where column entries, either ‘1’ or ‘0’, correspond to all possible data values that tributes may take. A new group similarity index (GSI) is devised which takes into account only the positive attributes as basis for the grouping and clustering algorithm. The model is compared with standard clustering models. For the comparison we define an objective measure about two similarity factors: within-class similarity (WCS) and between-class similarity (BCS), seeking a maximum intra-group and minimum inter-group proximity, respectively. A coefficient of variation (CV) statistic is then employed to combine the two factors into a measure of relative diversity between records and groups. When applied to a common data set our binary clustering shows significant advantages over standard clustering models.
Higher spin fields in three-dimensional gravity

In this thesis, we study the effects of massless higher spin ﬁelds in three-dimensional gravity with a negative cosmological constant. First, we introduce gravity in Anti-de Sitter (AdS) space without the higher spin gauge symmetry. We recapitulate the semi-classical analysis that outlines the duality between quantum gravity in three dimensions with a negative cosmological constant and a conformal ﬁeld theory onthe asymptotic boundary of AdS3. We review the statistical interpretation of the black hole entropy via the AdS/CFT correspondence and the modular invariance of the partition function of a CFT on a torus. For the case of higher spin theories in AdS3 we use those modular properties to bound the amount of gauge symmetry present. We then discuss brieﬂy cases that can evade this bound. %%%%Cette these s'interesse a la gravitation en trois dimensions avec une constante cosmologique negative, et en particulier aux effets des champs de masse nulle dont le spin est plus grand que deux. Les interactions gravitationelles dans l'espace Anti-de Sitter (AdS) sont d'abord decrites sans la symetrie de jauge additionnelle. Nous presentons l'analyse semi-classique qui met en lumiere la dualite holographique entre la gravitation quantique en trois dimensions avec une constante cosmologique negative et une theorie conforme des champs (CFT) sur la frontiere asymptotique de l'espace AdS3. Grâce a cette correspondance AdS/CFT et a l'invariance sous les transformations modulaires de la fonction de partition d'une theorie conforme decrite sur un tore, nous reexaminons l'interpretation statistique de l'entropie des trous noirs. Nous appliquons ensuite ces proprietes modulaires aux theories gravitationelles avec l'invariance de jauge des spins entiers plus grand que deux, et demontrons ainsi une limite sur le spin maximal present dans l'espace AdS3. Quelques remarques s'ensuivent sur certains cas particuliers pouvant se soustraire a cette limite.
Optimal Computing Budget Allocation for Stochastic N–$k$ Problem in the Power Grid System

The <inline-formula><tex-math notation="LaTeX">$N$</tex-math></inline-formula>−<inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula> problem is very well known in the power industry and it tries to answer the question whether there exists a set of <inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula> lines in a power network with <inline-formula><tex-math notation="LaTeX">$N$</tex-math></inline-formula> elements whose removal would cause the failure of the system. In practice, it is common to evaluate a system according to an <inline-formula><tex-math notation="LaTeX">$N$</tex-math></inline-formula>−1 criterion, i.e., <inline-formula><tex-math notation="LaTeX">$k = 1$</tex-math></inline-formula>. While this problem has traditionally been considered in a deterministic setting, stochastic behavior within the system is important especially in the context of extreme events. A number of stochastic Monte Carlo models have been proposed to estimate the probability of cascading failures. In this paper, we deal with simulation budget allocation of the stochastic <inline-formula><tex-math notation="LaTeX">$N$</tex-math></inline-formula>–1 problem. More specifically, we assume that a simulation model is able to provide us an estimate of the system failure rate when any line is tripped. It is not difficult to see how simulation of all configurations to some certain accuracy can become computationally expensive with the growth of <inline-formula><tex-math notation="LaTeX">$N$</tex-math></inline-formula>. Under such a setting, we transform the <inline-formula><tex-math notation="LaTeX">$N$</tex-math></inline-formula>–1 problem into a stochastic selection process with optimal computing budget allocation (OCBA): given <inline-formula><tex-math notation="LaTeX">$N$</tex-math></inline-formula> configurations, we would like to sequentially allocate a certain number of simulation replications in order to answer the question whether the system is reliable or not. We show through theoretical analysis and numerical experiments that the probability of correctly identifying the system reliability state can be increased by applying OCBA allocation rules in the simulation budget allocation process.
Robust Protection of Networks against Cascading Phenomena

Recently, the spread of many different undesirable phenomena has been modeled as a network diffusion process cascade, e.g. misinformation spread in social networks, dissemination of infectious disease through different regions, virus and malware propagation through computer networks, expansion of fire in forests and towns, spread of invasive species across landscape etc. The consequences of such spreads can be severe and hence it is important to design and develop efficient ways of protection. In this thesis, we address the problem of robust network protection against the spread of such cascades. Particularly, we look at the robust protection against a set of the most undesirable cascades, where our goal is to block the smallest possible set of nodes that is robust against the worst possible spread of these cascades. We propose an efficient approximation algorithm that based on a greedy strategy, finds a near-optimal solution for a given set of cascades. Moreover, we design an efficient iterative procedure that incorporates this algorithm. The procedure allows the greedy algorithm to find a near-optimal solution by considering a relatively small number of the given cascades. We also look at different protection actions to which we refer as blocking mechanisms. The types of blocking mechanisms that we consider here are “static”, i.e. not-spreading, and “dynamic”, where once a node is blocked it influences other nodes to become “blocking nodes” as well. We use large real-world networks to evaluate our procedure. Empirical results show that our procedure significantly outperforms well-known heuristics for all considered blocking mechanisms.
Biomolecular Modeling and Simulation: The Productive Trajectory of a Field

As the field of biomolecular modeling has increased in visibility among both scientists and the general public, it has also drawn scrutiny. In par-ticular, biologists and funding agencies have been asking pertinent questions: What impact have computer technology and mathematical algorithms had on the field’s development? What are future prospects for the field [8,10,17]? The focus of an invited talk* at this year’s SIAM Conference on Computational Science and Engineering was the survey we conducted to address these questions, including a description of key success stories, ex-amples of failure, and a projection of future prospects. This study began as a project in a Special Topics course at New York University and resulted in the appearance of a perspective on the field in
Lojistik-Gauss Harita Tabanlı Yeni Bir Kaotik Sürü Optimizasyon Yöntemi

Gercek hayattaki bazi problemler, klasik matematiksel yontemler kullanarak cozulememektedir. Bu sebeple, bu problemlerin cozumunde genellikle meta-sezgisel optimizasyon yontemleri kullanilmaktadir. Meta-sezgisel optimizasyon yontemlerinin basari duzeyini artirmak icin kullanilan yontemlerden birisi de kaotik haritalardir. Bu makalede yeni bir hibrit kaotik harita onerilmis ve onerilen hibrit kaotik harita kullanilarak yeni bir kaotik optimizasyon yontemi gelistirilmistir. Onerilen hibrit kaotik harita, lojistik ve gauss haritalarini kullanmaktadir. Optimizasyon asamasinda parcaciklarin degerlerini guncellemek icin lojistik-gauss haritasi kullanilmistir. Onerilen optimizasyon yontemi de lojistik-gauss tabanli kaotik suru algoritmasi olarak adlandirilmistir. Yeni optimizasyon yonteminin performansini test etmek icin ise literaturde siklikla kullanilan 6 sayisal kiyaslama fonksiyonu tercih edilmistir. Ve elde edilen degerler yine literaturde yer alan 3 farkli suru tabanli optimizasyon yontemiyle karsilastirilmistir. Onerilen yontem hemen butun fonksiyonlar icin daha optimum sonuclar uretmistir. Bu sayede suru optimizasyon yonteminin, tuzakli lokal optimum degerlerden uzak durmasi saglanmaya calisilmistir.
Adaptive observer‐based integral sliding mode control of a piezoelectric nano‐manipulator

In this study, the authors propose an adaptive observer-based integral sliding mode control scheme to support ultra-precision tracking of a multi-axis piezoelectric nano-manipulator. By introducing a modified Dahl model capable of approximating the hysteresis phenomenon, an adaptive observer is developed to compensate the impact of hysteresis, where an adaptive observer-based integral sliding mode control architecture is further proposed with good robustness against model uncertainties. The gain of the sliding mode controller is adaptively estimated for the purposes of fast convergence, chattering alleviation and controller robustness. Finally, the proposed algorithm is implemented in real time on a PZT-actuated nano-manipulating stage, where good robustness and excellent tracking performance are successfully demonstrated, which outperform representative algorithms in the literature.
Hand Gesture for Controlling a Robotic Device using a Personal Computer

In the field of IMAGE PROCESSING hand gesture recognition is one of the most interesting and challenging genre. Gesture recognition is basically a non-verbal way of communication. Under this title, we will be basically developing a system which recognizes human hand gestures performed in front of the personal computer and uses this gesture for performing movement of a robotic car placed in the vicinity. In this paper web camera is used, after the grabbing of the image we subject the image to image processing algorithms like gray scaling, thresholding , blur, blob detection, segmentation and finally vector calculation. The system will use a single, color camera mounted above a neutral colored desk surface next to the computer. The paper briefly describes the schemes of capturing the image from web camera, image detection, processing the image to recognize the gestures as well as few results. This approach can be implemented in real time system very easily .
Social Network Analysis based Keyword Analysis of ISPIM Research Topics

The usefulness of keywords and keyword networks as a fundamental carrier of knowledge has been recognized but the prior studies identifying and analyzing innovation management research topics and their evolution at ISPIM have not addressed the Social Network Analysis (SNA) viewpoint. Therefore this study evaluates the network structure of ISPIM research topics from the SNA point of view. By applying SNA to the ISPIM keyword and research topic data from 2009 to 2014 full academic paper publications (N=1081), this study is explicitly modelling how the different keywords are inter-linked with each other. By analyzing various centrality measures, the importance of a particular keyword within the whole ISPIM network are determined. As a result the contemporary body of knowledge of innovation management research is described and visualized as keyword networks. Implications for future innovation management research are discussed.
Miniaturization of Microstrip Patch Antenna by Using Two L-shaped Slots for UHF RFID Reader

A novel design for miniaturization of microstrip patch antenna for the RFID reader is proposed. The proposed antenna design consists of two L-shaped slots on the patch and two parallel slots on the ground plane. The patch and the ground are shorted through a shorting probe. The area of the proposed antenna is reduced around 51% compared with the slot less one. The validity and feasibility of the proposed antenna has been simulated and analyzed by HFSS. The simulation results show that the proposed antenna has relatively good gain of 8.05dBi and radiation characteristics and it covers the required bandwidth, 902-928MHz. The measured results are compared with the simulated results, and good agreement is obtained.
An efficient approach in ANPR using the Block-Based ANN in MATLAB

Automatic Number Plate Recognition (ANPR) framework is profoundly precision demanding application for auto distinguishing proof. This paper introduces another strategy for square based (Block Based) ANPR framework for acknowledgment of Indian auto permit number plates. Since number plate rules are not entirely rehearsed in India and wide varieties found on these plates as far as text style sort, character size, screws/dabs and so forth. , it frequently gets to be hard to effectively distinguish the non-standard number plate characters. This proposed strategy functions admirably with both standard and non-standard Indian number plate pictures taken under different light conditions. By utilizing the piece based component extraction handle this strategy for acknowledgment gives a high acknowledgment rate of 98.2% and pace up the preparing time of every character to 2.9 ms when utilizing a database of 2550 character pictures.
Electromagnetic Propagation In Multi Mode Random Media

Thank you very much for downloading electromagnetic propagation in multi mode random media. Maybe you have knowledge that, people have search numerous times for their favorite readings like this electromagnetic propagation in multi mode random media, but end up in infectious downloads. Rather than enjoying a good book with a cup of coffee in the afternoon, instead they are facing with some infectious bugs inside their desktop computer.
Design and Research on the Special System Architecture for Peer-to-Peer Distributed Storage System Based on Node Grouping

The organization pattern of P2P (Peer-to-Peer), has become an important form of internet application of new generation because of its such features, as good expansibility, fault tolerance and high-performance. The persistent data storage is the key to inhibiting the development of global storage system, and is also difficulty issues of the research.This paper describes a design idea and a system architecture of distributed storage system established on P2P in detail, and proposes an effective mechanism according to resource topic and predicted network distance for node grouping, and verifies the persistent data storage performance of P2P global storage system.
Path Traversal Around Obstacles by a Robot using Terrain Marks for Guidance

The problem of autonomous robots avoiding obstacles while traversing a terrain requires efficient algorithms. There has been much research work done for the cases where the locations of obstacles are known before the path is planned. We present here an algorithm for the case in which the robot has no prior knowledge about the locations of the obstacles. The robot starts its navigation knowing the coordinates of the start and the destination points and adjusts its path as it encounters obstacles. Many existing algorithms are designed for the contexts in which the robot determines its location based on information provided by either the GPS system or an overhead camera. Our algorithm has been developed for the context in which the robot determines its (x, y) coordinates based on the grid marks on the terrain, and does not depend on the global systems for positioning cues. We have shown that our algorithm can successfully traverse the terrain for most of the situations even though there are some exception cases in which the robot gets stuck while there still is a possible path through the maze of obstacles. The robot also returns to the starting location, navigating only the shortest path running through the cells navigated while going towards the destination. This thesis describes the algorithm, implementation details for the Khepera robot used, and the results obtained with our algorithm.
Potential development in multi-sensor measurement system based on synergetics

Application of synergetics in the engineering systems is introduced based on its basic principle.The new idea applying synergetics to multi-sensor measurement field is put forward.The research method of synergetics in the multi-sensor measurement systems is analyzed.The application mode of multi-sensor measurement systems based on synergetics is built.A series of key issues are discussed to prospect trends of synergetics in the multi-sensor measurement system.
Personal data usage in the context of the development of semantic technologies: legal issues

Skaitmeninės revoliucijos, spartaus internetinių technologijų plėtros, milžiniskais tempais didėjancios informacijos ir duomenų apimties, virtualių socialinių tinklų ekspansijos kontekste asmens duomenų apsaugai kyla vis nauji issūkiai. Atlikus teisės aktų ir informacinių technologijų plėtros tendencijų analize, straipsnyje konstatuojama, kad globalizacija ir naujos asmens duomenų ekosistemos koncepcija vercia persvarstyti tradicines asmens duomenų ir jų apsaugos sampratas bei jų santykį su viesuoju interesu, kurį atstovauja skaitmeninės ekonomikos, mokslo ir technologijų plėtra. 2012 m. Europos Komisija pasiūlė is esmės reformuoti Europos Sąjungos asmens duomenų apsaugos teisės aktus. Siūloma reforma turėtų sustiprinti individualias teises, spresti globalizacijos keliamas problemas bei naujas technologijų plėtros issūkius. Straipsnyje atskleidžiama, kad aktuali Lietuvos Respublikos Asmens duomenų teisinės apsaugos įstatymo redakcija, griežciau už Europos Sąjungos teisines normas reguliuojanti asmens duomenų naudojimą ir jų apsaugą, apsunkina pažangių kalbos ir semantinių technologijų plėtrą Lietuvoje, nors sioje srityje Lietuva 6-8 metais atsilieka nuo Europos Sąjungos vidurkio. Autoriai prieina isvados, kad susidariusioje situacijoje, nelaukiant Europos Sąjungos asmens duomenų apsaugos reformos rezultatų, Lietuvoje būtina tarpinė asmens duomenų apsaugą reguliuojancių teisės aktų reforma, nes susidariusi teisinė ir technologinė situacija kelia rimtą grėsme asmens teisei į privatumą, asmens duomenų apsaugai bei viesajam interesui.
R\'enyi entropies and nonlinear diffusion equations

Since their introduction in the early sixties, the R\'enyi entropies have been used in many contexts, ranging from information theory to astrophysics, turbulence phenomena and others. In this note, we enlighten the main connections between R\'enyi entropies and nonlinear diffusion equations. In particular, it is shown that these relationships allow to prove various functional inequalities in sharp form.
Rewriting methods in higher algebra

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Rewriting methods in higher algebra Yves Guiraud
Vertex-Fed Hexagonal Antenna with Low Cross-Polarization Levels

Probe-fed hexagonal patch antenna suffers from impedance mismatch especially when feed is located at one of the vertices of polygon. Hexagonal planar antennas also suffer from high cross polar levels. This paper proposes a method to overcome impedance mismatch and to increase co-polarization level by reducing ground plane. Vertex feeding is demonstrated in this paper to establish improvement in impedance values more clearly. The impedance at any vertex of a hexagonal patch is too high when compared to the characteristic impedance of the probe. Three vertex-fed hexagonal antennas are developed to demonstrate the effect of ground plane reduction within C-Band. The proposed technique can be optimized to match the impedance and achieve good return loss where monopole radiation characteristics are not an issue. A vertex-fed reduced ground hexagonal antenna is proposed here that operates around 5 GHz with a frequency span of 600 MHz. Thus, the proposed antenna is quite suitable for indoor wireless LAN (UNII-1) applications.
Quantum state tomography with fully symmetric measurements and product measurements

We introduce random matrix theory to study the tomographic efficiency of a wide class of measurements constructed out of weighted 2-designs, including symmetric informationally complete (SIC) probability operator measurements (POMs). In particular, we derive analytic formulae for the mean Hilbert-Schmidt distance and the mean trace distance between the estimator and the true state, which clearly show the difference between the scaling behaviors of the two error measures with the dimension of the Hilbert space. We then prove that the product SIC POMs---the multipartite analogue of the SIC POMs---are optimal among all product measurements in the same sense as the SIC POMs are optimal among all joint measurements. We further show that, for bipartite systems, there is only a marginal efficiency advantage of the joint SIC POMs over the product SIC POMs. In marked contrast, for multipartite systems, the efficiency advantage of the joint SIC POMs increases exponentially with the number of parties.
Parameter estimation of manipulator robot dynamics

We need better methods of dynamic parameter estimation because robots are becoming more complex and their interactions with the unmodeled world are becoming more frequent. These methods should be fast, reliable, and easily adaptable to various classes of robots. Here, we design and build a parameter estimation system in a robotic simulation and controls framework called Drake. The parameter estimation works by minimizing the error between a model and the observed data from a given trajectory. Using our estimator, we then compare the minimization of three types of errors, generated by the dynamics model, energetic model, and simulation model. We quantify the speed and performance of each algorithm on the Acrobot system. Thesis Supervisor: Russ L. Tedrake Title: Professor of Electrical Engineering and Computer Science