Since the Chinese Communist Party established a government in 1949, this country has operated the control of the society, nearly via penetrating to the society interior basic-level organization. After the political reform of social structure and economic basis, the Communist China has determined her pattern of penetration, mobilization and control in the society. As domination of the media has been one of the pivotal means in society control, the Communist China official can decide which information people may receive through the strict news scrutiny, and takes advantage of this method to instill people the official ideology as well. News involves the social turmoil, affects the populace confidence to the government or implies the peaceful evolution, is forbidden to disseminate on the mainland media. However, the Internet¡¦s unbounded penetration turns out to be a big challenge to impose such a strict scrutiny, challenging the Communist China to carry on the traditional way of controlling the society by maneuvering the media. To the Chinese government which has not been used to considering the populace opinion, what more and more disadvantageous is that the Internet has started to become a newborn power to be able to affect the Chinese politics and the policy decision, even although policy makers would not defer to the public opinion in doing the decision-making, they would not be able to shun it entirely. This article is to research and discuss, mainly from the aspects of social consciousness, nation and society relations, national sovereignty and so on, the Internet development in mainland and the control by the Communist China. Simultaneously, from the dissemination function and the characteristic of the Internet, it is to inspect its influence to the country and the society nowadays, furthermore, to extrapolate the possibility of network democracy. Given the fact that Internet may bring the consequences of loosing the control on country and society, the Communist China has established the comprehensive control measure, preventing by all means the so-called harmful information to circulate, achieving also the effect of threat and restriction while she is developing with all her strength. The challenge to the authority renews as the code-breaking technology renews with each passing day, also. Therefore we may extrapolate accordingly that the Internet development has caused the Communist China¡¦s authority to decline day after day. And the society may obtain the relative development of independency and diversity. Presently in China, the population ever accesses the internet already exceeds one hundred million. Although it is less than 8% of the total population and still a long way to go to accomplish overall popularized, the new community group and network consciousness already take the berth of the traditional dissemination media. Along with the rising of the young, non-ideological and malleable network new generation, it inevitably will accelerate the deepening of affecting the society. Therefore, this topic also will be worth continuing to observe and research.

Nowadays, the methods of improving the Reliability of network packets are existent. Some start with the software and others with the hardware. For example, like the Dual System, Redundancy or Fault Tolerant Network, etc. However, it costs a lot to construct the required mechanism, and these methods are not reliable for some special network packets, like the UDP packet. Is there a method to raise the reliability of UDP packet just to increase the software equipments or hardware equipments? The network controller that improves the Reliability of UDP Packets in this thesis uses the same two packets, and it transfers the two packets into different network paths to the same destination workstation. This mechanism can avoid the network accidents causing by the network wires breaking or the network switch machine turn-off, and the destination workstation can¡¦t be hurt from the damage of losing the information carried by UDP packets. Moreover, this method can detect the network accidents as the function of the Fault Tolerant Network by using the dual packets, and send signals to alert the network manager ahead of time. In addition, by using the network controller, network manager or constructor mentioned in this thesis, the RNP topology can be easily built, just by connecting the RNP type wires to the network switches or network bridges.

Due to the advances in content distribution and data center technologies, the traffic inside metropolitan area network (MAN) becomes more and more distributed. The current MAN architecture that only plays the role of bridge becomes insufficient to handle such new traffic patterns. Hence, the demand for a new MAN architecture is inevitable. It is expected to be both efficient and cost-effective. In this thesis, we proposed Optical Buffer Ring (OBR) as the solution of next generation MAN. It combines both OBS's low end-to-end delay and RPR's low loss rate. And compared to more advanced network architectures based on optical packet switching, OBR is of lower cost and thus more feasible in the near future. To evaluate the performance of OBR, we conducted simulation study over large set of parameters. According to the results, the performance of OBR indeed coincides with our expectation. Furthermore, OBR scales better than both OBS and RPR in that the end-to-end delay of OBR decreases as network size increases while the loss rate increases little with network size. Index Terms¡ÐMAN, WDM, OBS, OBR, RPR, HORNET, LightRing, Diffserv, optical packet switching.

