Skip to Content

Instrukcja korzystania z Biblioteki

Serwisy:

Ukryty Internet | Wyszukiwarki specjalistyczne tekstów i źródeł naukowych | Translatory online | Encyklopedie i słowniki online

Translator:

Kosmos
Astronomia Astrofizyka
Inne

Kultura
Sztuka dawna i współczesna, muzea i kolekcje

Metoda
Metodologia nauk, Matematyka, Filozofia, Miary i wagi, Pomiary

Materia
Substancje, reakcje, energia
Fizyka, chemia i inżynieria materiałowa

Człowiek
Antropologia kulturowa Socjologia Psychologia Zdrowie i medycyna

Wizje
Przewidywania Kosmologia Religie Ideologia Polityka

Ziemia
Geologia, geofizyka, geochemia, środowisko przyrodnicze

Życie
Biologia, biologia molekularna i genetyka

Cyberprzestrzeń
Technologia cyberprzestrzeni, cyberkultura, media i komunikacja

Działalność
Wiadomości | Gospodarka, biznes, zarządzanie, ekonomia

Technologie
Budownictwo, energetyka, transport, wytwarzanie, technologie informacyjne

Journal of Networks

This paper is devoted to a case study of a new construction of classifiers. These classifiers are called automatically generated multi-level meta classifiers, AGMLMC. The construction combines diverse meta classifiers in a new way to create a unified system. This original construction can be generated automatically producing classifiers with large levels. Different meta classifiers are incorporated as low-level integral parts of another meta classifier at the top level. It is intended for the distributed computing and networking. The AGMLMC classifiers are unified classifiers with many parts that can operate in parallel. This make it easy to adopt them in distributed applications. This paper introduces new construction of classifiers and undertakes an experimental study of their performance. We look at a case study of their effectiveness in the special case of the detection and filtering of phishing emails. This is a possible important application area for such large and distributed classification systems. Our experiments investigate the effectiveness of combining diverse meta classifiers into one AGMLMC classifier in the case study of detection and filtering of phishing emails. The results show that new classifiers with large levels achieved better performance compared to the base classifiers and simple meta classifiers classifiers. This demonstrates that the new technique can be applied to increase the performance if diverse meta classifiers are included in the system.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090922592268 2014/09/06 - 12:38

With the increased focus on Internet privacy, especially after the exposure of PRISM(an Internet surveillance program), anonymous communication have been getting more and more attentions. One of the most widely used anonymous communication systems is I2P(Invisible Internet Project). And as opposed to Tor’s(another popular anonymous communication system) directory-based approach, which provides a centralized directory server to manage the overall ‘view’ of the network, I2P is fully distributed and self organizing, which aims to avoid attackers’ enumeration of all I2P’s routers. In this paper, based on I2P’s operating mechanism, we presented two passive and two active methods to discover I2P routers. In a more than two week’s collecting experiment, about 25640 routers were discovered everyday, which turned out to be an almost full coverage(94.9%) of the I2P network compared with the data announced on the official website [1]. And based on the routers collected, this paper further made a preliminary analysis of both the I2P network’s overall status and its security. The result showed that I2P is a well structured P2P network, while some powerful attackers operating several routers are still possible to perform compromise attack to break I2P users’ anonymity given the current I2P’s security mechanism. Finally, this paper discussed some countermeasures to improve the security of the I2P network.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090922692278 2014/09/06 - 12:38

Recent advances in intelligent mobile terminal result in the rapid development of wireless mobile networks, which has inherently properties of high access time, low bandwidth and other shortcoming that pull down the Quality of Service (QoS). Cache technologies are considered as the most favorable tools for dealing with the problems of wireless traffic flow, having attracted tremendous interest from both the engineering and academic fields. However, most of the algorithms and tools developed are essentially based on descriptive models instead of predictive models, which are not capable of processing content traffic in the optimal way for wireless users with strong social characteristics. In this paper, a novel social relation based cache distribution policy is proposed, by which not only interaction among network users is used to detect the influential users among them, but also inherent friend relationships are used to predict desirable contents. These features are utilized to assist cache distribution among caching servers in advance for the purpose of serving the future needs of wireless mobile users. Evaluation analyzes the realistic network dataset, and the simulation results demonstrate the superior performance of the proposed optimization framework over existing systems

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090922792288 2014/09/06 - 12:38

