22165485
An Efficient Fuzzy Kohonen Clustering Network Algorithm
Fuzzy Kohonen clustering networks (FKCN) are well known for clustering analysis (unsupervised learning and self-organizing). This classification of FKCN algorithm is a set of iterative procedures that suffer some major problems, for example its constringency rate is not too fast for a large amount of datasets. To overcome these defects, an efficient fuzzy Kohonen network algorithm is proposed in this paper, which can significantly reduce the computation time required to partition a dataset into desired clusters. By introducing the threshold values and fuzzy convergence operators in the network learning procedure to adjust the learning rates dynamically, the network convergence rate is greatly improved and the error rates of dataset cluster are significantly decreased. Experimental results show the new algorithm is on average three times faster than the original FKCN algorithm. We also demonstrate that the quality of the improved FKCN is better than the original FKCN algorithm.
43405539
An Improved Method of Traffic Forecasting Based on Tariff-SASVR
Traffic forecasting is critical for mobile operators to grasp market trends and control network capacity. Therefore, an improved method of forecasting for mobile traffic is presented in this paper. The traffic is divided into the general trend part and seasonal part to forecast them respectively. The general trend is predicted by fitting the curve of general trend on tariff level; and the remaining seasonal part is predicted by simulated annealing-support vector regression machine (SASVR) which uses simulated annealing (SA) to select the super-parameters of SVR. The experimental results show that not only this method improves the prediction accuracy but it provides mobile operators with a visual expression of the relationship between traffic and the tariff level.
16326025
Research on Positioning Technology of Xinjiang Mobile GIS
In this paper, the characteristics of Xinjiang mobile communication network are analyzed, the results show that for a reliable mobile communication network, BS (base station) and base station control BSC (base station controller) monitoring system, cable and fiber optic cable monitoring system and mobile communications troubleshooting and dispatching system should be built. Combined with GIS, GPS, GSM and geographic database technology, positioning technology for different targets and detection on fault point are studied, the results indicate that precise positioning of static target can accurately locate the failure telecom equipment in the electronic map and provide data source for the realization of real-time monitoring and management system for telecom equipment based on GIS & wireless sensor network technology. GSM-based wireless messaging communications and real-time fast positioning of dynamic target is the key to the emergency repair vehicles monitoring and dispatch system. The proposed fault determination and fault point location method can provide fast accurately fault devices location with detailed geography information and prompt the efficiency of fault management and improve the reliability of telecom network services. The above research results are important basis on the design and implementation of the system.
7427813
Triangulation of Bayesian Networks Using an Adaptive Genetic Algorithm
The search for an optimal node elimination sequence for the triangulation of Bayesian networks is an NP-hard problem. In this paper, a new method, called the TAGA algorithm, is proposed to search for the optimal node elimination sequence. TAGA adjusts the probabilities of crossover and mutation operators by itself, and provides an adaptive ranking-based selection operator that adjusts the pressure of selection according to the evolution of the population. Therefore the algorithm not only maintains the diversity of the population and avoids premature convergence, but also improves on-line and off-line performances. Experimental results show that the TAGA algorithm outperforms a simple genetic algorithm, an existing adaptive genetic algorithm, and simulated annealing on three Bayesian networks.
29402189
Non-Standard Models for Formal Logics
showed that there must be a model in which that portion of the model which is supposed to represent the positive integers of the formal logic is not in fact isomorphic to the positive integers; indeed it is not even well ordered by what is supposed to be the relation of <. For the purposes of the present paper, we do not need a precise definition of what is meant by a standard model of a formal logic. The non-standard models which we shall discuss will be flagrantly non-standard, as for instance a model of the sort whose existence is proved by Henkin. It will suffice if we and our readers are in agreement that a model of a formal logic is not a standard model if either: (a) The relation in the model which represents the equality relation in the formal logic is not the equality relation for objects of the model. (b) That portion of the model which is supposed to represent the positive integers of the formal logic is not well ordered by the relation <. (c) That portion of the model which is supposed to represent the ordinal numbers of the formal logic is not well ordered by the relation <. Our first result is that there is no standard model for the system known as "Quine's New Foundations" (see [2] and [3]). This is proved for the logic originally proposed by Quine (see [2]), which is a system of such apparent weakness that so far no one has succeeded in proving the axiom of infinity in the system. Clearly, if there is no standard model for this apparently weak system, there cannot be a standard model for any apparently stronger system which one might form by adding additional axioms, such as the axiom of infinity. A natural reaction to this result would be to suspect that there is no model of any sort for Quine's New Foundations; that is to suspect that it is inconsistent. An alternative (and much less likely) reaction would be to suspect that the property of not having a standard model is perhaps a not uncommon property of strong formal logics, and to suspect that perhaps several of the familiar strong formal logics have no standard model. Unlikely as this might appear at first sight, we will present considerable evidence in favor of the idea. In particular we shall show that it is a property of each of the familiar formal logics that if it is w-consistent then one cannot prove in the logic itself that if the logic is consistent it must have a standard model; in fact, one cannot prove this statement about the logic even in certain stronger logics if these stronger logics are simply consistent.
10472791
Certified Email Delivery with Offline TTP
Email has become a standard communication method nowadays. But when it comes to important correspondences containing sensitive governmental, commercial or medical information, certified delivery is required. We present in this paper a new certified email protocol which assures fair delivery, non-repudiability, confidentiality and timeliness. To achieve definite fairness, an offline TTP is employed which will be involved only if there is a dispute.
6984424
Ontology-based security assessment for software products
This paper proposes an ontology-based approach to analyzing and assessing the security posture for software products. It provides measurements of trust for a software product based on its security requirements and evidence of assurance, which are retrieved from an ontology built for vulnerability management. Our approach differentiates with the previous work in the following aspects: (1) It is a holistic approach emphasizing that the system assurance cannot be determined or explained by its component assurance alone. Instead, the software system as a whole determines its assurance level. (2) Our approach is based on widely accepted standards such as CVSS, CVE, CWE, CPE, and CAPEC. Our ontology integrated these standards seamlessly thus provides a solid foundation for security assessment. (3) Automated tools have been built to support our approach, delivering the environmental scores for software products.
8066461
Scalability of Hybrid Fuzzy C-Means Algorithm Based on Quantum-Behaved PSO
A new hybrid fuzzy clustering algorithm that incorporates the fuzzy c-means (FCM) into the quantum-behaved particle swarm optimization (QPSO) algorithm is proposed in this paper (QPSO+FCM). The QPSO has less parameters and higher convergent capability of the global optimizing than particle swarm optimization algorithm (PSO). So the iteration algorithm is replaced by the QPSO based on the gradient descent of FCM, which makes the algorithm have a strong global searching capacity and avoids the local minimum problems of FCM and in a large degree avoids depending on the initialization values. This paper also investigates the ability of FCM algorithm, PSO+FCM algorithm and GA+FCM algorithm with Iris testing data and Wine testing data. The simulation result proves that compared with other algorithms, the new algorithm not only has the favorable convergence but also has been obviously improved the clustering effect.