Chinese︱Feedback︱Save this page

Login︱Register

• Elaborating Academic Views 　　　　 • Exchanging Innovative Ideas
• Protecting Intellectual Properties 　　• Fast Sharing Science Papers

Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China

Home > Papers > Basic-Subject-of-Computer-science-and-technology

There are 36 papers published in subject: > since this site started.

Results per page:

36 Total, 4 Pages | << First < Previous 1 2 3 4 Next > Last >>

Select Subject

All (8831)

Agronomy (158)

Animal Husbandry,... (64)

Aquatic Science (16)

Astronomy (36)

Aviation (22)

Basic Medicine (184)

Biology (504)

Chemical Engineering (103)

Chemistry (635)

Civil and Archite... (105)

Clinical Medicine (236)

Computer Science ... (924)

Dynamic and Elect... (121)

Earth Science (119)

Economics (67)

Education (31)

Electrics, Commun... (927)

Energy Science an... (67)

Engineering and T... (15)

Environmental Sci... (140)

Food Science and ... (63)

Forestry (36)

Hydraulic Enginee... (40)

Mechanics (240)

Metallurgical Eng... (32)

Mine Engineering ... (38)

Nuclear Science a... (21)

Pharmacy (98)

Physics (920)

Preventive Medici... (37)

Psychology (20)

Security Science ... (17)

Sports Science (6)

Surveying and Map... (15)

Textile Science a... (16)

Traditional Chine... (56)

Transportation En... (57)

Third-level Subject

Algorithm Theory(22)
Automata Theory(1)
Computability Theory(4)
Computer Reliability Theory(4)
Data Security and Compute...(76)
Data Structure(0)
Other Subjects of Basic S...(13)

Rank

Results per page:

