Study on the Planning of Cluster-based Scenic Areas with Jingyanggang Scenic Area as an Example

Cluster-based scenic area is a special form within the scenic area system, scenic areas are always scattered with diversified landscape resources, thus planning should be made according to actual conditions of the local area, and pertinent measures should be applied. Through elaborating the detail work in the overall planning of Jingyanggang Scenic Area, such as landscape division, spatial layout and sightseeing structure, the authors discussed several problems should be paid more attention in the planning of cluster-based scenic areas.

Effective search with saliency-based matching and cluster-based browsing

Similarity matching and this paper, a saliency-based information presentation are two matching algorithm is proposed key factors in information retrieval. In for user-oriented search based on the psychological studies on human perception, and major emphasis on the saliently similar aspect of objects to be compared is placed and thus the search result is more agreeable for users. After relevant results are obtained, the cluster-based browsing algorithm is adopted for search result presentation based on social network analysis. By organizing the results in clustered lists, the user can have a general understanding of the whole collection by viewing only a small part of results and locate those of major interest rapidly. Experimental results demonstrate the advantages of the proposed algorithm over the traditional work.

Capacity Research in Cluster-Based Underwater Wireless Sensor Networks Based on Stochastic Geometry

Underwater wireless sensor networks(UWSNs) have attracted wide attention in recent years.The capacity research on it is still in the initial stage,lacking adequate performance evaluation for network construction.This paper will focus on this subject by theoretical analysis and simulation,aiming to provide some insights for the actual UWSNs construction.According to the structure features of cluster-based UWSNs and the propagation characteristics of underwater acoustic signal,with the combination of signal to interference plus noise ratio,we define some capacity performance metrics,such as outage probability and transmission capacity.Based on the theory of stochastic geometry,a network capacity analytical model used in the cluster-based UWSNs is presented.The simulation results verify the validity of the theoretical analysis,and the cause of error between theoretical and simulation results has also been clearly explained.

A Cluster-Based Random Key Revocation Protocol for Wireless Sensor Networks

In recent years,several random key pre-distribution schemes have been proposed to bootstrap keys for encryption,but the problem of key and node revocation has received relatively little attention.In this paper,based on a random key pre-distribution scheme using clustering,we present a novel random key revoca-tion protocol,which is suitable for large scale networks greatly and removes compromised information efficiently.The revocation protocol can guarantee network security by using less memory consumption and communication load,and combined by centralized and distributed revoca-tion,having virtues of timeliness and veracity for revoca-tion at the same time.

Cluster-Based Distributed Algorithms for Very Large Linear Equations

In many applications such as computational fluid dynamics and weather prediction, as well as image processing and state of Markov chain etc., the grade of matrix n is often very large, and any serial algorithm cannot solve the problems. A distributed cluster-based solution for very large linear equations is discussed, it includes the definitions of notations, partition of matrix, communication mechanism, and a master-slaver algorithm etc., the computing cost is O（n^3/N）, the memory cost is O（n^2/N）, the I/O cost is O（n^2/N）, and the com- munication cost is O（Nn ）, here, N is the number of computing nodes or processes. Some tests show that the solution could solve the double type of matrix under 10^6 × 10^6 effectively.

Cluster-Based Design for Two-hop Cellular Networks

Optimal resource allocation with an objective of maximizing the system capacity is an NP-hard problem in multihop cellular networks. Hence, different heuristic algorithms have been developed over the years that would improve the network system capacity. In this paper, a novel cluster-based architecture is proposed for a two-hop cellular network whereby the transmission distance between any communicating pair is restricted to half the cell radius. In this design, a given radio resource is used by two simultaneously communicating pairs in every hexagonal cell, but for only half the time slot period. The characteristic feature of this cluster-based design is that it enables a frequency reuse ratio of one. The proposed hierarchical system is analyzed and tested under realistic propagation conditions including lognormal shadowing. It has been observed that the system capacity of a cluster-based design is 2.5 times that obtained from the single-hop cellular system with no relaying. In addition, the cluster-based design achieves higher capacity compared to state-of-the-art two-hop algorithms. This is an important finding since the hierarchical cluster-based approach has fewer degrees of freedom in the selection of the routing path for the end-to-end connection. Practical routing algorithms should be able to benefit from this.

Optimal Positions of Relay Stations for Cluster-Based Two-Hop Cellular Network

