Search in Publications

Found 6273 publications

Railway simulation with the CASSANDRA simulation system

Gábor Szucs

Publication Name: Journal of Computing and Information Technology

Publication Date: 2001-01-01

Volume: 9

Issue: 2

Page Range: 133-142

Description:

In this paper a railway simulator will be presented and illustrated with a railway network model, which is used for education, i.e. the training of railway system operators. The new railway simulation system is developed using a general simulation software, CASSANDRA that is usable not only for the railway network building but for planning, analysis and optimum finding as well.

Open Access: Yes

DOI: 10.2498/cit.2001.02.04

The structure of the univoque set in the big case

No authors available

Publication Name: Publicationes Mathematicae Debrecen

Publication Date: 2001-01-01

Volume: 59

Issue: 3-4

Page Range: 471-489

Description:

Let β > 1, Θ = 1/β, D = {0, 1, . . . , [β]}. In this paper we continue the investigation of the numbers which have only one expansion in the form ∑n=1∞ εnΘn with ε ∈ DN. We present a method for the determination of the Hausdorff dimension of the set of these numbers in the so-called big case, illustrated with interesting examples.

Open Access: No

DOI: DOI not available

A distance model for safety-critical systems

Miklós Szijártó Gabor Kallos Dietmár Gröger

Publication Name: Periodica Polytechnica Electrical Engineering

Publication Date: 2001-01-01

Volume: 45

Issue: 2

Page Range: 109-118

Description:

In this paper we introduce a new, theoretical model for safety-critical systems in which the distance from the dangerous conditions can be measured. To describe these systems we use besides the graph model Petri nets, too. We illustrate the theoretical discussion with some simple examples.

Open Access: Yes

DOI: DOI not available

Traffic-flow analysis for fast performance estimation of communication systems

Gábor Lencse

Publication Name: Journal of Computing and Information Technology

Publication Date: 2001-01-01

Volume: 9

Issue: 1

Page Range: 15-27

Description:

The traffic-flow analysis (TFA) is a promising method for the performance estimation of communication systems. TFA produces approximate results with much less computation (that is, much faster) than discrete-event simulation of the system. In the first step, TFA distributes the traffic in units of properly chosen size using the actual routing algorithm of the network. In the second step, TFA adjusts the time distribution of the traffic according to the finite capacities of the network. It was found that the results of TFA approximate the results of the analytical method well.

Open Access: Yes

DOI: 10.2498/cit.2001.01.02

Quantitative determination of protein of bacterial origin

No authors available

Publication Name: TrAC - Trends in Analytical Chemistry

Publication Date: 2001-01-01

Volume: 20

Issue: 1

Page Range: 42-48

Description:

Several methods have been developed for the determination of the proportion of nitrogen-containing substances of microbial origin in the digestive tracts of cattle. These include assays that use nucleic acids and adenosine triphosphate as indicators, radioisotopes 35S, 15N, 32P and 33P incorporated into bacterial protein and phospholipids, duodenal amino acid composition with amino-ethylphosphonic acid, diaminopimelic acid and D-alanine (D-Ala) contents as indicators. On the basis of the data in the literature on D-amino acid content of milk and milk products the authors came to the conclusion that D-glutamic acid (D-Glu) and D-aspartic acid (D-Asp) can be considered as markers for proteins of bacterial origin. To demonstrate this, experiments have been carried out and some of the results are reported here. © 2001 Elsevier Science B.V.

Open Access: No

DOI: 10.1016/S0165-9936(00)00053-4

On the set for which 1 is univoque

No authors available

Publication Name: Publicationes Mathematicae Debrecen

Publication Date: 2001-01-01

Volume: 58

Issue: 4

Page Range: 743-750

Description:

For some integer K ≥ 2 let εK be the set of those ⊖ ∈ (1/K + 1, 1/K ), for which 1 has only one expansion 1 = e1 ⊖ + e2 ⊖2 + . . . with digits ej ∈ {0, . . . , K}, (j =1, 2, . . . ). In this paper we prove, that the Lebesgue measure of the set εK is 0.

Open Access: No

DOI: DOI not available

The effect of the pollinizer variety on the berry weight of currants

A. Porpáczy Z. Vadas

Publication Name: Acta Horticulturae

Publication Date: 2001-01-01

Volume: 561

Issue: Unknown

Page Range: 263-267

Description:

At currant cultivars the level of self-fertility can characterised according to the results of open pollination and the differences in berry weight. This character appears in the habits of the racemes as well. For weakly self-fertile or partially selfsterile cultivars it is necessary to use some polliniser varieties to ensure a good yield. Usually, three of four cultivars should be planted together in an orchard.

Open Access: Yes

DOI: 10.17660/ActaHortic.2001.561.39

On the set for which 1 is univoque

I. Kátai Gabor Kallos

Publication Name: Publicationes Mathematicae Debrecen

Publication Date: 2001-01-01

Volume: 58

Issue: 4

Page Range: 743-750

Description:

For some integer K ≥ 2 let εK be the set of those ⊖ ∈ (1/K + 1, 1/K ), for which 1 has only one expansion 1 = e1 ⊖ + e2 ⊖2 + . . . with digits ej ∈ {0, . . . , K}, (j =1, 2, . . . ). In this paper we prove, that the Lebesgue measure of the set εK is 0.

Open Access: Yes

DOI: 10.5486/pmd.2001.2436

The structure of the univoque set in the big case

Gabor Kallos

Publication Name: Publicationes Mathematicae Debrecen

Publication Date: 2001-01-01

Volume: 59

Issue: 3-4

Page Range: 471-489

Description:

Let β > 1, Θ = 1/β, D = {0, 1, . . . , [β]}. In this paper we continue the investigation of the numbers which have only one expansion in the form ∑n=1∞ εnΘn with ε ∈ DN. We present a method for the determination of the Hausdorff dimension of the set of these numbers in the so-called big case, illustrated with interesting examples.

Open Access: Yes

DOI: 10.5486/pmd.2001.2581