Wyniki wyszukiwania - BazTech

1

Inheritance and Innovation of Folk Textile Mending Techniques under the Traditional Concept of Cherishing Things

Wu Xin, Shen Yu

Fibres & Textiles in Eastern Europe

|

2022

|

Vol. 30, no. 1 (151)

86--92

EN

Economised, thorough and skilful utilisation with the concept of cherishing things as its core thought is the basic design concept of traditional creation activities, implying profound philosophical thinking and life philosophy. This article, based on a theoretical interpretation of the traditional concept of cherishing things and combining methods including documents, material objects, manual restoration, etc., firstly expounds the influence and meaning of traditional Chinese folk textile mending in carrying out the concept of cherishing things in the contemporary era; secondly, it focuses on summarising the origin and development of the textile mending industry, pointing out the application prospects of hand darning techniques in nowadays market; and finally, via interpreting the comprehensive design of materials technology, pro-phase protection of preventive mending "smart creation" mode innovation of textiles, etc., this study specifically analyses the inheritance and innovation of folk textile mending techniques, so as to provide references for relevant industries and handicraft enthusiasts in the future.

2

Some Methodological Remarks Inspired by the Paper ”On inner classes” by A. Igarashi and B. Pierce

Langmaack H., Salwicki A.

Fundamenta Informaticae

|

2013

|

Vol. 122, nr 3

227--274

EN

In [14] an axiomatic approach towards the semantics of FJI, Featherweight Java with Inner classes, essentially a subset of the Java-programming language, is presented. In this way the authors contribute to an ambitious project: to give an axiomatic definition of the semantics of programming language Java.1 At a first glance the approach of reducing Java’s semantics to that of FJI seems promising. We are going to show that several questions have been left unanswered. It turns out that the theory how to elaborate or bind types and thus to determine direct superclasses as proposed in [14] has different models. Therefore the suggestion that the formal system of [14] defines the (exactly one) semantics of Java is not justified. We present our contribution to the project showing that it must be attacked from another starting point. Quite frequently one encounters a set of inference rules and a claim that a semantics is defined by the rules. Such a claim should be proved. One should present arguments: 10 that the system has a model and hence it is a consistent system, and 20 that all models are isomorphic. Sometimes such a proposed system contains a rule with a premise which reads: there is no proof of something. One should notice that this is a metatheoretic property. It seems strange to accept a metatheorem as a premise, especially if such a system does not offer any other inference rules which would enable a proof of the premise. We are going to study the system in [14]. We shall show that it has many non-isomorphic models. We present a repair of Igarashi’s and Pierce’s calculus such that their ideas are preserved as close as possible.

3

Zapis windykacyjny w obrocie gospodarczym : aspekty praktyczne

Łukaszyk J.

Studia i Materiały / Europejska Uczelnia Informatyczno-Ekonomiczna w Warszawie

|

2012

|

Nr 2(4)

43--53

PL

W październiku 2011 r. do polskiego systemu prawnego wprowadzona została instytucja zapisu windykacyjnego. W artykule dokonano analizy tej instytucji obowiązującej w innych systemach prawnych, w odniesieniu do takich jej aspektów, jak reguły ustanawiania zapisu oraz odpowiedzialność za długi spadkowe. W artykule podkreślono ponadto, że ten rodzaj zapisu odpowiada na potrzeby społeczne w zakresie istnienia takich instrumentów prawnych, które umożliwiają sprawne przechodzenie własności ze spadkobiercy na spadkodawców. Zwrócono uwagę, że poprzez zapis windykacyjny przedsiębiorcy mają możliwość sprawnego i skutecznego przenoszenia własności konkretnych przedmiotów majątkowych po ich śmierci. Wskazano zalety tego rodzaju zapisu, przede wszystkim w postaci uniknięcia długotrwałego postępowania spadkowego, czy też zapewnienia dalszego, bieżącego funkcjonowania przedsiębiorstw w przypadku śmierci ich właścicieli – w wielu przypadkach zapobiega to upadłości bądź likwidacji przedsiębiorstw.

EN

In October 2011 an amendment to the Civil Code introducing vindicatory legacy to the inheritance law enters into the force. In the article the author is trying to analyze this institution in other jurisdictions, regarding such aspects as the rules of legacy establishment and responsibility for inherited debts. The article emphasizes that vindicatory legacy is an answer to the social requirements, which allow the smooth transfer of ownership from the heirs to successors. It should be noted at this point that, by the vindicatory legacy institution, the entrepreneurs will be able to efficiently transfer ownership of particular items of property after death its owner. The article demonstrates the advantage of this kind of regulation by avoiding long term inheritance proceedings and allows the provision of continuity of enterprises in case of the death its owners – which could prevent the bankruptcy or liquidation of enterprises.

4

Problemy klas generycznych w języku Java

Spławski Z.

