Filtry
wszystkich: 341
Wyniki wyszukiwania dla: APPROXIMATION MOD ELS
-
Hybrid of Neural Networks and Hidden Markov Models as a modern approach to speech recognition systems
PublikacjaThe aim of this paper is to present a hybrid algorithm that combines the advantages ofartificial neural networks and hidden Markov models in speech recognition for control purpos-es. The scope of the paper includes review of currently used solutions, description and analysis of implementation of selected artificial neural network (NN) structures and hidden Markov mod-els (HMM). The main part of the paper consists of a description...
-
Experimental study of the post tensioned prestressed concrete corbels
PublikacjaThe results of experimental investigation of 6 symmetrical double prestressed corbels of variable shear span to depth ratio and variable location of prestressing bars are presented in the paper. The post ten- sioned corbels were prestressed with Macalloy 1030 bars of 25 mm in diameter. The results of the tests were compared with the cracking and load carrying capacity of corbels reinforced with passive reinforce- ment. As a result...
-
Approximation Strategies for Generalized Binary Search in Weighted Trees
PublikacjaWe consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T\{v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total...
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
Contextualizing a Knowledge Base by Approximation – A Case Study
PublikacjaModular knowledge bases give their users opportunity to store and access knowledge at different levels of generality. In this paper we present how to organize a modular knowledge bases organized into contexts in which a user can express their knowledge in much simplified way, yet without losing its precision. The work is centered around the notion of approximation - i.e. reducing the arity of predicates used. The presentation is...
-
Proximal primal–dual best approximation algorithm with memory
PublikacjaWe propose a new modified primal–dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates computed in previous steps in the formulas defining current iterate. To this end we consider projections onto intersections of halfspaces generated on the basis of the current as well as the previous...
-
On the approximation of the UWB dipole elliptical arms with stepped-edge polygon
PublikacjaA simple method of approximation of the ellipticalpatch with stepped-edge polygon is proposed as an introductionto wider studies over the planar ultrawideband (UWB) antennas.The general idea is to replace the elliptical patch with an equivalentpolygonal patch, with minimum loss in the performance. Theprinciples of the proposed method are presented in this letter, aswell as the results of performed numerical studies and its experimentalverification....
-
Generalized Gradient Equivariant Multivalued Maps, Approximation and Degree
PublikacjaConsider the Euclidean space Rn with the orthogonal action of a compact Lie group G. We prove that a locally Lipschitz G-invariant mapping f from Rn to R can be uniformly approximated by G-invariant smooth mappings g in such a way that the gradient of g is a graph approximation of Clarke’s generalized gradient of f . This result enables a proper development of equivariant gradient degree theory for a class of set-valued gradient...
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublikacjaWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
Entropy of water calculated from harmonic approximation: estimation of the accuracy of method
PublikacjaSome molecular dynamics simulations were performed for liquid TIP4P and SPC water at a constant density (1.00 g/cm(3)) and within the temperature range of 5-90 degrees C. By using harmonic approximation, both the entropy of water S-H and the specific heat c(v) were calculated, and the results were compared to literature data. It was found that harmonic approximation overestimates absolute entropy of TIP4P water by 5.6 J/mol K (similar...
-
Cavity-expansion approximation for projectile impact and penetration into sand
PublikacjaA one-dimensional problem of a spherical cavity expanding at a constant velocity from zero initial radius in an infinite granular medium, which has the first-kind self-similar solution, is considered. We are solving this dynamic spherical cavity-expansion problem to model rigid spheres penetrating into a granular media. Elastic–plastic deformation of the granular media is described in a barotropic approximation, using the high-pressure...
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublikacjaThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
Stability by linear approximation for time scale dynamical systems
PublikacjaWe study systems on time scales that are generalizations of classical differential or difference equations and appear in numerical methods. In this paper we consider linear systems and their small nonlinear perturbations. In terms of time scales and of eigenvalues of matrices we formulate conditions, sufficient for stability by linear approximation. For non-periodic time scales we use techniques of central upper Lyapunov exponents...
-
Errors of a Linear Current Approximation in High-Speed PMSM Drives
PublikacjaCurrent sampling techniques and predictive algorithms used in the digital control of electric drives rely on a simple mathematical model that assumes linear current changes upon constant supplying voltages. This paper identifies rotor movement as a factor that makes this assumption invalid when the rotor covers an angular distance of a few tens of degrees during the control interval duration. The errors of the linear current approximation...
-
Approaches to experiment based friction modeling: polynomial approximation versus ann approximation
PublikacjaBadano warunki (poziom wymuszeń), przy których następowało wzbudzenie drgań mechanicznych przy tarciu ślizgowym konforemnego skojarzenia próbek wykonanych z Al2O3 (płaskie czoło tulei obracającej się względem swojej osi - powierzchnia płaska). Uzyskane dane eksperymentalne wykorzystano następnie do zbudowania modeli - stosując aproksymację wielomianami albo sztuczną siecią neuronową (ANN).
-
Jaen Journal on Approximation
Czasopisma -
JOURNAL OF APPROXIMATION THEORY
Czasopisma -
Text-mining Similarity Approximation Operators for Opinion Mining in BI tools
PublikacjaThe concept of the Text-mining Similarity Approximation Operators for Opinion Mining as extensions to Natural Language Interface Database is defined. The new operators: “keywords of” dimension; subsetting operator “about C is q”; aggregation operator “by similar C” are proposed. These operators are based on the Latent Semantic Analysis and Social Network Analysis
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublikacjaWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...