Current Issue

Previous Issue | Next Issue

October 30,2012
Volume 5,Issue 20
Pages -
Subject Area:Control Theory,Data Security and Computer Security,Computer Applications,Computer Network,Computer Architecture,Computer Graphics,Artificial Intelligence

Title: Product conceptual design and case-based decision method

Authors: CHEN Yang, XIANG Dong
PP: 2009-2016
Abstract: Adopting decision-based design idea, the product conceptual design process is discussed based on case-based decision. Firstly, the weights and similarity of customers’ requirements are given, and the method of calculating the weights and similarity of design parameters is elaborated based on quality function deployment (QFD). Secondly, the case structure is built according to customers’ requirements, design parameters and product profitability. Furthermore, under the premise to meet the customers’ requirements，the product concept selection method based on case-based decision theory is given, with the goal of maximizing product profitability. At last, the rationality and effectiveness of the proposed approach is verified based on a case of soft-starter product conceptual design.
Keywords: decision analysis; conceptual design; decision-based design; case-based decision; quality function deployment

Title: Particle swarm optimization algorithm with adaptive scheduling evolution strategy and its application to pressure vessel design

Authors: HU Zhimin, YAN Xuefeng
PP: 2002-2008
Abstract: Considering that particle swarm optimization (PSO) with the various improvement or varieties of the evolution operating strategy has different local and global search capability, a novel adaptive scheduling PSO (ASPSO) with kinds of evolution strategies had been proposed to improve the performance of ASPSO. ASPSO algorithm employs three evolution strategies, analyzes the implementation effect of different evolution strategies, borrowing the idea of the time-sliced algorithm of the computer processor to deal with the different processes, and finally implements three evolution strategies time-sliced adaptively. According to the feedback information of the different evolution strategy implementation effect at the different evolution stages, ASPSO algorithm can schedule the best evolution strategy adaptively to make the probability of global convergence and local search precision improved. The three typical test function were employed to demonstrate the ASPSO performance, which was compared with the CenterPSO and LDWPSO. The results show that the performance of ASPSO is the best. Further, in the design of pressure vessels, ASPSO algorithm shows good performance and practicability.
Keywords: control theory; particle swarm optimization algorithm; evolution strategy; adaptive scheduling; pressure vessel

Title: Quantum network coding based on the controlled quantum teleportation over the butterly network

Authors: YAN Shuaishuai, KUANG Hongyan, GUO Ying
PP: 1996-2001
Abstract: Based on ideas of quantum teleportation, controlled quantum teleportation, Greenbergey-Horne-Zeilinger (GHZ) entangled state and the characteristics of the quantum network coding was studied. In order to solve the problems of transmission and security of messages in quantum network, a scheme which transmits two 2-level quantum states crossly over the butterly network with two non-maximally entangled GHZ pairs shared by two senders was proposed in this paper. In this protocol, all the channels are the quantum channels. Since the controlled quantum teleportation was adopted in this scheme, the intrinsic efficiency for particles in this scheme was 100% in principle.
Keywords: other subjects of the basic disciplines of information science and systems science; quantum network boding; butterfly network; controlled quantum teleprotation; superdense coding

Title: A protection system of electronic document security based on TCM and CPK

Authors: SU Xiaolong, HAN Zhen
PP: 1989-1995
Abstract: In this paper, in order to solve the safety problems of electronic signature in the electronic document, a protection system of electronic document was constructed based on trusted cryptography module (TCM) combined with the combined public key (CPK). A scheme of signing and verifying under trusted computing environment was designed. And as an example, the realization process of the scheme based on Word document level programming was elaborated for the Office Word.
Keywords: data security and computer security; trusted cryptography module; combined public key; electronic signature

Title: Research and implementation of cloud computing-based recommendation system

