检索结果-内蒙古大学图书馆

International Conference on Distributed Computing systems

作者： Kazuya Sakai Min-Te Sun Wei-Shinn Ku Jie Wu Faisal S. Alanazi Dept. of Info. and Commun. Systems Tokyo Metropolitan University Hino Tokyo Japan Department of Computer Science and Information Engineering National Central University Taoyuan 320 Taiwan Department of Computer Science and Software Engineering Auburn University Auburn Alabama Department of Computer and Information Sciences Temple University Philadelphia PA Department of Electrical and Computer Engineering The Ohio State University Columbus Ohio

Delay tolerant network (DTN) routing provides a communication primitive in intermittently disconnected networks, such as battlefield communications and human-contact networks. In these applications, the anonymity preserving mechanism, which hides the identities of communicating parties, plays an important role as a defense against cyber and physical attacks. While anonymous routing protocols for DTNs have been proposed in the past, to the best of our knowledge, there is no work that emphasizes the theoretical aspects. In this paper, we first design an abstract of anonymous routing protocols for DTNs and augment the existing solution with multi-copy message forwarding. Then, we construct simplified mathematical models, which can be used to understand the fundamental performance and security guarantees of onion-based anonymous routing in DTNs. The numerical and simulation results using randomly generated contact graphs and the real traces demonstrate that our models provide very close approximations to the performance of the anonymous DTN routing protocol.

关键词： Routing Routing protocols Mathematical model Encryption Simulation

来源：评论

学校读者我要写书评

暂无评论

Transmit antenna and relay selections for underwater MIMO-OFDM cooperative wireless networks 10

Transmit antenna and relay selections for underwater MIMO-OF...

引用

10th ACM International Conference on Underwater networks and systems, WUWNet 2015

作者： Zhang, Xi Zhu, Qixuan Networking and Information Systems Laboratory Dept. of Electrical and Computer Engineering Texas A and M University College StationTX77843 United States

ISBN: (纸本)9781450340366

The multiple-input-multiple-output (MIMO), the orthogonal frequency division multiplexing (OFDM), and the cooperative communication techniques are widely applied in and significantly improved the essential performances of underwater acoustic (UWA) wireless networks in recent years. However, the challenge of reducing the computational complexity while guaranteeing performances of MIMO-OFDM based UWA wireless networks still remains to be resolved. In this paper, we propose a scheme for transmit antenna selection and relay selection to address this problem as follows. Using the channel station information feedback in the MIMO-OFDM based UWA cooperative communication channel, a single transmit antenna for each underwater sensor and one relay node which can maximize the total channel coefficient are selected to transmit data to the corresponding surface destination station, providing a balanced tradeoff between complexity and performance of the network.

关键词： Cooperative communication

来源：评论

学校读者我要写书评

暂无评论

A Study on Efficient Log Visualization Using D3 Component against APT: How to Visualize security Logs Efficiently?

A Study on Efficient Log Visualization Using D3 Component ag...

引用

International Conference on Platform Technology and Service (PlatCon)

作者： Jaehee Lee Jinhyeok Jeon Changyeob Lee Junbeom Lee Jaebin Cho Kyungho Lee Department of Information Security Korea University Seoul Korea Department of Computer Science and Engineering Sogang University Seoul Korea Deparment of Convergence Secuirty Kyonggi University Seoul Korea Dept. of Inf. & Telecommun. Eng. Univ. of Suwon Seoul South Korea Department of Information and Telecommunications Engineering University of Suwon Seoul Korea

