115,557 research outputs found
Alexander G. Nagy
No full textPhotograph shows three-quarter length portrait of Alexander G. Nagy, professor of economics at St. Mary's University
Graphical Frobenius representations of non-abelian groups
No full textA group G has a Frobenius graphical representation (GFR) if there is a simple graph Γ whose full automorphism group is isomorphic to G acting on the vertices as a Frobenius group. In particular, any group G with a GFR is a Frobenius group and Γ is a Cayley graph. By very recent results of Spiga, there exists a function f such that if G is a finite Frobenius group with complement H and |G| > f(|H|) then G admits a GFR. This paper provides an infinite family of graphs that admit GFRs despite not meeting Spiga's bound. In our construction, the group G is the Higman group A(f, q0) for an infinite sequence of f and q0, having a nonabelian kernel and a complement of odd order
6. Nagy (G.), Greek Mythology and Poetics
No full textDubois Laurent. 6. Nagy (G.), Greek Mythology and Poetics. In: Revue des Études Grecques, tome 105, fascicule 502-503, Juillet-décembre 1992. p. 600
Ab initio absorption spectra of 3-tert-butylcyclohexene
No full textWe present an ab initio investigation of the optical properties of 3-tert-butylcyclohexene in both its conformers. The optical spectra, here the photoabsorption cross section, have been obtained within density-functional theory at the independent-particle level, and within time-dependent density-functional theory. The optical spectra of the two conformers show small but visible differences, hence suggesting that optical absorption experiments can discriminate among the two molecular geometries. To cite this article: K. Gadl-Nagy et al., C R. Physique 10 (2009). (C) 2008 Academie des sciences. Published by Elsevier Masson SAS. All rights reserved
A nagy repceormányos (Ceutorhynchus napi Gillenhal) észak-alföldi károsítása repcében
No full textA nagy repceormányosról hazánkban kevés híradást jelent és jelenik meg. A
legelismertebb hazai rovartani forrás, „A növényvédelmi állattan
kézikönyve” szerint hazánkban kártétele meglehetősen esetleges (Sáringer,
1990). A következőkben összefoglaljuk a fajra vonatkozó fontosabb
szakirodalmi ismereteket, és az érdeklődők elé tárjuk a közelmúltban
elvégzett vizsgálódásaink eredményét a nagy repceormányos északmagyarországi
előfordulásáról és kártételéről
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"
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
Az optimális szabadalmak elméletének magatartásgazdaságtani és nemzetközi közgazdasági kiterjesztése
No full textThe Vehicle Routing Problem with Divisible Deliveries and Pickups
No full textThe vehicle routing problem with divisible deliveries and pickups is a new and interesting model within
reverse logistics. Each customer may have a pickup and delivery demand that have to be served with
capacitated vehicles. The pickup and the delivery quantities may be served, if beneficial, in two separate visits.
The model is placed in the context of other delivery and pickup problems and formulated as a mixed-integer
linear programming problem. In this paper, we study the savings that can be achieved by allowing the pickup
and delivery quantities to be served separately with respect to the case where the quantities have to be served
simultaneously. Both exact and heuristic results are analysed in depth for a better understanding of the problem
structure and an average estimation of the savings due to the possibility of serving pickup and delivery
quantities separately
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}
- …
