Requirements Evolution, Requirements Documents Requirements Documents Evolution and Synchronization with Activities in the Refined Requirements Generation Model

Over the past few years the real importance of requirements engineering has surfaced; hence, much research is now being directed towards generating quality requirements. However, the existing requirements generation models do not sufficiently stress the importance of identifying intermediate requirements documents. In addition, the models rarely specify how those documents support the objectives of the related activities. Moreover, the current models fail to depict how requirements are transformed, in terms of content and format, as we transition through the requirements engineering process. To address these concerns, we propose a comprehensive requirements generation model consisting of two main parts – (1) a refined set of activities (of the model) with explicitly enunciated objectives, and (2) a detailed characterization of requirements documents generated throughout the requirements engineering process. The proposed model refines the Requirements Generations Model (RGM) into detailed activities to reflect an appropriate level of abstraction, so that we can more accurately represent the intermediate development of the requirements documents. Furthermore, th

モンゴル タンケイシ ニ ヨル モンゴルジン ノ ヨウシキ シコウ トクチョウ ノ ショウカイ

論

Habitat Occupancy and Mobility of the Violet Copper ( Lycaena helle ) in West Khentii, Northern Mongolia

The violet copper ( Lycaena helle Denis & Schiffermueller, 1775) was studied using mark-release- recapture method in West Khentii in northern Mongolia. The netting method was used for collecting the violet copper during one hour standardised sample in different biotopes. Violet copper was found predominantly in the wet, mesophilous grassland and herb meadows, but it also found in the birch forests in the riparian zone the valley as well as in the mixed forests consisted of Larix sibirica and Betula platyphylla . We examined the movement and individual occurrence through the habitat types of West Khentii. The mean distance between the fi rst and subsequent capture points in the open area were greater than that of in fragmented landscapes for both sexes (107±76 and 44±41 m for females and males, respectively). The single greatest movement distance between recaptures was 386 m for females and 163 m for males

Complex Contagion Features without Social Reinforcement in a Model of Social Information Flow

Contagion models are a primary lens through which we understand the spread of information over social networks. However, simple contagion models cannot reproduce the complex features observed in real-world data, leading to research on more complicated complex contagion models. A noted feature of complex contagion is social reinforcement that individuals require multiple exposures to information before they begin to spread it themselves. Here we show that the quoter model, a model of the social flow of written information over a network, displays features of complex contagion, including the weakness of long ties and that increased density inhibits rather than promotes information flow. Interestingly, the quoter model exhibits these features despite having no explicit social reinforcement mechanism, unlike complex contagion models. Our results highlight the need to complement contagion models with an information-theoretic view of information spreading to better understand how network properties affect information flow and what are the most necessary ingredients when modeling social behavior

Homomorphic Computation of Local Alignment

In this paper we present a homomorphic computation algorithm that finds an optimal local alignment of a pair of encrypted sequences, based on the Smith-Waterman recurrence. Our algorithm also includes an efficient method of finding the location of an optimal local alignment, in order to avoid costly conditional branching in the backtracking. To reduce computation time, we use two level parallel computations: one for filling the entries of the dynamic programming recurrence, and the other for implementing the circuits. To the best of our knowledge, this is the first attempt to compute an optimal local alignment of homomorphically encrypted sequences. With the efficient location retrieval, parallel computations, and a proper HE scheme, our implementation shows good performances in the experiment so as to be useful in practice. ?? 2020 IEEE