网络大众文化去中心化的面相

由于应用了网络新媒体技术,互联网作为一个全新的公共场域,较之传统场域聚合了更为广泛的受众,产生了有别于工业时代的大众文化。与工业时代大众文化受权力中心操控不同,网络大众文化呈现出鲜明的去中心化特质。这种去中心化特质具体表现为去文字中心、去美学中心、去理性(精神)中心以及去人类中心的多重面相。透过几乎不设限的开放空间及多重面相的复杂运作,网络大众文化拒斥各种封闭的中心化;而这种保持开放性的去中心化恰恰使得人类文化发展蕴含着无限可能。

引入计算机辅助管理和网络信息技术,加强施工企业的管理水平和核心竞争力

本文从工程项目管理的实际工作出发，用一些具体的实例，阐述了引入计算机机辅助管理和网络信息技术对加强施工企业的核心竞争力和施工管理水平的重要作用。

Anomaly detection for network traffic flow

This paper presents a mechanism for detecting flooding-attacks. The simplicity of the mechanism lies in its statelessness and low computation overhead, which makes the detection mechanism itself immune to flooding-attacks. The SYN-flooding, as an instance of flooding-attack, is used to illustrate the anomaly detection mechanism. The mechanism applies an exponentially weighted moving average (EWMA) method to detect the abrupt net flow and applies a symmetry analysis method to detect the anomaly activity of the network flow. Experiment shows that the mechanism has high detection accuracy and low detection latency.

A survey of the Internet application in the AEC industry

The Internet is becoming increasingly more valuable in the field ofarchitectural design so that what we conventionally called CAD might soon be changed to Internetaided design (iAD). In order to have a clear vision of what IAD will be or could be, we should firstexamine what is currently available. This research focuses on an investigation of selected Webvendors, which are typical and most influential in providing Internet related services for the AECindustry. By comparing and analyzing their functionality, services provided, business models,technology and financial situation, we have seen that Internet application in the AEC industry isstill in early stage, especially in the area of on-line engineering consulting for architects.

Smart Grids with Intelligent Periphery:An Architecture for the Energy Internet

A future smart grid must fulfill the vision of the Energy Internet in which millions of people produce their own energy from renewables in their homes, offices, and factories and share it with each other. Electric vehicles and local energy storage will be widely deployed. Internet technology will be utilized to transform the power grid into an energysharing inter-grid. To prepare for the future, a smart grid with intelligent periphery, or smart GRIP, is proposed. The building blocks of GRIP architecture are called clusters and include an energy-management system （EMS）-controlled transmission grid in the core and distribution grids, micro-grids, and smart buildings and homes on the periphery; all of which are hierarchically structured. The layered architecture of GRIP allows a seamless transition from the present to the future and plug-and-play interoperability. The basic functions of a cluster consist of （1） dispatch, （2） smoothing, and （3） mitigation. A risk-limiting dispatch methodology is presented; a new device, called the electric spring, is developed for smoothing out fluctuations in periphery clusters; and means to mitigate failures are discussed.

Modeling and Characterizing Internet Backbone Traffic

With enormous growth of the number of Internet users and appearance of new applications, characterization of Internet traffic has attracted more and more attention and has become one of the major challenging issues in telecommunication network over the past few years. In this paper, we study the network traffic pattern of the aggregate traffic and of specific application traffic, especially the popular applications such as P2P, VoIP that contribute most network traffic. Our study verified that majority Internet backbone traffic is contributed by a small portion of users and a power function can be used to approximate the contribution of each user to the overall traffic. We show that P2P applications are the dominant traffic contributor in current Internet Backbone of China. In addition, we selectively present the traffic pattern of different applications in detail.

Internet Plus and Networks Convergence

This paper discusses the relationship between Internet plus and networks convergence and highlights the development of ICT industry and the process of networks convergence. Based on lnternet plus and the theory of networks convergence, this paper suggests to implement Internet plus action plan as a strategy to accelerate the construction of networks and application of Internet, promote the traditional industry reform with ICT, increase competitive efficiency, standardize the market competition, and then realize the Internet plus strategy and networks convergence.

KRBKSS: a keyword relationship based keyword-set search system for peer-to-peer networks