The research of community detection can help us analyze kinds of problems in social network, in which the research of community structure is very important. This paper proposes an improved algorithm: An Improved BGLL Integrating Mutual Information (BGLLi), which stabilizes modularity, meanwhile fuses the index of mutual information, so that we can find the optimal threshold of modularity and reduce the running time of community partition effectively. The dataset adopts the Twitter dataset and the public Arxiv dataset, and the related experimental results have verified the effectiveness of the algorithm

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090922892298 2014/09/06 - 12:38

The rapid technological developments in computing technology and the proliferation of wireless network nodes with light infrastructure, have emerged large quantities of security requirements of informational privacy in cyberspace. Due to the inherent nature of open medium, diversity and variability of network topology, wireless networks are greatly difficult to secure by traditional methods. A physical layer key negotiation mechanism to secure wireless networks is proposed to quickly exchange and establish conventional cryptographic keys by exploiting the wireless channel’s characteristics. The physical layer key negotiation mechanism and its supplementary exception handling caused by the variations in communication paths are both described step by step. The simulation results verify the consistency of the keys of legitimate users, robustness and feasibility of this mechanism. Furthermore this cross-layer security technology is an exemplary complement to existing wireless network protocols to improve their security and enhances the ability to resist replay attacks, brute-force attack and eavesdropping.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090922992308 2014/09/06 - 12:38

A new approach for testing fuzzy hypotheses with fuzzy data based on fuzzy test statistic function is proposed. First, we present h-level (the end points are closed interval) for the fuzzy hypotheses parameter and the fuzzy data. Then, we construct the related fuzzy test statistic. Second, three different types of fuzzy hypotheses parameters are defined. Finally, a practical example for radar decision criteria is provided based on it to clarify the proposed approaching method. The advantages of the proposed method with respect to the three methods are shown and discussed.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923092318 2014/09/06 - 12:38

For data collection application in wireless sensor networks, it is a hard task to guarantee interference-aware slot assignment in distributed TDMA scheduling algorithm. This paper proposed a new scheduling algorithm based on the collaboration of nodes to resolve the slot collision when nodes try to assign slots to them. The time of network initialization is divided into rounds. The collaboration consisted of three phases: REQ, REPLY, and ACK is used to guarantee the interference-aware slot assignment during each round. The slot information is exchanged when node execute collaboration. We evaluate the performance of our algorithm by using NS2. The results indicate that our algorithm has better packet receive ratio and energy efficiency than existing algorithm.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923192327 2014/09/06 - 12:38

For data collection application in wireless sensor networks, it is a hard task to guarantee interference-aware slot assignment in distributed TDMA scheduling algorithm. This paper proposed a new scheduling algorithm based on the collaboration of nodes to resolve the slot collision when nodes try to assign slots to them. The time of network initialization is divided into rounds. The collaboration consisted of three phases: REQ, REPLY, and ACK is used to guarantee the interference-aware slot assignment during each round. The slot information is exchanged when node execute collaboration. We evaluate the performance of our algorithm by using NS2. The results indicate that our algorithm has better packet receive ratio and energy efficiency than existing algorithm.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923192327 2014/09/06 - 12:38

In the parallel signal processing, the multi-user detection precision of parallel interference cancellation (PIC) detector is always easily affected by the decision error diffusion. Based on the fast convergence and low complexity of blind adaptive Kalman algorithm, a new blind adaptive Kalman-PIC (KPIC) multi-user detection (MUD) algorithm is proposed for the direct sequence spread spectrum code division multiple access (DS-CDMA) system network with strong multiple access interference (MAI). Compared with traditional standard Kalman filter and PIC algorithm, the proposed combined program can totally track the time-varying channel, effectively estimate unknown noise statistics characteristics on-line while conducting state filtering, possibly minimize the detection error diffusion in the interference cancellation processing of single PIC algorithm, thus effectively suppress MAI. Simulation results show that the KPIC algorithm is of better convergence, dynamic tracking ability and precision

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923282335 2014/09/06 - 12:38