Authors: QIU Fei, YANG Peng, CHEN Guoqing
PP: 1982-1988
Abstract: Based on the analysis of the traditional recommendation algorithms, a cloud computing-based recommendation system (CCBRS) was proposed, which can take different recommendation strategies according to different requirements. Combined with CCBRS, several different recommendation algorithms were implemented and tested over the stand-alone environment, pseudo-distributed platform and distributed platform separately, and the conclusions drawn from the test results can be used for the choice of different recommendation strategies. The design and implementation of CCBRS provides valuable references for the research on recommendation system and the application of cloud computing technologies.
Keywords: computer application; recommendation system; recommendation strategy; cloud computing; Hadoop

Title: A three-dimensional k-coverage algorithm for wireless sensor networks

Authors: FANG Yu, ZUO Wei
PP: 1975-1981
Abstract: For ensuring robustness of wireless sensor networks (WSN) in three-dimensional space, this paper presented a k-coverage algorithm in large-scale three-dimensional wireless sensor networks and the target environment could be irregular to a certain extent. Firstly, the three-dimensional target environment was divided into the form of points according to a certain granularity. And then, the position of sensors in the processed space was determined with the iterative greedy heuristic method. The placement of a sensor node was completed after each iteration until the all granularity points could be k-covered. The simulation examples showed that this algorithm could solve the problems of large and irregular target area k-coverage quickly and efficiently. When comparing with the algorithm of random strategy, under the same coverage target, this algorithm had obvious advantages.
Keywords: computer application; wireless sensor network; three-dimensional space; k-coverage

Title: Research of role-mapping conflict detection methods based on IRBAC2000

Authors: LIU Yang, WEN Qiaoyan
PP: 1969-1974
Abstract: The interoperability role based access control 2000 (IRBAC2000) is a model which can achieve inter-domain access authorization through dynamic role mapping. The mapping conflicts may occur in the role mapping process, and so it can introduce security risks easily. On the basis of this model, this paper gave the corresponding detection algorithms in response to these conflicts, which reduced the security risks of inter-domain interoperability.
Keywords: computer application; cross-domain; role mapping; interoperability role based access control 2000; conflict detection

Title: CDN website acceleration-analysis and statistics of node server traffic

Authors: SONG Yingying, LI Dongxin
PP: 1963-1968
Abstract: Firstly, the problems of data transmission on the internet are described and thus the importance of content delivery network (CDN) technology application are suggested.Then, the detailed implementation process of the CDN-placing node servers in the network is described: it forms a layer of intelligent virtual network based on the existing internet, and can redirect users’ request to the latest service node in real time according to the network traffic, the connectivity in all node servers, load conditions, distance to users and response time, which can realize the faster and stable data transmission. The experiment results confirmed the efficiency of data traffic in node servers by using CDN technology.
Keywords: computer network; content delivery network; node server traffic; analysis and statistics

Title: A general focused crawler based on URL pattern path

Authors: LIU Minghai, ZHANG Ming, LIU Jinbao
PP: 1955-1962
Abstract: In this paper, a novel focused crawler which doesn’t require human intervention was presented based on URL pattern path. Different from existing clustering-based URL pattern construction approaches, a novel URL pattern tree construction approach was proposed. Firstly, a URL pattern tree was constructed based on URL syntax, and then the best URL pattern set was found using the famous model selection algorithm of minimum description length (MDL) in information theory. The experiments showed that, URL pattern path based focused crawler was able to collect all pages that match the samples given, and was applicative to most websites.
Keywords: computer network; focused crawler; URL pattern; minimum description length

Title: Access authentication implementation for vector network

Authors: HAN Na, LIANG Mangui
PP: 1948-1954
Abstract: This paper designs an object-oriented, layering and necessary access authentication protocol for this new communication network, and analysized how authentication system compatibled with vector network structure on design and implementation. The abstract model of authentication system was firstly described, then an authentication schemes based on 802.1x protocol for vector network was given, and the system process and communication mechanism were introduced in detail. Finally, the implementation of the programm with Linux kernel module was described briefly.
Keywords: computer network; vector network; access authentication; layering

Title: Routing protocol for socialized delay-tolerant networks based on cluster and location