Multihop cellular networks is an exciting and a fledgling area of wireless communication which offers huge potential in terms of coverage enhancement, data-rates, power reduction, and various other quality of service improvements. However, resource allocation in MCN is an NP-hard problem. Hence, significant research needs to be done in this field in order to efficiently design the radio network. In this paper, optimal position of relay stations in a hierarchical cluster-based two-hop cellular network is investigated. Vector algebra has been used to derive general equation for carrier-to-interference ratio (C/I) of a mobile station. It has been observed that when the transmit power of base station (BS) and the gateway (GTW)/relay station (RS) are same, the RSs should be located close to mid-point of BS and the edge of the cell. However, significantly, when the transmit power of the BS is greater than that of the GTW, then the RSs should be placed closer to the edge of the cell, in order to maximize the minimum C/I at any point in the cell. This in turn results in higher modulation technique at the physical layer, and hence, a higher data-rate to all the users in the system.

Pre-Emptive Traffic Management for a Cluster-Based TDMA System in Vehicular Communications

The IEEE 802.11p is a standard in a vehicular communication system, known as Wireless Access in Vehicular Environment (WAVE). An implementation of that standard as the MAC Protocol in a high-density of nodes in Vehicular Ad-Hoc Networks (VANETs) may create a performance drawback, in particular for packet loss and delay whenever collisions happen. Introducing Time Division Multiple Access (TDMA) schemes can improve the performance. However, TDMA scheduling is difficult to manage the case of high-density of traffic, the high mobility of vehicles, and dynamic network topology. This journal proposes a clustered-based TDMA by traffic priority in VANETs. The clustered traffic is defined as high and low traffic priority and embedded in TDMA MAC Header. The evaluation result obtained through NS3 Simulator shows that the proposed approach performed better in a high-density of nodes.

Strengthening the Competitiveness of SMEs by Using the Cluster-Based Approach： A Case Study of the Ratchaburi Orchid Cluster in Thailand

This paper studies the application of the cluster-based approach in the enhancement of the competitiveness of Thailand＇s SME industry. The author had employed a qualitative method through the in-depth interview. The result showed that Ratchaburi orchid cluster in Thailand has employed the concept of the cluster-based approach since they realized that it was useful and could enable them to produce good quality orchids for the international market. The finding also showed how individuals have worked together and helped each other, in order to build a good horizontal network of support and creating competitive advantages. In addition, the research paper related to knowledge management because knowledge management refers to a method for development which requires cluster members to exchange information, interact with each other, sharing and distribute information, create closer business relationship and build mutual benefit. Therefore, the cluster members will help each other to create a culture that values learning through making a commitment and sharing information to strengthen the cluster.

CLUSTER-BASED REGULARIZED SLICED INVERSE REGRESSION FOR FORECASTING MACROECONOMIC VARIABLES

This paper concerns the dimension reduction in regression for large data set. The authors introduce a new method based on the sliced inverse regression approach, cMled cluster-based regularized sliced inverse regression. The proposed method not only keeps the merit of considering both response and predictors＇ information, but also enhances the capability of handling highly correlated variables. It is justified under certain linearity conditions. An empirical application on a macroeconomic data set shows that the proposed method has outperformed the dynamic factor model and other shrinkage methods.

Design of Clustering Techniques in Cognitive Radio Sensor Networks

In recent decades,several optimization algorithms have been developed for selecting the most energy efficient clusters in order to save power during trans-mission to a shorter distance while restricting the Primary Users(PUs)interfer-ence.The Cognitive Radio(CR)system is based on the Adaptive Swarm Distributed Intelligent based Clustering algorithm(ASDIC)that shows better spectrum sensing among group of multiusers in terms of sensing error,power sav-ing,and convergence time.In this research paper,the proposed ASDIC algorithm develops better energy efficient distributed cluster based sensing with the optimal number of clusters on their connectivity.In this research,multiple random Sec-ondary Users(SUs),and PUs are considered for implementation.Hence,the pro-posed ASDIC algorithm improved the convergence speed by combining the multi-users clustered communication compared to the existing optimization algo-rithms.Experimental results showed that the proposed ASDIC algorithm reduced the node power of 9.646%compared to the existing algorithms.Similarly,ASDIC algorithm reduced 24.23%of SUs average node power compared to the existing algorithms.Probability of detection is higher by reducing the Signal-to-Noise Ratio(SNR)to 2 dB values.The proposed ASDIC delivers low false alarm rate compared to other existing optimization algorithms in the primary detection.Simulation results showed that the proposed ASDIC algorithm effectively solves the multimodal optimization problems and maximizes the performance of net-work capacity.