Abstract It likes a knowledge ¡§Yellow Pages ¡¨, knowledge map, indicates where is knowledge and how to get it, but doesn¡¦t contain knowledge. The principal purpose of a knowledge map is showing domain expert when someone need expertise. The resources of teachers¡¦ knowledge map, teachers¡¦ professional information, are fragmented by geographic condition. The map is piece not complete one. As rapid development of Internet, the rich webs contents provide a new way to build global teachers¡¦ knowledge map. The goal of this research is constructing¡yTeachers¡¦ Knowledge Map¡zfor sufficient knowledge sharing environment by collecting teachers¡¦ relative information from the web pages automatically and integrating plentiful Internet resource. There are four main purposes of this research, include (1) getting teachers¡¦ vita from web gages. (2) using teachers¡¦ personal vita and others webs¡¦ resources to construct teacher¡¦s professional specialty, and indicate research issues of teachers. (3) reflecting teachers¡¦ social network by web pages to show social information of individual teacher or group. Teachers¡¦ social network can provide information of how to get the expertise. (4) integrating prior purposes to create useful teachers¡¦ knowledge map for sufficient knowledge sharing environment.

Social network analysis is used to find all relationships from the group, dig out the prominent patterns, and observe how information flows between dyads. By social network analysis approaches, users can know how information flows through network ties, how people acquire information and resources, and how cleavages and coalitions operate. In this research, we develop a useful social network analysis system to facilitate teams¡¦ collaboration. The system can draw a social network in ego-centered or whole network layout, and provide information of social network attributes of all users. Both team leaders and general members can make use of it to understand relations and interaction patterns of their team. We also generalize social network attributes to analyze task-based teams at different team development stages for discovering the interaction patterns of different groups in groups¡¦ life cycles. Interaction patterns of members in the team and roles that users play have high influence on a virtual team¡¦s development. With these discoveries, team leaders can obtain concise information about their teams¡¦ performance, and community managers can capture stereotypes of virtual teams in the community. From these evaluation results, we confirm that social network analysis is a useful means to analyze the knowledge activities conducted by virtual teams.

Neural networks (NNs) are widely used to investigate the relationship among variables in complex multivariate problems. In cases of limited data, the network behavior strongly depends on factors such as the choice of network activation function and network initial weights. In this study, I investigated the use of neural networks for multivariate analysis in the case of limited data. The analysis shows that special attention should be paid when building and using NNs in cases of limited data. The linear activation function at the output nodes outperforms the sigmoidal and Gaussian functions. I found that combining network predictions gives less biased predictions and allows for the assessment of the prediction variability. The NN results, along with conventional statistical analysis, were used to examine the effects of folding, bed thickness, structural position, and lithology on the fracture properties distributions in the Lisburne Formation, folded and exposed in the northeastern Brooks Range of Alaska. Fracture data from five folds, representing different degrees of folding, were analyzed. In addition, I modeled the fracture system using the discrete fracture network approach and investigated the effects of fracture properties on the flow conductance of the system. For the Lisburne data, two major fracture sets striking north/south and east/west were studied. Results of the NNs analysis suggest that fracture spacing in both sets is similar and weakly affected by folding and that stratigraphic position and lithology have a strong effect on fracture spacing. Folding, however, has a significant effect on fracture length. In open folds, fracture lengths in both sets have similar averages and variances. As the folds tighten, both the east/west and north/south fracture lengths increase by a factor of 2 or 3 and become more variable. In tight folds, fracture length in the north/south direction is significantly larger than in the east/west direction. The difference in length between the two fracture sets creates a strong anisotropy in the reservoir. Given the same fracture density in both sets, the set with the greater length plays an important role for fluid flow, not only for flow along its principal direction but also in the orthogonal direction.