APT attack has caused chaos in society since 2006. Especially, the vulnerability of the infrastructure is exposed to the outside a lot due to the development of the IT infrastructure in Korea. In addition, APT attacks targeting companies' major confidential information are increasing every year. APT attack causes negative publicity for the company and financial damage. APT is completely different from the problem which most organizations have been dealt with. Cyber-attack threats were visible in the past. But currently, APT attacks were invisible and focused on confidential data. Therefore, we need a new approach to solve this problem. We have to find traces of prejudice in the circumstances, everything seems normal. If we perform a correlation analysis of the log acquired from all the devices, systems and applications, we can easily understand the problems which occur in our information systems. Current commercial SIEM has the ability to visualize the correlation analysis and the log. But the security officer takes a lot of time to understand the visualized security logs. Moreover, due to expensive cost of SIEM solution, small companies have difficulty introducing SIEM solution. For these reasons, we have developed a SIEM solution based on open-source program such as D3 component which results in decreasing the cost of the program. In addition, we analyzed the D3 components which can visualize the security logs, and matched D3 components with the security logs. In this paper, we propose the visualization methods using D3 components for analyzing the security logs efficiently.

关键词： security Data visualization Correlation Companies Monitoring Risk management Retirement

来源：评论

学校读者我要写书评

暂无评论

An efficient watermarking based integrity control system for medical images

An efficient watermarking based integrity control system for...

引用

International Conference on Control Communication & Computing India (ICCC)

作者： Anisha Joseph Deepa S S Information Security College of Engineering Trivandrum Dept. of Computer Science and Engineering College of Engineering Trivandrum

Medical image applications like Picture Archiving and communication systems (PACS) need transmission of images over insecure network. The images especially the Region of Interest (ROI) can be tampered while transmission due to the modifications such as JPEG, JPREG2K, scaling, rotation, filtering etc. As a result, this tampering will affect the disease diagnosis. Hence the verification of integrity of images and identification of the nature of modifications are important. In this paper we present a watermarking based integrity control system with an efficient classification of JPEG versus JPEG2K modifications. This system is proposed to detect the modification, identify whether it is global or local and classify globally modified images into different classes. It uses the cryptographic hash to verify integrity of the image. The image features namely the geometric moments, blockiness and the average of absolute difference between adjacent pixels within blocks are used for classification of modified images. The multi-classifier SVM that used for classification of modified images consist of binary SVM classifiers for each pair of modifications. The performance of binary SVM classifier for JPEG versus JPEG2K is improved by using these features. As a result the performance of multi-classifier is also improved.

关键词： Transform coding Support vector machines Watermarking Image coding Medical diagnostic imaging Forensics

来源：评论

学校读者我要写书评

暂无评论

A fast exploration technique in WSN for partition recovery using mobile nodes

A fast exploration technique in WSN for partition recovery u...

引用

National Conference on Communications (NCC)

作者： V. Sreejith K.R. Anupama Lucy J Gudino R. Suriyadeepan Dept. of Computer Science and Information Systems Goa India Dept. of Electrical Electronics and Instrumentation Engineering Goa India

Area exploration in WSN is used for a multitude of applications from data collection to network maintenance. In this paper, we propose a new approach - Max-Gain approach to explore an area with obstacles by modifying the utility function of frontier-based approach. The proposed approach moves the mobile nodes to a distant unexplored optimal position rather than directing it to a near frontier. The main focus of this paper is the fast area exploration using mobile nodes. We extend this approach to recover partitions in a disconnected network and hence restore connectivity. The results indicate that our approach guarantees fast area exploration with minimum communication overhead. Proposed area exploration approach is not limited to wireless sensor networks, but to any area exploration applications using mobile units.

关键词： Mobile nodes Base stations Nickel Topology Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Lyapunov Function Neuro-Adaptive Controller for LFC in Two-Area Power System

A Lyapunov Function Neuro-Adaptive Controller for LFC in Two...

引用

Annual Conference of the IEEE Industrial Electronics Society

作者： Muhammad Saleheen Aftab Muhammad Shafiq Fakhra Aftab Department of Electrical and Computer Engineering Sultan Qaboos University Dept. of Computer & Information Systems Engineering NED University of Engineering & Technology

ISBN: (纸本)9781479917631