may incur significant bandwidth for executing more com- plicated search queries such as multiple-attribute queries. In order to reduce query overhead, KSS (keyword-set search) by Gnawali partitions the index by a set of keywords. However, a KSS index is considerably larger than a standard inverted index, since there are more word sets than there are individual words. And the insert overhead and storage overhead are obviously un- acceptable for full-text search on a collection of documents even if KSS uses the distance window technology. In this paper, we extract the relationship information between query keywords from websites’ queries logs to improve performance of KSS system. Experiments results clearly demonstrated that the improved keyword-set search system based on keywords relationship (KRBKSS) is more efficient than KSS index in insert overhead and storage overhead, and a standard inverted index in terms of communication costs for query.

A novel internet traffic identification approach using wavelet packet decomposition and neural network

Internet traffic classification plays an important role in network management, and many approaches have been proposed to classify different kinds of internet traffics. A novel approach was proposed to classify network applications by optimized back-propagation (BP) neural network. Particle swarm optimization (PSO) algorithm was used to optimize the BP neural network. And in order to increase the identification performance, wavelet packet decomposition (WPD) was used to extract several hidden features from the time-frequency information of network traffic. The experimental results show that the average classification accuracy of various network applications can reach 97%. Moreover, this approach optimized by BP neural network takes 50% of the training time compared with the traditional neural network.

A P2P Reference Model

P2P is a complex system.Many researches on P2P architecture have been done.These researches have provided valuable references for the standardization of P2P technology.However,the standardization can not be achieved because there are still some problems in existing studies.This paper proposes a 5-layer reference model which clearly defines the functionalities of each layer,and distinctly describes the interface and the relationship between layers.This model is able to clearly show the internal structure of P2P system and the working process of data flow in P2P system.Validation shows that this model is general and rational.

Network Security Incidents Frequency Prediction Based on Improved Genetic Algorithm and LSSVM

Since the frequency of network security incidents is nonlinear,traditional prediction methods such as ARMA,Gray systems are difficult to deal with the problem.When the size of sample is small,methods based on artificial neural network may not reach a high degree of preciseness.Least Squares Support Vector Machines (LSSVM) is a kind of machine learning methods based on the statistics learning theory,it can be applied to solve small sample and non-linear problems very well.This paper applied LSSVM to predict the occur frequency of network security incidents.To improve the accuracy,it used an improved genetic algorithm to optimize the parameters of LSSVM.Verified by real data sets,the improved genetic algorithm (IGA) converges faster than the simple genetic algorithm (SGA),and has a higher efficiency in the optimization procedure.Specially,the optimized LSSVM model worked very well on the prediction of frequency of network security incidents.

From the Far Side of the Moon: Delay/DisruptionTolerant Networking Communications via Lunar Satellites

Delay/Disruption-Tolerant Networking(DTN) originated from research on Interplanetary Internet and still today space applications are the most important application field and research stimulus. This paper investigates DTN communications between the Earth and the far side of the Moon, by means of a lunar orbiter acting as relay. After an introductory part, the paper presents a comprehensive analysis of the DTN performance that can be achieved on the identified communication scenario. The focus is on the evaluation of the stateof-the-art ability of Interplanetary Overlay Network(ION), the NASA DTN implementation of Bundle Protocol(BP) and Contact Graph Routing(CGR), to meet the many challenges of the space communication scenario investigated(and more generally of a future interplaynetary Internet): intermittent links, network partitioning, scarce bandwidth, long delays, dynamic routing, handling of high priority and emergency traffic, interoperability issues. A study of security threats and Bundle Security Protocol(BSP) countermeasures complete the work.The many results provided, confirm the essential role of DTN in future space communications.

An Overview of Internet of Vehicles

The new era of the Internet of Things is driving the evolution of conventional Vehicle Ad-hoc Networks into the lnternet of Vehicles （IoV）. With the rapid development of computation and communication technologies, loV promises huge commercial interest and research value, thereby attracting a large number of companies and researchers. This paper proposes an abstract network model of the IoV, discusses the technologies required to create the IoV, presents different applications based on certain currently existing technologies, provides several open research challenges and describes essential future research in the area of loV.

An new representation for interconnection network structures