基于Cluster的数据网格请求代理服务器设计

数据网格为数据密集型的应用提供了强有力的支持,数据服务是数据网格的核心,因而数据请求代理(DRB)服务器的设计是实现数据服务的关键。一个结构、性能较好的服务器能屏蔽数据的广域分布性和异构性,实现一体化数据访问、存储、传输与管理。基于Cluster实现了一种数据请求代理服务器,这种服务器实现了上述目标,并具有许多优点,特别在具有多Cluster的高性能计算中,可以同时建立多个连接进行数据分块传输,能够获得Cluster-to-Cluster的聚集吞吐率。介绍了基于Cluster的DRB详细设计方案,描述了多个自治域的DRB之间协同服务的过程,并分析了这种设计的优点。

基于侧信道与量化推理缺陷的模型逆向攻击

模型逆向攻击旨在恢复部署在推理终端的神经网络模型的结构和权重值,是AI安全中的基础问题,为对抗样本等高阶攻击提供数据支撑。提出了一种名为Cluster-based SCA的新型模型权重逆向方法,该方法不要求攻击者构造泄露模型。Cluster-based SCA方法以量化推理中存在的安全隐患为出发点,深入分析了量化推理过程,发现在量化推理中存在的输出序列分类不等价现象可以判断猜测权重的正确与否。Cluster-based SCA将采集到的模型运行时产生的侧信道信息按照假设权重产生的中间值进行分类,以分类后的平均离散系数σ为评判标准,取σ最小时的权重为逆向权重。在仿真实验上验证了Cluster-based SCA方法的有效性,实验使用汉明重模型来模拟AI芯片的泄露模型,对于目标CNN,Cluster-based SCA方法以52.66%的TOP2恢复率恢复了其第一层卷积层所有卷积核权重,对于取值位于显著区的权重,TOP2的恢复率均达到了100%。

ApplianceBricks: A Scalable Network Appliance Architecture for Network Functions Virtualization

Network Functions Virtualization(NFV) is an attempt to help operators more effectively manage their networks by implementing traditional network functions embedded in specialized hardware platforms in term of virtualized software instances. But, existing novel network appliances designed for NFV infrastructure are always architected on a general-purpose x86 server, which makes the performance of network functions limited by the hosted single server. To address this challenge, we propose ApplianceB ricks, a novel NFV-enable network appliance architecture that is used to explore the way of consolidating multiple physical network functions into a clustered network appliance, which is able to improve the processing capability of NFV-enabled network appliances.

A Direct Data-Cluster Analysis Method Based on Neutrosophic Set Implication

Raw data are classified using clustering techniques in a reasonable manner to create disjoint clusters.A lot of clustering algorithms based on specific parameters have been proposed to access a high volume of datasets.This paper focuses on cluster analysis based on neutrosophic set implication,i.e.,a k-means algorithm with a threshold-based clustering technique.This algorithm addresses the shortcomings of the k-means clustering algorithm by overcoming the limitations of the threshold-based clustering algorithm.To evaluate the validity of the proposed method,several validity measures and validity indices are applied to the Iris dataset(from the University of California,Irvine,Machine Learning Repository)along with k-means and threshold-based clustering algorithms.The proposed method results in more segregated datasets with compacted clusters,thus achieving higher validity indices.The method also eliminates the limitations of threshold-based clustering algorithm and validates measures and respective indices along with k-means and threshold-based clustering algorithms.

Clustering Network Topology Control Method Based on Responsibility Transmission

The topology control is an effective approach which can improve the quality of wireless sensor network at all sides. Through studying the mechanism of sensor network data transmission, the nature of data transmission in wireless sensor network is concluded as a kind of responsibility transmission. By redefining the responsibility and availability of nodes, the strategy for cluster head selection is studied, the responsibility and availability is determined by the combination of the residual energy, location and current flow of nodes. Based on the above, new clustering network topology control algorithm based on responsibility transmission CNTCABRT and hierarchical multi-hop CNTCABRT is presented in this paper, whose algorithm structure is along the famous LEACH algorithm. Experimental result demonstrates its promising performance over the famous LEACH algorithm in the cluster head selection, the size of cluster, the deployment of nodes and the lifetime of nodes, and several innovative conclusions are proposed finally.

ARDCH:适于多媒体传感器网络的自适应周期分簇机制

