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 133 papers published in subject: > since this site started.

Results per page:

133 Total, 14 Pages | << First < Previous 2 3 4 5 6 7 8 Next > Last >>

Select Subject

All (8830)

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:

133 Total, 14 Pages | << First < Previous 2 3 4 5 6 7 8 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. Weighted Extension of OMP for Discriminative Dictionary Learning
	Chen Naheng
	Computer Science and Technology 10 July 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Classification based on sparse representation has received a great deal of attention in recent years. In this paper, a weighted extension of OMP for classification is presented. It can be used in dictionary learning algorithms when dealing with classification issue. The proposed method adds a weighted parameter to the OMP algorithm; therefore discriminative power is enhanced and leads a faster convergence. This method is evaluated in the face recognition on Extended YaleB database and AR database. The result shows that the method achieves comparable recognition accuracy to the state-of-the-art result and runs 18 times faster in Extended YaleB and 30 times faster in AR.
	TO cite this article:Chen Naheng. Weighted Extension of OMP for Discriminative Dictionary Learning[OL].[10 July 2014] http://en.paper.edu.cn/en_releasepaper/content/4601431


	2. Applying Twin Support Vector Machines and Clustering to Intrusin Detection
	HE Jun,XU Guosheng
	Computer Science and Technology 08 May 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Intrusion detection system (IDS) is becoming a critical component of network security. However, the detection rates of many proposed intelligent intrusion detection models are still not high enough to be applied to real network security. This paper presents a novel intrusion detection model with twin support vector machines. In addition, a k-means clustering sampler is designed to avoid the possible loss of significant data when sampled randomly. The performance of the proposed IDS is evaluated with KDD'99 dataset and compare to other intrusion detection models. The results demonstrate the superiority of the proposed IDS.
	TO cite this article:HE Jun,XU Guosheng. Applying Twin Support Vector Machines and Clustering to Intrusin Detection[OL].[ 8 May 2014] http://en.paper.edu.cn/en_releasepaper/content/4595869

Saved Papers

