scholarly journals A Node Similarity and Community Link Strength-Based Community Discovery Algorithm

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Haijuan Yang ◽  
Jianjun Cheng ◽  
Zeyi Yang ◽  
Handong Zhang ◽  
Wenbo Zhang ◽  
...  
Keyword(s):  
Community Structure ◽  
Community Discovery ◽  
Strength Based ◽  
Community Boundaries ◽  
Node Similarity ◽  
The Common ◽  
Link Strength ◽  
Comparison Algorithms ◽  
Better Than

Community structure is one of the common characteristics of complex networks. In the practical work, we have noted that every node and its most similar node tend to be assigned to the same community and that two communities are often merged together if there exist relatively more edges between them. Inspired by these observations, we present a community-detection method named NSCLS in this paper. Firstly, we calculate the similarities between any node and its first- and second-order neighbors in a novel way and then extract the initial communities from the network by allocating every node and its most similar node to the same community. In this procedure, some nodes located at the community boundaries might be classified in the incorrect communities. To make a redemption, we adjust their community affiliations by reclassifying each of them into the community in which most of its neighbors have been. After that, there might exist relatively larger number of edges between some communities. Therefore, we consider to merge such communities to improve the quality of the final community structure further. To this end, we calculate the link strength between communities and merge some densely connected communities based on this index. We evaluate NSCLS on both some synthetic networks and some real-world networks and show that it can detect high-quality community structures from various networks, and its results are much better than the counterparts of comparison algorithms.

Detecting communities from networks based on their intrinsic properties

2019 ◽  
Vol 30 (12) ◽  
pp. 1950104 ◽  
Author(s):  
Haijuan Yang ◽  
Jianjun Cheng ◽  
Mingwei Leng ◽  
Xing Su ◽  
Wenbo Zhang ◽  
...  
Keyword(s):  
Community Structure ◽  
Intrinsic Properties ◽  
Structure Quality ◽  
Novel Method ◽  
The Common ◽  
Influential Nodes ◽  
High Quality Result ◽  
Full Utilization ◽  
Entire Procedure

Communities in networks expose some intrinsic properties, each of them involves some influential nodes as its cores, around which the entire community grows gradually; the more the common neighbors that exist between a pair of nodes, the larger the possibility of belonging to the same community; the more the neighbors of any one node belong to a community, the larger the possibility that node belongs to that community too. In this paper, we present a novel method, which makes full utilization of these intrinsic properties to detect communities from networks. We iteratively select the node with the largest degree from the remainder of the network as the first seed of a community, then consider its first- and second-order neighbors to identify other seeds of the community, then expand the community by attracting nodes whose large proportion of neighbors have been in the community to join. In this way, we obtain a series of communities. However, some of them might be too small to make sense. Therefore, we merge some of the initial communities into larger ones to acquire the final community structure. In the entire procedure, we try to keep nodes in every community to be consistent with the properties as possible as we can, this leads to a high-quality result. Moreover, the proposed method works with a higher efficiency, it does not need any prior knowledge about communities (such as the number or the size of communities), and does not need to optimize any objective function either. We carry out extensive experiments on both some artificial networks and some real-world networks to testify the proposed method, the experimental results demonstrate that both the efficiency and the community-structure quality of the proposed method are promising, our method outperforms the competitors significantly.

scholarly journals Neighbor Similarity Based Agglomerative Method for Community Detection in Networks

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-16 ◽  
Author(s):  
Jianjun Cheng ◽  
Xing Su ◽  
Haijuan Yang ◽  
Longjie Li ◽  
Jingming Zhang ◽  
...  
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Second Phase ◽  
Community Structures ◽  
Node Similarity ◽  
Local Methods ◽  
Two Phases ◽  
Comparison Algorithms ◽  
New Community ◽  
The One

Community structures can reveal organizations and functional properties of complex networks; hence, detecting communities from networks is of great importance. With the surge of large networks in recent years, the efficiency of community detection is demanded critically. Therefore, many local methods have emerged. In this paper, we propose a node similarity based community detection method, which is also a local one consisted of two phases. In the first phase, we first take out the node with the largest degree from the network to take it as an exemplar of the first community and insert its most similar neighbor node into the community as well. Then, the one with the largest degree in the remainder nodes is selected; if its most similar neighbor has not been classified into any community yet, we create a new community for the selected node and its most similar neighbor. Otherwise, if its most similar neighbor has been classified into a certain community, we insert the selected node into the community to which its most similar neighbor belongs. This procedure is repeated until every node in the network is assigned to a community; at that time, we obtain a series of preliminary communities. However, some of them might be too small or too sparse; edges connecting to outside of them might go beyond the ones inside them. Keeping them as the final ones will lead to a low-quality community structure. Therefore, we merge some of them in an efficient approach in the second phase to improve the quality of the resulting community structure. To testify the performance of our proposed method, extensive experiments are performed on both some artificial networks and some real-world networks. The results show that the proposed method can detect high-quality community structures from networks steadily and efficiently and outperform the comparison algorithms significantly.

