203,269 research outputs found
Nagy László síremléke
No full textPossessori bejegyzés: Nagy Iván (kék ovális pecsét) (clv)Digitalizálta a DEENKLatinovics Mór s Bereczki György kedves bajtársaimnak vigasztalást! ha lehet! / Nagy Elek. - Nagy László rövid életrajza / Nagy Elek. - Nagy László apróbb dolgozatai. - Nagy László utazási naplótöredékei. - LevelezésekA DEENK díszműszint 921.952 helyrajzi számú példányának digitális másolataCsonka, Nagy László mellképe ([1] t.) és a p. [1-2]. hiányzi
1886. szeptember 18. - 1979. március 12.
No full textVerzár Frigyes munkáinak bibliográfiája: p. 18-63.Debreceni Egyetem Egyetemi és Nemzeti KönyvtárZs.-Nagy Imr
Synergistic benefits of group search in rats. Nagy et al.
No full textTrajectory data of the experimental trials. Single search trails of 32 rats, and group search trials for 4 groups of 8 rats. Each rat was marked with a unique 3-color barcode on its back (R: Red, O: Orange, G: Green, B: Blue, P: Purple). Rat ID consists of 4-letter code: 3 letters show the color blobs from head to tail, 1 letter for sex (F: Female, M: Male). We video recorded all trials using a low light sensitive camera fixed to the ceiling (Sony HDR-AX2000, 2.9 × 1.8 m2 field of view, 1920×1080 resolution, 25 fps de-interlaced).
Recorded video sequences were analyzed off-line with a custom-written software to obtain individual positions and orientations (for details see the latest source code from https://github.com/vasarhelyi).
Data is separated to 3 zip files: SingleTrials1-7 zip file contains single trials from the familiarization period, SingleTrials8-13 zip file contains single search trials used in the main analyses, GroupTrials zip file contains group trails for 4 different groups of 8 rats.
File name provides additional information in the following format:
trial identification and number, "_", date of experiment (YYYYMMDD format), "_", rat ID or group ID (group IDs are M12, M23, F12, F34), "_", target ID (where the reward is located range between 1 and 16)
(for example: single1_20150817_BGPM_target11, group1_20150901_M12_target9)
Data structure is indicated in each file as a comment line (#frame number ID x y orientation). Data columns are separated by tabulator. "frame" indicates frame number of the video record, "number" is the number of individuals, "ID" is the 4 letter identification code of the rat, "x" and "y" indicates pixel coordinates, "orientation" is the main orientation of the marker (parallel to the body and pointing towards the head) given as an angle between -180 and 180 in degrees. When the automated recognition is failed the data contains "NaN"
Az optimális szabadalmak elméletének magatartásgazdaságtani és nemzetközi közgazdasági kiterjesztése
No full textHeuristic Algorithms for Single and Multiple Depot Vehicle Routing Problems with Pickups and Deliveries.
No full textD. Boquet et P. Nagy : Plaidoyer pour une autre histoire des émotions
No full textCet article, "Une autre histoire des émotions", écrit à quatre mains par Damien Boquet & Piroska Nagy, est paru initialement en italien dans la Rivista storica italiana 128/2 (2016) sous le titre « Una storia diversa delle emozioni », un numéro consacré aux émotions : voir https://emma.hypotheses.org/2964 Argument : Dans cet article, notre objectif est de mettre en lumière la complexité généalogique d’une histoire culturelle des émotions telle que nous la pratiquons : ce cheminement part d’u..
Nagy György: Angol–magyar nagy kollokációszótár
No full textNagy György: Angol–magyar nagy kollokációszótár. Budapest: Tinta Könyvkiadó. 2020. 392 p. ISBN 978-963-4092-63-
Lower bounds on the minimum distance in Hermitian one-point differential codes
No full textIn \cite{KoNa} the authors computed the Weierstrass gap sequence of the Hermitian function field \mathbb{F}_{q^2}(\HC) at any place of degree , and obtained an explicit formula of the Matthews-Michel lower bound on the minimum distance in the associated differential Hermitian code where the divisor is, as usual, the sum of all but one
-degree -rational places of \mathbb{F}_{q^2}(\HC) and is a positive integer. For plenty of values of depending on , this provided improvements on the designed minimum distance of . Further improvements from were obtained in \cite{KoNa} relying on algebraic geometry. Here slightly weaker improvements are obtained from with the usual function-field method depending on linear series, Riemann-Roch theorem and Weierstrass semigroups. We also survey the known results on this subject
Hermitian codes from higher degree places
No full textMatthews and Michel \cite{Michel} investigated the minimum distances of certain algebraic-geometry codes arising from a higher degree place . In terms of the Weierstrass gap sequence at , they proved a bound that gives an improvement on the designed minimum distance. In this paper, we consider those of such codes which are constructed from the Hermitian function field \mathbb F_{q^2}(\HC). We determine the Weierstrass gap sequence where is a degree place of \mathbb F_{q^2}(\HC), and compute the Matthews and Michel bound with the corresponding improvement. We show more improvements using a different approach based on geometry. We also compare our results with the true values of the minimum distances of Hermitian -point codes, as well as with estimates due to Xing and Chen \cite{XC}
Hemisystems of the Hermitian surface
No full textWe present a new method for the study of hemisystems of the Hermitian surface
of
. The basic idea is to represent generator-sets of
by means of a maximal curve naturally embedded in
so that a sufficient condition for the existence of hemisystems may follow from results about maximal curves and their automorphism groups. In this paper we obtain a hemisystem in
for each p prime of the form
with an integer n. Since the famous Landau's conjecture dating back to 1904 is still to be proved (or disproved), it is unknown whether there exists an infinite sequence of such primes. What is known so far is that just 18 primes up to 51000 with this property exist, namely
. The scarcity of such primes seems to confirm that hemisystems of
are rare objects
- …
