Peer-to-peer technologies have attracted increasing research attention with fruitful protocols and applications proposed for wired networks. As to mobile environments, there are currently no mature deployments. A nove...Peer-to-peer technologies have attracted increasing research attention with fruitful protocols and applications proposed for wired networks. As to mobile environments, there are currently no mature deployments. A novel resource managing and discovering protocol, Cheer, is proposed to realize scalable and effective peer-to-peer lookup in wireless self-organized networks. Cheer resolves the topologies mismatch problem between peer-to-peer overlay networks and actual nodes distribution, allowing for frequent nodes membership changes. With specially designed resource storage table, Cheer also supports multikey and fuzzy lookup. Its hybrid architecture and improved routing scheme based on small-world theory may realize effective lookup routing. Theoretical analysis and simulation results both prove that Cheer makes using peer-to-peer applications in large-scale self-organized mobile networks feasible and promising.展开更多
This paper presents the practice of automated theorem proving in Euclidean geometry with null geometric algebra, a combination of Conformal Geometric Algebra and Grassmann-Cayley algebra. This algebra helps generating...This paper presents the practice of automated theorem proving in Euclidean geometry with null geometric algebra, a combination of Conformal Geometric Algebra and Grassmann-Cayley algebra. This algebra helps generating extremely short and readable proofs: The proofs generated are mostly one-termed or two-termed. Besides, the theorems are naturally extended from qualitative description to quantitative characterization by removing one or more geometric constraints from the hypotheses.展开更多
Weispfenning in 1992 introduced the concepts of comprehensive Gr?bner system/basis of a parametric polynomial system, and he also presented an algorithm to compute them. Since then,this research ?eld has attracted muc...Weispfenning in 1992 introduced the concepts of comprehensive Gr?bner system/basis of a parametric polynomial system, and he also presented an algorithm to compute them. Since then,this research ?eld has attracted much attention over the past several decades, and many effcient algorithms have been proposed. Moreover, these algorithms have been applied to many different ?elds,such as parametric polynomial equations solving, geometric theorem proving and discovering, quanti?er elimination, and so on. This survey brings together the works published between 1992 and 2018, and we hope that this survey is valuable for this research area.展开更多
The technique of IP traceback may effectively block DOS (Denial Of Service) and meet the requirement of the computer forensic, but its accuracy depends upon that condition that each node in the Internet must support I...The technique of IP traceback may effectively block DOS (Denial Of Service) and meet the requirement of the computer forensic, but its accuracy depends upon that condition that each node in the Internet must support IP packet marking or detected agents. So far, this requirement is not satisfied. On the basis of traditional traceroute,this paper investigates the efficiency of discovering path methods from aspects of the size and order of detecting packets, and the length of paths.It points out that the size of padding in probed packets has a slight effect on discovering latency, and the latency with the method of bulk sending receiving is much smaller than one with the traditional traceroute. Moreover, the loss rate of packets with the technique of TTL (Time To Live) which increases monotonously is less than that with the technique of TTL which decreases monotonously. Lastly,OS (Operating System) passive fingerprint is used as heuristic to predict the length of the discovered path so as to reduce disturbance in network traffic.展开更多
Securities fraud is a common worldwide problem, resulting in serious negative consequences to securities market each year. Securities Regulatory Commission from various countries has also attached great importance to ...Securities fraud is a common worldwide problem, resulting in serious negative consequences to securities market each year. Securities Regulatory Commission from various countries has also attached great importance to the detection and prevention of securities fraud activities. Securities fraud is also increasing due to the rapid expansion of securities market in China. In accomplishing the task of securities fraud detection, China Securities Regulatory Commission (CSRC) could be facilitated in their work by using a number of data mining techniques. In this paper, we investigate the usefulness of Logistic regression model, Neural Networks (NNs), Sequential minimal optimization (SMO), Radial Basis Function (RBF) networks, Bayesian networks and Grammar Based Genet- ic Programming (GBGP) in the classification of the real, large and latest China Corporate Securities Fraud (CCSF) database. The six data mining techniques are compared in terms of their performances. As a result, we found GBGP outperforms others. This paper describes the GBGP in detail in solving the CCSF problem. In addition, the Synthetic Minority Over-sampling Technique (SMOTE) is applied to generate synthetic minority class examples for the imbalanced CCSF dataset.展开更多
基金supported by the National Natural Science Foundation of China(60672124)the Hi-Tech Research and Development Program of China(2007AA01Z221)
文摘Peer-to-peer technologies have attracted increasing research attention with fruitful protocols and applications proposed for wired networks. As to mobile environments, there are currently no mature deployments. A novel resource managing and discovering protocol, Cheer, is proposed to realize scalable and effective peer-to-peer lookup in wireless self-organized networks. Cheer resolves the topologies mismatch problem between peer-to-peer overlay networks and actual nodes distribution, allowing for frequent nodes membership changes. With specially designed resource storage table, Cheer also supports multikey and fuzzy lookup. Its hybrid architecture and improved routing scheme based on small-world theory may realize effective lookup routing. Theoretical analysis and simulation results both prove that Cheer makes using peer-to-peer applications in large-scale self-organized mobile networks feasible and promising.
基金supported by the National Natural Science Foundation of China under Grant No.11671388CAS Project QYZDJ-SSW-SYS022GF S&T Innovation Special Zone Project
文摘This paper presents the practice of automated theorem proving in Euclidean geometry with null geometric algebra, a combination of Conformal Geometric Algebra and Grassmann-Cayley algebra. This algebra helps generating extremely short and readable proofs: The proofs generated are mostly one-termed or two-termed. Besides, the theorems are naturally extended from qualitative description to quantitative characterization by removing one or more geometric constraints from the hypotheses.
基金supported in part by the CAS Project QYZDJ-SSW-SYS022the National Natural Science Foundation of China under Grant No.61877058the Strategy Cooperation Project AQ-1701
文摘Weispfenning in 1992 introduced the concepts of comprehensive Gr?bner system/basis of a parametric polynomial system, and he also presented an algorithm to compute them. Since then,this research ?eld has attracted much attention over the past several decades, and many effcient algorithms have been proposed. Moreover, these algorithms have been applied to many different ?elds,such as parametric polynomial equations solving, geometric theorem proving and discovering, quanti?er elimination, and so on. This survey brings together the works published between 1992 and 2018, and we hope that this survey is valuable for this research area.
文摘The technique of IP traceback may effectively block DOS (Denial Of Service) and meet the requirement of the computer forensic, but its accuracy depends upon that condition that each node in the Internet must support IP packet marking or detected agents. So far, this requirement is not satisfied. On the basis of traditional traceroute,this paper investigates the efficiency of discovering path methods from aspects of the size and order of detecting packets, and the length of paths.It points out that the size of padding in probed packets has a slight effect on discovering latency, and the latency with the method of bulk sending receiving is much smaller than one with the traditional traceroute. Moreover, the loss rate of packets with the technique of TTL (Time To Live) which increases monotonously is less than that with the technique of TTL which decreases monotonously. Lastly,OS (Operating System) passive fingerprint is used as heuristic to predict the length of the discovered path so as to reduce disturbance in network traffic.
文摘Securities fraud is a common worldwide problem, resulting in serious negative consequences to securities market each year. Securities Regulatory Commission from various countries has also attached great importance to the detection and prevention of securities fraud activities. Securities fraud is also increasing due to the rapid expansion of securities market in China. In accomplishing the task of securities fraud detection, China Securities Regulatory Commission (CSRC) could be facilitated in their work by using a number of data mining techniques. In this paper, we investigate the usefulness of Logistic regression model, Neural Networks (NNs), Sequential minimal optimization (SMO), Radial Basis Function (RBF) networks, Bayesian networks and Grammar Based Genet- ic Programming (GBGP) in the classification of the real, large and latest China Corporate Securities Fraud (CCSF) database. The six data mining techniques are compared in terms of their performances. As a result, we found GBGP outperforms others. This paper describes the GBGP in detail in solving the CCSF problem. In addition, the Synthetic Minority Over-sampling Technique (SMOTE) is applied to generate synthetic minority class examples for the imbalanced CCSF dataset.