scholarly journals An Improved Rasa for Load Balancing in Cloud Computing

2021 ◽  
pp. 52-66
Author(s):  
Oyekanmi Ezekiel Olufunminiyi ◽  
Oladoja Ilobekemen Perpetual ◽  
Omotehinwa Temidayo Oluwatosin
Keyword(s):  
Load Balancing ◽  
Resource Utilization ◽  
Performance Metrics ◽  
Scheduling Algorithm ◽  
Resource Provisioning ◽  
The Common ◽  
Resource Aware ◽  
Cloud Users ◽  
Better Than

Cloud is specifically known to have difficulty in managing resource usage during task scheduling, this is an innate from distributed computing and virtualization. The common issue in cloud is load balancing management. This issue is more prominent in virtualization technology and it affects cloud providers in term of resource utilization and cost and to the users in term of Quality of Service (QoS). Efficient procedures are therefore necessary to achieve maximum resource utilization at a minimized cost. This study implemented a load balancing scheme called Improved Resource Aware Scheduling Algorithm (I-RASA) for resource provisioning to cloud users on a pay-as-you-go basis using CloudSim 3.0.3 package tool. I-RASA was compared with recent load balancing algorithms and the result shown in performance evaluation section of this paper is better than Max-min and RASA load balancing techniques. However, it sometimes outperforms or on equal balance with Improved Max-Min load balancing technique when using makespan, flow time, throughput, and resource utilization as the performance metrics.

Detecting communities from networks using an improved self-organizing map

2019 ◽  
Vol 30 (06) ◽  
pp. 1950054 ◽  
Author(s):  
Jianjun Cheng ◽  
Shiyan Zhao ◽  
Haijuan Yang ◽  
Jingming Zhang ◽  
Xing Su ◽  
...  
Keyword(s):  
Community Structure ◽  
Prior Knowledge ◽  
Real World ◽  
Self Organizing Map ◽  
High Complexity ◽  
Comparison Algorithms ◽  
Som Model ◽  
Fine Tune ◽  
Self Organizing

Community structure is one of the important features of complex networks. Researchers have derived a number of algorithms for detecting communities, some of them suffer from high complexity or need some prior knowledge, such as the size of community or number of communities. For some of them, the quality of the detected community structure cannot be guaranteed, even the results of some of them are nondeterministic. In this paper, we propose a Self-Organizing Map (SOM)-based method for detecting community structure from networks. We first preprocess the network by removing some nodes and their associated edges which have little contribution to the formation of communities, then we construct the extended attribute matrix from the preprocessed network, next we embed the detecting procedure in the training of SOM on the attribute matrix to acquire the initial community structure, and finally, we handle those removed nodes by inserting each of them into the community to which its only neighbor belongs, and fine-tune the initial community structure by merging some of the initial communities to improve the quality of the final result. The performance of the proposed method is evaluated on a variety of artificial networks and real-world networks, and experimental results show that our method takes full advantage of SOM model, it can automatically determine the number of communities embedded in the network, the quality of the detected community structure is steadily promising and superior to those of other comparison algorithms.

scholarly journals Detecting overlapping community in complex network based on node similarity

2015 ◽  
Vol 12 (2) ◽  
pp. 843-855 ◽  
Author(s):  
Zuo Chen ◽  
Mengyuan Jia ◽  
Bing Yang ◽  
Xiaodong Li
Keyword(s):  
Complex Network ◽  
Division Algorithm ◽  
Jaccard Similarity ◽  
Actual Structure ◽  
Overlapping Communities ◽  
Structure Information ◽  
Node Similarity ◽  
Overlapping Community ◽  
Better Than

Overlapping communities in complex network is a common phenomenon in real world network. The overlapping community structure can more accurately obtain the actual structure information in the network. But at present the study of overlapping community division algorithm is relatively less, facing the problems of the low accurate rate. Based on this, this paper presents algorithms OCNS for detecting community overlapping base on node similarity. The algorithm calculates similarity between two nodes in the network by means of Jaccard similarity measure formula. Then the related nodes are adaptive merged according to the similarity value, combining with the community according to the change of modularity. The process of partitioning can not only accurately merge closely linked nodes in the network, but also find the overlapping nodes and bridge nodes between communities. The experiment proved the algorithm is effective to detect the overlapping community and has obvious advantages in the division of baseline social network Zachary and dolphin network, and the quality of division better than other existing partitioning algorithm.