Authors: WU Xiaojun, LU Chenguang, YUAN Sheng, ZENG Ming
PP: 1938-1947
Abstract: Aiming at improving the transfer efficiency for delay-tolerant network (DTN) with social feature, one mobility-assisted routing protocol, i.e. cluster and location based routing (CLR), was proposed. In the protocol, the fast moving nodes collected the historical meeting position information of the static nodes, calculated the distance of the static nodes, divided the static nodes into clusters, and acted as communication bridges for clusters. In cluster, communication was based on the greedy algorithm of distance. Simulation results showed that the strategies used in CLR could improve the performance of network and reduce the network load.
Keywords: computer architecture; delay tolerance network; community effect; historical meeting position information; clustering; network load

Title: Hierarchical cooperative data caching for wireless mesh networks

Authors: WU Weigang, HUANG Yifei, ZHU Zhenghao
PP: 1929-1937
Abstract: Wireless mesh network (WMN) is a promising technology for extending the Internet access to wider areas with high bandwidth. Cooperative caching is especially desirable for multi-hop wireless networks (including WMN) to achieve efficient data access. In this paper, the first cache cooperative caching system was designed for WMN environments. A hierarchical cache system architecture was proposed, where each mesh access point acted as the coordinator of the client nodes inside the cell. Cache placement was conducted in the cell level and the network level respectively. Accordingly, two different placement metrics were designed for different levels of placement decisions. Simulation results showed that this algorithm performs were much better than similar ones on both access delay and message cost.
Keywords: computer architecture; cooperative caching system; simulation; cache placement; wireless mess network

Title: Outdoor scene relighting based on image collections

Authors: WANG Wei, QI Yue, ZHANG Zifeng
PP: 1921-1928
Abstract: In this paper, an entire pipeline of outdoor scene relighting was introduced based on image collections. Initially, this paper proposed an isotropic base materials reflectance library, and presented a linear representation with isotropic base materials. And then, an efficient all-frequency environment rendering algorithm has implemented combined with triple wavelet product integral framework. At last, in the condition of known geometry, and based on triple wavelet product integral rendering framework, the bilinear optimization model about reflectance and environment lighting from the reflection equation could be derived. The linear model is solved iteratively, and the algorithm with parallel acceleration was optimized when implementing.
Keywords: computer graphics; environment illumination rendering; surface reflection property modeling; environment lighting modeling

Title: An operator for revising terminologies in DL-Lite

Authors: GAO Sibei, QI Guilin, DU Jianfeng, CHENG Xiaojun
PP: 1911-1920
Abstract: In this paper, a new operator for revising terminologies in DL-Lite ontologies was proposed. Firstly, the revision operator for terminologies was defined in terms of an incision function of minimal incoherence-preserving sub-TBox (MIPS), and it was proved to meet some desirable properties.Then an algorithm was given for revising terminologies in DL-Lite. In this algorithm, a method was provided for computing MIPS which was tailored for DL-Lite. This method utilizes the patterns which can result in the unsatisfiability of a concept in DL-Lite ontologies. Finally, it was confirmed that this algorithm implemented the revision operator.
Keywords: software theory; ontology revision; revision operator; minimal incoherence-preserving sub-TBox; DL-Lite

Title: Search-based program slicing and its application in program understanding

Authors: GONG Dandan, WANG Tiantian, SU Xiaohong, MA Peijun
PP: 1904-1910
Abstract: The experiment combined the search algorithm and program slicing technology using the divide and rule idea. In this paper, the all impossible sets of program slicings was firstly calculated using program slicing technology based on system dependence graph(SDG). Then, the optimal program slicing was searched from all impossible sets of program slicings using greedy algorithm genetic algorithm, and the effectiveness of this search method was validated using a heuristic algorithm. Finally, in order to assist programmer to comprehend the program, the program was separated based on the program slicing. The experiment showed that, this algorithm could effectively divided the program, thereby reduced the time and space expanses of the system.
Keywords: software theory; program understanding; system dependence graph; program slicing

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.

	Check out RSS, or use RSS reader to subscribe this item