On Directed Densest Subgraph Discovery

Given a directed graph G , the directed densest subgraph (DDS) problem refers to the finding of a subgraph from G , whose density is the highest among all the subgraphs of G . The DDS problem is fundamental to a wide range of applications, such as fraud detection, community mining, and graph compression. However, existing DDS solutions suffer from efficiency and scalability problems: on a 3,000-edge graph, it takes three days for one of the best exact algorithms to complete. In this article, we develop an efficient and scalable DDS solution. We introduce the notion of [ x , y ]-core, which is a dense subgraph for G , and show that the densest subgraph can be accurately located through the [ x , y ]-core with theoretical guarantees. Based on the [ x , y ]-core, we develop exact and approximation algorithms. We further study the problems of maintaining the DDS over dynamic directed graphs and finding the weighted DDS on weighted directed graphs, and we develop efficient non-trivial algorithms to solve these two problems by extending our DDS algorithms. We have performed an extensive evaluation of our approaches on 15 real large datasets. The results show that our proposed solutions are up to six orders of magnitude faster than the state-of-the-art.

A New Algorithm and Its Application in Detecting Community of the Bipartite Complex Network

The community division of bipartite networks is one frontier problem on the research of complex networks today. In this study, we propose a model of community detection of the bipartite network, which is based on the generalized suffix tree algorithm. First, extract the adjacent node sequences from the matrix of relation and use the obtained adjacent node sequences to build a generalized suffix tree; second, traverse the established generalized suffix tree to obtain the bipartite cliques; third, adjust the bipartite cliques; finally, dispose the isolated edges, get the communities, and complete the division of the bipartite network. This algorithm is different from the traditional community mining one since it uses edges as the community division medium and does not need to specify the number of the division of communities before the experiment. Furthermore, we can find overlapping communities by this new algorithm which can decrease the time complexity.

Efficient Directed Densest Subgraph Discovery

Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS problem is fundamental to a wide range of applications, such as fraud detection, community mining, and graph compression. However, existing DDS solutions suffer from efficiency and scalability problems: on a threethousand- edge graph, it takes three days for one of the best exact algorithms to complete. In this paper, we develop an efficient and scalable DDS solution. We introduce the notion of [x, y]-core, which is a dense subgraph for G, and show that the densest subgraph can be accurately located through the [x, y]-core with theoretical guarantees. Based on the [x, y]-core, we develop both exact and approximation algorithms. We have performed an extensive evaluation of our approaches on eight real large datasets. The results show that our proposed solutions are up to six orders of magnitude faster than the state-of-the-art.

Implementasi Peraturan Bupati Kabupaten Aceh Jaya Nomor 21 Tahun 2011 Tentang Penataan Pertambangan Emas Rakyat

The development of gold for the people of Aceh Jaya district has had a wide impact on the community around the mining area. Therefore, the Aceh Jaya district government has enacted regent regulation no 21 of 2011 regarding the arrangement of community mining, but the policy implementation has not been optimal. The research was peeled off using implementation models from Smith as well as Van Metter and Van Horn. This study aims to analyze the implementation of Aceh Jaya government policies in structuring community gold mining in Gunong Ujeun village, Krueng Sabee sub-district, Aceh Jaya district. This research uses a qualitative method, namely by interviewing informants. The results of the study illustrate that the implementation of the policy or regional regulation of Aceh Jaya district number 21 of 2011 has not been running optimally. This can be seen from the number of miners who do not know the existence of the regulations set by the government. In addition, the lack of monitoring on the part of the government has also resulted in community gold mining in Gunong Ujeun being continuously mining illegally by the community, either individually or through established cooperatives.

Politica of Criminal Law; The Importance of Revision of Mineral and Coal Law: Who Is Benefitted

Minerals and coal are state owned assets that need to used wisely, although the People's Representative Council (DPR) is yet to ratify them for the 2020-2025 period during the COVID-19 pandemic that has ravaged the world, including Indonesia. The review of the Mineral and Coal has caused many draw backs because it does not follow the principle of balancing and sharing regional authority. This study discusses the principle of strict liability as stipulated in Law No. 3/2020 by examining the urgency for changes and who will benefit from the revision. Doctrinal research was used for analyzing the politics of criminal Law in the Mineral and Coal, both before and in its amendments. Furthermore, Law No. 4/2009 ensnares many people that carry out illegal mining because the mechanism and procedure for the popular Mining license is the same with the mining license of the companies. The content of the amendments to the Mineral and Coal only regulates the sale of 51% foreign shares, but from a criminal perspective and nominalization of criminal fines and the reduction of prison sentence, it can be seen that the new criminal concept does not have a significant meaning for business corporations, as the suspects so far have been people that have been mining in the form of community mining.