Abstract This paper discussed how to use computer to directly transfer the simulative low pass prototype design to all kinds of needed principles and design methods. This methods advantage is that it is very direct, and universal. So, this method is simple, convenient, practical and fast.... This paper discussed how to use computer to directly transfer the simulative low pass prototype design to all kinds of needed principles and design methods. This methods advantage is that it is very direct, and universal. So, this method is simple, convenient, practical and fast. Read More Read Less

Abstract Network virtualization opens a promising way to support diverse applications over a shared substrate by running multiple virtual networks. Current virtual data centers in cloud computing have flexible mechanisms to partition compute resources but provide little control over how tenants share the network. This paper proposes a utility-maximization model for bandwidth sharing between virtual networks in the same substrate network.... Network virtualization opens a promising way to support diverse applications over a shared substrate by running multiple virtual networks. Current virtual data centers in cloud computing have flexible mechanisms to partition compute resources but provide little control over how tenants share the network. This paper proposes a utility-maximization model for bandwidth sharing between virtual networks in the same substrate network. The aim is to improve the fairness of virtual bandwidth allocation for multi tenants, especially for virtual links which share the same physical link and carry nonfriendly traffic. We first given a basic model and then proved the model can be split into many sub models which can run on each rack-switch port. In the sub model, every physical link is associated with a fairness index constraint in maximize utility calculating. The goal is to limit the differences among the bandwidth allocation of the virtual links which share the same physical link. Experimental results show that the virtual bandwidth allocation between tenants is more reasonable. Read More Read Less

Abstract To satisfy the robust requirement when designing fault identifying method, this paper proposes a novel method to identify sensor fault. Conventional fault identifying method could only classify fault into explicit set. Yet, when a novel faulty pattern occurs, the conventional method can not identify this new pattern and will classify it into a set known ahead of time. For the... To satisfy the robust requirement when designing fault identifying method, this paper proposes a novel method to identify sensor fault. Conventional fault identifying method could only classify fault into explicit set. Yet, when a novel faulty pattern occurs, the conventional method can not identify this new pattern and will classify it into a set known ahead of time. For the purpose of robustness of fault identifying method, the supervised classification and the unsupervised clustering are integrated together. Faulty features are extracted with wavelet package decomposition to train the supervised classification algorithm and the unsupervised clustering algorithm. As the supervised classification method, Support Vector Machine (SVM) is utilized to classify those faulty patterns known ahead of time into explicit set for the purpose of identifying faulty pattern. As the unsupervised clustering method, subtractive clustering method is utilized to identify the novel fault pattern. Therefore, SVM and subtractive clustering are integrated to identify sensor fault pattern even when novel faulty pattern emerges. The applicability and effectiveness of the proposed method is illustrated by flow sensor data in an engine fuel providing system. The result shows that the method adopted provides better performance compared with conventional method while satisfying the robust requirement of fault identifying method. Read More Read Less

Abstract This paper designed and developed a teaching robot - three degrees of freedom manipulator based on Fischer creative combination model platform. Firstly, the overall structure of the robot was analyzed to determine the drive programs, and then the manipulator structure was assembled and established in accordance with the modular design approach. Finally, the robot control system was studied. This paper... This paper designed and developed a teaching robot - three degrees of freedom manipulator based on Fischer creative combination model platform. Firstly, the overall structure of the robot was analyzed to determine the drive programs, and then the manipulator structure was assembled and established in accordance with the modular design approach. Finally, the robot control system was studied. This paper focuses on the hardware design and control system of the robot. Practice has proved that the teaching robot we designed has the advantages of low cost, easy to regulation, good repeatability and it has good promotion and application prospects in the teaching field. Read More Read Less

Abstract Some characteristics of the families of oddperiodic perfect complementary sequence pairs (OPCSPF) are discussed. The methods for constructing an OPCSPF are given and proved. The families of periodic perfect complementary sequence pairs can be constructed correspondingly by using the equivalent relationships, which further expanded the existence space of the complementary sequence.... Some characteristics of the families of oddperiodic perfect complementary sequence pairs (OPCSPF) are discussed. The methods for constructing an OPCSPF are given and proved. The families of periodic perfect complementary sequence pairs can be constructed correspondingly by using the equivalent relationships, which further expanded the existence space of the complementary sequence. Read More Read Less

Abstract Gate and runway combinational optimization (GRCO) problem is of great significance in airport operation. In this paper, experimental analysis is performed on the parameters characteristics of the discrete particle swarm optimization (DPSO) algorithm for combinatorial optimization problems. Inertia weight, acceleration constants and population size all have an important impact on the performance of the algorithm. Optimal values exist in the... Gate and runway combinational optimization (GRCO) problem is of great significance in airport operation. In this paper, experimental analysis is performed on the parameters characteristics of the discrete particle swarm optimization (DPSO) algorithm for combinatorial optimization problems. Inertia weight, acceleration constants and population size all have an important impact on the performance of the algorithm. Optimal values exist in the specific application of the respective parameters. The optimal value interval of the population size does not vary with different acceleration constants when inertia weight is constant. Increasing the population size can improve the solution quality, but the time overhead increases significantly. Finally, each parameters selection guidelines are provided. Read More Read Less

