Wyszukiwarka
Filtry
wszystkich: 457
wybranych: 312
Wyniki wyszukiwania dla: Born-Oppenheimer approximation
-
Born–Oppenheimer potential energy curves of NaK from the optimised atomic basis sets
PublikacjaThe article presents adiabatic potential energy curves of the ground and excited electronic states for the diatomic NaK molecule. The calculations were made using the ab initio computational methods to include electron correlation. The studied molecule was calculated as the effective two-electron problem, in which only the valence electrons of the molecule are explicitly taken into account. The remaining electrons with atomic nuclei...
-
Potential energy surfaces of the low-lying electronic states of the Li+LiCs system
PublikacjaAb initio quantum chemistry calculations are performed for the mixed alkali triatomic system. Global minima of the ground and first excited doublet states of the trimer are found and Born-Oppenheimer potential energy surfaces of the Li atom interacting with the LiCs molecule were calculated for these states. The lithium atom is placed at various distances and bond angles from the lithium-caesium dimer. Three-body nonadditive forces...
-
Performance of extended Lagrangian schemes for molecular dynamics simulations with classical polarizable force fields and density functional theory
PublikacjaIterative energy minimization with the aim of achieving self-consistency is a common feature of Born-Oppenheimer molecular dynamics (BOMD) and classical molecular dynamics with polarizable force fields. In the former, the electronic degrees of freedom are optimized, while the latter often involves an iterative determination of induced point dipoles. The computational effort of the self-consistency procedure can be reduced by re-using...
-
Low-energy positron collisions with water: elastic and rotationally inelastic scattering
PublikacjaDifferential, integral and momentum transfer cross sections for the vibrationally elastic and rotationally inelastic scattering of positrons from water at low collision energy (E ≤ 10 eV) are reported. Several models within the R-matrix method are used to compute the body-fixed T-matrices, while the scattering calculations are performed within the fixed-nuclei approximation corrected with the standard Born-closure formula. These...
-
Semantic Driven Table Understanding in Born-Digital Documents
PublikacjaThis paper presents a new approach to table understanding, suitable for born-digital PDF documents. Advance beyond the current state of the art in table understanding is provided by the proposed reverse MVC method, which takes advantage of only partial logic structure loss (degradation) in born-digital PDF documents, as opposed to unrecoverable loss (deterioration) taking place in scan based PDF documents.
-
Internationalization of Born Globals from Theoretical Perspective
PublikacjaThe paper discusses the evolution of theoretical approaches towards internationalisation process of firms, especially SMEs. It clarifies the definitions of born global (BG) firm, presents its characteristics and the specifics of its internationalisation process. The objective of this paper is to present internationalisation process of born global firm from theoretical perspective. The article starts with presentation of the oldest...
-
International Startups from Poland: Born Global or Born Regional?
Publikacja -
Determinanty tempa internacjonalizacji przedsiębiorstw ze szczególnym uwzględnieniem born globals
PublikacjaCelem artykułu jest przedstawienie czynników internacjonalizacji przedsiębiorstw, przede wszystkim born globals. Przedstawione zostały teorie internacjonalizacji przedsiębiorstw i ich ewolucja. Szczególny nacisk położono na wczesną i szybką internacjonalizację przedsiębiorstw. W części empirycznej przedstawiono wyniki badań przeprowadzonych na próbie 355 polskich zinternacjonalizowanych przedsiębiorstw.
-
Extraction of information from born-digital PDF documents for reproducible research
PublikacjaBorn-digital PDF electronic documents might reasonably be expected to preserve useful data units of their source originals that suffice to produce executable papers for reproducible research. Unfortunately, developers of authoring tools may adopt arbitrary PDF generation strategies, producing a plethora of internal data representations. Such common information units as text paragraphs, tables, function graphs and flow diagrams,...
-
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).
-
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...
-
The Method of a Two-Level Text-Meaning Similarity Approximation of the Customers’ Opinions
PublikacjaThe method of two-level text-meaning similarity approximation, consisting in the implementation of the classification of the stages of text opinions of customers and identifying their rank quality level was developed. Proposed and proved the significance of major hypotheses, put as the basis of the developed methodology, notably about the significance of suggestions about the existence of analogies between mathematical bases of...
-
Familiness and Born Globals: Rapid Internationalisation among Polish Family Firms
Publikacja -
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublikacjaConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
Approximation of the non-linear roll damping
PublikacjaArtykuł omawia, jak otrzymać oszacowanie nieliniowego momentu tłumiącehgo kołysania boczne okretu za pomocą zapisu przebiegu kołysań swobodnych modelu okrętu. Udowadnia, że 1) moment tłumiący w kategoriach aproksymacji jest nieanalityczną funkcją nieparzystą prędkosci kołysań, 2) standardowa metoda, oparta na stosunku dwóch kolejnych amplitud, ma ograniczone zastosowanie, do niezbyt dużych amplitud kołysań. Zaproponowano nową metodą...
-
Approximation of Fractional Order Dynamic Systems Using Elman, GRU and LSTM Neural Networks
PublikacjaIn the paper, authors explore the possibility of using the recurrent neural networks (RNN) - Elman, GRU and LSTM - for an approximation of the solution of the fractional-orders differential equations. The RNN network parameters are estimated via optimisation with the second order L-BFGS algorithm. It is done based on data from four systems: simple first and second fractional order LTI systems, a system of fractional-order point...
-
Approximation of extremal solutions for functional differential equations
PublikacjaDyskutowane są równania różniczkowe funkcyjne z liniowym warunkiem brzegowym. Podano warunki dostateczne dla istnienia ciągów monotonicznych, aproksymujących rozwiązania ekstremalne badanych zagadnień.
-
Approximation of Covariance Function with Application to Stochastic Mechanics.
PublikacjaW pracy przedstawiono koncepcję rozwinięć kanonicznych dla funkcji losowych oraz możliwość ich zastosowania w stochastycznej mechanice gruntów. Rozpatrzono rozkład widmowy, rozwinięcia Karhunena-Loevego oraz rozwinięcia ortogonalne zmodyfikowanymi wielomianami Hermite'a. Przeprowadzono analizę błędów dla zagadnienia warstwy gruntu o losowych parametrach sprężystych, uzyskano analityczne rozwiązanie systemu stochastycznego.
-
Nonquadratic quality indices in estimation, approximation and control
PublikacjaZaproponowano wykorzystanie niekwadratowych miar jakości w zagadnieniach estymacji parametrów modeli, aproksymacji funkcji okresowych oraz syntezy układów sterowania. Rozważono funkcje celu w postaci ważonych sum lub całek wartości bezwzględnej błędu predykcji. Ponieważ tego typu wskaźniki jakości są w swoich ekstremach nieróżniczkowalne, zadanie minimalizacji funkcji celu rozwiązano stosując iteracyjny algorytm kolejnych przybliżeń....
-
Approximation task decomposition for artificial neural network.
PublikacjaW pracy przedstawiono wpływ dekompozycji zadania na czasochłonność projektowania oraz dokładność i szybkość obliczeń sztucznej sieci neuronowej wykorzystanej do rozwiązania rzeczywistego problemu technicznego, którego matematyczny model był znany. Celem obliczeń prowadzonych przez sieć neuronową było określenie wartości współczynnika przepływu m na podstawie znajomości wartości: przewodności dźwiękowej C i średnicy przewodu d (a...
-
"Born Poland, Gone Global". The case of successful Polish ICT company - Aiton Caldwell
PublikacjaThis work examines the pathway to global markets of Polish ICT company Aiton Caldwell
-
An approximation algorithm for maximum P3-packing in subcubic graphs
PublikacjaW pracy podano algorytm 4/3-przyliżony dla trudnego obliczeniowo problemu umieszczania wierzchołkowo rozłącznych dwukrawędziowych ścieżek w grafach o stopniu maksymalnym 3 i stopniu minimalnym 2. Poprawiono tym samym wcześniejsze wyniki dla grafów kubicznych (A. Kelmans, D. Mubayi, Journal of Graph Theory 45, 2004).
-
An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
Publikacja -
Stability by linear approximation for time scale dynamical systems
Publikacja -
Band structure, Born effective charges, and lattice dynamics of CuInS2 from ab initio calculations
Publikacja -
Approximation strategies for routing edge disjoint paths in complete graphs
PublikacjaPraca dotyczy problemu ścieżek krawędziowo rozłącznych w nieskierowanych grafach pełnych, dla którego podano nowe algorytmy przybliżone: 3.75-przybliżony (model off-line) i 6.47-przybliżony (model on-line). Stosując podobną metodologię, uzyskano algorytm 4.5-przybliżony (off-line) i 6-przybliżony (on-line) dla problemu routingu i kolorowania ścieżek w grafach pełnych.
-
The optimisation of induction heating system based on multiquadric function approximation
Publikacja -
A Criterion for Conditional Instability by the First Approximation for Solutions of Differential Systems
Publikacja -
Piece-wise constant approximation method of identification of RTS noise
PublikacjaPrzedstawiono nową metodę wydzielania szumów RTS z całkowitych szumów przyrządów półprzewodnikowych. Metoda ta oparta jest na aproksymacji liniowo odcinkowej przebiegu szumowego.Przedstawiono wyniki zastosowania tej metody do wydzielenia dwupoziomowego szumu RTS z szumu przyrządu półprzewodnikowego.
-
Quadratic approximation of solutions for differential equations with nonlinear boundary conditions.
PublikacjaZastosowano metodę kwazilinearyzacji i sformułowano warunki dostateczne przy których iteracje monotoniczne są kwadratowo zbieżne do jedynego rozwiązania wymienionego w tytule zagadnienia różniczkowego. Uzyskane wyniki uogólniają niektóre wcześniej publikowane rezultaty gdy warunek brzegowy był liniowy.
-
Note on the Harmonic Approximation in the Treatment of Entanglement: N Cold Trapped Ions
Publikacja -
Separation of variables in molecular-dynamics simulations: A criterion to estimate the quality of the approximation
Publikacja -
Numerical approximation of first order partial differential equations withdeviated variables.
PublikacjaKlasyczne rozwiązania nieliniowego zagadnienia Cauchy´ego określone na piramidzie Haara są aproksymowane za pomocą rozwiązań układów quasiliniowych równań różnicowych. Stabilność schematu różnicowego jest wykazana metodą porównawczą z zastosowaniem nieliniowych oszacowań typu Perrona dla danych funkcji. Podano przykłady numeryczne.
-
Justification of quasi-stationary approximation in models of gene expression of a self-regulating protein
PublikacjaWe analyse a model of Hes1 gene transcription and protein synthesis with a negative feedback loop. The effect of multiple binding sites in the Hes1 promoter as well as the dimer formation process are taken into account. We consider three, possibly different, time scales connected with: (i) the process of binding to/dissolving from a binding site, (ii) formation and dissociation of dimers, (iii) production and degradation of Hes1...
-
Application of the Least Squares Method to the approximation of equally spaced samples in frequency measurement approach
Publikacja -
approximation of photonic crystal fibres with large air holes by the step index fibre model
PublikacjaAn equivalent step index fibre with a silica core and air cladding is used to model photonic crystal fibres with large air holes. We model this fibre for linear polarisation (we focus on the lowest few transverse modes of the electromagnetic field). The equivalent step index radius is obtained by equating the lowest two eigenvalues of the model to those calculated numerically for the photonic crystal fibres. The step index parameters...