Prace Naukowe Instytutu Informatyki Stosowanej Politechniki Wrocławskiej. Konferencje

|

2007

399-410

PL

Do języka Java od wersji 5.0 wprowadzono klasy generyczne, czyli klasy parametryzowane innymi klasami. Na pierwszy rzut oka polimorfizm parametryczny w Javie przypomina szablony klas w języku C++, co zdaje się sugerować nawet składnia. Jest to jednak podobieństwo bardzo powierzchowne. Z jednej strony ułatwia wykorzystanie nowego mechanizmu programistom znającym C++; z drugiej jednak strony jest źródłem konfuzji spowodowanych inną semantyką klas generycznych w porównaniu z szablonami klas, wynikającą ze zupełnie innego sposobu ich implementacji. W niniejszej pracy podjęto próbę wyjaśnienia mechanizmu generyczności w Javie ze zwróceniem uwagi z jednej strony na istotne własności matematyczne, a z drugiej strony na semantykę, wynikającą ze sposobu zaimplementowania tego mechanizmu. Takie bardziej abstrakcyjne, lecz "inżynierskie" podejście do klas generycznych z pewnością ułatwi ich zrozumienie i będzie sprzyjać właściwemu zastosowaniu w praktyce.

EN

The most significant change made in Java programming language as implemented in JDK 5.0 and later versions was the addition of generic types (generics), which support classes with abstract type parameters that can be instantiated. Superficially generics in Java resemble templates in C++ which is suggested by the syntax. This is often the source of confusion, since the semantics is quite different. In this paper we shortly explain the most important mathematical properties of generics as well as the technique of erasure underlying the implementation of generics in Java.

5

Osnovy povyšeniâ kačestva atlivok detalej mašin

Šabajkovič V.

Archives of Foundry Engineering

|

2007

|

Vol. 7, iss. 1

19-24

EN

The mechanism of the directed increase the quality half-finished products as system of the organic influencing of construction and technological factors which through the coefficients of influencing (correlations) create all indexes of quality is examined. It is laid that every factor variously influences on all indexes of quality, keeping here intercommunication.

6

A foundation for refining concurrent objects

Büchi M., Sekerinski E.

Fundamenta Informaticae

|

2000

|

Vol. 44, Nr 1,2

25-61

EN

We study the notion of class refinement in a concurrent object-oriented setting. Our model is based on a combination of action systems and classes. An action system describes the behavior of a concurrent, distributed, or interactive system in terms of the atomic actions that can take place during the execution of the system. Classes serve as templates for creating objects. To express concurrency with objects, we add actions to classes. We define class refinement based on trace refinement of action systems. Additionally, we give a simulation-based proof rule. We show that the easier to apply simulation rule implies the trace-based definition of class refinement. Class refinement embraces algorithmic refinement, data refinement, and atomicity refinement. Atomicity refinement allows us to split large atomic actions into several smaller ones. Thereby, it paves the way for more parallelism. We investigate the special case of atomicity refinement by early returns in methods.

7

Building performance in Norway

Bjorberg S.

Prace Naukowe Instytutu Budownictwa Politechniki Wrocławskiej. Konferencje

|

1998

|

Vol. 71, nr 24

17-23

EN

The paper presents the Norwegian inheritance concerning maintenance procedures, experience today on building performance due to several research works and strategies for the future in the planning process to achieve better performance.

PL

Artykuł przedstawia historyczne doświadczenia norweskie dotyczące użytkowania i utrzymania obiektów budowlanych, dzisiejsze osiągnięcia w tej sferze budownictwa i związane z nimi prace oraz strategie planowania na przyszłość, w celu osiągnięcia lepszych wyników.

8

On the semantics of a semantic network

Analyti A., Spyratos N., Constantopoulos P.

Fundamenta Informaticae

|

1998

|

Vol. 36, nr 2,3

109-144

EN

We elaborate on the semantics of an enhanced object-oriented semantic network, where multiple instantiation, multiple specialization, and meta-classes are supported for both kinds of objects: entities and properties. By semantics of a semantic network, we mean the information (both explicit and derived) that the semantic network carries. Several data models use semantic networks to organize information. However, many of these models do not have a formalism defining what the semantics of the semantic network is. In our data model, in addition to the Isa relation, we consider a stronger from of specialization for properties, that we call restriction Isa, or Risa for short. The Risa relation expresses property value refinement. A distinctive feature of our data model is that it supports the interaction between Isa and Risa relations. The combination of Isa and Risa provides a powerful conceptual modeling mechanism. The user declares objects and relations between objects through a program. Reasoning is done through a number of (built-in) inference rules that allow for derivations both at instance and schema level. Through the inference rules, new objects and new relations between objects are derived. In our data model, inherited properties are considered to be derived objects. In addition to the inference rules, a number of (built-in) system constraints exist for checking the validity of a program.