In the parallel signal processing, the multi-user detection precision of parallel interference cancellation (PIC) detector is always easily affected by the decision error diffusion. Based on the fast convergence and low complexity of blind adaptive Kalman algorithm, a new blind adaptive Kalman-PIC (KPIC) multi-user detection (MUD) algorithm is proposed for the direct sequence spread spectrum code division multiple access (DS-CDMA) system network with strong multiple access interference (MAI). Compared with traditional standard Kalman filter and PIC algorithm, the proposed combined program can totally track the time-varying channel, effectively estimate unknown noise statistics characteristics on-line while conducting state filtering, possibly minimize the detection error diffusion in the interference cancellation processing of single PIC algorithm, thus effectively suppress MAI. Simulation results show that the KPIC algorithm is of better convergence, dynamic tracking ability and precision

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923282335 2014/09/06 - 12:38

Wireless sensor networks (WSNs) possess diverse traffic due to different monitoring tasks carried out by sensor nodes. Meanwhile, in energy harvesting WSNs, the main goal is to match energy consumption with the energy harvesting rate which is different from minimizing energy consumption in battery-powered WSNs. We propose a dynamic adaptive medium access control (MAC) algorithm in energy harvesting WSNs. A fuzzy logical algorithm is used to generate the parameters of slotted CSMA/CA mechanism, where the inputs are a combination of the service characteristics and the wireless shared channel condition of the sensor experienced. Hence the system can dynamically adjust the parameters of the slotted CSMA/CA mechanism, and the parameters are also influenced by the energy harvesting mode in the node. The simulation results demonstrate that the proposed approach outperforms the traditional ones in terms of throughput and energy efficiency

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923362341 2014/09/06 - 12:38

Wireless sensor networks (WSNs) possess diverse traffic due to different monitoring tasks carried out by sensor nodes. Meanwhile, in energy harvesting WSNs, the main goal is to match energy consumption with the energy harvesting rate which is different from minimizing energy consumption in battery-powered WSNs. We propose a dynamic adaptive medium access control (MAC) algorithm in energy harvesting WSNs. A fuzzy logical algorithm is used to generate the parameters of slotted CSMA/CA mechanism, where the inputs are a combination of the service characteristics and the wireless shared channel condition of the sensor experienced. Hence the system can dynamically adjust the parameters of the slotted CSMA/CA mechanism, and the parameters are also influenced by the energy harvesting mode in the node. The simulation results demonstrate that the proposed approach outperforms the traditional ones in terms of throughput and energy efficiency

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923362341 2014/09/06 - 12:38

In this paper we propose a data gathering scheme for large scaled wireless sensor networks using multiple mobile data collectors (MDCs) and the spatial division multiple access (SDMA) technique. We focus on minimizing the data gathering time by employing the SDMA technique, and minimizing the length of touring paths of MDCs by employing Voronoi diagrams. The proposed scheme facilitates all deployed sensors to experience uniform energy depletion by avoiding long-distance transmissions to the base station. This, in turns, helps to prolong the lifetime of the network, and the network remains connected for longer period of time and increases the robustness. Simulation results demonstrate that the proposed scheme greatly reduces the traversal distance of the data collectors compared to the grid based approximation algorithm, prolongs the network lifetime significantly compared to a network which has only a static data collector, or a network in which the mobile collectors only move along straight lines.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923422352 2014/09/06 - 12:38

In this paper we propose a data gathering scheme for large scaled wireless sensor networks using multiple mobile data collectors (MDCs) and the spatial division multiple access (SDMA) technique. We focus on minimizing the data gathering time by employing the SDMA technique, and minimizing the length of touring paths of MDCs by employing Voronoi diagrams. The proposed scheme facilitates all deployed sensors to experience uniform energy depletion by avoiding long-distance transmissions to the base station. This, in turns, helps to prolong the lifetime of the network, and the network remains connected for longer period of time and increases the robustness. Simulation results demonstrate that the proposed scheme greatly reduces the traversal distance of the data collectors compared to the grid based approximation algorithm, prolongs the network lifetime significantly compared to a network which has only a static data collector, or a network in which the mobile collectors only move along straight lines.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923422352 2014/09/06 - 12:38

