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.展开更多
Li Xinfeng, a research fellow at the Chinese Academy of Social Scienc- es, served as the chief correspond- ent with the People's Daily in South Africa from 1998 to 2005. Li was in charge of the news coverage in the s...Li Xinfeng, a research fellow at the Chinese Academy of Social Scienc- es, served as the chief correspond- ent with the People's Daily in South Africa from 1998 to 2005. Li was in charge of the news coverage in the southern, eastern and central African regions and traveled across the continent, visiting over 20 AfrF can countries. His bookA Reporter's Exploration: Following Zheng He's Footsteps in Africa, marks China's first book on Zheng He's voyage to Africa, which filled the gap in the research on the history of Sino-African relations. Back in the 15th century, Zheng He, a famous Chinese admiral, sailed with his fleet as far as East Africa. Recently, Li spoke to ChinAfrica about his ex- periences in Africa as a journalist.展开更多
Writers Wang Yan and Wu Fugui’s book guides Chinese readers through Sudan’s 25 states and districts as they witnessed them before the country’s split last year HOW much is actually known about arab states-particula...Writers Wang Yan and Wu Fugui’s book guides Chinese readers through Sudan’s 25 states and districts as they witnessed them before the country’s split last year HOW much is actually known about arab states-particularly that of Sudan in North africa? Looking closely at this question, it becomes clear that there is much still un展开更多
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 focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears...This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears as commonplace in many realistic scenarios.Regarding this,we consider graphs composed of rings,with some possible connected paths between them.Without prior knowledge of the exact node permutations on rings,the existence of each edge can be unraveled through edge testing at a unit cost in one step.The problem examined is that of determining whether the given nodes are connected by a path or separated by a cut,with the minimum expected costs involved.Dividing the problem into different cases based on different topologies of the ring-based networks,we propose the corresponding policies that aim to quickly seek the paths between nodes.A common feature shared by all those policies is that we stick to going in the same direction during edge searching,with edge testing in each step only involving the test between the source and the node that has been tested most.The simple searching rule,interestingly,can be interpreted as a delightful property stemming from the neat structure of ring-based networks,which makes the searching process not rely on any sophisticated behaviors.We prove the optimality of the proposed policies by calculating the expected cost incurred and making a comparison with the other class of strategies.The effectiveness of the proposed policies is also verified through extensive simulations,from which we even disclose three extra intriguing findings:i)in a onering network,the cost will grow drastically with the number of designated nodes when the number is small and will grow slightly when that number is large;ii)in ring-based network,Depth First is optimal in detecting the connectivity between designated nodes;iii)the problem of multi-ring networks shares large similarity with that of two-ring networks,and a larger number of ties between rings will not influence the expected cost.展开更多
Nothing beats bargaining in a Beijing clothes market. As an American student, it's a completely novel experience, a great way to practice your Chinese, and gives you the feeling of discovering the real Beijing. Th...Nothing beats bargaining in a Beijing clothes market. As an American student, it's a completely novel experience, a great way to practice your Chinese, and gives you the feeling of discovering the real Beijing. The atmosphere is so different from shopping experiences in the United States. It seems here that it must be authentic展开更多
Located at the center of Beijing near Tiananmen Square,Qianmen Street, no more than 2 km long,has been a prosperous area for more than 600 years and has accumulated some long-standing stores.Many well-known Chinese st...Located at the center of Beijing near Tiananmen Square,Qianmen Street, no more than 2 km long,has been a prosperous area for more than 600 years and has accumulated some long-standing stores.Many well-known Chinese stores started their operations there.The reconstruction project aims to preserve the Qianmen Street’s history in its entirety. Qianshi hutong-the narrowest hutong in Beijing-is located there.At its展开更多
Dongcheng District, literally meaning eastern city, covers Beijing’s downtown area to the northeast of the central axis of old Beijing. The district has a total area of 25 square km and a population of 600,000. With ...Dongcheng District, literally meaning eastern city, covers Beijing’s downtown area to the northeast of the central axis of old Beijing. The district has a total area of 25 square km and a population of 600,000. With a large number of cultural and historical sites and tourist attractions,展开更多
This paper proposes an ontology-driven discovering model for the geographical information services to improve their recall ratio and precision ratio. This model uses the geographical information service ontology. In t...This paper proposes an ontology-driven discovering model for the geographical information services to improve their recall ratio and precision ratio. This model uses the geographical information service ontology. In this paper, first we study the multilevel matching arithmetic of geographical information services. This arithmetic is used for filtering and matching the services in the service register center according to the similarity between services selected and services requested from the definition of the function similarity and credit standing similarity. The matching arithmetic, geographical information service ontology and semantic description constitute the discovering model. Finally, we test and analyze the model from the recall ratio, precision ratio, responsivity and load balance. The result indicates that the ontology-driven discovering model is excellent in recall ratio and precision ratio, and can maintain the dynamic load balance of service copy.展开更多
Ningxia gaining luster as a tourist attraction in northwest China Crystal rivers, blue skies and flowering woods surround this city—you probably won’t believe it is Yinchuan, the capital city
An old industrial part of Beijing,known for its geomantic omens,will soon become a recreational area housing cultura and sporting facilities Shijingshan District,regarded as a geographically auspicious district,will s...An old industrial part of Beijing,known for its geomantic omens,will soon become a recreational area housing cultura and sporting facilities Shijingshan District,regarded as a geographically auspicious district,will soon become the site of the Capital Recreation District. The history of Shijingshan District,named after Shijingshan Hill,dates back at least 2,200 years.It occupies 86 square km,and the distance between the central area of the dis-展开更多
文摘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.
文摘Li Xinfeng, a research fellow at the Chinese Academy of Social Scienc- es, served as the chief correspond- ent with the People's Daily in South Africa from 1998 to 2005. Li was in charge of the news coverage in the southern, eastern and central African regions and traveled across the continent, visiting over 20 AfrF can countries. His bookA Reporter's Exploration: Following Zheng He's Footsteps in Africa, marks China's first book on Zheng He's voyage to Africa, which filled the gap in the research on the history of Sino-African relations. Back in the 15th century, Zheng He, a famous Chinese admiral, sailed with his fleet as far as East Africa. Recently, Li spoke to ChinAfrica about his ex- periences in Africa as a journalist.
文摘Writers Wang Yan and Wu Fugui’s book guides Chinese readers through Sudan’s 25 states and districts as they witnessed them before the country’s split last year HOW much is actually known about arab states-particularly that of Sudan in North africa? Looking closely at this question, it becomes clear that there is much still un
基金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 NSF China(No.61960206002,62020106005,42050105,62061146002)Shanghai Pilot Program for Basic Research-Shanghai Jiao Tong University。
文摘This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears as commonplace in many realistic scenarios.Regarding this,we consider graphs composed of rings,with some possible connected paths between them.Without prior knowledge of the exact node permutations on rings,the existence of each edge can be unraveled through edge testing at a unit cost in one step.The problem examined is that of determining whether the given nodes are connected by a path or separated by a cut,with the minimum expected costs involved.Dividing the problem into different cases based on different topologies of the ring-based networks,we propose the corresponding policies that aim to quickly seek the paths between nodes.A common feature shared by all those policies is that we stick to going in the same direction during edge searching,with edge testing in each step only involving the test between the source and the node that has been tested most.The simple searching rule,interestingly,can be interpreted as a delightful property stemming from the neat structure of ring-based networks,which makes the searching process not rely on any sophisticated behaviors.We prove the optimality of the proposed policies by calculating the expected cost incurred and making a comparison with the other class of strategies.The effectiveness of the proposed policies is also verified through extensive simulations,from which we even disclose three extra intriguing findings:i)in a onering network,the cost will grow drastically with the number of designated nodes when the number is small and will grow slightly when that number is large;ii)in ring-based network,Depth First is optimal in detecting the connectivity between designated nodes;iii)the problem of multi-ring networks shares large similarity with that of two-ring networks,and a larger number of ties between rings will not influence the expected cost.
文摘Nothing beats bargaining in a Beijing clothes market. As an American student, it's a completely novel experience, a great way to practice your Chinese, and gives you the feeling of discovering the real Beijing. The atmosphere is so different from shopping experiences in the United States. It seems here that it must be authentic
文摘Located at the center of Beijing near Tiananmen Square,Qianmen Street, no more than 2 km long,has been a prosperous area for more than 600 years and has accumulated some long-standing stores.Many well-known Chinese stores started their operations there.The reconstruction project aims to preserve the Qianmen Street’s history in its entirety. Qianshi hutong-the narrowest hutong in Beijing-is located there.At its
文摘Dongcheng District, literally meaning eastern city, covers Beijing’s downtown area to the northeast of the central axis of old Beijing. The district has a total area of 25 square km and a population of 600,000. With a large number of cultural and historical sites and tourist attractions,
基金Supported by the Degree Dissertation of Doctor Natural Science Innovation Foundation of Information Engineering University(2007)
文摘This paper proposes an ontology-driven discovering model for the geographical information services to improve their recall ratio and precision ratio. This model uses the geographical information service ontology. In this paper, first we study the multilevel matching arithmetic of geographical information services. This arithmetic is used for filtering and matching the services in the service register center according to the similarity between services selected and services requested from the definition of the function similarity and credit standing similarity. The matching arithmetic, geographical information service ontology and semantic description constitute the discovering model. Finally, we test and analyze the model from the recall ratio, precision ratio, responsivity and load balance. The result indicates that the ontology-driven discovering model is excellent in recall ratio and precision ratio, and can maintain the dynamic load balance of service copy.
文摘Ningxia gaining luster as a tourist attraction in northwest China Crystal rivers, blue skies and flowering woods surround this city—you probably won’t believe it is Yinchuan, the capital city
文摘An old industrial part of Beijing,known for its geomantic omens,will soon become a recreational area housing cultura and sporting facilities Shijingshan District,regarded as a geographically auspicious district,will soon become the site of the Capital Recreation District. The history of Shijingshan District,named after Shijingshan Hill,dates back at least 2,200 years.It occupies 86 square km,and the distance between the central area of the dis-