Saved Papers


	3. Depth, ultimate period, and distribution of sequences of period $p^r-1$
	Zeng Min, Luo Yuan
	Computer Science and Technology 25 April 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, by investigating vector $emph{ extbf{s}}in F_q$ of length $n$ (or equivalent sequences of period $n$) with infinite third depth, and thecyclic-left-shift-difference operator emph{ extbf{E}}-emph{ extbf{1}} on $emph{ extbf{s}}$, an ultimate period sequence SpecialSequence is constructed. Some upper bounds on the ultimate period of SpecialSequence and a method to determine the least ultimate period are provided.Furthermore, distributions of vectors emph{ extbf{s}} with period $n=p^r-1$ ($r>0$), are described in terms of the least ultimate periods of their respective sequences SpecialSequence.
	TO cite this article:Zeng Min, Luo Yuan. Depth, ultimate period, and distribution of sequences of period $p^r-1$[OL].[25 April 2014] http://en.paper.edu.cn/en_releasepaper/content/4593149


	4. Task scheduling algorithm based on greedy strategy in cloud computing
	ZHOU Zhou,HU Zhigang
	Computer Science and Technology 18 March 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In view of Min-Min algorithm prefers scheduling small tasks and Max-Min algorithm prefers scheduling big tasks led to problem of load imbalance in cloud computing, a new algorithm named Min-Max is proposed. Min-Max makes good use of time for greedy strategy, small tasks and big tasks are put together for scheduling in order to solve the problem of load imbalance. Experimental results show that the Min-Max improves the utilization rate of entire system and saves 9% overall execution time compared with Min-Min. As compared with Max-Min, Min-Max improves the utilization rate of entire system, the total completion time and average response time are saved 7% and 9% respectively.
	TO cite this article:ZHOU Zhou,HU Zhigang. Task scheduling algorithm based on greedy strategy in cloud computing[OL].[18 March 2014] http://en.paper.edu.cn/en_releasepaper/content/4590564


	5. Attacker's Cluster in Web Log Mining
	Lv Jingshan,Wen Qiaoyan,Liu Hong
	Computer Science and Technology 25 February 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:According to analysis of web server logs attack events and security holes will be found, meanwhile attackers will also be discovered on the basis of source IP ad-dresses. To analyze logs and condense so many events, in this paper, attacker's similarity methods and the clus-ter algorithm are presented. After the definition of cha-racteristic matrix and the feature vector, an attacker clustering algorithm is devised. Each attacker has an feature vector, because of this the similarity of each attacker can be computed, user's clustering will be done according to their similarity. In addition effectiveness of this proposed algorithm will be proved by experiments.
	TO cite this article:Lv Jingshan,Wen Qiaoyan,Liu Hong. Attacker's Cluster in Web Log Mining[OL].[25 February 2014] http://en.paper.edu.cn/en_releasepaper/content/4586778


	6. On the super-edge connectivity of strong product of graphs
	LV Min
	Computer Science and Technology 24 February 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:For a connected graph G, the super edge-connectivity is the minimum cardinality of an edge-cut S in G such that every component of G-S contains at least two vertices. It is a more refined index than the edge-connectivity. This paper deals with the super edge-connectivity of strong product graphs and gives a sufficient condition for it to be maximally super connected.
	TO cite this article:LV Min. On the super-edge connectivity of strong product of graphs[OL].[24 February 2014] http://en.paper.edu.cn/en_releasepaper/content/4583009


	7. Synthesis Algorithms of Models of Hybrid Systems
	ZHANG Haibin
	Computer Science and Technology 01 February 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, a computational model for hybrid systems is introduced. Based on this model, a partial order relation of hybrid systems is given and a lattice of hybrid systems is formalized. Armed with these notations, synthesis of hybrid systems is discussed. The synthesis can be seen as the operation of solving the least upper bound of members of the lattice.
	TO cite this article:ZHANG Haibin. Synthesis Algorithms of Models of Hybrid Systems[OL].[ 1 February 2014] http://en.paper.edu.cn/en_releasepaper/content/4583958


	8. Model Checking Hybrid Systems Within Hybrid Temporal Logic
	ZHANG Haibin
	Computer Science and Technology 28 January 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, we deal with the model checking issue for hybrid systems within hybrid temporal logic. We solve the model checking problem for timed automata by translating it to the same issue for interval temporal logic. Then we prove that the model checking issue of multirate automata can be translated to that of timed automata. Finally, we give an approach for checking the linear propositional property of compact rectangular automata.
	TO cite this article:ZHANG Haibin. Model Checking Hybrid Systems Within Hybrid Temporal Logic[OL].[28 January 2014] http://en.paper.edu.cn/en_releasepaper/content/4583955


	9. A novel proxy signature scheme from factorization
	Yu yong
	Computer Science and Technology 15 January 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Proxy signature is a useful cryptographic primitive for delegating the signing powers and has been suggested for use in many real world applications. The existing proxy signature scheme from factorization assumption are either insecure or inefficient. In this paper, we propose a novel, efficient and provably secure proxy signature scheme from factorization. Our construction makes use a factorization based key-exposure free chameleon hash function in the delegation phase and the proxy signer needs only to find a collision to a chameleon hash value to generate a valid proxy signature. As a result, our scheme is highly efficient in terms of the computation of the proxy signer. We also provide a formal security proof by classifying the adversaries into three categories. Comparisons demonstrate that the new scheme outperforms the known ones in terms of security, computational efficiency and the length of the public key.
	TO cite this article:Yu yong. A novel proxy signature scheme from factorization[OL].[15 January 2014] http://en.paper.edu.cn/en_releasepaper/content/4579313


	10. Malware Process Detecting Via Hypervisor
	Shengdong Chen,Yang Zhang
	Computer Science and Technology 14 January 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Recent malware processes are armed with stealthy techniques to detect, subvert malware detection facilities of the victim. Traditional host-based detection tools execute inside the very hosts they are protecting, which makes them vulnerable to deceive and subvert. To address this limitation and improve the effectiveness and accuracy of detection and the ability of tamper resistance, a VMM-based hidden process detection system is designed and implemented. The system is placed outside the protected virtual machine, using virtual machine introspection mechanism to inspect the low-level state of the protected virtual machine, and then reconstructs the guest OS data structures by guest view casting technique. Based on view comparison detection, the system indentifies the missing of the critical processes and the target hidden process. What's more, this system provides process management operations such as terminate and restart. User can configure the corresponding response mechanism with configuration files.
	TO cite this article:Shengdong Chen,Yang Zhang. Malware Process Detecting Via Hypervisor[OL].[14 January 2014] http://en.paper.edu.cn/en_releasepaper/content/4578252

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