9616 research outputs found
Sort by
A case of apparently unlicensed NCIs in Slovenian
No full textSlovenian is considered a strict negative-concord (NC) language (Ilc 2008, Giannakidou & Zeijlstra 2017), its NCIs are only licensed in full-fledged sentences in the presence of a clausemate negator ne, (1) (Ilc 2019: 134). Gregorčič et al. (2024: 146-7) report that the claim is also generally confirmed by the data in the Gigafida 2.0 corpus, noting that what looks like the only cases with NCIs not in the scope of an anti-veridical operator, (2), actually contain independent lexical items. Other than this, NCIs not in the scope of an anti-veridical operator are only found in elliptical structures also missing a finite verb, e.g., fragment answers, (3) (Ilc 2019: 127).
(1) * (Ne) govori z nikomer. (2) V glavi imam čisti nič.
neg speaks with noone in head have complete nothing
‘He/she speaks with noone.’ ‘There is a complete void in my head.’
(based on Gregorčič et al 2024: 146) (Gregorčič et al 2024: 147)
(3) Koga si videl? Nikogar.
who aux see noone
‘Who did you see? Nobody.’ (Ilc 2019: 127)
However, (4) shows an abundantly attested construction that contains a finite verb, an NCI and no negator. As we find no other evidence suggesting that Slovenian is not a strict NCI language, we look at what else might set this construction apart from canonical cases of NCI-containing clauses, and how one could analyze it.
(4) Vsi vidijo, kaj se dogaja, ukrepa pa nihče. (Gigafida 2.0)
all see what refl happens acts but noone
‘Everyone sees what’s going on, but noone acts.’
Besides the presence of the NCI in (4), the construction also supports other hallmarks of the presence of Slovenian clausal negation, e.g., the genitive of negation, (5), and strong NPIs.
(5) Zareza je zgolj tam in zavzema prostor, daje pa ničesar. (www)
notch aux just there and takes space.acc gives but nothing.gen
‘The notch is just there and takes up space, but it gives nothing.’
This suggests that despite appearances, the structure nevertheless contains negation.
The presence of an elided negator has also been suggested for coordinate structures, comparisons and fragment answers (Ilc 2019). One difference between these and (4)-(5) is that the former show no restrictions regarding the presence of a future/past/conditional-forming auxiliary. The absence of the negator in (4)-(5), though, is possible only when there is no auxiliary, either with a present finite verb, as in (4), or with a participle without an auxiliary, (6).
(6) Jedli so/bojo vsi, plačal pa (*je/*bo) noben.
eaten are/will all paid but is/will noone
‘Everyone ate/will eat, but noone paid/will pay.’
Another difference is that constructions like fragment answers are known from all NC languages while the construction from (4)-(5) is absent in NC languages like Czech, Russian, BCMS, Greek.
We will argue that our construction results from the preposing of the VP to the left periphery, preceded by the extraction of ‘noone’/‘nothing’ in (4)-(5), and followed by post-VP-preposing deletion of ne. We will also discuss the blocking of ne-deletion by auxiliaries, optionality of/cross-speaker variation in ne deletion, etc
Reduced-order adaptive observer for rectangular descriptor systems with incremental quadratic constraints
No full textThis paper investigates the challenge of reduced-order adaptive observer design for nonlinear rectangular descriptor systems. Nonlinearities satisfying incremental quadratic constraints are explored that cover Lipschitz, one-sided Lipschitz, monotone, and many other nonlinearities. The complexity of the problem lies in the presence of unknown parameters in the nonlinear part of the system that have to be estimated along with system states simultaneously. Orthogonal transformations reduce the system to an equivalent form that contains nonlinearities in the output. Under certain rank assumptions, the observer\u27s existence conditions are simplified as an adaptation law, a set of algebraic constraints, and the solvability of a linear matrix inequality. A numerical simulation is provided to illustrate the findings
Exploiting circular shifts for efficient chaotic image encryption
No full textThis work presents a chaotic image encryption algorithm that acts on the binary level of the image for effective permutation, and on the byte level for substitution. The permutation step combines actions of bit level rearranging, and bit shuffling. Circular shift operations are used for bit shuffling, to reduce the execution time. Circular shifts are also applied to shuffle the permutation and substitution rules, effectively increasing security at a very low execution cost. The encryption keys are plaintext dependent, and a key mixing step in included, so that each part of the key affects all the subsequent encryption operations. For the encryption, a new Soboleva hyperbolic tangent based map is first designed. The dynamical behavior of the map is studied and shows robust chaos, and an absence of equilibria, meaning that it can generate hidden attractors. This map is used as an entropy source, along with a chaotic pseudo random number generator (PRNG). The encryption process shows a good performance under a collection of tests, and has also a low execution time, 0.0134 sec for a 256 × 256 image, 0.0530 sec for a 512 × 512 image, and 0.2050 sec for a 1024×1024 image. So the proposed algorithm is a viable option for fast, efficient, and secure data encryption
Generalized Vertigo maps
No full textThis work proposes a generalization of the family of chaotic maps without fixed points, proposed by [ Jafari et al. , 2016 ] and termed the Vertigo maps. The original map family is parameterized by four control parameters, which can be used to scale the function used as a seed and control its domain. Several theoretical results are provided regarding the existence of the fixed points, the periodic cycles, and the Lyapunov exponents of the maps. Furthermore, two map examples are provided based on the logistic and tent seed functions, which are then studied using a series of numerical tools, like phase portraits, bifurcation diagrams, and Lyapunov exponent diagrams. Finally, an application to a Pseudo-Random Bit Generator is considered. The generator utilizes an exponential-based hash function in combination with the remainder operator
Composition of fuzzy numbers with chaotic maps
No full textIn the research on chaotic systems, which are used for cryptography and secure communication schemes, a key characteristic is the introduction of novel chaotic systems, usually by adding complexity to the existing ones in order to ensure security. In this direction, this chapter proposes novel chaotic systems, which are the composition of fuzzy numbers with the existing chaotic maps. In particular, the composition of the Gaussian fuzzy number with the logistic, sine, and Chebyshev chaotic maps is introduced. The resulting maps exhibit more complex behaviours compared to their classic counterparts, presenting interesting chaos-related phenomena, such as antimonotonicity, crisis, coexisting attractors, and period doubling route to chaos. To showcase the aforementioned results, the well-known tools for studying the behaviour of chaotic systems are being used, namely bifurcation diagrams and Lyapunov exponent diagrams.In the research on chaotic systems, which are used for cryptography and secure communication schemes, a key characteristic is the introduction of novel chaotic systems, usually by adding complexity to the existing ones in order to ensure security. In this direction, this chapter proposes novel chaotic systems, which are the composition of fuzzy numbers with the existing chaotic maps. In particular, the composition of the Gaussian fuzzy number with the logistic, sine, and Chebyshev chaotic maps is introduced. The resulting maps exhibit more complex behaviours compared to their classic counterparts, presenting interesting chaos-related phenomena, such as antimonotonicity, crisis, coexisting attractors, and period doubling route to chaos. To showcase the aforementioned results, the well-known tools for studying the behaviour of chaotic systems are being used, namely bifurcation diagrams and Lyapunov exponent diagrams
Adaptive chaotic maps in cryptography applications
No full textChaotic cryptography is a promising area for the safe and fast transmission, processing, and storage of data. However, many developed chaos-based cryptographic primitives do not meet the size and composition of the keyspace and computational complexity. Another common problem of such algorithms is dynamic degradation caused by computer simulation with finite data representation and rounding of results of arithmetic operations. The known approaches to solving these problems are not universal, and it is difficult to extend them to many chaotic systems. This chapter describes discrete maps with adaptive symmetry, making it possible to overcome several disadvantages of existing chaos-based cryptographic algorithms simultaneously. The property of adaptive symmetry allows stretching, compressing, and rotating the phase space of such maps without significantly changing the bifurcation properties. Therefore, the synthesis of one-way piecewise functions based on adaptive maps with different symmetry coefficients supposes flexible control of the keyspace size and avoidance of dynamic degradation due to the embedded technique of perturbing the chaotic trajectory
Byzantine hymn recognition with audio fingerprints resistant to noise, tempo and scale changes
No full textIn this study, an audio fingerprinting approach is utilized that was successfully used for Byzantine hymn recogni tion. The process is based on the extraction of time and scale invariant fingerprints using the two-dimensional Fourier Transform (2DFT). It also involves a matching process between fingerprints based on a distance metric calculated from similarity matrices. The proposed method was evaluated on a database of 351 live hymn recordings as well as different noise scenarios and exhibited high accuracy