The inverse shortest path problem is to minimize the modification on the edge weights such that a predetermined path becomes the shortest one from the origin to the destination with respect to the new edge weights. In this paper, the inverse shortest path problem is considered on a graph with uncertain edge weights. It is shown that the model of the uncertain inverse shortest path problem can be transformed into a deterministic counterpart and then be solved efficiently. A numerical example is presented as well for illustration.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923532359 2014/09/06 - 12:38

The inverse shortest path problem is to minimize the modification on the edge weights such that a predetermined path becomes the shortest one from the origin to the destination with respect to the new edge weights. In this paper, the inverse shortest path problem is considered on a graph with uncertain edge weights. It is shown that the model of the uncertain inverse shortest path problem can be transformed into a deterministic counterpart and then be solved efficiently. A numerical example is presented as well for illustration.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923532359 2014/09/06 - 12:38

In this paper, a simple but efficient method of overlapping community detection is presented using local community gravitation in social networks. Given a high-quality, non-overlapping partition generated by existing methods, this proposed method identifies the overlapping nodes from their surrounding partitioned communities according to their local community gravitation, with low computational complexity. Our experiments on synthetic networks and real-world networks demonstrate that the proposed algorithm is better than other algorithms in terms of the general quality.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923602364 2014/09/06 - 12:38

In this paper, a simple but efficient method of overlapping community detection is presented using local community gravitation in social networks. Given a high-quality, non-overlapping partition generated by existing methods, this proposed method identifies the overlapping nodes from their surrounding partitioned communities according to their local community gravitation, with low computational complexity. Our experiments on synthetic networks and real-world networks demonstrate that the proposed algorithm is better than other algorithms in terms of the general quality.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923602364 2014/09/06 - 12:38

Effective radio resource management is a fundamental component in all wireless communication systems. From the user and service providers point of view, the emerging LTE – A network is expected to deliver high performance sensitive applications like VOIP, videoconferencing, mobile video services, etc. These converged services have unique traffic-handling and QoS requirements. Radio spectrum and transport (backhaul) resources are limited, expensive and shared between many users and services like voice, video and data on a single IP based infrastructure. As many users are sharing the radio resource the QoS guarantee is a challenging issue in LTE-A broadband wireless network. This issue cannot be solved by over provisioning the network instead, RRM leads to determine the optimal use of wireless resources as per the wireless channel information and the QoS requirements of end user. In this paper we propose a resource allocation method called modified PRA scheme. The resource allocation is done based on priority and the priority values are determined by Fuzzy inference system in mPRA. The mPRA scheme effectively computes the QoS requirements such as transmission rate, jitter and end-to-end delay for both video and voice applications. The effectiveness of the proposed mPRA scheme in terms of QoS requirements can be observed via simulation results.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923652370 2014/09/06 - 12:38

Effective radio resource management is a fundamental component in all wireless communication systems. From the user and service providers point of view, the emerging LTE – A network is expected to deliver high performance sensitive applications like VOIP, videoconferencing, mobile video services, etc. These converged services have unique traffic-handling and QoS requirements. Radio spectrum and transport (backhaul) resources are limited, expensive and shared between many users and services like voice, video and data on a single IP based infrastructure. As many users are sharing the radio resource the QoS guarantee is a challenging issue in LTE-A broadband wireless network. This issue cannot be solved by over provisioning the network instead, RRM leads to determine the optimal use of wireless resources as per the wireless channel information and the QoS requirements of end user. In this paper we propose a resource allocation method called modified PRA scheme. The resource allocation is done based on priority and the priority values are determined by Fuzzy inference system in mPRA. The mPRA scheme effectively computes the QoS requirements such as transmission rate, jitter and end-to-end delay for both video and voice applications. The effectiveness of the proposed mPRA scheme in terms of QoS requirements can be observed via simulation results.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923652370 2014/09/06 - 12:38

