The Merge Process

2014 ◽  
pp. 181-190
Author(s):  
Hasso Plattner
Keyword(s):  
Merge Process

scholarly journals Mining Negative Comment Data of Microblog Based on Merge-AP

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Zhijun Chen ◽  
Weijian Jin ◽  
Shibiao Mu
Keyword(s):  
Euclidean Distance ◽  
Similarity Matrix ◽  
Algorithm Evaluation ◽  
Negative Comment ◽  
Data Points ◽  
Clustering Effect ◽  
Merge Process

A new depiction method based on the merge-AP algorithm is proposed to effectively improve the mining accuracy of negative comment data on microblog. In this method, we first employ the AP algorithm to analyze negative comment data on microblog and calculate the similarity value and the similarity matrix of data points by Euclidean distance. Then, we introduce the distance-based merge process to solve the problem of poor clustering effect of the AP algorithm for datasets with the complex clustering structure. Finally, we compare and analyze the performance of K-means, AP, and merge-AP algorithms by collecting the actual microblog data for algorithm evaluation. The results show that the merge-AP algorithm has good adaptability.

scholarly journals GT Merge Process: Version 2.0

2008 ◽  
Author(s):  
M Flanagan ◽  
D Dodge ◽  
S Myers
Keyword(s):  
Version 2.0 ◽  
Merge Process

The uncontrolled traffic merge

1979 ◽  
Vol 16 (02) ◽  
pp. 384-392 ◽  
Author(s):  
Richard Cowan
Keyword(s):  
Size Distribution ◽  
Distributional Assumption ◽  
Mean Delay ◽  
Arrival Processes ◽  
Mean And Variance ◽  
The Mean ◽  
General Size ◽  
Merge Process

The merging of n independent traffic streams is studied. The arrival processes comprise random sized bunches of cars, the bunches being separated in time by random sized gaps. Within each bunch, cars are spaced at one time unit apart. Under a distributional assumption on the inter-bunch gaps exact formulae are found for (a) the mean delay to cars, (b) the first two moments of the post-merge bunch size, and (c) the distribution of the inter-bunch gaps in the post-merge process. It is shown that the distributional assumption is realistic and moreover that the distribution of (c) is of the same form. The arrival bunches have general size distribution with finite mean and variance.

Casual speech elision and tone sandhi in Tianjin trisyllabic sequences

2014 ◽  
Vol 1 (1) ◽  
pp. 71-95 ◽  
Author(s):  
Lian Hee Wee
Keyword(s):  
Tone Sandhi ◽  
The Rich ◽  
Casual Speech ◽  
Merge Process ◽  
Clear Description

In the Tianjin dialect, casual utterance of familiar trisyllabic sequences often induces deletion of phonological segments so that for a trisyllabic string, the non-final syllables would merge into a single syllable. This elide-and-merge process interacts with the rich Tianjin tone sandhi system to produce rather complicated patterns. In this paper, casual speech elision is shown to fall out straightforwardly from a model that recognizes morae as associated with segments and also as tone-bearing units. Thus, elision of morae also removes tonal features. While this understanding provides a clear description of the patterns, it also reveals an ordering paradox: sandhi applies before elision in some cases, but after elision in others. The paradox is resolved by favoring the order that produces a contour tone for the merged syllable. An explanation for this can be found if one recognizes that Tianjin is prosodically iambic.

The uncontrolled traffic merge

1979 ◽  
Vol 16 (2) ◽  
pp. 384-392 ◽  
Author(s):  
Richard Cowan
Keyword(s):  
Size Distribution ◽  
Distributional Assumption ◽  
Mean Delay ◽  
Arrival Processes ◽  
Mean And Variance ◽  
The Mean ◽  
General Size ◽  
Merge Process

The merging of n independent traffic streams is studied. The arrival processes comprise random sized bunches of cars, the bunches being separated in time by random sized gaps. Within each bunch, cars are spaced at one time unit apart. Under a distributional assumption on the inter-bunch gaps exact formulae are found for (a) the mean delay to cars, (b) the first two moments of the post-merge bunch size, and (c) the distribution of the inter-bunch gaps in the post-merge process. It is shown that the distributional assumption is realistic and moreover that the distribution of (c) is of the same form. The arrival bunches have general size distribution with finite mean and variance.

scholarly journals GT Merge Process: Version 1.0

2008 ◽  
Author(s):  
M Flanagan ◽  
D Dodge ◽  
S Myers
Keyword(s):  
Merge Process

Characterizing the Problem of Developers' Assignment for Merging Branches

2014 ◽  
Vol 24 (10) ◽  
pp. 1489-1508 ◽  
Author(s):  
Catarina Costa ◽  
J. J. C. Figueiredo ◽  
Gleiph Ghiotto ◽  
Leonardo Murta
Keyword(s):  
Control System ◽  
Version Control ◽  
Software Development Process ◽  
Software Projects ◽  
Development History ◽  
Version Control System ◽  
Key Participants ◽  
Source Of Information ◽  
Merge Process ◽  
Do So

During the software development process, artifacts are constructed and manipulated by many developers working in parallel. A common practice to manage parallel development is the use of branches in the version control system. Usually, at some point, the merge of these branches may be necessary. This process can combine two independent and eventually long sequences of commits, which may have been performed by different developers. Conflicts resulting from the merge of parallel changes may arise. When these conflicts are not automatically solved by the version control system, the developers in charge of the merge process must act. Normally, the developers' knowledge regarding the changes performed in parallel is usually not taken into consideration when assigning developers to the merge task. With this in mind, the goal of this work is to characterize the problem of developers' assignment for merging branches. To do so, this work analyzed merge profiles of eight software projects and check if the development history is an appropriate source of information for identifying the key participants for collaborative merge. In addition, this work presents a survey on developers about what actions they take when they need to merge branches, and especially when a conflict arises during the merge.

Sign in / Sign up

Export Citation Format

Share Document