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

IEEE Conference on Industrial Electronics and Applications (ICIEA)

作者： A. N. Mahmood C. Leckie R. Islam Z. Tari School of Computer Science and I.T. Royal Melbourne Institute of Technology University Melbourne Australia Department of Computer Science and Software Engineering University of Melbourne Australia School of Engineering and Information Technology Deakin University Australia

In today's high speed networks it is becoming increasingly challenging for network managers to understand the nature of the traffic that is carried in their network. A major problem for traffic analysis in this context is how to extract a concise yet accurate summary of the relevant aggregate traffic flows that are present in network traces. In this paper, we present two summarization techniques to minimize the size of the traffic flow report that is generated by a hierarchical cluster analysis tool. By analyzing the accuracy and compaction gain of our approach on a standard benchmark dataset, we demonstrate that our approach achieves more accurate summaries than those of an existing tool that is based on frequent itemset mining.

关键词： Protocols IP networks Artificial intelligence Clustering algorithms Compaction Peer to peer computing Aggregates

来源：评论

学校读者我要写书评

暂无评论

Color-mood-aware clothing re-texturing

Color-mood-aware clothing re-texturing

引用

12th International Conference on computer-Aided Design and computer Graphics, CAD/Graphics 2011

作者： Shen, Jianbing Sun, Hanqiu Mao, Xiaoyang Guo, Yanwen Jin, Xiaogang Beijing Laboratory of Intelligent Information Technology School of Computer Science Beijing Institute of Technology Beijing 100081 China Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Hong Kong University of Yamanashi Japan National Key Lab. for Novel Software Technology Nanjing University China State Key Lab. of CAD and CG Zhejiang University Hangzhou 310027 China

ISBN: (纸本)9780769544977

In this paper, we present a novel color-mood-aware technique to re-texture clothing in a photograph. An efficient classification algorithm is developed to classify clothing textures using color mood scheme. To re-texture the clothing, our approach first computes the gradient maps for the cloth region to be replaced and then calculates the texture distortion coordinates on the projected cloth region according to the gradient maps. After the user selects a target clothing texture from the classified clothing texture database, the lighting and shading effects on the original photograph is transferred using the HSV color space. Experimental results show that the proposed approach successfully re-textures the clothes in photographs while preserving the geometry and lighting features. © 2011 IEEE.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

An Approach to Handling Failure Recovery in Service Composition and Its Analysis

An Approach to Handling Failure Recovery in Service Composit...

引用

Theoretical Aspects of software engineering (TASE)

作者： Guisheng Fan Huiqun Yu Liqiong Chen Chunhua Gu Department of Computer Science and Engineering East China University of Science and Technology Shanghai China State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai China

Service composition is an effective way to build complex Web service applications. However, it is a challenge to handle failure recovery due to the uncertainty of service in distributed and heterogeneous environment. This paper proposes an approach to handling failure recovery in service composition. Petri nets are used to model the different components of service composition, failure recovery rules and service selection strategies are given. Based on these, aspect-orientation is used to weave failure recovery concern into service composition, which includes failure warning concern, service selection concern and recovery concern, the weaving mechanism dynamically integrates these schemas into a failure recovery model. The operation semantics and related theories of Petri nets help prove its effectiveness and correctness. A case study and experimental results demonstrate the approach can simplify the failure recovery process, and improve the design quality of service composition.

关键词： Weaving Web services Petri nets Semantics Analytical models Mathematical model

来源：评论

学校读者我要写书评

暂无评论

A Learning Automata Based Solution for Preventing Distributed Denial of Service in Internet of Things

A Learning Automata Based Solution for Preventing Distribute...

引用

IEEE/ACM Int'l Conference on & Int'l Conference on Cyber, Physical and Social Computing (CPSCom) Green Computing and Communications (GreenCom)

作者： Sudip Misra P. Venkata Krishna Harshit Agarwal Antriksh Saxena Mohammad S. Obaidat School of Information Tech Indian Institute of Technology Kharagpur India School of Computing Science and Engineering VIT University Vellore India Department of Computer Science & Software Engineering Monmouth University NJ USA