In this paper, we obtain a normal criterion of meromorphic functions concerning shared values. Let Dbe a domain in C and F be a family of meromorphic functions in D. Let k, n,m ∈ N+, n ≥ mk+m+1, and a, btwo finite complex numbers with a 6= 0. Suppose that every f ∈ F has all its zeros of multiplicity at least k + 1 . If fm + a(f(k))n and gm + a(g(k))nshare the value b IM for every pair of functions (f, g) of F, then F is a normal family in D.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923712375 2014/09/06 - 12:38

In this paper, we obtain a normal criterion of meromorphic functions concerning shared values. Let Dbe a domain in C and F be a family of meromorphic functions in D. Let k, n,m ∈ N+, n ≥ mk+m+1, and a, btwo finite complex numbers with a 6= 0. Suppose that every f ∈ F has all its zeros of multiplicity at least k + 1 . If fm + a(f(k))n and gm + a(g(k))nshare the value b IM for every pair of functions (f, g) of F, then F is a normal family in D.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923712375 2014/09/06 - 12:38

Most of the existing data gathering strategies are based on the structure of stationary Sink in Wireless Sensor Networks, which will lead to rapidly energy consumption of sensor nodes near the sink for the reason that these nodes burden the data transmission from the whole network. This paper proposes a clustering-based routing algorithm in wireless sensor networks with mobile sink (CRA) to solve this kind of problem. In the CRA, sink node moves in a circle around the regional center and the circular area near this trajectory is set as buffer area, in which nodes are connected as backbone datalink. Data is transmitted to the annular buffer area and then reach the sink through the backbone datalink. This paper figures out the optimal location and size of the buffer area in order to minimize the average load of the nodes in the area. Furthermore, this paper proposes CRA-1, which improves the original algorithm by density controlling, for the purpose of balancing the energy consumption of the whole network

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923762383 2014/09/06 - 12:38

Most of the existing data gathering strategies are based on the structure of stationary Sink in Wireless Sensor Networks, which will lead to rapidly energy consumption of sensor nodes near the sink for the reason that these nodes burden the data transmission from the whole network. This paper proposes a clustering-based routing algorithm in wireless sensor networks with mobile sink (CRA) to solve this kind of problem. In the CRA, sink node moves in a circle around the regional center and the circular area near this trajectory is set as buffer area, in which nodes are connected as backbone datalink. Data is transmitted to the annular buffer area and then reach the sink through the backbone datalink. This paper figures out the optimal location and size of the buffer area in order to minimize the average load of the nodes in the area. Furthermore, this paper proposes CRA-1, which improves the original algorithm by density controlling, for the purpose of balancing the energy consumption of the whole network

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923762383 2014/09/06 - 12:38

In recent years, one of the main concerns in wireless sensor network (WSN) has been to design a routing protocol which has long lifetime and balanced distribution of energy consumption. In this paper, we propose an efficient protocol, in which cluster heads (CHs) are selected by value of an information factor, instead of by comparing a randomly generated number with threshold. The information factor of every member node is reported to corresponding cluster head in reporting package, and it contains information of node’s residual energy and distance between the node and base station. Number of CHs is optimized and then keeps constant until invalid nodes appear. Simulations show that the new protocol can balance energy consumption and extend the time during which there is no node using up energy, and results of repeated simulations fluctuate less heavily than other protocols

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923842391 2014/09/06 - 12:38

In recent years, one of the main concerns in wireless sensor network (WSN) has been to design a routing protocol which has long lifetime and balanced distribution of energy consumption. In this paper, we propose an efficient protocol, in which cluster heads (CHs) are selected by value of an information factor, instead of by comparing a randomly generated number with threshold. The information factor of every member node is reported to corresponding cluster head in reporting package, and it contains information of node’s residual energy and distance between the node and base station. Number of CHs is optimized and then keeps constant until invalid nodes appear. Simulations show that the new protocol can balance energy consumption and extend the time during which there is no node using up energy, and results of repeated simulations fluctuate less heavily than other protocols

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923842391 2014/09/06 - 12:38

