Using TCP/IP Programming to Realize the Communication among Different Network Platforms

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.

A RECOGNITION PROBLEM IN CONVERTING LINEAR PROGRAMMING TO NETWORK FLOW MODELS

The main goal of this paper is to study the following combinatorial problem : given a finite set E = (e1, e2, ...,em} and a subset family a - [S1,S2, ... ,Sk} of E , does there exist a tree T with the edge set E such that each induced subgraph T[Si] of Si is precisely a path (1≤i≤k) ?

ARTIFICIAL NEURAL NETWORKS-MODELING, PROGRAMMING AND APPLICATION IN MATERIAL HOT WORKING

The developments of modern mathematics and computer science make artificial neural networks become most useful tools in wide range of fields. Modeling methods of artificial neural networks are described in this paper. The programming technique by using Matlab neural networks toolbox is discussed. The application in Material Hot Working of neural networks is also introduced.

The Construction of Linux System and Network Programming Course to Develop Engineering Ability

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.

Incremental Network Programming for Wireless Sensors

We present an incremental network programming mechanism which reprograms wireless sensors quickly by transmitting the incremental changes using the Rsync algorithm;we generate the difference of the two program images allowing us to distribute only the key changes. Unlike previous approaches, our design does not assume any prior knowledge of the program code structure and can be applied to any hardware platform. To meet the resource constraints of wireless sensors, we tuned the Rsync algorithm which was originally made for updating binary files among powerful host machines. The sensor node processes the delivery and the decoding of the difference script separately making it easy to extend for multi-hop network programming. We are able to get a speed-up of 9.1 for changing a constant and 2.1 to 2.5 for changing a few lines in the source code.

Scalable Incremental Network Programming for Multihop Wireless Sensors

We present a network programming mechanism that can flexibly and quickly re-task a large multi-hop network of wireless sensor nodes. Our mechanism allows each sensor node to be incrementally reprogrammed with heterogeneous images of native program code using Rsync block comparison algorithm, point-to-point routing with the BLIP IPv6 stack, and image volume management with Deluge2. With our re-tasking method, we demonstrate an order of magnitude speed-up on small code changes over non-incremental delivery. Our mechanism also scales sub-linearly in the diameter of the network. Collectively, these advancements qualitatively change the software life cycle of the embedded networked systems.

Spatial Social Network Analysis: Program Pengembangan Usaha Agribisnis Perdesaan (PUAP) or an Exertion Development Program in Supporting the Region Revitalization Development

As the exertion development (PUAP) develop in Rejang Lebong Regency in Bengkulu province which had been started since 2008 by giving a kind of fund aid called Bantuan Langsung Masyarakat (BLM PUAP), to Gapoktan (Gabungan Kelompok Tani) or an organization of farmers such by giving some money as the capital used for 1) food plant cultiva-tion, horticulture, animal husbandry, plantation, and2) non-cultivation exertion such as;home industry of agriculture, small marketing scale and another agriculture exertion. By the approach which had been done is hoped to get the important result, on the other way the role of analysis factor (Social Network Analysis) from all undertaking stakeholders programs PUAP to be relevance steps aimed to understand the relation or connectivity from all factors in the network and also the role of factor inside the network itself be the relevance steps in arranging the strategy and work intention from the realization stage of PUAP program for the continuity of the realization program in the future (finding the good strategy) which aimed to develop the program of PUAP in Rejang Lebong Regency in Bengkulu Province, and to be a reference from doing the program as a national program in Indonesia.

Semantic network based component organization model for program mining

Based on the definition of component ontology, an effective component classification mechanism and a facet named component relationship are proposed. Then an application domain oriented, hierarchical component organization model is established. At last a hierarchical component semantic network (HCSN) described by ontology interchange language(OIL) is presented and then its function is described. Using HCSN and cooperating with other components retrieving algorithms based on component description, other components information and their assembly or composite modes related to the key component can be found. Based on HCSN, component directory library is catalogued and a prototype system is constructed. The prototype system proves that component library organization based on this model gives guarantee to the reliability of component assembly during program mining.

Self-Evaluation of Masters in Nursing Program: Postgraduates’ Networks

Background: To ensure quality and relevance of Postgraduate Programs are a commitment of the National Quality Postgraduate Programs (PNPC), and those from UNAM. Then, the self-evaluation of the Masters in Nursing Program (PME) is necessary for it to be part of the PNPC. This study focuses on self-evaluation of implementation mechanisms to assure effective communication and collaboration with and among graduated alumni. Methods: The research was qualitative, exploratory and descriptive. An informed consent was signed by four informants, graduated from the seventeenth generation of PME. Data collection from a focal group and descriptive data analysis by atlas.ti from guidance questions that were contrasted with the scale value from PME curriculum. Results: Four categories emerged from PME graduated alumni: Category I, Professional academic performance, Category II, International activities attendance, Category III, Academic networks, and Category IV, Higher satisfaction of international activities. Conclusions: It is concluded that self-evaluation shows a graduate’s vision of conditions and networks where PME develops. Masters in Nursing Program fulfills graduates expectancy to create networks, which will contribute to knowledge and recognition of professional practice, as well as on the area’ opportunities opening for better contributions.

Estimation of hydraulic jump on corrugated bed using artificial neural networks and genetic programming

Artificial neural networks （ANNs） and genetic programming （GP） have recently been used for the estimation of hydraulic data. In this study, they were used as alternative tools to estimate the characteristics of hydraulic jumps, such as the free surface location and energy dissipation. The dimensionless hydraulic parameters, including jump depth, jump length, and energy dissipation, were determined as functions of the Froude number and the height and length of corrugations. The estimations of the ANN and GP models were found to be in good agreement with the measured data. The results of the ANN model were compared with those of the GP model, showing that the proposed ANN models are much more accurate than the GP models.