Internet of Things (IoT) refers to the networked interconnection of everyday objects. IoT is an upcoming research field and is being regarded as the revolution in the world of communication because of its extensible applications in numerous fields. Due to open and self-assimilation nature of these networks they are highly prone to attacks. Because of this reason security is of primary concern here. The security attack can be of various types, the idea here is to prevent IoT networks from Distributed Denial of Service (DDoS) attack. The objective of Denial of Service (DoS) is to make the server resources unavailable to the intended user, and when several such DoS attacks are present in a network then the attack is known as a DDoS attack. Our strategy is to prevent DDoS attack in IoT networks by using Learning Automata (LA) concepts. In this paper, we present a Service Oriented Architecture (SOA) which is used as a system model for IoT here. SOA provides a platform to the developers using which they can develop various applications for IoT without any concern regarding the nature of the objects, thereby acting as a middleware. The DDoS prevention strategy has been targeted for the SOA based architecture for IoT. The simulation results show that the proposed scheme is effective in preventing DDoS attacks in IoT.

关键词： computer crime Service oriented architecture Servers Learning automata

来源：评论

学校读者我要写书评

暂无评论

The Modelling and Verification of PLC Program Based on Interactive Theorem Proving Tool COQ

The Modelling and Verification of PLC Program Based on Inter...

引用

2011 International Conference on computer science and information Technology(ICCSIT 2011)

作者： Litian Xiao Mengyuan Li Ming Gu Jiaguang Sun National Laboratory for Information Science and Technology Key Laboratory for Information System Security Ministry of EducationDepartment of Computer Science and Technology School of Software Tsinghua University Beijing Special Engineering Design and Research Institute National Laboratory for Information Science and Technology Key Laboratory for Information System Security Ministry of Education Department of Computer Science and Technology School of Software Tsinghua University

COQ is an interactive theorem proving tool. The paper abstractly describes the feature of COQ, the architecture and working modes of PLC program with the example of typical PLC. It also introduces the first-order logic syntax and semantics of Intuitionistic Logic. It briefly introduces the main Gallina language syntax elements, the corresponding use methods and main theorem proving tactic on COQ. The work has modeled kernel data type and basic statements and and the denotational semantics of PLC program with Gallina. It has given the correctness proof of PLC program based on theorem proving, i.e. based on semantics function the relationship of configuration between the before codes execution and the after is proved. The main purpose is to prove whether a PLC program satisfies certain nature within a scan period.

关键词： PLC Program, Embedded System, Verification, Denotational Semantics, Theorem Proving, COQ

来源：评论

学校读者我要写书评

暂无评论

Homomorphic Linear Authentication Schemes for Proofs of Retrievability

Homomorphic Linear Authentication Schemes for Proofs of Retr...

引用

International Conference on Intelligent Networking and Collaborative Systems (INCOS)

作者： Shengli Liu Kefei Chen Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing China

In a proof of retrievability (POR) system, interactive POR protocols are executed between a storage server and clients, so that clients can be convinced that their data is available at the storage server, ready to be retrieved when needed. In an interactive POR protocol, clients initiate challenges to the server, and the server feedbacks responses to clients with input of the stored data. Retrievability means that it should be possible for a client to extract the his/her data from the server's valid responses. An essential step-stone leading to retrievability is server's unforgeability of valid responses, i.e, any server coming up valid responses to a client's challenges is actually storing the client's data with overwhelming probability. Unforgeability can be achieved with authentication schemes like MAC, Digital Signature, etc. With homomorphic linear authentication schemes, the authenticators can be aggregated into one tag for the challenges, hence reducing the communication complexity. In this paper, we explore some new homomorphic linear authenticator schemes in POR to provide unforgeability. Compared with the recent work of Shacham and Waters, our scheme enjoys the same shortest responses, but reduces the local storage from O(s) to O(1).

关键词： Games Authentication Servers Protocols Data mining Vectors

来源：评论

学校读者我要写书评

暂无评论

Optimizing Energy through Parabola Based Routing in Underwater Sensor Networks

Optimizing Energy through Parabola Based Routing in Underwat...

引用

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

作者： Sanjay K. Dhurandher Mohammad S. Obaidat Siddharth Goel Abhishek Gupta CAITFS Division of Information Technology Netaji Subhas Institute of Technology University of Delhi New Delhi India Department of Computer Science & Software Engineering Monmouth University NJ USA

This paper looks into the problems faced by Underwater Sensor Networks (UWSNs), with regard to energy optimization and efficient data delivery. A new algorithm is proposed which uses the properties of a "Parabola" in order to transmit data packets from source to destination. The scheme is called the "Parabola-based Routing"(PBR) algorithm. The algorithm is adaptive, and transmits packets in hop-by-hop fashion. Each node in the scenario is aware of its location in the form of its Cartesian coordinates. These coordinates help the nodes in the formation of the parabola for packet sending, as well as in knowing the location of other nodes. The best suited node is selected every time so as to maintain low probability of data transmission failure and optimum energy consumption thereby, using greedy approach every time in selecting the node for packet transmission. In order, to maintain the packet delivery ratio, a hop-by-hop "acknowledgement process" has also been devised. We have validated the efficiency of our algorithm through simulation analysis. The simulation results indicate a better performance of PBR over DSR in both mobile and static scenarios.