The location parameter of the electronic tag is the necessary condition for RFID application systems to realize their operation functions. Based on RFID detection model within which the target of the symbol location will spill over to adjacent area when sampling, the posterior probability distribution of the parameters to be estimated is obtained from the conditional likelihood function and the prior distribution of unknown parameters by Bayesian theory. Metropolis-Hastings (M-H) sampling algorithm of Markov Chain Monte Carlo (MCMC) is used to jointly estimate the RFID data and tag symbol location parameter within the range of multiple readers, and in this paper, the M-H sampling is improved by considering the prior knowledge and constraints. At last, the experimental results, using large simulated data, demonstrate the accuracy and efficiency of the proposed algorithm

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923922401 2014/09/06 - 12:38

The location parameter of the electronic tag is the necessary condition for RFID application systems to realize their operation functions. Based on RFID detection model within which the target of the symbol location will spill over to adjacent area when sampling, the posterior probability distribution of the parameters to be estimated is obtained from the conditional likelihood function and the prior distribution of unknown parameters by Bayesian theory. Metropolis-Hastings (M-H) sampling algorithm of Markov Chain Monte Carlo (MCMC) is used to jointly estimate the RFID data and tag symbol location parameter within the range of multiple readers, and in this paper, the M-H sampling is improved by considering the prior knowledge and constraints. At last, the experimental results, using large simulated data, demonstrate the accuracy and efficiency of the proposed algorithm

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090923922401 2014/09/06 - 12:38

With the rapid development of the social economy, the mobile communication industry has faced new development opportunity and been fully into our life. However, with the development of all communication technologies and the increasing of the mobile communication user, the traditional communication technology is strongly dependent on the frequency. However, the frequency resource has restricted the development of the communication industry.3G communication technology has solved the problem of the frequency limitation. SDMA (Space Division Multiple Address) is one of the critical technologies in the 3G communication, which can reuse the frequency by marking the same frequency of the antenna beam in the different directions. 3G communication has been into our life deeply, requiring the corollary equipment to keep up with the pace and adapt to the more rapid and intellectual development. As the signal transmitting and receiving equipment in the mobile communication system, antenna is very critical for the whole system. The developments of 3G and 4G promote the development of the intellectual antenna. The traditional antenna cannot meet the requirements of the current mobile technology. The application of the intellectual antenna is through a series of the intellectual algorithms. A good algorithm is the sign of the intellectual antenna performance. The paper deals with the signals by researching the multi-array and finds out the signal direction rapidly and accurately, verifying the new algorithm by utilizing the simulating calculation.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090924022410 2014/09/06 - 12:38

With the rapid development of the social economy, the mobile communication industry has faced new development opportunity and been fully into our life. However, with the development of all communication technologies and the increasing of the mobile communication user, the traditional communication technology is strongly dependent on the frequency. However, the frequency resource has restricted the development of the communication industry.3G communication technology has solved the problem of the frequency limitation. SDMA (Space Division Multiple Address) is one of the critical technologies in the 3G communication, which can reuse the frequency by marking the same frequency of the antenna beam in the different directions. 3G communication has been into our life deeply, requiring the corollary equipment to keep up with the pace and adapt to the more rapid and intellectual development. As the signal transmitting and receiving equipment in the mobile communication system, antenna is very critical for the whole system. The developments of 3G and 4G promote the development of the intellectual antenna. The traditional antenna cannot meet the requirements of the current mobile technology. The application of the intellectual antenna is through a series of the intellectual algorithms. A good algorithm is the sign of the intellectual antenna performance. The paper deals with the signals by researching the multi-array and finds out the signal direction rapidly and accurately, verifying the new algorithm by utilizing the simulating calculation.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090924022410 2014/09/06 - 12:38