Camouflaging is about making something invisible or less visible. Network camouflaging is about hiding certain traffic information (e.g. traffic pattern, traffic flow identity, etc.) from internal and external eavesdroppers such that important information cannot be deduced from it for malicious use. It is one of the most challenging security requirements to meet in computer networks. Existing camouflaging techniques such as traffic padding, MIX-net, etc., incur significant performance degradation when protected networks are wireless networks, such as sensor networks and mobile ad hoc networks. The reason is that wireless networks are typically subject to resource constraints (e.g. bandwidth, power supply) and possess some unique characteristics (e.g. broadcast, node mobility) that traditional wired networks do not possess. This necessitates developing new techniques that take account of properties of wireless networks and are able to achieve a good balance between performance and security. In this three-part dissertation we investigate techniques for providing network camouflaging services in wireless networks. In the first part, we address a specific problem in a hierarchical multi-task sensor network, i.e. hiding the links between observable traffic patterns and user interests. To solve the problem, a temporally constant traffic pattern, called cover traffic pattern, is needed. We describe two traf- fic padding schemes that implement the cover traffic pattern and provide algorithms for achieving the optimal energy efficiencies with each scheme. In the second part, we explore the design of a MIX-net based anonymity system in mobile ad hoc networks. The objective is to hide the source-destination relationship with respect to each connection. We survey existing MIX route determination algorithms that do not account for dynamic network topology changes, which may result in high packet loss rate and large packet latency. We then introduce adaptive algorithms to overcome this problem. In the third part, we explore the notion of providing anonymity support at MAC layer in wireless networks, which employs the broadcast property of wireless transmission. We design an IEEE 802.11-compliant MAC protocol that provides receiver anonymity for unicast frames and offers better reliability than pure broadcast protocol.

Wireless Sensor Network (WSN) is composed of micro sensor nodes and it represents that they are small in size and cheap in cost but own limited capacity of computation and operation time. WSN is used to detect and sense events like temperature, earthquake, creature activities, atmospheric pressure and so on. By the property of wireless data transmission, WSN can be rapidly deployed and easily built up. In other hand, lifetime of WSN has been constrained by the batteries built in each sensor node. To transmit sensed data back to the base station spends the most energy for the WSN, and thus how to operate efficiently will be the key to extend the operating time of the WSN. There are a lot of related researches that proposed many routing protocols to maximize WSN lifetime and clustering is a proven routing protocol for WSN energy efficiency. The clustering method group nearby nodes together and choose one of them as a cluster-head that will transmit data back. The most important issue of clustering method is to choose which as a cluster-head. Usually, cluster-head will be chosen by probability and normal nodes will choose their own cluster-head by distance. Global-fit and Energy-Efficient (GFEE) algorithm, which is based on global-fit concept, is proposed to enhance lifetime of WSN. GFEE not only chooses cluster-head by probability and taking turns, but also bases on residual energy. All other nodes choose their cluster-head by distance and total energy consumption. Nodes with low power should be protected by some mechanisms. Experiments approved GFEE, especially in the situations of nodes widely spread or long distance transmission.

Unlike the traditional store-and-forward mechanism in packet-switching networks,network coding schemes could combine and modify the contents of a number of packets from different source before the packets are forwarded.It has been recently shown that network coding techniques can significantly increase the overall throughput of wireless networks by taking advantage of their broadcast nature. In wireless networks,each transmitted packet is broadcasted within a certain area and can be overheard by the neighboring nodes.When a node needs to transmit packets,it employs the coding approach that uses the knowledge of what the node's neighbors have heard in order to reduce the number of transmissions. In this thesis,I propose jointly designing the network coding scheme and the media access control scheme to improve the performance of wireless networks.

<p>On the Internet an enormous amount of information is available that is represented in an unstructured form. The purpose with a text mining tool is to collect this information and present it in a more structured form. In this report text mining is used to create an algorithm that searches abstracts available from PubMed and finds specific relationships between genes that can be used to create a network. The algorithm can also be used to find information about a specific gene. The network created by Mendoza et al. (1999) was verified in all the connections but one using the algorithm. This connection contained implicit information. The results suggest that the algorithm is better at extracting information about specific genes than finding connections between genes. One advantage with the algorithm is that it can also find connections between genes and proteins and genes and other chemical substances.</p>