Abstract 2-D (2-dimension) bar code has many advantages compared with 1-D bar code, so it has many prevalent applications in recent days. However, there're several factors that affecting the sampling process, they lead to a certain degree of deformation towards the 2-D bar code. Furthermore, this deformation may too severe for 2-D bar code to be recognized. Generally, the main stream... 2-D (2-dimension) bar code has many advantages compared with 1-D bar code, so it has many prevalent applications in recent days. However, there're several factors that affecting the sampling process, they lead to a certain degree of deformation towards the 2-D bar code. Furthermore, this deformation may too severe for 2-D bar code to be recognized. Generally, the main stream of twisted image correcting is based on the approach of control-point transformation. So how to locate the control point accurately becomes a key factor in 2-D bar code correcting. This paper develops a QR barcode searching graph and gets the precise location of control point. Experiment shows that our algorithm has good efficiency and accuracy. Read More Read Less

Abstract Many complex nonlinear systems have the characteristics such as difficult modeling, dangerous testing, and high cost to experiment with fault. Aim at these points, a new kind of novelty estimation method based on an on-line Least Square Support Vector Regression (LS-SVR) algorithm is presented for fault prediction of nonlinear system in this paper. Firstly, a set of characteristic token values,... Many complex nonlinear systems have the characteristics such as difficult modeling, dangerous testing, and high cost to experiment with fault. Aim at these points, a new kind of novelty estimation method based on an on-line Least Square Support Vector Regression (LS-SVR) algorithm is presented for fault prediction of nonlinear system in this paper. Firstly, a set of characteristic token values, which represent normal state of time series at the beginning, are selected as the training data to establish the on-line LS-SVR model. Then, the output values of the on-line model are analyzed to estimate novel pattern. Once the novel pattern is affirmed, the fault of system is forecasted immediately. The proposed method needs neither the math model of system nor the fault training data and primary knowledge, and it is believed with good real-time capability. The results of simulation on Continuous Stirred Tank Reactor (CSTR) show the efficiency. Read More Read Less

Abstract Today, MapReduce and virtual cluster are sharp swords for this big data and cloud computing era. To combine these two emerging technologies, it brings feasible-scalability, easy-management, fast-deployment and high-efficiency with the system. As every sword has two sides, the I/O bottleneck of virtualization technologies may seriously impacts on the performance of MapReduce cluster which deals with I/O-intensive applications. In this... Today, MapReduce and virtual cluster are sharp swords for this big data and cloud computing era. To combine these two emerging technologies, it brings feasible-scalability, easy-management, fast-deployment and high-efficiency with the system. As every sword has two sides, the I/O bottleneck of virtualization technologies may seriously impacts on the performance of MapReduce cluster which deals with I/O-intensive applications. In this paper, we analyze the combination advantages and disadvantages of virtualization technology of MapReduce cluster. We also analyze the communication model for both of them and build a communication costs model. Then, we propose a novel algorithm of minimum-weight spanning tree to construct a lower communication costs virtual MapReduce cluster. With the help of constructing minimum-weight spanning tree, we find out a method to select local-master and group the cluster. Theoretical simulation and experiment results demonstrate that our method can greatly reduce communication costs. The performance improvement is up to ~40.4% respectively Read More Read Less

Abstract Spectrum sensing is a key technology in the study of cognitive radios, but its attributes are easily influenced by the channel fading. Compared with singleuser spectrum sensing, multiple-user spectrum sensing can overcome the impacts caused by the fading environment of cognitive radio. Since diversity technology has been proved to provide the system high transmission rate and high link reliability, we... Spectrum sensing is a key technology in the study of cognitive radios, but its attributes are easily influenced by the channel fading. Compared with singleuser spectrum sensing, multiple-user spectrum sensing can overcome the impacts caused by the fading environment of cognitive radio. Since diversity technology has been proved to provide the system high transmission rate and high link reliability, we propose a diversity-based multi-antenna cooperative detection model based on the original cooperative detecting model. By introducing the antenna technology, sensing users are equipped with a multi-antenna system. Simulations show that the performance of our proposal is better than that of detection based on single-antenna in cognitive radio network. What's more, performance of cooperative detection based on multi-antenna is even better than that of cooperative detection based on single-antenna cognitive radio network. Read More Read Less