Study on Blanking Force of Fine-Blanking with Negative Clearance and Common Blanking for AISI-1045 through Simulation and Experiment Methods

2011 ◽  
Vol 704-705 ◽  
pp. 1175-1179
Author(s):  
W.F. Fan ◽  
Feng Li
Keyword(s):  
Fine Blanking ◽  
Bonding Force ◽  
Maximum Value ◽  
Aisi 1045 ◽  
Simulation And Experiment ◽  
Force Curves ◽  
The Common ◽  
Negative Clearance ◽  
Better Than

Fine-blanking with negative clearance is a kind of fine blanking processes. The punch size of fine-blanking with negative clearance is larger than the die size. The paper does lots of simulations for the changes of blanking force in fine-blanking with negative clearance and common blanking by DEFORM software, and the blanking force curves are gained by these experiments. The changing principle of blanking force and internal material is obtained through the simulation and experiments. The result shows that simulation blanking force of AISI-1045 is lager than the actual blanking force. According to the curves derived from experiments, we can see that the maximum blanking force of fine-blanking with negative clearance is higher than common blanking force. Compared with fine-blanking with negative clearance, the common blanking force reduces faster after the blanking force reaches maximum value. The experiment result shows that the force of fine-blanking with negative clearance under a smaller blanking clearance is a bit bigger than the force of common blanking force, and the blanking quality of fine-blanking with negative clearance is much better than that of common blanking. Cracks can be closed effectively by the special squeeze forming in fine blanking with negative clearance. Then, the crack can not expand continuously, and the bonding force is enhanced. The squeeze forming can restrain intergranular deformation and reduce the damage. However, the stretch forming easily leads to the inner crack and defect of materials. By means of the analysis on experimental curves, the paper further studies the changing law of fine-blanking with negative clearance blanking force.

Scanning Secondary Electron Microscopy of Myofibrils Using Transmission Techniques

1975 ◽  
Vol 33 ◽  
pp. 556-557
Author(s):  
M. K. Lamvik
Keyword(s):  
Electron Microscopy ◽  
Electron Microscope ◽  
Carbon Films ◽  
Photographic Recording ◽  
Transmission Electron ◽  
Thin Carbon ◽  
The Common ◽  
Scanning Electron ◽  
Better Than ◽  
Cellular Organelles

When observing small objects such as cellular organelles by scanning electron microscopy, it is often valuable to use the techniques of transmission electron microscopy. The common practice of mounting and coating for SEM may not always be necessary. These possibilities are illustrated using vertebrate skeletal muscle myofibrils.Micrographs for this study were made using a Hitachi HFS-2 scanning electron microscope, with photographic recording usually done at 60 seconds per frame. The instrument was operated at 25 kV, with a specimen chamber vacuum usually better than 10-7 torr. Myofibrils were obtained from rabbit back muscle using the method of Zak et al. To show the component filaments of this contractile organelle, the myofibrils were partially disrupted by agitation in a relaxing medium. A brief centrifugation was done to clear the solution of most of the undisrupted myofibrils before a drop was placed on the grid. Standard 3 mm transmission electron microscope grids covered with thin carbon films were used in this study.

Kepuasan Masyarakat Terhadap Pelayanan Kelurahan Setelah Pemekaran Di Tangerang Selatan

Liquidity ◽  
2018 ◽  
Vol 2 (2) ◽  
pp. 151-159
Author(s):  
Pitri Yandri
Keyword(s):  
Public Perception ◽  
Service Personnel ◽  
Urban Services ◽  
Hospitality Workers ◽  
Care Workers ◽  
Before And After ◽  
Cartesian Diagram ◽  
Better Than

The purpose of this study is (1) to analyze public perception on urban services before and after the expansion of the region, (2) analyze the level of people's satisfaction with urban services, and (3) analyze the determinants of the variables that determine what level of people's satisfaction urban services. This study concluded that first, after the expansion, the quality of urban services in South Tangerang City is better than before. Secondly, however, public satisfaction with the services only reached 48.53% (poor scale). Third, by using a Cartesian Diagram, the second priority that must be addressed are: (1) clarity of service personnel, (2) the discipline of service personnel, (3) responsibility for care workers; (4) the speed of service, (5) the ability of officers services, (6) obtain justice services, and (7) the courtesy and hospitality workers.

Implementasi Voip Server Berbasis IPV6 Dengan Raspberry PI