Concrete with gangue which made with ordinary Portland cement at different water - binder ratio (0.35, 0.40 and 0.45) or ordinary Portland cement at water - binder ratio of 0.35 incorporating 10% fly ash or 20% fly ash; 20% fly ash and 1% early strength agent, slag with the replacement of 15% or 30%, or 15% fly ash and 15% slag were made and exposed to a wetting–drying sulfate environment. The compressive strength of the specimens of concrete with gangue was measured. The effects of sulfate concentration, water-binder ratio, mineral admixtures and chemical additives on the compressive strength of the concrete were studied through the grey relational analysis. Grey prediction model was established to predict the strength development of the concrete with gangue subjected to sulfate environment. The results indicate that the importance degree of these effective variables from high to low is ranked according to water-binder ratio, solution concentration, test age, fly ash content, slag content, early strength agent content. Producing curbstone with coal gangue concrete conform to the requirements of the specification because its physical properties superior than normal concrete and the properties of antifreeze and sulfate attack resistance can meet the requirements of the municipal engineering. It can be found that not only significantly reduce costs and save raw materials, can also achieve waste recycling through the engineering application. So it can be obtained social and economic benefits. The grey prediction model shows enough precision to predict the strength development of the concrete with subjected to corrosion by sulphate.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090924112416 2014/09/06 - 12:38

Concrete with gangue which made with ordinary Portland cement at different water - binder ratio (0.35, 0.40 and 0.45) or ordinary Portland cement at water - binder ratio of 0.35 incorporating 10% fly ash or 20% fly ash; 20% fly ash and 1% early strength agent, slag with the replacement of 15% or 30%, or 15% fly ash and 15% slag were made and exposed to a wetting–drying sulfate environment. The compressive strength of the specimens of concrete with gangue was measured. The effects of sulfate concentration, water-binder ratio, mineral admixtures and chemical additives on the compressive strength of the concrete were studied through the grey relational analysis. Grey prediction model was established to predict the strength development of the concrete with gangue subjected to sulfate environment. The results indicate that the importance degree of these effective variables from high to low is ranked according to water-binder ratio, solution concentration, test age, fly ash content, slag content, early strength agent content. Producing curbstone with coal gangue concrete conform to the requirements of the specification because its physical properties superior than normal concrete and the properties of antifreeze and sulfate attack resistance can meet the requirements of the municipal engineering. It can be found that not only significantly reduce costs and save raw materials, can also achieve waste recycling through the engineering application. So it can be obtained social and economic benefits. The grey prediction model shows enough precision to predict the strength development of the concrete with subjected to corrosion by sulphate.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090924112416 2014/09/06 - 12:38

Knowledge unit (KU) is the smallest integral knowledge object in a given domain. Knowledge unit relation recognition is to discover implicit relations among KUs, which is a crucial problem in information extraction. This paper proposes a knowledge unit relation recognition framework based on Markov Logic Networks, which combines probabilistic graphical models and first-order logic by attaching a weight to each first-order formula. The framework is composed principally of structure learning, artificial add or delete formulas, weight learning and inferring. According to the semantic analysis of KUs and their relations, ground predicate set is first extracted. Next, the ground predicate set is inputted into structure learning module to achieve weight formula set. Then, in order to overcome limitations of structure learning, the weight rule set is added or deleted by human. The new weight formula set is turned into weight learning module to acquire the last weight formula set. Finally, knowledge unit relations are recognized by inferring module with the last weight formula set. Experiments on the four data sets related to computer domain show the utility of this approach. The time complexity of structure learning is also analyzed

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090924172423 2014/09/06 - 12:38

Knowledge unit (KU) is the smallest integral knowledge object in a given domain. Knowledge unit relation recognition is to discover implicit relations among KUs, which is a crucial problem in information extraction. This paper proposes a knowledge unit relation recognition framework based on Markov Logic Networks, which combines probabilistic graphical models and first-order logic by attaching a weight to each first-order formula. The framework is composed principally of structure learning, artificial add or delete formulas, weight learning and inferring. According to the semantic analysis of KUs and their relations, ground predicate set is first extracted. Next, the ground predicate set is inputted into structure learning module to achieve weight formula set. Then, in order to overcome limitations of structure learning, the weight rule set is added or deleted by human. The new weight formula set is turned into weight learning module to acquire the last weight formula set. Finally, knowledge unit relations are recognized by inferring module with the last weight formula set. Experiments on the four data sets related to computer domain show the utility of this approach. The time complexity of structure learning is also analyzed

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090924172423 2014/09/06 - 12:38

