An improved density peaks clustering algorithm by automatic determination of cluster centres by Hui Du, Yanting Hao, Zhihe Wang

“…However, this manual selection is difficult for larger and more complex datasets, and it is easy to split a cluster into multiple subclusters. …”
Get full text

Design and Experiment Analysis of a Hadoop-Based Video Transcoding System for Next-Generation Wireless Sensor Networks by Haoyu Xu, Liangyou Wang, Huang Xie

“…This paper introduces a cloud-based, more specifically, Hadoop-based, video transcoding system to fulfill the vision of bearing hundreds of HD video streams in the next generation WSN, with a discussion on optimization of several significant parameters. …”
Get full text

Wikipedia as a cultural lens: a quantitative approach for exploring cultural networks by Luis A. Miccio, Paschalis Agapitos, Carlos Gamez-Perez, Francisco González, Juan Luis Suarez, Gustavo A. Schwartz

“…In particular, we found that nodes within a given cluster, related respectively to art, science or philosophy, interact with nodes in the same cluster following a core-periphery behaviour. …”
Get full text

A Refinery Production Scheduling Model with Operation Mode Transition Based on Variable Driven Modelling Approach by Yuandong Chen, Zhen Jiang

“…The model built by VDM has a more stable form and better readability, and is beneficial for building a widely applicable and standard refinery scheduling model. …”
Get full text

Overview of Optoelectronic Switching Technology in Artificial Intelligent Data Centers by TANG Xiongyan, WEI Buzheng, SHEN Shikui, WANG Chuangye, WANG Zelin, ZHANG He, WANG Guangquan, ZHANG Chenfang

“…Combined with the needs of the telecom industry, the recommended deployment and evolution strategy of the switch nodes of AIDC and SCDC and super computing center are given.…”
Get full text

Services selection based on trust evolution and union for cloud computing by HU Chun-hua1, LIU Ji-bo1, LIU Jian-xun3

“…It was difficult for the service consumers to obtain high-quality composite services because of the existence of false or malicious service nodes in cloud computing environment.A novel cloud service-composition method based on the trust span tree was proposed.The trust relationship could be built after many times credible interaction between ser-vices requester and provider,and the trust union would be formed through the credible relationship evolution.So that the uncertain or malicious service should be excluded from the trust span tree,and the service composition would be carried out in a trust environment.At the same time,the measuring strategy of trust relationship among cloud services based on information entropy was designed,which could resolve the deficiencies of the trust parameter analysed by simply weighted angle in the previous studies.The experimental result shows that the method proposed in this paper is more su-perior in credibility and security,comparing to the traditional services selection methods.…”
Get full text

Dynamic trust model based on recommendation chain classification in complex network environment by Lin ZHANG, Huan XING, Ru-chuan WANG, Chao-jie WU

“…According to the recommendation information processing problem in complex network environment,a trust model based on the recommendation chain classification was proposed.The classification method was based on honesty attribute of nodes,which could choose an effective recommendation chain on the basis of practical experience data.The recommendation information dissemination parameters were based on the information gain,which made recommendation information be more accurate.The factor of time was also considered in this model.The ability of interaction and the one of honesty were distinguished clearly.The concept of information entropy in information theory was used in the final ag-gregation calculation of direct trust and recommendation trust,which could get rid of the ambiguity of the previous sub-jective parameter settings.The main polymerization parameters could be continuously corrected with the interactions in order to achieve the situation being closest to the reality.Simulation results show the validity of recommendation chain classification and the rationality of the parameter settings in the proposed model.…”
Get full text

The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees. by Sofie Demeyer, Tom Michoel, Jan Fostier, Pieter Audenaert, Mario Pickavet, Piet Demeester

“…Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. …”
Get full text

An intelligent IDS using bagging based fuzzy CNN for secured communication in vehicular networks by M. Anand, S. Muthurajkumar

“…Abstract Internet of Vehicles consists of vehicular nodes that communicate with each other for making intelligent transportation systems, where cyber physical attacks are increasing continuously. …”
Get full text

Adaptive MANET Multipath Routing Algorithm Based on the Simulated Annealing Approach by Sungwook Kim

“…Mobile ad hoc network represents a system of wireless mobile nodes that can freely and dynamically self-organize network topologies without any preexisting communication infrastructure. …”
Get full text

Space-time spectrum sharing based on game theory:dynamic access and penalty strategy by Yangyang NIU, Zhiqing WEI, Zhiyong FENG