分析了多媒体传感器网络节点部署特点以及多媒体信息位置相关性特点,提出了一种基于剩余能量与传输距离的自适应周期簇头竞争机制(ARDCH,adaptive round distributed cluster head),综合考虑通信代价及剩余能量选取簇头,同时根据剩余能量来动态调节簇头的工作周期,以此均衡网络中节点的能量消耗。此外采用多信道簇间通信,避免簇间干扰,与已有的几个分簇协议相比,显著地延长了网络的生存周期,更适于多媒体传感器网络。

Cluster Based Strategy to Improve Competitiveness of Rare Earth Industry in China——Taking Emerging Rare Earth Industry Cluster in Baotou As An Example

China′s rare earth industry has shown its strong competence, but notably this competence is mostly based on the comparative advantages in natural resources and production costs that will not provide a long-term momentum for the growth of the industrial competitiveness. It has become an urgent task now for China′s rare earth industry to improve its competitiveness through adjusting the product structure and enhancing the technological application, to gain much healthier and more sustainable growth in the future. This paper aims to present a new development strategy based on the industry cluster theory to improve the competitiveness of China′s rare earth industry with a case study on the emerging rare earth industry cluster in Baotou. The paper first reviews the cluster theory and explains why it matters to industrial competitiveness briefly, and then proposes a general framework for implementing cluster policies and strategies in practice. Following that, a case to study the emerging rare earth industry cluster in Baotou was presented and a cluster initiative based on the general framework was developed. The objectives of the cluster initiative and the role of government on initiative organizing and cluster upgrading were discussed in detail. In the end, general implications drawn from the case of Baotou were summarized, which try to provide some insights for applying cluster-based strategies to the rare earth industry of China.

A cooperative spectrum sensing results transmission scheme with LT code based on energy efficiency priority

To deal with a sharp increase in transmission energy consumption due to the presence of a large number of secondary users( SUs),an energy-efficient cooperative spectrum sensing results transmission scheme is proposed for cognitive radio systems. First,a cluster-based structure is introduced into the sensing results transmission scheme to reduce the transmission power. Then,the centralized sensing results transmission model is employed,and the non-fixed code rate Luby transform( LT)code is selected as the channel coding since its code rate can dynamically adapt to channel conditions and therefore avoid unnecessary redundancy in the transmission power.Furthermore,an improved optimal degree distribution( ODD)is designed for the LT code. The simulation results show that the choice of the appropriate parameters in degree distribution is very helpful for the LT code to achieve a promising performance. The ODD with optimized parameters can achieve more than 2 d B performance gain than other typical degree distributions when the bit error rate( BER) is 10-3. The energy consumption of the proposed scheme is not only at least71. 4% lower than that of the non-coding system,but also lower than that of the convolutional coding system with different code rates. Meanwhile, the energy consumption can be further reduced in the case that a suitable clustering method is selected.

Hybrid Marine Predators Optimization and Improved Particle Swarm Optimization-Based Optimal Cluster Routing in Wireless Sensor Networks(WSNs)

Wireless Sensor Networks(WSNs)play an indispensable role in the lives of human beings in the fields of environment monitoring,manufacturing,education,agriculture etc.,However,the batteries in the sensor node under deployment in an unattended or remote area cannot be replaced because of their wireless existence.In this context,several researchers have contributed diversified number of cluster-based routing schemes that concentrate on the objective of extending node survival time.However,there still exists a room for improvement in Cluster Head(CH)selection based on the integration of critical parameters.The meta-heuristic methods that concentrate on guaranteeing both CH selection and data transmission for improving optimal network performance are predominant.In this paper,a hybrid Marine Predators Optimization and Improved Particle Swarm Optimizationbased Optimal Cluster Routing(MPO-IPSO-OCR)is proposed for ensuring both efficient CH selection and data transmission.The robust characteristic of MPOA is used in optimized CH selection,while improved PSO is used for determining the optimized route to ensure sink mobility.In specific,a strategy of position update is included in the improved PSO for enhancing the global searching efficiency of MPOA.The high-speed ratio,unit speed rate and low speed rate strategy inherited by MPOA facilitate better exploitation by preventing solution from being struck into local optimality point.The simulation investigation and statistical results confirm that the proposed MPOIPSO-OCR is capable of improving the energy stability by 21.28%,prolonging network lifetime by 18.62%and offering maximum throughput by 16.79%when compared to the benchmarked cluster-based routing schemes.