In order to improve the traditional wireless sensor network resources shortcomings of single, large power consumption, this paper puts forward the optimization algorithm of wireless sensor network resources. And analyzes the network design of wireless sensor network, optimize the algorithm in the rate and the node power consumption and energy saving method, finally do comparison by using two groups of different simulation experiment data. The experimental results show that in wireless sensor networks, compared to the traditional algorithm, the optimized design of resource algorithm has high running speed and more can save network nodes in the network node energy transfer and consumption capability and rate, and has convergence.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090924242432 2014/09/06 - 12:38

In order to improve the traditional wireless sensor network resources shortcomings of single, large power consumption, this paper puts forward the optimization algorithm of wireless sensor network resources. And analyzes the network design of wireless sensor network, optimize the algorithm in the rate and the node power consumption and energy saving method, finally do comparison by using two groups of different simulation experiment data. The experimental results show that in wireless sensor networks, compared to the traditional algorithm, the optimized design of resource algorithm has high running speed and more can save network nodes in the network node energy transfer and consumption capability and rate, and has convergence.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090924242432 2014/09/06 - 12:38

In Mobile Ad Hoc Network (MANET), due to the mobility of the nodes it is difficult to find the route which can maintain the whole process of data transmission. Therefore, it is very critical to balance, maintain and repair the route within the mobility of nodes and the limited battery energy. Currently there are many protocols from different aspects to solve this problem. This paper proposes a new improved routing protocol, which is based on delayed replay program, and its main objective is to create the stable routing protocol based on hop AODV, node mobility speed and node communication state. The discovery process of improved routing protocols only let the low-speed node forwards the RREQ package, and re-routing request packet delay broadcast according to node’s degree of busy. NS2 simulator is adopted to assess the performance of using the program. Simulation results show that the proposed method has better performance than conventional methods, which mainly shows in better performance on the aspects on packet transmission rate of improved protocol, control overhead and end to end delay

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090924332440 2014/09/06 - 12:38

In Mobile Ad Hoc Network (MANET), due to the mobility of the nodes it is difficult to find the route which can maintain the whole process of data transmission. Therefore, it is very critical to balance, maintain and repair the route within the mobility of nodes and the limited battery energy. Currently there are many protocols from different aspects to solve this problem. This paper proposes a new improved routing protocol, which is based on delayed replay program, and its main objective is to create the stable routing protocol based on hop AODV, node mobility speed and node communication state. The discovery process of improved routing protocols only let the low-speed node forwards the RREQ package, and re-routing request packet delay broadcast according to node’s degree of busy. NS2 simulator is adopted to assess the performance of using the program. Simulation results show that the proposed method has better performance than conventional methods, which mainly shows in better performance on the aspects on packet transmission rate of improved protocol, control overhead and end to end delay

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090924332440 2014/09/06 - 12:38

To improve customer satisfaction through prompting waiting time is a key way for a call center. The practice shows that the length of prompted waiting time has an important effect on customer satisfaction and the utility of the call center. Based on queuing theory we develop a maximum system utility optimization model with consideration of customer psychology behavior. First, we study the impact of the rule of prompting queuing time on customer patient and abandonment behavior. Second, we use a probability function to describe the change of customer psychology and abandonment behavior, and derive the optimal system utility of calculation formula under steady state of queuing systems. Numerical experiments illustrate that the optimal prompted strategy of different patient groups of customers under various call center operation modes as practice guidelines.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090924412447 2014/09/06 - 12:38

To improve customer satisfaction through prompting waiting time is a key way for a call center. The practice shows that the length of prompted waiting time has an important effect on customer satisfaction and the utility of the call center. Based on queuing theory we develop a maximum system utility optimization model with consideration of customer psychology behavior. First, we study the impact of the rule of prompting queuing time on customer patient and abandonment behavior. Second, we use a probability function to describe the change of customer psychology and abandonment behavior, and derive the optimal system utility of calculation formula under steady state of queuing systems. Numerical experiments illustrate that the optimal prompted strategy of different patient groups of customers under various call center operation modes as practice guidelines.

http://ojs.academypublisher.com/index.php/jnw/article/view/jnw090924412447 2014/09/06 - 12:38