Search results for "Rating"

Transverse resolution improvement using rotating-grating time-multiplexing approach

2008

The ability to improve the limited resolving power of optical imaging systems while approaching the theoretical diffraction limit has been an attractive discipline with growing interest over the last years due to its benefits in many applied optics systems. This paper presents a new approach to achieve transverse superresolution in far-field imaging systems, with direct application in both digital microscopy and digital holographic microscopy. Theoretical analysis and computer simulations show the validity of the presented approach.

Hologram development by diffusion in a polymer glass

2003

Thick rigid polymer media with diffusive development of gratings are suitable for archive information storage, and especially for 3D holographic optical elements. Diffusion of unreacted molecules of photosensitive dye ensures postexposure growth of diffracted light, which can be followed either by secondary growth, or by some decay caused by displacement of chromophore groups photochemically attached to polymer chains (photoproduct). In a long run, extremely slow, though still finite, diffusion of macromolecules leads to destruction of a holographic grating. Not only the rate, but also the shape of postexposure kinetics noticeably depends on the choice of particular polymer, its degree of p…

Proceedings of ATEE Spring conference "Innovations, Technologies and Research in Education, 2019"

2019

An efficient VM-based software protection

2011

This paper presents Truly-protect, a system, incorporating a virtual machine, that enables execution of encrypted programs. Our intention is to form a framework for a conditional access/digital rights management system.

Generalized Schröder permutations

2013

We give the generating function for the integer sequence enumerating a class of pattern avoiding permutations depending on two parameters: m and p. The avoided patterns are the permutations of length m with the largest element in the first position and the second largest in one of the last p positions. For particular instances of m and p we obtain pattern avoiding classes enumerated by Schroder, Catalan and central binomial coefficient numbers, and thus, the obtained two-parameter generating function gathers under one roof known generating functions and expresses new ones. This work generalizes some earlier results of Barcucci et al. (2000) [2], Kremer (2000) [5] and Kremer (2003) [6].

Restricted 123-avoiding Baxter permutations and the Padovan numbers

2007

AbstractBaxter studied a particular class of permutations by considering fixed points of the composite of commuting functions. This class is called Baxter permutations. In this paper we investigate the number of 123-avoiding Baxter permutations of length n that also avoid (or contain a prescribed number of occurrences of) another certain pattern of length k. In several interesting cases the generating function depends only on k and is expressed via the generating function for the Padovan numbers.

Combinatorial aspects of L-convex polyominoes

2007

We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an ''L'' shaped path in one of its four cyclic orientations. The paper proves bijectively that the number f"n of L-convex polyominoes with perimeter 2(n+2) satisfies the linear recurrence relation f"n"+"2=4f"n"+"1-2f"n, by first establishing a recurrence of the same form for the cardinality of the ''2-compositions'' of a natural number n, a simple generalization of the ordinary compositions of n. Then, such 2-compositions are studied and bijectively related to certain words of a regular language over four letters which is in turn bijectively related to L-convex polyominoes. In …

Defining relations of minimal degree of the trace algebra of 3×3 matrices

2008

Abstract The trace algebra C n d over a field of characteristic 0 is generated by all traces of products of d generic n × n matrices, n , d ⩾ 2 . Minimal sets of generators of C n d are known for n = 2 and n = 3 for any d as well as for n = 4 and n = 5 and d = 2 . The defining relations between the generators are found for n = 2 and any d and for n = 3 , d = 2 only. Starting with the generating set of C 3 d given by Abeasis and Pittaluga in 1989, we have shown that the minimal degree of the set of defining relations of C 3 d is equal to 7 for any d ⩾ 3 . We have determined all relations of minimal degree. For d = 3 we have also found the defining relations of degree 8. The proofs are based …

Dyck paths with a first return decomposition constrained by height

2018

International audience; We study the enumeration of Dyck paths having a first return decomposition with special properties based on a height constraint. We exhibit new restricted sets of Dyck paths counted by the Motzkin numbers, and we give a constructive bijection between these objects and Motzkin paths. As a byproduct, we provide a generating function for the number of Motzkin paths of height k with a flat (resp. with no flats) at the maximal height. (C) 2018 Elsevier B.V. All rights reserved.KeywordsKeyWords Plus:STATISTICS; STRINGS

A loopless algorithm for generating the permutations of a multiset

2003

AbstractMany combinatorial structures can be constructed from simpler components. For example, a permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a combination. In this paper we present a constructor for combinatorial structures, called shuffle on trajectories (defined previously in a non-combinatorial context), and we show how this constructor enables us to obtain a new loopless generating algorithm for multiset permutations from similar results for simpler objects.