The whole data set will be published after the acceptance of our paper via the same url as shown in the paper.

When using PackageRank software to analyze our data set, please do not change the name of the .net files.

The .net file has the following format:

Node count: *Vertices count

Node List:

number "node name"

EX: 1 "org.apache.tools.ant.taskdefs.optional.sitraka"

Arc List:

node1 node2 weight

EX: 1 2 3

Meaning: from node 1 to node 2 with weight 3

This dataset is from the paper "Metamorphic Relations for Enhancing System Understanding and Use" by Zhi Quan Zhou, Liqun Sun, Tsong Yueh Chen, and Dave Towey, accepted for publication in IEEE Transactions on Software Engineering.

We study a reverse problem - given a reduced dynamics or partial dynamics, can we compute a residue class who presents that dynamics.

We design a computer program that can randomly generate extremely large integers and output their original dynamics. The source code is txpo10b.c. The bit length of integers can be defined by Macro (named MAXLEN) in source code. The number of randomly generated integers can be set by inputting argument. The program can output the original dynamics of a starting integer in terms of “-” presenting (3*x+1)/2 and “0” presenting x/2. This data can be used for observing the relation between the count of “-” and the count of “0”.

Currently, the largest integer being verified for Collatz conjecture is about 2^60 . To verify whether extremely large integers such as 2^{100000}-1 can return 1, we design a new algorithm. This dedicated algorithm can change numerical computation into bit or charter computation, hence, original dynamics for extremely large integer without upper bound can be computed. By this algorithm, we thus design computer program that can output original dynamics for extremely large integers without upper-bound such as 2^{100000}-1, which is the largest integer being verified until now.

Data from 17 open source software projects was analysed with DWT in order to find similar sequences of values of metrics extracted from revision control systems. The dates for stages and cycles for the projects are listed as well as the terms used in different time periods. The dataset is used to indentify topic flows in the cycles determined by DWT analysis of the source code.

We design a computer program that can output reduced dynamics for odd integers with 4k+3, e.g, [3-99999999]. Outputting (reduced) dynamics for much larger integers are also possible. The source code in C is txpo9.c. There are 5 options in arguments for more flexible output. Those data can reveal the properties of reduced dynamics. The most important are ratio and period.

The data is reduced Collatz dynamics that is denoted by occurred (3*x+1)/2 represented by "-'' and x/2 represented by "0", during the process from a starting integer to the first integer less than the starting integer. The format is: starting integer, binary representation, the count of (3*x+1)/2, the count of x/2, the reduced dynamics represented by "-'' and "0", the ratio - the count of x/2 over the count of (3*x+1)/2.

Supplementary material for article "An Efficient Meta-Heuristic for Multi-objective Flexible Job Shop Inverse Scheduling Problem"

**A continuous finite-time control scheme is introduced for bilateral teleoperation systems with asymmetric timevarying delays. Specifically, a non-smooth controller with fractional power based on the homogeneous method is developed to ****guarantee that the trajectory tracking error between the master ****and the slave converges to zero in a finite period of time.**