2019 ◽  
Vol 9 (01) ◽  
pp. 47-54
Author(s):  
Rabbai San Arif ◽  
Yuli Fitrisia ◽  
Agus Urip Ari Wibowo
Keyword(s):  
Internet Protocol ◽  
Wireless Transmission ◽  
Raspberry Pi ◽  
Test Results ◽  
Average Delay ◽  
Ipv6 Network ◽  
Ip Network ◽  
Selection Of ◽  
Better Than

Voice over Internet Protocol (VoIP) is a telecommunications technology that is able to pass the communication service in Internet Protocol networks so as to allow communicating between users in an IP network. However VoIP technology still has weakness in the Quality of Service (QoS). VOPI weaknesses is affected by the selection of the physical servers used. In this research, VoIP is configured on Linux operating system with Asterisk as VoIP application server and integrated on a Raspberry Pi by using wired and wireless network as the transmission medium. Because of depletion of IPv4 capacity that can be used on the network, it needs to be applied to VoIP system using the IPv6 network protocol with supports devices. The test results by using a wired transmission medium that has obtained are the average delay is 117.851 ms, jitter is 5.796 ms, packet loss is 0.38%, throughput is 962.861 kbps, 8.33% of CPU usage and 59.33% of memory usage. The analysis shows that the wired transmission media is better than the wireless transmission media and wireless-wired.

Motilitas dan Vabilitas Spermatozoa Ayam Kampung pada Suhu 5°C Menggunakan Pengencer dan Lama Simpan yang Berbeda

2018 ◽  
Vol 5 (2) ◽  
pp. 102
Author(s):  
Enike Dwi Kusumawati ◽  
Selvinus Lawu Woli ◽  
Aju Tjatur Nugroho Krisnaningsih ◽  
Waluyo Edi Susanto ◽  
Syam Rahadi
Keyword(s):  
Data Analysis ◽  
Storage Temperature ◽  
Coconut Water ◽  
Laboratory Research ◽  
Ringer Lactate ◽  
Randomized Design ◽  
Native Chicken ◽  
Lactate Solution ◽  
Better Than

ABSTRAKPenelitian ini dilakukan untuk mengetahui motilitas dan viabilitas spermatozoa ayam kampung pada suhu 5oC menggunakan pengencer dan lama simpan yang berbeda. Metode yang digunakan dalam penelitian ini adalah penelitian laboratorium menggunakan Rancangan Acak Lengkap (RAL) Faktorial dengan pengencer ringer lactat solution, air kelapa dan tanpa pengencer serta lama simpan 0, 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, masing-masing diulang 10 kali. Variabel yang diamati yaitu motilitas dan viabilitas spermatozoa. Analisa data yang digunakan adalah analisis varian. Hasil analisis data menunjukkan bahwa motilitas dan viabilitas spermatozoa menggunakan pengencer ringer lactat solution lebih tinggi (P<0,01) serta dapat bertahan sampai lama simpan 24 jam dibandingkan air kelapa dan tanpa pengencer. Adapun nilai motilitas ringer lactat solution, air kelapa dan tanpa pengencer pada lama simpan 24 jam masing-masing sebesar 43,5±17,17%; 8±4,83%; 6,5±2,4%, sedangkan nilai viabilitasnya sebesar 83,2±7,25%; 64,6±3,20%; dan 63,1±2,33%. Kesimpulan dari hasil penelitian ini adalah ringer lactat solution lebih baik dibandingkan air kelapa dan tanpa pengencer dalam mempertahankan kualitas semen ayam kampung pada suhu simpan 5oC sampai lama simpan 24 jam.Kata Kunci : air kelapa, ayam kampung, motilitas, spermatozoa, viabilitas  ABSTRACTThis study was conducted to determine the motility and viability of spermatozoa of Native chickens at 5oC using different diluents and time storage. The method used in this study was laboratory research using Factorial Completely Randomized Design with ringer lactate solution, coconut water and without diluent at 0, 3, 6, 9, 12, 15, 18, 21, 24, 27, 30 hours of time storage each repeated 10 times. The variables observed were motility and viability of sperm. Data analysis used is variance analysis. The results of data analysis showed that the motility and viability of spermatozoa using ringer lactate solution diluents was higher (P <0.05) than coconut water and without diluents. The motility values of ringer lactat solution, coconut water and without diluents were 43,5±17,17%; 8±4,83%; 6,5±2,4% respectively, while the viability values were 83,2±7,25%; 64,6±3,20% and 63,1±2,33%. The conclusion of this study is that ringer lactat solution is better than coconut water an without diluents in maintaining the quality of Native chicken semen at a storage temperature of 5oC until 24 hours.Keywords: coconut water, motility, native chicken, sperm, viability

Sign in / Sign up

Export Citation Format

Share Document