An important theoretic interest is to study the relations between different interconnection networks, and to compare the capability and performance of the network structures. The most popular way to do the investigation is network emulation. Based on the classical voltage graph theory, the authors develop a new representation scheme for interconnection network structures. The new approach is a combination of algebraic methods and combinatorial methods. The results demonstrate that the voltage graph theory is a powerful tool for representing well known interconnection networks and in implementing optimal network emulation algorithms, and in particular, show that all popular interconnection networks have very simple and intuitive representations under the new scheme. The new representation scheme also offers powerful tools for the study of network routings and emulations. For example, we present very simple constructions for optimal network emulations from the cube connected cycles networks to the butterfly networks, and from the butterfly networks to the hypercube networks. Compared with the most popular way of network emulation, this new scheme is intuitive and easy to realize, and easy to apply to other network structures.

Study on Massive Open Online Course and College English Teaching Reform

English is the universal language. With the development of economic and cultural globalization, the demand for English has gradually increased. Traditional college English teaching cannot meet real requirement, so college English teaching reform is imperative. With the development of online platform, the Internet has brought a great impetus to the curriculum reform. The author thinks that ＂MOOC＂ and College English Teaching Reform have a good point of combining, but there is still a problem remaining to be solved： How to make good use of＂MOOC＂ for College English Teaching Reform service has a lot study space in the future.

Efficient Broadcast Retransmission Based on Network Coding for InterPlaNetary Internet

In traditional wireless broadcast networks,a corrupted packet must be retransmitted even if it has been lost by only one receiver.Obviously,this is not bandwidth-efficient for the receivers that already hold the retransmitted packet.Therefore,it is important to develop a method to realise efficient broadcast transmission.Network coding is a promising technique in this scenario.However,none of the proposed schemes achieves both high transmission efficiency and low computational complexity simultaneously so far.To address this problem,a novel Efficient Opportunistic Network Coding Retransmission(EONCR)scheme is proposed in this paper.This scheme employs a new packet scheduling algorithm which uses a Packet Distribution Matrix(PDM)directly to select the coded packets.The analysis and simulation results indicate that transmission efficiency of EONCR is over 0.1,more than the schemes proposed previously in some simulation conditions,and the computational overhead is reduced substantially.Hence,it has great application prospects in wireless broadcast networks,especially energyand bandwidth-limited systems such as satellite broadcast systems and Planetary Networks(PNs).

Extended Overlapping Community Detection Algorithm by Label Propagation for Internet Application Identification

The increased capacity and availability of the Intemet has led to a wide variety of applications. Intemet traffic characterization and application identification is important for network management. In this paper, based on detailed flow data collected from the public networks of Intemet Service Providers, we construct a flow graph to model the interactions among users. Considering traffic from different applications, we analyze the community structure of the flow graph in terms of cormmunity size, degree distribution of the community, community overlap, and overlap modularity. The near linear time community detection algorithm in complex networks, the Label Propagation Algorithm （LPA）, is extended to the flow graph for application identification. We propose a new initialization and label propagation and update scheme. Experimental results show that the proposed algorithm has high accuracy and efficiency.

Reliability Prediction for Internetware Applications:A Research Framework and Its Practical Use

The open and dynamic environment of Internet computing demands new software reliability technologies.How to efficiently and effectively build highly reliable Internet applications becomes a critical research problem.This paper proposes a research framework for predicting reliability of individual software entities as well as the whole Internet application.Characteristics of the Internet environment are comprehensively analyzed and several reliability prediction approaches are proposed.A prototype is implemented and practical use of the proposed framework is also demonstrated.

An Efficient Algorithm for Processing Partialmax/min Queries in OLAP

In the process of analyzing the large-scale network security situation,the data we faced are always flooded and messy,and the information is difficult to obtain with respond to the query timely.Online analytical processing which use the Data-cube as a data source directly,calculated all or part of the Data-cube in advance,and it can reduce the query response time significantly.This paper considers a class of queries,called the Partial-MAX/MIN query.We introduce Rank Decision Tree(RD-Tree) and it’s searching algorithm for efficient processing of the partial-max/min queries.Through experiments,we show our approach has an efficient processing capability for partial-max/min queries.

THE PN2I NETWORK: A SCALABLE BANYAN NETWORK

To design a Banyan network with an arbitrary even-sized port number, the PN2I network is proposed. The PN2I network can be divided into two classes: the complete and incomplete versions. A simple routing algorithm is given, but in the incomplete PN2I networks,this routing algorithm fails to make the traffic in links even, which deteriorates the performance badly. Thus a new routing algorithm is proposed, which makes the incomplete PN2I networks behave almost the same as the PN2I networks with respect to the performance issues.