Search
Filters
total: 252
Search results for: MINIMAL SURFACE
-
Minimal surfaces and conservation laws for bidimensional structures
PublicationWe discuss conservation laws for thin structures which could be modeled as a material minimal surface, i.e., a surface with zero mean curvatures. The models of an elastic membrane and micropolar (six-parameter) shell undergoing finite deformations are considered. We show that for a minimal surface, it is possible to formulate a conservation law similar to three-dimensional non-linear elasticity. It brings us a path-independent...
-
Minimal Sets of Lefschetz Periods for Morse-Smale Diffeomorphisms of a Connected Sum of g Real Projective Planes
PublicationThe dataset titled Database of the minimal sets of Lefschetz periods for Morse-Smale diffeomorphisms of a connected sum of g real projective planes contains all of the values of the topological invariant called the minimal set of Lefschetz periods, computed for Morse-Smale diffeomorphisms of a non-orientable compact surface without boundary of genus g (i.e. a connected sum of g real projective planes), where g varies from 1 to...
-
Minimal 2-dominating sets in Trees
PublicationWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3247^n). This leads to that every tree has at most 1.3247^n minimal 2-dominating sets. We also show that thisbound is tight.
-
Minimal double dominating sets in trees
PublicationWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
Vehicle detector training with minimal supervision
PublicationRecently many efficient object detectors based on convolutional neural networks (CNN) have been developed and they achieved impressive performance on many computer vision tasks. However, in order to achieve practical results, CNNs require really large annotated datasets for training. While many such databases are available, many of them can only be used for research purposes. Also some problems exist where such datasets are not...
-
Trees having many minimal dominating sets
PublicationWe provide an algorithm for listing all minimal dominating sets of a tree of order n in time O(1.4656^n). This leads to that every tree has at most 1.4656^n minimal dominating sets. We also give an infinite family of trees of odd and even order for which the number of minimal dominating sets exceeds 1.4167^n, thus exceeding 2^{n/2}. This establishes a lower bound on the running time of an algorithm for listing all minimal dominating...
-
Incremental construction of Minimal Tree Automata [online]
PublicationWe describe an algorithm that allows the incremental addition or removal of unranked ordered trees to minimal frontier-to-root deterministic tree automaton (DTA). The algorithm takes a tree t and a minimal DTA A as input; it outputs a minimal DTA A' which accepts the language L(A) accepted by A incremented (or decremented) with the tree t. The algorithm can be used to efficiently maintain dictionaries which store large collections...
-
Minimal transverse reinforcement of reinforced concrete members
PublicationW pierwszej części pracy omówiono zagadnienia dotyczące minimalnego zbrojenia na ścinanie elementów żelbetowych w kontekście norm europejskich oraz pozaeuropejskich. W drugiej części pracy dokonano analizy wyników badań eksperymentalnych dotyczących nośności elementów bez zbrojenia poprzecznego, które stanowią podstawę do weryfikacji zaleceń normowych w zakresie minimalnego zbrojenia na ścinanie.
-
Minimal and maximal solutions of differential equations with a singularmatrix.
PublicationPraca dotyczy zagadnień początkowych dla układów równań różniczkowych z macierzą osobliwą. Równania różniczkowo-algebraiczne są szczególnym przypadkiem takich zagadnień.Stosując metodę iteracji monotonicznych pokazano, że przy pewnych założeniach problem wyjściowy ma ekstremalne rozwiązania w pewnym sektorze.Teoretyczne rozważania zilustrowano przykładem.
-
Mixed systems with minimal and maximal lifetime variances
PublicationRozważa się mieszane układy złożone ze stałej liczby składników, których czasy zycia są niezależnymi zmiennymi losowymi o jednakowym rozkładzie i dodatniej wariancji. Bada się minimalną i maksymalną wariancję czasu życia rozważanych układów.
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Randomness Amplification under Minimal Fundamental Assumptions on the Devices
PublicationRecently, the physically realistic protocol amplifying the randomness of Santha-Vazirani sources producing cryptographically secure random bits was proposed; however, for reasons of practical relevance, the crucial question remained open regarding whether this can be accomplished under the minimal conditions necessary for the task. Namely, is it possible to achieve randomness amplification using only two no-signaling components...
-
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree
PublicationWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n) . This implies that every tree has at most 1.3248 n minimal 2-dominating sets. We also show that this bound is tigh.
-
An algorithm for listing all minimal double dominating sets of a tree
PublicationWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
Incremental and Semi-Incremental Construction of Pseudo-Minimal Automata
PublicationPrzedstawione zostają modyfikacje trzech algorytmów przyrostowego i półprzyrostowego tworzenia automatów minimalnych w taki sposób, aby tworzyły automaty pseudominimalne. Istniejący od dawna algorytm Revuza tworzy takie automaty szybciej i zużywając mniej pamięci, ale wymaga kłopotliwego sortowania. Nie nadaje się też do dodawania nowych słów do automatu - ważnej czynności w realizacji dynamicznej doskonałej funkcji mieszającej....
-
Incremental and pseudo-incremental construction of pseudo-minimal automata.
PublicationAutomaty pseudominimalne mają dla każdego słowa w języku automatu co najmniej jeden element własny (stan lub przejście), który nie jest współdzielony z żadnym innym słowem. Przedstawiamy przyrostowe i półprzyrostowe algorytmy tworzenia takich automatów.
-
Perfect hashing with pseudo-minimal bottom-up deterministic tree automata
PublicationWe describe a technique that maps unranked trees to their hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to techniques implemented with minimal tree automata, our procedure builds a pseudo-minimal DTA. Pseudo-minimal automata are larger than the minimal ones but in turn the mapping can be arbitrary, so it can be determined prior to the automaton construction. We also provide procedures to build incrementally...
-
Shape and force control of cable structures with minimal actuators and actuation
Publication -
Shape and force control of cable structures with minimal actuators and actuation
PublicationShape adjustment and stress control can be considered as one of the effective parameters in prestressed cable structures since such structures are widely constructed nowadays due to their characteristics. The assembly errors and applied loads hugely affect the cables’ nodal positions and stress due to their delicacy. The former could disturb the shape, which affects the appearance and the function of the structure. In contrast,...
-
Periodic expansion in determining minimal sets of Lefschetz periods for Morse–Smale diffeomorphisms
PublicationWe apply the representation of Lefschetz numbers of iterates in the form of periodic expansion to determine the minimal sets of Lefschetz periods of Morse–Smale diffeomorphisms. Applying this approach we present an algorithmic method of finding the family of minimal sets of Lefschetz periods for Ng, a non-orientable compact surfaces without boundary of genus g. We also partially confirm the conjecture of Llibre and Sirvent (J Diff...
-
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
PublicationWe describe a technique that maps unranked trees to arbitrary hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to other hashing techniques based on automata, our procedure builds a pseudo-minimal DTA for this purpose. A pseudo-minimal automaton may be larger than the minimal one accepting the same language but, in turn, it contains proper elements (states or transitions that are unique) for every input...
-
Minimal number of periodic points for smooth self-maps of S^3
PublicationW pracy wyznaczona została najmniejsza liczba punktów periodycznych w gładkiej klasie homotopii odwzorowania sfery trójwymiarowej w siebie.
-
Minimal number of periodic points for smooth self-maps of RP^3
PublicationNiech f będzie gładkim odwzorowaniem 3-wymiarowej rzeczywistej przestrzeni rzutowej w siebie, r będzie ustaloną liczbą naturalną. W artykule wyznaczona została minimalna liczba punktów r-periodycznych w gładkiej klasie homotopii odwzorowania f.
-
Minimal parameter implicit solvent model for ab initioelectronic-structure calculations
PublicationAbstract - We present an implicit solvent model for ab initio electronic-structure calculations which is fully self-consistent and is based on direct solution of the nonhomogeneous Poisson equation. The solute cavity is naturally defined in terms of an isosurface of the electronic density according to the formula of Fattebert and Gygi (J. Comput. Chem., 23 (2002) 662). While this model depends on only two parameters, we demonstrate...
-
Semi- incremental construction of minimal cyclic finite state automata usingcontinuation classes.
PublicationMinimalne automaty skończone są często wybierane do przedstawiania słowników morfologicznych języka naturalnego. Wśród ich zalet znajdują się duża szybkość rozpoznawania i małe wymagania pamięciowe. Tłumaczenie opisów morfologicznych opartych o klasy kontynuacji na minimalne, cykliczne automaty skończone jest tradycyjnie dokonywane w kilku fazach, zawierających tworzenie automatu niedeterministycznego z przejściami etykietowanymi...
-
Determination of the minimal critical rotational speeds of the circular saw blades with the quasi-twin resonant frequencies
PublicationTo determine the minimal critical rotational speeds of the circular saw blades is the fundamental aspect of obtaining the range of the rotational operating speeds, by which the circular saw blade can work with required stability. While for the circular saw blades with full-homogeneous bodies the determination of such rotational speeds is the relatively low level of difficulty function, whereas for circular saw blades with more...
-
Minimal number of periodic points of smooth boundary-preserving self-maps of simply-connected manifolds
PublicationLet M be a smooth compact and simply-connected manifold with simply-connected boundary ∂M, r be a fixed odd natural number. We consider f, a C1 self-map of M, preserving ∂M . Under the assumption that the dimension of M is at least 4, we define an invariant Dr(f;M,∂M) that is equal to the minimal number of r-periodic points for all maps preserving ∂M and C1-homotopic to f. As an application, we give necessary and sufficient...
-
Post-comatose patients with minimal consciousness tend to preserve reading comprehension skills but neglect syntax and spelling
PublicationModern eye tracking technology provides a means for communication with patients suffering from disorders of consciousness (DoC) or remaining in locked-in-state. However, being able to use an eye tracker for controlling text-based contents by such patients requires preserved reading ability in the first place. To our knowledge, this aspect, although of great social importance, so far has seemed to be neglected. In the paper, we...
-
Comparison of construction algorithms for minimal, acyclic, deterministicfinite state automata from sets of strings.
PublicationArtykuł porównuje różne metody tworzenia minimalnych, acyklicznych, deterministycznych automatów skończonych ze zbiorów słów. Wdrożone i porównane zostały metody przyrostowe, prawie przyrostowe i nieprzyrostowe.
-
An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds
PublicationFor a given self-map f of M, a closed smooth connected and simply-connected manifold of dimension m 4, we provide an algorithm for estimating the values of the topological invariant D^m_r [f], which equals the minimal number of r-periodic points in the smooth homotopy class of f. Our results are based on the combinatorial scheme for computing D^m_r [f] introduced by G. Graff and J. Jezierski [J. Fixed Point Theory Appl. 13 (2013),...
-
Estimation of the minimal number of periodic points for smooth self-maps of odd dimensional real projective spaces
PublicationLet f be a smooth self-map of a closed connected manifold of dimension m⩾3. The authors introduced in [G. Graff, J. Jezierski, Minimizing the number of periodic points for smooth maps. Non-simply connected case, Topology Appl. 158 (3) (2011) 276-290] the topological invariant NJD_r[f], where r is a fixed natural number, which is equal to the minimal number of r-periodic points in the smooth homotopy class of f. In this paper smooth...
-
Combinatorial scheme of finding minimal number of periodic points for smooth self-maps of simply connected manifolds
PublicationLet M be a closed smooth connected and simply connected manifold of dimension m at least 3, and let r be a fixed natural number. The topological invariant D^m_r [f], defined by the authors in [Forum Math. 21 (2009), 491-509], is equal to the minimal number of r-periodic points in the smooth homotopy class of f, a given self-map of M. In this paper, we present a general combinatorial scheme of computing D^m_r [f] for arbitrary dimension...
-
Database of the minimal sets of Lefschetz periods for Morse-Smale diffeomorphisms of a connected sum of g real projective planes.
Open Research DataMorse–Smale diffeomorphisms, structurally stable and having relatively simple dynamics, constitute an important subclass of diffeomorphisms that were carefully studied during past decades. For a given Morse–Smale diffeomorphism one can consider “Minimal set of Lefschetz periods”, which provides the information about the set of periodic points of considered...
-
Database of the minimal sets of Lefschetz periods for Morse-Smale diffeomorphisms of a connected sum of g tori
Open Research DataMorse–Smale diffeomorphisms, structurally stable and having relatively simple dynamics, constitute an important subclass of diffeomorphisms that have been carefully studied during past decades. For a given Morse–Smale diffeomorphism one can consider “Minimal set of Lefschetz periods”, which provides the information about the set of periodic points of...
-
Minimal number of periodic points for C^1 self-maps of compact simply-connected manifolds
PublicationNiech f będzie odwzorowaniem gładkiej zwartej i jednospójnej rozmaitości o wymiarze większym lub równym 3. W pracy zdefiniowany został topologiczny niezmiennik będący najlepszym dolnym oszacowaniem liczby punktów periodycznych w klasie gładkich odwzorowań homotopijnych z f.
-
General form of fixed point indices of an iterated C^1 map andinfiniteness of minimal periods
PublicationDla zwartego podzbioru punktów periodycznych gładkiego odwzorowania podana zostaje formuła na indeksy iteracji. Wynik stanowi uogólnienie rezultatu Chowa, Malleta-Pareta i Yorke'a.
-
Speaker Recognition Using Convolutional Neural Network with Minimal Training Data for Smart Home Solutions
PublicationWith the technology advancements in smart home sector, voice control and automation are key components that can make a real difference in people's lives. The voice recognition technology market continues to involve rapidly as almost all smart home devices are providing speaker recognition capability today. However, most of them provide cloud-based solutions or use very deep Neural Networks for speaker recognition task, which are...
-
BCR expression is decreased in meningiomas showing loss of heterozygosity of 22q within a new minimal deletion region
Publication -
An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds
Publication -
Minimal number of periodic points for smooth self-maps of two-holed 3-dimensional closed ball
PublicationDla ciągłego odwzorowania f przestrzeni określonej w tytule w siebie, które posiada rzeczywiste wartości własne na drugiej grupie homologii, wyznaczona została minimalna liczba punktów r-periodycznych w klasie wszystkich gładkich odwzorowań homotopijnych z f.
-
A strategy of minimal torque modifications in a question of actuation strategy for an over-actuated system of a planar walking robot
PublicationPraca opisuje zagadnienia modelowania i napędzania robotów kroczących. Na pewnych etapach ruchu, konstrukcje takie są układami napędzanymi nadmiarowo (liczba napędów/silników jest większa niż liczba stopni swobody układu). Dzieje się tak z uwagi na więzy jednostronne występujące w układzie. Dla układów płaskich, po pojawieniu się kontaktu koła i odnóża, układ o sześciu stopniach swobody przechodzi w układ o trzech stopniach swobody....
-
Comments on ''Incremental construction and maintenance of minimal finite-state automata'' by Rafael C. Carrasco and Mikel L. Forcada.
PublicationW opublikowanym niedawno artykule (czerwiec 2002) Rafael Carrasco i Mikel Forcada przedstawili dwa algorytmy: jeden dotyczący przyrostowego dodawania łańcuchów znaków do języka minimalnego, deterministycznego, cyklicznego automatu skończonego, drugi dotyczący przyrostowego usuwania łańcuchów znaków z automatu. Pierwszy algorytm jest uogólnieniem ,,algorytmu dla danych nieuporządkowanych'' - drugiego z dwóch przyrostowych algorytmów...
-
Algebraic periods and minimal number of periodic points for smooth self-maps of 1-connected 4-manifolds with definite intersection forms
PublicationLet M be a closed 1-connected smooth 4-manifolds, and let r be a non-negative integer. We study the problem of finding minimal number of r-periodic points in the smooth homotopy class of a given map f: M-->M. This task is related to determining a topological invariant D^4_r[f], defined in Graff and Jezierski (Forum Math 21(3):491–509, 2009), expressed in terms of Lefschetz numbers of iterations and local fixed point indices of...
-
Escherichia coli K-12 suppressor-free mutants lacking early glycosyltransferases and late acyltransferases. Minimal lipopolysaccharide structure and induction of envelope stress response.
PublicationTo elucidate the minimal lipopolysaccharide (LPS) structure needed for the viability of Escherichia coli, suppressor-free strains lacking either the 3-deoxy-d-manno-oct-2-ulosonic acid transferase waaA gene or derivatives of the heptosyltransferase I waaC deletion with lack of one or all late acyltransferases (lpxL/M/P) and/or various outer membrane biogenesis factors were constructed. Δ(waaC lpxL lpxM lpxP) and waaA mutants exhibited...
-
Biopsy needles coated with the antimicrobial coatings
PublicationDrug delivery systems are used to achieve higher therapeutic effects of medicaments in a specific diseased site with minimal toxicological effect. The used of biopolymers in drug delivery systems ensure the biocompatibility, biodegradability and low immunogenicity. Drug delivery systems enhance the drug delivery actively and can be used in different diseases. In this study, two types of polymer coatings were prepared and were...
-
Examining Impact of Speed Recommendation Algorithm Operating in Autonomous Road Signs on Minimum Distance between Vehicles
PublicationAn approach to a new kind of recommendation system design that suggests safe speed on the road is presented. Real data obtained on roads were used for the simulations. As part of a project related to autonomous road sign development, a number of measurements were carried out on both local roads and expressways. A speed recommendation model was created based on gathered traffic data employing the traffic simulator. Depending on...
-
Comparative study of a bottoming SRC and ORC for Joule–Brayton cycle cooling modular HTR exergy losses, fluid-flow machinery main dimensions, and partial loads
PublicationEnergy conversion efficiency increase in power plants with high-temperature gas-cooled reactors via implementation of the bottoming cycle was investigated under nominal and minimal thermal load of a high-temperature reactor (HTR). Heat transfer surface area and turbine outlet volumetric flow rate in bottoming cycles was also investigated. Water and two low-boiling point working fluids (ammonia and ethanol) were analyzed. Analyzed...
-
The Influence of Drying Temperature on Color Change of Hornbeam and Maple Wood Used as Surface and Inner Layers of Wood Composites
PublicationThe thermal treatment of wood changes its structure due to the degradation of wood polymers (cellulose, hemicellulose and lignin), so the physical properties of wood are either improved or degraded. Color changes apply not only to natural wood, but also to such wood composites for which some amount of glue is used in their construction (e.g., plywood, blockboard or laminboard). This article is focused on the analysis of hornbeam...
-
Design considerations for compact microstrip resonant cells dedicated to efficient branch-line miniaturization
PublicationA conventional compact microstrip resonant cell (CMRC)has been thoroughly investigated to enhance its slow-wave properties and subsequently ensure an efficient miniaturization of a microstrip circuit. The geometry of a classic CMRC has been improved in terms of slowwave effect in two progressive steps: (i) a single-element topology has been replaced with a double-element one and (ii) a high-impedance section has been refined by...
-
Waste printer ink as modifier for natural rubber/carbon black composites: No haste, use waste
PublicationFrom a sustainability perspective, achieving a greener future with a minimal carbon footprint requires maximizing waste materials' reuse. The four pillars of satisfying customer demands are processing, price, properties, and performance. Along with such a global policy, this work seeks to utilize waste printer ink (WPI) as a source of carbon in combination with low- and high-surface carbon black (LCB and HCB, respectively) additives...