Wyniki wyszukiwania - BazTech

1

Electrochemical Properties of Flexible Anode with SnO2 Nanopowder for Sodium-Ion Batteries

Kim Huihun, Sadan Milan K., Kim Changhyeon, Choi Ga-In, Seong Minjun, Cho Kwon-Koo, Kim Ki-Won, Ahn Jou-Hyeon, Ahn Hyo-Jun

Archives of Metallurgy and Materials

|

2021

|

Vol. 66, iss. 4

931--934

EN

Sodium-ion batteries (SiBs) have attracted substantial interest as an alternative to lithium-ion batteries because of the low cost. There have been many studies on the development of new anode materials that could react with sodium by conversion mechanism. SnO2 is a promising candidate due to its low cost and high theoretical capacity. However, SnO2 has the same problem as other anodes during the conversion reaction, i.e., the volume of the anode repeatedly expands and contracts by cycling. Herein, anode is composed of carbon nanofiber embedded with SnO2 nanopowder. The resultant electrode showed improvement of cyclability. The optimized SnO2 electrode showed high capacity of 1275 mAh g-1 at a current density of 50 mA g-1. The high conductivity of the optimized electrode resulted in superior electrochemical performance.

2

Literacje obrazów. Możliwości związków między słowem i obrazem w ramach nauk o mediacji sztuki

Milecka Daria

Systemy Wspomagania w Inżynierii Produkcji

|

2020

|

Vol. 9, iss. 1

102--111

PL

Artykuł podejmuje zagadnienia relacji między słowem i obrazem na obszarze nauk o mediacji sztuki. Definiuje ten obszar oraz pojęcie jego przedmiotu. Wyróżniając podstawowe sposoby mediacji między sferą wizualną a werbalną, podaje przegląd form, w których jest ona możliwa.

EN

The article deals with the relationship between word and image in the field of art mediation. It defines this area of study and its subject. Highlighting the basic methods of mediation between the visual sphere and the verbal sphere, it provides an overview of the forms in which it is possible.

3

Simple Linear Comparison of Strings in V -order

Alatabbi A., Daykin J. W., Rahman M. S., Smyth W. F.

Fundamenta Informaticae

|

2015

|

Vol. 139, nr 2

115--126

EN

In this paper we focus on a total (but non-lexicographic) ordering of strings called V - order. We devise a new linear-time algorithm for computing the V -comparison of two finite strings. In comparison with the previous algorithm in the literature, our algorithm is both conceptually simpler, based on recording letter positions in increasing order, and more straightforward to implement, requiring only linked lists.

4

Infinite Traces and Symbolic Dynamics - the Minimal Shift Case

Foryś W., Oprocha P.

Fundamenta Informaticae

|

2011

|

Vol. 111, nr 2

147-161

EN

We study interrelations between symbolic descriptions of concurrently evolving systems and underlying sequential dynamics. The basic framework for this research is formulated on the background of the theory of traces. We focus our interests on minimal shifts and t-shifts generated by them, that is shifts defined in the space of infinite real traces. We show that sets of infinite real traces generated by minimal shifts are always closed and, under some conditions, are also tshifts. Additional discussion for the case of small alphabets (containing at most four letters) is also provided.

5

Combinatorics of Unique Maximal Factorization Families (UMFFs)

Daykin D.E., Daykin J.W., Smyth W.F. (Bill)

Fundamenta Informaticae

|

2009

|

Vol. 97, nr 3

295-309

EN

Suppose a set W of strings contains exactly one rotation (cyclic shift) of every primitive string on some alphabet Σ. Then W is a circ-UMFF if and only if every word in Σ+ has a unique maximal factorization over W. The classic circ-UMFF is the set of Lyndon words based on lexicographic ordering (1958). Duval (1983) designed a linear sequential Lyndon factorization algorithm; a corresponding PRAMparallel algorithmwas described by J. Daykin, Iliopoulos and Smyth (1994). Daykin and Daykin defined new circ-UMFFs based on various methods for totally ordering sets of strings (2003), and further described the structure of all circ-UMFFs (2008). Here we prove new combinatorial results for circ-UMFFs, and in particular for the case of Lyndon words. We introduce Acrobat and Flight Deck circ-UMFFs, and describe some of our results in terms of dictionaries. Applications of circ-UMFFs pertain to structured methods for concatenating and factoring strings over ordered alphabets, and those of Lyndon words are wide ranging and multidisciplinary.

6

On the Completion of Codes in Submonoids with Finite Rank

Néraud J.

Fundamenta Informaticae

|

2006

|

Vol. 74, nr 4

549-562

EN

Let M be a submonoid of the free monoid A*, and let X Ě M be a variable length code (for short a code). X is weakly M-complete if and only if any word in M is a factor of some word in X* (cf [20]). In this paper, which is the full version of a result presented in [17], we are interested by an effective computation of a weakly M-complete code containing X, namely [^X] Ě M. In this framework, we consider the class of submonoids M of A* which have finite rank. We define the rank of M as the rank of the minimal automaton with behavior M, i.e. the smallest positive integer r such that a word w satisfies |Q.w| = r, where Q stands for the set of states (the action of the word w may be not defined on some state in Q). Regular submonoids are the most typical example of submonoids with finite rank. Given a submonoid with finite rank M Ě A*, and given a code X Ě M, we present a method of completion which makes only use of regular or boolean operations on sets. As a consequence, if M and X are regular sets then so is [^X].

7

Asymptotic Properties of the Factors of Words Over a Finite Alphabet

Tomescu I.

Fundamenta Informaticae

|

2005

|

Vol. 64, nr 1-4

463-470

EN

Let A be an alphabet of cardinality m, kn be a sequence of positive integers and w e A* (|w| = kkn). In this paper it is shown that if lim sup n→∞knn <1/lnm, then almost all words of length n over A contain the factor w, but if lim sup n→∞kn/lnn > 1/lnm, then this property is not true. Also, if lim inf...kn/lnn > 1/lnm , then almost all words of length n over A do not contain the factor w. Moreover, if lim...(ln n - knln m) = a e IR, then lim sup...|W(n,kn,w,A)|/m^n < 1-exp(-exp(a)) and liminf n→∞|W(n,kn,w,A)|/m^n >1-exp(-(1-1/m)exp(a)), where W(n,kn,w,A) denotes the set of words of length n over A containing the factor w of length kn.