Karta öfver Finland (Sektionen F5)

1 kartta :, vär. ;, 51 x 42,9 cm, lehti 58 x 50,3 cm

Karta öfver Finland (Sektionen E5)

1 kartta :, vär. ;, 51 x 42,8 cm, lehti 58 x 50,3 cm

Karta öfver Finland (Sektionen F4)

1 kartta :, vär. ;, 51 x 43,1 cm, lehti 58 x 50,3 cm

Suomen tiekartta Vägkarta över Finland / upprättad å lantmäteristyrelsen (3 /)

1 kartta :, vär. ;, 50 x 91 cm, kansi 26 x 12 cm, 1:200000

Suomen tiekartta Vägkarta över Finland / upprättad å lantmäteristyrelsen (6 /)

1 kartta :, vär. ;, 50 x 91 cm, kansi 26 x 13 cm, 1:200000

Suomen tiekartta Vägkarta över Finland / upprättad å lantmäteristyrelsen (5 /)

1 kartta :, vär. ;, 50 x 92 cm, kansi 26 x 12 cm, 1:200000

Jac. Ahrenberg ja historian perintö : Restaurointisuunnitelmat Viipurin ja Turun linnoihin 1800-luvun lopussa

Jac. Ahrenberg and Patrimony Restoration Plans for Viipuri and Turku Castles at the End of the 19th Century This dissertation examines the unrealized restoration plans for two castles in the Grand Duchy of Finland one located at Viipuri (Vyborg, nowadays in Russia), the other at Turku (in Swedish, Åbo) during the last decades of the 19th century. Both castles were used as prisons, barracks and warehouses. From the middle of the 19th century on, their restoration and transformation into museums and "national monuments" were demanded in the newspapers. The prison reform in the 1860s stimulated the documentation and debate concerning their future, but it was only at the beginning of the 1880s when their restoration became an official state-run project. The undertaking was carried out by Johan Jacob (Jac.) Ahrenberg (1847 1914), architect of the National Board of Public Buildings. By combining written sources with drawings and photographs, this dissertation examines the restoration projects, the two castles' significance and the ways in which they were investigated by scholars. The plans are analyzed in connection with restoration practices in France and Sweden and in the context of contemporary discussions concerning national art and patrimony. The thesis argues that these former castles of the Swedish crown were used to manifest the western roots of Finnish law and order, the lineage of power and the capacity of the nation to defend itself. However, because of their symbolism, their restoration became a politically delicate question concerning the role of the Swedish heritage in Finland's nation-building process. According to Jac. Ahrenberg's plans, the two castles were to be restored to their assumed appearance at the time of the Vasa dynasty. Consequently, the structures would have resembled castles in Sweden. It is suggested that one aim of the restoration plans was to transform the two buildings into monuments testifying to the common history of Sweden and Finland. They were meant to consolidate the Swedish basis of Finnish culture and autonomy and thus to secure them against the threatening implications of Russian imperialism. It seems that along with the changing ideals of architectural restoration and the need for an original Finnish architectural heritage, the political connotations associated with the castles were one reason why Jac. Ahrenberg's restoration plans were never realized.

Svobodníci; pokus o monografii ze sociálních dějin českých 15. a 16. století.

Mode of access: Internet.

Nas̆e doba; revue pro vĕdu, umĕní a z̆ivot sociálni.

Frequency varies.

Viipurin pamaus: historiallinen romaani

Lisäpainokset: 2-4. p. 1911. - 5. p. 1912.

On separation of concurrency and conflicts in acyclic process models

Recently, a new approach for structuring acyclic process models has been introduced. The algorithm is based on a transformation between the Refined Process Structure Tree (RPST) of a control flow graph and the Modular Decomposition Tree (MDT) of ordering relations. In this paper, an extension of the algorithm is presented that allows to partially structure process models in the case when a process model cannot be structured completely. We distinguish four different types of unstructuredness of process models and show that only two are possible in practice. For one of these two types of unstructuredness an algorithm is proposed that returns the maximally structured representation of a process model.

On application of structural decomposition for process model abstraction

Real world business process models may consist of hundreds of elements and have sophisticated structure. Although there are tasks where such models are valuable and appreciated, in general complexity has a negative influence on model comprehension and analysis. Thus, means for managing the complexity of process models are needed. One approach is abstraction of business process models-creation of a process model which preserves the main features of the initial elaborate process model, but leaves out insignificant details. In this paper we study the structural aspects of process model abstraction and introduce an abstraction approach based on process structure trees (PST). The developed approach assures that the abstracted process model preserves the ordering constraints of the initial model. It surpasses pattern-based process model abstraction approaches, allowing to handle graph-structured process models of arbitrary structure. We also provide an evaluation of the proposed approach.

Reducing complexity of large EPCs

Business processes are an important instrument for understanding and improving how companies provide goods and services to customers. Therefore, many companies have documented their business processes well, often in the Event-driven Process Chains (EPC). Unfortunately, in many cases the resulting EPCs are rather complex, so that the overall process logic is hidden in low level process details. This paper proposes abstraction mechanisms for process models that aim to reduce their complexity, while keeping the overall process structure. We assume that functions are marked with efforts and splits are marked with probabilities. This information is used to separate important process parts from less important ones. Real world process models are used to validate the approach.

Analysis of simplified variants of SHA-256

In this paper we analyse the role of some of the building blocks of SHA-256. We show that the disturbance-correction strategy is applicable to the SHA-256 architecture and we prove that functions Σ, σ are vital for the security of SHA-256 by showing that for a variant without them it is possible to find collisions with complexity 2^64 hash operations. As a step towards an analysis of the full function, we present the results of our experiments on Hamming weights of expanded messages for different variants of the message expansion and show that there exist low-weight expanded messages for XOR-linearised variants.