An abstract is not available for this content so a preview has been provided. As you have access to content, full PDF via the ‘Save PDF’ action button.

Ez a cikk az FDM/FLM/FFF technológiát használó 3D nyomtatók vázszerkezetét, extruder- és nyomtatófej-kialakításait vizsgálja. Összehasonlítjuk különböző lehetőségeket, azt vizsgálva, hogy milyen hibalehetőségekkel kell számolnunk egy tetszőleges nyomtatónál, annak vázától egyéb mechanikai elemeivel bezárólag.

Let A be a finitely generated commutative algebra over a field K with a presentation A = K〈X1, . . . , Xn | R〉, where R is a set of monomial relations in the generators X1, . . . , Xn. So A = K[S], the semigroup algebra of the monoid S = 〈X1, . . . , Xn | R〉. We characterize, purely in terms of the defining relations, when A is an integrally closed domain, provided R contains at most two relati...

This paper reviews the coverage of formal Relational Algebra as it applies to distributed, federated databases in varying network topologies. The review shows that a number of Relational Algebra extensions allow distributed relations and federation of heterogeneous database schema. More concrete physical Relational Algebra extensions support access plans for multi-database query processing but ...

In the present paper, the resolution method for a linguistic propositional logic with truth value in a logical algebra refined hedge algebra, is focused. The preliminaries of refined hedge algebra are given first. Then the syntax and semantic of linguistic propositional are defined. Finally, a resolution method which based on resolution principle in two-valued logic is established. Accordingly,...

It is well known that some XML elements correspond to objects (in the sense of object-orientation) and others do not. The question we consider in this paper is what benefits we can derive from paying attention to such object semantics, particularly for the problem of keyword queries. Keyword queries against XML data have been studied extensively in recent years, with several lowest-common-ances...

This paper reviews the coverage of formal Relational Algebra as it applies to distributed, federated databases in varying network topologies. The review shows that a number of Relational Algebra extensions allow distributed relations and federation of heterogeneous database schema. More concrete physical Relational Algebra extensions support access plans for multi-database query processing but ...