关键词： Peer to peer computing Routing Relays Algorithm design and analysis Mobile communication Routing protocols Monitoring

来源：评论

学校读者我要写书评

暂无评论

Improvments of payload-based intrusion detection models by using noise against fuzzy SVM

引用

Journal of Networks 2011年第2期6卷 330-340页

作者： Zhang, Guiling Ke, Yongzhen Li, Zhichao Mingji, E. School of Computer Science and Software Engineering Tianjin Polytechnic University Tianjin China Department of Information Management China Central Party School Beijing China Department of Energy Technology and Mechanical Engineering Tianjin Institute of Urban Construction China

Intrusion detection plays a very important role in network security system. It is proved to analyze the payload of network protocol and to model a payload-based anomaly detector (PAYL) can successfully detect outliers of network servers. This paper extends these works by applying a new noise-reduced fuzzy support vector machine (fSVM) to improve the detection rate at lower false positive rate. The new noisy against fuzzy SVM is applied to analyzing 1-gram, 2-grams and 2v-grams distribution classification of network payloads, which constructs three different intrusion detection models, respectively. These new intrusion detection models employ reconstruction error based fuzzy membership function to reduce the noisy of the data and to solve the sharp boundary problem, respectively. Experimental results based on DARPA data set demonstrated that the proposed schemes can achieve higher detection rate at very low false positive rate than the original and general SVM methods. © 2011 ACADEMY PUBLISHER.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

No-go theorem for one-way quantum computing on naturally occurring two-level systems

引用

Physical Review A 2011年第5期83卷 050301(R)-050301(R)页

作者： Jianxin Chen Xie Chen Runyao Duan Zhengfeng Ji Bei Zeng Department of Computer Science and Technology Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Department of Physics Massachusetts Institute of Technology Cambridge Massachusetts USA Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney New South Wales Australia Perimeter Institute for Theoretical Physics Waterloo Ontario Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Institute for Quantum Computing and Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada

The ground states of some many-body quantum systems can serve as resource states for the one-way quantum computing model, achieving the full power of quantum computation. Such resource states are found, for example, in spin-52 and spin-32 systems. It is, of course, desirable to have a natural resource state in a spin-12, that is, qubit system. Here, we give a negative answer to this question for frustration-free systems with two-body interactions. In fact, it is shown to be impossible for any genuinely entangled qubit state to be a nondegenerate ground state of any two-body frustration-free Hamiltonian. What is more, we also prove that every spin-12 frustration-free Hamiltonian with two-body interaction always has a ground state that is a product of single- or two-qubit states. In other words, there cannot be any interesting entanglement features in the ground state of such a qubit Hamiltonian.

关键词： Ground state

来源：评论

学校读者我要写书评

暂无评论

ServiceChord: A Scalable Service Capability Interaction Framework for IMS

ServiceChord: A Scalable Service Capability Interaction Fram...

引用

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

作者： Chi-Yuan Chen Chia-Yin Wu Shih-Wen Hsu Han-Chieh Chao Isaac Woungang Mohammad S. Obaidat Department of Electrical Engineering National Dong Hwa University Taiwan Institute of Computer Science and Information Engineering and Department of Electronic Engineering National I-Lan University Taiwan Department of Computer Science Ryerson University Toronto Canada Department of Computer Science & Software Engineering Monmouth University West Long Branch NJ USA

In recent years, multimedia network services have moved from a single service to rich services which integrate multiservice capabilities integration. If all service requests require the user to send the request by himself, this will result to a huge control function load and complex service collaboration. In order to address service interaction and reuse the service capability, 3GPP proposes a Service Capability Interaction Manager, which can provide service capabilities invocation and service interaction management between Application Servers (ASs) and Serving-Call Session Control Function (S-CSCF). However, its architecture may cause joint and cooperation problems between the different service providers. In this paper, we propose a scalable service capability interaction framework called ServiceChord that can process multiple service capabilities with different ASs and reduce the call set-up delay while communicating with the S-CSCF. The Chord DHT technique is used to improve the framework, leading to a reduction of message redundancy on the S-CSCF while achieving an efficient service capability interaction, and providing scalability for IMS services and ASs.

关键词： Delay Multimedia communication Servers Media Mathematical model Peer to peer computing Equations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：