“…To tackle the challenge of inefficient utilization of spatiotemporal spectrum resources in heterogeneous networks, a reliable spectrum sharing strategy based on game theory was proposed for scenarios where multiple secondary users dynamically access through sensing spatiotemporal spectrum opportunities.Firstly, secondary users sensed the activity state of primary users through channel sampling and subsequently seek suitable spatiotemporal spectrum opportunities.Each secondary user aimed to access more spectrum resources while preventing quality degradation between primary users.Consequently, a negotiation of individual utilities between secondary and primary users was needed, in order to reach a mixed Nash equilibrium.When the secondary user's transmission power was abnormal, its behavior would be regarded as a violation.Then, a backoff time compensation algorithm was presented to penalize the secondary users, according to the number of violations and active nodes in the network.Finally, simulation results validate the effectiveness of the spatiotemporal spectrum opportunities sharing strategy with the penalty mechanism.…”
Get full text

Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components by Robert Schwieger, Elisa Tonello

“…The removal of so called mediator nodes (i.e. vertices with indegree and outdegree one) is often considered, and frequently does not affect the attractor landscape. …”
Get full text

DACH: An Efficient and Reliable Way to Integrate WSN with IPv6 by Dequan Yang, Qiao Guo

“…Finally, the complete framework is built between headers and their slave nodes based on IEEE 802.15.4, and IPv6 is used to connect the headers and the base stations. …”
Get full text

Resilience quantification model for cyber‐physical power systems by Mohammad AlMuhaini

“…Abstract As power grids develop, their structure becomes more complex, multi‐dimensional, and digitalised—hence, it is referred to as cyber‐physical infrastructure. …”
Get full text

A Priority-Based CSMA/CA Mechanism to Support Deadline-Aware Scheduling in Home Automation Applications Using IEEE 802.15.4 by Mario Collotta, Gianfranco Scatà, Giovanni Pau

“…The wireless sensor networks (WSNs) are characterized by several small nodes able to perform measurements on one or more parameters and to communicate with each other through several protocols. …”
Get full text

Heterogeneous anti-synchronization of stochastic complex dynamical networks involving uncertain dynamics: an approach of the space-time discretizations by Huan Luo

“…The theoretical and experimental findings indicated that the feedback controller at the boundary represented a more effective and cost-effective control technique for the networks. …”
Get full text

Distributed optimization of lifetime and throughput with power consumption balance opportunistic routing in dynamic wireless sensor networks by Jian Sun, Junni Zou, Liwan Huang

“…We propose a fully distributed power consumption balance opportunistic routing scheme to cope with the dynamic network that is not considered in the classic low-energy adaptive clustering hierarchy routing and evenly allocate power consumption among the sensor nodes for obtaining longer network lifetime. Moreover, a fully distributed optimization solution, whose distinctive feature to the Lagrange dual approach is capable of handling the changing network, is developed to achieve joint performance optimization of objectives. …”
Get full text

Assessing frustration in real-world signed networks: A statistical theory of balance by Anna Gallo, Diego Garlaschelli, Tiziano Squartini

“…Generalizing, the weak version of balance theory allows for nodes to be partitioned into any number of blocks with positive internal links, mutually connected by negative links. …”
Get full text

Verifiable access control scheme based on unpaired CP-ABE in fog computing by Jiangtao DONG, Peiwen YAN, Ruizhong DU

“…Fog computing extends computing power and data analysis applications to the edge of the network, solves the latency problem of cloud computing, and also brings new challenges to data security.Attribute encryption based on ciphertext strategy (CP-ABE) is a technology to ensure data confidentiality and fine-grained access control.The excessive computational overhead of bilinear pairing restricts its application and development.In response to this, a verifiable access control scheme was proposed based on unpaired CP-ABE in fog computing.In order to make CP-ABE more efficient, simple scalar multiplication in elliptic curve encryption was used to replace bilinear pairing, thereby reducing the overall computational overhead.Decryption operations were outsourced to fog nodes to reduce user computational complexity, and based on the tamper-proof and traceable characteristics of the blockchain, the correctness of the access transaction was verified and the access authorization process was recorded.Security and performance analysis shows that the scheme is safe under the elliptic curve decision-making DBDH (Diffie-Hellman) assumption, and the calculation efficiency is higher.…”
Get full text

Parametric Earthquake Analysis of Thick Plates Using Mindlin’s Theory by Y.I. Özdemir, Y. Ayvaz

“…It is concluded that, in general, the changes in the thickness/span ratio are more effective on the maximum responses considered in this study than the changes in the aspect ratio. …”
Get full text