36 Total, 4 Pages | << First < Previous 1 2 3 4 Next > Last >>

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.


	1. An Architecture-Centric Approach for Security Technical Debt Quantification
	Yang Jun,Rami Bahsoon,Liu Jiqiang
	Computer Science and Technology 30 March 2016
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Security managers and architects often have trouble in making decision among various security technologies when the budget is limited. At this time, a compromise between effective security technologies and limited budget may hurt the system's long-term health and introduce technology debt. This paper presents an architecture-centric cost-benefit method for quantifying technology debt caused by different security deployment solutions, in order to help security managers to manage technology debts and make decisions. The proposed method is an extension of the Security Attribute Evaluation Method (SAEM) to reason about the debt in secure architectures. A case study is adopted to exemplify the process of method. The result indicates that the method provides an angle of technology debt beyond the plain SAEM method to help security manager make choice and manage long-term benefit and cost.
	TO cite this article:Yang Jun,Rami Bahsoon,Liu Jiqiang. An Architecture-Centric Approach for Security Technical Debt Quantification[OL].[30 March 2016] http://en.paper.edu.cn/en_releasepaper/content/4681192


	2. A New Efficient Request-Based Comparable Encryption Scheme
	CHEN Peng, YE Jun, CHEN Xiao-Feng
	Computer Science and Technology 30 December 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Privacy-preserving comparisons over encrypted entries of a database is a hot topic in academic research. Although order preserving encryption (OPE) basically achieves this target, when all the numbers in a certain scope are encrypted by an OPE, an attacker can retrieve the original numbers from their order. Furukawa puts forth a novel digit number encryption method called request-based comparable encryption (comparable encryption for short). but the disadvantages is that the token and cipher generations are inefficient. In this paper, we propose a new scheme based on comparable encryption by using sliding window method, which performs better than original comparable encryption both in storage and in computation workload. In our scheme, the users can obtain a trade-off between security and efficiency through adaptively setting the window size according to their real scenario.
	TO cite this article:CHEN Peng, YE Jun, CHEN Xiao-Feng. A New Efficient Request-Based Comparable Encryption Scheme[OL].[30 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4626112

Saved Papers

Saved Papers


	3. Solving the Fixed Spectrum Frequency Assignment Problem via Iterated Tabu Search
	Zhipeng L"u, Zhaojing Luo, Tao Ye
	Computer Science and Technology 03 December 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper presents an Iterated Tabu Search (ITS) algorithm for solving the fixed spectrum frequency assignment problem (FS-FAP), which integrates several distinguishing features, such as a novel dynamic tabu tenure mechanism and three kinds of perturbation operators. Computational results assessed on two sets of 47 public benchmark instances demonstrate the efficacy of the proposed ITS algorithm in terms of both solution quality and efficiency. Particularly, for the first set, ITS is able to find new best objective values for 16 instances while matching the previous best objective values for 21 ones, and for the COST 259 benchmark set, compared with reference algorithm, ITS obtains 2 better results in a reasonable time. Furthermore, several important ingredients of the ITS algorithm are also analyzed.
	TO cite this article:Zhipeng L"u, Zhaojing Luo, Tao Ye. Solving the Fixed Spectrum Frequency Assignment Problem via Iterated Tabu Search[OL].[ 3 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4619809


	4. ModuleGuard: A Gatekeeper for Dynamic Module Loading Against Malware
	Fu Jianming,Ding Shuang,Peng Bichen
	Computer Science and Technology 13 April 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In the open environment such as Internet, end-user host or machine is easily compromised and infected malicious code or malware due to vulnerabilities or user's mindlessness. This infection procedure may include a bootstrap to plant and load malware. Some researchers focus on detection this bootstrap, which locates at stack or heap, and others may concentrate on the detection malware at planting stage according to predefined patterns or signatures. The former detection depends on the structure and semantics of bootstrap, and may be intractable because code and data may be mixed in an input of normal program. Moreover, the later detection has the limitation to handle unknown malware. We analyze the attack steps of malware, and focus on the malware loading. Our assumption is that a malware contains no less than one module, so monitoring module loading is indispensable to defeat malware. Moreover, we design security policies, and employ these policies when a module is loaded by operating system. These policies depend on properties of module, the connection to created modules, and the link to user intention. The properties of module and this connection can improve the accuracy of malware detection. User intention can be helpful to handle unknown module, and enhances the flexibility of policy. Finally, ModuleGuard, a gatekeeper for dynamic module loading against malware, has been designed and implemented, which is integrated these security policies. Our experimental results have shown the feasibility and effectiveness of our method.
	TO cite this article:Fu Jianming,Ding Shuang,Peng Bichen. ModuleGuard: A Gatekeeper for Dynamic Module Loading Against Malware[OL].[13 April 2013] http://en.paper.edu.cn/en_releasepaper/content/4537813


	5. Matrix Embedding Based on Trellis Structure of Linear Block Codes
	LIU Weiwei,LIU Guangjie
	Computer Science and Technology 14 March 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, a general embedding framework based on syndrome BCJR trellis of binary linear block codes is proposed. It is constructed from the parity-check matrix and embedding message directly, the Viterbi algorithm can be implemented on this trellis to find the stego object which minimizes the embedding impact.The parity-check matrix can be constructed by the relative payload and it can work on arbitrary distortion profile. Finally, we give the experimental results for the proposed scheme with randomly constructed codes and typical linear block codes.
	TO cite this article:LIU Weiwei,LIU Guangjie. Matrix Embedding Based on Trellis Structure of Linear Block Codes[OL].[14 March 2013] http://en.paper.edu.cn/en_releasepaper/content/4527933


	6. Truthful Mechanisms for Randomized Rounding Approximation Schema
	WU Jing,BU Tianming
	Computer Science and Technology 26 February 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Algorithmic mechanism design, as an important research area in the theoretical computer science in recent years, is not only to give an efficient algorithm for the given problem, but also to prevent the rational agents from manipulating the input date for the problem. For many NP-hard problems, there have been a lot of good approximation algorithms. So, it’s a new task for us to design truthful mechanisms with the same approximation ratios for these NP-hard problems. This paper focuses on a large family of approximation algorithms based on the technique of randomized rounding which combines the techniques of randomized algorithms and linear/semi-definite programming. By giving an exact characterization of the randomized truthful mechanisms, the paper presents a general framework to efficiently transfer the family of approximation algorithms to the truthful mechanisms without a loss of approximation ratio.
	TO cite this article:WU Jing,BU Tianming. Truthful Mechanisms for Randomized Rounding Approximation Schema[OL].[26 February 2013] http://en.paper.edu.cn/en_releasepaper/content/4523793


	7. The Algorithm for the Special Case of Two-sided SF-MNSA Problem
	LIU Nan,ZHU Da-Ming
	Computer Science and Technology 16 January 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Scaffold filling is a new combinatorial optimization problem in genome sequencing and can improve the integrity of the sequencing results.The two-sided Scaffold Filling to Maximize the Number of String Adjacencies(SF-MNSA) problem can be described as: given two incomplete gene sequences $A$ and $B$, respectively fill the missing genes into $A$ and $B$ such that the number of adjacencies between the resulting sequences $A'$ and $B'$ is maximized.The two-sided scaffold filling problem is NP-complete for genomes with duplicated genes and there is no effective approximation algorithm.In this paper, a new version problem is proposed that symbol # is added to each endpoint of each input sequence for any instance of two-sided SF-MNSA problem and a polynomial algorithm for the special instance of this new version problem is designed and proved.
	TO cite this article:LIU Nan,ZHU Da-Ming. The Algorithm for the Special Case of Two-sided SF-MNSA Problem[OL].[16 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4512994


	8. Secure Cloud Storage with Data De-duplication
	Wan Lei,Wang Chunlu,Liu Chuanyi
	Computer Science and Technology 15 June 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:reducing the amount of data need to be transferred, stored, and managed becomes a crucial for cloud storage. On the other hand, as user data are stored and processed by outsourced cloud provider, encryption becomes a necessary before updating data into the cloud. However, the above two goals are greatly opposed to each other. In order to solve the above conflict, a policy-based de-duplication proxy scheme is proposed in this paper. It suggests a policy-based de-duplication proxy scheme to enable different trust relations among cloud storage components, de-duplication related components and different security requirements. Further proposes a key management mechanism to access and decrypt the shared de-duplicated data chunks based on Proxy Re-encryption algorithms. This paper finally analyses the security of the scheme.
	TO cite this article:Wan Lei,Wang Chunlu,Liu Chuanyi. Secure Cloud Storage with Data De-duplication[OL].[15 June 2012] http://en.paper.edu.cn/en_releasepaper/content/4482237


	9. Deniable Message Transmission Authenticator Based on Weak Signature Schemes
	TianHaibo
	Computer Science and Technology 10 April 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper shows how to use signature schemes for deniableauthentication. Deniable authentication means that a messagereceiver R, although received a message m from a sender S,cannot convince a third party that the sender S has sent R themessage m. Obviously, signature schemes secure againstexistential forgery are unsuitable for such a deniabilityproperty. However, if signature schemes are just secure againstselective forgery, we can construct a deniable authenticationprotocol. The protocol is presented in the extension framework ofRaimondo et al. as a deniable message transmission (MT)authenticator.
	TO cite this article:TianHaibo. Deniable Message Transmission Authenticator Based on Weak Signature Schemes[OL].[10 April 2012] http://en.paper.edu.cn/en_releasepaper/content/4474877


	10. VECTOR-MATRIX MULTIPLICATION IN TERNARY OPTICAL COMPUTER
	JIN Yi,WANG Xianchao,PENG Junjie,SHEN Zhangyi,OUYANG Shan
	Computer Science and Technology 21 February 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper proposes a new means to complete the optical vectormatrix multiplication (OVMM). The OVMM is implemented on a novel optical computing architecture, ternary optical computer (TOC) by using modified signed-digit (MSD) number system. In addition, this study realizes optical addition in three steps, independent of the length of the operands, by four transformations in MSD, and discuses the multiplication of two MSD numbers in detail. A preliminary experimentation about the OVMM is performed on TOC. It illustrates the proposed method for OVMM is feasible and correct.
	TO cite this article:JIN Yi,WANG Xianchao,PENG Junjie, et al. VECTOR-MATRIX MULTIPLICATION IN TERNARY OPTICAL COMPUTER[OL].[21 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4467258

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