Dynamic variations in real power directly affects the system frequency. Consequently, large frequency deviations in interconnected systems might cause costly power outages. In order to maintain continuous and stable power production, the load frequency control (LFC) becomes utmost important. This paper presents a neuro-adaptive controller that minimizes the effects of load variations on system frequency and tie-line exchanges. The proposed controller is trained with a new Lyapunov function backpropagation learning algorithm that overcomes the fundamental problems associated with the conventional gradient-descent error backpropagation. computer simulations, performed in Simulink environment, demonstrate superior load frequency control achieved with the proposed controller.

关键词： Two-area power system Load frequency control Neural networks Error backpropagation Lyapunov function load frequency control Liapunov function Full mold process system frequency Neural network POWER OUTAGE Controllers connection road load changes large-scale systems Power production

来源：评论

学校读者我要写书评

暂无评论

Effective-Capacity Based Gaming for Optimal Power and Spectrum Allocations Over Big-Data Virtual Wireless networks

Effective-Capacity Based Gaming for Optimal Power and Spectr...

引用

IEEE Global Communications Conference

作者： Qixuan Zhu Xi Zhang Networking and Information Systems Laboratory Dept. of Electrical and Computer Engineering Texas A&M University

ISBN: (纸本)9781479959532

Big data transmission on a wireless network environment focuses on sharing the large volume information data with the effective capacity guaranteed. Wireless network virtualization provides an efficient technique to implement the big data transmission by enabling multiple virtual wireless networks (VWNs) to be mapped onto one physical substrate wireless network (SWN), downloading the information data from SWN. One of the most important challenges of this technique lies in how to efficiently allocate the wireless resources of physical wireless networks to the multiple virtual wireless network users, considering the quality of service for the data transmission. To overcome these difficulties, in this paper we propose a novel auction based scheme to resolve the wireless resources allocation problem in terms of transmit power and wireless spectrum. We formulate this wireless resources allocation problem as an auction process where each mobile user bids for the limited wireless resources from physical substrate wireless networks, and competes with the other mobile-user players bidding for the same resources. First, the mobile users derive their bids for transmit powers, which indicate their willingness to pay for the transmit powers, aiming at maximizing their payoffs (performance-gain minus cost) on each subchannel. Then, according to the derived available transmit power on each subchannel, mobile users derive their bids for the number of subchannels, aiming at maximizing their overall payoffs. The SWN assigns these two types of wireless resources to each mobile user according to the bids for all virtual users. Finally, as the mobile users' bidding processes proceed iteratively, our proposed games are guaranteed to converge to the Nash Equilibrium, where the benefits of SWN and mobile users are both optimized, thus maximizing the aggregate effective capacities for our resources-virtualized big data transmission wireless networks. The extensive simulation results obtaine

关键词： Wireless network virtualization Big data Power and spectrum allocation Auction Effective capacity Wireless networks big data Effective Capacity Transmitter power subchannel data transmission wireless Game theory Nash equilibrium Mobile Consumers 4-benzamido-4'-isothiocyanostilbene-2,2'-disulfonate Virtual

来源：评论

学校读者我要写书评

暂无评论

Game-Theory Based Buffer-Space and Transmission-Rate Allocations for Optimal Energy-Efficiency Over Wireless Virtual networks

Game-Theory Based Buffer-Space and Transmission-Rate Allocat...

引用

IEEE Global Communications Conference

作者： Qixuan Zhu Xi Zhang Networking and Information Systems Laboratory Dept. of Electrical and Computer Engineering Texas A&M University

ISBN: (纸本)9781479959532

