this paper presents a rule-based approach for the phonetic transcription of the Romanian language. We integrate this phonetic analysis in the text processing component of a text-to-speech system for Romanian. Grapheme...
详细信息
this paper presents a rule-based approach for the phonetic transcription of the Romanian language. We integrate this phonetic analysis in the text processing component of a text-to-speech system for Romanian. Grapheme-to-phoneme rules are constructed based on expert information from DOOMII dictionary. In the cases when rules are useless, we employed decision trees constructed on engineered training sets to help the classifiers to learn the language exceptions.
the antimicrobial resistance (AMR) of bacteria to antibiotics is tightly connected withtheir genetic structure changes. Many methods belonging to various disciplines are applied to analyze these genetic changes. the ...
详细信息
the antimicrobial resistance (AMR) of bacteria to antibiotics is tightly connected withtheir genetic structure changes. Many methods belonging to various disciplines are applied to analyze these genetic changes. the genes involved in AMR undergo different changes. these changes can be analyzed using distances between different variants (alleles) of a gene. this paper aims to study the dissimilarity between different variants of the sul2 gene using the Levenshtein distance between the corresponding DNA sequences, a distance based on binary representation and the distance induces by the global alignment scores computed using withthe Needleman-Wunsch algorithm.
We outline some preliminary ideas on a guided theory assignment of variables in a real (QF_NRA) satisfiability problem. One objective of this approach is to mix the topdown approach of cylindric algebraic decompositio...
详细信息
We outline some preliminary ideas on a guided theory assignment of variables in a real (QF_NRA) satisfiability problem. One objective of this approach is to mix the topdown approach of cylindric algebraic decomposition and the bottom-up approach of partial theory assignments of modern SAT/SMT solvers. We use equational constraints and a single strict inequality at a time to artificially create conflicting variable assignment traces, which can later be used in conflict resolution to enrich the constraints of the original satisfiability problem.
WARP is a new algorithm designed to achieve highest performance in Automatic Web Service Composition (WSC). In its first version, WARP solves the simplest form of WSC, providing very low running times but relative lon...
详细信息
ISBN:
(纸本)9781538626276
WARP is a new algorithm designed to achieve highest performance in Automatic Web Service Composition (WSC). In its first version, WARP solves the simplest form of WSC, providing very low running times but relative long compositions. Further, a heuristic score is associated to services that promote the most relevant services when multiple are accessible. After this improvement, compositions are short and computed almost as fast as in the first version. Two well-known benchmarks [1], [4] are used to compare WARP with previous planning based approaches [5]. More revealing instances are generated by a proposed test generator.
the classification and at the same time the inter-active characterization of both bad connections, called alerts or attacks, as well as normal connections, is a must for monitoring network traffic. For this specific t...
详细信息
the classification and at the same time the inter-active characterization of both bad connections, called alerts or attacks, as well as normal connections, is a must for monitoring network traffic. For this specific task, we developed in this study a neuro-symbolic predictive model based on Logic Tensor Networks. Moreover, we present in detail the advantages and disadvantages of using our hybrid system versus the usage of a standard feed-forward deep neural network classifier. For a relevant comparison, the same dataset was used during training and the metrics resulted have been compared. An overview shows that while bothalgorithms have similar precision, the hybrid approach gives also the possibility to have interactive explanations and deductive reasoning over data.
Irrelevance, a notion which was first put forward by this author jointly with A. Sgarro, is a convenient tool to speed up computations in the arithmetic of interactive fuzzy numbers. In this paper we are trying to und...
详细信息
ISBN:
(纸本)9781509057085
Irrelevance, a notion which was first put forward by this author jointly with A. Sgarro, is a convenient tool to speed up computations in the arithmetic of interactive fuzzy numbers. In this paper we are trying to understand what happens if the fuzzy quantities one is considering are incomplete, or sub-normal, that is if one allows that a fuzzy quantity is "cut" at a height h which is less than 1. We motivate the reasons why we deem it important to extend fuzzy arithmetic to fuzzy quantities which may be incomplete, and we show that irrelevance keeps proving a convenient tool. Interactivity is described by suitable monotone joins, which generalize t-norms.
Structured matrices withsymbolic sizes appear frequently in the literature, especially in the description of algorithms for linear algebra. Recent work has treated these symbolic structured matrices themselves as com...
Structured matrices withsymbolic sizes appear frequently in the literature, especially in the description of algorithms for linear algebra. Recent work has treated these symbolic structured matrices themselves as computational objects, showing how to add matrices with blocks of different symbolic sizes in a general way while avoiding a combinatorial explosion of cases. the present article introduces the concept of hybrid intervals, in which points may have negative multiplicity. Various operations on hybrid intervals have compact and elegant formulations that do not require cases to handle different orders of the end points. this makes them useful to represent symbolic block matrix structures and to express arithmetic on symbolic block matrices compactly. We use these ideas to formulate symbolic block matrix addition and multiplication in a compact and uniform way.
Grid-based platforms were recently build all over the world to satisfy the huge needs of computational power and storage capacities for Earth observation activities. Training activities in the field are not following ...
详细信息
Grid-based platforms were recently build all over the world to satisfy the huge needs of computational power and storage capacities for Earth observation activities. Training activities in the field are not following these developing activities, resulting a big gap between the field request for specialists and the labor market offer. In this context, a platform for high education and training in Earth observation using the latest achievements in information technologies is a clear need at least for the scientific community. this paper presents the concepts behind a newly established Grid-based platform that offers learning objects based on hands-on experiments for Earth observation community.
Using the machinery of proof orders originally introduced by Bachmair and Dershowitz in the context of canonical equational proofs, we give an abstract, strategy-independent presentation of Groebner basis procedures a...
详细信息
Using the machinery of proof orders originally introduced by Bachmair and Dershowitz in the context of canonical equational proofs, we give an abstract, strategy-independent presentation of Groebner basis procedures and prove the correctness of two classical criteria for recognising superfluous S-polynomials, Buchberger's criteria 1 and 2, w.r.t. arbitrary fair and correct basis construction strategies. To do so, we develop a general method for proving the strategy-independent correctness of superfluous S-polynomial criteria which seems to be quite powerful. We also derive a new superfluous S-polynomial criterion which is a generalisation of Buchberger-1 and is proved to be correct strategy-independently.
the aim of this paper is to develop a MATLAB function for one dimensional numerical integration based on adaptive algorithms and Gauss-Lobatto-Kronrod formulas. Using Maple, we find a triple of formulas, and then we u...
详细信息
the aim of this paper is to develop a MATLAB function for one dimensional numerical integration based on adaptive algorithms and Gauss-Lobatto-Kronrod formulas. Using Maple, we find a triple of formulas, and then we use it to code ananalogous of MATLAB quadl function with a higher degree of exactness. Finally, some examples and tests which compare our function and quadl are given. Our function is a good alternative to quadl when the accuracy and reliability requirements are hard.
暂无评论