This paper mainly introduces about how to use socket to design network program which can transfer data in different network platform in terms of TCP/IP Network Programming Standard.
To meet society’s needs for undergraduate students to have engineering skills and to develop students’ability to operate Linux and engage in network software development,this paper proposes the construction of a new...To meet society’s needs for undergraduate students to have engineering skills and to develop students’ability to operate Linux and engage in network software development,this paper proposes the construction of a new specialized course for network engineering major--Linux system and network programming.This paper analyzes the course’s advantages,presents the contents of this course,designs a series of teaching methods aimed at improving students’engineering ability,proposes a course assessment method that will encourage students to practice,lists the development requirements for an examination software designed for this course,and finally,presents the results of our practice in teaching this course.展开更多
This paper investigates the maximum network through- put for resource-constrained space networks based on the delay and disruption-tolerant networking （DTN） architecture. Specifically, this paper proposes a methodol...This paper investigates the maximum network through- put for resource-constrained space networks based on the delay and disruption-tolerant networking （DTN） architecture. Specifically, this paper proposes a methodology for calculating the maximum network throughput of multiple transmission tasks under storage and delay constraints over a space network. A mixed-integer linear programming （MILP） is formulated to solve this problem. Simula- tions results show that the proposed methodology can successfully calculate the optimal throughput of a space network under storage and delay constraints, as well as a clear, monotonic relationship between end-to-end delay and the maximum network throughput under storage constraints. At the same time, the optimization re- sults shine light on the routing and transport protocol design in space communication, which can be used to obtain the optimal network throughput.展开更多
This paper shows a number of Problems in pure and applied mathematicsthat are solved by constructing transportation networks.Moreover,it also shows thatall the solutions are characterized by forbidden configurations w...This paper shows a number of Problems in pure and applied mathematicsthat are solved by constructing transportation networks.Moreover,it also shows thatall the solutions are characterized by forbidden configurations which are not minors.However,all the characterizations are much related to the graphic method which wasfound by Chinese for solving a kind of the transportation problem in the fifties.展开更多
Modulating both the clock frequency and supply voltage of the network-on-chip （NoC） during runtime can reduce the power consumption and heat flux, but will lead to the increase of the latency of NoC. It is necessary...Modulating both the clock frequency and supply voltage of the network-on-chip （NoC） during runtime can reduce the power consumption and heat flux, but will lead to the increase of the latency of NoC. It is necessary to find a tradeoff between power consumption and communication latency. So we propose an analytical latency model which can show us the relationship of them. The proposed model to analyze latency is based on the M/G/1 queuing model, which is suitable for dynamic frequency scaling. The experiment results show that the accuracy of this model is more than 90%.展开更多
The Kohonen self-organizing map (SOM) is an important tool to find a mapping from high-dimensional space to low dimensional space. The time a SOM requires increases with the number of neurons. A parallel implementatio...The Kohonen self-organizing map (SOM) is an important tool to find a mapping from high-dimensional space to low dimensional space. The time a SOM requires increases with the number of neurons. A parallel implementation of the algorithm can make it faster. This paper investigates the most recent parallel algorithms on SOMs. Using Java network programming utilities, improved parallel and distributed system are set up to simulate these algorithms. From the simulations, we conclude that those algorithms form good feature maps.展开更多
Large-scale object-oriented（OO） software systems have recently been found to share global network characteristics such as small world and scale free,which go beyond the scope of traditional software measurement and ...Large-scale object-oriented（OO） software systems have recently been found to share global network characteristics such as small world and scale free,which go beyond the scope of traditional software measurement and assessment methodologies.To measure the complexity at various levels of granularity,namely graph,class（and object） and source code,we propose a hierarchical set of metrics in terms of coupling and cohesion-the most important characteristics of software,and analyze a sample of 12 open-source OO software systems to empirically validate the set.Experimental results of the correlations between cross-level metrics indicate that the graph measures of our set complement traditional software metrics well from the viewpoint of network thinking,and provide more effective information about fault-prone classes in practice.展开更多
This is a brief report on our recent work in network piecewise linear programming (NPLP),and it consists of two parts. In the first park, we describe a generator for NPLP problems which is derived from the classical n...This is a brief report on our recent work in network piecewise linear programming (NPLP),and it consists of two parts. In the first park, we describe a generator for NPLP problems which is derived from the classical network linear program generator NETGEN. The generator creates networks of the same topological structures as NETGEN, but each arc is associated with a convex piecewise linear cost. The purpose of this program is to provide a set of standard test problems which can be used to compare the performance of various algorithms for NPLP. In the second part,we introduce a network simplex method that directly solves a network piecewise linear program without reformulating it as a network linear program of higher dimension. Forty benchmark NPLP problems are solved by this method and a reformulation method. The computational results are in favor of the direct method and show that solving an NPLP problem is not much harder than solving a network linear program of the same dimension.展开更多
文摘This paper mainly introduces about how to use socket to design network program which can transfer data in different network platform in terms of TCP/IP Network Programming Standard.
基金supported by the Teaching Research and Reform Project of Qingdao University of Technology under Grant 2024-10335040。
文摘To meet society’s needs for undergraduate students to have engineering skills and to develop students’ability to operate Linux and engage in network software development,this paper proposes the construction of a new specialized course for network engineering major--Linux system and network programming.This paper analyzes the course’s advantages,presents the contents of this course,designs a series of teaching methods aimed at improving students’engineering ability,proposes a course assessment method that will encourage students to practice,lists the development requirements for an examination software designed for this course,and finally,presents the results of our practice in teaching this course.
基金supported by the National Natural Sciences Foundation of China(6113200261321061+3 种基金6123101161201183)the National Basic Research Program of China(2014CB340206)the Tsinghua University Initiative Scientific Research Program(2011Z05117)
文摘This paper investigates the maximum network through- put for resource-constrained space networks based on the delay and disruption-tolerant networking （DTN） architecture. Specifically, this paper proposes a methodology for calculating the maximum network throughput of multiple transmission tasks under storage and delay constraints over a space network. A mixed-integer linear programming （MILP） is formulated to solve this problem. Simula- tions results show that the proposed methodology can successfully calculate the optimal throughput of a space network under storage and delay constraints, as well as a clear, monotonic relationship between end-to-end delay and the maximum network throughput under storage constraints. At the same time, the optimization re- sults shine light on the routing and transport protocol design in space communication, which can be used to obtain the optimal network throughput.
文摘This paper shows a number of Problems in pure and applied mathematicsthat are solved by constructing transportation networks.Moreover,it also shows thatall the solutions are characterized by forbidden configurations which are not minors.However,all the characterizations are much related to the graphic method which wasfound by Chinese for solving a kind of the transportation problem in the fifties.
基金supported by the National Natural Science Foundation of China under Grant No.61376024 and No.61306024Natural Science Foundation of Guangdong Province under Grant No.S2013040014366Basic Research Programme of Shenzhen No.JCYJ20140417113430642 and JCYJ20140901003939020
文摘Modulating both the clock frequency and supply voltage of the network-on-chip （NoC） during runtime can reduce the power consumption and heat flux, but will lead to the increase of the latency of NoC. It is necessary to find a tradeoff between power consumption and communication latency. So we propose an analytical latency model which can show us the relationship of them. The proposed model to analyze latency is based on the M/G/1 queuing model, which is suitable for dynamic frequency scaling. The experiment results show that the accuracy of this model is more than 90%.
文摘The Kohonen self-organizing map (SOM) is an important tool to find a mapping from high-dimensional space to low dimensional space. The time a SOM requires increases with the number of neurons. A parallel implementation of the algorithm can make it faster. This paper investigates the most recent parallel algorithms on SOMs. Using Java network programming utilities, improved parallel and distributed system are set up to simulate these algorithms. From the simulations, we conclude that those algorithms form good feature maps.
基金Supported by the National Grand Fundamental Research 973 Program of China under Grant No.2007CB310800the National Natural Science Foundation of China under Grant Nos.60873083 and 60803025+2 种基金the Research Fund for the Doctoral Program of Higher Education of China under Grant No.20090141120022the Natural Science Foundation of Hubei Province of China under Grant Nos.2008ABA379 and 2008CDB351the Fundamental Research Funds for the Central Universities of China under Grant No.6082005
文摘Large-scale object-oriented（OO） software systems have recently been found to share global network characteristics such as small world and scale free,which go beyond the scope of traditional software measurement and assessment methodologies.To measure the complexity at various levels of granularity,namely graph,class（and object） and source code,we propose a hierarchical set of metrics in terms of coupling and cohesion-the most important characteristics of software,and analyze a sample of 12 open-source OO software systems to empirically validate the set.Experimental results of the correlations between cross-level metrics indicate that the graph measures of our set complement traditional software metrics well from the viewpoint of network thinking,and provide more effective information about fault-prone classes in practice.
文摘This is a brief report on our recent work in network piecewise linear programming (NPLP),and it consists of two parts. In the first park, we describe a generator for NPLP problems which is derived from the classical network linear program generator NETGEN. The generator creates networks of the same topological structures as NETGEN, but each arc is associated with a convex piecewise linear cost. The purpose of this program is to provide a set of standard test problems which can be used to compare the performance of various algorithms for NPLP. In the second part,we introduce a network simplex method that directly solves a network piecewise linear program without reformulating it as a network linear program of higher dimension. Forty benchmark NPLP problems are solved by this method and a reformulation method. The computational results are in favor of the direct method and show that solving an NPLP problem is not much harder than solving a network linear program of the same dimension.