Wireless network virtualization provides an efficient technique to reduce the cost of overall networks by allowing multiple wireless virtual networks to be mapped onto one physical substrate wireless network. One of its important challenges of this technology is how to efficiently allocate the wireless resources of physical wireless networks to multiple virtual network users. To overcome these challenges, we develop the game-theory based schemes to resolve the resources allocation problem on both buffer/storage space and transmission-rate. Mapping the virtual networks onto the physical wireless network is formulated as the process of bidding for the limited wireless resources from a physical substrate wireless network, and competing with the other mobile-user players, which bid for the same wireless resources of a physical substrate wireless network. Our proposed game-theory schemes work as follows. First, virtual network announces its value function to the physical substrate wireless network, to claim for their required resources (buffer/storage space and transmission bandwidth). Then, the physical substrate wireless network allocates the two types of wireless resources to each virtual wireless network and charges for the provided resources according to the claimed value functions for all virtual users and its current network conditions. Finally our proposed schemes feed back conjectural prices for virtual networks' next-time bid. By accepting the conjectural prices, the game of virtual networks converges the Nash Equilibrium where their long term payoffs are optimized. The simulation results obtained validate and evaluate our proposed schemes through numerical solutions and the simulations.

关键词： Wireless network virtualization Resources allocation Energy-efficiency Game-theory Conjectural price Nash Equilibrium Virtual networks Wireless networks Nash equilibrium Energy efficiency Game theory Resource utilization wireless

来源：评论

学校读者我要写书评

暂无评论

A Distributed Algorithm to Construct Multicast Trees in Wireless Multi-hop networks

A Distributed Algorithm to Construct Multicast Trees in Wire...

引用

IEEE International Conference on Communications

作者： Hongyu Gong Lutian Zhao Kainan Wang Weijie Wu Xinbing Wang Dept. of Electronic Engineering Shanghai Jiao Tong University Dept. of Mathematics Shanghai Jiao Tong University Dept. of Computer Science Shanghai Jiao Tong University School of Information Security Engineering Shanghai Jiao Tong University

ISBN: (纸本)9781467364300

The minimum-length multicast tree can achieve efficient multicast transmissions and can be formulated as a Steiner Tree. Its construction is non-trivial and has been proven to be NP-hard. In this paper, we combine the design wisdoms in the minimum spanning tree and the shortest path, and propose a new distributed algorithm for constructing an approximate Steiner Tree, particularly applicable to dynamic wireless networks without centralized control. We rigorously prove the performance bounds of our algorithm in terms of tree length, running time and energy consumption. Let m be the multicast group size and n be the network size. We theoretically show that the ratio of our tree length to the minimum value is upper bounded by 2(1 + δ)/{the square root of}3 (where δ can be any positive value). Simulation results show that this ratio is in fact very close to 1. We also prove that the running time is O({the square root of}(mn log m log~3 n)). The energy consumption is evaluated in terms of message complexity, and is upper bounded by O(n log m). In all, our algorithm achieves the near-optimal tree length, as well as the shortest running time and the lowest message complexity among all solutions we are aware of. We believe our algorithm provides a significant improvement in designing practical routing policies in wireless networks.

关键词： Receivers Algorithm design and analysis Complexity theory Vegetation Relays Steiner trees Manganese

来源：评论

学校读者我要写书评

暂无评论

Face recognition by classification using radial basis function

International Journal of Multimedia and Ubiquitous Engineeri...

引用

International Journal of Multimedia and Ubiquitous engineering 2015年第5期10卷 33-40页

作者： Mandhala, Venkata Naresh Bhattacharyya, Debnath Kim, Tai-Hoon Dept. of Information Technology VFSTR University Vadlamudi Guntur India Dept. of Computer Science and Engineering VFSTR University Vadlamudi India Dept. of Convergence Security Sungshin Women's University 249-1 Dongseon-dong 3-ga Seoul Korea Republic of

The face recognition task involves extraction of unique features from the human face. Manifold learning methods are proposed to project the original data into a lower dimensional feature space by preserving the local neighborhood structure. PCA and LDA are used for the feature extraction and the resultant feature vectors are fused with the different fusion techniques and the proposed method yields good recognition rate with PCA Fusion of PCA and LDA features and those are classified with neural network. In general the size of the face database is too high and it needs more memory and needs more time for training so that to improve time and space complexities there is a need for dimensionality reduction. The extracted features are classified with Neural network to improve the recognition rate. © 2015 SERSC.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：