Abstract Identity-based Broadcast Encryption (IBBE) has the inherent key escrow problem that Private Key Generator (PKG) can fully determine the user's private key, which is an obstacle of the application of IBBE. The existing approaches to solving key escrow problem need the user to submit identity to multiple PKGs or interactions between PKG and the user in the private key extraction... Identity-based Broadcast Encryption (IBBE) has the inherent key escrow problem that Private Key Generator (PKG) can fully determine the user's private key, which is an obstacle of the application of IBBE. The existing approaches to solving key escrow problem need the user to submit identity to multiple PKGs or interactions between PKG and the user in the private key extraction phase. For Point-to-Multipoint Identity-based Broadcast Encryption (P2MIBBE) that the computing capabilities of receiver are limited, these approaches are impracticable. We propose a new approach what we call Augmented Broadcaster Identity-based Broadcast Encryption (ABIBBE). It requires neither multiple PKGs nor calculation of receiver in the private key extraction phase. We construct a universal scheme to realize AB-IBBE, such that any IND-ID-CPA secure IBBE scheme can be extended to an IND-ID-CPA secure AB-IBBE scheme. Read More Read Less

Abstract It is analyzed that the family names of personal donators who donated through China Construction Bank Corporation to Chinese Red Cross Foundation for the WenChuan earthquake. The distribution of family names, the first 100 family names and their shares, the probability of the same family names as well as the Gini coefficient are all given in this paper. A heavy... It is analyzed that the family names of personal donators who donated through China Construction Bank Corporation to Chinese Red Cross Foundation for the WenChuan earthquake. The distribution of family names, the first 100 family names and their shares, the probability of the same family names as well as the Gini coefficient are all given in this paper. A heavy disproportion is showed in the distribution, that is to say a small part of family names occupy the absolutely large proportion while most of them are rare. This character is similar to power-law that has been observed in many demonstrations about family names. However, the Kolmogorov-Smirnov test fails to support the hypothesis. Instead, part of the data shows an exponential characteristic. As an innovative sampling method, the discussion may help to know the family name's distribution of China. Read More Read Less

Abstract Copyright protection and authentication of digital contents have become a significant issue in the current digital epoch with efficient communication mediums such as Internet. Digital watermarking technique is now one of the hot research fields of copyright protection for CAD graphic data under the network environment. But there are very limited techniques available for that because of its high shape-preserving... Copyright protection and authentication of digital contents have become a significant issue in the current digital epoch with efficient communication mediums such as Internet. Digital watermarking technique is now one of the hot research fields of copyright protection for CAD graphic data under the network environment. But there are very limited techniques available for that because of its high shape-preserving demand. Zero-watermarking is such a good means to deal with it and it has lots of advantages such as high capacity, good robustness and various functions. In this paper, we will discuss zerowatermarking algorithm for CAD models and eventually propose a watermarking-based digital rights management system that would test our techniques. Read More Read Less

Abstract In order to solve the problem that there is only one dealer in the existing secret sharing scheme, based on large integer factorization and discrete logarithm problems, a new sharing scheme with multi-dealer is proposed, which is combined with Deffie-Hellman key agreement protocol. And then, security and performance analysis is made in this scheme. As the secret can be recovered... In order to solve the problem that there is only one dealer in the existing secret sharing scheme, based on large integer factorization and discrete logarithm problems, a new sharing scheme with multi-dealer is proposed, which is combined with Deffie-Hellman key agreement protocol. And then, security and performance analysis is made in this scheme. As the secret can be recovered with the shadows provided by participants and it is computationally difficult to get the sub-keys from the shadows, the sub-keys can be reused to share the multisecret. The multiple dealers can commonly maintain the shared secret, which can be dynamically renewed by any dealers. The proposed scheme has higher safety and effectiveness over the existing schemes and is more practical. Read More Read Less

Abstract The paper is studying and implementing a mining algorithm of community structure based on local information. When compared with the algorithm based on global information, our algorithm has a better performance on efficiency which only looses just a little accuracy. Firstly, we analyze the basic feature of community structure of complex network, then, lead to the character of community structure... The paper is studying and implementing a mining algorithm of community structure based on local information. When compared with the algorithm based on global information, our algorithm has a better performance on efficiency which only looses just a little accuracy. Firstly, we analyze the basic feature of community structure of complex network, then, lead to the character of community structure of complex network. Secondly, we introduce some previous work on complex networks and analyze some algorithms of community structure. Finally, we raise a new function to decide a certain node belongs to which community which based on the local modality raised by Clauset. We use the new function to improve the Bagrow algorithm and get a better result on accuracy and also get a new algorithm named Bagrow - β. After that we define two heuristic methods. According to the heuristic methods we created a new algorithm which called BLC algorithm. The new algorithm improves the speed of Bagrow-â algorithm while keeping the accuracy. Then we implement the algorithm with the model of MapReduce, and run the program on the Hadoop platform. Read More Read Less