A Linear Programming Model for Seabed Oil-Gas Pipe Network

This paper analyzes the pipe network system of oil-gas collection and transportation for offshore oilfield development. A '0-1' integer linear programming model is constructed to optimize the investment of seabed pipe network. The mathematical model is solved by the spanning tree method of graph theory and network analysis. All spanning trees of a network graph compose all the feasible solutions of the mathematical model. The optimal solution of the model is the spanning tree with the minimum cost among all spanning trees. This method can be used to optimize the seabed pipe network system and give a minimum cost plan for the development of offshore marginal oilfield groups.

Integer Programming Formulations for Maximum Lifetime Broadcasting Problems in Wireless Sensor Networks

Approaches based on integer linear programming have been recently proposed for topology optimization in wireless sensor networks. They are, however, based on over-theoretical, unrealistic models. Our aim is to show that it is possible to accommodate realistic models for energy consumption and communication protocols into integer linear programming. We analyze the maximum lifetime broadcasting topology problem and we present realistic models that are also shown to provide efficient and practical solving tools. We present a strategy to substantially speed up the convergence of the solving process of our algorithm. This strategy introduces a practical drawback, however, in the characteristics of the optimal solutions retrieved. A method to overcome this drawback is discussed. Computational experiments are reported.

Homomorphic Hashing Verification for Wireless Sensor Networks Rateless Codes Over-the-Air Programming

The homomorphic hash algorithm(HHA)is introduced to help on-the-fly verify the vireless sensor network(WSN)over-the-air programming(OAP)data based on rateless codes.The receiver calculates the hash value of a group of data by homomorphic hash function,and then it compares the hash value with the receiving message digest.Because the feedback channel is deliberately removed during the distribution process,the rateless codes are often vulnerable when they face security issues such as packets contamination or attack.This method prevents contaminating or attack on rateless codes and reduces the potential risks of decoding failure.Compared with the SHA1 and MD5,HHA,which has a much shorter message digest,will deliver more data.The simulation results show that to transmit and verify the same amount of OAP data,HHA method sends 17.9% to 23.1%fewer packets than MD5 and SHA1 under different packet loss rates.

An Exact Virtual Network Embedding Algorithm Based on Integer Linear Programming for Virtual Network Request with Location Constraint

Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.

STUDIES ON PROGRAMMING FEATURES AND METHODS OF FLOATING GATE MOSFET AS ANALOG MEMORY FOR SYNAPTIC WEIGHTS IN NEURAL NETWORKS

The features of the floating gate devices as analog memory have been investigatedexperimentally.Programming properties of the devices,compatibility and endurance of program-ming,and programming methods are presented in this paper.The results illustrate that thedevice can be used to store the analog weights for the neural networks,and the method that thestored value is adjusted continuously to approach to a given analog values is a rather practicalmethod for storing weights of neural networks.

Intelligent Load Management Scheme for a Residential Community in Smart Grids Network Using Fair Emergency Demand Response Programs

In the framework of liberalized deregulated electricity market, dynamic competitive environment exists between wholesale and retail dealers for energy supplying and management. Smart Grids topology in form of energy management has forced power supplying agencies to become globally competitive. Demand Response (DR) Programs in context with smart energy network have influenced prosumers and consumers towards it. In this paper Fair Emergency Demand Response Program (FEDRP) is integrated for managing the loads intelligently by using the platform of Smart Grids for Residential Setup. The paper also provides detailed modelling and analysis of respective demands of residential consumers in relation with economic load model for FEDRP. Due to increased customer’s partaking in this program the load on the utility is reduced and managed intelligently during emergency hours by providing fair and attractive incentives to residential clients, thus shifting peak load to off peak hours. The numerical and graphical results are matched for intelligent load management scenario.

THE APPLICATION OF THE BRANCH AND BOUND METHOD FOR DETERMINING THE MINIMUM FLOW OF A TRANSPORT NETWORK

Blockage is a kind of phenomenon frequently occurred in a transport network, in which the human beings are the moving subjects. The minimum flow of a network defined in this paper means the maximum flow quantity through the network in the seriously blocked situation. It is an important parameter in designing and operating a transport network, especially in an emergency evacuation network. A branch and bound method is presented to solve the minimum flow problem on the basis of the blocking flow theory and the algorithm and its application are illustrated by examples.

基于Semidefine Programming算法的无线传感器网络节点定位研究

首先在无线传感器网络模型假设下给出了模型、相关概念和定位过程的介绍,然后利用Semidefine Programming定位算法对无线传感器网络节点定位方法进行了研究。经过仿真实验证明,Semidefine Programming算法可以有效降低网络的成本,而且对定位精度的改进效果也非常明显。

Efficient Algorithm for K-Barrier Coverage Based on Integer Linear Programming

Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied after random deployment.In this paper,we study how mobile sensors can be efficiently relocated to achieve k-barrier coverage.In particular,two problems are studied:relocation of sensors with minimum number of mobile sensors and formation of k-barrier coverage with minimum energy cost.These two problems were formulated as 0–1 integer linear programming(ILP).The formulation is computationally intractable because of integrality and complicated constraints.Therefore,we relax the integrality and complicated constraints of the formulation and construct a special model known as RELAX-RSMN with a totally unimodular constraint coefficient matrix to solve the relaxed 0–1 ILP rapidly through linear programming.Theoretical analysis and simulation were performed to verify the effectiveness of our approach.

New Latency Model for Dynamic Frequency Scaling on Network-on-Chip

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%.